[{"oa":1,"day":"09","doi":"10.1063/1.4932606","year":"2015","scopus_import":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"149","status":"public"}]},"publication":"Journal of Mathematical Physics","publist_id":"5472","intvolume":"        56","citation":{"chicago":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” <i>Journal of Mathematical Physics</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1063/1.4932606\">https://doi.org/10.1063/1.4932606</a>.","ista":"Alt J. 2015. The local semicircle law for random matrices with a fourfold symmetry. Journal of Mathematical Physics. 56(10), 103301.","ama":"Alt J. The local semicircle law for random matrices with a fourfold symmetry. <i>Journal of Mathematical Physics</i>. 2015;56(10). doi:<a href=\"https://doi.org/10.1063/1.4932606\">10.1063/1.4932606</a>","apa":"Alt, J. (2015). The local semicircle law for random matrices with a fourfold symmetry. <i>Journal of Mathematical Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4932606\">https://doi.org/10.1063/1.4932606</a>","ieee":"J. Alt, “The local semicircle law for random matrices with a fourfold symmetry,” <i>Journal of Mathematical Physics</i>, vol. 56, no. 10. American Institute of Physics, 2015.","short":"J. Alt, Journal of Mathematical Physics 56 (2015).","mla":"Alt, Johannes. “The Local Semicircle Law for Random Matrices with a Fourfold Symmetry.” <i>Journal of Mathematical Physics</i>, vol. 56, no. 10, 103301, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1063/1.4932606\">10.1063/1.4932606</a>."},"department":[{"_id":"LaEr"}],"date_updated":"2023-09-07T12:38:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"We consider real symmetric and complex Hermitian random matrices with the additional symmetry hxy = hN-y,N-x. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble naturally arises as the Fourier transform of a Gaussian orthogonal ensemble. Italso occurs as the flip matrix model - an approximation of the two-dimensional Anderson model at small disorder. We show that the density of states converges to the Wigner semicircle law despite the new symmetry type. We also prove the local version of the semicircle law on the optimal scale."}],"title":"The local semicircle law for random matrices with a fourfold symmetry","publisher":"American Institute of Physics","date_published":"2015-10-09T00:00:00Z","type":"journal_article","_id":"1677","date_created":"2018-12-11T11:53:25Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1506.04683"}],"status":"public","ec_funded":1,"oa_version":"Preprint","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"quality_controlled":"1","author":[{"last_name":"Alt","first_name":"Johannes","full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87"}],"article_number":"103301","issue":"10","month":"10","volume":56,"language":[{"iso":"eng"}]},{"date_created":"2018-12-11T11:53:25Z","type":"journal_article","_id":"1678","status":"public","pubrep_id":"837","ec_funded":1,"project":[{"name":"Microbial Ion Channels for Synthetic Neurobiology","_id":"25548C20-B435-11E9-9278-68D0E5697425","grant_number":"303564","call_identifier":"FP7"},{"name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors (HFSP Young Investigator)","_id":"255BFFFA-B435-11E9-9278-68D0E5697425","grant_number":"RGY0084/2012"},{"name":"Molecular Drug Targets","grant_number":"W1232-B24","_id":"255A6082-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","full_name":"Inglés Prieto, Álvaro","first_name":"Álvaro","last_name":"Inglés Prieto","orcid":"0000-0002-5409-8571"},{"orcid":"0000-0002-7218-7738","last_name":"Gschaider-Reichhart","first_name":"Eva","full_name":"Gschaider-Reichhart, Eva","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Muellner","first_name":"Markus","full_name":"Muellner, Markus"},{"id":"30845DAA-F248-11E8-B48F-1D18A9856A87","full_name":"Nowak, Matthias","last_name":"Nowak","first_name":"Matthias"},{"last_name":"Nijman","first_name":"Sebastian","full_name":"Nijman, Sebastian"},{"full_name":"Grusch, Michael","last_name":"Grusch","first_name":"Michael"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315"}],"has_accepted_license":"1","month":"10","issue":"12","file":[{"file_size":1308364,"access_level":"open_access","creator":"system","file_id":"4842","checksum":"e9fb251dfcb7cd209b83f17867e61321","relation":"main_file","file_name":"IST-2017-837-v1+1_ingles-prieto.pdf","date_updated":"2020-07-14T12:45:12Z","date_created":"2018-12-12T10:10:51Z","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"volume":11,"oa":1,"acknowledgement":"This work was supported by grants from the European Union Seventh Framework Programme (CIG-303564 to H.J. and ERC-StG-311166 to S.M.B.N.), the Human Frontier Science Program (RGY0084_2012 to H.J.) and the Herzfelder Foundation (to M.G.). A.I.-P. was supported by a Ramon Areces fellowship, and E.R. by the graduate program MolecularDrugTargets (Austrian Science Fund (FWF): W 1232) and a FemTech fellowship (3580812 Austrian Research Promotion Agency).","day":"12","page":"952 - 954","year":"2015","doi":"10.1038/nchembio.1933","related_material":{"record":[{"id":"418","relation":"dissertation_contains","status":"public"}]},"scopus_import":1,"intvolume":"        11","publist_id":"5471","publication":"Nature Chemical Biology","date_updated":"2023-09-07T12:49:09Z","department":[{"_id":"HaJa"},{"_id":"LifeSc"}],"citation":{"short":"Á. Inglés Prieto, E. Gschaider-Reichhart, M. Muellner, M. Nowak, S. Nijman, M. Grusch, H.L. Janovjak, Nature Chemical Biology 11 (2015) 952–954.","mla":"Inglés Prieto, Álvaro, et al. “Light-Assisted Small-Molecule Screening against Protein Kinases.” <i>Nature Chemical Biology</i>, vol. 11, no. 12, Nature Publishing Group, 2015, pp. 952–54, doi:<a href=\"https://doi.org/10.1038/nchembio.1933\">10.1038/nchembio.1933</a>.","ieee":"Á. Inglés Prieto <i>et al.</i>, “Light-assisted small-molecule screening against protein kinases,” <i>Nature Chemical Biology</i>, vol. 11, no. 12. Nature Publishing Group, pp. 952–954, 2015.","apa":"Inglés Prieto, Á., Gschaider-Reichhart, E., Muellner, M., Nowak, M., Nijman, S., Grusch, M., &#38; Janovjak, H. L. (2015). Light-assisted small-molecule screening against protein kinases. <i>Nature Chemical Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nchembio.1933\">https://doi.org/10.1038/nchembio.1933</a>","ama":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, et al. Light-assisted small-molecule screening against protein kinases. <i>Nature Chemical Biology</i>. 2015;11(12):952-954. doi:<a href=\"https://doi.org/10.1038/nchembio.1933\">10.1038/nchembio.1933</a>","ista":"Inglés Prieto Á, Gschaider-Reichhart E, Muellner M, Nowak M, Nijman S, Grusch M, Janovjak HL. 2015. Light-assisted small-molecule screening against protein kinases. Nature Chemical Biology. 11(12), 952–954.","chicago":"Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Markus Muellner, Matthias Nowak, Sebastian Nijman, Michael Grusch, and Harald L Janovjak. “Light-Assisted Small-Molecule Screening against Protein Kinases.” <i>Nature Chemical Biology</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nchembio.1933\">https://doi.org/10.1038/nchembio.1933</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"High-throughput live-cell screens are intricate elements of systems biology studies and drug discovery pipelines. Here, we demonstrate an optogenetics-assisted method that avoids the need for chemical activators and reporters, reduces the number of operational steps and increases information content in a cell-based small-molecule screen against human protein kinases, including an orphan receptor tyrosine kinase. This blueprint for all-optical screening can be adapted to many drug targets and cellular processes.","lang":"eng"}],"publication_status":"published","ddc":["571"],"date_published":"2015-10-12T00:00:00Z","publisher":"Nature Publishing Group","file_date_updated":"2020-07-14T12:45:12Z","title":"Light-assisted small-molecule screening against protein kinases"},{"publication":"Physics of Fluids","publist_id":"5469","intvolume":"        27","scopus_import":1,"day":"24","year":"2015","doi":"10.1063/1.4930850","oa":1,"title":"Taylor's Forest","date_published":"2015-09-24T00:00:00Z","publisher":"American Institute of Physics","file_date_updated":"2020-07-14T12:45:12Z","ddc":["532"],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"short":"G.M. Lemoult, P. Maier, B. Hof, Physics of Fluids 27 (2015).","mla":"Lemoult, Grégoire M., et al. “Taylor’s Forest.” <i>Physics of Fluids</i>, vol. 27, no. 9, 091102, American Institute of Physics, 2015, doi:<a href=\"https://doi.org/10.1063/1.4930850\">10.1063/1.4930850</a>.","ieee":"G. M. Lemoult, P. Maier, and B. Hof, “Taylor’s Forest,” <i>Physics of Fluids</i>, vol. 27, no. 9. American Institute of Physics, 2015.","ista":"Lemoult GM, Maier P, Hof B. 2015. Taylor’s Forest. Physics of Fluids. 27(9), 091102.","ama":"Lemoult GM, Maier P, Hof B. Taylor’s Forest. <i>Physics of Fluids</i>. 2015;27(9). doi:<a href=\"https://doi.org/10.1063/1.4930850\">10.1063/1.4930850</a>","chicago":"Lemoult, Grégoire M, Philipp Maier, and Björn Hof. “Taylor’s Forest.” <i>Physics of Fluids</i>. American Institute of Physics, 2015. <a href=\"https://doi.org/10.1063/1.4930850\">https://doi.org/10.1063/1.4930850</a>.","apa":"Lemoult, G. M., Maier, P., &#38; Hof, B. (2015). Taylor’s Forest. <i>Physics of Fluids</i>. American Institute of Physics. <a href=\"https://doi.org/10.1063/1.4930850\">https://doi.org/10.1063/1.4930850</a>"},"department":[{"_id":"BjHo"}],"date_updated":"2021-01-12T06:52:28Z","pubrep_id":"748","status":"public","license":"https://creativecommons.org/licenses/by/4.0/","type":"journal_article","_id":"1679","date_created":"2018-12-11T11:53:26Z","volume":27,"language":[{"iso":"eng"}],"article_number":"091102","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:13:35Z","date_updated":"2020-07-14T12:45:12Z","file_name":"IST-2017-748-v1+1_1.4930850.pdf","relation":"main_file","checksum":"604bba3c2496aadb3efcff77de01ce6c","file_id":"5019","creator":"system","access_level":"open_access","file_size":872366}],"issue":"9","month":"09","has_accepted_license":"1","author":[{"first_name":"Grégoire M","last_name":"Lemoult","full_name":"Lemoult, Grégoire M","id":"4787FE80-F248-11E8-B48F-1D18A9856A87"},{"id":"384F7C04-F248-11E8-B48F-1D18A9856A87","full_name":"Maier, Philipp","first_name":"Philipp","last_name":"Maier"},{"orcid":"0000-0003-2057-2754","last_name":"Hof","first_name":"Björn","full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","quality_controlled":"1"},{"department":[{"_id":"ToHe"}],"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"quality_controlled":"1","date_updated":"2021-01-12T06:52:29Z","citation":{"short":"J. Michaliszyn, J. Otop, E. Kieroňski, ACM Transactions on Computational Logic 17 (2015).","mla":"Michaliszyn, Jakub, et al. “On the Decidability of Elementary Modal Logics.” <i>ACM Transactions on Computational Logic</i>, vol. 17, no. 1, 2, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2817825\">10.1145/2817825</a>.","apa":"Michaliszyn, J., Otop, J., &#38; Kieroňski, E. (2015). On the decidability of elementary modal logics. <i>ACM Transactions on Computational Logic</i>. ACM. <a href=\"https://doi.org/10.1145/2817825\">https://doi.org/10.1145/2817825</a>","chicago":"Michaliszyn, Jakub, Jan Otop, and Emanuel Kieroňski. “On the Decidability of Elementary Modal Logics.” <i>ACM Transactions on Computational Logic</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2817825\">https://doi.org/10.1145/2817825</a>.","ama":"Michaliszyn J, Otop J, Kieroňski E. On the decidability of elementary modal logics. <i>ACM Transactions on Computational Logic</i>. 2015;17(1). doi:<a href=\"https://doi.org/10.1145/2817825\">10.1145/2817825</a>","ista":"Michaliszyn J, Otop J, Kieroňski E. 2015. On the decidability of elementary modal logics. ACM Transactions on Computational Logic. 17(1), 2.","ieee":"J. Michaliszyn, J. Otop, and E. Kieroňski, “On the decidability of elementary modal logics,” <i>ACM Transactions on Computational Logic</i>, vol. 17, no. 1. ACM, 2015."},"oa_version":"None","author":[{"first_name":"Jakub","last_name":"Michaliszyn","full_name":"Michaliszyn, Jakub"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"},{"first_name":"Emanuel","last_name":"Kieroňski","full_name":"Kieroňski, Emanuel"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","publication_status":"published","abstract":[{"text":"We consider the satisfiability problem for modal logic over first-order definable classes of frames.We confirm the conjecture from Hemaspaandra and Schnoor [2008] that modal logic is decidable over classes definable by universal Horn formulae. We provide a full classification of Horn formulae with respect to the complexity of the corresponding satisfiability problem. It turns out, that except for the trivial case of inconsistent formulae, local satisfiability is eitherNP-complete or PSPACE-complete, and global satisfiability is NP-complete, PSPACE-complete, or ExpTime-complete. We also show that the finite satisfiability problem for modal logic over Horn definable classes of frames is decidable. On the negative side, we show undecidability of two related problems. First, we exhibit a simple universal three-variable formula defining the class of frames over which modal logic is undecidable. Second, we consider the satisfiability problem of bimodal logic over Horn definable classes of frames, and also present a formula leading to undecidability.","lang":"eng"}],"article_number":"2","issue":"1","language":[{"iso":"eng"}],"publisher":"ACM","date_published":"2015-09-01T00:00:00Z","title":"On the decidability of elementary modal logics","volume":17,"date_created":"2018-12-11T11:53:26Z","type":"journal_article","_id":"1680","day":"01","doi":"10.1145/2817825","status":"public","year":"2015","publist_id":"5468","intvolume":"        17","ec_funded":1,"publication":"ACM Transactions on Computational Logic"},{"scopus_import":"1","publist_id":"5467","intvolume":"         6","publication":"Games","oa":1,"page":"413 - 437","year":"2015","doi":"10.3390/g6040413","day":"29","publication_status":"published","abstract":[{"text":"In many social situations, individuals endeavor to find the single best possible partner, but are constrained to evaluate the candidates in sequence. Examples include the search for mates, economic partnerships, or any other long-term ties where the choice to interact involves two parties. Surprisingly, however, previous theoretical work on mutual choice problems focuses on finding equilibrium solutions, while ignoring the evolutionary dynamics of decisions. Empirically, this may be of high importance, as some equilibrium solutions can never be reached unless the population undergoes radical changes and a sufficient number of individuals change their decisions simultaneously. To address this question, we apply a mutual choice sequential search problem in an evolutionary game-theoretical model that allows one to find solutions that are favored by evolution. As an example, we study the influence of sequential search on the evolutionary dynamics of cooperation. For this, we focus on the classic snowdrift game and the prisoner’s dilemma game.","lang":"eng"}],"ddc":["000"],"publisher":"MDPI","file_date_updated":"2020-07-14T12:45:12Z","date_published":"2015-09-29T00:00:00Z","title":"Evolution of decisions in population games with sequentially searching individuals","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"date_updated":"2023-10-17T11:42:52Z","citation":{"ieee":"T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” <i>Games</i>, vol. 6, no. 4. MDPI, pp. 413–437, 2015.","ista":"Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.","chicago":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” <i>Games</i>. MDPI, 2015. <a href=\"https://doi.org/10.3390/g6040413\">https://doi.org/10.3390/g6040413</a>.","ama":"Priklopil T, Chatterjee K. Evolution of decisions in population games with sequentially searching individuals. <i>Games</i>. 2015;6(4):413-437. doi:<a href=\"https://doi.org/10.3390/g6040413\">10.3390/g6040413</a>","apa":"Priklopil, T., &#38; Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. <i>Games</i>. MDPI. <a href=\"https://doi.org/10.3390/g6040413\">https://doi.org/10.3390/g6040413</a>","mla":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” <i>Games</i>, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:<a href=\"https://doi.org/10.3390/g6040413\">10.3390/g6040413</a>.","short":"T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"pubrep_id":"448","ec_funded":1,"date_created":"2018-12-11T11:53:26Z","article_type":"original","_id":"1681","type":"journal_article","publication_identifier":{"eissn":["2073-4336"]},"status":"public","month":"09","has_accepted_license":"1","file":[{"checksum":"912e1acbaf201100f447a43e4d5958bd","file_id":"4959","creator":"system","access_level":"open_access","file_size":518832,"relation":"main_file","file_name":"IST-2016-448-v1+1_games-06-00413.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:12:41Z","date_updated":"2020-07-14T12:45:12Z"}],"issue":"4","language":[{"iso":"eng"}],"volume":6,"article_processing_charge":"No","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Published Version","author":[{"first_name":"Tadeas","last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","full_name":"Priklopil, Tadeas"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"}]},{"status":"public","year":"2015","day":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1402.0858"}],"doi":"10.1145/2751524","date_created":"2018-12-11T11:53:27Z","oa":1,"_id":"1682","type":"journal_article","publist_id":"5466","intvolume":"        62","publication":"Journal of the ACM","scopus_import":1,"author":[{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál","first_name":"Marek"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2021-01-12T06:52:30Z","oa_version":"Preprint","citation":{"short":"P. Franek, M. Krcál, Journal of the ACM 62 (2015).","mla":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” <i>Journal of the ACM</i>, vol. 62, no. 4, 26, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2751524\">10.1145/2751524</a>.","apa":"Franek, P., &#38; Krcál, M. (2015). Robust satisfiability of systems of equations. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2751524\">https://doi.org/10.1145/2751524</a>","ista":"Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.","chicago":"Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.” <i>Journal of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2751524\">https://doi.org/10.1145/2751524</a>.","ama":"Franek P, Krcál M. Robust satisfiability of systems of equations. <i>Journal of the ACM</i>. 2015;62(4). doi:<a href=\"https://doi.org/10.1145/2751524\">10.1145/2751524</a>","ieee":"P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” <i>Journal of the ACM</i>, vol. 62, no. 4. ACM, 2015."},"date_published":"2015-08-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"ACM","volume":62,"title":"Robust satisfiability of systems of equations","publication_status":"published","month":"08","abstract":[{"text":"We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K→ ℝn on a finite simplicial complex K and α &gt; 0, it holds that each function g: K → ℝn such that ||g - f || ∞ &lt; α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis. Via a reverse reduction, we prove that the problem is undecidable when dim K &gt; 2n - 2, where the threshold comes from the stable range in homotopy theory. For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings.","lang":"eng"}],"article_number":"26","issue":"4"},{"issue":"8","abstract":[{"lang":"eng","text":"The 1 MDa, 45-subunit proton-pumping NADH-ubiquinone oxidoreductase (complex I) is the largest complex of the mitochondrial electron transport chain. The molecular mechanism of complex I is central to the metabolism of cells, but has yet to be fully characterized. The last two years have seen steady progress towards this goal with the first atomic-resolution structure of the entire bacterial complex I, a 5 Å cryo-electron microscopy map of bovine mitochondrial complex I and a ∼3.8 Å resolution X-ray crystallographic study of mitochondrial complex I from yeast Yarrowia lipotytica. In this review we will discuss what we have learned from these studies and what remains to be elucidated."}],"month":"08","publication_status":"published","title":"Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions","volume":33,"language":[{"iso":"eng"}],"publisher":"Elsevier","date_published":"2015-08-01T00:00:00Z","oa_version":"None","citation":{"short":"J.A. Letts, L.A. Sazanov, Current Opinion in Structural Biology 33 (2015) 135–145.","mla":"Letts, James A., and Leonid A. Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” <i>Current Opinion in Structural Biology</i>, vol. 33, no. 8, Elsevier, 2015, pp. 135–45, doi:<a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">10.1016/j.sbi.2015.08.008</a>.","chicago":"Letts, James A, and Leonid A Sazanov. “Gaining Mass: The Structure of Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” <i>Current Opinion in Structural Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">https://doi.org/10.1016/j.sbi.2015.08.008</a>.","ista":"Letts JA, Sazanov LA. 2015. Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. Current Opinion in Structural Biology. 33(8), 135–145.","ama":"Letts JA, Sazanov LA. Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. <i>Current Opinion in Structural Biology</i>. 2015;33(8):135-145. doi:<a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">10.1016/j.sbi.2015.08.008</a>","apa":"Letts, J. A., &#38; Sazanov, L. A. (2015). Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions. <i>Current Opinion in Structural Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.sbi.2015.08.008\">https://doi.org/10.1016/j.sbi.2015.08.008</a>","ieee":"J. A. Letts and L. A. Sazanov, “Gaining mass: The structure of respiratory complex I-from bacterial towards mitochondrial versions,” <i>Current Opinion in Structural Biology</i>, vol. 33, no. 8. Elsevier, pp. 135–145, 2015."},"date_updated":"2021-01-12T06:52:30Z","quality_controlled":"1","department":[{"_id":"LeSa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"322DA418-F248-11E8-B48F-1D18A9856A87","full_name":"Letts, Jame A","first_name":"Jame A","last_name":"Letts","orcid":"0000-0002-9864-3586"},{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","first_name":"Leonid A","last_name":"Sazanov","orcid":"0000-0002-0977-7989"}],"scopus_import":1,"publication":"Current Opinion in Structural Biology","intvolume":"        33","publist_id":"5465","_id":"1683","type":"journal_article","date_created":"2018-12-11T11:53:27Z","page":"135 - 145","doi":"10.1016/j.sbi.2015.08.008","status":"public","day":"01","year":"2015"},{"oa_version":"Preprint","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Cohen Addad","first_name":"Vincent","full_name":"Cohen Addad, Vincent"},{"first_name":"Arnaud N","last_name":"De Mesmay","full_name":"De Mesmay, Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87"}],"month":"09","volume":9294,"language":[{"iso":"eng"}],"_id":"1685","type":"conference","date_created":"2018-12-11T11:53:27Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1507.01688"}],"status":"public","conference":{"name":"ESA: European Symposium on Algorithms","location":"Patras, Greece","end_date":"2015-09-16","start_date":"2015-09-14"},"ec_funded":1,"citation":{"short":"V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.","mla":"Cohen Addad, Vincent, and Arnaud N. de Mesmay. <i>A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface</i>. Vol. 9294, Springer, 2015, pp. 386–98, doi:<a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">10.1007/978-3-662-48350-3_33</a>.","ieee":"V. Cohen Addad and A. N. de Mesmay, “A fixed parameter tractable approximation scheme for the optimal cut graph of a surface,” presented at the ESA: European Symposium on Algorithms, Patras, Greece, 2015, vol. 9294, pp. 386–398.","chicago":"Cohen Addad, Vincent, and Arnaud N de Mesmay. “A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface,” 9294:386–98. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">https://doi.org/10.1007/978-3-662-48350-3_33</a>.","ista":"Cohen Addad V, de Mesmay AN. 2015. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. ESA: European Symposium on Algorithms, LNCS, vol. 9294, 386–398.","ama":"Cohen Addad V, de Mesmay AN. A fixed parameter tractable approximation scheme for the optimal cut graph of a surface. In: Vol 9294. Springer; 2015:386-398. doi:<a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">10.1007/978-3-662-48350-3_33</a>","apa":"Cohen Addad, V., &#38; de Mesmay, A. N. (2015). A fixed parameter tractable approximation scheme for the optimal cut graph of a surface (Vol. 9294, pp. 386–398). Presented at the ESA: European Symposium on Algorithms, Patras, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48350-3_33\">https://doi.org/10.1007/978-3-662-48350-3_33</a>"},"department":[{"_id":"UlWa"}],"date_updated":"2021-01-12T06:52:31Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"Given a graph G cellularly embedded on a surface Σ of genus g, a cut graph is a subgraph of G such that cutting Σ along G yields a topological disk. We provide a fixed parameter tractable approximation scheme for the problem of computing the shortest cut graph, that is, for any ε &gt; 0, we show how to compute a (1 + ε) approximation of the shortest cut graph in time f(ε, g)n3.\r\nOur techniques first rely on the computation of a spanner for the problem using the technique of brick decompositions, to reduce the problem to the case of bounded tree-width. Then, to solve the bounded tree-width case, we introduce a variant of the surface-cut decomposition of Rué, Sau and Thilikos, which may be of independent interest.","lang":"eng"}],"title":"A fixed parameter tractable approximation scheme for the optimal cut graph of a surface","date_published":"2015-09-01T00:00:00Z","publisher":"Springer","oa":1,"page":"386 - 398","day":"01","doi":"10.1007/978-3-662-48350-3_33","year":"2015","scopus_import":1,"publist_id":"5462","intvolume":"      9294"},{"_id":"1686","type":"journal_article","date_created":"2018-12-11T11:53:28Z","day":"04","doi":"10.1126/science.aad0867","page":"1055 - 1056","year":"2015","status":"public","scopus_import":1,"publication":"Science","publist_id":"5459","intvolume":"       349","citation":{"ieee":"E. Kiermaier and M. K. Sixt, “Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection,” <i>Science</i>, vol. 349, no. 6252. American Association for the Advancement of Science, pp. 1055–1056, 2015.","chicago":"Kiermaier, Eva, and Michael K Sixt. “Fragmented Communication between Immune Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow to Sites of Infection.” <i>Science</i>. American Association for the Advancement of Science, 2015. <a href=\"https://doi.org/10.1126/science.aad0867\">https://doi.org/10.1126/science.aad0867</a>.","ama":"Kiermaier E, Sixt MK. Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. <i>Science</i>. 2015;349(6252):1055-1056. doi:<a href=\"https://doi.org/10.1126/science.aad0867\">10.1126/science.aad0867</a>","ista":"Kiermaier E, Sixt MK. 2015. Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. Science. 349(6252), 1055–1056.","apa":"Kiermaier, E., &#38; Sixt, M. K. (2015). Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.aad0867\">https://doi.org/10.1126/science.aad0867</a>","short":"E. Kiermaier, M.K. Sixt, Science 349 (2015) 1055–1056.","mla":"Kiermaier, Eva, and Michael K. Sixt. “Fragmented Communication between Immune Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow to Sites of Infection.” <i>Science</i>, vol. 349, no. 6252, American Association for the Advancement of Science, 2015, pp. 1055–56, doi:<a href=\"https://doi.org/10.1126/science.aad0867\">10.1126/science.aad0867</a>."},"oa_version":"None","quality_controlled":"1","department":[{"_id":"MiSi"}],"date_updated":"2021-01-12T06:52:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-6165-5738","last_name":"Kiermaier","first_name":"Eva","full_name":"Kiermaier, Eva","id":"3EB04B78-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt"}],"issue":"6252","publication_status":"published","month":"09","volume":349,"title":"Fragmented communication between immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow to sites of infection","language":[{"iso":"eng"}],"publisher":"American Association for the Advancement of Science","date_published":"2015-09-04T00:00:00Z"},{"type":"journal_article","_id":"1687","date_created":"2018-12-11T11:53:28Z","status":"public","pubrep_id":"445","ec_funded":1,"oa_version":"Published Version","quality_controlled":"1","project":[{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","_id":"25A603A2-B435-11E9-9278-68D0E5697425","grant_number":"281556","call_identifier":"FP7"}],"author":[{"full_name":"Sarris, Milka","last_name":"Sarris","first_name":"Milka"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","last_name":"Sixt","first_name":"Michael K"}],"issue":"10","file":[{"access_level":"open_access","file_size":797964,"file_id":"4875","checksum":"c29973924b790aab02fdd91857759cfb","creator":"system","relation":"main_file","file_name":"IST-2016-445-v1+1_1-s2.0-S0955067415001064-main.pdf","date_created":"2018-12-12T10:11:21Z","date_updated":"2020-07-14T12:45:12Z","content_type":"application/pdf"}],"has_accepted_license":"1","month":"10","volume":36,"language":[{"iso":"eng"}],"oa":1,"doi":"10.1016/j.ceb.2015.08.001","year":"2015","page":"93 - 102","day":"01","scopus_import":1,"publication":"Current Opinion in Cell Biology","intvolume":"        36","publist_id":"5458","citation":{"apa":"Sarris, M., &#38; Sixt, M. K. (2015). Navigating in tissue mazes: Chemoattractant interpretation in complex environments. <i>Current Opinion in Cell Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">https://doi.org/10.1016/j.ceb.2015.08.001</a>","ista":"Sarris M, Sixt MK. 2015. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. Current Opinion in Cell Biology. 36(10), 93–102.","chicago":"Sarris, Milka, and Michael K Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” <i>Current Opinion in Cell Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">https://doi.org/10.1016/j.ceb.2015.08.001</a>.","ama":"Sarris M, Sixt MK. Navigating in tissue mazes: Chemoattractant interpretation in complex environments. <i>Current Opinion in Cell Biology</i>. 2015;36(10):93-102. doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">10.1016/j.ceb.2015.08.001</a>","ieee":"M. Sarris and M. K. Sixt, “Navigating in tissue mazes: Chemoattractant interpretation in complex environments,” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10. Elsevier, pp. 93–102, 2015.","short":"M. Sarris, M.K. Sixt, Current Opinion in Cell Biology 36 (2015) 93–102.","mla":"Sarris, Milka, and Michael K. Sixt. “Navigating in Tissue Mazes: Chemoattractant Interpretation in Complex Environments.” <i>Current Opinion in Cell Biology</i>, vol. 36, no. 10, Elsevier, 2015, pp. 93–102, doi:<a href=\"https://doi.org/10.1016/j.ceb.2015.08.001\">10.1016/j.ceb.2015.08.001</a>."},"date_updated":"2021-01-12T06:52:31Z","department":[{"_id":"MiSi"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"abstract":[{"lang":"eng","text":"Guided cell movement is essential for development and integrity of animals and crucially involved in cellular immune responses. Leukocytes are professional migratory cells that can navigate through most types of tissues and sense a wide range of directional cues. The responses of these cells to attractants have been mainly explored in tissue culture settings. How leukocytes make directional decisions in situ, within the challenging environment of a tissue maze, is less understood. Here we review recent advances in how leukocytes sense chemical cues in complex tissue settings and make links with paradigms of directed migration in development and Dictyostelium discoideum amoebae."}],"publication_status":"published","title":"Navigating in tissue mazes: Chemoattractant interpretation in complex environments","publisher":"Elsevier","file_date_updated":"2020-07-14T12:45:12Z","date_published":"2015-10-01T00:00:00Z"},{"author":[{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"},{"last_name":"Kynčl","first_name":"Jan","full_name":"Kynčl, Jan"},{"full_name":"Paták, Pavel","last_name":"Paták","first_name":"Pavel"},{"orcid":"0000-0002-3975-1683","last_name":"Patakova","first_name":"Zuzana","full_name":"Patakova, Zuzana"},{"full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","first_name":"Martin","last_name":"Tancer"}],"oa_version":"Preprint","quality_controlled":"1","volume":54,"language":[{"iso":"eng"}],"issue":"3","month":"10","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1403.8147"}],"status":"public","_id":"1688","type":"journal_article","date_created":"2018-12-11T11:53:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Karasev, Roman, et al. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 3, Springer, 2015, pp. 610–36, doi:<a href=\"https://doi.org/10.1007/s00454-015-9720-z\">10.1007/s00454-015-9720-z</a>.","short":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, M. Tancer, Discrete &#38; Computational Geometry 54 (2015) 610–636.","ieee":"R. Karasev, J. Kynčl, P. Paták, Z. Patakova, and M. Tancer, “Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex,” <i>Discrete &#38; Computational Geometry</i>, vol. 54, no. 3. Springer, pp. 610–636, 2015.","ama":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. <i>Discrete &#38; Computational Geometry</i>. 2015;54(3):610-636. doi:<a href=\"https://doi.org/10.1007/s00454-015-9720-z\">10.1007/s00454-015-9720-z</a>","ista":"Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. 2015. Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete &#38; Computational Geometry. 54(3), 610–636.","chicago":"Karasev, Roman, Jan Kynčl, Pavel Paták, Zuzana Patakova, and Martin Tancer. “Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00454-015-9720-z\">https://doi.org/10.1007/s00454-015-9720-z</a>.","apa":"Karasev, R., Kynčl, J., Paták, P., Patakova, Z., &#38; Tancer, M. (2015). Bounds for Pach’s selection theorem and for the minimum solid angle in a simplex. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9720-z\">https://doi.org/10.1007/s00454-015-9720-z</a>"},"date_updated":"2021-01-12T06:52:32Z","department":[{"_id":"UlWa"}],"title":"Bounds for Pach's selection theorem and for the minimum solid angle in a simplex","publisher":"Springer","date_published":"2015-10-01T00:00:00Z","abstract":[{"text":"We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant (Formula presented.) such that whenever (Formula presented.) are n-element subsets of (Formula presented.), we can find a point (Formula presented.) and subsets (Formula presented.) for every i∈[d+1], each of size at least cdn, such that p belongs to all rainbowd-simplices determined by (Formula presented.) simplices with one vertex in each Yi. We show a super-exponentially decreasing upper bound (Formula presented.). The ideas used in the proof of the upper bound also help us to prove Pach’s theorem with (Formula presented.), which is a lower bound doubly exponentially decreasing in d (up to some polynomial in the exponent). For comparison, Pach’s original approach yields a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and Suk recently obtained a hypergraph density result implying a proof of Pach’s theorem with (Formula presented.). In our construction for the upper bound, we use the fact that the minimum solid angle of every d-simplex is super-exponentially small. This fact was previously unknown and might be of independent interest. For the lower bound, we improve the ‘separation’ part of the argument by showing that in one of the key steps only d+1 separations are necessary, compared to 2d separations in the original proof. We also provide a measure version of Pach’s theorem.","lang":"eng"}],"publication_status":"published","page":"610 - 636","doi":"10.1007/s00454-015-9720-z","year":"2015","day":"01","acknowledgement":"R. K. was supported by the Russian Foundation for Basic Research Grant 15-31-20403 (mol_a_ved) and grant 15-01-99563. J. K., Z. P., and M. T. were partially supported by ERC Advanced Research Grant No. 267165 (DISCONV) and by the project CE-ITI (GAČR P202/12/G061) of the Czech Science Foundation. J. K. was also partially supported by Swiss National Science Foundation Grants 200021-137574 and 200020-14453. P. P., Z. P., and M. T. were partially supported by the Charles University Grant GAUK 421511. P. P. was also partially supported by the Charles University Grant SVV-2014-260107. Z. P. was also partially supported by the Charles University Grant SVV-2014-260103.","oa":1,"publication":"Discrete & Computational Geometry","intvolume":"        54","publist_id":"5457","scopus_import":1},{"date_created":"2018-12-11T11:53:29Z","oa":1,"_id":"1689","type":"conference","status":"public","year":"2015","day":"14","doi":"10.1145/2728606.2728608","page":"259 - 268","main_file_link":[{"url":"http://arxiv.org/abs/1410.5387","open_access":"1"}],"related_material":{"record":[{"relation":"later_version","id":"1407","status":"public"}]},"scopus_import":1,"ec_funded":1,"conference":{"name":"HSCC: Hybrid Systems - Computation and Control","location":"Seattle, WA, United States","end_date":"2015-04-16","start_date":"2015-04-14"},"publist_id":"5456","publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","date_updated":"2023-09-20T09:43:09Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"}],"oa_version":"Preprint","citation":{"mla":"Svoreňová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, ACM, 2015, pp. 259–68, doi:<a href=\"https://doi.org/10.1145/2728606.2728608\">10.1145/2728606.2728608</a>.","short":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.","ieee":"M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, Seattle, WA, United States, 2015, pp. 259–268.","apa":"Svoreňová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cěrná, I., &#38; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i> (pp. 259–268). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2728606.2728608\">https://doi.org/10.1145/2728606.2728608</a>","chicago":"Svoreňová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.” In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, 259–68. ACM, 2015. <a href=\"https://doi.org/10.1145/2728606.2728608\">https://doi.org/10.1145/2728606.2728608</a>.","ista":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 259–268.","ama":"Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In: <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>. ACM; 2015:259-268. doi:<a href=\"https://doi.org/10.1145/2728606.2728608\">10.1145/2728606.2728608</a>"},"author":[{"full_name":"Svoreňová, Mária","first_name":"Mária","last_name":"Svoreňová"},{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik","first_name":"Martin"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cěrná, Ivana","last_name":"Cěrná","first_name":"Ivana"},{"last_name":"Belta","first_name":"Cǎlin","full_name":"Belta, Cǎlin"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study.","lang":"eng"}],"publication_status":"published","month":"04","publisher":"ACM","language":[{"iso":"eng"}],"date_published":"2015-04-14T00:00:00Z","title":"Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games"},{"day":"14","status":"public","year":"2015","doi":"10.1145/2728606.2728630","page":"128 - 133","acknowledgement":"The material presented in this paper is based upon work sup-ported by the Air Force Research Laboratory’s Information Directorate (AFRL/RI) through the Visiting Faculty Research Program (VFRP) under contract number FA8750-13-2-0115 and the Air Force Office of Scientific Research (AFOSR). Any opinions,findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the AFRL/RI or AFOSR. This work was also partly supported in part by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR14 AVACS, http://www.avacs.org/), by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).","type":"conference","_id":"1690","date_created":"2018-12-11T11:53:29Z","ec_funded":1,"conference":{"start_date":"2015-04-14","end_date":"2015-04-16","name":"HSCC: Hybrid Systems - Computation and Control","location":"Seattle, WA, United States"},"publist_id":"5454","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy"},{"last_name":"Johnson","first_name":"Taylor","full_name":"Johnson, Taylor"}],"citation":{"mla":"Bak, Stanley, et al. <i>HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models</i>. Springer, 2015, pp. 128–33, doi:<a href=\"https://doi.org/10.1145/2728606.2728630\">10.1145/2728606.2728630</a>.","short":"S. Bak, S. Bogomolov, T. Johnson, in:, Springer, 2015, pp. 128–133.","ieee":"S. Bak, S. Bogomolov, and T. Johnson, “HYST: A source transformation and translation tool for hybrid automaton models,” presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States, 2015, pp. 128–133.","chicago":"Bak, Stanley, Sergiy Bogomolov, and Taylor Johnson. “HYST: A Source Transformation and Translation Tool for Hybrid Automaton Models,” 128–33. Springer, 2015. <a href=\"https://doi.org/10.1145/2728606.2728630\">https://doi.org/10.1145/2728606.2728630</a>.","ista":"Bak S, Bogomolov S, Johnson T. 2015. HYST: A source transformation and translation tool for hybrid automaton models. HSCC: Hybrid Systems - Computation and Control, 128–133.","ama":"Bak S, Bogomolov S, Johnson T. HYST: A source transformation and translation tool for hybrid automaton models. In: Springer; 2015:128-133. doi:<a href=\"https://doi.org/10.1145/2728606.2728630\">10.1145/2728606.2728630</a>","apa":"Bak, S., Bogomolov, S., &#38; Johnson, T. (2015). HYST: A source transformation and translation tool for hybrid automaton models (pp. 128–133). Presented at the HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States: Springer. <a href=\"https://doi.org/10.1145/2728606.2728630\">https://doi.org/10.1145/2728606.2728630</a>"},"oa_version":"None","date_updated":"2021-01-12T06:52:33Z","department":[{"_id":"ToHe"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"title":"HYST: A source transformation and translation tool for hybrid automaton models","publisher":"Springer","date_published":"2015-04-14T00:00:00Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"A number of powerful and scalable hybrid systems model checkers have recently emerged. Although all of them honor roughly the same hybrid systems semantics, they have drastically different model description languages. This situation (a) makes it difficult to quickly evaluate a specific hybrid automaton model using the different tools, (b) obstructs comparisons of reachability approaches, and (c) impedes the widespread application of research results that perform model modification and could benefit many of the tools. In this paper, we present Hyst, a Hybrid Source Transformer. Hyst is a source-to-source translation tool, currently taking input in the SpaceEx model format, and translating to the formats of HyCreate, Flow∗, or dReach. Internally, the tool supports generic model-to-model transformation passes that serve to both ease the translation and potentially improve reachability results for the supported tools. Although these model transformation passes could be implemented within each tool, the Hyst approach provides a single place for model modification, generating modified input sources for the unmodified target tools. Our evaluation demonstrates Hyst is capable of automatically translating benchmarks in several classes (including affine and nonlinear hybrid automata) to the input formats of several tools. Additionally, we illustrate a general model transformation pass based on pseudo-invariants implemented in Hyst that illustrates the reachability improvement."}],"month":"04","publication_status":"published"},{"publisher":"ACM","language":[{"iso":"eng"}],"date_published":"2015-04-14T00:00:00Z","title":"Temporal logic motion planning using POMDPs with parity objectives: Case study paper","month":"04","publication_status":"published","abstract":[{"lang":"eng","text":"We consider a case study of the problem of deploying an autonomous air vehicle in a partially observable, dynamic, indoor environment from a specification given as a linear temporal logic (LTL) formula over regions of interest. We model the motion and sensing capabilities of the vehicle as a partially observable Markov decision process (POMDP). We adapt recent results for solving POMDPs with parity objectives to generate a control policy. We also extend the existing framework with a policy minimization technique to obtain a better implementable policy, while preserving its correctness. The proposed techniques are illustrated in an experimental setup involving an autonomous quadrotor performing surveillance in a dynamic environment."}],"author":[{"full_name":"Svoreňová, Mária","last_name":"Svoreňová","first_name":"Mária"},{"full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik"},{"first_name":"Kevin","last_name":"Leahy","full_name":"Leahy, Kevin"},{"last_name":"Eniser","first_name":"Hasan","full_name":"Eniser, Hasan"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Cěrná","first_name":"Ivana","full_name":"Cěrná, Ivana"},{"full_name":"Belta, Cǎlin","first_name":"Cǎlin","last_name":"Belta"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T06:52:33Z","citation":{"ieee":"M. Svoreňová <i>et al.</i>, “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, Seattle, WA, United States, 2015, pp. 233–238.","ama":"Svoreňová M, Chmelik M, Leahy K, et al. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In: <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>. ACM; 2015:233-238. doi:<a href=\"https://doi.org/10.1145/2728606.2728617\">10.1145/2728606.2728617</a>","ista":"Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 233–238.","chicago":"Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, 233–38. ACM, 2015. <a href=\"https://doi.org/10.1145/2728606.2728617\">https://doi.org/10.1145/2728606.2728617</a>.","apa":"Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná, I., &#38; Belta, C. (2015). Temporal logic motion planning using POMDPs with parity objectives: Case study paper. In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i> (pp. 233–238). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2728606.2728617\">https://doi.org/10.1145/2728606.2728617</a>","mla":"Svoreňová, Mária, et al. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.” <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, ACM, 2015, pp. 233–38, doi:<a href=\"https://doi.org/10.1145/2728606.2728617\">10.1145/2728606.2728617</a>.","short":"M. Svoreňová, M. Chmelik, K. Leahy, H. Eniser, K. Chatterjee, I. Cěrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–238."},"oa_version":"None","conference":{"location":"Seattle, WA, United States","name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2015-04-14","end_date":"2015-04-16"},"publist_id":"5453","ec_funded":1,"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","scopus_import":1,"page":"233 - 238","day":"14","year":"2015","status":"public","doi":"10.1145/2728606.2728617","date_created":"2018-12-11T11:53:29Z","_id":"1691","type":"conference"},{"author":[{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy","first_name":"Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365"},{"first_name":"Marius","last_name":"Greitschus","full_name":"Greitschus, Marius"},{"last_name":"Strump","first_name":"Thomas","full_name":"Strump, Thomas"},{"full_name":"Podelski, Andreas","first_name":"Andreas","last_name":"Podelski"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"department":[{"_id":"ToHe"}],"quality_controlled":"1","date_updated":"2021-01-12T06:52:33Z","oa_version":"None","citation":{"short":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, A. Podelski, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 149–158.","mla":"Frehse, Goran, et al. “Eliminating Spurious Transitions in Reachability with Support Functions.” <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, ACM, 2015, pp. 149–58, doi:<a href=\"https://doi.org/10.1145/2728606.2728622\">10.1145/2728606.2728622</a>.","apa":"Frehse, G., Bogomolov, S., Greitschus, M., Strump, T., &#38; Podelski, A. (2015). Eliminating spurious transitions in reachability with support functions. In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i> (pp. 149–158). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2728606.2728622\">https://doi.org/10.1145/2728606.2728622</a>","ama":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. Eliminating spurious transitions in reachability with support functions. In: <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>. ACM; 2015:149-158. doi:<a href=\"https://doi.org/10.1145/2728606.2728622\">10.1145/2728606.2728622</a>","chicago":"Frehse, Goran, Sergiy Bogomolov, Marius Greitschus, Thomas Strump, and Andreas Podelski. “Eliminating Spurious Transitions in Reachability with Support Functions.” In <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, 149–58. ACM, 2015. <a href=\"https://doi.org/10.1145/2728606.2728622\">https://doi.org/10.1145/2728606.2728622</a>.","ista":"Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. 2015. Eliminating spurious transitions in reachability with support functions. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, 149–158.","ieee":"G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, and A. Podelski, “Eliminating spurious transitions in reachability with support functions,” in <i>Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control</i>, Seattle, WA, United States, 2015, pp. 149–158."},"language":[{"iso":"eng"}],"date_published":"2015-04-14T00:00:00Z","publisher":"ACM","title":"Eliminating spurious transitions in reachability with support functions","month":"04","publication_status":"published","abstract":[{"text":"Computing an approximation of the reachable states of a hybrid system is a challenge, mainly because overapproximating the solutions of ODEs with a finite number of sets does not scale well. Using template polyhedra can greatly reduce the computational complexity, since it replaces complex operations on sets with a small number of optimization problems. However, the use of templates may make the over-approximation too conservative. Spurious transitions, which are falsely considered reachable, are particularly detrimental to performance and accuracy, and may exacerbate the state explosion problem. In this paper, we examine how spurious transitions can be avoided with minimal computational effort. To this end, detecting spurious transitions is reduced to the well-known problem of showing that two convex sets are disjoint by finding a hyperplane that separates them. We generalize this to owpipes by considering hyperplanes that evolve with time in correspondence to the dynamics of the system. The approach is implemented in the model checker SpaceEx and demonstrated on examples.","lang":"eng"}],"status":"public","year":"2015","doi":"10.1145/2728606.2728622","day":"14","page":"149 - 158","publication_identifier":{"isbn":["978-1-4503-3433-4"]},"date_created":"2018-12-11T11:53:30Z","_id":"1692","type":"conference","conference":{"end_date":"2015-04-16","start_date":"2015-04-14","location":"Seattle, WA, United States","name":"HSCC: Hybrid Systems - Computation and Control"},"publist_id":"5452","ec_funded":1,"publication":"Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control","scopus_import":1},{"ec_funded":1,"status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1506.02734","open_access":"1"}],"date_created":"2018-12-11T11:53:30Z","_id":"1693","type":"journal_article","language":[{"iso":"eng"}],"volume":92,"month":"08","issue":"2","article_number":"022514","author":[{"last_name":"Amaro","first_name":"Pedro","full_name":"Amaro, Pedro"},{"full_name":"Franke, Beatrice","first_name":"Beatrice","last_name":"Franke"},{"last_name":"Krauth","first_name":"Julian","full_name":"Krauth, Julian"},{"last_name":"Diepold","first_name":"Marc","full_name":"Diepold, Marc"},{"full_name":"Fratini, Filippo","last_name":"Fratini","first_name":"Filippo"},{"last_name":"Safari","first_name":"Laleh","full_name":"Safari, Laleh","id":"3C325E5E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Machado","first_name":"Jorge","full_name":"Machado, Jorge"},{"last_name":"Antognini","first_name":"Aldo","full_name":"Antognini, Aldo"},{"full_name":"Kottmann, Franz","last_name":"Kottmann","first_name":"Franz"},{"first_name":"Paul","last_name":"Indelicato","full_name":"Indelicato, Paul"},{"full_name":"Pohl, Randolf","first_name":"Randolf","last_name":"Pohl"},{"last_name":"Santos","first_name":"José","full_name":"Santos, José"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"oa_version":"Preprint","intvolume":"        92","publist_id":"5451","publication":"Physical Review A","scopus_import":1,"year":"2015","day":"28","doi":"10.1103/PhysRevA.92.022514","oa":1,"publisher":"American Physical Society","date_published":"2015-08-28T00:00:00Z","title":"Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3","abstract":[{"lang":"eng","text":"Quantum interference between energetically close states is theoretically investigated, with the state structure being observed via laser spectroscopy. In this work, we focus on hyperfine states of selected hydrogenic muonic isotopes, and on how quantum interference affects the measured Lamb shift. The process of photon excitation and subsequent photon decay is implemented within the framework of nonrelativistic second-order perturbation theory. Due to its experimental interest, calculations are performed for muonic hydrogen, deuterium, and helium-3. We restrict our analysis to the case of photon scattering by incident linear polarized photons and the polarization of the scattered photons not being observed. We conclude that while quantum interference effects can be safely neglected in muonic hydrogen and helium-3, in the case of muonic deuterium there are resonances with close proximity, where quantum interference effects can induce shifts up to a few percent of the linewidth, assuming a pointlike detector. However, by taking into account the geometry of the setup used by the CREMA collaboration, this effect is reduced to less than 0.2% of the linewidth in all possible cases, which makes it irrelevant at the present level of accuracy. © 2015 American Physical Society."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:52:34Z","department":[{"_id":"MiLe"}],"citation":{"short":"P. Amaro, B. Franke, J. Krauth, M. Diepold, F. Fratini, L. Safari, J. Machado, A. Antognini, F. Kottmann, P. Indelicato, R. Pohl, J. Santos, Physical Review A 92 (2015).","mla":"Amaro, Pedro, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” <i>Physical Review A</i>, vol. 92, no. 2, 022514, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">10.1103/PhysRevA.92.022514</a>.","ieee":"P. Amaro <i>et al.</i>, “Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3,” <i>Physical Review A</i>, vol. 92, no. 2. American Physical Society, 2015.","apa":"Amaro, P., Franke, B., Krauth, J., Diepold, M., Fratini, F., Safari, L., … Santos, J. (2015). Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">https://doi.org/10.1103/PhysRevA.92.022514</a>","ama":"Amaro P, Franke B, Krauth J, et al. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. <i>Physical Review A</i>. 2015;92(2). doi:<a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">10.1103/PhysRevA.92.022514</a>","ista":"Amaro P, Franke B, Krauth J, Diepold M, Fratini F, Safari L, Machado J, Antognini A, Kottmann F, Indelicato P, Pohl R, Santos J. 2015. Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review A. 92(2), 022514.","chicago":"Amaro, Pedro, Beatrice Franke, Julian Krauth, Marc Diepold, Filippo Fratini, Laleh Safari, Jorge Machado, et al. “Quantum Interference Effects in Laser Spectroscopy of Muonic Hydrogen, Deuterium, and Helium-3.” <i>Physical Review A</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevA.92.022514\">https://doi.org/10.1103/PhysRevA.92.022514</a>."}},{"publisher":"IEEE","language":[{"iso":"eng"}],"date_published":"2015-02-24T00:00:00Z","title":"Quantitative temporal simulation and refinement distances for timed systems","volume":60,"month":"02","publication_status":"published","abstract":[{"lang":"eng","text":"\r\nWe introduce quantitative timed refinement and timed simulation (directed) metrics, incorporating zenoness checks, for timed systems. These metrics assign positive real numbers which quantify the timing mismatches between two timed systems, amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximal timing mismatch that can arise, (2) the “steady-state” maximal timing mismatches, where initial transient timing mismatches are ignored; and (3) the (long-run) average timing mismatches amongst two systems. These three kinds of mismatches constitute three important types of timing differences. Our event times are the global times, measured from the start of the system execution, not just the time durations of individual steps. We present algorithms over timed automata for computing the three quantitative simulation distances to within any desired degree of accuracy. In order to compute the values of the quantitative simulation distances, we use a game theoretic formulation. We introduce two new kinds of objectives for two player games on finite-state game graphs: (1) eventual debit-sum level objectives, and (2) average debit-sum level objectives. We present algorithms for computing the optimal values for these objectives in graph games, and then use these algorithms to compute the values of the timed simulation distances over timed automata.\r\n"}],"issue":"9","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Prabhu, Vinayak","first_name":"Vinayak","last_name":"Prabhu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","date_updated":"2021-01-12T06:52:34Z","citation":{"ieee":"K. Chatterjee and V. Prabhu, “Quantitative temporal simulation and refinement distances for timed systems,” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 9. IEEE, pp. 2291–2306, 2015.","apa":"Chatterjee, K., &#38; Prabhu, V. (2015). Quantitative temporal simulation and refinement distances for timed systems. <i>IEEE Transactions on Automatic Control</i>. IEEE. <a href=\"https://doi.org/10.1109/TAC.2015.2404612\">https://doi.org/10.1109/TAC.2015.2404612</a>","chicago":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” <i>IEEE Transactions on Automatic Control</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/TAC.2015.2404612\">https://doi.org/10.1109/TAC.2015.2404612</a>.","ista":"Chatterjee K, Prabhu V. 2015. Quantitative temporal simulation and refinement distances for timed systems. IEEE Transactions on Automatic Control. 60(9), 2291–2306.","ama":"Chatterjee K, Prabhu V. Quantitative temporal simulation and refinement distances for timed systems. <i>IEEE Transactions on Automatic Control</i>. 2015;60(9):2291-2306. doi:<a href=\"https://doi.org/10.1109/TAC.2015.2404612\">10.1109/TAC.2015.2404612</a>","short":"K. Chatterjee, V. Prabhu, IEEE Transactions on Automatic Control 60 (2015) 2291–2306.","mla":"Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.” <i>IEEE Transactions on Automatic Control</i>, vol. 60, no. 9, IEEE, 2015, pp. 2291–306, doi:<a href=\"https://doi.org/10.1109/TAC.2015.2404612\">10.1109/TAC.2015.2404612</a>."},"oa_version":"None","publist_id":"5450","intvolume":"        60","ec_funded":1,"publication":"IEEE Transactions on Automatic Control","scopus_import":1,"status":"public","doi":"10.1109/TAC.2015.2404612","page":"2291 - 2306","year":"2015","day":"24","date_created":"2018-12-11T11:53:30Z","_id":"1694","type":"journal_article"},{"date_created":"2018-12-11T11:53:31Z","type":"journal_article","_id":"1695","status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1503.03738"}],"ec_funded":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"Preprint","author":[{"first_name":"Jan","last_name":"Kaczmarczyk","orcid":"0000-0002-1629-3675","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","full_name":"Kaczmarczyk, Jan"},{"first_name":"Tobias","last_name":"Schickling","full_name":"Schickling, Tobias"},{"first_name":"Jörg","last_name":"Bünemann","full_name":"Bünemann, Jörg"}],"month":"09","issue":"9","language":[{"iso":"eng"}],"volume":252,"oa":1,"day":"01","year":"2015","doi":"10.1002/pssb.201552082","page":"2059 - 2071","scopus_import":1,"intvolume":"       252","publist_id":"5449","publication":"Physica Status Solidi (B): Basic Solid State Physics","date_updated":"2021-01-12T06:52:34Z","department":[{"_id":"MiLe"}],"citation":{"short":"J. Kaczmarczyk, T. Schickling, J. Bünemann, Physica Status Solidi (B): Basic Solid State Physics 252 (2015) 2059–2071.","mla":"Kaczmarczyk, Jan, et al. “Evaluation Techniques for Gutzwiller Wave Functions in Finite Dimensions.” <i>Physica Status Solidi (B): Basic Solid State Physics</i>, vol. 252, no. 9, Wiley, 2015, pp. 2059–71, doi:<a href=\"https://doi.org/10.1002/pssb.201552082\">10.1002/pssb.201552082</a>.","ista":"Kaczmarczyk J, Schickling T, Bünemann J. 2015. Evaluation techniques for Gutzwiller wave functions in finite dimensions. Physica Status Solidi (B): Basic Solid State Physics. 252(9), 2059–2071.","ama":"Kaczmarczyk J, Schickling T, Bünemann J. Evaluation techniques for Gutzwiller wave functions in finite dimensions. <i>Physica Status Solidi (B): Basic Solid State Physics</i>. 2015;252(9):2059-2071. doi:<a href=\"https://doi.org/10.1002/pssb.201552082\">10.1002/pssb.201552082</a>","chicago":"Kaczmarczyk, Jan, Tobias Schickling, and Jörg Bünemann. “Evaluation Techniques for Gutzwiller Wave Functions in Finite Dimensions.” <i>Physica Status Solidi (B): Basic Solid State Physics</i>. Wiley, 2015. <a href=\"https://doi.org/10.1002/pssb.201552082\">https://doi.org/10.1002/pssb.201552082</a>.","apa":"Kaczmarczyk, J., Schickling, T., &#38; Bünemann, J. (2015). Evaluation techniques for Gutzwiller wave functions in finite dimensions. <i>Physica Status Solidi (B): Basic Solid State Physics</i>. Wiley. <a href=\"https://doi.org/10.1002/pssb.201552082\">https://doi.org/10.1002/pssb.201552082</a>","ieee":"J. Kaczmarczyk, T. Schickling, and J. Bünemann, “Evaluation techniques for Gutzwiller wave functions in finite dimensions,” <i>Physica Status Solidi (B): Basic Solid State Physics</i>, vol. 252, no. 9. Wiley, pp. 2059–2071, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We give a comprehensive introduction into a diagrammatic method that allows for the evaluation of Gutzwiller wave functions in finite spatial dimensions. We discuss in detail some numerical schemes that turned out to be useful in the real-space evaluation of the diagrams. The method is applied to the problem of d-wave superconductivity in a two-dimensional single-band Hubbard model. Here, we discuss in particular the role of long-range contributions in our diagrammatic expansion. We further reconsider our previous analysis on the kinetic energy gain in the superconducting state.","lang":"eng"}],"publication_status":"published","publisher":"Wiley","date_published":"2015-09-01T00:00:00Z","title":"Evaluation techniques for Gutzwiller wave functions in finite dimensions"},{"ec_funded":1,"_id":"1696","type":"journal_article","date_created":"2018-12-11T11:53:31Z","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1505.07003","open_access":"1"}],"issue":"12","article_number":"125135","month":"09","volume":92,"language":[{"iso":"eng"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"author":[{"first_name":"Marcin","last_name":"Wysokiński","full_name":"Wysokiński, Marcin"},{"first_name":"Jan","last_name":"Kaczmarczyk","orcid":"0000-0002-1629-3675","id":"46C405DE-F248-11E8-B48F-1D18A9856A87","full_name":"Kaczmarczyk, Jan"},{"last_name":"Spałek","first_name":"Jozef","full_name":"Spałek, Jozef"}],"scopus_import":1,"publication":"Physical Review B","intvolume":"        92","publist_id":"5448","oa":1,"day":"18","year":"2015","doi":"10.1103/PhysRevB.92.125135","acknowledgement":"The work was partly supported by the National Science Centre (NCN) under MAESTRO, Grant No. DEC-2012/04/A/ST3/00342. M.W. acknowledges the hospitality of the Institute of Science and Technology Austria during the final stage of development of the present work, as well as partial financial support from the Society-Environment-Technology project of the Jagiellonian University for that stay. J.K. acknowledges support from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA Grant Agreement No. [291734 ].","abstract":[{"text":"The recently proposed diagrammatic expansion (DE) technique for the full Gutzwiller wave function (GWF) is applied to the Anderson lattice model. This approach allows for a systematic evaluation of the expectation values with full Gutzwiller wave function in finite-dimensional systems. It introduces results extending in an essential manner those obtained by means of the standard Gutzwiller approximation (GA), which is variationally exact only in infinite dimensions. Within the DE-GWF approach we discuss the principal paramagnetic properties and their relevance to heavy-fermion systems. We demonstrate the formation of an effective, narrow f band originating from atomic f-electron states and subsequently interpret this behavior as a direct itineracy of f electrons; it represents a combined effect of both the hybridization and the correlations induced by the Coulomb repulsive interaction. Such a feature is absent on the level of GA, which is equivalent to the zeroth order of our expansion. Formation of the hybridization- and electron-concentration-dependent narrow f band rationalizes the common assumption of such dispersion of f levels in the phenomenological modeling of the band structure of CeCoIn5. Moreover, it is shown that the emerging f-electron direct itineracy leads in a natural manner to three physically distinct regimes within a single model that are frequently discussed for 4f- or 5f-electron compounds as separate model situations. We identify these regimes as (i) the mixed-valence regime, (ii) Kondo/almost-Kondo insulating regime, and (iii) the Kondo-lattice limit when the f-electron occupancy is very close to the f-state half filling, ⟨nˆf⟩→1. The nonstandard features of the emerging correlated quantum liquid state are stressed.","lang":"eng"}],"publication_status":"published","title":"Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states","date_published":"2015-09-18T00:00:00Z","publisher":"American Physical Society","citation":{"mla":"Wysokiński, Marcin, et al. “Gutzwiller Wave Function Solution for Anderson Lattice Model: Emerging Universal Regimes of Heavy Quasiparticle States.” <i>Physical Review B</i>, vol. 92, no. 12, 125135, American Physical Society, 2015, doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">10.1103/PhysRevB.92.125135</a>.","short":"M. Wysokiński, J. Kaczmarczyk, J. Spałek, Physical Review B 92 (2015).","ieee":"M. Wysokiński, J. Kaczmarczyk, and J. Spałek, “Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states,” <i>Physical Review B</i>, vol. 92, no. 12. American Physical Society, 2015.","apa":"Wysokiński, M., Kaczmarczyk, J., &#38; Spałek, J. (2015). Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">https://doi.org/10.1103/PhysRevB.92.125135</a>","ista":"Wysokiński M, Kaczmarczyk J, Spałek J. 2015. Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. Physical Review B. 92(12), 125135.","chicago":"Wysokiński, Marcin, Jan Kaczmarczyk, and Jozef Spałek. “Gutzwiller Wave Function Solution for Anderson Lattice Model: Emerging Universal Regimes of Heavy Quasiparticle States.” <i>Physical Review B</i>. American Physical Society, 2015. <a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">https://doi.org/10.1103/PhysRevB.92.125135</a>.","ama":"Wysokiński M, Kaczmarczyk J, Spałek J. Gutzwiller wave function solution for Anderson lattice model: Emerging universal regimes of heavy quasiparticle states. <i>Physical Review B</i>. 2015;92(12). doi:<a href=\"https://doi.org/10.1103/PhysRevB.92.125135\">10.1103/PhysRevB.92.125135</a>"},"date_updated":"2021-01-12T06:52:35Z","department":[{"_id":"MiLe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"language":[{"iso":"eng"}],"volume":11,"has_accepted_license":"1","month":"07","article_number":"e1004304","file":[{"date_created":"2018-12-12T10:16:25Z","date_updated":"2020-07-14T12:45:12Z","content_type":"application/pdf","file_name":"IST-2016-455-v1+1_journal.pcbi.1004304.pdf","relation":"main_file","access_level":"open_access","file_size":4673930,"checksum":"472b979f3f1cffb37b3e503f085115ca","file_id":"5212","creator":"system"}],"issue":"7","author":[{"first_name":"Olivier","last_name":"Marre","full_name":"Marre, Olivier"},{"full_name":"Botella Soler, Vicente","id":"421234E8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8790-1914","last_name":"Botella Soler","first_name":"Vicente"},{"last_name":"Simmons","first_name":"Kristina","full_name":"Simmons, Kristina"},{"last_name":"Mora","first_name":"Thierry","full_name":"Mora, Thierry"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455"},{"last_name":"Berry","first_name":"Michael","full_name":"Berry, Michael"}],"project":[{"call_identifier":"FWF","name":"Sensitivity to higher-order statistics in natural scenes","grant_number":"P 25651-N26","_id":"254D1A94-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Published Version","pubrep_id":"455","status":"public","date_created":"2018-12-11T11:53:31Z","type":"journal_article","_id":"1697","date_published":"2015-07-01T00:00:00Z","publisher":"Public Library of Science","file_date_updated":"2020-07-14T12:45:12Z","title":"High accuracy decoding of dynamical motion from a large retinal population","publication_status":"published","abstract":[{"text":"Motion tracking is a challenge the visual system has to solve by reading out the retinal population. It is still unclear how the information from different neurons can be combined together to estimate the position of an object. Here we recorded a large population of ganglion cells in a dense patch of salamander and guinea pig retinas while displaying a bar moving diffusively. We show that the bar’s position can be reconstructed from retinal activity with a precision in the hyperacuity regime using a linear decoder acting on 100+ cells. We then took advantage of this unprecedented precision to explore the spatial structure of the retina’s population code. The classical view would have suggested that the firing rates of the cells form a moving hill of activity tracking the bar’s position. Instead, we found that most ganglion cells in the salamander fired sparsely and idiosyncratically, so that their neural image did not track the bar. Furthermore, ganglion cell activity spanned an area much larger than predicted by their receptive fields, with cells coding for motion far in their surround. As a result, population redundancy was high, and we could find multiple, disjoint subsets of neurons that encoded the trajectory with high precision. This organization allows for diverse collections of ganglion cells to represent high-accuracy motion information in a form easily read out by downstream neural circuits.","lang":"eng"}],"ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"GaTk"}],"date_updated":"2021-01-12T06:52:35Z","citation":{"short":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, M. Berry, PLoS Computational Biology 11 (2015).","mla":"Marre, Olivier, et al. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” <i>PLoS Computational Biology</i>, vol. 11, no. 7, e1004304, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">10.1371/journal.pcbi.1004304</a>.","ama":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. High accuracy decoding of dynamical motion from a large retinal population. <i>PLoS Computational Biology</i>. 2015;11(7). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">10.1371/journal.pcbi.1004304</a>","chicago":"Marre, Olivier, Vicente Botella Soler, Kristina Simmons, Thierry Mora, Gašper Tkačik, and Michael Berry. “High Accuracy Decoding of Dynamical Motion from a Large Retinal Population.” <i>PLoS Computational Biology</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">https://doi.org/10.1371/journal.pcbi.1004304</a>.","ista":"Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. 2015. High accuracy decoding of dynamical motion from a large retinal population. PLoS Computational Biology. 11(7), e1004304.","apa":"Marre, O., Botella Soler, V., Simmons, K., Mora, T., Tkačik, G., &#38; Berry, M. (2015). High accuracy decoding of dynamical motion from a large retinal population. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004304\">https://doi.org/10.1371/journal.pcbi.1004304</a>","ieee":"O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, and M. Berry, “High accuracy decoding of dynamical motion from a large retinal population,” <i>PLoS Computational Biology</i>, vol. 11, no. 7. Public Library of Science, 2015."},"publist_id":"5447","intvolume":"        11","publication":"PLoS Computational Biology","scopus_import":1,"acknowledgement":"This work was supported by grants EY 014196 and EY 017934 to MJB, ANR OPTIMA, the French State program Investissements d’Avenir managed by the Agence Nationale de la Recherche [LIFESENSES: ANR-10-LABX-65], and by a EC grant from the Human Brain Project (CLAP) to OM, the Austrian Research Foundation FWF P25651 to VBS and GT. VBS is partially supported by contracts MEC, Spain (Grant No. AYA2010- 22111-C03-02, Grant No. AYA2013-48623-C2-2 and FEDER Funds).","year":"2015","doi":"10.1371/journal.pcbi.1004304","day":"01","oa":1}]