[{"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. The motivation is that several classical textbook algorithms have quite efficient expected-runtime complexity, whereas the corresponding worst-case bounds are either inefficient (e.g., Quick-Sort), or completely ineffective (e.g., Coupon-Collector). Since the main focus of expected-runtime analysis is to obtain efficient bounds, we consider bounds that are either logarithmic, linear or almost-linear (O(log n), O(n), O(n · log n), respectively, where n represents the input size). Our main contribution is an efficient (simple linear-time algorithm) sound approach for deriving such expected-runtime bounds for the analysis of recurrence relations induced by randomized algorithms. The experimental results show that our approach can efficiently derive asymptotically optimal expected-runtime bounds for recurrences of classical randomized algorithms, including Randomized-Search, Quick-Sort, Quick-Select, Coupon-Collector, where the worst-case bounds are either inefficient (such as linear as compared to logarithmic expected-runtime complexity, or quadratic as compared to linear or almost-linear expected-runtime complexity), or ineffective."}],"_id":"628","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","intvolume":" 10426","title":"Automated recurrence analysis for almost linear expected runtime bounds","status":"public","oa_version":"Submitted Version","scopus_import":1,"day":"01","citation":{"ista":"Chatterjee K, Fu H, Murhekar A. 2017. Automated recurrence analysis for almost linear expected runtime bounds. CAV: Computer Aided Verification, LNCS, vol. 10426, 118–139.","apa":"Chatterjee, K., Fu, H., & Murhekar, A. (2017). Automated recurrence analysis for almost linear expected runtime bounds. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 118–139). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_6","ieee":"K. Chatterjee, H. Fu, and A. Murhekar, “Automated recurrence analysis for almost linear expected runtime bounds,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 118–139.","ama":"Chatterjee K, Fu H, Murhekar A. Automated recurrence analysis for almost linear expected runtime bounds. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:118-139. doi:10.1007/978-3-319-63387-9_6","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.","mla":"Chatterjee, Krishnendu, et al. Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 118–39, doi:10.1007/978-3-319-63387-9_6.","short":"K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139."},"page":"118 - 139","date_published":"2017-01-01T00:00:00Z","publist_id":"7166","ec_funded":1,"year":"2017","publisher":"Springer","editor":[{"last_name":"Majumdar","first_name":"Rupak","full_name":"Majumdar, Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"last_name":"Murhekar","first_name":"Aniket","full_name":"Murhekar, Aniket"}],"volume":10426,"date_updated":"2021-01-12T08:06:55Z","date_created":"2018-12-11T11:47:35Z","publication_identifier":{"isbn":["978-331963386-2"]},"month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1705.00314","open_access":"1"}],"oa":1,"project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1007/978-3-319-63387-9_6","conference":{"start_date":"2017-07-24","location":"Heidelberg, Germany","end_date":"2017-07-28","name":"CAV: Computer Aided Verification"},"language":[{"iso":"eng"}]},{"day":"13","series_title":"Sub-Cellular Biochemistry","scopus_import":1,"date_published":"2017-05-13T00:00:00Z","page":"419 - 444","citation":{"short":"M. Loose, K. Zieske, P. Schwille, in:, Prokaryotic Cytoskeletons, Springer, 2017, pp. 419–444.","mla":"Loose, Martin, et al. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” Prokaryotic Cytoskeletons, vol. 84, Springer, 2017, pp. 419–44, doi:10.1007/978-3-319-53047-5_15.","chicago":"Loose, Martin, Katja Zieske, and Petra Schwille. “Reconstitution of Protein Dynamics Involved in Bacterial Cell Division.” In Prokaryotic Cytoskeletons, 84:419–44. Sub-Cellular Biochemistry. Springer, 2017. https://doi.org/10.1007/978-3-319-53047-5_15.","ama":"Loose M, Zieske K, Schwille P. Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. Vol 84. Sub-Cellular Biochemistry. Springer; 2017:419-444. doi:10.1007/978-3-319-53047-5_15","ieee":"M. Loose, K. Zieske, and P. Schwille, “Reconstitution of protein dynamics involved in bacterial cell division,” in Prokaryotic Cytoskeletons, vol. 84, Springer, 2017, pp. 419–444.","apa":"Loose, M., Zieske, K., & Schwille, P. (2017). Reconstitution of protein dynamics involved in bacterial cell division. In Prokaryotic Cytoskeletons (Vol. 84, pp. 419–444). Springer. https://doi.org/10.1007/978-3-319-53047-5_15","ista":"Loose M, Zieske K, Schwille P. 2017.Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. vol. 84, 419–444."},"publication":"Prokaryotic Cytoskeletons","abstract":[{"lang":"eng","text":"Even simple cells like bacteria have precisely regulated cellular anatomies, which allow them to grow, divide and to respond to internal or external cues with high fidelity. How spatial and temporal intracellular organization in prokaryotic cells is achieved and maintained on the basis of locally interacting proteins still remains largely a mystery. Bulk biochemical assays with purified components and in vivo experiments help us to approach key cellular processes from two opposite ends, in terms of minimal and maximal complexity. However, to understand how cellular phenomena emerge, that are more than the sum of their parts, we have to assemble cellular subsystems step by step from the bottom up. Here, we review recent in vitro reconstitution experiments with proteins of the bacterial cell division machinery and illustrate how they help to shed light on fundamental cellular mechanisms that constitute spatiotemporal order and regulate cell division."}],"type":"book_chapter","oa_version":"None","intvolume":" 84","title":"Reconstitution of protein dynamics involved in bacterial cell division","status":"public","_id":"629","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"eisbn":["978-3-319-53047-5"]},"month":"05","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-53047-5_15","quality_controlled":"1","external_id":{"pmid":["28500535"]},"publist_id":"7165","volume":84,"date_updated":"2021-01-12T08:06:57Z","date_created":"2018-12-11T11:47:35Z","author":[{"full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","first_name":"Martin"},{"full_name":"Zieske, Katja","first_name":"Katja","last_name":"Zieske"},{"full_name":"Schwille, Petra","first_name":"Petra","last_name":"Schwille"}],"publisher":"Springer","department":[{"_id":"MaLo"}],"publication_status":"published","pmid":1,"year":"2017"},{"date_published":"2017-01-01T00:00:00Z","page":"356 - 362","citation":{"chicago":"Sauermann, Stefan, Veronika David, Alois Schlögl, Reinhard Egelkraut, Matthias Frohner, Birgit Pohn, Philipp Urbauer, and Alexander Mense. “Biosignals Standards and FHIR: The Way to Go,” 236:356–62. IOS Press, 2017. https://doi.org/10.3233/978-1-61499-759-7-356.","short":"S. Sauermann, V. David, A. Schlögl, R. Egelkraut, M. Frohner, B. Pohn, P. Urbauer, A. Mense, in:, IOS Press, 2017, pp. 356–362.","mla":"Sauermann, Stefan, et al. Biosignals Standards and FHIR: The Way to Go. Vol. 236, IOS Press, 2017, pp. 356–62, doi:10.3233/978-1-61499-759-7-356.","apa":"Sauermann, S., David, V., Schlögl, A., Egelkraut, R., Frohner, M., Pohn, B., … Mense, A. (2017). Biosignals standards and FHIR: The way to go (Vol. 236, pp. 356–362). Presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria: IOS Press. https://doi.org/10.3233/978-1-61499-759-7-356","ieee":"S. Sauermann et al., “Biosignals standards and FHIR: The way to go,” presented at the eHealth: Health Informatics Meets eHealth, Vienna, Austria, 2017, vol. 236, pp. 356–362.","ista":"Sauermann S, David V, Schlögl A, Egelkraut R, Frohner M, Pohn B, Urbauer P, Mense A. 2017. Biosignals standards and FHIR: The way to go. eHealth: Health Informatics Meets eHealth, Studies in Health Technology and Informatics, vol. 236, 356–362.","ama":"Sauermann S, David V, Schlögl A, et al. Biosignals standards and FHIR: The way to go. In: Vol 236. IOS Press; 2017:356-362. doi:10.3233/978-1-61499-759-7-356"},"day":"01","has_accepted_license":"1","scopus_import":1,"oa_version":"Published Version","file":[{"file_size":443635,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-906-v1+1_SHTI236-0356.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:27Z","date_created":"2018-12-12T10:11:56Z","checksum":"1254dcc5b04a996d97fad9a726b42727","relation":"main_file","file_id":"4913"}],"pubrep_id":"906","status":"public","ddc":["005"],"title":"Biosignals standards and FHIR: The way to go","intvolume":" 236","_id":"630","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Background: Standards have become available to share semantically encoded vital parameters from medical devices, as required for example by personal healthcare records. Standardised sharing of biosignal data largely remains open. Objectives: The goal of this work is to explore available biosignal file format and data exchange standards and profiles, and to conceptualise end-To-end solutions. Methods: The authors reviewed and discussed available biosignal file format standards with other members of international standards development organisations (SDOs). Results: A raw concept for standards based acquisition, storage, archiving and sharing of biosignals was developed. The GDF format may serve for storing biosignals. Signals can then be shared using FHIR resources and may be stored on FHIR servers or in DICOM archives, with DICOM waveforms as one possible format. Conclusion: Currently a group of international SDOs (e.g. HL7, IHE, DICOM, IEEE) is engaged in intensive discussions. This discussion extends existing work that already was adopted by large implementer communities. The concept presented here only reports the current status of the discussion in Austria. The discussion will continue internationally, with results to be expected over the coming years."}],"alternative_title":["Studies in Health Technology and Informatics"],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"eHealth: Health Informatics Meets eHealth","location":"Vienna, Austria","start_date":"2017-05-23","end_date":"2017-05-24"},"doi":"10.3233/978-1-61499-759-7-356","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"month":"01","publication_identifier":{"isbn":["978-161499758-0"]},"date_updated":"2021-01-12T08:06:59Z","date_created":"2018-12-11T11:47:36Z","volume":236,"author":[{"last_name":"Sauermann","first_name":"Stefan","full_name":"Sauermann, Stefan"},{"full_name":"David, Veronika","first_name":"Veronika","last_name":"David"},{"first_name":"Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois"},{"first_name":"Reinhard","last_name":"Egelkraut","full_name":"Egelkraut, Reinhard"},{"first_name":"Matthias","last_name":"Frohner","full_name":"Frohner, Matthias"},{"last_name":"Pohn","first_name":"Birgit","full_name":"Pohn, Birgit"},{"last_name":"Urbauer","first_name":"Philipp","full_name":"Urbauer, Philipp"},{"full_name":"Mense, Alexander","first_name":"Alexander","last_name":"Mense"}],"publication_status":"published","publisher":"IOS Press","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"year":"2017","file_date_updated":"2020-07-14T12:47:27Z","publist_id":"7164"},{"citation":{"chicago":"Lewin, Mathieu, Phan Nam, and Nicolas Rougerie. “A Note on 2D Focusing Many Boson Systems.” Proceedings of the American Mathematical Society. American Mathematical Society, 2017. https://doi.org/10.1090/proc/13468.","short":"M. Lewin, P. Nam, N. Rougerie, Proceedings of the American Mathematical Society 145 (2017) 2441–2454.","mla":"Lewin, Mathieu, et al. “A Note on 2D Focusing Many Boson Systems.” Proceedings of the American Mathematical Society, vol. 145, no. 6, American Mathematical Society, 2017, pp. 2441–54, doi:10.1090/proc/13468.","apa":"Lewin, M., Nam, P., & Rougerie, N. (2017). A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/13468","ieee":"M. Lewin, P. Nam, and N. Rougerie, “A note on 2D focusing many boson systems,” Proceedings of the American Mathematical Society, vol. 145, no. 6. American Mathematical Society, pp. 2441–2454, 2017.","ista":"Lewin M, Nam P, Rougerie N. 2017. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 145(6), 2441–2454.","ama":"Lewin M, Nam P, Rougerie N. A note on 2D focusing many boson systems. Proceedings of the American Mathematical Society. 2017;145(6):2441-2454. doi:10.1090/proc/13468"},"publication":"Proceedings of the American Mathematical Society","page":"2441 - 2454","date_published":"2017-01-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"632","intvolume":" 145","status":"public","title":"A note on 2D focusing many boson systems","oa_version":"Submitted Version","type":"journal_article","issue":"6","abstract":[{"text":"We consider a 2D quantum system of N bosons in a trapping potential |x|s, interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all 0 < β < (s + 1)/(s + 2), the leading order behavior of ground states of the many-body system is described in the large N limit by the corresponding cubic nonlinear Schrödinger energy functional. Our result covers the focusing case (w < 0) where even the stability of the many-body system is not obvious. This answers an open question mentioned by X. Chen and J. Holmer for harmonic traps (s = 2). Together with the BBGKY hierarchy approach used by these authors, our result implies the convergence of the many-body quantum dynamics to the focusing NLS equation with harmonic trap for all 0 < β < 3/4. ","lang":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.09045"}],"project":[{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","doi":"10.1090/proc/13468","language":[{"iso":"eng"}],"month":"01","year":"2017","department":[{"_id":"RoSe"}],"publisher":"American Mathematical Society","publication_status":"published","author":[{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan"},{"full_name":"Rougerie, Nicolas","last_name":"Rougerie","first_name":"Nicolas"}],"volume":145,"date_created":"2018-12-11T11:47:36Z","date_updated":"2021-01-12T08:07:03Z","ec_funded":1,"publist_id":"7160"},{"date_published":"2017-05-28T00:00:00Z","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","citation":{"ieee":"J. Schroeder, E. Deliu, G. Novarino, and M. Schmeisser, “Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder,” in Translational Anatomy and Cell Biology of Autism Spectrum Disorder, vol. 224, M. Schmeisser and T. Boekers, Eds. Springer, 2017, pp. 189–211.","apa":"Schroeder, J., Deliu, E., Novarino, G., & Schmeisser, M. (2017). Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 189–211). Springer. https://doi.org/10.1007/978-3-319-52498-6_10","ista":"Schroeder J, Deliu E, Novarino G, Schmeisser M. 2017.Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 189–211.","ama":"Schroeder J, Deliu E, Novarino G, Schmeisser M. Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder. In: Schmeisser M, Boekers T, eds. Translational Anatomy and Cell Biology of Autism Spectrum Disorder. Vol 224. Advances in Anatomy Embryology and Cell Biology. Springer; 2017:189-211. doi:10.1007/978-3-319-52498-6_10","chicago":"Schroeder, Jan, Elena Deliu, Gaia Novarino, and Michael Schmeisser. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, 224:189–211. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_10.","short":"J. Schroeder, E. Deliu, G. Novarino, M. Schmeisser, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 189–211.","mla":"Schroeder, Jan, et al. “Genetic and Pharmacological Reversibility of Phenotypes in Mouse Models of Autism Spectrum Disorder.” Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, vol. 224, Springer, 2017, pp. 189–211, doi:10.1007/978-3-319-52498-6_10."},"page":"189 - 211","day":"28","scopus_import":1,"series_title":"Advances in Anatomy Embryology and Cell Biology","oa_version":"None","_id":"634","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder","status":"public","intvolume":" 224","abstract":[{"lang":"eng","text":"As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental condition, long-time consensus was that its hallmark features are irreversible. However, several studies from recent years using defined mouse models of ASD have provided clear evidence that in mice neurobiological and behavioural alterations can be ameliorated or even reversed by genetic restoration or pharmacological treatment either before or after symptom onset. Here, we review findings on genetic and pharmacological reversibility of phenotypes in mouse models of ASD. Our review should give a comprehensive overview on both aspects and encourage future studies to better understand the underlying molecular mechanisms that might be translatable from animals to humans."}],"type":"book_chapter","alternative_title":["ADVSANAT"],"doi":"10.1007/978-3-319-52498-6_10","language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"grant_number":"F03523","_id":"25473368-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Transmembrane Transporters in Health and Disease"}],"month":"05","publication_identifier":{"eisbn":["978-3-319-52498-6"]},"author":[{"full_name":"Schroeder, Jan","last_name":"Schroeder","first_name":"Jan"},{"orcid":"0000-0002-7370-5293","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","last_name":"Deliu","first_name":"Elena","full_name":"Deliu, Elena"},{"full_name":"Novarino, Gaia","first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178"},{"full_name":"Schmeisser, Michael","last_name":"Schmeisser","first_name":"Michael"}],"date_updated":"2021-01-12T08:07:08Z","date_created":"2018-12-11T11:47:37Z","volume":224,"year":"2017","publication_status":"published","publisher":"Springer","department":[{"_id":"GaNo"}],"editor":[{"full_name":"Schmeisser, Michael","last_name":"Schmeisser","first_name":"Michael"},{"last_name":"Boekers","first_name":"Tobias","full_name":"Boekers, Tobias"}],"publist_id":"7156"},{"abstract":[{"text":"A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","intvolume":" 10381","title":"Challenges and tool implementation of hybrid rapidly exploring random trees","status":"public","_id":"633","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","scopus_import":1,"date_published":"2017-01-01T00:00:00Z","page":"83 - 89","citation":{"ista":"Bak S, Bogomolov S, Henzinger TA, Kumar A. 2017. Challenges and tool implementation of hybrid rapidly exploring random trees. NSV: Numerical Software Verification, LNCS, vol. 10381, 83–89.","apa":"Bak, S., Bogomolov, S., Henzinger, T. A., & Kumar, A. (2017). Challenges and tool implementation of hybrid rapidly exploring random trees. In A. Abate & S. Bodo (Eds.) (Vol. 10381, pp. 83–89). Presented at the NSV: Numerical Software Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63501-9_6","ieee":"S. Bak, S. Bogomolov, T. A. Henzinger, and A. Kumar, “Challenges and tool implementation of hybrid rapidly exploring random trees,” presented at the NSV: Numerical Software Verification, Heidelberg, Germany, 2017, vol. 10381, pp. 83–89.","ama":"Bak S, Bogomolov S, Henzinger TA, Kumar A. Challenges and tool implementation of hybrid rapidly exploring random trees. In: Abate A, Bodo S, eds. Vol 10381. Springer; 2017:83-89. doi:10.1007/978-3-319-63501-9_6","chicago":"Bak, Stanley, Sergiy Bogomolov, Thomas A Henzinger, and Aviral Kumar. “Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees.” edited by Alessandro Abate and Sylvie Bodo, 10381:83–89. Springer, 2017. https://doi.org/10.1007/978-3-319-63501-9_6.","mla":"Bak, Stanley, et al. Challenges and Tool Implementation of Hybrid Rapidly Exploring Random Trees. Edited by Alessandro Abate and Sylvie Bodo, vol. 10381, Springer, 2017, pp. 83–89, doi:10.1007/978-3-319-63501-9_6.","short":"S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, pp. 83–89."},"publist_id":"7159","volume":10381,"date_updated":"2021-01-12T08:07:06Z","date_created":"2018-12-11T11:47:37Z","author":[{"first_name":"Stanley","last_name":"Bak","full_name":"Bak, Stanley"},{"first_name":"Sergiy","last_name":"Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"first_name":"Aviral","last_name":"Kumar","full_name":"Kumar, Aviral"}],"publisher":"Springer","department":[{"_id":"ToHe"}],"editor":[{"full_name":"Abate, Alessandro","first_name":"Alessandro","last_name":"Abate"},{"last_name":"Bodo","first_name":"Sylvie","full_name":"Bodo, Sylvie"}],"publication_status":"published","year":"2017","publication_identifier":{"isbn":["978-331963500-2"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-63501-9_6","conference":{"name":"NSV: Numerical Software Verification","end_date":"2017-07-23","location":"Heidelberg, Germany","start_date":"2017-07-22"},"project":[{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1"},{"month":"01","publication_identifier":{"isbn":["978-331956616-0"]},"quality_controlled":"1","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/989"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2017-05-04","location":"Paris, France","start_date":"2017-04-30"},"doi":"10.1007/978-3-319-56617-7_2","ec_funded":1,"publist_id":"7154","publication_status":"published","publisher":"Springer","editor":[{"last_name":"Coron","first_name":"Jean-Sébastien","full_name":"Coron, Jean-Sébastien"},{"full_name":"Buus Nielsen, Jesper","last_name":"Buus Nielsen","first_name":"Jesper"}],"department":[{"_id":"KrPi"}],"year":"2017","date_updated":"2021-01-12T08:07:10Z","date_created":"2018-12-11T11:47:37Z","volume":10212,"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F"},{"full_name":"Chen, Binchi","last_name":"Chen","first_name":"Binchi"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Reyzin, Leonid","last_name":"Reyzin","first_name":"Leonid"},{"full_name":"Tessaro, Stefano","last_name":"Tessaro","first_name":"Stefano"}],"scopus_import":1,"day":"01","page":"33 - 62","citation":{"apa":"Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., & Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_2","ieee":"J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.","ista":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 33–62.","ama":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:10.1007/978-3-319-56617-7_2","chicago":"Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_2.","short":"J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.","mla":"Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2."},"date_published":"2017-01-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries.","lang":"eng"}],"title":"Scrypt is maximally memory hard","status":"public","intvolume":" 10212","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"635","oa_version":"Submitted Version"},{"day":"03","scopus_import":1,"date_published":"2017-08-03T00:00:00Z","citation":{"short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","mla":"Bakhirkin, Alexey, et al. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:10.1007/978-3-319-65765-3_11.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_11.","ama":"Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:10.1007/978-3-319-65765-3_11","apa":"Bakhirkin, A., Ferrere, T., Maler, O., & Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate & G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_11","ieee":"A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.","ista":"Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206."},"page":"189 - 206","abstract":[{"text":"Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"636","intvolume":" 10419","title":"On the quantitative semantics of regular expressions over real-valued signals","status":"public","publication_identifier":{"isbn":["978-331965764-6"]},"month":"08","doi":"10.1007/978-3-319-65765-3_11","conference":{"location":"Berlin, Germany","start_date":"2017-09-05","end_date":"2017-09-07","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01552132","open_access":"1"}],"oa":1,"project":[{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","publist_id":"7152","author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"first_name":"Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"full_name":"Ulus, Dogan","last_name":"Ulus","first_name":"Dogan"}],"volume":10419,"date_created":"2018-12-11T11:47:38Z","date_updated":"2021-01-12T08:07:14Z","year":"2017","editor":[{"full_name":"Abate, Alessandro","first_name":"Alessandro","last_name":"Abate"},{"full_name":"Geeraerts, Gilles","first_name":"Gilles","last_name":"Geeraerts"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published"},{"language":[{"iso":"eng"}],"conference":{"name":"NSV: Numerical Software Verification","start_date":"2016-07-17","location":"Toronto, ON, Canada","end_date":"2016-07-18"},"date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-54292-8","quality_controlled":"1","citation":{"ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., Numerical Software Verification, vol. 10152. Springer, 2017.","apa":"Bogomolov, S., Martel, M., & Prabhakar, P. (Eds.). (2017). Numerical Software Verification (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. https://doi.org/10.1007/978-3-319-54292-8","ama":"Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification. Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8","chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. Numerical Software Verification. Vol. 10152. LNCS. Springer, 2017. https://doi.org/10.1007/978-3-319-54292-8.","mla":"Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8.","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017."},"month":"01","day":"01","publication_identifier":{"issn":["0302-9743"],"eisbn":["978-3-319-54292-8"]},"article_processing_charge":"No","series_title":"LNCS","date_updated":"2022-05-24T07:09:52Z","date_created":"2018-12-11T11:47:38Z","oa_version":"None","volume":10152,"status":"public","publication_status":"published","title":"Numerical Software Verification","intvolume":" 10152","editor":[{"full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy"},{"full_name":"Martel, Matthieu","last_name":"Martel","first_name":"Matthieu"},{"full_name":"Prabhakar, Pavithra","last_name":"Prabhakar","first_name":"Pavithra"}],"department":[{"_id":"ToHe"}],"publisher":"Springer","_id":"638","year":"2017","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability."}],"publist_id":"7150","type":"conference_editor"},{"conference":{"end_date":"2017-05-04","start_date":"2017-04-30","location":"Paris, France","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"doi":"10.1007/978-3-319-56617-7_1","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/875"}],"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"month":"04","publication_identifier":{"isbn":["978-331956616-0"]},"author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Blocki, Jeremiah","first_name":"Jeremiah","last_name":"Blocki"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T08:07:22Z","date_created":"2018-12-11T11:47:39Z","volume":10212,"year":"2017","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"editor":[{"last_name":"Coron","first_name":"Jean-Sébastien","full_name":"Coron, Jean-Sébastien"},{"first_name":"Jesper","last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper"}],"publist_id":"7148","ec_funded":1,"date_published":"2017-04-01T00:00:00Z","citation":{"chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_1.","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.","mla":"Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.","apa":"Alwen, J. F., Blocki, J., & Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron & J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. https://doi.org/10.1007/978-3-319-56617-7_1","ista":"Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32.","ama":"Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:10.1007/978-3-319-56617-7_1"},"page":"3 - 32","day":"01","scopus_import":1,"oa_version":"Submitted Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"640","status":"public","title":"Depth-robust graphs and their cumulative memory complexity","intvolume":" 10212","abstract":[{"text":"Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"scopus_import":1,"day":"01","month":"01","publication_identifier":{"isbn":["978-331958770-7"]},"citation":{"chicago":"Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_26.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","mla":"Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.","ieee":"V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.","apa":"Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_26","ista":"Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.","ama":"Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26"},"quality_controlled":"1","page":"323 - 334","conference":{"start_date":"2017-06-04","location":"Kolding, Denmark","end_date":"2017-06-08","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-58771-4_26","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches."}],"publist_id":"7147","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"641","year":"2017","status":"public","publication_status":"published","title":"Graphical model parameter learning by inverse linear programming","publisher":"Springer","editor":[{"full_name":"Lauze, François","last_name":"Lauze","first_name":"François"},{"full_name":"Dong, Yiqiu","last_name":"Dong","first_name":"Yiqiu"},{"full_name":"Bjorholm Dahl, Anders","first_name":"Anders","last_name":"Bjorholm Dahl"}],"intvolume":" 10302","department":[{"_id":"VlKo"}],"author":[{"first_name":"Vera","last_name":"Trajkovska","full_name":"Trajkovska, Vera"},{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul","full_name":"Swoboda, Paul"},{"full_name":"Åström, Freddie","first_name":"Freddie","last_name":"Åström"},{"full_name":"Petra, Stefanie","first_name":"Stefanie","last_name":"Petra"}],"date_created":"2018-12-11T11:47:39Z","date_updated":"2021-01-12T08:07:23Z","volume":10302,"oa_version":"None"},{"language":[{"iso":"eng"}],"date_published":"2017-08-04T00:00:00Z","doi":"10.15479/AT:IST-2018-853-v2-2","page":"28","oa":1,"citation":{"apa":"Henzinger, T. A., Kragl, B., & Qadeer, S. (2017). Synchronizing the asynchronous. IST Austria. https://doi.org/10.15479/AT:IST-2018-853-v2-2","ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, Synchronizing the asynchronous. IST Austria, 2017.","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","ama":"Henzinger TA, Kragl B, Qadeer S. Synchronizing the Asynchronous. IST Austria; 2017. doi:10.15479/AT:IST-2018-853-v2-2","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. Synchronizing the Asynchronous. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2018-853-v2-2.","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","mla":"Henzinger, Thomas A., et al. Synchronizing the Asynchronous. IST Austria, 2017, doi:10.15479/AT:IST-2018-853-v2-2."},"day":"04","month":"08","has_accepted_license":"1","publication_identifier":{"issn":["2664-1690"]},"date_created":"2019-05-13T08:15:55Z","date_updated":"2023-02-21T16:59:21Z","oa_version":"Published Version","file":[{"creator":"dernst","file_size":971347,"content_type":"application/pdf","access_level":"open_access","file_name":"main(1).pdf","checksum":"b48d42725182d7ca10107a118815f4cf","date_created":"2019-05-13T08:14:44Z","date_updated":"2020-07-14T12:47:30Z","file_id":"6431","relation":"main_file"}],"author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","last_name":"Kragl","first_name":"Bernhard","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"133"}]},"status":"public","publication_status":"published","ddc":["000"],"title":"Synchronizing the asynchronous","department":[{"_id":"ToHe"}],"publisher":"IST Austria","year":"2017","_id":"6426","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.","lang":"eng"}],"file_date_updated":"2020-07-14T12:47:30Z","alternative_title":["IST Austria Technical Report"],"type":"technical_report"},{"publist_id":"7142","volume":60,"date_created":"2018-12-11T11:47:40Z","date_updated":"2021-01-12T08:07:28Z","author":[{"full_name":"Sun, Wuping","first_name":"Wuping","last_name":"Sun"},{"full_name":"Zhai, Ming-Zhu","first_name":"Ming-Zhu","last_name":"Zhai","id":"34009CFA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zhou, Qian","last_name":"Zhou","first_name":"Qian"},{"full_name":"Qian, Chengrui","last_name":"Qian","first_name":"Chengrui"},{"first_name":"Changyu","last_name":"Jiang","full_name":"Jiang, Changyu"}],"department":[{"_id":"RySh"}],"publisher":"Chinese Physiological Society","publication_status":"published","pmid":1,"year":"2017","publication_identifier":{"issn":["03044920"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.4077/CJP.2017.BAF469","quality_controlled":"1","external_id":{"pmid":["28847140"]},"issue":"4","abstract":[{"lang":"eng","text":"It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance."}],"type":"journal_article","oa_version":"Published Version","intvolume":" 60","ddc":["570"],"title":"Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"643","article_processing_charge":"No","day":"31","scopus_import":1,"date_published":"2017-08-31T00:00:00Z","page":"207 - 214","article_type":"original","citation":{"ista":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. 2017. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 60(4), 207–214.","apa":"Sun, W., Zhai, M.-Z., Zhou, Q., Qian, C., & Jiang, C. (2017). Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. Chinese Physiological Society. https://doi.org/10.4077/CJP.2017.BAF469","ieee":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, and C. Jiang, “Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats,” Chinese Journal of Physiology, vol. 60, no. 4. Chinese Physiological Society, pp. 207–214, 2017.","ama":"Sun W, Zhai M-Z, Zhou Q, Qian C, Jiang C. Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats. Chinese Journal of Physiology. 2017;60(4):207-214. doi:10.4077/CJP.2017.BAF469","chicago":"Sun, Wuping, Ming-Zhu Zhai, Qian Zhou, Chengrui Qian, and Changyu Jiang. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology. Chinese Physiological Society, 2017. https://doi.org/10.4077/CJP.2017.BAF469.","mla":"Sun, Wuping, et al. “Effects of B Vitamins Overload on Plasma Insulin Level and Hydrogen Peroxide Generation in Rats.” Chinese Journal of Physiology, vol. 60, no. 4, Chinese Physiological Society, 2017, pp. 207–14, doi:10.4077/CJP.2017.BAF469.","short":"W. Sun, M.-Z. Zhai, Q. Zhou, C. Qian, C. Jiang, Chinese Journal of Physiology 60 (2017) 207–214."},"publication":"Chinese Journal of Physiology"},{"oa_version":"Submitted Version","title":"Localization errors in solving stochastic partial differential equations in the whole space","status":"public","intvolume":" 86","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"642","abstract":[{"text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable.","lang":"eng"}],"issue":"307","type":"journal_article","date_published":"2017-01-01T00:00:00Z","page":"2373 - 2397","publication":"Mathematics of Computation","citation":{"ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 2017;86(307):2373-2397. doi:10.1090/mcom/3201","apa":"Gerencser, M., & Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. American Mathematical Society. https://doi.org/10.1090/mcom/3201","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” Mathematics of Computation, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017.","ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.","mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:10.1090/mcom/3201.","chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” Mathematics of Computation. American Mathematical Society, 2017. https://doi.org/10.1090/mcom/3201."},"day":"01","scopus_import":1,"date_updated":"2021-01-12T08:07:26Z","date_created":"2018-12-11T11:47:40Z","volume":86,"author":[{"full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate","last_name":"Gerencser"},{"full_name":"Gyöngy, István","last_name":"Gyöngy","first_name":"István"}],"publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"American Mathematical Society","year":"2017","publist_id":"7144","language":[{"iso":"eng"}],"doi":"10.1090/mcom/3201","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.05535"}],"month":"01","publication_identifier":{"issn":["00255718"]}},{"date_published":"2017-07-13T00:00:00Z","page":"201 - 221","citation":{"ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:10.1007/978-3-319-63387-9_10","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., & Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar & V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. https://doi.org/10.1007/978-3-319-63387-9_10","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","mla":"Ashok, Pranav, et al. Value Iteration for Long Run Average Reward in Markov Decision Processes. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:10.1007/978-3-319-63387-9_10.","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10."},"day":"13","scopus_import":1,"oa_version":"Submitted Version","intvolume":" 10426","status":"public","title":"Value iteration for long run average reward in markov decision processes","_id":"645","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks."}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-63387-9_10","conference":{"name":"CAV: Computer Aided Verification","location":"Heidelberg, Germany","start_date":"2017-07-24","end_date":"2017-07-28"},"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"oa":1,"publication_identifier":{"isbn":["978-331963386-2"]},"month":"07","volume":10426,"date_created":"2018-12-11T11:47:41Z","date_updated":"2021-01-12T08:07:32Z","author":[{"last_name":"Ashok","first_name":"Pranav","full_name":"Ashok, Pranav"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan"},{"first_name":"Tobias","last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias"}],"publisher":"Springer","department":[{"_id":"KrCh"}],"editor":[{"first_name":"Rupak","last_name":"Majumdar","full_name":"Majumdar, Rupak"},{"full_name":"Kunčak, Viktor","first_name":"Viktor","last_name":"Kunčak"}],"publication_status":"published","year":"2017","publist_id":"7135","ec_funded":1},{"scopus_import":1,"day":"29","page":"1087 - 1110","publication":"SIAM Journal on Computing","citation":{"chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing. SIAM, 2017. https://doi.org/10.1137/16M1091836.","mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.","apa":"Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” SIAM Journal on Computing, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017.","ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836"},"date_published":"2017-06-29T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs."}],"issue":"3","title":"The complexity of general-valued CSPs","status":"public","intvolume":" 46","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"644","oa_version":"Preprint","month":"06","quality_controlled":"1","project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160"}],"main_file_link":[{"url":"https://arxiv.org/abs/1502.07327","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1137/16M1091836","publist_id":"7138","ec_funded":1,"publication_status":"published","publisher":"SIAM","department":[{"_id":"VlKo"}],"year":"2017","date_updated":"2023-02-23T10:07:49Z","date_created":"2018-12-11T11:47:40Z","volume":46,"author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"full_name":"Krokhin, Andrei","last_name":"Krokhin","first_name":"Andrei"},{"full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rolinek"}],"related_material":{"record":[{"status":"public","relation":"other","id":"1637"}]}},{"abstract":[{"lang":"eng","text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version","status":"public","title":"A novel convex relaxation for non binary discrete tomography","intvolume":" 10302","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"646","day":"01","scopus_import":1,"date_published":"2017-06-01T00:00:00Z","page":"235 - 246","citation":{"mla":"Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.","short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. https://doi.org/10.1007/978-3-319-58771-4_19.","ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.","ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246.","apa":"Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19"},"publist_id":"7132","ec_funded":1,"date_created":"2018-12-11T11:47:41Z","date_updated":"2021-01-12T08:07:34Z","volume":10302,"author":[{"full_name":"Kuske, Jan","first_name":"Jan","last_name":"Kuske"},{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","first_name":"Paul","last_name":"Swoboda","full_name":"Swoboda, Paul"},{"full_name":"Petra, Stefanie","first_name":"Stefanie","last_name":"Petra"}],"publication_status":"published","publisher":"Springer","department":[{"_id":"VlKo"}],"editor":[{"full_name":"Lauze, François","last_name":"Lauze","first_name":"François"},{"first_name":"Yiqiu","last_name":"Dong","full_name":"Dong, Yiqiu"},{"last_name":"Bjorholm Dahl","first_name":"Anders","full_name":"Bjorholm Dahl, Anders"}],"year":"2017","month":"06","publication_identifier":{"isbn":["978-331958770-7"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2017-06-08","location":"Kolding, Denmark","start_date":"2017-06-04","name":"SSVM: Scale Space and Variational Methods in Computer Vision"},"doi":"10.1007/978-3-319-58771-4_19","quality_controlled":"1","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1703.03769","open_access":"1"}]},{"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/1186.pdf"}],"quality_controlled":"1","conference":{"start_date":"2017-04-20","location":"Bern, Switzerland","end_date":"2017-04-22","name":"TAMC: Theory and Applications of Models of Computation"},"doi":"10.1007/978-3-319-55911-7_43","language":[{"iso":"eng"}],"month":"04","publication_identifier":{"isbn":["978-331955910-0"]},"year":"2017","publication_status":"published","publisher":"Springer","editor":[{"full_name":"Jäger, Gerhard","first_name":"Gerhard","last_name":"Jäger"},{"full_name":"Steila, Silvia","last_name":"Steila","first_name":"Silvia"}],"department":[{"_id":"KrPi"}],"author":[{"last_name":"Skórski","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej"}],"date_updated":"2021-01-12T08:07:39Z","date_created":"2018-12-11T11:47:42Z","volume":10185,"publist_id":"7125","citation":{"ama":"Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:10.1007/978-3-319-55911-7_43","apa":"Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_43","ieee":"M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.","ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.","mla":"Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.","chicago":"Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43."},"page":"600 - 613","date_published":"2017-04-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"648","title":"On the complexity of breaking pseudoentropy","status":"public","intvolume":" 10185","oa_version":"Submitted Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method."}]},{"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-58002-9_5","publication_identifier":{"isbn":["978-3-319-58001-2"],"eissn":["978-3-319-58002-9"]},"month":"10","editor":[{"full_name":"Najman, Laurent","first_name":"Laurent","last_name":"Najman"},{"first_name":"Pascal","last_name":"Romon","full_name":"Romon, Pascal"}],"publisher":"Springer","department":[{"_id":"JaMa"}],"publication_status":"published","year":"2017","volume":2184,"date_updated":"2022-05-24T07:01:33Z","date_created":"2018-12-11T11:47:42Z","author":[{"orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","first_name":"Jan","full_name":"Maas, Jan"}],"publist_id":"7123","page":"159 - 174","citation":{"ama":"Maas J. Entropic Ricci curvature for discrete spaces. In: Najman L, Romon P, eds. Modern Approaches to Discrete Curvature. Vol 2184. Lecture Notes in Mathematics. Springer; 2017:159-174. doi:10.1007/978-3-319-58002-9_5","apa":"Maas, J. (2017). Entropic Ricci curvature for discrete spaces. In L. Najman & P. Romon (Eds.), Modern Approaches to Discrete Curvature (Vol. 2184, pp. 159–174). Springer. https://doi.org/10.1007/978-3-319-58002-9_5","ieee":"J. Maas, “Entropic Ricci curvature for discrete spaces,” in Modern Approaches to Discrete Curvature, vol. 2184, L. Najman and P. Romon, Eds. Springer, 2017, pp. 159–174.","ista":"Maas J. 2017.Entropic Ricci curvature for discrete spaces. In: Modern Approaches to Discrete Curvature. vol. 2184, 159–174.","short":"J. Maas, in:, L. Najman, P. Romon (Eds.), Modern Approaches to Discrete Curvature, Springer, 2017, pp. 159–174.","mla":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, vol. 2184, Springer, 2017, pp. 159–74, doi:10.1007/978-3-319-58002-9_5.","chicago":"Maas, Jan. “Entropic Ricci Curvature for Discrete Spaces.” In Modern Approaches to Discrete Curvature, edited by Laurent Najman and Pascal Romon, 2184:159–74. Lecture Notes in Mathematics. Springer, 2017. https://doi.org/10.1007/978-3-319-58002-9_5."},"publication":"Modern Approaches to Discrete Curvature","date_published":"2017-10-05T00:00:00Z","series_title":"Lecture Notes in Mathematics","scopus_import":"1","article_processing_charge":"No","day":"05","intvolume":" 2184","status":"public","title":"Entropic Ricci curvature for discrete spaces","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"649","oa_version":"None","type":"book_chapter","abstract":[{"lang":"eng","text":"We give a short overview on a recently developed notion of Ricci curvature for discrete spaces. This notion relies on geodesic convexity properties of the relative entropy along geodesics in the space of probability densities, for a metric which is similar to (but different from) the 2-Wasserstein metric. The theory can be considered as a discrete counterpart to the theory of Ricci curvature for geodesic measure spaces developed by Lott–Sturm–Villani."}]},{"date_published":"2017-01-01T00:00:00Z","citation":{"ista":"Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.","ieee":"M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.","apa":"Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger & S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. https://doi.org/10.1007/978-3-319-55911-7_42","ama":"Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:10.1007/978-3-319-55911-7_42","chicago":"Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.","mla":"Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599."},"page":"586 - 599","day":"01","scopus_import":1,"oa_version":"Submitted Version","_id":"650","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 10185","title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","status":"public","abstract":[{"text":"In this work we present a short and unified proof for the Strong and Weak Regularity Lemma, based on the cryptographic tech-nique called low-complexity approximations. In short, both problems reduce to a task of finding constructively an approximation for a certain target function under a class of distinguishers (test functions), where dis-tinguishers are combinations of simple rectangle-indicators. In our case these approximations can be learned by a simple iterative procedure, which yields a unified and simple proof, achieving for any graph with density d and any approximation parameter the partition size. The novelty in our proof is: (a) a simple approach which yields both strong and weaker variant, and (b) improvements when d = o(1). At an abstract level, our proof can be seen a refinement and simplification of the “analytic” proof given by Lovasz and Szegedy.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"doi":"10.1007/978-3-319-55911-7_42","conference":{"end_date":"2017-04-22","start_date":"2017-04-20","location":"Bern, Switzerland","name":"TAMC: Theory and Applications of Models of Computation"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2016/965.pdf","open_access":"1"}],"quality_controlled":"1","publication_identifier":{"issn":["03029743"]},"month":"01","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","last_name":"Skórski","full_name":"Skórski, Maciej"}],"volume":10185,"date_created":"2018-12-11T11:47:42Z","date_updated":"2021-01-12T08:07:46Z","year":"2017","editor":[{"first_name":"Gerhard","last_name":"Jäger","full_name":"Jäger, Gerhard"},{"first_name":"Silvia","last_name":"Steila","full_name":"Steila, Silvia"}],"department":[{"_id":"KrPi"}],"publisher":"Springer","publication_status":"published","publist_id":"7119"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6519","title":"Improved set-based symbolic algorithms for parity games","status":"public","ddc":["004"],"intvolume":" 82","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-04T12:56:52Z","checksum":"7c2c9d09970af79026d7e37d9b632ef8","relation":"main_file","file_id":"6520","file_size":710185,"content_type":"application/pdf","creator":"kschuh","file_name":"2017_LIPIcs-Chatterjee.pdf","access_level":"open_access"}],"type":"conference","abstract":[{"text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. ","lang":"eng"}],"citation":{"ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:10.4230/LIPICS.CSL.2017.18","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.CSL.2017.18","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.","mla":"Chatterjee, Krishnendu, et al. Improved Set-Based Symbolic Algorithms for Parity Games. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:10.4230/LIPICS.CSL.2017.18.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18."},"date_published":"2017-08-01T00:00:00Z","scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","year":"2017","publication_status":"published","publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"date_updated":"2023-02-14T10:08:25Z","date_created":"2019-06-04T12:42:43Z","volume":82,"article_number":"18","file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"license":"https://creativecommons.org/licenses/by/3.0/","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"conference":{"start_date":"2017-08-20","location":"Stockholm, Sweden","end_date":"2017-08-24","name":"CSL: Conference on Computer Science Logic"},"doi":"10.4230/LIPICS.CSL.2017.18","language":[{"iso":"eng"}],"month":"08"},{"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"UlWa"}],"year":"2017","date_created":"2019-06-04T12:11:52Z","date_updated":"2021-01-12T08:07:51Z","volume":92,"author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav"}],"article_number":"34","file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"conference":{"location":"Phuket, Thailand","start_date":"2017-12-09","end_date":"2017-12-22","name":"ISAAC: International Symposium on Algorithms and Computation"},"doi":"10.4230/LIPICS.ISAAC.2017.34","month":"12","title":"Embedding graphs into embedded graphs","ddc":["510"],"status":"public","intvolume":" 92","_id":"6517","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"fc7a643e29621c8bbe49d36b39081f31","date_created":"2019-06-04T12:20:35Z","date_updated":"2020-07-14T12:47:33Z","file_id":"6518","relation":"main_file","creator":"kschuh","file_size":588982,"content_type":"application/pdf","access_level":"open_access","file_name":"2017_LIPIcs-Fulek.pdf"}],"oa_version":"Published Version","type":"conference","abstract":[{"text":"A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle.","lang":"eng"}],"citation":{"ama":"Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ISAAC.2017.34","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","apa":"Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ISAAC.2017.34","ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.","short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Fulek, Radoslav. Embedding Graphs into Embedded Graphs. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ISAAC.2017.34.","chicago":"Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPICS.ISAAC.2017.34."},"date_published":"2017-12-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1"},{"publisher":"IEEE","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"title":"Dynamical self consistency leads to behavioral development and emergent social interactions in robots","status":"public","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"652","year":"2017","oa_version":"None","date_updated":"2021-01-12T08:07:51Z","date_created":"2018-12-11T11:47:43Z","author":[{"full_name":"Der, Ralf","first_name":"Ralf","last_name":"Der"},{"full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","first_name":"Georg S"}],"type":"conference","article_number":"7846789","publist_id":"7100","abstract":[{"lang":"eng","text":"We present an approach that enables robots to self-organize their sensorimotor behavior from scratch without providing specific information about neither the robot nor its environment. This is achieved by a simple neural control law that increases the consistency between external sensor dynamics and internal neural dynamics of the utterly simple controller. In this way, the embodiment and the agent-environment coupling are the only source of individual development. We show how an anthropomorphic tendon driven arm-shoulder system develops different behaviors depending on that coupling. For instance: Given a bottle half-filled with water, the arm starts to shake it, driven by the physical response of the water. When attaching a brush, the arm can be manipulated into wiping a table, and when connected to a revolvable wheel it finds out how to rotate it. Thus, the robot may be said to discover the affordances of the world. When allowing two (simulated) humanoid robots to interact physically, they engage into a joint behavior development leading to, for instance, spontaneous cooperation. More social effects are observed if the robots can visually perceive each other. Although, as an observer, it is tempting to attribute an apparent intentionality, there is nothing of the kind put in. As a conclusion, we argue that emergent behavior may be much less rooted in explicit intentions, internal motivations, or specific reward systems than is commonly believed."}],"quality_controlled":"1","citation":{"ama":"Der R, Martius GS. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. In: IEEE; 2017. doi:10.1109/DEVLRN.2016.7846789","ista":"Der R, Martius GS. 2017. Dynamical self consistency leads to behavioral development and emergent social interactions in robots. ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , 7846789.","ieee":"R. Der and G. S. Martius, “Dynamical self consistency leads to behavioral development and emergent social interactions in robots,” presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France, 2017.","apa":"Der, R., & Martius, G. S. (2017). Dynamical self consistency leads to behavioral development and emergent social interactions in robots. Presented at the ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics , Cergy-Pontoise, France: IEEE. https://doi.org/10.1109/DEVLRN.2016.7846789","mla":"Der, Ralf, and Georg S. Martius. Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots. 7846789, IEEE, 2017, doi:10.1109/DEVLRN.2016.7846789.","short":"R. Der, G.S. Martius, in:, IEEE, 2017.","chicago":"Der, Ralf, and Georg S Martius. “Dynamical Self Consistency Leads to Behavioral Development and Emergent Social Interactions in Robots.” IEEE, 2017. https://doi.org/10.1109/DEVLRN.2016.7846789."},"language":[{"iso":"eng"}],"date_published":"2017-02-07T00:00:00Z","doi":"10.1109/DEVLRN.2016.7846789","conference":{"location":"Cergy-Pontoise, France","start_date":"2016-09-19","end_date":"2016-09-22","name":"ICDL EpiRob: International Conference on Development and Learning and Epigenetic Robotics "},"scopus_import":1,"publication_identifier":{"isbn":["978-150905069-7"]},"day":"07","month":"02"},{"doi":"10.1038/541161a","date_published":"2017-01-11T00:00:00Z","language":[{"iso":"eng"}],"citation":{"ama":"Hof B. Fluid dynamics: Water flows out of touch. Nature. 2017;541(7636):161-162. doi:10.1038/541161a","ista":"Hof B. 2017. Fluid dynamics: Water flows out of touch. Nature. 541(7636), 161–162.","ieee":"B. Hof, “Fluid dynamics: Water flows out of touch,” Nature, vol. 541, no. 7636. Nature Publishing Group, pp. 161–162, 2017.","apa":"Hof, B. (2017). Fluid dynamics: Water flows out of touch. Nature. Nature Publishing Group. https://doi.org/10.1038/541161a","mla":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature, vol. 541, no. 7636, Nature Publishing Group, 2017, pp. 161–62, doi:10.1038/541161a.","short":"B. Hof, Nature 541 (2017) 161–162.","chicago":"Hof, Björn. “Fluid Dynamics: Water Flows out of Touch.” Nature. Nature Publishing Group, 2017. https://doi.org/10.1038/541161a."},"publication":"Nature","page":"161 - 162","quality_controlled":"1","publication_identifier":{"issn":["00280836"]},"month":"01","day":"11","scopus_import":1,"author":[{"full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87","last_name":"Hof","first_name":"Björn"}],"oa_version":"None","volume":541,"date_created":"2018-12-11T11:47:43Z","date_updated":"2021-01-12T08:07:49Z","year":"2017","_id":"651","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"BjHo"}],"publisher":"Nature Publishing Group","intvolume":" 541","title":"Fluid dynamics: Water flows out of touch","status":"public","publication_status":"published","publist_id":"7116","issue":"7636","abstract":[{"text":"Superhydrophobic surfaces reduce the frictional drag between water and solid materials, but this effect is often temporary. The realization of sustained drag reduction has applications for water vehicles and pipeline flows.\r\n\r\n","lang":"eng"}],"type":"journal_article"},{"month":"03","publication_identifier":{"issn":["10614036"]},"doi":"10.1038/ng.3764","language":[{"iso":"eng"}],"external_id":{"pmid":["28092682"]},"oa":1,"quality_controlled":"1","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-07-14T12:47:33Z","ec_funded":1,"publist_id":"7092","author":[{"last_name":"Makohon Moore","first_name":"Alvin","full_name":"Makohon Moore, Alvin"},{"last_name":"Zhang","first_name":"Ming","full_name":"Zhang, Ming"},{"last_name":"Reiter","first_name":"Johannes","orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes"},{"full_name":"Božić, Ivana","first_name":"Ivana","last_name":"Božić"},{"full_name":"Allen, Benjamin","last_name":"Allen","first_name":"Benjamin"},{"id":"1d4c0f4f-e8a3-11ec-a351-e36772758c45","last_name":"Kundu","first_name":"Deepanjan","full_name":"Kundu, Deepanjan"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Fay","last_name":"Wong","full_name":"Wong, Fay"},{"full_name":"Jiao, Yuchen","first_name":"Yuchen","last_name":"Jiao"},{"last_name":"Kohutek","first_name":"Zachary","full_name":"Kohutek, Zachary"},{"full_name":"Hong, Jungeui","first_name":"Jungeui","last_name":"Hong"},{"full_name":"Attiyeh, Marc","first_name":"Marc","last_name":"Attiyeh"},{"full_name":"Javier, Breanna","last_name":"Javier","first_name":"Breanna"},{"full_name":"Wood, Laura","first_name":"Laura","last_name":"Wood"},{"last_name":"Hruban","first_name":"Ralph","full_name":"Hruban, Ralph"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"},{"full_name":"Papadopoulos, Nickolas","first_name":"Nickolas","last_name":"Papadopoulos"},{"last_name":"Kinzler","first_name":"Kenneth","full_name":"Kinzler, Kenneth"},{"last_name":"Vogelstein","first_name":"Bert","full_name":"Vogelstein, Bert"},{"first_name":"Christine","last_name":"Iacobuzio Donahue","full_name":"Iacobuzio Donahue, Christine"}],"date_created":"2018-12-11T11:47:43Z","date_updated":"2022-06-10T09:55:08Z","volume":49,"year":"2017","acknowledgement":"We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).","pmid":1,"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2017-03-01T00:00:00Z","publication":"Nature Genetics","citation":{"chicago":"Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics. Nature Publishing Group, 2017. https://doi.org/10.1038/ng.3764.","mla":"Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” Nature Genetics, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:10.1038/ng.3764.","short":"A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.","ista":"Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.","apa":"Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. Nature Publishing Group. https://doi.org/10.1038/ng.3764","ieee":"A. Makohon Moore et al., “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” Nature Genetics, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017.","ama":"Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 2017;49(3):358-366. doi:10.1038/ng.3764"},"article_type":"original","page":"358 - 366","abstract":[{"text":"The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease.","lang":"eng"}],"issue":"3","type":"journal_article","oa_version":"Submitted Version","file":[{"checksum":"e442dc3b7420a36ec805e9bb45cc1a2e","date_updated":"2020-07-14T12:47:33Z","date_created":"2019-11-19T08:13:50Z","file_id":"7050","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":908099,"access_level":"open_access","file_name":"2017_NatureGenetics_Makohon.pdf"}],"_id":"653","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer","ddc":["000"],"status":"public","intvolume":" 49"},{"date_published":"2017-10-30T00:00:00Z","doi":"10.1145/3133956.3134031","conference":{"name":"CCS: Conference on Computer and Communications Security","end_date":"2017-11-03","location":"Dallas, TX, USA","start_date":"2017-10-30"},"language":[{"iso":"eng"}],"citation":{"chicago":"Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press, 2017. https://doi.org/10.1145/3133956.3134031.","short":"J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.","mla":"Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.","ieee":"J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.","apa":"Alwen, J. F., Blocki, J., & Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press. https://doi.org/10.1145/3133956.3134031","ista":"Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.","ama":"Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM Press; 2017:1001-1017. doi:10.1145/3133956.3134031"},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/443"}],"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","page":"1001-1017","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","publication_identifier":{"isbn":["9781450349468"]},"day":"30","month":"10","scopus_import":1,"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F"},{"full_name":"Blocki, Jeremiah","last_name":"Blocki","first_name":"Jeremiah"},{"last_name":"Harsha","first_name":"Ben","full_name":"Harsha, Ben"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T08:07:53Z","date_created":"2019-06-06T13:21:29Z","year":"2017","_id":"6527","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrPi"}],"publisher":"ACM Press","status":"public","title":"Practical graphs for optimal side-channel resistant memory-hard functions","publication_status":"published","ec_funded":1,"abstract":[{"text":"A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n","lang":"eng"}],"type":"conference"},{"day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2017-03-01T00:00:00Z","page":"733 - 736","publication":"Development","citation":{"mla":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development, vol. 144, no. 5, Company of Biologists, 2017, pp. 733–36, doi:10.1242/dev.144915.","short":"A. Kicheva, N. Rivron, Development 144 (2017) 733–736.","chicago":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” Development. Company of Biologists, 2017. https://doi.org/10.1242/dev.144915.","ama":"Kicheva A, Rivron N. Creating to understand – developmental biology meets engineering in Paris. Development. 2017;144(5):733-736. doi:10.1242/dev.144915","ista":"Kicheva A, Rivron N. 2017. Creating to understand – developmental biology meets engineering in Paris. Development. 144(5), 733–736.","apa":"Kicheva, A., & Rivron, N. (2017). Creating to understand – developmental biology meets engineering in Paris. Development. Company of Biologists. https://doi.org/10.1242/dev.144915","ieee":"A. Kicheva and N. Rivron, “Creating to understand – developmental biology meets engineering in Paris,” Development, vol. 144, no. 5. Company of Biologists, pp. 733–736, 2017."},"abstract":[{"lang":"eng","text":"In November 2016, developmental biologists, synthetic biologists and engineers gathered in Paris for a meeting called ‘Engineering the embryo’. The participants shared an interest in exploring how synthetic systems can reveal new principles of embryonic development, and how the in vitro manipulation and modeling of development using stem cells can be used to integrate ideas and expertise from physics, developmental biology and tissue engineering. As we review here, the conference pinpointed some of the challenges arising at the intersection of these fields, along with great enthusiasm for finding new approaches and collaborations."}],"issue":"5","type":"journal_article","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:15:20Z","date_updated":"2020-07-14T12:47:33Z","checksum":"eef22a0f42a55b232cb2d1188a2322cb","relation":"main_file","file_id":"5139","file_size":228206,"content_type":"application/pdf","creator":"system","file_name":"IST-2018-987-v1+1_2017_KichevaRivron__Creating_to.pdf","access_level":"open_access"}],"pubrep_id":"987","status":"public","ddc":["571"],"title":"Creating to understand – developmental biology meets engineering in Paris","intvolume":" 144","_id":"654","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","publication_identifier":{"issn":["09501991"]},"language":[{"iso":"eng"}],"doi":"10.1242/dev.144915","quality_controlled":"1","project":[{"name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037"}],"oa":1,"file_date_updated":"2020-07-14T12:47:33Z","publist_id":"7089","ec_funded":1,"date_created":"2018-12-11T11:47:44Z","date_updated":"2021-01-12T08:07:54Z","volume":144,"author":[{"id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","first_name":"Anna","last_name":"Kicheva","full_name":"Kicheva, Anna"},{"full_name":"Rivron, Nicolas","last_name":"Rivron","first_name":"Nicolas"}],"publication_status":"published","department":[{"_id":"AnKi"}],"publisher":"Company of Biologists","year":"2017"},{"status":"public","title":"On the complexity of estimating Rènyi divergences","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6526","oa_version":"Preprint","type":"conference","abstract":[{"text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity.","lang":"eng"}],"publication":"2017 IEEE International Symposium on Information Theory (ISIT)","citation":{"ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017.","apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In 2017 IEEE International Symposium on Information Theory (ISIT). Aachen, Germany: IEEE. https://doi.org/10.1109/isit.2017.8006529","ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.","ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE; 2017. doi:10.1109/isit.2017.8006529","chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. https://doi.org/10.1109/isit.2017.8006529.","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529."},"date_published":"2017-08-09T00:00:00Z","scopus_import":1,"day":"09","publication_status":"published","publisher":"IEEE","department":[{"_id":"KrPi"}],"year":"2017","date_created":"2019-06-06T12:53:09Z","date_updated":"2021-01-12T08:07:53Z","author":[{"full_name":"Skórski, Maciej","first_name":"Maciej","last_name":"Skórski","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD"}],"article_number":"8006529","ec_funded":1,"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"external_id":{"arxiv":["1702.01666"]},"main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2017-06-25","location":"Aachen, Germany","end_date":"2017-06-30","name":"ISIT: International Symposium on Information Theory"},"doi":"10.1109/isit.2017.8006529","month":"08","publication_identifier":{"isbn":["9781509040964"]}},{"author":[{"first_name":"Thibaud","last_name":"Renault","full_name":"Renault, Thibaud"},{"last_name":"Abraham","first_name":"Anthony","full_name":"Abraham, Anthony"},{"full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","last_name":"Bergmiller","first_name":"Tobias"},{"full_name":"Paradis, Guillaume","last_name":"Paradis","first_name":"Guillaume"},{"full_name":"Rainville, Simon","first_name":"Simon","last_name":"Rainville"},{"full_name":"Charpentier, Emmanuelle","first_name":"Emmanuelle","last_name":"Charpentier"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet","full_name":"Guet, Calin C"},{"full_name":"Tu, Yuhai","first_name":"Yuhai","last_name":"Tu"},{"full_name":"Namba, Keiichi","last_name":"Namba","first_name":"Keiichi"},{"full_name":"Keener, James","last_name":"Keener","first_name":"James"},{"last_name":"Minamino","first_name":"Tohru","full_name":"Minamino, Tohru"},{"last_name":"Erhardt","first_name":"Marc","full_name":"Erhardt, Marc"}],"date_updated":"2021-01-12T08:07:55Z","date_created":"2018-12-11T11:47:44Z","volume":6,"year":"2017","publication_status":"published","publisher":"eLife Sciences Publications","department":[{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:47:33Z","publist_id":"7082","article_number":"e23136","doi":"10.7554/eLife.23136","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","month":"03","publication_identifier":{"issn":["2050084X"]},"pubrep_id":"904","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"4716","date_updated":"2020-07-14T12:47:33Z","date_created":"2018-12-12T10:08:53Z","checksum":"39e1c3e82ddac83a30422fa72fa1a383","file_name":"IST-2017-904-v1+1_elife-23136-v2.pdf","access_level":"open_access","content_type":"application/pdf","file_size":5520359,"creator":"system"},{"access_level":"open_access","file_name":"IST-2017-904-v1+2_elife-23136-figures-v2.pdf","file_size":11242920,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4717","checksum":"a6d542253028f52e00aa29739ddffe8f","date_created":"2018-12-12T10:08:54Z","date_updated":"2020-07-14T12:47:33Z"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"655","status":"public","title":"Bacterial flagella grow through an injection diffusion mechanism","ddc":["579"],"intvolume":" 6","abstract":[{"lang":"eng","text":"The bacterial flagellum is a self-assembling nanomachine. The external flagellar filament, several times longer than a bacterial cell body, is made of a few tens of thousands subunits of a single protein: flagellin. A fundamental problem concerns the molecular mechanism of how the flagellum grows outside the cell, where no discernible energy source is available. Here, we monitored the dynamic assembly of individual flagella using in situ labelling and real-time immunostaining of elongating flagellar filaments. We report that the rate of flagellum growth, initially ~1,700 amino acids per second, decreases with length and that the previously proposed chain mechanism does not contribute to the filament elongation dynamics. Inhibition of the proton motive force-dependent export apparatus revealed a major contribution of substrate injection in driving filament elongation. The combination of experimental and mathematical evidence demonstrates that a simple, injection-diffusion mechanism controls bacterial flagella growth outside the cell."}],"type":"journal_article","date_published":"2017-03-06T00:00:00Z","publication":"eLife","citation":{"chicago":"Renault, Thibaud, Anthony Abraham, Tobias Bergmiller, Guillaume Paradis, Simon Rainville, Emmanuelle Charpentier, Calin C Guet, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.23136.","short":"T. Renault, A. Abraham, T. Bergmiller, G. Paradis, S. Rainville, E. Charpentier, C.C. Guet, Y. Tu, K. Namba, J. Keener, T. Minamino, M. Erhardt, ELife 6 (2017).","mla":"Renault, Thibaud, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” ELife, vol. 6, e23136, eLife Sciences Publications, 2017, doi:10.7554/eLife.23136.","apa":"Renault, T., Abraham, A., Bergmiller, T., Paradis, G., Rainville, S., Charpentier, E., … Erhardt, M. (2017). Bacterial flagella grow through an injection diffusion mechanism. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.23136","ieee":"T. Renault et al., “Bacterial flagella grow through an injection diffusion mechanism,” eLife, vol. 6. eLife Sciences Publications, 2017.","ista":"Renault T, Abraham A, Bergmiller T, Paradis G, Rainville S, Charpentier E, Guet CC, Tu Y, Namba K, Keener J, Minamino T, Erhardt M. 2017. Bacterial flagella grow through an injection diffusion mechanism. eLife. 6, e23136.","ama":"Renault T, Abraham A, Bergmiller T, et al. Bacterial flagella grow through an injection diffusion mechanism. eLife. 2017;6. doi:10.7554/eLife.23136"},"day":"06","has_accepted_license":"1","scopus_import":1},{"month":"03","publication_identifier":{"issn":["00278424"]},"oa":1,"external_id":{"pmid":["28265057"]},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5373392/","open_access":"1"}],"quality_controlled":"1","doi":"10.1073/pnas.1616493114","language":[{"iso":"eng"}],"publist_id":"7076","year":"2017","pmid":1,"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"National Academy of Sciences","author":[{"first_name":"Barbara","last_name":"Möller","full_name":"Möller, Barbara"},{"full_name":"Ten Hove, Colette","first_name":"Colette","last_name":"Ten Hove"},{"full_name":"Xiang, Daoquan","last_name":"Xiang","first_name":"Daoquan"},{"full_name":"Williams, Nerys","last_name":"Williams","first_name":"Nerys"},{"first_name":"Lorena","last_name":"López","full_name":"López, Lorena"},{"full_name":"Yoshida, Saiko","id":"2E46069C-F248-11E8-B48F-1D18A9856A87","last_name":"Yoshida","first_name":"Saiko"},{"full_name":"Smit, Margot","first_name":"Margot","last_name":"Smit"},{"full_name":"Datla, Raju","last_name":"Datla","first_name":"Raju"},{"full_name":"Weijers, Dolf","last_name":"Weijers","first_name":"Dolf"}],"date_updated":"2021-01-12T08:08:02Z","date_created":"2018-12-11T11:47:45Z","volume":114,"scopus_import":1,"day":"21","publication":"PNAS","citation":{"chicago":"Möller, Barbara, Colette Ten Hove, Daoquan Xiang, Nerys Williams, Lorena López, Saiko Yoshida, Margot Smit, Raju Datla, and Dolf Weijers. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1616493114.","mla":"Möller, Barbara, et al. “Auxin Response Cell Autonomously Controls Ground Tissue Initiation in the Early Arabidopsis Embryo.” PNAS, vol. 114, no. 12, National Academy of Sciences, 2017, pp. E2533–39, doi:10.1073/pnas.1616493114.","short":"B. Möller, C. Ten Hove, D. Xiang, N. Williams, L. López, S. Yoshida, M. Smit, R. Datla, D. Weijers, PNAS 114 (2017) E2533–E2539.","ista":"Möller B, Ten Hove C, Xiang D, Williams N, López L, Yoshida S, Smit M, Datla R, Weijers D. 2017. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 114(12), E2533–E2539.","ieee":"B. Möller et al., “Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo,” PNAS, vol. 114, no. 12. National Academy of Sciences, pp. E2533–E2539, 2017.","apa":"Möller, B., Ten Hove, C., Xiang, D., Williams, N., López, L., Yoshida, S., … Weijers, D. (2017). Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1616493114","ama":"Möller B, Ten Hove C, Xiang D, et al. Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo. PNAS. 2017;114(12):E2533-E2539. doi:10.1073/pnas.1616493114"},"page":"E2533 - E2539","date_published":"2017-03-21T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Plant organs are typically organized into three main tissue layers. The middle ground tissue layer comprises the majority of the plant body and serves a wide range of functions, including photosynthesis, selective nutrient uptake and storage, and gravity sensing. Ground tissue patterning and maintenance in Arabidopsis are controlled by a well-established gene network revolving around the key regulator SHORT-ROOT (SHR). In contrast, it is completely unknown how ground tissue identity is first specified from totipotent precursor cells in the embryo. The plant signaling molecule auxin, acting through AUXIN RESPONSE FACTOR (ARF) transcription factors, is critical for embryo patterning. The auxin effector ARF5/MONOPTEROS (MP) acts both cell-autonomously and noncell-autonomously to control embryonic vascular tissue formation and root initiation, respectively. Here we show that auxin response and ARF activity cell-autonomously control the asymmetric division of the first ground tissue cells. By identifying embryonic target genes, we show that MP transcriptionally initiates the ground tissue lineage and acts upstream of the regulatory network that controls ground tissue patterning and maintenance. Strikingly, whereas the SHR network depends on MP, this MP function is, at least in part, SHR independent. Our study therefore identifies auxin response as a regulator of ground tissue specification in the embryonic root, and reveals that ground tissue initiation and maintenance use different regulators and mechanisms. Moreover, our data provide a framework for the simultaneous formation of multiple cell types by the same transcriptional regulator."}],"issue":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"657","title":"Auxin response cell autonomously controls ground tissue initiation in the early arabidopsis embryo","status":"public","intvolume":" 114","oa_version":"Submitted Version"},{"date_updated":"2021-01-12T08:07:59Z","date_created":"2018-12-11T11:47:45Z","oa_version":"None","volume":9,"author":[{"full_name":"Novarino, Gaia","first_name":"Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178"}],"publication_status":"published","status":"public","title":"Modeling Alzheimer's disease in mice with human neurons","publisher":"American Association for the Advancement of Science","department":[{"_id":"GaNo"}],"intvolume":" 9","_id":"656","year":"2017","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Human neurons transplanted into a mouse model for Alzheimer’s disease show human-specific vulnerability to β-amyloid plaques and may help to identify new therapeutic targets."}],"publist_id":"7079","issue":"381","article_number":"eaam9867","type":"journal_article","language":[{"iso":"eng"}],"date_published":"2017-03-15T00:00:00Z","doi":"10.1126/scitranslmed.aam9867","quality_controlled":"1","publication":"Science Translational Medicine","citation":{"ama":"Novarino G. Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. 2017;9(381). doi:10.1126/scitranslmed.aam9867","apa":"Novarino, G. (2017). Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aam9867","ieee":"G. Novarino, “Modeling Alzheimer’s disease in mice with human neurons,” Science Translational Medicine, vol. 9, no. 381. American Association for the Advancement of Science, 2017.","ista":"Novarino G. 2017. Modeling Alzheimer’s disease in mice with human neurons. Science Translational Medicine. 9(381), eaam9867.","short":"G. Novarino, Science Translational Medicine 9 (2017).","mla":"Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” Science Translational Medicine, vol. 9, no. 381, eaam9867, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aam9867.","chicago":"Novarino, Gaia. “Modeling Alzheimer’s Disease in Mice with Human Neurons.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aam9867."},"month":"03","day":"15","publication_identifier":{"issn":["19466234"]},"scopus_import":1},{"publisher":"Frontiers Research Foundation","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"publication_status":"published","year":"2017","volume":11,"date_created":"2018-12-11T11:47:45Z","date_updated":"2021-01-12T08:08:04Z","author":[{"last_name":"Der","first_name":"Ralf","full_name":"Der, Ralf"},{"id":"3A276B68-F248-11E8-B48F-1D18A9856A87","first_name":"Georg S","last_name":"Martius","full_name":"Martius, Georg S"}],"article_number":"00008","ec_funded":1,"publist_id":"7078","file_date_updated":"2020-07-14T12:47:33Z","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.3389/fnbot.2017.00008","publication_identifier":{"issn":["16625218"]},"month":"03","intvolume":" 11","ddc":["006"],"status":"public","title":"Self organized behavior generation for musculoskeletal robots","user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","_id":"658","oa_version":"Published Version","file":[{"file_size":8439566,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2017-903-v1+1_fnbot-11-00008.pdf","checksum":"b1bc43f96d1df3313c03032c2a46388d","date_updated":"2020-07-14T12:47:33Z","date_created":"2018-12-12T10:18:49Z","relation":"main_file","file_id":"5371"}],"pubrep_id":"903","type":"journal_article","issue":"MAR","abstract":[{"text":"With the accelerated development of robot technologies, control becomes one of the central themes of research. In traditional approaches, the controller, by its internal functionality, finds appropriate actions on the basis of specific objectives for the task at hand. While very successful in many applications, self-organized control schemes seem to be favored in large complex systems with unknown dynamics or which are difficult to model. Reasons are the expected scalability, robustness, and resilience of self-organizing systems. The paper presents a self-learning neurocontroller based on extrinsic differential plasticity introduced recently, applying it to an anthropomorphic musculoskeletal robot arm with attached objects of unknown physical dynamics. The central finding of the paper is the following effect: by the mere feedback through the internal dynamics of the object, the robot is learning to relate each of the objects with a very specific sensorimotor pattern. Specifically, an attached pendulum pilots the arm into a circular motion, a half-filled bottle produces axis oriented shaking behavior, a wheel is getting rotated, and wiping patterns emerge automatically in a table-plus-brush setting. By these object-specific dynamical patterns, the robot may be said to recognize the object's identity, or in other words, it discovers dynamical affordances of objects. Furthermore, when including hand coordinates obtained from a camera, a dedicated hand-eye coordination self-organizes spontaneously. These phenomena are discussed from a specific dynamical system perspective. Central is the dedicated working regime at the border to instability with its potentially infinite reservoir of (limit cycle) attractors "waiting" to be excited. Besides converging toward one of these attractors, variate behavior is also arising from a self-induced attractor morphing driven by the learning rule. We claim that experimental investigations with this anthropomorphic, self-learning robot not only generate interesting and potentially useful behaviors, but may also help to better understand what subjective human muscle feelings are, how they can be rooted in sensorimotor patterns, and how these concepts may feed back on robotics.","lang":"eng"}],"citation":{"apa":"Der, R., & Martius, G. S. (2017). Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. Frontiers Research Foundation. https://doi.org/10.3389/fnbot.2017.00008","ieee":"R. Der and G. S. Martius, “Self organized behavior generation for musculoskeletal robots,” Frontiers in Neurorobotics, vol. 11, no. MAR. Frontiers Research Foundation, 2017.","ista":"Der R, Martius GS. 2017. Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. 11(MAR), 00008.","ama":"Der R, Martius GS. Self organized behavior generation for musculoskeletal robots. Frontiers in Neurorobotics. 2017;11(MAR). doi:10.3389/fnbot.2017.00008","chicago":"Der, Ralf, and Georg S Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” Frontiers in Neurorobotics. Frontiers Research Foundation, 2017. https://doi.org/10.3389/fnbot.2017.00008.","short":"R. Der, G.S. Martius, Frontiers in Neurorobotics 11 (2017).","mla":"Der, Ralf, and Georg S. Martius. “Self Organized Behavior Generation for Musculoskeletal Robots.” Frontiers in Neurorobotics, vol. 11, no. MAR, 00008, Frontiers Research Foundation, 2017, doi:10.3389/fnbot.2017.00008."},"publication":"Frontiers in Neurorobotics","date_published":"2017-03-16T00:00:00Z","scopus_import":1,"article_processing_charge":"Yes","has_accepted_license":"1","day":"16"},{"type":"journal_article","abstract":[{"lang":"eng","text":"Migration frequently involves Rac-mediated protrusion of lamellipodia, formed by Arp2/3 complex-dependent branching thought to be crucial for force generation and stability of these networks. The formins FMNL2 and FMNL3 are Cdc42 effectors targeting to the lamellipodium tip and shown here to nucleate and elongate actin filaments with complementary activities in vitro. In migrating B16-F1 melanoma cells, both formins contribute to the velocity of lamellipodium protrusion. Loss of FMNL2/3 function in melanoma cells and fibroblasts reduces lamellipodial width, actin filament density and -bundling, without changing patterns of Arp2/3 complex incorporation. Strikingly, in melanoma cells, FMNL2/3 gene inactivation almost completely abolishes protrusion forces exerted by lamellipodia and modifies their ultrastructural organization. Consistently, CRISPR/Cas-mediated depletion of FMNL2/3 in fibroblasts reduces both migration and capability of cells to move against viscous media. Together, we conclude that force generation in lamellipodia strongly depends on FMNL formin activity, operating in addition to Arp2/3 complex-dependent filament branching."}],"intvolume":" 8","ddc":["570"],"status":"public","title":"FMNL formins boost lamellipodial force generation","_id":"659","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"checksum":"dae30190291c3630e8102d8714a8d23e","date_created":"2018-12-12T10:14:21Z","date_updated":"2020-07-14T12:47:34Z","relation":"main_file","file_id":"5072","content_type":"application/pdf","file_size":9523746,"creator":"system","access_level":"open_access","file_name":"IST-2017-902-v1+1_Kage_et_al-2017-Nature_Communications.pdf"}],"pubrep_id":"902","scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"22","citation":{"ama":"Kage F, Winterhoff M, Dimchev V, et al. FMNL formins boost lamellipodial force generation. Nature Communications. 2017;8. doi:10.1038/ncomms14832","ista":"Kage F, Winterhoff M, Dimchev V, Müller J, Thalheim T, Freise A, Brühmann S, Kollasser J, Block J, Dimchev GA, Geyer M, Schnittler H, Brakebusch C, Stradal T, Carlier M, Sixt MK, Käs J, Faix J, Rottner K. 2017. FMNL formins boost lamellipodial force generation. Nature Communications. 8, 14832.","ieee":"F. Kage et al., “FMNL formins boost lamellipodial force generation,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","apa":"Kage, F., Winterhoff, M., Dimchev, V., Müller, J., Thalheim, T., Freise, A., … Rottner, K. (2017). FMNL formins boost lamellipodial force generation. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14832","mla":"Kage, Frieda, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature Communications, vol. 8, 14832, Nature Publishing Group, 2017, doi:10.1038/ncomms14832.","short":"F. Kage, M. Winterhoff, V. Dimchev, J. Müller, T. Thalheim, A. Freise, S. Brühmann, J. Kollasser, J. Block, G.A. Dimchev, M. Geyer, H. Schnittler, C. Brakebusch, T. Stradal, M. Carlier, M.K. Sixt, J. Käs, J. Faix, K. Rottner, Nature Communications 8 (2017).","chicago":"Kage, Frieda, Moritz Winterhoff, Vanessa Dimchev, Jan Müller, Tobias Thalheim, Anika Freise, Stefan Brühmann, et al. “FMNL Formins Boost Lamellipodial Force Generation.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms14832."},"publication":"Nature Communications","date_published":"2017-03-22T00:00:00Z","article_number":"14832","publist_id":"7075","file_date_updated":"2020-07-14T12:47:34Z","department":[{"_id":"MiSi"}],"publisher":"Nature Publishing Group","publication_status":"published","year":"2017","volume":8,"date_created":"2018-12-11T11:47:46Z","date_updated":"2021-01-12T08:08:06Z","author":[{"full_name":"Kage, Frieda","first_name":"Frieda","last_name":"Kage"},{"first_name":"Moritz","last_name":"Winterhoff","full_name":"Winterhoff, Moritz"},{"first_name":"Vanessa","last_name":"Dimchev","full_name":"Dimchev, Vanessa"},{"full_name":"Müller, Jan","id":"AD07FDB4-0F61-11EA-8158-C4CC64CEAA8D","last_name":"Müller","first_name":"Jan"},{"first_name":"Tobias","last_name":"Thalheim","full_name":"Thalheim, Tobias"},{"last_name":"Freise","first_name":"Anika","full_name":"Freise, Anika"},{"last_name":"Brühmann","first_name":"Stefan","full_name":"Brühmann, Stefan"},{"last_name":"Kollasser","first_name":"Jana","full_name":"Kollasser, Jana"},{"full_name":"Block, Jennifer","last_name":"Block","first_name":"Jennifer"},{"full_name":"Dimchev, Georgi A","last_name":"Dimchev","first_name":"Georgi A"},{"full_name":"Geyer, Matthias","first_name":"Matthias","last_name":"Geyer"},{"full_name":"Schnittler, Hams","last_name":"Schnittler","first_name":"Hams"},{"full_name":"Brakebusch, Cord","last_name":"Brakebusch","first_name":"Cord"},{"full_name":"Stradal, Theresia","first_name":"Theresia","last_name":"Stradal"},{"full_name":"Carlier, Marie","first_name":"Marie","last_name":"Carlier"},{"first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Josef","last_name":"Käs","full_name":"Käs, Josef"},{"full_name":"Faix, Jan","first_name":"Jan","last_name":"Faix"},{"last_name":"Rottner","first_name":"Klemens","full_name":"Rottner, Klemens"}],"publication_identifier":{"issn":["20411723"]},"month":"03","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1038/ncomms14832"},{"publist_id":"7073","volume":114,"date_updated":"2021-01-12T08:08:09Z","date_created":"2018-12-11T11:47:46Z","author":[{"full_name":"Rickman, Jamie","last_name":"Rickman","first_name":"Jamie"},{"last_name":"Düllberg","first_name":"Christian F","orcid":"0000-0001-6335-9748","id":"459064DC-F248-11E8-B48F-1D18A9856A87","full_name":"Düllberg, Christian F"},{"last_name":"Cade","first_name":"Nicholas","full_name":"Cade, Nicholas"},{"last_name":"Griffin","first_name":"Lewis","full_name":"Griffin, Lewis"},{"last_name":"Surrey","first_name":"Thomas","full_name":"Surrey, Thomas"}],"department":[{"_id":"MaLo"}],"publisher":"National Academy of Sciences","publication_status":"published","pmid":1,"year":"2017","acknowledgement":"We thank Philippe Cluzel for helpful discussions and Gunnar Pruessner for data analysis advice. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK Grant FC001163, Medical Research Council Grant FC001163, and Wellcome Trust Grant FC001163. This work was also supported by European Research Council Advanced Grant Project 323042 (to C.D. and T.S.).","publication_identifier":{"issn":["00278424"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.1073/pnas.1620274114","quality_controlled":"1","external_id":{"pmid":["28280102"]},"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380103/","open_access":"1"}],"oa":1,"issue":"13","abstract":[{"text":"Growing microtubules are protected from depolymerization by the presence of a GTP or GDP/Pi cap. End-binding proteins of the EB1 family bind to the stabilizing cap, allowing monitoring of its size in real time. The cap size has been shown to correlate with instantaneous microtubule stability. Here we have quantitatively characterized the properties of cap size fluctuations during steadystate growth and have developed a theory predicting their timescale and amplitude from the kinetics of microtubule growth and cap maturation. In contrast to growth speed fluctuations, cap size fluctuations show a characteristic timescale, which is defined by the lifetime of the cap sites. Growth fluctuations affect the amplitude of cap size fluctuations; however, cap size does not affect growth speed, indicating that microtubules are far from instability during most of their time of growth. Our theory provides the basis for a quantitative understanding of microtubule stability fluctuations during steady-state growth.","lang":"eng"}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 114","title":"Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation","status":"public","_id":"660","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"28","scopus_import":1,"date_published":"2017-03-28T00:00:00Z","page":"3427 - 3432","citation":{"ista":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. 2017. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 114(13), 3427–3432.","apa":"Rickman, J., Düllberg, C. F., Cade, N., Griffin, L., & Surrey, T. (2017). Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1620274114","ieee":"J. Rickman, C. F. Düllberg, N. Cade, L. Griffin, and T. Surrey, “Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation,” PNAS, vol. 114, no. 13. National Academy of Sciences, pp. 3427–3432, 2017.","ama":"Rickman J, Düllberg CF, Cade N, Griffin L, Surrey T. Steady state EB cap size fluctuations are determined by stochastic microtubule growth and maturation. PNAS. 2017;114(13):3427-3432. doi:10.1073/pnas.1620274114","chicago":"Rickman, Jamie, Christian F Düllberg, Nicholas Cade, Lewis Griffin, and Thomas Surrey. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1620274114.","mla":"Rickman, Jamie, et al. “Steady State EB Cap Size Fluctuations Are Determined by Stochastic Microtubule Growth and Maturation.” PNAS, vol. 114, no. 13, National Academy of Sciences, 2017, pp. 3427–32, doi:10.1073/pnas.1620274114.","short":"J. Rickman, C.F. Düllberg, N. Cade, L. Griffin, T. Surrey, PNAS 114 (2017) 3427–3432."},"publication":"PNAS"},{"type":"journal_article","abstract":[{"text":"We report a direct-numerical-simulation study of the Taylor-Couette flow in the quasi-Keplerian regime at shear Reynolds numbers up to (105). Quasi-Keplerian rotating flow has been investigated for decades as a simplified model system to study the origin of turbulence in accretion disks that is not fully understood. The flow in this study is axially periodic and thus the experimental end-wall effects on the stability of the flow are avoided. Using optimal linear perturbations as initial conditions, our simulations find no sustained turbulence: the strong initial perturbations distort the velocity profile and trigger turbulence that eventually decays.","lang":"eng"}],"issue":"4","_id":"662","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Hydrodynamic turbulence in quasi Keplerian rotating flows","intvolume":" 29","oa_version":"Submitted Version","scopus_import":1,"day":"01","publication":"Physics of Fluids","citation":{"short":"L. Shi, B. Hof, M. Rampp, M. Avila, Physics of Fluids 29 (2017).","mla":"Shi, Liang, et al. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” Physics of Fluids, vol. 29, no. 4, 044107, American Institute of Physics, 2017, doi:10.1063/1.4981525.","chicago":"Shi, Liang, Björn Hof, Markus Rampp, and Marc Avila. “Hydrodynamic Turbulence in Quasi Keplerian Rotating Flows.” Physics of Fluids. American Institute of Physics, 2017. https://doi.org/10.1063/1.4981525.","ama":"Shi L, Hof B, Rampp M, Avila M. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 2017;29(4). doi:10.1063/1.4981525","ieee":"L. Shi, B. Hof, M. Rampp, and M. Avila, “Hydrodynamic turbulence in quasi Keplerian rotating flows,” Physics of Fluids, vol. 29, no. 4. American Institute of Physics, 2017.","apa":"Shi, L., Hof, B., Rampp, M., & Avila, M. (2017). Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. American Institute of Physics. https://doi.org/10.1063/1.4981525","ista":"Shi L, Hof B, Rampp M, Avila M. 2017. Hydrodynamic turbulence in quasi Keplerian rotating flows. Physics of Fluids. 29(4), 044107."},"date_published":"2017-04-01T00:00:00Z","article_number":"044107","publist_id":"7072","year":"2017","publication_status":"published","publisher":"American Institute of Physics","department":[{"_id":"BjHo"}],"author":[{"full_name":"Shi, Liang","last_name":"Shi","first_name":"Liang"},{"full_name":"Hof, Björn","first_name":"Björn","last_name":"Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754"},{"full_name":"Rampp, Markus","first_name":"Markus","last_name":"Rampp"},{"full_name":"Avila, Marc","first_name":"Marc","last_name":"Avila"}],"date_created":"2018-12-11T11:47:47Z","date_updated":"2021-01-12T08:08:15Z","volume":29,"month":"04","publication_identifier":{"issn":["10706631"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.01714"}],"quality_controlled":"1","project":[{"name":"Astrophysical instability of currents and turbulences","grant_number":"SFB 963 TP A8","_id":"2511D90C-B435-11E9-9278-68D0E5697425"}],"doi":"10.1063/1.4981525","language":[{"iso":"eng"}]},{"abstract":[{"text":"In this paper, we propose an approach to automatically compute invariant clusters for nonlinear semialgebraic hybrid systems. An invariant cluster for an ordinary differential equation (ODE) is a multivariate polynomial invariant g(u→, x→) = 0, parametric in u→, which can yield an infinite number of concrete invariants by assigning different values to u→ so that every trajectory of the system can be overapproximated precisely by the intersection of a group of concrete invariants. For semialgebraic systems, which involve ODEs with multivariate polynomial right-hand sides, given a template multivariate polynomial g(u→, x→), an invariant cluster can be obtained by first computing the remainder of the Lie derivative of g(u→, x→) divided by g(u→, x→) and then solving the system of polynomial equations obtained from the coefficients of the remainder. Based on invariant clusters and sum-of-squares (SOS) programming, we present a new method for the safety verification of hybrid systems. Experiments on nonlinear benchmark systems from biology and control theory show that our approach is efficient. ","lang":"eng"}],"type":"conference","pubrep_id":"817","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"4873","checksum":"b7667434cbf5b5f0ade3bea1dbe5bf63","date_updated":"2020-07-14T12:47:34Z","date_created":"2018-12-12T10:11:20Z","access_level":"open_access","file_name":"IST-2017-817-v1+1_p163-kong.pdf","file_size":1650530,"content_type":"application/pdf","creator":"system"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"663","ddc":["000"],"title":"Safety verification of nonlinear hybrid systems based on invariant clusters","status":"public","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-04-01T00:00:00Z","citation":{"ama":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. Safety verification of nonlinear hybrid systems based on invariant clusters. In: Proceedings of the 20th International Conference on Hybrid Systems. ACM; 2017:163-172. doi:10.1145/3049797.3049814","ieee":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, and T. A. Henzinger, “Safety verification of nonlinear hybrid systems based on invariant clusters,” in Proceedings of the 20th International Conference on Hybrid Systems, Pittsburgh, PA, United States, 2017, pp. 163–172.","apa":"Kong, H., Bogomolov, S., Schilling, C., Jiang, Y., & Henzinger, T. A. (2017). Safety verification of nonlinear hybrid systems based on invariant clusters. In Proceedings of the 20th International Conference on Hybrid Systems (pp. 163–172). Pittsburgh, PA, United States: ACM. https://doi.org/10.1145/3049797.3049814","ista":"Kong H, Bogomolov S, Schilling C, Jiang Y, Henzinger TA. 2017. Safety verification of nonlinear hybrid systems based on invariant clusters. Proceedings of the 20th International Conference on Hybrid Systems. HSCC: Hybrid Systems Computation and Control , 163–172.","short":"H. Kong, S. Bogomolov, C. Schilling, Y. Jiang, T.A. Henzinger, in:, Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–172.","mla":"Kong, Hui, et al. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” Proceedings of the 20th International Conference on Hybrid Systems, ACM, 2017, pp. 163–72, doi:10.1145/3049797.3049814.","chicago":"Kong, Hui, Sergiy Bogomolov, Christian Schilling, Yu Jiang, and Thomas A Henzinger. “Safety Verification of Nonlinear Hybrid Systems Based on Invariant Clusters.” In Proceedings of the 20th International Conference on Hybrid Systems, 163–72. ACM, 2017. https://doi.org/10.1145/3049797.3049814."},"publication":"Proceedings of the 20th International Conference on Hybrid Systems","page":"163 - 172","publist_id":"7067","file_date_updated":"2020-07-14T12:47:34Z","author":[{"orcid":"0000-0002-3066-6941","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","last_name":"Kong","first_name":"Hui","full_name":"Kong, Hui"},{"full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"},{"full_name":"Jiang, Yu","first_name":"Yu","last_name":"Jiang"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"date_updated":"2021-01-12T08:08:17Z","date_created":"2018-12-11T11:47:47Z","year":"2017","department":[{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","publication_identifier":{"isbn":["978-145034590-3"]},"month":"04","doi":"10.1145/3049797.3049814","conference":{"name":"HSCC: Hybrid Systems Computation and Control ","location":"Pittsburgh, PA, United States","start_date":"2017-04-18","end_date":"2017-04-20"},"language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1"},{"article_number":"2786","type":"journal_article","abstract":[{"lang":"eng","text":"Perinatal exposure to penicillin may result in longlasting gut and behavioral changes."}],"issue":"387","publist_id":"7060","year":"2017","_id":"667","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","title":"The antisocial side of antibiotics","publication_status":"published","department":[{"_id":"GaNo"}],"publisher":"American Association for the Advancement of Science","intvolume":" 9","author":[{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","last_name":"Novarino","full_name":"Novarino, Gaia"}],"date_created":"2018-12-11T11:47:48Z","date_updated":"2021-01-12T08:08:30Z","oa_version":"None","volume":9,"scopus_import":1,"day":"26","month":"04","publication_identifier":{"issn":["19466234"]},"publication":"Science Translational Medicine","citation":{"mla":"Novarino, Gaia. “The Antisocial Side of Antibiotics.” Science Translational Medicine, vol. 9, no. 387, 2786, American Association for the Advancement of Science, 2017, doi:10.1126/scitranslmed.aan2786.","short":"G. Novarino, Science Translational Medicine 9 (2017).","chicago":"Novarino, Gaia. “The Antisocial Side of Antibiotics.” Science Translational Medicine. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/scitranslmed.aan2786.","ama":"Novarino G. The antisocial side of antibiotics. Science Translational Medicine. 2017;9(387). doi:10.1126/scitranslmed.aan2786","ista":"Novarino G. 2017. The antisocial side of antibiotics. Science Translational Medicine. 9(387), 2786.","ieee":"G. Novarino, “The antisocial side of antibiotics,” Science Translational Medicine, vol. 9, no. 387. American Association for the Advancement of Science, 2017.","apa":"Novarino, G. (2017). The antisocial side of antibiotics. Science Translational Medicine. American Association for the Advancement of Science. https://doi.org/10.1126/scitranslmed.aan2786"},"quality_controlled":"1","date_published":"2017-04-26T00:00:00Z","doi":"10.1126/scitranslmed.aan2786","language":[{"iso":"eng"}]},{"doi":"10.1074/jbc.M116.766923","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","publication_identifier":{"issn":["00219258"]},"month":"04","author":[{"full_name":"Horsthemke, Markus","last_name":"Horsthemke","first_name":"Markus"},{"full_name":"Bachg, Anne","last_name":"Bachg","first_name":"Anne"},{"last_name":"Groll","first_name":"Katharina","full_name":"Groll, Katharina"},{"full_name":"Moyzio, Sven","last_name":"Moyzio","first_name":"Sven"},{"full_name":"Müther, Barbara","first_name":"Barbara","last_name":"Müther"},{"full_name":"Hemkemeyer, Sandra","last_name":"Hemkemeyer","first_name":"Sandra"},{"full_name":"Wedlich Söldner, Roland","last_name":"Wedlich Söldner","first_name":"Roland"},{"full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"},{"full_name":"Tacke, Sebastian","first_name":"Sebastian","last_name":"Tacke"},{"full_name":"Bähler, Martin","first_name":"Martin","last_name":"Bähler"},{"full_name":"Hanley, Peter","last_name":"Hanley","first_name":"Peter"}],"volume":292,"date_created":"2018-12-11T11:47:49Z","date_updated":"2021-01-12T08:08:34Z","year":"2017","publisher":"American Society for Biochemistry and Molecular Biology","department":[{"_id":"MiSi"}],"publication_status":"published","publist_id":"7059","file_date_updated":"2020-07-14T12:47:37Z","date_published":"2017-04-28T00:00:00Z","citation":{"mla":"Horsthemke, Markus, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” Journal of Biological Chemistry, vol. 292, no. 17, American Society for Biochemistry and Molecular Biology, 2017, pp. 7258–73, doi:10.1074/jbc.M116.766923.","short":"M. Horsthemke, A. Bachg, K. Groll, S. Moyzio, B. Müther, S. Hemkemeyer, R. Wedlich Söldner, M.K. Sixt, S. Tacke, M. Bähler, P. Hanley, Journal of Biological Chemistry 292 (2017) 7258–7273.","chicago":"Horsthemke, Markus, Anne Bachg, Katharina Groll, Sven Moyzio, Barbara Müther, Sandra Hemkemeyer, Roland Wedlich Söldner, et al. “Multiple Roles of Filopodial Dynamics in Particle Capture and Phagocytosis and Phenotypes of Cdc42 and Myo10 Deletion.” Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology, 2017. https://doi.org/10.1074/jbc.M116.766923.","ama":"Horsthemke M, Bachg A, Groll K, et al. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 2017;292(17):7258-7273. doi:10.1074/jbc.M116.766923","ista":"Horsthemke M, Bachg A, Groll K, Moyzio S, Müther B, Hemkemeyer S, Wedlich Söldner R, Sixt MK, Tacke S, Bähler M, Hanley P. 2017. Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. 292(17), 7258–7273.","apa":"Horsthemke, M., Bachg, A., Groll, K., Moyzio, S., Müther, B., Hemkemeyer, S., … Hanley, P. (2017). Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion. Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M116.766923","ieee":"M. Horsthemke et al., “Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion,” Journal of Biological Chemistry, vol. 292, no. 17. American Society for Biochemistry and Molecular Biology, pp. 7258–7273, 2017."},"publication":"Journal of Biological Chemistry","page":"7258 - 7273","article_type":"original","has_accepted_license":"1","day":"28","scopus_import":1,"file":[{"checksum":"d488162874326a4bb056065fa549dc4a","date_created":"2019-10-24T15:25:42Z","date_updated":"2020-07-14T12:47:37Z","relation":"main_file","file_id":"6971","file_size":5647880,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2017_JBC_Horsthemke.pdf"}],"oa_version":"Published Version","_id":"668","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 292","title":"Multiple roles of filopodial dynamics in particle capture and phagocytosis and phenotypes of Cdc42 and Myo10 deletion","status":"public","ddc":["570"],"issue":"17","abstract":[{"text":"Macrophage filopodia, finger-like membrane protrusions, were first implicated in phagocytosis more than 100 years ago, but little is still known about the involvement of these actin-dependent structures in particle clearance. Using spinning disk confocal microscopy to image filopodial dynamics in mouse resident Lifeact-EGFP macrophages, we show that filopodia, or filopodia-like structures, support pathogen clearance by multiple means. Filopodia supported the phagocytic uptake of bacterial (Escherichia coli) particles by (i) capturing along the filopodial shaft and surfing toward the cell body, the most common mode of capture; (ii) capturing via the tip followed by retraction; (iii) combinations of surfing and retraction; or (iv) sweeping actions. In addition, filopodia supported the uptake of zymosan (Saccharomyces cerevisiae) particles by (i) providing fixation, (ii) capturing at the tip and filopodia-guided actin anterograde flow with phagocytic cup formation, and (iii) the rapid growth of new protrusions. To explore the role of filopodia-inducing Cdc42, we generated myeloid-restricted Cdc42 knock-out mice. Cdc42-deficient macrophages exhibited rapid phagocytic cup kinetics, but reduced particle clearance, which could be explained by the marked rounded-up morphology of these cells. Macrophages lacking Myo10, thought to act downstream of Cdc42, had normal morphology, motility, and phagocytic cup formation, but displayed markedly reduced filopodia formation. In conclusion, live-cell imaging revealed multiple mechanisms involving macrophage filopodia in particle capture and engulfment. Cdc42 is not critical for filopodia or phagocytic cup formation, but plays a key role in driving macrophage lamellipodial spreading.","lang":"eng"}],"type":"journal_article"},{"scopus_import":1,"has_accepted_license":"1","article_processing_charge":"No","day":"01","citation":{"short":"L. Synek, N. Vukašinović, I. Kulich, M. Hála, K. Aldorfová, M. Fendrych, V. Žárský, Plant Physiology 174 (2017) 223–240.","mla":"Synek, Lukáš, et al. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” Plant Physiology, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 223–40, doi:10.1104/pp.16.01282.","chicago":"Synek, Lukáš, Nemanja Vukašinović, Ivan Kulich, Michal Hála, Klára Aldorfová, Matyas Fendrych, and Viktor Žárský. “EXO70C2 Is a Key Regulatory Factor for Optimal Tip Growth of Pollen.” Plant Physiology. American Society of Plant Biologists, 2017. https://doi.org/10.1104/pp.16.01282.","ama":"Synek L, Vukašinović N, Kulich I, et al. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 2017;174(1):223-240. doi:10.1104/pp.16.01282","apa":"Synek, L., Vukašinović, N., Kulich, I., Hála, M., Aldorfová, K., Fendrych, M., & Žárský, V. (2017). EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. American Society of Plant Biologists. https://doi.org/10.1104/pp.16.01282","ieee":"L. Synek et al., “EXO70C2 is a key regulatory factor for optimal tip growth of pollen,” Plant Physiology, vol. 174, no. 1. American Society of Plant Biologists, pp. 223–240, 2017.","ista":"Synek L, Vukašinović N, Kulich I, Hála M, Aldorfová K, Fendrych M, Žárský V. 2017. EXO70C2 is a key regulatory factor for optimal tip growth of pollen. Plant Physiology. 174(1), 223–240."},"publication":"Plant Physiology","page":"223 - 240","article_type":"original","date_published":"2017-05-01T00:00:00Z","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"The exocyst, a eukaryotic tethering complex, coregulates targeted exocytosis as an effector of small GTPases in polarized cell growth. In land plants, several exocyst subunits are encoded by double or triple paralogs, culminating in tens of EXO70 paralogs. Out of 23 Arabidopsis thaliana EXO70 isoforms, we analyzed seven isoforms expressed in pollen. Genetic and microscopic analyses of single mutants in EXO70A2, EXO70C1, EXO70C2, EXO70F1, EXO70H3, EXO70H5, and EXO70H6 genes revealed that only a loss-of-function EXO70C2 allele resulted in a significant male-specific transmission defect (segregation 40%:51%:9%) due to aberrant pollen tube growth. Mutant pollen tubes grown in vitro exhibited an enhanced growth rate and a decreased thickness of the tip cell wall, causing tip bursts. However, exo70C2 pollen tubes could frequently recover and restart their speedy elongation, resulting in a repetitive stop-and-go growth dynamics. A pollenspecific depletion of the closest paralog, EXO70C1, using artificial microRNA in the exo70C2 mutant background, resulted in a complete pollen-specific transmission defect, suggesting redundant functions of EXO70C1 and EXO70C2. Both EXO70C1 and EXO70C2, GFP tagged and expressed under the control of their native promoters, localized in the cytoplasm of pollen grains, pollen tubes, and also root trichoblast cells. The expression of EXO70C2-GFP complemented the aberrant growth of exo70C2 pollen tubes. The absent EXO70C2 interactions with core exocyst subunits in the yeast two-hybrid assay, cytoplasmic localization, and genetic effect suggest an unconventional EXO70 function possibly as a regulator of exocytosis outside the exocyst complex. In conclusion, EXO70C2 is a novel factor contributing to the regulation of optimal tip growth of Arabidopsis pollen tubes. "}],"_id":"669","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 174","ddc":["580"],"title":"EXO70C2 is a key regulatory factor for optimal tip growth of pollen","status":"public","oa_version":"Submitted Version","file":[{"file_size":2176903,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2017_PlantPhysio_Synek.pdf","checksum":"97155acc6aa5f0d0a78e0589a932fe02","date_created":"2019-11-18T16:16:18Z","date_updated":"2020-07-14T12:47:37Z","relation":"main_file","file_id":"7041"}],"publication_identifier":{"issn":["00320889"]},"month":"05","external_id":{"pmid":["28356503"]},"oa":1,"quality_controlled":"1","doi":"10.1104/pp.16.01282","language":[{"iso":"eng"}],"publist_id":"7058","file_date_updated":"2020-07-14T12:47:37Z","pmid":1,"year":"2017","department":[{"_id":"JiFr"}],"publisher":"American Society of Plant Biologists","publication_status":"published","author":[{"first_name":"Lukáš","last_name":"Synek","full_name":"Synek, Lukáš"},{"full_name":"Vukašinović, Nemanja","first_name":"Nemanja","last_name":"Vukašinović"},{"last_name":"Kulich","first_name":"Ivan","full_name":"Kulich, Ivan"},{"full_name":"Hála, Michal","first_name":"Michal","last_name":"Hála"},{"full_name":"Aldorfová, Klára","first_name":"Klára","last_name":"Aldorfová"},{"full_name":"Fendrych, Matyas","last_name":"Fendrych","first_name":"Matyas","orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Viktor","last_name":"Žárský","full_name":"Žárský, Viktor"}],"volume":174,"date_updated":"2021-01-12T08:08:35Z","date_created":"2018-12-11T11:47:49Z"},{"_id":"671","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Memory-n strategies of direct reciprocity","intvolume":" 114","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Humans routinely use conditionally cooperative strategies when interacting in repeated social dilemmas. They are more likely to cooperate if others cooperated before, and are ready to retaliate if others defected. To capture the emergence of reciprocity, most previous models consider subjects who can only choose from a restricted set of representative strategies, or who react to the outcome of the very last round only. As players memorize more rounds, the dimension of the strategy space increases exponentially. This increasing computational complexity renders simulations for individuals with higher cognitive abilities infeasible, especially if multiplayer interactions are taken into account. Here, we take an axiomatic approach instead. We propose several properties that a robust cooperative strategy for a repeated multiplayer dilemma should have. These properties naturally lead to a unique class of cooperative strategies, which contains the classical Win-Stay Lose-Shift rule as a special case. A comprehensive numerical analysis for the prisoner's dilemma and for the public goods game suggests that strategies of this class readily evolve across various memory-n spaces. Our results reveal that successful strategies depend not only on how cooperative others were in the past but also on the respective context of cooperation."}],"issue":"18","publication":"PNAS","citation":{"chicago":"Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.” PNAS. National Academy of Sciences, 2017. https://doi.org/10.1073/pnas.1621239114.","short":"C. Hilbe, V. Martinez, K. Chatterjee, M. Nowak, PNAS 114 (2017) 4715–4720.","mla":"Hilbe, Christian, et al. “Memory-n Strategies of Direct Reciprocity.” PNAS, vol. 114, no. 18, National Academy of Sciences, 2017, pp. 4715–20, doi:10.1073/pnas.1621239114.","apa":"Hilbe, C., Martinez, V., Chatterjee, K., & Nowak, M. (2017). Memory-n strategies of direct reciprocity. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1621239114","ieee":"C. Hilbe, V. Martinez, K. Chatterjee, and M. Nowak, “Memory-n strategies of direct reciprocity,” PNAS, vol. 114, no. 18. National Academy of Sciences, pp. 4715–4720, 2017.","ista":"Hilbe C, Martinez V, Chatterjee K, Nowak M. 2017. Memory-n strategies of direct reciprocity. PNAS. 114(18), 4715–4720.","ama":"Hilbe C, Martinez V, Chatterjee K, Nowak M. Memory-n strategies of direct reciprocity. PNAS. 2017;114(18):4715-4720. doi:10.1073/pnas.1621239114"},"page":"4715 - 4720","date_published":"2017-05-02T00:00:00Z","scopus_import":1,"day":"02","article_processing_charge":"Yes (in subscription journal)","year":"2017","pmid":1,"publication_status":"published","publisher":"National Academy of Sciences","department":[{"_id":"KrCh"}],"author":[{"full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","last_name":"Hilbe","first_name":"Christian"},{"full_name":"Martinez, Vaquero","last_name":"Martinez","first_name":"Vaquero"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"}],"date_updated":"2021-01-12T08:08:37Z","date_created":"2018-12-11T11:47:50Z","volume":114,"ec_funded":1,"publist_id":"7053","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5422766/","open_access":"1"}],"oa":1,"external_id":{"pmid":["28420786"]},"quality_controlled":"1","project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"}],"doi":"10.1073/pnas.1621239114","language":[{"iso":"eng"}],"month":"05","publication_identifier":{"issn":["00278424"]}},{"month":"05","publication_identifier":{"issn":["01677055"]},"quality_controlled":"1","project":[{"_id":"25357BD2-B435-11E9-9278-68D0E5697425","grant_number":"P 24352-N23","name":"Deep Pictures: Creating Visual and Haptic Vector Images","call_identifier":"FWF"}],"oa":1,"main_file_link":[{"url":"https://hal.inria.fr/hal-01647113/file/eg_2017_schreck_paper_tearing.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1111/cgf.13110","publist_id":"7056","publication_status":"published","publisher":"Wiley","department":[{"_id":"ChWo"}],"year":"2017","date_updated":"2021-01-12T08:08:37Z","date_created":"2018-12-11T11:47:49Z","volume":36,"author":[{"first_name":"Camille","last_name":"Schreck","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","full_name":"Schreck, Camille"},{"full_name":"Rohmer, Damien","last_name":"Rohmer","first_name":"Damien"},{"last_name":"Hahmann","first_name":"Stefanie","full_name":"Hahmann, Stefanie"}],"scopus_import":1,"day":"01","article_processing_charge":"No","article_type":"original","page":"95 - 106","publication":"Computer Graphics Forum","citation":{"ama":"Schreck C, Rohmer D, Hahmann S. Interactive paper tearing. Computer Graphics Forum. 2017;36(2):95-106. doi:10.1111/cgf.13110","ista":"Schreck C, Rohmer D, Hahmann S. 2017. Interactive paper tearing. Computer Graphics Forum. 36(2), 95–106.","apa":"Schreck, C., Rohmer, D., & Hahmann, S. (2017). Interactive paper tearing. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.13110","ieee":"C. Schreck, D. Rohmer, and S. Hahmann, “Interactive paper tearing,” Computer Graphics Forum, vol. 36, no. 2. Wiley, pp. 95–106, 2017.","mla":"Schreck, Camille, et al. “Interactive Paper Tearing.” Computer Graphics Forum, vol. 36, no. 2, Wiley, 2017, pp. 95–106, doi:10.1111/cgf.13110.","short":"C. Schreck, D. Rohmer, S. Hahmann, Computer Graphics Forum 36 (2017) 95–106.","chicago":"Schreck, Camille, Damien Rohmer, and Stefanie Hahmann. “Interactive Paper Tearing.” Computer Graphics Forum. Wiley, 2017. https://doi.org/10.1111/cgf.13110."},"date_published":"2017-05-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears."}],"issue":"2","title":"Interactive paper tearing","status":"public","ddc":["000"],"intvolume":" 36","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"670","oa_version":"Published Version"},{"publist_id":"7052","ec_funded":1,"file_date_updated":"2020-07-14T12:47:38Z","author":[{"full_name":"Vaahtomeri, Kari","orcid":"0000-0001-7829-3518","id":"368EE576-F248-11E8-B48F-1D18A9856A87","last_name":"Vaahtomeri","first_name":"Kari"},{"last_name":"Brown","first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Markus"},{"full_name":"Hauschild, Robert","first_name":"Robert","last_name":"Hauschild","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522"},{"full_name":"De Vries, Ingrid","last_name":"De Vries","first_name":"Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Leithner","first_name":"Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F"},{"orcid":"0000-0001-8599-1226","id":"3C23B994-F248-11E8-B48F-1D18A9856A87","last_name":"Mehling","first_name":"Matthias","full_name":"Mehling, Matthias"},{"last_name":"Kaufmann","first_name":"Walter","orcid":"0000-0001-9735-5315","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","full_name":"Kaufmann, Walter"},{"full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"}],"volume":19,"date_updated":"2023-02-23T12:50:09Z","date_created":"2018-12-11T11:47:50Z","year":"2017","department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"EM-Fac"}],"publisher":"Cell Press","publication_status":"published","publication_identifier":{"issn":["22111247"]},"month":"05","doi":"10.1016/j.celrep.2017.04.027","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"project":[{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","call_identifier":"FP7","grant_number":"281556","_id":"25A603A2-B435-11E9-9278-68D0E5697425"},{"_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","grant_number":"Y 564-B12","call_identifier":"FWF","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)"}],"quality_controlled":"1","issue":"5","abstract":[{"text":"Trafficking cells frequently transmigrate through epithelial and endothelial monolayers. How monolayers cooperate with the penetrating cells to support their transit is poorly understood. We studied dendritic cell (DC) entry into lymphatic capillaries as a model system for transendothelial migration. We find that the chemokine CCL21, which is the decisive guidance cue for intravasation, mainly localizes in the trans-Golgi network and intracellular vesicles of lymphatic endothelial cells. Upon DC transmigration, these Golgi deposits disperse and CCL21 becomes extracellularly enriched at the sites of endothelial cell-cell junctions. When we reconstitute the transmigration process in vitro, we find that secretion of CCL21-positive vesicles is triggered by a DC contact-induced calcium signal, and selective calcium chelation in lymphatic endothelium attenuates transmigration. Altogether, our data demonstrate a chemokine-mediated feedback between DCs and lymphatic endothelium, which facilitates transendothelial migration.","lang":"eng"}],"type":"journal_article","pubrep_id":"900","file":[{"access_level":"open_access","file_name":"IST-2017-900-v1+1_1-s2.0-S2211124717305211-main.pdf","file_size":2248814,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5109","checksum":"8fdddaab1f1d76a6ec9ca94dcb6b07a2","date_created":"2018-12-12T10:14:54Z","date_updated":"2020-07-14T12:47:38Z"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"672","intvolume":" 19","status":"public","title":"Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia","ddc":["570"],"has_accepted_license":"1","article_processing_charge":"Yes","day":"02","scopus_import":1,"date_published":"2017-05-02T00:00:00Z","citation":{"mla":"Vaahtomeri, Kari, et al. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” Cell Reports, vol. 19, no. 5, Cell Press, 2017, pp. 902–09, doi:10.1016/j.celrep.2017.04.027.","short":"K. Vaahtomeri, M. Brown, R. Hauschild, I. de Vries, A.F. Leithner, M. Mehling, W. Kaufmann, M.K. Sixt, Cell Reports 19 (2017) 902–909.","chicago":"Vaahtomeri, Kari, Markus Brown, Robert Hauschild, Ingrid de Vries, Alexander F Leithner, Matthias Mehling, Walter Kaufmann, and Michael K Sixt. “Locally Triggered Release of the Chemokine CCL21 Promotes Dendritic Cell Transmigration across Lymphatic Endothelia.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.027.","ama":"Vaahtomeri K, Brown M, Hauschild R, et al. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 2017;19(5):902-909. doi:10.1016/j.celrep.2017.04.027","ista":"Vaahtomeri K, Brown M, Hauschild R, de Vries I, Leithner AF, Mehling M, Kaufmann W, Sixt MK. 2017. Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. 19(5), 902–909.","apa":"Vaahtomeri, K., Brown, M., Hauschild, R., de Vries, I., Leithner, A. F., Mehling, M., … Sixt, M. K. (2017). Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.04.027","ieee":"K. Vaahtomeri et al., “Locally triggered release of the chemokine CCL21 promotes dendritic cell transmigration across lymphatic endothelia,” Cell Reports, vol. 19, no. 5. Cell Press, pp. 902–909, 2017."},"publication":"Cell Reports","page":"902 - 909"},{"oa_version":"None","intvolume":" 27","title":"Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"674","issue":"9","abstract":[{"lang":"eng","text":"Navigation of cells along gradients of guidance cues is a determining step in many developmental and immunological processes. Gradients can either be soluble or immobilized to tissues as demonstrated for the haptotactic migration of dendritic cells (DCs) toward higher concentrations of immobilized chemokine CCL21. To elucidate how gradient characteristics govern cellular response patterns, we here introduce an in vitro system allowing to track migratory responses of DCs to precisely controlled immobilized gradients of CCL21. We find that haptotactic sensing depends on the absolute CCL21 concentration and local steepness of the gradient, consistent with a scenario where DC directionality is governed by the signal-to-noise ratio of CCL21 binding to the receptor CCR7. We find that the conditions for optimal DC guidance are perfectly provided by the CCL21 gradients we measure in vivo. Furthermore, we find that CCR7 signal termination by the G-protein-coupled receptor kinase 6 (GRK6) is crucial for haptotactic but dispensable for chemotactic CCL21 gradient sensing in vitro and confirm those observations in vivo. These findings suggest that stable, tissue-bound CCL21 gradients as sustainable “roads” ensure optimal guidance in vivo."}],"type":"journal_article","date_published":"2017-05-09T00:00:00Z","page":"1314 - 1325","citation":{"chicago":"Schwarz, Jan, Veronika Bierbaum, Kari Vaahtomeri, Robert Hauschild, Markus Brown, Ingrid de Vries, Alexander F Leithner, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” Current Biology. Cell Press, 2017. https://doi.org/10.1016/j.cub.2017.04.004.","mla":"Schwarz, Jan, et al. “Dendritic Cells Interpret Haptotactic Chemokine Gradients in a Manner Governed by Signal to Noise Ratio and Dependent on GRK6.” Current Biology, vol. 27, no. 9, Cell Press, 2017, pp. 1314–25, doi:10.1016/j.cub.2017.04.004.","short":"J. Schwarz, V. Bierbaum, K. Vaahtomeri, R. Hauschild, M. Brown, I. de Vries, A.F. Leithner, A. Reversat, J. Merrin, T. Tarrant, M.T. Bollenbach, M.K. Sixt, Current Biology 27 (2017) 1314–1325.","ista":"Schwarz J, Bierbaum V, Vaahtomeri K, Hauschild R, Brown M, de Vries I, Leithner AF, Reversat A, Merrin J, Tarrant T, Bollenbach MT, Sixt MK. 2017. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 27(9), 1314–1325.","apa":"Schwarz, J., Bierbaum, V., Vaahtomeri, K., Hauschild, R., Brown, M., de Vries, I., … Sixt, M. K. (2017). Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2017.04.004","ieee":"J. Schwarz et al., “Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6,” Current Biology, vol. 27, no. 9. Cell Press, pp. 1314–1325, 2017.","ama":"Schwarz J, Bierbaum V, Vaahtomeri K, et al. Dendritic cells interpret haptotactic chemokine gradients in a manner governed by signal to noise ratio and dependent on GRK6. Current Biology. 2017;27(9):1314-1325. doi:10.1016/j.cub.2017.04.004"},"publication":"Current Biology","day":"09","scopus_import":1,"volume":27,"date_created":"2018-12-11T11:47:51Z","date_updated":"2023-02-23T12:50:44Z","author":[{"full_name":"Schwarz, Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Schwarz"},{"full_name":"Bierbaum, Veronika","id":"3FD04378-F248-11E8-B48F-1D18A9856A87","first_name":"Veronika","last_name":"Bierbaum"},{"full_name":"Vaahtomeri, Kari","id":"368EE576-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7829-3518","first_name":"Kari","last_name":"Vaahtomeri"},{"orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","last_name":"Hauschild","first_name":"Robert","full_name":"Hauschild, Robert"},{"full_name":"Brown, Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus","last_name":"Brown"},{"last_name":"De Vries","first_name":"Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","full_name":"De Vries, Ingrid"},{"last_name":"Leithner","first_name":"Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","full_name":"Leithner, Alexander F"},{"full_name":"Reversat, Anne","last_name":"Reversat","first_name":"Anne","orcid":"0000-0003-0666-8928","id":"35B76592-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Merrin, Jack","last_name":"Merrin","first_name":"Jack","orcid":"0000-0001-5145-4609","id":"4515C308-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tarrant, Teresa","last_name":"Tarrant","first_name":"Teresa"},{"full_name":"Bollenbach, Tobias","first_name":"Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K"}],"publisher":"Cell Press","department":[{"_id":"MiSi"},{"_id":"Bio"},{"_id":"NanoFab"}],"publication_status":"published","year":"2017","ec_funded":1,"publist_id":"7050","language":[{"iso":"eng"}],"doi":"10.1016/j.cub.2017.04.004","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"Y 564-B12","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)","call_identifier":"FWF"}],"quality_controlled":"1","publication_identifier":{"issn":["09609822"]},"month":"05"},{"author":[{"last_name":"Lademann","first_name":"Claudio","full_name":"Lademann, Claudio"},{"full_name":"Renkawitz, Jörg","last_name":"Renkawitz","first_name":"Jörg","orcid":"0000-0003-2856-3369","id":"3F0587C8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pfander, Boris","first_name":"Boris","last_name":"Pfander"},{"full_name":"Jentsch, Stefan","first_name":"Stefan","last_name":"Jentsch"}],"date_updated":"2021-01-12T08:08:57Z","date_created":"2018-12-11T11:47:52Z","volume":19,"year":"2017","publication_status":"published","publisher":"Cell Press","department":[{"_id":"MiSi"}],"file_date_updated":"2020-07-14T12:47:40Z","publist_id":"7046","doi":"10.1016/j.celrep.2017.04.051","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"quality_controlled":"1","month":"05","publication_identifier":{"issn":["22111247"]},"pubrep_id":"899","oa_version":"Published Version","file":[{"checksum":"efc7287d9c6354983cb151880e9ad72a","date_created":"2018-12-12T10:15:48Z","date_updated":"2020-07-14T12:47:40Z","relation":"main_file","file_id":"5171","file_size":3005610,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2017-899-v1+1_1-s2.0-S2211124717305454-main.pdf"}],"_id":"677","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["570"],"title":"The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination","intvolume":" 19","abstract":[{"lang":"eng","text":"The INO80 complex (INO80-C) is an evolutionarily conserved nucleosome remodeler that acts in transcription, replication, and genome stability. It is required for resistance against genotoxic agents and is involved in the repair of DNA double-strand breaks (DSBs) by homologous recombination (HR). However, the causes of the HR defect in INO80-C mutant cells are controversial. Here, we unite previous findings using a system to study HR with high spatial resolution in budding yeast. We find that INO80-C has at least two distinct functions during HR—DNA end resection and presynaptic filament formation. Importantly, the second function is linked to the histone variant H2A.Z. In the absence of H2A.Z, presynaptic filament formation and HR are restored in INO80-C-deficient mutants, suggesting that presynaptic filament formation is the crucial INO80-C function during HR."}],"issue":"7","type":"journal_article","date_published":"2017-05-16T00:00:00Z","publication":"Cell Reports","citation":{"apa":"Lademann, C., Renkawitz, J., Pfander, B., & Jentsch, S. (2017). The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. Cell Press. https://doi.org/10.1016/j.celrep.2017.04.051","ieee":"C. Lademann, J. Renkawitz, B. Pfander, and S. Jentsch, “The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination,” Cell Reports, vol. 19, no. 7. Cell Press, pp. 1294–1303, 2017.","ista":"Lademann C, Renkawitz J, Pfander B, Jentsch S. 2017. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 19(7), 1294–1303.","ama":"Lademann C, Renkawitz J, Pfander B, Jentsch S. The INO80 complex removes H2A.Z to promote presynaptic filament formation during homologous recombination. Cell Reports. 2017;19(7):1294-1303. doi:10.1016/j.celrep.2017.04.051","chicago":"Lademann, Claudio, Jörg Renkawitz, Boris Pfander, and Stefan Jentsch. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” Cell Reports. Cell Press, 2017. https://doi.org/10.1016/j.celrep.2017.04.051.","short":"C. Lademann, J. Renkawitz, B. Pfander, S. Jentsch, Cell Reports 19 (2017) 1294–1303.","mla":"Lademann, Claudio, et al. “The INO80 Complex Removes H2A.Z to Promote Presynaptic Filament Formation during Homologous Recombination.” Cell Reports, vol. 19, no. 7, Cell Press, 2017, pp. 1294–303, doi:10.1016/j.celrep.2017.04.051."},"page":"1294 - 1303","day":"16","has_accepted_license":"1","scopus_import":1},{"issue":"6","publist_id":"7040","abstract":[{"text":"The seminal observation that mechanical signals can elicit changes in biochemical signalling within cells, a process commonly termed mechanosensation and mechanotransduction, has revolutionized our understanding of the role of cell mechanics in various fundamental biological processes, such as cell motility, adhesion, proliferation and differentiation. In this Review, we will discuss how the interplay and feedback between mechanical and biochemical signals control tissue morphogenesis and cell fate specification in embryonic development.","lang":"eng"}],"type":"journal_article","author":[{"full_name":"Petridou, Nicoletta","first_name":"Nicoletta","last_name":"Petridou","id":"2A003F6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8451-1195"},{"full_name":"Spiro, Zoltan P","first_name":"Zoltan P","last_name":"Spiro","id":"426AD026-F248-11E8-B48F-1D18A9856A87"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J"}],"volume":19,"oa_version":"None","date_updated":"2021-01-12T08:08:59Z","date_created":"2018-12-11T11:47:53Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","_id":"678","year":"2017","department":[{"_id":"CaHe"}],"intvolume":" 19","publisher":"Nature Publishing Group","publication_status":"published","title":"Multiscale force sensing in development","status":"public","publication_identifier":{"issn":["14657392"]},"day":"31","month":"05","scopus_import":1,"date_published":"2017-05-31T00:00:00Z","doi":"10.1038/ncb3524","language":[{"iso":"eng"}],"citation":{"ama":"Petridou N, Spiro ZP, Heisenberg C-PJ. Multiscale force sensing in development. Nature Cell Biology. 2017;19(6):581-588. doi:10.1038/ncb3524","apa":"Petridou, N., Spiro, Z. P., & Heisenberg, C.-P. J. (2017). Multiscale force sensing in development. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb3524","ieee":"N. Petridou, Z. P. Spiro, and C.-P. J. Heisenberg, “Multiscale force sensing in development,” Nature Cell Biology, vol. 19, no. 6. Nature Publishing Group, pp. 581–588, 2017.","ista":"Petridou N, Spiro ZP, Heisenberg C-PJ. 2017. Multiscale force sensing in development. Nature Cell Biology. 19(6), 581–588.","short":"N. Petridou, Z.P. Spiro, C.-P.J. Heisenberg, Nature Cell Biology 19 (2017) 581–588.","mla":"Petridou, Nicoletta, et al. “Multiscale Force Sensing in Development.” Nature Cell Biology, vol. 19, no. 6, Nature Publishing Group, 2017, pp. 581–88, doi:10.1038/ncb3524.","chicago":"Petridou, Nicoletta, Zoltan P Spiro, and Carl-Philipp J Heisenberg. “Multiscale Force Sensing in Development.” Nature Cell Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/ncb3524."},"publication":"Nature Cell Biology","project":[{"grant_number":"ALTF534-2016","_id":"25236028-B435-11E9-9278-68D0E5697425","name":"The generation and function of anisotropic tissue tension in zebrafish epiboly (EMBO Fellowship)"}],"page":"581 - 588","quality_controlled":"1"},{"publication_identifier":{"issn":["08905401"]},"month":"06","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","external_id":{"arxiv":["1311.3238"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1311.3238","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2016.10.012","publist_id":"7036","ec_funded":1,"publisher":"Elsevier","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2017","volume":254,"date_created":"2018-12-11T11:47:53Z","date_updated":"2023-02-21T16:06:02Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10885"}]},"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"first_name":"Emmanuel","last_name":"Filiot","full_name":"Filiot, Emmanuel"},{"last_name":"Raskin","first_name":"Jean","full_name":"Raskin, Jean"}],"scopus_import":"1","article_processing_charge":"No","day":"01","page":"296 - 315","article_type":"original","citation":{"mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation, vol. 254, Elsevier, 2017, pp. 296–315, doi:10.1016/j.ic.2016.10.012.","short":"K. Chatterjee, L. Doyen, E. Filiot, J. Raskin, Information and Computation 254 (2017) 296–315.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.” Information and Computation. Elsevier, 2017. https://doi.org/10.1016/j.ic.2016.10.012.","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J. Doomsday equilibria for omega-regular games. Information and Computation. 2017;254:296-315. doi:10.1016/j.ic.2016.10.012","ista":"Chatterjee K, Doyen L, Filiot E, Raskin J. 2017. Doomsday equilibria for omega-regular games. Information and Computation. 254, 296–315.","apa":"Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J. (2017). Doomsday equilibria for omega-regular games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.012","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J. Raskin, “Doomsday equilibria for omega-regular games,” Information and Computation, vol. 254. Elsevier, pp. 296–315, 2017."},"publication":"Information and Computation","date_published":"2017-06-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information. In this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile where all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players' objective, then the objective of every player is violated. We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.","lang":"eng"}],"intvolume":" 254","status":"public","title":"Doomsday equilibria for omega-regular games","_id":"681","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version"},{"scopus_import":1,"month":"02","day":"21","publication":"5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings","citation":{"ista":"Martius GS, Lampert C. 2017. Extrapolation and learning equations. 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. ICLR: International Conference on Learning Representations.","apa":"Martius, G. S., & Lampert, C. (2017). Extrapolation and learning equations. In 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. Toulon, France: International Conference on Learning Representations.","ieee":"G. S. Martius and C. Lampert, “Extrapolation and learning equations,” in 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, Toulon, France, 2017.","ama":"Martius GS, Lampert C. Extrapolation and learning equations. In: 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. International Conference on Learning Representations; 2017.","chicago":"Martius, Georg S, and Christoph Lampert. “Extrapolation and Learning Equations.” In 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings. International Conference on Learning Representations, 2017.","mla":"Martius, Georg S., and Christoph Lampert. “Extrapolation and Learning Equations.” 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017.","short":"G.S. Martius, C. Lampert, in:, 5th International Conference on Learning Representations, ICLR 2017 - Workshop Track Proceedings, International Conference on Learning Representations, 2017."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1610.02995"}],"external_id":{"arxiv":["1610.02995"]},"oa":1,"quality_controlled":"1","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"}],"conference":{"location":"Toulon, France","start_date":"2017-04-24","end_date":"2017-04-26","name":"ICLR: International Conference on Learning Representations"},"date_published":"2017-02-21T00:00:00Z","language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"In classical machine learning, regression is treated as a black box process of identifying a suitable function from a hypothesis set without attempting to gain insight into the mechanism connecting inputs and outputs. In the natural sciences, however, finding an interpretable function for a phenomenon is the prime goal as it allows to understand and generalize results. This paper proposes a novel type of function learning network, called equation learner (EQL), that can learn analytical expressions and is able to extrapolate to unseen domains. It is implemented as an end-to-end differentiable feed-forward network and allows for efficient gradient based training. Due to sparsity regularization concise interpretable expressions can be obtained. Often the true underlying source expression is identified."}],"ec_funded":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6841","year":"2017","title":"Extrapolation and learning equations","status":"public","publication_status":"published","publisher":"International Conference on Learning Representations","department":[{"_id":"ChLa"}],"author":[{"full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","first_name":"Georg S","last_name":"Martius"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"date_updated":"2021-01-12T08:09:17Z","date_created":"2019-09-01T22:01:00Z","oa_version":"Preprint"},{"publist_id":"7026","department":[{"_id":"KrCh"}],"publisher":"Cambridge University Press","publication_status":"published","year":"2017","volume":82,"date_updated":"2021-04-16T12:10:53Z","date_created":"2018-12-11T11:47:54Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"publication_identifier":{"issn":["0022-4812"],"eissn":["1943-5886"]},"month":"06","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1206.5174"}],"language":[{"iso":"eng"}],"doi":"10.1017/jsl.2016.71","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic."}],"intvolume":" 82","status":"public","title":"Obligation blackwell games and p-automata","_id":"684","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","scopus_import":"1","article_processing_charge":"No","day":"01","page":"420 - 452","citation":{"ista":"Chatterjee K, Piterman N. 2017. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 82(2), 420–452.","apa":"Chatterjee, K., & Piterman, N. (2017). Obligation blackwell games and p-automata. Journal of Symbolic Logic. Cambridge University Press. https://doi.org/10.1017/jsl.2016.71","ieee":"K. Chatterjee and N. Piterman, “Obligation blackwell games and p-automata,” Journal of Symbolic Logic, vol. 82, no. 2. Cambridge University Press, pp. 420–452, 2017.","ama":"Chatterjee K, Piterman N. Obligation blackwell games and p-automata. Journal of Symbolic Logic. 2017;82(2):420-452. doi:10.1017/jsl.2016.71","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic. Cambridge University Press, 2017. https://doi.org/10.1017/jsl.2016.71.","mla":"Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.” Journal of Symbolic Logic, vol. 82, no. 2, Cambridge University Press, 2017, pp. 420–52, doi:10.1017/jsl.2016.71.","short":"K. Chatterjee, N. Piterman, Journal of Symbolic Logic 82 (2017) 420–452."},"publication":"Journal of Symbolic Logic","date_published":"2017-06-01T00:00:00Z"},{"publication_identifier":{"issn":["09254773"]},"month":"06","doi":"10.1016/j.mod.2017.03.005","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["28366718"]},"project":[{"name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020","grant_number":"680037","_id":"B6FC0238-B512-11E9-945C-1524E6697425"}],"quality_controlled":"1","publist_id":"7025","ec_funded":1,"file_date_updated":"2020-07-14T12:47:42Z","author":[{"first_name":"James","last_name":"Briscoe","full_name":"Briscoe, James"},{"full_name":"Kicheva, Anna","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","last_name":"Kicheva","first_name":"Anna"}],"volume":145,"date_created":"2018-12-11T11:47:55Z","date_updated":"2021-01-12T08:09:20Z","pmid":1,"year":"2017","publisher":"Elsevier","department":[{"_id":"AnKi"}],"publication_status":"published","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2017-06-01T00:00:00Z","citation":{"chicago":"Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development. Elsevier, 2017. https://doi.org/10.1016/j.mod.2017.03.005.","mla":"Briscoe, James, and Anna Kicheva. “The Physics of Development 100 Years after D’Arcy Thompson’s ‘on Growth and Form.’” Mechanisms of Development, vol. 145, Elsevier, 2017, pp. 26–31, doi:10.1016/j.mod.2017.03.005.","short":"J. Briscoe, A. Kicheva, Mechanisms of Development 145 (2017) 26–31.","ista":"Briscoe J, Kicheva A. 2017. The physics of development 100 years after D’Arcy Thompson’s “on growth and form”. Mechanisms of Development. 145, 26–31.","ieee":"J. Briscoe and A. Kicheva, “The physics of development 100 years after D’Arcy Thompson’s ‘on growth and form,’” Mechanisms of Development, vol. 145. Elsevier, pp. 26–31, 2017.","apa":"Briscoe, J., & Kicheva, A. (2017). The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development. Elsevier. https://doi.org/10.1016/j.mod.2017.03.005","ama":"Briscoe J, Kicheva A. The physics of development 100 years after D’Arcy Thompson’s “on growth and form.” Mechanisms of Development. 2017;145:26-31. doi:10.1016/j.mod.2017.03.005"},"publication":"Mechanisms of Development","page":"26 - 31","abstract":[{"lang":"eng","text":"By applying methods and principles from the physical sciences to biological problems, D'Arcy Thompson's On Growth and Form demonstrated how mathematical reasoning reveals elegant, simple explanations for seemingly complex processes. This has had a profound influence on subsequent generations of developmental biologists. We discuss how this influence can be traced through twentieth century morphologists, embryologists and theoreticians to current research that explores the molecular and cellular mechanisms of tissue growth and patterning, including our own studies of the vertebrate neural tube."}],"type":"journal_article","pubrep_id":"985","file":[{"creator":"dernst","content_type":"application/pdf","file_size":652313,"file_name":"2017_Briscoe_Kicheva_and_DArcy_accepted_version.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:42Z","date_created":"2019-04-17T07:58:48Z","checksum":"727043d2e4199fbef6b3704e6d1ac105","file_id":"6335","relation":"main_file"}],"oa_version":"Submitted Version","_id":"685","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 145","ddc":["571"],"title":"The physics of development 100 years after D'Arcy Thompson's “on growth and form”","status":"public"},{"file_date_updated":"2020-07-14T12:47:42Z","publist_id":"7021","publication_status":"published","department":[{"_id":"HeEd"},{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2017","date_updated":"2021-01-12T08:09:26Z","date_created":"2018-12-11T11:47:56Z","volume":77,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert","last_name":"Wagner"}],"month":"06","publication_identifier":{"issn":["18688969"]},"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"conference":{"location":"Brisbane, Australia","start_date":"2017-07-04","end_date":"2017-07-07","name":"Symposium on Computational Geometry, SoCG"},"doi":"10.4230/LIPIcs.SoCG.2017.39","alternative_title":["LIPIcs"],"type":"conference","abstract":[{"lang":"eng","text":"We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. "}],"status":"public","ddc":["514","516"],"title":"Topological data analysis with Bregman divergences","intvolume":" 77","_id":"688","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":990546,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-895-v1+1_LIPIcs-SoCG-2017-39.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:42Z","date_created":"2018-12-12T10:11:03Z","checksum":"067ab0cb3f962bae6c3af6bf0094e0f3","relation":"main_file","file_id":"4856"}],"oa_version":"Published Version","pubrep_id":"895","scopus_import":1,"day":"01","has_accepted_license":"1","page":"391-3916","citation":{"chicago":"Edelsbrunner, Herbert, and Hubert Wagner. “Topological Data Analysis with Bregman Divergences,” 77:391–3916. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.SoCG.2017.39.","mla":"Edelsbrunner, Herbert, and Hubert Wagner. Topological Data Analysis with Bregman Divergences. Vol. 77, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916, doi:10.4230/LIPIcs.SoCG.2017.39.","short":"H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916.","ista":"Edelsbrunner H, Wagner H. 2017. Topological data analysis with Bregman divergences. Symposium on Computational Geometry, SoCG, LIPIcs, vol. 77, 391–3916.","apa":"Edelsbrunner, H., & Wagner, H. (2017). Topological data analysis with Bregman divergences (Vol. 77, pp. 391–3916). Presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2017.39","ieee":"H. Edelsbrunner and H. Wagner, “Topological data analysis with Bregman divergences,” presented at the Symposium on Computational Geometry, SoCG, Brisbane, Australia, 2017, vol. 77, pp. 391–3916.","ama":"Edelsbrunner H, Wagner H. Topological data analysis with Bregman divergences. In: Vol 77. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:391-3916. doi:10.4230/LIPIcs.SoCG.2017.39"},"date_published":"2017-06-01T00:00:00Z"}]