[{"type":"conference","abstract":[{"text":"Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5959","ddc":["000"],"title":"Keynote: The first-order logic of signals","status":"public","file":[{"file_size":338006,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2018_EMSOFT_Bakhirkin.pdf","checksum":"234a33ad9055b3458fcdda6af251b33a","date_created":"2020-05-14T16:01:29Z","date_updated":"2020-07-14T12:47:13Z","relation":"main_file","file_id":"7839"}],"oa_version":"Published Version","scopus_import":"1","day":"30","article_processing_charge":"No","has_accepted_license":"1","publication":"2018 International Conference on Embedded Software","citation":{"chicago":"Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In 2018 International Conference on Embedded Software, 1–10. IEEE, 2018. https://doi.org/10.1109/emsoft.2018.8537203.","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","mla":"Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10, doi:10.1109/emsoft.2018.8537203.","apa":"Bakhirkin, A., Ferrere, T., Henzinger, T. A., & Nickovicl, D. (2018). Keynote: The first-order logic of signals. In 2018 International Conference on Embedded Software (pp. 1–10). Turin, Italy: IEEE. https://doi.org/10.1109/emsoft.2018.8537203","ieee":"A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in 2018 International Conference on Embedded Software, Turin, Italy, 2018, pp. 1–10.","ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: International Conference on Embedded Software, 1–10.","ama":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: 2018 International Conference on Embedded Software. IEEE; 2018:1-10. doi:10.1109/emsoft.2018.8537203"},"page":"1-10","date_published":"2018-09-30T00:00:00Z","file_date_updated":"2020-07-14T12:47:13Z","year":"2018","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"IEEE","author":[{"last_name":"Bakhirkin","first_name":"Alexey","full_name":"Bakhirkin, Alexey"},{"full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"last_name":"Nickovicl","first_name":"Deian","full_name":"Nickovicl, Deian"}],"date_created":"2019-02-13T09:19:28Z","date_updated":"2023-09-19T10:41:29Z","month":"09","publication_identifier":{"isbn":["9781538655603"]},"external_id":{"isi":["000492828500005"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"conference":{"name":"EMSOFT: International Conference on Embedded Software","end_date":"2018-10-05","location":"Turin, Italy","start_date":"2018-09-30"},"doi":"10.1109/emsoft.2018.8537203","language":[{"iso":"eng"}]},{"author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"first_name":"Christopher","last_name":"De Sa","full_name":"De Sa, Christopher"},{"full_name":"Konstantinov, Nikola H","id":"4B9D76E4-F248-11E8-B48F-1D18A9856A87","first_name":"Nikola H","last_name":"Konstantinov"}],"date_updated":"2023-09-19T10:42:53Z","date_created":"2019-02-13T09:58:58Z","year":"2018","publisher":"ACM Press","department":[{"_id":"DaAl"}],"publication_status":"published","doi":"10.1145/3212734.3212763","conference":{"name":"PODC: Principles of Distributed Computing","start_date":"2018-07-23","location":"Egham, United Kingdom","end_date":"2018-07-27"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08841"}],"oa":1,"external_id":{"isi":["000458186900022"],"arxiv":["1803.08841"]},"isi":1,"quality_controlled":"1","publication_identifier":{"isbn":["9781450357951"]},"month":"07","oa_version":"Preprint","_id":"5962","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"The convergence of stochastic gradient descent in asynchronous shared memory","status":"public","abstract":[{"lang":"eng","text":"Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning, representing the optimization backbone for training several classic models, from regression to neural networks. Given the recent practical focus on distributed machine learning, significant work has been dedicated to the convergence properties of this algorithm under the inconsistent and noisy updates arising from execution in a distributed environment. However, surprisingly, the convergence properties of this classic algorithm in the standard shared-memory model are still not well-understood. In this work, we address this gap, and provide new convergence bounds for lock-free concurrent stochastic gradient descent, executing in the classic asynchronous shared memory model, against a strong adaptive adversary. Our results give improved upper and lower bounds on the \"price of asynchrony'' when executing the fundamental SGD algorithm in a concurrent setting. They show that this classic optimization tool can converge faster and with a wider range of parameters than previously known under asynchronous iterations. At the same time, we exhibit a fundamental trade-off between the maximum delay in the system and the rate at which SGD can converge, which governs the set of parameters under which this algorithm can still work efficiently."}],"type":"conference","date_published":"2018-07-23T00:00:00Z","citation":{"ama":"Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:169-178. doi:10.1145/3212734.3212763","ista":"Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 169–178.","ieee":"D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic gradient descent in asynchronous shared memory,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 169–178.","apa":"Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence of stochastic gradient descent in asynchronous shared memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 169–178). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212763","mla":"Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763.","short":"D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–178.","chicago":"Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763."},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","page":"169-178","article_processing_charge":"No","day":"23","scopus_import":"1"},{"type":"journal_article","issue":"149","abstract":[{"lang":"eng","text":"A major problem for evolutionary theory is understanding the so-called open-ended nature of evolutionary change, from its definition to its origins. Open-ended evolution (OEE) refers to the unbounded increase in complexity that seems to characterize evolution on multiple scales. This property seems to be a characteristic feature of biological and technological evolution and is strongly tied to the generative potential associated with combinatorics, which allows the system to grow and expand their available state spaces. Interestingly, many complex systems presumably displaying OEE, from language to proteins, share a common statistical property: the presence of Zipf's Law. Given an inventory of basic items (such as words or protein domains) required to build more complex structures (sentences or proteins) Zipf's Law tells us that most of these elements are rare whereas a few of them are extremely common. Using algorithmic information theory, in this paper we provide a fundamental definition for open-endedness, which can be understood as postulates. Its statistical counterpart, based on standard Shannon information theory, has the structure of a variational problem which is shown to lead to Zipf's Law as the expected consequence of an evolutionary process displaying OEE. We further explore the problem of information conservation through an OEE process and we conclude that statistical information (standard Shannon information) is not conserved, resulting in the paradoxical situation in which the increase of information content has the effect of erasing itself. We prove that this paradox is solved if we consider non-statistical forms of information. This last result implies that standard information theory may not be a suitable theoretical framework to explore the persistence and increase of the information content in OEE systems."}],"_id":"5860","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 15","status":"public","title":"Zipf's Law, unbounded complexity and open-ended evolution","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"12","citation":{"chicago":"Corominas-Murtra, Bernat, Luís F. Seoane, and Ricard Solé. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0395.","mla":"Corominas-Murtra, Bernat, et al. “Zipf’s Law, Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180395, Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0395.","short":"B. Corominas-Murtra, L.F. Seoane, R. Solé, Journal of the Royal Society Interface 15 (2018).","ista":"Corominas-Murtra B, Seoane LF, Solé R. 2018. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 15(149), 20180395.","apa":"Corominas-Murtra, B., Seoane, L. F., & Solé, R. (2018). Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0395","ieee":"B. Corominas-Murtra, L. F. Seoane, and R. Solé, “Zipf’s Law, unbounded complexity and open-ended evolution,” Journal of the Royal Society Interface, vol. 15, no. 149. Royal Society Publishing, 2018.","ama":"Corominas-Murtra B, Seoane LF, Solé R. Zipf’s Law, unbounded complexity and open-ended evolution. Journal of the Royal Society Interface. 2018;15(149). doi:10.1098/rsif.2018.0395"},"publication":"Journal of the Royal Society Interface","date_published":"2018-12-12T00:00:00Z","article_number":"20180395","year":"2018","department":[{"_id":"EdHa"}],"publisher":"Royal Society Publishing","publication_status":"published","author":[{"full_name":"Corominas-Murtra, Bernat","first_name":"Bernat","last_name":"Corominas-Murtra","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9806-5643"},{"full_name":"Seoane, Luís F.","last_name":"Seoane","first_name":"Luís F."},{"last_name":"Solé","first_name":"Ricard","full_name":"Solé, Ricard"}],"volume":15,"date_created":"2019-01-20T22:59:19Z","date_updated":"2023-09-19T10:40:38Z","publication_identifier":{"issn":["17425689"]},"month":"12","external_id":{"isi":["000456783800002"],"arxiv":["1612.01605"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1612.01605","open_access":"1"}],"isi":1,"quality_controlled":"1","doi":"10.1098/rsif.2018.0395","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"The area of machine learning has made considerable progress over the past decade, enabled by the widespread availability of large datasets, as well as by improved algorithms and models. Given the large computational demands of machine learning workloads, parallelism, implemented either through single-node concurrency or through multi-node distribution, has been a third key ingredient to advances in machine learning.\r\nThe goal of this tutorial is to provide the audience with an overview of standard distribution techniques in machine learning, with an eye towards the intriguing trade-offs between synchronization and communication costs of distributed machine learning algorithms, on the one hand, and their convergence, on the other.The tutorial will focus on parallelization strategies for the fundamental stochastic gradient descent (SGD) algorithm, which is a key tool when training machine learning models, from classical instances such as linear regression, to state-of-the-art neural network architectures.\r\nThe tutorial will describe the guarantees provided by this algorithm in the sequential case, and then move on to cover both shared-memory and message-passing parallelization strategies, together with the guarantees they provide, and corresponding trade-offs. The presentation will conclude with a broad overview of ongoing research in distributed and concurrent machine learning. The tutorial will assume no prior knowledge beyond familiarity with basic concepts in algebra and analysis.\r\n"}],"type":"conference","date_updated":"2023-09-19T10:42:28Z","date_created":"2019-02-13T09:48:55Z","oa_version":"None","author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"publication_status":"published","status":"public","title":"A brief tutorial on distributed and concurrent machine learning","publisher":"ACM Press","department":[{"_id":"DaAl"}],"_id":"5961","year":"2018","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"07","day":"27","article_processing_charge":"No","publication_identifier":{"isbn":["9781450357951"]},"scopus_import":"1","language":[{"iso":"eng"}],"conference":{"end_date":"2018-07-27","location":"Egham, United Kingdom","start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing"},"date_published":"2018-07-27T00:00:00Z","doi":"10.1145/3212734.3212798","quality_controlled":"1","isi":1,"page":"487-488","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","external_id":{"isi":["000458186900063"]},"citation":{"ama":"Alistarh D-A. A brief tutorial on distributed and concurrent machine learning. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:487-488. doi:10.1145/3212734.3212798","ista":"Alistarh D-A. 2018. A brief tutorial on distributed and concurrent machine learning. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 487–488.","apa":"Alistarh, D.-A. (2018). A brief tutorial on distributed and concurrent machine learning. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 487–488). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212798","ieee":"D.-A. Alistarh, “A brief tutorial on distributed and concurrent machine learning,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 487–488.","mla":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–88, doi:10.1145/3212734.3212798.","short":"D.-A. Alistarh, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 487–488.","chicago":"Alistarh, Dan-Adrian. “A Brief Tutorial on Distributed and Concurrent Machine Learning.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 487–88. ACM Press, 2018. https://doi.org/10.1145/3212734.3212798."}},{"doi":"10.1177/0278364918808367","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1712.01341"],"isi":["000456881100004"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.01341"}],"quality_controlled":"1","isi":1,"publication_identifier":{"issn":["0278-3649"],"eissn":["1741-3176"]},"month":"10","author":[{"full_name":"Rohou, Simon","first_name":"Simon","last_name":"Rohou"},{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter","orcid":"0000-0001-8878-8397","id":"473294AE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Aubry, Clément","last_name":"Aubry","first_name":"Clément"},{"last_name":"Jaulin","first_name":"Luc","full_name":"Jaulin, Luc"}],"volume":37,"date_created":"2019-02-13T09:36:20Z","date_updated":"2023-09-19T10:41:59Z","year":"2018","department":[{"_id":"UlWa"}],"publisher":"SAGE Publications","publication_status":"published","date_published":"2018-10-24T00:00:00Z","citation":{"short":"S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.","mla":"Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367.","chicago":"Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367.","ama":"Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516. doi:10.1177/0278364918808367","ieee":"S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops in robot trajectories,” The International Journal of Robotics Research, vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.","apa":"Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. SAGE Publications. https://doi.org/10.1177/0278364918808367","ista":"Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops in robot trajectories. The International Journal of Robotics Research. 37(12), 1500–1516."},"publication":"The International Journal of Robotics Research","page":"1500-1516","article_processing_charge":"No","day":"24","scopus_import":"1","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5960","intvolume":" 37","title":"Proving the existence of loops in robot trajectories","status":"public","issue":"12","abstract":[{"text":"In this paper we present a reliable method to verify the existence of loops along the uncertain trajectory of a robot, based on proprioceptive measurements only, within a bounded-error context. The loop closure detection is one of the key points in simultaneous localization and mapping (SLAM) methods, especially in homogeneous environments with difficult scenes recognitions. The proposed approach is generic and could be coupled with conventional SLAM algorithms to reliably reduce their computing burden, thus improving the localization and mapping processes in the most challenging environments such as unexplored underwater extents. To prove that a robot performed a loop whatever the uncertainties in its evolution, we employ the notion of topological degree that originates in the field of differential topology. We show that a verification tool based on the topological degree is an optimal method for proving robot loops. This is demonstrated both on datasets from real missions involving autonomous underwater vehicles and by a mathematical discussion.","lang":"eng"}],"type":"journal_article"},{"quality_controlled":"1","isi":1,"external_id":{"arxiv":["1808.04155"],"isi":["000458186900048"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1808.04155"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3212734.3212756","conference":{"name":"PODC: Principles of Distributed Computing","end_date":"2018-07-27","location":"Egham, United Kingdom","start_date":"2018-07-23"},"publication_identifier":{"isbn":["9781450357951"]},"month":"07","department":[{"_id":"DaAl"}],"publisher":"ACM Press","publication_status":"published","year":"2018","date_updated":"2023-09-19T10:43:21Z","date_created":"2019-02-13T10:03:25Z","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Brown, Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","last_name":"Brown","first_name":"Trevor A"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"}],"page":"377-386","citation":{"mla":"Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–386.","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze. “Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.","ama":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:377-386. doi:10.1145/3212734.3212756","ista":"Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 377–386.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers can efficiently parallelize iterative algorithms,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 377–386.","apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed schedulers can efficiently parallelize iterative algorithms. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 377–386). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212756"},"publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","date_published":"2018-07-23T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"23","status":"public","title":"Relaxed schedulers can efficiently parallelize iterative algorithms","_id":"5963","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","type":"conference","abstract":[{"text":"There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure is now well understood, and scheduling techniques have been developed to exploit this shallow dependence structure for efficient parallel implementations. A related, applied research strand has studied methods by which certain iterative task-based algorithms can be efficiently parallelized via relaxed concurrent priority schedulers. These allow for high concurrency when inserting and removing tasks, at the cost of executing superfluous work due to the relaxed semantics of the scheduler. In this work, we take a step towards unifying these two research directions, by showing that there exists a family of relaxed priority schedulers that can efficiently and deterministically execute classic iterative algorithms such as greedy maximal independent set (MIS) and matching. Our primary result shows that, given a randomized scheduler with an expected relaxation factor of k in terms of the maximum allowed priority inversions on a task, and any graph on n vertices, the scheduler is able to execute greedy MIS with only an additive factor of \\poly(k) expected additional iterations compared to an exact (but not scalable) scheduler. This counter-intuitive result demonstrates that the overhead of relaxation when computing MIS is not dependent on the input size or structure of the input graph. Experimental results show that this overhead can be clearly offset by the gain in performance due to the highly scalable scheduler. In sum, we present an efficient method to deterministically parallelize iterative sequential algorithms, with provable runtime guarantees in terms of the number of executed tasks to completion.","lang":"eng"}]},{"oa_version":"Preprint","_id":"5965","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"Distributionally linearizable data structures","abstract":[{"text":"Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications (\\citeNguyen13, gonzalez2012powergraph ). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue~\\citeMQ pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting~\\citeAKLN17. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps.","lang":"eng"}],"type":"conference","date_published":"2018-07-16T00:00:00Z","citation":{"ama":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable data structures. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411","ista":"Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally linearizable data structures. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 133–142.","ieee":"D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.","apa":"Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G. (2018). Distributionally linearizable data structures. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 133–142). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210411","mla":"Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411.","short":"D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 133–142.","chicago":"Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411."},"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","page":"133-142","article_processing_charge":"No","day":"16","scopus_import":"1","related_material":{"record":[{"id":"10429","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"first_name":"Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Trevor A"},{"last_name":"Kopinsky","first_name":"Justin","full_name":"Kopinsky, Justin"},{"first_name":"Jerry Z.","last_name":"Li","full_name":"Li, Jerry Z."},{"first_name":"Giorgi","last_name":"Nadiradze","full_name":"Nadiradze, Giorgi"}],"date_updated":"2023-09-19T10:44:13Z","date_created":"2019-02-13T10:17:19Z","year":"2018","publisher":"ACM Press","department":[{"_id":"DaAl"}],"publication_status":"published","doi":"10.1145/3210377.3210411","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2018-07-18","start_date":"2018-07-16","location":"Vienna, Austria"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.01018","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1804.01018"],"isi":["000545269600016"]},"quality_controlled":"1","isi":1,"publication_identifier":{"isbn":["9781450357999"]},"month":"07"},{"abstract":[{"text":"The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock or on a finite memory is worthless. The long-standing natural open problem has been whether every strategy that depends just on the clock and a finite memory is worthless. We prove that there is such a strategy that is ε-optimal. In fact, we show that just two states of memory are sufficient.\r\n","lang":"eng"}],"type":"conference","file":[{"file_name":"2018_EC18_Hansen.pdf","access_level":"open_access","creator":"dernst","file_size":302539,"content_type":"application/pdf","file_id":"7054","relation":"main_file","date_created":"2019-11-19T08:24:24Z","date_updated":"2020-07-14T12:47:14Z","checksum":"bb52683e349cfd864f4769a8f38f2798"}],"oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5967","ddc":["000"],"status":"public","title":"The Big Match with a clock and a bit of memory","day":"18","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2018-06-18T00:00:00Z","publication":"Proceedings of the 2018 ACM Conference on Economics and Computation - EC '18","citation":{"ista":"Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. EC: Conference on Economics and Computation, 149–150.","ieee":"K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.","apa":"Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press. https://doi.org/10.1145/3219166.3219198","ama":"Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198","chicago":"Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.","mla":"Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.","short":"K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150."},"page":"149-150","file_date_updated":"2020-07-14T12:47:14Z","author":[{"last_name":"Hansen","first_name":"Kristoffer Arnsfelt","full_name":"Hansen, Kristoffer Arnsfelt"},{"full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Neyman","first_name":"Abraham","full_name":"Neyman, Abraham"}],"date_updated":"2023-09-19T10:45:15Z","date_created":"2019-02-13T10:31:41Z","year":"2018","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"ACM Press","month":"06","publication_identifier":{"isbn":["9781450358293"]},"conference":{"name":"EC: Conference on Economics and Computation","end_date":"2018-06-22","start_date":"2018-06-18","location":"Ithaca, NY, United States"},"doi":"10.1145/3219166.3219198","language":[{"iso":"eng"}],"external_id":{"isi":["000492755100020"]},"oa":1,"quality_controlled":"1","isi":1},{"abstract":[{"text":"The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts is to immediately abort one of the transactions, some practical systems consider the alternative of delaying conflict resolution for a short interval, which may allow one of the transactions to commit. The challenge in the transactional conflict problem is to choose the optimal length of this delay interval so as to minimize the overall running time penalty for the conflicting transactions. In this paper, we propose a family of optimal online algorithms for the transactional conflict problem. Specifically, we consider variants of this problem which arise in different implementations of transactional systems, namely \"requestor wins'' and \"requestor aborts'' implementations: in the former, the recipient of a coherence request is aborted, whereas in the latter, it is the requestor which has to abort. Both strategies are implemented by real systems. We show that the requestor aborts case can be reduced to a classic instance of the ski rental problem, while the requestor wins case leads to a new version of this classical problem, for which we derive optimal deterministic and randomized algorithms. Moreover, we prove that, under a simplified adversarial model, our algorithms are constant-competitive with the offline optimum in terms of throughput. We validate our algorithmic results empirically through a hardware simulation of hardware transactional memory (HTM), showing that our algorithms can lead to non-trivial performance improvements for classic concurrent data structures.","lang":"eng"}],"type":"conference","oa_version":"Preprint","status":"public","title":"The transactional conflict problem","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5966","article_processing_charge":"No","day":"16","scopus_import":"1","date_published":"2018-07-16T00:00:00Z","page":"383-392","citation":{"ista":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures, 383–392.","apa":"Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The transactional conflict problem. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 383–392). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210406","ieee":"D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.","ama":"Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406","chicago":"Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze. “The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM Press, 2018. https://doi.org/10.1145/3210377.3210406.","mla":"Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406.","short":"D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18, ACM Press, 2018, pp. 383–392."},"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18","date_updated":"2023-09-19T10:44:49Z","date_created":"2019-02-13T10:26:07Z","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Haider, Syed Kamran","last_name":"Haider","first_name":"Syed Kamran"},{"full_name":"Kübler, Raphael","last_name":"Kübler","first_name":"Raphael"},{"last_name":"Nadiradze","first_name":"Giorgi","full_name":"Nadiradze, Giorgi"}],"publisher":"ACM Press","department":[{"_id":"DaAl"}],"publication_status":"published","year":"2018","publication_identifier":{"isbn":["9781450357999"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1145/3210377.3210406","conference":{"end_date":"2018-07-18","location":"Vienna, Austria","start_date":"2018-07-16","name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.00947"}],"oa":1,"external_id":{"arxiv":["1804.00947"],"isi":["000545269600046"]}},{"publication":"SIAM Journal on Computing","citation":{"ieee":"V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied Mathematics (SIAM), pp. 2029–2056, 2018.","apa":"Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/16m1093306","ista":"Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.","ama":"Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306","chicago":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM), 2018. https://doi.org/10.1137/16m1093306.","short":"V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.","mla":"Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial & Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306."},"page":"2029-2056","date_published":"2018-11-08T00:00:00Z","scopus_import":"1","day":"08","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5975","title":"Commutativity in the algorithmic Lovász local lemma","status":"public","intvolume":" 47","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"We consider the recent formulation of the algorithmic Lov ́asz Local Lemma [N. Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F. Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms, arXiv preprint, 2018] for finding objects that avoid“bad features,” or “flaws.” It extends the Moser–Tardos resampling algorithm [R. A. Moser andG. Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces. At each step the method picks aflaw present in the current state and goes to a new state according to some prespecified probabilitydistribution (which depends on the current state and the selected flaw). However, the recent formu-lation is less flexible than the Moser–Tardos method since it requires a specific flaw selection rule,whereas the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially beimplemented more efficiently). We formulate a new “commutativity” condition and prove that it issufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additionalassumption. We then show that existing resampling oracles for perfect matchings and permutationsdo satisfy this condition.","lang":"eng"}],"issue":"6","main_file_link":[{"url":"https://arxiv.org/abs/1506.08547","open_access":"1"}],"external_id":{"isi":["000453785100001"],"arxiv":["1506.08547"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"doi":"10.1137/16m1093306","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"year":"2018","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Society for Industrial & Applied Mathematics (SIAM)","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1193"}]},"date_created":"2019-02-13T12:59:33Z","date_updated":"2023-09-19T14:24:58Z","volume":47,"ec_funded":1},{"publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"ACM Press","year":"2018","date_created":"2019-02-13T10:08:19Z","date_updated":"2023-09-19T10:43:45Z","author":[{"last_name":"Aksenov","first_name":"Vitaly","full_name":"Aksenov, Vitaly"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Kuznetsov","first_name":"Petr","full_name":"Kuznetsov, Petr"}],"month":"07","publication_identifier":{"isbn":["9781450357951"]},"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1"}],"external_id":{"isi":["000458186900052"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2018-07-27","location":"Egham, United Kingdom","start_date":"2018-07-23","name":"PODC: Principles of Distributed Computing"},"doi":"10.1145/3212734.3212785","type":"conference","abstract":[{"text":"A standard design pattern found in many concurrent data structures, such as hash tables or ordered containers, is an alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. A lock can be viewed as a queue that arbitrates the order in which the critical sections are executed, and a natural question is whether we can use stochastic analysis to predict the resulting throughput. As a preliminary evidence to the affirmative, we describe a simple model that can be used to predict the throughput of coarse-grained lock-based algorithms. We show that our model works well for CLH lock, and we expect it to work for other popular lock designs such as TTAS, MCS, etc.","lang":"eng"}],"title":"Brief Announcement: Performance prediction for coarse-grained locking","status":"public","_id":"5964","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","scopus_import":"1","day":"23","article_processing_charge":"No","page":"411-413","publication":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC '18","citation":{"mla":"Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.","short":"V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 411–413.","chicago":"Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement: Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13. ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.","ama":"Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785","ista":"Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed Computing, 411–413.","apa":"Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement: Performance prediction for coarse-grained locking. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785","ieee":"V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom, 2018, pp. 411–413."},"date_published":"2018-07-23T00:00:00Z"},{"main_file_link":[{"url":"https://arxiv.org/abs/1802.05175","open_access":"1"}],"external_id":{"arxiv":["1802.05175"],"isi":["000477677200002"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"doi":"10.1142/s2010326319500096","language":[{"iso":"eng"}],"month":"09","publication_identifier":{"eissn":["2010-3271"],"issn":["2010-3263"]},"year":"2018","publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"World Scientific Publishing","author":[{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"},{"full_name":"Mühlbacher, Peter","last_name":"Mühlbacher","first_name":"Peter"}],"date_updated":"2023-09-19T14:24:05Z","date_created":"2019-02-13T10:40:54Z","article_number":"1950009","ec_funded":1,"publication":"Random matrices: Theory and applications","citation":{"ieee":"L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,” Random matrices: Theory and applications. World Scientific Publishing, 2018.","apa":"Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type random matrices. Random Matrices: Theory and Applications. World Scientific Publishing. https://doi.org/10.1142/s2010326319500096","ista":"Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications., 1950009.","ama":"Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices. Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096","chicago":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications. World Scientific Publishing, 2018. https://doi.org/10.1142/s2010326319500096.","short":"L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).","mla":"Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific Publishing, 2018, doi:10.1142/s2010326319500096."},"date_published":"2018-09-26T00:00:00Z","scopus_import":"1","day":"26","article_processing_charge":"No","_id":"5971","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Bounds on the norm of Wigner-type random matrices","status":"public","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices H=H∗ with centered independent entries and with a general matrix of variances Sxy=𝔼∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of the support of the self-consistent density of states. We establish a bound on this maximum in terms of norms of powers of S that substantially improves the earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727]. The key element of the proof is an effective Markov chain approximation for the contributions of the weighted Dyck paths appearing in the iterative solution of the corresponding Dyson equation."}]},{"publication_identifier":{"issn":["2041-1723"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1038/s41467-018-04342-1","project":[{"grant_number":"303564","_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology"},{"grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Molecular Drug Targets"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000432280000006"]},"oa":1,"ec_funded":1,"file_date_updated":"2020-07-14T12:47:14Z","article_number":"1950","volume":9,"date_created":"2019-02-14T10:50:24Z","date_updated":"2023-09-19T14:29:32Z","author":[{"full_name":"Morri, Maurizio","last_name":"Morri","first_name":"Maurizio","id":"4863116E-F248-11E8-B48F-1D18A9856A87"},{"id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","last_name":"Sanchez-Romero","first_name":"Inmaculada","full_name":"Sanchez-Romero, Inmaculada"},{"full_name":"Tichy, Alexandra-Madelaine","first_name":"Alexandra-Madelaine","last_name":"Tichy","id":"29D8BB2C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kainrath","first_name":"Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","full_name":"Kainrath, Stephanie"},{"last_name":"Gerrard","first_name":"Elliot J.","full_name":"Gerrard, Elliot J."},{"id":"435ACB3A-F248-11E8-B48F-1D18A9856A87","last_name":"Hirschfeld","first_name":"Priscila","full_name":"Hirschfeld, Priscila"},{"full_name":"Schwarz, Jan","first_name":"Jan","last_name":"Schwarz","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","first_name":"Harald L","last_name":"Janovjak"}],"publisher":"Springer Nature","department":[{"_id":"HaJa"},{"_id":"CaGu"},{"_id":"MiSi"}],"publication_status":"published","year":"2018","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-12-01T00:00:00Z","citation":{"chicago":"Morri, Maurizio, Inmaculada Sanchez-Romero, Alexandra-Madelaine Tichy, Stephanie Kainrath, Elliot J. Gerrard, Priscila Hirschfeld, Jan Schwarz, and Harald L Janovjak. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04342-1.","short":"M. Morri, I. Sanchez-Romero, A.-M. Tichy, S. Kainrath, E.J. Gerrard, P. Hirschfeld, J. Schwarz, H.L. Janovjak, Nature Communications 9 (2018).","mla":"Morri, Maurizio, et al. “Optical Functionalization of Human Class A Orphan G-Protein-Coupled Receptors.” Nature Communications, vol. 9, no. 1, 1950, Springer Nature, 2018, doi:10.1038/s41467-018-04342-1.","apa":"Morri, M., Sanchez-Romero, I., Tichy, A.-M., Kainrath, S., Gerrard, E. J., Hirschfeld, P., … Janovjak, H. L. (2018). Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04342-1","ieee":"M. Morri et al., “Optical functionalization of human class A orphan G-protein-coupled receptors,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018.","ista":"Morri M, Sanchez-Romero I, Tichy A-M, Kainrath S, Gerrard EJ, Hirschfeld P, Schwarz J, Janovjak HL. 2018. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 9(1), 1950.","ama":"Morri M, Sanchez-Romero I, Tichy A-M, et al. Optical functionalization of human class A orphan G-protein-coupled receptors. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04342-1"},"publication":"Nature Communications","issue":"1","abstract":[{"lang":"eng","text":"G-protein-coupled receptors (GPCRs) form the largest receptor family, relay environmental stimuli to changes in cell behavior and represent prime drug targets. Many GPCRs are classified as orphan receptors because of the limited knowledge on their ligands and coupling to cellular signaling machineries. Here, we engineer a library of 63 chimeric receptors that contain the signaling domains of human orphan and understudied GPCRs functionally linked to the light-sensing domain of rhodopsin. Upon stimulation with visible light, we identify activation of canonical cell signaling pathways, including cAMP-, Ca2+-, MAPK/ERK-, and Rho-dependent pathways, downstream of the engineered receptors. For the human pseudogene GPR33, we resurrect a signaling function that supports its hypothesized role as a pathogen entry site. These results demonstrate that substituting unknown chemical activators with a light switch can reveal information about protein function and provide an optically controlled protein library for exploring the physiology and therapeutic potential of understudied GPCRs."}],"type":"journal_article","oa_version":"Published Version","file":[{"file_id":"5985","relation":"main_file","date_created":"2019-02-14T10:58:29Z","date_updated":"2020-07-14T12:47:14Z","checksum":"8325fcc194264af4749e662a73bf66b5","file_name":"2018_Springer_Morri.pdf","access_level":"open_access","creator":"kschuh","content_type":"application/pdf","file_size":1349914}],"intvolume":" 9","title":"Optical functionalization of human class A orphan G-protein-coupled receptors","ddc":["570"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5984"},{"file_date_updated":"2020-07-14T12:47:14Z","ec_funded":1,"article_number":"241","author":[{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"id":"2DC83906-F248-11E8-B48F-1D18A9856A87","last_name":"Perez Rodriguez","first_name":"Jesus","full_name":"Perez Rodriguez, Jesus"},{"last_name":"Iarussi","first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","full_name":"Iarussi, Emmanuel"},{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"},{"last_name":"Miguel","first_name":"Eder","full_name":"Miguel, Eder"},{"full_name":"Cignoni, Paolo","last_name":"Cignoni","first_name":"Paolo"},{"orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd"}],"date_updated":"2023-09-19T14:25:30Z","date_created":"2019-02-13T13:12:53Z","volume":37,"year":"2018","publication_status":"published","department":[{"_id":"BeBi"}],"publisher":"Association for Computing Machinery (ACM)","month":"11","publication_identifier":{"issn":["0730-0301"]},"doi":"10.1145/3272127.3275076","language":[{"iso":"eng"}],"oa":1,"external_id":{"isi":["000455953100064"]},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"},{"grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425","name":"Soft-bodied intelligence for Manipulation","call_identifier":"H2020"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"We propose FlexMaps, a novel framework for fabricating smooth shapes out of flat, flexible panels with tailored mechanical properties. We start by mapping the 3D surface onto a 2D domain as in traditional UV mapping to design a set of deformable flat panels called FlexMaps. For these panels, we design and obtain specific mechanical properties such that, once they are assembled, the static equilibrium configuration matches the desired 3D shape. FlexMaps can be fabricated from an almost rigid material, such as wood or plastic, and are made flexible in a controlled way by using computationally designed spiraling microstructures."}],"issue":"6","type":"journal_article","pubrep_id":"1068","oa_version":"Published Version","file":[{"file_id":"6901","relation":"main_file","date_created":"2019-09-23T12:48:52Z","date_updated":"2020-07-14T12:47:14Z","checksum":"d0529a41c78b37ab8840685579fb33b4","file_name":"flexmaps_author_version.pdf","access_level":"open_access","creator":"bbickel","content_type":"application/pdf","file_size":100109811}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5976","title":"FlexMaps: Computational design of flat flexible shells for shaping 3D objects","status":"public","ddc":["000"],"intvolume":" 37","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2018-11-01T00:00:00Z","publication":"ACM Transactions on Graphics","citation":{"chicago":"Malomo, Luigi, Jesus Perez Rodriguez, Emmanuel Iarussi, Nico Pietroni, Eder Miguel, Paolo Cignoni, and Bernd Bickel. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3272127.3275076.","short":"L. Malomo, J. Perez Rodriguez, E. Iarussi, N. Pietroni, E. Miguel, P. Cignoni, B. Bickel, ACM Transactions on Graphics 37 (2018).","mla":"Malomo, Luigi, et al. “FlexMaps: Computational Design of Flat Flexible Shells for Shaping 3D Objects.” ACM Transactions on Graphics, vol. 37, no. 6, 241, Association for Computing Machinery (ACM), 2018, doi:10.1145/3272127.3275076.","ieee":"L. Malomo et al., “FlexMaps: Computational design of flat flexible shells for shaping 3D objects,” ACM Transactions on Graphics, vol. 37, no. 6. Association for Computing Machinery (ACM), 2018.","apa":"Malomo, L., Perez Rodriguez, J., Iarussi, E., Pietroni, N., Miguel, E., Cignoni, P., & Bickel, B. (2018). FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. Association for Computing Machinery (ACM). https://doi.org/10.1145/3272127.3275076","ista":"Malomo L, Perez Rodriguez J, Iarussi E, Pietroni N, Miguel E, Cignoni P, Bickel B. 2018. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 37(6), 241.","ama":"Malomo L, Perez Rodriguez J, Iarussi E, et al. FlexMaps: Computational design of flat flexible shells for shaping 3D objects. ACM Transactions on Graphics. 2018;37(6). doi:10.1145/3272127.3275076"},"article_type":"original"},{"article_number":"224506","ec_funded":1,"year":"2018","publisher":"American Physical Society","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publication_status":"published","author":[{"first_name":"Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp"},{"id":"456187FC-F248-11E8-B48F-1D18A9856A87","first_name":"Bikashkali","last_name":"Midya","full_name":"Midya, Bikashkali"},{"last_name":"Deuchert","first_name":"Andreas","orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas"},{"orcid":"0000-0002-0495-6822","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","last_name":"Leopold","first_name":"Nikolai K","full_name":"Leopold, Nikolai K"},{"full_name":"Lemeshko, Mikhail","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"}],"volume":98,"date_created":"2019-02-14T10:37:09Z","date_updated":"2023-09-19T14:29:03Z","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"month":"12","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01204"}],"external_id":{"arxiv":["1809.01204"],"isi":["000452992700008"]},"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227","name":"Analysis of quantum many-body systems","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"doi":"10.1103/physrevb.98.224506","language":[{"iso":"eng"}],"type":"journal_article","issue":"22","abstract":[{"text":"We study a quantum impurity possessing both translational and internal rotational degrees of freedom interacting with a bosonic bath. Such a system corresponds to a “rotating polaron,” which can be used to model, e.g., a rotating molecule immersed in an ultracold Bose gas or superfluid helium. We derive the Hamiltonian of the rotating polaron and study its spectrum in the weak- and strong-coupling regimes using a combination of variational, diagrammatic, and mean-field approaches. We reveal how the coupling between linear and angular momenta affects stable quasiparticle states, and demonstrate that internal rotation leads to an enhanced self-localization in the translational degrees of freedom.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5983","intvolume":" 98","status":"public","title":"Theory of the rotating polaron: Spectrum and self-localization","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","day":"12","citation":{"mla":"Yakaboylu, Enderalp, et al. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B, vol. 98, no. 22, 224506, American Physical Society, 2018, doi:10.1103/physrevb.98.224506.","short":"E. Yakaboylu, B. Midya, A. Deuchert, N.K. Leopold, M. Lemeshko, Physical Review B 98 (2018).","chicago":"Yakaboylu, Enderalp, Bikashkali Midya, Andreas Deuchert, Nikolai K Leopold, and Mikhail Lemeshko. “Theory of the Rotating Polaron: Spectrum and Self-Localization.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.98.224506.","ama":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 2018;98(22). doi:10.1103/physrevb.98.224506","ista":"Yakaboylu E, Midya B, Deuchert A, Leopold NK, Lemeshko M. 2018. Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. 98(22), 224506.","ieee":"E. Yakaboylu, B. Midya, A. Deuchert, N. K. Leopold, and M. Lemeshko, “Theory of the rotating polaron: Spectrum and self-localization,” Physical Review B, vol. 98, no. 22. American Physical Society, 2018.","apa":"Yakaboylu, E., Midya, B., Deuchert, A., Leopold, N. K., & Lemeshko, M. (2018). Theory of the rotating polaron: Spectrum and self-localization. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.98.224506"},"publication":"Physical Review B","date_published":"2018-12-12T00:00:00Z"},{"type":"journal_article","issue":"52","abstract":[{"lang":"eng","text":"In the present work, we detail a fast and simple solution-based method to synthesize hexagonal SnSe2 nanoplates (NPLs) and their use to produce crystallographically textured SnSe2 nanomaterials. We also demonstrate that the same strategy can be used to produce orthorhombic SnSe nanostructures and nanomaterials. NPLs are grown through a screw dislocation-driven mechanism. This mechanism typically results in pyramidal structures, but we demonstrate here that the growth from multiple dislocations results in flower-like structures. Crystallographically textured SnSe2 bulk nanomaterials obtained from the hot pressing of these SnSe2 structures display highly anisotropic charge and heat transport properties and thermoelectric (TE) figures of merit limited by relatively low electrical conductivities. To improve this parameter, SnSe2 NPLs are blended here with metal nanoparticles. The electrical conductivities of the blends are significantly improved with respect to bare SnSe2 NPLs, what translates into a three-fold increase of the TE Figure of merit, reaching unprecedented ZT values up to 0.65."}],"intvolume":" 57","status":"public","title":"Tin diselenide molecular precursor for solution-processable thermoelectric materials","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5982","oa_version":"Submitted Version","scopus_import":"1","article_processing_charge":"No","day":"21","page":"17063-17068","article_type":"original","citation":{"ama":"Zhang Y, Liu Y, Lim KH, et al. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 2018;57(52):17063-17068. doi:10.1002/anie.201809847","ieee":"Y. Zhang et al., “Tin diselenide molecular precursor for solution-processable thermoelectric materials,” Angewandte Chemie International Edition, vol. 57, no. 52. Wiley, pp. 17063–17068, 2018.","apa":"Zhang, Y., Liu, Y., Lim, K. H., Xing, C., Li, M., Zhang, T., … Cabot, A. (2018). Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201809847","ista":"Zhang Y, Liu Y, Lim KH, Xing C, Li M, Zhang T, Tang P, Arbiol J, Llorca J, Ng KM, Ibáñez M, Guardia P, Prato M, Cadavid D, Cabot A. 2018. Tin diselenide molecular precursor for solution-processable thermoelectric materials. Angewandte Chemie International Edition. 57(52), 17063–17068.","short":"Y. Zhang, Y. Liu, K.H. Lim, C. Xing, M. Li, T. Zhang, P. Tang, J. Arbiol, J. Llorca, K.M. Ng, M. Ibáñez, P. Guardia, M. Prato, D. Cadavid, A. Cabot, Angewandte Chemie International Edition 57 (2018) 17063–17068.","mla":"Zhang, Yu, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition, vol. 57, no. 52, Wiley, 2018, pp. 17063–68, doi:10.1002/anie.201809847.","chicago":"Zhang, Yu, Yu Liu, Khak Ho Lim, Congcong Xing, Mengyao Li, Ting Zhang, Pengyi Tang, et al. “Tin Diselenide Molecular Precursor for Solution-Processable Thermoelectric Materials.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201809847."},"publication":"Angewandte Chemie International Edition","date_published":"2018-12-21T00:00:00Z","publisher":"Wiley","department":[{"_id":"MaIb"}],"publication_status":"published","year":"2018","volume":57,"date_created":"2019-02-14T10:23:27Z","date_updated":"2023-09-19T14:28:31Z","author":[{"last_name":"Zhang","first_name":"Yu","full_name":"Zhang, Yu"},{"full_name":"Liu, Yu","first_name":"Yu","last_name":"Liu"},{"full_name":"Lim, Khak Ho","first_name":"Khak Ho","last_name":"Lim"},{"full_name":"Xing, Congcong","first_name":"Congcong","last_name":"Xing"},{"full_name":"Li, Mengyao","last_name":"Li","first_name":"Mengyao"},{"full_name":"Zhang, Ting","last_name":"Zhang","first_name":"Ting"},{"full_name":"Tang, Pengyi","first_name":"Pengyi","last_name":"Tang"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"last_name":"Llorca","first_name":"Jordi","full_name":"Llorca, Jordi"},{"first_name":"Ka Ming","last_name":"Ng","full_name":"Ng, Ka Ming"},{"orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria","full_name":"Ibáñez, Maria"},{"first_name":"Pablo","last_name":"Guardia","full_name":"Guardia, Pablo"},{"full_name":"Prato, Mirko","last_name":"Prato","first_name":"Mirko"},{"first_name":"Doris","last_name":"Cadavid","full_name":"Cadavid, Doris"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"}],"publication_identifier":{"issn":["1433-7851"]},"month":"12","isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000454575500020"]},"main_file_link":[{"url":"https://upcommons.upc.edu/bitstream/2117/130444/1/Zhang%20preprint.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1002/anie.201809847"},{"type":"conference","abstract":[{"text":"We consider the MAP-inference problem for graphical models,which is a valued constraint satisfaction problem defined onreal numbers with a natural summation operation. We proposea family of relaxations (different from the famous Sherali-Adams hierarchy), which naturally define lower bounds for itsoptimum. This family always contains a tight relaxation andwe give an algorithm able to find it and therefore, solve theinitial non-relaxed NP-hard problem.The relaxations we consider decompose the original probleminto two non-overlapping parts: an easy LP-tight part and adifficult one. For the latter part a combinatorial solver must beused. As we show in our experiments, in a number of applica-tions the second, difficult part constitutes only a small fractionof the whole problem. This property allows to significantlyreduce the computational time of the combinatorial solver andtherefore solve problems which were out of reach before.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5978","year":"2018","title":"Exact MAP-inference by confining combinatorial search with LP relaxation","status":"public","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"AAAI Press","author":[{"full_name":"Haller, Stefan","last_name":"Haller","first_name":"Stefan"},{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul","full_name":"Swoboda, Paul"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"date_created":"2019-02-13T13:32:48Z","date_updated":"2023-09-19T14:26:52Z","oa_version":"Preprint","scopus_import":"1","month":"02","day":"01","article_processing_charge":"No","publication":"Proceedings of the 32st AAAI Conference on Artificial Intelligence","oa":1,"external_id":{"arxiv":["2004.06370"],"isi":["000485488906082"]},"main_file_link":[{"url":"https://arxiv.org/abs/2004.06370","open_access":"1"}],"citation":{"chicago":"Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the 32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.","short":"S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.","mla":"Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.","apa":"Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In Proceedings of the 32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans, LU, United States: AAAI Press.","ieee":"S. Haller, P. Swoboda, and B. Savchynskyy, “Exact MAP-inference by confining combinatorial search with LP relaxation,” in Proceedings of the 32st AAAI Conference on Artificial Intelligence, New Orleans, LU, United States, 2018, pp. 6581–6588.","ista":"Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.","ama":"Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI Press; 2018:6581-6588."},"quality_controlled":"1","isi":1,"page":"6581-6588","conference":{"name":"AAAI: Conference on Artificial Intelligence","end_date":"2018-02-07","location":"New Orleans, LU, United States","start_date":"2018-02-02"},"date_published":"2018-02-01T00:00:00Z","language":[{"iso":"eng"}]},{"date_published":"2018-11-02T00:00:00Z","citation":{"mla":"Ridderbos, Joost, et al. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials, vol. 30, no. 44, 1802257, Wiley, 2018, doi:10.1002/adma.201802257.","short":"J. Ridderbos, M. Brauns, J. Shen, F.K. de Vries, A. Li, E.P.A.M. Bakkers, A. Brinkman, F.A. Zwanenburg, Advanced Materials 30 (2018).","chicago":"Ridderbos, Joost, Matthias Brauns, Jie Shen, Folkert K. de Vries, Ang Li, Erik P. A. M. Bakkers, Alexander Brinkman, and Floris A. Zwanenburg. “Josephson Effect in a Few-Hole Quantum Dot.” Advanced Materials. Wiley, 2018. https://doi.org/10.1002/adma.201802257.","ama":"Ridderbos J, Brauns M, Shen J, et al. Josephson effect in a few-hole quantum dot. Advanced Materials. 2018;30(44). doi:10.1002/adma.201802257","ista":"Ridderbos J, Brauns M, Shen J, de Vries FK, Li A, Bakkers EPAM, Brinkman A, Zwanenburg FA. 2018. Josephson effect in a few-hole quantum dot. Advanced Materials. 30(44), 1802257.","ieee":"J. Ridderbos et al., “Josephson effect in a few-hole quantum dot,” Advanced Materials, vol. 30, no. 44. Wiley, 2018.","apa":"Ridderbos, J., Brauns, M., Shen, J., de Vries, F. K., Li, A., Bakkers, E. P. A. M., … Zwanenburg, F. A. (2018). Josephson effect in a few-hole quantum dot. Advanced Materials. Wiley. https://doi.org/10.1002/adma.201802257"},"publication":"Advanced Materials","article_processing_charge":"No","day":"02","scopus_import":"1","oa_version":"Preprint","intvolume":" 30","title":"Josephson effect in a few-hole quantum dot","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5990","issue":"44","abstract":[{"lang":"eng","text":"A Ge–Si core–shell nanowire is used to realize a Josephson field‐effect transistor with highly transparent contacts to superconducting leads. By changing the electric field, access to two distinct regimes, not combined before in a single device, is gained: in the accumulation mode the device is highly transparent and the supercurrent is carried by multiple subbands, while near depletion, the supercurrent is carried by single‐particle levels of a strongly coupled quantum dot operating in the few‐hole regime. These results establish Ge–Si nanowires as an important platform for hybrid superconductor–semiconductor physics and Majorana fermions."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1002/adma.201802257","isi":1,"quality_controlled":"1","external_id":{"arxiv":["1809.08487"],"isi":["000450232800015"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.08487"}],"oa":1,"publication_identifier":{"issn":["0935-9648"]},"month":"11","volume":30,"date_updated":"2023-09-19T14:29:58Z","date_created":"2019-02-14T12:14:26Z","author":[{"last_name":"Ridderbos","first_name":"Joost","full_name":"Ridderbos, Joost"},{"id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","last_name":"Brauns","first_name":"Matthias","full_name":"Brauns, Matthias"},{"full_name":"Shen, Jie","last_name":"Shen","first_name":"Jie"},{"full_name":"de Vries, Folkert K.","last_name":"de Vries","first_name":"Folkert K."},{"full_name":"Li, Ang","first_name":"Ang","last_name":"Li"},{"full_name":"Bakkers, Erik P. A. M.","first_name":"Erik P. A. M.","last_name":"Bakkers"},{"full_name":"Brinkman, Alexander","first_name":"Alexander","last_name":"Brinkman"},{"first_name":"Floris A.","last_name":"Zwanenburg","full_name":"Zwanenburg, Floris A."}],"publisher":"Wiley","department":[{"_id":"GeKa"}],"publication_status":"published","year":"2018","article_number":"1802257"},{"scopus_import":"1","day":"01","month":"02","article_processing_charge":"No","quality_controlled":"1","isi":1,"page":"17-47","publication":"American Institute of Mathematical Sciences","external_id":{"isi":["000430950400002"]},"citation":{"chicago":"Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences. AIMS, 2018. https://doi.org/10.3934/amc.2018002.","mla":"Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002.","short":"S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.","ista":"Chatterjee S, Kamath Hosdurg C, Kumar V. 2018. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 12(1), 17–47.","ieee":"S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” American Institute of Mathematical Sciences, vol. 12, no. 1. AIMS, pp. 17–47, 2018.","apa":"Chatterjee, S., Kamath Hosdurg, C., & Kumar, V. (2018). Private set-intersection with common set-up. American Institute of Mathematical Sciences. AIMS. https://doi.org/10.3934/amc.2018002","ama":"Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47. doi:10.3934/amc.2018002"},"language":[{"iso":"eng"}],"doi":"10.3934/amc.2018002","date_published":"2018-02-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"The problem of private set-intersection (PSI) has been traditionally treated as an instance of the more general problem of multi-party computation (MPC). Consequently, in order to argue security, or compose these protocols one has to rely on the general theory that was developed for the purpose of MPC. The pursuit of efficient protocols, however, has resulted in designs that exploit properties pertaining to PSI. In almost all practical applications where a PSI protocol is deployed, it is expected to be executed multiple times, possibly on related inputs. In this work we initiate a dedicated study of PSI in the multi-interaction (MI) setting. In this model a server sets up the common system parameters and executes set-intersection multiple times with potentially different clients. We discuss a few attacks that arise when protocols are naïvely composed in this manner and, accordingly, craft security definitions for the MI setting and study their inter-relation. Finally, we suggest a set of protocols that are MI-secure, at the same time almost as efficient as their parent, stand-alone, protocols."}],"issue":"1","title":"Private set-intersection with common set-up","publication_status":"published","status":"public","intvolume":" 12","publisher":"AIMS","department":[{"_id":"KrPi"}],"_id":"5980","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2018","date_created":"2019-02-13T13:49:41Z","date_updated":"2023-09-19T14:27:59Z","volume":12,"oa_version":"None","author":[{"full_name":"Chatterjee, Sanjit","last_name":"Chatterjee","first_name":"Sanjit"},{"full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan","last_name":"Kamath Hosdurg"},{"last_name":"Kumar","first_name":"Vikas","full_name":"Kumar, Vikas"}]},{"date_updated":"2023-09-19T14:31:43Z","date_created":"2019-02-14T13:07:45Z","volume":14,"author":[{"orcid":"0000-0002-2340-7431","id":"39BDC62C-F248-11E8-B48F-1D18A9856A87","last_name":"Velicky","first_name":"Philipp","full_name":"Velicky, Philipp"},{"full_name":"Meinhardt, Gudrun","last_name":"Meinhardt","first_name":"Gudrun"},{"full_name":"Plessl, Kerstin","last_name":"Plessl","first_name":"Kerstin"},{"last_name":"Vondra","first_name":"Sigrid","full_name":"Vondra, Sigrid"},{"first_name":"Tamara","last_name":"Weiss","full_name":"Weiss, Tamara"},{"last_name":"Haslinger","first_name":"Peter","full_name":"Haslinger, Peter"},{"full_name":"Lendl, Thomas","last_name":"Lendl","first_name":"Thomas"},{"full_name":"Aumayr, Karin","last_name":"Aumayr","first_name":"Karin"},{"last_name":"Mairhofer","first_name":"Mario","full_name":"Mairhofer, Mario"},{"full_name":"Zhu, Xiaowei","last_name":"Zhu","first_name":"Xiaowei"},{"last_name":"Schütz","first_name":"Birgit","full_name":"Schütz, Birgit"},{"first_name":"Roberta L.","last_name":"Hannibal","full_name":"Hannibal, Roberta L."},{"last_name":"Lindau","first_name":"Robert","full_name":"Lindau, Robert"},{"full_name":"Weil, Beatrix","first_name":"Beatrix","last_name":"Weil"},{"last_name":"Ernerudh","first_name":"Jan","full_name":"Ernerudh, Jan"},{"full_name":"Neesen, Jürgen","first_name":"Jürgen","last_name":"Neesen"},{"full_name":"Egger, Gerda","last_name":"Egger","first_name":"Gerda"},{"first_name":"Mario","last_name":"Mikula","full_name":"Mikula, Mario"},{"first_name":"Clemens","last_name":"Röhrl","full_name":"Röhrl, Clemens"},{"full_name":"Urban, Alexander E.","last_name":"Urban","first_name":"Alexander E."},{"full_name":"Baker, Julie","first_name":"Julie","last_name":"Baker"},{"last_name":"Knöfler","first_name":"Martin","full_name":"Knöfler, Martin"},{"full_name":"Pollheimer, Jürgen","last_name":"Pollheimer","first_name":"Jürgen"}],"publication_status":"published","department":[{"_id":"JoDa"}],"publisher":"Public Library of Science","year":"2018","file_date_updated":"2020-07-14T12:47:15Z","article_number":"e1007698","language":[{"iso":"eng"}],"doi":"10.1371/journal.pgen.1007698","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000449328500025"]},"oa":1,"month":"10","publication_identifier":{"issn":["1553-7404"]},"oa_version":"Published Version","file":[{"file_id":"6000","relation":"main_file","checksum":"34aa9a5972f61889c19f18be8ee787a0","date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T13:14:35Z","access_level":"open_access","file_name":"2018_PLOS_Velicky.pdf","creator":"kschuh","content_type":"application/pdf","file_size":4592947}],"status":"public","ddc":["570"],"title":"Genome amplification and cellular senescence are hallmarks of human placenta development","intvolume":" 14","_id":"5998","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Genome amplification and cellular senescence are commonly associated with pathological processes. While physiological roles for polyploidization and senescence have been described in mouse development, controversy exists over their significance in humans. Here, we describe tetraploidization and senescence as phenomena of normal human placenta development. During pregnancy, placental extravillous trophoblasts (EVTs) invade the pregnant endometrium, termed decidua, to establish an adapted microenvironment required for the developing embryo. This process is critically dependent on continuous cell proliferation and differentiation, which is thought to follow the classical model of cell cycle arrest prior to terminal differentiation. Strikingly, flow cytometry and DNAseq revealed that EVT formation is accompanied with a genome-wide polyploidization, independent of mitotic cycles. DNA replication in these cells was analysed by a fluorescent cell-cycle indicator reporter system, cell cycle marker expression and EdU incorporation. Upon invasion into the decidua, EVTs widely lose their replicative potential and enter a senescent state characterized by high senescence-associated (SA) β-galactosidase activity, induction of a SA secretory phenotype as well as typical metabolic alterations. Furthermore, we show that the shift from endocycle-dependent genome amplification to growth arrest is disturbed in androgenic complete hydatidiform moles (CHM), a hyperplastic pregnancy disorder associated with increased risk of developing choriocarinoma. Senescence is decreased in CHM-EVTs, accompanied by exacerbated endoreduplication and hyperploidy. We propose induction of cellular senescence as a ploidy-limiting mechanism during normal human placentation and unravel a link between excessive polyploidization and reduced senescence in CHM."}],"issue":"10","type":"journal_article","date_published":"2018-10-12T00:00:00Z","publication":"PLOS Genetics","citation":{"mla":"Velicky, Philipp, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics, vol. 14, no. 10, e1007698, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007698.","short":"P. Velicky, G. Meinhardt, K. Plessl, S. Vondra, T. Weiss, P. Haslinger, T. Lendl, K. Aumayr, M. Mairhofer, X. Zhu, B. Schütz, R.L. Hannibal, R. Lindau, B. Weil, J. Ernerudh, J. Neesen, G. Egger, M. Mikula, C. Röhrl, A.E. Urban, J. Baker, M. Knöfler, J. Pollheimer, PLOS Genetics 14 (2018).","chicago":"Velicky, Philipp, Gudrun Meinhardt, Kerstin Plessl, Sigrid Vondra, Tamara Weiss, Peter Haslinger, Thomas Lendl, et al. “Genome Amplification and Cellular Senescence Are Hallmarks of Human Placenta Development.” PLOS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007698.","ama":"Velicky P, Meinhardt G, Plessl K, et al. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 2018;14(10). doi:10.1371/journal.pgen.1007698","ista":"Velicky P, Meinhardt G, Plessl K, Vondra S, Weiss T, Haslinger P, Lendl T, Aumayr K, Mairhofer M, Zhu X, Schütz B, Hannibal RL, Lindau R, Weil B, Ernerudh J, Neesen J, Egger G, Mikula M, Röhrl C, Urban AE, Baker J, Knöfler M, Pollheimer J. 2018. Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. 14(10), e1007698.","ieee":"P. Velicky et al., “Genome amplification and cellular senescence are hallmarks of human placenta development,” PLOS Genetics, vol. 14, no. 10. Public Library of Science, 2018.","apa":"Velicky, P., Meinhardt, G., Plessl, K., Vondra, S., Weiss, T., Haslinger, P., … Pollheimer, J. (2018). Genome amplification and cellular senescence are hallmarks of human placenta development. PLOS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007698"},"day":"12","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1"},{"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Systematic investigation of epistasis in molecular evolution","grant_number":"335980","_id":"26120F5C-B435-11E9-9278-68D0E5697425"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"external_id":{"pmid":["29722803"],"isi":["000450038900008"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1093/bioinformatics/bty340","month":"11","publication_identifier":{"issn":["1367-4803","1460-2059"]},"publication_status":"published","publisher":"Oxford University Press ","department":[{"_id":"FyKo"}],"year":"2018","pmid":1,"date_created":"2019-02-14T12:48:00Z","date_updated":"2023-09-19T14:31:13Z","volume":34,"author":[{"first_name":"Dinara R","last_name":"Usmanova","full_name":"Usmanova, Dinara R"},{"first_name":"Natalya S","last_name":"Bogatyreva","full_name":"Bogatyreva, Natalya S"},{"full_name":"Ariño Bernad, Joan","first_name":"Joan","last_name":"Ariño Bernad"},{"last_name":"Eremina","first_name":"Aleksandra A","full_name":"Eremina, Aleksandra A"},{"first_name":"Anastasiya A","last_name":"Gorshkova","full_name":"Gorshkova, Anastasiya A"},{"full_name":"Kanevskiy, German M","last_name":"Kanevskiy","first_name":"German M"},{"last_name":"Lonishin","first_name":"Lyubov R","full_name":"Lonishin, Lyubov R"},{"full_name":"Meister, Alexander V","last_name":"Meister","first_name":"Alexander V"},{"full_name":"Yakupova, Alisa G","first_name":"Alisa G","last_name":"Yakupova"},{"first_name":"Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"},{"id":"49FF1036-F248-11E8-B48F-1D18A9856A87","first_name":"Dmitry","last_name":"Ivankov","full_name":"Ivankov, Dmitry"}],"file_date_updated":"2020-07-14T12:47:15Z","ec_funded":1,"page":"3653-3658","publication":"Bioinformatics","citation":{"mla":"Usmanova, Dinara R., et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” Bioinformatics, vol. 34, no. 21, Oxford University Press , 2018, pp. 3653–58, doi:10.1093/bioinformatics/bty340.","short":"D.R. Usmanova, N.S. Bogatyreva, J. Ariño Bernad, A.A. Eremina, A.A. Gorshkova, G.M. Kanevskiy, L.R. Lonishin, A.V. Meister, A.G. Yakupova, F. Kondrashov, D. Ivankov, Bioinformatics 34 (2018) 3653–3658.","chicago":"Usmanova, Dinara R, Natalya S Bogatyreva, Joan Ariño Bernad, Aleksandra A Eremina, Anastasiya A Gorshkova, German M Kanevskiy, Lyubov R Lonishin, et al. “Self-Consistency Test Reveals Systematic Bias in Programs for Prediction Change of Stability upon Mutation.” Bioinformatics. Oxford University Press , 2018. https://doi.org/10.1093/bioinformatics/bty340.","ama":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, et al. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 2018;34(21):3653-3658. doi:10.1093/bioinformatics/bty340","ista":"Usmanova DR, Bogatyreva NS, Ariño Bernad J, Eremina AA, Gorshkova AA, Kanevskiy GM, Lonishin LR, Meister AV, Yakupova AG, Kondrashov F, Ivankov D. 2018. Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. 34(21), 3653–3658.","apa":"Usmanova, D. R., Bogatyreva, N. S., Ariño Bernad, J., Eremina, A. A., Gorshkova, A. A., Kanevskiy, G. M., … Ivankov, D. (2018). Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation. Bioinformatics. Oxford University Press . https://doi.org/10.1093/bioinformatics/bty340","ieee":"D. R. Usmanova et al., “Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation,” Bioinformatics, vol. 34, no. 21. Oxford University Press , pp. 3653–3658, 2018."},"date_published":"2018-11-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","title":"Self-consistency test reveals systematic bias in programs for prediction change of stability upon mutation","ddc":["570"],"status":"public","intvolume":" 34","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5995","oa_version":"Published Version","file":[{"checksum":"7e0495153f44211479674601d7f6ee03","date_created":"2019-02-14T13:00:55Z","date_updated":"2020-07-14T12:47:15Z","relation":"main_file","file_id":"5997","content_type":"application/pdf","file_size":291969,"creator":"kschuh","access_level":"open_access","file_name":"2018_Oxford_Usmanova.pdf"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Motivation\r\nComputational prediction of the effect of mutations on protein stability is used by researchers in many fields. The utility of the prediction methods is affected by their accuracy and bias. Bias, a systematic shift of the predicted change of stability, has been noted as an issue for several methods, but has not been investigated systematically. Presence of the bias may lead to misleading results especially when exploring the effects of combination of different mutations.\r\n\r\nResults\r\nHere we use a protocol to measure the bias as a function of the number of introduced mutations. It is based on a self-consistency test of the reciprocity the effect of a mutation. An advantage of the used approach is that it relies solely on crystal structures without experimentally measured stability values. We applied the protocol to four popular algorithms predicting change of protein stability upon mutation, FoldX, Eris, Rosetta and I-Mutant, and found an inherent bias. For one program, FoldX, we manage to substantially reduce the bias using additional relaxation by Modeller. Authors using algorithms for predicting effects of mutations should be aware of the bias described here."}],"issue":"21"},{"file":[{"file_name":"2018_ASCB_Dolati.pdf","access_level":"open_access","creator":"kschuh","content_type":"application/pdf","file_size":6668971,"file_id":"5994","relation":"main_file","date_created":"2019-02-14T12:34:29Z","date_updated":"2020-07-14T12:47:15Z","checksum":"e98465b4416b3e804c47f40086932af2"}],"oa_version":"Published Version","intvolume":" 29","status":"public","title":"On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility","ddc":["570"],"_id":"5992","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","issue":"22","abstract":[{"text":"Lamellipodia are flat membrane protrusions formed during mesenchymal motion. Polymerization at the leading edge assembles the actin filament network and generates protrusion force. How this force is supported by the network and how the assembly rate is shared between protrusion and network retrograde flow determines the protrusion rate. We use mathematical modeling to understand experiments changing the F-actin density in lamellipodia of B16-F1 melanoma cells by modulation of Arp2/3 complex activity or knockout of the formins FMNL2 and FMNL3. Cells respond to a reduction of density with a decrease of protrusion velocity, an increase in the ratio of force to filament number, but constant network assembly rate. The relation between protrusion force and tension gradient in the F-actin network and the density dependency of friction, elasticity, and viscosity of the network explain the experimental observations. The formins act as filament nucleators and elongators with differential rates. Modulation of their activity suggests an effect on network assembly rate. Contrary to these expectations, the effect of changes in elongator composition is much weaker than the consequences of the density change. We conclude that the force acting on the leading edge membrane is the force required to drive F-actin network retrograde flow.","lang":"eng"}],"type":"journal_article","date_published":"2018-11-01T00:00:00Z","page":"2674-2686","citation":{"chicago":"Dolati, Setareh, Frieda Kage, Jan Mueller, Mathias Müsken, Marieluise Kirchner, Gunnar Dittmar, Michael K Sixt, Klemens Rottner, and Martin Falcke. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell. American Society for Cell Biology , 2018. https://doi.org/10.1091/mbc.e18-02-0082.","short":"S. Dolati, F. Kage, J. Mueller, M. Müsken, M. Kirchner, G. Dittmar, M.K. Sixt, K. Rottner, M. Falcke, Molecular Biology of the Cell 29 (2018) 2674–2686.","mla":"Dolati, Setareh, et al. “On the Relation between Filament Density, Force Generation, and Protrusion Rate in Mesenchymal Cell Motility.” Molecular Biology of the Cell, vol. 29, no. 22, American Society for Cell Biology , 2018, pp. 2674–86, doi:10.1091/mbc.e18-02-0082.","ieee":"S. Dolati et al., “On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility,” Molecular Biology of the Cell, vol. 29, no. 22. American Society for Cell Biology , pp. 2674–2686, 2018.","apa":"Dolati, S., Kage, F., Mueller, J., Müsken, M., Kirchner, M., Dittmar, G., … Falcke, M. (2018). On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. American Society for Cell Biology . https://doi.org/10.1091/mbc.e18-02-0082","ista":"Dolati S, Kage F, Mueller J, Müsken M, Kirchner M, Dittmar G, Sixt MK, Rottner K, Falcke M. 2018. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 29(22), 2674–2686.","ama":"Dolati S, Kage F, Mueller J, et al. On the relation between filament density, force generation, and protrusion rate in mesenchymal cell motility. Molecular Biology of the Cell. 2018;29(22):2674-2686. doi:10.1091/mbc.e18-02-0082"},"publication":"Molecular Biology of the Cell","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","volume":29,"date_updated":"2023-09-19T14:30:23Z","date_created":"2019-02-14T12:25:47Z","author":[{"full_name":"Dolati, Setareh","last_name":"Dolati","first_name":"Setareh"},{"last_name":"Kage","first_name":"Frieda","full_name":"Kage, Frieda"},{"full_name":"Mueller, Jan","first_name":"Jan","last_name":"Mueller"},{"full_name":"Müsken, Mathias","last_name":"Müsken","first_name":"Mathias"},{"first_name":"Marieluise","last_name":"Kirchner","full_name":"Kirchner, Marieluise"},{"first_name":"Gunnar","last_name":"Dittmar","full_name":"Dittmar, Gunnar"},{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"},{"full_name":"Rottner, Klemens","last_name":"Rottner","first_name":"Klemens"},{"first_name":"Martin","last_name":"Falcke","full_name":"Falcke, Martin"}],"department":[{"_id":"MiSi"}],"publisher":"American Society for Cell Biology ","publication_status":"published","pmid":1,"year":"2018","file_date_updated":"2020-07-14T12:47:15Z","language":[{"iso":"eng"}],"doi":"10.1091/mbc.e18-02-0082","quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"external_id":{"pmid":["30156465"],"isi":["000455641000011"]},"publication_identifier":{"eissn":["1939-4586"]},"month":"11"},{"date_published":"2018-08-07T00:00:00Z","publication":"Proceedings of the National Academy of Sciences","citation":{"ieee":"F. Garrido-Charad et al., ““Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network,” Proceedings of the National Academy of Sciences, vol. 115, no. 32. National Academy of Sciences, pp. E7615–E7623, 2018.","apa":"Garrido-Charad, F., Vega Zuniga, T. A., Gutiérrez-Ibáñez, C., Fernandez, P., López-Jury, L., González-Cabrera, C., … Marín, G. J. (2018). “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1804517115","ista":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, Fernandez P, López-Jury L, González-Cabrera C, Karten HJ, Luksch H, Marín GJ. 2018. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 115(32), E7615–E7623.","ama":"Garrido-Charad F, Vega Zuniga TA, Gutiérrez-Ibáñez C, et al. “Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network. Proceedings of the National Academy of Sciences. 2018;115(32):E7615-E7623. doi:10.1073/pnas.1804517115","chicago":"Garrido-Charad, Florencia, Tomas A Vega Zuniga, Cristián Gutiérrez-Ibáñez, Pedro Fernandez, Luciana López-Jury, Cristian González-Cabrera, Harvey J. Karten, Harald Luksch, and Gonzalo J. Marín. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1804517115.","short":"F. Garrido-Charad, T.A. Vega Zuniga, C. Gutiérrez-Ibáñez, P. Fernandez, L. López-Jury, C. González-Cabrera, H.J. Karten, H. Luksch, G.J. Marín, Proceedings of the National Academy of Sciences 115 (2018) E7615–E7623.","mla":"Garrido-Charad, Florencia, et al. ““Shepherd’s Crook” Neurons Drive and Synchronize the Enhancing and Suppressive Mechanisms of the Midbrain Stimulus Selection Network.” Proceedings of the National Academy of Sciences, vol. 115, no. 32, National Academy of Sciences, 2018, pp. E7615–23, doi:10.1073/pnas.1804517115."},"page":"E7615-E7623","day":"07","article_processing_charge":"No","scopus_import":"1","oa_version":"Submitted Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6010","title":"“Shepherd’s crook” neurons drive and synchronize the enhancing and suppressive mechanisms of the midbrain stimulus selection network","status":"public","intvolume":" 115","abstract":[{"lang":"eng","text":"The optic tectum (TeO), or superior colliculus, is a multisensory midbrain center that organizes spatially orienting responses to relevant stimuli. To define the stimulus with the highest priority at each moment, a network of reciprocal connections between the TeO and the isthmi promotes competition between concurrent tectal inputs. In the avian midbrain, the neurons mediating enhancement and suppression of tectal inputs are located in separate isthmic nuclei, facilitating the analysis of the neural processes that mediate competition. A specific subset of radial neurons in the intermediate tectal layers relay retinal inputs to the isthmi, but at present it is unclear whether separate neurons innervate individual nuclei or a single neural type sends a common input to several of them. In this study, we used in vitro neural tracing and cell-filling experiments in chickens to show that single neurons innervate, via axon collaterals, the three nuclei that comprise the isthmotectal network. This demonstrates that the input signals representing the strength of the incoming stimuli are simultaneously relayed to the mechanisms promoting both enhancement and suppression of the input signals. By performing in vivo recordings in anesthetized chicks, we also show that this common input generates synchrony between both antagonistic mechanisms, demonstrating that activity enhancement and suppression are closely coordinated. From a computational point of view, these results suggest that these tectal neurons constitute integrative nodes that combine inputs from different sources to drive in parallel several concurrent neural processes, each performing complementary functions within the network through different firing patterns and connectivity."}],"issue":"32","type":"journal_article","doi":"10.1073/pnas.1804517115","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30026198"}],"external_id":{"pmid":["30026198"],"isi":["000440982000020"]},"oa":1,"isi":1,"quality_controlled":"1","month":"08","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"author":[{"full_name":"Garrido-Charad, Florencia","first_name":"Florencia","last_name":"Garrido-Charad"},{"full_name":"Vega Zuniga, Tomas A","id":"2E7C4E78-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas A","last_name":"Vega Zuniga"},{"last_name":"Gutiérrez-Ibáñez","first_name":"Cristián","full_name":"Gutiérrez-Ibáñez, Cristián"},{"full_name":"Fernandez, Pedro","first_name":"Pedro","last_name":"Fernandez"},{"full_name":"López-Jury, Luciana","last_name":"López-Jury","first_name":"Luciana"},{"last_name":"González-Cabrera","first_name":"Cristian","full_name":"González-Cabrera, Cristian"},{"last_name":"Karten","first_name":"Harvey J.","full_name":"Karten, Harvey J."},{"first_name":"Harald","last_name":"Luksch","full_name":"Luksch, Harald"},{"last_name":"Marín","first_name":"Gonzalo J.","full_name":"Marín, Gonzalo J."}],"date_updated":"2023-09-19T14:35:36Z","date_created":"2019-02-14T14:33:34Z","volume":115,"year":"2018","pmid":1,"publication_status":"published","department":[{"_id":"MaJö"}],"publisher":"National Academy of Sciences"},{"project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000437272800019"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1111/cgf.13327","publication_identifier":{"issn":["0167-7055"]},"month":"09","department":[{"_id":"BeBi"}],"publisher":"Wiley","publication_status":"published","year":"2018","volume":37,"date_created":"2019-02-14T13:52:25Z","date_updated":"2023-09-19T14:33:40Z","author":[{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"},{"first_name":"Luigi","last_name":"Malomo","full_name":"Malomo, Luigi"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"}],"ec_funded":1,"file_date_updated":"2020-07-14T12:47:15Z","page":"325-342","citation":{"ista":"Bickel B, Cignoni P, Malomo L, Pietroni N. 2018. State of the art on stylized fabrication. Computer Graphics Forum. 37(6), 325–342.","apa":"Bickel, B., Cignoni, P., Malomo, L., & Pietroni, N. (2018). State of the art on stylized fabrication. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13327","ieee":"B. Bickel, P. Cignoni, L. Malomo, and N. Pietroni, “State of the art on stylized fabrication,” Computer Graphics Forum, vol. 37, no. 6. Wiley, pp. 325–342, 2018.","ama":"Bickel B, Cignoni P, Malomo L, Pietroni N. State of the art on stylized fabrication. Computer Graphics Forum. 2018;37(6):325-342. doi:10.1111/cgf.13327","chicago":"Bickel, Bernd, Paolo Cignoni, Luigi Malomo, and Nico Pietroni. “State of the Art on Stylized Fabrication.” Computer Graphics Forum. Wiley, 2018. https://doi.org/10.1111/cgf.13327.","mla":"Bickel, Bernd, et al. “State of the Art on Stylized Fabrication.” Computer Graphics Forum, vol. 37, no. 6, Wiley, 2018, pp. 325–42, doi:10.1111/cgf.13327.","short":"B. Bickel, P. Cignoni, L. Malomo, N. Pietroni, Computer Graphics Forum 37 (2018) 325–342."},"publication":"Computer Graphics Forum","date_published":"2018-09-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"01","intvolume":" 37","status":"public","ddc":["004"],"title":"State of the art on stylized fabrication","_id":"6003","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"relation":"main_file","file_id":"6004","date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T14:09:28Z","checksum":"d2bbe5c658d8159fbe9016a4f5e82b19","file_name":"StylizedFabricationSTAR-Personal.pdf","access_level":"open_access","content_type":"application/pdf","file_size":6209349,"creator":"kschuh"}],"oa_version":"Submitted Version","pubrep_id":"1051","type":"journal_article","issue":"6","abstract":[{"text":"Digital fabrication devices are powerful tools for creating tangible reproductions of 3D digital models. Most available printing technologies aim at producing an accurate copy of a tridimensional shape. However, fabrication technologies can also be used to create a stylistic representation of a digital shape. We refer to this class of methods as ‘stylized fabrication methods’. These methods abstract geometric and physical features of a given shape to create an unconventional representation, to produce an optical illusion or to devise a particular interaction with the fabricated model. In this state‐of‐the‐art report, we classify and overview this broad and emerging class of approaches and also propose possible directions for future research.","lang":"eng"}]},{"article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2018-09-01T00:00:00Z","citation":{"mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” Archive for Rational Mechanics and Analysis, vol. 229, no. 3, Springer Nature, 2018, pp. 1037–90, doi:10.1007/s00205-018-1232-6.","short":"M.M. Napiórkowski, R. Reuvers, J.P. Solovej, Archive for Rational Mechanics and Analysis 229 (2018) 1037–1090.","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Philip Solovej. “The Bogoliubov Free Energy Functional I: Existence of Minimizers and Phase Diagram.” Archive for Rational Mechanics and Analysis. Springer Nature, 2018. https://doi.org/10.1007/s00205-018-1232-6.","ama":"Napiórkowski MM, Reuvers R, Solovej JP. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 2018;229(3):1037-1090. doi:10.1007/s00205-018-1232-6","ista":"Napiórkowski MM, Reuvers R, Solovej JP. 2018. The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. 229(3), 1037–1090.","ieee":"M. M. Napiórkowski, R. Reuvers, and J. P. Solovej, “The Bogoliubov free energy functional I: Existence of minimizers and phase diagram,” Archive for Rational Mechanics and Analysis, vol. 229, no. 3. Springer Nature, pp. 1037–1090, 2018.","apa":"Napiórkowski, M. M., Reuvers, R., & Solovej, J. P. (2018). The Bogoliubov free energy functional I: Existence of minimizers and phase diagram. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-018-1232-6"},"publication":"Archive for Rational Mechanics and Analysis","page":"1037-1090","issue":"3","abstract":[{"lang":"eng","text":"The Bogoliubov free energy functional is analysed. The functional serves as a model of a translation-invariant Bose gas at positive temperature. We prove the existence of minimizers in the case of repulsive interactions given by a sufficiently regular two-body potential. Furthermore, we prove the existence of a phase transition in this model and provide its phase diagram."}],"type":"journal_article","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6002","intvolume":" 229","status":"public","title":"The Bogoliubov free energy functional I: Existence of minimizers and phase diagram","publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"month":"09","doi":"10.1007/s00205-018-1232-6","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05935"}],"oa":1,"external_id":{"isi":["000435367300003"],"arxiv":["1511.05935"]},"project":[{"call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","grant_number":"P27533_N27"}],"isi":1,"quality_controlled":"1","author":[{"full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","last_name":"Napiórkowski","first_name":"Marcin M"},{"full_name":"Reuvers, Robin","last_name":"Reuvers","first_name":"Robin"},{"first_name":"Jan Philip","last_name":"Solovej","full_name":"Solovej, Jan Philip"}],"volume":229,"date_created":"2019-02-14T13:40:53Z","date_updated":"2023-09-19T14:33:12Z","year":"2018","publisher":"Springer Nature","department":[{"_id":"RoSe"}],"publication_status":"published"},{"abstract":[{"lang":"eng","text":"In pipes, turbulence sets in despite the linear stability of the laminar Hagen–Poiseuille flow. The Reynolds number ( ) for which turbulence first appears in a given experiment – the ‘natural transition point’ – depends on imperfections of the set-up, or, more precisely, on the magnitude of finite amplitude perturbations. At onset, turbulence typically only occupies a certain fraction of the flow, and this fraction equally is found to differ from experiment to experiment. Despite these findings, Reynolds proposed that after sufficiently long times, flows may settle to steady conditions: below a critical velocity, flows should (regardless of initial conditions) always return to laminar, while above this velocity, eddying motion should persist. As will be shown, even in pipes several thousand diameters long, the spatio-temporal intermittent flow patterns observed at the end of the pipe strongly depend on the initial conditions, and there is no indication that different flow patterns would eventually settle to a (statistical) steady state. Exploiting the fact that turbulent puffs do not age (i.e. they are memoryless), we continuously recreate the puff sequence exiting the pipe at the pipe entrance, and in doing so introduce periodic boundary conditions for the puff pattern. This procedure allows us to study the evolution of the flow patterns for arbitrary long times, and we find that after times in excess of advective time units, indeed a statistical steady state is reached. Although the resulting flows remain spatio-temporally intermittent, puff splitting and decay rates eventually reach a balance, so that the turbulent fraction fluctuates around a well-defined level which only depends on . In accordance with Reynolds’ proposition, we find that at lower (here 2020), flows eventually always resume to laminar, while for higher ( ), turbulence persists. The critical point for pipe flow hence falls in the interval of $2020 , which is in very good agreement with the recently proposed value of . The latter estimate was based on single-puff statistics and entirely neglected puff interactions. Unlike in typical contact processes where such interactions strongly affect the percolation threshold, in pipe flow, the critical point is only marginally influenced. Interactions, on the other hand, are responsible for the approach to the statistical steady state. As shown, they strongly affect the resulting flow patterns, where they cause ‘puff clustering’, and these regions of large puff densities are observed to travel across the puff pattern in a wave-like fashion."}],"type":"journal_article","oa_version":"Preprint","_id":"5996","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","title":"The critical point of the transition to turbulence in pipe flow","intvolume":" 839","day":"25","article_processing_charge":"No","scopus_import":"1","date_published":"2018-03-25T00:00:00Z","publication":"Journal of Fluid Mechanics","citation":{"short":"M. Vasudevan, B. Hof, Journal of Fluid Mechanics 839 (2018) 76–94.","mla":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics, vol. 839, Cambridge University Press, 2018, pp. 76–94, doi:10.1017/jfm.2017.923.","chicago":"Vasudevan, Mukund, and Björn Hof. “The Critical Point of the Transition to Turbulence in Pipe Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2018. https://doi.org/10.1017/jfm.2017.923.","ama":"Vasudevan M, Hof B. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 2018;839:76-94. doi:10.1017/jfm.2017.923","apa":"Vasudevan, M., & Hof, B. (2018). The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2017.923","ieee":"M. Vasudevan and B. Hof, “The critical point of the transition to turbulence in pipe flow,” Journal of Fluid Mechanics, vol. 839. Cambridge University Press, pp. 76–94, 2018.","ista":"Vasudevan M, Hof B. 2018. The critical point of the transition to turbulence in pipe flow. Journal of Fluid Mechanics. 839, 76–94."},"article_type":"original","page":"76-94","ec_funded":1,"author":[{"full_name":"Vasudevan, Mukund","first_name":"Mukund","last_name":"Vasudevan","id":"3C5A959A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754"}],"date_updated":"2023-09-19T14:37:49Z","date_created":"2019-02-14T12:50:50Z","volume":839,"acknowledgement":" We also thank Philipp Maier and the IST Austria workshop for theirdedicated technical support","year":"2018","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"Cambridge University Press","month":"03","publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"doi":"10.1017/jfm.2017.923","language":[{"iso":"eng"}],"external_id":{"arxiv":["1709.06372"],"isi":["000437858300003"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.06372"}],"isi":1,"quality_controlled":"1","project":[{"name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","grant_number":"306589","_id":"25152F3A-B435-11E9-9278-68D0E5697425"}]},{"doi":"10.1145/3174800","language":[{"iso":"eng"}],"external_id":{"arxiv":["1510.08517"],"isi":["000434634500003"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08517"}],"quality_controlled":"1","isi":1,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"month":"06","publication_identifier":{"issn":["0164-0925"]},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr"},{"full_name":"Hasheminezhad, Rouzbeh","last_name":"Hasheminezhad","first_name":"Rouzbeh"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1438"}]},"date_created":"2019-02-14T12:29:10Z","date_updated":"2023-09-19T14:38:42Z","volume":40,"year":"2018","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery (ACM)","ec_funded":1,"article_number":"7","date_published":"2018-06-01T00:00:00Z","publication":"ACM Transactions on Programming Languages and Systems","citation":{"chicago":"Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3174800.","short":"K. Chatterjee, H. Fu, P. Novotný, R. Hasheminezhad, ACM Transactions on Programming Languages and Systems 40 (2018).","mla":"Chatterjee, Krishnendu, et al. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2, 7, Association for Computing Machinery (ACM), 2018, doi:10.1145/3174800.","ieee":"K. Chatterjee, H. Fu, P. Novotný, and R. Hasheminezhad, “Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 2. Association for Computing Machinery (ACM), 2018.","apa":"Chatterjee, K., Fu, H., Novotný, P., & Hasheminezhad, R. (2018). Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3174800","ista":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. 2018. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 40(2), 7.","ama":"Chatterjee K, Fu H, Novotný P, Hasheminezhad R. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. ACM Transactions on Programming Languages and Systems. 2018;40(2). doi:10.1145/3174800"},"day":"01","article_processing_charge":"No","scopus_import":"1","oa_version":"Submitted Version","_id":"5993","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs","status":"public","intvolume":" 40","abstract":[{"lang":"eng","text":"In this article, we consider the termination problem of probabilistic programs with real-valued variables. Thequestions concerned are: qualitative ones that ask (i) whether the program terminates with probability 1(almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); andquantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) tocompute a boundBsuch that the probability not to terminate afterBsteps decreases exponentially (con-centration problem). To solve these questions, we utilize the notion of ranking supermartingales, which isa powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmicsynthesis of linear ranking-supermartingales over affine probabilistic programs (Apps) with both angelic anddemonic non-determinism. An important subclass of Apps is LRApp which is defined as the class of all Appsover which a linear ranking-supermartingale exists.Our main contributions are as follows. Firstly, we show that the membership problem of LRApp (i) canbe decided in polynomial time for Apps with at most demonic non-determinism, and (ii) isNP-hard and inPSPACEfor Apps with angelic non-determinism. Moreover, theNP-hardness result holds already for Appswithout probability and demonic non-determinism. Secondly, we show that the concentration problem overLRApp can be solved in the same complexity as for the membership problem of LRApp. Finally, we show thatthe expectation problem over LRApp can be solved in2EXPTIMEand isPSPACE-hard even for Apps withoutprobability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate theeffectiveness of our approach to answer the qualitative and quantitative questions over Apps with at mostdemonic non-determinism."}],"issue":"2","type":"journal_article"},{"scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"short":"Y. Yang, G. Zhao, Proceedings of the London Mathematical Society 116 (2018) 1029–1074.","mla":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” Proceedings of the London Mathematical Society, vol. 116, no. 5, Oxford University Press, 2018, pp. 1029–74, doi:10.1112/plms.12111.","chicago":"Yang, Yaping, and Gufang Zhao. “The Cohomological Hall Algebra of a Preprojective Algebra.” Proceedings of the London Mathematical Society. Oxford University Press, 2018. https://doi.org/10.1112/plms.12111.","ama":"Yang Y, Zhao G. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 2018;116(5):1029-1074. doi:10.1112/plms.12111","ieee":"Y. Yang and G. Zhao, “The cohomological Hall algebra of a preprojective algebra,” Proceedings of the London Mathematical Society, vol. 116, no. 5. Oxford University Press, pp. 1029–1074, 2018.","apa":"Yang, Y., & Zhao, G. (2018). The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. Oxford University Press. https://doi.org/10.1112/plms.12111","ista":"Yang Y, Zhao G. 2018. The cohomological Hall algebra of a preprojective algebra. Proceedings of the London Mathematical Society. 116(5), 1029–1074."},"publication":"Proceedings of the London Mathematical Society","page":"1029-1074","date_published":"2018-05-01T00:00:00Z","type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"We introduce for each quiver Q and each algebraic oriented cohomology theory A, the cohomological Hall algebra (CoHA) of Q, as the A-homology of the moduli of representations of the preprojective algebra of Q. This generalizes the K-theoretic Hall algebra of commuting varieties defined by Schiffmann-Vasserot. When A is the Morava K-theory, we show evidence that this algebra is a candidate for Lusztig's reformulated conjecture on modular representations of algebraic groups.\r\nWe construct an action of the preprojective CoHA on the A-homology of Nakajima quiver varieties. We compare this with the action of the Borel subalgebra of Yangian when A is the intersection theory. We also give a shuffle algebra description of this CoHA in terms of the underlying formal group law of A. As applications, we obtain a shuffle description of the Yangian. "}],"_id":"5999","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 116","status":"public","title":"The cohomological Hall algebra of a preprojective algebra","oa_version":"Preprint","publication_identifier":{"issn":["0024-6115"]},"month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1407.7994"}],"oa":1,"external_id":{"isi":["000431506400001"],"arxiv":["1407.7994"]},"isi":1,"quality_controlled":"1","doi":"10.1112/plms.12111","language":[{"iso":"eng"}],"year":"2018","department":[{"_id":"TaHa"}],"publisher":"Oxford University Press","publication_status":"published","author":[{"first_name":"Yaping","last_name":"Yang","full_name":"Yang, Yaping"},{"full_name":"Zhao, Gufang","id":"2BC2AC5E-F248-11E8-B48F-1D18A9856A87","last_name":"Zhao","first_name":"Gufang"}],"volume":116,"date_created":"2019-02-14T13:14:22Z","date_updated":"2023-09-19T14:37:19Z"},{"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"oa":1,"external_id":{"isi":["000429483700013"]},"language":[{"iso":"eng"}],"doi":"10.1093/gbe/evy037","month":"03","publication_identifier":{"issn":["1759-6653"]},"publication_status":"published","publisher":"Oxford University Press","department":[{"_id":"BeVi"}],"year":"2018","date_updated":"2023-09-19T14:39:08Z","date_created":"2019-02-14T12:13:52Z","volume":10,"author":[{"first_name":"Julien","last_name":"Kincaid-Smith","full_name":"Kincaid-Smith, Julien"},{"orcid":"0000-0002-8101-2518","id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","last_name":"Picard","first_name":"Marion A L","full_name":"Picard, Marion A L"},{"last_name":"Cosseau","first_name":"Céline","full_name":"Cosseau, Céline"},{"first_name":"Jérôme","last_name":"Boissier","full_name":"Boissier, Jérôme"},{"last_name":"Severac","first_name":"Dany","full_name":"Severac, Dany"},{"last_name":"Grunau","first_name":"Christoph","full_name":"Grunau, Christoph"},{"first_name":"Eve","last_name":"Toulza","full_name":"Toulza, Eve"}],"file_date_updated":"2020-07-14T12:47:15Z","page":"840-856","publication":"Genome Biology and Evolution","citation":{"ieee":"J. Kincaid-Smith et al., “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites,” Genome Biology and Evolution, vol. 10, no. 3. Oxford University Press, pp. 840–856, 2018.","apa":"Kincaid-Smith, J., Picard, M. A. L., Cosseau, C., Boissier, J., Severac, D., Grunau, C., & Toulza, E. (2018). Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evy037","ista":"Kincaid-Smith J, Picard MAL, Cosseau C, Boissier J, Severac D, Grunau C, Toulza E. 2018. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 10(3), 840–856.","ama":"Kincaid-Smith J, Picard MAL, Cosseau C, et al. Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites. Genome Biology and Evolution. 2018;10(3):840-856. doi:10.1093/gbe/evy037","chicago":"Kincaid-Smith, Julien, Marion A L Picard, Céline Cosseau, Jérôme Boissier, Dany Severac, Christoph Grunau, and Eve Toulza. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution. Oxford University Press, 2018. https://doi.org/10.1093/gbe/evy037.","short":"J. Kincaid-Smith, M.A.L. Picard, C. Cosseau, J. Boissier, D. Severac, C. Grunau, E. Toulza, Genome Biology and Evolution 10 (2018) 840–856.","mla":"Kincaid-Smith, Julien, et al. “Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites.” Genome Biology and Evolution, vol. 10, no. 3, Oxford University Press, 2018, pp. 840–56, doi:10.1093/gbe/evy037."},"date_published":"2018-03-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","title":"Parent-of-Origin-Dependent Gene Expression in Male and Female Schistosome Parasites","ddc":["570"],"status":"public","intvolume":" 10","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5989","file":[{"checksum":"736a459cb77de5824354466bb0331caf","date_updated":"2020-07-14T12:47:15Z","date_created":"2019-02-14T12:20:01Z","file_id":"5991","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":529755,"access_level":"open_access","file_name":"2018_GBE_Kincaid_Smith.pdf"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Schistosomes are the causative agents of schistosomiasis, a neglected tropical disease affecting over 230 million people worldwide.Additionally to their major impact on human health, they are also models of choice in evolutionary biology. These parasitic flatwormsare unique among the common hermaphroditic trematodes as they have separate sexes. This so-called “evolutionary scandal”displays a female heterogametic genetic sex-determination system (ZZ males and ZW females), as well as a pronounced adult sexualdimorphism. These phenotypic differences are determined by a shared set of genes in both sexes, potentially leading to intralocussexual conflicts. To resolve these conflicts in sexually selected traits, molecular mechanisms such as sex-biased gene expression couldoccur, but parent-of-origin gene expression also provides an alternative. In this work we investigated the latter mechanism, that is,genes expressed preferentially from either the maternal or the paternal allele, inSchistosoma mansonispecies. To this end, tran-scriptomes from male and female hybrid adults obtained by strain crosses were sequenced. Strain-specific single nucleotide poly-morphism (SNP) markers allowed us to discriminate the parental origin, while reciprocal crosses helped to differentiate parentalexpression from strain-specific expression. We identified genes containing SNPs expressed in a parent-of-origin manner consistentwith paternal and maternal imprints. Although the majority of the SNPs was identified in mitochondrial and Z-specific loci, theremaining SNPs found in male and female transcriptomes were situated in genes that have the potential to explain sexual differencesin schistosome parasites. Furthermore, we identified and validated four new Z-specific scaffolds.","lang":"eng"}],"issue":"3"},{"volume":"2018-October","oa_version":"None","date_created":"2019-02-17T22:59:25Z","date_updated":"2023-09-19T14:41:51Z","author":[{"last_name":"Stojanov","first_name":"Alen","full_name":"Stojanov, Alen"},{"first_name":"Tyler Michael","last_name":"Smith","full_name":"Smith, Tyler Michael"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Puschel","first_name":"Markus","full_name":"Puschel, Markus"}],"publisher":"IEEE","department":[{"_id":"DaAl"}],"status":"public","title":"Fast quantized arithmetic on x86: Trading compute for data movement","publication_status":"published","_id":"6031","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2018","abstract":[{"lang":"eng","text":"We introduce Clover, a new library for efficient computation using low-precision data, providing mathematical routines required by fundamental methods in optimization and sparse recovery. Our library faithfully implements variants of stochastic quantization that guarantee convergence at low precision, and supports data formats from 4-bit quantized to 32-bit IEEE-754 on current Intel processors. In particular, we show that 4-bit can be implemented efficiently using Intel AVX despite the lack of native support for this data format. Experimental results with dot product, matrix-vector multiplication (MVM), gradient descent (GD), and iterative hard thresholding (IHT) demonstrate that the attainable speedups are in many cases close to linear with respect to the reduction of precision due to reduced data movement. Finally, for GD and IHT, we show examples of absolute speedup achieved by 4-bit versus 32-bit, by iterating until a given target error is achieved."}],"type":"conference","article_number":"8598402","language":[{"iso":"eng"}],"date_published":"2018-12-31T00:00:00Z","doi":"10.1109/SiPS.2018.8598402","conference":{"name":"SiPS: Workshop on Signal Processing Systems","location":"Cape Town, South Africa","start_date":"2018-10-21","end_date":"2018-10-24"},"isi":1,"quality_controlled":"1","external_id":{"isi":["000465106800060"]},"citation":{"chicago":"Stojanov, Alen, Tyler Michael Smith, Dan-Adrian Alistarh, and Markus Puschel. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” In 2018 IEEE International Workshop on Signal Processing Systems, Vol. 2018–October. IEEE, 2018. https://doi.org/10.1109/SiPS.2018.8598402.","mla":"Stojanov, Alen, et al. “Fast Quantized Arithmetic on X86: Trading Compute for Data Movement.” 2018 IEEE International Workshop on Signal Processing Systems, vol. 2018–October, 8598402, IEEE, 2018, doi:10.1109/SiPS.2018.8598402.","short":"A. Stojanov, T.M. Smith, D.-A. Alistarh, M. Puschel, in:, 2018 IEEE International Workshop on Signal Processing Systems, IEEE, 2018.","ista":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. 2018. Fast quantized arithmetic on x86: Trading compute for data movement. 2018 IEEE International Workshop on Signal Processing Systems. SiPS: Workshop on Signal Processing Systems vol. 2018–October, 8598402.","ieee":"A. Stojanov, T. M. Smith, D.-A. Alistarh, and M. Puschel, “Fast quantized arithmetic on x86: Trading compute for data movement,” in 2018 IEEE International Workshop on Signal Processing Systems, Cape Town, South Africa, 2018, vol. 2018–October.","apa":"Stojanov, A., Smith, T. M., Alistarh, D.-A., & Puschel, M. (2018). Fast quantized arithmetic on x86: Trading compute for data movement. In 2018 IEEE International Workshop on Signal Processing Systems (Vol. 2018–October). Cape Town, South Africa: IEEE. https://doi.org/10.1109/SiPS.2018.8598402","ama":"Stojanov A, Smith TM, Alistarh D-A, Puschel M. Fast quantized arithmetic on x86: Trading compute for data movement. In: 2018 IEEE International Workshop on Signal Processing Systems. Vol 2018-October. IEEE; 2018. doi:10.1109/SiPS.2018.8598402"},"publication":"2018 IEEE International Workshop on Signal Processing Systems","article_processing_charge":"No","day":"31","month":"12","scopus_import":"1"},{"scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","citation":{"short":"K. Horák, B. Bošanský, K. Chatterjee, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4764–4770.","mla":"Horák, Karel, et al. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018–July, IJCAI, 2018, pp. 4764–70, doi:10.24963/ijcai.2018/662.","chicago":"Horák, Karel, Branislav Bošanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/662.","ama":"Horák K, Bošanský B, Chatterjee K. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018-July. IJCAI; 2018:4764-4770. doi:10.24963/ijcai.2018/662","apa":"Horák, K., Bošanský, B., & Chatterjee, K. (2018). Goal-HSVI: Heuristic search value iteration for goal-POMDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018–July, pp. 4764–4770). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/662","ieee":"K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.","ista":"Horák K, Bošanský B, Chatterjee K. 2018. Goal-HSVI: Heuristic search value iteration for goal-POMDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018–July, 4764–4770."},"page":"4764 - 4770","date_published":"2018-07-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are the standard models for planning under uncertainty with both finite and infinite horizon. Besides the well-known discounted-sum objective, indefinite-horizon objective (aka Goal-POMDPs) is another classical objective for POMDPs. In this case, given a set of target states and a positive cost for each transition, the optimization objective is to minimize the expected total cost until a target state is reached. In the literature, RTDP-Bel or heuristic search value iteration (HSVI) have been used for solving Goal-POMDPs. Neither of these algorithms has theoretical convergence guarantees, and HSVI may even fail to terminate its trials. We give the following contributions: (1) We discuss the challenges introduced in Goal-POMDPs and illustrate how they prevent the original HSVI from converging. (2) We present a novel algorithm inspired by HSVI, termed Goal-HSVI, and show that our algorithm has convergence guarantees. (3) We show that Goal-HSVI outperforms RTDP-Bel on a set of well-known examples."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"25","title":"Goal-HSVI: Heuristic search value iteration for goal-POMDPs","status":"public","oa_version":"Published Version","month":"07","external_id":{"isi":["000764175404127"]},"main_file_link":[{"url":"https://doi.org/10.24963/ijcai.2018/662","open_access":"1"}],"oa":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","location":"Stockholm, Sweden","start_date":"2018-07-13","end_date":"2018-07-19"},"doi":"10.24963/ijcai.2018/662","language":[{"iso":"eng"}],"ec_funded":1,"publist_id":"8030","year":"2018","acknowledgement":"∗This work has been supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games). This research was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). ","publication_status":"published","publisher":"IJCAI","department":[{"_id":"KrCh"}],"author":[{"full_name":"Horák, Karel","last_name":"Horák","first_name":"Karel"},{"full_name":"Bošanský, Branislav","first_name":"Branislav","last_name":"Bošanský"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"date_updated":"2023-09-19T14:44:59Z","date_created":"2018-12-11T11:44:13Z","volume":"2018-July"},{"publist_id":"8031","ec_funded":1,"publication_status":"published","publisher":"IJCAI","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"year":"2018","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","date_created":"2018-12-11T11:44:13Z","date_updated":"2023-09-19T14:45:48Z","volume":2018,"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","last_name":"Elgyütt","first_name":"Adrian","full_name":"Elgyütt, Adrian"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny","first_name":"Petr"},{"last_name":"Rouillé","first_name":"Owen","full_name":"Rouillé, Owen"}],"month":"07","isi":1,"quality_controlled":"1","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10601"}],"external_id":{"arxiv":["1804.10601"],"isi":["000764175404117"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","end_date":"2018-07-19","start_date":"2018-07-13","location":"Stockholm, Sweden"},"doi":"10.24963/ijcai.2018/652","type":"conference","abstract":[{"lang":"eng","text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it."}],"status":"public","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","intvolume":" 2018","_id":"24","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","page":"4692 - 4699","citation":{"ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699."},"date_published":"2018-07-01T00:00:00Z"},{"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","last_name":"Chemlík","full_name":"Chemlík, Martin"},{"first_name":"Ufuk","last_name":"Topcu","full_name":"Topcu, Ufuk"}],"volume":2018,"date_updated":"2023-09-19T14:44:14Z","date_created":"2018-12-11T11:44:16Z","year":"2018","publisher":"AAAI Press","department":[{"_id":"KrCh"}],"publication_status":"published","publist_id":"8021","ec_funded":1,"conference":{"end_date":"2018-06-29","start_date":"2018-06-24","location":"Delft, Netherlands","name":"ICAPS: International Conference on Automated Planning and Scheduling"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1710.00675","open_access":"1"}],"external_id":{"isi":["000492986200006"],"arxiv":["1710.00675"]},"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","isi":1,"month":"06","oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"34","intvolume":" 2018","title":"Sensor synthesis for POMDPs with reachability objectives","status":"public","abstract":[{"lang":"eng","text":"Partially observable Markov decision processes (POMDPs) are widely used in probabilistic planning problems in which an agent interacts with an environment using noisy and imprecise sensors. We study a setting in which the sensors are only partially defined and the goal is to synthesize “weakest” additional sensors, such that in the resulting POMDP, there is a small-memory policy for the agent that almost-surely (with probability 1) satisfies a reachability objective. We show that the problem is NP-complete, and present a symbolic algorithm by encoding the problem into SAT instances. We illustrate trade-offs between the amount of memory of the policy and the number of additional sensors on a simple example. We have implemented our approach and consider three classical POMDP examples from the literature, and show that in all the examples the number of sensors can be significantly decreased (as compared to the existing solutions in the literature) without increasing the complexity of the policies."}],"type":"conference","alternative_title":["ICAPS"],"date_published":"2018-06-01T00:00:00Z","citation":{"chicago":"Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.","short":"K. Chatterjee, M. Chemlík, U. Topcu, in:, AAAI Press, 2018, pp. 47–55.","mla":"Chatterjee, Krishnendu, et al. Sensor Synthesis for POMDPs with Reachability Objectives. Vol. 2018, AAAI Press, 2018, pp. 47–55.","ieee":"K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.","apa":"Chatterjee, K., Chemlík, M., & Topcu, U. (2018). Sensor synthesis for POMDPs with reachability objectives (Vol. 2018, pp. 47–55). Presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands: AAAI Press.","ista":"Chatterjee K, Chemlík M, Topcu U. 2018. Sensor synthesis for POMDPs with reachability objectives. ICAPS: International Conference on Automated Planning and Scheduling, ICAPS, vol. 2018, 47–55.","ama":"Chatterjee K, Chemlík M, Topcu U. Sensor synthesis for POMDPs with reachability objectives. In: Vol 2018. AAAI Press; 2018:47-55."},"page":"47 - 55","article_processing_charge":"No","day":"01","scopus_import":"1"},{"page":"269 - 304","citation":{"ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” Ars Combinatoria, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","apa":"Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3. Ars Combinatoria. Charles Babbage Research Centre.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.","ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304."},"publication":"Ars Combinatoria","date_published":"2018-10-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 141","status":"public","title":"Superconcentrators of density 25.3","_id":"18","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","type":"journal_article","issue":"10","abstract":[{"text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17].","lang":"eng"}],"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.7828"}],"external_id":{"arxiv":["1405.7828"],"isi":["000446809500022"]},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0381-7032"]},"month":"10","publisher":"Charles Babbage Research Centre","department":[{"_id":"VlKo"}],"publication_status":"published","year":"2018","volume":141,"date_updated":"2023-09-19T14:46:18Z","date_created":"2018-12-11T11:44:11Z","author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rolinek","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"publist_id":"8037"},{"date_published":"2018-05-31T00:00:00Z","citation":{"ista":"Akopyan A, Avvakumov S. 2018. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 6, e7.","ieee":"A. Akopyan and S. Avvakumov, “Any cyclic quadrilateral can be inscribed in any closed convex smooth curve,” Forum of Mathematics, Sigma, vol. 6. Cambridge University Press, 2018.","apa":"Akopyan, A., & Avvakumov, S. (2018). Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. Cambridge University Press. https://doi.org/10.1017/fms.2018.7","ama":"Akopyan A, Avvakumov S. Any cyclic quadrilateral can be inscribed in any closed convex smooth curve. Forum of Mathematics, Sigma. 2018;6. doi:10.1017/fms.2018.7","chicago":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma. Cambridge University Press, 2018. https://doi.org/10.1017/fms.2018.7.","mla":"Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma, vol. 6, e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.","short":"A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018)."},"publication":"Forum of Mathematics, Sigma","article_processing_charge":"No","has_accepted_license":"1","day":"31","oa_version":"Published Version","file":[{"checksum":"5a71b24ba712a3eb2e46165a38fbc30a","date_created":"2019-04-30T06:14:58Z","date_updated":"2020-07-14T12:47:28Z","relation":"main_file","file_id":"6356","file_size":249246,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2018_ForumMahtematics_Akopyan.pdf"}],"intvolume":" 6","status":"public","ddc":["510"],"title":"Any cyclic quadrilateral can be inscribed in any closed convex smooth curve","_id":"6355","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1017/fms.2018.7","project":[{"grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1712.10205"],"isi":["000433915500001"]},"publication_identifier":{"issn":["2050-5094"]},"month":"05","volume":6,"date_updated":"2023-09-19T14:50:12Z","date_created":"2019-04-30T06:09:57Z","related_material":{"record":[{"id":"8156","relation":"dissertation_contains","status":"public"}]},"author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov","first_name":"Sergey","full_name":"Avvakumov, Sergey"}],"publisher":"Cambridge University Press","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"JaMa"}],"publication_status":"published","year":"2018","ec_funded":1,"file_date_updated":"2020-07-14T12:47:28Z","article_number":"e7"},{"publication_identifier":{"isbn":["9781538630815"]},"article_processing_charge":"No","day":"10","month":"09","scopus_import":"1","doi":"10.1109/icra.2018.8461106","date_published":"2018-09-10T00:00:00Z","conference":{"name":"ICRA: International Conference on Robotics and Automation","location":"Brisbane, Australia","start_date":"2018-05-21","end_date":"2018-05-25"},"language":[{"iso":"eng"}],"citation":{"short":"M. Pozzi, E. Miguel Villalba, R. Deimel, M. Malvezzi, B. Bickel, O. Brock, D. Prattichizzo, in:, IEEE, 2018.","mla":"Pozzi, Maria, et al. Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains. 8461106, IEEE, 2018, doi:10.1109/icra.2018.8461106.","chicago":"Pozzi, Maria, Eder Miguel Villalba, Raphael Deimel, Monica Malvezzi, Bernd Bickel, Oliver Brock, and Domenico Prattichizzo. “Efficient FEM-Based Simulation of Soft Robots Modeled as Kinematic Chains.” IEEE, 2018. https://doi.org/10.1109/icra.2018.8461106.","ama":"Pozzi M, Miguel Villalba E, Deimel R, et al. Efficient FEM-based simulation of soft robots modeled as kinematic chains. In: IEEE; 2018. doi:10.1109/icra.2018.8461106","ieee":"M. Pozzi et al., “Efficient FEM-based simulation of soft robots modeled as kinematic chains,” presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia, 2018.","apa":"Pozzi, M., Miguel Villalba, E., Deimel, R., Malvezzi, M., Bickel, B., Brock, O., & Prattichizzo, D. (2018). Efficient FEM-based simulation of soft robots modeled as kinematic chains. Presented at the ICRA: International Conference on Robotics and Automation, Brisbane, Australia: IEEE. https://doi.org/10.1109/icra.2018.8461106","ista":"Pozzi M, Miguel Villalba E, Deimel R, Malvezzi M, Bickel B, Brock O, Prattichizzo D. 2018. Efficient FEM-based simulation of soft robots modeled as kinematic chains. ICRA: International Conference on Robotics and Automation, 8461106."},"external_id":{"isi":["000446394503031"]},"quality_controlled":"1","isi":1,"abstract":[{"lang":"eng","text":"In the context of robotic manipulation and grasping, the shift from a view that is static (force closure of a single posture) and contact-deprived (only contact for force closure is allowed, everything else is obstacle) towards a view that is dynamic and contact-rich (soft manipulation) has led to an increased interest in soft hands. These hands can easily exploit environmental constraints and object surfaces without risk, and safely interact with humans, but present also some challenges. Designing them is difficult, as well as predicting, modelling, and “programming” their interactions with the objects and the environment. This paper tackles the problem of simulating them in a fast and effective way, leveraging on novel and existing simulation technologies. We present a triple-layered simulation framework where dynamic properties such as stiffness are determined from slow but accurate FEM simulation data once, and then condensed into a lumped parameter model that can be used to fast simulate soft fingers and soft hands. We apply our approach to the simulation of soft pneumatic fingers."}],"type":"conference","article_number":"8461106","author":[{"full_name":"Pozzi, Maria","first_name":"Maria","last_name":"Pozzi"},{"orcid":"0000-0001-5665-0430","id":"3FB91342-F248-11E8-B48F-1D18A9856A87","last_name":"Miguel Villalba","first_name":"Eder","full_name":"Miguel Villalba, Eder"},{"full_name":"Deimel, Raphael","first_name":"Raphael","last_name":"Deimel"},{"last_name":"Malvezzi","first_name":"Monica","full_name":"Malvezzi, Monica"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"first_name":"Oliver","last_name":"Brock","full_name":"Brock, Oliver"},{"full_name":"Prattichizzo, Domenico","last_name":"Prattichizzo","first_name":"Domenico"}],"oa_version":"None","date_updated":"2023-09-19T14:49:03Z","date_created":"2019-04-04T09:50:38Z","year":"2018","_id":"6195","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","department":[{"_id":"BeBi"}],"status":"public","publication_status":"published","title":"Efficient FEM-based simulation of soft robots modeled as kinematic chains"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-58387-6_26","conference":{"name":"FC: Financial Cryptography and Data Security","end_date":"2018-03-02","location":"Nieuwpoort, Curacao","start_date":"2018-02-26"},"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000540656400026"]},"main_file_link":[{"url":"https://eprint.iacr.org/2015/528","open_access":"1"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783662583869","9783662583876"],"eissn":["1611-3349"]},"month":"12","volume":10957,"date_updated":"2023-09-19T15:02:13Z","date_created":"2019-10-14T06:35:38Z","author":[{"last_name":"Park","first_name":"Sunoo","full_name":"Park, Sunoo"},{"last_name":"Kwon","first_name":"Albert","full_name":"Kwon, Albert"},{"last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"last_name":"Gazi","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"publisher":"Springer Nature","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2018","ec_funded":1,"date_published":"2018-12-07T00:00:00Z","page":"480-499","citation":{"ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26","ista":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.","chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26."},"publication":"22nd International Conference on Financial Cryptography and Data Security","article_processing_charge":"No","day":"07","scopus_import":"1","oa_version":"Submitted Version","intvolume":" 10957","status":"public","title":"SpaceMint: A cryptocurrency based on proofs of space","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6941","abstract":[{"text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference"},{"citation":{"ista":"Moalli F, Ficht X, Germann P, Vladymyrov M, Stolp B, de Vries I, Lyck R, Balmer J, Fiocchi A, Kreutzfeldt M, Merkler D, Iannacone M, Ariga A, Stoffel MH, Sharpe J, Bähler M, Sixt MK, Diz-Muñoz A, Stein JV. 2018. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. 2015(7), 1869–1890.","ieee":"F. Moalli et al., “The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells,” The Journal of Experimental Medicine, vol. 2015, no. 7. Rockefeller University Press, pp. 1869–1890, 2018.","apa":"Moalli, F., Ficht, X., Germann, P., Vladymyrov, M., Stolp, B., de Vries, I., … Stein, J. V. (2018). The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. Rockefeller University Press. https://doi.org/10.1084/jem.20170896","ama":"Moalli F, Ficht X, Germann P, et al. The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells. The Journal of Experimental Medicine. 2018;2015(7):1869–1890. doi:10.1084/jem.20170896","chicago":"Moalli, Federica, Xenia Ficht, Philipp Germann, Mykhailo Vladymyrov, Bettina Stolp, Ingrid de Vries, Ruth Lyck, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine. Rockefeller University Press, 2018. https://doi.org/10.1084/jem.20170896.","mla":"Moalli, Federica, et al. “The Rho Regulator Myosin IXb Enables Nonlymphoid Tissue Seeding of Protective CD8+T Cells.” The Journal of Experimental Medicine, vol. 2015, no. 7, Rockefeller University Press, 2018, pp. 1869–1890, doi:10.1084/jem.20170896.","short":"F. Moalli, X. Ficht, P. Germann, M. Vladymyrov, B. Stolp, I. de Vries, R. Lyck, J. Balmer, A. Fiocchi, M. Kreutzfeldt, D. Merkler, M. Iannacone, A. Ariga, M.H. Stoffel, J. Sharpe, M. Bähler, M.K. Sixt, A. Diz-Muñoz, J.V. Stein, The Journal of Experimental Medicine 2015 (2018) 1869–1890."},"publication":"The Journal of Experimental Medicine","page":"1869–1890","date_published":"2018-06-06T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"06","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6497","intvolume":" 2015","status":"public","ddc":["570"],"title":"The Rho regulator Myosin IXb enables nonlymphoid tissue seeding of protective CD8+T cells","file":[{"checksum":"86ae5331f9bfced9a6358a790a04bef4","date_created":"2019-05-28T12:40:05Z","date_updated":"2020-07-14T12:47:32Z","file_id":"6498","relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_size":3841660,"access_level":"open_access","file_name":"2018_rupress_Moalli.pdf"}],"oa_version":"Published Version","type":"journal_article","issue":"7","abstract":[{"text":"T cells are actively scanning pMHC-presenting cells in lymphoid organs and nonlymphoid tissues (NLTs) with divergent topologies and confinement. How the T cell actomyosin cytoskeleton facilitates this task in distinct environments is incompletely understood. Here, we show that lack of Myosin IXb (Myo9b), a negative regulator of the small GTPase Rho, led to increased Rho-GTP levels and cell surface stiffness in primary T cells. Nonetheless, intravital imaging revealed robust motility of Myo9b−/− CD8+ T cells in lymphoid tissue and similar expansion and differentiation during immune responses. In contrast, accumulation of Myo9b−/− CD8+ T cells in NLTs was strongly impaired. Specifically, Myo9b was required for T cell crossing of basement membranes, such as those which are present between dermis and epidermis. As consequence, Myo9b−/− CD8+ T cells showed impaired control of skin infections. In sum, we show that Myo9b is critical for the CD8+ T cell adaptation from lymphoid to NLT surveillance and the establishment of protective tissue–resident T cell populations.","lang":"eng"}],"external_id":{"isi":["000440822900011"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1084/jem.20170896","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-1007"],"eissn":["1540-9538"]},"month":"06","year":"2018","department":[{"_id":"MiSi"}],"publisher":"Rockefeller University Press","publication_status":"published","author":[{"full_name":"Moalli, Federica","last_name":"Moalli","first_name":"Federica"},{"last_name":"Ficht","first_name":"Xenia","full_name":"Ficht, Xenia"},{"last_name":"Germann","first_name":"Philipp","full_name":"Germann, Philipp"},{"first_name":"Mykhailo","last_name":"Vladymyrov","full_name":"Vladymyrov, Mykhailo"},{"first_name":"Bettina","last_name":"Stolp","full_name":"Stolp, Bettina"},{"full_name":"de Vries, Ingrid","first_name":"Ingrid","last_name":"de Vries","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ruth","last_name":"Lyck","full_name":"Lyck, Ruth"},{"full_name":"Balmer, Jasmin","first_name":"Jasmin","last_name":"Balmer"},{"full_name":"Fiocchi, Amleto","last_name":"Fiocchi","first_name":"Amleto"},{"first_name":"Mario","last_name":"Kreutzfeldt","full_name":"Kreutzfeldt, Mario"},{"full_name":"Merkler, Doron","first_name":"Doron","last_name":"Merkler"},{"full_name":"Iannacone, Matteo","last_name":"Iannacone","first_name":"Matteo"},{"full_name":"Ariga, Akitaka","first_name":"Akitaka","last_name":"Ariga"},{"full_name":"Stoffel, Michael H.","last_name":"Stoffel","first_name":"Michael H."},{"full_name":"Sharpe, James","last_name":"Sharpe","first_name":"James"},{"full_name":"Bähler, Martin","first_name":"Martin","last_name":"Bähler"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"},{"first_name":"Alba","last_name":"Diz-Muñoz","full_name":"Diz-Muñoz, Alba"},{"full_name":"Stein, Jens V.","first_name":"Jens V.","last_name":"Stein"}],"volume":2015,"date_created":"2019-05-28T12:36:47Z","date_updated":"2023-09-19T14:52:08Z","file_date_updated":"2020-07-14T12:47:32Z"},{"issue":"9","abstract":[{"lang":"eng","text":"Expansion microscopy is a recently introduced imaging technique that achieves super‐resolution through physically expanding the specimen by ~4×, after embedding into a swellable gel. The resolution attained is, correspondingly, approximately fourfold better than the diffraction limit, or ~70 nm. This is a major improvement over conventional microscopy, but still lags behind modern STED or STORM setups, whose resolution can reach 20–30 nm. We addressed this issue here by introducing an improved gel recipe that enables an expansion factor of ~10× in each dimension, which corresponds to an expansion of the sample volume by more than 1,000‐fold. Our protocol, which we termed X10 microscopy, achieves a resolution of 25–30 nm on conventional epifluorescence microscopes. X10 provides multi‐color images similar or even superior to those produced with more challenging methods, such as STED, STORM, and iterative expansion microscopy (iExM). X10 is therefore the cheapest and easiest option for high‐quality super‐resolution imaging currently available. X10 should be usable in any laboratory, irrespective of the machinery owned or of the technical knowledge."}],"type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"6500","checksum":"6ec90abc637f09cca3a7b6424d7e7a26","date_created":"2019-05-28T13:17:19Z","date_updated":"2020-07-14T12:47:32Z","access_level":"open_access","file_name":"2018_embo_Truckenbrodt.pdf","file_size":2005572,"content_type":"application/pdf","creator":"kschuh"}],"intvolume":" 19","title":"X10 expansion microscopy enables 25‐nm resolution on conventional microscopes","status":"public","ddc":["580"],"_id":"6499","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","date_published":"2018-09-01T00:00:00Z","citation":{"ama":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO reports. 2018;19(9). doi:10.15252/embr.201845836","ieee":"S. M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, and S. O. Rizzoli, “X10 expansion microscopy enables 25‐nm resolution on conventional microscopes,” EMBO reports, vol. 19, no. 9. EMBO, 2018.","apa":"Truckenbrodt, S. M., Maidorn, M., Crzan, D., Wildhagen, H., Kabatas, S., & Rizzoli, S. O. (2018). X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO Reports. EMBO. https://doi.org/10.15252/embr.201845836","ista":"Truckenbrodt SM, Maidorn M, Crzan D, Wildhagen H, Kabatas S, Rizzoli SO. 2018. X10 expansion microscopy enables 25‐nm resolution on conventional microscopes. EMBO reports. 19(9), e45836.","short":"S.M. Truckenbrodt, M. Maidorn, D. Crzan, H. Wildhagen, S. Kabatas, S.O. Rizzoli, EMBO Reports 19 (2018).","mla":"Truckenbrodt, Sven M., et al. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” EMBO Reports, vol. 19, no. 9, e45836, EMBO, 2018, doi:10.15252/embr.201845836.","chicago":"Truckenbrodt, Sven M, Manuel Maidorn, Dagmar Crzan, Hanna Wildhagen, Selda Kabatas, and Silvio O Rizzoli. “X10 Expansion Microscopy Enables 25‐nm Resolution on Conventional Microscopes.” EMBO Reports. EMBO, 2018. https://doi.org/10.15252/embr.201845836."},"publication":"EMBO reports","file_date_updated":"2020-07-14T12:47:32Z","article_number":"e45836","volume":19,"date_updated":"2023-09-19T14:52:32Z","date_created":"2019-05-28T13:16:08Z","author":[{"full_name":"Truckenbrodt, Sven M","first_name":"Sven M","last_name":"Truckenbrodt","id":"45812BD4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maidorn, Manuel","first_name":"Manuel","last_name":"Maidorn"},{"first_name":"Dagmar","last_name":"Crzan","full_name":"Crzan, Dagmar"},{"last_name":"Wildhagen","first_name":"Hanna","full_name":"Wildhagen, Hanna"},{"last_name":"Kabatas","first_name":"Selda","full_name":"Kabatas, Selda"},{"last_name":"Rizzoli","first_name":"Silvio O","full_name":"Rizzoli, Silvio O"}],"publisher":"EMBO","department":[{"_id":"JoDa"}],"publication_status":"published","year":"2018","publication_identifier":{"issn":["1469-221X"],"eissn":["1469-3178"]},"month":"09","language":[{"iso":"eng"}],"doi":"10.15252/embr.201845836","isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000443682200009"]},"oa":1},{"day":"30","month":"01","article_processing_charge":"No","publication_identifier":{"isbn":["9781611975031"]},"publication":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms","citation":{"short":"D.-A. Alistarh, J. Aspnes, R. Gelashvili, in:, Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–2239.","mla":"Alistarh, Dan-Adrian, et al. “Space-Optimal Majority in Population Protocols.” Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, 2018, pp. 2221–39, doi:10.1137/1.9781611975031.144.","chicago":"Alistarh, Dan-Adrian, James Aspnes, and Rati Gelashvili. “Space-Optimal Majority in Population Protocols.” In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 2221–39. ACM, 2018. https://doi.org/10.1137/1.9781611975031.144.","ama":"Alistarh D-A, Aspnes J, Gelashvili R. Space-optimal majority in population protocols. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM; 2018:2221-2239. doi:10.1137/1.9781611975031.144","ieee":"D.-A. Alistarh, J. Aspnes, and R. Gelashvili, “Space-optimal majority in population protocols,” in Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 2221–2239.","apa":"Alistarh, D.-A., Aspnes, J., & Gelashvili, R. (2018). Space-optimal majority in population protocols. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2221–2239). New Orleans, LA, United States: ACM. https://doi.org/10.1137/1.9781611975031.144","ista":"Alistarh D-A, Aspnes J, Gelashvili R. 2018. Space-optimal majority in population protocols. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2221–2239."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1704.04947"}],"oa":1,"external_id":{"isi":["000483921200145"],"arxiv":["1704.04947"]},"isi":1,"quality_controlled":"1","page":"2221-2239","conference":{"start_date":"2018-01-07","location":"New Orleans, LA, United States","end_date":"2018-01-10","name":"SODA: Symposium on Discrete Algorithms"},"doi":"10.1137/1.9781611975031.144","date_published":"2018-01-30T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"Population protocols are a popular model of distributed computing, in which n agents with limited local state interact randomly, and cooperate to collectively compute global predicates. Inspired by recent developments in DNA programming, an extensive series of papers, across different communities, has examined the computability and complexity characteristics of this model. Majority, or consensus, is a central task in this model, in which agents need to collectively reach a decision as to which one of two states A or B had a higher initial count. Two metrics are important: the time that a protocol requires to stabilize to an output decision, and the state space size that each agent requires to do so. It is known that majority requires Ω(log log n) states per agent to allow for fast (poly-logarithmic time) stabilization, and that O(log2 n) states are sufficient. Thus, there is an exponential gap between the space upper and lower bounds for this problem. This paper addresses this question.\r\n\r\nOn the negative side, we provide a new lower bound of Ω(log n) states for any protocol which stabilizes in O(n1–c) expected time, for any constant c > 0. This result is conditional on monotonicity and output assumptions, satisfied by all known protocols. Technically, it represents a departure from previous lower bounds, in that it does not rely on the existence of dense configurations. Instead, we introduce a new generalized surgery technique to prove the existence of incorrect executions for any algorithm which would contradict the lower bound. Subsequently, our lower bound also applies to general initial configurations, including ones with a leader. On the positive side, we give a new algorithm for majority which uses O(log n) states, and stabilizes in O(log2 n) expected time. Central to the algorithm is a new leaderless phase clock technique, which allows agents to synchronize in phases of Θ(n log n) consecutive interactions using O(log n) states per agent, exploiting a new connection between population protocols and power-of-two-choices load balancing mechanisms. We also employ our phase clock to build a leader election algorithm with a state space of size O(log n), which stabilizes in O(log2 n) expected time."}],"_id":"7123","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2018","status":"public","publication_status":"published","title":"Space-optimal majority in population protocols","publisher":"ACM","department":[{"_id":"DaAl"}],"author":[{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"last_name":"Gelashvili","first_name":"Rati","full_name":"Gelashvili, Rati"}],"date_created":"2019-11-26T15:10:55Z","date_updated":"2023-09-19T15:03:16Z","oa_version":"Preprint"},{"file_date_updated":"2021-08-16T07:48:03Z","related_material":{"record":[{"status":"public","relation":"research_data","id":"9930"}]},"author":[{"last_name":"Westram","first_name":"Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","full_name":"Westram, Anja M"},{"full_name":"Rafajlović, Marina","first_name":"Marina","last_name":"Rafajlović"},{"last_name":"Chaube","first_name":"Pragya","full_name":"Chaube, Pragya"},{"full_name":"Faria, Rui","last_name":"Faria","first_name":"Rui"},{"full_name":"Larsson, Tomas","last_name":"Larsson","first_name":"Tomas"},{"full_name":"Panova, Marina","last_name":"Panova","first_name":"Marina"},{"full_name":"Ravinet, Mark","last_name":"Ravinet","first_name":"Mark"},{"full_name":"Blomberg, Anders","first_name":"Anders","last_name":"Blomberg"},{"last_name":"Mehlig","first_name":"Bernhard","full_name":"Mehlig, Bernhard"},{"first_name":"Kerstin","last_name":"Johannesson","full_name":"Johannesson, Kerstin"},{"last_name":"Butlin","first_name":"Roger","full_name":"Butlin, Roger"}],"volume":2,"date_created":"2021-08-16T07:45:38Z","date_updated":"2023-09-19T15:08:25Z","pmid":1,"year":"2018","acknowledgement":"We are very grateful to people who helped with fieldwork, snail processing, and DNA extractions, particularly Laura Brettell, Mårten Duvetorp, Juan Galindo, Anne-Lise Liabot and Irena Senčić. We would also like to thank Magnus Alm Rosenblad and Mats Töpel for their contribution to assembling the Littorina saxatilis genome, Carl André, Pasi Rastas, and Romain Villoutreix for discussion, and two anonymous reviewers for their helpful comments on the manuscript. We are grateful to RapidGenomics for library preparation and sequencing. We thank the Natural Environment Research Council, the European Research Council and the Swedish Research Councils VR and Formas (Linnaeus grant to the Centre for Marine Evolutionary Biology and Tage Erlander Guest Professorship) for funding. P.C. was funded by the University of Sheffield Vice-chancellor's India scholarship. R.F. is funded by the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 706376. M. Raf. was supported by the Adlerbert Research Foundation.","department":[{"_id":"BeVi"}],"publisher":"Wiley","publication_status":"published","publication_identifier":{"eissn":["2056-3744"],"issn":["2056-3744"]},"month":"08","doi":"10.1002/evl3.74","language":[{"iso":"eng"}],"external_id":{"isi":["000446774400004"],"pmid":["30283683"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"isi":1,"quality_controlled":"1","issue":"4","abstract":[{"text":"Adaptive divergence and speciation may happen despite opposition by gene flow. Identifying the genomic basis underlying divergence with gene flow is a major task in evolutionary genomics. Most approaches (e.g., outlier scans) focus on genomic regions of high differentiation. However, not all genomic architectures potentially underlying divergence are expected to show extreme differentiation. Here, we develop an approach that combines hybrid zone analysis (i.e., focuses on spatial patterns of allele frequency change) with system-specific simulations to identify loci inconsistent with neutral evolution. We apply this to a genome-wide SNP set from an ideally suited study organism, the intertidal snail Littorina saxatilis, which shows primary divergence between ecotypes associated with different shore habitats. We detect many SNPs with clinal patterns, most of which are consistent with neutrality. Among non-neutral SNPs, most are located within three large putative inversions differentiating ecotypes. Many non-neutral SNPs show relatively low levels of differentiation. We discuss potential reasons for this pattern, including loose linkage to selected variants, polygenic adaptation and a component of balancing selection within populations (which may be expected for inversions). Our work is in line with theory predicting a role for inversions in divergence, and emphasizes that genomic regions contributing to divergence may not always be accessible with methods purely based on allele frequency differences. These conclusions call for approaches that take spatial patterns of allele frequency change into account in other systems.","lang":"eng"}],"type":"journal_article","file":[{"checksum":"8524e72507d521416be3f8ccfcd5e3f5","success":1,"date_updated":"2021-08-16T07:48:03Z","date_created":"2021-08-16T07:48:03Z","relation":"main_file","file_id":"9918","content_type":"application/pdf","file_size":764299,"creator":"asandaue","access_level":"open_access","file_name":"2018_EvolutionLetters_Westram.pdf"}],"oa_version":"Published Version","_id":"9917","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 2","ddc":["570"],"status":"public","title":"Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow","has_accepted_license":"1","article_processing_charge":"Yes","day":"20","date_published":"2018-08-20T00:00:00Z","citation":{"ama":"Westram AM, Rafajlović M, Chaube P, et al. Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. 2018;2(4):297-309. doi:10.1002/evl3.74","ista":"Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. 2(4), 297–309.","ieee":"A. M. Westram et al., “Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow,” Evolution Letters, vol. 2, no. 4. Wiley, pp. 297–309, 2018.","apa":"Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova, M., … Butlin, R. (2018). Clines on the seashore: The genomic architecture underlying rapid divergence in the face of gene flow. Evolution Letters. Wiley. https://doi.org/10.1002/evl3.74","mla":"Westram, Anja M., et al. “Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters, vol. 2, no. 4, Wiley, 2018, pp. 297–309, doi:10.1002/evl3.74.","short":"A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova, M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, Evolution Letters 2 (2018) 297–309.","chicago":"Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson, Marina Panova, Mark Ravinet, et al. “Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Evolution Letters. Wiley, 2018. https://doi.org/10.1002/evl3.74."},"publication":"Evolution Letters","page":"297-309","article_type":"letter_note"},{"month":"12","publication_identifier":{"issn":[" 2056-3744"],"eissn":["2056-3744"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000452990000002"],"pmid":["30564439"]},"isi":1,"quality_controlled":"1","doi":"10.1002/evl3.85","language":[{"iso":"eng"}],"file_date_updated":"2021-08-16T07:37:28Z","year":"2018","acknowledgement":"The authors express a special thanks to Dr Richard Willan at the Museum and Art Gallery of the Northern Territory for guidance and support in the field, and to Carole Smadja for reading and commenting on the manuscript. The authors thank the Government of Western Australia Department of Parks and Wildlife (license no. 009254) and Fishery Research Division (exemption no. 2262) for assistance with permits. Khalid Belkhir modified the coalescent sampler msnsam for the specific needs of this project and Martin Hirsch helped to set up the ABC pipeline and to modify the summary statistic calculator mscalc. The authors are grateful to the Crafoord Foundation for supporting this project. R.K.B., A.M.W., and L.D. were supported by grants from the Natural Environment Research Council, R.K.B. and A.M.W. were also supported by the European Research Council and R.K.B. and L.D. by the Leverhulme Trust. M.M.R. was supported by Consejo Nacional de Ciencia y Tecnología and Secretaría de Educación Pública, Mexico. G.B. was supported by the Centre for Animal Movement Research (CAnMove) financed by a Linnaeus grant (No. 349-2007-8690) from the Swedish Research Council and Lund University.","pmid":1,"publication_status":"published","publisher":"Wiley","department":[{"_id":"BeVi"}],"author":[{"full_name":"Hollander, Johan","last_name":"Hollander","first_name":"Johan"},{"full_name":"Montaño-Rendón, Mauricio","last_name":"Montaño-Rendón","first_name":"Mauricio"},{"full_name":"Bianco, Giuseppe","first_name":"Giuseppe","last_name":"Bianco"},{"first_name":"Xi","last_name":"Yang","full_name":"Yang, Xi"},{"last_name":"Westram","first_name":"Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","full_name":"Westram, Anja M"},{"full_name":"Duvaux, Ludovic","last_name":"Duvaux","first_name":"Ludovic"},{"full_name":"Reid, David G.","last_name":"Reid","first_name":"David G."},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."}],"related_material":{"record":[{"id":"9929","relation":"research_data","status":"public"}]},"date_created":"2021-08-16T07:30:00Z","date_updated":"2023-09-19T15:08:53Z","volume":2,"day":"13","has_accepted_license":"1","article_processing_charge":"Yes","publication":"Evolution Letters","citation":{"chicago":"Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters. Wiley, 2018. https://doi.org/10.1002/evl3.85.","short":"J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux, D.G. Reid, R.K. Butlin, Evolution Letters 2 (2018) 557–566.","mla":"Hollander, Johan, et al. “Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Evolution Letters, vol. 2, no. 6, Wiley, 2018, pp. 557–66, doi:10.1002/evl3.85.","ieee":"J. Hollander et al., “Are assortative mating and genital divergence driven by reinforcement?,” Evolution Letters, vol. 2, no. 6. Wiley, pp. 557–566, 2018.","apa":"Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux, L., … Butlin, R. K. (2018). Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. Wiley. https://doi.org/10.1002/evl3.85","ista":"Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid DG, Butlin RK. 2018. Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. 2(6), 557–566.","ama":"Hollander J, Montaño-Rendón M, Bianco G, et al. Are assortative mating and genital divergence driven by reinforcement? Evolution Letters. 2018;2(6):557-566. doi:10.1002/evl3.85"},"article_type":"letter_note","page":"557-566","date_published":"2018-12-13T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"The evolution of assortative mating is a key part of the speciation process. Stronger assortment, or greater divergence in mating traits, between species pairs with overlapping ranges is commonly observed, but possible causes of this pattern of reproductive character displacement are difficult to distinguish. We use a multidisciplinary approach to provide a rare example where it is possible to distinguish among hypotheses concerning the evolution of reproductive character displacement. We build on an earlier comparative analysis that illustrated a strong pattern of greater divergence in penis form between pairs of sister species with overlapping ranges than between allopatric sister-species pairs, in a large clade of marine gastropods (Littorinidae). We investigate both assortative mating and divergence in male genitalia in one of the sister-species pairs, discriminating among three contrasting processes each of which can generate a pattern of reproductive character displacement: reinforcement, reproductive interference and the Templeton effect. We demonstrate reproductive character displacement in assortative mating, but not in genital form between this pair of sister species and use demographic models to distinguish among the different processes. Our results support a model with no gene flow since secondary contact and thus favor reproductive interference as the cause of reproductive character displacement for mate choice, rather than reinforcement. High gene flow within species argues against the Templeton effect. Secondary contact appears to have had little impact on genital divergence."}],"issue":"6","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"9915","ddc":["570"],"status":"public","title":"Are assortative mating and genital divergence driven by reinforcement?","intvolume":" 2","oa_version":"Published Version","file":[{"file_name":"2018_EvolutionLetters_Hollander.pdf","access_level":"open_access","creator":"asandaue","file_size":584606,"content_type":"application/pdf","file_id":"9916","relation":"main_file","date_updated":"2021-08-16T07:37:28Z","date_created":"2021-08-16T07:37:28Z","success":1,"checksum":"997a78ac41c809975ca69cbdea441f88"}]},{"file":[{"access_level":"open_access","file_name":"2018_ScientificReports_Gregor.pdf","content_type":"application/pdf","file_size":2818077,"creator":"dernst","relation":"main_file","file_id":"8619","checksum":"e642080fcbde9584c63544f587c74f03","success":1,"date_updated":"2020-10-06T16:35:16Z","date_created":"2020-10-06T16:35:16Z"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8618","title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA","ddc":["570"],"status":"public","intvolume":" 8","abstract":[{"text":"The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting.","lang":"eng"}],"type":"journal_article","date_published":"2018-02-09T00:00:00Z","publication":"Scientific Reports","citation":{"ama":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 2018;8. doi:10.1038/s41598-018-19947-1","apa":"Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., & Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-018-19947-1","ieee":"C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S. W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA,” Scientific Reports, vol. 8. Springer Nature, 2018.","ista":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018).","mla":"Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” Scientific Reports, vol. 8, 2724, Springer Nature, 2018, doi:10.1038/s41598-018-19947-1.","chicago":"Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” Scientific Reports. Springer Nature, 2018. https://doi.org/10.1038/s41598-018-19947-1."},"article_type":"original","day":"09","article_processing_charge":"No","has_accepted_license":"1","keyword":["Multidisciplinary"],"author":[{"first_name":"Carola","last_name":"Gregor","full_name":"Gregor, Carola"},{"first_name":"Sven C.","last_name":"Sidenstein","full_name":"Sidenstein, Sven C."},{"full_name":"Andresen, Martin","last_name":"Andresen","first_name":"Martin"},{"last_name":"Sahl","first_name":"Steffen J.","full_name":"Sahl, Steffen J."},{"full_name":"Danzl, Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","first_name":"Johann G","last_name":"Danzl"},{"full_name":"Hell, Stefan W.","last_name":"Hell","first_name":"Stefan W."}],"date_created":"2020-10-06T16:33:37Z","date_updated":"2023-09-19T15:04:49Z","volume":8,"year":"2018","pmid":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"JoDa"}],"file_date_updated":"2020-10-06T16:35:16Z","article_number":"2724","doi":"10.1038/s41598-018-19947-1","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["29426833"],"isi":["000424630400037"]},"quality_controlled":"1","isi":1,"month":"02","publication_identifier":{"issn":["2045-2322"]}},{"month":"04","publication_identifier":{"issn":["0022-0957"],"eissn":["1460-2431"]},"language":[{"iso":"eng"}],"doi":"10.1093/jxb/ery097","isi":1,"quality_controlled":"1","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"external_id":{"pmid":["29538714"],"isi":["000430727000016"]},"ec_funded":1,"date_updated":"2023-09-19T15:10:43Z","date_created":"2022-03-18T12:43:22Z","volume":69,"author":[{"full_name":"Moturu, Taraka Ramji","first_name":"Taraka Ramji","last_name":"Moturu"},{"first_name":"Sravankumar","last_name":"Thula","full_name":"Thula, Sravankumar"},{"first_name":"Ravi Kumar","last_name":"Singh","full_name":"Singh, Ravi Kumar"},{"last_name":"Nodzyński","first_name":"Tomasz","full_name":"Nodzyński, Tomasz"},{"first_name":"Radka Svobodová","last_name":"Vařeková","full_name":"Vařeková, Radka Svobodová"},{"full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml"},{"last_name":"Simon","first_name":"Sibu","full_name":"Simon, Sibu"}],"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Oxford University Press","acknowledgement":"This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Actions and it is co-financed by the South Moravian Region under grant agreement No. 665860 (SS). Access to computing and storage facilities owned by parties and projects contributing to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects of Large Infrastructure for Research, Development, and Innovations’ (LM2010005) was greatly appreciated (RSV). The project was funded by The Ministry of Education, Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601) (TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG 20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly the authors’ views, and the EU is not responsible for any use that may be made of the information it contains. ","year":"2018","pmid":1,"day":"13","article_processing_charge":"No","keyword":["Plant Science","Physiology"],"scopus_import":"1","date_published":"2018-04-13T00:00:00Z","article_type":"original","page":"2367-2378","publication":"Journal of Experimental Botany","citation":{"chicago":"Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński, Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and Diversification of the SMXL Gene Family.” Journal of Experimental Botany. Oxford University Press, 2018. https://doi.org/10.1093/jxb/ery097.","mla":"Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the SMXL Gene Family.” Journal of Experimental Botany, vol. 69, no. 9, Oxford University Press, 2018, pp. 2367–78, doi:10.1093/jxb/ery097.","short":"T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml, S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.","ista":"Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S. 2018. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 69(9), 2367–2378.","apa":"Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml, J., & Simon, S. (2018). Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/ery097","ieee":"T. R. Moturu et al., “Molecular evolution and diversification of the SMXL gene family,” Journal of Experimental Botany, vol. 69, no. 9. Oxford University Press, pp. 2367–2378, 2018.","ama":"Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 2018;69(9):2367-2378. doi:10.1093/jxb/ery097"},"abstract":[{"text":"Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants.","lang":"eng"}],"issue":"9","type":"journal_article","oa_version":"None","title":"Molecular evolution and diversification of the SMXL gene family","status":"public","intvolume":" 69","_id":"10881","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"publication_identifier":{"issn":["2041-2649"],"eissn":["2041-2657"]},"month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/bfgp/ely007"}],"external_id":{"isi":["000456054400004"],"pmid":["29579140"]},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1093/bfgp/ely007","language":[{"iso":"eng"}],"pmid":1,"year":"2018","acknowledgement":"This work was supported by JSPS overseas research fellowships (Y.M.) and SENSHIN Medical Research Foundation (K.K.T.).","department":[{"_id":"CaHe"}],"publisher":"Oxford University Press","publication_status":"published","author":[{"full_name":"Yuuta, Moriyama","orcid":"0000-0002-2853-8051","id":"4968E7C8-F248-11E8-B48F-1D18A9856A87","last_name":"Yuuta","first_name":"Moriyama"},{"full_name":"Koshiba-Takeuchi, Kazuko","last_name":"Koshiba-Takeuchi","first_name":"Kazuko"}],"volume":17,"date_updated":"2023-09-19T15:11:22Z","date_created":"2022-03-18T12:40:35Z","scopus_import":"1","keyword":["Genetics","Molecular Biology","Biochemistry","General Medicine"],"article_processing_charge":"No","day":"01","citation":{"ama":"Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 2018;17(5):329-338. doi:10.1093/bfgp/ely007","apa":"Yuuta, M., & Koshiba-Takeuchi, K. (2018). Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. Oxford University Press. https://doi.org/10.1093/bfgp/ely007","ieee":"M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications on the emergence of evolutionary novelties,” Briefings in Functional Genomics, vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.","ista":"Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 17(5), 329–338.","short":"M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018) 329–338.","mla":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional Genomics, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:10.1093/bfgp/ely007.","chicago":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” Briefings in Functional Genomics. Oxford University Press, 2018. https://doi.org/10.1093/bfgp/ely007."},"publication":"Briefings in Functional Genomics","page":"329-338","article_type":"original","date_published":"2018-09-01T00:00:00Z","type":"journal_article","issue":"5","abstract":[{"lang":"eng","text":"Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10880","intvolume":" 17","title":"Significance of whole-genome duplications on the emergence of evolutionary novelties","status":"public","oa_version":"Published Version"},{"day":"23","month":"07","article_processing_charge":"No","doi":"10.5061/dryad.bp25b65","date_published":"2018-07-23T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.5061/dryad.bp25b65","open_access":"1"}],"citation":{"chicago":"Westram, Anja M, Marina Rafajlović, Pragya Chaube, Rui Faria, Tomas Larsson, Marina Panova, Mark Ravinet, et al. “Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow.” Dryad, 2018. https://doi.org/10.5061/dryad.bp25b65.","short":"A.M. Westram, M. Rafajlović, P. Chaube, R. Faria, T. Larsson, M. Panova, M. Ravinet, A. Blomberg, B. Mehlig, K. Johannesson, R. Butlin, (2018).","mla":"Westram, Anja M., et al. Data from: Clines on the Seashore: The Genomic Architecture Underlying Rapid Divergence in the Face of Gene Flow. Dryad, 2018, doi:10.5061/dryad.bp25b65.","ieee":"A. M. Westram et al., “Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow.” Dryad, 2018.","apa":"Westram, A. M., Rafajlović, M., Chaube, P., Faria, R., Larsson, T., Panova, M., … Butlin, R. (2018). Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. Dryad. https://doi.org/10.5061/dryad.bp25b65","ista":"Westram AM, Rafajlović M, Chaube P, Faria R, Larsson T, Panova M, Ravinet M, Blomberg A, Mehlig B, Johannesson K, Butlin R. 2018. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow, Dryad, 10.5061/dryad.bp25b65.","ama":"Westram AM, Rafajlović M, Chaube P, et al. Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow. 2018. doi:10.5061/dryad.bp25b65"},"oa":1,"abstract":[{"text":"Adaptive divergence and speciation may happen despite opposition by gene flow. Identifying the genomic basis underlying divergence with gene flow is a major task in evolutionary genomics. Most approaches (e.g. outlier scans) focus on genomic regions of high differentiation. However, not all genomic architectures potentially underlying divergence are expected to show extreme differentiation. Here, we develop an approach that combines hybrid zone analysis (i.e. focuses on spatial patterns of allele frequency change) with system-specific simulations to identify loci inconsistent with neutral evolution. We apply this to a genome-wide SNP set from an ideally-suited study organism, the intertidal snail Littorina saxatilis, which shows primary divergence between ecotypes associated with different shore habitats. We detect many SNPs with clinal patterns, most of which are consistent with neutrality. Among non-neutral SNPs, most are located within three large putative inversions differentiating ecotypes. Many non-neutral SNPs show relatively low levels of differentiation. We discuss potential reasons for this pattern, including loose linkage to selected variants, polygenic adaptation and a component of balancing selection within populations (which may be expected for inversions). Our work is in line with theory predicting a role for inversions in divergence, and emphasises that genomic regions contributing to divergence may not always be accessible with methods purely based on allele frequency differences. These conclusions call for approaches that take spatial patterns of allele frequency change into account in other systems.","lang":"eng"}],"type":"research_data_reference","date_updated":"2023-09-19T15:08:24Z","date_created":"2021-08-17T08:58:47Z","oa_version":"Published Version","author":[{"full_name":"Westram, Anja M","last_name":"Westram","first_name":"Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marina","last_name":"Rafajlović","full_name":"Rafajlović, Marina"},{"full_name":"Chaube, Pragya","first_name":"Pragya","last_name":"Chaube"},{"full_name":"Faria, Rui","first_name":"Rui","last_name":"Faria"},{"last_name":"Larsson","first_name":"Tomas","full_name":"Larsson, Tomas"},{"last_name":"Panova","first_name":"Marina","full_name":"Panova, Marina"},{"full_name":"Ravinet, Mark","first_name":"Mark","last_name":"Ravinet"},{"full_name":"Blomberg, Anders","first_name":"Anders","last_name":"Blomberg"},{"full_name":"Mehlig, Bernhard","first_name":"Bernhard","last_name":"Mehlig"},{"first_name":"Kerstin","last_name":"Johannesson","full_name":"Johannesson, Kerstin"},{"full_name":"Butlin, Roger","last_name":"Butlin","first_name":"Roger"}],"related_material":{"record":[{"id":"9917","relation":"used_in_publication","status":"public"}]},"title":"Data from: Clines on the seashore: the genomic architecture underlying rapid divergence in the face of gene flow","status":"public","publisher":"Dryad","department":[{"_id":"BeVi"}],"_id":"9930","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2018"},{"date_published":"2018-10-17T00:00:00Z","doi":"10.5061/dryad.51sd2p5","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.51sd2p5"}],"oa":1,"citation":{"ama":"Hollander J, Montaño-Rendón M, Bianco G, et al. Data from: Are assortative mating and genital divergence driven by reinforcement? 2018. doi:10.5061/dryad.51sd2p5","ieee":"J. Hollander et al., “Data from: Are assortative mating and genital divergence driven by reinforcement?” Dryad, 2018.","apa":"Hollander, J., Montaño-Rendón, M., Bianco, G., Yang, X., Westram, A. M., Duvaux, L., … Butlin, R. K. (2018). Data from: Are assortative mating and genital divergence driven by reinforcement? Dryad. https://doi.org/10.5061/dryad.51sd2p5","ista":"Hollander J, Montaño-Rendón M, Bianco G, Yang X, Westram AM, Duvaux L, Reid DG, Butlin RK. 2018. Data from: Are assortative mating and genital divergence driven by reinforcement?, Dryad, 10.5061/dryad.51sd2p5.","short":"J. Hollander, M. Montaño-Rendón, G. Bianco, X. Yang, A.M. Westram, L. Duvaux, D.G. Reid, R.K. Butlin, (2018).","mla":"Hollander, Johan, et al. Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement? Dryad, 2018, doi:10.5061/dryad.51sd2p5.","chicago":"Hollander, Johan, Mauricio Montaño-Rendón, Giuseppe Bianco, Xi Yang, Anja M Westram, Ludovic Duvaux, David G. Reid, and Roger K. Butlin. “Data from: Are Assortative Mating and Genital Divergence Driven by Reinforcement?” Dryad, 2018. https://doi.org/10.5061/dryad.51sd2p5."},"article_processing_charge":"No","day":"17","month":"10","oa_version":"Published Version","date_created":"2021-08-17T08:51:06Z","date_updated":"2023-09-19T15:08:53Z","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"9915"}]},"author":[{"first_name":"Johan","last_name":"Hollander","full_name":"Hollander, Johan"},{"full_name":"Montaño-Rendón, Mauricio","first_name":"Mauricio","last_name":"Montaño-Rendón"},{"last_name":"Bianco","first_name":"Giuseppe","full_name":"Bianco, Giuseppe"},{"full_name":"Yang, Xi","first_name":"Xi","last_name":"Yang"},{"full_name":"Westram, Anja M","last_name":"Westram","first_name":"Anja M","orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Duvaux","first_name":"Ludovic","full_name":"Duvaux, Ludovic"},{"first_name":"David G.","last_name":"Reid","full_name":"Reid, David G."},{"full_name":"Butlin, Roger K.","last_name":"Butlin","first_name":"Roger K."}],"publisher":"Dryad","department":[{"_id":"BeVi"}],"title":"Data from: Are assortative mating and genital divergence driven by reinforcement?","status":"public","year":"2018","_id":"9929","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"text":"The evolution of assortative mating is a key part of the speciation process. Stronger assortment, or greater divergence in mating traits, between species pairs with overlapping ranges is commonly observed, but possible causes of this pattern of reproductive character displacement are difficult to distinguish. We use a multidisciplinary approach to provide a rare example where it is possible to distinguish among hypotheses concerning the evolution of reproductive character displacement. We build on an earlier comparative analysis that illustrated a strong pattern of greater divergence in penis form between pairs of sister species with overlapping ranges than between allopatric sister-species pairs, in a large clade of marine gastropods (Littorinidae). We investigate both assortative mating and divergence in male genitalia in one of the sister-species pairs, discriminating among three contrasting processes each of which can generate a pattern of reproductive character displacement: reinforcement, reproductive interference and the Templeton effect. We demonstrate reproductive character displacement in assortative mating, but not in genital form between this pair of sister species and use demographic models to distinguish among the different processes. Our results support a model with no gene flow since secondary contact and thus favour reproductive interference as the cause of reproductive character displacement for mate choice, rather than reinforcement. High gene flow within species argues against the Templeton effect. Secondary contact appears to have had little impact on genital divergence.","lang":"eng"}],"type":"research_data_reference"},{"_id":"10882","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Learning intelligent dialogs for bounding box annotation","status":"public","oa_version":"Preprint","type":"conference","abstract":[{"text":"We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger.","lang":"eng"}],"citation":{"ama":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs for bounding box annotation. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:9175-9184. doi:10.1109/cvpr.2018.00956","ieee":"J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent dialogs for bounding box annotation,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT, United States, 2018, pp. 9175–9184.","apa":"Uijlings, J., Konyushkova, K., Lampert, C., & Ferrari, V. (2018). Learning intelligent dialogs for bounding box annotation. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 9175–9184). Salt Lake City, UT, United States: IEEE. https://doi.org/10.1109/cvpr.2018.00956","ista":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition, 9175–9184.","short":"J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184.","mla":"Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.” 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–84, doi:10.1109/cvpr.2018.00956.","chicago":"Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari. “Learning Intelligent Dialogs for Bounding Box Annotation.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 9175–84. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00956."},"publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition","page":"9175-9184","date_published":"2018-12-17T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"17","year":"2018","publisher":"IEEE","department":[{"_id":"ChLa"}],"publication_status":"published","author":[{"last_name":"Uijlings","first_name":"Jasper","full_name":"Uijlings, Jasper"},{"last_name":"Konyushkova","first_name":"Ksenia","full_name":"Konyushkova, Ksenia"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph"},{"full_name":"Ferrari, Vittorio","last_name":"Ferrari","first_name":"Vittorio"}],"date_created":"2022-03-18T12:45:09Z","date_updated":"2023-09-19T15:11:49Z","external_id":{"isi":["000457843609036"],"arxiv":["1712.08087"]},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1712.08087","open_access":"1"}],"oa":1,"isi":1,"quality_controlled":"1","doi":"10.1109/cvpr.2018.00956","conference":{"start_date":"2018-06-18","location":"Salt Lake City, UT, United States","end_date":"2018-06-23","name":"CVF: Conference on Computer Vision and Pattern Recognition"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781538664209"],"eissn":["2575-7075"]},"month":"12"},{"author":[{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Allen-Zhu, Zeyuan","first_name":"Zeyuan","last_name":"Allen-Zhu"},{"first_name":"Jerry","last_name":"Li","full_name":"Li, Jerry"}],"date_updated":"2023-09-19T15:12:45Z","date_created":"2019-06-13T08:22:37Z","volume":2018,"year":"2018","publication_status":"published","publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"DaAl"}],"conference":{"name":"NeurIPS: Conference on Neural Information Processing Systems","end_date":"2018-12-08","start_date":"2018-12-02","location":"Montreal, Canada"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1803.08917","open_access":"1"}],"external_id":{"isi":["000461823304061"],"arxiv":["1803.08917"]},"oa":1,"quality_controlled":"1","isi":1,"month":"12","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"6558","title":"Byzantine stochastic gradient descent","status":"public","intvolume":" 2018","abstract":[{"lang":"eng","text":"This paper studies the problem of distributed stochastic optimization in an adversarial setting where, out of m machines which allegedly compute stochastic gradients every iteration, an α-fraction are Byzantine, and may behave adversarially. Our main result is a variant of stochastic gradient descent (SGD) which finds ε-approximate minimizers of convex functions in T=O~(1/ε²m+α²/ε²) iterations. In contrast, traditional mini-batch SGD needs T=O(1/ε²m) iterations, but cannot tolerate Byzantine failures. Further, we provide a lower bound showing that, up to logarithmic factors, our algorithm is information-theoretically optimal both in terms of sample complexity and time complexity."}],"type":"conference","date_published":"2018-12-01T00:00:00Z","publication":"Advances in Neural Information Processing Systems","citation":{"ista":"Alistarh D-A, Allen-Zhu Z, Li J. 2018. Byzantine stochastic gradient descent. Advances in Neural Information Processing Systems. NeurIPS: Conference on Neural Information Processing Systems vol. 2018, 4613–4623.","ieee":"D.-A. Alistarh, Z. Allen-Zhu, and J. Li, “Byzantine stochastic gradient descent,” in Advances in Neural Information Processing Systems, Montreal, Canada, 2018, vol. 2018, pp. 4613–4623.","apa":"Alistarh, D.-A., Allen-Zhu, Z., & Li, J. (2018). Byzantine stochastic gradient descent. In Advances in Neural Information Processing Systems (Vol. 2018, pp. 4613–4623). Montreal, Canada: Neural Information Processing Systems Foundation.","ama":"Alistarh D-A, Allen-Zhu Z, Li J. Byzantine stochastic gradient descent. In: Advances in Neural Information Processing Systems. Vol 2018. Neural Information Processing Systems Foundation; 2018:4613-4623.","chicago":"Alistarh, Dan-Adrian, Zeyuan Allen-Zhu, and Jerry Li. “Byzantine Stochastic Gradient Descent.” In Advances in Neural Information Processing Systems, 2018:4613–23. Neural Information Processing Systems Foundation, 2018.","mla":"Alistarh, Dan-Adrian, et al. “Byzantine Stochastic Gradient Descent.” Advances in Neural Information Processing Systems, vol. 2018, Neural Information Processing Systems Foundation, 2018, pp. 4613–23.","short":"D.-A. Alistarh, Z. Allen-Zhu, J. Li, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018, pp. 4613–4623."},"page":"4613-4623","day":"01","article_processing_charge":"No","scopus_import":"1"},{"type":"journal_article","abstract":[{"lang":"eng","text":"The main result of this article is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even Δ-matroid relations (represented by lists of tuples). As a consequence of this, we settle the complexity classification of planar Boolean CSPs started by Dvorak and Kupec. Using a reduction to even Δ-matroids, we then extend the tractability result to larger classes of Δ-matroids that we call efficiently coverable. It properly includes classes that were known to be tractable before, namely, co-independent, compact, local, linear, and binary, with the following caveat:We represent Δ-matroids by lists of tuples, while the last two use a representation by matrices. Since an n ×n matrix can represent exponentially many tuples, our tractability result is not strictly stronger than the known algorithm for linear and binary Δ-matroids."}],"issue":"2","status":"public","title":"Even delta-matroids and the complexity of planar boolean CSPs","intvolume":" 15","_id":"6032","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Preprint","scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","publication":"ACM Transactions on Algorithms","citation":{"mla":"Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.","short":"A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).","chicago":"Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms. ACM, 2018. https://doi.org/10.1145/3230649.","ama":"Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649","ista":"Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.","ieee":"A. Kazda, V. Kolmogorov, and M. Rolinek, “Even delta-matroids and the complexity of planar boolean CSPs,” ACM Transactions on Algorithms, vol. 15, no. 2. ACM, 2018.","apa":"Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3230649"},"date_published":"2018-12-01T00:00:00Z","article_number":"22","ec_funded":1,"publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"ACM","year":"2018","date_updated":"2023-09-20T11:20:26Z","date_created":"2019-02-17T22:59:25Z","volume":15,"author":[{"first_name":"Alexandr","last_name":"Kazda","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87","full_name":"Kazda, Alexandr"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"1192"}]},"month":"12","quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"external_id":{"arxiv":["1602.03124"],"isi":["000468036500007"]},"main_file_link":[{"url":"https://arxiv.org/abs/1602.03124","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3230649"}]