[{"series_title":"Advances in Anatomy Embryology and Cell Biology","_id":"634","status":"public","type":"book_chapter","date_updated":"2021-01-12T08:07:08Z","department":[{"_id":"GaNo"}],"oa_version":"None","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."}],"month":"05","intvolume":" 224","scopus_import":1,"alternative_title":["ADVSANAT"],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-319-52498-6"]},"publication_status":"published","volume":224,"project":[{"grant_number":"F03523","name":"Transmembrane Transporters in Health and Disease","_id":"25473368-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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","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","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.","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."},"editor":[{"first_name":"Michael","full_name":"Schmeisser, Michael","last_name":"Schmeisser"},{"last_name":"Boekers","full_name":"Boekers, Tobias","first_name":"Tobias"}],"title":"Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder","author":[{"first_name":"Jan","full_name":"Schroeder, Jan","last_name":"Schroeder"},{"first_name":"Elena","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","last_name":"Deliu","full_name":"Deliu, Elena","orcid":"0000-0002-7370-5293"},{"last_name":"Novarino","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia"},{"last_name":"Schmeisser","full_name":"Schmeisser, Michael","first_name":"Michael"}],"publist_id":"7156","publisher":"Springer","quality_controlled":"1","day":"28","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","year":"2017","doi":"10.1007/978-3-319-52498-6_10","date_published":"2017-05-28T00:00:00Z","date_created":"2018-12-11T11:47:37Z","page":"189 - 211"},{"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T11:47:37Z","doi":"10.1007/978-3-319-63501-9_6","date_published":"2017-01-01T00:00:00Z","page":"83 - 89","day":"01","year":"2017","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"editor":[{"first_name":"Alessandro","last_name":"Abate","full_name":"Abate, Alessandro"},{"last_name":"Bodo","full_name":"Bodo, Sylvie","first_name":"Sylvie"}],"title":"Challenges and tool implementation of hybrid rapidly exploring random trees","publist_id":"7159","author":[{"last_name":"Bak","full_name":"Bak, Stanley","first_name":"Stanley"},{"first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Aviral","full_name":"Kumar, Aviral","last_name":"Kumar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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.","short":"S. Bak, S. Bogomolov, T.A. Henzinger, A. Kumar, in:, A. Abate, S. Bodo (Eds.), Springer, 2017, 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","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"},"intvolume":" 10381","month":"01","scopus_import":1,"alternative_title":["LNCS"],"oa_version":"None","abstract":[{"lang":"eng","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."}],"volume":10381,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331963500-2"]},"status":"public","conference":{"start_date":"2017-07-22","end_date":"2017-07-23","location":"Heidelberg, Germany","name":"NSV: Numerical Software Verification"},"type":"conference","_id":"633","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:07:06Z"},{"date_updated":"2021-01-12T08:07:10Z","department":[{"_id":"KrPi"}],"_id":"635","conference":{"start_date":"2017-04-30","end_date":"2017-05-04","location":"Paris, France","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-331956616-0"]},"language":[{"iso":"eng"}],"ec_funded":1,"volume":10212,"abstract":[{"lang":"eng","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."}],"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/989"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10212","month":"01","citation":{"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.","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","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.","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.","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.","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."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen"},{"first_name":"Binchi","full_name":"Chen, Binchi","last_name":"Chen"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Leonid","last_name":"Reyzin","full_name":"Reyzin, Leonid"},{"last_name":"Tessaro","full_name":"Tessaro, Stefano","first_name":"Stefano"}],"publist_id":"7154","title":"Scrypt is maximally memory hard","editor":[{"full_name":"Coron, Jean-Sébastien","last_name":"Coron","first_name":"Jean-Sébastien"},{"full_name":"Buus Nielsen, Jesper","last_name":"Buus Nielsen","first_name":"Jesper"}],"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"year":"2017","day":"01","page":"33 - 62","date_created":"2018-12-11T11:47:37Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-56617-7_2","oa":1,"quality_controlled":"1","publisher":"Springer"},{"volume":10419,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331965764-6"]},"publication_status":"published","month":"08","intvolume":" 10419","alternative_title":["LNCS"],"scopus_import":1,"main_file_link":[{"url":"https://hal.archives-ouvertes.fr/hal-01552132","open_access":"1"}],"oa_version":"Submitted Version","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"}],"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:07:14Z","status":"public","type":"conference","conference":{"name":"FORMATS: Formal Modelling and Analysis of Timed Systems","end_date":"2017-09-07","location":"Berlin, Germany","start_date":"2017-09-05"},"_id":"636","date_published":"2017-08-03T00:00:00Z","doi":"10.1007/978-3-319-65765-3_11","date_created":"2018-12-11T11:47:38Z","page":"189 - 206","day":"03","year":"2017","publisher":"Springer","quality_controlled":"1","oa":1,"title":"On the quantitative semantics of regular expressions over real-valued signals","editor":[{"full_name":"Abate, Alessandro","last_name":"Abate","first_name":"Alessandro"},{"last_name":"Geeraerts","full_name":"Geeraerts, Gilles","first_name":"Gilles"}],"publist_id":"7152","author":[{"first_name":"Alexey","full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin"},{"orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"first_name":"Dogan","full_name":"Ulus, Dogan","last_name":"Ulus"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206.","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.","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","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.","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.","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."},"project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211"}]},{"oa_version":"None","abstract":[{"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.","lang":"eng"}],"month":"01","intvolume":" 10152","publisher":"Springer","quality_controlled":"1","day":"01","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-319-54292-8"],"issn":["0302-9743"]},"year":"2017","publication_status":"published","doi":"10.1007/978-3-319-54292-8","volume":10152,"date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:38Z","series_title":"LNCS","_id":"638","status":"public","type":"conference_editor","conference":{"start_date":"2016-07-17","end_date":"2016-07-18","location":"Toronto, ON, Canada","name":"NSV: Numerical Software Verification"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","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.","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017.","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","mla":"Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8."},"date_updated":"2022-05-24T07:09:52Z","department":[{"_id":"ToHe"}],"editor":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy"},{"first_name":"Matthieu","last_name":"Martel","full_name":"Martel, Matthieu"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"title":"Numerical Software Verification","publist_id":"7150","article_processing_charge":"No"}]