[{"oa_version":"Published Version","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"}],"intvolume":" 6","month":"09","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"file_id":"4959","checksum":"912e1acbaf201100f447a43e4d5958bd","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-448-v1+1_games-06-00413.pdf","date_created":"2018-12-12T10:12:41Z","creator":"system","file_size":518832,"date_updated":"2020-07-14T12:45:12Z"}],"publication_status":"published","publication_identifier":{"eissn":["2073-4336"]},"license":"https://creativecommons.org/licenses/by/4.0/","ec_funded":1,"volume":6,"issue":"4","_id":"1681","pubrep_id":"448","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","ddc":["000"],"date_updated":"2023-10-17T11:42:52Z","file_date_updated":"2020-07-14T12:45:12Z","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"oa":1,"publisher":"MDPI","quality_controlled":"1","publication":"Games","day":"29","year":"2015","has_accepted_license":"1","date_created":"2018-12-11T11:53:26Z","doi":"10.3390/g6040413","date_published":"2015-09-29T00:00:00Z","page":"413 - 437","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games. MDPI, 2015. https://doi.org/10.3390/g6040413.","ista":"Priklopil T, Chatterjee K. 2015. Evolution of decisions in population games with sequentially searching individuals. Games. 6(4), 413–437.","mla":"Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.” Games, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:10.3390/g6040413.","ieee":"T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4. MDPI, pp. 413–437, 2015.","short":"T. Priklopil, K. Chatterjee, Games 6 (2015) 413–437.","apa":"Priklopil, T., & Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI. https://doi.org/10.3390/g6040413","ama":"Priklopil T, Chatterjee K. Evolution of decisions in population games with sequentially searching individuals. Games. 2015;6(4):413-437. doi:10.3390/g6040413"},"title":"Evolution of decisions in population games with sequentially searching individuals","article_processing_charge":"No","author":[{"first_name":"Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","last_name":"Priklopil","full_name":"Priklopil, Tadeas"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"publist_id":"5467"},{"day":"23","publication":"Entropy","has_accepted_license":"1","year":"2015","date_published":"2015-10-23T00:00:00Z","doi":"10.3390/e17107266","date_created":"2018-12-11T11:53:17Z","page":"7266 - 7297","acknowledgement":"This work was supported by the DFG priority program 1527 (Autonomous Learning) and by the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 318723 (MatheMACS) and from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734.","publisher":"MDPI","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"G. S. Martius and E. Olbrich, “Quantifying emergent behavior of autonomous robots,” Entropy, vol. 17, no. 10. MDPI, pp. 7266–7297, 2015.","short":"G.S. Martius, E. Olbrich, Entropy 17 (2015) 7266–7297.","apa":"Martius, G. S., & Olbrich, E. (2015). Quantifying emergent behavior of autonomous robots. Entropy. MDPI. https://doi.org/10.3390/e17107266","ama":"Martius GS, Olbrich E. Quantifying emergent behavior of autonomous robots. Entropy. 2015;17(10):7266-7297. doi:10.3390/e17107266","mla":"Martius, Georg S., and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” Entropy, vol. 17, no. 10, MDPI, 2015, pp. 7266–97, doi:10.3390/e17107266.","ista":"Martius GS, Olbrich E. 2015. Quantifying emergent behavior of autonomous robots. Entropy. 17(10), 7266–7297.","chicago":"Martius, Georg S, and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” Entropy. MDPI, 2015. https://doi.org/10.3390/e17107266."},"title":"Quantifying emergent behavior of autonomous robots","publist_id":"5495","author":[{"last_name":"Martius","full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","first_name":"Georg S"},{"full_name":"Olbrich, Eckehard","last_name":"Olbrich","first_name":"Eckehard"}],"article_processing_charge":"No","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"file":[{"date_updated":"2020-07-14T12:45:08Z","file_size":6455007,"creator":"system","date_created":"2018-12-12T10:12:25Z","file_name":"IST-2016-464-v1+1_entropy-17-07266.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"945d99631a96e0315acb26dc8541dcf9","file_id":"4943"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"10","volume":17,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Quantifying behaviors of robots which were generated autonomously from task-independent objective functions is an important prerequisite for objective comparisons of algorithms and movements of animals. The temporal sequence of such a behavior can be considered as a time series and hence complexity measures developed for time series are natural candidates for its quantification. The predictive information and the excess entropy are such complexity measures. They measure the amount of information the past contains about the future and thus quantify the nonrandom structure in the temporal sequence. However, when using these measures for systems with continuous states one has to deal with the fact that their values will depend on the resolution with which the systems states are observed. For deterministic systems both measures will diverge with increasing resolution. We therefore propose a new decomposition of the excess entropy in resolution dependent and resolution independent parts and discuss how they depend on the dimensionality of the dynamics, correlations and the noise level. For the practical estimation we propose to use estimates based on the correlation integral instead of the direct estimation of the mutual information based on next neighbor statistics because the latter allows less control of the scale dependencies. Using our algorithm we are able to show how autonomous learning generates behavior of increasing complexity with increasing learning duration."}],"month":"10","intvolume":" 17","scopus_import":"1","ddc":["000"],"date_updated":"2023-10-17T11:42:00Z","file_date_updated":"2020-07-14T12:45:08Z","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"_id":"1655","status":"public","pubrep_id":"464","type":"journal_article","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)"}},{"author":[{"first_name":"Chong","id":"3DFD581A-F248-11E8-B48F-1D18A9856A87","last_name":"Chen","full_name":"Chen, Chong"},{"last_name":"Wang","full_name":"Wang, Chao","first_name":"Chao"},{"full_name":"Zhao, Xuan","last_name":"Zhao","first_name":"Xuan"},{"first_name":"Tao","full_name":"Zhou, Tao","last_name":"Zhou"},{"first_name":"Dao","full_name":"Xu, Dao","last_name":"Xu"},{"full_name":"Wang, Zhi","last_name":"Wang","first_name":"Zhi"},{"last_name":"Wang","full_name":"Wang, Ying","first_name":"Ying"}],"publist_id":"5269","article_processing_charge":"No","title":"Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats","citation":{"ista":"Chen C, Wang C, Zhao X, Zhou T, Xu D, Wang Z, Wang Y. 2015. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. 7(2).","chicago":"Chen, Chong, Chao Wang, Xuan Zhao, Tao Zhou, Dao Xu, Zhi Wang, and Ying Wang. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro. SAGE Publications, 2015. https://doi.org/10.1177/1759091415575845.","ama":"Chen C, Wang C, Zhao X, et al. Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. 2015;7(2). doi:10.1177/1759091415575845","apa":"Chen, C., Wang, C., Zhao, X., Zhou, T., Xu, D., Wang, Z., & Wang, Y. (2015). Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. SAGE Publications. https://doi.org/10.1177/1759091415575845","short":"C. Chen, C. Wang, X. Zhao, T. Zhou, D. Xu, Z. Wang, Y. Wang, ASN Neuro 7 (2015).","ieee":"C. Chen et al., “Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats,” ASN Neuro, vol. 7, no. 2. SAGE Publications, 2015.","mla":"Chen, Chong, et al. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro, vol. 7, no. 2, SAGE Publications, 2015, doi:10.1177/1759091415575845."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"SAGE Publications","oa":1,"date_published":"2015-04-13T00:00:00Z","doi":"10.1177/1759091415575845","date_created":"2018-12-11T11:54:16Z","has_accepted_license":"1","year":"2015","day":"13","publication":"ASN Neuro","type":"journal_article","article_type":"original","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"status":"public","pubrep_id":"456","_id":"1834","file_date_updated":"2020-07-14T12:45:18Z","department":[{"_id":"PeJo"}],"date_updated":"2023-10-18T06:47:30Z","ddc":["570"],"scopus_import":"1","month":"04","intvolume":" 7","abstract":[{"text":"Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal neurogenesis and neurocognitive functions, and most of them showed impairment at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours. Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear discrimination learning tests were performed to determine the influence on spatial learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted hippocampal neurogenesis and increased the survival of newborn cells and the proportion of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated rats performed better during the training days of the Morris water maze test and in contextual-fear discrimination learning test. These results suggest that a subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal rats and facilitates their performance in dentate gyrus-dependent learning tasks.","lang":"eng"}],"oa_version":"Published Version","volume":7,"issue":"2","license":"https://creativecommons.org/licenses/by/3.0/","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5057","checksum":"53e16bd3fc2ae2c0d7de9164626c37aa","creator":"system","file_size":1146814,"date_updated":"2020-07-14T12:45:18Z","file_name":"IST-2016-456-v1+1_ASN_Neuro-2015-Chen-.pdf","date_created":"2018-12-12T10:14:08Z"}],"language":[{"iso":"eng"}]},{"department":[{"_id":"JaMa"}],"date_updated":"2023-10-18T07:48:28Z","status":"public","article_type":"original","type":"journal_article","_id":"1635","volume":24,"issue":"4","language":[{"iso":"eng"}],"publication_status":"published","intvolume":" 24","month":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1409.8605"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We calculate a Ricci curvature lower bound for some classical examples of random walks, namely, a chain on a slice of the n-dimensional discrete cube (the so-called Bernoulli-Laplace model) and the random transposition shuffle of the symmetric group of permutations on n letters."}],"title":"Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models","article_processing_charge":"No","external_id":{"arxiv":["1409.8605"]},"author":[{"full_name":"Erbar, Matthias","last_name":"Erbar","first_name":"Matthias"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan","last_name":"Maas"},{"first_name":"Prasad","last_name":"Tetali","full_name":"Tetali, Prasad"}],"publist_id":"5520","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Erbar, Matthias, et al. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” Annales de La Faculté Des Sciences de Toulouse, vol. 24, no. 4, Faculté des sciences de Toulouse, 2015, pp. 781–800, doi:10.5802/afst.1464.","short":"M. Erbar, J. Maas, P. Tetali, Annales de La Faculté Des Sciences de Toulouse 24 (2015) 781–800.","ieee":"M. Erbar, J. Maas, and P. Tetali, “Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models,” Annales de la faculté des sciences de Toulouse, vol. 24, no. 4. Faculté des sciences de Toulouse, pp. 781–800, 2015.","apa":"Erbar, M., Maas, J., & Tetali, P. (2015). Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de La Faculté Des Sciences de Toulouse. Faculté des sciences de Toulouse. https://doi.org/10.5802/afst.1464","ama":"Erbar M, Maas J, Tetali P. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de la faculté des sciences de Toulouse. 2015;24(4):781-800. doi:10.5802/afst.1464","chicago":"Erbar, Matthias, Jan Maas, and Prasad Tetali. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” Annales de La Faculté Des Sciences de Toulouse. Faculté des sciences de Toulouse, 2015. https://doi.org/10.5802/afst.1464.","ista":"Erbar M, Maas J, Tetali P. 2015. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de la faculté des sciences de Toulouse. 24(4), 781–800."},"date_created":"2018-12-11T11:53:10Z","date_published":"2015-01-01T00:00:00Z","doi":"10.5802/afst.1464","page":"781 - 800","publication":"Annales de la faculté des sciences de Toulouse","day":"01","year":"2015","oa":1,"publisher":"Faculté des sciences de Toulouse","quality_controlled":"1"},{"date_updated":"2023-11-07T11:56:32Z","extern":"1","type":"journal_article","article_type":"letter_note","status":"public","_id":"14303","issue":"7","volume":15,"publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1021/acs.nanolett.5b01461","open_access":"1"}],"month":"06","intvolume":" 15","abstract":[{"lang":"eng","text":"Scaffolded DNA origami enables the fabrication of a variety of complex nanostructures that promise utility in diverse fields of application, ranging from biosensing over advanced therapeutics to metamaterials. The broad applicability of DNA origami as a material beyond the level of proof-of-concept studies critically depends, among other factors, on the availability of large amounts of pure single-stranded scaffold DNA. Here, we present a method for the efficient production of M13 bacteriophage-derived genomic DNA using high-cell-density fermentation of Escherichia coli in stirred-tank bioreactors. We achieve phage titers of up to 1.6 × 1014 plaque-forming units per mL. Downstream processing yields up to 410 mg of high-quality single-stranded DNA per one liter reaction volume, thus upgrading DNA origami-based nanotechnology from the milligram to the gram scale."}],"oa_version":"Published Version","pmid":1,"author":[{"last_name":"Kick","full_name":"Kick, B","first_name":"B"},{"last_name":"Praetorius","full_name":"Praetorius, Florian M","first_name":"Florian M","id":"dfec9381-4341-11ee-8fd8-faa02bba7d62"},{"first_name":"H","last_name":"Dietz","full_name":"Dietz, H"},{"full_name":"Weuster-Botz, D","last_name":"Weuster-Botz","first_name":"D"}],"external_id":{"pmid":["26028443"]},"article_processing_charge":"No","title":"Efficient production of single-stranded phage DNA as scaffolds for DNA origami","citation":{"ieee":"B. Kick, F. M. Praetorius, H. Dietz, and D. Weuster-Botz, “Efficient production of single-stranded phage DNA as scaffolds for DNA origami,” Nano Letters, vol. 15, no. 7. ACS Publications, pp. 4672–4676, 2015.","short":"B. Kick, F.M. Praetorius, H. Dietz, D. Weuster-Botz, Nano Letters 15 (2015) 4672–4676.","apa":"Kick, B., Praetorius, F. M., Dietz, H., & Weuster-Botz, D. (2015). Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. ACS Publications. https://doi.org/10.1021/acs.nanolett.5b01461","ama":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 2015;15(7):4672-4676. doi:10.1021/acs.nanolett.5b01461","mla":"Kick, B., et al. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” Nano Letters, vol. 15, no. 7, ACS Publications, 2015, pp. 4672–76, doi:10.1021/acs.nanolett.5b01461.","ista":"Kick B, Praetorius FM, Dietz H, Weuster-Botz D. 2015. Efficient production of single-stranded phage DNA as scaffolds for DNA origami. Nano Letters. 15(7), 4672–4676.","chicago":"Kick, B, Florian M Praetorius, H Dietz, and D Weuster-Botz. “Efficient Production of Single-Stranded Phage DNA as Scaffolds for DNA Origami.” Nano Letters. ACS Publications, 2015. https://doi.org/10.1021/acs.nanolett.5b01461."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"4672-4676","date_published":"2015-06-01T00:00:00Z","doi":"10.1021/acs.nanolett.5b01461","date_created":"2023-09-06T12:52:47Z","year":"2015","day":"01","publication":"Nano Letters","quality_controlled":"1","publisher":"ACS Publications","oa":1},{"year":"2015","day":"16","page":"158 - 177","date_created":"2018-12-11T11:52:58Z","date_published":"2015-07-16T00:00:00Z","doi":"10.1007/978-3-319-21690-4_10","acknowledgement":"This research was funded in part by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award), European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989 (QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734.","oa":1,"quality_controlled":"1","publisher":"Springer","citation":{"mla":"Brázdil, Tomáš, et al. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.","ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10","ama":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample explanation by learning small strategies in Markov decision processes. In: Vol 9206. Springer; 2015:158-177. doi:10.1007/978-3-319-21690-4_10","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.","ista":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"last_name":"Fellner","full_name":"Fellner, Andreas","id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5564","title":"Counterexample explanation by learning small strategies in Markov decision processes","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-319-21690-4"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":9206,"related_material":{"record":[{"relation":"research_paper","id":"5549","status":"public"}]},"abstract":[{"text":"For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation.\r\nThe key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.02834"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 9206","month":"07","date_updated":"2024-02-21T13:52:07Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"1603","conference":{"name":"CAV: Computer Aided Verification","start_date":"2015-07-18","end_date":"2015-07-24","location":"San Francisco, CA, United States"},"type":"conference","status":"public"},{"oa":1,"publisher":"Institute of Science and Technology Austria","date_created":"2018-12-12T12:31:29Z","date_published":"2015-08-13T00:00:00Z","doi":"10.15479/AT:ISTA:28","year":"2015","has_accepted_license":"1","day":"13","project":[{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"article_processing_charge":"No","author":[{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","full_name":"Fellner, Andreas","last_name":"Fellner"}],"publist_id":"5564","title":"Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes","citation":{"chicago":"Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.","ista":"Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:28.","mla":"Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.","apa":"Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28","ama":"Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28","short":"A. Fellner, (2015).","ieee":"A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","abstract":[{"text":"This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees.\r\nThe archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library.\r\nTo execute the program, please have a look at the README.txt, which provides instructions and further information on the archive.\r\nThe archive contains scripts that (if run often enough) reproduces the data presented in the publication.","lang":"eng"}],"oa_version":"Published Version","license":"https://creativecommons.org/publicdomain/zero/1.0/","contributor":[{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky"}],"ec_funded":1,"related_material":{"record":[{"relation":"popular_science","id":"1603","status":"public"}]},"datarep_id":"28","file":[{"content_type":"application/zip","relation":"main_file","access_level":"open_access","file_id":"5597","checksum":"b8bcb43c0893023cda66c1b69c16ac62","file_size":49557109,"date_updated":"2020-07-14T12:47:00Z","creator":"system","file_name":"IST-2015-28-v1+2_Fellner_DataRep.zip","date_created":"2018-12-12T13:02:31Z"}],"tmp":{"image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","short":"CC0 (1.0)"},"type":"research_data","keyword":["Markov Decision Process","Decision Tree","Probabilistic Verification","Counterexample Explanation"],"status":"public","_id":"5549","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:47:00Z","date_updated":"2024-02-21T13:52:07Z","ddc":["004"]},{"acknowledgement":"PP, ZP and MT were partially supported by the Charles University Grant GAUK 421511. ZP was\r\npartially supported by the Charles University Grant SVV-2014-260103. ZP and MT were partially\r\nsupported by the ERC Advanced Grant No. 267165 and by the project CE-ITI (GACR P202/12/G061)\r\nof the Czech Science Foundation. UW was partially supported by the Swiss National Science Foundation\r\n(grants SNSF-200020-138230 and SNSF-PP00P2-138948). Part of this work was done when XG was affiliated with INRIA Nancy Grand-Est and when MT was affiliated with Institutionen för matematik, Kungliga Tekniska Högskolan, then IST Austria.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2015","day":"01","page":"507 - 521","date_published":"2015-01-01T00:00:00Z","doi":"10.4230/LIPIcs.SOCG.2015.507","date_created":"2018-12-11T11:52:27Z","citation":{"chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Bounding Helly Numbers via Betti Numbers,” 34:507–21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.507.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 507–521.","mla":"Goaoc, Xavier, et al. Bounding Helly Numbers via Betti Numbers. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–21, doi:10.4230/LIPIcs.SOCG.2015.507.","ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly numbers via Betti numbers,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding Helly numbers via Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:507-521. doi:10.4230/LIPIcs.SOCG.2015.507","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2015). Bounding Helly numbers via Betti numbers (Vol. 34, pp. 507–521). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.507"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Goaoc, Xavier","last_name":"Goaoc","first_name":"Xavier"},{"full_name":"Paták, Pavel","last_name":"Paták","first_name":"Pavel"},{"first_name":"Zuzana","last_name":"Patakova","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683"},{"first_name":"Martin","last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"5665","article_processing_charge":"No","title":"Bounding Helly numbers via Betti numbers","abstract":[{"lang":"eng","text":"We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b,d) such that the following holds. If F is a finite family of subsets of R^d such that the ith reduced Betti number (with Z_2 coefficients in singular homology) of the intersection of any proper subfamily G of F is at most b for every non-negative integer i less or equal to (d-1)/2, then F has Helly number at most h(b,d). These topological conditions are sharp: not controlling any of these first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map from C_*(K) to C_*(R^d). Both techniques are of independent interest."}],"oa_version":"Submitted Version","scopus_import":"1","alternative_title":["LIPIcs"],"month":"01","intvolume":" 34","publication_status":"published","file":[{"checksum":"e6881df44d87fe0c2529c9f7b2724614","file_id":"4794","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2016-501-v1+1_46.pdf","date_created":"2018-12-12T10:10:09Z","file_size":633712,"date_updated":"2020-07-14T12:45:00Z","creator":"system"}],"language":[{"iso":"eng"}],"volume":34,"related_material":{"record":[{"relation":"later_version","id":"424","status":"public"}]},"_id":"1512","type":"conference","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)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2015-06-22","location":"Eindhoven, Netherlands","end_date":"2015-06-25"},"status":"public","pubrep_id":"501","date_updated":"2024-02-28T12:59:37Z","ddc":["510"],"file_date_updated":"2020-07-14T12:45:00Z","department":[{"_id":"UlWa"}]},{"date_created":"2018-12-11T11:45:32Z","date_published":"2015-02-20T00:00:00Z","doi":"10.1515/crelle-2014-0122","page":"203 - 234","publication":"Journal fur die Reine und Angewandte Mathematik","day":"20","year":"2015","oa":1,"publisher":"Walter de Gruyter","quality_controlled":"1","acknowledgement":"While working on this paper the authors were supported by the Leverhulme Trust and ERC grant 306457.","title":"Improvements in Birch's theorem on forms in many variables","article_processing_charge":"No","external_id":{"arxiv":["1402.4489"]},"author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"},{"first_name":"Sean","last_name":"Prendiville","full_name":"Prendiville, Sean"}],"publist_id":"7631","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731), 203–234.","chicago":"Browning, Timothy D, and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter, n.d. https://doi.org/10.1515/crelle-2014-0122.","ama":"Browning TD, Prendiville S. Improvements in Birch’s theorem on forms in many variables. Journal fur die Reine und Angewandte Mathematik. 2017(731):203-234. doi:10.1515/crelle-2014-0122","apa":"Browning, T. D., & Prendiville, S. (n.d.). Improvements in Birch’s theorem on forms in many variables. Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crelle-2014-0122","ieee":"T. D. Browning and S. Prendiville, “Improvements in Birch’s theorem on forms in many variables,” Journal fur die Reine und Angewandte Mathematik, vol. 2017, no. 731. Walter de Gruyter, pp. 203–234.","short":"T.D. Browning, S. Prendiville, Journal Fur Die Reine Und Angewandte Mathematik 2017 (n.d.) 203–234.","mla":"Browning, Timothy D., and Sean Prendiville. “Improvements in Birch’s Theorem on Forms in Many Variables.” Journal Fur Die Reine Und Angewandte Mathematik, vol. 2017, no. 731, Walter de Gruyter, pp. 203–34, doi:10.1515/crelle-2014-0122."},"volume":2017,"related_material":{"record":[{"relation":"later_version","id":"256","status":"public"}]},"issue":"731","language":[{"iso":"eng"}],"publication_status":"submitted","publication_identifier":{"issn":["0075-4102"]},"intvolume":" 2017","month":"02","main_file_link":[{"url":"https://arxiv.org/abs/1402.4489","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We show that a non-singular integral form of degree d is soluble non-trivially over the integers if and only if it is soluble non-trivially over the reals and the p-adic numbers, provided that the form has at least (d-\\sqrt{d}/2)2^d variables. This improves on a longstanding result of Birch."}],"extern":"1","date_updated":"2024-03-05T12:09:22Z","status":"public","article_type":"original","type":"journal_article","_id":"271"},{"date_updated":"2024-03-20T08:31:49Z","department":[{"_id":"VlKo"},{"_id":"KrPi"}],"_id":"1675","pubrep_id":"671","status":"public","conference":{"start_date":"2015-08-16","location":"Santa Barbara, CA, United States","end_date":"2015-08-20","name":"CRYPTO: International Cryptology Conference"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783662479995"]},"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"2274","status":"public"}]},"volume":9216,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system. In this work, we put forward an alternative concept for PoWs - so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model (with one additional mild assumption required for the proof to go through), using graphs with high “pebbling complexity” and Merkle hash-trees. We discuss some applications, including follow-up work where a decentralized digital currency scheme called Spacecoin is constructed that uses PoS (instead of wasteful PoW like in Bitcoin) to prevent double spending. The main technical contribution of this work is the construction of (directed, loop-free) graphs on N vertices with in-degree O(log logN) such that even if one places Θ(N) pebbles on the nodes of the graph, there’s a constant fraction of nodes that needs Θ(N) steps to be pebbled (where in every step one can put a pebble on a node if all its parents have a pebble)."}],"intvolume":" 9216","month":"08","main_file_link":[{"url":"https://eprint.iacr.org/2013/796.pdf","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 35th Annual Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 9216, 585–605.","chicago":"Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.” In 35th Annual Cryptology Conference, 9216:585–605. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_29.","ieee":"S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” in 35th Annual Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 585–605.","short":"S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, in:, 35th Annual Cryptology Conference, Springer, 2015, pp. 585–605.","apa":"Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2015). Proofs of space. In 35th Annual Cryptology Conference (Vol. 9216, pp. 585–605). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_29","ama":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of space. In: 35th Annual Cryptology Conference. Vol 9216. Springer; 2015:585-605. doi:10.1007/978-3-662-48000-7_29","mla":"Dziembowski, Stefan, et al. “Proofs of Space.” 35th Annual Cryptology Conference, vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29."},"title":"Proofs of space","article_processing_charge":"No","publist_id":"5474","author":[{"first_name":"Stefan","last_name":"Dziembowski","full_name":"Dziembowski, Stefan"},{"first_name":"Sebastian","full_name":"Faust, Sebastian","last_name":"Faust"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"project":[{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"publication":"35th Annual Cryptology Conference","day":"01","year":"2015","date_created":"2018-12-11T11:53:24Z","doi":"10.1007/978-3-662-48000-7_29","date_published":"2015-08-01T00:00:00Z","page":"585 - 605","oa":1,"publisher":"Springer","quality_controlled":"1"},{"date_updated":"2024-03-25T11:52:26Z","extern":"1","type":"journal_article","article_type":"original","status":"public","keyword":["Cell Biology","Molecular Biology"],"_id":"15160","issue":"5","volume":58,"publication_identifier":{"issn":["1097-2765"]},"publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.molcel.2015.03.031"}],"month":"06","intvolume":" 58","abstract":[{"text":"The circadian clock orchestrates global changes in transcriptional regulation on a daily basis via the bHLH-PAS transcription factor CLOCK:BMAL1. Pathways driven by other bHLH-PAS transcription factors have a homologous repressor that modulates activity on a tissue-specific basis, but none have been identified for CLOCK:BMAL1. We show here that the cancer/testis antigen PASD1 fulfills this role to suppress circadian rhythms. PASD1 is evolutionarily related to CLOCK and interacts with the CLOCK:BMAL1 complex to repress transcriptional activation. Expression of PASD1 is restricted to germline tissues in healthy individuals but can be induced in cells of somatic origin upon oncogenic transformation. Reducing PASD1 in human cancer cells significantly increases the amplitude of transcriptional oscillations to generate more robust circadian rhythms. Our results describe a function for a germline-specific protein in regulation of the circadian clock and provide a molecular link from oncogenic transformation to suppression of circadian rhythms.","lang":"eng"}],"oa_version":"Published Version","author":[{"first_name":"Alicia Kathleen","id":"6437c950-2a03-11ee-914d-d6476dd7b75c","last_name":"Michael","full_name":"Michael, Alicia Kathleen"},{"first_name":"Stacy L.","full_name":"Harvey, Stacy L.","last_name":"Harvey"},{"full_name":"Sammons, Patrick J.","last_name":"Sammons","first_name":"Patrick J."},{"last_name":"Anderson","full_name":"Anderson, Amanda P.","first_name":"Amanda P."},{"first_name":"Hema M.","full_name":"Kopalle, Hema M.","last_name":"Kopalle"},{"first_name":"Alison H.","full_name":"Banham, Alison H.","last_name":"Banham"},{"first_name":"Carrie L.","full_name":"Partch, Carrie L.","last_name":"Partch"}],"article_processing_charge":"No","title":"Cancer/Testis antigen PASD1 silences the circadian clock","citation":{"short":"A.K. Michael, S.L. Harvey, P.J. Sammons, A.P. Anderson, H.M. Kopalle, A.H. Banham, C.L. Partch, Molecular Cell 58 (2015) 743–754.","ieee":"A. K. Michael et al., “Cancer/Testis antigen PASD1 silences the circadian clock,” Molecular Cell, vol. 58, no. 5. Elsevier, pp. 743–754, 2015.","ama":"Michael AK, Harvey SL, Sammons PJ, et al. Cancer/Testis antigen PASD1 silences the circadian clock. Molecular Cell. 2015;58(5):743-754. doi:10.1016/j.molcel.2015.03.031","apa":"Michael, A. K., Harvey, S. L., Sammons, P. J., Anderson, A. P., Kopalle, H. M., Banham, A. H., & Partch, C. L. (2015). Cancer/Testis antigen PASD1 silences the circadian clock. Molecular Cell. Elsevier. https://doi.org/10.1016/j.molcel.2015.03.031","mla":"Michael, Alicia K., et al. “Cancer/Testis Antigen PASD1 Silences the Circadian Clock.” Molecular Cell, vol. 58, no. 5, Elsevier, 2015, pp. 743–54, doi:10.1016/j.molcel.2015.03.031.","ista":"Michael AK, Harvey SL, Sammons PJ, Anderson AP, Kopalle HM, Banham AH, Partch CL. 2015. Cancer/Testis antigen PASD1 silences the circadian clock. Molecular Cell. 58(5), 743–754.","chicago":"Michael, Alicia K., Stacy L. Harvey, Patrick J. Sammons, Amanda P. Anderson, Hema M. Kopalle, Alison H. Banham, and Carrie L. Partch. “Cancer/Testis Antigen PASD1 Silences the Circadian Clock.” Molecular Cell. Elsevier, 2015. https://doi.org/10.1016/j.molcel.2015.03.031."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"743-754","date_published":"2015-06-04T00:00:00Z","doi":"10.1016/j.molcel.2015.03.031","date_created":"2024-03-21T07:58:08Z","year":"2015","day":"04","publication":"Molecular Cell","publisher":"Elsevier","quality_controlled":"1","oa":1},{"citation":{"ieee":"A. K. Michael, H. Asimgil, and C. L. Partch, “Cytosolic BMAL1 moonlights as a translation factor,” Trends in Biochemical Sciences, vol. 40, no. 9. Elsevier, pp. 489–490, 2015.","short":"A.K. Michael, H. Asimgil, C.L. Partch, Trends in Biochemical Sciences 40 (2015) 489–490.","apa":"Michael, A. K., Asimgil, H., & Partch, C. L. (2015). Cytosolic BMAL1 moonlights as a translation factor. Trends in Biochemical Sciences. Elsevier. https://doi.org/10.1016/j.tibs.2015.07.006","ama":"Michael AK, Asimgil H, Partch CL. Cytosolic BMAL1 moonlights as a translation factor. Trends in Biochemical Sciences. 2015;40(9):489-490. doi:10.1016/j.tibs.2015.07.006","mla":"Michael, Alicia K., et al. “Cytosolic BMAL1 Moonlights as a Translation Factor.” Trends in Biochemical Sciences, vol. 40, no. 9, Elsevier, 2015, pp. 489–90, doi:10.1016/j.tibs.2015.07.006.","ista":"Michael AK, Asimgil H, Partch CL. 2015. Cytosolic BMAL1 moonlights as a translation factor. Trends in Biochemical Sciences. 40(9), 489–490.","chicago":"Michael, Alicia K., Hande Asimgil, and Carrie L. Partch. “Cytosolic BMAL1 Moonlights as a Translation Factor.” Trends in Biochemical Sciences. Elsevier, 2015. https://doi.org/10.1016/j.tibs.2015.07.006."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Michael","full_name":"Michael, Alicia Kathleen","first_name":"Alicia Kathleen","id":"6437c950-2a03-11ee-914d-d6476dd7b75c"},{"last_name":"Asimgil","full_name":"Asimgil, Hande","first_name":"Hande"},{"full_name":"Partch, Carrie L.","last_name":"Partch","first_name":"Carrie L."}],"article_processing_charge":"No","title":"Cytosolic BMAL1 moonlights as a translation factor","year":"2015","day":"01","publication":"Trends in Biochemical Sciences","page":"489-490","doi":"10.1016/j.tibs.2015.07.006","date_published":"2015-09-01T00:00:00Z","date_created":"2024-03-21T07:57:44Z","quality_controlled":"1","publisher":"Elsevier","date_updated":"2024-03-25T11:53:58Z","extern":"1","_id":"15159","article_type":"original","type":"journal_article","status":"public","keyword":["Molecular Biology","Biochemistry"],"publication_identifier":{"issn":["0968-0004"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":40,"issue":"9","abstract":[{"text":"It is widely recognized that BMAL1 is an essential subunit of the primary transcription factor that drives rhythmic circadian transcription in the nucleus. In a surprising turn, Lipton et al. now show that BMAL1 rhythmically interacts with translational machinery in the cytosol to stimulate protein synthesis in response to mTOR signaling.","lang":"eng"}],"oa_version":"None","scopus_import":"1","month":"09","intvolume":" 40"},{"oa_version":"Published Version","abstract":[{"text":"The emergence of drug resistant pathogens is a serious public health problem. It is a long-standing goal to predict rates of resistance evolution and design optimal treatment strategies accordingly. To this end, it is crucial to reveal the underlying causes of drug-specific differences in the evolutionary dynamics leading to resistance. However, it remains largely unknown why the rates of resistance evolution via spontaneous mutations and the diversity of mutational paths vary substantially between drugs. Here we comprehensively quantify the distribution of fitness effects (DFE) of mutations, a key determinant of evolutionary dynamics, in the presence of eight antibiotics representing the main modes of action. Using precise high-throughput fitness measurements for genome-wide Escherichia coli gene deletion strains, we find that the width of the DFE varies dramatically between antibiotics and, contrary to conventional wisdom, for some drugs the DFE width is lower than in the absence of stress. We show that this previously underappreciated divergence in DFE width among antibiotics is largely caused by their distinct drug-specific dose-response characteristics. Unlike the DFE, the magnitude of the changes in tolerated drug concentration resulting from genome-wide mutations is similar for most drugs but exceptionally small for the antibiotic nitrofurantoin, i.e., mutations generally have considerably smaller resistance effects for nitrofurantoin than for other drugs. A population genetics model predicts that resistance evolution for drugs with this property is severely limited and confined to reproducible mutational paths. We tested this prediction in laboratory evolution experiments using the “morbidostat”, a device for evolving bacteria in well-controlled drug environments. Nitrofurantoin resistance indeed evolved extremely slowly via reproducible mutations—an almost paradoxical behavior since this drug causes DNA damage and increases the mutation rate. Overall, we identified novel quantitative characteristics of the evolutionary landscape that provide the conceptual foundation for predicting the dynamics of drug resistance evolution.","lang":"eng"}],"month":"11","intvolume":" 13","scopus_import":1,"file":[{"file_name":"IST-2016-468-v1+1_journal.pbio.1002299.pdf","date_created":"2018-12-12T10:09:00Z","file_size":1387760,"date_updated":"2020-07-14T12:45:07Z","creator":"system","file_id":"4723","checksum":"0e82e3279f50b15c6c170c042627802b","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":13,"related_material":{"record":[{"relation":"research_data","id":"9711","status":"public"},{"status":"public","id":"9765","relation":"research_data"},{"relation":"dissertation_contains","id":"6263","status":"public"}]},"issue":"11","ec_funded":1,"_id":"1619","status":"public","pubrep_id":"468","type":"journal_article","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)"},"ddc":["570"],"date_updated":"2024-03-27T23:30:28Z","department":[{"_id":"ToBo"}],"file_date_updated":"2020-07-14T12:45:07Z","quality_controlled":"1","publisher":"Public Library of Science","oa":1,"day":"18","publication":"PLoS Biology","has_accepted_license":"1","year":"2015","date_published":"2015-11-18T00:00:00Z","doi":"10.1371/journal.pbio.1002299","date_created":"2018-12-11T11:53:04Z","article_number":"e1002299","project":[{"grant_number":"RGP0042/2013","name":"Revealing the fundamental limits of cell growth","_id":"25EB3A80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25E9AF9E-B435-11E9-9278-68D0E5697425","grant_number":"P27201-B22","name":"Revealing the mechanisms underlying drug interactions"},{"_id":"25E83C2C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Optimality principles in responses to antibiotics","grant_number":"303507"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek, Dilay Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Quantifying the Determinants of Evolutionary Dynamics Leading to Drug Resistance.” PLoS Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.","ista":"Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan D, Toprak E, Bollenbach MT. 2015. Quantifying the determinants of evolutionary dynamics leading to drug resistance. PLoS Biology. 13(11), e1002299.","mla":"Chevereau, Guillaume, et al. “Quantifying the Determinants of Evolutionary Dynamics Leading to Drug Resistance.” PLoS Biology, vol. 13, no. 11, e1002299, Public Library of Science, 2015, doi:10.1371/journal.pbio.1002299.","ieee":"G. Chevereau et al., “Quantifying the determinants of evolutionary dynamics leading to drug resistance,” PLoS Biology, vol. 13, no. 11. Public Library of Science, 2015.","short":"G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D. Ayhan, E. Toprak, M.T. Bollenbach, PLoS Biology 13 (2015).","ama":"Chevereau G, Lukacisinova M, Batur T, et al. Quantifying the determinants of evolutionary dynamics leading to drug resistance. PLoS Biology. 2015;13(11). doi:10.1371/journal.pbio.1002299","apa":"Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D., Toprak, E., & Bollenbach, M. T. (2015). Quantifying the determinants of evolutionary dynamics leading to drug resistance. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002299"},"title":"Quantifying the determinants of evolutionary dynamics leading to drug resistance","publist_id":"5547","author":[{"id":"424D78A0-F248-11E8-B48F-1D18A9856A87","first_name":"Guillaume","full_name":"Chevereau, Guillaume","last_name":"Chevereau"},{"first_name":"Marta","id":"4342E402-F248-11E8-B48F-1D18A9856A87","full_name":"Dravecka, Marta","orcid":"0000-0002-2519-8004","last_name":"Dravecka"},{"full_name":"Batur, Tugce","last_name":"Batur","first_name":"Tugce"},{"first_name":"Aysegul","full_name":"Guvenek, Aysegul","last_name":"Guvenek"},{"first_name":"Dilay","last_name":"Ayhan","full_name":"Ayhan, Dilay"},{"full_name":"Toprak, Erdal","last_name":"Toprak","first_name":"Erdal"},{"first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X","last_name":"Bollenbach"}]},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ama":"Šarić A, Chebaro YC, Knowles TPJ, Frenkel D. Crucial role of nonspecific interactions in amyloid nucleation. Proceedings of the National Academy of Sciences. 2014;111(50):17869-17874. doi:10.1073/pnas.1410159111","apa":"Šarić, A., Chebaro, Y. C., Knowles, T. P. J., & Frenkel, D. (2014). Crucial role of nonspecific interactions in amyloid nucleation. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1410159111","ieee":"A. Šarić, Y. C. Chebaro, T. P. J. Knowles, and D. Frenkel, “Crucial role of nonspecific interactions in amyloid nucleation,” Proceedings of the National Academy of Sciences, vol. 111, no. 50. National Academy of Sciences, pp. 17869–17874, 2014.","short":"A. Šarić, Y.C. Chebaro, T.P.J. Knowles, D. Frenkel, Proceedings of the National Academy of Sciences 111 (2014) 17869–17874.","mla":"Šarić, Anđela, et al. “Crucial Role of Nonspecific Interactions in Amyloid Nucleation.” Proceedings of the National Academy of Sciences, vol. 111, no. 50, National Academy of Sciences, 2014, pp. 17869–74, doi:10.1073/pnas.1410159111.","ista":"Šarić A, Chebaro YC, Knowles TPJ, Frenkel D. 2014. Crucial role of nonspecific interactions in amyloid nucleation. Proceedings of the National Academy of Sciences. 111(50), 17869–17874.","chicago":"Šarić, Anđela, Yassmine C. Chebaro, Tuomas P. J. Knowles, and Daan Frenkel. “Crucial Role of Nonspecific Interactions in Amyloid Nucleation.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2014. https://doi.org/10.1073/pnas.1410159111."},"title":"Crucial role of nonspecific interactions in amyloid nucleation","author":[{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","first_name":"Anđela","orcid":"0000-0002-7854-2139","full_name":"Šarić, Anđela","last_name":"Šarić"},{"first_name":"Yassmine C.","last_name":"Chebaro","full_name":"Chebaro, Yassmine C."},{"first_name":"Tuomas P. J.","last_name":"Knowles","full_name":"Knowles, Tuomas P. J."},{"first_name":"Daan","full_name":"Frenkel, Daan","last_name":"Frenkel"}],"article_processing_charge":"No","external_id":{"arxiv":["1412.0897"],"pmid":["25453085"]},"acknowledgement":"We thank Michele Vendruscolo, Iskra Staneva, and William M. Jacobs, for helpful discussions. A.Š. acknowledges support from the Human Frontier Science Program and Emmanuel College. Y.C.C. and D.F. are supported by Engineering and Physical Sciences Research Council Programme Grant EP/I001352/1. T.P.J.K. acknowledges the Frances and Augustus Newman Foundation, the European Research Council, and the Biotechnology and Biological Sciences Research Council. D.F. acknowledges European Research Council Advanced Grant 227758.","publisher":"National Academy of Sciences","quality_controlled":"1","oa":1,"day":"01","publication":"Proceedings of the National Academy of Sciences","year":"2014","date_published":"2014-12-01T00:00:00Z","doi":"10.1073/pnas.1410159111","date_created":"2021-11-29T13:09:53Z","page":"17869-17874","_id":"10382","status":"public","keyword":["multidisciplinary"],"article_type":"original","type":"journal_article","extern":"1","date_updated":"2021-11-29T13:29:05Z","pmid":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Protein oligomers have been implicated as toxic agents in a wide range of amyloid-related diseases. However, it has remained unsolved whether the oligomers are a necessary step in the formation of amyloid fibrils or just a dangerous byproduct. Analogously, it has not been resolved if the amyloid nucleation process is a classical one-step nucleation process or a two-step process involving prenucleation clusters. We use coarse-grained computer simulations to study the effect of nonspecific attractions between peptides on the primary nucleation process underlying amyloid fibrillization. We find that, for peptides that do not attract, the classical one-step nucleation mechanism is possible but only at nonphysiologically high peptide concentrations. At low peptide concentrations, which mimic the physiologically relevant regime, attractive interpeptide interactions are essential for fibril formation. Nucleation then inevitably takes place through a two-step mechanism involving prefibrillar oligomers. We show that oligomers not only help peptides meet each other but also, create an environment that facilitates the conversion of monomers into the β-sheet–rich form characteristic of fibrils. Nucleation typically does not proceed through the most prevalent oligomers but through an oligomer size that is only observed in rare fluctuations, which is why such aggregates might be hard to capture experimentally. Finally, we find that the nucleation of amyloid fibrils cannot be described by classical nucleation theory: in the two-step mechanism, the critical nucleus size increases with increases in both concentration and interpeptide interactions, which is in direct contrast with predictions from classical nucleation theory."}],"month":"12","intvolume":" 111","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.pnas.org/content/111/50/17869"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"publication_status":"published","issue":"50","volume":111},{"extern":"1","date_updated":"2021-11-29T13:29:01Z","status":"public","article_type":"original","type":"journal_article","_id":"10383","issue":"5","volume":89,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1550-2376"],"issn":["1539-3755"]},"publication_status":"published","month":"05","intvolume":" 89","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1310.0826"}],"pmid":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We use numerical simulations to compute the equation of state of a suspension of spherical self-propelled nanoparticles in two and three dimensions. We study in detail the effect of excluded volume interactions and confinement as a function of the system's temperature, concentration, and strength of the propulsion. We find a striking nonmonotonic dependence of the pressure on the temperature and provide simple scaling arguments to predict and explain the occurrence of such anomalous behavior. We explicitly show how our results have important implications for the effective forces on passive components suspended in a bath of active particles."}],"title":"Anomalous thermomechanical properties of a self-propelled colloidal fluid","author":[{"full_name":"Mallory, S. A.","last_name":"Mallory","first_name":"S. A."},{"full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","last_name":"Šarić","first_name":"Anđela","id":"bf63d406-f056-11eb-b41d-f263a6566d8b"},{"last_name":"Valeriani","full_name":"Valeriani, C.","first_name":"C."},{"first_name":"A.","full_name":"Cacciuto, A.","last_name":"Cacciuto"}],"external_id":{"pmid":["25353796"],"arxiv":["1310.0826"]},"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Mallory SA, Šarić A, Valeriani C, Cacciuto A. 2014. Anomalous thermomechanical properties of a self-propelled colloidal fluid. Physical Review E. 89(5), 052303.","chicago":"Mallory, S. A., Anđela Šarić, C. Valeriani, and A. Cacciuto. “Anomalous Thermomechanical Properties of a Self-Propelled Colloidal Fluid.” Physical Review E. American Physical Society, 2014. https://doi.org/10.1103/physreve.89.052303.","apa":"Mallory, S. A., Šarić, A., Valeriani, C., & Cacciuto, A. (2014). Anomalous thermomechanical properties of a self-propelled colloidal fluid. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.89.052303","ama":"Mallory SA, Šarić A, Valeriani C, Cacciuto A. Anomalous thermomechanical properties of a self-propelled colloidal fluid. Physical Review E. 2014;89(5). doi:10.1103/physreve.89.052303","ieee":"S. A. Mallory, A. Šarić, C. Valeriani, and A. Cacciuto, “Anomalous thermomechanical properties of a self-propelled colloidal fluid,” Physical Review E, vol. 89, no. 5. American Physical Society, 2014.","short":"S.A. Mallory, A. Šarić, C. Valeriani, A. Cacciuto, Physical Review E 89 (2014).","mla":"Mallory, S. A., et al. “Anomalous Thermomechanical Properties of a Self-Propelled Colloidal Fluid.” Physical Review E, vol. 89, no. 5, 052303, American Physical Society, 2014, doi:10.1103/physreve.89.052303."},"article_number":"052303","date_published":"2014-05-06T00:00:00Z","doi":"10.1103/physreve.89.052303","date_created":"2021-11-29T13:10:33Z","day":"06","publication":"Physical Review E","year":"2014","publisher":"American Physical Society","quality_controlled":"1","oa":1},{"issue":"4","date_published":"2014-03-17T00:00:00Z","doi":"10.1002/cphc.201301034","volume":15,"date_created":"2018-12-11T11:49:55Z","page":"756 - 762","day":"17","publication":"ChemPhysChem","language":[{"iso":"eng"}],"year":"2014","publication_status":"published","month":"03","intvolume":" 15","publisher":"Wiley-Blackwell","oa_version":"None","abstract":[{"lang":"eng","text":"Diffraction-unlimited far-field super-resolution fluorescence (nanoscopy) methods typically rely on transiently transferring fluorophores between two states, whereby this transfer is usually laid out as a switch. However, depending on whether this is induced in a spatially controlled manner using a pattern of light (coordinate-targeted) or stochastically on a single-molecule basis, specific requirements on the fluorophores are imposed. Therefore, the fluorophores are usually utilized just for one class of methods only. In this study we demonstrate that the reversibly switchable fluorescent protein Dreiklang enables live-cell recordings in both spatially controlled and stochastic modes. We show that the Dreiklang chromophore entails three different light-induced switching mechanisms, namely a reversible photochemical one, off-switching by stimulated emission, and a reversible transfer to a long-lived dark state from the S1 state, all of which can be utilized to overcome the diffraction barrier. We also find that for the single-molecule- based stochastic GSDIM approach (ground-state depletion followed by individual molecule return), Dreiklang provides a larger number of on-off localization events as compared to its progenitor Citrine. Altogether, Dreiklang is a versatile probe for essentially all popular forms of live-cell fluorescence nanoscopy."}],"title":"Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang","author":[{"first_name":"Nickels","full_name":"Jensen, Nickels","last_name":"Jensen"},{"first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","full_name":"Danzl, Johann G","orcid":"0000-0001-8559-3973"},{"last_name":"Willig","full_name":"Willig, Katrin","first_name":"Katrin"},{"first_name":"Flavie","full_name":"Lavoie Cardinal, Flavie","last_name":"Lavoie Cardinal"},{"full_name":"Brakemann, Tanja","last_name":"Brakemann","first_name":"Tanja"},{"last_name":"Hell","full_name":"Hell, Stefan","first_name":"Stefan"},{"first_name":"Stefan","last_name":"Jakobs","full_name":"Jakobs, Stefan"}],"publist_id":"6332","article_processing_charge":"No","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Jensen, Nickels, et al. “Coordinate-Targeted and Coordinate-Stochastic Super-Resolution Microscopy with the Reversibly Switchable Fluorescent Protein Dreiklang.” ChemPhysChem, vol. 15, no. 4, Wiley-Blackwell, 2014, pp. 756–62, doi:10.1002/cphc.201301034.","ieee":"N. Jensen et al., “Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang,” ChemPhysChem, vol. 15, no. 4. Wiley-Blackwell, pp. 756–762, 2014.","short":"N. Jensen, J.G. Danzl, K. Willig, F. Lavoie Cardinal, T. Brakemann, S. Hell, S. Jakobs, ChemPhysChem 15 (2014) 756–762.","apa":"Jensen, N., Danzl, J. G., Willig, K., Lavoie Cardinal, F., Brakemann, T., Hell, S., & Jakobs, S. (2014). Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang. ChemPhysChem. Wiley-Blackwell. https://doi.org/10.1002/cphc.201301034","ama":"Jensen N, Danzl JG, Willig K, et al. Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang. ChemPhysChem. 2014;15(4):756-762. doi:10.1002/cphc.201301034","chicago":"Jensen, Nickels, Johann G Danzl, Katrin Willig, Flavie Lavoie Cardinal, Tanja Brakemann, Stefan Hell, and Stefan Jakobs. “Coordinate-Targeted and Coordinate-Stochastic Super-Resolution Microscopy with the Reversibly Switchable Fluorescent Protein Dreiklang.” ChemPhysChem. Wiley-Blackwell, 2014. https://doi.org/10.1002/cphc.201301034.","ista":"Jensen N, Danzl JG, Willig K, Lavoie Cardinal F, Brakemann T, Hell S, Jakobs S. 2014. Coordinate-targeted and coordinate-stochastic super-resolution microscopy with the reversibly switchable fluorescent protein dreiklang. ChemPhysChem. 15(4), 756–762."},"date_updated":"2021-01-12T06:47:58Z","status":"public","type":"journal_article","_id":"1058"},{"page":"1-7","date_created":"2022-03-04T08:17:25Z","date_published":"2014-02-01T00:00:00Z","doi":"10.1111/cga.12039","year":"2014","publication":"Congenital Anomalies","day":"01","oa":1,"publisher":"Wiley","quality_controlled":"1","acknowledgement":"The authors thank all the members of the Division of Morphogenesis, National Institute for Basic Biology, for their contributions to the research, their encouragement, and helpful discussions, particularly Dr M. Suzuki for his critical reading of the manuscript. We also thank the Model Animal Research and Spectrography and Bioimaging Facilities, NIBB Core Research Facilities, for technical support. M.H. was supported by a research fellowship from the Japan Society for the Promotion of Science (JSPS). Our work introduced in this review was supported by a Grant-in-Aid for Scientific Research on Innovative Areas from the Ministry of Education, Culture, Sports, Science, and Technology (MEXT), Japan, to N.U.","article_processing_charge":"No","external_id":{"pmid":["24666178"]},"author":[{"first_name":"Masakazu","last_name":"Hashimoto","full_name":"Hashimoto, Masakazu"},{"full_name":"Morita, Hitoshi","last_name":"Morita","first_name":"Hitoshi","id":"4C6E54C6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ueno","full_name":"Ueno, Naoto","first_name":"Naoto"}],"title":"Molecular and cellular mechanisms of development underlying congenital diseases","citation":{"chicago":"Hashimoto, Masakazu, Hitoshi Morita, and Naoto Ueno. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” Congenital Anomalies. Wiley, 2014. https://doi.org/10.1111/cga.12039.","ista":"Hashimoto M, Morita H, Ueno N. 2014. Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. 54(1), 1–7.","mla":"Hashimoto, Masakazu, et al. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” Congenital Anomalies, vol. 54, no. 1, Wiley, 2014, pp. 1–7, doi:10.1111/cga.12039.","apa":"Hashimoto, M., Morita, H., & Ueno, N. (2014). Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. Wiley. https://doi.org/10.1111/cga.12039","ama":"Hashimoto M, Morita H, Ueno N. Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. 2014;54(1):1-7. doi:10.1111/cga.12039","ieee":"M. Hashimoto, H. Morita, and N. Ueno, “Molecular and cellular mechanisms of development underlying congenital diseases,” Congenital Anomalies, vol. 54, no. 1. Wiley, pp. 1–7, 2014.","short":"M. Hashimoto, H. Morita, N. Ueno, Congenital Anomalies 54 (2014) 1–7."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":54,"issue":"1","publication_status":"published","publication_identifier":{"issn":["0914-3505"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1111/cga.12039","open_access":"1"}],"scopus_import":"1","intvolume":" 54","month":"02","abstract":[{"lang":"eng","text":"In the last several decades, developmental biology has clarified the molecular mechanisms of embryogenesis and organogenesis. In particular, it has demonstrated that the “tool-kit genes” essential for regulating developmental processes are not only highly conserved among species, but are also used as systems at various times and places in an organism to control distinct developmental events. Therefore, mutations in many of these tool-kit genes may cause congenital diseases involving morphological abnormalities. This link between genes and abnormal morphological phenotypes underscores the importance of understanding how cells behave and contribute to morphogenesis as a result of gene function. Recent improvements in live imaging and in quantitative analyses of cellular dynamics will advance our understanding of the cellular pathogenesis of congenital diseases associated with aberrant morphologies. In these studies, it is critical to select an appropriate model organism for the particular phenomenon of interest."}],"oa_version":"None","pmid":1,"department":[{"_id":"CaHe"}],"date_updated":"2022-03-04T08:26:05Z","type":"journal_article","article_type":"original","keyword":["Developmental Biology","Embryology","General Medicine","Pediatrics","Perinatology","and Child Health"],"status":"public","_id":"10815"},{"day":"01","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783709115251"],"eisbn":["9783709115268"]},"publication_status":"published","year":"2014","date_published":"2014-04-01T00:00:00Z","doi":"10.1007/978-3-7091-1526-8","date_created":"2022-03-03T11:52:44Z","page":"444","oa_version":"None","abstract":[{"lang":"eng","text":"Auxin is an important signaling compound in plants and vital for plant development and growth. The present book, Auxin and its Role in Plant Development, provides the reader with detailed and comprehensive insight into the functioning of the molecule on the whole and specifically in plant development. In the first part, the functioning, metabolism and signaling pathways of auxin in plants are explained, the second part depicts the specific role of auxin in plant development and the third part describes the interaction and functioning of the signaling compound upon stimuli of the environment. Each chapter is written by international experts in the respective field and designed for scientists and researchers in plant biology, plant development and cell biology to summarize the recent progress in understanding the role of auxin and suggest future perspectives for auxin research."}],"place":"Vienna","month":"04","quality_controlled":"1","scopus_import":"1","publisher":"Springer Nature","edition":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2022-03-04T07:38:15Z","citation":{"mla":"Zažímalová, Eva, et al., editors. Auxin and Its Role in Plant Development. 1st ed., Springer Nature, 2014, doi:10.1007/978-3-7091-1526-8.","ieee":"E. Zažímalová, J. Petrášek, and E. Benková, Eds., Auxin and Its Role in Plant Development, 1st ed. Vienna: Springer Nature, 2014.","short":"E. Zažímalová, J. Petrášek, E. Benková, eds., Auxin and Its Role in Plant Development, 1st ed., Springer Nature, Vienna, 2014.","ama":"Zažímalová E, Petrášek J, Benková E, eds. Auxin and Its Role in Plant Development. 1st ed. Vienna: Springer Nature; 2014. doi:10.1007/978-3-7091-1526-8","apa":"Zažímalová, E., Petrášek, J., & Benková, E. (Eds.). (2014). Auxin and Its Role in Plant Development (1st ed.). Vienna: Springer Nature. https://doi.org/10.1007/978-3-7091-1526-8","chicago":"Zažímalová, Eva, Jan Petrášek, and Eva Benková, eds. Auxin and Its Role in Plant Development. 1st ed. Vienna: Springer Nature, 2014. https://doi.org/10.1007/978-3-7091-1526-8.","ista":"Zažímalová E, Petrášek J, Benková E eds. 2014. Auxin and Its Role in Plant Development 1st ed., Vienna: Springer Nature, 444p."},"editor":[{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739"}],"department":[{"_id":"EvBe"}],"title":"Auxin and Its Role in Plant Development","article_processing_charge":"No","_id":"10811","status":"public","type":"book_editor"},{"publication_status":"published","publication_identifier":{"isbn":["9783642540127"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783642540134"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":8318,"abstract":[{"text":"We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL ∗ \\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL ∗ \\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \\X, provided processes cannot choose the directions for sending or receiving the token.\r\nWe unify and substantially extend these results by systematically exploring fragments of indexed CTL ∗ \\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1311.4425"}],"alternative_title":["LNCS"],"scopus_import":"1","intvolume":" 8318","month":"01","date_updated":"2022-05-17T08:36:01Z","department":[{"_id":"KrCh"}],"_id":"10884","conference":{"start_date":"2014-01-19","location":"San Diego, CA, United States","end_date":"2014-01-21","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation"},"type":"conference","status":"public","year":"2014","publication":"Verification, Model Checking, and Abstract Interpretation","day":"30","page":"262-281","date_created":"2022-03-18T13:01:22Z","date_published":"2014-01-30T00:00:00Z","doi":"10.1007/978-3-642-54013-4_15","acknowledgement":"This work was supported by the Austrian Science Fund through grant P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23); ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants PROSEED, ICT12-059, and VRG11-005.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","citation":{"chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.","ista":"Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281.","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.","apa":"Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1311.4425"]},"article_processing_charge":"No","author":[{"full_name":"Aminof, Benjamin","last_name":"Aminof","first_name":"Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Swen","last_name":"Jacobs","full_name":"Jacobs, Swen"},{"first_name":"Ayrat","full_name":"Khalimov, Ayrat","last_name":"Khalimov"},{"first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","last_name":"Rubin","full_name":"Rubin, Sasha"}],"title":"Parameterized model checking of token-passing systems","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}]},{"date_published":"2014-03-19T00:00:00Z","doi":"10.1007/978-3-319-04099-8_4","date_created":"2022-03-21T07:11:23Z","page":"55-69","day":"19","publication":"Topological Methods in Data Analysis and Visualization III ","year":"2014","publisher":"Springer","quality_controlled":"1","acknowledgement":"First, we thank the reviewers of this paper for their ideas and critical comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions. This research is supported by the European Commission under the TOPOSYS project FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the European Science Foundation under the ACAT Research Network Program.","title":"Toward the extraction of saddle periodic orbits","editor":[{"full_name":"Bremer, Peer-Timo","last_name":"Bremer","first_name":"Peer-Timo"},{"last_name":"Hotz","full_name":"Hotz, Ingrid","first_name":"Ingrid"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"},{"first_name":"Ronald","full_name":"Peikert, Ronald","last_name":"Peikert"}],"author":[{"full_name":"Kasten, Jens","last_name":"Kasten","first_name":"Jens"},{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Reininghaus, Jan","last_name":"Reininghaus"},{"last_name":"Reich","full_name":"Reich, Wieland","first_name":"Wieland"},{"last_name":"Scheuermann","full_name":"Scheuermann, Gerik","first_name":"Gerik"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:10.1007/978-3-319-04099-8_4.","ama":"Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological Methods in Data Analysis and Visualization III . Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:10.1007/978-3-319-04099-8_4","apa":"Kasten, J., Reininghaus, J., Reich, W., & Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (Vol. 1, pp. 55–69). Cham: Springer. https://doi.org/10.1007/978-3-319-04099-8_4","short":"J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III , Springer, Cham, 2014, pp. 55–69.","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in Topological Methods in Data Analysis and Visualization III , vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_4.","ista":"Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69."},"project":[{"name":"Topological Complex Systems","grant_number":"318493","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"volume":1,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2197-666X"],"isbn":["9783319040981"],"issn":["1612-3786"],"eisbn":["9783319040998"]},"publication_status":"published","month":"03","place":"Cham","intvolume":" 1","scopus_import":"1","oa_version":"None","abstract":[{"text":"Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data.","lang":"eng"}],"department":[{"_id":"HeEd"}],"date_updated":"2022-06-21T12:01:47Z","status":"public","type":"book_chapter","series_title":"Mathematics and Visualization","_id":"10893"}]