[{"article_type":"original","type":"journal_article","status":"public","_id":"1113","file_date_updated":"2019-10-24T10:54:37Z","department":[{"_id":"UlWa"}],"date_updated":"2023-02-23T10:05:57Z","ddc":["510"],"scopus_import":1,"month":"01","intvolume":" 21","abstract":[{"lang":"eng","text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C 1 , . . . , C k with common center c , and edges are drawn radially : every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Toth."}],"oa_version":"Published Version","related_material":{"record":[{"relation":"earlier_version","id":"1164","status":"public"},{"relation":"earlier_version","id":"1595","status":"public"}]},"volume":21,"issue":"1","ec_funded":1,"publication_status":"published","file":[{"date_created":"2019-10-24T10:54:37Z","file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","date_updated":"2019-10-24T10:54:37Z","file_size":573623,"creator":"dernst","file_id":"6967","success":1,"content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publist_id":"6254","author":[{"last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"last_name":"Schaefer","full_name":"Schaefer, Marcus","first_name":"Marcus"}],"external_id":{"arxiv":["1608.08662"]},"article_processing_charge":"No","title":"Hanani-Tutte for radial planarity","citation":{"mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00408","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408","chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown University, 2017. https://doi.org/10.7155/jgaa.00408.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Brown University","quality_controlled":"1","oa":1,"page":"135 - 154","doi":"10.7155/jgaa.00408","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:50:13Z","has_accepted_license":"1","year":"2017","day":"01","publication":"Journal of Graph Algorithms and Applications"},{"page":"25 - 59","date_created":"2018-12-11T11:46:30Z","doi":"10.1039/9781788010405-00025","date_published":"2017-11-29T00:00:00Z","year":"2017","publication_status":"published","publication_identifier":{"isbn":["978-1-78262-865-1"]},"publication":"Mechanisms of primary energy transduction in biology ","language":[{"iso":"eng"}],"day":"29","quality_controlled":"1","publisher":"Royal Society of Chemistry","month":"11","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."}],"oa_version":"None","publist_id":"7379","author":[{"orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A"}],"editor":[{"full_name":"Wikström, Mårten","last_name":"Wikström","first_name":"Mårten"}],"department":[{"_id":"LeSa"}],"title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions","date_updated":"2021-01-12T07:56:59Z","citation":{"short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in Mechanisms of primary energy transduction in biology , M. Wikström, Ed. 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. Mechanisms of Primary Energy Transduction in Biology . Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:10.1039/9781788010405-00025","apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), Mechanisms of primary energy transduction in biology (pp. 25–59). Royal Society of Chemistry. https://doi.org/10.1039/9781788010405-00025","mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:10.1039/9781788010405-00025.","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.","chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781788010405-00025."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"book_chapter","status":"public","_id":"444","series_title":"Mechanisms of Primary Energy Transduction in Biology "},{"title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement","article_processing_charge":"No","publist_id":"7369","author":[{"first_name":"Todd","full_name":"Fallesen, Todd","last_name":"Fallesen"},{"first_name":"Johanna","full_name":"Roostalu, Johanna","last_name":"Roostalu"},{"last_name":"Düllberg","full_name":"Düllberg, Christian F","orcid":"0000-0001-6335-9748","id":"459064DC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian F"},{"full_name":"Pruessner, Gunnar","last_name":"Pruessner","first_name":"Gunnar"},{"last_name":"Surrey","full_name":"Surrey, Thomas","first_name":"Thomas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006.","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.","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.","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,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","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. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006"},"date_created":"2018-12-11T11:46:33Z","date_published":"2017-11-07T00:00:00Z","doi":"10.1016/j.bpj.2017.09.006","page":"2055 - 2067","publication":"Biophysical Journal","day":"07","year":"2017","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Biophysical Society","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). ","department":[{"_id":"MaLo"}],"file_date_updated":"2020-07-14T12:46:31Z","ddc":["570"],"date_updated":"2021-01-12T07:59:28Z","pubrep_id":"965","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","_id":"453","volume":113,"issue":"9","language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"99a2474088e20ac74b1882c4fbbb45b1","file_id":"5052","creator":"system","file_size":977192,"date_updated":"2020-07-14T12:46:31Z","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","date_created":"2018-12-12T10:14:03Z"}],"publication_status":"published","intvolume":" 113","month":"11","oa_version":"Published Version","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."}]},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years."}],"month":"09","intvolume":" 13","scopus_import":"1","file":[{"file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","date_created":"2018-12-12T10:13:27Z","file_size":582940,"date_updated":"2020-07-14T12:46:32Z","creator":"system","file_id":"5010","checksum":"12d469ae69b80361333d7dead965cf5d","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["1860-5974"]},"publication_status":"published","issue":"3","related_material":{"record":[{"status":"public","id":"1661","relation":"earlier_version"}]},"volume":13,"ec_funded":1,"_id":"464","status":"public","pubrep_id":"956","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"ddc":["004"],"date_updated":"2023-02-23T10:08:55Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:32Z","quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"day":"26","publication":"Logical Methods in Computer Science","has_accepted_license":"1","year":"2017","date_published":"2017-09-26T00:00:00Z","doi":"10.23638/LMCS-13(3:26)2017","date_created":"2018-12-11T11:46:37Z","article_number":"26","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017."},"title":"Improved algorithms for parity and Streett objectives","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"}],"publist_id":"7357","external_id":{"arxiv":["1410.0833"]},"article_processing_charge":"No"},{"department":[{"_id":"ChWo"}],"file_date_updated":"2020-07-14T12:46:34Z","ddc":["006"],"date_updated":"2023-02-23T12:20:26Z","status":"public","type":"journal_article","article_type":"original","_id":"470","ec_funded":1,"issue":"4","volume":36,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","file_id":"7359","file_size":13131683,"date_updated":"2020-07-14T12:46:34Z","creator":"wojtan","file_name":"wavepackets_final.pdf","date_created":"2020-01-24T09:32:35Z"}],"publication_status":"published","publication_identifier":{"issn":["07300301"]},"intvolume":" 36","month":"07","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios."}],"acknowledged_ssus":[{"_id":"ScienComp"}],"title":"Water wave packets","article_processing_charge":"Yes (in subscription journal)","publist_id":"7350","author":[{"first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","full_name":"Jeschke, Stefan","last_name":"Jeschke"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103."},"project":[{"grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"article_number":"103","date_created":"2018-12-11T11:46:39Z","doi":"10.1145/3072959.3073678","date_published":"2017-07-01T00:00:00Z","publication":"ACM Transactions on Graphics","day":"01","year":"2017","has_accepted_license":"1","oa":1,"publisher":"ACM","quality_controlled":"1"},{"oa":1,"publisher":"ACM","quality_controlled":"1","date_created":"2018-12-11T11:46:39Z","date_published":"2017-05-01T00:00:00Z","doi":"10.1145/3060139","publication":"ACM Transactions on Computational Logic (TOCL)","day":"01","year":"2017","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"article_number":"12","title":"Faster statistical model checking for unbounded temporal properties","publist_id":"7349","author":[{"full_name":"Daca, Przemyslaw","last_name":"Daca","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Petrov","full_name":"Petrov, Tatjana","orcid":"0000-0002-9041-0905","first_name":"Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017.","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139"},"intvolume":" 18","month":"05","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. "}],"ec_funded":1,"volume":18,"issue":"2","related_material":{"record":[{"status":"public","id":"1234","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["15293785"]},"status":"public","type":"journal_article","_id":"471","department":[{"_id":"ToHe"}],"date_updated":"2023-02-21T16:48:11Z"},{"department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:46:35Z","ddc":["004","514","516"],"date_updated":"2023-02-21T16:06:22Z","pubrep_id":"949","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","_id":"481","related_material":{"record":[{"relation":"earlier_version","id":"10892","status":"public"}]},"volume":26,"issue":"3-4","language":[{"iso":"eng"}],"file":[{"checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","file_id":"4758","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","date_created":"2018-12-12T10:09:34Z","file_size":769296,"date_updated":"2020-07-14T12:46:35Z","creator":"system"}],"publication_status":"published","intvolume":" 26","month":"04","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings."}],"title":"Planar matchings for weighted straight skeletons","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Palfrader","full_name":"Palfrader, Peter","first_name":"Peter"}],"publist_id":"7338","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050.","ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050."},"date_created":"2018-12-11T11:46:43Z","date_published":"2017-04-13T00:00:00Z","doi":"10.1142/S0218195916600050","page":"211 - 229","publication":"International Journal of Computational Geometry and Applications","day":"13","year":"2017","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"World Scientific Publishing","acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15."},{"month":"01","intvolume":" 21","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory."}],"volume":21,"issue":"3","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["10950761"]},"publication_status":"published","status":"public","type":"journal_article","_id":"484","department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T08:00:58Z","quality_controlled":"1","publisher":"International Press","oa":1,"doi":"10.4310/ATMP.2017.v21.n3.a4","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:46:43Z","page":"683 - 738","day":"01","publication":"Advances in Theoretical and Mathematical Physics","year":"2017","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","publist_id":"7336","author":[{"full_name":"Nam, Phan","last_name":"Nam","first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M","first_name":"Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4.","ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4."}},{"day":"25","publication":"Advances in Theoretical and Mathematical Physics","year":"2017","doi":"10.4310/ATMP.2017.v21.n3.a5","date_published":"2017-08-25T00:00:00Z","date_created":"2018-12-11T11:46:43Z","page":"739 - 800","quality_controlled":"1","publisher":"International Press","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5.","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800."},"title":"Universality for a class of random band matrices","publist_id":"7337","author":[{"last_name":"Bourgade","full_name":"Bourgade, Paul","first_name":"Paul"},{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"},{"last_name":"Yin","full_name":"Yin, Jun","first_name":"Jun"}],"project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","grant_number":"338804"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["10950761"]},"publication_status":"published","volume":21,"issue":"3","ec_funded":1,"oa_version":"Submitted Version","abstract":[{"text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices.","lang":"eng"}],"month":"08","intvolume":" 21","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1602.02312","open_access":"1"}],"date_updated":"2021-01-12T08:00:57Z","department":[{"_id":"LaEr"}],"_id":"483","status":"public","type":"journal_article"},{"publist_id":"7333","author":[{"last_name":"Baig","full_name":"Baig, Ghufran","first_name":"Ghufran"},{"first_name":"Bozidar","full_name":"Radunovic, Bozidar","last_name":"Radunovic"},{"orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"Matthew","last_name":"Balkwill","full_name":"Balkwill, Matthew"},{"last_name":"Karagiannis","full_name":"Karagiannis, Thomas","first_name":"Thomas"},{"last_name":"Qiu","full_name":"Qiu, Lili","first_name":"Lili"}],"title":"Towards unlicensed cellular networks in TV white spaces","department":[{"_id":"DaAl"}],"date_updated":"2023-02-23T12:21:11Z","citation":{"apa":"Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., & Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367","ama":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367","ieee":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.","short":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.","mla":"Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.","ista":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14.","chicago":"Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","conference":{"name":"CoNEXT: Conference on emerging Networking EXperiments and Technologies","end_date":"2017-12-15","location":"Incheon, South Korea","start_date":"2017-12-12"},"status":"public","_id":"487","page":"2 - 14","doi":"10.1145/3143361.3143367","date_published":"2017-11-28T00:00:00Z","date_created":"2018-12-11T11:46:45Z","publication_identifier":{"isbn":["978-145035422-6"]},"publication_status":"published","year":"2017","day":"28","publication":"Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies","language":[{"iso":"eng"}],"scopus_import":1,"quality_controlled":"1","publisher":"ACM","month":"11","abstract":[{"text":"In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x.","lang":"eng"}],"oa_version":"None"}]