[{"ec_funded":1,"conference":{"location":"Krakow, Poland","name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2016-08-22","end_date":"2016-08-26"},"pubrep_id":"779","license":"https://creativecommons.org/licenses/by/3.0/","status":"public","date_created":"2018-12-11T11:49:58Z","type":"conference","_id":"1068","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":58,"month":"08","has_accepted_license":"1","file":[{"relation":"main_file","file_id":"5187","creator":"system","access_level":"open_access","file_size":632786,"content_type":"application/pdf","date_created":"2018-12-12T10:16:02Z","date_updated":"2018-12-12T10:16:02Z","file_name":"IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf"}],"article_number":"25","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"quality_controlled":"1","project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"oa_version":"Published Version","intvolume":"        58","publist_id":"6317","scopus_import":"1","acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant (279307","year":"2016","doi":"10.4230/LIPIcs.MFCS.2016.25","day":"01","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2018-12-12T10:16:02Z","date_published":"2016-08-01T00:00:00Z","title":"Conditionally optimal algorithms for generalized Büchi Games","abstract":[{"text":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized Büchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verification. We present improved algorithms and conditional super-linear lower bounds based on widely believed assumptions about the complexity of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider graph games with n vertices, m edges, and generalized Büchi objectives with k conjunctions. First, we present an algorithm with running time O(k*n^2), improving the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm is optimal for dense graphs under (A1). Second, we show that the basic algorithm for the problem is optimal for sparse graphs when the target sets have constant size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1 k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time algorithm for m &gt; n^{1.5}. ","lang":"eng"}],"publication_status":"published","ddc":["000","004","006"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"date_updated":"2025-06-02T08:53:50Z","department":[{"_id":"KrCh"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Conditionally Optimal Algorithms for Generalized Büchi Games</i>. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">10.4230/LIPIcs.MFCS.2016.25</a>.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 25.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">https://doi.org/10.4230/LIPIcs.MFCS.2016.25</a>.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">10.4230/LIPIcs.MFCS.2016.25</a>","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., &#38; Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">https://doi.org/10.4230/LIPIcs.MFCS.2016.25</a>"}},{"title":"On the skolem problem for continuous linear dynamical systems","file_date_updated":"2018-12-12T10:16:26Z","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","date_published":"2016-08-01T00:00:00Z","ddc":["004","006"],"publication_status":"published","abstract":[{"lang":"eng","text":"The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differen-\r\ntial equation has a zero in a given interval of real numbers. This is a fundamental reachability\r\nproblem for continuous linear dynamical systems, such as linear hybrid automata and continuous-\r\ntime Markov chains. Decidability of the problem is currently open – indeed decidability is open\r\neven for the sub-problem in which a zero is sought in a bounded interval. In this paper we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse the unbounded problem in terms of the\r\nfrequencies of the differential equation, that is, the imaginary parts of the characteristic roots.\r\nWe show that the unbounded problem can be reduced to the bounded problem if there is at most\r\none rationally linearly independent frequency, or if there are two rationally linearly independent\r\nfrequencies and all characteristic roots are simple. We complete the picture by showing that de-\r\ncidability of the unbounded problem in the case of two (or more) rationally linearly independent\r\nfrequencies would entail a major new effectiveness result in Diophantine approximation, namely\r\ncomputability of the Diophantine-approximation types of all real algebraic numbers."}],"alternative_title":["LIPIcs"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","mla":"Chonev, Ventsislav K., et al. <i>On the Skolem Problem for Continuous Linear Dynamical Systems</i>. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>.","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>","ama":"Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>."},"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:48:03Z","publist_id":"6314","intvolume":"        55","scopus_import":1,"doi":"10.4230/LIPIcs.ICALP.2016.100","day":"01","year":"2016","acknowledgement":"Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307:  Graph Games), and ERC Advanced Grant (267989: QUAREM).","oa":1,"volume":55,"language":[{"iso":"eng"}],"article_number":"100","file":[{"access_level":"open_access","file_size":521415,"file_id":"5213","creator":"system","relation":"main_file","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf","date_created":"2018-12-12T10:16:26Z","date_updated":"2018-12-12T10:16:26Z","content_type":"application/pdf"}],"month":"08","has_accepted_license":"1","author":[{"full_name":"Chonev, Ventsislav K","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Ventsislav K","last_name":"Chonev"},{"first_name":"Joël","last_name":"Ouaknine","full_name":"Ouaknine, Joël"},{"last_name":"Worrell","first_name":"James","full_name":"Worrell, James"}],"oa_version":"Published Version","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"}],"quality_controlled":"1","conference":{"start_date":"2016-07-12","end_date":"2016-07-15","name":"ICALP: Automata, Languages and Programming","location":"Rome, Italy"},"ec_funded":1,"pubrep_id":"778","license":"https://creativecommons.org/licenses/by/4.0/","status":"public","type":"conference","_id":"1069","date_created":"2018-12-11T11:49:59Z"},{"title":"Computation tree logic for synchronization properties","date_published":"2016-01-01T00:00:00Z","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","file_date_updated":"2018-12-12T10:08:52Z","ddc":["005"],"abstract":[{"text":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We analogously consider quantifier exchange in extensions of CTL, and we present operators defined using basic operators of CTL* that express the occurrence of infinitely many synchronization points. We show that the model-checking problem remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide if the Next operator is allowed in the logics, thus the classical bisimulation quotient can be used for state-space reduction before model checking. ","lang":"eng"}],"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"citation":{"mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Computation Tree Logic for Synchronization Properties</i>. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">10.4230/LIPIcs.ICALP.2016.98</a>.","short":"K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","apa":"Chatterjee, K., &#38; Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">https://doi.org/10.4230/LIPIcs.ICALP.2016.98</a>","ista":"Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">https://doi.org/10.4230/LIPIcs.ICALP.2016.98</a>.","ama":"Chatterjee K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">10.4230/LIPIcs.ICALP.2016.98</a>","ieee":"K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55."},"date_updated":"2021-01-12T06:48:03Z","department":[{"_id":"KrCh"}],"intvolume":"        55","publist_id":"6313","scopus_import":1,"day":"01","year":"2016","doi":"10.4230/LIPIcs.ICALP.2016.98","acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003, and European project Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for their insightful\r\ncomments and suggestions.\r\n","oa":1,"volume":55,"language":[{"iso":"eng"}],"article_number":"98","file":[{"file_name":"IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf","date_updated":"2018-12-12T10:08:52Z","date_created":"2018-12-12T10:08:52Z","content_type":"application/pdf","file_size":546133,"access_level":"open_access","creator":"system","file_id":"4714","relation":"main_file"}],"month":"01","has_accepted_license":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"oa_version":"Published Version","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"ec_funded":1,"conference":{"start_date":"2016-07-12","end_date":"2016-07-15","location":"Rome, Italy","name":"ICALP: Automata, Languages and Programming"},"pubrep_id":"812","status":"public","_id":"1070","type":"conference","date_created":"2018-12-11T11:49:59Z"},{"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant (279307: Graph Games).","doi":"10.4230/LIPIcs.ESA.2016.28","day":"01","year":"2016","oa":1,"publist_id":"6312","intvolume":"        57","scopus_import":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"821","status":"public"}]},"alternative_title":["LIPIcs"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"KrCh"}],"date_updated":"2023-09-07T12:01:58Z","citation":{"ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">https://doi.org/10.4230/LIPIcs.ESA.2016.28</a>","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">10.4230/LIPIcs.ESA.2016.28</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 28.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">https://doi.org/10.4230/LIPIcs.ESA.2016.28</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs</i>. Vol. 57, 28, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">10.4230/LIPIcs.ESA.2016.28</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016."},"file_date_updated":"2018-12-12T10:14:31Z","date_published":"2016-08-01T00:00:00Z","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","title":"Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs","publication_status":"published","abstract":[{"lang":"eng","text":"We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W=Theta(log n). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries. The data-structure uses at all times O(n) space. Our second contribution is a space-time tradeoff data-structure for distance queries. For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing time that allows pair queries in O(n^{1-\\epsilon} alpha(n)) time, where alpha is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space. The input graph G is not considered in the space complexity. "}],"ddc":["004","006"],"status":"public","date_created":"2018-12-11T11:49:59Z","type":"conference","_id":"1071","conference":{"location":"Aarhus, Denmark","name":"ESA: European Symposium on Algorithms","end_date":"2016-08-24","start_date":"2016-08-22"},"ec_funded":1,"pubrep_id":"777","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas"}],"quality_controlled":"1","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"volume":57,"has_accepted_license":"1","month":"08","article_number":"28","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:14:31Z","date_updated":"2018-12-12T10:14:31Z","file_name":"IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf","relation":"main_file","file_id":"5084","creator":"system","access_level":"open_access","file_size":579225}]},{"publication_identifier":{"issn":["0003-0503"]},"status":"public","main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR16/Session/E25.7","open_access":"1"}],"type":"conference","_id":"10746","date_created":"2022-02-08T09:55:09Z","conference":{"name":"APS: American Physical Society","location":"Baltimore, MD, United States","end_date":"2016-03-18","start_date":"2016-03-14"},"author":[{"full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48","orcid":"0000-0001-8223-8896","first_name":"Hryhoriy","last_name":"Polshyn"},{"first_name":"Tyler","last_name":"Naibert","full_name":"Naibert, Tyler"},{"last_name":"Chua","first_name":"Victor","full_name":"Chua, Victor"},{"last_name":"Budakian","first_name":"Raffi","full_name":"Budakian, Raffi"}],"oa_version":"Published Version","quality_controlled":"1","article_processing_charge":"No","volume":61,"language":[{"iso":"eng"}],"issue":"2","article_number":"E25.00007","month":"03","year":"2016","day":"01","oa":1,"publication":"APS March Meeting 2016","intvolume":"        61","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","alternative_title":["Bulletin of the American Physical Society"],"citation":{"ieee":"H. Polshyn, T. Naibert, V. Chua, and R. Budakian, “Study of vortex states and dynamics in mesoscopic superconducting samples with MFM,” in <i>APS March Meeting 2016</i>, Baltimore, MD, United States, 2016, vol. 61, no. 2.","chicago":"Polshyn, Hryhoriy, Tyler Naibert, Victor Chua, and Raffi Budakian. “Study of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.” In <i>APS March Meeting 2016</i>, Vol. 61. American Physical Society, 2016.","ista":"Polshyn H, Naibert T, Chua V, Budakian R. 2016. Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. APS March Meeting 2016. APS: American Physical Society, Bulletin of the American Physical Society, vol. 61, E25.00007.","ama":"Polshyn H, Naibert T, Chua V, Budakian R. Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. In: <i>APS March Meeting 2016</i>. Vol 61. American Physical Society; 2016.","apa":"Polshyn, H., Naibert, T., Chua, V., &#38; Budakian, R. (2016). Study of vortex states and dynamics in mesoscopic superconducting samples with MFM. In <i>APS March Meeting 2016</i> (Vol. 61). Baltimore, MD, United States: American Physical Society.","short":"H. Polshyn, T. Naibert, V. Chua, R. Budakian, in:, APS March Meeting 2016, American Physical Society, 2016.","mla":"Polshyn, Hryhoriy, et al. “Study of Vortex States and Dynamics in Mesoscopic Superconducting Samples with MFM.” <i>APS March Meeting 2016</i>, vol. 61, no. 2, E25.00007, American Physical Society, 2016."},"date_updated":"2022-02-08T10:44:06Z","extern":"1","title":"Study of vortex states and dynamics in mesoscopic superconducting samples with MFM","date_published":"2016-03-01T00:00:00Z","publisher":"American Physical Society","abstract":[{"lang":"eng","text":"Vortex states in superconducting (SC) structures, their dynamics and ways to manipulate them are topics of great interest. We report a new method of magnetic force microscopy (MFM) that allows the study of vortex states in mesoscopic SC samples. For the case of a SC ring, which is biased to a half-integer flux quantum, the flux modulation through the ring caused by the motion of the magnetic tip drives the ring between two consecutive fluxoid states. The corresponding current switching in the ring produces strong position-dependent forces on the cantilever. In the regime where the frequency of the thermally activated jumps between fluxoid states is close to the frequency of the cantilever, large changes in the cantilever frequency and dissipation are observed. This effect may be understood as a stochastic resonance (SR) process. These changes in the cantilever’s mechanical properties are used to “image” the barrier energies between fluxoid states. Additionally, SR imaging of the barrier energies are used to study the effect of the locally applied magnetic field from the MFM tip on the barrier heights. We report the results of measurements for Al rings. Further, the same imaging technique can be applied to more sophisticated SC structures such as arrays of Josephson junctions."}],"publication_status":"published"},{"citation":{"ieee":"T. Naibert <i>et al.</i>, “Stochastic resonance magnetic force microscopy imaging of Josephson arrays,” in <i>APS March Meeting 2016</i>, Baltimore, MD, United States, 2016, vol. 61, no. 2.","apa":"Naibert, T., Polshyn, H., Wolin, B., Durkin, M., Garrido Menacho, R., Shem, I. M., … Budakian, R. (2016). Stochastic resonance magnetic force microscopy imaging of Josephson arrays. In <i>APS March Meeting 2016</i> (Vol. 61). Baltimore, MD, United States: American Physical Society.","ista":"Naibert T, Polshyn H, Wolin B, Durkin M, Garrido Menacho R, Shem IM, Chua V, Hughes T, Mason N, Budakian R. 2016. Stochastic resonance magnetic force microscopy imaging of Josephson arrays. APS March Meeting 2016. APS: American Physical Society, Bulletin of the American Physical Society, vol. 61, H25.00006.","ama":"Naibert T, Polshyn H, Wolin B, et al. Stochastic resonance magnetic force microscopy imaging of Josephson arrays. In: <i>APS March Meeting 2016</i>. Vol 61. American Physical Society; 2016.","chicago":"Naibert, Tyler, Hryhoriy Polshyn, Brian Wolin, Malcolm Durkin, Rita Garrido Menacho, Ian Mondragon Shem, Victor Chua, Taylor Hughes, Nadya Mason, and Raffi Budakian. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson Arrays.” In <i>APS March Meeting 2016</i>, Vol. 61. American Physical Society, 2016.","mla":"Naibert, Tyler, et al. “Stochastic Resonance Magnetic Force Microscopy Imaging of Josephson Arrays.” <i>APS March Meeting 2016</i>, vol. 61, no. 2, H25.00006, American Physical Society, 2016.","short":"T. Naibert, H. Polshyn, B. Wolin, M. Durkin, R. Garrido Menacho, I.M. Shem, V. Chua, T. Hughes, N. Mason, R. Budakian, in:, APS March Meeting 2016, American Physical Society, 2016."},"date_updated":"2022-02-08T10:43:33Z","extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","alternative_title":["Bulletin of the American Physical Society"],"abstract":[{"text":"Vortex interactions are key to explaining the behavior of many two dimensional superconducting systems. We report on the development of a technique to locally probe vortex interactions in a 2D array of Josephson junctions. Scanning a magnetic tip attached to an ultra-soft cantilever over the array produces changes in the frequency of the cantilever along certain lines, forming geometric patterns in the scans. Different tip-surface separations and external magnetic fields produce a number of different patterns. These patterns correspond to tip locations in which two configurations of vortices in the lattice have degenerate energies. By imaging the locations of these degeneracies, information on the local vortex interactions may be obtained.","lang":"eng"}],"publication_status":"published","title":"Stochastic resonance magnetic force microscopy imaging of Josephson arrays","date_published":"2016-03-01T00:00:00Z","publisher":"American Physical Society","oa":1,"day":"01","year":"2016","publication":"APS March Meeting 2016","intvolume":"        61","oa_version":"Published Version","quality_controlled":"1","author":[{"full_name":"Naibert, Tyler","first_name":"Tyler","last_name":"Naibert"},{"orcid":"0000-0001-8223-8896","first_name":"Hryhoriy","last_name":"Polshyn","full_name":"Polshyn, Hryhoriy","id":"edfc7cb1-526e-11ec-b05a-e6ecc27e4e48"},{"first_name":"Brian","last_name":"Wolin","full_name":"Wolin, Brian"},{"full_name":"Durkin, Malcolm","first_name":"Malcolm","last_name":"Durkin"},{"full_name":"Garrido Menacho, Rita","last_name":"Garrido Menacho","first_name":"Rita"},{"first_name":"Ian Mondragon","last_name":"Shem","full_name":"Shem, Ian Mondragon"},{"full_name":"Chua, Victor","first_name":"Victor","last_name":"Chua"},{"first_name":"Taylor","last_name":"Hughes","full_name":"Hughes, Taylor"},{"full_name":"Mason, Nadya","first_name":"Nadya","last_name":"Mason"},{"last_name":"Budakian","first_name":"Raffi","full_name":"Budakian, Raffi"}],"issue":"2","article_number":"H25.00006","month":"03","article_processing_charge":"No","volume":61,"language":[{"iso":"eng"}],"_id":"10747","type":"conference","date_created":"2022-02-08T10:10:39Z","publication_identifier":{"issn":["0003-0503"]},"main_file_link":[{"url":"https://meetings.aps.org/Meeting/MAR16/Session/H25.6","open_access":"1"}],"status":"public","conference":{"location":"Baltimore, MD, United States","name":"APS: American Physical Society","end_date":"2016-03-18","start_date":"2016-03-14"}},{"pubrep_id":"757","ec_funded":1,"_id":"1081","type":"journal_article","date_created":"2018-12-11T11:50:02Z","status":"public","file":[{"date_created":"2018-12-12T10:13:33Z","date_updated":"2018-12-12T10:13:33Z","content_type":"application/pdf","file_name":"IST-2017-757-v1+1_celldisc201618.pdf","relation":"main_file","access_level":"open_access","file_size":5261671,"file_id":"5017","creator":"system"}],"article_number":"16018","month":"07","has_accepted_license":"1","volume":2,"language":[{"iso":"eng"}],"oa_version":"Published Version","project":[{"call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","author":[{"full_name":"Łangowski, Łukasz","first_name":"Łukasz","last_name":"Łangowski"},{"id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","full_name":"Wabnik, Krzysztof T","first_name":"Krzysztof T","last_name":"Wabnik","orcid":"0000-0001-7263-0560"},{"full_name":"Li, Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5039-9660","first_name":"Hongjiang","last_name":"Li"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"},{"full_name":"Naramoto, Satoshi","last_name":"Naramoto","first_name":"Satoshi"},{"full_name":"Tanaka, Hirokazu","first_name":"Hirokazu","last_name":"Tanaka"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"publication":"Cell Discovery","intvolume":"         2","publist_id":"6299","oa":1,"doi":"10.1038/celldisc.2016.18","day":"19","year":"2016","acknowledgement":"We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP); Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN.","ddc":["580"],"abstract":[{"lang":"eng","text":"The asymmetric localization of proteins in the plasma membrane domains of eukaryotic cells is a fundamental manifestation of cell polarity that is central to multicellular organization and developmental patterning. In plants, the mechanisms underlying the polar localization of cargo proteins are still largely unknown and appear to be fundamentally distinct from those operating in mammals. Here, we present a systematic, quantitative comparative analysis of the polar delivery and subcellular localization of proteins that characterize distinct polar plasma membrane domains in plant cells. The combination of microscopic analyses and computational modeling revealed a mechanistic framework common to diverse polar cargos and underlying the establishment and maintenance of apical, basal, and lateral polar domains in plant cells. This mechanism depends on the polar secretion, constitutive endocytic recycling, and restricted lateral diffusion of cargos within the plasma membrane. Moreover, our observations suggest that polar cargo distribution involves the individual protein potential to form clusters within the plasma membrane and interact with the extracellular matrix. Our observations provide insights into the shared cellular mechanisms of polar cargo delivery and polarity maintenance in plant cells."}],"publication_status":"published","title":"Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells","publisher":"Nature Publishing Group","date_published":"2016-07-19T00:00:00Z","file_date_updated":"2018-12-12T10:13:33Z","citation":{"apa":"Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H., &#38; Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. <i>Cell Discovery</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/celldisc.2016.18\">https://doi.org/10.1038/celldisc.2016.18</a>","chicago":"Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste, Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” <i>Cell Discovery</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/celldisc.2016.18\">https://doi.org/10.1038/celldisc.2016.18</a>.","ama":"Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. <i>Cell Discovery</i>. 2016;2. doi:<a href=\"https://doi.org/10.1038/celldisc.2016.18\">10.1038/celldisc.2016.18</a>","ista":"Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. 2, 16018.","ieee":"Ł. Łangowski <i>et al.</i>, “Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells,” <i>Cell Discovery</i>, vol. 2. Nature Publishing Group, 2016.","mla":"Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” <i>Cell Discovery</i>, vol. 2, 16018, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/celldisc.2016.18\">10.1038/celldisc.2016.18</a>.","short":"Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J. Friml, Cell Discovery 2 (2016)."},"date_updated":"2021-01-12T06:48:08Z","department":[{"_id":"EvBe"},{"_id":"JiFr"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"author":[{"full_name":"Rubel, Paul","last_name":"Rubel","first_name":"Paul"},{"first_name":"Danilo","last_name":"Pani","full_name":"Pani, Danilo"},{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl"},{"full_name":"Fayn, Jocelyne","last_name":"Fayn","first_name":"Jocelyne"},{"first_name":"Fabio","last_name":"Badilini","full_name":"Badilini, Fabio"},{"full_name":"Macfarlane, Peter","first_name":"Peter","last_name":"Macfarlane"},{"full_name":"Varri, Alpo","first_name":"Alpo","last_name":"Varri"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":43,"month":"03","publication_identifier":{"issn":["2325-887X"]},"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.22489/cinc.2016.090-500"}],"date_created":"2022-03-03T10:43:10Z","type":"conference","_id":"10810","conference":{"location":"Vancouver, Canada","name":"CinC: Computing in Cardiology","end_date":"2016-09-14","start_date":"2016-09-11"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-03-04T07:34:45Z","department":[{"_id":"CampIT"}],"citation":{"apa":"Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P., &#38; Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In <i>2016 Computing in Cardiology Conference</i> (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology. <a href=\"https://doi.org/10.22489/cinc.2016.090-500\">https://doi.org/10.22489/cinc.2016.090-500</a>","chicago":"Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini, Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” In <i>2016 Computing in Cardiology Conference</i>, 43:309–12. Computing in Cardiology, 2016. <a href=\"https://doi.org/10.22489/cinc.2016.090-500\">https://doi.org/10.22489/cinc.2016.090-500</a>.","ama":"Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In: <i>2016 Computing in Cardiology Conference</i>. Vol 43. Computing in Cardiology; 2016:309-312. doi:<a href=\"https://doi.org/10.22489/cinc.2016.090-500\">10.22489/cinc.2016.090-500</a>","ista":"Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing in Cardiology vol. 43, 309–312.","ieee":"P. Rubel <i>et al.</i>, “SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography,” in <i>2016 Computing in Cardiology Conference</i>, Vancouver, Canada, 2016, vol. 43, pp. 309–312.","mla":"Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” <i>2016 Computing in Cardiology Conference</i>, vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:<a href=\"https://doi.org/10.22489/cinc.2016.090-500\">10.22489/cinc.2016.090-500</a>.","short":"P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri, in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp. 309–312."},"date_published":"2016-03-01T00:00:00Z","publisher":"Computing in Cardiology","title":"SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography","abstract":[{"lang":"eng","text":"The main goal of the SCP-ECG standard is to address ECG data and related metadata structuring, semantics and syntax, with the objective of facilitating interoperability and thus supporting and promoting the exchange of the relevant information for unary and serial ECG diagnosis. Starting with version V3.0, the standard now also provides support for the storage of continuous, long-term ECG recordings and affords a repository for selected ECG sequences and the related metadata to accommodate stress tests, drug trials and protocol-based ECG recordings. The global and per-lead measurements sections have been extended and three new sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand annotations. The used terminology and the provided measurements and annotations have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis has also been put on harmonizing the Universal Statement Codes with the CDISC and the categorized AHA statement codes and similarly the drug and implanted devices codes with the ATC and NASPE/BPEG codes. "}],"publication_status":"published","acknowledgement":"The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen Wagner for their in depth review and constructive comments.","day":"01","doi":"10.22489/cinc.2016.090-500","page":"309-312","year":"2016","oa":1,"intvolume":"        43","publication":"2016 Computing in Cardiology Conference","scopus_import":"1"},{"scopus_import":1,"related_material":{"link":[{"url":"https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck","relation":"other"}]},"publist_id":"6298","conference":{"name":"NIPS: Neural Information Processing Systems","location":"Barcelona, Spain","end_date":"2016-12-10","start_date":"2016-12-05"},"intvolume":"        29","date_created":"2018-12-11T11:50:03Z","oa":1,"type":"conference","_id":"1082","day":"01","status":"public","year":"2016","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.07332"}],"page":"1965-1973","publication_status":"published","month":"12","abstract":[{"text":"In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximises information about a relevance variable, Y, while constraining the information encoded about the original data, X. Unfortunately however, the IB method is computationally demanding when data are high-dimensional and/or non-gaussian. Here we propose an approximate variational scheme for maximising a lower bound on the IB objective, analogous to variational EM. Using this method, we derive an IB algorithm to recover features that are both relevant and sparse. Finally, we demonstrate how kernelised versions of the algorithm can be used to address a broad range of problems with non-linear relation between X and Y.","lang":"eng"}],"publisher":"Neural Information Processing Systems","language":[{"iso":"eng"}],"date_published":"2016-12-01T00:00:00Z","title":"Relevant sparse codes with variational information bottleneck","volume":29,"department":[{"_id":"GaTk"}],"quality_controlled":"1","date_updated":"2021-01-12T06:48:09Z","oa_version":"Preprint","citation":{"apa":"Chalk, M. J., Marre, O., &#38; Tkačik, G. (2016). Relevant sparse codes with variational information bottleneck (Vol. 29, pp. 1965–1973). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems.","ama":"Chalk MJ, Marre O, Tkačik G. Relevant sparse codes with variational information bottleneck. In: Vol 29. Neural Information Processing Systems; 2016:1965-1973.","chicago":"Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Relevant Sparse Codes with Variational Information Bottleneck,” 29:1965–73. Neural Information Processing Systems, 2016.","ista":"Chalk MJ, Marre O, Tkačik G. 2016. Relevant sparse codes with variational information bottleneck. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 1965–1973.","ieee":"M. J. Chalk, O. Marre, and G. Tkačik, “Relevant sparse codes with variational information bottleneck,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 1965–1973.","short":"M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems, 2016, pp. 1965–1973.","mla":"Chalk, Matthew J., et al. <i>Relevant Sparse Codes with Variational Information Bottleneck</i>. Vol. 29, Neural Information Processing Systems, 2016, pp. 1965–73."},"author":[{"last_name":"Chalk","first_name":"Matthew J","orcid":"0000-0001-7782-4436","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87","full_name":"Chalk, Matthew J"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"}],"alternative_title":["Advances in Neural Information Processing Systems"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"pubrep_id":"795","ec_funded":1,"conference":{"start_date":"2016-08-22","end_date":"2016-08-26","name":"MFCS: Mathematical Foundations of Computer Science (SG)","location":"Krakow; Poland"},"date_created":"2018-12-11T11:50:05Z","type":"conference","_id":"1090","status":"public","month":"08","has_accepted_license":"1","file":[{"date_updated":"2018-12-12T10:17:31Z","date_created":"2018-12-12T10:17:31Z","content_type":"application/pdf","file_name":"IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf","relation":"main_file","file_size":564560,"access_level":"open_access","creator":"system","file_id":"5286"}],"article_number":"24","language":[{"iso":"eng"}],"volume":58,"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Published Version","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Otop"}],"scopus_import":1,"intvolume":"        58","publist_id":"6286","oa":1,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under grant 2014/15/D/ST6/04543.","year":"2016","doi":"10.4230/LIPIcs.MFCS.2016.24","day":"01","abstract":[{"text":" While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness.","lang":"eng"}],"publication_status":"published","ddc":["004"],"date_published":"2016-08-01T00:00:00Z","file_date_updated":"2018-12-12T10:17:31Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","title":"Nested weighted limit-average automata of bounded width","date_updated":"2021-01-12T06:48:12Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata of bounded width. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 24.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2016). Nested weighted limit-average automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">https://doi.org/10.4230/LIPIcs.MFCS.2016.24</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow; Poland, 2016, vol. 58.","mla":"Chatterjee, Krishnendu, et al. <i>Nested Weighted Limit-Average Automata of Bounded Width</i>. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.24\">10.4230/LIPIcs.MFCS.2016.24</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"]},{"type":"conference","_id":"1093","date_created":"2018-12-11T11:50:06Z","status":"public","pubrep_id":"794","ec_funded":1,"conference":{"location":"Quebec City; Canada","name":"CONCUR: Concurrency Theory","start_date":"2016-08-23","end_date":"2016-08-26"},"oa_version":"Published Version","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"quality_controlled":"1","author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","last_name":"Daca","first_name":"Przemyslaw"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881"},{"full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9041-0905","last_name":"Petrov","first_name":"Tatjana"}],"article_number":"20","file":[{"relation":"main_file","creator":"system","file_id":"4895","file_size":501827,"access_level":"open_access","content_type":"application/pdf","date_updated":"2018-12-12T10:11:39Z","date_created":"2018-12-12T10:11:39Z","file_name":"IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf"}],"has_accepted_license":"1","month":"08","volume":59,"language":[{"iso":"eng"}],"oa":1,"doi":"10.4230/LIPIcs.CONCUR.2016.20","year":"2016","day":"01","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF) under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award), by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced Postdoc. Mobility Fellowship – grant number P300P2_161067.","related_material":{"record":[{"status":"public","id":"1155","relation":"dissertation_contains"}]},"scopus_import":1,"intvolume":"        59","publist_id":"6283","citation":{"ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Linear distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.20</a>","mla":"Daca, Przemyslaw, et al. <i>Linear Distances between Markov Chains</i>. Vol. 59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.20\">10.4230/LIPIcs.CONCUR.2016.20</a>.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016."},"date_updated":"2023-09-07T11:58:33Z","department":[{"_id":"ToHe"},{"_id":"KrCh"},{"_id":"CaGu"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"ddc":["004"],"abstract":[{"lang":"eng","text":"We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or automata. We investigate which of the distances can be approximated by observing the systems, i.e. by black-box testing or simulation, and we provide both negative and positive results. "}],"publication_status":"published","title":"Linear distances between Markov chains","file_date_updated":"2018-12-12T10:11:39Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2016-08-01T00:00:00Z"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"alternative_title":["LIPIcs"],"date_updated":"2021-01-12T06:48:14Z","department":[{"_id":"ToHe"}],"citation":{"apa":"Haas, A., Henzinger, T. A., Holzer, A., Kirsch, C., Lippautz, M., Payer, H., … Veith, H. (2016). Local linearizability for concurrent container-type data structures. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 59). Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>","chicago":"Haas, Andreas, Thomas A Henzinger, Andreas Holzer, Christoph Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. “Local Linearizability for Concurrent Container-Type Data Structures.” In <i>Leibniz International Proceedings in Informatics</i>, Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">https://doi.org/10.4230/LIPIcs.CONCUR.2016.6</a>.","ama":"Haas A, Henzinger TA, Holzer A, et al. Local linearizability for concurrent container-type data structures. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">10.4230/LIPIcs.CONCUR.2016.6</a>","ista":"Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A, Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 6.","ieee":"A. Haas <i>et al.</i>, “Local linearizability for concurrent container-type data structures,” in <i>Leibniz International Proceedings in Informatics</i>, Quebec City; Canada, 2016, vol. 59.","short":"A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A. Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","mla":"Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type Data Structures.” <i>Leibniz International Proceedings in Informatics</i>, vol. 59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2016.6\">10.4230/LIPIcs.CONCUR.2016.6</a>."},"date_published":"2016-08-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2018-12-12T10:10:10Z","title":"Local linearizability for concurrent container-type data structures","abstract":[{"lang":"eng","text":" The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on improving performance and scalability of concurrent data structures by relaxing their semantics. In this paper, we present local linearizability, a relaxed consistency condition that is applicable to container-type concurrent data structures like pools, queues, and stacks. While linearizability requires that the effect of each operation is observed by all threads at the same time, local linearizability only requires that for each thread T, the effects of its local insertion operations and the effects of those removal operations that remove values inserted by T are observed by all threads at the same time. We investigate theoretical and practical properties of local linearizability and its relationship to many existing consistency conditions. We present a generic implementation method for locally linearizable data structures that uses existing linearizable data structures as building blocks. Our implementations show performance and scalability improvements over the original building blocks and outperform the fastest existing container-type implementations. "}],"publication_status":"published","ddc":["004"],"acknowledgement":"This work has been supported by the National Research Network RiSE on Rigorous Systems Engineering\r\n(Austrian Science Fund (FWF): S11402-N23, S11403-N23, S11404-N23, S11411-N23), a Google\r\nPhD Fellowship, an Erwin Schrödinger Fellowship (Austrian Science Fund (FWF): J3696-N26), EPSRC\r\ngrants EP/H005633/1 and EP/K008528/1, the Vienna Science and Technology Fund (WWTF) trough\r\ngrant PROSEED, the European Research Council (ERC) under grant 267989 (QUAREM) and by the\r\nAustrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","year":"2016","day":"01","doi":"10.4230/LIPIcs.CONCUR.2016.6","oa":1,"intvolume":"        59","publist_id":"6280","publication":"Leibniz International Proceedings in Informatics","scopus_import":1,"author":[{"full_name":"Haas, Andreas","first_name":"Andreas","last_name":"Haas"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Holzer","first_name":"Andreas","full_name":"Holzer, Andreas"},{"full_name":"Kirsch, Christoph","last_name":"Kirsch","first_name":"Christoph"},{"full_name":"Lippautz, Michael","last_name":"Lippautz","first_name":"Michael"},{"first_name":"Hannes","last_name":"Payer","full_name":"Payer, Hannes"},{"first_name":"Ali","last_name":"Sezgin","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"},{"full_name":"Veith, Helmut","first_name":"Helmut","last_name":"Veith"}],"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"volume":59,"has_accepted_license":"1","month":"08","file":[{"content_type":"application/pdf","date_updated":"2018-12-12T10:10:10Z","date_created":"2018-12-12T10:10:10Z","file_name":"IST-2017-793-v1+1_LIPIcs-CONCUR-2016-6.pdf","relation":"main_file","creator":"system","file_id":"4795","file_size":589747,"access_level":"open_access"}],"article_number":"6","status":"public","date_created":"2018-12-11T11:50:07Z","_id":"1095","type":"conference","ec_funded":1,"conference":{"name":"CONCUR: Concurrency Theory","location":"Quebec City; Canada","start_date":"2016-08-23","end_date":"2016-08-26"},"pubrep_id":"793"},{"citation":{"mla":"Du, Tao, et al. <i>Computational Multicopter Design</i>. Vol. 35, no. 6, 227, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2980179.2982427\">10.1145/2980179.2982427</a>.","short":"T. Du, A. Schulz, B. Zhu, B. Bickel, W. Matusik, in:, ACM, 2016.","ieee":"T. Du, A. Schulz, B. Zhu, B. Bickel, and W. Matusik, “Computational multicopter design,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no. 6.","chicago":"Du, Tao, Adriana Schulz, Bo Zhu, Bernd Bickel, and Wojciech Matusik. “Computational Multicopter Design,” Vol. 35. ACM, 2016. <a href=\"https://doi.org/10.1145/2980179.2982427\">https://doi.org/10.1145/2980179.2982427</a>.","ista":"Du T, Schulz A, Zhu B, Bickel B, Matusik W. 2016. Computational multicopter design. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol. 35, 227.","ama":"Du T, Schulz A, Zhu B, Bickel B, Matusik W. Computational multicopter design. In: Vol 35. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2980179.2982427\">10.1145/2980179.2982427</a>","apa":"Du, T., Schulz, A., Zhu, B., Bickel, B., &#38; Matusik, W. (2016). Computational multicopter design (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. <a href=\"https://doi.org/10.1145/2980179.2982427\">https://doi.org/10.1145/2980179.2982427</a>"},"department":[{"_id":"BeBi"}],"date_updated":"2021-01-12T06:48:15Z","alternative_title":["ACM Transactions on Graphics"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["006"],"publication_status":"published","abstract":[{"lang":"eng","text":"We present an interactive system for computational design, optimization, and fabrication of multicopters. Our computational approach allows non-experts to design, explore, and evaluate a wide range of different multicopters. We provide users with an intuitive interface for assembling a multicopter from a collection of components (e.g., propellers, motors, and carbon fiber rods). Our algorithm interactively optimizes shape and controller parameters of the current design to ensure its proper operation. In addition, we allow incorporating a variety of other metrics (such as payload, battery usage, size, and cost) into the design process and exploring tradeoffs between them. We show the efficacy of our method and system by designing, optimizing, fabricating, and operating multicopters with complex geometries and propeller configurations. We also demonstrate the ability of our optimization algorithm to improve the multicopter performance under different metrics."}],"title":"Computational multicopter design","file_date_updated":"2018-12-12T10:17:42Z","publisher":"ACM","date_published":"2016-11-01T00:00:00Z","oa":1,"day":"01","doi":"10.1145/2980179.2982427","year":"2016","acknowledgement":"We thank Nobuyuki Umetani for his insightful suggestions in our discussions. We thank Alan Schultz and his colleagues at NRL for building the hexacopter and for the valuable discussions. We thank Randall Davis, Boris Katz, and Howard Shrobe at MIT for their advice. We are grateful to Nick Bandiera for preprocessing mechanical parts and providing 3D printing technical support; Charles Blouin from RCBenchmark for dynamometer hardware support; Brian Saavedra for the composition UI; Yingzhe Yuan for data acquisition and video recording in the experiments; Michael Foshey and David Kim for their comments on the draft of the paper. \r\n\r\n\r\nThis work was partially supported by Air Force Research Laboratory’s sponsorship of Julia: A Fresh Approach to Technical Computing and Data Processing (Sponsor Award ID FA8750-15-2- 0272, MIT Award ID 024831-00003), and NSF Expedition project (Sponsor Award ID CCF-1138967, MIT Award ID 020610-00002). The views expressed herein are not endorsed by the sponsors. This project has also received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No 645599. ","scopus_import":1,"publist_id":"6278","intvolume":"        35","oa_version":"Submitted Version","project":[{"name":"Soft-bodied intelligence for Manipulation","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"quality_controlled":"1","author":[{"last_name":"Du","first_name":"Tao","full_name":"Du, Tao"},{"full_name":"Schulz, Adriana","last_name":"Schulz","first_name":"Adriana"},{"full_name":"Zhu, Bo","first_name":"Bo","last_name":"Zhu"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"}],"file":[{"relation":"main_file","file_size":33114420,"access_level":"open_access","creator":"system","file_id":"5298","date_updated":"2018-12-12T10:17:42Z","date_created":"2018-12-12T10:17:42Z","content_type":"application/pdf","file_name":"IST-2017-759-v1+1_copter.pdf"}],"article_number":"227","issue":"6","has_accepted_license":"1","month":"11","volume":35,"language":[{"iso":"eng"}],"type":"conference","_id":"1097","date_created":"2018-12-11T11:50:07Z","status":"public","pubrep_id":"759","conference":{"end_date":"2016-12-08","start_date":"2016-12-05","name":"SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","location":"Macao, China"},"ec_funded":1},{"status":"public","date_created":"2018-12-11T11:50:08Z","type":"conference","_id":"1098","ec_funded":1,"conference":{"start_date":"2016-12-05","end_date":"2016-12-10","name":"NIPS: Neural Information Processing Systems","location":"Barcelona, Spain"},"pubrep_id":"775","author":[{"id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","full_name":"Pentina, Anastasia","first_name":"Anastasia","last_name":"Pentina"},{"last_name":"Urner","first_name":"Ruth","full_name":"Urner, Ruth"}],"quality_controlled":"1","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"volume":29,"month":"12","has_accepted_license":"1","file":[{"relation":"main_file","file_size":237111,"access_level":"open_access","creator":"system","file_id":"4961","date_updated":"2018-12-12T10:12:42Z","date_created":"2018-12-12T10:12:42Z","content_type":"application/pdf","file_name":"IST-2017-775-v1+1_main.pdf"},{"file_size":185818,"access_level":"open_access","creator":"system","file_id":"4962","relation":"main_file","file_name":"IST-2017-775-v1+2_supplementary.pdf","date_updated":"2018-12-12T10:12:43Z","date_created":"2018-12-12T10:12:43Z","content_type":"application/pdf"}],"acknowledgement":"This work was in parts funded by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 308036.\r\n\r\n","page":"3619-3627","year":"2016","day":"01","oa":1,"intvolume":"        29","publist_id":"6277","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["Advances in Neural Information Processing Systems"],"date_updated":"2021-01-12T06:48:15Z","department":[{"_id":"ChLa"}],"citation":{"ieee":"A. Pentina and R. Urner, “Lifelong learning with weighted majority votes,” presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain, 2016, vol. 29, pp. 3619–3627.","chicago":"Pentina, Anastasia, and Ruth Urner. “Lifelong Learning with Weighted Majority Votes,” 29:3619–27. Neural Information Processing Systems, 2016.","ista":"Pentina A, Urner R. 2016. Lifelong learning with weighted majority votes. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 29, 3619–3627.","ama":"Pentina A, Urner R. Lifelong learning with weighted majority votes. In: Vol 29. Neural Information Processing Systems; 2016:3619-3627.","apa":"Pentina, A., &#38; Urner, R. (2016). Lifelong learning with weighted majority votes (Vol. 29, pp. 3619–3627). Presented at the NIPS: Neural Information Processing Systems, Barcelona, Spain: Neural Information Processing Systems.","mla":"Pentina, Anastasia, and Ruth Urner. <i>Lifelong Learning with Weighted Majority Votes</i>. Vol. 29, Neural Information Processing Systems, 2016, pp. 3619–27.","short":"A. Pentina, R. Urner, in:, Neural Information Processing Systems, 2016, pp. 3619–3627."},"date_published":"2016-12-01T00:00:00Z","publisher":"Neural Information Processing Systems","file_date_updated":"2018-12-12T10:12:43Z","title":"Lifelong learning with weighted majority votes","abstract":[{"lang":"eng","text":"Better understanding of the potential benefits of information transfer and representation learning is an important step towards the goal of building intelligent systems that are able to persist in the world and learn over time. In this work, we consider a setting where the learner encounters a stream of tasks but is able to retain only limited information from each encountered task, such as a learned predictor. In contrast to most previous works analyzing this scenario, we do not make any distributional assumptions on the task generating process. Instead, we formulate a complexity measure that captures the diversity of the observed tasks. We provide a lifelong learning algorithm with error guarantees for every observed task (rather than on average). We show sample complexity reductions in comparison to solving every task in isolation in terms of our task complexity measure. Further, our algorithmic framework can naturally be viewed as learning a representation from encountered tasks with a neural network."}],"publication_status":"published","ddc":["006"]},{"author":[{"last_name":"Malomo","first_name":"Luigi","full_name":"Malomo, Luigi"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"}],"quality_controlled":"1","project":[{"name":"Soft-bodied intelligence for Manipulation","grant_number":"645599","_id":"25082902-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"oa_version":"Submitted Version","language":[{"iso":"eng"}],"volume":35,"has_accepted_license":"1","month":"11","article_number":"223","file":[{"access_level":"open_access","file_size":11122029,"file_id":"4918","creator":"system","relation":"main_file","file_name":"IST-2017-760-v1+1_flexmolds.pdf","date_created":"2018-12-12T10:12:01Z","date_updated":"2018-12-12T10:12:01Z","content_type":"application/pdf"}],"issue":"6","status":"public","date_created":"2018-12-11T11:50:08Z","type":"conference","_id":"1099","conference":{"location":"Macao, China","name":"SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","end_date":"2016-12-08","start_date":"2016-12-05"},"ec_funded":1,"pubrep_id":"760","alternative_title":["ACM Transactions on Graphics"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BeBi"}],"date_updated":"2021-01-12T06:48:16Z","citation":{"mla":"Malomo, Luigi, et al. <i>FlexMolds: Automatic Design of Flexible Shells for Molding</i>. Vol. 35, no. 6, 223, ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2980179.2982397\">10.1145/2980179.2982397</a>.","short":"L. Malomo, N. Pietroni, B. Bickel, P. Cignoni, in:, ACM, 2016.","ieee":"L. Malomo, N. Pietroni, B. Bickel, and P. Cignoni, “FlexMolds: Automatic design of flexible shells for molding,” presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China, 2016, vol. 35, no. 6.","apa":"Malomo, L., Pietroni, N., Bickel, B., &#38; Cignoni, P. (2016). FlexMolds: Automatic design of flexible shells for molding (Vol. 35). Presented at the SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, Macao, China: ACM. <a href=\"https://doi.org/10.1145/2980179.2982397\">https://doi.org/10.1145/2980179.2982397</a>","chicago":"Malomo, Luigi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “FlexMolds: Automatic Design of Flexible Shells for Molding,” Vol. 35. ACM, 2016. <a href=\"https://doi.org/10.1145/2980179.2982397\">https://doi.org/10.1145/2980179.2982397</a>.","ama":"Malomo L, Pietroni N, Bickel B, Cignoni P. FlexMolds: Automatic design of flexible shells for molding. In: Vol 35. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2980179.2982397\">10.1145/2980179.2982397</a>","ista":"Malomo L, Pietroni N, Bickel B, Cignoni P. 2016. FlexMolds: Automatic design of flexible shells for molding. SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, ACM Transactions on Graphics, vol. 35, 223."},"date_published":"2016-11-01T00:00:00Z","publisher":"ACM","file_date_updated":"2018-12-12T10:12:01Z","title":"FlexMolds: Automatic design of flexible shells for molding","publication_status":"published","abstract":[{"lang":"eng","text":"We present FlexMolds, a novel computational approach to automatically design flexible, reusable molds that, once 3D printed, allow us to physically fabricate, by means of liquid casting, multiple copies of complex shapes with rich surface details and complex topology. The approach to design such flexible molds is based on a greedy bottom-up search of possible cuts over an object, evaluating for each possible cut the feasibility of the resulting mold. We use a dynamic simulation approach to evaluate candidate molds, providing a heuristic to generate forces that are able to open, detach, and remove a complex mold from the object it surrounds. We have tested the approach with a number of objects with nontrivial shapes and topologies."}],"ddc":["000","005"],"acknowledgement":"The armadillo, bunny and dragon models are courtesy of the Stanford  3D  Scanning  Repository.   The  bimba,  fertility  and  elephant models are courtesy of the AIM@SHAPE Shape Repository.  \r\nThis project has received funding from the European Union’s Horizon 2020  research  and  innovation  programme  under  grant  agreement\r\nNo. 645599.","doi":"10.1145/2980179.2982397","year":"2016","day":"01","oa":1,"publist_id":"6276","intvolume":"        35","scopus_import":1},{"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"volume":16,"month":"07","has_accepted_license":"1","issue":"3","file":[{"relation":"main_file","creator":"system","file_id":"4857","file_size":3921947,"access_level":"open_access","content_type":"application/pdf","date_updated":"2018-12-12T10:11:04Z","date_created":"2018-12-12T10:11:04Z","file_name":"IST-2017-754-v1+1_1-s2.0-S2211124716307768-main.pdf"}],"author":[{"id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","full_name":"Sako, Keisuke","first_name":"Keisuke","last_name":"Sako","orcid":"0000-0002-6453-8075"},{"full_name":"Pradhan, Saurabh","first_name":"Saurabh","last_name":"Pradhan"},{"orcid":"0000-0003-2676-3367","first_name":"Vanessa","last_name":"Barone","full_name":"Barone, Vanessa","id":"419EECCC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Álvaro","last_name":"Inglés Prieto","orcid":"0000-0002-5409-8571","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro"},{"first_name":"Patrick","last_name":"Mueller","full_name":"Mueller, Patrick"},{"first_name":"Verena","last_name":"Ruprecht","orcid":"0000-0003-4088-8633","id":"4D71A03A-F248-11E8-B48F-1D18A9856A87","full_name":"Ruprecht, Verena"},{"full_name":"Capek, Daniel","id":"31C42484-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-9940","first_name":"Daniel","last_name":"Capek"},{"full_name":"Galande, Sanjeev","first_name":"Sanjeev","last_name":"Galande"},{"first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L"},{"orcid":"0000-0002-0912-4566","last_name":"Heisenberg","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","project":[{"_id":"2529486C-B435-11E9-9278-68D0E5697425","grant_number":"T 560-B17","name":"Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation","call_identifier":"FWF"},{"grant_number":"I 812-B12","_id":"2527D5CC-B435-11E9-9278-68D0E5697425","name":"Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology"}],"oa_version":"Published Version","ec_funded":1,"pubrep_id":"754","status":"public","date_created":"2018-12-11T11:50:08Z","_id":"1100","type":"journal_article","publisher":"Cell Press","date_published":"2016-07-19T00:00:00Z","file_date_updated":"2018-12-12T10:11:04Z","title":"Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation","abstract":[{"text":"During metazoan development, the temporal pattern of morphogen signaling is critical for organizing cell fates in space and time. Yet, tools for temporally controlling morphogen signaling within the embryo are still scarce. Here, we developed a photoactivatable Nodal receptor to determine how the temporal pattern of Nodal signaling affects cell fate specification during zebrafish gastrulation. By using this receptor to manipulate the duration of Nodal signaling in vivo by light, we show that extended Nodal signaling within the organizer promotes prechordal plate specification and suppresses endoderm differentiation. Endoderm differentiation is suppressed by extended Nodal signaling inducing expression of the transcriptional repressor goosecoid (gsc) in prechordal plate progenitors, which in turn restrains Nodal signaling from upregulating the endoderm differentiation gene sox17 within these cells. Thus, optogenetic manipulation of Nodal signaling identifies a critical role of Nodal signaling duration for organizer cell fate specification during gastrulation.","lang":"eng"}],"publication_status":"published","ddc":["570","576"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2024-03-25T23:30:13Z","department":[{"_id":"CaHe"},{"_id":"HaJa"}],"citation":{"ieee":"K. Sako <i>et al.</i>, “Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation,” <i>Cell Reports</i>, vol. 16, no. 3. Cell Press, pp. 866–877, 2016.","apa":"Sako, K., Pradhan, S., Barone, V., Inglés Prieto, Á., Mueller, P., Ruprecht, V., … Heisenberg, C.-P. J. (2016). Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">https://doi.org/10.1016/j.celrep.2016.06.036</a>","chicago":"Sako, Keisuke, Saurabh Pradhan, Vanessa Barone, Álvaro Inglés Prieto, Patrick Mueller, Verena Ruprecht, Daniel Capek, Sanjeev Galande, Harald L Janovjak, and Carl-Philipp J Heisenberg. “Optogenetic Control of Nodal Signaling Reveals a Temporal Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.” <i>Cell Reports</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">https://doi.org/10.1016/j.celrep.2016.06.036</a>.","ista":"Sako K, Pradhan S, Barone V, Inglés Prieto Á, Mueller P, Ruprecht V, Capek D, Galande S, Janovjak HL, Heisenberg C-PJ. 2016. Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. Cell Reports. 16(3), 866–877.","ama":"Sako K, Pradhan S, Barone V, et al. Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation. <i>Cell Reports</i>. 2016;16(3):866-877. doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">10.1016/j.celrep.2016.06.036</a>","short":"K. Sako, S. Pradhan, V. Barone, Á. Inglés Prieto, P. Mueller, V. Ruprecht, D. Capek, S. Galande, H.L. Janovjak, C.-P.J. Heisenberg, Cell Reports 16 (2016) 866–877.","mla":"Sako, Keisuke, et al. “Optogenetic Control of Nodal Signaling Reveals a Temporal Pattern of Nodal Signaling Regulating Cell Fate Specification during Gastrulation.” <i>Cell Reports</i>, vol. 16, no. 3, Cell Press, 2016, pp. 866–77, doi:<a href=\"https://doi.org/10.1016/j.celrep.2016.06.036\">10.1016/j.celrep.2016.06.036</a>."},"intvolume":"        16","publist_id":"6275","publication":"Cell Reports","related_material":{"record":[{"id":"961","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"50"}]},"scopus_import":1,"acknowledgement":"We are grateful to members of the C.-P.H. and H.J. labs for discussions, R. Hauschild and the different Scientific Service Units at IST Austria for technical help, M. Dravecka for performing initial experiments, A. Schier for reading an earlier version of the manuscript, K.W. Rogers for technical help, and C. Hill, A. Bruce, and L. Solnica-Krezel for sending plasmids. This work was supported by grants from the Austrian Science Foundation (FWF): (T560-B17) and (I 812-B12) to V.R. and C.-P.H., and from the European Union (EU FP7): (6275) to H.J. A.I.-P. is supported by a Ramon Areces fellowship.","day":"19","doi":"10.1016/j.celrep.2016.06.036","page":"866 - 877","year":"2016","oa":1},{"publisher":"BMVA Press","date_published":"2016-09-01T00:00:00Z","title":"Improving weakly-supervised object localization by micro-annotation","publication_status":"published","abstract":[{"text":"Weakly-supervised object localization methods tend to fail for object classes that consistently co-occur with the same background elements, e.g. trains on tracks. We propose a method to overcome these failures by adding a very small amount of model-specific additional annotation. The main idea is to cluster a deep network\\'s mid-level representations and assign object or distractor labels to each cluster. Experiments show substantially improved localization results on the challenging ILSVC2014 dataset for bounding box detection and the PASCAL VOC2012 dataset for semantic segmentation.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"date_updated":"2021-01-12T06:48:18Z","citation":{"ieee":"A. Kolesnikov and C. Lampert, “Improving weakly-supervised object localization by micro-annotation,” in <i>Proceedings of the British Machine Vision Conference 2016</i>, York, United Kingdom, 2016, vol. 2016–September, p. 92.1-92.12.","ista":"Kolesnikov A, Lampert C. 2016. Improving weakly-supervised object localization by micro-annotation. Proceedings of the British Machine Vision Conference 2016. BMVC: British Machine Vision Conference vol. 2016–September, 92.1-92.12.","ama":"Kolesnikov A, Lampert C. Improving weakly-supervised object localization by micro-annotation. In: <i>Proceedings of the British Machine Vision Conference 2016</i>. Vol 2016-September. BMVA Press; 2016:92.1-92.12. doi:<a href=\"https://doi.org/10.5244/C.30.92\">10.5244/C.30.92</a>","chicago":"Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised Object Localization by Micro-Annotation.” In <i>Proceedings of the British Machine Vision Conference 2016</i>, 2016–September:92.1-92.12. BMVA Press, 2016. <a href=\"https://doi.org/10.5244/C.30.92\">https://doi.org/10.5244/C.30.92</a>.","apa":"Kolesnikov, A., &#38; Lampert, C. (2016). Improving weakly-supervised object localization by micro-annotation. In <i>Proceedings of the British Machine Vision Conference 2016</i> (Vol. 2016–September, p. 92.1-92.12). York, United Kingdom: BMVA Press. <a href=\"https://doi.org/10.5244/C.30.92\">https://doi.org/10.5244/C.30.92</a>","short":"A. Kolesnikov, C. Lampert, in:, Proceedings of the British Machine Vision Conference 2016, BMVA Press, 2016, p. 92.1-92.12.","mla":"Kolesnikov, Alexander, and Christoph Lampert. “Improving Weakly-Supervised Object Localization by Micro-Annotation.” <i>Proceedings of the British Machine Vision Conference 2016</i>, vol. 2016–September, BMVA Press, 2016, p. 92.1-92.12, doi:<a href=\"https://doi.org/10.5244/C.30.92\">10.5244/C.30.92</a>."},"publist_id":"6273","publication":"Proceedings of the British Machine Vision Conference 2016","scopus_import":1,"acknowledgement":"This work was funded in parts by the European Research Council\r\nunder the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant\r\nagreement no 308036. We gratefully acknowledge the support of NVIDIA Corporation with\r\nthe donation of the GPUs used for this research.","year":"2016","doi":"10.5244/C.30.92","day":"01","page":"92.1-92.12","oa":1,"language":[{"iso":"eng"}],"volume":"2016-September","month":"09","author":[{"first_name":"Alexander","last_name":"Kolesnikov","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87","full_name":"Kolesnikov, Alexander"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"quality_controlled":"1","project":[{"name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","call_identifier":"FP7"}],"oa_version":"Published Version","conference":{"start_date":"2016-09-19","end_date":"2016-09-22","location":"York, United Kingdom","name":"BMVC: British Machine Vision Conference"},"ec_funded":1,"status":"public","main_file_link":[{"open_access":"1","url":"http://www.bmva.org/bmvc/2016/papers/paper092/paper092.pdf"}],"date_created":"2018-12-11T11:50:09Z","_id":"1102","type":"conference"},{"article_number":"7797741","abstract":[{"lang":"eng","text":"We propose two parallel state-space-exploration algorithms for hybrid automaton (HA), with the goal of enhancing performance on multi-core shared-memory systems. The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN model checker, when traversing the discrete modes of the HA, and enhances it with a parallel exploration of the continuous states within each mode. We show that this simple-minded extension of PBFS does not provide the desired load balancing in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS), which uses a cheap precomputation of the cost associated with the post operations (both continuous and discrete) in order to improve load balancing. We illustrate the TP-BFS and the cost precomputation of the post operators on a support-function-based algorithm for state-space exploration. The performance comparison of the two algorithms shows that, in general, TP-BFS provides a better utilization/load-balancing of the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect to SpaceEx LGG scenario. In order to make the comparison fair, we employed an equal number of post operations in both tools. To the best of our knowledge, this paper represents the first attempt to provide parallel, reachability-analysis algorithms for HA."}],"month":"12","publication_status":"published","title":"Parallel reachability analysis for hybrid systems","date_published":"2016-12-27T00:00:00Z","language":[{"iso":"eng"}],"publisher":"IEEE","citation":{"short":"A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, R. Ray, in:, IEEE, 2016.","mla":"Gurung, Amit, et al. <i>Parallel Reachability Analysis for Hybrid Systems</i>. 7797741, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">10.1109/MEMCOD.2016.7797741</a>.","ieee":"A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, and R. Ray, “Parallel reachability analysis for hybrid systems,” presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India , 2016.","ama":"Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. Parallel reachability analysis for hybrid systems. In: IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">10.1109/MEMCOD.2016.7797741</a>","ista":"Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. 2016. Parallel reachability analysis for hybrid systems. MEMOCODE: International Conference on Formal Methods and Models for System Design, 7797741.","chicago":"Gurung, Amit, Arup Deka, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, and Rajarshi Ray. “Parallel Reachability Analysis for Hybrid Systems.” IEEE, 2016. <a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">https://doi.org/10.1109/MEMCOD.2016.7797741</a>.","apa":"Gurung, A., Deka, A., Bartocci, E., Bogomolov, S., Grosu, R., &#38; Ray, R. (2016). Parallel reachability analysis for hybrid systems. Presented at the MEMOCODE: International Conference on Formal Methods and Models for System Design, Kanpur, India : IEEE. <a href=\"https://doi.org/10.1109/MEMCOD.2016.7797741\">https://doi.org/10.1109/MEMCOD.2016.7797741</a>"},"oa_version":"Preprint","date_updated":"2021-01-12T06:48:18Z","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"department":[{"_id":"ToHe"}],"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Gurung","first_name":"Amit","full_name":"Gurung, Amit"},{"first_name":"Arup","last_name":"Deka","full_name":"Deka, Arup"},{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","last_name":"Bogomolov","first_name":"Sergiy"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"},{"full_name":"Ray, Rajarshi","last_name":"Ray","first_name":"Rajarshi"}],"scopus_import":1,"ec_funded":1,"conference":{"location":"Kanpur, India ","name":"MEMOCODE: International Conference on Formal Methods and Models for System Design","end_date":"2016-11-20","start_date":"2016-11-18"},"publist_id":"6272","type":"conference","_id":"1103","oa":1,"date_created":"2018-12-11T11:50:09Z","day":"27","doi":"10.1109/MEMCOD.2016.7797741","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1606.05473"}],"year":"2016","status":"public","acknowledgement":"This work was supported in part by DST-SERB, GoI under Project No. YSS/2014/000623 and by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award)."},{"date_created":"2022-04-07T07:47:42Z","type":"journal_article","_id":"11069","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1083/jcb.201603053"}],"status":"public","publication_identifier":{"issn":["0021-9525","1540-8140"]},"month":"10","issue":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":215,"quality_controlled":"1","oa_version":"Published Version","author":[{"full_name":"Hatch, Emily M.","first_name":"Emily M.","last_name":"Hatch"},{"id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","full_name":"HETZER, Martin W","first_name":"Martin W","last_name":"HETZER","orcid":"0000-0002-2111-992X"}],"scopus_import":"1","keyword":["Cell Biology"],"intvolume":"       215","publication":"Journal of Cell Biology","oa":1,"page":"27-36","year":"2016","doi":"10.1083/jcb.201603053","day":"03","abstract":[{"lang":"eng","text":"Repeated rounds of nuclear envelope (NE) rupture and repair have been observed in laminopathy and cancer cells and result in intermittent loss of nucleus compartmentalization. Currently, the causes of NE rupture are unclear. Here, we show that NE rupture in cancer cells relies on the assembly of contractile actin bundles that interact with the nucleus via the linker of nucleoskeleton and cytoskeleton (LINC) complex. We found that the loss of actin bundles or the LINC complex did not rescue nuclear lamina defects, a previously identified determinant of nuclear membrane stability, but did decrease the number and size of chromatin hernias. Finally, NE rupture inhibition could be rescued in cells treated with actin-depolymerizing drugs by mechanically constraining nucleus height. These data suggest a model of NE rupture where weak membrane areas, caused by defects in lamina organization, rupture because of an increase in intranuclear pressure from actin-based nucleus confinement."}],"publication_status":"published","date_published":"2016-10-03T00:00:00Z","publisher":"Rockefeller University Press","pmid":1,"title":"Nuclear envelope rupture is induced by actin-based nucleus confinement","date_updated":"2022-07-18T08:33:47Z","extern":"1","citation":{"chicago":"Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced by Actin-Based Nucleus Confinement.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2016. <a href=\"https://doi.org/10.1083/jcb.201603053\">https://doi.org/10.1083/jcb.201603053</a>.","ista":"Hatch EM, Hetzer M. 2016. Nuclear envelope rupture is induced by actin-based nucleus confinement. Journal of Cell Biology. 215(1), 27–36.","ama":"Hatch EM, Hetzer M. Nuclear envelope rupture is induced by actin-based nucleus confinement. <i>Journal of Cell Biology</i>. 2016;215(1):27-36. doi:<a href=\"https://doi.org/10.1083/jcb.201603053\">10.1083/jcb.201603053</a>","apa":"Hatch, E. M., &#38; Hetzer, M. (2016). Nuclear envelope rupture is induced by actin-based nucleus confinement. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201603053\">https://doi.org/10.1083/jcb.201603053</a>","ieee":"E. M. Hatch and M. Hetzer, “Nuclear envelope rupture is induced by actin-based nucleus confinement,” <i>Journal of Cell Biology</i>, vol. 215, no. 1. Rockefeller University Press, pp. 27–36, 2016.","short":"E.M. Hatch, M. Hetzer, Journal of Cell Biology 215 (2016) 27–36.","mla":"Hatch, Emily M., and Martin Hetzer. “Nuclear Envelope Rupture Is Induced by Actin-Based Nucleus Confinement.” <i>Journal of Cell Biology</i>, vol. 215, no. 1, Rockefeller University Press, 2016, pp. 27–36, doi:<a href=\"https://doi.org/10.1083/jcb.201603053\">10.1083/jcb.201603053</a>."},"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","external_id":{"pmid":["27697922"]}},{"_id":"11070","type":"journal_article","article_type":"original","date_created":"2022-04-07T07:48:08Z","publication_identifier":{"eissn":["1549-5477"],"issn":["0890-9369"]},"status":"public","main_file_link":[{"url":"https://doi.org/10.1101/gad.287417.116","open_access":"1"}],"oa_version":"Published Version","quality_controlled":"1","author":[{"first_name":"Arkaitz","last_name":"Ibarra","full_name":"Ibarra, Arkaitz"},{"first_name":"Chris","last_name":"Benner","full_name":"Benner, Chris"},{"first_name":"Swati","last_name":"Tyagi","full_name":"Tyagi, Swati"},{"full_name":"Cool, Jonah","last_name":"Cool","first_name":"Jonah"},{"orcid":"0000-0002-2111-992X","first_name":"Martin W","last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"issue":"20","month":"11","article_processing_charge":"No","volume":30,"language":[{"iso":"eng"}],"oa":1,"page":"2253-2258","day":"02","doi":"10.1101/gad.287417.116","year":"2016","keyword":["Developmental Biology","Genetics"],"scopus_import":"1","publication":"Genes & Development","intvolume":"        30","citation":{"ieee":"A. Ibarra, C. Benner, S. Tyagi, J. Cool, and M. Hetzer, “Nucleoporin-mediated regulation of cell identity genes,” <i>Genes &#38; Development</i>, vol. 30, no. 20. Cold Spring Harbor Laboratory, pp. 2253–2258, 2016.","chicago":"Ibarra, Arkaitz, Chris Benner, Swati Tyagi, Jonah Cool, and Martin Hetzer. “Nucleoporin-Mediated Regulation of Cell Identity Genes.” <i>Genes &#38; Development</i>. Cold Spring Harbor Laboratory, 2016. <a href=\"https://doi.org/10.1101/gad.287417.116\">https://doi.org/10.1101/gad.287417.116</a>.","ama":"Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. Nucleoporin-mediated regulation of cell identity genes. <i>Genes &#38; Development</i>. 2016;30(20):2253-2258. doi:<a href=\"https://doi.org/10.1101/gad.287417.116\">10.1101/gad.287417.116</a>","ista":"Ibarra A, Benner C, Tyagi S, Cool J, Hetzer M. 2016. Nucleoporin-mediated regulation of cell identity genes. Genes &#38; Development. 30(20), 2253–2258.","apa":"Ibarra, A., Benner, C., Tyagi, S., Cool, J., &#38; Hetzer, M. (2016). Nucleoporin-mediated regulation of cell identity genes. <i>Genes &#38; Development</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/gad.287417.116\">https://doi.org/10.1101/gad.287417.116</a>","mla":"Ibarra, Arkaitz, et al. “Nucleoporin-Mediated Regulation of Cell Identity Genes.” <i>Genes &#38; Development</i>, vol. 30, no. 20, Cold Spring Harbor Laboratory, 2016, pp. 2253–58, doi:<a href=\"https://doi.org/10.1101/gad.287417.116\">10.1101/gad.287417.116</a>.","short":"A. Ibarra, C. Benner, S. Tyagi, J. Cool, M. Hetzer, Genes &#38; Development 30 (2016) 2253–2258."},"date_updated":"2022-07-18T08:33:49Z","extern":"1","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","external_id":{"pmid":["27807035"]},"abstract":[{"text":"The organization of the genome in the three-dimensional space of the nucleus is coupled with cell type-specific gene expression. However, how nuclear architecture influences transcription that governs cell identity remains unknown. Here, we show that nuclear pore complex (NPC) components Nup93 and Nup153 bind superenhancers (SE), regulatory structures that drive the expression of key genes that specify cell identity. We found that nucleoporin-associated SEs localize preferentially to the nuclear periphery, and absence of Nup153 and Nup93 results in dramatic transcriptional changes of SE-associated genes. Our results reveal a crucial role of NPC components in the regulation of cell type-specifying genes and highlight nuclear architecture as a regulatory layer of genome functions in cell fate.","lang":"eng"}],"publication_status":"published","title":"Nucleoporin-mediated regulation of cell identity genes","publisher":"Cold Spring Harbor Laboratory","date_published":"2016-11-02T00:00:00Z","pmid":1}]