[{"_id":"5677","type":"journal_article","article_type":"original","status":"public","date_updated":"2023-10-17T11:53:09Z","department":[{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"Recently, contract-based design has been proposed as an “orthogonal” approach that complements system design methodologies proposed so far to cope with the complexity of system design. Contract-based design provides a rigorous scaffolding for verification, analysis, abstraction/refinement, and even synthesis. A number of results have been obtained in this domain but a unified treatment of the topic that can help put contract-based design in perspective was missing. This monograph intends to provide such a treatment where contracts are precisely defined and characterized so that they can be used in design methodologies with no ambiguity. In particular, this monograph identifies the essence of complex system design using contracts through a mathematical “meta-theory”, where all the properties of the methodology are derived from a very abstract and generic notion of contract. We show that the meta-theory provides deep and illuminating links with existing contract and interface theories, as well as guidelines for designing new theories. Our study encompasses contracts for both software and systems, with emphasis on the latter. We illustrate the use of contracts with two examples: requirement engineering for a parking garage management, and the development of contracts for timing and scheduling in the context of the Autosar methodology in use in the automotive sector."}],"oa_version":"Submitted Version","scopus_import":"1","main_file_link":[{"url":"https://hal.inria.fr/hal-00757488/","open_access":"1"}],"month":"05","intvolume":" 12","publication_identifier":{"issn":["1551-3939"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"2-3","volume":12,"citation":{"mla":"Benveniste, Albert, et al. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:10.1561/1000000053.","short":"A. Benveniste, D. Nickovic, B. Caillaud, R. Passerone, J.B. Raclet, P. Reinkemeier, A. Sangiovanni-Vincentelli, W. Damm, T.A. Henzinger, K.G. Larsen, Foundations and Trends in Electronic Design Automation 12 (2018) 124–400.","ieee":"A. Benveniste et al., “Contracts for system design,” Foundations and Trends in Electronic Design Automation, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.","ama":"Benveniste A, Nickovic D, Caillaud B, et al. Contracts for system design. Foundations and Trends in Electronic Design Automation. 2018;12(2-3):124-400. doi:10.1561/1000000053","apa":"Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P., … Larsen, K. G. (2018). Contracts for system design. Foundations and Trends in Electronic Design Automation. Now Publishers. https://doi.org/10.1561/1000000053","chicago":"Benveniste, Albert, Dejan Nickovic, Benoît Caillaud, Roberto Passerone, Jean Baptiste Raclet, Philipp Reinkemeier, Alberto Sangiovanni-Vincentelli, Werner Damm, Thomas A Henzinger, and Kim G. Larsen. “Contracts for System Design.” Foundations and Trends in Electronic Design Automation. Now Publishers, 2018. https://doi.org/10.1561/1000000053.","ista":"Benveniste A, Nickovic D, Caillaud B, Passerone R, Raclet JB, Reinkemeier P, Sangiovanni-Vincentelli A, Damm W, Henzinger TA, Larsen KG. 2018. Contracts for system design. Foundations and Trends in Electronic Design Automation. 12(2–3), 124–400."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Albert","last_name":"Benveniste","full_name":"Benveniste, Albert"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"last_name":"Caillaud","full_name":"Caillaud, Benoît","first_name":"Benoît"},{"first_name":"Roberto","full_name":"Passerone, Roberto","last_name":"Passerone"},{"last_name":"Raclet","full_name":"Raclet, Jean Baptiste","first_name":"Jean Baptiste"},{"full_name":"Reinkemeier, Philipp","last_name":"Reinkemeier","first_name":"Philipp"},{"first_name":"Alberto","last_name":"Sangiovanni-Vincentelli","full_name":"Sangiovanni-Vincentelli, Alberto"},{"first_name":"Werner","full_name":"Damm, Werner","last_name":"Damm"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Larsen, Kim G.","last_name":"Larsen","first_name":"Kim G."}],"article_processing_charge":"No","title":"Contracts for system design","quality_controlled":"1","publisher":"Now Publishers","oa":1,"year":"2018","day":"01","publication":"Foundations and Trends in Electronic Design Automation","page":"124-400","doi":"10.1561/1000000053","date_published":"2018-05-01T00:00:00Z","date_created":"2018-12-16T22:59:19Z"},{"_id":"435","status":"public","type":"journal_article","date_updated":"2023-10-17T12:15:06Z","department":[{"_id":"MiLe"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"It is shown that two fundamentally different phenomena, the bound states in continuum and the spectral singularity (or time-reversed spectral singularity), can occur simultaneously. This can be achieved in a rectangular core dielectric waveguide with an embedded active (or absorbing) layer. In such a system a two-dimensional bound state in a continuum is created in the plane of a waveguide cross section, and it is emitted or absorbed along the waveguide core. The idea can be used for experimental implementation of a laser or a coherent-perfect-absorber for a photonic bound state that resides in a continuous spectrum."}],"intvolume":" 43","month":"02","main_file_link":[{"url":"https://arxiv.org/abs/1711.01986","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","ec_funded":1,"issue":"3","volume":43,"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and Laser for Bound States in a Continuum.” Optics Letters. Optica Publishing Group, 2018. https://doi.org/10.1364/OL.43.000607.","ista":"Midya B, Konotop V. 2018. Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. 43(3), 607–610.","mla":"Midya, Bikashkali, and Vladimir Konotop. “Coherent-Perfect-Absorber and Laser for Bound States in a Continuum.” Optics Letters, vol. 43, no. 3, Optica Publishing Group, 2018, pp. 607–10, doi:10.1364/OL.43.000607.","short":"B. Midya, V. Konotop, Optics Letters 43 (2018) 607–610.","ieee":"B. Midya and V. Konotop, “Coherent-perfect-absorber and laser for bound states in a continuum,” Optics Letters, vol. 43, no. 3. Optica Publishing Group, pp. 607–610, 2018.","ama":"Midya B, Konotop V. Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. 2018;43(3):607-610. doi:10.1364/OL.43.000607","apa":"Midya, B., & Konotop, V. (2018). Coherent-perfect-absorber and laser for bound states in a continuum. Optics Letters. Optica Publishing Group. https://doi.org/10.1364/OL.43.000607"},"title":"Coherent-perfect-absorber and laser for bound states in a continuum","article_processing_charge":"No","external_id":{"arxiv":["1711.01986"],"isi":["000423776600066"]},"publist_id":"7388","author":[{"full_name":"Midya, Bikashkali","last_name":"Midya","first_name":"Bikashkali","id":"456187FC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vladimir","full_name":"Konotop, Vladimir","last_name":"Konotop"}],"acknowledgement":"Seventh Framework Programme (FP7) People: Marie-Curie Actions (PEOPLE) (291734). B. M. acknowledges the financial support by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/ 2007-2013) under REA.","oa":1,"quality_controlled":"1","publisher":"Optica Publishing Group","publication":"Optics Letters","day":"01","year":"2018","isi":1,"date_created":"2018-12-11T11:46:27Z","date_published":"2018-02-01T00:00:00Z","doi":"10.1364/OL.43.000607","page":"607 - 610"},{"scopus_import":"1","intvolume":" 2018","month":"07","abstract":[{"text":"Genome-scale diversity data are increasingly available in a variety of biological systems, and can be used to reconstruct the past evolutionary history of species divergence. However, extracting the full demographic information from these data is not trivial, and requires inferential methods that account for the diversity of coalescent histories throughout the genome. Here, we evaluate the potential and limitations of one such approach. We reexamine a well-known system of mussel sister species, using the joint site frequency spectrum (jSFS) of synonymousmutations computed either fromexome capture or RNA-seq, in an Approximate Bayesian Computation (ABC) framework. We first assess the best sampling strategy (number of: individuals, loci, and bins in the jSFS), and show that model selection is robust to variation in the number of individuals and loci. In contrast, different binning choices when summarizing the jSFS, strongly affect the results: including classes of low and high frequency shared polymorphisms can more effectively reveal recent migration events. We then take advantage of the flexibility of ABC to compare more realistic models of speciation, including variation in migration rates through time (i.e., periodic connectivity) and across genes (i.e., genome-wide heterogeneity in migration rates). We show that these models were consistently selected as the most probable, suggesting that mussels have experienced a complex history of gene flow during divergence and that the species boundary is semi-permeable. Our work provides a comprehensive evaluation of ABC demographic inference in mussels based on the coding jSFS, and supplies guidelines for employing different sequencing techniques and sampling strategies. We emphasize, perhaps surprisingly, that inferences are less limited by the volume of data, than by the way in which they are analyzed.","lang":"eng"}],"oa_version":"Published Version","license":"https://creativecommons.org/licenses/by/4.0/","volume":2018,"issue":"7","publication_status":"published","language":[{"iso":"eng"}],"file":[{"checksum":"7d55ae22598a1c70759cd671600cff53","file_id":"5739","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-18T09:42:11Z","file_name":"2018_PeerJ_Fraisse.pdf","date_updated":"2020-07-14T12:44:48Z","file_size":1480792,"creator":"dernst"}],"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","status":"public","_id":"139","file_date_updated":"2020-07-14T12:44:48Z","department":[{"_id":"BeVi"},{"_id":"NiBa"}],"date_updated":"2023-10-17T12:25:28Z","ddc":["576"],"oa":1,"quality_controlled":"1","publisher":"PeerJ","date_created":"2018-12-11T11:44:50Z","doi":"10.7717/peerj.5198","date_published":"2018-07-30T00:00:00Z","year":"2018","has_accepted_license":"1","isi":1,"publication":"PeerJ","day":"30","article_number":"30083438","article_processing_charge":"No","external_id":{"isi":["000440484800002"]},"author":[{"id":"32DF5794-F248-11E8-B48F-1D18A9856A87","first_name":"Christelle","orcid":"0000-0001-8441-5075","full_name":"Fraisse, Christelle","last_name":"Fraisse"},{"first_name":"Camille","last_name":"Roux","full_name":"Roux, Camille"},{"first_name":"Pierre","full_name":"Gagnaire, Pierre","last_name":"Gagnaire"},{"full_name":"Romiguier, Jonathan","last_name":"Romiguier","first_name":"Jonathan"},{"full_name":"Faivre, Nicolas","last_name":"Faivre","first_name":"Nicolas"},{"first_name":"John","last_name":"Welch","full_name":"Welch, John"},{"first_name":"Nicolas","full_name":"Bierne, Nicolas","last_name":"Bierne"}],"publist_id":"7784","title":"The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies","citation":{"mla":"Fraisse, Christelle, et al. “The Divergence History of European Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing Techniques and Sampling Strategies.” PeerJ, vol. 2018, no. 7, 30083438, PeerJ, 2018, doi:10.7717/peerj.5198.","short":"C. Fraisse, C. Roux, P. Gagnaire, J. Romiguier, N. Faivre, J. Welch, N. Bierne, PeerJ 2018 (2018).","ieee":"C. Fraisse et al., “The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies,” PeerJ, vol. 2018, no. 7. PeerJ, 2018.","apa":"Fraisse, C., Roux, C., Gagnaire, P., Romiguier, J., Faivre, N., Welch, J., & Bierne, N. (2018). The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. PeerJ. https://doi.org/10.7717/peerj.5198","ama":"Fraisse C, Roux C, Gagnaire P, et al. The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. 2018;2018(7). doi:10.7717/peerj.5198","chicago":"Fraisse, Christelle, Camille Roux, Pierre Gagnaire, Jonathan Romiguier, Nicolas Faivre, John Welch, and Nicolas Bierne. “The Divergence History of European Blue Mussel Species Reconstructed from Approximate Bayesian Computation: The Effects of Sequencing Techniques and Sampling Strategies.” PeerJ. PeerJ, 2018. https://doi.org/10.7717/peerj.5198.","ista":"Fraisse C, Roux C, Gagnaire P, Romiguier J, Faivre N, Welch J, Bierne N. 2018. The divergence history of European blue mussel species reconstructed from Approximate Bayesian Computation: The effects of sequencing techniques and sampling strategies. PeerJ. 2018(7), 30083438."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":"1","intvolume":" 2018","month":"10","abstract":[{"lang":"eng","text":"Secondary contact is the reestablishment of gene flow between sister populations that have diverged. For instance, at the end of the Quaternary glaciations in Europe, secondary contact occurred during the northward expansion of the populations which had found refugia in the southern peninsulas. With the advent of multi-locus markers, secondary contact can be investigated using various molecular signatures including gradients of allele frequency, admixture clines, and local increase of genetic differentiation. We use coalescent simulations to investigate if molecular data provide enough information to distinguish between secondary contact following range expansion and an alternative evolutionary scenario consisting of a barrier to gene flow in an isolation-by-distance model. We find that an excess of linkage disequilibrium and of genetic diversity at the suture zone is a unique signature of secondary contact. We also find that the directionality index ψ, which was proposed to study range expansion, is informative to distinguish between the two hypotheses. However, although evidence for secondary contact is usually conveyed by statistics related to admixture coefficients, we find that they can be confounded by isolation-by-distance. We recommend to account for the spatial repartition of individuals when investigating secondary contact in order to better reflect the complex spatio-temporal evolution of populations and species."}],"oa_version":"Published Version","pmid":1,"issue":"10","volume":2018,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":1328344,"date_updated":"2020-07-14T12:46:06Z","file_name":"2018_PeerJ_Bertl.pdf","date_created":"2018-12-17T10:46:06Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5692","checksum":"3334886c4b39678db4c4b74299ca14ba"}],"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","status":"public","_id":"33","department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:46:06Z","date_updated":"2023-10-17T12:24:43Z","ddc":["576"],"oa":1,"publisher":"PeerJ","quality_controlled":"1","acknowledgement":"Johanna Bertl was supported by the Vienna Graduate School of Population Genetics (Austrian Science Fund (FWF): W1225-B20) and worked on this project while employed at the Department of Statistics and Operations Research, University of Vienna, Austria. This article was developed in the framework of the Grenoble Alpes Data Institute, which is supported by the French National Research Agency under the “Investissments d’avenir” program (ANR-15-IDEX-02).","date_created":"2018-12-11T11:44:16Z","doi":"10.7717/peerj.5325","date_published":"2018-10-01T00:00:00Z","year":"2018","isi":1,"has_accepted_license":"1","publication":"PeerJ","day":"01","article_number":"e5325","external_id":{"isi":["000447204400001"],"pmid":["30294507"]},"article_processing_charge":"No","author":[{"full_name":"Bertl, Johanna","last_name":"Bertl","first_name":"Johanna"},{"first_name":"Harald","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4884-9682","full_name":"Ringbauer, Harald","last_name":"Ringbauer"},{"last_name":"Blum","full_name":"Blum, Michaël","first_name":"Michaël"}],"publist_id":"8022","title":"Can secondary contact following range expansion be distinguished from barriers to gene flow?","citation":{"ama":"Bertl J, Ringbauer H, Blum M. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018;2018(10). doi:10.7717/peerj.5325","apa":"Bertl, J., Ringbauer, H., & Blum, M. (2018). Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. PeerJ. https://doi.org/10.7717/peerj.5325","short":"J. Bertl, H. Ringbauer, M. Blum, PeerJ 2018 (2018).","ieee":"J. Bertl, H. Ringbauer, and M. Blum, “Can secondary contact following range expansion be distinguished from barriers to gene flow?,” PeerJ, vol. 2018, no. 10. PeerJ, 2018.","mla":"Bertl, Johanna, et al. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ, vol. 2018, no. 10, e5325, PeerJ, 2018, doi:10.7717/peerj.5325.","ista":"Bertl J, Ringbauer H, Blum M. 2018. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018(10), e5325.","chicago":"Bertl, Johanna, Harald Ringbauer, and Michaël Blum. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” PeerJ. PeerJ, 2018. https://doi.org/10.7717/peerj.5325."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"_id":"5673","status":"public","type":"journal_article","date_updated":"2023-10-17T12:19:28Z","department":[{"_id":"JiFr"}],"pmid":1,"oa_version":"Submitted Version","abstract":[{"text":"Cell polarity, manifested by the localization of proteins to distinct polar plasma membrane domains, is a key prerequisite of multicellular life. In plants, PIN auxin transporters are prominent polarity markers crucial for a plethora of developmental processes. Cell polarity mechanisms in plants are distinct from other eukaryotes and still largely elusive. In particular, how the cell polarities are propagated and maintained following cell division remains unknown. Plant cytokinesis is orchestrated by the cell plate—a transient centrifugally growing endomembrane compartment ultimately forming the cross wall1. Trafficking of polar membrane proteins is typically redirected to the cell plate, and these will consequently have opposite polarity in at least one of the daughter cells2–5. Here, we provide mechanistic insights into post-cytokinetic re-establishment of cell polarity as manifested by the apical, polar localization of PIN2. We show that the apical domain is defined in a cell-intrinsic manner and that re-establishment of PIN2 localization to this domain requires de novo protein secretion and endocytosis, but not basal-to-apical transcytosis. Furthermore, we identify a PINOID-related kinase WAG1, which phosphorylates PIN2 in vitro6 and is transcriptionally upregulated specifically in dividing cells, as a crucial regulator of post-cytokinetic PIN2 polarity re-establishment.","lang":"eng"}],"intvolume":" 4","month":"12","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30518833"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["2055-0278"]},"ec_funded":1,"volume":4,"issue":"12","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Glanc, Matous, et al. “Mechanistic Framework for Cell-Intrinsic Re-Establishment of PIN2 Polarity after Cell Division.” Nature Plants, vol. 4, no. 12, Nature Research, 2018, pp. 1082–88, doi:10.1038/s41477-018-0318-3.","short":"M. Glanc, M. Fendrych, J. Friml, Nature Plants 4 (2018) 1082–1088.","ieee":"M. Glanc, M. Fendrych, and J. Friml, “Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division,” Nature Plants, vol. 4, no. 12. Nature Research, pp. 1082–1088, 2018.","apa":"Glanc, M., Fendrych, M., & Friml, J. (2018). Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. Nature Research. https://doi.org/10.1038/s41477-018-0318-3","ama":"Glanc M, Fendrych M, Friml J. Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. 2018;4(12):1082-1088. doi:10.1038/s41477-018-0318-3","chicago":"Glanc, Matous, Matyas Fendrych, and Jiří Friml. “Mechanistic Framework for Cell-Intrinsic Re-Establishment of PIN2 Polarity after Cell Division.” Nature Plants. Nature Research, 2018. https://doi.org/10.1038/s41477-018-0318-3.","ista":"Glanc M, Fendrych M, Friml J. 2018. Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division. Nature Plants. 4(12), 1082–1088."},"title":"Mechanistic framework for cell-intrinsic re-establishment of PIN2 polarity after cell division","external_id":{"isi":["000454576600017"],"pmid":["30518833"]},"article_processing_charge":"No","author":[{"first_name":"Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","orcid":"0000-0003-0619-7783","full_name":"Glanc, Matous","last_name":"Glanc"},{"first_name":"Matyas","id":"43905548-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9767-8699","full_name":"Fendrych, Matyas","last_name":"Fendrych"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"oa":1,"quality_controlled":"1","publisher":"Nature Research","publication":"Nature Plants","day":"03","year":"2018","isi":1,"date_created":"2018-12-16T22:59:18Z","doi":"10.1038/s41477-018-0318-3","date_published":"2018-12-03T00:00:00Z","page":"1082-1088"},{"citation":{"apa":"Ibsen-Jensen, R., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Language acquisition with communication between learners. Journal of the Royal Society Interface. The Royal Society. https://doi.org/10.1098/rsif.2018.0073","ama":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. Language acquisition with communication between learners. Journal of the Royal Society Interface. 2018;15(140). doi:10.1098/rsif.2018.0073","short":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).","ieee":"R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140. The Royal Society, 2018.","mla":"Ibsen-Jensen, Rasmus, et al. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface, vol. 15, no. 140, 20180073, The Royal Society, 2018, doi:10.1098/rsif.2018.0073.","ista":"Ibsen-Jensen R, Tkadlec J, Chatterjee K, Nowak M. 2018. Language acquisition with communication between learners. Journal of the Royal Society Interface. 15(140), 20180073.","chicago":"Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"isi":["000428576200023"],"pmid":["29593089"]},"author":[{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen"},{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"publist_id":"7715","title":"Language acquisition with communication between learners","article_number":"20180073","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"year":"2018","has_accepted_license":"1","isi":1,"publication":"Journal of the Royal Society Interface","day":"01","date_created":"2018-12-11T11:45:09Z","date_published":"2018-03-01T00:00:00Z","doi":"10.1098/rsif.2018.0073","oa":1,"publisher":"The Royal Society","quality_controlled":"1","date_updated":"2023-10-18T06:36:00Z","ddc":["000"],"file_date_updated":"2020-07-14T12:45:22Z","department":[{"_id":"KrCh"}],"_id":"198","type":"journal_article","article_type":"original","status":"public","publication_status":"published","publication_identifier":{"eissn":["1742-5662"]},"language":[{"iso":"eng"}],"file":[{"checksum":"444e1a9d98eb0e780671be82b13025f3","file_id":"5955","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-02-12T07:54:37Z","file_name":"2018_RS_IbsenJensen.pdf","creator":"dernst","date_updated":"2020-07-14T12:45:22Z","file_size":219837}],"ec_funded":1,"related_material":{"link":[{"url":"https://dx.doi.org/10.6084/m9.figshare.c.4028971","relation":"supplementary_material"}],"record":[{"relation":"research_data","status":"public","id":"9814"}]},"issue":"140","volume":15,"abstract":[{"lang":"eng","text":"We consider a class of students learning a language from a teacher. The situation can be interpreted as a group of child learners receiving input from the linguistic environment. The teacher provides sample sentences. The students try to learn the grammar from the teacher. In addition to just listening to the teacher, the students can also communicate with each other. The students hold hypotheses about the grammar and change them if they receive counter evidence. The process stops when all students have converged to the correct grammar. We study how the time to convergence depends on the structure of the classroom by introducing and evaluating various complexity measures. We find that structured communication between students, although potentially introducing confusion, can greatly reduce some of the complexity measures. Our theory can also be interpreted as applying to the scientific process, where nature is the teacher and the scientists are the students."}],"oa_version":"Submitted Version","pmid":1,"scopus_import":"1","intvolume":" 15","month":"03"},{"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"9664d4417f6b792242e31eea77ce9501","file_id":"5924","file_size":646732,"date_updated":"2020-07-14T12:47:13Z","creator":"dernst","file_name":"2018_RoyalSocOS_Corominas.pdf","date_created":"2019-02-05T14:38:09Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2054-5703"]},"publication_status":"published","volume":5,"issue":"12","oa_version":"Published Version","pmid":1,"abstract":[{"text":"The emergence of syntax during childhood is a remarkable example of how complex correlations unfold in nonlinear ways through development. In particular, rapid transitions seem to occur as children reach the age of two, which seems to separate a two-word, tree-like network of syntactic relations among words from the scale-free graphs associated with the adult, complex grammar. Here, we explore the evolution of syntax networks through language acquisition using the chromatic number, which captures the transition and provides a natural link to standard theories on syntactic structures. The data analysis is compared to a null model of network growth dynamics which is shown to display non-trivial and sensible differences. At a more general level, we observe that the chromatic classes define independent regions of the graph, and thus, can be interpreted as the footprints of incompatibility relations, somewhat as opposed to modularity considerations.","lang":"eng"}],"month":"12","intvolume":" 5","scopus_import":"1","ddc":["570"],"date_updated":"2023-10-18T06:41:12Z","file_date_updated":"2020-07-14T12:47:13Z","department":[{"_id":"EdHa"}],"_id":"5859","status":"public","article_type":"original","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)"},"day":"12","publication":"Royal Society Open Science","has_accepted_license":"1","isi":1,"year":"2018","doi":"10.1098/rsos.181286","date_published":"2018-12-12T00:00:00Z","date_created":"2019-01-20T22:59:18Z","acknowledgement":"This work was supported by the James McDonnell Foundation (B.C-M., S.V. and R.S.)","publisher":"The Royal Society","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 2018;5(12). doi:10.1098/rsos.181286","apa":"Corominas-Murtra, B., Fibla, M. S., Valverde, S., & Solé, R. (2018). Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. The Royal Society. https://doi.org/10.1098/rsos.181286","short":"B. Corominas-Murtra, M.S. Fibla, S. Valverde, R. Solé, Royal Society Open Science 5 (2018).","ieee":"B. Corominas-Murtra, M. S. Fibla, S. Valverde, and R. Solé, “Chromatic transitions in the emergence of syntax networks,” Royal Society Open Science, vol. 5, no. 12. The Royal Society, 2018.","mla":"Corominas-Murtra, Bernat, et al. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science, vol. 5, no. 12, 181286, The Royal Society, 2018, doi:10.1098/rsos.181286.","ista":"Corominas-Murtra B, Fibla MS, Valverde S, Solé R. 2018. Chromatic transitions in the emergence of syntax networks. Royal Society Open Science. 5(12), 181286.","chicago":"Corominas-Murtra, Bernat, Martí Sànchez Fibla, Sergi Valverde, and Ricard Solé. “Chromatic Transitions in the Emergence of Syntax Networks.” Royal Society Open Science. The Royal Society, 2018. https://doi.org/10.1098/rsos.181286."},"title":"Chromatic transitions in the emergence of syntax networks","author":[{"first_name":"Bernat","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9806-5643","full_name":"Corominas-Murtra, Bernat","last_name":"Corominas-Murtra"},{"first_name":"Martí Sànchez","last_name":"Fibla","full_name":"Fibla, Martí Sànchez"},{"first_name":"Sergi","full_name":"Valverde, Sergi","last_name":"Valverde"},{"first_name":"Ricard","last_name":"Solé","full_name":"Solé, Ricard"}],"article_processing_charge":"No","external_id":{"isi":["000456566500027"],"pmid":["30662738"]},"article_number":"181286"},{"status":"public","type":"preprint","article_number":"1804.07752","_id":"6183","department":[{"_id":"LaEr"}],"title":"The Dyson equation with linear self-energy: Spectral bands, edges and cusps","article_processing_charge":"No","external_id":{"arxiv":["1804.07752"]},"author":[{"last_name":"Alt","full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"full_name":"Krüger, Torben H","orcid":"0000-0002-4821-3297","last_name":"Krüger","first_name":"Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-12-18T10:46:08Z","citation":{"mla":"Alt, Johannes, et al. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, 1804.07752.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “The Dyson equation with linear self-energy: Spectral bands, edges and cusps,” arXiv. .","short":"J. Alt, L. Erdös, T.H. Krüger, ArXiv (n.d.).","ama":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv.","apa":"Alt, J., Erdös, L., & Krüger, T. H. (n.d.). The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv.","chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “The Dyson Equation with Linear Self-Energy: Spectral Bands, Edges and Cusps.” ArXiv, n.d.","ista":"Alt J, Erdös L, Krüger TH. The Dyson equation with linear self-energy: Spectral bands, edges and cusps. arXiv, 1804.07752."},"month":"04","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.07752"}],"oa":1,"oa_version":"Preprint","abstract":[{"text":"We study the unique solution $m$ of the Dyson equation \\[ -m(z)^{-1} = z - a\r\n+ S[m(z)] \\] on a von Neumann algebra $\\mathcal{A}$ with the constraint\r\n$\\mathrm{Im}\\,m\\geq 0$. Here, $z$ lies in the complex upper half-plane, $a$ is\r\na self-adjoint element of $\\mathcal{A}$ and $S$ is a positivity-preserving\r\nlinear operator on $\\mathcal{A}$. We show that $m$ is the Stieltjes transform\r\nof a compactly supported $\\mathcal{A}$-valued measure on $\\mathbb{R}$. Under\r\nsuitable assumptions, we establish that this measure has a uniformly\r\n$1/3$-H\\\"{o}lder continuous density with respect to the Lebesgue measure, which\r\nis supported on finitely many intervals, called bands. In fact, the density is\r\nanalytic inside the bands with a square-root growth at the edges and internal\r\ncubic root cusps whenever the gap between two bands vanishes. The shape of\r\nthese singularities is universal and no other singularity may occur. We give a\r\nprecise asymptotic description of $m$ near the singular points. These\r\nasymptotics generalize the analysis at the regular edges given in the companion\r\npaper on the Tracy-Widom universality for the edge eigenvalue statistics for\r\ncorrelated random matrices [arXiv:1804.07744] and they play a key role in the\r\nproof of the Pearcey universality at the cusp for Wigner-type matrices\r\n[arXiv:1809.03971,arXiv:1811.04055]. We also extend the finite dimensional band\r\nmass formula from [arXiv:1804.07744] to the von Neumann algebra setting by\r\nshowing that the spectral mass of the bands is topologically rigid under\r\ndeformations and we conclude that these masses are quantized in some important\r\ncases.","lang":"eng"}],"date_created":"2019-03-28T09:20:06Z","related_material":{"record":[{"status":"public","id":"149","relation":"dissertation_contains"},{"relation":"later_version","status":"public","id":"14694"}]},"date_published":"2018-04-20T00:00:00Z","publication":"arXiv","language":[{"iso":"eng"}],"day":"20","publication_status":"submitted","year":"2018"},{"month":"09","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1804.03057","open_access":"1"}],"publisher":"arXiv","oa_version":"Preprint","abstract":[{"text":"We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization.","lang":"eng"}],"date_created":"2018-12-11T11:44:30Z","ec_funded":1,"date_published":"2018-09-13T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","id":"8156","status":"public"}]},"doi":"10.48550/arXiv.1804.03057","language":[{"iso":"eng"}],"day":"13","year":"2018","publication_status":"published","project":[{"_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics"}],"status":"public","type":"preprint","article_number":"1804.03057","_id":"75","department":[{"_id":"HeEd"},{"_id":"JaMa"}],"title":"Convex fair partitions into arbitrary number of pieces","article_processing_charge":"No","external_id":{"arxiv":["1804.03057"]},"author":[{"orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey","last_name":"Avvakumov"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-12-18T10:51:02Z","citation":{"ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","chicago":"Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018.","short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018).","apa":"Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057","ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057","mla":"Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057."}},{"page":"3663-3742","doi":"10.1007/s00023-018-0723-1","date_published":"2018-11-13T00:00:00Z","date_created":"2018-12-11T11:47:09Z","has_accepted_license":"1","year":"2018","day":"13","publication":"Annales Henri Poincare","publisher":"Springer Nature","quality_controlled":"1","oa":1,"author":[{"first_name":"Dan","full_name":"Betea, Dan","last_name":"Betea"},{"first_name":"Jeremie","last_name":"Bouttier","full_name":"Bouttier, Jeremie"},{"full_name":"Nejjar, Peter","last_name":"Nejjar","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"},{"first_name":"Mirjana","last_name":"Vuletic","full_name":"Vuletic, Mirjana"}],"publist_id":"7258","article_processing_charge":"Yes (via OA deal)","external_id":{"arxiv":["1704.05809"]},"title":"The free boundary Schur process and applications I","citation":{"ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletic, “The free boundary Schur process and applications I,” Annales Henri Poincare, vol. 19, no. 12. Springer Nature, pp. 3663–3742, 2018.","short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletic, Annales Henri Poincare 19 (2018) 3663–3742.","ama":"Betea D, Bouttier J, Nejjar P, Vuletic M. The free boundary Schur process and applications I. Annales Henri Poincare. 2018;19(12):3663-3742. doi:10.1007/s00023-018-0723-1","apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletic, M. (2018). The free boundary Schur process and applications I. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-018-0723-1","mla":"Betea, Dan, et al. “The Free Boundary Schur Process and Applications I.” Annales Henri Poincare, vol. 19, no. 12, Springer Nature, 2018, pp. 3663–742, doi:10.1007/s00023-018-0723-1.","ista":"Betea D, Bouttier J, Nejjar P, Vuletic M. 2018. The free boundary Schur process and applications I. Annales Henri Poincare. 19(12), 3663–3742.","chicago":"Betea, Dan, Jeremie Bouttier, Peter Nejjar, and Mirjana Vuletic. “The Free Boundary Schur Process and Applications I.” Annales Henri Poincare. Springer Nature, 2018. https://doi.org/10.1007/s00023-018-0723-1."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"volume":19,"issue":"12","ec_funded":1,"publication_identifier":{"issn":["1424-0637"]},"publication_status":"published","file":[{"date_created":"2019-01-21T15:18:55Z","file_name":"2018_Annales_Betea.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:03Z","file_size":3084674,"checksum":"0c38abe73569b7166b7487ad5d23cc68","file_id":"5866","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"11","intvolume":" 19","abstract":[{"lang":"eng","text":"We investigate the free boundary Schur process, a variant of the Schur process introduced by Okounkov and Reshetikhin, where we allow the first and the last partitions to be arbitrary (instead of empty in the original setting). The pfaffian Schur process, previously studied by several authors, is recovered when just one of the boundary partitions is left free. We compute the correlation functions of the process in all generality via the free fermion formalism, which we extend with the thorough treatment of “free boundary states.” For the case of one free boundary, our approach yields a new proof that the process is pfaffian. For the case of two free boundaries, we find that the process is not pfaffian, but a closely related process is. We also study three different applications of the Schur process with one free boundary: fluctuations of symmetrized last passage percolation models, limit shapes and processes for symmetric plane partitions and for plane overpartitions."}],"oa_version":"Published Version","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"file_date_updated":"2020-07-14T12:47:03Z","date_updated":"2024-02-20T10:48:17Z","ddc":["500"],"article_type":"original","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","_id":"556"},{"main_file_link":[{"open_access":"1","url":"http://othes.univie.ac.at/51113/"}],"oa":1,"publisher":"Universität Wien","month":"04","abstract":[{"text":"Consortial subscription contracts regulate the digital access to publications between publishers and scientific libraries. However, since a couple of years the tendency towards a freely accessible publishing (Open Access) intensifies. As a consequence of this trend the contractual relationship between licensor and licensee is gradually changing as well: More and more contracts exercise influence on open access publishing. The present study attempts to compare Austrian examples of consortial licence contracts, which include components of open access. It describes the difference between pure subscription contracts and differing innovative deals including open access components. Thereby it becomes obvious that for the evaluation of this licence contracts new methods are needed. An essential new element of such analyses is the evaluation of the open access publication numbers. So this study tries to carry out such publication analyses for Austrian open access deals focusing on quantitative questions: How does the number of publications evolve? How does the open access share change? Publications reports of the publishers and database queries from Scopus form the data basis. The analysis of the data points out that differing approaches of contracts result in highly divergent results: Particular deals can prioritize a saving in costs or else the increase of the open access rate. It is to be assumed that within the following years further numerous open access deals will be negotiated. The finding of this study shall provide guidance.","lang":"eng"}],"oa_version":"Published Version","page":"94","date_created":"2018-12-11T11:45:34Z","date_published":"2018-04-06T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","id":"5577","status":"public"},{"relation":"dissertation_contains","id":"5574","status":"public"},{"id":"5578","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"5579","status":"public"},{"relation":"dissertation_contains","status":"public","id":"5576"},{"relation":"dissertation_contains","id":"5575","status":"public"},{"id":"5582","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"5581"},{"relation":"dissertation_contains","status":"public","id":"5580"}]},"publication_status":"published","year":"2018","language":[{"iso":"ger"}],"day":"06","type":"dissertation","status":"public","_id":"278","author":[{"full_name":"Villányi, Márton","orcid":"0000-0001-8126-0426","last_name":"Villányi","first_name":"Márton","id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7624","department":[{"_id":"E-Lib"}],"title":"Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken","date_updated":"2024-02-21T13:44:07Z","citation":{"chicago":"Villányi, Márton. “Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken.” Universität Wien, 2018.","ista":"Villányi M. 2018. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien.","mla":"Villányi, Márton. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien, 2018.","ieee":"M. Villányi, “Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken,” Universität Wien, 2018.","short":"M. Villányi, Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken, Universität Wien, 2018.","apa":"Villányi, M. (2018). Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. Universität Wien.","ama":"Villányi M. Lizenzverträge mit Open-Access-Komponenten an österreichischen Bibliotheken. 2018."},"supervisor":[{"last_name":"Kromp","full_name":"Kromp, Brigitte","first_name":"Brigitte"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"article_number":"e1006057","project":[{"name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)","grant_number":"720270","call_identifier":"H2020","_id":"25CBA828-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"254D1A94-B435-11E9-9278-68D0E5697425","grant_number":"P 25651-N26","name":"Sensitivity to higher-order statistics in natural scenes"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"V. Botella Soler, S. Deny, G. S. Martius, O. Marre, and G. Tkačik, “Nonlinear decoding of a complex movie from the mammalian retina,” PLoS Computational Biology, vol. 14, no. 5. Public Library of Science, 2018.","short":"V. Botella Soler, S. Deny, G.S. Martius, O. Marre, G. Tkačik, PLoS Computational Biology 14 (2018).","ama":"Botella Soler V, Deny S, Martius GS, Marre O, Tkačik G. Nonlinear decoding of a complex movie from the mammalian retina. PLoS Computational Biology. 2018;14(5). doi:10.1371/journal.pcbi.1006057","apa":"Botella Soler, V., Deny, S., Martius, G. S., Marre, O., & Tkačik, G. (2018). Nonlinear decoding of a complex movie from the mammalian retina. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1006057","mla":"Botella Soler, Vicente, et al. “Nonlinear Decoding of a Complex Movie from the Mammalian Retina.” PLoS Computational Biology, vol. 14, no. 5, e1006057, Public Library of Science, 2018, doi:10.1371/journal.pcbi.1006057.","ista":"Botella Soler V, Deny S, Martius GS, Marre O, Tkačik G. 2018. Nonlinear decoding of a complex movie from the mammalian retina. PLoS Computational Biology. 14(5), e1006057.","chicago":"Botella Soler, Vicente, Stephane Deny, Georg S Martius, Olivier Marre, and Gašper Tkačik. “Nonlinear Decoding of a Complex Movie from the Mammalian Retina.” PLoS Computational Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pcbi.1006057."},"title":"Nonlinear decoding of a complex movie from the mammalian retina","author":[{"full_name":"Botella Soler, Vicent","orcid":"0000-0002-8790-1914","last_name":"Botella Soler","first_name":"Vicent","id":"421234E8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Deny, Stephane","last_name":"Deny","first_name":"Stephane"},{"last_name":"Martius","full_name":"Martius, Georg S","first_name":"Georg S"},{"first_name":"Olivier","full_name":"Marre, Olivier","last_name":"Marre"},{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper"}],"external_id":{"isi":["000434012100002"]},"article_processing_charge":"Yes","quality_controlled":"1","publisher":"Public Library of Science","oa":1,"day":"10","publication":"PLoS Computational Biology","has_accepted_license":"1","isi":1,"year":"2018","doi":"10.1371/journal.pcbi.1006057","date_published":"2018-05-10T00:00:00Z","date_created":"2018-12-11T11:45:39Z","_id":"292","status":"public","article_type":"original","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_updated":"2024-02-21T13:45:25Z","file_date_updated":"2020-07-14T12:45:53Z","department":[{"_id":"GaTk"}],"oa_version":"Published Version","abstract":[{"text":"Retina is a paradigmatic system for studying sensory encoding: the transformation of light into spiking activity of ganglion cells. The inverse problem, where stimulus is reconstructed from spikes, has received less attention, especially for complex stimuli that should be reconstructed “pixel-by-pixel”. We recorded around a hundred neurons from a dense patch in a rat retina and decoded movies of multiple small randomly-moving discs. We constructed nonlinear (kernelized and neural network) decoders that improved significantly over linear results. An important contribution to this was the ability of nonlinear decoders to reliably separate between neural responses driven by locally fluctuating light signals, and responses at locally constant light driven by spontaneous-like activity. This improvement crucially depended on the precise, non-Poisson temporal structure of individual spike trains, which originated in the spike-history dependence of neural responses. We propose a general principle by which downstream circuitry could discriminate between spontaneous and stimulus-driven activity based solely on higher-order statistical structure in the incoming spike trains.","lang":"eng"}],"month":"05","intvolume":" 14","scopus_import":"1","file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5974","checksum":"3026f94d235219e15514505fdbadf34e","file_size":3460786,"date_updated":"2020-07-14T12:45:53Z","creator":"dernst","file_name":"2018_Plos_Botella_Soler.pdf","date_created":"2019-02-13T11:07:15Z"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":14,"issue":"5","related_material":{"record":[{"relation":"research_data","id":"5584","status":"public"}],"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/video-of-moving-discs-reconstructed-from-rat-retinal-neuron-signals/","description":"News on IST Homepage"}]},"ec_funded":1},{"date_updated":"2024-02-21T13:44:45Z","ddc":["576"],"department":[{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:46:27Z","_id":"438","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":"971","publication_status":"published","file":[{"creator":"system","file_size":5027978,"date_updated":"2020-07-14T12:46:27Z","file_name":"IST-2018-971-v1+1_2018_Nikoloc_Autoregulation_of.pdf","date_created":"2018-12-12T10:15:30Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"3ff4f545c27e11a4cd20ccb30778793e","file_id":"5151"}],"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"5569","status":"public","relation":"popular_science"}]},"volume":46,"issue":"6","abstract":[{"lang":"eng","text":"The MazF toxin sequence-specifically cleaves single-stranded RNA upon various stressful conditions, and it is activated as a part of the mazEF toxin–antitoxin module in Escherichia coli. Although autoregulation of mazEF expression through the MazE antitoxin-dependent transcriptional repression has been biochemically characterized, less is known about post-transcriptional autoregulation, as well as how both of these autoregulatory features affect growth of single cells during conditions that promote MazF production. Here, we demonstrate post-transcriptional autoregulation of mazF expression dynamics by MazF cleaving its own transcript. Single-cell analyses of bacterial populations during ectopic MazF production indicated that two-level autoregulation of mazEF expression influences cell-to-cell growth rate heterogeneity. The increase in growth rate heterogeneity is governed by the MazE antitoxin, and tuned by the MazF-dependent mazF mRNA cleavage. Also, both autoregulatory features grant rapid exit from the stress caused by mazF overexpression. Time-lapse microscopy revealed that MazF-mediated cleavage of mazF mRNA leads to increased temporal variability in length of individual cells during ectopic mazF overexpression, as explained by a stochastic model indicating that mazEF mRNA cleavage underlies temporal fluctuations in MazF levels during stress."}],"oa_version":"Published Version","scopus_import":"1","month":"04","intvolume":" 46","citation":{"mla":"Nikolic, Nela, et al. “Autoregulation of MazEF Expression Underlies Growth Heterogeneity in Bacterial Populations.” Nucleic Acids Research, vol. 46, no. 6, Oxford University Press, 2018, pp. 2918–31, doi:10.1093/nar/gky079.","ieee":"N. Nikolic, T. Bergmiller, A. Vandervelde, T. Albanese, L. Gelens, and I. Moll, “Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations,” Nucleic Acids Research, vol. 46, no. 6. Oxford University Press, pp. 2918–2931, 2018.","short":"N. Nikolic, T. Bergmiller, A. Vandervelde, T. Albanese, L. Gelens, I. Moll, Nucleic Acids Research 46 (2018) 2918–2931.","ama":"Nikolic N, Bergmiller T, Vandervelde A, Albanese T, Gelens L, Moll I. Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. Nucleic Acids Research. 2018;46(6):2918-2931. doi:10.1093/nar/gky079","apa":"Nikolic, N., Bergmiller, T., Vandervelde, A., Albanese, T., Gelens, L., & Moll, I. (2018). Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gky079","chicago":"Nikolic, Nela, Tobias Bergmiller, Alexandra Vandervelde, Tanino Albanese, Lendert Gelens, and Isabella Moll. “Autoregulation of MazEF Expression Underlies Growth Heterogeneity in Bacterial Populations.” Nucleic Acids Research. Oxford University Press, 2018. https://doi.org/10.1093/nar/gky079.","ista":"Nikolic N, Bergmiller T, Vandervelde A, Albanese T, Gelens L, Moll I. 2018. Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations. Nucleic Acids Research. 46(6), 2918–2931."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Nela","id":"42D9CABC-F248-11E8-B48F-1D18A9856A87","last_name":"Nikolic","full_name":"Nikolic, Nela","orcid":"0000-0001-9068-6090"},{"first_name":"Tobias","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","last_name":"Bergmiller"},{"first_name":"Alexandra","last_name":"Vandervelde","full_name":"Vandervelde, Alexandra"},{"first_name":"Tanino","last_name":"Albanese","full_name":"Albanese, Tanino"},{"last_name":"Gelens","full_name":"Gelens, Lendert","first_name":"Lendert"},{"last_name":"Moll","full_name":"Moll, Isabella","first_name":"Isabella"}],"article_processing_charge":"Yes (in subscription journal)","external_id":{"isi":["000429009500021"]},"title":"Autoregulation of mazEF expression underlies growth heterogeneity in bacterial populations","project":[{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF","name":"FWF Open Access Fund"}],"isi":1,"has_accepted_license":"1","year":"2018","day":"06","publication":"Nucleic Acids Research","page":"2918-2931","date_published":"2018-04-06T00:00:00Z","doi":"10.1093/nar/gky079","date_created":"2018-12-11T11:46:29Z","quality_controlled":"1","publisher":"Oxford University Press","oa":1},{"volume":7,"related_material":{"record":[{"relation":"popular_science","id":"5586","status":"public"}]},"publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_size":3158125,"date_updated":"2020-07-14T12:44:43Z","creator":"dernst","file_name":"2018_eLife_Picard.pdf","date_created":"2018-12-17T11:55:05Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"d6331d4385b1fffd6b47b45d5949d841","file_id":"5695"}],"scopus_import":"1","intvolume":" 7","month":"08","abstract":[{"lang":"eng","text":"XY systems usually show chromosome-wide compensation of X-linked genes, while in many ZW systems, compensation is restricted to a minority of dosage-sensitive genes. Why such differences arose is still unclear. Here, we combine comparative genomics, transcriptomics and proteomics to obtain a complete overview of the evolution of gene dosage on the Z-chromosome of Schistosoma parasites. We compare the Z-chromosome gene content of African (Schistosoma mansoni and S. haematobium) and Asian (S. japonicum) schistosomes and describe lineage-specific evolutionary strata. We use these to assess gene expression evolution following sex-linkage. The resulting patterns suggest a reduction in expression of Z-linked genes in females, combined with upregulation of the Z in both sexes, in line with the first step of Ohno’s classic model of dosage compensation evolution. Quantitative proteomics suggest that post-transcriptional mechanisms do not play a major role in balancing the expression of Z-linked genes. "}],"oa_version":"Published Version","department":[{"_id":"BeVi"}],"file_date_updated":"2020-07-14T12:44:43Z","date_updated":"2024-02-21T13:45:12Z","ddc":["570"],"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)"},"article_type":"original","type":"journal_article","status":"public","_id":"131","date_created":"2018-12-11T11:44:47Z","doi":"10.7554/eLife.35684","date_published":"2018-08-13T00:00:00Z","year":"2018","isi":1,"has_accepted_license":"1","publication":"eLife","day":"13","oa":1,"publisher":"eLife Sciences Publications","quality_controlled":"1","acknowledgement":"We are grateful to Lu Dabing (Soochow University, Suzhou, China) for providing Schistosoma japonicum samples, to Ariana Macon (IST Austria) and Georgette Stovall (JLU Giessen) for technical assistance, to IT support at IST Austria for providing optimal environment to bioinformatic analyses, and to the Vicoso lab for comments on the manuscript.","article_processing_charge":"No","external_id":{"isi":["000441388200001"]},"publist_id":"7792","author":[{"id":"2C921A7A-F248-11E8-B48F-1D18A9856A87","first_name":"Marion A","last_name":"Picard","full_name":"Picard, Marion A","orcid":"0000-0002-8101-2518"},{"full_name":"Cosseau, Celine","last_name":"Cosseau","first_name":"Celine"},{"first_name":"Sabrina","full_name":"Ferré, Sabrina","last_name":"Ferré"},{"first_name":"Thomas","full_name":"Quack, Thomas","last_name":"Quack"},{"last_name":"Grevelding","full_name":"Grevelding, Christoph","first_name":"Christoph"},{"first_name":"Yohann","last_name":"Couté","full_name":"Couté, Yohann"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz"}],"title":"Evolution of gene dosage on the Z-chromosome of schistosome parasites","citation":{"chicago":"Picard, Marion A L, Celine Cosseau, Sabrina Ferré, Thomas Quack, Christoph Grevelding, Yohann Couté, and Beatriz Vicoso. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.35684.","ista":"Picard MAL, Cosseau C, Ferré S, Quack T, Grevelding C, Couté Y, Vicoso B. 2018. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 7, e35684.","mla":"Picard, Marion A. L., et al. “Evolution of Gene Dosage on the Z-Chromosome of Schistosome Parasites.” ELife, vol. 7, e35684, eLife Sciences Publications, 2018, doi:10.7554/eLife.35684.","ieee":"M. A. L. Picard et al., “Evolution of gene dosage on the Z-chromosome of schistosome parasites,” eLife, vol. 7. eLife Sciences Publications, 2018.","short":"M.A.L. Picard, C. Cosseau, S. Ferré, T. Quack, C. Grevelding, Y. Couté, B. Vicoso, ELife 7 (2018).","ama":"Picard MAL, Cosseau C, Ferré S, et al. Evolution of gene dosage on the Z-chromosome of schistosome parasites. eLife. 2018;7. doi:10.7554/eLife.35684","apa":"Picard, M. A. L., Cosseau, C., Ferré, S., Quack, T., Grevelding, C., Couté, Y., & Vicoso, B. (2018). Evolution of gene dosage on the Z-chromosome of schistosome parasites. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.35684"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"P28842-B22","name":"Sex chromosome evolution under male- and female- heterogamety","call_identifier":"FWF","_id":"250ED89C-B435-11E9-9278-68D0E5697425"}],"article_number":"e35684"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Ellis T, Field D, Barton NH. 2018. Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering. Molecular Ecology Resources. 18(5), 988–999.","chicago":"Ellis, Thomas, David Field, and Nicholas H Barton. “Efficient Inference of Paternity and Sibship Inference given Known Maternity via Hierarchical Clustering.” Molecular Ecology Resources. Wiley, 2018. https://doi.org/10.1111/1755-0998.12782.","ieee":"T. Ellis, D. Field, and N. H. Barton, “Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering,” Molecular Ecology Resources, vol. 18, no. 5. Wiley, pp. 988–999, 2018.","short":"T. Ellis, D. Field, N.H. Barton, Molecular Ecology Resources 18 (2018) 988–999.","ama":"Ellis T, Field D, Barton NH. Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering. Molecular Ecology Resources. 2018;18(5):988-999. doi:10.1111/1755-0998.12782","apa":"Ellis, T., Field, D., & Barton, N. H. (2018). Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering. Molecular Ecology Resources. Wiley. https://doi.org/10.1111/1755-0998.12782","mla":"Ellis, Thomas, et al. “Efficient Inference of Paternity and Sibship Inference given Known Maternity via Hierarchical Clustering.” Molecular Ecology Resources, vol. 18, no. 5, Wiley, 2018, pp. 988–99, doi:10.1111/1755-0998.12782."},"title":"Efficient inference of paternity and sibship inference given known maternity via hierarchical clustering","author":[{"first_name":"Thomas","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87","last_name":"Ellis","orcid":"0000-0002-8511-0254","full_name":"Ellis, Thomas"},{"full_name":"Field, David","orcid":"0000-0002-4014-8478","last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87","first_name":"David"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240"}],"external_id":{"isi":["000441753000007"]},"article_processing_charge":"No","project":[{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"}],"day":"01","publication":"Molecular Ecology Resources","isi":1,"year":"2018","date_published":"2018-09-01T00:00:00Z","doi":"10.1111/1755-0998.12782","date_created":"2018-12-11T11:45:37Z","page":"988 - 999","acknowledgement":"ERC, Grant/Award Number: 250152","quality_controlled":"1","publisher":"Wiley","date_updated":"2024-02-21T13:45:00Z","department":[{"_id":"NiBa"}],"_id":"286","status":"public","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","related_material":{"record":[{"relation":"popular_science","status":"public","id":"5583"}]},"volume":18,"issue":"5","ec_funded":1,"oa_version":"None","abstract":[{"lang":"eng","text":"Pedigree and sibship reconstruction are important methods in quantifying relationships and fitness of individuals in natural populations. Current methods employ a Markov chain-based algorithm to explore plausible possible pedigrees iteratively. This provides accurate results, but is time-consuming. Here, we develop a method to infer sibship and paternity relationships from half-sibling arrays of known maternity using hierarchical clustering. Given 50 or more unlinked SNP markers and empirically derived error rates, the method performs as well as the widely used package Colony, but is faster by two orders of magnitude. Using simulations, we show that the method performs well across contrasting mating scenarios, even when samples are large. We then apply the method to open-pollinated arrays of the snapdragon Antirrhinum majus and find evidence for a high degree of multiple mating. Although we focus on diploid SNP data, the method does not depend on marker type and as such has broad applications in nonmodel systems. "}],"month":"09","intvolume":" 18","scopus_import":"1"},{"project":[{"name":"Biophysics of information processing in gene regulation","grant_number":"P28844-B27","_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"2988","title":"Statistical mechanics for metabolic networks during steady state growth","article_processing_charge":"No","external_id":{"isi":["000440149300021"]},"publist_id":"7760","author":[{"last_name":"De Martino","full_name":"De Martino, Daniele","orcid":"0000-0002-5214-4706","first_name":"Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andersson Anna","last_name":"Mc","full_name":"Mc, Andersson Anna"},{"id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias","orcid":"0000-0001-5396-4346","full_name":"Bergmiller, Tobias","last_name":"Bergmiller"},{"last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","last_name":"Tkacik"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"D. De Martino, A. A. Mc, T. Bergmiller, C. C. Guet, and G. Tkačik, “Statistical mechanics for metabolic networks during steady state growth,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018.","short":"D. De Martino, A.A. Mc, T. Bergmiller, C.C. Guet, G. Tkačik, Nature Communications 9 (2018).","ama":"De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. Statistical mechanics for metabolic networks during steady state growth. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-05417-9","apa":"De Martino, D., Mc, A. A., Bergmiller, T., Guet, C. C., & Tkačik, G. (2018). Statistical mechanics for metabolic networks during steady state growth. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-05417-9","mla":"De Martino, Daniele, et al. “Statistical Mechanics for Metabolic Networks during Steady State Growth.” Nature Communications, vol. 9, no. 1, 2988, Springer Nature, 2018, doi:10.1038/s41467-018-05417-9.","ista":"De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. 2018. Statistical mechanics for metabolic networks during steady state growth. Nature Communications. 9(1), 2988.","chicago":"De Martino, Daniele, Andersson Anna Mc, Tobias Bergmiller, Calin C Guet, and Gašper Tkačik. “Statistical Mechanics for Metabolic Networks during Steady State Growth.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-05417-9."},"oa":1,"quality_controlled":"1","publisher":"Springer Nature","date_created":"2018-12-11T11:44:57Z","doi":"10.1038/s41467-018-05417-9","date_published":"2018-07-30T00:00:00Z","publication":"Nature Communications","day":"30","year":"2018","isi":1,"has_accepted_license":"1","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","_id":"161","department":[{"_id":"GaTk"},{"_id":"CaGu"}],"file_date_updated":"2020-07-14T12:45:06Z","ddc":["570"],"date_updated":"2024-02-21T13:45:39Z","intvolume":" 9","month":"07","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Which properties of metabolic networks can be derived solely from stoichiometry? Predictive results have been obtained by flux balance analysis (FBA), by postulating that cells set metabolic fluxes to maximize growth rate. Here we consider a generalization of FBA to single-cell level using maximum entropy modeling, which we extend and test experimentally. Specifically, we define for Escherichia coli metabolism a flux distribution that yields the experimental growth rate: the model, containing FBA as a limit, provides a better match to measured fluxes and it makes a wide range of predictions: on flux variability, regulation, and correlations; on the relative importance of stoichiometry vs. optimization; on scaling relations for growth rate distributions. We validate the latter here with single-cell data at different sub-inhibitory antibiotic concentrations. The model quantifies growth optimization as emerging from the interplay of competitive dynamics in the population and regulation of metabolism at the level of single cells.","lang":"eng"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"5587","relation":"popular_science"}]},"issue":"1","volume":9,"language":[{"iso":"eng"}],"file":[{"file_id":"5728","checksum":"3ba7ab27b27723c7dcf633e8fc1f8f18","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_NatureComm_DeMartino.pdf","date_created":"2018-12-17T16:44:28Z","file_size":1043205,"date_updated":"2020-07-14T12:45:06Z","creator":"dernst"}],"publication_status":"published"},{"page":"365 - 375","doi":"10.1534/genetics.117.300513","date_published":"2018-01-01T00:00:00Z","date_created":"2018-12-11T11:47:04Z","has_accepted_license":"1","isi":1,"year":"2018","day":"01","publication":"Genetics","quality_controlled":"1","publisher":"Genetics Society of America","oa":1,"author":[{"full_name":"Kelemen, Réka K","orcid":"0000-0002-8489-9281","last_name":"Kelemen","id":"48D3F8DE-F248-11E8-B48F-1D18A9856A87","first_name":"Réka K"},{"last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7274","external_id":{"isi":["000419356300024"]},"article_processing_charge":"No","title":"Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver","citation":{"mla":"Kelemen, Réka K., and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” Genetics, vol. 208, no. 1, Genetics Society of America, 2018, pp. 365–75, doi:10.1534/genetics.117.300513.","ama":"Kelemen RK, Vicoso B. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. 2018;208(1):365-375. doi:10.1534/genetics.117.300513","apa":"Kelemen, R. K., & Vicoso, B. (2018). Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.117.300513","ieee":"R. K. Kelemen and B. Vicoso, “Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver,” Genetics, vol. 208, no. 1. Genetics Society of America, pp. 365–375, 2018.","short":"R.K. Kelemen, B. Vicoso, Genetics 208 (2018) 365–375.","chicago":"Kelemen, Réka K, and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/genetics.117.300513.","ista":"Kelemen RK, Vicoso B. 2018. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. 208(1), 365–375."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution","grant_number":"715257","_id":"250BDE62-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"volume":208,"issue":"1","related_material":{"record":[{"relation":"popular_science","id":"5571","status":"public"},{"status":"public","id":"5572","relation":"popular_science"}]},"ec_funded":1,"publication_status":"published","file":[{"file_name":"IST-2018-1058-v1+1_365.full__1_.pdf","date_created":"2018-12-12T10:15:14Z","creator":"system","file_size":1311661,"date_updated":"2020-07-14T12:46:50Z","checksum":"2123845e7031a0cf043905be160f9e69","file_id":"5132","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"scopus_import":"1","month":"01","intvolume":" 208","abstract":[{"lang":"eng","text":"The t-haplotype, a mouse meiotic driver found on chromosome 17, has been a model for autosomal segregation distortion for close to a century, but several questions remain regarding its biology and evolutionary history. A recently published set of population genomics resources for wild mice includes several individuals heterozygous for the t-haplotype, which we use to characterize this selfish element at the genomic and transcriptomic level. Our results show that large sections of the t-haplotype have been replaced by standard homologous sequences, possibly due to occasional events of recombination, and that this complicates the inference of its history. As expected for a long genomic segment of very low recombination, the t-haplotype carries an excess of fixed nonsynonymous mutations compared to the standard chromosome. This excess is stronger for regions that have not undergone recent recombination, suggesting that occasional gene flow between the t and the standard chromosome may provide a mechanism to regenerate coding sequences that have accumulated deleterious mutations. Finally, we find that t-complex genes with altered expression largely overlap with deleted or amplified regions, and that carrying a t-haplotype alters the testis expression of genes outside of the t-complex, providing new leads into the pathways involved in the biology of this segregation distorter."}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:50Z","department":[{"_id":"BeVi"}],"date_updated":"2024-02-21T13:48:27Z","ddc":["576"],"type":"journal_article","article_type":"original","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":"1058","_id":"542"},{"article_processing_charge":"No","external_id":{"isi":["000461126500071"]},"author":[{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","first_name":"Josef","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef","last_name":"Tkadlec"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Martin A.","full_name":"Nowak, Martin A.","last_name":"Nowak"}],"title":"Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory","citation":{"chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. 2018. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 1(1), 71.","mla":"Pavlogiannis, Andreas, et al. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology, vol. 1, no. 1, 71, Springer Nature, 2018, doi:10.1038/s42003-018-0078-7.","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. A. (2018). Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. Springer Nature. https://doi.org/10.1038/s42003-018-0078-7","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak MA. Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory. Communications Biology. 2018;1(1). doi:10.1038/s42003-018-0078-7","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M.A. Nowak, Communications Biology 1 (2018).","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. A. Nowak, “Construction of arbitrarily strong amplifiers of natural selection using evolutionary graph theory,” Communications Biology, vol. 1, no. 1. Springer Nature, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"article_number":"71","date_created":"2018-12-18T13:22:58Z","doi":"10.1038/s42003-018-0078-7","date_published":"2018-06-14T00:00:00Z","year":"2018","has_accepted_license":"1","isi":1,"publication":"Communications Biology","day":"14","oa":1,"publisher":"Springer Nature","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"KrCh"}],"date_updated":"2024-02-21T13:48:42Z","ddc":["004","519","576"],"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","pubrep_id":"1045","status":"public","_id":"5751","ec_funded":1,"volume":1,"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7196"},{"id":"5559","status":"public","relation":"popular_science"}]},"issue":"1","publication_status":"published","publication_identifier":{"issn":["2399-3642"]},"language":[{"iso":"eng"}],"file":[{"file_size":1804194,"date_updated":"2020-07-14T12:47:10Z","creator":"dernst","file_name":"2018_CommBiology_Pavlogiannis.pdf","date_created":"2018-12-18T13:37:04Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5752","checksum":"a9db825fa3b64a51ff3de035ec973b3e"}],"scopus_import":"1","intvolume":" 1","month":"06","abstract":[{"text":"Because of the intrinsic randomness of the evolutionary process, a mutant with a fitness advantage has some chance to be selected but no certainty. Any experiment that searches for advantageous mutants will lose many of them due to random drift. It is therefore of great interest to find population structures that improve the odds of advantageous mutants. Such structures are called amplifiers of natural selection: they increase the probability that advantageous mutants are selected. Arbitrarily strong amplifiers guarantee the selection of advantageous mutants, even for very small fitness advantage. Despite intensive research over the past decade, arbitrarily strong amplifiers have remained rare. Here we show how to construct a large variety of them. Our amplifiers are so simple that they could be useful in biotechnology, when optimizing biological molecules, or as a diagnostic tool, when searching for faster dividing cells or viruses. They could also occur in natural population structures.","lang":"eng"}],"oa_version":"Published Version"},{"page":"456","doi":"10.15479/AT:ISTA:TH_1040","date_published":"2018-07-12T00:00:00Z","date_created":"2018-12-11T11:44:53Z","has_accepted_license":"1","year":"2018","day":"12","publisher":"Institute of Science and Technology Austria","oa":1,"publist_id":"7772","author":[{"full_name":"Alt, Johannes","last_name":"Alt","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes"}],"article_processing_charge":"No","title":"Dyson equation and eigenvalue statistics of random matrices","citation":{"ista":"Alt J. 2018. Dyson equation and eigenvalue statistics of random matrices. Institute of Science and Technology Austria.","chicago":"Alt, Johannes. “Dyson Equation and Eigenvalue Statistics of Random Matrices.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1040.","ieee":"J. Alt, “Dyson equation and eigenvalue statistics of random matrices,” Institute of Science and Technology Austria, 2018.","short":"J. Alt, Dyson Equation and Eigenvalue Statistics of Random Matrices, Institute of Science and Technology Austria, 2018.","ama":"Alt J. Dyson equation and eigenvalue statistics of random matrices. 2018. doi:10.15479/AT:ISTA:TH_1040","apa":"Alt, J. (2018). Dyson equation and eigenvalue statistics of random matrices. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1040","mla":"Alt, Johannes. Dyson Equation and Eigenvalue Statistics of Random Matrices. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1040."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1677"},{"status":"public","id":"550","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"6183"},{"relation":"part_of_dissertation","status":"public","id":"566"},{"relation":"part_of_dissertation","status":"public","id":"1010"},{"status":"public","id":"6240","relation":"part_of_dissertation"},{"id":"6184","status":"public","relation":"part_of_dissertation"}]},"ec_funded":1,"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","file":[{"checksum":"d4dad55a7513f345706aaaba90cb1bb8","file_id":"6241","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_thesis_Alt.pdf","date_created":"2019-04-08T13:55:20Z","file_size":5801709,"date_updated":"2020-07-14T12:44:57Z","creator":"dernst"},{"date_created":"2019-04-08T13:55:20Z","file_name":"2018_thesis_Alt_source.zip","creator":"dernst","date_updated":"2020-07-14T12:44:57Z","file_size":3802059,"file_id":"6242","checksum":"d73fcf46300dce74c403f2b491148ab4","access_level":"closed","relation":"source_file","content_type":"application/zip"}],"language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"month":"07","abstract":[{"text":"The eigenvalue density of many large random matrices is well approximated by a deterministic measure, the self-consistent density of states. In the present work, we show this behaviour for several classes of random matrices. In fact, we establish that, in each of these classes, the self-consistent density of states approximates the eigenvalue density of the random matrix on all scales slightly above the typical eigenvalue spacing. For large classes of random matrices, the self-consistent density of states exhibits several universal features. We prove that, under suitable assumptions, random Gram matrices and Hermitian random matrices with decaying correlations have a 1/3-Hölder continuous self-consistent density of states ρ on R, which is analytic, where it is positive, and has either a square root edge or a cubic root cusp, where it vanishes. We, thus, extend the validity of the corresponding result for Wigner-type matrices from [4, 5, 7]. We show that ρ is determined as the inverse Stieltjes transform of the normalized trace of the unique solution m(z) to the Dyson equation −m(z) −1 = z − a + S[m(z)] on C N×N with the constraint Im m(z) ≥ 0. Here, z lies in the complex upper half-plane, a is a self-adjoint element of C N×N and S is a positivity-preserving operator on C N×N encoding the first two moments of the random matrix. In order to analyze a possible limit of ρ for N → ∞ and address some applications in free probability theory, we also consider the Dyson equation on infinite dimensional von Neumann algebras. We present two applications to random matrices. We first establish that, under certain assumptions, large random matrices with independent entries have a rotationally symmetric self-consistent density of states which is supported on a centered disk in C. Moreover, it is infinitely often differentiable apart from a jump on the boundary of this disk. Second, we show edge universality at all regular (not necessarily extreme) spectral edges for Hermitian random matrices with decaying correlations.","lang":"eng"}],"oa_version":"Published Version","department":[{"_id":"LaEr"}],"file_date_updated":"2020-07-14T12:44:57Z","supervisor":[{"last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2024-02-22T14:34:33Z","ddc":["515","519"],"type":"dissertation","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":"1040","_id":"149"},{"volume":148,"related_material":{"record":[{"relation":"dissertation_contains","id":"10759","status":"public"}]},"issue":"10","ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","month":"03","intvolume":" 148","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1711.09904","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Recently it was shown that a molecule rotating in a quantum solvent can be described in terms of the “angulon” quasiparticle [M. Lemeshko, Phys. Rev. Lett. 118, 095301 (2017)]. Here we extend the angulon theory to the case of molecules possessing an additional spin-1/2 degree of freedom and study the behavior of the system in the presence of a static magnetic field. We show that exchange of angular momentum between the molecule and the solvent can be altered by the field, even though the solvent itself is non-magnetic. In particular, we demonstrate a possibility to control resonant emission of phonons with a given angular momentum using a magnetic field."}],"department":[{"_id":"MiLe"}],"date_updated":"2024-02-28T13:01:59Z","status":"public","type":"journal_article","article_type":"original","_id":"415","doi":"10.1063/1.5017591","date_published":"2018-03-14T00:00:00Z","date_created":"2018-12-11T11:46:21Z","day":"14","publication":"The Journal of Chemical Physics","isi":1,"year":"2018","publisher":"AIP Publishing","quality_controlled":"1","oa":1,"acknowledgement":"We acknowledge insightful discussions with Giacomo Bighin, Igor Cherepanov, Johan Mentink, and Enderalp Yakaboylu. This work was supported by the Austrian Science Fund (FWF), Project No. P29902-N27. W.R. was supported by the Polish Ministry of Science and Higher Education Grant No. MNISW/2016/DIR/285/NN and by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","title":"Effect of a magnetic field on molecule–solvent angular momentum transfer","author":[{"full_name":"Rzadkowski, Wojciech","orcid":"0000-0002-1106-4419","last_name":"Rzadkowski","first_name":"Wojciech","id":"48C55298-F248-11E8-B48F-1D18A9856A87"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802"}],"publist_id":"7408","article_processing_charge":"No","external_id":{"isi":["000427517200065"],"arxiv":["1711.09904"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Rzadkowski W, Lemeshko M. 2018. Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. 148(10), 104307.","chicago":"Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field on Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics. AIP Publishing, 2018. https://doi.org/10.1063/1.5017591.","apa":"Rzadkowski, W., & Lemeshko, M. (2018). Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. AIP Publishing. https://doi.org/10.1063/1.5017591","ama":"Rzadkowski W, Lemeshko M. Effect of a magnetic field on molecule–solvent angular momentum transfer. The Journal of Chemical Physics. 2018;148(10). doi:10.1063/1.5017591","ieee":"W. Rzadkowski and M. Lemeshko, “Effect of a magnetic field on molecule–solvent angular momentum transfer,” The Journal of Chemical Physics, vol. 148, no. 10. AIP Publishing, 2018.","short":"W. Rzadkowski, M. Lemeshko, The Journal of Chemical Physics 148 (2018).","mla":"Rzadkowski, Wojciech, and Mikhail Lemeshko. “Effect of a Magnetic Field on Molecule–Solvent Angular Momentum Transfer.” The Journal of Chemical Physics, vol. 148, no. 10, 104307, AIP Publishing, 2018, doi:10.1063/1.5017591."},"project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program"}],"article_number":"104307"},{"external_id":{"isi":["000448185000055"]},"article_processing_charge":"No","author":[{"first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","full_name":"Jeschke, Stefan"},{"last_name":"Skrivan","full_name":"Skrivan, Tomas","id":"486A5A46-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas"},{"last_name":"Mueller Fischer","full_name":"Mueller Fischer, Matthias","first_name":"Matthias"},{"last_name":"Chentanez","full_name":"Chentanez, Nuttapong","first_name":"Nuttapong"},{"full_name":"Macklin, Miles","last_name":"Macklin","first_name":"Miles"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7789","title":"Water surface wavelets","citation":{"ama":"Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C. Water surface wavelets. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201336","apa":"Jeschke, S., Skrivan, T., Mueller Fischer, M., Chentanez, N., Macklin, M., & Wojtan, C. (2018). Water surface wavelets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3197517.3201336","ieee":"S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, and C. Wojtan, “Water surface wavelets,” ACM Transactions on Graphics, vol. 37, no. 4. ACM, 2018.","short":"S. Jeschke, T. Skrivan, M. Mueller Fischer, N. Chentanez, M. Macklin, C. Wojtan, ACM Transactions on Graphics 37 (2018).","mla":"Jeschke, Stefan, et al. “Water Surface Wavelets.” ACM Transactions on Graphics, vol. 37, no. 4, 94, ACM, 2018, doi:10.1145/3197517.3201336.","ista":"Jeschke S, Skrivan T, Mueller Fischer M, Chentanez N, Macklin M, Wojtan C. 2018. Water surface wavelets. ACM Transactions on Graphics. 37(4), 94.","chicago":"Jeschke, Stefan, Tomas Skrivan, Matthias Mueller Fischer, Nuttapong Chentanez, Miles Macklin, and Chris Wojtan. “Water Surface Wavelets.” ACM Transactions on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201336."},"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"article_number":"94","date_created":"2018-12-11T11:44:48Z","doi":"10.1145/3197517.3201336","date_published":"2018-07-30T00:00:00Z","year":"2018","isi":1,"has_accepted_license":"1","publication":"ACM Transactions on Graphics","day":"30","oa":1,"publisher":"ACM","quality_controlled":"1","file_date_updated":"2020-07-14T12:44:45Z","department":[{"_id":"ChWo"}],"date_updated":"2024-02-28T13:58:51Z","ddc":["000"],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"type":"journal_article","status":"public","_id":"134","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","ec_funded":1,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/new-water-simulation-captures-small-details-even-in-large-scenes/","relation":"press_release","description":"News on IST Homepage"}]},"issue":"4","volume":37,"publication_status":"published","language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5744","checksum":"db75ebabe2ec432bf41389e614d6ef62","creator":"dernst","date_updated":"2020-07-14T12:44:45Z","file_size":22185016,"date_created":"2018-12-18T09:59:23Z","file_name":"2018_ACM_Jeschke.pdf"}],"scopus_import":"1","alternative_title":["SIGGRAPH"],"intvolume":" 37","month":"07","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"The current state of the art in real-time two-dimensional water wave simulation requires developers to choose between efficient Fourier-based methods, which lack interactions with moving obstacles, and finite-difference or finite element methods, which handle environmental interactions but are significantly more expensive. This paper attempts to bridge this long-standing gap between complexity and performance, by proposing a new wave simulation method that can faithfully simulate wave interactions with moving obstacles in real time while simultaneously preserving minute details and accommodating very large simulation domains.\r\n\r\nPrevious methods for simulating 2D water waves directly compute the change in height of the water surface, a strategy which imposes limitations based on the CFL condition (fast moving waves require small time steps) and Nyquist's limit (small wave details require closely-spaced simulation variables). This paper proposes a novel wavelet transformation that discretizes the liquid motion in terms of amplitude-like functions that vary over space, frequency, and direction, effectively generalizing Fourier-based methods to handle local interactions. Because these new variables change much more slowly over space than the original water height function, our change of variables drastically reduces the limitations of the CFL condition and Nyquist limit, allowing us to simulate highly detailed water waves at very large visual resolutions. Our discretization is amenable to fast summation and easy to parallelize. We also present basic extensions like pre-computed wave paths and two-way solid fluid coupling. Finally, we argue that our discretization provides a convenient set of variables for artistic manipulation, which we illustrate with a novel wave-painting interface.","lang":"eng"}],"oa_version":"Published Version"},{"article_number":"165301","project":[{"_id":"26031614-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29902","name":"Quantum rotations in the presence of a many-body environment"}],"citation":{"ama":"Bighin G, Tscherbul T, Lemeshko M. Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. Physical Review Letters. 2018;121(16). doi:10.1103/physrevlett.121.165301","apa":"Bighin, G., Tscherbul, T., & Lemeshko, M. (2018). Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.121.165301","ieee":"G. Bighin, T. Tscherbul, and M. Lemeshko, “Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems,” Physical Review Letters, vol. 121, no. 16. American Physical Society, 2018.","short":"G. Bighin, T. Tscherbul, M. Lemeshko, Physical Review Letters 121 (2018).","mla":"Bighin, Giacomo, et al. “Diagrammatic Monte Carlo Approach to Angular Momentum in Quantum Many-Particle Systems.” Physical Review Letters, vol. 121, no. 16, 165301, American Physical Society, 2018, doi:10.1103/physrevlett.121.165301.","ista":"Bighin G, Tscherbul T, Lemeshko M. 2018. Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems. Physical Review Letters. 121(16), 165301.","chicago":"Bighin, Giacomo, Timur Tscherbul, and Mikhail Lemeshko. “Diagrammatic Monte Carlo Approach to Angular Momentum in Quantum Many-Particle Systems.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/physrevlett.121.165301."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Bighin, Giacomo","orcid":"0000-0001-8823-9777","last_name":"Bighin","first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tscherbul","full_name":"Tscherbul, Timur","first_name":"Timur"},{"orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"isi":["000447468400008"],"arxiv":["1803.07990"]},"title":"Diagrammatic Monte Carlo approach to angular momentum in quantum many-particle systems","quality_controlled":"1","publisher":"American Physical Society","oa":1,"isi":1,"year":"2018","day":"16","publication":"Physical Review Letters","date_published":"2018-10-16T00:00:00Z","doi":"10.1103/physrevlett.121.165301","date_created":"2019-04-17T10:53:38Z","_id":"6339","type":"journal_article","status":"public","date_updated":"2024-02-28T13:15:09Z","department":[{"_id":"MiLe"}],"abstract":[{"lang":"eng","text":"We introduce a diagrammatic Monte Carlo approach to angular momentum properties of quantum many-particle systems possessing a macroscopic number of degrees of freedom. The treatment is based on a diagrammatic expansion that merges the usual Feynman diagrams with the angular momentum diagrams known from atomic and nuclear structure theory, thereby incorporating the non-Abelian algebra inherent to quantum rotations. Our approach is applicable at arbitrary coupling, is free of systematic errors and of finite-size effects, and naturally provides access to the impurity Green function. We exemplify the technique by obtaining an all-coupling solution of the angulon model; however, the method is quite general and can be applied to a broad variety of systems in which particles exchange quantum angular momentum with their many-body environment."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1803.07990","open_access":"1"}],"month":"10","intvolume":" 121","publication_status":"published","language":[{"iso":"eng"}],"related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/description-of-rotating-molecules-made-easy/","description":"News on IST Homepage"}]},"volume":121,"issue":"16"},{"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.07990"}],"month":"10","intvolume":" 121","abstract":[{"lang":"eng","text":"We introduce a Diagrammatic Monte Carlo (DiagMC) approach to complex molecular impurities with rotational degrees of freedom interacting with a many-particle environment. The treatment is based on the diagrammatic expansion that merges the usual Feynman diagrams with the angular momentum diagrams known from atomic and nuclear structure theory, thereby incorporating the non-Abelian algebra inherent to quantum rotations. Our approach works at arbitrary coupling, is free of systematic errors and of finite size effects, and naturally provides access to the impurity Green function. We exemplify the technique by obtaining an all-coupling solution of the angulon model, however, the method is quite general and can be applied to a broad variety of quantum impurities possessing angular momentum degrees of freedom. "}],"oa_version":"Preprint","volume":121,"issue":"16","publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"417","department":[{"_id":"MiLe"}],"date_updated":"2024-02-28T13:14:53Z","quality_controlled":"1","publisher":"American Physical Society","oa":1,"date_published":"2018-10-16T00:00:00Z","doi":"10.1103/PhysRevLett.121.165301","date_created":"2018-12-11T11:46:22Z","year":"2018","day":"16","publication":"Physical Review Letters","project":[{"name":"Quantum rotations in the presence of a many-body environment","grant_number":"P29902","call_identifier":"FWF","_id":"26031614-B435-11E9-9278-68D0E5697425"}],"article_number":"165301","publist_id":"8025","author":[{"last_name":"Bighin","orcid":"0000-0001-8823-9777","full_name":"Bighin, Giacomo","first_name":"Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tscherbul, Timur","last_name":"Tscherbul","first_name":"Timur"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"}],"external_id":{"arxiv":["1803.07990"]},"article_processing_charge":"No","title":"Diagrammatic Monte Carlo approach to rotating molecular impurities","citation":{"chicago":"Bighin, Giacomo, Timur Tscherbul, and Mikhail Lemeshko. “Diagrammatic Monte Carlo Approach to Rotating Molecular Impurities.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/PhysRevLett.121.165301.","ista":"Bighin G, Tscherbul T, Lemeshko M. 2018. Diagrammatic Monte Carlo approach to rotating molecular impurities. Physical Review Letters. 121(16), 165301.","mla":"Bighin, Giacomo, et al. “Diagrammatic Monte Carlo Approach to Rotating Molecular Impurities.” Physical Review Letters, vol. 121, no. 16, 165301, American Physical Society, 2018, doi:10.1103/PhysRevLett.121.165301.","ieee":"G. Bighin, T. Tscherbul, and M. Lemeshko, “Diagrammatic Monte Carlo approach to rotating molecular impurities,” Physical Review Letters, vol. 121, no. 16. American Physical Society, 2018.","short":"G. Bighin, T. Tscherbul, M. Lemeshko, Physical Review Letters 121 (2018).","apa":"Bighin, G., Tscherbul, T., & Lemeshko, M. (2018). Diagrammatic Monte Carlo approach to rotating molecular impurities. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.121.165301","ama":"Bighin G, Tscherbul T, Lemeshko M. Diagrammatic Monte Carlo approach to rotating molecular impurities. Physical Review Letters. 2018;121(16). doi:10.1103/PhysRevLett.121.165301"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"ec_funded":1,"issue":"3","volume":30,"related_material":{"record":[{"id":"6269","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","publication_identifier":{"issn":["1040-4651"],"eissn":["1532-298X"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"11406","checksum":"4e165e653b67d3f0684697f21aace5a1","success":1,"creator":"dernst","date_updated":"2022-05-23T09:12:38Z","file_size":4407538,"date_created":"2022-05-23T09:12:38Z","file_name":"2018_PlantCell_Adamowski.pdf"}],"scopus_import":"1","intvolume":" 30","month":"04","abstract":[{"text":"Clathrin-mediated endocytosis (CME) is a cellular trafficking process in which cargoes and lipids are internalized from the plasma membrane into vesicles coated with clathrin and adaptor proteins. CME is essential for many developmental and physiological processes in plants, but its underlying mechanism is not well characterised compared to that in yeast and animal systems. Here, we searched for new factors involved in CME in Arabidopsis thaliana by performing Tandem Affinity Purification of proteins that interact with clathrin light chain, a principal component of the clathrin coat. Among the confirmed interactors, we found two putative homologues of the clathrin-coat uncoating factor auxilin previously described in non-plant systems. Overexpression of AUXILIN-LIKE1 and AUXILIN-LIKE2 in A. thaliana caused an arrest of seedling growth and development. This was concomitant with inhibited endocytosis due to blocking of clathrin recruitment after the initial step of adaptor protein binding to the plasma membrane. By contrast, auxilin-like(1/2) loss-of-function lines did not present endocytosis-related developmental or cellular phenotypes under normal growth conditions. This work contributes to the on-going characterization of the endocytotic machinery in plants and provides a robust tool for conditionally and specifically interfering with CME in A. thaliana.","lang":"eng"}],"oa_version":"Published Version","pmid":1,"department":[{"_id":"JiFr"}],"file_date_updated":"2022-05-23T09:12:38Z","date_updated":"2024-03-27T23:30:06Z","ddc":["580"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"412","page":"700 - 716","date_created":"2018-12-11T11:46:20Z","date_published":"2018-04-09T00:00:00Z","doi":"10.1105/tpc.17.00785","year":"2018","has_accepted_license":"1","isi":1,"publication":"The Plant Cell","day":"09","oa":1,"quality_controlled":"1","publisher":"American Society of Plant Biologists","acknowledgement":"We thank James Matthew Watson, Monika Borowska, and Peggy Stolt-Bergner at ProTech Facility of the Vienna Biocenter Core Facilities for the CRISPR/CAS9 construct; Anna Müller for assistance with molecular cloning; Sebastian Bednarek, Liwen Jiang, and Daniël Van Damme for sharing published material; Matyáš Fendrych, Daniël Van Damme, and Lindy Abas for valuable discussions; and Martine De Cock for help with correcting the manuscript. This work was supported by the European Research Council under the European Union Seventh Framework Programme (FP7/2007-2013)/ERC Grant 282300 and by the Ministry of Education of the Czech Republic/MŠMT project NPUI-LO1417.","article_processing_charge":"No","external_id":{"pmid":["29511054"],"isi":["000429441400018"]},"publist_id":"7417","author":[{"first_name":"Maciek","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","last_name":"Adamowski","full_name":"Adamowski, Maciek","orcid":"0000-0001-6463-5257"},{"id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","first_name":"Madhumitha","full_name":"Narasimhan, Madhumitha","orcid":"0000-0002-8600-0671","last_name":"Narasimhan"},{"id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","first_name":"Urszula","last_name":"Kania","full_name":"Kania, Urszula"},{"last_name":"Glanc","orcid":"0000-0003-0619-7783","full_name":"Glanc, Matous","first_name":"Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2"},{"last_name":"De Jaeger","full_name":"De Jaeger, Geert","first_name":"Geert"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"}],"title":"A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis","citation":{"short":"M. Adamowski, M. Narasimhan, U. Kania, M. Glanc, G. De Jaeger, J. Friml, The Plant Cell 30 (2018) 700–716.","ieee":"M. Adamowski, M. Narasimhan, U. Kania, M. Glanc, G. De Jaeger, and J. Friml, “A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis,” The Plant Cell, vol. 30, no. 3. American Society of Plant Biologists, pp. 700–716, 2018.","ama":"Adamowski M, Narasimhan M, Kania U, Glanc M, De Jaeger G, Friml J. A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis. The Plant Cell. 2018;30(3):700-716. doi:10.1105/tpc.17.00785","apa":"Adamowski, M., Narasimhan, M., Kania, U., Glanc, M., De Jaeger, G., & Friml, J. (2018). A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis. The Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.17.00785","mla":"Adamowski, Maciek, et al. “A Functional Study of AUXILIN LIKE1 and 2 Two Putative Clathrin Uncoating Factors in Arabidopsis.” The Plant Cell, vol. 30, no. 3, American Society of Plant Biologists, 2018, pp. 700–16, doi:10.1105/tpc.17.00785.","ista":"Adamowski M, Narasimhan M, Kania U, Glanc M, De Jaeger G, Friml J. 2018. A functional study of AUXILIN LIKE1 and 2 two putative clathrin uncoating factors in Arabidopsis. The Plant Cell. 30(3), 700–716.","chicago":"Adamowski, Maciek, Madhumitha Narasimhan, Urszula Kania, Matous Glanc, Geert De Jaeger, and Jiří Friml. “A Functional Study of AUXILIN LIKE1 and 2 Two Putative Clathrin Uncoating Factors in Arabidopsis.” The Plant Cell. American Society of Plant Biologists, 2018. https://doi.org/10.1105/tpc.17.00785."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425"}]},{"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","_id":"5914","department":[{"_id":"JoCs"}],"file_date_updated":"2020-07-14T12:47:13Z","ddc":["570"],"date_updated":"2024-03-27T23:30:10Z","intvolume":" 5","month":"07","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"With the advent of optogenetics, it became possible to change the activity of a targeted population of neurons in a temporally controlled manner. To combine the advantages of 60-channel in vivo tetrode recording and laser-based optogenetics, we have developed a closed-loop recording system that allows for the actual electrophysiological signal to be used as a trigger for the laser light mediating the optogenetic intervention. We have optimized the weight, size, and shape of the corresponding implant to make it compatible with the size, force, and movements of a behaving mouse, and we have shown that the system can efficiently block sharp wave ripple (SWR) events using those events themselves as a trigger. To demonstrate the full potential of the optogenetic recording system we present a pilot study addressing the contribution of SWR events to learning in a complex behavioral task.","lang":"eng"}],"ec_funded":1,"volume":5,"related_material":{"record":[{"id":"6849","status":"public","relation":"dissertation_contains"}]},"issue":"4","language":[{"iso":"eng"}],"file":[{"file_name":"2018_ENeuro_Guerrero.pdf","date_created":"2019-02-05T12:48:36Z","creator":"dernst","file_size":3746884,"date_updated":"2020-07-14T12:47:13Z","checksum":"f4915d45fc7ad4648b7b7a13fdecca01","file_id":"5921","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"257D4372-B435-11E9-9278-68D0E5697425","grant_number":"I2072-B27","name":"Interneuron plasticity during spatial learning"}],"article_number":"e0087","title":"Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning","article_processing_charge":"No","external_id":{"isi":["000443994700007"]},"author":[{"last_name":"Rangel Guerrero","orcid":"0000-0002-8602-4374","full_name":"Rangel Guerrero, Dámaris K","id":"4871BCE6-F248-11E8-B48F-1D18A9856A87","first_name":"Dámaris K"},{"full_name":"Donnett, James G.","last_name":"Donnett","first_name":"James G."},{"first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"},{"id":"2AB5821E-F248-11E8-B48F-1D18A9856A87","first_name":"Krisztián","full_name":"Kovács, Krisztián","orcid":"0000-0001-6251-1007","last_name":"Kovács"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. eNeuro. 2018;5(4). doi:10.1523/ENEURO.0087-18.2018","apa":"Rangel Guerrero, D. K., Donnett, J. G., Csicsvari, J. L., & Kovács, K. (2018). Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. ENeuro. Society of Neuroscience. https://doi.org/10.1523/ENEURO.0087-18.2018","short":"D.K. Rangel Guerrero, J.G. Donnett, J.L. Csicsvari, K. Kovács, ENeuro 5 (2018).","ieee":"D. K. Rangel Guerrero, J. G. Donnett, J. L. Csicsvari, and K. Kovács, “Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning,” eNeuro, vol. 5, no. 4. Society of Neuroscience, 2018.","mla":"Rangel Guerrero, Dámaris K., et al. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” ENeuro, vol. 5, no. 4, e0087, Society of Neuroscience, 2018, doi:10.1523/ENEURO.0087-18.2018.","ista":"Rangel Guerrero DK, Donnett JG, Csicsvari JL, Kovács K. 2018. Tetrode recording from the hippocampus of behaving mice coupled with four-point-irradiation closed-loop optogenetics: A technique to study the contribution of Hippocampal SWR events to learning. eNeuro. 5(4), e0087.","chicago":"Rangel Guerrero, Dámaris K, James G. Donnett, Jozsef L Csicsvari, and Krisztián Kovács. “Tetrode Recording from the Hippocampus of Behaving Mice Coupled with Four-Point-Irradiation Closed-Loop Optogenetics: A Technique to Study the Contribution of Hippocampal SWR Events to Learning.” ENeuro. Society of Neuroscience, 2018. https://doi.org/10.1523/ENEURO.0087-18.2018."},"oa":1,"publisher":"Society of Neuroscience","quality_controlled":"1","date_created":"2019-02-03T22:59:16Z","date_published":"2018-07-27T00:00:00Z","doi":"10.1523/ENEURO.0087-18.2018","publication":"eNeuro","day":"27","year":"2018","has_accepted_license":"1","isi":1},{"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1126/science.aal3662","open_access":"1"}],"month":"03","intvolume":" 359","abstract":[{"text":"During metastasis, malignant cells escape the primary tumor, intravasate lymphatic vessels, and reach draining sentinel lymph nodes before they colonize distant organs via the blood circulation. Although lymph node metastasis in cancer patients correlates with poor prognosis, evidence is lacking as to whether and how tumor cells enter the bloodstream via lymph nodes. To investigate this question, we delivered carcinoma cells into the lymph nodes of mice by microinfusing the cells into afferent lymphatic vessels. We found that tumor cells rapidly infiltrated the lymph node parenchyma, invaded blood vessels, and seeded lung metastases without involvement of the thoracic duct. These results suggest that the lymph node blood vessels can serve as an exit route for systemic dissemination of cancer cells in experimental mouse models. Whether this form of tumor cell spreading occurs in cancer patients remains to be determined.","lang":"eng"}],"acknowledged_ssus":[{"_id":"Bio"}],"oa_version":"Published Version","pmid":1,"issue":"6382","volume":359,"related_material":{"record":[{"id":"6947","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","article_type":"original","status":"public","_id":"402","department":[{"_id":"MiSi"}],"date_updated":"2024-03-27T23:30:09Z","quality_controlled":"1","publisher":"American Association for the Advancement of Science","oa":1,"acknowledgement":"M.B. was supported by the Cell Communication in Health and Disease graduate study program of the Austrian Science Fund (FWF) and the Medical University of Vienna. M.S. was supported by the European Research Council (grant ERC GA 281556) and an FWF START award.\r\nWe thank C. Moussion for establishing the intralymphatic injection at IST Austria and for providing anti-PNAd hybridoma supernatant, R. Förster and A. Braun for sharing the intralymphatic injection technology, K. Vaahtomeri for the lentiviral constructs, M. Hons for establishing in vivo multiphoton imaging, the Sixt lab for intellectual input, M. Schunn for help with the design of the in vivo experiments, F. Langer for technical assistance with the in vivo experiments, the bioimaging facility of IST Austria for support, and R. Efferl for providing the CT26 cell line.","page":"1408 - 1411","date_published":"2018-03-23T00:00:00Z","doi":"10.1126/science.aal3662","date_created":"2018-12-11T11:46:16Z","isi":1,"year":"2018","day":"23","publication":"Science","project":[{"call_identifier":"FWF","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and transduction of leukocytes (FWF)","grant_number":"Y 564-B12"},{"grant_number":"281556","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)","call_identifier":"FP7","_id":"25A603A2-B435-11E9-9278-68D0E5697425"}],"publist_id":"7428","author":[{"full_name":"Brown, Markus","last_name":"Brown","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","first_name":"Markus"},{"id":"3A8E7F24-F248-11E8-B48F-1D18A9856A87","first_name":"Frank P","last_name":"Assen","orcid":"0000-0003-3470-6119","full_name":"Assen, Frank P"},{"id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander F","last_name":"Leithner","full_name":"Leithner, Alexander F","orcid":"0000-0002-1073-744X"},{"full_name":"Abe, Jun","last_name":"Abe","first_name":"Jun"},{"first_name":"Helga","last_name":"Schachner","full_name":"Schachner, Helga"},{"first_name":"Gabriele","last_name":"Asfour","full_name":"Asfour, Gabriele"},{"last_name":"Bagó Horváth","full_name":"Bagó Horváth, Zsuzsanna","first_name":"Zsuzsanna"},{"first_name":"Jens","full_name":"Stein, Jens","last_name":"Stein"},{"first_name":"Pavel","full_name":"Uhrin, Pavel","last_name":"Uhrin"},{"last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"},{"first_name":"Dontscho","full_name":"Kerjaschki, Dontscho","last_name":"Kerjaschki"}],"article_processing_charge":"No","external_id":{"isi":["000428043600047"],"pmid":["29567714"]},"title":"Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice","citation":{"ista":"Brown M, Assen FP, Leithner AF, Abe J, Schachner H, Asfour G, Bagó Horváth Z, Stein J, Uhrin P, Sixt MK, Kerjaschki D. 2018. Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. Science. 359(6382), 1408–1411.","chicago":"Brown, Markus, Frank P Assen, Alexander F Leithner, Jun Abe, Helga Schachner, Gabriele Asfour, Zsuzsanna Bagó Horváth, et al. “Lymph Node Blood Vessels Provide Exit Routes for Metastatic Tumor Cell Dissemination in Mice.” Science. American Association for the Advancement of Science, 2018. https://doi.org/10.1126/science.aal3662.","short":"M. Brown, F.P. Assen, A.F. Leithner, J. Abe, H. Schachner, G. Asfour, Z. Bagó Horváth, J. Stein, P. Uhrin, M.K. Sixt, D. Kerjaschki, Science 359 (2018) 1408–1411.","ieee":"M. Brown et al., “Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice,” Science, vol. 359, no. 6382. American Association for the Advancement of Science, pp. 1408–1411, 2018.","ama":"Brown M, Assen FP, Leithner AF, et al. Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. Science. 2018;359(6382):1408-1411. doi:10.1126/science.aal3662","apa":"Brown, M., Assen, F. P., Leithner, A. F., Abe, J., Schachner, H., Asfour, G., … Kerjaschki, D. (2018). Lymph node blood vessels provide exit routes for metastatic tumor cell dissemination in mice. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aal3662","mla":"Brown, Markus, et al. “Lymph Node Blood Vessels Provide Exit Routes for Metastatic Tumor Cell Dissemination in Mice.” Science, vol. 359, no. 6382, American Association for the Advancement of Science, 2018, pp. 1408–11, doi:10.1126/science.aal3662."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":43684035,"date_updated":"2021-02-11T23:30:15Z","file_name":"2018_Thesis_Tarlungeanu_source.docx","date_created":"2019-04-05T09:19:17Z","relation":"source_file","access_level":"closed","embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"6217","checksum":"9f5231c96e0ad945040841a8630232da"},{"creator":"dernst","date_updated":"2021-02-11T11:17:16Z","file_size":30511532,"date_created":"2019-04-05T09:19:17Z","file_name":"2018_Thesis_Tarlungeanu.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"6218","checksum":"0c33c370aa2010df5c552db57a6d01e9","embargo":"2018-03-15"}],"related_material":{"record":[{"id":"1183","status":"public","relation":"part_of_dissertation"}]},"abstract":[{"lang":"eng","text":"Autism spectrum disorders (ASD) are a group of genetic disorders often overlapping with other neurological conditions. Despite the remarkable number of scientific breakthroughs of the last 100 years, the treatment of neurodevelopmental disorders (e.g. autism spectrum disorder, intellectual disability, epilepsy) remains a great challenge. Recent advancements in geno mics, like whole-exome or whole-genome sequencing, have enabled scientists to identify numerous mutations underlying neurodevelopmental disorders. Given the few hundred risk genes that were discovered, the etiological variability and the heterogeneous phenotypic outcomes, the need for genotype -along with phenotype- based diagnosis of individual patients becomes a requisite. Driven by this rationale, in a previous study our group described mutations, identified via whole - exome sequencing, in the gene BCKDK – encoding for a key regulator of branched chain amin o acid (BCAA) catabolism - as a cause of ASD. Following up on the role of BCAAs, in the study described here we show that the solute carrier transporter 7a5 (SLC7A5), a large neutral amino acid transporter localized mainly at the blood brain barrier (BBB), has an essential role in maintaining normal levels of brain BCAAs. In mice, deletion of Slc7a5 from the endothelial cells of the BBB leads to atypical brain amino acid profile, abnormal mRNA translation and severe neurolo gical abnormalities. Additionally, deletion of Slc7a5 from the neural progenitor cell population leads to microcephaly. Interestingly, we demonstrate that BCAA intracerebroventricular administration ameliorates abnormal behaviors in adult mutant mice. Furthermore, whole - exome sequencing of patients diagnosed with neurological dis o r ders helped us identify several patients with autistic traits, microcephaly and motor delay carrying deleterious homozygous mutations in the SLC7A5 gene. In conclusion, our data elucidate a neurological syndrome defined by SLC7A5 mutations and support an essential role for t he BCAA s in human bra in function. Together with r ecent studies (described in chapter two) that have successfully made the transition into clinical practice, our findings on the role of B CAAs might have a crucial impact on the development of novel individualized therapeutic strategies for ASD. "}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"EM-Fac"},{"_id":"Bio"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"03","date_updated":"2023-09-07T12:38:59Z","supervisor":[{"full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"}],"ddc":["570","616"],"department":[{"_id":"GaNo"}],"file_date_updated":"2021-02-11T23:30:15Z","_id":"395","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":"dissertation","pubrep_id":"992","status":"public","year":"2018","has_accepted_license":"1","day":"01","page":"88","date_created":"2018-12-11T11:46:14Z","doi":"10.15479/AT:ISTA:th_992","date_published":"2018-03-01T00:00:00Z","oa":1,"publisher":"Institute of Science and Technology Austria","citation":{"ista":"Tarlungeanu D-C. 2018. The branched chain amino acids in autism spectrum disorders . Institute of Science and Technology Austria.","chicago":"Tarlungeanu, Dora-Clara. “The Branched Chain Amino Acids in Autism Spectrum Disorders .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_992.","ama":"Tarlungeanu D-C. The branched chain amino acids in autism spectrum disorders . 2018. doi:10.15479/AT:ISTA:th_992","apa":"Tarlungeanu, D.-C. (2018). The branched chain amino acids in autism spectrum disorders . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_992","short":"D.-C. Tarlungeanu, The Branched Chain Amino Acids in Autism Spectrum Disorders , Institute of Science and Technology Austria, 2018.","ieee":"D.-C. Tarlungeanu, “The branched chain amino acids in autism spectrum disorders ,” Institute of Science and Technology Austria, 2018.","mla":"Tarlungeanu, Dora-Clara. The Branched Chain Amino Acids in Autism Spectrum Disorders . Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_992."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","publist_id":"7434","author":[{"first_name":"Dora-Clara","id":"2ABCE612-F248-11E8-B48F-1D18A9856A87","last_name":"Tarlungeanu","full_name":"Tarlungeanu, Dora-Clara"}],"title":"The branched chain amino acids in autism spectrum disorders ","project":[{"_id":"25473368-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"F03523","name":"Transmembrane Transporters in Health and Disease"}]},{"date_published":"2018-06-27T00:00:00Z","doi":"10.15479/AT:ISTA:th_1032","date_created":"2018-12-11T11:44:22Z","page":"186","day":"27","has_accepted_license":"1","year":"2018","publisher":"Institute of Science and Technology Austria","oa":1,"title":"From the left to the right: A tale of asymmetries, environments, and hippocampal development","publist_id":"8003","author":[{"first_name":"Matthew J","id":"44B7CA5A-F248-11E8-B48F-1D18A9856A87","last_name":"Case","full_name":"Case, Matthew J"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Case, Matthew J. From the Left to the Right: A Tale of Asymmetries, Environments, and Hippocampal Development. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1032.","ieee":"M. J. Case, “From the left to the right: A tale of asymmetries, environments, and hippocampal development,” Institute of Science and Technology Austria, 2018.","short":"M.J. Case, From the Left to the Right: A Tale of Asymmetries, Environments, and Hippocampal Development, Institute of Science and Technology Austria, 2018.","apa":"Case, M. J. (2018). From the left to the right: A tale of asymmetries, environments, and hippocampal development. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1032","ama":"Case MJ. From the left to the right: A tale of asymmetries, environments, and hippocampal development. 2018. doi:10.15479/AT:ISTA:th_1032","chicago":"Case, Matthew J. “From the Left to the Right: A Tale of Asymmetries, Environments, and Hippocampal Development.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1032.","ista":"Case MJ. 2018. From the left to the right: A tale of asymmetries, environments, and hippocampal development. Institute of Science and Technology Austria."},"related_material":{"record":[{"status":"public","id":"682","relation":"part_of_dissertation"}]},"file":[{"file_id":"6251","checksum":"dcc7b55619d8509dd62b8e99d6cdee44","embargo_to":"open_access","content_type":"application/msword","relation":"source_file","access_level":"closed","file_name":"2018_Thesis_Case_Source.doc","date_created":"2019-04-09T07:16:26Z","file_size":141270528,"date_updated":"2021-02-11T23:30:13Z","creator":"dernst"},{"file_size":15193621,"date_updated":"2021-02-11T11:17:14Z","creator":"dernst","file_name":"2018_Thesis_Case.pdf","date_created":"2019-04-09T07:16:23Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","embargo":"2019-07-05","checksum":"f69fdd5c8709c4e618aa8c1a1221153d","file_id":"6252"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","month":"06","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"text":"Asymmetries have long been known about in the central nervous system. From gross anatomical differences, such as the presence of the parapineal organ in only one hemisphere of the developing zebrafish, to more subtle differences in activity between both hemispheres, as seen in freely roaming animals or human participants under PET and fMRI imaging analysis. The presence of asymmetries has been demonstrated to have huge behavioural implications, with their disruption often leading to the generation of neurological disorders, memory problems, changes in personality, and in an organism's health and well-being. For my Ph.D. work I aimed to tackle two important avenues of research. The first being the process of input-side dependency in the hippocampus, with the goal of finding a key gene responsible for its development (Gene X). The second project was to do with experience-induced laterality formation in the hippocampus. Specifically, how laterality in the synapse density of the CA1 stratum radiatum (s.r.) could be induced purely through environmental enrichment. Through unilateral tracer injections into the CA3, I was able to selectively measure the properties of synapses within the CA1 and investigate how they differed based upon which hemisphere the presynaptic neurone originated. Having found the existence of a previously unreported reversed (left-isomerism) i.v. mutant, through morpholocal examination of labelled terminals in the CA1 s.r., I aimed to elucidate a key gene responsible for the process of left or right determination of inputs to the CA1 s.r.. This work relates to the previous finding of input-side dependent asymmetry in the wild-type rodent, where the origin of the projecting neurone to the CA1 will determine the morphology of a synapse, to a greater degree than the hemisphere in which the projection terminates. Using left- and right-isomerism i.v. mice, in combination with whole genome sequence analysis, I highlight Ena/VASP-like (Evl) as a potential target for Gene X. In relation to this topic, I also highlight my work in the recently published paper of how knockout of PirB can lead to a lack of input-side dependency in the murine hippocampus. For the second question, I show that the environmental enrichment paradigm will lead to an asymmetry in the synapse densities in the hippocampus of mice. I also highlight that the nature of the enrichment is of less consequence than the process of enrichment itself. I demonstrate that the CA3 region will dramatically alter its projection targets, in relation to environmental stimulation, with the asymmetry in synaptic density, caused by enrichment, relying heavily on commissural fibres. I also highlight the vital importance of input-side dependent asymmetry, as a necessary component of experience-dependent laterality formation in the CA1 s.r.. However, my results suggest that it isn't the only cause, as there appears to be a CA1 dependent mechanism also at play. Upon further investigation, I highlight the significant, and highly important, finding that the changes seen in the CA1 s.r. were predominantly caused through projections from the left-CA3, with the right-CA3 having less involvement in this mechanism.","lang":"eng"}],"file_date_updated":"2021-02-11T23:30:13Z","department":[{"_id":"RySh"}],"ddc":["571","576"],"supervisor":[{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"}],"date_updated":"2023-09-07T12:39:22Z","status":"public","pubrep_id":"1032","type":"dissertation","_id":"51"},{"_id":"10","type":"dissertation","pubrep_id":"1057","status":"public","date_updated":"2023-09-07T12:40:44Z","supervisor":[{"last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"}],"ddc":["570"],"department":[{"_id":"SiHi"}],"file_date_updated":"2021-02-11T11:17:16Z","abstract":[{"lang":"eng","text":"Genomic imprinting is an epigenetic process that leads to parent of origin-specific gene expression in a subset of genes. Imprinted genes are essential for brain development, and deregulation of imprinting is associated with neurodevelopmental diseases and the pathogenesis of psychiatric disorders. However, the cell-type specificity of imprinting at single cell resolution, and how imprinting and thus gene dosage regulates neuronal circuit assembly is still largely unknown. Here, MADM (Mosaic Analysis with Double Markers) technology was employed to assess genomic imprinting at single cell level. By visualizing MADM-induced uniparental disomies (UPDs) in distinct colors at single cell level in genetic mosaic animals, this experimental paradigm provides a unique quantitative platform to systematically assay the UPD-mediated imbalances in imprinted gene expression at unprecedented resolution. An experimental pipeline based on FACS, RNA-seq and bioinformatics analysis was established and applied to systematically map cell-type-specific ‘imprintomes’ in the mouse brain. The results revealed that parental-specific expression of imprinted genes per se is rarely cell-type-specific even at the individual cell level. Conversely, when we extended the comparison to downstream responses resulting from imbalanced imprinted gene expression, we discovered an unexpectedly high degree of cell-type specificity. Furthermore, we determined a novel function of genomic imprinting in cortical astrocyte production and in olfactory bulb (OB) granule cell generation. These results suggest important functional implication of genomic imprinting for generating cell-type diversity in the brain. In addition, MADM provides a powerful tool to study candidate genes by concomitant genetic manipulation and fluorescent labelling of single cells. MADM-based candidate gene approach was utilized to identify potential imprinted genes involved in the generation of cortical astrocytes and OB granule cells. We investigated p57Kip2, a maternally expressed gene and known cell cycle regulator. Although we found that p57Kip2 does not play a role in these processes, we detected an unexpected function of the paternal allele previously thought to be silent. Finally, we took advantage of a key property of MADM which is to allow unambiguous investigation of environmental impact on single cells. The experimental pipeline based on FACS and RNA-seq analysis of MADM-labeled cells was established to probe the functional differences of single cell loss of gene function compared to global loss of function on a transcriptional level. With this method, both common and distinct responses were isolated due to cell-autonomous and non-autonomous effects acting on genotypically identical cells. As a result, transcriptional changes were identified which result solely from the surrounding environment. Using the MADM technology to study genomic imprinting at single cell resolution, we have identified cell-type-specific gene expression, novel gene function and the impact of environment on single cell transcriptomes. Together, these provide important insights to the understanding of mechanisms regulating cell-type specificity and thus diversity in the brain."}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"11","publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2019-05-10T07:47:04Z","file_name":"Thesis_LaukoterSusanne_FINAL.docx","creator":"dernst","date_updated":"2019-11-23T23:30:03Z","file_size":17949175,"checksum":"41fdbf5fdce312802935d88a8ad9932c","file_id":"6396","access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access"},{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","embargo":"2019-11-21","checksum":"53001a9a0c9e570e598d861bb0af28aa","file_id":"6397","creator":"dernst","file_size":21187245,"date_updated":"2021-02-11T11:17:16Z","file_name":"Thesis_LaukoterSusanne_FINAL.pdf","date_created":"2019-05-10T07:47:04Z"}],"citation":{"ista":"Laukoter S. 2018. Role of genomic imprinting in cerebral cortex development. Institute of Science and Technology Austria.","chicago":"Laukoter, Susanne. “Role of Genomic Imprinting in Cerebral Cortex Development.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th1057.","ieee":"S. Laukoter, “Role of genomic imprinting in cerebral cortex development,” Institute of Science and Technology Austria, 2018.","short":"S. Laukoter, Role of Genomic Imprinting in Cerebral Cortex Development, Institute of Science and Technology Austria, 2018.","ama":"Laukoter S. Role of genomic imprinting in cerebral cortex development. 2018:1-139. doi:10.15479/AT:ISTA:th1057","apa":"Laukoter, S. (2018). Role of genomic imprinting in cerebral cortex development. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th1057","mla":"Laukoter, Susanne. Role of Genomic Imprinting in Cerebral Cortex Development. Institute of Science and Technology Austria, 2018, pp. 1–139, doi:10.15479/AT:ISTA:th1057."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","author":[{"last_name":"Laukoter","full_name":"Laukoter, Susanne","orcid":"0000-0002-7903-3010","first_name":"Susanne","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"8046","title":"Role of genomic imprinting in cerebral cortex development","oa":1,"publisher":"Institute of Science and Technology Austria","year":"2018","has_accepted_license":"1","day":"21","page":"1 - 139","date_created":"2018-12-11T11:44:08Z","doi":"10.15479/AT:ISTA:th1057","date_published":"2018-11-21T00:00:00Z"},{"publist_id":"7542","author":[{"last_name":"Leithner","orcid":"0000-0002-1073-744X","full_name":"Leithner, Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander F"}],"article_processing_charge":"No","title":"Branched actin networks in dendritic cell biology","citation":{"short":"A.F. Leithner, Branched Actin Networks in Dendritic Cell Biology, Institute of Science and Technology Austria, 2018.","ieee":"A. F. Leithner, “Branched actin networks in dendritic cell biology,” Institute of Science and Technology Austria, 2018.","ama":"Leithner AF. Branched actin networks in dendritic cell biology. 2018. doi:10.15479/AT:ISTA:th_998","apa":"Leithner, A. F. (2018). Branched actin networks in dendritic cell biology. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_998","mla":"Leithner, Alexander F. Branched Actin Networks in Dendritic Cell Biology. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_998.","ista":"Leithner AF. 2018. Branched actin networks in dendritic cell biology. Institute of Science and Technology Austria.","chicago":"Leithner, Alexander F. “Branched Actin Networks in Dendritic Cell Biology.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_998."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Institute of Science and Technology Austria","oa":1,"acknowledgement":"First of all I would like to thank Michael Sixt for giving me the opportunity to work in \r\nhis group and for his support throughout the years. He is a truly inspiring person and \r\nthe best boss one can imagine. I would also like to thank all current and past \r\nmembers of the Sixt group for their help and the great working atmosphere in the lab. \r\nIt is a true privilege to work with such a bright, funny and friendly group of people and \r\nI’m proud that I could be part of it. Furthermore, I would like to say ‘thank you’ to Daria Siekhaus for all the meetings and discussion we had throughout the years \r\nand to Federica Benvenuti for being part of my committee. I am also grateful to Jack \r\nMerrin in the nanofabrication facility and all the people working in the bioimaging-\r\n, the electron microscopy- and the preclinical facilities.","page":"99","date_published":"2018-04-12T00:00:00Z","doi":"10.15479/AT:ISTA:th_998","date_created":"2018-12-11T11:45:49Z","has_accepted_license":"1","year":"2018","day":"12","type":"dissertation","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":"998","_id":"323","department":[{"_id":"MiSi"}],"file_date_updated":"2021-02-11T23:30:17Z","supervisor":[{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179"}],"date_updated":"2023-09-07T12:39:44Z","ddc":["571","599","610"],"alternative_title":["ISTA Thesis"],"month":"04","abstract":[{"text":"In the here presented thesis, we explore the role of branched actin networks in cell migration and antigen presentation, the two most relevant processes in dendritic cell biology. Branched actin networks construct lamellipodial protrusions at the leading edge of migrating cells. These are typically seen as adhesive structures, which mediate force transduction to the extracellular matrix that leads to forward locomotion. We ablated Arp2/3 nucleation promoting factor WAVE in DCs and found that the resulting cells lack lamellipodial protrusions. Instead, depending on the maturation state, one or multiple filopodia were formed. By challenging these cells in a variety of migration assays we found that lamellipodial protrusions are dispensable for the locomotion of leukocytes and actually dampen the speed of migration. However, lamellipodia are critically required to negotiate complex environments that DCs experience while they travel to the next draining lymph node. Taken together our results suggest that leukocyte lamellipodia have rather a sensory- than a force transducing function. Furthermore, we show for the first time structure and dynamics of dendritic cell F-actin at the immunological synapse with naïve T cells. Dendritic cell F-actin appears as dynamic foci that are nucleated by the Arp2/3 complex. WAVE ablated dendritic cells show increased membrane tension, leading to an altered ultrastructure of the immunological synapse and severe T cell priming defects. These results point towards a previously unappreciated role of the cellular mechanics of dendritic cells in T cell activation. Additionally, we present a novel cell culture based system for the differentiation of dendritic cells from conditionally immortalized hematopoietic precursors. These precursor cells are genetically tractable via the CRISPR/Cas9 system while they retain their ability to differentiate into highly migratory dendritic cells and other immune cells. This will foster the study of all aspects of dendritic cell biology and beyond. ","lang":"eng"}],"acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"Bio"},{"_id":"PreCl"},{"_id":"EM-Fac"}],"oa_version":"Published Version","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1321"}]},"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","file":[{"file_name":"PhD_thesis_AlexLeithner_final_version.docx","date_created":"2019-04-05T09:23:11Z","file_size":29027671,"date_updated":"2021-02-11T23:30:17Z","creator":"dernst","file_id":"6219","checksum":"d5e3edbac548c26c1fa43a4b37a54a4c","embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","access_level":"closed"},{"date_created":"2019-04-05T09:23:11Z","file_name":"PhD_thesis_AlexLeithner.pdf","creator":"dernst","date_updated":"2021-02-11T11:17:16Z","file_size":66045341,"file_id":"6220","checksum":"071f7476db29e41146824ebd0697cb10","embargo":"2019-04-15","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}]},{"oa_version":"Published Version","abstract":[{"text":"The whole life cycle of plants as well as their responses to environmental stimuli is governed by a complex network of hormonal regulations. A number of studies have demonstrated an essential role of both auxin and cytokinin in the regulation of many aspects of plant growth and development including embryogenesis, postembryonic organogenic processes such as root, and shoot branching, root and shoot apical meristem activity and phyllotaxis. Over the last decades essential knowledge on the key molecular factors and pathways that spatio-temporally define auxin and cytokinin activities in the plant body has accumulated. However, how both hormonal pathways are interconnected by a complex network of interactions and feedback circuits that determines the final outcome of the individual hormone actions is still largely unknown. Root system architecture establishment and in particular formation of lateral organs is prime example of developmental process at whose regulation both auxin and cytokinin pathways converge. To dissect convergence points and pathways that tightly balance auxin - cytokinin antagonistic activities that determine the root branching pattern transcriptome profiling was applied. Genome wide expression analyses of the xylem pole pericycle, a tissue giving rise to lateral roots, led to identification of genes that are highly responsive to combinatorial auxin and cytokinin treatments and play an essential function in the auxin-cytokinin regulated root branching. SYNERGISTIC AUXIN CYTOKININ 1 (SYAC1) gene, which encodes for a protein of unknown function, was detected among the top candidate genes of which expression was synergistically up-regulated by simultaneous hormonal treatment. Plants with modulated SYAC1 activity exhibit severe defects in the root system establishment and attenuate developmental responses to both auxin and cytokinin. To explore the biological function of the SYAC1, we employed different strategies including expression pattern analysis, subcellular localization and phenotypic analyses of the syac1 loss-of-function and gain-of-function transgenic lines along with the identification of the SYAC1 interaction partners. Detailed functional characterization revealed that SYAC1 acts as a developmentally specific regulator of the secretory pathway to control deposition of cell wall components and thereby rapidly fine tune elongation growth.","lang":"eng"}],"month":"01","alternative_title":["ISTA Thesis"],"file":[{"date_created":"2019-04-05T09:37:56Z","file_name":"2018_Hurny_thesis_source.docx","creator":"dernst","date_updated":"2020-12-02T23:30:08Z","file_size":28112114,"checksum":"0c9d6d1c80d9857e6e545213467bbcb2","file_id":"6226","access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access"},{"date_created":"2019-04-05T09:37:55Z","file_name":"2018_Hurny_thesis.pdf","date_updated":"2020-12-02T09:52:16Z","file_size":12524427,"creator":"dernst","file_id":"6227","checksum":"ecbe481a1413d270bd501b872c7ed54f","embargo":"2019-07-10","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","related_material":{"record":[{"relation":"part_of_dissertation","id":"1024","status":"public"}]},"_id":"539","status":"public","pubrep_id":"930","type":"dissertation","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"supervisor":[{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739"}],"date_updated":"2023-09-07T12:41:06Z","file_date_updated":"2020-12-02T23:30:08Z","department":[{"_id":"EvBe"}],"publisher":"Institute of Science and Technology Austria","oa":1,"day":"01","has_accepted_license":"1","year":"2018","doi":"10.15479/AT:ISTA:th_930","date_published":"2018-01-01T00:00:00Z","date_created":"2018-12-11T11:47:03Z","page":"147","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"A. Hurny, Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components, Institute of Science and Technology Austria, 2018.","ieee":"A. Hurny, “Identification and characterization of novel auxin-cytokinin cross-talk components,” Institute of Science and Technology Austria, 2018.","apa":"Hurny, A. (2018). Identification and characterization of novel auxin-cytokinin cross-talk components. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_930","ama":"Hurny A. Identification and characterization of novel auxin-cytokinin cross-talk components. 2018. doi:10.15479/AT:ISTA:th_930","mla":"Hurny, Andrej. Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_930.","ista":"Hurny A. 2018. Identification and characterization of novel auxin-cytokinin cross-talk components. Institute of Science and Technology Austria.","chicago":"Hurny, Andrej. “Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_930."},"title":"Identification and characterization of novel auxin-cytokinin cross-talk components","author":[{"last_name":"Hurny","full_name":"Hurny, Andrej","orcid":"0000-0003-3638-1426","id":"4DC4AF46-F248-11E8-B48F-1D18A9856A87","first_name":"Andrej"}],"publist_id":"7277","article_processing_charge":"No"},{"publisher":"Institute of Science and Technology Austria","oa":1,"has_accepted_license":"1","year":"2018","day":"27","page":"104","date_published":"2018-08-27T00:00:00Z","doi":"10.15479/AT:ISTA:th_1042","date_created":"2018-12-11T11:44:21Z","citation":{"ieee":"I. Gridchyn, “Reactivation content is important for consolidation of spatial memory,” Institute of Science and Technology Austria, 2018.","short":"I. Gridchyn, Reactivation Content Is Important for Consolidation of Spatial Memory, Institute of Science and Technology Austria, 2018.","apa":"Gridchyn, I. (2018). Reactivation content is important for consolidation of spatial memory. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_1042","ama":"Gridchyn I. Reactivation content is important for consolidation of spatial memory. 2018. doi:10.15479/AT:ISTA:th_1042","mla":"Gridchyn, Igor. Reactivation Content Is Important for Consolidation of Spatial Memory. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th_1042.","ista":"Gridchyn I. 2018. Reactivation content is important for consolidation of spatial memory. Institute of Science and Technology Austria.","chicago":"Gridchyn, Igor. “Reactivation Content Is Important for Consolidation of Spatial Memory.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th_1042."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Igor","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1807-1929","full_name":"Gridchyn, Igor","last_name":"Gridchyn"}],"publist_id":"8006","article_processing_charge":"No","title":"Reactivation content is important for consolidation of spatial memory","abstract":[{"text":"The hippocampus is a key brain region for spatial memory and navigation and is needed at all stages of memory, including encoding, consolidation, and recall. Hippocampal place cells selectively discharge at specific locations of the environment to form a cognitive map of the space. During the rest period and sleep following spatial navigation and/or learning, the waking activity of the place cells is reactivated within high synchrony events. This reactivation is thought to be important for memory consolidation and stabilization of the spatial representations. The aim of my thesis was to directly test whether the reactivation content encoded in firing patterns of place cells is important for consolidation of spatial memories. In particular, I aimed to test whether, in cases when multiple spatial memory traces are acquired during learning, the specific disruption of the reactivation of a subset of these memories leads to the selective disruption of the corresponding memory traces or through memory interference the other learned memories are disrupted as well. In this thesis, using a modified cheeseboard paradigm and a closed-loop recording setup with feedback optogenetic stimulation, I examined how the disruption of the reactivation of specific spiking patterns affects consolidation of the corresponding memory traces. To obtain multiple distinctive memories, animals had to perform a spatial task in two distinct cheeseboard environments and the reactivation of spiking patterns associated with one of the environments (target) was disrupted after learning during four hours rest period using a real-time decoding method. This real-time decoding method was capable of selectively affecting the firing rates and cofiring correlations of the target environment-encoding cells. The selective disruption led to behavioural impairment in the memory tests after the rest periods in the target environment but not in the other undisrupted control environment. In addition, the map of the target environment was less stable in the impaired memory tests compared to the learning session before than the map of the control environment. However, when the animal relearned the task, the same map recurred in the target environment that was present during learning before the disruption. Altogether my work demonstrated that the reactivation content is important: assembly-related disruption of reactivation can lead to a selective memory impairment and deficiency in map stability. These findings indeed suggest that reactivated assembly patterns reflect processes associated with the consolidation of memory traces. ","lang":"eng"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"month":"08","publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","file":[{"date_updated":"2021-02-11T23:30:22Z","file_size":7666687,"creator":"dernst","date_created":"2019-04-08T13:36:01Z","file_name":"2018_Thesis_Gridchyn_source.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","access_level":"closed","relation":"source_file","file_id":"6236","checksum":"7db4415e435590fa33542c7b0a0321d7"},{"embargo":"2019-08-29","file_id":"6237","checksum":"f96f3fe8979f7b1e6db6acaca962b10c","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2018_Thesis_Gridchyn.pdf","date_created":"2019-04-08T13:36:01Z","creator":"dernst","file_size":6034153,"date_updated":"2021-02-11T11:17:18Z"}],"language":[{"iso":"eng"}],"_id":"48","type":"dissertation","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":"1042","supervisor":[{"last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-07T12:42:44Z","ddc":["573"],"file_date_updated":"2021-02-11T23:30:22Z","department":[{"_id":"JoCs"}]},{"ddc":["570"],"date_updated":"2023-09-07T12:43:10Z","supervisor":[{"first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E","last_name":"Siekhaus"}],"file_date_updated":"2021-02-11T11:17:16Z","department":[{"_id":"DaSi"}],"_id":"9","pubrep_id":"1064","status":"public","type":"dissertation","language":[{"iso":"eng"}],"file":[{"access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","checksum":"d27b2465cb70d0c9678a0381b9b6ced1","file_id":"6243","creator":"dernst","date_updated":"2020-07-14T12:48:14Z","file_size":102737483,"date_created":"2019-04-08T14:13:12Z","file_name":"2018_Thesis_Belyaeva_source.docx"},{"checksum":"a2939b61bde2de7b8ced77bbae0eaaed","file_id":"6244","embargo":"2019-11-19","content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2019-04-08T14:14:08Z","file_name":"2018_Thesis_Belyaeva.pdf","date_updated":"2021-02-11T11:17:16Z","file_size":88077843,"creator":"dernst"}],"degree_awarded":"PhD","publication_status":"published","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","abstract":[{"text":"Immune cells migrating to the sites of infection navigate through diverse tissue architectures and switch their migratory mechanisms upon demand. However, little is known about systemic regulators that could allow the acquisition of these mechanisms. We performed a genetic screen in Drosophila melanogaster to identify regulators of germband invasion by embryonic macrophages into the confined space between the ectoderm and mesoderm. We have found that bZIP circadian transcription factors (TFs) Kayak (dFos) and Vrille (dNFIL3) have opposite effects on macrophage germband infiltration: Kayak facilitated and Vrille inhibited it. These TFs are enriched in the macrophages during migration and genetically interact to control it. Kayak sets a less coordinated mode of migration of the macrophage group and increases the probability and length of Levy walks. Intriguingly, the motility of kayak mutant macrophages was also strongly affected during initial germband invasion but not along another less confined route. Inhibiting Rho1 signaling within the tail ectoderm partially rescued the Kayak mutant phenotype, strongly suggesting that migrating macrophages have to overcome a barrier imposed by the stiffness of the ectoderm. Also, Kayak appeared to be important for the maintenance of the round cell shape and the rear edge translocation of the macrophages invading the germband. Complementary to this, the cortical actin cytoskeleton of Kayak- deficient macrophages was strongly affected. RNA sequencing revealed the filamin Cheerio and tetraspanin TM4SF to be downstream of Kayak. Chromatin immunoprecipitation and immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Indeed, Cheerio, TM4SF and Diaphanous are required within macrophages for germband invasion, and expression of constitutively active Diaphanous in macrophages was able to rescue the kayak mutant phenotype. Moreover, Cher and Diaphanous are also reduced in the macrophages overexpressing Vrille. We hypothesize that Kayak, through its targets, increases actin polymerization and cortical tension in macrophages and thus allows extra force generation necessary for macrophage dissemination and migration through confined stiff tissues, while Vrille counterbalances it.","lang":"eng"}],"month":"07","alternative_title":["ISTA Thesis"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Belyaeva, Vera. “Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th1064.","ista":"Belyaeva V. 2018. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . Institute of Science and Technology Austria.","mla":"Belyaeva, Vera. Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo . Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th1064.","short":"V. Belyaeva, Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo , Institute of Science and Technology Austria, 2018.","ieee":"V. Belyaeva, “Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ,” Institute of Science and Technology Austria, 2018.","apa":"Belyaeva, V. (2018). Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th1064","ama":"Belyaeva V. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . 2018. doi:10.15479/AT:ISTA:th1064"},"title":"Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ","article_processing_charge":"No","publist_id":"8047","author":[{"full_name":"Belyaeva, Vera","last_name":"Belyaeva","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","first_name":"Vera"}],"day":"01","year":"2018","has_accepted_license":"1","date_created":"2018-12-11T11:44:08Z","date_published":"2018-07-01T00:00:00Z","doi":"10.15479/AT:ISTA:th1064","page":"96","oa":1,"publisher":"Institute of Science and Technology Austria"},{"title":"Design and characterization of methods and biological components to realize synthetic neurotransmission ","author":[{"id":"3EEDE19A-F248-11E8-B48F-1D18A9856A87","first_name":"Catherine","last_name":"Mckenzie","full_name":"Mckenzie, Catherine"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Mckenzie, Catherine. Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission . Institute of Science and Technology Austria, 2018, doi:10.15479/at:ista:th_1055.","apa":"Mckenzie, C. (2018). Design and characterization of methods and biological components to realize synthetic neurotransmission . Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:th_1055","ama":"Mckenzie C. Design and characterization of methods and biological components to realize synthetic neurotransmission . 2018. doi:10.15479/at:ista:th_1055","short":"C. Mckenzie, Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission , Institute of Science and Technology Austria, 2018.","ieee":"C. Mckenzie, “Design and characterization of methods and biological components to realize synthetic neurotransmission ,” Institute of Science and Technology Austria, 2018.","chicago":"Mckenzie, Catherine. “Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission .” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/at:ista:th_1055.","ista":"Mckenzie C. 2018. Design and characterization of methods and biological components to realize synthetic neurotransmission . Institute of Science and Technology Austria."},"publisher":"Institute of Science and Technology Austria","oa":1,"doi":"10.15479/at:ista:th_1055","date_published":"2018-10-31T00:00:00Z","date_created":"2019-04-09T14:13:39Z","page":"95","day":"31","has_accepted_license":"1","year":"2018","status":"public","pubrep_id":"1055","type":"dissertation","_id":"6266","department":[{"_id":"HaJa"}],"file_date_updated":"2021-02-11T11:17:16Z","ddc":["571","573"],"supervisor":[{"first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","full_name":"Janovjak, Harald L","orcid":"0000-0002-8023-9315"}],"date_updated":"2023-09-07T13:02:37Z","month":"10","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta. Synthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing. "}],"related_material":{"record":[{"relation":"new_edition","status":"public","id":"7132"}]},"file":[{"file_name":"2018_Thesis_McKenzie.pdf","date_created":"2019-04-09T14:12:40Z","file_size":4906420,"date_updated":"2021-02-11T11:17:16Z","creator":"dernst","embargo":"2019-11-24","checksum":"9d2c2dca04b00e485470c28b262af59a","file_id":"6267","content_type":"application/pdf","relation":"main_file","access_level":"open_access"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","access_level":"closed","relation":"source_file","checksum":"50b58c272899601bc6fd9642c4dc97f1","file_id":"6268","date_updated":"2020-07-14T12:47:25Z","file_size":5053545,"creator":"dernst","date_created":"2019-04-09T14:12:40Z","file_name":"2018_Thesis_McKenzie_source.docx"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD"},{"title":"Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP signaling in directed mesenchymal cell migration","author":[{"last_name":"Capek","orcid":"0000-0001-5199-9940","full_name":"Capek, Daniel","first_name":"Daniel","id":"31C42484-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"8004","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Capek D. 2018. Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP signaling in directed mesenchymal cell migration. Institute of Science and Technology Austria.","chicago":"Capek, Daniel. “Optogenetic Frizzled 7 Reveals a Permissive Function of Wnt/PCP Signaling in Directed Mesenchymal Cell Migration.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1031.","ama":"Capek D. Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP signaling in directed mesenchymal cell migration. 2018. doi:10.15479/AT:ISTA:TH_1031","apa":"Capek, D. (2018). Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP signaling in directed mesenchymal cell migration. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1031","ieee":"D. Capek, “Optogenetic Frizzled 7 reveals a permissive function of Wnt/PCP signaling in directed mesenchymal cell migration,” Institute of Science and Technology Austria, 2018.","short":"D. Capek, Optogenetic Frizzled 7 Reveals a Permissive Function of Wnt/PCP Signaling in Directed Mesenchymal Cell Migration, Institute of Science and Technology Austria, 2018.","mla":"Capek, Daniel. Optogenetic Frizzled 7 Reveals a Permissive Function of Wnt/PCP Signaling in Directed Mesenchymal Cell Migration. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1031."},"doi":"10.15479/AT:ISTA:TH_1031","date_published":"2018-06-22T00:00:00Z","date_created":"2018-12-11T11:44:21Z","page":"95","day":"22","has_accepted_license":"1","year":"2018","publisher":"Institute of Science and Technology Austria","oa":1,"file_date_updated":"2021-02-11T23:30:21Z","department":[{"_id":"CaHe"}],"ddc":["570","591","596"],"supervisor":[{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566"}],"date_updated":"2023-09-07T12:48:16Z","status":"public","pubrep_id":"1031","type":"dissertation","_id":"50","related_material":{"record":[{"status":"public","id":"1100","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"661"},{"relation":"part_of_dissertation","id":"676","status":"public"}]},"file":[{"file_size":31576521,"date_updated":"2021-02-11T11:17:17Z","creator":"dernst","file_name":"2018_Thesis_Capek.pdf","date_created":"2019-04-08T13:42:26Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","embargo":"2019-06-25","checksum":"d3eca3dcacb67bffdde6e6609c31cdd0","file_id":"6238"},{"date_updated":"2021-02-11T23:30:21Z","file_size":38992956,"creator":"dernst","date_created":"2019-04-08T13:42:27Z","file_name":"2018_Thesis_Capek_source.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","access_level":"closed","relation":"source_file","checksum":"876deb14067e638aba65d209668bd821","file_id":"6239"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","month":"06","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The Wnt/planar cell polarity (Wnt/PCP) pathway determines planar polarity of epithelial cells in both vertebrates and invertebrates. The role that Wnt/PCP signaling plays in mesenchymal contexts, however, is only poorly understood. While previous studies have demonstrated the capacity of Wnt/PCP signaling to polarize and guide directed migration of mesenchymal cells, it remains unclear whether endogenous Wnt/PCP signaling performs these functions instructively, as it does in epithelial cells. Here we developed a light-switchable version of the Wnt/PCP receptor Frizzled 7 (Fz7) to unambiguously distinguish between an instructive and a permissive role of Wnt/PCP signaling for the directional collective migration of mesendoderm progenitor cells during zebrafish gastrulation. We show that prechordal plate (ppl) cell migration is defective in maternal-zygotic fz7a and fz7b (MZ fz7a,b) double mutant embryos, and that Fz7 functions cell-autonomously in this process by promoting ppl cell protrusion formation and directed migration. We further show that local activation of Fz7 can direct ppl cell migration both in vitro and in vivo. Surprisingly, however, uniform Fz7 activation is sufficient to fully rescue the ppl cell migration defect in MZ fz7a,b mutant embryos, indicating that Wnt/PCP signaling functions permissively rather than instructively in directed mesendoderm cell migration during zebrafish gastrulation."}]},{"publisher":"Institute of Science and Technology Austria","oa":1,"day":"30","has_accepted_license":"1","year":"2018","date_published":"2018-10-30T00:00:00Z","doi":"10.15479/AT:ISTA:th1059","date_created":"2018-12-11T11:44:14Z","page":"109","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Steinrück M. 2018. The influence of sequence context on the evolution of bacterial gene expression. Institute of Science and Technology Austria.","chicago":"Steinrück, Magdalena. “The Influence of Sequence Context on the Evolution of Bacterial Gene Expression.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th1059.","ieee":"M. Steinrück, “The influence of sequence context on the evolution of bacterial gene expression,” Institute of Science and Technology Austria, 2018.","short":"M. Steinrück, The Influence of Sequence Context on the Evolution of Bacterial Gene Expression, Institute of Science and Technology Austria, 2018.","ama":"Steinrück M. The influence of sequence context on the evolution of bacterial gene expression. 2018. doi:10.15479/AT:ISTA:th1059","apa":"Steinrück, M. (2018). The influence of sequence context on the evolution of bacterial gene expression. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th1059","mla":"Steinrück, Magdalena. The Influence of Sequence Context on the Evolution of Bacterial Gene Expression. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th1059."},"title":"The influence of sequence context on the evolution of bacterial gene expression","publist_id":"8029","author":[{"full_name":"Steinrück, Magdalena","orcid":"0000-0003-1229-9719","last_name":"Steinrück","id":"2C023F40-F248-11E8-B48F-1D18A9856A87","first_name":"Magdalena"}],"article_processing_charge":"No","oa_version":"Published Version","abstract":[{"text":"Expression of genes is a fundamental molecular phenotype that is subject to evolution by different types of mutations. Both the rate and the effect of mutations may depend on the DNA sequence context of a particular gene or a particular promoter sequence. In this thesis I investigate the nature of this dependence using simple genetic systems in Escherichia coli. With these systems I explore the evolution of constitutive gene expression from random starting sequences at different loci on the chromosome and at different locations in sequence space. First, I dissect chromosomal neighborhood effects that underlie locus-dependent differences in the potential of a gene under selection to become more highly expressed. Next, I find that the effects of point mutations in promoter sequences are dependent on sequence context, and that an existing energy matrix model performs poorly in predicting relative expression of unrelated sequences. Finally, I show that a substantial fraction of random sequences contain functional promoters and I present an extended thermodynamic model that predicts promoter strength in full sequence space. Taken together, these results provide new insights and guides on how to integrate information on sequence context to improve our qualitative and quantitative understanding of bacterial gene expression, with implications for rapid evolution of drug resistance, de novo evolution of genes, and horizontal gene transfer.","lang":"eng"}],"month":"10","alternative_title":["ISTA Thesis"],"file":[{"creator":"dernst","file_size":9190845,"date_updated":"2020-07-14T12:45:43Z","file_name":"Thesis_Steinrueck_final.docx","date_created":"2019-02-08T10:51:22Z","relation":"source_file","access_level":"closed","embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"5941","checksum":"413cbce1cd1debeae3abe2a25dbc70d1"},{"date_created":"2019-02-08T10:51:22Z","file_name":"Thesis_Steinrueck_final.pdf","creator":"dernst","date_updated":"2021-02-11T11:17:14Z","file_size":7521973,"checksum":"3def8b7854c8b42d643597ce0215efac","file_id":"5942","embargo":"2019-11-02","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"publication_status":"published","degree_awarded":"PhD","related_material":{"record":[{"status":"public","id":"704","relation":"part_of_dissertation"}]},"_id":"26","status":"public","pubrep_id":"1059","type":"dissertation","ddc":["576","579"],"supervisor":[{"first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C"}],"date_updated":"2023-09-07T12:48:43Z","department":[{"_id":"CaGu"}],"file_date_updated":"2021-02-11T11:17:14Z"},{"article_number":"114701","citation":{"chicago":"Hollmann, Arne, Daniel Jirovec, Maciej Kucharski, Dietmar Kissinger, Gunter Fischer, and Lars R. Schreiber. “30 GHz-Voltage Controlled Oscillator Operating at 4 K.” Review of Scientific Instruments. AIP Publishing, 2018. https://doi.org/10.1063/1.5038258.","ista":"Hollmann A, Jirovec D, Kucharski M, Kissinger D, Fischer G, Schreiber LR. 2018. 30 GHz-voltage controlled oscillator operating at 4 K. Review of Scientific Instruments. 89(11), 114701.","mla":"Hollmann, Arne, et al. “30 GHz-Voltage Controlled Oscillator Operating at 4 K.” Review of Scientific Instruments, vol. 89, no. 11, 114701, AIP Publishing, 2018, doi:10.1063/1.5038258.","ieee":"A. Hollmann, D. Jirovec, M. Kucharski, D. Kissinger, G. Fischer, and L. R. Schreiber, “30 GHz-voltage controlled oscillator operating at 4 K,” Review of Scientific Instruments, vol. 89, no. 11. AIP Publishing, 2018.","short":"A. Hollmann, D. Jirovec, M. Kucharski, D. Kissinger, G. Fischer, L.R. Schreiber, Review of Scientific Instruments 89 (2018).","apa":"Hollmann, A., Jirovec, D., Kucharski, M., Kissinger, D., Fischer, G., & Schreiber, L. R. (2018). 30 GHz-voltage controlled oscillator operating at 4 K. Review of Scientific Instruments. AIP Publishing. https://doi.org/10.1063/1.5038258","ama":"Hollmann A, Jirovec D, Kucharski M, Kissinger D, Fischer G, Schreiber LR. 30 GHz-voltage controlled oscillator operating at 4 K. Review of Scientific Instruments. 2018;89(11). doi:10.1063/1.5038258"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"arxiv":["1804.09522"],"isi":["000451735700054"]},"author":[{"last_name":"Hollmann","full_name":"Hollmann, Arne","first_name":"Arne"},{"id":"4C473F58-F248-11E8-B48F-1D18A9856A87","first_name":"Daniel","last_name":"Jirovec","full_name":"Jirovec, Daniel","orcid":"0000-0002-7197-4801"},{"first_name":"Maciej","last_name":"Kucharski","full_name":"Kucharski, Maciej"},{"last_name":"Kissinger","full_name":"Kissinger, Dietmar","first_name":"Dietmar"},{"full_name":"Fischer, Gunter","last_name":"Fischer","first_name":"Gunter"},{"last_name":"Schreiber","full_name":"Schreiber, Lars R.","first_name":"Lars R."}],"title":"30 GHz-voltage controlled oscillator operating at 4 K","oa":1,"quality_controlled":"1","publisher":"AIP Publishing","year":"2018","isi":1,"publication":"Review of Scientific Instruments","day":"01","date_created":"2019-01-10T14:22:23Z","date_published":"2018-11-01T00:00:00Z","doi":"10.1063/1.5038258","_id":"5816","type":"journal_article","status":"public","date_updated":"2024-03-27T23:30:26Z","department":[{"_id":"GeKa"}],"abstract":[{"text":"Solid-state qubit manipulation and read-out fidelities are reaching fault-tolerance, but quantum error correction requires millions of physical qubits and therefore a scalable quantum computer architecture. To solve signal-line bandwidth and fan-out problems, microwave sources required for qubit manipulation might be embedded close to the qubit chip, typically operating at temperatures below 4 K. Here, we perform the first low temperature measurements of a 130 nm BiCMOS based SiGe voltage controlled oscillator at cryogenic temperature. We determined the frequency and output power dependence on temperature and magnetic field up to 5 T and measured the temperature influence on its noise performance. The device maintains its full functionality from 300 K to 4 K. The carrier frequency at 4 K increases by 3% with respect to the carrier frequency at 300 K, and the output power at 4 K increases by 10 dB relative to the output power at 300 K. The frequency tuning range of approximately 20% remains unchanged between 300 K and 4 K. In an in-plane magnetic field of 5 T, the carrier frequency shifts by only 0.02% compared to the frequency at zero magnetic field.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.09522"}],"scopus_import":"1","intvolume":" 89","month":"11","publication_status":"published","publication_identifier":{"issn":["00346748"]},"language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"10058","status":"public"}]},"volume":89,"issue":"11"},{"page":"91","date_created":"2019-04-09T13:57:15Z","date_published":"2018-12-28T00:00:00Z","doi":"10.15479/AT:ISTA:th1072","year":"2018","has_accepted_license":"1","day":"28","oa":1,"publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","author":[{"id":"4342E402-F248-11E8-B48F-1D18A9856A87","first_name":"Marta","orcid":"0000-0002-2519-8004","full_name":"Lukacisinova, Marta","last_name":"Lukacisinova"}],"title":"Genetic determinants of antibiotic resistance evolution","citation":{"mla":"Lukacisinova, Marta. Genetic Determinants of Antibiotic Resistance Evolution. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:th1072.","short":"M. Lukacisinova, Genetic Determinants of Antibiotic Resistance Evolution, Institute of Science and Technology Austria, 2018.","ieee":"M. Lukacisinova, “Genetic determinants of antibiotic resistance evolution,” Institute of Science and Technology Austria, 2018.","ama":"Lukacisinova M. Genetic determinants of antibiotic resistance evolution. 2018. doi:10.15479/AT:ISTA:th1072","apa":"Lukacisinova, M. (2018). Genetic determinants of antibiotic resistance evolution. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th1072","chicago":"Lukacisinova, Marta. “Genetic Determinants of Antibiotic Resistance Evolution.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:th1072.","ista":"Lukacisinova M. 2018. Genetic determinants of antibiotic resistance evolution. Institute of Science and Technology Austria."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"id":"1619","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"696"},{"relation":"part_of_dissertation","status":"public","id":"1027"}]},"publication_status":"published","degree_awarded":"PhD","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"file":[{"file_size":5656866,"date_updated":"2021-02-11T11:17:17Z","creator":"dernst","file_name":"2018_Thesis_Lukacisinova.pdf","date_created":"2019-04-09T13:49:24Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","embargo":"2020-01-25","checksum":"fc60585c9eaad868ac007004ef130908","file_id":"6264"},{"file_id":"6265","checksum":"264057ec0a92ab348cc83b41f021ba92","access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","embargo_to":"open_access","date_created":"2019-04-09T13:49:23Z","file_name":"2018_Thesis_Lukacisinova_source.docx","creator":"dernst","date_updated":"2020-07-14T12:47:25Z","file_size":5168054}],"alternative_title":["ISTA Thesis"],"month":"12","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"LifeSc"}],"abstract":[{"text":"Antibiotic resistance can emerge spontaneously through genomic mutation and render treatment ineffective. To counteract this process, in addition to the discovery and description of resistance mechanisms,a deeper understanding of resistanceevolvabilityand its determinantsis needed. To address this challenge, this thesisuncoversnew genetic determinants of resistance evolvability using a customized robotic setup, exploressystematic ways in which resistance evolution is perturbed due to dose-responsecharacteristics of drugs and mutation rate differences,and mathematically investigates the evolutionary fate of one specific type of evolvability modifier -a stress-induced mutagenesis allele.We find severalgenes which strongly inhibit or potentiate resistance evolution. In order to identify them, we first developedan automated high-throughput feedback-controlled protocol whichkeeps the population size and selection pressure approximately constant for hundreds of cultures by dynamically re-diluting the cultures and adjusting the antibiotic concentration. We implementedthis protocol on a customized liquid handling robot and propagated 100 different gene deletion strains of Escherichia coliin triplicate for over 100 generations in tetracycline and in chloramphenicol, and comparedtheir adaptation rates.We find a diminishing returns pattern, where initially sensitive strains adapted more compared to less sensitive ones. Our data uncover that deletions of certain genes which do not affect mutation rate,including efflux pump components, a chaperone and severalstructural and regulatory genes can strongly and reproducibly alterresistance evolution. Sequencing analysis of evolved populations indicates that epistasis with resistance mutations is the most likelyexplanation. This work could inspire treatment strategies in which targeted inhibitors of evolvability mechanisms will be given alongside antibiotics to slow down resistance evolution and extend theefficacy of antibiotics.We implemented astochasticpopulation genetics model, toverifyways in which general properties, namely, dose-response characteristics of drugs and mutation rates, influence evolutionary dynamics. In particular, under the exposure to antibiotics with shallow dose-response curves,bacteria have narrower distributions of fitness effects of new mutations. We show that in silicothis also leads to slower resistance evolution. We see and confirm with experiments that increased mutation rates, apart from speeding up evolution, also leadto high reproducibility of phenotypic adaptation in a context of continually strong selection pressure.Knowledge of these patterns can aid in predicting the dynamics of antibiotic resistance evolutionand adapting treatment schemes accordingly.Focusing on a previously described type of evolvability modifier –a stress-induced mutagenesis allele –we find conditions under which it can persist in a population under periodic selectionakin to clinical treatment. We set up a deterministic infinite populationcontinuous time model tracking the frequencies of a mutator and resistance allele and evaluate various treatment schemes in how well they maintain a stress-induced mutator allele. In particular,a high diversity of stresses is crucial for the persistence of the mutator allele. This leads to a general trade-off where exactly those diversifying treatment schemes which are likely to decrease levels of resistance could lead to stronger selection of highly evolvable genotypes.In the long run, this work will lead to a deeper understanding of the genetic and cellular mechanisms involved in antibiotic resistance evolution and could inspire new strategies for slowing down its rate. ","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2021-02-11T11:17:17Z","department":[{"_id":"ToBo"}],"date_updated":"2023-09-22T09:20:37Z","supervisor":[{"first_name":"Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Tobias","orcid":"0000-0003-4398-476X","last_name":"Bollenbach"}],"ddc":["570","576","579"],"type":"dissertation","status":"public","_id":"6263"},{"page":"845 - 857","date_created":"2018-12-11T11:47:05Z","doi":"10.1534/g3.117.300452","date_published":"2018-03-01T00:00:00Z","year":"2018","has_accepted_license":"1","isi":1,"publication":"G3: Genes, Genomes, Genetics","day":"01","oa":1,"quality_controlled":"1","publisher":"Genetics Society of America","acknowledgement":" A. Ratheesh also by Marie Curie IIF GA-2012-32950BB:DICJI, Marko Roblek by the provincial government of Lower Austria, K. Valoskova and S. Wachner by DOC Fellowships from the Austrian Academy of Sciences, ","external_id":{"isi":["000426693300011"]},"article_processing_charge":"No","author":[{"orcid":"0000-0002-1819-198X","full_name":"György, Attila","last_name":"György","first_name":"Attila","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marko","id":"3047D808-F248-11E8-B48F-1D18A9856A87","full_name":"Roblek, Marko","orcid":"0000-0001-9588-1389","last_name":"Roblek"},{"orcid":"0000-0001-7190-0776","full_name":"Ratheesh, Aparna","last_name":"Ratheesh","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","first_name":"Aparna"},{"last_name":"Valosková","full_name":"Valosková, Katarina","id":"46F146FC-F248-11E8-B48F-1D18A9856A87","first_name":"Katarina"},{"last_name":"Belyaeva","full_name":"Belyaeva, Vera","first_name":"Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wachner, Stephanie","last_name":"Wachner","first_name":"Stephanie","id":"2A95E7B0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yutaka","last_name":"Matsubayashi","full_name":"Matsubayashi, Yutaka"},{"first_name":"Besaiz","full_name":"Sanchez Sanchez, Besaiz","last_name":"Sanchez Sanchez"},{"first_name":"Brian","last_name":"Stramer","full_name":"Stramer, Brian"},{"first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353","last_name":"Siekhaus"}],"publist_id":"7271","title":"Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues","citation":{"mla":"György, Attila, et al. “Tools Allowing Independent Visualization and Genetic Manipulation of Drosophila Melanogaster Macrophages and Surrounding Tissues.” G3: Genes, Genomes, Genetics, vol. 8, no. 3, Genetics Society of America, 2018, pp. 845–57, doi:10.1534/g3.117.300452.","apa":"György, A., Roblek, M., Ratheesh, A., Valosková, K., Belyaeva, V., Wachner, S., … Siekhaus, D. E. (2018). Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. G3: Genes, Genomes, Genetics. Genetics Society of America. https://doi.org/10.1534/g3.117.300452","ama":"György A, Roblek M, Ratheesh A, et al. Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. G3: Genes, Genomes, Genetics. 2018;8(3):845-857. doi:10.1534/g3.117.300452","short":"A. György, M. Roblek, A. Ratheesh, K. Valosková, V. Belyaeva, S. Wachner, Y. Matsubayashi, B. Sanchez Sanchez, B. Stramer, D.E. Siekhaus, G3: Genes, Genomes, Genetics 8 (2018) 845–857.","ieee":"A. György et al., “Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues,” G3: Genes, Genomes, Genetics, vol. 8, no. 3. Genetics Society of America, pp. 845–857, 2018.","chicago":"György, Attila, Marko Roblek, Aparna Ratheesh, Katarina Valosková, Vera Belyaeva, Stephanie Wachner, Yutaka Matsubayashi, Besaiz Sanchez Sanchez, Brian Stramer, and Daria E Siekhaus. “Tools Allowing Independent Visualization and Genetic Manipulation of Drosophila Melanogaster Macrophages and Surrounding Tissues.” G3: Genes, Genomes, Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/g3.117.300452.","ista":"György A, Roblek M, Ratheesh A, Valosková K, Belyaeva V, Wachner S, Matsubayashi Y, Sanchez Sanchez B, Stramer B, Siekhaus DE. 2018. Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. G3: Genes, Genomes, Genetics. 8(3), 845–857."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"grant_number":"P29638","name":"Drosophila TNFa´s Funktion in Immunzellen","call_identifier":"FWF","_id":"253B6E48-B435-11E9-9278-68D0E5697425"},{"_id":"253B6E48-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P29638","name":"The role of Drosophila TNF alpha in immune cell invasion"},{"grant_number":"LSC16-021 ","name":"Investigating the role of the novel major superfamily facilitator transporter family member MFSD1 in metastasis","_id":"2637E9C0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2536F660-B435-11E9-9278-68D0E5697425","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077"}],"ec_funded":1,"volume":8,"related_material":{"record":[{"relation":"research_paper","id":"6530"},{"relation":"research_paper","id":"6543"},{"relation":"dissertation_contains","id":"11193","status":"public"},{"relation":"dissertation_contains","id":"6546","status":"public"}]},"issue":"3","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_size":2251222,"date_updated":"2020-07-14T12:46:56Z","creator":"system","file_name":"IST-2018-990-v1+1_2018_Gyoergy_Tools_allowing.pdf","date_created":"2018-12-12T10:11:48Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4905","checksum":"7d9d28b915159078a4ca7add568010e8"}],"scopus_import":"1","intvolume":" 8","month":"03","abstract":[{"text":"Drosophila melanogaster plasmatocytes, the phagocytic cells among hemocytes, are essential for immune responses, but also play key roles from early development to death through their interactions with other cell types. They regulate homeostasis and signaling during development, stem cell proliferation, metabolism, cancer, wound responses and aging, displaying intriguing molecular and functional conservation with vertebrate macrophages. Given the relative ease of genetics in Drosophila compared to vertebrates, tools permitting visualization and genetic manipulation of plasmatocytes and surrounding tissues independently at all stages would greatly aid in fully understanding these processes, but are lacking. Here we describe a comprehensive set of transgenic lines that allow this. These include extremely brightly fluorescing mCherry-based lines that allow GAL4-independent visualization of plasmatocyte nuclei, cytoplasm or actin cytoskeleton from embryonic Stage 8 through adulthood in both live and fixed samples even as heterozygotes, greatly facilitating screening. These lines allow live visualization and tracking of embryonic plasmatocytes, as well as larval plasmatocytes residing at the body wall or flowing with the surrounding hemolymph. With confocal imaging, interactions of plasmatocytes and inner tissues can be seen in live or fixed embryos, larvae and adults. They permit efficient GAL4-independent FACS analysis/sorting of plasmatocytes throughout life. To facilitate genetic analysis of reciprocal signaling, we have also made a plasmatocyte-expressing QF2 line that in combination with extant GAL4 drivers allows independent genetic manipulation of both plasmatocytes and surrounding tissues, and a GAL80 line that blocks GAL4 drivers from affecting plasmatocytes, both of which function from the early embryo to the adult.","lang":"eng"}],"acknowledged_ssus":[{"_id":"LifeSc"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:56Z","department":[{"_id":"DaSi"}],"date_updated":"2024-03-27T23:30:29Z","ddc":["570"],"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","pubrep_id":"990","status":"public","_id":"544"},{"_id":"612","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)"},"article_type":"original","type":"journal_article","pubrep_id":"1013","status":"public","date_updated":"2024-03-27T23:30:30Z","ddc":["571"],"file_date_updated":"2020-07-14T12:47:20Z","department":[{"_id":"RySh"}],"abstract":[{"text":"Metabotropic GABAB receptors mediate slow inhibitory effects presynaptically and postsynaptically through the modulation of different effector signalling pathways. Here, we analysed the distribution of GABAB receptors using highly sensitive SDS-digested freeze-fracture replica labelling in mouse cerebellar Purkinje cells. Immunoreactivity for GABAB1 was observed on presynaptic and, more abundantly, on postsynaptic compartments, showing both scattered and clustered distribution patterns. Quantitative analysis of immunoparticles revealed a somato-dendritic gradient, with the density of immunoparticles increasing 26-fold from somata to dendritic spines. To understand the spatial relationship of GABAB receptors with two key effector ion channels, the G protein-gated inwardly rectifying K+ (GIRK/Kir3) channel and the voltage-dependent Ca2+ channel, biochemical and immunohistochemical approaches were performed. Co-immunoprecipitation analysis demonstrated that GABAB receptors co-assembled with GIRK and CaV2.1 channels in the cerebellum. Using double-labelling immunoelectron microscopic techniques, co-clustering between GABAB1 and GIRK2 was detected in dendritic spines, whereas they were mainly segregated in the dendritic shafts. In contrast, co-clustering of GABAB1 and CaV2.1 was detected in dendritic shafts but not spines. Presynaptically, although no significant co-clustering of GABAB1 and GIRK2 or CaV2.1 channels was detected, inter-cluster distance for GABAB1 and GIRK2 was significantly smaller in the active zone than in the dendritic shafts, and that for GABAB1 and CaV2.1 was significantly smaller in the active zone than in the dendritic shafts and spines. Thus, GABAB receptors are associated with GIRK and CaV2.1 channels in different subcellular compartments. These data provide a better framework for understanding the different roles played by GABAB receptors and their effector ion channels in the cerebellar network.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 223","month":"04","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_size":5542926,"date_updated":"2020-07-14T12:47:20Z","creator":"system","file_name":"IST-2018-1013-v1+1_2018_Kleindienst_Differential.pdf","date_created":"2018-12-12T10:15:36Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"a55b3103476ecb5f4f983d8801807e8b","file_id":"5157"}],"ec_funded":1,"issue":"3","volume":223,"related_material":{"record":[{"relation":"dissertation_contains","id":"9562","status":"public"}]},"project":[{"call_identifier":"H2020","_id":"25CBA828-B435-11E9-9278-68D0E5697425","grant_number":"720270","name":"Human Brain Project Specific Grant Agreement 1 (HBP SGA 1)"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"citation":{"short":"R. Luján, C. Aguado, F. Ciruela, J. Cózar, D. Kleindienst, L. De La Ossa, B. Bettler, K. Wickman, M. Watanabe, R. Shigemoto, Y. Fukazawa, Brain Structure and Function 223 (2018) 1565–1587.","ieee":"R. Luján et al., “Differential association of GABAB receptors with their effector ion channels in Purkinje cells,” Brain Structure and Function, vol. 223, no. 3. Springer, pp. 1565–1587, 2018.","apa":"Luján, R., Aguado, C., Ciruela, F., Cózar, J., Kleindienst, D., De La Ossa, L., … Fukazawa, Y. (2018). Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. Springer. https://doi.org/10.1007/s00429-017-1568-y","ama":"Luján R, Aguado C, Ciruela F, et al. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. 2018;223(3):1565-1587. doi:10.1007/s00429-017-1568-y","mla":"Luján, Rafael, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” Brain Structure and Function, vol. 223, no. 3, Springer, 2018, pp. 1565–87, doi:10.1007/s00429-017-1568-y.","ista":"Luján R, Aguado C, Ciruela F, Cózar J, Kleindienst D, De La Ossa L, Bettler B, Wickman K, Watanabe M, Shigemoto R, Fukazawa Y. 2018. Differential association of GABAB receptors with their effector ion channels in Purkinje cells. Brain Structure and Function. 223(3), 1565–1587.","chicago":"Luján, Rafael, Carolina Aguado, Francisco Ciruela, Javier Cózar, David Kleindienst, Luis De La Ossa, Bernhard Bettler, et al. “Differential Association of GABAB Receptors with Their Effector Ion Channels in Purkinje Cells.” Brain Structure and Function. Springer, 2018. https://doi.org/10.1007/s00429-017-1568-y."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000428419500030"]},"publist_id":"7192","author":[{"full_name":"Luján, Rafael","last_name":"Luján","first_name":"Rafael"},{"full_name":"Aguado, Carolina","last_name":"Aguado","first_name":"Carolina"},{"last_name":"Ciruela","full_name":"Ciruela, Francisco","first_name":"Francisco"},{"full_name":"Cózar, Javier","last_name":"Cózar","first_name":"Javier"},{"first_name":"David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","full_name":"Kleindienst, David","last_name":"Kleindienst"},{"first_name":"Luis","last_name":"De La Ossa","full_name":"De La Ossa, Luis"},{"last_name":"Bettler","full_name":"Bettler, Bernhard","first_name":"Bernhard"},{"full_name":"Wickman, Kevin","last_name":"Wickman","first_name":"Kevin"},{"first_name":"Masahiko","last_name":"Watanabe","full_name":"Watanabe, Masahiko"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Yugo","last_name":"Fukazawa","full_name":"Fukazawa, Yugo"}],"title":"Differential association of GABAB receptors with their effector ion channels in Purkinje cells","oa":1,"publisher":"Springer","quality_controlled":"1","year":"2018","has_accepted_license":"1","isi":1,"publication":"Brain Structure and Function","day":"01","page":"1565 - 1587","date_created":"2018-12-11T11:47:29Z","doi":"10.1007/s00429-017-1568-y","date_published":"2018-04-01T00:00:00Z"},{"date_created":"2018-12-11T11:44:12Z","date_published":"2018-11-02T00:00:00Z","doi":"10.1038/s41467-018-06899-3","year":"2018","has_accepted_license":"1","isi":1,"publication":"Nature Communications","day":"02","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","acknowledgement":"This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 692692) and the Fond zur Förderung der Wissenschaftlichen Forschung (Z 312-B27, Wittgenstein award), both to P.J..","article_processing_charge":"No","external_id":{"isi":["000449069700009"]},"author":[{"first_name":"Claudia ","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4710-2082","full_name":"Espinoza Martinez, Claudia ","last_name":"Espinoza Martinez"},{"first_name":"José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","last_name":"Guzmán","full_name":"Guzmán, José","orcid":"0000-0003-2209-5242"},{"full_name":"Zhang, Xiaomin","last_name":"Zhang","first_name":"Xiaomin","id":"423EC9C2-F248-11E8-B48F-1D18A9856A87"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"}],"publist_id":"8034","title":"Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus","citation":{"chicago":"Espinoza Martinez, Claudia , José Guzmán, Xiaomin Zhang, and Peter M Jonas. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-018-06899-3.","ista":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. 2018. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. 9(1), 4605.","mla":"Espinoza Martinez, Claudia, et al. “Parvalbumin+ Interneurons Obey Unique Connectivity Rules and Establish a Powerful Lateral-Inhibition Microcircuit in Dentate Gyrus.” Nature Communications, vol. 9, no. 1, 4605, Nature Publishing Group, 2018, doi:10.1038/s41467-018-06899-3.","ama":"Espinoza Martinez C, Guzmán J, Zhang X, Jonas PM. Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-06899-3","apa":"Espinoza Martinez, C., Guzmán, J., Zhang, X., & Jonas, P. M. (2018). Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-018-06899-3","short":"C. Espinoza Martinez, J. Guzmán, X. Zhang, P.M. Jonas, Nature Communications 9 (2018).","ieee":"C. Espinoza Martinez, J. Guzmán, X. Zhang, and P. M. Jonas, “Parvalbumin+ interneurons obey unique connectivity rules and establish a powerful lateral-inhibition microcircuit in dentate gyrus,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","grant_number":"692692"},{"grant_number":"Z00312","name":"The Wittgenstein Prize","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"article_number":"4605","ec_funded":1,"related_material":{"link":[{"url":"https://ist.ac.at/en/news/lateral-inhibition-keeps-similar-memories-apart/","relation":"press_release","description":"News on IST Homepage"}],"record":[{"status":"public","id":"6363","relation":"dissertation_contains"}]},"volume":9,"issue":"1","publication_status":"published","language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-17T15:41:57Z","file_name":"2018_NatureComm_Espinoza.pdf","creator":"dernst","date_updated":"2020-07-14T12:45:28Z","file_size":4651930,"file_id":"5715","checksum":"9fe2a63bd95a5067d896c087d07998f3","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"scopus_import":"1","intvolume":" 9","month":"11","abstract":[{"text":"Parvalbumin-positive (PV+) GABAergic interneurons in hippocampal microcircuits are thought to play a key role in several higher network functions, such as feedforward and feedback inhibition, network oscillations, and pattern separation. Fast lateral inhibition mediated by GABAergic interneurons may implement a winner-takes-all mechanism in the hippocampal input layer. However, it is not clear whether the functional connectivity rules of granule cells (GCs) and interneurons in the dentate gyrus are consistent with such a mechanism. Using simultaneous patch-clamp recordings from up to seven GCs and up to four PV+ interneurons in the dentate gyrus, we find that connectivity is structured in space, synapse-specific, and enriched in specific disynaptic motifs. In contrast to the neocortex, lateral inhibition in the dentate gyrus (in which a GC inhibits neighboring GCs via a PV+ interneuron) is ~ 10-times more abundant than recurrent inhibition (in which a GC inhibits itself). Thus, unique connectivity rules may enable the dentate gyrus to perform specific higher-order computations","lang":"eng"}],"oa_version":"Published Version","department":[{"_id":"PeJo"}],"file_date_updated":"2020-07-14T12:45:28Z","date_updated":"2024-03-27T23:30:31Z","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"21"},{"date_updated":"2024-03-27T23:30:33Z","ddc":["000"],"file_date_updated":"2020-07-14T12:47:34Z","department":[{"_id":"KrCh"}],"_id":"66","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2018-09-04","end_date":"2018-09-07","location":"Beijing, China"},"type":"conference","status":"public","publication_status":"published","publication_identifier":{"isbn":["978-3-95977-087-3"]},"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-17T12:08:00Z","file_name":"2018_CONCUR_Chatterjee.pdf","creator":"dernst","date_updated":"2020-07-14T12:47:34Z","file_size":1078309,"file_id":"5696","checksum":"68a055b1aaa241cc38375083cf832a7d","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"ec_funded":1,"volume":118,"related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"abstract":[{"lang":"eng","text":"Crypto-currencies are digital assets designed to work as a medium of exchange, e.g., Bitcoin, but they are susceptible to attacks (dishonest behavior of participants). A framework for the analysis of attacks in crypto-currencies requires (a) modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior; (b) concurrent interactions between participants; and (c) analysis of long-term monetary gains. Traditional game-theoretic approaches for the analysis of security protocols consider either qualitative temporal properties such as safety and termination, or the very special class of one-shot (stateless) games. However, to analyze general attacks on protocols for crypto-currencies, both stateful analysis and quantitative objectives are necessary. In this work our main contributions are as follows: (a) we show how a class of concurrent mean-payo games, namely ergodic games, can model various attacks that arise naturally in crypto-currencies; (b) we present the first practical implementation of algorithms for ergodic games that scales to model realistic problems for crypto-currencies; and (c) we present experimental results showing that our framework can handle games with thousands of states and millions of transitions."}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":" 118","month":"09","citation":{"ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.11","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Velner, Y. (2018). Ergodic mean-payoff games for the analysis of attacks in crypto-currencies (Vol. 118). Presented at the CONCUR: Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","mla":"Chatterjee, Krishnendu, et al. Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. Vol. 118, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.11.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Velner Y. 2018. Ergodic mean-payoff games for the analysis of attacks in crypto-currencies. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 118, 11.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1806.03108"]},"article_processing_charge":"No","publist_id":"7988","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yaron","last_name":"Velner","full_name":"Velner, Yaron"}],"title":"Ergodic mean-payoff games for the analysis of attacks in crypto-currencies","article_number":"11","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"year":"2018","has_accepted_license":"1","day":"01","date_created":"2018-12-11T11:44:27Z","date_published":"2018-09-01T00:00:00Z","doi":"10.4230/LIPIcs.CONCUR.2018.11","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1"},{"status":"public","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"ESOP: European Symposium on Programming","end_date":"2018-04-19","location":"Thessaloniki, Greece","start_date":"2018-04-16"},"_id":"311","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:00Z","ddc":["000"],"date_updated":"2024-03-27T23:30:33Z","month":"04","intvolume":" 10801","alternative_title":["LNCS"],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts."}],"related_material":{"record":[{"status":"public","id":"8934","relation":"dissertation_contains"}]},"volume":10801,"ec_funded":1,"file":[{"file_name":"2018_ESOP_Chatterjee.pdf","date_created":"2018-12-17T15:45:49Z","file_size":1394993,"date_updated":"2020-07-14T12:46:00Z","creator":"dernst","file_id":"5716","checksum":"9c8a8338c571903b599b6ca93abd2cce","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_status":"published","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"title":"Quantitative analysis of smart contracts","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"publist_id":"7554","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. https://doi.org/10.1007/978-3-319-89884-1_26.","apa":"Chatterjee, K., Goharshady, A. K., & Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89884-1_26","ama":"Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:10.1007/978-3-319-89884-1_26","short":"K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.","ieee":"K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.","mla":"Chatterjee, Krishnendu, et al. Quantitative Analysis of Smart Contracts. Vol. 10801, Springer, 2018, pp. 739–67, doi:10.1007/978-3-319-89884-1_26."},"publisher":"Springer","quality_controlled":"1","oa":1,"acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).","doi":"10.1007/978-3-319-89884-1_26","date_published":"2018-04-01T00:00:00Z","date_created":"2018-12-11T11:45:45Z","page":"739 - 767","day":"01","has_accepted_license":"1","year":"2018"},{"_id":"6340","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"conference":{"start_date":"2018-07-30","location":"Halifax, Canada","end_date":"2018-08-03","name":"IEEE International Conference on Blockchain"},"type":"conference","status":"public","date_updated":"2024-03-27T23:30:34Z","ddc":["000"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:27Z","abstract":[{"text":"We present a secure approach for maintaining andreporting credit history records on the Blockchain. Our ap-proach removes third-parties such as credit reporting agen-cies from the lending process and replaces them with smartcontracts. This allows customers to interact directly with thelenders or banks while ensuring the integrity, unmalleabilityand privacy of their credit data. Additionally, each customerhas full control over complete or selective disclosure of hercredit records, eliminating the risk of privacy violations or databreaches. Moreover, our approach provides strong guaranteesfor the lenders as well. A lender can check both correctness andcompleteness of the credit data disclosed to her. This is the firstapproach that can perform all credit reporting tasks withouta central authority or changing the financial mechanisms*.","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","month":"09","publication_status":"published","publication_identifier":{"isbn":["978-1-5386-7975-3 "]},"language":[{"iso":"eng"}],"file":[{"creator":"akafshda","date_updated":"2020-07-14T12:47:27Z","file_size":624338,"date_created":"2019-04-18T10:36:39Z","file_name":"blockchain2018.pdf","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"b25c9bb7cf6e7e6634e692d26d41ead8","file_id":"6341"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","ec_funded":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"citation":{"short":"A.K. Goharshady, A. Behrouz, K. Chatterjee, in:, Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–1348.","ieee":"A. K. Goharshady, A. Behrouz, and K. Chatterjee, “Secure Credit Reporting on the Blockchain,” in Proceedings of the IEEE International Conference on Blockchain, Halifax, Canada, 2018, pp. 1343–1348.","ama":"Goharshady AK, Behrouz A, Chatterjee K. Secure Credit Reporting on the Blockchain. In: Proceedings of the IEEE International Conference on Blockchain. IEEE; 2018:1343-1348. doi:10.1109/Cybermatics_2018.2018.00231","apa":"Goharshady, A. K., Behrouz, A., & Chatterjee, K. (2018). Secure Credit Reporting on the Blockchain. In Proceedings of the IEEE International Conference on Blockchain (pp. 1343–1348). Halifax, Canada: IEEE. https://doi.org/10.1109/Cybermatics_2018.2018.00231","mla":"Goharshady, Amir Kafshdar, et al. “Secure Credit Reporting on the Blockchain.” Proceedings of the IEEE International Conference on Blockchain, IEEE, 2018, pp. 1343–48, doi:10.1109/Cybermatics_2018.2018.00231.","ista":"Goharshady AK, Behrouz A, Chatterjee K. 2018. Secure Credit Reporting on the Blockchain. Proceedings of the IEEE International Conference on Blockchain. IEEE International Conference on Blockchain, 1343–1348.","chicago":"Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.” In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018. https://doi.org/10.1109/Cybermatics_2018.2018.00231."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000481634500196"],"arxiv":["1805.09104"]},"article_processing_charge":"No","author":[{"first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","orcid":"0000-0003-1702-6584","full_name":"Goharshady, Amir Kafshdar"},{"full_name":"Behrouz, Ali","last_name":"Behrouz","first_name":"Ali"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"}],"title":"Secure Credit Reporting on the Blockchain","oa":1,"publisher":"IEEE","quality_controlled":"1","year":"2018","isi":1,"has_accepted_license":"1","publication":"Proceedings of the IEEE International Conference on Blockchain","day":"01","page":"1343-1348","date_created":"2019-04-18T10:37:35Z","date_published":"2018-09-01T00:00:00Z","doi":"10.1109/Cybermatics_2018.2018.00231"},{"_id":"6009","status":"public","type":"journal_article","date_updated":"2024-03-27T23:30:34Z","department":[{"_id":"KrCh"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We study algorithmic questions wrt algebraic path properties in concurrent systems, where the transitions of the system are labeled from a complete, closed semiring. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks.\r\n"}],"month":"08","intvolume":" 40","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1510.07565","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0164-0925"]},"publication_status":"published","issue":"3","related_material":{"record":[{"relation":"earlier_version","id":"1437","status":"public"},{"relation":"earlier_version","status":"public","id":"5441"},{"status":"public","id":"5442","relation":"earlier_version"},{"relation":"dissertation_contains","id":"8934","status":"public"}]},"volume":40,"ec_funded":1,"article_number":"9","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257.","ista":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2018. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 40(3), 9.","mla":"Chatterjee, Krishnendu, et al. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3, 9, Association for Computing Machinery (ACM), 2018, doi:10.1145/3210257.","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery (ACM), 2018.","short":"K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).","ama":"Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. 2018;40(3). doi:10.1145/3210257","apa":"Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A. (2018). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM). https://doi.org/10.1145/3210257"},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"}],"article_processing_charge":"No","external_id":{"isi":["000444694800001"],"arxiv":["1510.07565"]},"publisher":"Association for Computing Machinery (ACM)","quality_controlled":"1","oa":1,"day":"01","publication":"ACM Transactions on Programming Languages and Systems","isi":1,"year":"2018","doi":"10.1145/3210257","date_published":"2018-08-01T00:00:00Z","date_created":"2019-02-14T14:31:52Z"},{"oa":1,"quality_controlled":"1","publisher":"IJCAI","publication":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","day":"17","year":"2018","isi":1,"date_created":"2019-02-13T13:26:27Z","date_published":"2018-07-17T00:00:00Z","doi":"10.24963/ijcai.2018/653","page":"4700-4707","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Chatterjee K, Fu H, Goharshady AK, Okati N. 2018. Computational approaches for stochastic shortest path on succinct MDPs. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4700–4707.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, N. Okati, in:, Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI, 2018, pp. 4700–4707.","ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and N. Okati, “Computational approaches for stochastic shortest path on succinct MDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4700–4707.","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., & Okati, N. (2018). Computational approaches for stochastic shortest path on succinct MDPs. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (Vol. 2018, pp. 4700–4707). Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/653","ama":"Chatterjee K, Fu H, Goharshady AK, Okati N. Computational approaches for stochastic shortest path on succinct MDPs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. Vol 2018. IJCAI; 2018:4700-4707. doi:10.24963/ijcai.2018/653","mla":"Chatterjee, Krishnendu, et al. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, vol. 2018, IJCAI, 2018, pp. 4700–07, doi:10.24963/ijcai.2018/653."},"title":"Computational approaches for stochastic shortest path on succinct MDPs","external_id":{"arxiv":["1804.08984"],"isi":["000764175404118"]},"article_processing_charge":"No","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Fu, Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongfei"},{"full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584","last_name":"Goharshady","first_name":"Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Okati","full_name":"Okati, Nastaran","first_name":"Nastaran"}],"oa_version":"Preprint","abstract":[{"text":"We consider the stochastic shortest path (SSP)problem for succinct Markov decision processes(MDPs), where the MDP consists of a set of vari-ables, and a set of nondeterministic rules that up-date the variables. First, we show that several ex-amples from the AI literature can be modeled assuccinct MDPs. Then we present computationalapproaches for upper and lower bounds for theSSP problem: (a) for computing upper bounds, ourmethod is polynomial-time in the implicit descrip-tion of the MDP; (b) for lower bounds, we present apolynomial-time (in the size of the implicit descrip-tion) reduction to quadratic programming. Our ap-proach is applicable even to infinite-state MDPs.Finally, we present experimental results to demon-strate the effectiveness of our approach on severalclassical examples from the AI literature.","lang":"eng"}],"intvolume":" 2018","month":"07","main_file_link":[{"url":"https://arxiv.org/abs/1804.08984","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-099924112-7"],"issn":["10450823"]},"ec_funded":1,"volume":2018,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"_id":"5977","status":"public","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","end_date":"2018-07-19","location":"Stockholm, Sweden"},"type":"conference","date_updated":"2024-03-27T23:30:34Z","department":[{"_id":"KrCh"}]},{"day":"01","publication":"Flow Turbulence and Combustion","isi":1,"has_accepted_license":"1","year":"2018","doi":"10.1007/s10494-018-9896-4","date_published":"2018-01-01T00:00:00Z","date_created":"2018-12-11T11:46:23Z","page":"919 - 942","quality_controlled":"1","publisher":"Springer","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Kühnen J, Scarselli D, Schaner M, Hof B. 2018. Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. 100(4), 919–942.","chicago":"Kühnen, Jakob, Davide Scarselli, Markus Schaner, and Björn Hof. “Relaminarization by Steady Modification of the Streamwise Velocity Profile in a Pipe.” Flow Turbulence and Combustion. Springer, 2018. https://doi.org/10.1007/s10494-018-9896-4.","ama":"Kühnen J, Scarselli D, Schaner M, Hof B. Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. 2018;100(4):919-942. doi:10.1007/s10494-018-9896-4","apa":"Kühnen, J., Scarselli, D., Schaner, M., & Hof, B. (2018). Relaminarization by steady modification of the streamwise velocity profile in a pipe. Flow Turbulence and Combustion. Springer. https://doi.org/10.1007/s10494-018-9896-4","ieee":"J. Kühnen, D. Scarselli, M. Schaner, and B. Hof, “Relaminarization by steady modification of the streamwise velocity profile in a pipe,” Flow Turbulence and Combustion, vol. 100, no. 4. Springer, pp. 919–942, 2018.","short":"J. Kühnen, D. Scarselli, M. Schaner, B. Hof, Flow Turbulence and Combustion 100 (2018) 919–942.","mla":"Kühnen, Jakob, et al. “Relaminarization by Steady Modification of the Streamwise Velocity Profile in a Pipe.” Flow Turbulence and Combustion, vol. 100, no. 4, Springer, 2018, pp. 919–42, doi:10.1007/s10494-018-9896-4."},"title":"Relaminarization by steady modification of the streamwise velocity profile in a pipe","author":[{"id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","first_name":"Jakob","full_name":"Kühnen, Jakob","orcid":"0000-0003-4312-0179","last_name":"Kühnen"},{"first_name":"Davide","id":"40315C30-F248-11E8-B48F-1D18A9856A87","last_name":"Scarselli","full_name":"Scarselli, Davide","orcid":"0000-0001-5227-4271"},{"first_name":"Markus","id":"316CE034-F248-11E8-B48F-1D18A9856A87","last_name":"Schaner","full_name":"Schaner, Markus"},{"orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7401","article_processing_charge":"Yes (via OA deal)","external_id":{"isi":["000433113900004"]},"project":[{"_id":"25152F3A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"306589","name":"Decoding the complexity of turbulence at its origin"}],"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"d7c0bade150faabca150b0a9986e60ca","file_id":"5717","creator":"dernst","date_updated":"2020-07-14T12:46:25Z","file_size":2210020,"date_created":"2018-12-17T15:52:37Z","file_name":"2018_FlowTurbulenceCombust_Kuehnen.pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":100,"related_material":{"record":[{"relation":"dissertation_contains","id":"7258","status":"public"}]},"issue":"4","ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We show that a rather simple, steady modification of the streamwise velocity profile in a pipe can lead to a complete collapse of turbulence and the flow fully relaminarizes. Two different devices, a stationary obstacle (inset) and a device which injects fluid through an annular gap close to the wall, are used to control the flow. Both devices modify the streamwise velocity profile such that the flow in the center of the pipe is decelerated and the flow in the near wall region is accelerated. We present measurements with stereoscopic particle image velocimetry to investigate and capture the development of the relaminarizing flow downstream these devices and the specific circumstances responsible for relaminarization. We find total relaminarization up to Reynolds numbers of 6000, where the skin friction in the far downstream distance is reduced by a factor of 3.4 due to relaminarization. In a smooth straight pipe the flow remains completely laminar downstream of the control. Furthermore, we show that transient (temporary) relaminarization in a spatially confined region right downstream the devices occurs also at much higher Reynolds numbers, accompanied by a significant local skin friction drag reduction. The underlying physical mechanism of relaminarization is attributed to a weakening of the near-wall turbulence production cycle."}],"month":"01","intvolume":" 100","scopus_import":"1","ddc":["530"],"date_updated":"2024-03-27T23:30:36Z","file_date_updated":"2020-07-14T12:46:25Z","department":[{"_id":"BjHo"}],"_id":"422","status":"public","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)"}},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.06543"}],"scopus_import":"1","intvolume":" 14","month":"01","abstract":[{"text":"Turbulence is the major cause of friction losses in transport processes and it is responsible for a drastic drag increase in flows over bounding surfaces. While much effort is invested into developing ways to control and reduce turbulence intensities, so far no methods exist to altogether eliminate turbulence if velocities are sufficiently large. We demonstrate for pipe flow that appropriate distortions to the velocity profile lead to a complete collapse of turbulence and subsequently friction losses are reduced by as much as 90%. Counterintuitively, the return to laminar motion is accomplished by initially increasing turbulence intensities or by transiently amplifying wall shear. Since neither the Reynolds number nor the shear stresses decrease (the latter often increase), these measures are not indicative of turbulence collapse. Instead, an amplification mechanism measuring the interaction between eddies and the mean shear is found to set a threshold below which turbulence is suppressed beyond recovery.","lang":"eng"}],"oa_version":"Preprint","ec_funded":1,"volume":14,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12726"},{"status":"public","id":"14530","relation":"dissertation_contains"},{"relation":"dissertation_contains","id":"7258","status":"public"}]},"publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","status":"public","_id":"461","department":[{"_id":"BjHo"}],"date_updated":"2024-03-27T23:30:36Z","oa":1,"quality_controlled":"1","publisher":"Nature Publishing Group","acknowledgement":"We acknowledge the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement 306589, the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 737549) and the Deutsche Forschungsgemeinschaft (Project No. FOR 1182) for financial support. We thank our technician P. Maier for providing highly valuable ideas and greatly supporting us in all technical aspects. We thank M. Schaner for technical drawings, construction and design. We thank M. Schwegel for a Matlab code to post-process experimental data.","page":"386-390","date_created":"2018-12-11T11:46:36Z","doi":"10.1038/s41567-017-0018-3","date_published":"2018-01-08T00:00:00Z","year":"2018","isi":1,"publication":"Nature Physics","day":"08","project":[{"_id":"25152F3A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Decoding the complexity of turbulence at its origin","grant_number":"306589"},{"grant_number":"737549","name":"Eliminating turbulence in oil pipelines","_id":"25104D44-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"external_id":{"isi":["000429434100020"]},"article_processing_charge":"No","author":[{"last_name":"Kühnen","full_name":"Kühnen, Jakob","orcid":"0000-0003-4312-0179","first_name":"Jakob","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Song","full_name":"Song, Baofang","first_name":"Baofang"},{"id":"40315C30-F248-11E8-B48F-1D18A9856A87","first_name":"Davide","last_name":"Scarselli","full_name":"Scarselli, Davide","orcid":"0000-0001-5227-4271"},{"last_name":"Budanur","orcid":"0000-0003-0423-5010","full_name":"Budanur, Nazmi B","first_name":"Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4844-6311","full_name":"Riedl, Michael","last_name":"Riedl","first_name":"Michael","id":"3BE60946-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Willis, Ashley","last_name":"Willis","first_name":"Ashley"},{"last_name":"Avila","full_name":"Avila, Marc","first_name":"Marc"},{"full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7360","title":"Destabilizing turbulence in pipe flow","citation":{"short":"J. Kühnen, B. Song, D. Scarselli, N.B. Budanur, M. Riedl, A. Willis, M. Avila, B. Hof, Nature Physics 14 (2018) 386–390.","ieee":"J. Kühnen et al., “Destabilizing turbulence in pipe flow,” Nature Physics, vol. 14. Nature Publishing Group, pp. 386–390, 2018.","apa":"Kühnen, J., Song, B., Scarselli, D., Budanur, N. B., Riedl, M., Willis, A., … Hof, B. (2018). Destabilizing turbulence in pipe flow. Nature Physics. Nature Publishing Group. https://doi.org/10.1038/s41567-017-0018-3","ama":"Kühnen J, Song B, Scarselli D, et al. Destabilizing turbulence in pipe flow. Nature Physics. 2018;14:386-390. doi:10.1038/s41567-017-0018-3","mla":"Kühnen, Jakob, et al. “Destabilizing Turbulence in Pipe Flow.” Nature Physics, vol. 14, Nature Publishing Group, 2018, pp. 386–90, doi:10.1038/s41567-017-0018-3.","ista":"Kühnen J, Song B, Scarselli D, Budanur NB, Riedl M, Willis A, Avila M, Hof B. 2018. Destabilizing turbulence in pipe flow. Nature Physics. 14, 386–390.","chicago":"Kühnen, Jakob, Baofang Song, Davide Scarselli, Nazmi B Budanur, Michael Riedl, Ashley Willis, Marc Avila, and Björn Hof. “Destabilizing Turbulence in Pipe Flow.” Nature Physics. Nature Publishing Group, 2018. https://doi.org/10.1038/s41567-017-0018-3."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"},{"abstract":[{"text":"Auxin is unique among plant hormones due to its directional transport that is mediated by the polarly distributed PIN auxin transporters at the plasma membrane. The canalization hypothesis proposes that the auxin feedback on its polar flow is a crucial, plant-specific mechanism mediating multiple self-organizing developmental processes. Here, we used the auxin effect on the PIN polar localization in Arabidopsis thaliana roots as a proxy for the auxin feedback on the PIN polarity during canalization. We performed microarray experiments to find regulators of this process that act downstream of auxin. We identified genes that were transcriptionally regulated by auxin in an AXR3/IAA17- and ARF7/ARF19-dependent manner. Besides the known components of the PIN polarity, such as PID and PIP5K kinases, a number of potential new regulators were detected, among which the WRKY23 transcription factor, which was characterized in more detail. Gain- and loss-of-function mutants confirmed a role for WRKY23 in mediating the auxin effect on the PIN polarity. Accordingly, processes requiring auxin-mediated PIN polarity rearrangements, such as vascular tissue development during leaf venation, showed a higher WRKY23 expression and required the WRKY23 activity. Our results provide initial insights into the auxin transcriptional network acting upstream of PIN polarization and, potentially, canalization-mediated plant development.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 14","month":"01","publication_status":"published","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"4843","checksum":"0276d66788ec076f4924164a39e6a712","date_updated":"2020-07-14T12:46:30Z","file_size":24709062,"creator":"system","date_created":"2018-12-12T10:10:52Z","file_name":"IST-2018-967-v1+1_journal.pgen.1007177.pdf"}],"ec_funded":1,"volume":14,"related_material":{"record":[{"status":"public","id":"1127","relation":"dissertation_contains"},{"status":"public","id":"7172","relation":"dissertation_contains"},{"status":"public","id":"8822","relation":"dissertation_contains"}]},"issue":"1","_id":"449","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","pubrep_id":"967","status":"public","date_updated":"2024-03-27T23:30:37Z","ddc":["581"],"department":[{"_id":"JiFr"}],"file_date_updated":"2020-07-14T12:46:30Z","oa":1,"quality_controlled":"1","publisher":"Public Library of Science","year":"2018","has_accepted_license":"1","isi":1,"publication":"PLoS Genetics","day":"29","date_created":"2018-12-11T11:46:32Z","date_published":"2018-01-29T00:00:00Z","doi":"10.1371/journal.pgen.1007177","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants","grant_number":"282300"}],"citation":{"chicago":"Prat, Tomas, Jakub Hajny, Wim Grunewald, Mina K Vasileva, Gergely Molnar, Ricardo Tejos, Markus Schmid, Michael Sauer, and Jiří Friml. “WRKY23 Is a Component of the Transcriptional Network Mediating Auxin Feedback on PIN Polarity.” PLoS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007177.","ista":"Prat T, Hajny J, Grunewald W, Vasileva MK, Molnar G, Tejos R, Schmid M, Sauer M, Friml J. 2018. WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. PLoS Genetics. 14(1).","mla":"Prat, Tomas, et al. “WRKY23 Is a Component of the Transcriptional Network Mediating Auxin Feedback on PIN Polarity.” PLoS Genetics, vol. 14, no. 1, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007177.","ieee":"T. Prat et al., “WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity,” PLoS Genetics, vol. 14, no. 1. Public Library of Science, 2018.","short":"T. Prat, J. Hajny, W. Grunewald, M.K. Vasileva, G. Molnar, R. Tejos, M. Schmid, M. Sauer, J. Friml, PLoS Genetics 14 (2018).","ama":"Prat T, Hajny J, Grunewald W, et al. WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. PLoS Genetics. 2018;14(1). doi:10.1371/journal.pgen.1007177","apa":"Prat, T., Hajny, J., Grunewald, W., Vasileva, M. K., Molnar, G., Tejos, R., … Friml, J. (2018). WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007177"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","external_id":{"isi":["000423718600034"]},"article_processing_charge":"Yes","author":[{"full_name":"Prat, Tomas","last_name":"Prat","id":"3DA3BFEE-F248-11E8-B48F-1D18A9856A87","first_name":"Tomas"},{"full_name":"Hajny, Jakub","orcid":"0000-0003-2140-7195","last_name":"Hajny","first_name":"Jakub","id":"4800CC20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Wim","full_name":"Grunewald, Wim","last_name":"Grunewald"},{"last_name":"Vasileva","full_name":"Vasileva, Mina K","id":"3407EB18-F248-11E8-B48F-1D18A9856A87","first_name":"Mina K"},{"id":"34F1AF46-F248-11E8-B48F-1D18A9856A87","first_name":"Gergely","last_name":"Molnar","full_name":"Molnar, Gergely"},{"last_name":"Tejos","full_name":"Tejos, Ricardo","first_name":"Ricardo"},{"full_name":"Schmid, Markus","last_name":"Schmid","first_name":"Markus"},{"first_name":"Michael","last_name":"Sauer","full_name":"Sauer, Michael"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"publist_id":"7373","title":"WRKY23 is a component of the transcriptional network mediating auxin feedback on PIN polarity"},{"year":"2018","has_accepted_license":"1","isi":1,"publication":"Scientific Reports","day":"06","date_created":"2018-12-11T11:45:06Z","date_published":"2018-07-06T00:00:00Z","doi":"10.1038/s41598-018-28188-1","oa":1,"publisher":"Springer","quality_controlled":"1","citation":{"mla":"Grones, Peter, et al. “PID/WAG-Mediated Phosphorylation of the Arabidopsis PIN3 Auxin Transporter Mediates Polarity Switches during Gravitropism.” Scientific Reports, vol. 8, no. 1, 10279, Springer, 2018, doi:10.1038/s41598-018-28188-1.","short":"P. Grones, M.F. Abas, J. Hajny, A. Jones, S. Waidmann, J. Kleine Vehn, J. Friml, Scientific Reports 8 (2018).","ieee":"P. Grones et al., “PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism,” Scientific Reports, vol. 8, no. 1. Springer, 2018.","apa":"Grones, P., Abas, M. F., Hajny, J., Jones, A., Waidmann, S., Kleine Vehn, J., & Friml, J. (2018). PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism. Scientific Reports. Springer. https://doi.org/10.1038/s41598-018-28188-1","ama":"Grones P, Abas MF, Hajny J, et al. PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism. Scientific Reports. 2018;8(1). doi:10.1038/s41598-018-28188-1","chicago":"Grones, Peter, Melinda F Abas, Jakub Hajny, Angharad Jones, Sascha Waidmann, Jürgen Kleine Vehn, and Jiří Friml. “PID/WAG-Mediated Phosphorylation of the Arabidopsis PIN3 Auxin Transporter Mediates Polarity Switches during Gravitropism.” Scientific Reports. Springer, 2018. https://doi.org/10.1038/s41598-018-28188-1.","ista":"Grones P, Abas MF, Hajny J, Jones A, Waidmann S, Kleine Vehn J, Friml J. 2018. PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism. Scientific Reports. 8(1), 10279."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000437673200053"]},"publist_id":"7729","author":[{"first_name":"Peter","id":"399876EC-F248-11E8-B48F-1D18A9856A87","full_name":"Grones, Peter","last_name":"Grones"},{"last_name":"Abas","full_name":"Abas, Melinda F","id":"3CFB3B1C-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda F"},{"first_name":"Jakub","id":"4800CC20-F248-11E8-B48F-1D18A9856A87","full_name":"Hajny, Jakub","orcid":"0000-0003-2140-7195","last_name":"Hajny"},{"full_name":"Jones, Angharad","last_name":"Jones","first_name":"Angharad"},{"first_name":"Sascha","last_name":"Waidmann","full_name":"Waidmann, Sascha"},{"first_name":"Jürgen","last_name":"Kleine Vehn","full_name":"Kleine Vehn, Jürgen"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","last_name":"Friml"}],"title":"PID/WAG-mediated phosphorylation of the Arabidopsis PIN3 auxin transporter mediates polarity switches during gravitropism","article_number":"10279","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"282300","name":"Polarity and subcellular dynamics in plants"},{"grant_number":"742985","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","language":[{"iso":"eng"}],"file":[{"checksum":"266b03f4fb8198e83141617aaa99dcab","file_id":"5714","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_ScientificReports_Grones.pdf","date_created":"2018-12-17T15:38:56Z","file_size":2413876,"date_updated":"2020-07-14T12:45:20Z","creator":"dernst"}],"ec_funded":1,"volume":8,"issue":"1","related_material":{"record":[{"id":"8822","status":"public","relation":"dissertation_contains"}]},"abstract":[{"lang":"eng","text":"Intercellular distribution of the plant hormone auxin largely depends on the polar subcellular distribution of the plasma membrane PIN-FORMED (PIN) auxin transporters. PIN polarity switches in response to different developmental and environmental signals have been shown to redirect auxin fluxes mediating certain developmental responses. PIN phosphorylation at different sites and by different kinases is crucial for PIN function. Here we investigate the role of PIN phosphorylation during gravitropic response. Loss- and gain-of-function mutants in PINOID and related kinases but not in D6PK kinase as well as mutations mimicking constitutive dephosphorylated or phosphorylated status of two clusters of predicted phosphorylation sites partially disrupted PIN3 phosphorylation and caused defects in gravitropic bending in roots and hypocotyls. In particular, they impacted PIN3 polarity rearrangements in response to gravity and during feed-back regulation by auxin itself. Thus PIN phosphorylation, besides regulating transport activity and apical-basal targeting, is also important for the rapid polarity switches in response to environmental and endogenous signals."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 8","month":"07","date_updated":"2024-03-27T23:30:37Z","ddc":["581"],"file_date_updated":"2020-07-14T12:45:20Z","department":[{"_id":"JiFr"},{"_id":"EvBe"}],"_id":"191","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","status":"public"},{"title":"Transporters and mechanisms of hormone transport in arabidopsis","external_id":{"isi":["000453657800006"]},"article_processing_charge":"No","author":[{"last_name":"Abualia","orcid":"0000-0002-9357-9415","full_name":"Abualia, Rashed","id":"4827E134-F248-11E8-B48F-1D18A9856A87","first_name":"Rashed"},{"last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Benoît","full_name":"Lacombe, Benoît","last_name":"Lacombe"}],"publist_id":"8007","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Abualia, Rashed, et al. “Transporters and Mechanisms of Hormone Transport in Arabidopsis.” Advances in Botanical Research, vol. 87, Elsevier, 2018, pp. 115–38, doi:10.1016/bs.abr.2018.09.007.","ama":"Abualia R, Benková E, Lacombe B. Transporters and mechanisms of hormone transport in arabidopsis. Advances in Botanical Research. 2018;87:115-138. doi:10.1016/bs.abr.2018.09.007","apa":"Abualia, R., Benková, E., & Lacombe, B. (2018). Transporters and mechanisms of hormone transport in arabidopsis. Advances in Botanical Research. Elsevier. https://doi.org/10.1016/bs.abr.2018.09.007","ieee":"R. Abualia, E. Benková, and B. Lacombe, “Transporters and mechanisms of hormone transport in arabidopsis,” Advances in Botanical Research, vol. 87. Elsevier, pp. 115–138, 2018.","short":"R. Abualia, E. Benková, B. Lacombe, Advances in Botanical Research 87 (2018) 115–138.","chicago":"Abualia, Rashed, Eva Benková, and Benoît Lacombe. “Transporters and Mechanisms of Hormone Transport in Arabidopsis.” Advances in Botanical Research. Elsevier, 2018. https://doi.org/10.1016/bs.abr.2018.09.007.","ista":"Abualia R, Benková E, Lacombe B. 2018. Transporters and mechanisms of hormone transport in arabidopsis. Advances in Botanical Research. 87, 115–138."},"publisher":"Elsevier","quality_controlled":"1","date_created":"2018-12-11T11:44:20Z","doi":"10.1016/bs.abr.2018.09.007","date_published":"2018-01-01T00:00:00Z","page":"115 - 138","publication":"Advances in Botanical Research","day":"01","year":"2018","isi":1,"status":"public","type":"journal_article","_id":"47","department":[{"_id":"EvBe"}],"date_updated":"2024-03-27T23:30:39Z","intvolume":" 87","month":"01","scopus_import":"1","oa_version":"None","abstract":[{"lang":"eng","text":"Plant hormones as signalling molecules play an essential role in the control of plant growth and development. Typically, sites of hormonal action are usually distant from the site of biosynthesis thus relying on efficient transport mechanisms. Over the last decades, molecular identification of proteins and protein complexes involved in hormonal transport has started. Advanced screens for genes involved in hormonal transport in combination with transport assays using heterologous systems such as yeast, insect, or tobacco BY2 cells or Xenopus oocytes provided important insights into mechanisms underlying distribution of hormones in plant body and led to identification of principal transporters for each hormone. This review gives a short overview of the mechanisms of hormonal transport and transporters identified in Arabidopsis thaliana."}],"volume":87,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10303"}]},"language":[{"iso":"eng"}],"publication_status":"published"},{"page":"606 - 616","date_created":"2018-12-11T11:44:10Z","doi":"10.1038/s41590-018-0109-z","date_published":"2018-05-18T00:00:00Z","year":"2018","isi":1,"publication":"Nature Immunology","day":"18","oa":1,"publisher":"Nature Publishing Group","quality_controlled":"1","acknowledgement":"This work was funded by grants from the European Research Council (ERC StG 281556 and CoG 724373) and the Austrian Science Foundation (FWF) to M.S. and by Swiss National Foundation (SNF) project grants 31003A_135649, 31003A_153457 and CR23I3_156234 to J.V.S. F.G. received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 747687, and J.R. was funded by an EMBO long-term fellowship (ALTF 1396-2014).","article_processing_charge":"No","external_id":{"pmid":["29777221"],"isi":["000433041500026"]},"publist_id":"8040","author":[{"first_name":"Miroslav","id":"4167FE56-F248-11E8-B48F-1D18A9856A87","full_name":"Hons, Miroslav","orcid":"0000-0002-6625-3348","last_name":"Hons"},{"first_name":"Aglaja","id":"31DAC7B6-F248-11E8-B48F-1D18A9856A87","last_name":"Kopf","full_name":"Kopf, Aglaja","orcid":"0000-0002-2187-6656"},{"full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","last_name":"Hauschild","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Leithner","full_name":"Leithner, Alexander F","orcid":"0000-0002-1073-744X","first_name":"Alexander F","id":"3B1B77E4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Florian R","id":"397A88EE-F248-11E8-B48F-1D18A9856A87","last_name":"Gärtner","full_name":"Gärtner, Florian R","orcid":"0000-0001-6120-3723"},{"first_name":"Jun","full_name":"Abe, Jun","last_name":"Abe"},{"id":"3F0587C8-F248-11E8-B48F-1D18A9856A87","first_name":"Jörg","orcid":"0000-0003-2856-3369","full_name":"Renkawitz, Jörg","last_name":"Renkawitz"},{"full_name":"Stein, Jens","last_name":"Stein","first_name":"Jens"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"}],"title":"Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells","citation":{"ieee":"M. Hons et al., “Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells,” Nature Immunology, vol. 19, no. 6. Nature Publishing Group, pp. 606–616, 2018.","short":"M. Hons, A. Kopf, R. Hauschild, A.F. Leithner, F.R. Gärtner, J. Abe, J. Renkawitz, J. Stein, M.K. Sixt, Nature Immunology 19 (2018) 606–616.","apa":"Hons, M., Kopf, A., Hauschild, R., Leithner, A. F., Gärtner, F. R., Abe, J., … Sixt, M. K. (2018). Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells. Nature Immunology. Nature Publishing Group. https://doi.org/10.1038/s41590-018-0109-z","ama":"Hons M, Kopf A, Hauschild R, et al. Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells. Nature Immunology. 2018;19(6):606-616. doi:10.1038/s41590-018-0109-z","mla":"Hons, Miroslav, et al. “Chemokines and Integrins Independently Tune Actin Flow and Substrate Friction during Intranodal Migration of T Cells.” Nature Immunology, vol. 19, no. 6, Nature Publishing Group, 2018, pp. 606–16, doi:10.1038/s41590-018-0109-z.","ista":"Hons M, Kopf A, Hauschild R, Leithner AF, Gärtner FR, Abe J, Renkawitz J, Stein J, Sixt MK. 2018. Chemokines and integrins independently tune actin flow and substrate friction during intranodal migration of T cells. Nature Immunology. 19(6), 606–616.","chicago":"Hons, Miroslav, Aglaja Kopf, Robert Hauschild, Alexander F Leithner, Florian R Gärtner, Jun Abe, Jörg Renkawitz, Jens Stein, and Michael K Sixt. “Chemokines and Integrins Independently Tune Actin Flow and Substrate Friction during Intranodal Migration of T Cells.” Nature Immunology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41590-018-0109-z."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"name":"Cellular navigation along spatial gradients","grant_number":"724373","call_identifier":"H2020","_id":"25FE9508-B435-11E9-9278-68D0E5697425"},{"name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells","grant_number":"747687","call_identifier":"H2020","_id":"260AA4E2-B435-11E9-9278-68D0E5697425"},{"_id":"25A48D24-B435-11E9-9278-68D0E5697425","name":"Molecular and system level view of immune cell migration","grant_number":"ALTF 1396-2014"},{"_id":"25A603A2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"281556","name":"Cytoskeletal force generation and force transduction of migrating leukocytes (EU)"}],"ec_funded":1,"volume":19,"issue":"6","related_material":{"record":[{"status":"public","id":"6891","relation":"dissertation_contains"}]},"publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/29777221","open_access":"1"}],"scopus_import":"1","intvolume":" 19","month":"05","acknowledged_ssus":[{"_id":"SSU"}],"abstract":[{"lang":"eng","text":"Although much is known about the physiological framework of T cell motility, and numerous rate-limiting molecules have been identified through loss-of-function approaches, an integrated functional concept of T cell motility is lacking. Here, we used in vivo precision morphometry together with analysis of cytoskeletal dynamics in vitro to deconstruct the basic mechanisms of T cell migration within lymphatic organs. We show that the contributions of the integrin LFA-1 and the chemokine receptor CCR7 are complementary rather than positioned in a linear pathway, as they are during leukocyte extravasation from the blood vasculature. Our data demonstrate that CCR7 controls cortical actin flows, whereas integrins mediate substrate friction that is sufficient to drive locomotion in the absence of considerable surface adhesions and plasma membrane flux."}],"oa_version":"Published Version","pmid":1,"department":[{"_id":"MiSi"},{"_id":"Bio"}],"date_updated":"2024-03-27T23:30:39Z","type":"journal_article","status":"public","_id":"15"},{"abstract":[{"lang":"eng","text":"This scientific commentary refers to ‘NEGR1 and FGFR2 cooperatively regulate cortical development and core behaviours related to autism disorders in mice’ by Szczurkowska et al. "}],"oa_version":"None","scopus_import":"1","month":"09","intvolume":" 141","publication_status":"published","language":[{"iso":"eng"}],"issue":"9","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7902"}]},"volume":141,"_id":"28","type":"journal_article","status":"public","date_updated":"2024-03-27T23:30:41Z","department":[{"_id":"SiHi"}],"publisher":"Oxford University Press","quality_controlled":"1","isi":1,"year":"2018","day":"01","publication":"Brain a journal of neurology","page":"2542 - 2544","date_published":"2018-09-01T00:00:00Z","doi":"10.1093/brain/awy218","date_created":"2018-12-11T11:44:14Z","citation":{"chicago":"Contreras, Ximena, and Simon Hippenmeyer. “Incorrect Trafficking Route Leads to Autism.” Brain a Journal of Neurology. Oxford University Press, 2018. https://doi.org/10.1093/brain/awy218.","ista":"Contreras X, Hippenmeyer S. 2018. Incorrect trafficking route leads to autism. Brain a journal of neurology. 141(9), 2542–2544.","mla":"Contreras, Ximena, and Simon Hippenmeyer. “Incorrect Trafficking Route Leads to Autism.” Brain a Journal of Neurology, vol. 141, no. 9, Oxford University Press, 2018, pp. 2542–44, doi:10.1093/brain/awy218.","ieee":"X. Contreras and S. Hippenmeyer, “Incorrect trafficking route leads to autism,” Brain a journal of neurology, vol. 141, no. 9. Oxford University Press, pp. 2542–2544, 2018.","short":"X. Contreras, S. Hippenmeyer, Brain a Journal of Neurology 141 (2018) 2542–2544.","ama":"Contreras X, Hippenmeyer S. Incorrect trafficking route leads to autism. Brain a journal of neurology. 2018;141(9):2542-2544. doi:10.1093/brain/awy218","apa":"Contreras, X., & Hippenmeyer, S. (2018). Incorrect trafficking route leads to autism. Brain a Journal of Neurology. Oxford University Press. https://doi.org/10.1093/brain/awy218"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"first_name":"Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87","full_name":"Contreras, Ximena","last_name":"Contreras"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon"}],"article_processing_charge":"No","external_id":{"isi":["000446548100012"]},"title":"Incorrect trafficking route leads to autism"},{"date_published":"2018-01-05T00:00:00Z","doi":"10.21769/BioProtoc.2685","date_created":"2018-12-11T11:46:30Z","day":"05","publication":"Bio-protocol","has_accepted_license":"1","year":"2018","publisher":"Bio-protocol","quality_controlled":"1","oa":1,"acknowledgement":"This protocol was adapted from Fendrych et al., 2016. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385, and Austrian Science Fund (FWF) [M 2128-B21]. ","title":"Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls","author":[{"first_name":"Lanxin","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5607-272X","full_name":"Li, Lanxin","last_name":"Li"},{"last_name":"Krens","full_name":"Krens, Gabriel","orcid":"0000-0003-4761-5996","first_name":"Gabriel","id":"2B819732-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Fendrych","full_name":"Fendrych, Matyas","orcid":"0000-0002-9767-8699","id":"43905548-F248-11E8-B48F-1D18A9856A87","first_name":"Matyas"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"publist_id":"7381","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Li, Lanxin, et al. “Real-Time Analysis of Auxin Response, Cell Wall PH and Elongation in Arabidopsis Thaliana Hypocotyls.” Bio-Protocol, vol. 8, no. 1, Bio-protocol, 2018, doi:10.21769/BioProtoc.2685.","apa":"Li, L., Krens, G., Fendrych, M., & Friml, J. (2018). Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls. Bio-Protocol. Bio-protocol. https://doi.org/10.21769/BioProtoc.2685","ama":"Li L, Krens G, Fendrych M, Friml J. Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls. Bio-protocol. 2018;8(1). doi:10.21769/BioProtoc.2685","short":"L. Li, G. Krens, M. Fendrych, J. Friml, Bio-Protocol 8 (2018).","ieee":"L. Li, G. Krens, M. Fendrych, and J. Friml, “Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls,” Bio-protocol, vol. 8, no. 1. Bio-protocol, 2018.","chicago":"Li, Lanxin, Gabriel Krens, Matyas Fendrych, and Jiří Friml. “Real-Time Analysis of Auxin Response, Cell Wall PH and Elongation in Arabidopsis Thaliana Hypocotyls.” Bio-Protocol. Bio-protocol, 2018. https://doi.org/10.21769/BioProtoc.2685.","ista":"Li L, Krens G, Fendrych M, Friml J. 2018. Real-time analysis of auxin response, cell wall pH and elongation in Arabidopsis thaliana Hypocotyls. Bio-protocol. 8(1)."},"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"volume":8,"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10083"}]},"issue":"1","ec_funded":1,"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5299","checksum":"6644ba698206eda32b0abf09128e63e3","file_size":11352389,"date_updated":"2020-07-14T12:46:29Z","creator":"system","file_name":"IST-2018-970-v1+1_2018_Lanxin_Real-time_analysis.pdf","date_created":"2018-12-12T10:17:43Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2331-8325"]},"publication_status":"published","month":"01","intvolume":" 8","oa_version":"Published Version","abstract":[{"text":"The rapid auxin-triggered growth of the Arabidopsis hypocotyls involves the nuclear TIR1/AFB-Aux/IAA signaling and is accompanied by acidification of the apoplast and cell walls (Fendrych et al., 2016). Here, we describe in detail the method for analysis of the elongation and the TIR1/AFB-Aux/IAA-dependent auxin response in hypocotyl segments as well as the determination of relative values of the cell wall pH.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:29Z","department":[{"_id":"JiFr"},{"_id":"Bio"}],"ddc":["576","581"],"date_updated":"2024-03-27T23:30:42Z","status":"public","pubrep_id":"970","type":"journal_article","article_type":"original","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)"},"_id":"442"},{"department":[{"_id":"GaNo"},{"_id":"EdHa"}],"file_date_updated":"2020-07-14T12:45:58Z","ddc":["570"],"date_updated":"2024-03-27T23:30:44Z","pubrep_id":"1071","status":"public","article_type":"original","type":"journal_article","_id":"3","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/mutation-that-causes-autism-and-intellectual-disability-makes-brain-less-flexible/","description":"News on IST Homepage"}],"record":[{"id":"6074","status":"public","relation":"popular_science"},{"id":"12364","status":"public","relation":"dissertation_contains"}]},"issue":"12","volume":21,"language":[{"iso":"eng"}],"file":[{"file_id":"6255","checksum":"60abd0f05b7cdc08a6b0ec460884084f","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-04-09T07:41:57Z","file_name":"2017_NatureNeuroscience_Deliu.pdf","creator":"dernst","date_updated":"2020-07-14T12:45:58Z","file_size":8167169}],"publication_status":"published","intvolume":" 21","month":"11","scopus_import":"1","oa_version":"Submitted Version","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"abstract":[{"text":"SETD5 gene mutations have been identified as a frequent cause of idiopathic intellectual disability. Here we show that Setd5-haploinsufficient mice present developmental defects such as abnormal brain-to-body weight ratios and neural crest defect-associated phenotypes. Furthermore, Setd5-mutant mice show impairments in cognitive tasks, enhanced long-term potentiation, delayed ontogenetic profile of ultrasonic vocalization, and behavioral inflexibility. Behavioral issues are accompanied by abnormal expression of postsynaptic density proteins previously associated with cognition. Our data additionally indicate that Setd5 regulates RNA polymerase II dynamics and gene transcription via its interaction with the Hdac3 and Paf1 complexes, findings potentially explaining the gene expression defects observed in Setd5-haploinsufficient mice. Our results emphasize the decisive role of Setd5 in a biological pathway found to be disrupted in humans with intellectual disability and autism spectrum disorder.","lang":"eng"}],"title":"Haploinsufficiency of the intellectual disability gene SETD5 disturbs developmental gene expression and cognition","article_processing_charge":"No","external_id":{"isi":["000451324700010"]},"publist_id":"8054","author":[{"id":"37A40D7E-F248-11E8-B48F-1D18A9856A87","first_name":"Elena","orcid":"0000-0002-7370-5293","full_name":"Deliu, Elena","last_name":"Deliu"},{"first_name":"Niccoló","full_name":"Arecco, Niccoló","last_name":"Arecco"},{"first_name":"Jasmin","id":"4739D480-F248-11E8-B48F-1D18A9856A87","full_name":"Morandell, Jasmin","last_name":"Morandell"},{"last_name":"Dotter","orcid":"0000-0002-9033-9096","full_name":"Dotter, Christoph","first_name":"Christoph","id":"4C66542E-F248-11E8-B48F-1D18A9856A87"},{"id":"475990FE-F248-11E8-B48F-1D18A9856A87","first_name":"Ximena","full_name":"Contreras, Ximena","last_name":"Contreras"},{"full_name":"Girardot, Charles","last_name":"Girardot","first_name":"Charles"},{"full_name":"Käsper, Eva","last_name":"Käsper","first_name":"Eva"},{"full_name":"Kozlova, Alena","last_name":"Kozlova","id":"C50A9596-02D0-11E9-976E-E38CFE5CBC1D","first_name":"Alena"},{"full_name":"Kishi, Kasumi","last_name":"Kishi","first_name":"Kasumi","id":"3065DFC4-F248-11E8-B48F-1D18A9856A87"},{"id":"B6467F20-02D0-11E9-BDA5-E960C241894A","first_name":"Ilaria","full_name":"Chiaradia, Ilaria","orcid":"0000-0002-9529-4464","last_name":"Chiaradia"},{"first_name":"Kyung","full_name":"Noh, Kyung","last_name":"Noh"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","last_name":"Novarino"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Deliu, Elena, et al. “Haploinsufficiency of the Intellectual Disability Gene SETD5 Disturbs Developmental Gene Expression and Cognition.” Nature Neuroscience, vol. 21, no. 12, Nature Publishing Group, 2018, pp. 1717–27, doi:10.1038/s41593-018-0266-2.","apa":"Deliu, E., Arecco, N., Morandell, J., Dotter, C., Contreras, X., Girardot, C., … Novarino, G. (2018). Haploinsufficiency of the intellectual disability gene SETD5 disturbs developmental gene expression and cognition. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/s41593-018-0266-2","ama":"Deliu E, Arecco N, Morandell J, et al. Haploinsufficiency of the intellectual disability gene SETD5 disturbs developmental gene expression and cognition. Nature Neuroscience. 2018;21(12):1717-1727. doi:10.1038/s41593-018-0266-2","short":"E. Deliu, N. Arecco, J. Morandell, C. Dotter, X. Contreras, C. Girardot, E. Käsper, A. Kozlova, K. Kishi, I. Chiaradia, K. Noh, G. Novarino, Nature Neuroscience 21 (2018) 1717–1727.","ieee":"E. Deliu et al., “Haploinsufficiency of the intellectual disability gene SETD5 disturbs developmental gene expression and cognition,” Nature Neuroscience, vol. 21, no. 12. Nature Publishing Group, pp. 1717–1727, 2018.","chicago":"Deliu, Elena, Niccoló Arecco, Jasmin Morandell, Christoph Dotter, Ximena Contreras, Charles Girardot, Eva Käsper, et al. “Haploinsufficiency of the Intellectual Disability Gene SETD5 Disturbs Developmental Gene Expression and Cognition.” Nature Neuroscience. Nature Publishing Group, 2018. https://doi.org/10.1038/s41593-018-0266-2.","ista":"Deliu E, Arecco N, Morandell J, Dotter C, Contreras X, Girardot C, Käsper E, Kozlova A, Kishi K, Chiaradia I, Noh K, Novarino G. 2018. Haploinsufficiency of the intellectual disability gene SETD5 disturbs developmental gene expression and cognition. Nature Neuroscience. 21(12), 1717–1727."},"project":[{"_id":"254BA948-B435-11E9-9278-68D0E5697425","name":"Probing development and reversibility of autism spectrum disorders","grant_number":"401299"}],"date_created":"2018-12-11T11:44:05Z","date_published":"2018-11-19T00:00:00Z","doi":"10.1038/s41593-018-0266-2","page":"1717 - 1727","publication":"Nature Neuroscience","day":"19","year":"2018","has_accepted_license":"1","isi":1,"oa":1,"quality_controlled":"1","publisher":"Nature Publishing Group","acknowledgement":"This work was supported by the Simons Foundation Autism Research Initiative (grant 401299) to G.N. and the DFG (SPP1738 grant NO 1249) to K.-M.N."},{"type":"journal_article","status":"public","_id":"2","department":[{"_id":"KrCh"}],"date_updated":"2024-03-27T23:30:44Z","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/30429320"}],"scopus_import":"1","intvolume":" 115","month":"11","abstract":[{"lang":"eng","text":"Indirect reciprocity explores how humans act when their reputation is at stake, and which social norms they use to assess the actions of others. A crucial question in indirect reciprocity is which social norms can maintain stable cooperation in a society. Past research has highlighted eight such norms, called “leading-eight” strategies. This past research, however, is based on the assumption that all relevant information about other population members is publicly available and that everyone agrees on who is good or bad. Instead, here we explore the reputation dynamics when information is private and noisy. We show that under these conditions, most leading-eight strategies fail to evolve. Those leading-eight strategies that do evolve are unable to sustain full cooperation.Indirect reciprocity is a mechanism for cooperation based on shared moral systems and individual reputations. It assumes that members of a community routinely observe and assess each other and that they use this information to decide who is good or bad, and who deserves cooperation. When information is transmitted publicly, such that all community members agree on each other’s reputation, previous research has highlighted eight crucial moral systems. These “leading-eight” strategies can maintain cooperation and resist invasion by defectors. However, in real populations individuals often hold their own private views of others. Once two individuals disagree about their opinion of some third party, they may also see its subsequent actions in a different light. Their opinions may further diverge over time. Herein, we explore indirect reciprocity when information transmission is private and noisy. We find that in the presence of perception errors, most leading-eight strategies cease to be stable. Even if a leading-eight strategy evolves, cooperation rates may drop considerably when errors are common. Our research highlights the role of reliable information and synchronized reputations to maintain stable moral systems."}],"oa_version":"Submitted Version","pmid":1,"ec_funded":1,"related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/no-cooperation-without-open-communication/","relation":"press_release"}],"record":[{"id":"10293","status":"public","relation":"dissertation_contains"}]},"issue":"48","volume":115,"publication_status":"published","language":[{"iso":"eng"}],"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"external_id":{"isi":["000451351000063"],"pmid":["30429320"]},"article_processing_charge":"No","author":[{"last_name":"Hilbe","full_name":"Hilbe, Christian","orcid":"0000-0001-5116-955X","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"id":"38B437DE-F248-11E8-B48F-1D18A9856A87","first_name":"Laura","last_name":"Schmid","full_name":"Schmid, Laura","orcid":"0000-0002-6978-7329"},{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"title":"Indirect reciprocity with private, noisy, and incomplete information","citation":{"chicago":"Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1810565115.","ista":"Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. 2018. Indirect reciprocity with private, noisy, and incomplete information. PNAS. 115(48), 12241–12246.","mla":"Hilbe, Christian, et al. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” PNAS, vol. 115, no. 48, National Academy of Sciences, 2018, pp. 12241–46, doi:10.1073/pnas.1810565115.","short":"C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, M. Nowak, PNAS 115 (2018) 12241–12246.","ieee":"C. Hilbe, L. Schmid, J. Tkadlec, K. Chatterjee, and M. Nowak, “Indirect reciprocity with private, noisy, and incomplete information,” PNAS, vol. 115, no. 48. National Academy of Sciences, pp. 12241–12246, 2018.","apa":"Hilbe, C., Schmid, L., Tkadlec, J., Chatterjee, K., & Nowak, M. (2018). Indirect reciprocity with private, noisy, and incomplete information. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1810565115","ama":"Hilbe C, Schmid L, Tkadlec J, Chatterjee K, Nowak M. Indirect reciprocity with private, noisy, and incomplete information. PNAS. 2018;115(48):12241-12246. doi:10.1073/pnas.1810565115"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"quality_controlled":"1","publisher":"National Academy of Sciences","page":"12241-12246","date_created":"2018-12-11T11:44:05Z","date_published":"2018-11-27T00:00:00Z","doi":"10.1073/pnas.1810565115","year":"2018","isi":1,"publication":"PNAS","day":"27"},{"_id":"67","status":"public","type":"journal_article","article_type":"original","ddc":["570"],"date_updated":"2024-03-27T23:30:48Z","file_date_updated":"2020-07-14T12:47:37Z","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}],"oa_version":"Submitted Version","abstract":[{"text":"Gene regulatory networks evolve through rewiring of individual components—that is, through changes in regulatory connections. However, the mechanistic basis of regulatory rewiring is poorly understood. Using a canonical gene regulatory system, we quantify the properties of transcription factors that determine the evolutionary potential for rewiring of regulatory connections: robustness, tunability and evolvability. In vivo repression measurements of two repressors at mutated operator sites reveal their contrasting evolutionary potential: while robustness and evolvability were positively correlated, both were in trade-off with tunability. Epistatic interactions between adjacent operators alleviated this trade-off. A thermodynamic model explains how the differences in robustness, tunability and evolvability arise from biophysical characteristics of repressor–DNA binding. The model also uncovers that the energy matrix, which describes how mutations affect repressor–DNA binding, encodes crucial information about the evolutionary potential of a repressor. The biophysical determinants of evolutionary potential for regulatory rewiring constitute a mechanistic framework for understanding network evolution.","lang":"eng"}],"intvolume":" 2","month":"09","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"checksum":"383a2e2c944a856e2e821ec8e7bf71b6","file_id":"7830","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2018_NatureEcology_Igler.pdf","date_created":"2020-05-14T11:28:52Z","file_size":1135973,"date_updated":"2020-07-14T12:47:37Z","creator":"dernst"}],"publication_status":"published","ec_funded":1,"volume":2,"related_material":{"record":[{"relation":"popular_science","status":"public","id":"5585"},{"relation":"dissertation_contains","status":"public","id":"6371"}]},"issue":"10","project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425"},{"_id":"251EE76E-B435-11E9-9278-68D0E5697425","grant_number":"24573","name":"Design principles underlying genetic switch architecture (DOC Fellowship)"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary potential of transcription factors for gene regulatory rewiring,” Nature Ecology and Evolution, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643.","ama":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2018;2(10):1633-1643. doi:10.1038/s41559-018-0651-y","apa":"Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., & Guet, C. C. (2018). Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. Nature Publishing Group. https://doi.org/10.1038/s41559-018-0651-y","mla":"Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” Nature Ecology and Evolution, vol. 2, no. 10, Nature Publishing Group, 2018, pp. 1633–43, doi:10.1038/s41559-018-0651-y.","ista":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. 2018. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2(10), 1633–1643.","chicago":"Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” Nature Ecology and Evolution. Nature Publishing Group, 2018. https://doi.org/10.1038/s41559-018-0651-y."},"title":"Evolutionary potential of transcription factors for gene regulatory rewiring","article_processing_charge":"No","external_id":{"isi":["000447947600021"]},"author":[{"last_name":"Igler","full_name":"Igler, Claudia","first_name":"Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lagator","full_name":"Lagator, Mato","first_name":"Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","last_name":"Tkacik"},{"last_name":"Bollback","orcid":"0000-0002-4624-4612","full_name":"Bollback, Jonathan P","first_name":"Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet"}],"publist_id":"7987","oa":1,"quality_controlled":"1","publisher":"Nature Publishing Group","publication":"Nature Ecology and Evolution","day":"10","year":"2018","isi":1,"has_accepted_license":"1","date_created":"2018-12-11T11:44:27Z","date_published":"2018-09-10T00:00:00Z","doi":"10.1038/s41559-018-0651-y","page":"1633 - 1643"},{"publisher":"American Physical Society","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2017","day":"27","publication":"Physics","doi":"10.1103/Physics.10.32","date_published":"2017-03-27T00:00:00Z","date_created":"2018-12-11T11:49:41Z","citation":{"chicago":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” Physics. American Physical Society, 2017. https://doi.org/10.1103/Physics.10.32.","ista":"Fink JM. 2017. Viewpoint: Microwave quantum states beat the heat. Physics. 10(32).","mla":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” Physics, vol. 10, no. 32, American Physical Society, 2017, doi:10.1103/Physics.10.32.","apa":"Fink, J. M. (2017). Viewpoint: Microwave quantum states beat the heat. Physics. American Physical Society. https://doi.org/10.1103/Physics.10.32","ama":"Fink JM. Viewpoint: Microwave quantum states beat the heat. Physics. 2017;10(32). doi:10.1103/Physics.10.32","ieee":"J. M. Fink, “Viewpoint: Microwave quantum states beat the heat,” Physics, vol. 10, no. 32. American Physical Society, 2017.","short":"J.M. Fink, Physics 10 (2017)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink"}],"publist_id":"6382","article_processing_charge":"No","title":"Viewpoint: Microwave quantum states beat the heat","abstract":[{"text":"From microwave ovens to satellite television to the GPS and data services on our mobile phones, microwave technology is everywhere today. But one technology that has so far failed to prove its worth in this wavelength regime is quantum communication that uses the states of single photons as information carriers. This is because single microwave photons, as opposed to classical microwave signals, are extremely vulnerable to noise from thermal excitations in the channels through which they travel. Two new independent studies, one by Ze-Liang Xiang at Technische Universität Wien (Vienna), Austria, and colleagues [1] and another by Benoît Vermersch at the University of Innsbruck, also in Austria, and colleagues [2] now describe a theoretical protocol for microwave quantum communication that is resilient to thermal and other types of noise. Their approach could become a powerful technique to establish fast links between superconducting data processors in a future all-microwave quantum network.","lang":"eng"}],"oa_version":"Published Version","month":"03","intvolume":" 10","publication_status":"published","file":[{"file_id":"6968","success":1,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2019-10-24T11:38:14Z","file_name":"2017_Physics_Fink.pdf","creator":"dernst","date_updated":"2019-10-24T11:38:14Z","file_size":193622}],"language":[{"iso":"eng"}],"issue":"32","volume":10,"_id":"1013","article_type":"review","type":"journal_article","status":"public","date_updated":"2022-06-07T10:58:31Z","ddc":["530"],"department":[{"_id":"JoFi"}],"file_date_updated":"2019-10-24T11:38:14Z"},{"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_updated":"2021-12-07T08:04:14Z","status":"public","article_type":"original","type":"journal_article","conference":{"start_date":"2018-01-07","end_date":"2018-01-13","location":"Los Angeles, CA, United States","name":"POPL: Programming Languages"},"_id":"10418","issue":"POPL","volume":2,"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","month":"12","intvolume":" 2","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/3158121"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We present a new proof rule for proving almost-sure termination of probabilistic programs, including those that contain demonic non-determinism. An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates \"almost surely\". Proving that can be hard, and this paper presents a new method for doing so. It applies directly to the program's source code, even if the program contains demonic choice. Like others, we use variant functions (a.k.a. \"super-martingales\") that are real-valued and decrease randomly on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains."}],"title":"A new proof rule for almost-sure termination","author":[{"last_name":"Mciver","full_name":"Mciver, Annabelle","first_name":"Annabelle"},{"full_name":"Morgan, Carroll","last_name":"Morgan","first_name":"Carroll"},{"first_name":"Benjamin Lucien","last_name":"Kaminski","full_name":"Kaminski, Benjamin Lucien"},{"first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","last_name":"Katoen","full_name":"Katoen, Joost P"}],"external_id":{"arxiv":["1711.03588"]},"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ista":"Mciver A, Morgan C, Kaminski BL, Katoen JP. 2017. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2(POPL), 33.","chicago":"Mciver, Annabelle, Carroll Morgan, Benjamin Lucien Kaminski, and Joost P Katoen. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158121.","ieee":"A. Mciver, C. Morgan, B. L. Kaminski, and J. P. Katoen, “A new proof rule for almost-sure termination,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","short":"A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).","apa":"Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121","ama":"Mciver A, Morgan C, Kaminski BL, Katoen JP. A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158121","mla":"Mciver, Annabelle, et al. “A New Proof Rule for Almost-Sure Termination.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 33, Association for Computing Machinery, 2017, doi:10.1145/3158121."},"article_number":"33","date_published":"2017-12-07T00:00:00Z","doi":"10.1145/3158121","date_created":"2021-12-05T23:01:49Z","day":"07","publication":"Proceedings of the ACM on Programming Languages","year":"2017","publisher":"Association for Computing Machinery","quality_controlled":"1","oa":1,"acknowledgement":"McIver and Morgan are grateful to David Basin and the Information Security Group at ETH Zürich for hosting a six-month stay in Switzerland, during part of which this work began. And thanks particularly to Andreas Lochbihler, who shared with us the probabilistic termination problem that led to it. They acknowledge the support of ARC grant DP140101119. Part of this work was carried out during the Workshop on Probabilistic Programming Semantics\r\nat McGill University’s Bellairs Research Institute on Barbados organised by Alexandra Silva and\r\nPrakash Panangaden. Kaminski and Katoen are grateful to Sebastian Junges for spotting a flaw in §5.4."},{"type":"conference","conference":{"name":"FOGA: Foundations of Genetic Algorithms","location":"Copenhagen, Denmark","end_date":"2017-01-15","start_date":"2017-01-12"},"status":"public","_id":"1112","publist_id":"6255","author":[{"last_name":"Paixao","full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pérez Heredia","full_name":"Pérez Heredia, Jorge","first_name":"Jorge"}],"title":"An application of stochastic differential equations to evolutionary algorithms","department":[{"_id":"NiBa"}],"citation":{"mla":"Paixao, Tiago, and Jorge Pérez Heredia. “An Application of Stochastic Differential Equations to Evolutionary Algorithms.” Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, ACM, 2017, pp. 3–11, doi:10.1145/3040718.3040729.","short":"T. Paixao, J. Pérez Heredia, in:, Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, ACM, 2017, pp. 3–11.","ieee":"T. Paixao and J. Pérez Heredia, “An application of stochastic differential equations to evolutionary algorithms,” in Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Copenhagen, Denmark, 2017, pp. 3–11.","apa":"Paixao, T., & Pérez Heredia, J. (2017). An application of stochastic differential equations to evolutionary algorithms. In Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (pp. 3–11). Copenhagen, Denmark: ACM. https://doi.org/10.1145/3040718.3040729","ama":"Paixao T, Pérez Heredia J. An application of stochastic differential equations to evolutionary algorithms. In: Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. ACM; 2017:3-11. doi:10.1145/3040718.3040729","chicago":"Paixao, Tiago, and Jorge Pérez Heredia. “An Application of Stochastic Differential Equations to Evolutionary Algorithms.” In Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 3–11. ACM, 2017. https://doi.org/10.1145/3040718.3040729.","ista":"Paixao T, Pérez Heredia J. 2017. An application of stochastic differential equations to evolutionary algorithms. Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. FOGA: Foundations of Genetic Algorithms, 3–11."},"date_updated":"2021-01-12T06:48:22Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"quality_controlled":"1","publisher":"ACM","month":"01","abstract":[{"lang":"eng","text":"There has been renewed interest in modelling the behaviour of evolutionary algorithms by more traditional mathematical objects, such as ordinary differential equations or Markov chains. The advantage is that the analysis becomes greatly facilitated due to the existence of well established methods. However, this typically comes at the cost of disregarding information about the process. Here, we introduce the use of stochastic differential equations (SDEs) for the study of EAs. SDEs can produce simple analytical results for the dynamics of stochastic processes, unlike Markov chains which can produce rigorous but unwieldy expressions about the dynamics. On the other hand, unlike ordinary differential equations (ODEs), they do not discard information about the stochasticity of the process. We show that these are especially suitable for the analysis of fixed budget scenarios and present analogs of the additive and multiplicative drift theorems for SDEs. We exemplify the use of these methods for two model algorithms ((1+1) EA and RLS) on two canonical problems(OneMax and LeadingOnes)."}],"oa_version":"None","page":"3 - 11","date_published":"2017-01-12T00:00:00Z","doi":"10.1145/3040718.3040729","date_created":"2018-12-11T11:50:12Z","publication_identifier":{"isbn":["978-145034651-1"]},"publication_status":"published","year":"2017","day":"12","publication":"Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","language":[{"iso":"eng"}]},{"pubrep_id":"927","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)"},"conference":{"name":"ITCS: Innovations in Theoretical Computer Science","start_date":"2017-01-09","end_date":"2017-01-11","location":"Berkeley, CA, United States"},"type":"conference","_id":"1175","file_date_updated":"2020-07-14T12:44:37Z","department":[{"_id":"KrPi"}],"ddc":["005","600"],"date_updated":"2021-01-12T06:48:51Z","intvolume":" 67","month":"01","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","abstract":[{"text":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko ’15] as a tool for obtaining results in cryptography. We consider instead the non- deterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling. We also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10–15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordström ’08, ’11] we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.","lang":"eng"}],"volume":67,"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:44:37Z","file_size":557769,"creator":"system","date_created":"2018-12-12T10:17:11Z","file_name":"IST-2018-927-v1+1_LIPIcs-ITCS-2017-38.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"dbc94810be07c2fb1945d5c2a6130e6c","file_id":"5263"}],"publication_status":"published","publication_identifier":{"issn":["18688969"]},"editor":[{"full_name":"Papadimitriou, Christos","last_name":"Papadimitriou","first_name":"Christos"}],"title":"Cumulative space in black-white pebbling and resolution","publist_id":"6179","author":[{"last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"first_name":"Susanna","last_name":"De Rezende","full_name":"De Rezende, Susanna"},{"first_name":"Jakob","last_name":"Nordstrom","full_name":"Nordstrom, Jakob"},{"first_name":"Marc","last_name":"Vinyals","full_name":"Vinyals, Marc"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.","apa":"Alwen, J. F., De Rezende, S., Nordstrom, J., & Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2017.38","ama":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. Cumulative space in black-white pebbling and resolution. In: Papadimitriou C, ed. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017:38:1-38-21. doi:10.4230/LIPIcs.ITCS.2017.38","short":"J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.","ieee":"J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.","chicago":"Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.","ista":"Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21."},"oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2018-12-11T11:50:33Z","doi":"10.4230/LIPIcs.ITCS.2017.38","date_published":"2017-01-01T00:00:00Z","page":"38:1-38-21","day":"01","year":"2017","has_accepted_license":"1"},{"month":"03","intvolume":" 79","scopus_import":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1607.00944"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Variation in genotypes may be responsible for differences in dispersal rates, directional biases, and growth rates of individuals. These traits may favor certain genotypes and enhance their spatiotemporal spreading into areas occupied by the less advantageous genotypes. We study how these factors influence the speed of spreading in the case of two competing genotypes under the assumption that spatial variation of the total population is small compared to the spatial variation of the frequencies of the genotypes in the population. In that case, the dynamics of the frequency of one of the genotypes is approximately described by a generalized Fisher–Kolmogorov–Petrovskii–Piskunov (F–KPP) equation. This generalized F–KPP equation with (nonlinear) frequency-dependent diffusion and advection terms admits traveling wave solutions that characterize the invasion of the dominant genotype. Our existence results generalize the classical theory for traveling waves for the F–KPP with constant coefficients. Moreover, in the particular case of the quadratic (monostable) nonlinear growth–decay rate in the generalized F–KPP we study in detail the influence of the variance in diffusion and mean displacement rates of the two genotypes on the minimal wave propagation speed."}],"issue":"3","volume":79,"ec_funded":1,"language":[{"iso":"eng"}],"publication_status":"published","status":"public","type":"journal_article","_id":"1191","department":[{"_id":"NiBa"}],"date_updated":"2021-01-12T06:48:58Z","quality_controlled":"1","publisher":"Springer","oa":1,"acknowledgement":"We thank Nick Barton, Katarína Bod’ová, and Sr\r\n-\r\ndan Sarikas for constructive feed-\r\nback and support. Furthermore, we would like to express our deep gratitude to the anonymous referees (one\r\nof whom, Jimmy Garnier, agreed to reveal his identity) and the editor Max Souza, for very helpful and\r\ndetailed comments and suggestions that significantly helped us to improve the manuscript. This project has\r\nreceived funding from the European Union’s Seventh Framework Programme for research, technological\r\ndevelopment and demonstration under Grant Agreement 618091 Speed of Adaptation in Population Genet-\r\nics and Evolutionary Computation (SAGE) and the European Research Council (ERC) Grant No. 250152\r\n(SN), from the Scientific Grant Agency of the Slovak Republic under the Grant 1/0459/13 and by the Slovak\r\nResearch and Development Agency under the Contract No. APVV-14-0378 (RK). RK would also like to\r\nthank IST Austria for its hospitality during the work on this project.","doi":"10.1007/s11538-016-0244-3","date_published":"2017-03-01T00:00:00Z","date_created":"2018-12-11T11:50:38Z","page":"525-559","day":"01","publication":"Bulletin of Mathematical Biology","year":"2017","project":[{"grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation","call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425"},{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"title":"Existence of traveling waves for the generalized F–KPP equation","publist_id":"6160","author":[{"first_name":"Richard","last_name":"Kollár","full_name":"Kollár, Richard"},{"full_name":"Novak, Sebastian","last_name":"Novak","first_name":"Sebastian","id":"461468AE-F248-11E8-B48F-1D18A9856A87"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kollár R, Novak S. 2017. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 79(3), 525–559.","chicago":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology. Springer, 2017. https://doi.org/10.1007/s11538-016-0244-3.","short":"R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.","ieee":"R. Kollár and S. Novak, “Existence of traveling waves for the generalized F–KPP equation,” Bulletin of Mathematical Biology, vol. 79, no. 3. Springer, pp. 525–559, 2017.","apa":"Kollár, R., & Novak, S. (2017). Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. Springer. https://doi.org/10.1007/s11538-016-0244-3","ama":"Kollár R, Novak S. Existence of traveling waves for the generalized F–KPP equation. Bulletin of Mathematical Biology. 2017;79(3):525-559. doi:10.1007/s11538-016-0244-3","mla":"Kollár, Richard, and Sebastian Novak. “Existence of Traveling Waves for the Generalized F–KPP Equation.” Bulletin of Mathematical Biology, vol. 79, no. 3, Springer, 2017, pp. 525–59, doi:10.1007/s11538-016-0244-3."}},{"page":"636-655","date_created":"2018-12-11T11:50:44Z","date_published":"2017-05-01T00:00:00Z","doi":"10.1007/s10955-016-1672-z","year":"2017","has_accepted_license":"1","publication":"Journal of Statistical Physics","day":"01","oa":1,"publisher":"Springer","quality_controlled":"1","acknowledgement":"This work was supported by the family of late G. Robinson, Jr. and NSF Grant DMS-1211827. ","author":[{"first_name":"Nazmi B","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87","last_name":"Budanur","orcid":"0000-0003-0423-5010","full_name":"Budanur, Nazmi B"},{"first_name":"Predrag","last_name":"Cvitanović","full_name":"Cvitanović, Predrag"}],"publist_id":"6136","title":"Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system","citation":{"chicago":"Budanur, Nazmi B, and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics. Springer, 2017. https://doi.org/10.1007/s10955-016-1672-z.","ista":"Budanur NB, Cvitanović P. 2017. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 167(3–4), 636–655.","mla":"Budanur, Nazmi B., and Predrag Cvitanović. “Unstable Manifolds of Relative Periodic Orbits in the Symmetry Reduced State Space of the Kuramoto–Sivashinsky System.” Journal of Statistical Physics, vol. 167, no. 3–4, Springer, 2017, pp. 636–55, doi:10.1007/s10955-016-1672-z.","ama":"Budanur NB, Cvitanović P. Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. 2017;167(3-4):636-655. doi:10.1007/s10955-016-1672-z","apa":"Budanur, N. B., & Cvitanović, P. (2017). Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-016-1672-z","ieee":"N. B. Budanur and P. Cvitanović, “Unstable manifolds of relative periodic orbits in the symmetry reduced state space of the Kuramoto–Sivashinsky system,” Journal of Statistical Physics, vol. 167, no. 3–4. Springer, pp. 636–655, 2017.","short":"N.B. Budanur, P. Cvitanović, Journal of Statistical Physics 167 (2017) 636–655."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":167,"issue":"3-4","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"IST-2017-782-v1+1_BudCvi15.pdf","date_created":"2018-12-12T10:18:01Z","creator":"system","file_size":2820207,"date_updated":"2020-07-14T12:44:39Z","file_id":"5319","checksum":"3e971d09eb167761aa0888ed415b0056","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"scopus_import":1,"intvolume":" 167","month":"05","abstract":[{"lang":"eng","text":"Systems such as fluid flows in channels and pipes or the complex Ginzburg–Landau system, defined over periodic domains, exhibit both continuous symmetries, translational and rotational, as well as discrete symmetries under spatial reflections or complex conjugation. The simplest, and very common symmetry of this type is the equivariance of the defining equations under the orthogonal group O(2). We formulate a novel symmetry reduction scheme for such systems by combining the method of slices with invariant polynomial methods, and show how it works by applying it to the Kuramoto–Sivashinsky system in one spatial dimension. As an example, we track a relative periodic orbit through a sequence of bifurcations to the onset of chaos. Within the symmetry-reduced state space we are able to compute and visualize the unstable manifolds of relative periodic orbits, their torus bifurcations, a transition to chaos via torus breakdown, and heteroclinic connections between various relative periodic orbits. It would be very hard to carry through such analysis in the full state space, without a symmetry reduction such as the one we present here."}],"oa_version":"Submitted Version","file_date_updated":"2020-07-14T12:44:39Z","department":[{"_id":"BjHo"}],"date_updated":"2021-01-12T06:49:07Z","ddc":["530"],"type":"journal_article","pubrep_id":"782","status":"public","_id":"1211"},{"page":"135 - 154","date_created":"2018-12-11T11:50:13Z","date_published":"2017-01-01T00:00:00Z","doi":"10.7155/jgaa.00408","year":"2017","has_accepted_license":"1","publication":"Journal of Graph Algorithms and Applications","day":"01","oa":1,"publisher":"Brown University","quality_controlled":"1","external_id":{"arxiv":["1608.08662"]},"article_processing_charge":"No","author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pelsmajer, Michael","last_name":"Pelsmajer","first_name":"Michael"},{"first_name":"Marcus","full_name":"Schaefer, Marcus","last_name":"Schaefer"}],"publist_id":"6254","title":"Hanani-Tutte for radial planarity","citation":{"chicago":"Fulek, Radoslav, Michael Pelsmajer, and Marcus Schaefer. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications. Brown University, 2017. https://doi.org/10.7155/jgaa.00408.","ista":"Fulek R, Pelsmajer M, Schaefer M. 2017. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 21(1), 135–154.","mla":"Fulek, Radoslav, et al. “Hanani-Tutte for Radial Planarity.” Journal of Graph Algorithms and Applications, vol. 21, no. 1, Brown University, 2017, pp. 135–54, doi:10.7155/jgaa.00408.","short":"R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.","ieee":"R. Fulek, M. Pelsmajer, and M. Schaefer, “Hanani-Tutte for radial planarity,” Journal of Graph Algorithms and Applications, vol. 21, no. 1. Brown University, pp. 135–154, 2017.","apa":"Fulek, R., Pelsmajer, M., & Schaefer, M. (2017). Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00408","ama":"Fulek R, Pelsmajer M, Schaefer M. Hanani-Tutte for radial planarity. Journal of Graph Algorithms and Applications. 2017;21(1):135-154. doi:10.7155/jgaa.00408"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"ec_funded":1,"related_material":{"record":[{"status":"public","id":"1164","relation":"earlier_version"},{"id":"1595","status":"public","relation":"earlier_version"}]},"volume":21,"issue":"1","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_name":"2017_JournalGraphAlgorithms_Fulek.pdf","date_created":"2019-10-24T10:54:37Z","file_size":573623,"date_updated":"2019-10-24T10:54:37Z","creator":"dernst","success":1,"file_id":"6967","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"scopus_import":1,"intvolume":" 21","month":"01","abstract":[{"lang":"eng","text":"A drawing of a graph G is radial if the vertices of G are placed on concentric circles C 1 , . . . , C k with common center c , and edges are drawn radially : every edge intersects every circle centered at c at most once. G is radial planar if it has a radial embedding, that is, a crossing-free radial drawing. If the vertices of G are ordered or partitioned into ordered levels (as they are for leveled graphs), we require that the assignment of vertices to circles corresponds to the given ordering or leveling. We show that a graph G is radial planar if G has a radial drawing in which every two edges cross an even number of times; the radial embedding has the same leveling as the radial drawing. In other words, we establish the weak variant of the Hanani-Tutte theorem for radial planarity. This generalizes a result by Pach and Toth."}],"oa_version":"Published Version","department":[{"_id":"UlWa"}],"file_date_updated":"2019-10-24T10:54:37Z","date_updated":"2023-02-23T10:05:57Z","ddc":["510"],"type":"journal_article","article_type":"original","status":"public","_id":"1113"},{"abstract":[{"text":"Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy generation, contributing to the proton motive force used to produce ATP. It couples the transfer of two electrons between NADH and quinone to translocation of four protons across the membrane. It is the largest protein assembly of bacterial and mitochondrial respiratory chains, composed, in mammals, of up to 45 subunits with a total molecular weight of ∼1 MDa. Bacterial enzyme is about half the size, providing the important “minimal” model of complex I. The l-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. Previously, we have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus and of the membrane domain from Escherichia coli, followed by the atomic structure of intact, entire complex I from T. thermophilus. Recently, we have solved by cryo-EM a first complete atomic structure of mammalian (ovine) mitochondrial complex I. Core subunits are well conserved from the bacterial version, whilst supernumerary subunits form an interlinked, stabilizing shell around the core. Subunits containing additional cofactors, including Zn ion, NADPH and phosphopantetheine, probably have regulatory roles. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The structure of mammalian enzyme provides many insights into complex I mechanism, assembly, maturation and dysfunction, allowing detailed molecular analysis of disease-causing mutations.","lang":"eng"}],"oa_version":"None","quality_controlled":"1","publisher":"Royal Society of Chemistry","month":"11","publication_identifier":{"isbn":["978-1-78262-865-1"]},"year":"2017","publication_status":"published","day":"29","publication":"Mechanisms of primary energy transduction in biology ","language":[{"iso":"eng"}],"page":"25 - 59","doi":"10.1039/9781788010405-00025","date_published":"2017-11-29T00:00:00Z","date_created":"2018-12-11T11:46:30Z","series_title":"Mechanisms of Primary Energy Transduction in Biology ","_id":"444","type":"book_chapter","status":"public","date_updated":"2021-01-12T07:56:59Z","citation":{"chicago":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” In Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, 25–59. Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry, 2017. https://doi.org/10.1039/9781788010405-00025.","ista":"Sazanov LA. 2017.Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Mechanisms of primary energy transduction in biology . , 25–59.","mla":"Sazanov, Leonid A. “Structure of Respiratory Complex I: ‘Minimal’ Bacterial and ‘de Luxe’ Mammalian Versions.” Mechanisms of Primary Energy Transduction in Biology , edited by Mårten Wikström, Royal Society of Chemistry, 2017, pp. 25–59, doi:10.1039/9781788010405-00025.","ieee":"L. A. Sazanov, “Structure of respiratory complex I: ‘Minimal’ bacterial and ‘de luxe’ mammalian versions,” in Mechanisms of primary energy transduction in biology , M. Wikström, Ed. Royal Society of Chemistry, 2017, pp. 25–59.","short":"L.A. Sazanov, in:, M. Wikström (Ed.), Mechanisms of Primary Energy Transduction in Biology , Royal Society of Chemistry, 2017, pp. 25–59.","ama":"Sazanov LA. Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In: Wikström M, ed. Mechanisms of Primary Energy Transduction in Biology . Mechanisms of Primary Energy Transduction in Biology . Royal Society of Chemistry; 2017:25-59. doi:10.1039/9781788010405-00025","apa":"Sazanov, L. A. (2017). Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions. In M. Wikström (Ed.), Mechanisms of primary energy transduction in biology (pp. 25–59). Royal Society of Chemistry. https://doi.org/10.1039/9781788010405-00025"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7379","author":[{"first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A"}],"department":[{"_id":"LeSa"}],"editor":[{"full_name":"Wikström, Mårten","last_name":"Wikström","first_name":"Mårten"}],"title":"Structure of respiratory complex I: “Minimal” bacterial and “de luxe” mammalian versions"},{"abstract":[{"lang":"eng","text":"Most kinesin motors move in only one direction along microtubules. Members of the kinesin-5 subfamily were initially described as unidirectional plus-end-directed motors and shown to produce piconewton forces. However, some fungal kinesin-5 motors are bidirectional. The force production of a bidirectional kinesin-5 has not yet been measured. Therefore, it remains unknown whether the mechanism of the unconventional minus-end-directed motility differs fundamentally from that of plus-end-directed stepping. Using force spectroscopy, we have measured here the forces that ensembles of purified budding yeast kinesin-5 Cin8 produce in microtubule gliding assays in both plus- and minus-end direction. Correlation analysis of pause forces demonstrated that individual Cin8 molecules produce additive forces in both directions of movement. In ensembles, Cin8 motors were able to produce single-motor forces up to a magnitude of ∼1.5 pN. Hence, these properties appear to be conserved within the kinesin-5 subfamily. Force production was largely independent of the directionality of movement, indicating similarities between the motility mechanisms for both directions. These results provide constraints for the development of models for the bidirectional motility mechanism of fission yeast kinesin-5 and provide insight into the function of this mitotic motor."}],"oa_version":"Published Version","month":"11","intvolume":" 113","publication_status":"published","file":[{"creator":"system","file_size":977192,"date_updated":"2020-07-14T12:46:31Z","file_name":"IST-2018-965-v1+1_2017_Duellberg_Ensembles_of.pdf","date_created":"2018-12-12T10:14:03Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5052","checksum":"99a2474088e20ac74b1882c4fbbb45b1"}],"language":[{"iso":"eng"}],"volume":113,"issue":"9","_id":"453","article_type":"original","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":"965","date_updated":"2021-01-12T07:59:28Z","ddc":["570"],"file_date_updated":"2020-07-14T12:46:31Z","department":[{"_id":"MaLo"}],"acknowledgement":"The plasmid for full-length kinesin-1 was a gift from G. Holzwarth and J. Macosko with permission from J. Howard. We thank I. Lueke and N. I. Cade for technical assistance. G.P. thanks the Francis Crick Institute, and in particular the Surrey and Salbreux groups, for their hospitality during his sabbatical stay, as well as Imperial College London for making it possible. This work was supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK (FC001163), the United Kingdom Medical Research Council (FC001163), and the Wellcome Trust (FC001163), and by Imperial College London. J.R. was also supported by a Sir Henry Wellcome Postdoctoral Fellowship (100145/Z/12/Z) and T.S. by the European Research Council (Advanced Grant, project 323042). ","quality_controlled":"1","publisher":"Biophysical Society","oa":1,"has_accepted_license":"1","year":"2017","day":"07","publication":"Biophysical Journal","page":"2055 - 2067","doi":"10.1016/j.bpj.2017.09.006","date_published":"2017-11-07T00:00:00Z","date_created":"2018-12-11T11:46:33Z","citation":{"chicago":"Fallesen, Todd, Johanna Roostalu, Christian F Düllberg, Gunnar Pruessner, and Thomas Surrey. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal. Biophysical Society, 2017. https://doi.org/10.1016/j.bpj.2017.09.006.","ista":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. 2017. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 113(9), 2055–2067.","mla":"Fallesen, Todd, et al. “Ensembles of Bidirectional Kinesin Cin8 Produce Additive Forces in Both Directions of Movement.” Biophysical Journal, vol. 113, no. 9, Biophysical Society, 2017, pp. 2055–67, doi:10.1016/j.bpj.2017.09.006.","ieee":"T. Fallesen, J. Roostalu, C. F. Düllberg, G. Pruessner, and T. Surrey, “Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement,” Biophysical Journal, vol. 113, no. 9. Biophysical Society, pp. 2055–2067, 2017.","short":"T. Fallesen, J. Roostalu, C.F. Düllberg, G. Pruessner, T. Surrey, Biophysical Journal 113 (2017) 2055–2067.","ama":"Fallesen T, Roostalu J, Düllberg CF, Pruessner G, Surrey T. Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. 2017;113(9):2055-2067. doi:10.1016/j.bpj.2017.09.006","apa":"Fallesen, T., Roostalu, J., Düllberg, C. F., Pruessner, G., & Surrey, T. (2017). Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement. Biophysical Journal. Biophysical Society. https://doi.org/10.1016/j.bpj.2017.09.006"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7369","author":[{"full_name":"Fallesen, Todd","last_name":"Fallesen","first_name":"Todd"},{"full_name":"Roostalu, Johanna","last_name":"Roostalu","first_name":"Johanna"},{"first_name":"Christian F","id":"459064DC-F248-11E8-B48F-1D18A9856A87","last_name":"Düllberg","orcid":"0000-0001-6335-9748","full_name":"Düllberg, Christian F"},{"full_name":"Pruessner, Gunnar","last_name":"Pruessner","first_name":"Gunnar"},{"full_name":"Surrey, Thomas","last_name":"Surrey","first_name":"Thomas"}],"article_processing_charge":"No","title":"Ensembles of bidirectional kinesin Cin8 produce additive forces in both directions of movement"},{"publisher":"International Federation of Computational Logic","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2017","day":"26","publication":"Logical Methods in Computer Science","date_published":"2017-09-26T00:00:00Z","doi":"10.23638/LMCS-13(3:26)2017","date_created":"2018-12-11T11:46:37Z","article_number":"26","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science, vol. 13, no. 3, 26, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:26)2017.","short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:26)2017","apa":"Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:26)2017","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V. 2017. Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. 13(3), 26."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7357","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"article_processing_charge":"No","external_id":{"arxiv":["1410.0833"]},"title":"Improved algorithms for parity and Streett objectives","abstract":[{"lang":"eng","text":"The computation of the winning set for parity objectives and for Streett objectives in graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formedness of specifications, and the synthesis of reactive systems. We show how to compute the winning set on n vertices for (1) parity-3 (aka one-pair Streett) objectives in game graphs in time O(n5/2) and for (2) k-pair Streett objectives in graphs in time O(n2+nklogn). For both problems this gives faster algorithms for dense graphs and represents the first improvement in asymptotic running time in 15 years."}],"oa_version":"Published Version","scopus_import":"1","month":"09","intvolume":" 13","publication_identifier":{"issn":["1860-5974"]},"publication_status":"published","file":[{"date_updated":"2020-07-14T12:46:32Z","file_size":582940,"creator":"system","date_created":"2018-12-12T10:13:27Z","file_name":"IST-2018-956-v1+1_2017_Chatterjee_Improved_algorithms.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5010","checksum":"12d469ae69b80361333d7dead965cf5d"}],"language":[{"iso":"eng"}],"issue":"3","related_material":{"record":[{"relation":"earlier_version","id":"1661","status":"public"}]},"volume":13,"license":"https://creativecommons.org/licenses/by-nd/4.0/","ec_funded":1,"_id":"464","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","pubrep_id":"956","date_updated":"2023-02-23T10:08:55Z","ddc":["004"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:32Z"},{"ddc":["006"],"date_updated":"2023-02-23T12:20:26Z","department":[{"_id":"ChWo"}],"file_date_updated":"2020-07-14T12:46:34Z","_id":"470","status":"public","article_type":"original","type":"journal_article","file":[{"date_created":"2020-01-24T09:32:35Z","file_name":"wavepackets_final.pdf","creator":"wojtan","date_updated":"2020-07-14T12:46:34Z","file_size":13131683,"file_id":"7359","checksum":"82a3b2bfeee4ddef16ecc21675d1a48a","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["07300301"]},"publication_status":"published","issue":"4","volume":36,"ec_funded":1,"oa_version":"Published Version","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"This paper presents a method for simulating water surface waves as a displacement field on a 2D domain. Our method relies on Lagrangian particles that carry packets of water wave energy; each packet carries information about an entire group of wave trains, as opposed to only a single wave crest. Our approach is unconditionally stable and can simulate high resolution geometric details. This approach also presents a straightforward interface for artistic control, because it is essentially a particle system with intuitive parameters like wavelength and amplitude. Our implementation parallelizes well and runs in real time for moderately challenging scenarios.","lang":"eng"}],"month":"07","intvolume":" 36","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics, vol. 36, no. 4, 103, ACM, 2017, doi:10.1145/3072959.3073678.","ieee":"S. Jeschke and C. Wojtan, “Water wave packets,” ACM Transactions on Graphics, vol. 36, no. 4. ACM, 2017.","short":"S. Jeschke, C. Wojtan, ACM Transactions on Graphics 36 (2017).","ama":"Jeschke S, Wojtan C. Water wave packets. ACM Transactions on Graphics. 2017;36(4). doi:10.1145/3072959.3073678","apa":"Jeschke, S., & Wojtan, C. (2017). Water wave packets. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3072959.3073678","chicago":"Jeschke, Stefan, and Chris Wojtan. “Water Wave Packets.” ACM Transactions on Graphics. ACM, 2017. https://doi.org/10.1145/3072959.3073678.","ista":"Jeschke S, Wojtan C. 2017. Water wave packets. ACM Transactions on Graphics. 36(4), 103."},"title":"Water wave packets","publist_id":"7350","author":[{"last_name":"Jeschke","full_name":"Jeschke, Stefan","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan"}],"article_processing_charge":"Yes (in subscription journal)","article_number":"103","project":[{"call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales"}],"day":"01","publication":"ACM Transactions on Graphics","has_accepted_license":"1","year":"2017","doi":"10.1145/3072959.3073678","date_published":"2017-07-01T00:00:00Z","date_created":"2018-12-11T11:46:39Z","publisher":"ACM","quality_controlled":"1","oa":1},{"date_created":"2018-12-11T11:46:39Z","date_published":"2017-05-01T00:00:00Z","doi":"10.1145/3060139","year":"2017","publication":"ACM Transactions on Computational Logic (TOCL)","day":"01","oa":1,"quality_controlled":"1","publisher":"ACM","author":[{"first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"},{"last_name":"Petrov","orcid":"0000-0002-9041-0905","full_name":"Petrov, Tatjana","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87","first_name":"Tatjana"}],"publist_id":"7349","title":"Faster statistical model checking for unbounded temporal properties","citation":{"ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2. ACM, 2017.","short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 2017;18(2). doi:10.1145/3060139","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2017). Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3060139","mla":"Daca, Przemyslaw, et al. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 2, 12, ACM, 2017, doi:10.1145/3060139.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2017. Faster statistical model checking for unbounded temporal properties. ACM Transactions on Computational Logic (TOCL). 18(2), 12.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3060139."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"article_number":"12","ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1234"}]},"volume":18,"issue":"2","publication_status":"published","publication_identifier":{"issn":["15293785"]},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"scopus_import":1,"intvolume":" 18","month":"05","abstract":[{"text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds. ","lang":"eng"}],"oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"date_updated":"2023-02-21T16:48:11Z","type":"journal_article","status":"public","_id":"471"},{"related_material":{"record":[{"relation":"earlier_version","id":"10892","status":"public"}]},"volume":26,"issue":"3-4","publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"f79e8558bfe4b368dfefeb8eec2e3a5e","file_id":"4758","creator":"system","file_size":769296,"date_updated":"2020-07-14T12:46:35Z","file_name":"IST-2018-949-v1+1_2016_huber_PLanar_matchings.pdf","date_created":"2018-12-12T10:09:34Z"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"04","intvolume":" 26","abstract":[{"text":"We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:35Z","department":[{"_id":"HeEd"}],"date_updated":"2023-02-21T16:06:22Z","ddc":["004","514","516"],"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":"949","_id":"481","page":"211 - 229","date_published":"2017-04-13T00:00:00Z","doi":"10.1142/S0218195916600050","date_created":"2018-12-11T11:46:43Z","has_accepted_license":"1","year":"2017","day":"13","publication":"International Journal of Computational Geometry and Applications","publisher":"World Scientific Publishing","quality_controlled":"1","oa":1,"acknowledgement":"Supported by NSERC and the Ross and Muriel Cheriton Fellowship. Research supported by Austrian Science Fund (FWF): P25816-N15.","author":[{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan","last_name":"Huber","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peter","last_name":"Palfrader","full_name":"Palfrader, Peter"}],"publist_id":"7338","title":"Planar matchings for weighted straight skeletons","citation":{"ista":"Biedl T, Huber S, Palfrader P. 2017. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 26(3–4), 211–229.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2017. https://doi.org/10.1142/S0218195916600050.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2017). Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195916600050","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. International Journal of Computational Geometry and Applications. 2017;26(3-4):211-229. doi:10.1142/S0218195916600050","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4. World Scientific Publishing, pp. 211–229, 2017.","short":"T. Biedl, S. Huber, P. Palfrader, International Journal of Computational Geometry and Applications 26 (2017) 211–229.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” International Journal of Computational Geometry and Applications, vol. 26, no. 3–4, World Scientific Publishing, 2017, pp. 211–29, doi:10.1142/S0218195916600050."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"ec_funded":1,"volume":21,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["10950761"]},"intvolume":" 21","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1509.04631","open_access":"1"}],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"text":"We consider the dynamics of a large quantum system of N identical bosons in 3D interacting via a two-body potential of the form N3β-1w(Nβ(x - y)). For fixed 0 = β < 1/3 and large N, we obtain a norm approximation to the many-body evolution in the Nparticle Hilbert space. The leading order behaviour of the dynamics is determined by Hartree theory while the second order is given by Bogoliubov theory.","lang":"eng"}],"department":[{"_id":"RoSe"}],"date_updated":"2021-01-12T08:00:58Z","status":"public","type":"journal_article","_id":"484","date_created":"2018-12-11T11:46:43Z","date_published":"2017-01-01T00:00:00Z","doi":"10.4310/ATMP.2017.v21.n3.a4","page":"683 - 738","publication":"Advances in Theoretical and Mathematical Physics","day":"01","year":"2017","oa":1,"publisher":"International Press","quality_controlled":"1","title":"Bogoliubov correction to the mean-field dynamics of interacting bosons","author":[{"last_name":"Nam","full_name":"Nam, Phan","first_name":"Phan","id":"404092F4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Napiórkowski","full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87","first_name":"Marcin M"}],"publist_id":"7336","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Nam P, Napiórkowski MM. 2017. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 21(3), 683–738.","chicago":"Nam, Phan, and Marcin M Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a4.","ama":"Nam P, Napiórkowski MM. Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. 2017;21(3):683-738. doi:10.4310/ATMP.2017.v21.n3.a4","apa":"Nam, P., & Napiórkowski, M. M. (2017). Bogoliubov correction to the mean-field dynamics of interacting bosons. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a4","ieee":"P. Nam and M. M. Napiórkowski, “Bogoliubov correction to the mean-field dynamics of interacting bosons,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 683–738, 2017.","short":"P. Nam, M.M. Napiórkowski, Advances in Theoretical and Mathematical Physics 21 (2017) 683–738.","mla":"Nam, Phan, and Marcin M. Napiórkowski. “Bogoliubov Correction to the Mean-Field Dynamics of Interacting Bosons.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 683–738, doi:10.4310/ATMP.2017.v21.n3.a4."},"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}]},{"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T08:00:57Z","status":"public","type":"journal_article","_id":"483","ec_funded":1,"volume":21,"issue":"3","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["10950761"]},"intvolume":" 21","month":"08","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02312"}],"scopus_import":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We prove the universality for the eigenvalue gap statistics in the bulk of the spectrum for band matrices, in the regime where the band width is comparable with the dimension of the matrix, W ~ N. All previous results concerning universality of non-Gaussian random matrices are for mean-field models. By relying on a new mean-field reduction technique, we deduce universality from quantum unique ergodicity for band matrices."}],"title":"Universality for a class of random band matrices","author":[{"first_name":"Paul","full_name":"Bourgade, Paul","last_name":"Bourgade"},{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Yau","full_name":"Yau, Horng","first_name":"Horng"},{"last_name":"Yin","full_name":"Yin, Jun","first_name":"Jun"}],"publist_id":"7337","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"P. Bourgade, L. Erdös, H. Yau, and J. Yin, “Universality for a class of random band matrices,” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3. International Press, pp. 739–800, 2017.","short":"P. Bourgade, L. Erdös, H. Yau, J. Yin, Advances in Theoretical and Mathematical Physics 21 (2017) 739–800.","apa":"Bourgade, P., Erdös, L., Yau, H., & Yin, J. (2017). Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. International Press. https://doi.org/10.4310/ATMP.2017.v21.n3.a5","ama":"Bourgade P, Erdös L, Yau H, Yin J. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 2017;21(3):739-800. doi:10.4310/ATMP.2017.v21.n3.a5","mla":"Bourgade, Paul, et al. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics, vol. 21, no. 3, International Press, 2017, pp. 739–800, doi:10.4310/ATMP.2017.v21.n3.a5.","ista":"Bourgade P, Erdös L, Yau H, Yin J. 2017. Universality for a class of random band matrices. Advances in Theoretical and Mathematical Physics. 21(3), 739–800.","chicago":"Bourgade, Paul, László Erdös, Horng Yau, and Jun Yin. “Universality for a Class of Random Band Matrices.” Advances in Theoretical and Mathematical Physics. International Press, 2017. https://doi.org/10.4310/ATMP.2017.v21.n3.a5."},"project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_created":"2018-12-11T11:46:43Z","date_published":"2017-08-25T00:00:00Z","doi":"10.4310/ATMP.2017.v21.n3.a5","page":"739 - 800","publication":"Advances in Theoretical and Mathematical Physics","day":"25","year":"2017","oa":1,"publisher":"International Press","quality_controlled":"1"},{"month":"11","scopus_import":1,"quality_controlled":"1","publisher":"ACM","oa_version":"None","abstract":[{"lang":"eng","text":"In this paper we study network architecture for unlicensed cellular networking for outdoor coverage in TV white spaces. The main technology proposed for TV white spaces is 802.11af, a Wi-Fi variant adapted for TV frequencies. However, 802.11af is originally designed for improved indoor propagation. We show that long links, typical for outdoor use, exacerbate known Wi-Fi issues, such as hidden and exposed terminal, and significantly reduce its efficiency. Instead, we propose CellFi, an alternative architecture based on LTE. LTE is designed for long-range coverage and throughput efficiency, but it is also designed to operate in tightly controlled and centrally managed networks. CellFi overcomes these problems by designing an LTE-compatible spectrum database component, mandatory for TV white space networking, and introducing an interference management component for distributed coordination. CellFi interference management is compatible with existing LTE mechanisms, requires no explicit communication between base stations, and is more efficient than CSMA for long links. We evaluate our design through extensive real world evaluation on of-the-shelf LTE equipment and simulations. We show that, compared to 802.11af, it increases coverage by 40% and reduces median flow completion times by 2.3x."}],"date_created":"2018-12-11T11:46:45Z","doi":"10.1145/3143361.3143367","date_published":"2017-11-28T00:00:00Z","page":"2 - 14","language":[{"iso":"eng"}],"publication":"Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies","day":"28","year":"2017","publication_status":"published","publication_identifier":{"isbn":["978-145035422-6"]},"status":"public","conference":{"start_date":"2017-12-12","location":"Incheon, South Korea","end_date":"2017-12-15","name":"CoNEXT: Conference on emerging Networking EXperiments and Technologies"},"type":"conference","_id":"487","title":"Towards unlicensed cellular networks in TV white spaces","department":[{"_id":"DaAl"}],"author":[{"first_name":"Ghufran","last_name":"Baig","full_name":"Baig, Ghufran"},{"full_name":"Radunovic, Bozidar","last_name":"Radunovic","first_name":"Bozidar"},{"last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"Matthew","last_name":"Balkwill","full_name":"Balkwill, Matthew"},{"first_name":"Thomas","full_name":"Karagiannis, Thomas","last_name":"Karagiannis"},{"full_name":"Qiu, Lili","last_name":"Qiu","first_name":"Lili"}],"publist_id":"7333","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:21:11Z","citation":{"mla":"Baig, Ghufran, et al. “Towards Unlicensed Cellular Networks in TV White Spaces.” Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14, doi:10.1145/3143361.3143367.","apa":"Baig, G., Radunovic, B., Alistarh, D.-A., Balkwill, M., Karagiannis, T., & Qiu, L. (2017). Towards unlicensed cellular networks in TV white spaces. In Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies (pp. 2–14). Incheon, South Korea: ACM. https://doi.org/10.1145/3143361.3143367","ama":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. Towards unlicensed cellular networks in TV white spaces. In: Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies. ACM; 2017:2-14. doi:10.1145/3143361.3143367","ieee":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, and L. Qiu, “Towards unlicensed cellular networks in TV white spaces,” in Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies, Incheon, South Korea, 2017, pp. 2–14.","short":"G. Baig, B. Radunovic, D.-A. Alistarh, M. Balkwill, T. Karagiannis, L. Qiu, in:, Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, ACM, 2017, pp. 2–14.","chicago":"Baig, Ghufran, Bozidar Radunovic, Dan-Adrian Alistarh, Matthew Balkwill, Thomas Karagiannis, and Lili Qiu. “Towards Unlicensed Cellular Networks in TV White Spaces.” In Proceedings of the 2017 13th International Conference on Emerging Networking EXperiments and Technologies, 2–14. ACM, 2017. https://doi.org/10.1145/3143361.3143367.","ista":"Baig G, Radunovic B, Alistarh D-A, Balkwill M, Karagiannis T, Qiu L. 2017. Towards unlicensed cellular networks in TV white spaces. Proceedings of the 2017 13th International Conference on emerging Networking EXperiments and Technologies. CoNEXT: Conference on emerging Networking EXperiments and Technologies, 2–14."}},{"quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"doi":"10.1038/ncomms16032","date_published":"2017-07-01T00:00:00Z","date_created":"2018-12-11T11:46:54Z","has_accepted_license":"1","year":"2017","day":"01","publication":"Nature Communications","article_number":"16032","publist_id":"7305","author":[{"first_name":"Jean","full_name":"Simonnet, Jean","last_name":"Simonnet"},{"first_name":"Mérie","last_name":"Nassar","full_name":"Nassar, Mérie"},{"last_name":"Stella","full_name":"Stella, Federico","orcid":"0000-0001-9439-3148","first_name":"Federico","id":"39AF1E74-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ivan","full_name":"Cohen, Ivan","last_name":"Cohen"},{"last_name":"Mathon","full_name":"Mathon, Bertrand","first_name":"Bertrand"},{"last_name":"Boccara","full_name":"Boccara, Charlotte","orcid":"0000-0001-7237-5109","id":"3FC06552-F248-11E8-B48F-1D18A9856A87","first_name":"Charlotte"},{"first_name":"Richard","last_name":"Miles","full_name":"Miles, Richard"},{"first_name":"Desdemona","last_name":"Fricker","full_name":"Fricker, Desdemona"}],"title":"Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum","citation":{"ieee":"J. Simonnet et al., “Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum,” Nature Communications, vol. 8. Nature Publishing Group, 2017.","short":"J. Simonnet, M. Nassar, F. Stella, I. Cohen, B. Mathon, C.N. Boccara, R. Miles, D. Fricker, Nature Communications 8 (2017).","ama":"Simonnet J, Nassar M, Stella F, et al. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 2017;8. doi:10.1038/ncomms16032","apa":"Simonnet, J., Nassar, M., Stella, F., Cohen, I., Mathon, B., Boccara, C. N., … Fricker, D. (2017). Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms16032","mla":"Simonnet, Jean, et al. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications, vol. 8, 16032, Nature Publishing Group, 2017, doi:10.1038/ncomms16032.","ista":"Simonnet J, Nassar M, Stella F, Cohen I, Mathon B, Boccara CN, Miles R, Fricker D. 2017. Activity dependent feedback inhibition may maintain head direction signals in mouse presubiculum. Nature Communications. 8, 16032.","chicago":"Simonnet, Jean, Mérie Nassar, Federico Stella, Ivan Cohen, Bertrand Mathon, Charlotte N. Boccara, Richard Miles, and Desdemona Fricker. “Activity Dependent Feedback Inhibition May Maintain Head Direction Signals in Mouse Presubiculum.” Nature Communications. Nature Publishing Group, 2017. https://doi.org/10.1038/ncomms16032."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"month":"07","intvolume":" 8","abstract":[{"text":"Orientation in space is represented in specialized brain circuits. Persistent head direction signals are transmitted from anterior thalamus to the presubiculum, but the identity of the presubicular target neurons, their connectivity and function in local microcircuits are unknown. Here, we examine how thalamic afferents recruit presubicular principal neurons and Martinotti interneurons, and the ensuing synaptic interactions between these cells. Pyramidal neuron activation of Martinotti cells in superficial layers is strongly facilitating such that high-frequency head directional stimulation efficiently unmutes synaptic excitation. Martinotti-cell feedback plays a dual role: precisely timed spikes may not inhibit the firing of in-tune head direction cells, while exerting lateral inhibition. Autonomous attractor dynamics emerge from a modelled network implementing wiring motifs and timing sensitive synaptic interactions in the pyramidal - Martinotti-cell feedback loop. This inhibitory microcircuit is therefore tuned to refine and maintain head direction information in the presubiculum.","lang":"eng"}],"oa_version":"Published Version","volume":8,"publication_identifier":{"issn":["20411723"]},"publication_status":"published","file":[{"date_updated":"2020-07-14T12:46:36Z","file_size":2948357,"creator":"system","date_created":"2018-12-12T10:14:31Z","file_name":"IST-2018-937-v1+1_2017_Stella_Activity_dependent.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"5083","checksum":"76d8a2b72a58e56adb410ec37dfa7eee"}],"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":"937","_id":"514","file_date_updated":"2020-07-14T12:46:36Z","department":[{"_id":"JoCs"}],"date_updated":"2021-01-12T08:01:16Z","ddc":["571"]},{"file":[{"date_updated":"2020-07-14T12:46:36Z","file_size":4118385,"creator":"lsazanov","date_created":"2019-11-07T12:51:07Z","file_name":"29893_2_merged_1501257589_red.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_id":"6993","checksum":"9bc7e8c41b43636dd7566289e511f096"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["15459993"]},"publication_status":"published","issue":"10","volume":24,"ec_funded":1,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The oxidative phosphorylation electron transport chain (OXPHOS-ETC) of the inner mitochondrial membrane is composed of five large protein complexes, named CI-CV. These complexes convert energy from the food we eat into ATP, a small molecule used to power a multitude of essential reactions throughout the cell. OXPHOS-ETC complexes are organized into supercomplexes (SCs) of defined stoichiometry: CI forms a supercomplex with CIII2 and CIV (SC I+III2+IV, known as the respirasome), as well as with CIII2 alone (SC I+III2). CIII2 forms a supercomplex with CIV (SC III2+IV) and CV forms dimers (CV2). Recent cryo-EM studies have revealed the structures of SC I+III2+IV and SC I+III2. Furthermore, recent work has shed light on the assembly and function of the SCs. Here we review and compare these recent studies and discuss how they have advanced our understanding of mitochondrial electron transport."}],"month":"10","intvolume":" 24","scopus_import":1,"ddc":["572"],"date_updated":"2021-01-12T08:01:17Z","file_date_updated":"2020-07-14T12:46:36Z","department":[{"_id":"LeSa"}],"_id":"515","status":"public","type":"journal_article","article_type":"original","day":"05","publication":"Nature Structural and Molecular Biology","has_accepted_license":"1","year":"2017","date_published":"2017-10-05T00:00:00Z","doi":"10.1038/nsmb.3460","date_created":"2018-12-11T11:46:54Z","page":"800 - 808","publisher":"Nature Publishing Group","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Letts, James A., and Leonid A. Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology, vol. 24, no. 10, Nature Publishing Group, 2017, pp. 800–08, doi:10.1038/nsmb.3460.","short":"J.A. Letts, L.A. Sazanov, Nature Structural and Molecular Biology 24 (2017) 800–808.","ieee":"J. A. Letts and L. A. Sazanov, “Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain,” Nature Structural and Molecular Biology, vol. 24, no. 10. Nature Publishing Group, pp. 800–808, 2017.","ama":"Letts JA, Sazanov LA. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 2017;24(10):800-808. doi:10.1038/nsmb.3460","apa":"Letts, J. A., & Sazanov, L. A. (2017). Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.3460","chicago":"Letts, James A, and Leonid A Sazanov. “Clarifying the Supercomplex: The Higher-Order Organization of the Mitochondrial Electron Transport Chain.” Nature Structural and Molecular Biology. Nature Publishing Group, 2017. https://doi.org/10.1038/nsmb.3460.","ista":"Letts JA, Sazanov LA. 2017. Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain. Nature Structural and Molecular Biology. 24(10), 800–808."},"title":"Clarifying the supercomplex: The higher-order organization of the mitochondrial electron transport chain","author":[{"id":"322DA418-F248-11E8-B48F-1D18A9856A87","first_name":"James A","last_name":"Letts","orcid":"0000-0002-9864-3586","full_name":"Letts, James A"},{"first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","last_name":"Sazanov"}],"publist_id":"7304","project":[{"grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}]},{"department":[{"_id":"BjHo"}],"title":"Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence","author":[{"full_name":"Klotz, Lukasz","orcid":"0000-0003-1740-7635","last_name":"Klotz","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87","first_name":"Lukasz"},{"id":"4787FE80-F248-11E8-B48F-1D18A9856A87","first_name":"Grégoire M","full_name":"Lemoult, Grégoire M","last_name":"Lemoult"},{"first_name":"Idalia","last_name":"Frontczak","full_name":"Frontczak, Idalia"},{"last_name":"Tuckerman","full_name":"Tuckerman, Laurette","first_name":"Laurette"},{"first_name":"José","last_name":"Wesfreid","full_name":"Wesfreid, José"}],"publist_id":"7306","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:01:16Z","citation":{"ista":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. 2017. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2(4), 043904.","chicago":"Klotz, Lukasz, Grégoire M Lemoult, Idalia Frontczak, Laurette Tuckerman, and José Wesfreid. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids. American Physical Society, 2017. https://doi.org/10.1103/PhysRevFluids.2.043904.","ieee":"L. Klotz, G. M. Lemoult, I. Frontczak, L. Tuckerman, and J. Wesfreid, “Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence,” Physical Review Fluids, vol. 2, no. 4. American Physical Society, 2017.","short":"L. Klotz, G.M. Lemoult, I. Frontczak, L. Tuckerman, J. Wesfreid, Physical Review Fluids 2 (2017).","apa":"Klotz, L., Lemoult, G. M., Frontczak, I., Tuckerman, L., & Wesfreid, J. (2017). Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.2.043904","ama":"Klotz L, Lemoult GM, Frontczak I, Tuckerman L, Wesfreid J. Couette-Poiseuille flow experiment with zero mean advection velocity: Subcritical transition to turbulence. Physical Review Fluids. 2017;2(4). doi:10.1103/PhysRevFluids.2.043904","mla":"Klotz, Lukasz, et al. “Couette-Poiseuille Flow Experiment with Zero Mean Advection Velocity: Subcritical Transition to Turbulence.” Physical Review Fluids, vol. 2, no. 4, 043904, American Physical Society, 2017, doi:10.1103/PhysRevFluids.2.043904."},"status":"public","type":"journal_article","article_number":"043904","_id":"513","issue":"4","doi":"10.1103/PhysRevFluids.2.043904","date_published":"2017-04-01T00:00:00Z","volume":2,"date_created":"2018-12-11T11:46:54Z","day":"01","publication":"Physical Review Fluids","language":[{"iso":"eng"}],"publication_status":"published","year":"2017","month":"04","intvolume":" 2","scopus_import":1,"publisher":"American Physical Society","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1704.02619","open_access":"1"}],"oa":1,"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present an experimental setup that creates a shear flow with zero mean advection velocity achieved by counterbalancing the nonzero streamwise pressure gradient by moving boundaries, which generates plane Couette-Poiseuille flow. We obtain experimental results in the transitional regime for this flow. Using flow visualization, we characterize the subcritical transition to turbulence in Couette-Poiseuille flow and show the existence of turbulent spots generated by a permanent perturbation. Due to the zero mean advection velocity of the base profile, these turbulent structures are nearly stationary. We distinguish two regions of the turbulent spot: the active turbulent core, which is characterized by waviness of the streaks similar to traveling waves, and the surrounding region, which includes in addition the weak undisturbed streaks and oblique waves at the laminar-turbulent interface. We also study the dependence of the size of these two regions on Reynolds number. Finally, we show that the traveling waves move in the downstream (Poiseuille) direction."}]},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["21615063"]},"publication_status":"published","issue":"3","volume":6,"oa_version":"None","pmid":1,"abstract":[{"text":"Cyanobacteria are mostly engineered to be sustainable cell-factories by genetic manipulations alone. Here, by modulating the concentration of allosteric effectors, we focus on increasing product formation without further burdening the cells with increased expression of enzymes. Resorting to a novel 96-well microplate cultivation system for cyanobacteria, and using lactate-producing strains of Synechocystis PCC6803 expressing different l-lactate dehydrogenases (LDH), we titrated the effect of 2,5-anhydro-mannitol supplementation. The latter acts in cells as a nonmetabolizable analogue of fructose 1,6-bisphosphate, a known allosteric regulator of one of the tested LDHs. In this strain (SAA023), we achieved over 2-fold increase of lactate productivity. Furthermore, we observed that as carbon is increasingly deviated during growth toward product formation, there is an increased fixation rate in the population of spontaneous mutants harboring an impaired production pathway. This is a challenge in the development of green cell factories, which may be countered by the incorporation in biotechnological processes of strategies such as the one pioneered here.","lang":"eng"}],"month":"03","intvolume":" 6","scopus_import":1,"date_updated":"2021-01-12T08:01:21Z","department":[{"_id":"ToBo"}],"_id":"520","status":"public","article_type":"letter_note","type":"journal_article","day":"17","publication":"ACS Synthetic Biology","year":"2017","date_published":"2017-03-17T00:00:00Z","doi":"10.1021/acssynbio.6b00235","date_created":"2018-12-11T11:46:56Z","page":"395 - 401","quality_controlled":"1","publisher":"American Chemical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Du W, Angermayr A, Jongbloets J, Molenaar D, Bachmann H, Hellingwerf K, Branco Dos Santos F. 2017. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 6(3), 395–401.","chicago":"Du, Wei, Andreas Angermayr, Joeri Jongbloets, Douwe Molenaar, Herwig Bachmann, Klaas Hellingwerf, and Filipe Branco Dos Santos. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic Biology. American Chemical Society, 2017. https://doi.org/10.1021/acssynbio.6b00235.","ama":"Du W, Angermayr A, Jongbloets J, et al. Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. 2017;6(3):395-401. doi:10.1021/acssynbio.6b00235","apa":"Du, W., Angermayr, A., Jongbloets, J., Molenaar, D., Bachmann, H., Hellingwerf, K., & Branco Dos Santos, F. (2017). Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803. ACS Synthetic Biology. American Chemical Society. https://doi.org/10.1021/acssynbio.6b00235","short":"W. Du, A. Angermayr, J. Jongbloets, D. Molenaar, H. Bachmann, K. Hellingwerf, F. Branco Dos Santos, ACS Synthetic Biology 6 (2017) 395–401.","ieee":"W. Du et al., “Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803,” ACS Synthetic Biology, vol. 6, no. 3. American Chemical Society, pp. 395–401, 2017.","mla":"Du, Wei, et al. “Nonhierarchical Flux Regulation Exposes the Fitness Burden Associated with Lactate Production in Synechocystis Sp. PCC6803.” ACS Synthetic Biology, vol. 6, no. 3, American Chemical Society, 2017, pp. 395–401, doi:10.1021/acssynbio.6b00235."},"title":"Nonhierarchical flux regulation exposes the fitness burden associated with lactate production in Synechocystis sp. PCC6803","publist_id":"7298","author":[{"first_name":"Wei","full_name":"Du, Wei","last_name":"Du"},{"id":"4677C796-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Angermayr","full_name":"Angermayr, Andreas","orcid":"0000-0001-8619-2223"},{"first_name":"Joeri","full_name":"Jongbloets, Joeri","last_name":"Jongbloets"},{"first_name":"Douwe","last_name":"Molenaar","full_name":"Molenaar, Douwe"},{"first_name":"Herwig","full_name":"Bachmann, Herwig","last_name":"Bachmann"},{"first_name":"Klaas","last_name":"Hellingwerf","full_name":"Hellingwerf, Klaas"},{"first_name":"Filipe","last_name":"Branco Dos Santos","full_name":"Branco Dos Santos, Filipe"}],"external_id":{"pmid":["27936615"]}},{"date_created":"2018-12-11T11:46:56Z","date_published":"2017-01-01T00:00:00Z","doi":"10.1016/j.topol.2016.10.005","volume":215,"page":"45 - 57","language":[{"iso":"eng"}],"publication":"Topology and its Applications","day":"01","year":"2017","publication_status":"published","publication_identifier":{"issn":["01668641"]},"intvolume":" 215","month":"01","main_file_link":[{"url":"https://arxiv.org/abs/1608.03954v1","open_access":"1"}],"oa":1,"publisher":"Elsevier","quality_controlled":"1","oa_version":"Submitted Version","abstract":[{"text":"Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.","lang":"eng"}],"title":"Higson compactification and dimension raising","department":[{"_id":"HeEd"}],"publist_id":"7299","author":[{"last_name":"Austin","full_name":"Austin, Kyle","first_name":"Kyle"},{"full_name":"Virk, Ziga","last_name":"Virk","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","first_name":"Ziga"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:01:21Z","citation":{"mla":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications, vol. 215, Elsevier, 2017, pp. 45–57, doi:10.1016/j.topol.2016.10.005.","short":"K. Austin, Z. Virk, Topology and Its Applications 215 (2017) 45–57.","ieee":"K. Austin and Z. Virk, “Higson compactification and dimension raising,” Topology and its Applications, vol. 215. Elsevier, pp. 45–57, 2017.","ama":"Austin K, Virk Z. Higson compactification and dimension raising. Topology and its Applications. 2017;215:45-57. doi:10.1016/j.topol.2016.10.005","apa":"Austin, K., & Virk, Z. (2017). Higson compactification and dimension raising. Topology and Its Applications. Elsevier. https://doi.org/10.1016/j.topol.2016.10.005","chicago":"Austin, Kyle, and Ziga Virk. “Higson Compactification and Dimension Raising.” Topology and Its Applications. Elsevier, 2017. https://doi.org/10.1016/j.topol.2016.10.005.","ista":"Austin K, Virk Z. 2017. Higson compactification and dimension raising. Topology and its Applications. 215, 45–57."},"status":"public","type":"journal_article","_id":"521"},{"abstract":[{"text":"We investigate the complexity of finding an embedded non-orientable surface of Euler genus g in a triangulated 3-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into 3-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.","lang":"eng"}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1602.07907","open_access":"1"}],"month":"06","intvolume":" 58","publication_identifier":{"issn":["01795376"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"earlier_version","id":"1379","status":"public"}]},"issue":"4","volume":58,"_id":"534","article_type":"original","type":"journal_article","status":"public","date_updated":"2023-02-21T17:01:34Z","department":[{"_id":"UlWa"}],"quality_controlled":"1","publisher":"Springer","oa":1,"year":"2017","day":"09","publication":"Discrete & Computational Geometry","page":"871 - 888","date_published":"2017-06-09T00:00:00Z","doi":"10.1007/s00454-017-9900-0","date_created":"2018-12-11T11:47:01Z","citation":{"ista":"Burton B, de Mesmay AN, Wagner U. 2017. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 58(4), 871–888.","chicago":"Burton, Benjamin, Arnaud N de Mesmay, and Uli Wagner. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry. Springer, 2017. https://doi.org/10.1007/s00454-017-9900-0.","ieee":"B. Burton, A. N. de Mesmay, and U. Wagner, “Finding non-orientable surfaces in 3-Manifolds,” Discrete & Computational Geometry, vol. 58, no. 4. Springer, pp. 871–888, 2017.","short":"B. Burton, A.N. de Mesmay, U. Wagner, Discrete & Computational Geometry 58 (2017) 871–888.","ama":"Burton B, de Mesmay AN, Wagner U. Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. 2017;58(4):871-888. doi:10.1007/s00454-017-9900-0","apa":"Burton, B., de Mesmay, A. N., & Wagner, U. (2017). Finding non-orientable surfaces in 3-Manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-017-9900-0","mla":"Burton, Benjamin, et al. “Finding Non-Orientable Surfaces in 3-Manifolds.” Discrete & Computational Geometry, vol. 58, no. 4, Springer, 2017, pp. 871–88, doi:10.1007/s00454-017-9900-0."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7283","author":[{"full_name":"Burton, Benjamin","last_name":"Burton","first_name":"Benjamin"},{"first_name":"Arnaud N","id":"3DB2F25C-F248-11E8-B48F-1D18A9856A87","full_name":"De Mesmay, Arnaud N","last_name":"De Mesmay"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568"}],"external_id":{"arxiv":["1602.07907"]},"article_processing_charge":"No","title":"Finding non-orientable surfaces in 3-Manifolds"},{"day":"20","publication":"Angewandte Chemie","has_accepted_license":"1","year":"2017","doi":"10.1002/ange.201611998","date_published":"2017-05-20T00:00:00Z","date_created":"2018-12-11T11:47:02Z","page":"4679 - 4682","publisher":"Wiley","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Kainrath, Stephanie, Manuela Stadler, Eva Gschaider-Reichhart, Martin Distel, and Harald L Janovjak. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie. Wiley, 2017. https://doi.org/10.1002/ange.201611998.","ista":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. 2017. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 129(16), 4679–4682.","mla":"Kainrath, Stephanie, et al. “Grünlicht-Induzierte Rezeptorinaktivierung Durch Cobalamin-Bindende Domänen.” Angewandte Chemie, vol. 129, no. 16, Wiley, 2017, pp. 4679–82, doi:10.1002/ange.201611998.","short":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, H.L. Janovjak, Angewandte Chemie 129 (2017) 4679–4682.","ieee":"S. Kainrath, M. Stadler, E. Gschaider-Reichhart, M. Distel, and H. L. Janovjak, “Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen,” Angewandte Chemie, vol. 129, no. 16. Wiley, pp. 4679–4682, 2017.","ama":"Kainrath S, Stadler M, Gschaider-Reichhart E, Distel M, Janovjak HL. Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. 2017;129(16):4679-4682. doi:10.1002/ange.201611998","apa":"Kainrath, S., Stadler, M., Gschaider-Reichhart, E., Distel, M., & Janovjak, H. L. (2017). Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201611998"},"title":"Grünlicht-induzierte Rezeptorinaktivierung durch Cobalamin-bindende Domänen","publist_id":"7279","author":[{"last_name":"Kainrath","full_name":"Kainrath, Stephanie","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87","first_name":"Stephanie"},{"first_name":"Manuela","full_name":"Stadler, Manuela","last_name":"Stadler"},{"orcid":"0000-0002-7218-7738","full_name":"Gschaider-Reichhart, Eva","last_name":"Gschaider-Reichhart","id":"3FEE232A-F248-11E8-B48F-1D18A9856A87","first_name":"Eva"},{"first_name":"Martin","last_name":"Distel","full_name":"Distel, Martin"},{"last_name":"Janovjak","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L"}],"project":[{"_id":"25548C20-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Microbial Ion Channels for Synthetic Neurobiology","grant_number":"303564"},{"grant_number":"W1232-B24","name":"Molecular Drug Targets","call_identifier":"FWF","_id":"255A6082-B435-11E9-9278-68D0E5697425"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"d66fee867e7cdbfa3fe276c2fb0778bb","file_id":"5007","file_size":1668557,"date_updated":"2020-07-14T12:46:39Z","creator":"system","file_name":"IST-2018-932-v1+1_Kainrath_et_al-2017-Angewandte_Chemie.pdf","date_created":"2018-12-12T10:13:24Z"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":129,"issue":"16","ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"ger","text":"Optogenetik und Photopharmakologie ermöglichen präzise räumliche und zeitliche Kontrolle von Proteinwechselwirkung und -funktion in Zellen und Tieren. Optogenetische Methoden, die auf grünes Licht ansprechen und zum Trennen von Proteinkomplexen geeignet sind, sind nichtweitläufig verfügbar, würden jedoch mehrfarbige Experimente zur Beantwortung von biologischen Fragestellungen ermöglichen. Hier demonstrieren wir die Verwendung von Cobalamin(Vitamin B12)-bindenden Domänen von bakteriellen CarH-Transkriptionsfaktoren zur Grünlicht-induzierten Dissoziation von Rezeptoren. Fusioniert mit dem Fibroblasten-W achstumsfaktor-Rezeptor 1 führten diese im Dunkeln in kultivierten Zellen zu Signalaktivität durch Oligomerisierung, welche durch Beleuchten umgehend aufgehoben wurde. In Zebrafischembryonen, die einen derartigen Rezeptor exprimieren, ermöglichte grünes Licht die Kontrolle über abnormale Signalaktivität während der Embryonalentwicklung. "}],"month":"05","intvolume":" 129","ddc":["571"],"date_updated":"2021-01-12T08:01:33Z","file_date_updated":"2020-07-14T12:46:39Z","department":[{"_id":"CaGu"},{"_id":"HaJa"}],"_id":"538","status":"public","pubrep_id":"932","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)"}},{"oa_version":"Published Version","abstract":[{"lang":"eng","text":"RNA-dependent RNA polymerases (RdRps) play a key role in the life cycle of RNA viruses and impact their immunobiology. The arenavirus lymphocytic choriomeningitis virus (LCMV) strain Clone 13 provides a benchmark model for studying chronic infection. A major genetic determinant for its ability to persist maps to a single amino acid exchange in the viral L protein, which exhibits RdRp activity, yet its functional consequences remain elusive. To unravel the L protein interactions with the host proteome, we engineered infectious L protein-tagged LCMV virions by reverse genetics. A subsequent mass-spectrometric analysis of L protein pulldowns from infected human cells revealed a comprehensive network of interacting host proteins. The obtained LCMV L protein interactome was bioinformatically integrated with known host protein interactors of RdRps from other RNA viruses, emphasizing interconnected modules of human proteins. Functional characterization of selected interactors highlighted proviral (DDX3X) as well as antiviral (NKRF, TRIM21) host factors. To corroborate these findings, we infected Trim21-/-mice with LCMV and found impaired virus control in chronic infection. These results provide insights into the complex interactions of the arenavirus LCMV and other viral RdRps with the host proteome and contribute to a better molecular understanding of how chronic viruses interact with their host."}],"month":"12","intvolume":" 13","scopus_import":1,"file":[{"checksum":"1aa20f19a1e90664fadce6e7d5284fdc","file_id":"4944","access_level":"open_access","relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:12:26Z","file_name":"IST-2018-931-v1+1_journal.ppat.1006758.pdf","creator":"system","date_updated":"2020-07-14T12:46:44Z","file_size":4106772}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["15537366"]},"publication_status":"published","issue":"12","volume":13,"_id":"540","status":"public","pubrep_id":"931","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["576","616"],"date_updated":"2021-01-12T08:01:48Z","department":[{"_id":"GaNo"}],"file_date_updated":"2020-07-14T12:46:44Z","quality_controlled":"1","publisher":"Public Library of Science","oa":1,"day":"01","publication":"PLoS Pathogens","has_accepted_license":"1","year":"2017","doi":"10.1371/journal.ppat.1006758","date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:47:03Z","article_number":"e1006758","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Khamina K, Lercher A, Caldera M, et al. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 2017;13(12). doi:10.1371/journal.ppat.1006758","apa":"Khamina, K., Lercher, A., Caldera, M., Schliehe, C., Vilagos, B., Sahin, M., … Bergthaler, A. (2017). Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. Public Library of Science. https://doi.org/10.1371/journal.ppat.1006758","short":"K. Khamina, A. Lercher, M. Caldera, C. Schliehe, B. Vilagos, M. Sahin, L. Kosack, A. Bhattacharya, P. Májek, A. Stukalov, R. Sacco, L. James, D. Pinschewer, K. Bennett, J. Menche, A. Bergthaler, PLoS Pathogens 13 (2017).","ieee":"K. Khamina et al., “Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein,” PLoS Pathogens, vol. 13, no. 12. Public Library of Science, 2017.","mla":"Khamina, Kseniya, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens, vol. 13, no. 12, e1006758, Public Library of Science, 2017, doi:10.1371/journal.ppat.1006758.","ista":"Khamina K, Lercher A, Caldera M, Schliehe C, Vilagos B, Sahin M, Kosack L, Bhattacharya A, Májek P, Stukalov A, Sacco R, James L, Pinschewer D, Bennett K, Menche J, Bergthaler A. 2017. Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein. PLoS Pathogens. 13(12), e1006758.","chicago":"Khamina, Kseniya, Alexander Lercher, Michael Caldera, Christopher Schliehe, Bojan Vilagos, Mehmet Sahin, Lindsay Kosack, et al. “Characterization of Host Proteins Interacting with the Lymphocytic Choriomeningitis Virus L Protein.” PLoS Pathogens. Public Library of Science, 2017. https://doi.org/10.1371/journal.ppat.1006758."},"title":"Characterization of host proteins interacting with the lymphocytic choriomeningitis virus L protein","author":[{"last_name":"Khamina","full_name":"Khamina, Kseniya","first_name":"Kseniya"},{"full_name":"Lercher, Alexander","last_name":"Lercher","first_name":"Alexander"},{"last_name":"Caldera","full_name":"Caldera, Michael","first_name":"Michael"},{"full_name":"Schliehe, Christopher","last_name":"Schliehe","first_name":"Christopher"},{"full_name":"Vilagos, Bojan","last_name":"Vilagos","first_name":"Bojan"},{"first_name":"Mehmet","full_name":"Sahin, Mehmet","last_name":"Sahin"},{"full_name":"Kosack, Lindsay","last_name":"Kosack","first_name":"Lindsay"},{"first_name":"Anannya","last_name":"Bhattacharya","full_name":"Bhattacharya, Anannya"},{"first_name":"Peter","last_name":"Májek","full_name":"Májek, Peter"},{"first_name":"Alexey","full_name":"Stukalov, Alexey","last_name":"Stukalov"},{"first_name":"Roberto","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","last_name":"Sacco","full_name":"Sacco, Roberto"},{"last_name":"James","full_name":"James, Leo","first_name":"Leo"},{"first_name":"Daniel","full_name":"Pinschewer, Daniel","last_name":"Pinschewer"},{"last_name":"Bennett","full_name":"Bennett, Keiryn","first_name":"Keiryn"},{"first_name":"Jörg","full_name":"Menche, Jörg","last_name":"Menche"},{"first_name":"Andreas","last_name":"Bergthaler","full_name":"Bergthaler, Andreas"}],"publist_id":"7276"},{"citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.","ista":"Chatterjee K, Křetínská Z, Kretinsky J. 2017. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 13(2), 15.","mla":"Chatterjee, Krishnendu, et al. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science, vol. 13, no. 2, 15, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(2:15)2017.","ama":"Chatterjee K, Křetínská Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. 2017;13(2). doi:10.23638/LMCS-13(2:15)2017","apa":"Chatterjee, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(2:15)2017","short":"K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation of Computational Logic, 2017."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7355","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Zuzana","full_name":"Křetínská, Zuzana","last_name":"Křetínská"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","article_number":"15","project":[{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309","_id":"2590DB08-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"has_accepted_license":"1","year":"2017","day":"03","publication":"Logical Methods in Computer Science","date_published":"2017-07-03T00:00:00Z","doi":"10.23638/LMCS-13(2:15)2017","date_created":"2018-12-11T11:46:38Z","quality_controlled":"1","publisher":"International Federation of Computational Logic","oa":1,"date_updated":"2023-02-23T12:26:16Z","ddc":["004"],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:33Z","_id":"466","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"status":"public","pubrep_id":"957","publication_identifier":{"issn":["18605974"]},"publication_status":"published","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"bfa405385ec6229ad5ead89ab5751639","file_id":"5354","creator":"system","date_updated":"2020-07-14T12:46:33Z","file_size":511832,"date_created":"2018-12-12T10:18:32Z","file_name":"IST-2018-957-v1+1_2017_Chatterjee_Unifying_two.pdf"}],"language":[{"iso":"eng"}],"volume":13,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1657"},{"id":"5429","status":"public","relation":"earlier_version"},{"id":"5435","status":"public","relation":"earlier_version"}]},"issue":"2","ec_funded":1,"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"oa_version":"Published Version","scopus_import":1,"month":"07","intvolume":" 13"},{"_id":"467","type":"journal_article","status":"public","date_updated":"2023-02-23T12:26:19Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"abstract":[{"text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata or in any other known decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata, which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in runtime verification. We establish an almost-complete decidability picture for the basic decision problems about nested weighted automata and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.","lang":"eng"}],"oa_version":"Preprint","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1606.03598","open_access":"1"}],"month":"12","intvolume":" 18","publication_identifier":{"issn":["15293785"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"4","related_material":{"record":[{"status":"public","id":"1656","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5415"},{"relation":"earlier_version","status":"public","id":"5436"}]},"volume":18,"ec_funded":1,"article_number":"31","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 18(4), 31.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4. ACM, 2017.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/3152769","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions on Computational Logic (TOCL). 2017;18(4). doi:10.1145/3152769","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL), vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7354","external_id":{"arxiv":["1606.03598"]},"title":"Nested weighted automata","quality_controlled":"1","publisher":"ACM","oa":1,"year":"2017","day":"01","publication":"ACM Transactions on Computational Logic (TOCL)","doi":"10.1145/3152769","date_published":"2017-12-01T00:00:00Z","date_created":"2018-12-11T11:46:38Z"},{"oa":1,"quality_controlled":"1","publisher":"International Federation of Computational Logic","date_created":"2018-12-11T11:46:37Z","doi":"10.23638/LMCS-13(3:23)2017","date_published":"2017-09-13T00:00:00Z","publication":"Logical Methods in Computer Science","day":"13","year":"2017","has_accepted_license":"1","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"}],"title":"Edit distance for pushdown automata","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","last_name":"Otop","first_name":"Jan"}],"publist_id":"7356","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for pushdown automata. Logical Methods in Computer Science. 13(3).","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science, vol. 13, no. 3, International Federation of Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017"},"intvolume":" 13","month":"09","scopus_import":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The edit distance between two words w 1 , w 2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the edit distance from L 1 to L 2 is the minimal number k such that for every word from L 1 there exists a word in L 2 with edit distance at most k . We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for the following problems: (1) deciding whether, for a given threshold k , the edit distance from a pushdown automaton to a finite automaton is at most k , and (2) deciding whether the edit distance from a pushdown automaton to a finite automaton is finite. "}],"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1610"},{"id":"5438","status":"public","relation":"earlier_version"}]},"volume":13,"issue":"3","language":[{"iso":"eng"}],"file":[{"file_size":279071,"date_updated":"2020-07-14T12:46:33Z","creator":"system","file_name":"IST-2015-321-v1+1_main.pdf","date_created":"2018-12-12T10:14:37Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5090","checksum":"08041379ba408d40664f449eb5907a8f"},{"creator":"system","file_size":279071,"date_updated":"2020-07-14T12:46:33Z","file_name":"IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf","date_created":"2018-12-12T10:14:38Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"08041379ba408d40664f449eb5907a8f","file_id":"5091"}],"publication_status":"published","publication_identifier":{"issn":["18605974"]},"pubrep_id":"955","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"type":"journal_article","_id":"465","file_date_updated":"2020-07-14T12:46:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"ddc":["004"],"date_updated":"2023-02-23T12:26:25Z"},{"publication_identifier":{"issn":["20452322"]},"publication_status":"published","file":[{"file_id":"5357","checksum":"7d05cbdd914e194a019c0f91fb64e9a8","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2018-938-v1+1_2017_Pavlogiannis_Amplification_on.pdf","date_created":"2018-12-12T10:18:35Z","file_size":1536783,"date_updated":"2020-07-14T12:46:36Z","creator":"system"}],"language":[{"iso":"eng"}],"volume":7,"issue":"1","related_material":{"record":[{"status":"public","id":"5449","relation":"earlier_version"}]},"ec_funded":1,"abstract":[{"text":"The fixation probability is the probability that a new mutant introduced in a homogeneous population eventually takes over the entire population. The fixation probability is a fundamental quantity of natural selection, and known to depend on the population structure. Amplifiers of natural selection are population structures which increase the fixation probability of advantageous mutants, as compared to the baseline case of well-mixed populations. In this work we focus on symmetric population structures represented as undirected graphs. In the regime of undirected graphs, the strongest amplifier known has been the Star graph, and the existence of undirected graphs with stronger amplification properties has remained open for over a decade. In this work we present the Comet and Comet-swarm families of undirected graphs. We show that for a range of fitness values of the mutants, the Comet and Cometswarm graphs have fixation probability strictly larger than the fixation probability of the Star graph, for fixed population size and at the limit of large populations, respectively. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"month":"03","intvolume":" 7","date_updated":"2023-02-23T12:26:57Z","ddc":["004"],"file_date_updated":"2020-07-14T12:46:36Z","department":[{"_id":"KrCh"}],"_id":"512","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":"938","has_accepted_license":"1","year":"2017","day":"06","publication":"Scientific Reports","doi":"10.1038/s41598-017-00107-w","date_published":"2017-03-06T00:00:00Z","date_created":"2018-12-11T11:46:53Z","quality_controlled":"1","publisher":"Nature Publishing Group","oa":1,"citation":{"mla":"Pavlogiannis, Andreas, et al. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports, vol. 7, no. 1, 82, Nature Publishing Group, 2017, doi:10.1038/s41598-017-00107-w.","ama":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 2017;7(1). doi:10.1038/s41598-017-00107-w","apa":"Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w","short":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).","ieee":"A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, “Amplification on undirected population structures: Comets beat stars,” Scientific Reports, vol. 7, no. 1. Nature Publishing Group, 2017.","chicago":"Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.","ista":"Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2017. Amplification on undirected population structures: Comets beat stars. Scientific Reports. 7(1), 82."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"7307","author":[{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas"},{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"article_processing_charge":"No","title":"Amplification on undirected population structures: Comets beat stars","article_number":"82","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}]},{"citation":{"chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158118.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2(POPL), 30.","mla":"Chatterjee, Krishnendu, et al. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 30, Association for Computing Machinery, 2017, doi:10.1145/3158118.","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, “Optimal Dyck reachability for data-dependence and Alias analysis,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158118","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and Alias analysis. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158118"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"external_id":{"arxiv":["1910.00241"]},"article_processing_charge":"No","title":"Optimal Dyck reachability for data-dependence and Alias analysis","article_number":"30","project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"has_accepted_license":"1","year":"2017","day":"27","publication":"Proceedings of the ACM on Programming Languages","date_published":"2017-12-27T00:00:00Z","doi":"10.1145/3158118","date_created":"2021-12-05T23:01:48Z","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).\r\n","quality_controlled":"1","publisher":"Association for Computing Machinery","oa":1,"date_updated":"2023-02-23T12:27:13Z","ddc":["000"],"file_date_updated":"2021-12-07T08:06:28Z","department":[{"_id":"KrCh"}],"_id":"10416","article_type":"original","type":"journal_article","conference":{"name":"POPL: Programming Languages","end_date":"2018-01-13","location":"Los Angeles, CA, United States","start_date":"2018-01-07"},"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","publication_identifier":{"eissn":["2475-1421"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"faa3f7b3fe8aab84b50ed805c26a0ee5","file_id":"10421","creator":"cchlebak","file_size":460188,"date_updated":"2021-12-07T08:06:28Z","file_name":"2017_ACMProgLang_Chatterjee.pdf","date_created":"2021-12-07T08:06:28Z"}],"language":[{"iso":"eng"}],"issue":"POPL","volume":2,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5455"}]},"ec_funded":1,"abstract":[{"lang":"eng","text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows: First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph with n nodes and m edges, we present: (i) an algorithm with worst-case running time O(m + n · α(n)), where α(n) is the inverse Ackermann function, improving the previously known O(n2) time bound; (ii) a matching lower bound that shows that our algorithm is optimal wrt to worst-case complexity; and (iii) an optimal average-case upper bound of O(m) time, improving the previously known O(m · logn) bound. Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtain analysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites. Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean Matrix Multiplication, which is a long-standing open problem. Thus we establish that the existing combinatorial algorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform all existing methods on the two problems, over real-world benchmarks."}],"oa_version":"Published Version","scopus_import":"1","month":"12","intvolume":" 2"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.","ista":"Chatterjee K, Choudhary B, Pavlogiannis A. 2017. Optimal Dyck reachability for data-dependence and alias analysis, IST Austria, 37p.","mla":"Chatterjee, Krishnendu, et al. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017, doi:10.15479/AT:IST-2017-870-v1-1.","apa":"Chatterjee, K., Choudhary, B., & Pavlogiannis, A. (2017). Optimal Dyck reachability for data-dependence and alias analysis. IST Austria. https://doi.org/10.15479/AT:IST-2017-870-v1-1","ama":"Chatterjee K, Choudhary B, Pavlogiannis A. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria; 2017. doi:10.15479/AT:IST-2017-870-v1-1","ieee":"K. Chatterjee, B. Choudhary, and A. Pavlogiannis, Optimal Dyck reachability for data-dependence and alias analysis. IST Austria, 2017.","short":"K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017."},"title":"Optimal Dyck reachability for data-dependence and alias analysis","article_processing_charge":"No","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Choudhary, Bhavya","last_name":"Choudhary","first_name":"Bhavya"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis"}],"oa":1,"publisher":"IST Austria","day":"23","year":"2017","has_accepted_license":"1","date_created":"2018-12-12T11:39:26Z","doi":"10.15479/AT:IST-2017-870-v1-1","date_published":"2017-10-23T00:00:00Z","page":"37","_id":"5455","pubrep_id":"870","status":"public","type":"technical_report","ddc":["000"],"date_updated":"2023-02-21T15:54:10Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:46:59Z","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graphwhere the edges are labeled with different types of opening and closing parentheses, and the reachabilityinformation is computed via paths whose parentheses are properly matched. We present new results for Dyckreachability problems with applications to alias analysis and data-dependence analysis. Our main contributions,that include improved upper bounds as well as lower bounds that establish optimality guarantees, are asfollows:First, we consider Dyck reachability on bidirected graphs, which is the standard way of performing field-sensitive points-to analysis. Given a bidirected graph withnnodes andmedges, we present: (i) an algorithmwith worst-case running timeO(m+n·α(n)), whereα(n)is the inverse Ackermann function, improving thepreviously knownO(n2)time bound; (ii) a matching lower bound that shows that our algorithm is optimalwrt to worst-case complexity; and (iii) an optimal average-case upper bound ofO(m)time, improving thepreviously knownO(m·logn)bound.Second, we consider the problem of context-sensitive data-dependence analysis, where the task is to obtainanalysis summaries of library code in the presence of callbacks. Our algorithm preprocesses libraries in almostlinear time, after which the contribution of the library in the complexity of the client analysis is only linear,and only wrt the number of call sites.Third, we prove that combinatorial algorithms for Dyck reachability on general graphs with truly sub-cubic bounds cannot be obtained without obtaining sub-cubic combinatorial algorithms for Boolean MatrixMultiplication, which is a long-standing open problem. Thus we establish that the existing combinatorialalgorithms for Dyck reachability are (conditionally) optimal for general graphs. We also show that the samehardness holds for graphs of constant treewidth.Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependenceanalysis. Our experimental evaluation demonstrates that the new algorithms significantly outperform allexisting methods on the two problems, over real-world benchmarks."}],"month":"10","alternative_title":["IST Austria Technical Report"],"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"177a84a46e3ac17e87b31534ad16a4c9","file_id":"5524","date_updated":"2020-07-14T12:46:59Z","file_size":960491,"creator":"system","date_created":"2018-12-12T11:54:02Z","file_name":"IST-2017-870-v1+1_main.pdf"}],"publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"related_material":{"record":[{"relation":"later_version","status":"public","id":"10416"}]}},{"date_published":"2017-06-26T00:00:00Z","date_created":"2018-12-12T11:39:24Z","publication_date":"2017-06-26","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5483","checksum":"6321792dcfa82bf490f17615a9b22355","creator":"system","date_updated":"2020-07-14T12:46:59Z","file_size":3460985,"date_created":"2018-12-12T11:53:22Z","file_name":"IST-2017-724-v1+1_DataRep_Project_Report_2017.pdf"}],"day":"26","year":"2017","month":"06","publisher":"IST Austria","oa":1,"main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/724."}],"abstract":[{"text":"In this report the implementation of the institutional data repository IST DataRep at IST Austria will be covered: Starting with the research phase when requirements for a repository were established, the procedure of choosing a repository-software and its customization based on the results of user-testings will be discussed. Followed by reflections on the marketing strategies in regard of impact, and at the end sharing some experiences of one year operating IST DataRep.","lang":"eng"}],"department":[{"_id":"E-Lib"}],"title":"Implementing the institutional data repository IST DataRep","file_date_updated":"2020-07-14T12:46:59Z","author":[{"last_name":"Petritsch","full_name":"Barbara Petritsch","orcid":"0000-0003-2724-4614","first_name":"Barbara","id":"406048EC-F248-11E8-B48F-1D18A9856A87"}],"extern":0,"date_updated":"2020-07-14T23:05:03Z","citation":{"ista":"Petritsch B. 2017. Implementing the institutional data repository IST DataRep, IST Austria,p.","chicago":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017.","apa":"Petritsch, B. (2017). Implementing the institutional data repository IST DataRep. IST Austria.","ama":"Petritsch B. Implementing the Institutional Data Repository IST DataRep. IST Austria; 2017.","ieee":"B. Petritsch, Implementing the institutional data repository IST DataRep. IST Austria, 2017.","short":"B. Petritsch, Implementing the Institutional Data Repository IST DataRep, IST Austria, 2017.","mla":"Petritsch, Barbara. Implementing the Institutional Data Repository IST DataRep. IST Austria, 2017."},"status":"public","pubrep_id":"724","type":"report","_id":"5450"},{"_id":"10417","status":"public","conference":{"name":"POPL: Programming Languages","location":"Los Angeles, CA, United States","end_date":"2018-01-13","start_date":"2018-01-07"},"article_type":"original","type":"journal_article","date_updated":"2023-02-23T12:27:16Z","department":[{"_id":"KrCh"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence."}],"intvolume":" 2","month":"12","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3158119","open_access":"1"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"eissn":["2475-1421"]},"ec_funded":1,"volume":2,"issue":"POPL","related_material":{"record":[{"status":"public","id":"5448","relation":"earlier_version"},{"relation":"earlier_version","status":"public","id":"5456"}]},"article_number":"31","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017. https://doi.org/10.1145/3158119.","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:10.1145/3158119.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2017;2(POPL). doi:10.1145/3158119","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” Proceedings of the ACM on Programming Languages, vol. 2, no. POPL. Association for Computing Machinery, 2017.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017)."},"title":"Data-centric dynamic partial order reduction","external_id":{"arxiv":["1610.01188"]},"article_processing_charge":"No","author":[{"first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"last_name":"Sinha","full_name":"Sinha, Nishant","first_name":"Nishant"},{"last_name":"Vaidya","full_name":"Vaidya, Kapil","first_name":"Kapil"}],"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","oa":1,"quality_controlled":"1","publisher":"Association for Computing Machinery","publication":"Proceedings of the ACM on Programming Languages","day":"27","year":"2017","date_created":"2021-12-05T23:01:49Z","doi":"10.1145/3158119","date_published":"2017-12-27T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"date_updated":"2023-02-23T12:26:54Z","citation":{"ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction, IST Austria, 36p.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.","ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, Data-centric dynamic partial order reduction. IST Austria, 2017.","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-Centric Dynamic Partial Order Reduction. IST Austria; 2017. doi:10.15479/AT:IST-2017-872-v1-1","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. IST Austria. https://doi.org/10.15479/AT:IST-2017-872-v1-1","mla":"Chalupa, Marek, et al. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017, doi:10.15479/AT:IST-2017-872-v1-1."},"department":[{"_id":"KrCh"}],"title":"Data-centric dynamic partial order reduction","file_date_updated":"2020-07-14T12:46:59Z","author":[{"full_name":"Chalupa, Marek","last_name":"Chalupa","first_name":"Marek"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"first_name":"Nishant","last_name":"Sinha","full_name":"Sinha, Nishant"},{"full_name":"Vaidya, Kapil","last_name":"Vaidya","first_name":"Kapil"}],"_id":"5456","status":"public","pubrep_id":"872","type":"technical_report","day":"23","file":[{"file_size":910347,"date_updated":"2020-07-14T12:46:59Z","creator":"system","file_name":"IST-2017-872-v1+1_main.pdf","date_created":"2018-12-12T11:53:26Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"5487","checksum":"d2635c4cf013000f0a1b09e80f9e4ab7"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","year":"2017","publication_status":"published","date_published":"2017-10-23T00:00:00Z","doi":"10.15479/AT:IST-2017-872-v1-1","related_material":{"record":[{"id":"10417","status":"public","relation":"later_version"},{"id":"5448","status":"public","relation":"earlier_version"}]},"date_created":"2018-12-12T11:39:26Z","page":"36","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1. For acyclic architectures, our algorithm is guaranteed to explore exactly one representative trace from each observation class, while spending polynomial time per class. Hence, our algorithm is optimal wrt the observation equivalence, and in several cases explores exponentially fewer traces than any enumerative method based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider an equivalence between traces which is finer than the observation equivalence; but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence. \r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show a significant reduction in both running time and the number of explored equivalence classes."}],"month":"10","alternative_title":["IST Austria Technical Report"],"publisher":"IST Austria","oa":1},{"publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"5322","checksum":"2eed5224c0e4e259484a1d71acb8ba6a","creator":"system","file_size":535077,"date_updated":"2020-07-14T12:47:00Z","file_name":"IST-2018-924-v1+1_LIPIcs-MFCS-2017-61.pdf","date_created":"2018-12-12T10:18:04Z"}],"language":[{"iso":"eng"}],"volume":83,"abstract":[{"text":"Evolutionary graph theory studies the evolutionary dynamics in a population structure given as a connected graph. Each node of the graph represents an individual of the population, and edges determine how offspring are placed. We consider the classical birth-death Moran process where there are two types of individuals, namely, the residents with fitness 1 and mutants with fitness r. The fitness indicates the reproductive strength. The evolutionary dynamics happens as follows: in the initial step, in a population of all resident individuals a mutant is introduced, and then at each step, an individual is chosen proportional to the fitness of its type to reproduce, and the offspring replaces a neighbor uniformly at random. The process stops when all individuals are either residents or mutants. The probability that all individuals in the end are mutants is called the fixation probability, which is a key factor in the rate of evolution. We consider the problem of approximating the fixation probability. The class of algorithms that is extremely relevant for approximation of the fixation probabilities is the Monte-Carlo simulation of the process. Previous results present a polynomial-time Monte-Carlo algorithm for undirected graphs when r is given in unary. First, we present a simple modification: instead of simulating each step, we discard ineffective steps, where no node changes type (i.e., either residents replace residents, or mutants replace mutants). Using the above simple modification and our result that the number of effective steps is concentrated around the expected number of effective steps, we present faster polynomial-time Monte-Carlo algorithms for undirected graphs. Our algorithms are always at least a factor O(n2/ log n) faster as compared to the previous algorithms, where n is the number of nodes, and is polynomial even if r is given in binary. We also present lower bounds showing that the upper bound on the expected number of effective steps we present is asymptotically tight for undirected graphs. ","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LIPIcs"],"scopus_import":1,"month":"11","intvolume":" 83","date_updated":"2021-01-12T08:02:34Z","ddc":["004"],"file_date_updated":"2020-07-14T12:47:00Z","department":[{"_id":"KrCh"}],"_id":"551","type":"conference","conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","location":"Aalborg, Denmark","end_date":"2017-08-25","start_date":"2017-08-21"},"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":"924","has_accepted_license":"1","year":"2017","day":"01","publication":"Leibniz International Proceedings in Informatics","date_published":"2017-11-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2017.61","date_created":"2018-12-11T11:47:08Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” Leibniz International Proceedings in Informatics, vol. 83, 61, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.61.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ama":"Chatterjee K, Ibsen-Jensen R, Nowak M. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.61","apa":"Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2017). Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.61","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.","ista":"Chatterjee K, Ibsen-Jensen R, Nowak M. 2017. Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 61."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"7263","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"title":"Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs","article_number":"61"},{"department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:00Z","date_updated":"2023-02-14T10:06:46Z","ddc":["004"],"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"conference":{"start_date":"2017-08-21","end_date":"2017-08-25","location":"Aalborg, Denmark","name":"MFCS: Mathematical Foundations of Computer Science (SG)"},"type":"conference","pubrep_id":"923","status":"public","_id":"552","license":"https://creativecommons.org/licenses/by/3.0/","ec_funded":1,"volume":83,"publication_status":"published","publication_identifier":{"isbn":["978-395977046-0"]},"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2018-923-v1+1_LIPIcs-MFCS-2017-39.pdf","date_created":"2018-12-12T10:16:57Z","creator":"system","file_size":610339,"date_updated":"2020-07-14T12:47:00Z","file_id":"5248","checksum":"c67f4866ddbfd555afef1f63ae9a8fc7","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"alternative_title":["LIPIcs"],"scopus_import":"1","intvolume":" 83","month":"11","abstract":[{"lang":"eng","text":"Graph games provide the foundation for modeling and synthesis of reactive processes. Such games are played over graphs where the vertices are controlled by two adversarial players. We consider graph games where the objective of the first player is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a meanpayoff condition). There are two variants of the problem, namely, the threshold problem where the quantitative goal is to ensure that the mean-payoff value is above a threshold, and the value problem where the quantitative goal is to ensure the optimal mean-payoff value; in both cases ensuring the qualitative parity objective. The previous best-known algorithms for game graphs with n vertices, m edges, parity objectives with d priorities, and maximal absolute reward value W for mean-payoff objectives, are as follows: O(nd+1 . m . w) for the threshold problem, and O(nd+2 · m · W) for the value problem. Our main contributions are faster algorithms, and the running times of our algorithms are as follows: O(nd-1 · m ·W) for the threshold problem, and O(nd · m · W · log(n · W)) for the value problem. For mean-payoff parity objectives with two priorities, our algorithms match the best-known bounds of the algorithms for mean-payoff games (without conjunction with parity objectives). Our results are relevant in synthesis of reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective)."}],"oa_version":"Published Version","article_processing_charge":"No","publist_id":"7262","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"title":"Faster algorithms for mean-payoff parity games","citation":{"ama":"Chatterjee K, Henzinger MH, Svozil A. Faster algorithms for mean-payoff parity games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.39","apa":"Chatterjee, K., Henzinger, M. H., & Svozil, A. (2017). Faster algorithms for mean-payoff parity games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.39","ieee":"K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.","short":"K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Mean-Payoff Parity Games.” Leibniz International Proceedings in Informatics, vol. 83, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.39.","ista":"Chatterjee K, Henzinger MH, Svozil A. 2017. Faster algorithms for mean-payoff parity games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 39.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11407","name":"Game Theory"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"39","date_created":"2018-12-11T11:47:08Z","date_published":"2017-11-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2017.39","year":"2017","has_accepted_license":"1","publication":"Leibniz International Proceedings in Informatics","day":"01","oa":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1"},{"article_number":"55","citation":{"chicago":"Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.","ista":"Chatterjee K, Hansen K, Ibsen-Jensen R. 2017. Strategy complexity of concurrent safety games. Leibniz International Proceedings in Informatics. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 83, 55.","mla":"Chatterjee, Krishnendu, et al. “Strategy Complexity of Concurrent Safety Games.” Leibniz International Proceedings in Informatics, vol. 83, 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.MFCS.2017.55.","apa":"Chatterjee, K., Hansen, K., & Ibsen-Jensen, R. (2017). Strategy complexity of concurrent safety games. In Leibniz International Proceedings in Informatics (Vol. 83). Aalborg, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2017.55","ama":"Chatterjee K, Hansen K, Ibsen-Jensen R. Strategy complexity of concurrent safety games. In: Leibniz International Proceedings in Informatics. Vol 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.MFCS.2017.55","short":"K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","ieee":"K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hansen","full_name":"Hansen, Kristofer","first_name":"Kristofer"},{"last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7261","title":"Strategy complexity of concurrent safety games","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2017","day":"01","publication":"Leibniz International Proceedings in Informatics","date_published":"2017-11-01T00:00:00Z","doi":"10.4230/LIPIcs.MFCS.2017.55","date_created":"2018-12-11T11:47:08Z","_id":"553","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","start_date":"2017-08-21","end_date":"2017-08-25","location":"Aalborg, Denmark"},"status":"public","pubrep_id":"922","date_updated":"2021-01-12T08:02:35Z","ddc":["004"],"file_date_updated":"2020-07-14T12:47:00Z","department":[{"_id":"KrCh"}],"abstract":[{"text":"We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. Player 1 wins iff a designated goal state is eventually visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed. Our main results are as follows: We show that: (i) the optimal bound on the patience of optimal and -optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"main_file_link":[{"url":"https://arxiv.org/abs/1506.02434","open_access":"1"}],"month":"11","intvolume":" 83","publication_identifier":{"isbn":["978-395977046-0"]},"publication_status":"published","file":[{"file_name":"IST-2018-922-v1+1_LIPIcs-MFCS-2017-55.pdf","date_created":"2018-12-12T10:09:29Z","file_size":549967,"date_updated":"2020-07-14T12:47:00Z","creator":"system","checksum":"7101facb56ade363205c695d72dbd173","file_id":"4753","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"volume":83},{"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"article_number":"0104","title":"On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions","publist_id":"7256","author":[{"last_name":"Gerencser","full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","first_name":"Mate"},{"first_name":"Arnulf","last_name":"Jentzen","full_name":"Jentzen, Arnulf"},{"full_name":"Salimova, Diyora","last_name":"Salimova","first_name":"Diyora"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"M. Gerencser, A. Jentzen, and D. Salimova, “On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207. Royal Society of London, 2017.","short":"M. Gerencser, A. Jentzen, D. Salimova, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 473 (2017).","apa":"Gerencser, M., Jentzen, A., & Salimova, D. (2017). On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2017.0104","ama":"Gerencser M, Jentzen A, Salimova D. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2017;473(2207). doi:10.1098/rspa.2017.0104","mla":"Gerencser, Mate, et al. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 473, no. 2207, 0104, Royal Society of London, 2017, doi:10.1098/rspa.2017.0104.","ista":"Gerencser M, Jentzen A, Salimova D. 2017. On stochastic differential equations with arbitrarily slow convergence rates for strong approximation in two space dimensions. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 473(2207), 0104.","chicago":"Gerencser, Mate, Arnulf Jentzen, and Diyora Salimova. “On Stochastic Differential Equations with Arbitrarily Slow Convergence Rates for Strong Approximation in Two Space Dimensions.” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2017. https://doi.org/10.1098/rspa.2017.0104."},"publisher":"Royal Society of London","quality_controlled":"1","oa":1,"doi":"10.1098/rspa.2017.0104","date_published":"2017-11-01T00:00:00Z","date_created":"2018-12-11T11:47:11Z","day":"01","publication":"Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences","year":"2017","status":"public","type":"journal_article","_id":"560","department":[{"_id":"JaMa"}],"date_updated":"2021-01-12T08:03:04Z","month":"11","intvolume":" 473","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/1702.03229","open_access":"1"}],"oa_version":"Submitted Version","abstract":[{"text":"In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14, 1477–1500 (doi:10.4310/CMS.2016.v14. n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ? {4, 5, . . .}, there exist d-dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two (d = 2) and three (d = 3) space dimensions.","lang":"eng"}],"volume":473,"issue":"2207","ec_funded":1,"language":[{"iso":"eng"}],"publication_identifier":{"issn":["13645021"]},"publication_status":"published"},{"project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28, American Mathematical Society, 2017, doi:10.1090/cln/028.","short":"L. Erdös, H. Yau, A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 2017.","ieee":"L. Erdös and H. Yau, A Dynamical Approach to Random Matrix Theory, vol. 28. American Mathematical Society, 2017.","ama":"Erdös L, Yau H. A Dynamical Approach to Random Matrix Theory. Vol 28. American Mathematical Society; 2017. doi:10.1090/cln/028","apa":"Erdös, L., & Yau, H. (2017). A Dynamical Approach to Random Matrix Theory (Vol. 28). American Mathematical Society. https://doi.org/10.1090/cln/028","chicago":"Erdös, László, and Horng Yau. A Dynamical Approach to Random Matrix Theory. Vol. 28. Courant Lecture Notes. American Mathematical Society, 2017. https://doi.org/10.1090/cln/028.","ista":"Erdös L, Yau H. 2017. A Dynamical Approach to Random Matrix Theory, American Mathematical Society, 226p."},"title":"A Dynamical Approach to Random Matrix Theory","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603"},{"first_name":"Horng","full_name":"Yau, Horng","last_name":"Yau"}],"publist_id":"7247","article_processing_charge":"No","publisher":"American Mathematical Society","quality_controlled":"1","day":"01","year":"2017","doi":"10.1090/cln/028","date_published":"2017-01-01T00:00:00Z","date_created":"2018-12-11T11:47:13Z","page":"226","_id":"567","series_title":"Courant Lecture Notes","status":"public","type":"book","date_updated":"2022-05-24T06:57:28Z","department":[{"_id":"LaEr"}],"oa_version":"None","abstract":[{"text":"This book is a concise and self-contained introduction of recent techniques to prove local spectral universality for large random matrices. Random matrix theory is a fast expanding research area, and this book mainly focuses on the methods that the authors participated in developing over the past few years. Many other interesting topics are not included, and neither are several new developments within the framework of these methods. The authors have chosen instead to present key concepts that they believe are the core of these methods and should be relevant for future applications. They keep technicalities to a minimum to make the book accessible to graduate students. With this in mind, they include in this book the basic notions and tools for high-dimensional analysis, such as large deviation, entropy, Dirichlet form, and the logarithmic Sobolev inequality.\r\n","lang":"eng"}],"month":"01","intvolume":" 28","alternative_title":["Courant Lecture Notes"],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-1-4704-4194-4"],"isbn":["9-781-4704-3648-3"]},"publication_status":"published","volume":28,"ec_funded":1},{"oa_version":"Submitted Version","abstract":[{"text":"We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C).","lang":"eng"}],"intvolume":" 19","month":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.04310"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["15320073"]},"ec_funded":1,"issue":"2","volume":19,"_id":"568","status":"public","type":"journal_article","date_updated":"2021-01-12T08:03:12Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"oa":1,"quality_controlled":"1","publisher":"International Press","publication":"Homology, Homotopy and Applications","day":"01","year":"2017","date_created":"2018-12-11T11:47:14Z","date_published":"2017-01-01T00:00:00Z","doi":"10.4310/HHA.2017.v19.n2.a16","page":"313 - 342","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"short":"P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.","ieee":"P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.","ama":"Franek P, Krcál M. Persistence of zero sets. Homology, Homotopy and Applications. 2017;19(2):313-342. doi:10.4310/HHA.2017.v19.n2.a16","apa":"Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16","mla":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications, vol. 19, no. 2, International Press, 2017, pp. 313–42, doi:10.4310/HHA.2017.v19.n2.a16.","ista":"Franek P, Krcál M. 2017. Persistence of zero sets. Homology, Homotopy and Applications. 19(2), 313–342.","chicago":"Franek, Peter, and Marek Krcál. “Persistence of Zero Sets.” Homology, Homotopy and Applications. International Press, 2017. https://doi.org/10.4310/HHA.2017.v19.n2.a16."},"title":"Persistence of zero sets","author":[{"full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál","full_name":"Krcál, Marek"}],"publist_id":"7246"},{"abstract":[{"text":"Most phenotypes are determined by molecular systems composed of specifically interacting molecules. However, unlike for individual components, little is known about the distributions of mutational effects of molecular systems as a whole. We ask how the distribution of mutational effects of a transcriptional regulatory system differs from the distributions of its components, by first independently, and then simultaneously, mutating a transcription factor and the associated promoter it represses. We find that the system distribution exhibits increased phenotypic variation compared to individual component distributions - an effect arising from intermolecular epistasis between the transcription factor and its DNA-binding site. In large part, this epistasis can be qualitatively attributed to the structure of the transcriptional regulatory system and could therefore be a common feature in prokaryotes. Counter-intuitively, intermolecular epistasis can alleviate the constraints of individual components, thereby increasing phenotypic variation that selection could act on and facilitating adaptive evolution. ","lang":"eng"}],"oa_version":"Published Version","scopus_import":1,"intvolume":" 6","month":"11","publication_status":"published","publication_identifier":{"issn":["2050084X"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2020-07-14T12:47:10Z","file_size":8453470,"creator":"system","date_created":"2018-12-12T10:14:42Z","file_name":"IST-2017-918-v1+1_elife-28921-figures-v3.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"273ab17f33305e4eaafd911ff88e7c5b","file_id":"5096"},{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"b433f90576c7be597cd43367946f8e7f","file_id":"5097","date_updated":"2020-07-14T12:47:10Z","file_size":1953221,"creator":"system","date_created":"2018-12-12T10:14:43Z","file_name":"IST-2017-918-v1+2_elife-28921-v3.pdf"}],"ec_funded":1,"volume":6,"_id":"570","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","pubrep_id":"918","status":"public","date_updated":"2021-01-12T08:03:15Z","ddc":["576"],"file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"CaGu"},{"_id":"JoBo"},{"_id":"NiBa"}],"oa":1,"quality_controlled":"1","publisher":"eLife Sciences Publications","year":"2017","has_accepted_license":"1","publication":"eLife","day":"13","date_created":"2018-12-11T11:47:14Z","date_published":"2017-11-13T00:00:00Z","doi":"10.7554/eLife.28921","article_number":"e28921","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Selective Barriers to Horizontal Gene Transfer","grant_number":"648440","call_identifier":"H2020","_id":"2578D616-B435-11E9-9278-68D0E5697425"}],"citation":{"mla":"Lagator, Mato, et al. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife, vol. 6, e28921, eLife Sciences Publications, 2017, doi:10.7554/eLife.28921.","short":"M. Lagator, S. Sarikas, H. Acar, J.P. Bollback, C.C. Guet, ELife 6 (2017).","ieee":"M. Lagator, S. Sarikas, H. Acar, J. P. Bollback, and C. C. Guet, “Regulatory network structure determines patterns of intermolecular epistasis,” eLife, vol. 6. eLife Sciences Publications, 2017.","ama":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 2017;6. doi:10.7554/eLife.28921","apa":"Lagator, M., Sarikas, S., Acar, H., Bollback, J. P., & Guet, C. C. (2017). Regulatory network structure determines patterns of intermolecular epistasis. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.28921","chicago":"Lagator, Mato, Srdjan Sarikas, Hande Acar, Jonathan P Bollback, and Calin C Guet. “Regulatory Network Structure Determines Patterns of Intermolecular Epistasis.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.28921.","ista":"Lagator M, Sarikas S, Acar H, Bollback JP, Guet CC. 2017. Regulatory network structure determines patterns of intermolecular epistasis. eLife. 6, e28921."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Lagator, Mato","last_name":"Lagator","first_name":"Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87"},{"id":"35F0286E-F248-11E8-B48F-1D18A9856A87","first_name":"Srdjan","full_name":"Sarikas, Srdjan","last_name":"Sarikas"},{"last_name":"Acar","orcid":"0000-0003-1986-9753","full_name":"Acar, Hande","first_name":"Hande","id":"2DDF136A-F248-11E8-B48F-1D18A9856A87"},{"id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P","full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612","last_name":"Bollback"},{"full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7244","title":"Regulatory network structure determines patterns of intermolecular epistasis"},{"has_accepted_license":"1","year":"2017","day":"06","publication":"eLife","date_published":"2017-11-06T00:00:00Z","doi":"10.7554/eLife.30867","date_created":"2018-12-11T11:47:14Z","quality_controlled":"1","publisher":"eLife Sciences Publications","oa":1,"citation":{"short":"F. Spira, S. Cuylen Haering, S. Mehta, M. Samwer, A. Reversat, A. Verma, R. Oldenbourg, M.K. Sixt, D. Gerlich, ELife 6 (2017).","ieee":"F. Spira et al., “Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments,” eLife, vol. 6. eLife Sciences Publications, 2017.","ama":"Spira F, Cuylen Haering S, Mehta S, et al. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 2017;6. doi:10.7554/eLife.30867","apa":"Spira, F., Cuylen Haering, S., Mehta, S., Samwer, M., Reversat, A., Verma, A., … Gerlich, D. (2017). Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.30867","mla":"Spira, Felix, et al. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife, vol. 6, e30867, eLife Sciences Publications, 2017, doi:10.7554/eLife.30867.","ista":"Spira F, Cuylen Haering S, Mehta S, Samwer M, Reversat A, Verma A, Oldenbourg R, Sixt MK, Gerlich D. 2017. Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments. eLife. 6, e30867.","chicago":"Spira, Felix, Sara Cuylen Haering, Shalin Mehta, Matthias Samwer, Anne Reversat, Amitabh Verma, Rudolf Oldenbourg, Michael K Sixt, and Daniel Gerlich. “Cytokinesis in Vertebrate Cells Initiates by Contraction of an Equatorial Actomyosin Network Composed of Randomly Oriented Filaments.” ELife. eLife Sciences Publications, 2017. https://doi.org/10.7554/eLife.30867."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Felix","full_name":"Spira, Felix","last_name":"Spira"},{"first_name":"Sara","full_name":"Cuylen Haering, Sara","last_name":"Cuylen Haering"},{"first_name":"Shalin","last_name":"Mehta","full_name":"Mehta, Shalin"},{"full_name":"Samwer, Matthias","last_name":"Samwer","first_name":"Matthias"},{"first_name":"Anne","id":"35B76592-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0666-8928","full_name":"Reversat, Anne","last_name":"Reversat"},{"last_name":"Verma","full_name":"Verma, Amitabh","first_name":"Amitabh"},{"first_name":"Rudolf","full_name":"Oldenbourg, Rudolf","last_name":"Oldenbourg"},{"first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt"},{"last_name":"Gerlich","full_name":"Gerlich, Daniel","first_name":"Daniel"}],"publist_id":"7245","title":"Cytokinesis in vertebrate cells initiates by contraction of an equatorial actomyosin network composed of randomly oriented filaments","article_number":"e30867","publication_identifier":{"issn":["2050084X"]},"publication_status":"published","file":[{"file_name":"IST-2017-919-v1+1_elife-30867-figures-v1.pdf","date_created":"2018-12-12T10:10:40Z","creator":"system","file_size":9666973,"date_updated":"2020-07-14T12:47:10Z","file_id":"4829","checksum":"ba09c1451153d39e4f4b7cee013e314c","relation":"main_file","access_level":"open_access","content_type":"application/pdf"},{"date_updated":"2020-07-14T12:47:10Z","file_size":5951246,"creator":"system","date_created":"2018-12-12T10:10:41Z","file_name":"IST-2017-919-v1+2_elife-30867-v1.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"01eb51f1d6ad679947415a51c988e137","file_id":"4830"}],"language":[{"iso":"eng"}],"volume":6,"abstract":[{"lang":"eng","text":"The actomyosin ring generates force to ingress the cytokinetic cleavage furrow in animal cells, yet its filament organization and the mechanism of contractility is not well understood. We quantified actin filament order in human cells using fluorescence polarization microscopy and found that cleavage furrow ingression initiates by contraction of an equatorial actin network with randomly oriented filaments. The network subsequently gradually reoriented actin filaments along the cell equator. This strictly depended on myosin II activity, suggesting local network reorganization by mechanical forces. Cortical laser microsurgery revealed that during cytokinesis progression, mechanical tension increased substantially along the direction of the cell equator, while the network contracted laterally along the pole-to-pole axis without a detectable increase in tension. Our data suggest that an asymmetric increase in cortical tension promotes filament reorientation along the cytokinetic cleavage furrow, which might have implications for diverse other biological processes involving actomyosin rings."}],"oa_version":"Published Version","scopus_import":1,"month":"11","intvolume":" 6","date_updated":"2023-02-23T12:30:29Z","ddc":["570"],"file_date_updated":"2020-07-14T12:47:10Z","department":[{"_id":"MiSi"}],"_id":"569","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":"919"},{"project":[{"call_identifier":"H2020","_id":"260AA4E2-B435-11E9-9278-68D0E5697425","grant_number":"747687","name":"Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells"}],"title":"Migrating platelets are mechano scavengers that collect and bundle bacteria","publist_id":"7243","author":[{"last_name":"Gärtner","full_name":"Gärtner, Florian R","orcid":"0000-0001-6120-3723","id":"397A88EE-F248-11E8-B48F-1D18A9856A87","first_name":"Florian R"},{"full_name":"Ahmad, Zerkah","last_name":"Ahmad","first_name":"Zerkah"},{"last_name":"Rosenberger","full_name":"Rosenberger, Gerhild","first_name":"Gerhild"},{"last_name":"Fan","full_name":"Fan, Shuxia","first_name":"Shuxia"},{"first_name":"Leo","last_name":"Nicolai","full_name":"Nicolai, Leo"},{"first_name":"Benjamin","last_name":"Busch","full_name":"Busch, Benjamin"},{"first_name":"Gökce","full_name":"Yavuz, Gökce","last_name":"Yavuz"},{"full_name":"Luckner, Manja","last_name":"Luckner","first_name":"Manja"},{"full_name":"Ishikawa Ankerhold, Hellen","last_name":"Ishikawa Ankerhold","first_name":"Hellen"},{"first_name":"Roman","last_name":"Hennel","full_name":"Hennel, Roman"},{"first_name":"Alexandre","last_name":"Benechet","full_name":"Benechet, Alexandre"},{"last_name":"Lorenz","full_name":"Lorenz, Michael","first_name":"Michael"},{"first_name":"Sue","last_name":"Chandraratne","full_name":"Chandraratne, Sue"},{"full_name":"Schubert, Irene","last_name":"Schubert","first_name":"Irene"},{"first_name":"Sebastian","last_name":"Helmer","full_name":"Helmer, Sebastian"},{"first_name":"Bianca","full_name":"Striednig, Bianca","last_name":"Striednig"},{"full_name":"Stark, Konstantin","last_name":"Stark","first_name":"Konstantin"},{"first_name":"Marek","last_name":"Janko","full_name":"Janko, Marek"},{"first_name":"Ralph","last_name":"Böttcher","full_name":"Böttcher, Ralph"},{"first_name":"Admar","last_name":"Verschoor","full_name":"Verschoor, Admar"},{"first_name":"Catherine","full_name":"Leon, Catherine","last_name":"Leon"},{"first_name":"Christian","full_name":"Gachet, Christian","last_name":"Gachet"},{"first_name":"Thomas","last_name":"Gudermann","full_name":"Gudermann, Thomas"},{"first_name":"Michael","last_name":"Mederos Y Schnitzler","full_name":"Mederos Y Schnitzler, Michael"},{"first_name":"Zachary","last_name":"Pincus","full_name":"Pincus, Zachary"},{"first_name":"Matteo","last_name":"Iannacone","full_name":"Iannacone, Matteo"},{"first_name":"Rainer","full_name":"Haas, Rainer","last_name":"Haas"},{"first_name":"Gerhard","last_name":"Wanner","full_name":"Wanner, Gerhard"},{"last_name":"Lauber","full_name":"Lauber, Kirsten","first_name":"Kirsten"},{"orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Steffen","last_name":"Massberg","full_name":"Massberg, Steffen"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Gärtner, Florian R., et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press, vol. 171, no. 6, Cell Press, 2017, pp. 1368–82, doi:10.1016/j.cell.2017.11.001.","short":"F.R. Gärtner, Z. Ahmad, G. Rosenberger, S. Fan, L. Nicolai, B. Busch, G. Yavuz, M. Luckner, H. Ishikawa Ankerhold, R. Hennel, A. Benechet, M. Lorenz, S. Chandraratne, I. Schubert, S. Helmer, B. Striednig, K. Stark, M. Janko, R. Böttcher, A. Verschoor, C. Leon, C. Gachet, T. Gudermann, M. Mederos Y Schnitzler, Z. Pincus, M. Iannacone, R. Haas, G. Wanner, K. Lauber, M.K. Sixt, S. Massberg, Cell Press 171 (2017) 1368–1382.","ieee":"F. R. Gärtner et al., “Migrating platelets are mechano scavengers that collect and bundle bacteria,” Cell Press, vol. 171, no. 6. Cell Press, pp. 1368–1382, 2017.","ama":"Gärtner FR, Ahmad Z, Rosenberger G, et al. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 2017;171(6):1368-1382. doi:10.1016/j.cell.2017.11.001","apa":"Gärtner, F. R., Ahmad, Z., Rosenberger, G., Fan, S., Nicolai, L., Busch, B., … Massberg, S. (2017). Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. Cell Press. https://doi.org/10.1016/j.cell.2017.11.001","chicago":"Gärtner, Florian R, Zerkah Ahmad, Gerhild Rosenberger, Shuxia Fan, Leo Nicolai, Benjamin Busch, Gökce Yavuz, et al. “Migrating Platelets Are Mechano Scavengers That Collect and Bundle Bacteria.” Cell Press. Cell Press, 2017. https://doi.org/10.1016/j.cell.2017.11.001.","ista":"Gärtner FR, Ahmad Z, Rosenberger G, Fan S, Nicolai L, Busch B, Yavuz G, Luckner M, Ishikawa Ankerhold H, Hennel R, Benechet A, Lorenz M, Chandraratne S, Schubert I, Helmer S, Striednig B, Stark K, Janko M, Böttcher R, Verschoor A, Leon C, Gachet C, Gudermann T, Mederos Y Schnitzler M, Pincus Z, Iannacone M, Haas R, Wanner G, Lauber K, Sixt MK, Massberg S. 2017. Migrating platelets are mechano scavengers that collect and bundle bacteria. Cell Press. 171(6), 1368–1382."},"quality_controlled":"1","publisher":"Cell Press","date_created":"2018-12-11T11:47:15Z","doi":"10.1016/j.cell.2017.11.001","date_published":"2017-11-30T00:00:00Z","page":"1368 - 1382","publication":"Cell Press","day":"30","year":"2017","status":"public","type":"journal_article","_id":"571","department":[{"_id":"MiSi"}],"date_updated":"2021-01-12T08:03:15Z","intvolume":" 171","month":"11","scopus_import":1,"oa_version":"None","abstract":[{"text":"Blood platelets are critical for hemostasis and thrombosis and play diverse roles during immune responses. Despite these versatile tasks in mammalian biology, their skills on a cellular level are deemed limited, mainly consisting in rolling, adhesion, and aggregate formation. Here, we identify an unappreciated asset of platelets and show that adherent platelets use adhesion receptors to mechanically probe the adhesive substrate in their local microenvironment. When actomyosin-dependent traction forces overcome substrate resistance, platelets migrate and pile up the adhesive substrate together with any bound particulate material. They use this ability to act as cellular scavengers, scanning the vascular surface for potential invaders and collecting deposited bacteria. Microbe collection by migrating platelets boosts the activity of professional phagocytes, exacerbating inflammatory tissue injury in sepsis. This assigns platelets a central role in innate immune responses and identifies them as potential targets to dampen inflammatory tissue damage in clinical scenarios of severe systemic infection. In addition to their role in thrombosis and hemostasis, platelets can also migrate to sites of infection to help trap bacteria and clear the vascular surface.","lang":"eng"}],"ec_funded":1,"volume":171,"issue":"6","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["00928674"]}},{"abstract":[{"lang":"eng","text":"In this review, we summarize the different biosynthesis-related pathways that contribute to the regulation of endogenous auxin in plants. We demonstrate that all known genes involved in auxin biosynthesis also have a role in root formation, from the initiation of a root meristem during embryogenesis to the generation of a functional root system with a primary root, secondary lateral root branches and adventitious roots. Furthermore, the versatile adaptation of root development in response to environmental challenges is mediated by both local and distant control of auxin biosynthesis. In conclusion, auxin homeostasis mediated by spatial and temporal regulation of auxin biosynthesis plays a central role in determining root architecture."}],"oa_version":"Published Version","scopus_import":"1","intvolume":" 18","month":"12","publication_status":"published","language":[{"iso":"eng"}],"file":[{"file_size":920962,"date_updated":"2020-07-14T12:47:10Z","creator":"system","file_name":"IST-2017-917-v1+1_ijms-18-02587.pdf","date_created":"2018-12-12T10:08:55Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"4718","checksum":"82d51f11e493f7eec02976d9a9a9805e"}],"volume":18,"issue":"12","_id":"572","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","pubrep_id":"917","status":"public","date_updated":"2021-01-12T08:03:16Z","ddc":["580"],"department":[{"_id":"JiFr"}],"file_date_updated":"2020-07-14T12:47:10Z","oa":1,"publisher":"MDPI","quality_controlled":"1","year":"2017","has_accepted_license":"1","publication":"International Journal of Molecular Sciences","day":"01","date_created":"2018-12-11T11:47:15Z","doi":"10.3390/ijms18122587","date_published":"2017-12-01T00:00:00Z","article_number":"2587","citation":{"ista":"Olatunji D, Geelen D, Verstraeten I. 2017. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 18(12), 2587.","chicago":"Olatunji, Damilola, Danny Geelen, and Inge Verstraeten. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences. MDPI, 2017. https://doi.org/10.3390/ijms18122587.","apa":"Olatunji, D., Geelen, D., & Verstraeten, I. (2017). Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms18122587","ama":"Olatunji D, Geelen D, Verstraeten I. Control of endogenous auxin levels in plant root development. International Journal of Molecular Sciences. 2017;18(12). doi:10.3390/ijms18122587","short":"D. Olatunji, D. Geelen, I. Verstraeten, International Journal of Molecular Sciences 18 (2017).","ieee":"D. Olatunji, D. Geelen, and I. Verstraeten, “Control of endogenous auxin levels in plant root development,” International Journal of Molecular Sciences, vol. 18, no. 12. MDPI, 2017.","mla":"Olatunji, Damilola, et al. “Control of Endogenous Auxin Levels in Plant Root Development.” International Journal of Molecular Sciences, vol. 18, no. 12, 2587, MDPI, 2017, doi:10.3390/ijms18122587."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Damilola","last_name":"Olatunji","full_name":"Olatunji, Damilola"},{"full_name":"Geelen, Danny","last_name":"Geelen","first_name":"Danny"},{"first_name":"Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","last_name":"Verstraeten","full_name":"Verstraeten, Inge","orcid":"0000-0001-7241-2328"}],"publist_id":"7242","title":"Control of endogenous auxin levels in plant root development"}]