[{"type":"book_chapter","month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"29","citation":{"ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in <i>Mechanisms of primary energy transduction in biology </i>, M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.","chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In <i>Mechanisms of Primary Energy Transduction in Biology </i>, edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. <a href=\"https://doi.org/10.1039/9781788010405-00025\">https://doi.org/10.1039/9781788010405-00025</a>.","short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","ama":"Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Wikström M, ed. <i>Mechanisms of Primary Energy Transduction in Biology </i>. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:<a href=\"https://doi.org/10.1039/9781788010405-00025\">10.1039/9781788010405-00025</a>","mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” <i>Mechanisms of Primary Energy Transduction in Biology </i>, edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:<a href=\"https://doi.org/10.1039/9781788010405-00025\">10.1039/9781788010405-00025</a>.","apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), <i>Mechanisms of primary energy transduction in biology </i> (pp. 25–59). Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/9781788010405-00025\">https://doi.org/10.1039/9781788010405-00025</a>","ista":"Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction in biology . , 25–59."},"series_title":"Mechanisms of Primary Energy Transduction in Biology ","author":[{"last_name":"Sazanov","first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989"}],"oa_version":"None","date_updated":"2021-01-12T07:56:59Z","publication_status":"published","department":[{"_id":"LeSa"}],"publication_identifier":{"isbn":["978-1-78262-865-1"]},"editor":[{"last_name":"Wikström","full_name":"Wikström, Mårten","first_name":"Mårten"}],"status":"public","_id":"444","doi":"10.1039/9781788010405-00025","abstract":[{"lang":"eng","text":"Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy generation, contributing to the proton motive force used to produce ATP. It couples the transfer of two electrons between NADH and quinone to translocation of four protons across the membrane. It is the largest protein assembly of bacterial and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size, providing the important “minimal” model of complex I. The l-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. Previously, we have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane domain from Escherichia coli, followed by the atomic structure of intact, entire complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are well conserved from the bacterial version, whilst supernumerary subunits form an interlinked, stabilizing shell around the core. Subunits containing additional cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The structure of mammalian enzyme provides many insights into complex I mechanism, assembly, maturation and dysfunction, allowing detailed molecular analysis of disease-causing mutations."}],"publist_id":"7379","page":"25 - 59","date_created":"2018-12-11T11:46:30Z","publication":"Mechanisms of primary energy transduction in biology ","language":[{"iso":"eng"}],"year":"2017","publisher":"Royal Society of Chemistry","quality_controlled":"1","date_published":"2017-11-29T00:00:00Z","title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions"},{"intvolume":"         9","article_type":"original","page":"299 - 325","language":[{"iso":"eng"}],"publisher":"Instituto Nacional de Matematica Pura e Aplicada","month":"03","publication_status":"published","ec_funded":1,"day":"23","status":"public","doi":"10.30757/ALEA.v14-17","publist_id":"7376","abstract":[{"text":"We consider last passage percolation (LPP) models with exponentially distributed random variables, which are linked to the totally asymmetric simple exclusion process (TASEP). The competition interface for LPP was introduced and studied in Ferrari and Pimentel (2005a) for cases where the corresponding exclusion process had a rarefaction fan. Here we consider situations with a shock and determine the law of the fluctuations of the competition interface around its deter- ministic law of large number position. We also study the multipoint distribution of the LPP around the shock, extending our one-point result of Ferrari and Nejjar (2015).","lang":"eng"}],"date_created":"2018-12-11T11:46:31Z","main_file_link":[{"url":"http://alea.impa.br/articles/v14/14-17.pdf","open_access":"1"}],"year":"2017","volume":9,"article_processing_charge":"No","publication":"Revista Latino-Americana de Probabilidade e Estatística","date_published":"2017-03-23T00:00:00Z","title":"Fluctuations of the competition interface in presence of shocks","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"quality_controlled":"1","type":"journal_article","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"date_updated":"2023-10-10T13:10:32Z","oa_version":"Submitted Version","author":[{"first_name":"Patrik","full_name":"Ferrari, Patrik","last_name":"Ferrari"},{"id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Nejjar, Peter","last_name":"Nejjar"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"P. Ferrari and P. Nejjar, “Fluctuations of the competition interface in presence of shocks,” <i>Revista Latino-Americana de Probabilidade e Estatística</i>, vol. 9. Instituto Nacional de Matematica Pura e Aplicada, pp. 299–325, 2017.","short":"P. Ferrari, P. Nejjar, Revista Latino-Americana de Probabilidade e Estatística 9 (2017) 299–325.","ama":"Ferrari P, Nejjar P. Fluctuations of the competition interface in presence of shocks. <i>Revista Latino-Americana de Probabilidade e Estatística</i>. 2017;9:299-325. doi:<a href=\"https://doi.org/10.30757/ALEA.v14-17\">10.30757/ALEA.v14-17</a>","chicago":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” <i>Revista Latino-Americana de Probabilidade e Estatística</i>. Instituto Nacional de Matematica Pura e Aplicada, 2017. <a href=\"https://doi.org/10.30757/ALEA.v14-17\">https://doi.org/10.30757/ALEA.v14-17</a>.","ista":"Ferrari P, Nejjar P. 2017. Fluctuations of the competition interface in presence of shocks. Revista Latino-Americana de Probabilidade e Estatística. 9, 299–325.","apa":"Ferrari, P., &#38; Nejjar, P. (2017). Fluctuations of the competition interface in presence of shocks. <i>Revista Latino-Americana de Probabilidade e Estatística</i>. Instituto Nacional de Matematica Pura e Aplicada. <a href=\"https://doi.org/10.30757/ALEA.v14-17\">https://doi.org/10.30757/ALEA.v14-17</a>","mla":"Ferrari, Patrik, and Peter Nejjar. “Fluctuations of the Competition Interface in Presence of Shocks.” <i>Revista Latino-Americana de Probabilidade e Estatística</i>, vol. 9, Instituto Nacional de Matematica Pura e Aplicada, 2017, pp. 299–325, doi:<a href=\"https://doi.org/10.30757/ALEA.v14-17\">10.30757/ALEA.v14-17</a>."},"_id":"447","scopus_import":"1"},{"date_created":"2018-12-11T11:46:33Z","ddc":["570"],"year":"2017","volume":113,"article_processing_charge":"No","publication":"Biophysical Journal","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_published":"2017-11-07T00:00:00Z","title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","quality_controlled":"1","pubrep_id":"965","type":"journal_article","department":[{"_id":"MaLo"}],"file":[{"file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","date_updated":"2020-07-14T12:46:31Z","content_type":"application/pdf","file_size":977192,"access_level":"open_access","file_id":"5052","date_created":"2018-12-12T10:14:03Z","checksum":"99a2474088e20ac74b1882c4fbbb45b1","relation":"main_file","creator":"system"}],"oa_version":"Published Version","date_updated":"2021-01-12T07:59:28Z","author":[{"last_name":"Fallesen","full_name":"Fallesen, Todd","first_name":"Todd"},{"last_name":"Roostalu","full_name":"Roostalu, Johanna","first_name":"Johanna"},{"last_name":"Düllberg","orcid":"0000-0001-6335-9748","id":"459064DC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian F","full_name":"Düllberg, Christian F"},{"last_name":"Pruessner","first_name":"Gunnar","full_name":"Pruessner, Gunnar"},{"last_name":"Surrey","full_name":"Surrey, Thomas","first_name":"Thomas"}],"oa":1,"citation":{"ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” <i>Biophysical Journal</i>, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. 2017;113(9):2055-2067. doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>. Biophysical Society, 2017. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>.","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., &#38; Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">https://doi.org/10.1016/j.bpj.2017.09.006</a>","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” <i>Biophysical Journal</i>, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:<a href=\"https://doi.org/10.1016/j.bpj.2017.09.006\">10.1016/j.bpj.2017.09.006</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","_id":"453","file_date_updated":"2020-07-14T12:46:31Z","intvolume":"       113","article_type":"original","page":"2055 - 2067","language":[{"iso":"eng"}],"publisher":"Biophysical Society","month":"11","publication_status":"published","acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","day":"07","status":"public","issue":"9","publist_id":"7369","abstract":[{"lang":"eng","text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor."}],"doi":"10.1016/j.bpj.2017.09.006"},{"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"title":"Conditionally optimal algorithms for generalized Büchi Games","date_published":"2016-08-01T00:00:00Z","quality_controlled":"1","conference":{"end_date":"2016-08-26","location":"Krakow, Poland","start_date":"2016-08-22","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"tmp":{"name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","image":"/images/cc_by.png","short":"CC BY (3.0)"},"year":"2016","article_processing_charge":"No","volume":58,"ddc":["000","004","006"],"date_created":"2018-12-11T11:49:58Z","file_date_updated":"2018-12-12T10:16:02Z","scopus_import":"1","_id":"1068","oa_version":"Published Version","date_updated":"2025-06-02T08:53:50Z","department":[{"_id":"KrCh"}],"file":[{"creator":"system","relation":"main_file","date_updated":"2018-12-12T10:16:02Z","content_type":"application/pdf","file_size":632786,"file_name":"IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf","file_id":"5187","date_created":"2018-12-12T10:16:02Z","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"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.","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>.","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>","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","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>","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>.","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."},"oa":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"full_name":"Dvorák, Wolfgang","first_name":"Wolfgang","last_name":"Dvorák"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"pubrep_id":"779","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"article_number":"25","intvolume":"        58","license":"https://creativecommons.org/licenses/by/3.0/","publist_id":"6317","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"}],"doi":"10.4230/LIPIcs.MFCS.2016.25","status":"public","publication_status":"published","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","day":"01","ec_funded":1,"alternative_title":["LIPIcs"],"month":"08"},{"date_updated":"2021-01-12T06:48:03Z","oa_version":"Published Version","department":[{"_id":"KrCh"}],"file":[{"access_level":"open_access","file_id":"5213","date_created":"2018-12-12T10:16:26Z","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf","date_updated":"2018-12-12T10:16:26Z","content_type":"application/pdf","file_size":521415,"relation":"main_file","creator":"system"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"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.","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>.","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>","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","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>.","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."},"oa":1,"author":[{"last_name":"Chonev","id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","first_name":"Ventsislav K","full_name":"Chonev, Ventsislav K"},{"last_name":"Ouaknine","first_name":"Joël","full_name":"Ouaknine, Joël"},{"last_name":"Worrell","first_name":"James","full_name":"Worrell, James"}],"pubrep_id":"778","type":"conference","file_date_updated":"2018-12-12T10:16:26Z","scopus_import":1,"_id":"1069","year":"2016","volume":55,"ddc":["004","006"],"date_created":"2018-12-11T11:49:59Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"date_published":"2016-08-01T00:00:00Z","title":"On the skolem problem for continuous linear dynamical systems","quality_controlled":"1","conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2016-07-15","start_date":"2016-07-12","location":"Rome, Italy"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","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).","day":"01","ec_funded":1,"alternative_title":["LIPIcs"],"month":"08","doi":"10.4230/LIPIcs.ICALP.2016.100","abstract":[{"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.","lang":"eng"}],"publist_id":"6314","status":"public","language":[{"iso":"eng"}],"article_number":"100","intvolume":"        55","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik"},{"article_number":"98","intvolume":"        55","language":[{"iso":"eng"}],"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","month":"01","alternative_title":["LIPIcs"],"day":"01","ec_funded":1,"publication_status":"published","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","status":"public","abstract":[{"lang":"eng","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. "}],"doi":"10.4230/LIPIcs.ICALP.2016.98","publist_id":"6313","ddc":["005"],"date_created":"2018-12-11T11:49:59Z","volume":55,"year":"2016","conference":{"name":"ICALP: Automata, Languages and Programming","location":"Rome, Italy","start_date":"2016-07-12","end_date":"2016-07-15"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"date_published":"2016-01-01T00:00:00Z","title":"Computation tree logic for synchronization properties","type":"conference","pubrep_id":"812","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"short":"K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","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>","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>.","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.","ista":"Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.","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>","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>."},"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"oa":1,"date_updated":"2021-01-12T06:48:03Z","oa_version":"Published Version","department":[{"_id":"KrCh"}],"file":[{"relation":"main_file","creator":"system","file_name":"IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf","date_updated":"2018-12-12T10:08:52Z","content_type":"application/pdf","file_size":546133,"access_level":"open_access","file_id":"4714","date_created":"2018-12-12T10:08:52Z"}],"_id":"1070","file_date_updated":"2018-12-12T10:08:52Z","scopus_import":1},{"file_date_updated":"2018-12-12T10:14:31Z","scopus_import":1,"_id":"1071","has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>","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>.","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.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","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>","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>."},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"oa":1,"date_updated":"2023-09-07T12:01:58Z","oa_version":"Published Version","file":[{"date_updated":"2018-12-12T10:14:31Z","content_type":"application/pdf","file_size":579225,"file_name":"IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf","file_id":"5084","date_created":"2018-12-12T10:14:31Z","access_level":"open_access","creator":"system","relation":"main_file"}],"department":[{"_id":"KrCh"}],"type":"conference","pubrep_id":"777","quality_controlled":"1","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"date_published":"2016-08-01T00:00:00Z","title":"Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs","conference":{"name":"ESA: European Symposium on Algorithms","start_date":"2016-08-22","location":"Aarhus, Denmark","end_date":"2016-08-24"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":57,"year":"2016","ddc":["004","006"],"date_created":"2018-12-11T11:49:59Z","abstract":[{"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. ","lang":"eng"}],"publist_id":"6312","doi":"10.4230/LIPIcs.ESA.2016.28","status":"public","day":"01","ec_funded":1,"publication_status":"published","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).","month":"08","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"821"}]},"alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","language":[{"iso":"eng"}],"article_number":"28","intvolume":"        57"},{"intvolume":"         2","article_number":"16018","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","month":"07","ec_funded":1,"day":"19","publication_status":"published","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.","status":"public","doi":"10.1038/celldisc.2016.18","abstract":[{"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.","lang":"eng"}],"publist_id":"6299","date_created":"2018-12-11T11:50:02Z","ddc":["580"],"volume":2,"publication":"Cell Discovery","year":"2016","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","date_published":"2016-07-19T00:00:00Z","title":"Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells","project":[{"grant_number":"282300","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"type":"journal_article","pubrep_id":"757","author":[{"first_name":"Łukasz","full_name":"Łangowski, Łukasz","last_name":"Łangowski"},{"first_name":"Krzysztof T","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","full_name":"Wabnik, Krzysztof T","orcid":"0000-0001-7263-0560","last_name":"Wabnik"},{"full_name":"Li, Hongjiang","first_name":"Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5039-9660","last_name":"Li"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"last_name":"Naramoto","full_name":"Naramoto, Satoshi","first_name":"Satoshi"},{"full_name":"Tanaka, Hirokazu","first_name":"Hirokazu","last_name":"Tanaka"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>","short":"Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J. Friml, Cell Discovery 2 (2016).","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>","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>.","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."},"has_accepted_license":"1","file":[{"creator":"system","relation":"main_file","date_created":"2018-12-12T10:13:33Z","file_id":"5017","access_level":"open_access","file_size":5261671,"content_type":"application/pdf","date_updated":"2018-12-12T10:13:33Z","file_name":"IST-2017-757-v1+1_celldisc201618.pdf"}],"department":[{"_id":"EvBe"},{"_id":"JiFr"}],"oa_version":"Published Version","date_updated":"2021-01-12T06:48:08Z","_id":"1081","scopus_import":1,"file_date_updated":"2018-12-12T10:13:33Z"},{"language":[{"iso":"eng"}],"page":"309-312","intvolume":"        43","publisher":"Computing in Cardiology","day":"01","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.","month":"03","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. "}],"doi":"10.22489/cinc.2016.090-500","publication_identifier":{"issn":["2325-887X"]},"status":"public","publication":"2016 Computing in Cardiology Conference","volume":43,"article_processing_charge":"No","year":"2016","main_file_link":[{"open_access":"1","url":"https://doi.org/10.22489/cinc.2016.090-500"}],"date_created":"2022-03-03T10:43:10Z","quality_controlled":"1","title":"SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography","date_published":"2016-03-01T00:00:00Z","conference":{"name":"CinC: Computing in Cardiology","location":"Vancouver, Canada","start_date":"2016-09-11","end_date":"2016-09-14"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>","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.","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>","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>.","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."},"author":[{"last_name":"Rubel","first_name":"Paul","full_name":"Rubel, Paul"},{"last_name":"Pani","full_name":"Pani, Danilo","first_name":"Danilo"},{"last_name":"Schlögl","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois","full_name":"Schlögl, Alois"},{"last_name":"Fayn","full_name":"Fayn, Jocelyne","first_name":"Jocelyne"},{"first_name":"Fabio","full_name":"Badilini, Fabio","last_name":"Badilini"},{"last_name":"Macfarlane","first_name":"Peter","full_name":"Macfarlane, Peter"},{"last_name":"Varri","first_name":"Alpo","full_name":"Varri, Alpo"}],"oa":1,"oa_version":"Published Version","date_updated":"2022-03-04T07:34:45Z","department":[{"_id":"CampIT"}],"type":"conference","scopus_import":"1","_id":"10810"},{"volume":29,"language":[{"iso":"eng"}],"year":"2016","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1605.07332"}],"page":"1965-1973","date_created":"2018-12-11T11:50:03Z","intvolume":"        29","quality_controlled":"1","title":"Relevant sparse codes with variational information bottleneck","date_published":"2016-12-01T00:00:00Z","publisher":"Neural Information Processing Systems","conference":{"end_date":"2016-12-10","start_date":"2016-12-05","location":"Barcelona, Spain","name":"NIPS: Neural Information Processing Systems"},"author":[{"orcid":"0000-0001-7782-4436","full_name":"Chalk, Matthew J","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87","first_name":"Matthew J","last_name":"Chalk"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik"}],"oa":1,"citation":{"short":"M.J. Chalk, O. Marre, G. Tkačik, in:, Neural Information Processing Systems, 2016, pp. 1965–1973.","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.","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.","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.","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.","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."},"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GaTk"}],"oa_version":"Preprint","date_updated":"2021-01-12T06:48:09Z","publication_status":"published","month":"12","related_material":{"link":[{"url":"https://papers.nips.cc/paper/6101-relevant-sparse-codes-with-variational-information-bottleneck","relation":"other"}]},"type":"conference","alternative_title":["Advances in Neural Information Processing Systems"],"scopus_import":1,"abstract":[{"lang":"eng","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."}],"publist_id":"6298","_id":"1082","status":"public"},{"page":"2318 - 2334","date_created":"2018-12-11T11:50:03Z","intvolume":"        27","language":[{"iso":"eng"}],"volume":27,"publication":"Cerebral Cortex","year":"2016","publisher":"Oxford University Press","quality_controlled":"1","title":"KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons","date_published":"2016-04-12T00:00:00Z","month":"04","type":"journal_article","author":[{"last_name":"Booker","full_name":"Booker, Sam","first_name":"Sam"},{"last_name":"Althof","full_name":"Althof, Daniel","first_name":"Daniel"},{"first_name":"Anna","full_name":"Gross, Anna","last_name":"Gross"},{"last_name":"Loreth","first_name":"Desiree","full_name":"Loreth, Desiree"},{"last_name":"Müller","first_name":"Johanna","full_name":"Müller, Johanna"},{"first_name":"Andreas","full_name":"Unger, Andreas","last_name":"Unger"},{"full_name":"Fakler, Bernd","first_name":"Bernd","last_name":"Fakler"},{"last_name":"Varro","full_name":"Varro, Andrea","first_name":"Andrea"},{"last_name":"Watanabe","first_name":"Masahiko","full_name":"Watanabe, Masahiko"},{"first_name":"Martin","full_name":"Gassmann, Martin","last_name":"Gassmann"},{"last_name":"Bettler","first_name":"Bernhard","full_name":"Bettler, Bernhard"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Shigemoto, Ryuichi","first_name":"Ryuichi","last_name":"Shigemoto"},{"full_name":"Vida, Imre","first_name":"Imre","last_name":"Vida"},{"last_name":"Kulik","first_name":"Ákos","full_name":"Kulik, Ákos"}],"day":"12","citation":{"ista":"Booker S, Althof D, Gross A, Loreth D, Müller J, Unger A, Fakler B, Varro A, Watanabe M, Gassmann M, Bettler B, Shigemoto R, Vida I, Kulik Á. 2016. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. Cerebral Cortex. 27(3), 2318–2334.","mla":"Booker, Sam, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>, vol. 27, no. 3, Oxford University Press, 2016, pp. 2318–34, doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>.","apa":"Booker, S., Althof, D., Gross, A., Loreth, D., Müller, J., Unger, A., … Kulik, Á. (2016). KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>","ieee":"S. Booker <i>et al.</i>, “KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons,” <i>Cerebral Cortex</i>, vol. 27, no. 3. Oxford University Press, pp. 2318–2334, 2016.","ama":"Booker S, Althof D, Gross A, et al. KCTD12 auxiliary proteins modulate kinetics of GABAB receptor-mediated inhibition in Cholecystokinin-containing interneurons. <i>Cerebral Cortex</i>. 2016;27(3):2318-2334. doi:<a href=\"https://doi.org/10.1093/cercor/bhw090\">10.1093/cercor/bhw090</a>","short":"S. Booker, D. Althof, A. Gross, D. Loreth, J. Müller, A. Unger, B. Fakler, A. Varro, M. Watanabe, M. Gassmann, B. Bettler, R. Shigemoto, I. Vida, Á. Kulik, Cerebral Cortex 27 (2016) 2318–2334.","chicago":"Booker, Sam, Daniel Althof, Anna Gross, Desiree Loreth, Johanna Müller, Andreas Unger, Bernd Fakler, et al. “KCTD12 Auxiliary Proteins Modulate Kinetics of GABAB Receptor-Mediated Inhibition in Cholecystokinin-Containing Interneurons.” <i>Cerebral Cortex</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/cercor/bhw090\">https://doi.org/10.1093/cercor/bhw090</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RySh"}],"publication_status":"published","date_updated":"2021-01-12T06:48:09Z","acknowledgement":"This work was supported by the Deutsche Forschungsgemeinschaft (DFG SFB 780 A2, A.K.; SFB TR3 I.V. and EXC 257, I.V.; FOR 2143, A.K. and I.V.), Spemann Graduate School (D.A.), BIOSS-2 (A6, A.K.), the Swiss National Science Foundation (3100A0-117816, B.B.), The McNaught Bequest (S.A.B. and I.V.), and Tenovus Scotland (I.V.).\r\n\r\n\r\nWe thank Cheryl Hutton and Chinmaya Sadangi for their contributions to neuronal reconstruction as well as Natalie Wernet, Sigrun Nestel, Anikó Schneider, Ina Wolter, and Ulrich Noeller for their excellent technical support. VGAT-Venus transgenic rats were generated by Drs Y. Yanagawa, M. Hirabayashi, and Y. Kawaguchi in National Institute for Physiological Sciences, Okazaki, Japan, using pCS2-Venus provided by Dr A. Miyawaki. The monoclonal mouse CCK antibody was generously provided by Dr G.V. Ohning, CURE Center, UCLA, CA. ","oa_version":"None","_id":"1083","status":"public","publist_id":"6297","doi":"10.1093/cercor/bhw090","abstract":[{"lang":"eng","text":" Cholecystokinin-expressing interneurons (CCK-INs) mediate behavior state-dependent inhibition in cortical circuits and themselves receive strong GABAergic input. However, it remains unclear to what extent GABABreceptors (GABABRs) contribute to their inhibitory control. Using immunoelectron microscopy, we found that CCK-INs in the rat hippocampus possessed high levels of dendritic GABABRs and KCTD12 auxiliary proteins, whereas postsynaptic effector Kir3 channels were present at lower levels. Consistently, whole-cell recordings revealed slow GABABR-mediated inhibitory postsynaptic currents (IPSCs) in most CCK-INs. In spite of the higher surface density of GABABRs in CCK-INs than in CA1 principal cells, the amplitudes of IPSCs were comparable, suggesting that the expression of Kir3 channels is the limiting factor for the GABABR currents in these INs. Morphological analysis showed that CCK-INs were diverse, comprising perisomatic-targeting basket cells (BCs), as well as dendrite-targeting (DT) interneurons, including a previously undescribed DT type. GABABR-mediated IPSCs in CCK-INs were large in BCs, but small in DT subtypes. In response to prolonged activation, GABABR-mediated currents displayed strong desensitization, which was absent in KCTD12-deficient mice. This study highlights that GABABRs differentially control CCK-IN subtypes, and the kinetics and desensitization of GABABR-mediated currents are modulated by KCTD12 proteins. "}],"issue":"3"},{"status":"public","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"}],"doi":"10.4230/LIPIcs.MFCS.2016.24","publist_id":"6286","alternative_title":["LIPIcs"],"month":"08","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.","publication_status":"published","day":"01","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_number":"24","intvolume":"        58","language":[{"iso":"eng"}],"_id":"1090","file_date_updated":"2018-12-12T10:17:31Z","scopus_import":1,"pubrep_id":"795","type":"conference","oa_version":"Published Version","date_updated":"2021-01-12T06:48:12Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file":[{"relation":"main_file","creator":"system","access_level":"open_access","file_id":"5286","date_created":"2018-12-12T10:17:31Z","file_name":"IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf","date_updated":"2018-12-12T10:17:31Z","content_type":"application/pdf","file_size":564560}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"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.","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>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","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>","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>.","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."},"oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"start_date":"2016-08-22","location":"Krakow; Poland","end_date":"2016-08-26","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"title":"Nested weighted limit-average automata of bounded width","date_published":"2016-08-01T00:00:00Z","quality_controlled":"1","ddc":["004"],"date_created":"2018-12-11T11:50:05Z","year":"2016","volume":58},{"title":"Linear distances between Markov chains","date_published":"2016-08-01T00:00:00Z","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"name":"CONCUR: Concurrency Theory","end_date":"2016-08-26","start_date":"2016-08-23","location":"Quebec City; Canada"},"year":"2016","volume":59,"date_created":"2018-12-11T11:50:06Z","ddc":["004"],"scopus_import":1,"file_date_updated":"2018-12-12T10:11:39Z","_id":"1093","department":[{"_id":"ToHe"},{"_id":"KrCh"},{"_id":"CaGu"}],"file":[{"file_name":"IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf","date_updated":"2018-12-12T10:11:39Z","content_type":"application/pdf","file_size":501827,"access_level":"open_access","file_id":"4895","date_created":"2018-12-12T10:11:39Z","relation":"main_file","creator":"system"}],"date_updated":"2023-09-07T11:58:33Z","oa_version":"Published Version","author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan"},{"orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","last_name":"Petrov"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"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>","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","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>.","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.","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>."},"pubrep_id":"794","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","language":[{"iso":"eng"}],"intvolume":"        59","article_number":"20","abstract":[{"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. ","lang":"eng"}],"publist_id":"6283","doi":"10.4230/LIPIcs.CONCUR.2016.20","status":"public","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.","publication_status":"published","ec_funded":1,"day":"01","alternative_title":["LIPIcs"],"related_material":{"record":[{"status":"public","id":"1155","relation":"dissertation_contains"}]},"month":"08"},{"language":[{"iso":"eng"}],"page":"203 - 216","intvolume":"      1474","publisher":"Springer","day":"12","ec_funded":1,"acknowledgement":"We thank Prof. Elek Molnár for providing us a pan-AMPAR anti-body used in Fig.2 and Dr. Ludek Lovicar for technical assistance in scanning electron microscope imaging. This work was supported by the European Union (HBP—Project Ref. 604102). ","publication_status":"published","month":"08","alternative_title":["Methods in Molecular Biology"],"publist_id":"6281","abstract":[{"lang":"eng","text":"Immunogold labeling of freeze-fracture replicas has recently been used for high-resolution visualization of protein localization in electron microscopy. This method has higher labeling efficiency than conventional immunogold methods for membrane molecules allowing precise quantitative measurements. However, one of the limitations of freeze-fracture replica immunolabeling is difficulty in keeping structural orientation and identifying labeled profiles in complex tissues like brain. The difficulty is partly due to fragmentation of freeze-fracture replica preparations during labeling procedures and limited morphological clues on the replica surface. To overcome these issues, we introduce here a grid-glued replica method combined with SEM observation. This method allows histological staining before dissolving the tissue and easy handling of replicas during immunogold labeling, and keeps the whole replica surface intact without fragmentation. The procedure described here is also useful for matched double-replica analysis allowing further identification of labeled profiles in corresponding P-face and E-face."}],"doi":"10.1007/978-1-4939-6352-2_12","acknowledged_ssus":[{"_id":"EM-Fac"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"]},"status":"public","publication":"High-Resolution Imaging of Cellular Proteins","volume":1474,"article_processing_charge":"No","year":"2016","date_created":"2018-12-11T11:50:06Z","quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"25CD3DD2-B435-11E9-9278-68D0E5697425","name":"Localization of ion channels and receptors by two and three-dimensional immunoelectron microscopic approaches","grant_number":"604102"}],"date_published":"2016-08-12T00:00:00Z","title":"Immunogold protein localization on grid-glued freeze-fracture replicas","citation":{"ama":"Harada H, Shigemoto R. Immunogold protein localization on grid-glued freeze-fracture replicas. In: <i>High-Resolution Imaging of Cellular Proteins</i>. Vol 1474. Springer; 2016:203-216. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>","short":"H. Harada, R. Shigemoto, in:, High-Resolution Imaging of Cellular Proteins, Springer, 2016, pp. 203–216.","chicago":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” In <i>High-Resolution Imaging of Cellular Proteins</i>, 1474:203–16. Springer, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>.","ieee":"H. Harada and R. Shigemoto, “Immunogold protein localization on grid-glued freeze-fracture replicas,” in <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–216.","ista":"Harada H, Shigemoto R. 2016.Immunogold protein localization on grid-glued freeze-fracture replicas. In: High-Resolution Imaging of Cellular Proteins. Methods in Molecular Biology, vol. 1474, 203–216.","apa":"Harada, H., &#38; Shigemoto, R. (2016). Immunogold protein localization on grid-glued freeze-fracture replicas. In <i>High-Resolution Imaging of Cellular Proteins</i> (Vol. 1474, pp. 203–216). Springer. <a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">https://doi.org/10.1007/978-1-4939-6352-2_12</a>","mla":"Harada, Harumi, and Ryuichi Shigemoto. “Immunogold Protein Localization on Grid-Glued Freeze-Fracture Replicas.” <i>High-Resolution Imaging of Cellular Proteins</i>, vol. 1474, Springer, 2016, pp. 203–16, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6352-2_12\">10.1007/978-1-4939-6352-2_12</a>."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"orcid":"0000-0001-7429-7896","full_name":"Harada, Harumi","first_name":"Harumi","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Harada"},{"last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444"}],"date_updated":"2023-09-05T14:09:01Z","oa_version":"None","department":[{"_id":"RySh"}],"type":"book_chapter","_id":"1094"},{"status":"public","abstract":[{"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. ","lang":"eng"}],"doi":"10.4230/LIPIcs.CONCUR.2016.6","publist_id":"6280","month":"08","alternative_title":["LIPIcs"],"ec_funded":1,"day":"01","publication_status":"published","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).","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"        59","article_number":"6","language":[{"iso":"eng"}],"_id":"1095","scopus_import":1,"file_date_updated":"2018-12-12T10:10:10Z","type":"conference","pubrep_id":"793","author":[{"first_name":"Andreas","full_name":"Haas, Andreas","last_name":"Haas"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Holzer","full_name":"Holzer, Andreas","first_name":"Andreas"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"},{"first_name":"Michael","full_name":"Lippautz, Michael","last_name":"Lippautz"},{"first_name":"Hannes","full_name":"Payer, Hannes","last_name":"Payer"},{"first_name":"Ali","full_name":"Sezgin, Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","last_name":"Sezgin"},{"last_name":"Sokolova","full_name":"Sokolova, Ana","first_name":"Ana"},{"first_name":"Helmut","full_name":"Veith, Helmut","last_name":"Veith"}],"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>","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>.","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>","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."},"has_accepted_license":"1","file":[{"relation":"main_file","creator":"system","file_name":"IST-2017-793-v1+1_LIPIcs-CONCUR-2016-6.pdf","file_size":589747,"date_updated":"2018-12-12T10:10:10Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:10:10Z","file_id":"4795"}],"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T06:48:14Z","oa_version":"Published Version","conference":{"end_date":"2016-08-26","start_date":"2016-08-23","location":"Quebec City; Canada","name":"CONCUR: Concurrency Theory"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","title":"Local linearizability for concurrent container-type data structures","date_published":"2016-08-01T00:00:00Z","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"date_created":"2018-12-11T11:50:07Z","ddc":["004"],"volume":59,"publication":"Leibniz International Proceedings in Informatics","year":"2016"},{"status":"public","_id":"1096","issue":"6","publist_id":"6279","doi":"10.1016/j.devcel.2016.05.024","scopus_import":1,"type":"journal_article","month":"06","related_material":{"record":[{"relation":"part_of_dissertation","id":"7186","status":"public"}]},"date_updated":"2023-09-07T12:56:41Z","publication_status":"published","oa_version":"None","department":[{"_id":"CaHe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"20","citation":{"ista":"Schwayer C, Sikora MK, Slovakova J, Kardos R, Heisenberg C-PJ. 2016. Actin rings of power. Developmental Cell. 37(6), 493–506.","apa":"Schwayer, C., Sikora, M. K., Slovakova, J., Kardos, R., &#38; Heisenberg, C.-P. J. (2016). Actin rings of power. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">https://doi.org/10.1016/j.devcel.2016.05.024</a>","mla":"Schwayer, Cornelia, et al. “Actin Rings of Power.” <i>Developmental Cell</i>, vol. 37, no. 6, Cell Press, 2016, pp. 493–506, doi:<a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">10.1016/j.devcel.2016.05.024</a>.","ieee":"C. Schwayer, M. K. Sikora, J. Slovakova, R. Kardos, and C.-P. J. Heisenberg, “Actin rings of power,” <i>Developmental Cell</i>, vol. 37, no. 6. Cell Press, pp. 493–506, 2016.","short":"C. Schwayer, M.K. Sikora, J. Slovakova, R. Kardos, C.-P.J. Heisenberg, Developmental Cell 37 (2016) 493–506.","ama":"Schwayer C, Sikora MK, Slovakova J, Kardos R, Heisenberg C-PJ. Actin rings of power. <i>Developmental Cell</i>. 2016;37(6):493-506. doi:<a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">10.1016/j.devcel.2016.05.024</a>","chicago":"Schwayer, Cornelia, Mateusz K Sikora, Jana Slovakova, Roland Kardos, and Carl-Philipp J Heisenberg. “Actin Rings of Power.” <i>Developmental Cell</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.devcel.2016.05.024\">https://doi.org/10.1016/j.devcel.2016.05.024</a>."},"author":[{"id":"3436488C-F248-11E8-B48F-1D18A9856A87","first_name":"Cornelia","full_name":"Schwayer, Cornelia","orcid":"0000-0001-5130-2226","last_name":"Schwayer"},{"first_name":"Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","full_name":"Sikora, Mateusz K","last_name":"Sikora"},{"id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87","first_name":"Jana","full_name":"Slovakova, Jana","last_name":"Slovakova"},{"id":"4039350E-F248-11E8-B48F-1D18A9856A87","first_name":"Roland","full_name":"Kardos, Roland","last_name":"Kardos"},{"last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"publisher":"Cell Press","title":"Actin rings of power","date_published":"2016-06-20T00:00:00Z","quality_controlled":"1","date_created":"2018-12-11T11:50:07Z","intvolume":"        37","page":"493 - 506","year":"2016","publication":"Developmental Cell","language":[{"iso":"eng"}],"volume":37},{"_id":"1097","scopus_import":1,"file_date_updated":"2018-12-12T10:17:42Z","pubrep_id":"759","type":"conference","department":[{"_id":"BeBi"}],"file":[{"file_name":"IST-2017-759-v1+1_copter.pdf","file_size":33114420,"content_type":"application/pdf","date_updated":"2018-12-12T10:17:42Z","access_level":"open_access","date_created":"2018-12-12T10:17:42Z","file_id":"5298","relation":"main_file","creator":"system"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T06:48:15Z","oa":1,"author":[{"first_name":"Tao","full_name":"Du, Tao","last_name":"Du"},{"last_name":"Schulz","full_name":"Schulz, Adriana","first_name":"Adriana"},{"full_name":"Zhu, Bo","first_name":"Bo","last_name":"Zhu"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Matusik","first_name":"Wojciech","full_name":"Matusik, Wojciech"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"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.","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>.","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>","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>","short":"T. Du, A. Schulz, B. Zhu, B. Bickel, W. Matusik, in:, ACM, 2016.","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>.","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."},"conference":{"name":"SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","end_date":"2016-12-08","start_date":"2016-12-05","location":"Macao, China"},"date_published":"2016-11-01T00:00:00Z","title":"Computational multicopter design","project":[{"call_identifier":"H2020","_id":"25082902-B435-11E9-9278-68D0E5697425","name":"Soft-bodied intelligence for Manipulation","grant_number":"645599"}],"quality_controlled":"1","date_created":"2018-12-11T11:50:07Z","ddc":["006"],"year":"2016","volume":35,"status":"public","issue":"6","abstract":[{"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.","lang":"eng"}],"publist_id":"6278","doi":"10.1145/2980179.2982427","alternative_title":["ACM Transactions on Graphics"],"month":"11","publication_status":"published","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. ","ec_funded":1,"day":"01","publisher":"ACM","intvolume":"        35","article_number":"227","language":[{"iso":"eng"}]},{"pubrep_id":"775","type":"conference","department":[{"_id":"ChLa"}],"file":[{"file_id":"4961","date_created":"2018-12-12T10:12:42Z","access_level":"open_access","date_updated":"2018-12-12T10:12:42Z","content_type":"application/pdf","file_size":237111,"file_name":"IST-2017-775-v1+1_main.pdf","creator":"system","relation":"main_file"},{"file_name":"IST-2017-775-v1+2_supplementary.pdf","content_type":"application/pdf","date_updated":"2018-12-12T10:12:43Z","file_size":185818,"access_level":"open_access","file_id":"4962","date_created":"2018-12-12T10:12:43Z","relation":"main_file","creator":"system"}],"date_updated":"2021-01-12T06:48:15Z","oa_version":"Published Version","oa":1,"author":[{"last_name":"Pentina","full_name":"Pentina, Anastasia","id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","first_name":"Anastasia"},{"last_name":"Urner","first_name":"Ruth","full_name":"Urner, Ruth"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","citation":{"ama":"Pentina A, Urner R. Lifelong learning with weighted majority votes. In: Vol 29. Neural Information Processing Systems; 2016:3619-3627.","short":"A. Pentina, R. Urner, in:, Neural Information Processing Systems, 2016, pp. 3619–3627.","chicago":"Pentina, Anastasia, and Ruth Urner. “Lifelong Learning with Weighted Majority Votes,” 29:3619–27. Neural Information Processing Systems, 2016.","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.","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.","mla":"Pentina, Anastasia, and Ruth Urner. <i>Lifelong Learning with Weighted Majority Votes</i>. Vol. 29, Neural Information Processing Systems, 2016, pp. 3619–27.","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."},"_id":"1098","scopus_import":1,"file_date_updated":"2018-12-12T10:12:43Z","date_created":"2018-12-11T11:50:08Z","ddc":["006"],"year":"2016","volume":29,"conference":{"end_date":"2016-12-10","location":"Barcelona, Spain","start_date":"2016-12-05","name":"NIPS: Neural Information Processing Systems"},"date_published":"2016-12-01T00:00:00Z","title":"Lifelong learning with weighted majority votes","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","alternative_title":["Advances in Neural Information Processing Systems"],"month":"12","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","publication_status":"published","ec_funded":1,"day":"01","status":"public","abstract":[{"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.","lang":"eng"}],"publist_id":"6277","intvolume":"        29","page":"3619-3627","language":[{"iso":"eng"}],"publisher":"Neural Information Processing Systems"},{"publisher":"ACM","language":[{"iso":"eng"}],"article_number":"223","intvolume":"        35","abstract":[{"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.","lang":"eng"}],"doi":"10.1145/2980179.2982397","publist_id":"6276","issue":"6","status":"public","day":"01","ec_funded":1,"publication_status":"published","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.","month":"11","alternative_title":["ACM Transactions on Graphics"],"quality_controlled":"1","project":[{"grant_number":"645599","name":"Soft-bodied intelligence for Manipulation","call_identifier":"H2020","_id":"25082902-B435-11E9-9278-68D0E5697425"}],"title":"FlexMolds: Automatic design of flexible shells for molding","date_published":"2016-11-01T00:00:00Z","conference":{"name":"SIGGRAPH Asia: Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia","end_date":"2016-12-08","start_date":"2016-12-05","location":"Macao, China"},"volume":35,"year":"2016","ddc":["000","005"],"date_created":"2018-12-11T11:50:08Z","file_date_updated":"2018-12-12T10:12:01Z","scopus_import":1,"_id":"1099","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"L. Malomo, N. Pietroni, B. Bickel, P. Cignoni, in:, ACM, 2016.","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>","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>.","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.","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.","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>","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>."},"has_accepted_license":"1","oa":1,"author":[{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"last_name":"Pietroni","first_name":"Nico","full_name":"Pietroni, Nico"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"last_name":"Cignoni","first_name":"Paolo","full_name":"Cignoni, Paolo"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T06:48:16Z","file":[{"file_name":"IST-2017-760-v1+1_flexmolds.pdf","date_updated":"2018-12-12T10:12:01Z","content_type":"application/pdf","file_size":11122029,"access_level":"open_access","file_id":"4918","date_created":"2018-12-12T10:12:01Z","relation":"main_file","creator":"system"}],"department":[{"_id":"BeBi"}],"type":"conference","pubrep_id":"760"},{"day":"19","ec_funded":1,"publication_status":"published","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.","related_material":{"record":[{"id":"961","relation":"dissertation_contains","status":"public"},{"status":"public","relation":"dissertation_contains","id":"50"}]},"month":"07","abstract":[{"lang":"eng","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."}],"doi":"10.1016/j.celrep.2016.06.036","publist_id":"6275","issue":"3","acknowledged_ssus":[{"_id":"SSU"}],"status":"public","language":[{"iso":"eng"}],"page":"866 - 877","intvolume":"        16","publisher":"Cell Press","has_accepted_license":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>","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>.","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.","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.","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>.","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>"},"author":[{"first_name":"Keisuke","id":"3BED66BE-F248-11E8-B48F-1D18A9856A87","full_name":"Sako, Keisuke","orcid":"0000-0002-6453-8075","last_name":"Sako"},{"full_name":"Pradhan, Saurabh","first_name":"Saurabh","last_name":"Pradhan"},{"orcid":"0000-0003-2676-3367","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","first_name":"Vanessa","full_name":"Barone, Vanessa","last_name":"Barone"},{"full_name":"Inglés Prieto, Álvaro","id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","first_name":"Álvaro","orcid":"0000-0002-5409-8571","last_name":"Inglés Prieto"},{"first_name":"Patrick","full_name":"Mueller, Patrick","last_name":"Mueller"},{"orcid":"0000-0003-4088-8633","first_name":"Verena","full_name":"Ruprecht, Verena","id":"4D71A03A-F248-11E8-B48F-1D18A9856A87","last_name":"Ruprecht"},{"orcid":"0000-0001-5199-9940","first_name":"Daniel","full_name":"Capek, Daniel","id":"31C42484-F248-11E8-B48F-1D18A9856A87","last_name":"Capek"},{"last_name":"Galande","full_name":"Galande, Sanjeev","first_name":"Sanjeev"},{"last_name":"Janovjak","first_name":"Harald L","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315"},{"last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"oa":1,"oa_version":"Published Version","date_updated":"2024-03-25T23:30:13Z","department":[{"_id":"CaHe"},{"_id":"HaJa"}],"file":[{"relation":"main_file","creator":"system","access_level":"open_access","file_id":"4857","date_created":"2018-12-12T10:11:04Z","file_name":"IST-2017-754-v1+1_1-s2.0-S2211124716307768-main.pdf","content_type":"application/pdf","date_updated":"2018-12-12T10:11:04Z","file_size":3921947}],"type":"journal_article","pubrep_id":"754","file_date_updated":"2018-12-12T10:11:04Z","scopus_import":1,"_id":"1100","publication":"Cell Reports","volume":16,"year":"2016","ddc":["570","576"],"date_created":"2018-12-11T11:50:08Z","quality_controlled":"1","project":[{"grant_number":"T 560-B17","name":"Cell- and Tissue Mechanics in Zebrafish Germ Layer Formation","call_identifier":"FWF","_id":"2529486C-B435-11E9-9278-68D0E5697425"},{"name":"Cell Cortex and Germ Layer Formation in Zebrafish Gastrulation","grant_number":"I 812-B12","call_identifier":"FWF","_id":"2527D5CC-B435-11E9-9278-68D0E5697425"},{"_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"303564","name":"Microbial Ion Channels for Synthetic Neurobiology"}],"title":"Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation","date_published":"2016-07-19T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}}]