[{"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:05:53Z","status":"public","type":"conference","conference":{"name":"TCC: Theory of Cryptography Conference","start_date":"2017-11-12","location":"Baltimore, MD, United States","end_date":"2017-11-15"},"_id":"605","volume":10677,"ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-331970499-9"]},"publication_status":"published","month":"11","intvolume":" 10677","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/536"}],"oa_version":"Submitted Version","abstract":[{"text":"Position based cryptography (PBC), proposed in the seminal work of Chandran, Goyal, Moriarty, and Ostrovsky (SIAM J. Computing, 2014), aims at constructing cryptographic schemes in which the identity of the user is his geographic position. Chandran et al. construct PBC schemes for secure positioning and position-based key agreement in the bounded-storage model (Maurer, J. Cryptology, 1992). Apart from bounded memory, their security proofs need a strong additional restriction on the power of the adversary: he cannot compute joint functions of his inputs. Removing this assumption is left as an open problem. We show that an answer to this question would resolve a long standing open problem in multiparty communication complexity: finding a function that is hard to compute with low communication complexity in the simultaneous message model, but easy to compute in the fully adaptive model. On a more positive side: we also show some implications in the other direction, i.e.: we prove that lower bounds on the communication complexity of certain multiparty problems imply existence of PBC primitives. Using this result we then show two attractive ways to “bypass” our hardness result: the first uses the random oracle model, the second weakens the locality requirement in the bounded-storage model to online computability. The random oracle construction is arguably one of the simplest proposed so far in this area. Our results indicate that constructing improved provably secure protocols for PBC requires a better understanding of multiparty communication complexity. This is yet another example where negative results in one area (in our case: lower bounds in multiparty communication complexity) can be used to construct secure cryptographic schemes.","lang":"eng"}],"editor":[{"first_name":"Yael","full_name":"Kalai, Yael","last_name":"Kalai"},{"full_name":"Reyzin, Leonid","last_name":"Reyzin","first_name":"Leonid"}],"title":"Position based cryptography and multiparty communication complexity","author":[{"first_name":"Joshua","last_name":"Brody","full_name":"Brody, Joshua"},{"first_name":"Stefan","full_name":"Dziembowski, Stefan","last_name":"Dziembowski"},{"first_name":"Sebastian","last_name":"Faust","full_name":"Faust, Sebastian"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7200","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3.","ama":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. Position based cryptography and multiparty communication complexity. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:56-81. doi:10.1007/978-3-319-70500-2_3","apa":"Brody, J., Dziembowski, S., Faust, S., & Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_3","short":"J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.","ieee":"J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.","chicago":"Brody, Joshua, Stefan Dziembowski, Sebastian Faust, and Krzysztof Z Pietrzak. “Position Based Cryptography and Multiparty Communication Complexity.” edited by Yael Kalai and Leonid Reyzin, 10677:56–81. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_3.","ista":"Brody J, Dziembowski S, Faust S, Pietrzak KZ. 2017. Position based cryptography and multiparty communication complexity. TCC: Theory of Cryptography Conference, LNCS, vol. 10677, 56–81."},"project":[{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"date_published":"2017-11-05T00:00:00Z","doi":"10.1007/978-3-319-70500-2_3","date_created":"2018-12-11T11:47:27Z","page":"56 - 81","day":"05","year":"2017","publisher":"Springer","quality_controlled":"1","oa":1},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” In Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, 11:444–95. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781782626800-00444.","ista":"Lemeshko M, Schmidt R. 2017.Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Theoretical and Computational Chemistry Series, vol. 11, 444–495.","mla":"Lemeshko, Mikhail, and Richard Schmidt. “Molecular Impurities Interacting with a Many-Particle Environment: From Ultracold Gases to Helium Nanodroplets.” Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , edited by Oliver Dulieu and Andreas Osterwalder, vol. 11, The Royal Society of Chemistry, 2017, pp. 444–95, doi:10.1039/9781782626800-00444.","short":"M. Lemeshko, R. Schmidt, in:, O. Dulieu, A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , The Royal Society of Chemistry, 2017, pp. 444–495.","ieee":"M. Lemeshko and R. Schmidt, “Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets,” in Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero , vol. 11, O. Dulieu and A. Osterwalder, Eds. The Royal Society of Chemistry, 2017, pp. 444–495.","apa":"Lemeshko, M., & Schmidt, R. (2017). Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In O. Dulieu & A. Osterwalder (Eds.), Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero (Vol. 11, pp. 444–495). The Royal Society of Chemistry. https://doi.org/10.1039/9781782626800-00444","ama":"Lemeshko M, Schmidt R. Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets. In: Dulieu O, Osterwalder A, eds. Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero . Vol 11. Theoretical and Computational Chemistry Series. The Royal Society of Chemistry; 2017:444-495. doi:10.1039/9781782626800-00444"},"title":"Molecular impurities interacting with a many-particle environment: From ultracold gases to helium nanodroplets","editor":[{"first_name":"Oliver","last_name":"Dulieu","full_name":"Dulieu, Oliver"},{"first_name":"Andreas","full_name":"Osterwalder, Andreas","last_name":"Osterwalder"}],"author":[{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko"},{"full_name":"Schmidt, Richard","last_name":"Schmidt","first_name":"Richard"}],"publist_id":"7201","publisher":"The Royal Society of Chemistry","quality_controlled":"1","oa":1,"day":"14","publication":"Cold Chemistry: Molecular Scattering and Reactivity Near Absolute Zero ","year":"2017","doi":"10.1039/9781782626800-00444","date_published":"2017-12-14T00:00:00Z","date_created":"2018-12-11T11:47:27Z","page":"444 - 495","series_title":"Theoretical and Computational Chemistry Series","_id":"604","status":"public","type":"book_chapter","date_updated":"2021-01-12T08:05:50Z","department":[{"_id":"MiLe"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In several settings of physics and chemistry one has to deal with molecules interacting with some kind of an external environment, be it a gas, a solution, or a crystal surface. Understanding molecular processes in the presence of such a many-particle bath is inherently challenging, and usually requires large-scale numerical computations. Here, we present an alternative approach to the problem, based on the notion of the angulon quasiparticle. We show that molecules rotating inside superfluid helium nanodroplets and Bose–Einstein condensates form angulons, and therefore can be described by straightforward solutions of a simple microscopic Hamiltonian. Casting the problem in the language of angulons allows us not only to greatly simplify it, but also to gain insights into the origins of the observed phenomena and to make predictions for future experimental studies."}],"month":"12","intvolume":" 11","scopus_import":1,"alternative_title":["Theoretical and Computational Chemistry Series"],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.06753"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["20413181"]},"publication_status":"published","volume":11},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"J. F. Alwen and B. Tackmann, “Moderately hard functions: Definition, instantiations, and applications,” presented at the TCC: Theory of Cryptography, Baltimore, MD, United States, 2017, vol. 10677, pp. 493–526.","short":"J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.","ama":"Alwen JF, Tackmann B. Moderately hard functions: Definition, instantiations, and applications. In: Kalai Y, Reyzin L, eds. Vol 10677. Springer; 2017:493-526. doi:10.1007/978-3-319-70500-2_17","apa":"Alwen, J. F., & Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai & L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer. https://doi.org/10.1007/978-3-319-70500-2_17","mla":"Alwen, Joel F., and Björn Tackmann. Moderately Hard Functions: Definition, Instantiations, and Applications. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 493–526, doi:10.1007/978-3-319-70500-2_17.","ista":"Alwen JF, Tackmann B. 2017. Moderately hard functions: Definition, instantiations, and applications. TCC: Theory of Cryptography, LNCS, vol. 10677, 493–526.","chicago":"Alwen, Joel F, and Björn Tackmann. “Moderately Hard Functions: Definition, Instantiations, and Applications.” edited by Yael Kalai and Leonid Reyzin, 10677:493–526. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_17."},"title":"Moderately hard functions: Definition, instantiations, and applications","editor":[{"first_name":"Yael","full_name":"Kalai, Yael","last_name":"Kalai"},{"full_name":"Reyzin, Leonid","last_name":"Reyzin","first_name":"Leonid"}],"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","full_name":"Alwen, Joel F","last_name":"Alwen"},{"last_name":"Tackmann","full_name":"Tackmann, Björn","first_name":"Björn"}],"publist_id":"7196","oa":1,"quality_controlled":"1","publisher":"Springer","day":"05","year":"2017","date_created":"2018-12-11T11:47:28Z","date_published":"2017-11-05T00:00:00Z","doi":"10.1007/978-3-319-70500-2_17","page":"493 - 526","_id":"609","status":"public","conference":{"start_date":"2017-11-12","location":"Baltimore, MD, United States","end_date":"2017-11-15","name":"TCC: Theory of Cryptography"},"type":"conference","date_updated":"2021-01-12T08:06:04Z","department":[{"_id":"KrPi"}],"oa_version":"Submitted Version","abstract":[{"text":"Several cryptographic schemes and applications are based on functions that are both reasonably efficient to compute and moderately hard to invert, including client puzzles for Denial-of-Service protection, password protection via salted hashes, or recent proof-of-work blockchain systems. Despite their wide use, a definition of this concept has not yet been distilled and formalized explicitly. Instead, either the applications are proven directly based on the assumptions underlying the function, or some property of the function is proven, but the security of the application is argued only informally. The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two. On a technical level, beyond the mentioned definitions, we instantiate the model for four different notions of hardness. We extend the work of Alwen and Serbinenko (STOC 2015) by providing a general tool for proving security for the first notion of memory-hard functions that allows for provably secure applications. The tool allows us to recover all of the graph-theoretic techniques developed for proving security under the older, non-composable, notion of security used by Alwen and Serbinenko. As an application of our definition of moderately hard functions, we prove the security of two different schemes for proofs of effort (PoE). We also formalize and instantiate the concept of a non-interactive proof of effort (niPoE), in which the proof is not bound to a particular communication context but rather any bit-string chosen by the prover.","lang":"eng"}],"intvolume":" 10677","month":"11","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/945"}],"scopus_import":1,"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331970499-9"]},"volume":10677},{"publication":"Israel Journal of Mathematics","day":"01","year":"2017","date_created":"2018-12-11T11:47:29Z","doi":"10.1007/s11856-017-1607-7","date_published":"2017-10-01T00:00:00Z","page":"841 - 866","acknowledgement":"The work by Z. P. was partially supported by the Israel Science Foundation grant ISF-768/12. The work by Z. P. and M. T. was partially supported by the project CE-ITI (GACR P202/12/G061) of the Czech Science Foundation and by the ERC Advanced Grant No. 267165. Part of the research work of M.T. was conducted at IST Austria, supported by an IST Fellowship. The research of P. P. was supported by the ERC Advanced grant no. 320924. The work by I. M. and U. W. was supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and SNSF-PP00P2-138948). The collaboration between U. W. and X. G. was partially supported by the LabEx Bézout (ANR-10-LABX-58).","oa":1,"quality_controlled":"1","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Goaoc, Xavier, et al. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics, vol. 222, no. 2, Springer, 2017, pp. 841–66, doi:10.1007/s11856-017-1607-7.","ieee":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result,” Israel Journal of Mathematics, vol. 222, no. 2. Springer, pp. 841–866, 2017.","short":"X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866.","apa":"Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2017). On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. Springer. https://doi.org/10.1007/s11856-017-1607-7","ama":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 2017;222(2):841-866. doi:10.1007/s11856-017-1607-7","chicago":"Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A van Kampen–Flores Type Nonembeddability Result.” Israel Journal of Mathematics. Springer, 2017. https://doi.org/10.1007/s11856-017-1607-7.","ista":"Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2017. On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result. Israel Journal of Mathematics. 222(2), 841–866."},"title":"On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result","publist_id":"7194","author":[{"last_name":"Goaoc","full_name":"Goaoc, Xavier","first_name":"Xavier"},{"first_name":"Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","last_name":"Mabillard","full_name":"Mabillard, Isaac"},{"first_name":"Pavel","last_name":"Paták","full_name":"Paták, Pavel"},{"first_name":"Zuzana","id":"48B57058-F248-11E8-B48F-1D18A9856A87","full_name":"Patakova, Zuzana","orcid":"0000-0002-3975-1683","last_name":"Patakova"},{"last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"volume":222,"related_material":{"record":[{"relation":"earlier_version","id":"1511","status":"public"}]},"issue":"2","oa_version":"Preprint","abstract":[{"lang":"eng","text":"The fact that the complete graph K5 does not embed in the plane has been generalized in two independent directions. On the one hand, the solution of the classical Heawood problem for graphs on surfaces established that the complete graph Kn embeds in a closed surface M (other than the Klein bottle) if and only if (n−3)(n−4) ≤ 6b1(M), where b1(M) is the first Z2-Betti number of M. On the other hand, van Kampen and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional analogue of Kn+1) embeds in R2k if and only if n ≤ 2k + 1. Two decades ago, Kühnel conjectured that the k-skeleton of the n-simplex embeds in a compact, (k − 1)-connected 2k-manifold with kth Z2-Betti number bk only if the following generalized Heawood inequality holds: (k+1 n−k−1) ≤ (k+1 2k+1)bk. This is a common generalization of the case of graphs on surfaces as well as the van Kampen–Flores theorem. In the spirit of Kühnel’s conjecture, we prove that if the k-skeleton of the n-simplex embeds in a compact 2k-manifold with kth Z2-Betti number bk, then n ≤ 2bk(k 2k+2)+2k+4. This bound is weaker than the generalized Heawood inequality, but does not require the assumption that M is (k−1)-connected. Our results generalize to maps without q-covered points, in the spirit of Tverberg’s theorem, for q a prime power. Our proof uses a result of Volovikov about maps that satisfy a certain homological triviality condition."}],"intvolume":" 222","month":"10","main_file_link":[{"url":"https://arxiv.org/abs/1610.09063","open_access":"1"}],"scopus_import":1,"date_updated":"2023-02-23T10:02:13Z","department":[{"_id":"UlWa"}],"_id":"610","status":"public","type":"journal_article"},{"year":"2017","publication_status":"published","publication_identifier":{"issn":["00368075"]},"publication":"Science","language":[{"iso":"eng"}],"day":"17","page":"925 - 928","date_created":"2018-12-11T11:47:29Z","date_published":"2017-11-17T00:00:00Z","issue":"6365","doi":"10.1126/science.aao3526","volume":358,"abstract":[{"text":"Small RNAs (sRNAs) regulate genes in plants and animals. Here, we show that population-wide differences in color patterns in snapdragon flowers are caused by an inverted duplication that generates sRNAs. The complexity and size of the transcripts indicate that the duplication represents an intermediate on the pathway to microRNA evolution. The sRNAs repress a pigment biosynthesis gene, creating a yellow highlight at the site of pollinator entry. The inverted duplication exhibits steep clines in allele frequency in a natural hybrid zone, showing that the allele is under selection. Thus, regulatory interactions of evolutionarily recent sRNAs can be acted upon by selection and contribute to the evolution of phenotypic diversity.","lang":"eng"}],"oa_version":"None","publisher":"American Association for the Advancement of Science","scopus_import":1,"quality_controlled":"1","intvolume":" 358","month":"11","citation":{"ista":"Bradley D, Xu P, Mohorianu I, Whibley A, Field D, Tavares H, Couchman M, Copsey L, Carpenter R, Li M, Li Q, Xue Y, Dalmay T, Coen E. 2017. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 358(6365), 925–928.","chicago":"Bradley, Desmond, Ping Xu, Irina Mohorianu, Annabel Whibley, David Field, Hugo Tavares, Matthew Couchman, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science. American Association for the Advancement of Science, 2017. https://doi.org/10.1126/science.aao3526.","short":"D. Bradley, P. Xu, I. Mohorianu, A. Whibley, D. Field, H. Tavares, M. Couchman, L. Copsey, R. Carpenter, M. Li, Q. Li, Y. Xue, T. Dalmay, E. Coen, Science 358 (2017) 925–928.","ieee":"D. Bradley et al., “Evolution of flower color pattern through selection on regulatory small RNAs,” Science, vol. 358, no. 6365. American Association for the Advancement of Science, pp. 925–928, 2017.","apa":"Bradley, D., Xu, P., Mohorianu, I., Whibley, A., Field, D., Tavares, H., … Coen, E. (2017). Evolution of flower color pattern through selection on regulatory small RNAs. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aao3526","ama":"Bradley D, Xu P, Mohorianu I, et al. Evolution of flower color pattern through selection on regulatory small RNAs. Science. 2017;358(6365):925-928. doi:10.1126/science.aao3526","mla":"Bradley, Desmond, et al. “Evolution of Flower Color Pattern through Selection on Regulatory Small RNAs.” Science, vol. 358, no. 6365, American Association for the Advancement of Science, 2017, pp. 925–28, doi:10.1126/science.aao3526."},"date_updated":"2021-01-12T08:06:10Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7193","author":[{"last_name":"Bradley","full_name":"Bradley, Desmond","first_name":"Desmond"},{"last_name":"Xu","full_name":"Xu, Ping","first_name":"Ping"},{"last_name":"Mohorianu","full_name":"Mohorianu, Irina","first_name":"Irina"},{"last_name":"Whibley","full_name":"Whibley, Annabel","first_name":"Annabel"},{"last_name":"Field","orcid":"0000-0002-4014-8478","full_name":"Field, David","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Hugo","last_name":"Tavares","full_name":"Tavares, Hugo"},{"full_name":"Couchman, Matthew","last_name":"Couchman","first_name":"Matthew"},{"full_name":"Copsey, Lucy","last_name":"Copsey","first_name":"Lucy"},{"last_name":"Carpenter","full_name":"Carpenter, Rosemary","first_name":"Rosemary"},{"first_name":"Miaomiao","full_name":"Li, Miaomiao","last_name":"Li"},{"first_name":"Qun","last_name":"Li","full_name":"Li, Qun"},{"first_name":"Yongbiao","full_name":"Xue, Yongbiao","last_name":"Xue"},{"first_name":"Tamas","full_name":"Dalmay, Tamas","last_name":"Dalmay"},{"last_name":"Coen","full_name":"Coen, Enrico","first_name":"Enrico"}],"title":"Evolution of flower color pattern through selection on regulatory small RNAs","department":[{"_id":"NiBa"}],"_id":"611","type":"journal_article","status":"public"},{"article_number":"1535","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Biophysics of information processing in gene regulation","grant_number":"P28844-B27"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chait, Remy P., et al. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications, vol. 8, no. 1, 1535, Nature Publishing Group, 2017, doi:10.1038/s41467-017-01683-1.","ieee":"R. P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, and C. C. Guet, “Shaping bacterial population behavior through computer interfaced control of individual cells,” Nature Communications, vol. 8, no. 1. Nature Publishing Group, 2017.","short":"R.P. Chait, J. Ruess, T. Bergmiller, G. Tkačik, C.C. Guet, Nature Communications 8 (2017).","ama":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 2017;8(1). doi:10.1038/s41467-017-01683-1","apa":"Chait, R. P., Ruess, J., Bergmiller, T., Tkačik, G., & Guet, C. C. (2017). Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-01683-1","chicago":"Chait, Remy P, Jakob Ruess, Tobias Bergmiller, Gašper Tkačik, and Calin C Guet. “Shaping Bacterial Population Behavior through Computer Interfaced Control of Individual Cells.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/s41467-017-01683-1.","ista":"Chait RP, Ruess J, Bergmiller T, Tkačik G, Guet CC. 2017. Shaping bacterial population behavior through computer interfaced control of individual cells. Nature Communications. 8(1), 1535."},"title":"Shaping bacterial population behavior through computer interfaced control of individual cells","article_processing_charge":"Yes (in subscription journal)","author":[{"id":"3464AE84-F248-11E8-B48F-1D18A9856A87","first_name":"Remy P","full_name":"Chait, Remy P","orcid":"0000-0003-0876-3187","last_name":"Chait"},{"full_name":"Ruess, Jakob","orcid":"0000-0003-1615-3282","last_name":"Ruess","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","first_name":"Jakob"},{"last_name":"Bergmiller","full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","first_name":"Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper"},{"last_name":"Guet","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7191","acknowledgement":"We are grateful to M. Lang, H. Janovjak, M. Khammash, A. Milias-Argeitis, M. Rullan, G. Batt, A. Bosma-Moody, Aryan, S. Leibler, and members of the Guet and Tkačik groups for helpful discussion, comments, and suggestions. We thank A. Moglich, T. Mathes, J. Tabor, and S. Schmidl for kind gifts of strains, and R. Hauschild, B. Knep, M. Lang, T. Asenov, E. Papusheva, T. Menner, T. Adletzberger, and J. Merrin for technical assistance. The research leading to these results has received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) under REA grant agreement no. [291734]. (to R.C. and J.R.), Austrian Science Fund grant FWF P28844 (to G.T.), and internal IST Austria Interdisciplinary Project Support. J.R. acknowledges support from the Agence Nationale de la Recherche (ANR) under Grant Nos. ANR-16-CE33-0018 (MEMIP), ANR-16-CE12-0025 (COGEX) and ANR-10-BINF-06-01 (ICEBERG).","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","publication":"Nature Communications","day":"01","year":"2017","has_accepted_license":"1","date_created":"2018-12-11T11:47:30Z","doi":"10.1038/s41467-017-01683-1","date_published":"2017-12-01T00:00:00Z","_id":"613","pubrep_id":"911","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","ddc":["576","579"],"date_updated":"2021-01-12T08:06:15Z","file_date_updated":"2020-07-14T12:47:20Z","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Bacteria in groups vary individually, and interact with other bacteria and the environment to produce population-level patterns of gene expression. Investigating such behavior in detail requires measuring and controlling populations at the single-cell level alongside precisely specified interactions and environmental characteristics. Here we present an automated, programmable platform that combines image-based gene expression and growth measurements with on-line optogenetic expression control for hundreds of individual Escherichia coli cells over days, in a dynamically adjustable environment. This integrated platform broadly enables experiments that bridge individual and population behaviors. We demonstrate: (i) population structuring by independent closed-loop control of gene expression in many individual cells, (ii) cell-cell variation control during antibiotic perturbation, (iii) hybrid bio-digital circuits in single cells, and freely specifiable digital communication between individual bacteria. These examples showcase the potential for real-time integration of theoretical models with measurement and control of many individual cells to investigate and engineer microbial population behavior."}],"intvolume":" 8","month":"12","scopus_import":1,"language":[{"iso":"eng"}],"file":[{"checksum":"44bb5d0229926c23a9955d9fe0f9723f","file_id":"5190","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2017-911-v1+1_s41467-017-01683-1.pdf","date_created":"2018-12-12T10:16:05Z","file_size":1951699,"date_updated":"2020-07-14T12:47:20Z","creator":"system"}],"publication_status":"published","publication_identifier":{"issn":["20411723"]},"ec_funded":1,"volume":8,"issue":"1"},{"status":"public","type":"journal_article","_id":"615","department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:06:22Z","month":"11","intvolume":" 53","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1504.00650","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"text":"We show that the Dyson Brownian Motion exhibits local universality after a very short time assuming that local rigidity and level repulsion of the eigenvalues hold. These conditions are verified, hence bulk spectral universality is proven, for a large class of Wigner-like matrices, including deformed Wigner ensembles and ensembles with non-stochastic variance matrices whose limiting densities differ from Wigner's semicircle law.","lang":"eng"}],"volume":53,"issue":"4","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["02460203"]},"publication_status":"published","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"title":"Universality for random matrix flows with time dependent density","author":[{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"orcid":"0000-0003-0954-3231","full_name":"Schnelli, Kevin","last_name":"Schnelli","first_name":"Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7189","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"L. Erdös and K. Schnelli, “Universality for random matrix flows with time dependent density,” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4. Institute of Mathematical Statistics, pp. 1606–1656, 2017.","short":"L. Erdös, K. Schnelli, Annales de l’institut Henri Poincare (B) Probability and Statistics 53 (2017) 1606–1656.","ama":"Erdös L, Schnelli K. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 2017;53(4):1606-1656. doi:10.1214/16-AIHP765","apa":"Erdös, L., & Schnelli, K. (2017). Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/16-AIHP765","mla":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics, vol. 53, no. 4, Institute of Mathematical Statistics, 2017, pp. 1606–56, doi:10.1214/16-AIHP765.","ista":"Erdös L, Schnelli K. 2017. Universality for random matrix flows with time dependent density. Annales de l’institut Henri Poincare (B) Probability and Statistics. 53(4), 1606–1656.","chicago":"Erdös, László, and Kevin Schnelli. “Universality for Random Matrix Flows with Time Dependent Density.” Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/16-AIHP765."},"quality_controlled":"1","publisher":"Institute of Mathematical Statistics","oa":1,"doi":"10.1214/16-AIHP765","date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:30Z","page":"1606 - 1656","day":"01","publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","year":"2017"},{"citation":{"chicago":"Hill Yardin, Elisa, Sonja Mckeown, Gaia Novarino, and Andreas Grabrucker. “Extracerebral Dysfunction in Animal Models of Autism Spectrum Disorder.” In Translational Anatomy and Cell Biology of Autism Spectrum Disorder, edited by Michael Schmeisser and Tobias Boekers, 224:159–87. Advances in Anatomy Embryology and Cell Biology. Springer, 2017. https://doi.org/10.1007/978-3-319-52498-6_9.","ista":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. 2017.Extracerebral dysfunction in animal models of autism spectrum disorder. In: Translational Anatomy and Cell Biology of Autism Spectrum Disorder. ADVSANAT, vol. 224, 159–187.","mla":"Hill Yardin, Elisa, et al. “Extracerebral Dysfunction in Animal 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. 159–87, doi:10.1007/978-3-319-52498-6_9.","short":"E. Hill Yardin, S. Mckeown, G. Novarino, A. Grabrucker, in:, M. Schmeisser, T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder, Springer, 2017, pp. 159–187.","ieee":"E. Hill Yardin, S. Mckeown, G. Novarino, and A. Grabrucker, “Extracerebral dysfunction in animal 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. 159–187.","ama":"Hill Yardin E, Mckeown S, Novarino G, Grabrucker A. Extracerebral dysfunction in animal 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:159-187. doi:10.1007/978-3-319-52498-6_9","apa":"Hill Yardin, E., Mckeown, S., Novarino, G., & Grabrucker, A. (2017). Extracerebral dysfunction in animal models of autism spectrum disorder. In M. Schmeisser & T. Boekers (Eds.), Translational Anatomy and Cell Biology of Autism Spectrum Disorder (Vol. 224, pp. 159–187). Springer. https://doi.org/10.1007/978-3-319-52498-6_9"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Elisa","full_name":"Hill Yardin, Elisa","last_name":"Hill Yardin"},{"first_name":"Sonja","full_name":"Mckeown, Sonja","last_name":"Mckeown"},{"first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178"},{"first_name":"Andreas","last_name":"Grabrucker","full_name":"Grabrucker, Andreas"}],"publist_id":"7177","title":"Extracerebral dysfunction in animal models of autism spectrum disorder","editor":[{"full_name":"Schmeisser, Michael","last_name":"Schmeisser","first_name":"Michael"},{"full_name":"Boekers, Tobias","last_name":"Boekers","first_name":"Tobias"}],"publisher":"Springer","quality_controlled":"1","year":"2017","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","day":"28","page":"159 - 187","date_created":"2018-12-11T11:47:33Z","doi":"10.1007/978-3-319-52498-6_9","date_published":"2017-05-28T00:00:00Z","_id":"623","series_title":"Advances in Anatomy Embryology and Cell Biology","type":"book_chapter","status":"public","date_updated":"2021-01-12T08:06:46Z","department":[{"_id":"GaNo"}],"abstract":[{"text":"Genetic factors might be largely responsible for the development of autism spectrum disorder (ASD) that alone or in combination with specific environmental risk factors trigger the pathology. Multiple mutations identified in ASD patients that impair synaptic function in the central nervous system are well studied in animal models. How these mutations might interact with other risk factors is not fully understood though. Additionally, how systems outside of the brain are altered in the context of ASD is an emerging area of research. Extracerebral influences on the physiology could begin in utero and contribute to changes in the brain and in the development of other body systems and further lead to epigenetic changes. Therefore, multiple recent studies have aimed at elucidating the role of gene-environment interactions in ASD. Here we provide an overview on the extracerebral systems that might play an important associative role in ASD and review evidence regarding the potential roles of inflammation, trace metals, metabolism, genetic susceptibility, enteric nervous system function and the microbiota of the gastrointestinal (GI) tract on the development of endophenotypes in animal models of ASD. By influencing environmental conditions, it might be possible to reduce or limit the severity of ASD pathology.","lang":"eng"}],"oa_version":"None","scopus_import":1,"alternative_title":["ADVSANAT"],"intvolume":" 224","month":"05","publication_status":"published","publication_identifier":{"issn":["03015556"],"isbn":["978-3-319-52496-2"]},"language":[{"iso":"eng"}],"volume":224},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Barton NH, Etheridge A, Véber A. 2017. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 118, 50–73.","chicago":"Barton, Nicholas H, Alison Etheridge, and Amandine Véber. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology. Academic Press, 2017. https://doi.org/10.1016/j.tpb.2017.06.001.","ieee":"N. H. Barton, A. Etheridge, and A. Véber, “The infinitesimal model: Definition derivation and implications,” Theoretical Population Biology, vol. 118. Academic Press, pp. 50–73, 2017.","short":"N.H. Barton, A. Etheridge, A. Véber, Theoretical Population Biology 118 (2017) 50–73.","apa":"Barton, N. H., Etheridge, A., & Véber, A. (2017). The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2017.06.001","ama":"Barton NH, Etheridge A, Véber A. The infinitesimal model: Definition derivation and implications. Theoretical Population Biology. 2017;118:50-73. doi:10.1016/j.tpb.2017.06.001","mla":"Barton, Nicholas H., et al. “The Infinitesimal Model: Definition Derivation and Implications.” Theoretical Population Biology, vol. 118, Academic Press, 2017, pp. 50–73, doi:10.1016/j.tpb.2017.06.001."},"title":"The infinitesimal model: Definition derivation and implications","publist_id":"7169","author":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"full_name":"Véber, Amandine","last_name":"Véber","first_name":"Amandine"}],"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"day":"01","publication":"Theoretical Population Biology","has_accepted_license":"1","year":"2017","doi":"10.1016/j.tpb.2017.06.001","date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:47:34Z","page":"50 - 73","quality_controlled":"1","publisher":"Academic Press","oa":1,"ddc":["576"],"date_updated":"2021-01-12T08:06:50Z","department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:47:25Z","_id":"626","status":"public","pubrep_id":"908","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"file_name":"IST-2017-908-v1+1_1-s2.0-S0040580917300886-main_1_.pdf","date_created":"2018-12-12T10:12:45Z","creator":"system","file_size":1133924,"date_updated":"2020-07-14T12:47:25Z","file_id":"4964","checksum":"7dd02bfcfe8f244f4a6c19091aedf2c8","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["00405809"]},"publication_status":"published","volume":118,"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Our focus here is on the infinitesimal model. In this model, one or several quantitative traits are described as the sum of a genetic and a non-genetic component, the first being distributed within families as a normal random variable centred at the average of the parental genetic components, and with a variance independent of the parental traits. Thus, the variance that segregates within families is not perturbed by selection, and can be predicted from the variance components. This does not necessarily imply that the trait distribution across the whole population should be Gaussian, and indeed selection or population structure may have a substantial effect on the overall trait distribution. One of our main aims is to identify some general conditions on the allelic effects for the infinitesimal model to be accurate. We first review the long history of the infinitesimal model in quantitative genetics. Then we formulate the model at the phenotypic level in terms of individual trait values and relationships between individuals, but including different evolutionary processes: genetic drift, recombination, selection, mutation, population structure, …. We give a range of examples of its application to evolutionary questions related to stabilising selection, assortative mating, effective population size and response to selection, habitat preference and speciation. We provide a mathematical justification of the model as the limit as the number M of underlying loci tends to infinity of a model with Mendelian inheritance, mutation and environmental noise, when the genetic component of the trait is purely additive. We also show how the model generalises to include epistatic effects. We prove in particular that, within each family, the genetic components of the individual trait values in the current generation are indeed normally distributed with a variance independent of ancestral traits, up to an error of order 1∕M. Simulations suggest that in some cases the convergence may be as fast as 1∕M."}],"month":"12","intvolume":" 118","scopus_import":1},{"ddc":["000"],"date_updated":"2022-05-23T08:54:02Z","file_date_updated":"2020-07-14T12:47:25Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"_id":"625","series_title":"Theoretical Computer Science and General Issues","status":"public","type":"book_chapter","file":[{"file_id":"7048","checksum":"b2402766ec02c79801aac634bd8f9f6c","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-11-19T08:06:50Z","file_name":"2017_ModelsAlgorithms_Chatterjee.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:25Z","file_size":192826}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-319-63120-2"],"issn":["0302-9743"]},"publication_status":"published","volume":10460,"ec_funded":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"In the analysis of reactive systems a quantitative objective assigns a real value to every trace of the system. The value decision problem for a quantitative objective requires a trace whose value is at least a given threshold, and the exact value decision problem requires a trace whose value is exactly the threshold. We compare the computational complexity of the value and exact value decision problems for classical quantitative objectives, such as sum, discounted sum, energy, and mean-payoff for two standard models of reactive systems, namely, graphs and graph games."}],"month":"07","intvolume":" 10460","scopus_import":"1","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2017.The cost of exactness in quantitative reachability. In: Models, Algorithms, Logics and Tools. LNCS, vol. 10460, 367–381.","mla":"Chatterjee, Krishnendu, et al. “The Cost of Exactness in Quantitative Reachability.” Models, Algorithms, Logics and Tools, edited by Luca Aceto et al., vol. 10460, Springer, 2017, pp. 367–81, doi:10.1007/978-3-319-63121-9_18.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “The cost of exactness in quantitative reachability,” in Models, Algorithms, Logics and Tools, vol. 10460, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, and R. Mardare, Eds. Springer, 2017, pp. 367–381.","apa":"Chatterjee, K., Doyen, L., & Henzinger, T. A. (2017). The cost of exactness in quantitative reachability. In L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, & R. Mardare (Eds.), Models, Algorithms, Logics and Tools (Vol. 10460, pp. 367–381). Springer. https://doi.org/10.1007/978-3-319-63121-9_18","ama":"Chatterjee K, Doyen L, Henzinger TA. The cost of exactness in quantitative reachability. In: Aceto L, Bacci G, Ingólfsdóttir A, Legay A, Mardare R, eds. Models, Algorithms, Logics and Tools. Vol 10460. Theoretical Computer Science and General Issues. Springer; 2017:367-381. doi:10.1007/978-3-319-63121-9_18"},"editor":[{"first_name":"Luca","last_name":"Aceto","full_name":"Aceto, Luca"},{"first_name":"Giorgio","full_name":"Bacci, Giorgio","last_name":"Bacci"},{"full_name":"Ingólfsdóttir, Anna","last_name":"Ingólfsdóttir","first_name":"Anna"},{"last_name":"Legay","full_name":"Legay, Axel","first_name":"Axel"},{"first_name":"Radu","full_name":"Mardare, Radu","last_name":"Mardare"}],"title":"The cost of exactness in quantitative reachability","publist_id":"7170","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"day":"25","publication":"Models, Algorithms, Logics and Tools","has_accepted_license":"1","year":"2017","doi":"10.1007/978-3-319-63121-9_18","date_published":"2017-07-25T00:00:00Z","date_created":"2018-12-11T11:47:34Z","page":"367 - 381","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 and S11407-N23 (RiSE/SHiNE), and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003.","publisher":"Springer","quality_controlled":"1","oa":1},{"quality_controlled":"1","publisher":"PeerJ","oa":1,"acknowledgement":"Austrian Science Fund (FWF): M1697, P22249; Swiss National Science Foundation (SNF): 145706; European Commission;FWF Special Research Program: RNA-REG F43","date_published":"2017-09-21T00:00:00Z","doi":"10.7717/peerj.3830","date_created":"2018-12-11T11:47:33Z","has_accepted_license":"1","year":"2017","day":"21","publication":"PeerJ","article_number":"3830","publist_id":"7172","author":[{"last_name":"Nikolic","full_name":"Nikolic, Nela","orcid":"0000-0001-9068-6090","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","first_name":"Nela"},{"full_name":"Didara, Zrinka","last_name":"Didara","first_name":"Zrinka"},{"full_name":"Moll, Isabella","last_name":"Moll","first_name":"Isabella"}],"title":"MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations","citation":{"chicago":"Nikolic, Nela, Zrinka Didara, and Isabella Moll. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ. PeerJ, 2017. https://doi.org/10.7717/peerj.3830.","ista":"Nikolic N, Didara Z, Moll I. 2017. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017(9), 3830.","mla":"Nikolic, Nela, et al. “MazF Activation Promotes Translational Heterogeneity of the GrcA MRNA in Escherichia Coli Populations.” PeerJ, vol. 2017, no. 9, 3830, PeerJ, 2017, doi:10.7717/peerj.3830.","ama":"Nikolic N, Didara Z, Moll I. MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. 2017;2017(9). doi:10.7717/peerj.3830","apa":"Nikolic, N., Didara, Z., & Moll, I. (2017). MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations. PeerJ. PeerJ. https://doi.org/10.7717/peerj.3830","ieee":"N. Nikolic, Z. Didara, and I. Moll, “MazF activation promotes translational heterogeneity of the grcA mRNA in Escherichia coli populations,” PeerJ, vol. 2017, no. 9. PeerJ, 2017.","short":"N. Nikolic, Z. Didara, I. Moll, PeerJ 2017 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"09","intvolume":" 2017","abstract":[{"lang":"eng","text":"Bacteria adapt to adverse environmental conditions by altering gene expression patterns. Recently, a novel stress adaptation mechanism has been described that allows Escherichia coli to alter gene expression at the post-transcriptional level. The key player in this regulatory pathway is the endoribonuclease MazF, the toxin component of the toxin-antitoxin module mazEF that is triggered by various stressful conditions. In general, MazF degrades the majority of transcripts by cleaving at ACA sites, which results in the retardation of bacterial growth. Furthermore, MazF can process a small subset of mRNAs and render them leaderless by removing their ribosome binding site. MazF concomitantly modifies ribosomes, making them selective for the translation of leaderless mRNAs. In this study, we employed fluorescent reporter-systems to investigate mazEF expression during stressful conditions, and to infer consequences of the mRNA processing mediated by MazF on gene expression at the single-cell level. Our results suggest that mazEF transcription is maintained at low levels in single cells encountering adverse conditions, such as antibiotic stress or amino acid starvation. Moreover, using the grcA mRNA as a model for MazF-mediated mRNA processing, we found that MazF activation promotes heterogeneity in the grcA reporter expression, resulting in a subpopulation of cells with increased levels of GrcA reporter protein."}],"oa_version":"Published Version","issue":"9","volume":2017,"publication_identifier":{"issn":["21678359"]},"publication_status":"published","file":[{"date_created":"2018-12-12T10:11:51Z","file_name":"IST-2017-909-v1+1_peerj-3830.pdf","creator":"system","date_updated":"2020-07-14T12:47:24Z","file_size":682064,"checksum":"3d79ae6b6eabc90b0eaaed82ff3493b0","file_id":"4908","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"909","_id":"624","file_date_updated":"2020-07-14T12:47:24Z","department":[{"_id":"CaGu"}],"date_updated":"2021-01-12T08:06:48Z","ddc":["579"]},{"intvolume":" 10426","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1705.00314","open_access":"1"}],"alternative_title":["LNCS"],"scopus_import":1,"oa_version":"Submitted Version","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."}],"ec_funded":1,"volume":10426,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-331963386-2"]},"status":"public","conference":{"name":"CAV: Computer Aided Verification","start_date":"2017-07-24","end_date":"2017-07-28","location":"Heidelberg, Germany"},"type":"conference","_id":"628","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:06:55Z","oa":1,"publisher":"Springer","quality_controlled":"1","date_created":"2018-12-11T11:47:35Z","doi":"10.1007/978-3-319-63387-9_6","date_published":"2017-01-01T00:00:00Z","page":"118 - 139","day":"01","year":"2017","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"title":"Automated recurrence analysis for almost linear expected runtime bounds","editor":[{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"first_name":"Viktor","last_name":"Kunčak","full_name":"Kunčak, Viktor"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"first_name":"Aniket","last_name":"Murhekar","full_name":"Murhekar, Aniket"}],"publist_id":"7166","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","short":"K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 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","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.","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."}},{"date_updated":"2021-01-12T08:06:57Z","department":[{"_id":"MaLo"}],"series_title":"Sub-Cellular Biochemistry","_id":"629","type":"book_chapter","status":"public","publication_status":"published","publication_identifier":{"eisbn":["978-3-319-53047-5"]},"language":[{"iso":"eng"}],"volume":84,"abstract":[{"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.","lang":"eng"}],"oa_version":"None","pmid":1,"scopus_import":1,"intvolume":" 84","month":"05","citation":{"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.","short":"M. Loose, K. Zieske, P. Schwille, in:, Prokaryotic Cytoskeletons, Springer, 2017, pp. 419–444.","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","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","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.","ista":"Loose M, Zieske K, Schwille P. 2017.Reconstitution of protein dynamics involved in bacterial cell division. In: Prokaryotic Cytoskeletons. vol. 84, 419–444.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["28500535"]},"author":[{"id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","last_name":"Loose"},{"first_name":"Katja","full_name":"Zieske, Katja","last_name":"Zieske"},{"last_name":"Schwille","full_name":"Schwille, Petra","first_name":"Petra"}],"publist_id":"7165","title":"Reconstitution of protein dynamics involved in bacterial cell division","year":"2017","publication":"Prokaryotic Cytoskeletons","day":"13","page":"419 - 444","date_created":"2018-12-11T11:47:35Z","date_published":"2017-05-13T00:00:00Z","doi":"10.1007/978-3-319-53047-5_15","publisher":"Springer","quality_controlled":"1"},{"date_created":"2018-12-11T11:47:36Z","doi":"10.3233/978-1-61499-759-7-356","date_published":"2017-01-01T00:00:00Z","page":"356 - 362","day":"01","year":"2017","has_accepted_license":"1","oa":1,"publisher":"IOS Press","quality_controlled":"1","title":"Biosignals standards and FHIR: The way to go","publist_id":"7164","author":[{"first_name":"Stefan","full_name":"Sauermann, Stefan","last_name":"Sauermann"},{"first_name":"Veronika","last_name":"David","full_name":"David, Veronika"},{"orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","first_name":"Alois"},{"last_name":"Egelkraut","full_name":"Egelkraut, Reinhard","first_name":"Reinhard"},{"full_name":"Frohner, Matthias","last_name":"Frohner","first_name":"Matthias"},{"last_name":"Pohn","full_name":"Pohn, Birgit","first_name":"Birgit"},{"first_name":"Philipp","last_name":"Urbauer","full_name":"Urbauer, Philipp"},{"first_name":"Alexander","last_name":"Mense","full_name":"Mense, Alexander"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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","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","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."},"volume":236,"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4913","checksum":"1254dcc5b04a996d97fad9a726b42727","creator":"system","date_updated":"2020-07-14T12:47:27Z","file_size":443635,"date_created":"2018-12-12T10:11:56Z","file_name":"IST-2017-906-v1+1_SHTI236-0356.pdf"}],"publication_status":"published","publication_identifier":{"isbn":["978-161499758-0"]},"intvolume":" 236","month":"01","alternative_title":["Studies in Health Technology and Informatics"],"scopus_import":1,"oa_version":"Published Version","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."}],"department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"file_date_updated":"2020-07-14T12:47:27Z","ddc":["005"],"date_updated":"2021-01-12T08:06:59Z","pubrep_id":"906","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"conference":{"name":"eHealth: Health Informatics Meets eHealth","start_date":"2017-05-23","location":"Vienna, Austria","end_date":"2017-05-24"},"type":"conference","_id":"630"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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.","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","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","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."},"title":"A note on 2D focusing many boson systems","publist_id":"7160","author":[{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87","last_name":"Nam","full_name":"Nam, Phan"},{"first_name":"Nicolas","last_name":"Rougerie","full_name":"Rougerie, Nicolas"}],"project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"publication":"Proceedings of the American Mathematical Society","day":"01","year":"2017","date_created":"2018-12-11T11:47:36Z","doi":"10.1090/proc/13468","date_published":"2017-01-01T00:00:00Z","page":"2441 - 2454","oa":1,"publisher":"American Mathematical Society","quality_controlled":"1","date_updated":"2021-01-12T08:07:03Z","department":[{"_id":"RoSe"}],"_id":"632","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"issue":"6","volume":145,"oa_version":"Submitted Version","abstract":[{"lang":"eng","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. "}],"intvolume":" 145","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1509.09045"}],"scopus_import":1},{"month":"05","intvolume":" 224","scopus_import":1,"alternative_title":["ADVSANAT"],"oa_version":"None","abstract":[{"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.","lang":"eng"}],"volume":224,"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-3-319-52498-6"]},"publication_status":"published","status":"public","type":"book_chapter","_id":"634","series_title":"Advances in Anatomy Embryology and Cell Biology","department":[{"_id":"GaNo"}],"date_updated":"2021-01-12T08:07:08Z","quality_controlled":"1","publisher":"Springer","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","day":"28","publication":"Translational Anatomy and Cell Biology of Autism Spectrum Disorder","year":"2017","project":[{"_id":"25473368-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"F03523","name":"Transmembrane Transporters in Health and Disease"}],"editor":[{"first_name":"Michael","last_name":"Schmeisser","full_name":"Schmeisser, Michael"},{"last_name":"Boekers","full_name":"Boekers, Tobias","first_name":"Tobias"}],"title":"Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder","publist_id":"7156","author":[{"last_name":"Schroeder","full_name":"Schroeder, Jan","first_name":"Jan"},{"last_name":"Deliu","orcid":"0000-0002-7370-5293","full_name":"Deliu, Elena","first_name":"Elena","id":"37A40D7E-F248-11E8-B48F-1D18A9856A87"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia","last_name":"Novarino","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178"},{"first_name":"Michael","full_name":"Schmeisser, Michael","last_name":"Schmeisser"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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","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.","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."}},{"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10381","month":"01","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"}],"oa_version":"None","volume":10381,"publication_status":"published","publication_identifier":{"isbn":["978-331963500-2"]},"language":[{"iso":"eng"}],"conference":{"name":"NSV: Numerical Software Verification","start_date":"2017-07-22","location":"Heidelberg, Germany","end_date":"2017-07-23"},"type":"conference","status":"public","_id":"633","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:07:06Z","quality_controlled":"1","publisher":"Springer","page":"83 - 89","date_created":"2018-12-11T11:47:37Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-63501-9_6","year":"2017","day":"01","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"publist_id":"7159","author":[{"first_name":"Stanley","full_name":"Bak, Stanley","last_name":"Bak"},{"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","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Kumar, Aviral","last_name":"Kumar","first_name":"Aviral"}],"title":"Challenges and tool implementation of hybrid rapidly exploring random trees","editor":[{"first_name":"Alessandro","full_name":"Abate, Alessandro","last_name":"Abate"},{"last_name":"Bodo","full_name":"Bodo, Sylvie","first_name":"Sylvie"}],"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.","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","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"citation":{"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.","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.","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.","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"},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F"},{"first_name":"Binchi","full_name":"Chen, Binchi","last_name":"Chen"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"},{"last_name":"Reyzin","full_name":"Reyzin, Leonid","first_name":"Leonid"},{"last_name":"Tessaro","full_name":"Tessaro, Stefano","first_name":"Stefano"}],"publist_id":"7154","editor":[{"last_name":"Coron","full_name":"Coron, Jean-Sébastien","first_name":"Jean-Sébastien"},{"full_name":"Buus Nielsen, Jesper","last_name":"Buus Nielsen","first_name":"Jesper"}],"title":"Scrypt is maximally memory hard","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"year":"2017","day":"01","page":"33 - 62","doi":"10.1007/978-3-319-56617-7_2","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:37Z","publisher":"Springer","quality_controlled":"1","oa":1,"date_updated":"2021-01-12T08:07:10Z","department":[{"_id":"KrPi"}],"_id":"635","type":"conference","conference":{"start_date":"2017-04-30","end_date":"2017-05-04","location":"Paris, France","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"status":"public","publication_identifier":{"isbn":["978-331956616-0"]},"publication_status":"published","language":[{"iso":"eng"}],"volume":10212,"ec_funded":1,"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","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/989"}],"month":"01","intvolume":" 10212"},{"page":"189 - 206","date_created":"2018-12-11T11:47:38Z","doi":"10.1007/978-3-319-65765-3_11","date_published":"2017-08-03T00:00:00Z","year":"2017","day":"03","oa":1,"quality_controlled":"1","publisher":"Springer","author":[{"full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin","first_name":"Alexey"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"first_name":"Dogan","last_name":"Ulus","full_name":"Ulus, Dogan"}],"publist_id":"7152","editor":[{"full_name":"Abate, Alessandro","last_name":"Abate","first_name":"Alessandro"},{"first_name":"Gilles","full_name":"Geeraerts, Gilles","last_name":"Geeraerts"}],"title":"On the quantitative semantics of regular expressions over real-valued signals","citation":{"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.","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.","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 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.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"volume":10419,"publication_status":"published","publication_identifier":{"isbn":["978-331965764-6"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01552132"}],"scopus_import":1,"alternative_title":["LNCS"],"intvolume":" 10419","month":"08","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"}],"oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:07:14Z","conference":{"start_date":"2017-09-05","end_date":"2017-09-07","location":"Berlin, Germany","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"type":"conference","status":"public","_id":"636"},{"publist_id":"7150","article_processing_charge":"No","title":"Numerical Software Verification","editor":[{"first_name":"Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365"},{"first_name":"Matthieu","last_name":"Martel","full_name":"Martel, Matthieu"},{"first_name":"Pavithra","full_name":"Prabhakar, Pavithra","last_name":"Prabhakar"}],"department":[{"_id":"ToHe"}],"date_updated":"2022-05-24T07:09:52Z","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.","ama":"Bogomolov S, Martel M, Prabhakar P, eds. Numerical Software Verification. Vol 10152. Springer; 2017. doi:10.1007/978-3-319-54292-8","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","mla":"Bogomolov, Sergiy, et al., editors. Numerical Software Verification. Vol. 10152, Springer, 2017, doi:10.1007/978-3-319-54292-8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference_editor","conference":{"start_date":"2016-07-17","end_date":"2016-07-18","location":"Toronto, ON, Canada","name":"NSV: Numerical Software Verification"},"status":"public","_id":"638","series_title":"LNCS","date_published":"2017-01-01T00:00:00Z","doi":"10.1007/978-3-319-54292-8","volume":10152,"date_created":"2018-12-11T11:47:38Z","publication_identifier":{"eisbn":["978-3-319-54292-8"],"issn":["0302-9743"]},"publication_status":"published","year":"2017","day":"01","language":[{"iso":"eng"}],"publisher":"Springer","quality_controlled":"1","month":"01","intvolume":" 10152","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."}],"oa_version":"None"}]