[{"day":"18","month":"09","article_processing_charge":"No","project":[{"_id":"253B6E48-B435-11E9-9278-68D0E5697425","grant_number":"P29638","name":"Drosophila TNFa´s Funktion in Immunzellen","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Investigating the role of transporters in invasive migration through junctions","_id":"2536F660-B435-11E9-9278-68D0E5697425","grant_number":"334077"},{"name":"Tissue barrier penetration is crucial for immunity and metastasis","grant_number":"24800","_id":"26199CA4-B435-11E9-9278-68D0E5697425"}],"publication":"bioRxiv","main_file_link":[{"url":"https://doi.org/10.1101/2020.09.18.301481","open_access":"1"}],"citation":{"ama":"Belyaeva V, Wachner S, Gridchyn I, et al. Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance. bioRxiv. doi:10.1101/2020.09.18.301481","ista":"Belyaeva V, Wachner S, Gridchyn I, Linder M, Emtenani S, György A, Sibilia M, Siekhaus DE. Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance. bioRxiv, 10.1101/2020.09.18.301481.","ieee":"V. Belyaeva et al., “Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance,” bioRxiv. .","apa":"Belyaeva, V., Wachner, S., Gridchyn, I., Linder, M., Emtenani, S., György, A., … Siekhaus, D. E. (n.d.). Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance. bioRxiv. https://doi.org/10.1101/2020.09.18.301481","mla":"Belyaeva, Vera, et al. “Cortical Actin Properties Controlled by Drosophila Fos Aid Macrophage Infiltration against Surrounding Tissue Resistance.” BioRxiv, doi:10.1101/2020.09.18.301481.","short":"V. Belyaeva, S. Wachner, I. Gridchyn, M. Linder, S. Emtenani, A. György, M. Sibilia, D.E. Siekhaus, BioRxiv (n.d.).","chicago":"Belyaeva, Vera, Stephanie Wachner, Igor Gridchyn, Markus Linder, Shamsi Emtenani, Attila György, Maria Sibilia, and Daria E Siekhaus. “Cortical Actin Properties Controlled by Drosophila Fos Aid Macrophage Infiltration against Surrounding Tissue Resistance.” BioRxiv, n.d. https://doi.org/10.1101/2020.09.18.301481."},"oa":1,"acknowledged_ssus":[{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"date_published":"2020-09-18T00:00:00Z","doi":"10.1101/2020.09.18.301481","type":"preprint","abstract":[{"lang":"eng","text":"The infiltration of immune cells into tissues underlies the establishment of tissue resident macrophages, and responses to infections and tumors. Yet the mechanisms immune cells utilize to negotiate tissue barriers in living organisms are not well understood, and a role for cortical actin has not been examined. Here we find that the tissue invasion of Drosophila macrophages, also known as plasmatocytes or hemocytes, utilizes enhanced cortical F-actin levels stimulated by the Drosophila member of the fos proto oncogene transcription factor family (Dfos, Kayak). RNA sequencing analysis and live imaging show that Dfos enhances F-actin levels around the entire macrophage surface by increasing mRNA levels of the membrane spanning molecular scaffold tetraspanin TM4SF, and the actin cross-linking filamin Cheerio which are themselves required for invasion. Cortical F-actin levels are critical as expressing a dominant active form of Diaphanous, a actin polymerizing Formin, can rescue the Dfos Dominant Negative macrophage invasion defect. In vivo imaging shows that Dfos is required to enhance the efficiency of the initial phases of macrophage tissue entry. Genetic evidence argues that this Dfos-induced program in macrophages counteracts the constraint produced by the tension of surrounding tissues and buffers the mechanical properties of the macrophage nucleus from affecting tissue entry. We thus identify tuning the cortical actin cytoskeleton through Dfos as a key process allowing efficient forward movement of an immune cell into surrounding tissues."}],"ec_funded":1,"publication_status":"submitted","status":"public","title":"Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance","department":[{"_id":"DaSi"},{"_id":"JoCs"}],"_id":"8557","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank the following for their contributions: The Drosophila Genomics Resource Center supported by NIH grant 2P40OD010949-10A1 for plasmids, K. Brueckner. B. Stramer, M. Uhlirova, O. Schuldiner, the Bloomington Drosophila Stock Center supported by NIH grant P40OD018537 and the Vienna Drosophila Resource Center for fly stocks, FlyBase (Thurmond et al., 2019) for essential genomic information, and the BDGP in situ database for data (Tomancak et al., 2002, 2007). For antibodies, we thank the Developmental Studies Hybridoma Bank, which was created by the Eunice Kennedy Shriver National Institute of Child Health and Human Development of the NIH, and is maintained at the University of Iowa, as well as J. Zeitlinger for her generous gift of Dfos antibody. We thank the Vienna BioCenter Core Facilities for RNA sequencing and analysis and the Life Scientific Service Units at IST Austria for technical support and assistance with microscopy and FACS analysis. We thank C.P. Heisenberg, P. Martin, M. Sixt and Siekhaus group members for discussions and T.Hurd, A. Ratheesh and P. Rangan for comments on the manuscript. A.G. was supported by the Austrian Science Fund (FWF) grant DASI_FWF01_P29638S, D.E.S. by Marie Curie CIG 334077/IRTIM. M.S. is supported by the FWF, PhD program W1212 915 and the European Research Council (ERC) Advanced grant (ERC-2015-AdG TNT-Tumors 694883). S.W. is supported by an OEAW, DOC fellowship.","year":"2020","date_created":"2020-09-23T09:36:47Z","date_updated":"2024-03-28T23:30:25Z","oa_version":"Preprint","author":[{"last_name":"Belyaeva","first_name":"Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","full_name":"Belyaeva, Vera"},{"last_name":"Wachner","first_name":"Stephanie","id":"2A95E7B0-F248-11E8-B48F-1D18A9856A87","full_name":"Wachner, Stephanie"},{"first_name":"Igor","last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1807-1929","full_name":"Gridchyn, Igor"},{"full_name":"Linder, Markus","last_name":"Linder","first_name":"Markus"},{"last_name":"Emtenani","first_name":"Shamsi","orcid":"0000-0001-6981-6938","id":"49D32318-F248-11E8-B48F-1D18A9856A87","full_name":"Emtenani, Shamsi"},{"full_name":"György, Attila","first_name":"Attila","last_name":"György","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1819-198X"},{"last_name":"Sibilia","first_name":"Maria","full_name":"Sibilia, Maria"},{"first_name":"Daria E","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353","full_name":"Siekhaus, Daria E"}],"related_material":{"record":[{"id":"10614","relation":"later_version","status":"public"},{"id":"8983","relation":"dissertation_contains","status":"public"}]}},{"has_accepted_license":"1","article_processing_charge":"No","day":"02","citation":{"short":"K. Aggarwal, A.C. Hofmann, D. Jirovec, I. Prieto Gonzalez, A. Sammak, M. Botifoll, S. Marti-Sanchez, M. Veldhorst, J. Arbiol, G. Scappucci, G. Katsaros, ArXiv (n.d.).","mla":"Aggarwal, Kushagra, et al. “Enhancement of Proximity Induced Superconductivity in Planar Germanium.” ArXiv, 2012.00322.","chicago":"Aggarwal, Kushagra, Andrea C Hofmann, Daniel Jirovec, Ivan Prieto Gonzalez, Amir Sammak, Marc Botifoll, Sara Marti-Sanchez, et al. “Enhancement of Proximity Induced Superconductivity in Planar Germanium.” ArXiv, n.d.","ama":"Aggarwal K, Hofmann AC, Jirovec D, et al. Enhancement of proximity induced superconductivity in planar Germanium. arXiv.","ieee":"K. Aggarwal et al., “Enhancement of proximity induced superconductivity in planar Germanium,” arXiv. .","apa":"Aggarwal, K., Hofmann, A. C., Jirovec, D., Prieto Gonzalez, I., Sammak, A., Botifoll, M., … Katsaros, G. (n.d.). Enhancement of proximity induced superconductivity in planar Germanium. arXiv.","ista":"Aggarwal K, Hofmann AC, Jirovec D, Prieto Gonzalez I, Sammak A, Botifoll M, Marti-Sanchez S, Veldhorst M, Arbiol J, Scappucci G, Katsaros G. Enhancement of proximity induced superconductivity in planar Germanium. arXiv, 2012.00322."},"publication":"arXiv","date_published":"2020-12-02T00:00:00Z","type":"preprint","abstract":[{"lang":"eng","text":"Holes in planar Ge have high mobilities, strong spin-orbit interaction and electrically tunable g-factors, and are therefore emerging as a promising candidate for hybrid superconductorsemiconductor devices. This is further motivated by the observation of supercurrent transport in planar Ge Josephson Field effect transistors (JoFETs). A key challenge towards hybrid germanium quantum technology is the design of high quality interfaces and superconducting contacts that are robust against magnetic fields. By combining the assets of Al, which has a long superconducting coherence, and Nb, which has a significant superconducting gap, we form low-disordered JoFETs with large ICRN products that are capable of withstanding high magnetic fields. We furthermore demonstrate the ability of phase-biasing individual JoFETs opening up an avenue to explore topological superconductivity in planar Ge. The persistence of superconductivity in the reported hybrid devices beyond 1.8 T paves the way towards integrating spin qubits and proximity-induced superconductivity on the same chip."}],"status":"public","ddc":["530"],"title":"Enhancement of proximity induced superconductivity in planar Germanium","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8831","file":[{"content_type":"application/pdf","file_size":1697939,"creator":"gkatsaro","access_level":"open_access","file_name":"Superconducting_2D_Ge.pdf","checksum":"22a612e206232fa94b138b2c2f957582","date_created":"2020-12-02T10:42:31Z","date_updated":"2020-12-02T10:42:31Z","relation":"main_file","file_id":"8832"}],"oa_version":"Submitted Version","month":"12","project":[{"name":"Hybrid Semiconductor - Superconductor Quantum Devices","_id":"262116AA-B435-11E9-9278-68D0E5697425"},{"_id":"26A151DA-B435-11E9-9278-68D0E5697425","grant_number":"844511","name":"Majorana bound states in Ge/SiGe heterostructures","call_identifier":"H2020"},{"grant_number":"862046","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS"}],"external_id":{"arxiv":["2012.00322"]},"oa":1,"language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"article_number":"2012.00322","ec_funded":1,"file_date_updated":"2020-12-02T10:42:31Z","department":[{"_id":"GeKa"}],"publication_status":"submitted","acknowledgement":"This research and related results were made possible with the support of the NOMIS Foundation. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility, the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement #844511 and the Grant Agreement #862046. ICN2 acknowledge funding from Generalitat de Catalunya 2017 SGR 327. ICN2 is supported by the Severo Ochoa\r\nprogram from Spanish MINECO (Grant No. SEV2017-0706) and is funded by the CERCA Programme / Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Aut`onoma de Barcelona Materials Science PhD program. The HAADF-STEM microscopy was conducted in the Laboratorio de Microscopias Avanzadas at Instituto de Nanociencia de Aragon-Universidad de Zaragoza. Authors acknowledge the LMA-INA for offering access to their instruments and expertise. We acknowledge support from CSIC Research Platform on Quantum Technologies PTI-001. This project has received funding from\r\nthe European Union’s Horizon 2020 research and innovation programme under grant agreement No 823717 – ESTEEM3. M.B. acknowledges support from SUR Generalitat de Catalunya and the EU Social Fund; project ref. 2020 FI 00103. GS and MV acknowledge support through a projectruimte grant associated with the Netherlands Organization of Scientific Research (NWO).","year":"2020","date_created":"2020-12-02T10:42:53Z","date_updated":"2024-03-28T23:30:27Z","related_material":{"record":[{"id":"10559","status":"public","relation":"later_version"},{"relation":"research_data","status":"public","id":"8834"},{"status":"public","relation":"dissertation_contains","id":"10058"}]},"author":[{"full_name":"Aggarwal, Kushagra","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb","orcid":"0000-0001-9985-9293","first_name":"Kushagra","last_name":"Aggarwal"},{"full_name":"Hofmann, Andrea C","id":"340F461A-F248-11E8-B48F-1D18A9856A87","last_name":"Hofmann","first_name":"Andrea C"},{"full_name":"Jirovec, Daniel","first_name":"Daniel","last_name":"Jirovec","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7197-4801"},{"first_name":"Ivan","last_name":"Prieto Gonzalez","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7370-5357","full_name":"Prieto Gonzalez, Ivan"},{"full_name":"Sammak, Amir","first_name":"Amir","last_name":"Sammak"},{"full_name":"Botifoll, Marc","last_name":"Botifoll","first_name":"Marc"},{"last_name":"Marti-Sanchez","first_name":"Sara","full_name":"Marti-Sanchez, Sara"},{"first_name":"Menno","last_name":"Veldhorst","full_name":"Veldhorst, Menno"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"last_name":"Scappucci","first_name":"Giordano","full_name":"Scappucci, Giordano"},{"orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","last_name":"Katsaros","first_name":"Georgios","full_name":"Katsaros, Georgios"}]},{"date_created":"2020-09-20T22:01:35Z","date_updated":"2024-03-28T23:30:31Z","volume":21,"author":[{"last_name":"Kleindienst","first_name":"David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","full_name":"Kleindienst, David"},{"full_name":"Montanaro-Punzengruber, Jacqueline-Claire","last_name":"Montanaro-Punzengruber","first_name":"Jacqueline-Claire","id":"3786AB44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bhandari, Pradeep","first_name":"Pradeep","last_name":"Bhandari","id":"45EDD1BC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0863-4481"},{"id":"44B7CA5A-F248-11E8-B48F-1D18A9856A87","last_name":"Case","first_name":"Matthew J","full_name":"Case, Matthew J"},{"full_name":"Fukazawa, Yugo","first_name":"Yugo","last_name":"Fukazawa"},{"full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"9562","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","publisher":"MDPI","department":[{"_id":"RySh"}],"year":"2020","acknowledgement":"This research was funded by Austrian Academy of Sciences, DOC fellowship to D.K., European Research\r\nCouncil Advanced Grant 694539 and European Union Human Brain Project (HBP) SGA2 785907 to R.S.\r\nWe acknowledge Elena Hollergschwandtner for technical support.","file_date_updated":"2020-09-21T14:08:58Z","ec_funded":1,"article_number":"6737","language":[{"iso":"eng"}],"doi":"10.3390/ijms21186737","quality_controlled":"1","isi":1,"project":[{"name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","call_identifier":"H2020","grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425"},{"name":"Mechanism of formation and maintenance of input side-dependent asymmetry in the hippocampus","_id":"25D32BC0-B435-11E9-9278-68D0E5697425"},{"grant_number":"785907","_id":"26436750-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Human Brain Project Specific Grant Agreement 2 (HBP SGA 2)"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000579945300001"]},"month":"09","publication_identifier":{"issn":["16616596"],"eissn":["14220067"]},"oa_version":"Published Version","file":[{"file_name":"2020_JournMolecSciences_Kleindienst.pdf","access_level":"open_access","creator":"dernst","file_size":5748456,"content_type":"application/pdf","file_id":"8551","relation":"main_file","date_updated":"2020-09-21T14:08:58Z","date_created":"2020-09-21T14:08:58Z","success":1,"checksum":"2e4f62f3cfe945b7391fc3070e5a289f"}],"ddc":["570"],"title":"Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses","status":"public","intvolume":" 21","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8532","abstract":[{"text":"The molecular anatomy of synapses defines their characteristics in transmission and plasticity. Precise measurements of the number and distribution of synaptic proteins are important for our understanding of synapse heterogeneity within and between brain regions. Freeze–fracture replica immunogold electron microscopy enables us to analyze them quantitatively on a two-dimensional membrane surface. Here, we introduce Darea software, which utilizes deep learning for analysis of replica images and demonstrate its usefulness for quick measurements of the pre- and postsynaptic areas, density and distribution of gold particles at synapses in a reproducible manner. We used Darea for comparing glutamate receptor and calcium channel distributions between hippocampal CA3-CA1 spine synapses on apical and basal dendrites, which differ in signaling pathways involved in synaptic plasticity. We found that apical synapses express a higher density of α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) receptors and a stronger increase of AMPA receptors with synaptic size, while basal synapses show a larger increase in N-methyl-D-aspartate (NMDA) receptors with size. Interestingly, AMPA and NMDA receptors are segregated within postsynaptic sites and negatively correlated in density among both apical and basal synapses. In the presynaptic sites, Cav2.1 voltage-gated calcium channels show similar densities in apical and basal synapses with distributions consistent with an exclusion zone model of calcium channel-release site topography.","lang":"eng"}],"issue":"18","type":"journal_article","date_published":"2020-09-14T00:00:00Z","article_type":"original","publication":"International Journal of Molecular Sciences","citation":{"apa":"Kleindienst, D., Montanaro-Punzengruber, J.-C., Bhandari, P., Case, M. J., Fukazawa, Y., & Shigemoto, R. (2020). Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms21186737","ieee":"D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M. J. Case, Y. Fukazawa, and R. Shigemoto, “Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses,” International Journal of Molecular Sciences, vol. 21, no. 18. MDPI, 2020.","ista":"Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y, Shigemoto R. 2020. Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. International Journal of Molecular Sciences. 21(18), 6737.","ama":"Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y, Shigemoto R. Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. International Journal of Molecular Sciences. 2020;21(18). doi:10.3390/ijms21186737","chicago":"Kleindienst, David, Jacqueline-Claire Montanaro-Punzengruber, Pradeep Bhandari, Matthew J Case, Yugo Fukazawa, and Ryuichi Shigemoto. “Deep Learning-Assisted High-Throughput Analysis of Freeze-Fracture Replica Images Applied to Glutamate Receptors and Calcium Channels at Hippocampal Synapses.” International Journal of Molecular Sciences. MDPI, 2020. https://doi.org/10.3390/ijms21186737.","short":"D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M.J. Case, Y. Fukazawa, R. Shigemoto, International Journal of Molecular Sciences 21 (2020).","mla":"Kleindienst, David, et al. “Deep Learning-Assisted High-Throughput Analysis of Freeze-Fracture Replica Images Applied to Glutamate Receptors and Calcium Channels at Hippocampal Synapses.” International Journal of Molecular Sciences, vol. 21, no. 18, 6737, MDPI, 2020, doi:10.3390/ijms21186737."},"day":"14","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"file_date_updated":"2020-07-14T12:48:03Z","year":"2020","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar"},{"last_name":"Ibsen-Jensen","first_name":"Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Pavlogiannis, Andreas","first_name":"Andreas","last_name":"Pavlogiannis","id":"49704004-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8943-0722"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"date_updated":"2024-03-28T23:30:34Z","date_created":"2020-05-10T22:00:50Z","volume":12075,"month":"04","publication_identifier":{"issn":["03029743"],"isbn":["9783030449131"],"eissn":["16113349"]},"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000681656800005"]},"quality_controlled":"1","isi":1,"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"266EEEC0-B435-11E9-9278-68D0E5697425","name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts"},{"_id":"267066CE-B435-11E9-9278-68D0E5697425","name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies"}],"conference":{"name":"ESOP: Programming Languages and Systems","start_date":"2020-04-25","location":"Dublin, Ireland","end_date":"2020-04-30"},"doi":"10.1007/978-3-030-44914-8_5","language":[{"iso":"eng"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summaries are created, and (ii) an online (or query) phase, where analysis queries arrive on demand and the summaries are used to speed up answering queries.\r\nIn this work, we consider on-demand IFDS analyses where the queries concern program locations of the same procedure (aka same-context queries). We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query phase. We also use treewidth to develop query solutions that are embarrassingly parallelizable, i.e. the total work for answering each query is split to a number of threads such that each thread performs only a constant amount of work. Finally, we implement a static analyzer based on our algorithms, and perform a series of on-demand analysis experiments on standard benchmarks. Our experimental results show a drastic speed-up of the queries after only a lightweight preprocessing phase, which significantly outperforms existing techniques.","lang":"eng"}],"_id":"7810","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"Optimal and perfectly parallel algorithms for on-demand data-flow analysis","ddc":["000"],"intvolume":" 12075","file":[{"content_type":"application/pdf","file_size":651250,"creator":"dernst","file_name":"2020_LNCS_Chatterjee.pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:03Z","date_created":"2020-05-26T13:34:48Z","checksum":"8618b80f4cf7b39a60e61a6445ad9807","relation":"main_file","file_id":"7895"}],"oa_version":"Published Version","scopus_import":"1","day":"18","has_accepted_license":"1","article_processing_charge":"No","publication":"European Symposium on Programming","citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5.","mla":"Chatterjee, Krishnendu, et al. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” European Symposium on Programming, vol. 12075, Springer Nature, 2020, pp. 112–40, doi:10.1007/978-3-030-44914-8_5.","short":"K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.","ista":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075, 112–140.","ieee":"K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.","apa":"Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R., & Pavlogiannis, A. (2020). Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In European Symposium on Programming (Vol. 12075, pp. 112–140). Dublin, Ireland: Springer Nature. https://doi.org/10.1007/978-3-030-44914-8_5","ama":"Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. In: European Symposium on Programming. Vol 12075. Springer Nature; 2020:112-140. doi:10.1007/978-3-030-44914-8_5"},"page":"112-140","date_published":"2020-04-18T00:00:00Z"},{"file_date_updated":"2020-11-06T07:41:03Z","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","year":"2020","date_created":"2020-11-06T07:30:05Z","date_updated":"2024-03-28T23:30:34Z","volume":12302,"author":[{"full_name":"Asadi, Ali","first_name":"Ali","last_name":"Asadi"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Goharshady, Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","first_name":"Amir Kafshdar","last_name":"Goharshady"},{"full_name":"Mohammadi, Kiarash","first_name":"Kiarash","last_name":"Mohammadi"},{"full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","first_name":"Andreas"}],"related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"month":"10","publication_identifier":{"isbn":["9783030591519"],"eissn":["1611-3349"],"eisbn":["9783030591526"],"issn":["0302-9743"]},"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000723555700014"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"ATVA: Automated Technology for Verification and Analysis","location":"Hanoi, Vietnam","start_date":"2020-10-19","end_date":"2020-10-23"},"doi":"10.1007/978-3-030-59152-6_14","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting probabilities, discounted sum, and mean payoff. Although there are many techniques for computing these objectives in general MCs/MDPs, they have not been thoroughly studied in terms of parameterized algorithms, particularly when treewidth is used as the parameter. This is in sharp contrast to qualitative objectives for MCs, MDPs and graph games, for which treewidth-based algorithms yield significant complexity improvements. In this work, we show that treewidth can also be used to obtain faster algorithms for the quantitative problems. For an MC with n states and m transitions, we show that each of the classical quantitative objectives can be computed in O((n+m)⋅t2) time, given a tree decomposition of the MC with width t. Our results also imply a bound of O(κ⋅(n+m)⋅t2) for each objective on MDPs, where κ is the number of strategy-iteration refinements required for the given input and objective. Finally, we make an experimental evaluation of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark suite. Our experiments show that on low-treewidth MCs and MDPs, our algorithms outperform existing well-established methods by one or more orders of magnitude."}],"title":"Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth","status":"public","ddc":["000"],"intvolume":" 12302","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8728","file":[{"date_created":"2020-11-06T07:41:03Z","date_updated":"2020-11-06T07:41:03Z","checksum":"ae83f27e5b189d5abc2e7514f1b7e1b5","success":1,"relation":"main_file","file_id":"8729","content_type":"application/pdf","file_size":726648,"creator":"dernst","file_name":"2020_LNCS_ATVA_Asadi_accepted.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","scopus_import":"1","day":"12","article_processing_charge":"No","has_accepted_license":"1","page":"253-270","publication":"Automated Technology for Verification and Analysis","citation":{"ama":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In: Automated Technology for Verification and Analysis. Vol 12302. Springer Nature; 2020:253-270. doi:10.1007/978-3-030-59152-6_14","ista":"Asadi A, Chatterjee K, Goharshady AK, Mohammadi K, Pavlogiannis A. 2020. Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 12302, 253–270.","apa":"Asadi, A., Chatterjee, K., Goharshady, A. K., Mohammadi, K., & Pavlogiannis, A. (2020). Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth. In Automated Technology for Verification and Analysis (Vol. 12302, pp. 253–270). Hanoi, Vietnam: Springer Nature. https://doi.org/10.1007/978-3-030-59152-6_14","ieee":"A. Asadi, K. Chatterjee, A. K. Goharshady, K. Mohammadi, and A. Pavlogiannis, “Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth,” in Automated Technology for Verification and Analysis, Hanoi, Vietnam, 2020, vol. 12302, pp. 253–270.","mla":"Asadi, Ali, et al. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” Automated Technology for Verification and Analysis, vol. 12302, Springer Nature, 2020, pp. 253–70, doi:10.1007/978-3-030-59152-6_14.","short":"A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis, in:, Automated Technology for Verification and Analysis, Springer Nature, 2020, pp. 253–270.","chicago":"Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.” In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-59152-6_14."},"date_published":"2020-10-12T00:00:00Z"},{"date_updated":"2024-03-28T23:30:34Z","date_created":"2020-07-05T22:00:45Z","related_material":{"record":[{"id":"8934","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Fu, Hongfei","first_name":"Hongfei","last_name":"Fu","id":"3AAD03D6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","first_name":"Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goharshady, Ehsan Kafshdar","last_name":"Goharshady","first_name":"Ehsan Kafshdar"}],"department":[{"_id":"KrCh"}],"publisher":"Association for Computing Machinery","publication_status":"published","year":"2020","publication_identifier":{"isbn":["9781450376136"]},"month":"06","language":[{"iso":"eng"}],"doi":"10.1145/3385412.3385969","conference":{"location":"London, United Kingdom","start_date":"2020-06-15","end_date":"2020-06-20","name":"PLDI: Programming Language Design and Implementation"},"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"}],"quality_controlled":"1","isi":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.04373"}],"external_id":{"isi":["000614622300045"],"arxiv":["1902.04373"]},"abstract":[{"lang":"eng","text":"We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method based on positivstellensaetze, i.e. theorems in semi-algebraic geometry that characterize positive polynomials over a semi-algebraic set.\r\n\r\nOn the theoretical side, the worst-case complexity of our approach is subexponential, whereas the worst-case complexity of the previous complete method (Kapur, ACA 2004) is doubly-exponential. Even when restricted to linear invariants, the best previous complexity for complete invariant generation is exponential (Colon et al, CAV 2003). On the practical side, we reduce the invariant generation problem to quadratic programming (QCLP), which is a classical optimization problem with many industrial solvers. We demonstrate the applicability of our approach by providing experimental results on several academic benchmarks. To the best of our knowledge, the only previous invariant generation method that provides completeness guarantees for invariants consisting of polynomial inequalities is (Kapur, ACA 2004), which relies on quantifier elimination and cannot even handle toy programs such as our running example."}],"type":"conference","oa_version":"Preprint","status":"public","title":"Polynomial invariant generation for non-deterministic recursive programs","_id":"8089","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"11","scopus_import":"1","date_published":"2020-06-11T00:00:00Z","page":"672-687","citation":{"ama":"Chatterjee K, Fu H, Goharshady AK, Goharshady EK. Polynomial invariant generation for non-deterministic recursive programs. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2020:672-687. doi:10.1145/3385412.3385969","ieee":"K. Chatterjee, H. Fu, A. K. Goharshady, and E. K. Goharshady, “Polynomial invariant generation for non-deterministic recursive programs,” in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, London, United Kingdom, 2020, pp. 672–687.","apa":"Chatterjee, K., Fu, H., Goharshady, A. K., & Goharshady, E. K. (2020). Polynomial invariant generation for non-deterministic recursive programs. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 672–687). London, United Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3385412.3385969","ista":"Chatterjee K, Fu H, Goharshady AK, Goharshady EK. 2020. Polynomial invariant generation for non-deterministic recursive programs. Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Language Design and Implementation, 672–687.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–687.","mla":"Chatterjee, Krishnendu, et al. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–87, doi:10.1145/3385412.3385969.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.” In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 672–87. Association for Computing Machinery, 2020. https://doi.org/10.1145/3385412.3385969."},"publication":"Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation"},{"year":"2020","acknowledgement":"We are grateful to the anonymous reviewers for their comments, which significantly improved the present work. The research was partially supported by the EPSRC Early Career Fellowship EP/R023379/1, grant no. SC7-1718-01 of the London Mathematical Society, an IBM PhD Fellowship, and a DOC Fellowship of the Austrian Academy of Sciences (ÖAW).","publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Elsevier","author":[{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar"},{"first_name":"Fatemeh","last_name":"Mohammadi","full_name":"Mohammadi, Fatemeh"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"date_created":"2019-09-29T22:00:44Z","date_updated":"2024-03-28T23:30:34Z","volume":193,"article_number":"106665","external_id":{"arxiv":["1712.09692"],"isi":["000501641400050"]},"main_file_link":[{"url":"https://arxiv.org/abs/1712.09692","open_access":"1"}],"oa":1,"quality_controlled":"1","isi":1,"project":[{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"doi":"10.1016/j.ress.2019.106665","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"issn":["09518320"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6918","title":"An efficient algorithm for computing network reliability in small treewidth","status":"public","intvolume":" 193","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard.\r\n\r\nWe provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem.","lang":"eng"}],"publication":"Reliability Engineering and System Safety","citation":{"mla":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety, vol. 193, 106665, Elsevier, 2020, doi:10.1016/j.ress.2019.106665.","short":"A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2020).","chicago":"Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety. Elsevier, 2020. https://doi.org/10.1016/j.ress.2019.106665.","ama":"Goharshady AK, Mohammadi F. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 2020;193. doi:10.1016/j.ress.2019.106665","ista":"Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665.","apa":"Goharshady, A. K., & Mohammadi, F. (2020). An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. Elsevier. https://doi.org/10.1016/j.ress.2019.106665","ieee":"A. K. Goharshady and F. Mohammadi, “An efficient algorithm for computing network reliability in small treewidth,” Reliability Engineering and System Safety, vol. 193. Elsevier, 2020."},"article_type":"original","date_published":"2020-01-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No"},{"abstract":[{"lang":"eng","text":"In this paper, we introduce an inertial projection-type method with different updating strategies for solving quasi-variational inequalities with strongly monotone and Lipschitz continuous operators in real Hilbert spaces. Under standard assumptions, we establish different strong convergence results for the proposed algorithm. Primary numerical experiments demonstrate the potential applicability of our scheme compared with some related methods in the literature."}],"type":"journal_article","oa_version":"Submitted Version","file":[{"file_id":"8647","embargo":"2021-03-15","relation":"main_file","checksum":"9f6dc6c6bf2b48cb3a2091a9ed5feaf2","date_created":"2020-10-12T10:40:27Z","date_updated":"2021-03-16T23:30:04Z","access_level":"open_access","file_name":"2020_JourOptimizationTheoryApplic_Shehu.pdf","creator":"dernst","file_size":332641,"content_type":"application/pdf"}],"intvolume":" 184","title":"Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces","ddc":["518","510","515"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7161","has_accepted_license":"1","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2020-03-01T00:00:00Z","page":"877–894","article_type":"original","citation":{"ama":"Shehu Y, Gibali A, Sagratella S. Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. 2020;184:877–894. doi:10.1007/s10957-019-01616-6","ista":"Shehu Y, Gibali A, Sagratella S. 2020. Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. 184, 877–894.","ieee":"Y. Shehu, A. Gibali, and S. Sagratella, “Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces,” Journal of Optimization Theory and Applications, vol. 184. Springer Nature, pp. 877–894, 2020.","apa":"Shehu, Y., Gibali, A., & Sagratella, S. (2020). Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. Springer Nature. https://doi.org/10.1007/s10957-019-01616-6","mla":"Shehu, Yekini, et al. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.” Journal of Optimization Theory and Applications, vol. 184, Springer Nature, 2020, pp. 877–894, doi:10.1007/s10957-019-01616-6.","short":"Y. Shehu, A. Gibali, S. Sagratella, Journal of Optimization Theory and Applications 184 (2020) 877–894.","chicago":"Shehu, Yekini, Aviv Gibali, and Simone Sagratella. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.” Journal of Optimization Theory and Applications. Springer Nature, 2020. https://doi.org/10.1007/s10957-019-01616-6."},"publication":"Journal of Optimization Theory and Applications","ec_funded":1,"file_date_updated":"2021-03-16T23:30:04Z","volume":184,"date_updated":"2023-09-06T11:27:15Z","date_created":"2019-12-09T21:33:44Z","author":[{"full_name":"Shehu, Yekini","orcid":"0000-0001-9224-7139","id":"3FC7CB58-F248-11E8-B48F-1D18A9856A87","last_name":"Shehu","first_name":"Yekini"},{"full_name":"Gibali, Aviv","first_name":"Aviv","last_name":"Gibali"},{"first_name":"Simone","last_name":"Sagratella","full_name":"Sagratella, Simone"}],"department":[{"_id":"VlKo"}],"publisher":"Springer Nature","publication_status":"published","acknowledgement":"We are grateful to the anonymous referees and editor whose insightful comments helped to considerably improve an earlier version of this paper. The research of the first author is supported by an ERC Grant from the Institute of Science and Technology (IST).","year":"2020","publication_identifier":{"eissn":["1573-2878"],"issn":["0022-3239"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.1007/s10957-019-01616-6","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000511805200009"]}},{"date_created":"2020-04-08T15:20:53Z","date_updated":"2024-03-28T23:30:37Z","volume":4,"author":[{"full_name":"Tomanek, Isabella","first_name":"Isabella","last_name":"Tomanek","id":"3981F020-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6197-363X"},{"full_name":"Grah, Rok","orcid":"0000-0003-2539-3560","id":"483E70DE-F248-11E8-B48F-1D18A9856A87","last_name":"Grah","first_name":"Rok"},{"first_name":"M.","last_name":"Lagator","full_name":"Lagator, M."},{"first_name":"A. M. C.","last_name":"Andersson","full_name":"Andersson, A. M. C."},{"full_name":"Bollback, Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","first_name":"Jonathan P","last_name":"Bollback"},{"full_name":"Tkačik, Gašper","last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","full_name":"Guet, Calin C"}],"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/how-to-thrive-without-gene-regulation/"}],"record":[{"id":"8155","relation":"dissertation_contains","status":"public"},{"relation":"research_data","status":"public","id":"7383"},{"status":"public","relation":"research_data","id":"7016"},{"id":"8653","status":"public","relation":"used_in_publication"}]},"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"GaTk"},{"_id":"CaGu"}],"year":"2020","acknowledgement":"We thank L. Hurst, N. Barton, M. Pleska, M. Steinrück, B. Kavcic and A. Staron for input on the manuscript, and To. Bergmiller and R. Chait for help with microfluidics experiments. I.T. is a recipient the OMV fellowship. R.G. is a recipient of a DOC (Doctoral Fellowship Programme of the Austrian Academy of Sciences) Fellowship of the Austrian Academy of Sciences.","file_date_updated":"2020-10-09T09:56:01Z","language":[{"iso":"eng"}],"doi":"10.1038/s41559-020-1132-7","quality_controlled":"1","isi":1,"project":[{"_id":"267C84F4-B435-11E9-9278-68D0E5697425","name":"Biophysically realistic genotype-phenotype maps for regulatory networks"}],"oa":1,"external_id":{"isi":["000519008300005"]},"month":"04","publication_identifier":{"issn":["2397-334X"]},"oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"8640","checksum":"ef3bbf42023e30b2c24a6278025d2040","success":1,"date_updated":"2020-10-09T09:56:01Z","date_created":"2020-10-09T09:56:01Z","access_level":"open_access","file_name":"2020_NatureEcolEvo_Tomanek.pdf","content_type":"application/pdf","file_size":745242,"creator":"dernst"}],"status":"public","ddc":["570"],"title":"Gene amplification as a form of population-level gene expression regulation","intvolume":" 4","_id":"7652","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Organisms cope with change by taking advantage of transcriptional regulators. However, when faced with rare environments, the evolution of transcriptional regulators and their promoters may be too slow. Here, we investigate whether the intrinsic instability of gene duplication and amplification provides a generic alternative to canonical gene regulation. Using real-time monitoring of gene-copy-number mutations in Escherichia coli, we show that gene duplications and amplifications enable adaptation to fluctuating environments by rapidly generating copy-number and, therefore, expression-level polymorphisms. This amplification-mediated gene expression tuning (AMGET) occurs on timescales that are similar to canonical gene regulation and can respond to rapid environmental changes. Mathematical modelling shows that amplifications also tune gene expression in stochastic environments in which transcription-factor-based schemes are hard to evolve or maintain. The fleeting nature of gene amplifications gives rise to a generic population-level mechanism that relies on genetic heterogeneity to rapidly tune the expression of any gene, without leaving any genomic signature."}],"issue":"4","type":"journal_article","date_published":"2020-04-01T00:00:00Z","article_type":"original","page":"612-625","publication":"Nature Ecology & Evolution","citation":{"chicago":"Tomanek, Isabella, Rok Grah, M. Lagator, A. M. C. Andersson, Jonathan P Bollback, Gašper Tkačik, and Calin C Guet. “Gene Amplification as a Form of Population-Level Gene Expression Regulation.” Nature Ecology & Evolution. Springer Nature, 2020. https://doi.org/10.1038/s41559-020-1132-7.","mla":"Tomanek, Isabella, et al. “Gene Amplification as a Form of Population-Level Gene Expression Regulation.” Nature Ecology & Evolution, vol. 4, no. 4, Springer Nature, 2020, pp. 612–25, doi:10.1038/s41559-020-1132-7.","short":"I. Tomanek, R. Grah, M. Lagator, A.M.C. Andersson, J.P. Bollback, G. Tkačik, C.C. Guet, Nature Ecology & Evolution 4 (2020) 612–625.","ista":"Tomanek I, Grah R, Lagator M, Andersson AMC, Bollback JP, Tkačik G, Guet CC. 2020. Gene amplification as a form of population-level gene expression regulation. Nature Ecology & Evolution. 4(4), 612–625.","ieee":"I. Tomanek et al., “Gene amplification as a form of population-level gene expression regulation,” Nature Ecology & Evolution, vol. 4, no. 4. Springer Nature, pp. 612–625, 2020.","apa":"Tomanek, I., Grah, R., Lagator, M., Andersson, A. M. C., Bollback, J. P., Tkačik, G., & Guet, C. C. (2020). Gene amplification as a form of population-level gene expression regulation. Nature Ecology & Evolution. Springer Nature. https://doi.org/10.1038/s41559-020-1132-7","ama":"Tomanek I, Grah R, Lagator M, et al. Gene amplification as a form of population-level gene expression regulation. Nature Ecology & Evolution. 2020;4(4):612-625. doi:10.1038/s41559-020-1132-7"},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"day":"13","article_processing_charge":"No","has_accepted_license":"1","date_published":"2020-01-13T00:00:00Z","citation":{"ista":"Scarselli D. 2020. New approaches to reduce friction in turbulent pipe flow. Institute of Science and Technology Austria.","ieee":"D. Scarselli, “New approaches to reduce friction in turbulent pipe flow,” Institute of Science and Technology Austria, 2020.","apa":"Scarselli, D. (2020). New approaches to reduce friction in turbulent pipe flow. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7258","ama":"Scarselli D. New approaches to reduce friction in turbulent pipe flow. 2020. doi:10.15479/AT:ISTA:7258","chicago":"Scarselli, Davide. “New Approaches to Reduce Friction in Turbulent Pipe Flow.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7258.","mla":"Scarselli, Davide. New Approaches to Reduce Friction in Turbulent Pipe Flow. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7258.","short":"D. Scarselli, New Approaches to Reduce Friction in Turbulent Pipe Flow, Institute of Science and Technology Austria, 2020."},"page":"174","abstract":[{"text":"Many flows encountered in nature and applications are characterized by a chaotic motion known as turbulence. Turbulent flows generate intense friction with pipe walls and are responsible for considerable amounts of energy losses at world scale. The nature of turbulent friction and techniques aimed at reducing it have been subject of extensive research over the last century, but no definite answer has been found yet. In this thesis we show that in pipes at moderate turbulent Reynolds numbers friction is better described by the power law first introduced by Blasius and not by the Prandtl–von Kármán formula. At higher Reynolds numbers, large scale motions gradually become more important in the flow and can be related to the change in scaling of friction. Next, we present a series of new techniques that can relaminarize turbulence by suppressing a key mechanism that regenerates it at walls, the lift–up effect. In addition, we investigate the process of turbulence decay in several experiments and discuss the drag reduction potential. Finally, we examine the behavior of friction under pulsating conditions inspired by the human heart cycle and we show that under such circumstances turbulent friction can be reduced to produce energy savings.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"oa_version":"None","file":[{"file_name":"2020_Scarselli_Thesis.zip","embargo_to":"open_access","access_level":"closed","creator":"dscarsel","file_size":26640830,"content_type":"application/zip","file_id":"7259","relation":"source_file","date_created":"2020-01-12T15:57:14Z","date_updated":"2021-01-13T23:30:05Z","checksum":"4df1ab24e9896635106adde5a54615bf"},{"date_updated":"2021-01-13T23:30:05Z","date_created":"2020-01-12T15:56:14Z","checksum":"48659ab98e3414293c7a721385c2fd1c","embargo":"2021-01-12","file_id":"7260","relation":"main_file","creator":"dscarsel","file_size":8515844,"content_type":"application/pdf","file_name":"2020_Scarselli_Thesis.pdf","access_level":"open_access"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"7258","ddc":["532"],"status":"public","title":"New approaches to reduce friction in turbulent pipe flow","month":"01","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:7258","degree_awarded":"PhD","supervisor":[{"full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","last_name":"Hof"}],"language":[{"iso":"eng"}],"oa":1,"project":[{"name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425","grant_number":"306589"},{"call_identifier":"H2020","name":"Eliminating turbulence in oil pipelines","grant_number":"737549","_id":"25104D44-B435-11E9-9278-68D0E5697425"},{"name":"Experimental studies of the turbulence transition and transport processes in turbulent Taylor-Couette currents","grant_number":"HO 4393/1-2","_id":"25136C54-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2021-01-13T23:30:05Z","ec_funded":1,"author":[{"id":"40315C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5227-4271","first_name":"Davide","last_name":"Scarselli","full_name":"Scarselli, Davide"}],"related_material":{"record":[{"id":"6228","relation":"part_of_dissertation","status":"public"},{"id":"6486","status":"public","relation":"part_of_dissertation"},{"id":"461","status":"public","relation":"part_of_dissertation"},{"id":"422","status":"public","relation":"part_of_dissertation"}]},"date_updated":"2023-09-15T12:20:08Z","date_created":"2020-01-12T16:07:26Z","year":"2020","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"Institute of Science and Technology Austria"},{"page":"117","citation":{"chicago":"Tomanek, Isabella. “The Evolution of Gene Expression by Copy Number and Point Mutations.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8653.","short":"I. Tomanek, The Evolution of Gene Expression by Copy Number and Point Mutations, Institute of Science and Technology Austria, 2020.","mla":"Tomanek, Isabella. The Evolution of Gene Expression by Copy Number and Point Mutations. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8653.","ieee":"I. Tomanek, “The evolution of gene expression by copy number and point mutations,” Institute of Science and Technology Austria, 2020.","apa":"Tomanek, I. (2020). The evolution of gene expression by copy number and point mutations. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8653","ista":"Tomanek I. 2020. The evolution of gene expression by copy number and point mutations. Institute of Science and Technology Austria.","ama":"Tomanek I. The evolution of gene expression by copy number and point mutations. 2020. doi:10.15479/AT:ISTA:8653"},"date_published":"2020-10-13T00:00:00Z","keyword":["duplication","amplification","promoter","CNV","AMGET","experimental evolution","Escherichia coli"],"article_processing_charge":"No","has_accepted_license":"1","day":"13","ddc":["576"],"status":"public","title":"The evolution of gene expression by copy number and point mutations","_id":"8653","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_created":"2020-10-16T12:14:21Z","date_updated":"2021-10-20T22:30:03Z","checksum":"c01d9f59794b4b70528f37637c17ad02","relation":"source_file","file_id":"8666","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":25131884,"creator":"itomanek","embargo_to":"open_access","file_name":"Thesis_ITomanek_final_201016.docx","access_level":"closed"},{"creator":"itomanek","file_size":15405675,"content_type":"application/pdf","file_name":"Thesis_ITomanek_final_201016.pdf","access_level":"open_access","date_created":"2020-10-16T12:14:21Z","date_updated":"2021-10-20T22:30:03Z","checksum":"f8edbc3b0f81a780e13ca1e561d42d8b","embargo":"2021-10-19","file_id":"8667","relation":"main_file"}],"oa_version":"Published Version","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"Mutations are the raw material of evolution and come in many different flavors. Point mutations change a single letter in the DNA sequence, while copy number mutations like duplications or deletions add or remove many letters of the DNA sequence simultaneously. Each type of mutation exhibits specific properties like its rate of formation and reversal. \r\nGene expression is a fundamental phenotype that can be altered by both, point and copy number mutations. The following thesis is concerned with the dynamics of gene expression evolution and how it is affected by the properties exhibited by point and copy number mutations. Specifically, we are considering i) copy number mutations during adaptation to fluctuating environments and ii) the interaction of copy number and point mutations during adaptation to constant environments. "}],"oa":1,"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet"}],"degree_awarded":"PhD","doi":"10.15479/AT:ISTA:8653","publication_identifier":{"issn":["2663-337X"]},"month":"10","department":[{"_id":"CaGu"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2020","date_updated":"2023-09-07T13:22:42Z","date_created":"2020-10-13T13:02:33Z","related_material":{"record":[{"id":"7652","relation":"research_data","status":"public"}]},"author":[{"orcid":"0000-0001-6197-363X","id":"3981F020-F248-11E8-B48F-1D18A9856A87","last_name":"Tomanek","first_name":"Isabella","full_name":"Tomanek, Isabella"}],"file_date_updated":"2021-10-20T22:30:03Z"},{"citation":{"ista":"Tan S, Abas MF, Verstraeten I, Glanc M, Molnar G, Hajny J, Lasák P, Petřík I, Russinova E, Petrášek J, Novák O, Pospíšil J, Friml J. 2020. Salicylic acid targets protein phosphatase 2A to attenuate growth in plants. Current Biology. 30(3), 381–395.e8.","apa":"Tan, S., Abas, M. F., Verstraeten, I., Glanc, M., Molnar, G., Hajny, J., … Friml, J. (2020). Salicylic acid targets protein phosphatase 2A to attenuate growth in plants. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2019.11.058","ieee":"S. Tan et al., “Salicylic acid targets protein phosphatase 2A to attenuate growth in plants,” Current Biology, vol. 30, no. 3. Cell Press, p. 381–395.e8, 2020.","ama":"Tan S, Abas MF, Verstraeten I, et al. Salicylic acid targets protein phosphatase 2A to attenuate growth in plants. Current Biology. 2020;30(3):381-395.e8. doi:10.1016/j.cub.2019.11.058","chicago":"Tan, Shutang, Melinda F Abas, Inge Verstraeten, Matous Glanc, Gergely Molnar, Jakub Hajny, Pavel Lasák, et al. “Salicylic Acid Targets Protein Phosphatase 2A to Attenuate Growth in Plants.” Current Biology. Cell Press, 2020. https://doi.org/10.1016/j.cub.2019.11.058.","mla":"Tan, Shutang, et al. “Salicylic Acid Targets Protein Phosphatase 2A to Attenuate Growth in Plants.” Current Biology, vol. 30, no. 3, Cell Press, 2020, p. 381–395.e8, doi:10.1016/j.cub.2019.11.058.","short":"S. Tan, M.F. Abas, I. Verstraeten, M. Glanc, G. Molnar, J. Hajny, P. Lasák, I. Petřík, E. Russinova, J. Petrášek, O. Novák, J. Pospíšil, J. Friml, Current Biology 30 (2020) 381–395.e8."},"publication":"Current Biology","page":"381-395.e8","article_type":"original","date_published":"2020-02-03T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"03","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"7427","intvolume":" 30","title":"Salicylic acid targets protein phosphatase 2A to attenuate growth in plants","status":"public","ddc":["580"],"file":[{"creator":"dernst","content_type":"application/pdf","file_size":5360135,"file_name":"2020_CurrentBiology_Tan.pdf","access_level":"open_access","date_created":"2020-09-22T09:51:28Z","date_updated":"2020-09-22T09:51:28Z","success":1,"checksum":"16f7d51fe28f91c21e4896a2028df40b","file_id":"8555","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","issue":"3","abstract":[{"text":"Plants, like other multicellular organisms, survive through a delicate balance between growth and defense against pathogens. Salicylic acid (SA) is a major defense signal in plants, and the perception mechanism as well as downstream signaling activating the immune response are known. Here, we identify a parallel SA signaling that mediates growth attenuation. SA directly binds to A subunits of protein phosphatase 2A (PP2A), inhibiting activity of this complex. Among PP2A targets, the PIN2 auxin transporter is hyperphosphorylated in response to SA, leading to changed activity of this important growth regulator. Accordingly, auxin transport and auxin-mediated root development, including growth, gravitropic response, and lateral root organogenesis, are inhibited. This study reveals how SA, besides activating immunity, concomitantly attenuates growth through crosstalk with the auxin distribution network. Further analysis of this dual role of SA and characterization of additional SA-regulated PP2A targets will provide further insights into mechanisms maintaining a balance between growth and defense.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["31956021"],"isi":["000511287900018"]},"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"name":"Long Term Fellowship","_id":"256FEF10-B435-11E9-9278-68D0E5697425","grant_number":"723-2015"}],"isi":1,"quality_controlled":"1","doi":"10.1016/j.cub.2019.11.058","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"publication_identifier":{"issn":["09609822"]},"month":"02","pmid":1,"acknowledgement":"We thank Shigeyuki Betsuyaku (University of Tsukuba), Alison Delong (Brown University), Xinnian Dong (Duke University), Dolf Weijers (Wageningen University), Yuelin Zhang (UBC), and Martine Pastuglia (Institut Jean-Pierre Bourgin) for sharing published materials; Jana Riederer for help with cantharidin physiological analysis; David Domjan for help with cloning pET28a-PIN2HL; Qing Lu for help with DARTS; Hana Kozubı´kova´ for technical support on SA derivative synthesis; Zuzana Vondra´ kova´ for technical support with tobacco cells; Lucia Strader (Washington University), Bert De Rybel (Ghent University), Bartel Vanholme (Ghent University), and Lukas Mach (BOKU) for helpful discussions; and bioimaging and life science facilities of IST Austria for continuous support. We gratefully acknowledge the Nottingham Arabidopsis Stock Center (NASC) for providing T-DNA insertional mutants. The DSC and SPR instruments were provided by the EQ-BOKU VIBT GmbH and the BOKU Core Facility for Biomolecular and Cellular Analysis, with help of Irene Schaffner. The research leading to these results has received funding from the European Union’s Horizon 2020 program (ERC grant agreement no. 742985 to J.F.) and the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734. S.T. was supported by a European Molecular Biology Organization (EMBO) long-term postdoctoral fellowship (ALTF 723-2015). O.N. was supported by the Ministry of Education, Youth and Sports of the Czech Republic (European Regional Development Fund-Project ‘‘Centre for Experimental Plant Biology’’ no. CZ.02.1.01/0.0/0.0/16_019/0000738). J. Pospısil was supported by European Regional Development Fund Project ‘‘Centre for Experimental Plant Biology’’\r\n(no. CZ.02.1.01/0.0/0.0/16_019/0000738). J. Petrasek was supported by EU Operational Programme Prague-Competitiveness (no. CZ.2.16/3.1.00/21519). ","year":"2020","department":[{"_id":"JiFr"},{"_id":"EvBe"}],"publisher":"Cell Press","publication_status":"published","related_material":{"record":[{"id":"8822","relation":"dissertation_contains","status":"public"}]},"author":[{"id":"2DE75584-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0471-8285","first_name":"Shutang","last_name":"Tan","full_name":"Tan, Shutang"},{"full_name":"Abas, Melinda F","first_name":"Melinda F","last_name":"Abas","id":"3CFB3B1C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Inge","last_name":"Verstraeten","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge"},{"first_name":"Matous","last_name":"Glanc","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","orcid":"0000-0003-0619-7783","full_name":"Glanc, Matous"},{"full_name":"Molnar, Gergely","last_name":"Molnar","first_name":"Gergely","id":"34F1AF46-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hajny, Jakub","first_name":"Jakub","last_name":"Hajny","id":"4800CC20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2140-7195"},{"first_name":"Pavel","last_name":"Lasák","full_name":"Lasák, Pavel"},{"last_name":"Petřík","first_name":"Ivan","full_name":"Petřík, Ivan"},{"full_name":"Russinova, Eugenia","last_name":"Russinova","first_name":"Eugenia"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"full_name":"Novák, Ondřej","first_name":"Ondřej","last_name":"Novák"},{"last_name":"Pospíšil","first_name":"Jiří","full_name":"Pospíšil, Jiří"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří"}],"volume":30,"date_created":"2020-02-02T23:01:00Z","date_updated":"2024-03-28T23:30:38Z","ec_funded":1,"file_date_updated":"2020-09-22T09:51:28Z"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000514939700001"],"pmid":["31971254"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"name":"Cell surface receptor complexes for PIN polarity and auxin-mediated development","_id":"2699E3D2-B435-11E9-9278-68D0E5697425","grant_number":"25239"}],"doi":"10.1111/nph.16446","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"eissn":["1469-8137"],"issn":["0028-646x"]},"acknowledgement":"We thank Mark Estelle, José M. Alonso and the Arabidopsis Stock Centre for providing seeds. We acknowledge the core facility CELLIM of CEITEC supported by the MEYS CR (LM2015062 Czech‐BioImaging) and Plant Sciences Core Facility of CEITEC Masaryk University for help in generating essential data. This project received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement no. 742985) and the Czech Science Foundation GAČR (GA13‐40637S and GA18‐26981S) to JF. JH is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology. The authors declare no competing interests.","year":"2020","pmid":1,"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Wiley","author":[{"full_name":"Mazur, E","first_name":"E","last_name":"Mazur"},{"last_name":"Kulik","first_name":"Ivan","id":"F0AB3FCE-02D1-11E9-BD0E-99399A5D3DEB","full_name":"Kulik, Ivan"},{"last_name":"Hajny","first_name":"Jakub","orcid":"0000-0003-2140-7195","id":"4800CC20-F248-11E8-B48F-1D18A9856A87","full_name":"Hajny, Jakub"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8822"}]},"date_updated":"2024-03-28T23:30:38Z","date_created":"2020-02-18T10:03:47Z","volume":226,"file_date_updated":"2020-11-20T09:32:10Z","ec_funded":1,"publication":"New Phytologist","citation":{"mla":"Mazur, E., et al. “Auxin Canalization and Vascular Tissue Formation by TIR1/AFB-Mediated Auxin Signaling in Arabidopsis.” New Phytologist, vol. 226, no. 5, Wiley, 2020, pp. 1375–83, doi:10.1111/nph.16446.","short":"E. Mazur, I. Kulik, J. Hajny, J. Friml, New Phytologist 226 (2020) 1375–1383.","chicago":"Mazur, E, Ivan Kulik, Jakub Hajny, and Jiří Friml. “Auxin Canalization and Vascular Tissue Formation by TIR1/AFB-Mediated Auxin Signaling in Arabidopsis.” New Phytologist. Wiley, 2020. https://doi.org/10.1111/nph.16446.","ama":"Mazur E, Kulik I, Hajny J, Friml J. Auxin canalization and vascular tissue formation by TIR1/AFB-mediated auxin signaling in arabidopsis. New Phytologist. 2020;226(5):1375-1383. doi:10.1111/nph.16446","ista":"Mazur E, Kulik I, Hajny J, Friml J. 2020. Auxin canalization and vascular tissue formation by TIR1/AFB-mediated auxin signaling in arabidopsis. New Phytologist. 226(5), 1375–1383.","apa":"Mazur, E., Kulik, I., Hajny, J., & Friml, J. (2020). Auxin canalization and vascular tissue formation by TIR1/AFB-mediated auxin signaling in arabidopsis. New Phytologist. Wiley. https://doi.org/10.1111/nph.16446","ieee":"E. Mazur, I. Kulik, J. Hajny, and J. Friml, “Auxin canalization and vascular tissue formation by TIR1/AFB-mediated auxin signaling in arabidopsis,” New Phytologist, vol. 226, no. 5. Wiley, pp. 1375–1383, 2020."},"article_type":"original","page":"1375-1383","date_published":"2020-06-01T00:00:00Z","day":"01","article_processing_charge":"No","has_accepted_license":"1","_id":"7500","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Auxin canalization and vascular tissue formation by TIR1/AFB-mediated auxin signaling in arabidopsis","ddc":["580"],"status":"public","intvolume":" 226","file":[{"relation":"main_file","file_id":"8781","date_created":"2020-11-20T09:32:10Z","date_updated":"2020-11-20T09:32:10Z","checksum":"17de728b0205979feb95ce663ba918c2","success":1,"file_name":"2020_NewPhytologist_Mazur.pdf","access_level":"open_access","content_type":"application/pdf","file_size":2106888,"creator":"dernst"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Plant survival depends on vascular tissues, which originate in a self‐organizing manner as strands of cells co‐directionally transporting the plant hormone auxin. The latter phenomenon (also known as auxin canalization) is classically hypothesized to be regulated by auxin itself via the effect of this hormone on the polarity of its own intercellular transport. Correlative observations supported this concept, but molecular insights remain limited.\r\nIn the current study, we established an experimental system based on the model Arabidopsis thaliana, which exhibits auxin transport channels and formation of vasculature strands in response to local auxin application.\r\nOur methodology permits the genetic analysis of auxin canalization under controllable experimental conditions. By utilizing this opportunity, we confirmed the dependence of auxin canalization on a PIN‐dependent auxin transport and nuclear, TIR1/AFB‐mediated auxin signaling. We also show that leaf venation and auxin‐mediated PIN repolarization in the root require TIR1/AFB signaling.\r\nFurther studies based on this experimental system are likely to yield better understanding of the mechanisms underlying auxin transport polarization in other developmental contexts.","lang":"eng"}],"issue":"5"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8822","status":"public","title":"Identification and characterization of the molecular machinery of auxin-dependent canalization during vasculature formation and regeneration","ddc":["580"],"oa_version":"Published Version","file":[{"file_name":"Jakub Hajný IST Austria final_JH.docx","embargo_to":"open_access","access_level":"closed","creator":"jhajny","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":91279806,"file_id":"8919","relation":"source_file","date_updated":"2021-07-16T22:30:03Z","date_created":"2020-12-04T07:27:52Z","checksum":"210a9675af5e4c78b0b56d920ac82866"},{"creator":"jhajny","file_size":68707697,"content_type":"application/pdf","access_level":"open_access","file_name":"Jakub Hajný IST Austria final_JH-merged without Science.pdf","checksum":"1781385b4aa73eba89cc76c6172f71d2","date_updated":"2021-12-08T23:30:03Z","date_created":"2020-12-09T15:04:41Z","file_id":"8933","embargo":"2021-12-07","relation":"main_file"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Self-organization is a hallmark of plant development manifested e.g. by intricate leaf vein patterns, flexible formation of vasculature during organogenesis or its regeneration following wounding. Spontaneously arising channels transporting the phytohormone auxin, created by coordinated polar localizations of PIN-FORMED 1 (PIN1) auxin exporter, provide positional cues for these as well as other plant patterning processes. To find regulators acting downstream of auxin and the TIR1/AFB auxin signaling pathway essential for PIN1 coordinated polarization during auxin canalization, we performed microarray experiments. Besides the known components of general PIN polarity maintenance, such as PID and PIP5K kinases, we identified and characterized a new regulator of auxin canalization, the transcription factor WRKY DNA-BINDING PROTEIN 23 (WRKY23).\r\nNext, we designed a subsequent microarray experiment to further uncover other molecular players, downstream of auxin-TIR1/AFB-WRKY23 involved in the regulation of auxin-mediated PIN repolarization. We identified a novel and crucial part of the molecular machinery underlying auxin canalization. The auxin-regulated malectin-type receptor-like kinase CAMEL and the associated leucine-rich repeat receptor-like kinase CANAR target and directly phosphorylate PIN auxin transporters. camel and canar mutants are impaired in PIN1 subcellular trafficking and auxin-mediated repolarization leading to defects in auxin transport, ultimately to leaf venation and vasculature regeneration defects. Our results describe the CAMEL-CANAR receptor complex, which is required for auxin feed-back on its own transport and thus for coordinated tissue polarization during auxin canalization."}],"citation":{"ista":"Hajny J. 2020. Identification and characterization of the molecular machinery of auxin-dependent canalization during vasculature formation and regeneration. Institute of Science and Technology Austria.","ieee":"J. Hajny, “Identification and characterization of the molecular machinery of auxin-dependent canalization during vasculature formation and regeneration,” Institute of Science and Technology Austria, 2020.","apa":"Hajny, J. (2020). Identification and characterization of the molecular machinery of auxin-dependent canalization during vasculature formation and regeneration. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8822","ama":"Hajny J. Identification and characterization of the molecular machinery of auxin-dependent canalization during vasculature formation and regeneration. 2020. doi:10.15479/AT:ISTA:8822","chicago":"Hajny, Jakub. “Identification and Characterization of the Molecular Machinery of Auxin-Dependent Canalization during Vasculature Formation and Regeneration.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8822.","mla":"Hajny, Jakub. Identification and Characterization of the Molecular Machinery of Auxin-Dependent Canalization during Vasculature Formation and Regeneration. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8822.","short":"J. Hajny, Identification and Characterization of the Molecular Machinery of Auxin-Dependent Canalization during Vasculature Formation and Regeneration, Institute of Science and Technology Austria, 2020."},"page":"249","date_published":"2020-12-01T00:00:00Z","day":"01","article_processing_charge":"No","has_accepted_license":"1","year":"2020","publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"JiFr"}],"author":[{"full_name":"Hajny, Jakub","orcid":"0000-0003-2140-7195","id":"4800CC20-F248-11E8-B48F-1D18A9856A87","last_name":"Hajny","first_name":"Jakub"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7427"},{"id":"6260","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"7500"},{"id":"191","status":"public","relation":"part_of_dissertation"},{"id":"449","relation":"part_of_dissertation","status":"public"}]},"date_updated":"2023-09-19T10:39:33Z","date_created":"2020-12-01T12:38:18Z","file_date_updated":"2021-12-08T23:30:03Z","oa":1,"doi":"10.15479/AT:ISTA:8822","supervisor":[{"full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"month":"12","publication_identifier":{"issn":["2663-337X"]}},{"date_published":"2020-09-09T00:00:00Z","citation":{"apa":"Shamipour, S. (2020). Bulk actin dynamics drive phase segregation in zebrafish oocytes . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8350","ieee":"S. Shamipour, “Bulk actin dynamics drive phase segregation in zebrafish oocytes ,” Institute of Science and Technology Austria, 2020.","ista":"Shamipour S. 2020. Bulk actin dynamics drive phase segregation in zebrafish oocytes . Institute of Science and Technology Austria.","ama":"Shamipour S. Bulk actin dynamics drive phase segregation in zebrafish oocytes . 2020. doi:10.15479/AT:ISTA:8350","chicago":"Shamipour, Shayan. “Bulk Actin Dynamics Drive Phase Segregation in Zebrafish Oocytes .” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8350.","short":"S. Shamipour, Bulk Actin Dynamics Drive Phase Segregation in Zebrafish Oocytes , Institute of Science and Technology Austria, 2020.","mla":"Shamipour, Shayan. Bulk Actin Dynamics Drive Phase Segregation in Zebrafish Oocytes . Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8350."},"page":"107","day":"09","has_accepted_license":"1","article_processing_charge":"No","oa_version":"None","file":[{"access_level":"closed","embargo_to":"open_access","file_name":"Shayan-Thesis-Final.docx","file_size":65194814,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"sshamip","relation":"source_file","file_id":"8351","checksum":"6e47871c74f85008b9876112eb3fcfa1","date_updated":"2021-09-11T22:30:05Z","date_created":"2020-09-09T11:06:27Z"},{"date_created":"2020-09-09T11:06:13Z","date_updated":"2021-09-11T22:30:05Z","checksum":"1b44c57f04d7e8a6fe41b1c9c55a52a3","relation":"main_file","file_id":"8352","embargo":"2021-09-10","content_type":"application/pdf","file_size":23729605,"creator":"sshamip","file_name":"Shayan-Thesis-Final.pdf","access_level":"open_access"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8350","ddc":["570"],"status":"public","title":"Bulk actin dynamics drive phase segregation in zebrafish oocytes ","abstract":[{"text":"Cytoplasm is a gel-like crowded environment composed of tens of thousands of macromolecules, organelles, cytoskeletal networks and cytosol. The structure of the cytoplasm is thought to be highly organized and heterogeneous due to the crowding of its constituents and their effective compartmentalization. In such an environment, the diffusive dynamics of the molecules is very restricted, an effect that is further amplified by clustering and anchoring of molecules. Despite the jammed nature of the cytoplasm at the microscopic scale, large-scale reorganization of cytoplasm is essential for important cellular functions, such as nuclear positioning and cell division. How such mesoscale reorganization of the cytoplasm is achieved, especially for very large cells such as oocytes or syncytial tissues that can span hundreds of micrometers in size, has only begun to be understood.\r\nIn this thesis, I focus on the recent advances in elucidating the molecular, cellular and biophysical principles underlying cytoplasmic organization across different scales, structures and species. First, I outline which of these principles have been identified by reductionist approaches, such as in vitro reconstitution assays, where boundary conditions and components can be modulated at ease. I then describe how the theoretical and experimental framework established in these reduced systems have been applied to their more complex in vivo counterparts, in particular oocytes and embryonic syncytial structures, and discuss how such complex biological systems can initiate symmetry breaking and establish patterning.\r\nSpecifically, I examine an example of large-scale reorganizations taking place in zebrafish embryos, where extensive cytoplasmic streaming leads to the segregation of cytoplasm from yolk granules along the animal-vegetal axis of the embryo. Using biophysical experimentation and theory, I investigate the forces underlying this process, to show that this process does not rely on cortical actin reorganization, as previously thought, but instead on a cell-cycle-dependent bulk actin polymerization wave traveling from the animal to the vegetal pole of the embryo. This wave functions in segregation by both pulling cytoplasm animally and pushing yolk granules vegetally. Cytoplasm pulling is mediated by bulk actin network flows exerting friction forces on the cytoplasm, while yolk granule pushing is achieved by a mechanism closely resembling actin comet formation on yolk granules. This study defines a novel role of bulk actin polymerization waves in embryo polarization via cytoplasmic segregation. Lastly, I describe the cytoplasmic reorganizations taking place during zebrafish oocyte maturation, where the initial segregation of the cytoplasm and yolk granules occurs. Here, I demonstrate a previously uncharacterized wave of microtubule aster formation, traveling the oocyte along the animal-vegetal axis. Further research is required to determine the role of such microtubule structures in cytoplasmic reorganizations therein.\r\nCollectively, these studies provide further evidence for the coupling between cell cytoskeleton and cell cycle machinery, which can underlie a core self-organizing mechanism for orchestrating large-scale reorganizations in a cell-cycle-tunable manner, where the modulations of the force-generating machinery and cytoplasmic mechanics can be harbored to fulfill cellular functions.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"doi":"10.15479/AT:ISTA:8350","acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"EM-Fac"}],"degree_awarded":"PhD","supervisor":[{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"},{"full_name":"Hof, Björn","last_name":"Hof","first_name":"Björn","orcid":"0000-0003-2057-2754","id":"3A374330-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"oa":1,"month":"09","publication_identifier":{"issn":["2663-337X"]},"author":[{"last_name":"Shamipour","first_name":"Shayan","id":"40B34FE2-F248-11E8-B48F-1D18A9856A87","full_name":"Shamipour, Shayan"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"661"},{"id":"6508","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"7001"},{"id":"735","status":"public","relation":"part_of_dissertation"}]},"date_updated":"2023-09-27T14:16:45Z","date_created":"2020-09-09T11:12:10Z","year":"2020","acknowledgement":"I would have had no fish and hence no results without our wonderful fish facility crew, Verena Mayer, Eva Schlegl, Andreas Mlak and Matthias Nowak. Special thanks to Verena for being always happy to help and dealing with our chaotic schedules in the lab. Danke auch, Verena, für deine Geduld, mit mir auf Deutsch zu sprechen. Das hat mir sehr geholfen.\r\nSpecial thanks to the Bioimaging and EM facilities at IST Austria for supporting us every day. Very special thanks would go to Robert Hauschild for his continuous support on data analysis and also to Jack Merrin for designing and building microfabricated chambers for the project and for the various discussions on making zebrafish extracts.","publication_status":"published","department":[{"_id":"BjHo"},{"_id":"CaHe"}],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2021-09-11T22:30:05Z"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"25","citation":{"ieee":"A. H. Hansen and S. Hippenmeyer, “Non-cell-autonomous mechanisms in radial projection neuron migration in the developing cerebral cortex,” Frontiers in Cell and Developmental Biology, vol. 8, no. 9. Frontiers, 2020.","apa":"Hansen, A. H., & Hippenmeyer, S. (2020). Non-cell-autonomous mechanisms in radial projection neuron migration in the developing cerebral cortex. Frontiers in Cell and Developmental Biology. Frontiers. https://doi.org/10.3389/fcell.2020.574382","ista":"Hansen AH, Hippenmeyer S. 2020. Non-cell-autonomous mechanisms in radial projection neuron migration in the developing cerebral cortex. Frontiers in Cell and Developmental Biology. 8(9), 574382.","ama":"Hansen AH, Hippenmeyer S. Non-cell-autonomous mechanisms in radial projection neuron migration in the developing cerebral cortex. Frontiers in Cell and Developmental Biology. 2020;8(9). doi:10.3389/fcell.2020.574382","chicago":"Hansen, Andi H, and Simon Hippenmeyer. “Non-Cell-Autonomous Mechanisms in Radial Projection Neuron Migration in the Developing Cerebral Cortex.” Frontiers in Cell and Developmental Biology. Frontiers, 2020. https://doi.org/10.3389/fcell.2020.574382.","short":"A.H. Hansen, S. Hippenmeyer, Frontiers in Cell and Developmental Biology 8 (2020).","mla":"Hansen, Andi H., and Simon Hippenmeyer. “Non-Cell-Autonomous Mechanisms in Radial Projection Neuron Migration in the Developing Cerebral Cortex.” Frontiers in Cell and Developmental Biology, vol. 8, no. 9, 574382, Frontiers, 2020, doi:10.3389/fcell.2020.574382."},"publication":"Frontiers in Cell and Developmental Biology","article_type":"original","date_published":"2020-09-25T00:00:00Z","type":"journal_article","issue":"9","abstract":[{"lang":"eng","text":"Concerted radial migration of newly born cortical projection neurons, from their birthplace to their final target lamina, is a key step in the assembly of the cerebral cortex. The cellular and molecular mechanisms regulating the specific sequential steps of radial neuronal migration in vivo are however still unclear, let alone the effects and interactions with the extracellular environment. In any in vivo context, cells will always be exposed to a complex extracellular environment consisting of (1) secreted factors acting as potential signaling cues, (2) the extracellular matrix, and (3) other cells providing cell–cell interaction through receptors and/or direct physical stimuli. Most studies so far have described and focused mainly on intrinsic cell-autonomous gene functions in neuronal migration but there is accumulating evidence that non-cell-autonomous-, local-, systemic-, and/or whole tissue-wide effects substantially contribute to the regulation of radial neuronal migration. These non-cell-autonomous effects may differentially affect cortical neuron migration in distinct cellular environments. However, the cellular and molecular natures of such non-cell-autonomous mechanisms are mostly unknown. Furthermore, physical forces due to collective migration and/or community effects (i.e., interactions with surrounding cells) may play important roles in neocortical projection neuron migration. In this concise review, we first outline distinct models of non-cell-autonomous interactions of cortical projection neurons along their radial migration trajectory during development. We then summarize experimental assays and platforms that can be utilized to visualize and potentially probe non-cell-autonomous mechanisms. Lastly, we define key questions to address in the future."}],"_id":"8569","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 8","title":"Non-cell-autonomous mechanisms in radial projection neuron migration in the developing cerebral cortex","ddc":["570"],"status":"public","file":[{"access_level":"open_access","file_name":"2020_Frontiers_Hansen.pdf","creator":"dernst","file_size":5527139,"content_type":"application/pdf","file_id":"8584","relation":"main_file","success":1,"checksum":"01f731824194c94c81a5da360d997073","date_updated":"2020-09-28T13:11:17Z","date_created":"2020-09-28T13:11:17Z"}],"oa_version":"Published Version","publication_identifier":{"issn":["2296-634X"]},"month":"09","external_id":{"isi":["000577915900001"],"pmid":["33102480"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"name":"Molecular Mechanisms of Radial Neuronal Migration","grant_number":"24812","_id":"2625A13E-B435-11E9-9278-68D0E5697425"},{"name":"Molecular Mechanisms of Cerebral Cortex Development","call_identifier":"FP7","_id":"25D61E48-B435-11E9-9278-68D0E5697425","grant_number":"618444"}],"isi":1,"quality_controlled":"1","doi":"10.3389/fcell.2020.574382","language":[{"iso":"eng"}],"article_number":"574382","ec_funded":1,"file_date_updated":"2020-09-28T13:11:17Z","pmid":1,"acknowledgement":"AH was a recipient of a DOC Fellowship (24812) of the Austrian Academy of Sciences. This work also received support from IST Austria institutional funds; the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) under REA Grant Agreement No. 618444 to SH.","year":"2020","publisher":"Frontiers","department":[{"_id":"SiHi"}],"publication_status":"published","related_material":{"record":[{"id":"9962","relation":"dissertation_contains","status":"public"}]},"author":[{"id":"38853E16-F248-11E8-B48F-1D18A9856A87","last_name":"Hansen","first_name":"Andi H","full_name":"Hansen, Andi H"},{"full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon"}],"volume":8,"date_updated":"2024-03-28T23:30:41Z","date_created":"2020-09-26T06:11:07Z"},{"file":[{"relation":"main_file","file_id":"7816","date_updated":"2020-07-14T12:48:03Z","date_created":"2020-05-11T08:28:38Z","checksum":"3154ea7f90b9fb45e084cd1c2770597d","file_name":"jove-protocol-61147-lineage-tracing-clonal-analysis-developing-cerebral-cortex-using.pdf","access_level":"open_access","file_size":1352186,"content_type":"application/pdf","creator":"rbeattie"}],"oa_version":"Published Version","title":"Lineage tracing and clonal analysis in developing cerebral cortex using mosaic analysis with double markers (MADM)","status":"public","ddc":["570"],"_id":"7815","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"159","abstract":[{"text":"Beginning from a limited pool of progenitors, the mammalian cerebral cortex forms highly organized functional neural circuits. However, the underlying cellular and molecular mechanisms regulating lineage transitions of neural stem cells (NSCs) and eventual production of neurons and glia in the developing neuroepithelium remains unclear. Methods to trace NSC division patterns and map the lineage of clonally related cells have advanced dramatically. However, many contemporary lineage tracing techniques suffer from the lack of cellular resolution of progeny cell fate, which is essential for deciphering progenitor cell division patterns. Presented is a protocol using mosaic analysis with double markers (MADM) to perform in vivo clonal analysis. MADM concomitantly manipulates individual progenitor cells and visualizes precise division patterns and lineage progression at unprecedented single cell resolution. MADM-based interchromosomal recombination events during the G2-X phase of mitosis, together with temporally inducible CreERT2, provide exact information on the birth dates of clones and their division patterns. Thus, MADM lineage tracing provides unprecedented qualitative and quantitative optical readouts of the proliferation mode of stem cell progenitors at the single cell level. MADM also allows for examination of the mechanisms and functional requirements of candidate genes in NSC lineage progression. This method is unique in that comparative analysis of control and mutant subclones can be performed in the same tissue environment in vivo. Here, the protocol is described in detail, and experimental paradigms to employ MADM for clonal analysis and lineage tracing in the developing cerebral cortex are demonstrated. Importantly, this protocol can be adapted to perform MADM clonal analysis in any murine stem cell niche, as long as the CreERT2 driver is present.","lang":"eng"}],"type":"journal_article","date_published":"2020-05-08T00:00:00Z","article_type":"original","citation":{"ista":"Beattie RJ, Streicher C, Amberg N, Cheung GT, Contreras X, Hansen AH, Hippenmeyer S. 2020. Lineage tracing and clonal analysis in developing cerebral cortex using mosaic analysis with double markers (MADM). Journal of Visual Experiments. (159), e61147.","ieee":"R. J. Beattie et al., “Lineage tracing and clonal analysis in developing cerebral cortex using mosaic analysis with double markers (MADM),” Journal of Visual Experiments, no. 159. MyJove Corporation, 2020.","apa":"Beattie, R. J., Streicher, C., Amberg, N., Cheung, G. T., Contreras, X., Hansen, A. H., & Hippenmeyer, S. (2020). Lineage tracing and clonal analysis in developing cerebral cortex using mosaic analysis with double markers (MADM). Journal of Visual Experiments. MyJove Corporation. https://doi.org/10.3791/61147","ama":"Beattie RJ, Streicher C, Amberg N, et al. Lineage tracing and clonal analysis in developing cerebral cortex using mosaic analysis with double markers (MADM). Journal of Visual Experiments. 2020;(159). doi:10.3791/61147","chicago":"Beattie, Robert J, Carmen Streicher, Nicole Amberg, Giselle T Cheung, Ximena Contreras, Andi H Hansen, and Simon Hippenmeyer. “Lineage Tracing and Clonal Analysis in Developing Cerebral Cortex Using Mosaic Analysis with Double Markers (MADM).” Journal of Visual Experiments. MyJove Corporation, 2020. https://doi.org/10.3791/61147.","mla":"Beattie, Robert J., et al. “Lineage Tracing and Clonal Analysis in Developing Cerebral Cortex Using Mosaic Analysis with Double Markers (MADM).” Journal of Visual Experiments, no. 159, e61147, MyJove Corporation, 2020, doi:10.3791/61147.","short":"R.J. Beattie, C. Streicher, N. Amberg, G.T. Cheung, X. Contreras, A.H. Hansen, S. Hippenmeyer, Journal of Visual Experiments (2020)."},"publication":"Journal of Visual Experiments","has_accepted_license":"1","article_processing_charge":"No","day":"08","scopus_import":"1","date_updated":"2024-03-28T23:30:42Z","date_created":"2020-05-11T08:31:20Z","related_material":{"record":[{"id":"7902","status":"public","relation":"part_of_dissertation"}]},"author":[{"full_name":"Beattie, Robert J","first_name":"Robert J","last_name":"Beattie","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8483-8753"},{"full_name":"Streicher, Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","first_name":"Carmen","last_name":"Streicher"},{"id":"4CD6AAC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3183-8207","first_name":"Nicole","last_name":"Amberg","full_name":"Amberg, Nicole"},{"full_name":"Cheung, Giselle T","orcid":"0000-0001-8457-2572","id":"471195F6-F248-11E8-B48F-1D18A9856A87","last_name":"Cheung","first_name":"Giselle T"},{"full_name":"Contreras, Ximena","last_name":"Contreras","first_name":"Ximena","id":"475990FE-F248-11E8-B48F-1D18A9856A87"},{"id":"38853E16-F248-11E8-B48F-1D18A9856A87","last_name":"Hansen","first_name":"Andi H","full_name":"Hansen, Andi H"},{"last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon"}],"publisher":"MyJove Corporation","department":[{"_id":"SiHi"}],"publication_status":"published","year":"2020","ec_funded":1,"file_date_updated":"2020-07-14T12:48:03Z","article_number":"e61147","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"PreCl"}],"doi":"10.3791/61147","project":[{"grant_number":"M02416","_id":"264E56E2-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex","call_identifier":"FWF"},{"grant_number":"T0101031","_id":"268F8446-B435-11E9-9278-68D0E5697425","name":"Role of Eed in neural stem cell lineage progression","call_identifier":"FWF"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"name":"Molecular Mechanisms of Radial Neuronal Migration","_id":"2625A13E-B435-11E9-9278-68D0E5697425","grant_number":"24812"},{"name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","call_identifier":"H2020","_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000546406600043"]},"publication_identifier":{"issn":["1940-087X"]},"month":"05"},{"supervisor":[{"last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Hippenmeyer, Simon"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:7902","project":[{"_id":"260018B0-B435-11E9-9278-68D0E5697425","grant_number":"725780","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"oa":1,"month":"06","publication_identifier":{"issn":["2663-337X"]},"date_created":"2020-05-29T08:27:32Z","date_updated":"2023-10-18T08:45:16Z","author":[{"id":"475990FE-F248-11E8-B48F-1D18A9856A87","last_name":"Contreras","first_name":"Ximena","full_name":"Contreras, Ximena"}],"related_material":{"record":[{"id":"6830","relation":"dissertation_contains","status":"public"},{"relation":"dissertation_contains","status":"public","id":"28"},{"id":"7815","relation":"dissertation_contains","status":"public"}]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","department":[{"_id":"SiHi"}],"year":"2020","file_date_updated":"2021-06-07T22:30:03Z","ec_funded":1,"date_published":"2020-06-05T00:00:00Z","page":"214","citation":{"apa":"Contreras, X. (2020). Genetic dissection of neural development in health and disease at single cell resolution. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7902","ieee":"X. Contreras, “Genetic dissection of neural development in health and disease at single cell resolution,” Institute of Science and Technology Austria, 2020.","ista":"Contreras X. 2020. Genetic dissection of neural development in health and disease at single cell resolution. Institute of Science and Technology Austria.","ama":"Contreras X. Genetic dissection of neural development in health and disease at single cell resolution. 2020. doi:10.15479/AT:ISTA:7902","chicago":"Contreras, Ximena. “Genetic Dissection of Neural Development in Health and Disease at Single Cell Resolution.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7902.","short":"X. Contreras, Genetic Dissection of Neural Development in Health and Disease at Single Cell Resolution, Institute of Science and Technology Austria, 2020.","mla":"Contreras, Ximena. Genetic Dissection of Neural Development in Health and Disease at Single Cell Resolution. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7902."},"day":"05","article_processing_charge":"No","has_accepted_license":"1","file":[{"relation":"source_file","file_id":"7927","checksum":"43c172bf006c95b65992d473c7240d13","date_created":"2020-06-05T08:18:08Z","date_updated":"2021-06-07T22:30:03Z","access_level":"closed","embargo_to":"open_access","file_name":"PhDThesis_Contreras.docx","file_size":53134142,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"xcontreras"},{"file_size":35117191,"content_type":"application/pdf","creator":"xcontreras","access_level":"open_access","file_name":"PhDThesis_Contreras.pdf","checksum":"addfed9128271be05cae3608e03a6ec0","date_updated":"2021-06-07T22:30:03Z","date_created":"2020-06-05T08:18:07Z","relation":"main_file","file_id":"7928","embargo":"2021-06-06"}],"oa_version":"Published Version","status":"public","title":"Genetic dissection of neural development in health and disease at single cell resolution","ddc":["570"],"_id":"7902","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Mosaic genetic analysis has been widely used in different model organisms such as the fruit fly to study gene-function in a cell-autonomous or tissue-specific fashion. More recently, and less easily conducted, mosaic genetic analysis in mice has also been enabled with the ambition to shed light on human gene function and disease. These genetic tools are of particular interest, but not restricted to, the study of the brain. Notably, the MADM technology offers a genetic approach in mice to visualize and concomitantly manipulate small subsets of genetically defined cells at a clonal level and single cell resolution. MADM-based analysis has already advanced the study of genetic mechanisms regulating brain development and is expected that further MADM-based analysis of genetic alterations will continue to reveal important insights on the fundamental principles of development and disease to potentially assist in the development of new therapies or treatments.\r\nIn summary, this work completed and characterized the necessary genome-wide genetic tools to perform MADM-based analysis at single cell level of the vast majority of mouse genes in virtually any cell type and provided a protocol to perform lineage tracing using the novel MADM resource. Importantly, this work also explored and revealed novel aspects of biologically relevant events in an in vivo context, such as the chromosome-specific bias of chromatid sister segregation pattern, the generation of cell-type diversity in the cerebral cortex and in the cerebellum and finally, the relevance of the interplay between the cell-autonomous gene function and cell-non-autonomous (community) effects in radial glial progenitor lineage progression.\r\nThis work provides a foundation and opens the door to further elucidating the molecular mechanisms underlying neuronal diversity and astrocyte generation.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"type":"dissertation"},{"month":"07","publication_identifier":{"eissn":["1540-8140"]},"isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"external_id":{"isi":["000573631000004"]},"language":[{"iso":"eng"}],"doi":"10.1083/jcb.202007029","article_number":"e202007029","file_date_updated":"2021-02-02T23:30:03Z","publication_status":"published","department":[{"_id":"MiSi"}],"publisher":"Rockefeller University Press","year":"2020","date_created":"2020-08-02T22:00:57Z","date_updated":"2023-10-17T10:04:49Z","volume":219,"author":[{"full_name":"Sixt, Michael K","first_name":"Michael K","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"},{"full_name":"Huttenlocher, Anna","last_name":"Huttenlocher","first_name":"Anna"}],"scopus_import":"1","day":"22","article_processing_charge":"No","has_accepted_license":"1","article_type":"letter_note","publication":"The Journal of Cell Biology","citation":{"ama":"Sixt MK, Huttenlocher A. Zena Werb (1945-2020): Cell biology in context. The Journal of Cell Biology. 2020;219(8). doi:10.1083/jcb.202007029","ista":"Sixt MK, Huttenlocher A. 2020. Zena Werb (1945-2020): Cell biology in context. The Journal of Cell Biology. 219(8), e202007029.","ieee":"M. K. Sixt and A. Huttenlocher, “Zena Werb (1945-2020): Cell biology in context,” The Journal of Cell Biology, vol. 219, no. 8. Rockefeller University Press, 2020.","apa":"Sixt, M. K., & Huttenlocher, A. (2020). Zena Werb (1945-2020): Cell biology in context. The Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.202007029","mla":"Sixt, Michael K., and Anna Huttenlocher. “Zena Werb (1945-2020): Cell Biology in Context.” The Journal of Cell Biology, vol. 219, no. 8, e202007029, Rockefeller University Press, 2020, doi:10.1083/jcb.202007029.","short":"M.K. Sixt, A. Huttenlocher, The Journal of Cell Biology 219 (2020).","chicago":"Sixt, Michael K, and Anna Huttenlocher. “Zena Werb (1945-2020): Cell Biology in Context.” The Journal of Cell Biology. Rockefeller University Press, 2020. https://doi.org/10.1083/jcb.202007029."},"date_published":"2020-07-22T00:00:00Z","type":"journal_article","issue":"8","ddc":["570"],"status":"public","title":"Zena Werb (1945-2020): Cell biology in context","intvolume":" 219","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8190","file":[{"date_created":"2020-08-04T13:11:52Z","date_updated":"2021-02-02T23:30:03Z","checksum":"30016d778d266b8e17d01094917873b8","relation":"main_file","file_id":"8200","embargo":"2021-02-01","content_type":"application/pdf","file_size":830725,"creator":"dernst","file_name":"2020_JCB_Sixt.pdf","access_level":"open_access"}],"oa_version":"Published Version"},{"day":"11","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","date_published":"2020-12-11T00:00:00Z","article_type":"original","publication":"Science Advances","citation":{"ama":"Zhang Y, Rodriguez Solovey L, Li L, Zhang X, Friml J. Functional innovations of PIN auxin transporters mark crucial evolutionary transitions during rise of flowering plants. Science Advances. 2020;6(50). doi:10.1126/sciadv.abc8895","ieee":"Y. Zhang, L. Rodriguez Solovey, L. Li, X. Zhang, and J. Friml, “Functional innovations of PIN auxin transporters mark crucial evolutionary transitions during rise of flowering plants,” Science Advances, vol. 6, no. 50. AAAS, 2020.","apa":"Zhang, Y., Rodriguez Solovey, L., Li, L., Zhang, X., & Friml, J. (2020). Functional innovations of PIN auxin transporters mark crucial evolutionary transitions during rise of flowering plants. Science Advances. AAAS. https://doi.org/10.1126/sciadv.abc8895","ista":"Zhang Y, Rodriguez Solovey L, Li L, Zhang X, Friml J. 2020. Functional innovations of PIN auxin transporters mark crucial evolutionary transitions during rise of flowering plants. Science Advances. 6(50), eabc8895.","short":"Y. Zhang, L. Rodriguez Solovey, L. Li, X. Zhang, J. Friml, Science Advances 6 (2020).","mla":"Zhang, Yuzhou, et al. “Functional Innovations of PIN Auxin Transporters Mark Crucial Evolutionary Transitions during Rise of Flowering Plants.” Science Advances, vol. 6, no. 50, eabc8895, AAAS, 2020, doi:10.1126/sciadv.abc8895.","chicago":"Zhang, Yuzhou, Lesia Rodriguez Solovey, Lanxin Li, Xixi Zhang, and Jiří Friml. “Functional Innovations of PIN Auxin Transporters Mark Crucial Evolutionary Transitions during Rise of Flowering Plants.” Science Advances. AAAS, 2020. https://doi.org/10.1126/sciadv.abc8895."},"abstract":[{"text":"Flowering plants display the highest diversity among plant species and have notably shaped terrestrial landscapes. Nonetheless, the evolutionary origin of their unprecedented morphological complexity remains largely an enigma. Here, we show that the coevolution of cis-regulatory and coding regions of PIN-FORMED (PIN) auxin transporters confined their expression to certain cell types and directed their subcellular localization to particular cell sides, which together enabled dynamic auxin gradients across tissues critical to the complex architecture of flowering plants. Extensive intraspecies and interspecies genetic complementation experiments with PINs from green alga up to flowering plant lineages showed that PIN genes underwent three subsequent, critical evolutionary innovations and thus acquired a triple function to regulate the development of three essential components of the flowering plant Arabidopsis: shoot/root, inflorescence, and floral organ. Our work highlights the critical role of functional innovations within the PIN gene family as essential prerequisites for the origin of flowering plants.","lang":"eng"}],"issue":"50","type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"8994","date_created":"2021-01-07T12:44:33Z","date_updated":"2021-01-07T12:44:33Z","checksum":"5ac2500b191c08ef6dab5327f40ff663","success":1,"file_name":"2020_ScienceAdvances_Zhang.pdf","access_level":"open_access","file_size":10578145,"content_type":"application/pdf","creator":"dernst"}],"title":"Functional innovations of PIN auxin transporters mark crucial evolutionary transitions during rise of flowering plants","ddc":["580"],"status":"public","intvolume":" 6","_id":"8986","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","month":"12","publication_identifier":{"eissn":["2375-2548"]},"language":[{"iso":"eng"}],"doi":"10.1126/sciadv.abc8895","quality_controlled":"1","isi":1,"project":[{"grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020"},{"_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","name":"Molecular mechanisms of endocytic cargo recognition in plants","call_identifier":"FWF"},{"_id":"26B4D67E-B435-11E9-9278-68D0E5697425","grant_number":"25351","name":"A Case Study of Plant Growth Regulation: Molecular Mechanism of Auxin-mediated Rapid Growth Inhibition in Arabidopsis Root"}],"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"external_id":{"isi":["000599903600014"],"pmid":["33310852"]},"license":"https://creativecommons.org/licenses/by-nc/4.0/","file_date_updated":"2021-01-07T12:44:33Z","ec_funded":1,"article_number":"eabc8895","date_updated":"2024-03-28T23:30:44Z","date_created":"2021-01-03T23:01:23Z","volume":6,"author":[{"last_name":"Zhang","first_name":"Yuzhou","orcid":"0000-0003-2627-6956","id":"3B6137F2-F248-11E8-B48F-1D18A9856A87","full_name":"Zhang, Yuzhou"},{"full_name":"Rodriguez Solovey, Lesia","id":"3922B506-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7244-7237","first_name":"Lesia","last_name":"Rodriguez Solovey"},{"last_name":"Li","first_name":"Lanxin","orcid":"0000-0002-5607-272X","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Lanxin"},{"first_name":"Xixi","last_name":"Zhang","id":"61A66458-47E9-11EA-85BA-8AEAAF14E49A","orcid":"0000-0001-7048-4627","full_name":"Zhang, Xixi"},{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10083"}]},"publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"AAAS","acknowledgement":"We thank C.Löhne (Botanic Gardens, University of Bonn) for providing us with A. trichopoda. We would like to thank T.Han, A.Mally (IST, Austria), and C.Hartinger (University of Oxford) for constructive comment and careful reading. Funding: The research leading to these results has received funding from the European Union’s Horizon 2020 Research and Innovation Programme (ERC grant agreement number 742985), Austrian Science Fund (FWF, grant number I 3630-B25), DOC Fellowship of the Austrian Academy of Sciences, and IST Fellow program. ","year":"2020","pmid":1},{"date_published":"2020-08-10T00:00:00Z","article_type":"original","citation":{"ieee":"H. Chen et al., “AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling,” International Journal of Molecular Sciences, vol. 21, no. 16. MDPI, 2020.","apa":"Chen, H., Lai, L., Li, L., Liu, L., Jakada, B. H., Huang, Y., … Qin, Y. (2020). AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms21165727","ista":"Chen H, Lai L, Li L, Liu L, Jakada BH, Huang Y, He Q, Chai M, Niu X, Qin Y. 2020. AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling. International Journal of Molecular Sciences. 21(16), 5272.","ama":"Chen H, Lai L, Li L, et al. AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling. International Journal of Molecular Sciences. 2020;21(16). doi:10.3390/ijms21165727","chicago":"Chen, Huihuang, Linyi Lai, Lanxin Li, Liping Liu, Bello Hassan Jakada, Youmei Huang, Qing He, Mengnan Chai, Xiaoping Niu, and Yuan Qin. “AcoMYB4, an Ananas Comosus L. MYB Transcription Factor, Functions in Osmotic Stress through Negative Regulation of ABA Signaling.” International Journal of Molecular Sciences. MDPI, 2020. https://doi.org/10.3390/ijms21165727.","short":"H. Chen, L. Lai, L. Li, L. Liu, B.H. Jakada, Y. Huang, Q. He, M. Chai, X. Niu, Y. Qin, International Journal of Molecular Sciences 21 (2020).","mla":"Chen, Huihuang, et al. “AcoMYB4, an Ananas Comosus L. MYB Transcription Factor, Functions in Osmotic Stress through Negative Regulation of ABA Signaling.” International Journal of Molecular Sciences, vol. 21, no. 16, 5272, MDPI, 2020, doi:10.3390/ijms21165727."},"publication":"International Journal of Molecular Sciences","article_processing_charge":"No","has_accepted_license":"1","day":"10","scopus_import":"1","file":[{"creator":"cziletti","file_size":5718755,"content_type":"application/pdf","file_name":"2020_IntMolecSciences_Chen.pdf","access_level":"open_access","date_created":"2020-08-25T09:53:50Z","date_updated":"2020-08-25T09:53:50Z","success":1,"checksum":"03b039244e6ae80580385fd9f577e2b2","file_id":"8292","relation":"main_file"}],"oa_version":"Published Version","intvolume":" 21","title":"AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling","ddc":["570"],"status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"8283","issue":"16","abstract":[{"lang":"eng","text":"Drought and salt stress are the main environmental cues affecting the survival, development, distribution, and yield of crops worldwide. MYB transcription factors play a crucial role in plants’ biological processes, but the function of pineapple MYB genes is still obscure. In this study, one of the pineapple MYB transcription factors, AcoMYB4, was isolated and characterized. The results showed that AcoMYB4 is localized in the cell nucleus, and its expression is induced by low temperature, drought, salt stress, and hormonal stimulation, especially by abscisic acid (ABA). Overexpression of AcoMYB4 in rice and Arabidopsis enhanced plant sensitivity to osmotic stress; it led to an increase in the number stomata on leaf surfaces and lower germination rate under salt and drought stress. Furthermore, in AcoMYB4 OE lines, the membrane oxidation index, free proline, and soluble sugar contents were decreased. In contrast, electrolyte leakage and malondialdehyde (MDA) content increased significantly due to membrane injury, indicating higher sensitivity to drought and salinity stresses. Besides the above, both the expression level and activities of several antioxidant enzymes were decreased, indicating lower antioxidant activity in AcoMYB4 transgenic plants. Moreover, under osmotic stress, overexpression of AcoMYB4 inhibited ABA biosynthesis through a decrease in the transcription of genes responsible for ABA synthesis (ABA1 and ABA2) and ABA signal transduction factor ABI5. These results suggest that AcoMYB4 negatively regulates osmotic stress by attenuating cellular ABA biosynthesis and signal transduction pathways. "}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.3390/ijms21165727","quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["32785037"],"isi":["000565090300001"]},"oa":1,"publication_identifier":{"issn":["16616596"],"eissn":["14220067"]},"month":"08","volume":21,"date_updated":"2024-03-28T23:30:44Z","date_created":"2020-08-24T06:24:03Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"10083"}]},"author":[{"full_name":"Chen, Huihuang","last_name":"Chen","first_name":"Huihuang"},{"full_name":"Lai, Linyi","first_name":"Linyi","last_name":"Lai"},{"orcid":"0000-0002-5607-272X","id":"367EF8FA-F248-11E8-B48F-1D18A9856A87","last_name":"Li","first_name":"Lanxin","full_name":"Li, Lanxin"},{"full_name":"Liu, Liping","last_name":"Liu","first_name":"Liping"},{"full_name":"Jakada, Bello Hassan","first_name":"Bello Hassan","last_name":"Jakada"},{"first_name":"Youmei","last_name":"Huang","full_name":"Huang, Youmei"},{"last_name":"He","first_name":"Qing","full_name":"He, Qing"},{"first_name":"Mengnan","last_name":"Chai","full_name":"Chai, Mengnan"},{"full_name":"Niu, Xiaoping","last_name":"Niu","first_name":"Xiaoping"},{"full_name":"Qin, Yuan","first_name":"Yuan","last_name":"Qin"}],"publisher":"MDPI","department":[{"_id":"JiFr"}],"publication_status":"published","pmid":1,"acknowledgement":"We would like to thank the reviewers for their helpful comments on the original manuscript. ","year":"2020","file_date_updated":"2020-08-25T09:53:50Z","article_number":"5272"},{"scopus_import":"1","day":"06","article_processing_charge":"No","has_accepted_license":"1","article_type":"original","publication":"Journal of Cell Science","citation":{"chicago":"Johnson, Alexander J, Nataliia Gnyliukh, Walter Kaufmann, Madhumitha Narasimhan, G Vert, SY Bednarek, and Jiří Friml. “Experimental Toolbox for Quantitative Evaluation of Clathrin-Mediated Endocytosis in the Plant Model Arabidopsis.” Journal of Cell Science. The Company of Biologists, 2020. https://doi.org/10.1242/jcs.248062.","mla":"Johnson, Alexander J., et al. “Experimental Toolbox for Quantitative Evaluation of Clathrin-Mediated Endocytosis in the Plant Model Arabidopsis.” Journal of Cell Science, vol. 133, no. 15, jcs248062, The Company of Biologists, 2020, doi:10.1242/jcs.248062.","short":"A.J. Johnson, N. Gnyliukh, W. Kaufmann, M. Narasimhan, G. Vert, S. Bednarek, J. Friml, Journal of Cell Science 133 (2020).","ista":"Johnson AJ, Gnyliukh N, Kaufmann W, Narasimhan M, Vert G, Bednarek S, Friml J. 2020. Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis. Journal of Cell Science. 133(15), jcs248062.","ieee":"A. J. Johnson et al., “Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis,” Journal of Cell Science, vol. 133, no. 15. The Company of Biologists, 2020.","apa":"Johnson, A. J., Gnyliukh, N., Kaufmann, W., Narasimhan, M., Vert, G., Bednarek, S., & Friml, J. (2020). Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis. Journal of Cell Science. The Company of Biologists. https://doi.org/10.1242/jcs.248062","ama":"Johnson AJ, Gnyliukh N, Kaufmann W, et al. Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis. Journal of Cell Science. 2020;133(15). doi:10.1242/jcs.248062"},"date_published":"2020-08-06T00:00:00Z","type":"journal_article","abstract":[{"text":"Clathrin-mediated endocytosis (CME) is a crucial cellular process implicated in many aspects of plant growth, development, intra- and inter-cellular signaling, nutrient uptake and pathogen defense. Despite these significant roles, little is known about the precise molecular details of how it functions in planta. In order to facilitate the direct quantitative study of plant CME, here we review current routinely used methods and present refined, standardized quantitative imaging protocols which allow the detailed characterization of CME at multiple scales in plant tissues. These include: (i) an efficient electron microscopy protocol for the imaging of Arabidopsis CME vesicles in situ, thus providing a method for the detailed characterization of the ultra-structure of clathrin-coated vesicles; (ii) a detailed protocol and analysis for quantitative live-cell fluorescence microscopy to precisely examine the temporal interplay of endocytosis components during single CME events; (iii) a semi-automated analysis to allow the quantitative characterization of global internalization of cargos in whole plant tissues; and (iv) an overview and validation of useful genetic and pharmacological tools to interrogate the molecular mechanisms and function of CME in intact plant samples.","lang":"eng"}],"issue":"15","ddc":["575"],"status":"public","title":"Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis","intvolume":" 133","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"8139","oa_version":"Published Version","file":[{"checksum":"2d11f79a0b4e0a380fb002b933da331a","date_created":"2020-11-26T17:12:51Z","date_updated":"2021-08-08T22:30:03Z","file_id":"8815","embargo":"2021-08-07","relation":"main_file","creator":"ajohnson","file_size":15150403,"content_type":"application/pdf","access_level":"open_access","file_name":"2020 - Johnson - JSC - plant CME toolbox.pdf"}],"month":"08","publication_identifier":{"eissn":["1477-9137"],"issn":["0021-9533"]},"isi":1,"quality_controlled":"1","project":[{"_id":"26538374-B435-11E9-9278-68D0E5697425","grant_number":"I03630","call_identifier":"FWF","name":"Molecular mechanisms of endocytic cargo recognition in plants"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"oa":1,"external_id":{"isi":["000561047900021"],"pmid":["32616560"]},"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"Bio"}],"language":[{"iso":"eng"}],"doi":"10.1242/jcs.248062","article_number":"jcs248062","file_date_updated":"2021-08-08T22:30:03Z","ec_funded":1,"publication_status":"published","publisher":"The Company of Biologists","department":[{"_id":"JiFr"},{"_id":"EM-Fac"}],"acknowledgement":"This paper is dedicated to the memory of Christien Merrifield. He pioneered quantitative\r\nimaging approaches in mammalian CME and his mentorship inspired the development of all\r\nthe analysis methods presented here. His joy in research, pure scientific curiosity and\r\nmicroscopy excellence remain a constant inspiration. We thank Daniel Van Damme for gifting\r\nus the CLC2-GFP x TPLATE-TagRFP plants used in this manuscript. We further thank the\r\nScientific Service Units at IST Austria; specifically, the Electron Microscopy Facility for\r\ntechnical assistance (in particular Vanessa Zheden) and the BioImaging Facility BioImaging\r\nFacility for access to equipment. ","year":"2020","pmid":1,"date_updated":"2023-12-01T13:51:07Z","date_created":"2020-07-21T08:58:19Z","volume":133,"author":[{"full_name":"Johnson, Alexander J","last_name":"Johnson","first_name":"Alexander J","orcid":"0000-0002-2739-8843","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gnyliukh, Nataliia","last_name":"Gnyliukh","first_name":"Nataliia","orcid":"0000-0002-2198-0509","id":"390C1120-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Walter","last_name":"Kaufmann","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9735-5315","full_name":"Kaufmann, Walter"},{"full_name":"Narasimhan, Madhumitha","orcid":"0000-0002-8600-0671","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","last_name":"Narasimhan","first_name":"Madhumitha"},{"full_name":"Vert, G","first_name":"G","last_name":"Vert"},{"full_name":"Bednarek, SY","last_name":"Bednarek","first_name":"SY"},{"last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"14510"}]}},{"date_published":"2020-05-11T00:00:00Z","publication":"Plant Communications","citation":{"apa":"Semerádová, H., Montesinos López, J. C., & Benková, E. (2020). All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. Plant Communications. Elsevier. https://doi.org/10.1016/j.xplc.2020.100048","ieee":"H. Semerádová, J. C. Montesinos López, and E. Benková, “All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways,” Plant Communications, vol. 1, no. 3. Elsevier, 2020.","ista":"Semerádová H, Montesinos López JC, Benková E. 2020. All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. Plant Communications. 1(3), 100048.","ama":"Semerádová H, Montesinos López JC, Benková E. All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways. Plant Communications. 2020;1(3). doi:10.1016/j.xplc.2020.100048","chicago":"Semerádová, Hana, Juan C Montesinos López, and Eva Benková. “All Roads Lead to Auxin: Post-Translational Regulation of Auxin Transport by Multiple Hormonal Pathways.” Plant Communications. Elsevier, 2020. https://doi.org/10.1016/j.xplc.2020.100048.","short":"H. Semerádová, J.C. Montesinos López, E. Benková, Plant Communications 1 (2020).","mla":"Semerádová, Hana, et al. “All Roads Lead to Auxin: Post-Translational Regulation of Auxin Transport by Multiple Hormonal Pathways.” Plant Communications, vol. 1, no. 3, 100048, Elsevier, 2020, doi:10.1016/j.xplc.2020.100048."},"article_type":"original","day":"11","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","file":[{"file_id":"9161","relation":"main_file","date_created":"2021-02-18T10:23:59Z","date_updated":"2021-02-18T10:23:59Z","success":1,"checksum":"785b266d82a94b007cf40dbbe7c4847e","file_name":"2020_PlantComm_Semeradova.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":840289}],"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"9160","title":"All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways","status":"public","ddc":["580"],"intvolume":" 1","abstract":[{"lang":"eng","text":"Auxin is a key hormonal regulator, that governs plant growth and development in concert with other hormonal pathways. The unique feature of auxin is its polar, cell-to-cell transport that leads to the formation of local auxin maxima and gradients, which coordinate initiation and patterning of plant organs. The molecular machinery mediating polar auxin transport is one of the important points of interaction with other hormones. Multiple hormonal pathways converge at the regulation of auxin transport and form a regulatory network that integrates various developmental and environmental inputs to steer plant development. In this review, we discuss recent advances in understanding the mechanisms that underlie regulation of polar auxin transport by multiple hormonal pathways. Specifically, we focus on the post-translational mechanisms that contribute to fine-tuning of the abundance and polarity of auxin transporters at the plasma membrane and thereby enable rapid modification of the auxin flow to coordinate plant growth and development."}],"issue":"3","type":"journal_article","doi":"10.1016/j.xplc.2020.100048","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"pmid":["33367243"],"isi":["000654052800010"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"name":"Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis.","grant_number":"24746","_id":"261821BC-B435-11E9-9278-68D0E5697425"},{"_id":"253E54C8-B435-11E9-9278-68D0E5697425","grant_number":"ALTF710-2016","name":"Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants"}],"month":"05","publication_identifier":{"issn":["2590-3462"]},"author":[{"full_name":"Semeradova, Hana","id":"42FE702E-F248-11E8-B48F-1D18A9856A87","last_name":"Semeradova","first_name":"Hana"},{"last_name":"Montesinos López","first_name":"Juan C","orcid":"0000-0001-9179-6099","id":"310A8E3E-F248-11E8-B48F-1D18A9856A87","full_name":"Montesinos López, Juan C"},{"full_name":"Benková, Eva","last_name":"Benková","first_name":"Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"id":"10135","relation":"dissertation_contains","status":"public"}]},"date_created":"2021-02-18T10:18:43Z","date_updated":"2024-03-28T23:30:47Z","volume":1,"year":"2020","acknowledgement":"H.S. is the recipient of a DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology, Austria. J.C.M. is the recipient of an EMBO Long-Term Fellowship (ALTF number 710-2016). We would like to thank Jiri Friml and Carina Baskett for critical reading of the manuscript and Shutang Tan and Maciek Adamowski for helpful discussions. No conflict of interest declared.","pmid":1,"publication_status":"published","publisher":"Elsevier","department":[{"_id":"EvBe"}],"file_date_updated":"2021-02-18T10:23:59Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_number":"100048"},{"alternative_title":["EPiC Series in Computing"],"type":"conference","abstract":[{"text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with piecewise constant dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this third edition, six tools have been applied to solve five different benchmark problems in the category for piecewise constant dynamics: BACH, Lyse, Hy- COMP, PHAVer/SX, PHAVerLite, and VeriSiMPL. Compared to last year, a new tool has participated (HyCOMP) and PHAVerLite has replaced PHAVer-lite. The result is a snap- shot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with piecewise constant dynamics up to this date.","lang":"eng"}],"title":"ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics","ddc":["000"],"status":"public","intvolume":" 61","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10877","oa_version":"Published Version","file":[{"relation":"main_file","file_id":"11391","checksum":"4b92e333db7b4e2349501a804dfede69","success":1,"date_updated":"2022-05-17T06:55:49Z","date_created":"2022-05-17T06:55:49Z","access_level":"open_access","file_name":"2019_EPiCs_Frehse.pdf","content_type":"application/pdf","file_size":346415,"creator":"dernst"}],"scopus_import":"1","day":"25","article_processing_charge":"No","has_accepted_license":"1","page":"1-13","publication":"ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems","citation":{"mla":"Frehse, Goran, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, vol. 61, EasyChair, 2019, pp. 1–13, doi:10.29007/rjwn.","short":"G. Frehse, A. Abate, D. Adzkiya, A. Becchi, L. Bu, A. Cimatti, M. Giacobbe, A. Griggio, S. Mover, M.S. Mufid, I. Riouak, S. Tonetta, E. Zaffanella, in:, G. Frehse, M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, EasyChair, 2019, pp. 1–13.","chicago":"Frehse, Goran, Alessandro Abate, Dieky Adzkiya, Anna Becchi, Lei Bu, Alessandro Cimatti, Mirco Giacobbe, et al. “ARCH-COMP19 Category Report: Hybrid Systems with Piecewise Constant Dynamics.” In ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, edited by Goran Frehse and Matthias Althoff, 61:1–13. EasyChair, 2019. https://doi.org/10.29007/rjwn.","ama":"Frehse G, Abate A, Adzkiya D, et al. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In: Frehse G, Althoff M, eds. ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. Vol 61. EasyChair; 2019:1-13. doi:10.29007/rjwn","ista":"Frehse G, Abate A, Adzkiya D, Becchi A, Bu L, Cimatti A, Giacobbe M, Griggio A, Mover S, Mufid MS, Riouak I, Tonetta S, Zaffanella E. 2019. ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems, EPiC Series in Computing, vol. 61, 1–13.","apa":"Frehse, G., Abate, A., Adzkiya, D., Becchi, A., Bu, L., Cimatti, A., … Zaffanella, E. (2019). ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics. In G. Frehse & M. Althoff (Eds.), ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems (Vol. 61, pp. 1–13). Montreal, Canada: EasyChair. https://doi.org/10.29007/rjwn","ieee":"G. Frehse et al., “ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics,” in ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems, Montreal, Canada, 2019, vol. 61, pp. 1–13."},"date_published":"2019-05-25T00:00:00Z","file_date_updated":"2022-05-17T06:55:49Z","publication_status":"published","editor":[{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"full_name":"Althoff, Matthias","last_name":"Althoff","first_name":"Matthias"}],"department":[{"_id":"ToHe"}],"publisher":"EasyChair","year":"2019","acknowledgement":"The authors gratefully acknowledge \fnancial support by the European Commission project\r\nUnCoVerCPS under grant number 643921. Lei Bu is supported by the National Natural Science\r\nFoundation of China (No.61572249).","date_created":"2022-03-18T12:29:23Z","date_updated":"2022-05-17T07:09:47Z","volume":61,"author":[{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"last_name":"Abate","first_name":"Alessandro","full_name":"Abate, Alessandro"},{"first_name":"Dieky","last_name":"Adzkiya","full_name":"Adzkiya, Dieky"},{"full_name":"Becchi, Anna","last_name":"Becchi","first_name":"Anna"},{"full_name":"Bu, Lei","last_name":"Bu","first_name":"Lei"},{"last_name":"Cimatti","first_name":"Alessandro","full_name":"Cimatti, Alessandro"},{"id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904","first_name":"Mirco","last_name":"Giacobbe","full_name":"Giacobbe, Mirco"},{"last_name":"Griggio","first_name":"Alberto","full_name":"Griggio, Alberto"},{"full_name":"Mover, Sergio","first_name":"Sergio","last_name":"Mover"},{"full_name":"Mufid, Muhammad Syifa'ul","first_name":"Muhammad Syifa'ul","last_name":"Mufid"},{"full_name":"Riouak, Idriss","last_name":"Riouak","first_name":"Idriss"},{"first_name":"Stefano","last_name":"Tonetta","full_name":"Tonetta, Stefano"},{"full_name":"Zaffanella, Enea","last_name":"Zaffanella","first_name":"Enea"}],"month":"05","publication_identifier":{"issn":["2398-7340"]},"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15","start_date":"2019-04-15","location":"Montreal, Canada"},"doi":"10.29007/rjwn"},{"ec_funded":1,"publist_id":"7382","year":"2019","publisher":"Springer Nature","department":[{"_id":"TaHa"}],"publication_status":"published","author":[{"last_name":"Kalinin","first_name":"Nikita","full_name":"Kalinin, Nikita"},{"orcid":"0000-0002-4310-178X","id":"35084A62-F248-11E8-B48F-1D18A9856A87","last_name":"Shkolnikov","first_name":"Mikhail","full_name":"Shkolnikov, Mikhail"}],"volume":5,"date_updated":"2021-01-12T07:56:46Z","date_created":"2018-12-11T11:46:29Z","publication_identifier":{"issn":["2199-675X"],"eissn":["2199-6768"]},"month":"09","external_id":{"arxiv":["1711.02089"]},"main_file_link":[{"url":"https://arxiv.org/abs/1711.02089","open_access":"1"}],"oa":1,"project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","doi":"10.1007/s40879-018-0218-0","language":[{"iso":"eng"}],"type":"journal_article","issue":"3","_id":"441","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","intvolume":" 5","status":"public","title":"Tropical formulae for summation over a part of SL(2,Z)","oa_version":"Preprint","scopus_import":1,"article_processing_charge":"No","day":"15","citation":{"short":"N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928.","mla":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics, vol. 5, no. 3, Springer Nature, 2019, pp. 909–928, doi:10.1007/s40879-018-0218-0.","chicago":"Kalinin, Nikita, and Mikhail Shkolnikov. “Tropical Formulae for Summation over a Part of SL(2,Z).” European Journal of Mathematics. Springer Nature, 2019. https://doi.org/10.1007/s40879-018-0218-0.","ama":"Kalinin N, Shkolnikov M. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 2019;5(3):909–928. doi:10.1007/s40879-018-0218-0","apa":"Kalinin, N., & Shkolnikov, M. (2019). Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s40879-018-0218-0","ieee":"N. Kalinin and M. Shkolnikov, “Tropical formulae for summation over a part of SL(2,Z),” European Journal of Mathematics, vol. 5, no. 3. Springer Nature, pp. 909–928, 2019.","ista":"Kalinin N, Shkolnikov M. 2019. Tropical formulae for summation over a part of SL(2,Z). European Journal of Mathematics. 5(3), 909–928."},"publication":"European Journal of Mathematics","page":"909–928","article_type":"original","date_published":"2019-09-15T00:00:00Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5793","year":"2019","title":"Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids","status":"public","publication_status":"published","intvolume":" 1893","department":[{"_id":"CaHe"}],"editor":[{"last_name":"Hergovich","first_name":"Alexander","full_name":"Hergovich, Alexander"}],"publisher":"Springer","author":[{"full_name":"Asaoka, Yoichi","last_name":"Asaoka","first_name":"Yoichi"},{"full_name":"Morita, Hitoshi","first_name":"Hitoshi","last_name":"Morita"},{"first_name":"Hiroko","last_name":"Furumoto","full_name":"Furumoto, Hiroko"},{"full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Furutani-Seiki, Makoto","first_name":"Makoto","last_name":"Furutani-Seiki"}],"date_updated":"2021-01-12T08:03:30Z","date_created":"2019-01-06T22:59:11Z","volume":1893,"oa_version":"None","type":"book_chapter","alternative_title":["MIMB"],"abstract":[{"text":"The transcription coactivator, Yes-associated protein (YAP), which is a nuclear effector of the Hippo signaling pathway, has been shown to be a mechano-transducer. By using mutant fish and human 3D spheroids, we have recently demonstrated that YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis of organ and global body shape by controlling actomyosin-mediated tissue tension. In this chapter, we present a platform that links the findings in fish embryos with human cells. The protocols for analyzing tissue tension-mediated global body shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in vitro using human cell spheroids represent useful tools for unraveling the molecular mechanisms by which YAP functions in regulating global body/organ morphogenesis.","lang":"eng"}],"publication":"The hippo pathway","citation":{"ama":"Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: Hergovich A, ed. The Hippo Pathway. Vol 1893. Methods in Molecular Biology. Springer; 2019:167-181. doi:10.1007/978-1-4939-8910-2_14","ieee":"Y. Asaoka, H. Morita, H. Furumoto, C.-P. J. Heisenberg, and M. Furutani-Seiki, “Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids,” in The hippo pathway, vol. 1893, A. Hergovich, Ed. Springer, 2019, pp. 167–181.","apa":"Asaoka, Y., Morita, H., Furumoto, H., Heisenberg, C.-P. J., & Furutani-Seiki, M. (2019). Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In A. Hergovich (Ed.), The hippo pathway (Vol. 1893, pp. 167–181). Springer. https://doi.org/10.1007/978-1-4939-8910-2_14","ista":"Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The hippo pathway. MIMB, vol. 1893, 167–181.","short":"Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki, in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181.","mla":"Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” The Hippo Pathway, edited by Alexander Hergovich, vol. 1893, Springer, 2019, pp. 167–81, doi:10.1007/978-1-4939-8910-2_14.","chicago":"Asaoka, Yoichi, Hitoshi Morita, Hiroko Furumoto, Carl-Philipp J Heisenberg, and Makoto Furutani-Seiki. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” In The Hippo Pathway, edited by Alexander Hergovich, 1893:167–81. Methods in Molecular Biology. Springer, 2019. https://doi.org/10.1007/978-1-4939-8910-2_14."},"quality_controlled":"1","page":"167-181","date_published":"2019-01-01T00:00:00Z","doi":"10.1007/978-1-4939-8910-2_14","language":[{"iso":"eng"}],"scopus_import":1,"series_title":"Methods in Molecular Biology","month":"01","day":"01","publication_identifier":{"isbn":["978-1-4939-8909-6"]}},{"abstract":[{"text":"Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Preprint","_id":"5887","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Per-session security: Password-based cryptography revisited","status":"public","intvolume":" 27","day":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2019-01-01T00:00:00Z","publication":"Journal of Computer Security","citation":{"chicago":"Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131.","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.","mla":"Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.","apa":"Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131","ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.","ama":"Demay G, Gazi P, Maurer U, Tackmann B. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 2019;27(1):75-111. doi:10.3233/JCS-181131"},"article_type":"original","page":"75-111","ec_funded":1,"author":[{"last_name":"Demay","first_name":"Gregory","full_name":"Demay, Gregory"},{"first_name":"Peter","last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"last_name":"Maurer","first_name":"Ueli","full_name":"Maurer, Ueli"},{"full_name":"Tackmann, Bjorn","last_name":"Tackmann","first_name":"Bjorn"}],"date_created":"2019-01-27T22:59:10Z","date_updated":"2021-01-12T08:05:08Z","volume":27,"year":"2019","publication_status":"published","publisher":"IOS Press","department":[{"_id":"KrPi"}],"month":"01","publication_identifier":{"issn":["0926227X"]},"doi":"10.3233/JCS-181131","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/166"}],"oa":1,"quality_controlled":"1","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}]},{"month":"07","publication_identifier":{"issn":["1920-180X"]},"doi":"10.20382/jocg.v10i1a9","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"file_date_updated":"2020-07-14T12:47:32Z","ec_funded":1,"author":[{"last_name":"Dyer","first_name":"Ramsay","full_name":"Dyer, Ramsay"},{"full_name":"Vegter, Gert","first_name":"Gert","last_name":"Vegter"},{"full_name":"Wintraecken, Mathijs","last_name":"Wintraecken","first_name":"Mathijs","orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2019-06-03T09:35:33Z","date_updated":"2021-01-12T08:07:50Z","volume":10,"year":"2019","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Carleton University","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2019-07-01T00:00:00Z","publication":"Journal of Computational Geometry ","citation":{"ama":"Dyer R, Vegter G, Wintraecken M. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 2019;10(1):223–256. doi:10.20382/jocg.v10i1a9","ista":"Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256.","ieee":"R. Dyer, G. Vegter, and M. Wintraecken, “Simplices modelled on spaces of constant curvature,” Journal of Computational Geometry , vol. 10, no. 1. Carleton University, pp. 223–256, 2019.","apa":"Dyer, R., Vegter, G., & Wintraecken, M. (2019). Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . Carleton University. https://doi.org/10.20382/jocg.v10i1a9","mla":"Dyer, Ramsay, et al. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry , vol. 10, no. 1, Carleton University, 2019, pp. 223–256, doi:10.20382/jocg.v10i1a9.","short":"R. Dyer, G. Vegter, M. Wintraecken, Journal of Computational Geometry 10 (2019) 223–256.","chicago":"Dyer, Ramsay, Gert Vegter, and Mathijs Wintraecken. “Simplices Modelled on Spaces of Constant Curvature.” Journal of Computational Geometry . Carleton University, 2019. https://doi.org/10.20382/jocg.v10i1a9."},"page":"223–256","abstract":[{"lang":"eng","text":"We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature."}],"issue":"1","type":"journal_article","file":[{"creator":"mwintrae","file_size":2170882,"content_type":"application/pdf","file_name":"mainJournalFinal.pdf","access_level":"open_access","date_created":"2019-06-03T09:30:01Z","date_updated":"2020-07-14T12:47:32Z","checksum":"57b4df2f16a74eb499734ec8ee240178","file_id":"6516","relation":"main_file"}],"oa_version":"Published Version","_id":"6515","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["510"],"title":"Simplices modelled on spaces of constant curvature","intvolume":" 10"},{"language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ITCS.2019.60","conference":{"start_date":"2019-01-10","location":"San Diego, CA, United States","end_date":"2019-01-12","name":"ITCS 2019: Innovations in Theoretical Computer Science"},"project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/627"}],"oa":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-095-8"]},"month":"01","volume":124,"date_updated":"2021-01-12T08:07:53Z","date_created":"2019-06-06T14:12:36Z","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2019","ec_funded":1,"file_date_updated":"2020-07-14T12:47:33Z","article_number":"60","date_published":"2019-01-10T00:00:00Z","citation":{"ama":"Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60","ista":"Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.","ieee":"K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.","apa":"Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60","mla":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.ITCS.2019.60.","short":"K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ITCS.2019.60."},"publication":"10th Innovations in Theoretical Computer Science Conference","article_processing_charge":"No","has_accepted_license":"1","day":"10","scopus_import":1,"oa_version":"Published Version","file":[{"creator":"dernst","file_size":558770,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_LIPIcs_Pietrzak.pdf","checksum":"f0ae1bb161431d9db3dea5ace082bfb5","date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-06T14:22:04Z","file_id":"6529","relation":"main_file"}],"intvolume":" 124","title":"Simple verifiable delay functions","ddc":["000"],"status":"public","_id":"6528","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We construct a verifiable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple (N,x,T,y) satisfies y=x2T (mod N) where the prover doesn’t know the factorization of N and its running time is dominated by solving the puzzle, that is, compute x2T, which is conjectured to require T sequential squarings. To get a VDF we make this protocol non-interactive using the Fiat-Shamir heuristic.The motivation for this work comes from the Chia blockchain design, which uses a VDF as akey ingredient. For typical parameters (T≤2 40, N= 2048), our proofs are of size around 10K B, verification cost around three RSA exponentiations and computing the proof is 8000 times faster than solving the puzzle even without any parallelism."}],"alternative_title":["LIPIcs"],"type":"conference"},{"scopus_import":"1","day":"16","article_processing_charge":"No","has_accepted_license":"1","publication":"5th Indian Control Conference Proceedings","citation":{"short":"A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019.","mla":"Kundu, Atreyee, et al. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” 5th Indian Control Conference Proceedings, 8715598, IEEE, 2019, doi:10.1109/INDIANCC.2019.8715598.","chicago":"Kundu, Atreyee, Miriam Garcia Soto, and Pavithra Prabhakar. “Formal Synthesis of Stabilizing Controllers for Periodically Controlled Linear Switched Systems.” In 5th Indian Control Conference Proceedings. IEEE, 2019. https://doi.org/10.1109/INDIANCC.2019.8715598.","ama":"Kundu A, Garcia Soto M, Prabhakar P. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In: 5th Indian Control Conference Proceedings. IEEE; 2019. doi:10.1109/INDIANCC.2019.8715598","ieee":"A. Kundu, M. Garcia Soto, and P. Prabhakar, “Formal synthesis of stabilizing controllers for periodically controlled linear switched systems,” in 5th Indian Control Conference Proceedings, Delhi, India, 2019.","apa":"Kundu, A., Garcia Soto, M., & Prabhakar, P. (2019). Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. In 5th Indian Control Conference Proceedings. Delhi, India: IEEE. https://doi.org/10.1109/INDIANCC.2019.8715598","ista":"Kundu A, Garcia Soto M, Prabhakar P. 2019. Formal synthesis of stabilizing controllers for periodically controlled linear switched systems. 5th Indian Control Conference Proceedings. ICC 2019 - Indian Control Conference, 8715598."},"date_published":"2019-05-16T00:00:00Z","type":"conference","abstract":[{"text":"In this paper, we address the problem of synthesizing periodic switching controllers for stabilizing a family of linear systems. Our broad approach consists of constructing a finite game graph based on the family of linear systems such that every winning strategy on the game graph corresponds to a stabilizing switching controller for the family of linear systems. The construction of a (finite) game graph, the synthesis of a winning strategy and the extraction of a stabilizing controller are all computationally feasible. We illustrate our method on an example.","lang":"eng"}],"_id":"6565","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Formal synthesis of stabilizing controllers for periodically controlled linear switched systems","ddc":["000"],"oa_version":"Submitted Version","file":[{"file_id":"8687","relation":"main_file","success":1,"checksum":"d622a91af1e427f6b1e0ba8e18a2b767","date_updated":"2020-10-21T13:13:49Z","date_created":"2020-10-21T13:13:49Z","access_level":"open_access","file_name":"2019_ICC_Kundu.pdf","creator":"dernst","content_type":"application/pdf","file_size":396031}],"month":"05","publication_identifier":{"isbn":["978-153866246-5"]},"oa":1,"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"conference":{"name":"ICC 2019 - Indian Control Conference","end_date":"2019-01-11","location":"Delhi, India","start_date":"2019-01-09"},"doi":"10.1109/INDIANCC.2019.8715598","language":[{"iso":"eng"}],"article_number":"8715598","file_date_updated":"2020-10-21T13:13:49Z","year":"2019","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"IEEE","author":[{"full_name":"Kundu, Atreyee","last_name":"Kundu","first_name":"Atreyee"},{"full_name":"Garcia Soto, Miriam","first_name":"Miriam","last_name":"Garcia Soto","id":"4B3207F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0003−2936−5719"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"date_created":"2019-06-17T06:57:33Z","date_updated":"2021-01-12T08:08:01Z"},{"language":[{"iso":"eng"}],"date_published":"2019-08-01T00:00:00Z","conference":{"end_date":"2019-08-10","start_date":"2019-08-08","location":"Edmonton, Canada","name":"CCCG: Canadian Conference in Computational Geometry"},"project":[{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"page":"275-279","quality_controlled":"1","citation":{"ama":"Vegter G, Wintraecken M. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In: The 31st Canadian Conference in Computational Geometry. ; 2019:275-279.","ista":"Vegter G, Wintraecken M. 2019. The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. The 31st Canadian Conference in Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 275–279.","apa":"Vegter, G., & Wintraecken, M. (2019). The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds. In The 31st Canadian Conference in Computational Geometry (pp. 275–279). Edmonton, Canada.","ieee":"G. Vegter and M. Wintraecken, “The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds,” in The 31st Canadian Conference in Computational Geometry, Edmonton, Canada, 2019, pp. 275–279.","mla":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–79.","short":"G. Vegter, M. Wintraecken, in:, The 31st Canadian Conference in Computational Geometry, 2019, pp. 275–279.","chicago":"Vegter, Gert, and Mathijs Wintraecken. “The Extrinsic Nature of the Hausdorff Distance of Optimal Triangulations of Manifolds.” In The 31st Canadian Conference in Computational Geometry, 275–79, 2019."},"oa":1,"publication":"The 31st Canadian Conference in Computational Geometry","has_accepted_license":"1","day":"01","month":"08","scopus_import":1,"file":[{"checksum":"ceabd152cfa55170d57763f9c6c60a53","date_updated":"2020-07-14T12:47:34Z","date_created":"2019-07-12T08:32:46Z","file_id":"6629","relation":"main_file","creator":"mwintrae","content_type":"application/pdf","file_size":321176,"access_level":"open_access","file_name":"IntrinsicExtrinsicCCCG2019.pdf"}],"oa_version":"Submitted Version","date_created":"2019-07-12T08:34:57Z","date_updated":"2021-01-12T08:08:16Z","author":[{"full_name":"Vegter, Gert","first_name":"Gert","last_name":"Vegter"},{"full_name":"Wintraecken, Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","first_name":"Mathijs","last_name":"Wintraecken"}],"department":[{"_id":"HeEd"}],"title":"The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds","ddc":["004"],"publication_status":"published","status":"public","_id":"6628","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2019","ec_funded":1,"abstract":[{"lang":"eng","text":"Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise flat triangular meshes with a given number of vertices on the hypersurface that are optimal with respect to Hausdorff distance. They proved that this Hausdorff distance decreases inversely proportional with m 2/(d−1), where m is the number of vertices and d is the dimension of Euclidean space. Moreover the pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity. In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension. We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space."}],"file_date_updated":"2020-07-14T12:47:34Z","type":"conference"},{"month":"06","publication_identifier":{"isbn":["9783959771047"]},"language":[{"iso":"eng"}],"conference":{"location":"Portland, OR, United States","start_date":"2019-06-18","end_date":"2019-06-21","name":"SoCG 2019: Symposium on Computational Geometry"},"doi":"10.4230/LIPICS.SOCG.2019.31","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1903.08510"]},"file_date_updated":"2020-07-14T12:47:35Z","date_created":"2019-07-17T10:36:09Z","date_updated":"2021-01-12T08:08:23Z","volume":129,"author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga"},{"id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert","last_name":"Wagner","full_name":"Wagner, Hubert"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"HeEd"}],"year":"2019","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2019-06-01T00:00:00Z","page":"31:1-31:14","publication":"35th International Symposium on Computational Geometry","citation":{"mla":"Edelsbrunner, Herbert, et al. “Topological Data Analysis in Information Space.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14, doi:10.4230/LIPICS.SOCG.2019.31.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 31:1-31:14.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Topological Data Analysis in Information Space.” In 35th International Symposium on Computational Geometry, 129:31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.31.","ama":"Edelsbrunner H, Virk Z, Wagner H. Topological data analysis in information space. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:31:1-31:14. doi:10.4230/LIPICS.SOCG.2019.31","ista":"Edelsbrunner H, Virk Z, Wagner H. 2019. Topological data analysis in information space. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129, 31:1-31:14.","apa":"Edelsbrunner, H., Virk, Z., & Wagner, H. (2019). Topological data analysis in information space. In 35th International Symposium on Computational Geometry (Vol. 129, p. 31:1-31:14). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.31","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Topological data analysis in information space,” in 35th International Symposium on Computational Geometry, Portland, OR, United States, 2019, vol. 129, p. 31:1-31:14."},"abstract":[{"lang":"eng","text":"Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory\r\nneeded for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context."}],"alternative_title":["LIPIcs"],"type":"conference","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2019_LIPICS_Edelsbrunner.pdf","content_type":"application/pdf","file_size":1355179,"creator":"dernst","relation":"main_file","file_id":"6666","checksum":"8ec8720730d4c789bf7b06540f1c29f4","date_created":"2019-07-24T06:40:01Z","date_updated":"2020-07-14T12:47:35Z"}],"title":"Topological data analysis in information space","status":"public","ddc":["510"],"intvolume":" 129","_id":"6648","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"volume":92,"date_updated":"2021-01-12T08:08:26Z","date_created":"2019-07-21T21:59:16Z","author":[{"last_name":"Zenmyo","first_name":"Naoki","full_name":"Zenmyo, Naoki"},{"full_name":"Tokumaru, Hiroki","last_name":"Tokumaru","first_name":"Hiroki"},{"full_name":"Uchinomiya, Shohei","last_name":"Uchinomiya","first_name":"Shohei"},{"full_name":"Fuchida, Hirokazu","last_name":"Fuchida","first_name":"Hirokazu"},{"id":"4427179E-F248-11E8-B48F-1D18A9856A87","first_name":"Shigekazu","last_name":"Tabata","full_name":"Tabata, Shigekazu"},{"full_name":"Hamachi, Itaru","last_name":"Hamachi","first_name":"Itaru"},{"first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi"},{"full_name":"Ojida, Akio","last_name":"Ojida","first_name":"Akio"}],"publisher":"Bulletin of the Chemical Society of Japan","department":[{"_id":"RySh"}],"publication_status":"published","acknowledgement":"his work was supported by the Grant-in-Aid for Scientific Research B (JSPS KAKENHI grant no. JP17H03090 to A. O.); the Scientific Research on Innovative Areas “Chemistry for Multimolecular Crowding Biosystems” (JSPS KAKENHI grant no. JP17H06349 to A. O.); and the European Union (European Research Council Advanced grant no. 694539 and Human Brain Project Ref. 720270 to R. S.). A. O. acknowledges the financial support of the Takeda Science Foundation.","year":"2019","ec_funded":1,"file_date_updated":"2020-10-02T08:49:58Z","language":[{"iso":"eng"}],"doi":"10.1246/bcsj.20190034","project":[{"call_identifier":"H2020","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa":1,"publication_identifier":{"issn":["00092673"]},"month":"05","oa_version":"Published Version","file":[{"file_id":"8594","relation":"main_file","date_updated":"2020-10-02T08:49:58Z","date_created":"2020-10-02T08:49:58Z","success":1,"checksum":"186de511d6e0ca93f5d981e2443eb8cd","file_name":"2019_BCSJ_Zenmyo.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":2464903}],"intvolume":" 92","title":"Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins","ddc":["570"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6659","issue":"5","abstract":[{"lang":"eng","text":"Chemical labeling of proteins with synthetic molecular probes offers the possibility to probe the functions of proteins of interest in living cells. However, the methods for covalently labeling targeted proteins using complementary peptide tag-probe pairs are still limited, irrespective of the versatility of such pairs in biological research. Herein, we report the new CysHis tag-Ni(II) probe pair for the specific covalent labeling of proteins. A broad-range evaluation of the reactivity profiles of the probe and the CysHis peptide tag afforded a tag-probe pair with an optimized and high labeling selectivity and reactivity. In particular, the labeling specificity of this pair was notably improved compared to the previously reported one. This pair was successfully utilized for the fluorescence imaging of membrane proteins on the surfaces of living cells, demonstrating its potential utility in biological research."}],"type":"journal_article","date_published":"2019-05-15T00:00:00Z","page":"995-1000","article_type":"original","citation":{"ieee":"N. Zenmyo et al., “Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins,” Bulletin of the Chemical Society of Japan, vol. 92, no. 5. Bulletin of the Chemical Society of Japan, pp. 995–1000, 2019.","apa":"Zenmyo, N., Tokumaru, H., Uchinomiya, S., Fuchida, H., Tabata, S., Hamachi, I., … Ojida, A. (2019). Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan. https://doi.org/10.1246/bcsj.20190034","ista":"Zenmyo N, Tokumaru H, Uchinomiya S, Fuchida H, Tabata S, Hamachi I, Shigemoto R, Ojida A. 2019. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 92(5), 995–1000.","ama":"Zenmyo N, Tokumaru H, Uchinomiya S, et al. Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins. Bulletin of the Chemical Society of Japan. 2019;92(5):995-1000. doi:10.1246/bcsj.20190034","chicago":"Zenmyo, Naoki, Hiroki Tokumaru, Shohei Uchinomiya, Hirokazu Fuchida, Shigekazu Tabata, Itaru Hamachi, Ryuichi Shigemoto, and Akio Ojida. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan. Bulletin of the Chemical Society of Japan, 2019. https://doi.org/10.1246/bcsj.20190034.","short":"N. Zenmyo, H. Tokumaru, S. Uchinomiya, H. Fuchida, S. Tabata, I. Hamachi, R. Shigemoto, A. Ojida, Bulletin of the Chemical Society of Japan 92 (2019) 995–1000.","mla":"Zenmyo, Naoki, et al. “Optimized Reaction Pair of the CysHis Tag and Ni(II)-NTA Probe for Highly Selective Chemical Labeling of Membrane Proteins.” Bulletin of the Chemical Society of Japan, vol. 92, no. 5, Bulletin of the Chemical Society of Japan, 2019, pp. 995–1000, doi:10.1246/bcsj.20190034."},"publication":"Bulletin of the Chemical Society of Japan","article_processing_charge":"No","has_accepted_license":"1","day":"15","scopus_import":"1"},{"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1803.02289"]},"quality_controlled":"1","project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"conference":{"name":"ICALP 2019: International Colloquim on Automata, Languages and Programming","start_date":"2019-07-08","location":"Patras, Greece","end_date":"2019-07-12"},"doi":"10.4230/LIPICS.ICALP.2019.77","language":[{"iso":"eng"}],"month":"07","publication_identifier":{"isbn":["978-3-95977-109-2"],"issn":["1868-8969"]},"year":"2019","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"date_updated":"2021-01-12T08:08:40Z","date_created":"2019-07-29T12:23:29Z","volume":132,"file_date_updated":"2020-07-14T12:47:38Z","ec_funded":1,"publication":"46th International Colloquium on Automata, Languages and Programming","citation":{"ama":"Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77","ieee":"V. Kolmogorov, “Testing the complexity of a valued CSP language,” in 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, 2019, vol. 132, p. 77:1-77:12.","apa":"Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77","ista":"Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.","short":"V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.","mla":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.","chicago":"Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.77."},"page":"77:1-77:12","date_published":"2019-07-01T00:00:00Z","scopus_import":1,"day":"01","has_accepted_license":"1","_id":"6725","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"title":"Testing the complexity of a valued CSP language","status":"public","intvolume":" 132","oa_version":"Published Version","file":[{"date_created":"2019-07-31T07:01:45Z","date_updated":"2020-07-14T12:47:38Z","checksum":"f5ebee8eec6ae09e30365578ee63a492","file_id":"6738","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":575475,"file_name":"2019_LIPICS_Kolmogorov.pdf","access_level":"open_access"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. \r\nRecent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds.","lang":"eng"}]},{"ec_funded":1,"place":"Cham","author":[{"first_name":"Michael","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","full_name":"Walter, Michael"}],"date_created":"2019-07-29T12:25:31Z","date_updated":"2023-02-23T12:50:15Z","volume":11627,"year":"2019","publication_status":"published","editor":[{"last_name":"Buchmann","first_name":"J","full_name":"Buchmann, J"},{"full_name":"Nitaj, A","last_name":"Nitaj","first_name":"A"},{"full_name":"Rachidi, T","last_name":"Rachidi","first_name":"T"}],"publisher":"Springer Nature","department":[{"_id":"KrPi"}],"month":"06","publication_identifier":{"isbn":["978-3-0302-3695-3"],"issn":["0302-9743","1611-3349"],"eisbn":["978-3-0302-3696-0"]},"conference":{"end_date":"2019-07-11","location":"Rabat, Morocco","start_date":"2019-07-09","name":"AFRICACRYPT: International Conference on Cryptology in Africa"},"doi":"10.1007/978-3-030-23696-0_9","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/068"}],"oa":1,"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"abstract":[{"lang":"eng","text":"Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so."}],"type":"book_chapter","oa_version":"Preprint","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"6726","title":"Sampling the integers with low relative error","status":"public","intvolume":" 11627","day":"29","article_processing_charge":"No","scopus_import":"1","series_title":"LNCS","date_published":"2019-06-29T00:00:00Z","publication":"Progress in Cryptology – AFRICACRYPT 2019","citation":{"ama":"Walter M. Sampling the integers with low relative error. In: Buchmann J, Nitaj A, Rachidi T, eds. Progress in Cryptology – AFRICACRYPT 2019. Vol 11627. LNCS. Cham: Springer Nature; 2019:157-180. doi:10.1007/978-3-030-23696-0_9","ista":"Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.","ieee":"M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.","apa":"Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9","mla":"Walter, Michael. “Sampling the Integers with Low Relative Error.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi:10.1007/978-3-030-23696-0_9.","short":"M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.","chicago":"Walter, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. https://doi.org/10.1007/978-3-030-23696-0_9."},"page":"157-180"},{"article_number":"8854897","author":[{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"full_name":"Condo, Carlo","last_name":"Condo","first_name":"Carlo"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco"},{"full_name":"Gross, Warren J","last_name":"Gross","first_name":"Warren J"}],"volume":67,"date_updated":"2021-01-12T08:08:51Z","date_created":"2019-07-31T09:51:14Z","year":"2019","department":[{"_id":"MaMo"}],"publisher":"IEEE","publication_status":"published","publication_identifier":{"issn":["1053587X"]},"month":"11","doi":"10.1109/TSP.2019.2944738","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1903.09203"}],"external_id":{"arxiv":["1903.09203"]},"quality_controlled":"1","issue":"22","abstract":[{"text":"Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. ","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"6750","intvolume":" 67","status":"public","title":"Rate-flexible fast polar decoders","article_processing_charge":"No","day":"15","scopus_import":1,"date_published":"2019-11-15T00:00:00Z","citation":{"apa":"Hashemi, S. A., Condo, C., Mondelli, M., & Gross, W. J. (2019). Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. IEEE. https://doi.org/10.1109/TSP.2019.2944738","ieee":"S. A. Hashemi, C. Condo, M. Mondelli, and W. J. Gross, “Rate-flexible fast polar decoders,” IEEE Transactions on Signal Processing, vol. 67, no. 22. IEEE, 2019.","ista":"Hashemi SA, Condo C, Mondelli M, Gross WJ. 2019. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 67(22), 8854897.","ama":"Hashemi SA, Condo C, Mondelli M, Gross WJ. Rate-flexible fast polar decoders. IEEE Transactions on Signal Processing. 2019;67(22). doi:10.1109/TSP.2019.2944738","chicago":"Hashemi, Seyyed Ali, Carlo Condo, Marco Mondelli, and Warren J Gross. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing. IEEE, 2019. https://doi.org/10.1109/TSP.2019.2944738.","short":"S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019).","mla":"Hashemi, Seyyed Ali, et al. “Rate-Flexible Fast Polar Decoders.” IEEE Transactions on Signal Processing, vol. 67, no. 22, 8854897, IEEE, 2019, doi:10.1109/TSP.2019.2944738."},"publication":"IEEE Transactions on Signal Processing","article_type":"original"},{"year":"2019","publisher":"Electronic Journal of Combinatorics","department":[{"_id":"DaAl"}],"publication_status":"published","author":[{"last_name":"Jelínek","first_name":"Vít","full_name":"Jelínek, Vít"},{"full_name":"Töpfer, Martin","last_name":"Töpfer","first_name":"Martin","id":"4B865388-F248-11E8-B48F-1D18A9856A87"}],"volume":26,"date_updated":"2022-03-18T12:32:02Z","date_created":"2019-08-04T21:59:20Z","article_number":"P3.17","ec_funded":1,"file_date_updated":"2020-07-14T12:47:39Z","external_id":{"arxiv":["1808.04148"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.37236/8096","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["10778926"]},"month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6759","intvolume":" 26","title":"On grounded L-graphs and their relatives","status":"public","ddc":["510"],"file":[{"date_created":"2019-08-05T06:46:55Z","date_updated":"2020-07-14T12:47:39Z","checksum":"20fc366fc6683ef0b074a019b73a663a","relation":"main_file","file_id":"6764","content_type":"application/pdf","file_size":533697,"creator":"dernst","file_name":"2019_eJourCombinatorics_Jelinek.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. \r\nWe also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions."}],"citation":{"chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096.","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","apa":"Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019.","ama":"Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096"},"publication":"Electronic Journal of Combinatorics","article_type":"original","date_published":"2019-07-19T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"19"},{"file_date_updated":"2020-07-14T12:47:41Z","author":[{"full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy","orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4783-0389","first_name":"Rasmus","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr"}],"volume":11674,"date_created":"2019-08-19T07:58:10Z","date_updated":"2021-01-12T08:09:12Z","year":"2019","department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","publication_identifier":{"isbn":["978-303030805-6"],"issn":["0302-9743"]},"month":"09","doi":"10.1007/978-3-030-30806-3_1","conference":{"name":"RP: Reachability Problems","location":"Brussels, Belgium","start_date":"2019-09-11","end_date":"2019-09-13"},"language":[{"iso":"eng"}],"oa":1,"project":[{"call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369","_id":"264B3912-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one."}],"type":"conference","alternative_title":["LNCS"],"file":[{"content_type":"application/pdf","file_size":436635,"creator":"gavni","access_level":"open_access","file_name":"prob.pdf","checksum":"45ebbc709af2b247d28c7c293c01504b","date_created":"2019-08-19T07:56:40Z","date_updated":"2020-07-14T12:47:41Z","relation":"main_file","file_id":"6823"}],"oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"6822","intvolume":" 11674","ddc":["000"],"status":"public","title":"Bidding games on Markov decision processes","has_accepted_license":"1","day":"06","scopus_import":1,"date_published":"2019-09-06T00:00:00Z","citation":{"ama":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1","ista":"Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.","ieee":"G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.","apa":"Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1","mla":"Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.","chicago":"Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1."},"publication":" Proceedings of the 13th International Conference of Reachability Problems","page":"1-12"},{"date_updated":"2022-08-12T10:54:34Z","date_created":"2019-09-18T08:07:58Z","volume":140,"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Wolfgang","last_name":"Dvorák","full_name":"Dvorák, Wolfgang"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Alexander","last_name":"Svozil","full_name":"Svozil, Alexander"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2019","file_date_updated":"2020-07-14T12:47:43Z","ec_funded":1,"article_number":"7","language":[{"iso":"eng"}],"conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","start_date":"2019-08-27","location":"Amsterdam, Netherlands"},"doi":"10.4230/LIPICS.CONCUR.2019.7","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"08","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2019_LIPIcs_Chatterjee.pdf","creator":"kschuh","content_type":"application/pdf","file_size":730112,"file_id":"6922","relation":"main_file","checksum":"e1f0e4061212454574f34a1368d018ec","date_created":"2019-10-01T08:20:30Z","date_updated":"2020-07-14T12:47:43Z"}],"title":"Near-linear time algorithms for Streett objectives in graphs and MDPs","status":"public","ddc":["000"],"intvolume":" 140","_id":"6887","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","abstract":[{"lang":"eng","text":"The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors. "}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2019-08-01T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","citation":{"ama":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. Near-linear time algorithms for Streett objectives in graphs and MDPs. In: Leibniz International Proceedings in Informatics. Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.7","ista":"Chatterjee K, Dvorák W, Henzinger MH, Svozil A. 2019. Near-linear time algorithms for Streett objectives in graphs and MDPs. Leibniz International Proceedings in Informatics. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 7.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., & Svozil, A. (2019). Near-linear time algorithms for Streett objectives in graphs and MDPs. In Leibniz International Proceedings in Informatics (Vol. 140). Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.7","mla":"Chatterjee, Krishnendu, et al. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” Leibniz International Proceedings in Informatics, vol. 140, 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.7.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.” In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.7."},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"date_published":"2019-05-01T00:00:00Z","citation":{"chicago":"Lechner, Mathias, Ramin Hasani, Manuel Zimmer, Thomas A Henzinger, and Radu Grosu. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” In Proceedings - IEEE International Conference on Robotics and Automation, Vol. 2019–May. IEEE, 2019. https://doi.org/10.1109/icra.2019.8793840.","short":"M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019.","mla":"Lechner, Mathias, et al. “Designing Worm-Inspired Neural Networks for Interpretable Robotic Control.” Proceedings - IEEE International Conference on Robotics and Automation, vol. 2019–May, 8793840, IEEE, 2019, doi:10.1109/icra.2019.8793840.","apa":"Lechner, M., Hasani, R., Zimmer, M., Henzinger, T. A., & Grosu, R. (2019). Designing worm-inspired neural networks for interpretable robotic control. In Proceedings - IEEE International Conference on Robotics and Automation (Vol. 2019–May). Montreal, QC, Canada: IEEE. https://doi.org/10.1109/icra.2019.8793840","ieee":"M. Lechner, R. Hasani, M. Zimmer, T. A. Henzinger, and R. Grosu, “Designing worm-inspired neural networks for interpretable robotic control,” in Proceedings - IEEE International Conference on Robotics and Automation, Montreal, QC, Canada, 2019, vol. 2019–May.","ista":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. 2019. Designing worm-inspired neural networks for interpretable robotic control. Proceedings - IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, ICRA, vol. 2019–May, 8793840.","ama":"Lechner M, Hasani R, Zimmer M, Henzinger TA, Grosu R. Designing worm-inspired neural networks for interpretable robotic control. In: Proceedings - IEEE International Conference on Robotics and Automation. Vol 2019-May. IEEE; 2019. doi:10.1109/icra.2019.8793840"},"publication":"Proceedings - IEEE International Conference on Robotics and Automation","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","oa_version":"Submitted Version","file":[{"success":1,"checksum":"f5545a6b60c3ffd01feb3613f81d03b6","date_created":"2020-10-08T17:30:38Z","date_updated":"2020-10-08T17:30:38Z","file_id":"8636","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":3265107,"access_level":"open_access","file_name":"2019_ICRA_Lechner.pdf"}],"title":"Designing worm-inspired neural networks for interpretable robotic control","ddc":["000"],"status":"public","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"6888","abstract":[{"text":"In this paper, we design novel liquid time-constant recurrent neural networks for robotic control, inspired by the brain of the nematode, C. elegans. In the worm's nervous system, neurons communicate through nonlinear time-varying synaptic links established amongst them by their particular wiring structure. This property enables neurons to express liquid time-constants dynamics and therefore allows the network to originate complex behaviors with a small number of neurons. We identify neuron-pair communication motifs as design operators and use them to configure compact neuronal network structures to govern sequential robotic tasks. The networks are systematically designed to map the environmental observations to motor actions, by their hierarchical topology from sensory neurons, through recurrently-wired interneurons, to motor neurons. The networks are then parametrized in a supervised-learning scheme by a search-based algorithm. We demonstrate that obtained networks realize interpretable dynamics. We evaluate their performance in controlling mobile and arm robots, and compare their attributes to other artificial neural network-based control agents. Finally, we experimentally show their superior resilience to environmental noise, compared to the existing machine learning-based methods.","lang":"eng"}],"alternative_title":["ICRA"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1109/icra.2019.8793840","conference":{"name":"ICRA: International Conference on Robotics and Automation","end_date":"2019-05-24","location":"Montreal, QC, Canada","start_date":"2019-05-20"},"project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"quality_controlled":"1","oa":1,"publication_identifier":{"isbn":["9781538660270"]},"month":"05","volume":"2019-May","date_created":"2019-09-18T08:09:51Z","date_updated":"2021-01-12T08:09:28Z","author":[{"full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","first_name":"Mathias"},{"full_name":"Hasani, Ramin","first_name":"Ramin","last_name":"Hasani"},{"full_name":"Zimmer, Manuel","first_name":"Manuel","last_name":"Zimmer"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Grosu","first_name":"Radu","full_name":"Grosu, Radu"}],"publisher":"IEEE","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2019","file_date_updated":"2020-10-08T17:30:38Z","article_number":"8793840"},{"date_created":"2019-09-18T08:06:58Z","date_updated":"2022-01-26T08:27:10Z","volume":140,"author":[{"full_name":"Aghajohari, Milad","first_name":"Milad","last_name":"Aghajohari"},{"first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2019","license":"https://creativecommons.org/licenses/by/3.0/","file_date_updated":"2020-07-14T12:47:43Z","article_number":"20","language":[{"iso":"eng"}],"conference":{"end_date":"2019-08-30","start_date":"2019-08-27","location":"Amsterdam, Netherlands","name":"CONCUR: International Conference on Concurrency Theory"},"doi":"10.4230/LIPICS.CONCUR.2019.20","quality_controlled":"1","project":[{"grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","short":"CC BY (3.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1905.03588"]},"oa":1,"month":"08","file":[{"date_created":"2019-09-27T12:21:38Z","date_updated":"2020-07-14T12:47:43Z","checksum":"4df6d3575c506edb17215adada03cc8e","file_id":"6915","relation":"main_file","creator":"kschuh","file_size":741425,"content_type":"application/pdf","file_name":"2019_LIPIcs_Aghajohari.pdf","access_level":"open_access"}],"oa_version":"Published Version","title":"Determinacy in discrete-bidding infinite-duration games","status":"public","ddc":["000"],"intvolume":" 140","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"6886","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. "}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2019-08-01T00:00:00Z","citation":{"ama":"Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.20","ista":"Aghajohari M, Avni G, Henzinger TA. 2019. Determinacy in discrete-bidding infinite-duration games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 20.","ieee":"M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Aghajohari, M., Avni, G., & Henzinger, T. A. (2019). Determinacy in discrete-bidding infinite-duration games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.20","mla":"Aghajohari, Milad, et al. Determinacy in Discrete-Bidding Infinite-Duration Games. Vol. 140, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.20.","short":"M. Aghajohari, G. Avni, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","chicago":"Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.20."},"day":"01","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1"},{"article_number":"27","file_date_updated":"2020-07-14T12:47:43Z","year":"2019","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"volume":140,"date_updated":"2021-01-12T08:09:27Z","date_created":"2019-09-18T08:06:14Z","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"quality_controlled":"1","doi":"10.4230/LIPICS.CONCUR.2019.27","conference":{"name":"CONCUR: International Conference on Concurrency Theory","end_date":"2019-08-30","location":"Amsterdam, Netherlands","start_date":"2019-08-27"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"A vector addition system with states (VASS) consists of a finite set of states and counters. A configuration is a state and a value for each counter; a transition changes the state and each counter is incremented, decremented, or left unchanged. While qualitative properties such as state and configuration reachability have been studied for VASS, we consider the long-run average cost of infinite computations of VASS. The cost of a configuration is for each state, a linear combination of the counter values. In the special case of uniform cost functions, the linear combination is the same for all states. The (regular) long-run emptiness problem is, given a VASS, a cost function, and a threshold value, if there is a (lasso-shaped) computation such that the long-run average value of the cost function does not exceed the threshold. For uniform cost functions, we show that the regular long-run emptiness problem is (a) decidable in polynomial time for integer-valued VASS, and (b) decidable but nonelementarily hard for natural-valued VASS (i.e., nonnegative counters). For general cost functions, we show that the problem is (c) NP-complete for integer-valued VASS, and (d) undecidable for natural-valued VASS. Our most interesting result is for (c) integer-valued VASS with general cost functions, where we establish a connection between the regular long-run emptiness problem and quadratic Diophantine inequalities. The general (nonregular) long-run emptiness problem is equally hard as the regular problem in all cases except (c), where it remains open. ","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6885","intvolume":" 140","title":"Long-run average behavior of vector addition systems with states","ddc":["000"],"status":"public","oa_version":"Published Version","file":[{"file_name":"2019_LIPIcs_Chatterjee.pdf","access_level":"open_access","creator":"kschuh","file_size":538120,"content_type":"application/pdf","file_id":"6914","relation":"main_file","date_created":"2019-09-27T12:09:35Z","date_updated":"2020-07-14T12:47:43Z","checksum":"4985e26e1572d1575d64d38acabd71d6"}],"scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.","mla":"Chatterjee, Krishnendu, et al. Long-Run Average Behavior of Vector Addition Systems with States. Vol. 140, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.27.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","ista":"Chatterjee K, Henzinger TA, Otop J. 2019. Long-run average behavior of vector addition systems with states. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 27.","apa":"Chatterjee, K., Henzinger, T. A., & Otop, J. (2019). Long-run average behavior of vector addition systems with states (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.27","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Long-run average behavior of vector addition systems with states,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","ama":"Chatterjee K, Henzinger TA, Otop J. Long-run average behavior of vector addition systems with states. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.27"},"date_published":"2019-08-01T00:00:00Z"},{"article_number":"6","file_date_updated":"2020-07-14T12:47:43Z","year":"2019","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"volume":140,"date_created":"2019-09-18T08:11:43Z","date_updated":"2021-01-12T08:09:28Z","month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"quality_controlled":"1","doi":"10.4230/LIPICS.CONCUR.2019.6","conference":{"location":"Amsterdam, Netherlands","start_date":"2019-08-27","end_date":"2019-08-30","name":"CONCUR: International Conference on Concurrency Theory"},"language":[{"iso":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"abstract":[{"text":"We study Markov decision processes and turn-based stochastic games with parity conditions. There are three qualitative winning criteria, namely, sure winning, which requires all paths to satisfy the condition, almost-sure winning, which requires the condition to be satisfied with probability 1, and limit-sure winning, which requires the condition to be satisfied with probability arbitrarily close to 1. We study the combination of two of these criteria for parity conditions, e.g., there are two parity conditions one of which must be won surely, and the other almost-surely. The problem has been studied recently by Berthon et al. for MDPs with combination of sure and almost-sure winning, under infinite-memory strategies, and the problem has been established to be in NP cap co-NP. Even in MDPs there is a difference between finite-memory and infinite-memory strategies. Our main results for combination of sure and almost-sure winning are as follows: (a) we show that for MDPs with finite-memory strategies the problem is in NP cap co-NP; (b) we show that for turn-based stochastic games the problem is co-NP-complete, both for finite-memory and infinite-memory strategies; and (c) we present algorithmic results for the finite-memory case, both for MDPs and turn-based stochastic games, by reduction to non-stochastic parity games. In addition we show that all the above complexity results also carry over to combination of sure and limit-sure winning, and results for all other combinations can be derived from existing results in the literature. Thus we present a complete picture for the study of combinations of two qualitative winning criteria for parity conditions in MDPs and turn-based stochastic games. ","lang":"eng"}],"_id":"6889","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 140","status":"public","ddc":["000"],"title":"Combinations of Qualitative Winning for Stochastic Parity Games","file":[{"relation":"main_file","file_id":"6923","checksum":"7b2ecfd4d9d02360308c0ca986fc10a7","date_updated":"2020-07-14T12:47:43Z","date_created":"2019-10-01T08:49:45Z","access_level":"open_access","file_name":"2019_LIPIcs_Chatterjee.pdf","content_type":"application/pdf","file_size":509163,"creator":"kschuh"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"ama":"Chatterjee K, Piterman N. Combinations of Qualitative Winning for Stochastic Parity Games. In: Vol 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.CONCUR.2019.6","ieee":"K. Chatterjee and N. Piterman, “Combinations of Qualitative Winning for Stochastic Parity Games,” presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands, 2019, vol. 140.","apa":"Chatterjee, K., & Piterman, N. (2019). Combinations of Qualitative Winning for Stochastic Parity Games (Vol. 140). Presented at the CONCUR: International Conference on Concurrency Theory, Amsterdam, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.CONCUR.2019.6","ista":"Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.","short":"K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Chatterjee, Krishnendu, and Nir Piterman. Combinations of Qualitative Winning for Stochastic Parity Games. Vol. 140, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.CONCUR.2019.6.","chicago":"Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,” Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.6."},"date_published":"2019-08-01T00:00:00Z"},{"abstract":[{"text":"Consider a distributed system with n processors out of which f can be Byzantine faulty. In the\r\napproximate agreement task, each processor i receives an input value xi and has to decide on an\r\noutput value yi such that\r\n1. the output values are in the convex hull of the non-faulty processors’ input values,\r\n2. the output values are within distance d of each other.\r\n\r\n\r\nClassically, the values are assumed to be from an m-dimensional Euclidean space, where m ≥ 1.\r\nIn this work, we study the task in a discrete setting, where input values with some structure\r\nexpressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to\r\noutput vertices that are within distance d of each other in G, but still remain in the graph-induced\r\nconvex hull of the input values. For d = 0, the task reduces to consensus and cannot be solved with\r\na deterministic algorithm in an asynchronous system even with a single crash fault. For any d ≥ 1,\r\nwe show that the task is solvable in asynchronous systems when G is chordal and n > (ω + 1)f,\r\nwhere ω is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a\r\nvariant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact\r\nvariants of these and related tasks over a large class of combinatorial structures.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"oa_version":"Published Version","file":[{"checksum":"2d2202f90c6ac991e50876451627c4b5","date_updated":"2020-07-14T12:47:44Z","date_created":"2019-10-08T12:47:19Z","relation":"main_file","file_id":"6934","content_type":"application/pdf","file_size":639378,"creator":"jrybicki","access_level":"open_access","file_name":"LIPIcs-DISC-2019-29.pdf"}],"_id":"6931","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 146","status":"public","title":"Byzantine approximate agreement on graphs","ddc":["004"],"has_accepted_license":"1","article_processing_charge":"No","scopus_import":1,"keyword":["consensus","approximate agreement","Byzantine faults","chordal graphs","lattice agreement"],"date_published":"2019-01-01T00:00:00Z","citation":{"mla":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” 33rd International Symposium on Distributed Computing, vol. 146, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17, doi:10.4230/LIPICS.DISC.2019.29.","short":"T. Nowak, J. Rybicki, in:, 33rd International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 29:1--29:17.","chicago":"Nowak, Thomas, and Joel Rybicki. “Byzantine Approximate Agreement on Graphs.” In 33rd International Symposium on Distributed Computing, 146:29:1--29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.DISC.2019.29.","ama":"Nowak T, Rybicki J. Byzantine approximate agreement on graphs. In: 33rd International Symposium on Distributed Computing. Vol 146. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:29:1--29:17. doi:10.4230/LIPICS.DISC.2019.29","ista":"Nowak T, Rybicki J. 2019. Byzantine approximate agreement on graphs. 33rd International Symposium on Distributed Computing. DISC: International Symposium on Distributed Computing, LIPIcs, vol. 146, 29:1--29:17.","apa":"Nowak, T., & Rybicki, J. (2019). Byzantine approximate agreement on graphs. In 33rd International Symposium on Distributed Computing (Vol. 146, p. 29:1--29:17). Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.DISC.2019.29","ieee":"T. Nowak and J. Rybicki, “Byzantine approximate agreement on graphs,” in 33rd International Symposium on Distributed Computing, Budapest, Hungary, 2019, vol. 146, p. 29:1--29:17."},"publication":"33rd International Symposium on Distributed Computing","page":"29:1--29:17","ec_funded":1,"file_date_updated":"2020-07-14T12:47:44Z","author":[{"full_name":"Nowak, Thomas","first_name":"Thomas","last_name":"Nowak"},{"first_name":"Joel","last_name":"Rybicki","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646","full_name":"Rybicki, Joel"}],"volume":146,"date_created":"2019-10-08T12:41:38Z","date_updated":"2021-01-12T08:09:38Z","year":"2019","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"DaAl"}],"publication_status":"published","publication_identifier":{"eisbn":["978-3-95977-126-9"]},"doi":"10.4230/LIPICS.DISC.2019.29","conference":{"end_date":"2019-10-18","location":"Budapest, Hungary","start_date":"2019-10-14","name":"DISC: International Symposium on Distributed Computing"},"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"arxiv":["1908.02743"]},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1"},{"abstract":[{"text":"In this paper, we introduce a novel method to interpret recurrent neural networks (RNNs), particularly long short-term memory networks (LSTMs) at the cellular level. We propose a systematic pipeline for interpreting individual hidden state dynamics within the network using response characterization methods. The ranked contribution of individual cells to the network's output is computed by analyzing a set of interpretable metrics of their decoupled step and sinusoidal responses. As a result, our method is able to uniquely identify neurons with insightful dynamics, quantify relationships between dynamical properties and test accuracy through ablation analysis, and interpret the impact of network capacity on a network's dynamical distribution. Finally, we demonstrate the generalizability and scalability of our method by evaluating a series of different benchmark sequential datasets.","lang":"eng"}],"article_number":"8851954","type":"conference","author":[{"last_name":"Hasani","first_name":"Ramin","full_name":"Hasani, Ramin"},{"full_name":"Amini, Alexander","last_name":"Amini","first_name":"Alexander"},{"full_name":"Lechner, Mathias","first_name":"Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Naser","first_name":"Felix","full_name":"Naser, Felix"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"}],"date_updated":"2021-01-12T08:11:19Z","date_created":"2019-11-04T15:59:58Z","oa_version":"Preprint","_id":"6985","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"Response characterization for auditing cell dynamics in long short-term memory networks","department":[{"_id":"ToHe"}],"publisher":"IEEE","month":"09","day":"30","publication_identifier":{"isbn":["9781728119854"]},"scopus_import":1,"conference":{"start_date":"2019-07-14","location":"Budapest, Hungary","end_date":"2019-07-19","name":"IJCNN: International Joint Conference on Neural Networks"},"date_published":"2019-09-30T00:00:00Z","doi":"10.1109/ijcnn.2019.8851954","language":[{"iso":"eng"}],"publication":"Proceedings of the International Joint Conference on Neural Networks","oa":1,"external_id":{"arxiv":["1809.03864"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.03864"}],"citation":{"ista":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. 2019. Response characterization for auditing cell dynamics in long short-term memory networks. Proceedings of the International Joint Conference on Neural Networks. IJCNN: International Joint Conference on Neural Networks, 8851954.","ieee":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, and D. Rus, “Response characterization for auditing cell dynamics in long short-term memory networks,” in Proceedings of the International Joint Conference on Neural Networks, Budapest, Hungary, 2019.","apa":"Hasani, R., Amini, A., Lechner, M., Naser, F., Grosu, R., & Rus, D. (2019). Response characterization for auditing cell dynamics in long short-term memory networks. In Proceedings of the International Joint Conference on Neural Networks. Budapest, Hungary: IEEE. https://doi.org/10.1109/ijcnn.2019.8851954","ama":"Hasani R, Amini A, Lechner M, Naser F, Grosu R, Rus D. Response characterization for auditing cell dynamics in long short-term memory networks. In: Proceedings of the International Joint Conference on Neural Networks. IEEE; 2019. doi:10.1109/ijcnn.2019.8851954","chicago":"Hasani, Ramin, Alexander Amini, Mathias Lechner, Felix Naser, Radu Grosu, and Daniela Rus. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” In Proceedings of the International Joint Conference on Neural Networks. IEEE, 2019. https://doi.org/10.1109/ijcnn.2019.8851954.","mla":"Hasani, Ramin, et al. “Response Characterization for Auditing Cell Dynamics in Long Short-Term Memory Networks.” Proceedings of the International Joint Conference on Neural Networks, 8851954, IEEE, 2019, doi:10.1109/ijcnn.2019.8851954.","short":"R. Hasani, A. Amini, M. Lechner, F. Naser, R. Grosu, D. Rus, in:, Proceedings of the International Joint Conference on Neural Networks, IEEE, 2019."},"quality_controlled":"1"},{"month":"10","publication_identifier":{"issn":["1999-4893"]},"quality_controlled":"1","external_id":{"arxiv":["1801.03153"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.3390/a12100218","article_number":"218","file_date_updated":"2020-07-14T12:47:47Z","publication_status":"published","department":[{"_id":"MaMo"}],"publisher":"MDPI","year":"2019","date_updated":"2023-02-23T12:49:28Z","date_created":"2019-11-12T14:46:19Z","volume":12,"author":[{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"full_name":"Hassani, S. Hamed","last_name":"Hassani","first_name":"S. Hamed"},{"first_name":"Rüdiger","last_name":"Urbanke","full_name":"Urbanke, Rüdiger"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"6675"}]},"scopus_import":1,"day":"18","has_accepted_license":"1","article_type":"original","publication":"Algorithms","citation":{"short":"M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019).","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms, vol. 12, no. 10, 218, MDPI, 2019, doi:10.3390/a12100218.","chicago":"Mondelli, Marco, S. Hamed Hassani, and Rüdiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” Algorithms. MDPI, 2019. https://doi.org/10.3390/a12100218.","ama":"Mondelli M, Hassani SH, Urbanke R. A new coding paradigm for the primitive relay channel. Algorithms. 2019;12(10). doi:10.3390/a12100218","apa":"Mondelli, M., Hassani, S. H., & Urbanke, R. (2019). A new coding paradigm for the primitive relay channel. Algorithms. MDPI. https://doi.org/10.3390/a12100218","ieee":"M. Mondelli, S. H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” Algorithms, vol. 12, no. 10. MDPI, 2019.","ista":"Mondelli M, Hassani SH, Urbanke R. 2019. A new coding paradigm for the primitive relay channel. Algorithms. 12(10), 218."},"date_published":"2019-10-18T00:00:00Z","type":"journal_article","abstract":[{"text":"We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.","lang":"eng"}],"issue":"10","status":"public","title":"A new coding paradigm for the primitive relay channel","ddc":["510"],"intvolume":" 12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7007","oa_version":"Published Version","file":[{"file_name":"2019_Algorithms_Mondelli.pdf","access_level":"open_access","file_size":696791,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7008","date_updated":"2020-07-14T12:47:47Z","date_created":"2019-11-12T14:48:45Z","checksum":"267756d8f9db572f496cd1663c89d59a"}]},{"date_published":"2019-01-30T00:00:00Z","conference":{"end_date":"2019-01-30","start_date":"2019-01-28","location":"Kyoto, Japan","name":"Research on isometries as preserver problems and related topics"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html"}],"citation":{"chicago":"Geher, Gyorgy Pal, Tamas Titkos, and Daniel Virosztek. “Dirac Masses and Isometric Rigidity.” In Kyoto RIMS Kôkyûroku, 2125:34–41. Research Institute for Mathematical Sciences, Kyoto University, 2019.","mla":"Geher, Gyorgy Pal, et al. “Dirac Masses and Isometric Rigidity.” Kyoto RIMS Kôkyûroku, vol. 2125, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","short":"G.P. Geher, T. Titkos, D. Virosztek, in:, Kyoto RIMS Kôkyûroku, Research Institute for Mathematical Sciences, Kyoto University, 2019, pp. 34–41.","ista":"Geher GP, Titkos T, Virosztek D. 2019. Dirac masses and isometric rigidity. Kyoto RIMS Kôkyûroku. Research on isometries as preserver problems and related topics vol. 2125, 34–41.","ieee":"G. P. Geher, T. Titkos, and D. Virosztek, “Dirac masses and isometric rigidity,” in Kyoto RIMS Kôkyûroku, Kyoto, Japan, 2019, vol. 2125, pp. 34–41.","apa":"Geher, G. P., Titkos, T., & Virosztek, D. (2019). Dirac masses and isometric rigidity. In Kyoto RIMS Kôkyûroku (Vol. 2125, pp. 34–41). Kyoto, Japan: Research Institute for Mathematical Sciences, Kyoto University.","ama":"Geher GP, Titkos T, Virosztek D. Dirac masses and isometric rigidity. In: Kyoto RIMS Kôkyûroku. Vol 2125. Research Institute for Mathematical Sciences, Kyoto University; 2019:34-41."},"oa":1,"publication":"Kyoto RIMS Kôkyûroku","page":"34-41","quality_controlled":"1","article_processing_charge":"No","day":"30","month":"01","author":[{"full_name":"Geher, Gyorgy Pal","last_name":"Geher","first_name":"Gyorgy Pal"},{"full_name":"Titkos, Tamas","first_name":"Tamas","last_name":"Titkos"},{"full_name":"Virosztek, Daniel","orcid":"0000-0003-1109-5511","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","last_name":"Virosztek","first_name":"Daniel"}],"volume":2125,"oa_version":"Submitted Version","date_updated":"2021-01-12T08:11:33Z","date_created":"2019-11-18T15:39:53Z","year":"2019","_id":"7035","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 2125","department":[{"_id":"LaEr"}],"publisher":"Research Institute for Mathematical Sciences, Kyoto University","status":"public","title":"Dirac masses and isometric rigidity","publication_status":"published","abstract":[{"text":"The aim of this short note is to expound one particular issue that was discussed during the talk [10] given at the symposium ”Researches on isometries as preserver problems and related topics” at Kyoto RIMS. That is, the role of Dirac masses by describing the isometry group of various metric spaces of probability measures. This article is of survey character, and it does not contain any essentially new results.From an isometric point of view, in some cases, metric spaces of measures are similar to C(K)-type function spaces. Similarity means here that their isometries are driven by some nice transformations of the underlying space. Of course, it depends on the particular choice of the metric how nice these transformations should be. Sometimes, as we will see, being a homeomorphism is enough to generate an isometry. But sometimes we need more: the transformation must preserve the underlying distance as well. Statements claiming that isometries in questions are necessarily induced by homeomorphisms are called Banach-Stone-type results, while results asserting that the underlying transformation is necessarily an isometry are termed as isometric rigidity results.As Dirac masses can be considered as building bricks of the set of all Borel measures, a natural question arises:Is it enough to understand how an isometry acts on the set of Dirac masses? Does this action extend uniquely to all measures?In what follows, we will thoroughly investigate this question.","lang":"eng"}],"type":"conference"},{"publication_status":"published","title":"Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt","status":"public","department":[{"_id":"ChLa"}],"publisher":"Springer Nature","editor":[{"last_name":"Kersting","first_name":"Kristian","full_name":"Kersting, Kristian"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","first_name":"Christoph"},{"last_name":"Rothkopf","first_name":"Constantin","full_name":"Rothkopf, Constantin"}],"year":"2019","_id":"7171","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2021-12-22T14:40:58Z","date_created":"2019-12-11T14:15:56Z","oa_version":"None","edition":"1","related_material":{"link":[{"relation":"press_release","description":"News on IST Website","url":"https://ist.ac.at/en/news/book-release-how-machines-learn/"}]},"place":"Wiesbaden","type":"book_editor","abstract":[{"text":"Wissen Sie, was sich hinter künstlicher Intelligenz und maschinellem Lernen verbirgt? \r\nDieses Sachbuch erklärt Ihnen leicht verständlich und ohne komplizierte Formeln die grundlegenden Methoden und Vorgehensweisen des maschinellen Lernens. Mathematisches Vorwissen ist dafür nicht nötig. Kurzweilig und informativ illustriert Lisa, die Protagonistin des Buches, diese anhand von Alltagssituationen. \r\nEin Buch für alle, die in Diskussionen über Chancen und Risiken der aktuellen Entwicklung der künstlichen Intelligenz und des maschinellen Lernens mit Faktenwissen punkten möchten. Auch für Schülerinnen und Schüler geeignet!","lang":"ger"}],"quality_controlled":"1","page":"XIV, 245","citation":{"mla":"Kersting, Kristian, et al., editors. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed., Springer Nature, 2019, doi:10.1007/978-3-658-26763-6.","short":"K. Kersting, C. Lampert, C. Rothkopf, eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed., Springer Nature, Wiesbaden, 2019.","chicago":"Kersting, Kristian, Christoph Lampert, and Constantin Rothkopf, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature, 2019. https://doi.org/10.1007/978-3-658-26763-6.","ama":"Kersting K, Lampert C, Rothkopf C, eds. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt. 1st ed. Wiesbaden: Springer Nature; 2019. doi:10.1007/978-3-658-26763-6","ista":"Kersting K, Lampert C, Rothkopf C eds. 2019. Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt 1st ed., Wiesbaden: Springer Nature, XIV, 245p.","ieee":"K. Kersting, C. Lampert, and C. Rothkopf, Eds., Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt, 1st ed. Wiesbaden: Springer Nature, 2019.","apa":"Kersting, K., Lampert, C., & Rothkopf, C. (Eds.). (2019). Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt (1st ed.). Wiesbaden: Springer Nature. https://doi.org/10.1007/978-3-658-26763-6"},"language":[{"iso":"ger"}],"doi":"10.1007/978-3-658-26763-6","date_published":"2019-10-30T00:00:00Z","day":"30","month":"10","publication_identifier":{"isbn":["978-3-658-26762-9"],"eisbn":["978-3-658-26763-6"]},"article_processing_charge":"No"},{"author":[{"full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav"},{"first_name":"Jan","last_name":"Kyncl","full_name":"Kyncl, Jan"}],"date_updated":"2021-01-12T08:13:24Z","date_created":"2020-01-29T16:17:05Z","volume":129,"year":"2019","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:47:57Z","article_number":"39","conference":{"end_date":"2019-06-21","start_date":"2019-06-18","location":"Portland, OR, United States","name":"SoCG: Symposium on Computational Geometry"},"doi":"10.4230/LIPICS.SOCG.2019.39","language":[{"iso":"eng"}],"external_id":{"arxiv":["1903.08637"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF"}],"month":"06","publication_identifier":{"isbn":["978-3-95977-104-7"],"issn":["1868-8969"]},"oa_version":"Published Version","file":[{"file_id":"7445","relation":"main_file","checksum":"aac37b09118cc0ab58cf77129e691f8c","date_created":"2020-02-04T09:14:31Z","date_updated":"2020-07-14T12:47:57Z","access_level":"open_access","file_name":"2019_LIPIcs_Fulek.pdf","creator":"dernst","content_type":"application/pdf","file_size":628347}],"_id":"7401","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["000"],"title":"Z_2-Genus of graphs and minimum rank of partial symmetric matrices","intvolume":" 129","abstract":[{"text":"The genus g(G) of a graph G is the minimum g such that G has an embedding on the orientable surface M_g of genus g. A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The Z_2-genus of a graph G, denoted by g_0(G), is the minimum g such that G has an independently even drawing on M_g. By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks. In 2013, Schaefer and Stefankovic proved that the Z_2-genus of a graph is additive over 2-connected blocks as well, and asked whether this result can be extended to so-called 2-amalgamations, as an analogue of results by Decker, Glover, Huneke, and Stahl for the genus. We give the following partial answer. If G=G_1 cup G_2, G_1 and G_2 intersect in two vertices u and v, and G-u-v has k connected components (among which we count the edge uv if present), then |g_0(G)-(g_0(G_1)+g_0(G_2))|<=k+1. For complete bipartite graphs K_{m,n}, with n >= m >= 3, we prove that g_0(K_{m,n})/g(K_{m,n})=1-O(1/n). Similar results are proved also for the Euler Z_2-genus. We express the Z_2-genus of a graph using the minimum rank of partial symmetric matrices over Z_2; a problem that might be of independent interest. ","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2019-06-01T00:00:00Z","publication":"35th International Symposium on Computational Geometry (SoCG 2019)","citation":{"short":"R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.","mla":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” 35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.","chicago":"Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” In 35th International Symposium on Computational Geometry (SoCG 2019), Vol. 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.39.","ama":"Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry (SoCG 2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39","ieee":"R. Fulek and J. Kyncl, “Z_2-Genus of graphs and minimum rank of partial symmetric matrices,” in 35th International Symposium on Computational Geometry (SoCG 2019), Portland, OR, United States, 2019, vol. 129.","apa":"Fulek, R., & Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SOCG.2019.39","ista":"Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129, 39."},"day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1},{"author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"full_name":"Giacobbe, Mirco","last_name":"Giacobbe","first_name":"Mirco","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Larsen, Kim G.","first_name":"Kim G.","last_name":"Larsen"},{"full_name":"Mikučionis, Marius","last_name":"Mikučionis","first_name":"Marius"}],"volume":10000,"date_created":"2020-02-05T10:51:44Z","date_updated":"2022-09-06T08:25:52Z","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award). This research has received funding from the Sino-Danish Basic Research Centre, IDEA4CPS, funded by the Danish National Research Foundation and the National Science Foundation, China, the Innovation Fund Denmark centre DiCyPS, as well as the ERC Advanced Grant LASSO.","year":"2019","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","editor":[{"full_name":"Steffen, Bernhard","first_name":"Bernhard","last_name":"Steffen"},{"last_name":"Woeginger","first_name":"Gerhard","full_name":"Woeginger, Gerhard"}],"publication_status":"published","doi":"10.1007/978-3-319-91908-9_22","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://doi.org/10.1007/978-3-319-91908-9_22","open_access":"1"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","publication_identifier":{"issn":["1611-3349"],"eisbn":["9783319919089"],"eissn":["0302-9743"],"isbn":["9783319919072"]},"month":"10","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7453","intvolume":" 10000","title":"Continuous-time models for system design and analysis","status":"public","abstract":[{"text":"We illustrate the ingredients of the state-of-the-art of model-based approach for the formal design and verification of cyber-physical systems. To capture the interaction between a discrete controller and its continuously evolving environment, we use the formal models of timed and hybrid automata. We explain the steps of modeling and verification in the tools Uppaal and SpaceEx using a case study based on a dual-chamber implantable pacemaker monitoring a human heart. We show how to design a model as a composition of components, how to construct models at varying levels of detail, how to establish that one model is an abstraction of another, how to specify correctness requirements using temporal logic, and how to verify that a model satisfies a logical requirement.","lang":"eng"}],"type":"book_chapter","alternative_title":["Lecture Notes in Computer Science"],"date_published":"2019-10-05T00:00:00Z","citation":{"ieee":"R. Alur, M. Giacobbe, T. A. Henzinger, K. G. Larsen, and M. Mikučionis, “Continuous-time models for system design and analysis,” in Computing and Software Science, vol. 10000, B. Steffen and G. Woeginger, Eds. Springer Nature, 2019, pp. 452–477.","apa":"Alur, R., Giacobbe, M., Henzinger, T. A., Larsen, K. G., & Mikučionis, M. (2019). Continuous-time models for system design and analysis. In B. Steffen & G. Woeginger (Eds.), Computing and Software Science (Vol. 10000, pp. 452–477). Springer Nature. https://doi.org/10.1007/978-3-319-91908-9_22","ista":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. 2019.Continuous-time models for system design and analysis. In: Computing and Software Science. Lecture Notes in Computer Science, vol. 10000, 452–477.","ama":"Alur R, Giacobbe M, Henzinger TA, Larsen KG, Mikučionis M. Continuous-time models for system design and analysis. In: Steffen B, Woeginger G, eds. Computing and Software Science. Vol 10000. LNCS. Springer Nature; 2019:452-477. doi:10.1007/978-3-319-91908-9_22","chicago":"Alur, Rajeev, Mirco Giacobbe, Thomas A Henzinger, Kim G. Larsen, and Marius Mikučionis. “Continuous-Time Models for System Design and Analysis.” In Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, 10000:452–77. LNCS. Springer Nature, 2019. https://doi.org/10.1007/978-3-319-91908-9_22.","short":"R. Alur, M. Giacobbe, T.A. Henzinger, K.G. Larsen, M. Mikučionis, in:, B. Steffen, G. Woeginger (Eds.), Computing and Software Science, Springer Nature, 2019, pp. 452–477.","mla":"Alur, Rajeev, et al. “Continuous-Time Models for System Design and Analysis.” Computing and Software Science, edited by Bernhard Steffen and Gerhard Woeginger, vol. 10000, Springer Nature, 2019, pp. 452–77, doi:10.1007/978-3-319-91908-9_22."},"publication":"Computing and Software Science","page":"452-477","article_processing_charge":"No","day":"05","scopus_import":"1","series_title":"LNCS"},{"article_type":"original","page":"425-447","publication":"Advances in Mathematical Sciences and Applications","citation":{"ama":"Portinale L, Stefanelli U. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 2019;28(2):425-447.","apa":"Portinale, L., & Stefanelli, U. (2019). Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. Gakko Tosho.","ieee":"L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control problems for dissipative evolution,” Advances in Mathematical Sciences and Applications, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.","ista":"Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 28(2), 425–447.","short":"L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications 28 (2019) 425–447.","mla":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical Sciences and Applications, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.","chicago":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” Advances in Mathematical Sciences and Applications. Gakko Tosho, 2019."},"date_published":"2019-10-22T00:00:00Z","day":"22","article_processing_charge":"No","status":"public","title":"Penalization via global functionals of optimal-control problems for dissipative evolution","intvolume":" 28","_id":"7550","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"We consider an optimal control problem for an abstract nonlinear dissipative evolution equation. The differential constraint is penalized by augmenting the target functional by a nonnegative global-in-time functional which is null-minimized in the evolution equation is satisfied. Different variational settings are presented, leading to the convergence of the penalization method for gradient flows, noncyclic and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. "}],"issue":"2","quality_controlled":"1","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1910.10050","open_access":"1"}],"external_id":{"arxiv":["1910.10050"]},"oa":1,"language":[{"iso":"eng"}],"month":"10","publication_identifier":{"issn":["1343-4373"]},"publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Gakko Tosho","acknowledgement":"This work is supported by Vienna Science and Technology Fund (WWTF) through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and I 2375.","year":"2019","date_created":"2020-02-28T10:54:41Z","date_updated":"2022-06-17T07:52:41Z","volume":28,"author":[{"full_name":"Portinale, Lorenzo","last_name":"Portinale","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Stefanelli, Ulisse","last_name":"Stefanelli","first_name":"Ulisse"}]},{"language":[{"iso":"eng"}],"date_published":"2019-12-18T00:00:00Z","project":[{"name":"Biophysics of information processing in gene regulation","call_identifier":"FWF","grant_number":"P28844-B27","_id":"254E9036-B435-11E9-9278-68D0E5697425"}],"page":"5","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1912.08579","open_access":"1"}],"external_id":{"arxiv":["1912.08579"]},"citation":{"apa":"Bialek, W., Gregor, T., & Tkačik, G. (n.d.). Action at a distance in transcriptional regulation. arXiv:1912.08579. ArXiv.","ieee":"W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional regulation,” arXiv:1912.08579. ArXiv.","ista":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:1912.08579, .","ama":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:191208579.","chicago":"Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance in Transcriptional Regulation.” ArXiv:1912.08579. ArXiv, n.d.","short":"W. Bialek, T. Gregor, G. Tkačik, ArXiv:1912.08579 (n.d.).","mla":"Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.” ArXiv:1912.08579, ArXiv."},"publication":"arXiv:1912.08579","article_processing_charge":"No","day":"18","month":"12","oa_version":"Preprint","date_created":"2020-02-28T10:57:08Z","date_updated":"2021-01-12T08:14:09Z","author":[{"last_name":"Bialek","first_name":"William","full_name":"Bialek, William"},{"full_name":"Gregor, Thomas","last_name":"Gregor","first_name":"Thomas"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","first_name":"Gašper","full_name":"Tkačik, Gašper"}],"publisher":"ArXiv","department":[{"_id":"GaTk"}],"publication_status":"submitted","title":"Action at a distance in transcriptional regulation","status":"public","_id":"7552","year":"2019","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"There is increasing evidence that protein binding to specific sites along DNA can activate the reading out of genetic information without coming into direct physical contact with the gene. There also is evidence that these distant but interacting sites are embedded in a liquid droplet of proteins which condenses out of the surrounding solution. We argue that droplet-mediated interactions can account for crucial features of gene regulation only if the droplet is poised at a non-generic point in its phase diagram. We explore a minimal model that embodies this idea, show that this model has a natural mechanism for self-tuning, and suggest direct experimental tests. "}],"type":"preprint"},{"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.29007/m75b","conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","start_date":"2019-04-15","location":"Montreal, Canada","end_date":"2019-04-15"},"publication_identifier":{"eissn":["23987340"]},"month":"05","publisher":"EasyChair Publications","department":[{"_id":"ToHe"}],"publication_status":"published","year":"2019","volume":61,"date_created":"2020-03-08T23:00:49Z","date_updated":"2021-01-12T08:14:17Z","author":[{"full_name":"Immler, Fabian","first_name":"Fabian","last_name":"Immler"},{"first_name":"Matthias","last_name":"Althoff","full_name":"Althoff, Matthias"},{"full_name":"Benet, Luis","first_name":"Luis","last_name":"Benet"},{"full_name":"Chapoutot, Alexandre","last_name":"Chapoutot","first_name":"Alexandre"},{"last_name":"Chen","first_name":"Xin","full_name":"Chen, Xin"},{"first_name":"Marcelo","last_name":"Forets","full_name":"Forets, Marcelo"},{"full_name":"Geretti, Luca","last_name":"Geretti","first_name":"Luca"},{"first_name":"Niklas","last_name":"Kochdumper","full_name":"Kochdumper, Niklas"},{"last_name":"Sanders","first_name":"David P.","full_name":"Sanders, David P."},{"full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065"}],"file_date_updated":"2020-07-14T12:48:00Z","page":"41-61","citation":{"chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In EPiC Series in Computing, 61:41–61. EasyChair Publications, 2019. https://doi.org/10.29007/m75b.","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair Publications, 2019, pp. 41–61.","mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” EPiC Series in Computing, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:10.29007/m75b.","ieee":"F. Immler et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 41–61.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In EPiC Series in Computing (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications. https://doi.org/10.29007/m75b","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: EPiC Series in Computing. Vol 61. EasyChair Publications; 2019:41-61. doi:10.29007/m75b"},"publication":"EPiC Series in Computing","date_published":"2019-05-25T00:00:00Z","scopus_import":1,"article_processing_charge":"No","has_accepted_license":"1","day":"25","intvolume":" 61","ddc":["000"],"status":"public","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7576","file":[{"access_level":"open_access","file_name":"2019_ARCH19_Immler.pdf","file_size":1934830,"content_type":"application/pdf","creator":"dernst","relation":"main_file","file_id":"7617","checksum":"9138977a06fcd6a95976eb4bca875f0c","date_updated":"2020-07-14T12:48:00Z","date_created":"2020-03-24T07:36:36Z"}],"oa_version":"Published Version","type":"conference","abstract":[{"text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools.","lang":"eng"}]},{"citation":{"ista":"Betea D, Bouttier J, Nejjar P, Vuletíc M. 2019. New edge asymptotics of skew Young diagrams via free boundaries. Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics, 34.","ieee":"D. Betea, J. Bouttier, P. Nejjar, and M. Vuletíc, “New edge asymptotics of skew Young diagrams via free boundaries,” in Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Ljubljana, Slovenia, 2019.","apa":"Betea, D., Bouttier, J., Nejjar, P., & Vuletíc, M. (2019). New edge asymptotics of skew Young diagrams via free boundaries. In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Ljubljana, Slovenia: Formal Power Series and Algebraic Combinatorics.","ama":"Betea D, Bouttier J, Nejjar P, Vuletíc M. New edge asymptotics of skew Young diagrams via free boundaries. In: Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics; 2019.","chicago":"Betea, Dan, Jérémie Bouttier, Peter Nejjar, and Mirjana Vuletíc. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” In Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics. Formal Power Series and Algebraic Combinatorics, 2019.","mla":"Betea, Dan, et al. “New Edge Asymptotics of Skew Young Diagrams via Free Boundaries.” Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, 34, Formal Power Series and Algebraic Combinatorics, 2019.","short":"D. Betea, J. Bouttier, P. Nejjar, M. Vuletíc, in:, Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics, Formal Power Series and Algebraic Combinatorics, 2019."},"publication":"Proceedings on the 31st International Conference on Formal Power Series and Algebraic Combinatorics","date_published":"2019-07-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","status":"public","title":"New edge asymptotics of skew Young diagrams via free boundaries","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8175","oa_version":"Preprint","type":"conference","abstract":[{"lang":"eng","text":"We study edge asymptotics of poissonized Plancherel-type measures on skew Young diagrams (integer partitions). These measures can be seen as generalizations of those studied by Baik--Deift--Johansson and Baik--Rains in resolving Ulam's problem on longest increasing subsequences of random permutations and the last passage percolation (corner growth) discrete versions thereof. Moreover they interpolate between said measures and the uniform measure on partitions. In the new KPZ-like 1/3 exponent edge scaling limit with logarithmic corrections, we find new probability distributions generalizing the classical Tracy--Widom GUE, GOE and GSE distributions from the theory of random matrices."}],"project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"},{"call_identifier":"H2020","name":"Optimal Transport and Stochastic Dynamics","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1902.08750","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1902.08750"]},"language":[{"iso":"eng"}],"conference":{"location":"Ljubljana, Slovenia","start_date":"2019-07-01","end_date":"2019-07-05","name":"FPSAC: International Conference on Formal Power Series and Algebraic Combinatorics"},"month":"07","department":[{"_id":"LaEr"}],"publisher":"Formal Power Series and Algebraic Combinatorics","publication_status":"published","year":"2019","acknowledgement":"D.B. is especially grateful to Patrik Ferrari for suggesting simplifications in Section 3 and\r\nto Alessandra Occelli for suggesting the name for the models of Section 2.\r\n","date_created":"2020-07-26T22:01:04Z","date_updated":"2021-01-12T08:17:18Z","author":[{"full_name":"Betea, Dan","first_name":"Dan","last_name":"Betea"},{"full_name":"Bouttier, Jérémie","last_name":"Bouttier","first_name":"Jérémie"},{"id":"4BF426E2-F248-11E8-B48F-1D18A9856A87","last_name":"Nejjar","first_name":"Peter","full_name":"Nejjar, Peter"},{"full_name":"Vuletíc, Mirjana","last_name":"Vuletíc","first_name":"Mirjana"}],"article_number":"34","ec_funded":1},{"quality_controlled":"1","page":"14-40","publication":"EPiC Series in Computing","main_file_link":[{"url":"https://easychair.org/publications/open/1gbP","open_access":"1"}],"citation":{"chicago":"Althoff, Matthias, Stanley Bak, Marcelo Forets, Goran Frehse, Niklas Kochdumper, Rajarshi Ray, Christian Schilling, and Stefan Schupp. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” In EPiC Series in Computing, 61:14–40. EasyChair, 2019. https://doi.org/10.29007/bj1w.","short":"M. Althoff, S. Bak, M. Forets, G. Frehse, N. Kochdumper, R. Ray, C. Schilling, S. Schupp, in:, EPiC Series in Computing, EasyChair, 2019, pp. 14–40.","mla":"Althoff, Matthias, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Linear Continuous Dynamics.” EPiC Series in Computing, vol. 61, EasyChair, 2019, pp. 14–40, doi:10.29007/bj1w.","apa":"Althoff, M., Bak, S., Forets, M., Frehse, G., Kochdumper, N., Ray, R., … Schupp, S. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In EPiC Series in Computing (Vol. 61, pp. 14–40). Montreal, Canada: EasyChair. https://doi.org/10.29007/bj1w","ieee":"M. Althoff et al., “ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics,” in EPiC Series in Computing, Montreal, Canada, 2019, vol. 61, pp. 14–40.","ista":"Althoff M, Bak S, Forets M, Frehse G, Kochdumper N, Ray R, Schilling C, Schupp S. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 14–40.","ama":"Althoff M, Bak S, Forets M, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics. In: EPiC Series in Computing. Vol 61. EasyChair; 2019:14-40. doi:10.29007/bj1w"},"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","end_date":"2019-04-15","start_date":"2019-04-15","location":"Montreal, Canada"},"doi":"10.29007/bj1w","date_published":"2019-05-25T00:00:00Z","day":"25","month":"05","article_processing_charge":"No","publication_identifier":{"eissn":["23987340"]},"publication_status":"published","title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with linear continuous dynamics","status":"public","intvolume":" 61","department":[{"_id":"ToHe"}],"publisher":"EasyChair","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8570","year":"2019","date_updated":"2021-01-12T08:20:05Z","date_created":"2020-09-26T14:23:54Z","oa_version":"Published Version","volume":61,"author":[{"full_name":"Althoff, Matthias","first_name":"Matthias","last_name":"Althoff"},{"last_name":"Bak","first_name":"Stanley","full_name":"Bak, Stanley"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"first_name":"Goran","last_name":"Frehse","full_name":"Frehse, Goran"},{"first_name":"Niklas","last_name":"Kochdumper","full_name":"Kochdumper, Niklas"},{"full_name":"Ray, Rajarshi","first_name":"Rajarshi","last_name":"Ray"},{"first_name":"Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065","full_name":"Schilling, Christian"},{"full_name":"Schupp, Stefan","first_name":"Stefan","last_name":"Schupp"}],"type":"conference","abstract":[{"lang":"eng","text":"This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date."}]},{"publisher":"National Academy of Sciences","department":[{"_id":"DaZi"}],"publication_status":"published","pmid":1,"year":"2019","volume":116,"date_updated":"2021-12-14T07:52:30Z","date_created":"2021-06-04T12:38:20Z","author":[{"full_name":"Kim, M. Yvonne","first_name":"M. Yvonne","last_name":"Kim"},{"full_name":"Ono, Akemi","last_name":"Ono","first_name":"Akemi"},{"full_name":"Scholten, Stefan","last_name":"Scholten","first_name":"Stefan"},{"last_name":"Kinoshita","first_name":"Tetsu","full_name":"Kinoshita, Tetsu"},{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman","first_name":"Daniel","full_name":"Zilberman, Daniel"},{"full_name":"Okamoto, Takashi","first_name":"Takashi","last_name":"Okamoto"},{"full_name":"Fischer, Robert L.","first_name":"Robert L.","last_name":"Fischer"}],"extern":"1","file_date_updated":"2021-06-04T12:50:47Z","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"pmid":["31000601"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1821435116","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"month":"05","intvolume":" 116","ddc":["580"],"title":"DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm","status":"public","_id":"9460","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Published Version","file":[{"file_name":"2019_PNAS_Kim.pdf","access_level":"open_access","creator":"asandaue","file_size":1142540,"content_type":"application/pdf","file_id":"9461","relation":"main_file","date_updated":"2021-06-04T12:50:47Z","date_created":"2021-06-04T12:50:47Z","success":1,"checksum":"5b0ae3779b8b21b5223bd2d3cceede3a"}],"type":"journal_article","issue":"19","abstract":[{"lang":"eng","text":"Epigenetic reprogramming is required for proper regulation of gene expression in eukaryotic organisms. In Arabidopsis, active DNA demethylation is crucial for seed viability, pollen function, and successful reproduction. The DEMETER (DME) DNA glycosylase initiates localized DNA demethylation in vegetative and central cells, so-called companion cells that are adjacent to sperm and egg gametes, respectively. In rice, the central cell genome displays local DNA hypomethylation, suggesting that active DNA demethylation also occurs in rice; however, the enzyme responsible for this process is unknown. One candidate is the rice REPRESSOR OF SILENCING 1a (ROS1a) gene, which is related to DME and is essential for rice seed viability and pollen function. Here, we report genome-wide analyses of DNA methylation in wild-type and ros1a mutant sperm and vegetative cells. We find that the rice vegetative cell genome is locally hypomethylated compared with sperm by a process that requires ROS1a activity. We show that many ROS1a target sequences in the vegetative cell are hypomethylated in the rice central cell, suggesting that ROS1a also demethylates the central cell genome. Similar to Arabidopsis, we show that sperm non-CG methylation is indirectly promoted by DNA demethylation in the vegetative cell. These results reveal that DNA glycosylase-mediated DNA demethylation processes are conserved in Arabidopsis and rice, plant species that diverged 150 million years ago. Finally, although global non-CG methylation levels of sperm and egg differ, the maternal and paternal embryo genomes show similar non-CG methylation levels, suggesting that rice gamete genomes undergo dynamic DNA methylation reprogramming after cell fusion."}],"page":"9652-9657","article_type":"original","citation":{"short":"M.Y. Kim, A. Ono, S. Scholten, T. Kinoshita, D. Zilberman, T. Okamoto, R.L. Fischer, Proceedings of the National Academy of Sciences 116 (2019) 9652–9657.","mla":"Kim, M. Yvonne, et al. “DNA Demethylation by ROS1a in Rice Vegetative Cells Promotes Methylation in Sperm.” Proceedings of the National Academy of Sciences, vol. 116, no. 19, National Academy of Sciences, 2019, pp. 9652–57, doi:10.1073/pnas.1821435116.","chicago":"Kim, M. Yvonne, Akemi Ono, Stefan Scholten, Tetsu Kinoshita, Daniel Zilberman, Takashi Okamoto, and Robert L. Fischer. “DNA Demethylation by ROS1a in Rice Vegetative Cells Promotes Methylation in Sperm.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2019. https://doi.org/10.1073/pnas.1821435116.","ama":"Kim MY, Ono A, Scholten S, et al. DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm. Proceedings of the National Academy of Sciences. 2019;116(19):9652-9657. doi:10.1073/pnas.1821435116","apa":"Kim, M. Y., Ono, A., Scholten, S., Kinoshita, T., Zilberman, D., Okamoto, T., & Fischer, R. L. (2019). DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1821435116","ieee":"M. Y. Kim et al., “DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm,” Proceedings of the National Academy of Sciences, vol. 116, no. 19. National Academy of Sciences, pp. 9652–9657, 2019.","ista":"Kim MY, Ono A, Scholten S, Kinoshita T, Zilberman D, Okamoto T, Fischer RL. 2019. DNA demethylation by ROS1a in rice vegetative cells promotes methylation in sperm. Proceedings of the National Academy of Sciences. 116(19), 9652–9657."},"publication":"Proceedings of the National Academy of Sciences","date_published":"2019-05-07T00:00:00Z","keyword":["Multidisciplinary"],"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"07"},{"language":[{"iso":"eng"}],"doi":"10.1186/s13104-019-4534-3","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["31395095"]},"month":"08","publication_identifier":{"eissn":["1756-0500"]},"date_created":"2019-08-18T22:00:39Z","date_updated":"2023-02-23T14:08:14Z","volume":12,"author":[{"full_name":"Antoniou, Michael N.","first_name":"Michael N.","last_name":"Antoniou"},{"full_name":"Nicolas, Armel","id":"2A103192-F248-11E8-B48F-1D18A9856A87","first_name":"Armel","last_name":"Nicolas"},{"first_name":"Robin","last_name":"Mesnage","full_name":"Mesnage, Robin"},{"full_name":"Biserni, Martina","first_name":"Martina","last_name":"Biserni"},{"full_name":"Rao, Francesco V.","last_name":"Rao","first_name":"Francesco V."},{"first_name":"Cristina Vazquez","last_name":"Martin","full_name":"Martin, Cristina Vazquez"}],"related_material":{"record":[{"id":"9784","status":"public","relation":"research_data"}]},"publication_status":"published","department":[{"_id":"LifeSc"}],"publisher":"BioMed Central","year":"2019","pmid":1,"file_date_updated":"2020-07-14T12:47:40Z","article_number":"494","date_published":"2019-08-08T00:00:00Z","publication":"BMC Research Notes","citation":{"mla":"Antoniou, Michael N., et al. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes, vol. 12, 494, BioMed Central, 2019, doi:10.1186/s13104-019-4534-3.","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, BMC Research Notes 12 (2019).","chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes. BioMed Central, 2019. https://doi.org/10.1186/s13104-019-4534-3.","ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 2019;12. doi:10.1186/s13104-019-4534-3","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 12, 494.","apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. BioMed Central. https://doi.org/10.1186/s13104-019-4534-3","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells,” BMC Research Notes, vol. 12. BioMed Central, 2019."},"day":"08","has_accepted_license":"1","article_processing_charge":"No","scopus_import":1,"oa_version":"Published Version","file":[{"file_id":"6829","relation":"main_file","date_updated":"2020-07-14T12:47:40Z","date_created":"2019-08-23T11:10:35Z","checksum":"4a2bb7994b7f2c432bf44f5127ea3102","file_name":"2019_BMC_Antoniou.pdf","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":1177482}],"ddc":["570"],"title":"Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","status":"public","intvolume":" 12","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"6819","abstract":[{"text":"Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations have been shown to exert toxicity via various mechanisms. It has been asserted that glyphosate substitutes for glycine in polypeptide chains leading to protein misfolding and toxicity. However, as no direct evidence exists for glycine to glyphosate substitution in proteins, including in mammalian organisms, we tested this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts from three treated and three untreated cell cultures were analysed as one TMT-6plex labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities for peptides bearing true glyphosate treatment induced-post translational modifications as well as allowing an investigation of the total proteome.","lang":"eng"}],"type":"journal_article"},{"citation":{"apa":"Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. Springer Nature. https://doi.org/10.6084/m9.figshare.9411761.v1","ieee":"M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells.” Springer Nature, 2019.","ista":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells, Springer Nature, 10.6084/m9.figshare.9411761.v1.","ama":"Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. 2019. doi:10.6084/m9.figshare.9411761.v1","chicago":"Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” Springer Nature, 2019. https://doi.org/10.6084/m9.figshare.9411761.v1.","short":"M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, (2019).","mla":"Antoniou, Michael N., et al. MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells. Springer Nature, 2019, doi:10.6084/m9.figshare.9411761.v1."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.9411761.v1"}],"doi":"10.6084/m9.figshare.9411761.v1","date_published":"2019-08-09T00:00:00Z","article_processing_charge":"No","day":"09","month":"08","publisher":"Springer Nature","department":[{"_id":"LifeSc"}],"status":"public","title":"MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells","_id":"9784","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2019","oa_version":"Published Version","date_updated":"2023-02-23T12:52:29Z","date_created":"2021-08-06T08:14:05Z","related_material":{"record":[{"id":"6819","status":"public","relation":"used_in_publication"}]},"author":[{"full_name":"Antoniou, Michael N.","first_name":"Michael N.","last_name":"Antoniou"},{"last_name":"Nicolas","first_name":"Armel","id":"2A103192-F248-11E8-B48F-1D18A9856A87","full_name":"Nicolas, Armel"},{"first_name":"Robin","last_name":"Mesnage","full_name":"Mesnage, Robin"},{"first_name":"Martina","last_name":"Biserni","full_name":"Biserni, Martina"},{"full_name":"Rao, Francesco V.","first_name":"Francesco V.","last_name":"Rao"},{"last_name":"Martin","first_name":"Cristina Vazquez","full_name":"Martin, Cristina Vazquez"}],"type":"research_data_reference","abstract":[{"lang":"eng","text":"Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1 of seeding flasks and following 6-days of continuous culture. Note: no differences in cell numbers were observed between negative control and glyphosate treated cultures."}]},{"type":"research_data_reference","abstract":[{"text":"More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range.","lang":"eng"}],"title":"Data from: Is the sky the limit? On the expansion threshold of a species' range","status":"public","publisher":"Dryad","department":[{"_id":"NiBa"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9839","year":"2019","date_updated":"2023-02-23T11:14:30Z","date_created":"2021-08-09T13:07:28Z","oa_version":"Published Version","author":[{"full_name":"Polechova, Jitka","orcid":"0000-0003-0951-3112","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","last_name":"Polechova","first_name":"Jitka"}],"related_material":{"record":[{"id":"315","relation":"used_in_publication","status":"public"}]},"day":"22","month":"06","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.5061/dryad.5vv37","open_access":"1"}],"oa":1,"citation":{"chicago":"Polechova, Jitka. “Data from: Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” Dryad, 2019. https://doi.org/10.5061/dryad.5vv37.","mla":"Polechova, Jitka. Data from: Is the Sky the Limit? On the Expansion Threshold of a Species’ Range. Dryad, 2019, doi:10.5061/dryad.5vv37.","short":"J. Polechova, (2019).","ista":"Polechova J. 2019. Data from: Is the sky the limit? On the expansion threshold of a species’ range, Dryad, 10.5061/dryad.5vv37.","apa":"Polechova, J. (2019). Data from: Is the sky the limit? On the expansion threshold of a species’ range. Dryad. https://doi.org/10.5061/dryad.5vv37","ieee":"J. Polechova, “Data from: Is the sky the limit? On the expansion threshold of a species’ range.” Dryad, 2019.","ama":"Polechova J. Data from: Is the sky the limit? On the expansion threshold of a species’ range. 2019. doi:10.5061/dryad.5vv37"},"doi":"10.5061/dryad.5vv37","date_published":"2019-06-22T00:00:00Z"},{"type":"journal_article","abstract":[{"lang":"eng","text":"Background\r\nDNA methylation of active genes, also known as gene body methylation, is found in many animal and plant genomes. Despite this, the transcriptional and developmental role of such methylation remains poorly understood. Here, we explore the dynamic range of DNA methylation in honey bee, a model organism for gene body methylation.\r\n\r\nResults\r\nOur data show that CG methylation in gene bodies globally fluctuates during honey bee development. However, these changes cause no gene expression alterations. Intriguingly, despite the global alterations, tissue-specific CG methylation patterns of complete genes or exons are rare, implying robust maintenance of genic methylation during development. Additionally, we show that CG methylation maintenance fluctuates in somatic cells, while reaching maximum fidelity in sperm cells. Finally, unlike universally present CG methylation, we discovered non-CG methylation specifically in bee heads that resembles such methylation in mammalian brain tissue.\r\n\r\nConclusions\r\nBased on these results, we propose that gene body CG methylation can oscillate during development if it is kept to a level adequate to preserve function. Additionally, our data suggest that heightened non-CG methylation is a conserved regulator of animal nervous systems."}],"_id":"9530","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 12","status":"public","ddc":["570"],"title":"DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development","file":[{"file_id":"9531","relation":"main_file","success":1,"checksum":"86ff50a7517891511af2733c76c81b67","date_created":"2021-06-08T09:29:19Z","date_updated":"2021-06-08T09:29:19Z","access_level":"open_access","file_name":"2019_EpigeneticsAndChromatin_Harris.pdf","creator":"asandaue","file_size":3221067,"content_type":"application/pdf"}],"oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"10","citation":{"ista":"Harris KD, Lloyd JPB, Domb K, Zilberman D, Zemach A. 2019. DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development. Epigenetics and Chromatin. 12, 62.","ieee":"K. D. Harris, J. P. B. Lloyd, K. Domb, D. Zilberman, and A. Zemach, “DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development,” Epigenetics and Chromatin, vol. 12. Springer Nature, 2019.","apa":"Harris, K. D., Lloyd, J. P. B., Domb, K., Zilberman, D., & Zemach, A. (2019). DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development. Epigenetics and Chromatin. Springer Nature. https://doi.org/10.1186/s13072-019-0307-4","ama":"Harris KD, Lloyd JPB, Domb K, Zilberman D, Zemach A. DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development. Epigenetics and Chromatin. 2019;12. doi:10.1186/s13072-019-0307-4","chicago":"Harris, Keith D., James P. B. Lloyd, Katherine Domb, Daniel Zilberman, and Assaf Zemach. “DNA Methylation Is Maintained with High Fidelity in the Honey Bee Germline and Exhibits Global Non-Functional Fluctuations during Somatic Development.” Epigenetics and Chromatin. Springer Nature, 2019. https://doi.org/10.1186/s13072-019-0307-4.","mla":"Harris, Keith D., et al. “DNA Methylation Is Maintained with High Fidelity in the Honey Bee Germline and Exhibits Global Non-Functional Fluctuations during Somatic Development.” Epigenetics and Chromatin, vol. 12, 62, Springer Nature, 2019, doi:10.1186/s13072-019-0307-4.","short":"K.D. Harris, J.P.B. Lloyd, K. Domb, D. Zilberman, A. Zemach, Epigenetics and Chromatin 12 (2019)."},"publication":"Epigenetics and Chromatin","article_type":"original","date_published":"2019-10-10T00:00:00Z","article_number":"62","file_date_updated":"2021-06-08T09:29:19Z","extern":"1","pmid":1,"year":"2019","publisher":"Springer Nature","department":[{"_id":"DaZi"}],"publication_status":"published","author":[{"full_name":"Harris, Keith D.","last_name":"Harris","first_name":"Keith D."},{"first_name":"James P. B.","last_name":"Lloyd","full_name":"Lloyd, James P. B."},{"full_name":"Domb, Katherine","last_name":"Domb","first_name":"Katherine"},{"full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","first_name":"Daniel","last_name":"Zilberman"},{"full_name":"Zemach, Assaf","last_name":"Zemach","first_name":"Assaf"}],"volume":12,"date_created":"2021-06-08T09:21:51Z","date_updated":"2021-12-14T07:53:00Z","publication_identifier":{"eissn":["1756-8935"]},"month":"10","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"pmid":["31601251"]},"quality_controlled":"1","doi":"10.1186/s13072-019-0307-4","language":[{"iso":"eng"}]},{"type":"journal_article","abstract":[{"text":"Transposable elements (TEs), the movement of which can damage the genome, are epigenetically silenced in eukaryotes. Intriguingly, TEs are activated in the sperm companion cell – vegetative cell (VC) – of the flowering plant Arabidopsis thaliana. However, the extent and mechanism of this activation are unknown. Here we show that about 100 heterochromatic TEs are activated in VCs, mostly by DEMETER-catalyzed DNA demethylation. We further demonstrate that DEMETER access to some of these TEs is permitted by the natural depletion of linker histone H1 in VCs. Ectopically expressed H1 suppresses TEs in VCs by reducing DNA demethylation and via a methylation-independent mechanism. We demonstrate that H1 is required for heterochromatin condensation in plant cells and show that H1 overexpression creates heterochromatic foci in the VC progenitor cell. Taken together, our results demonstrate that the natural depletion of H1 during male gametogenesis facilitates DEMETER-directed DNA demethylation, heterochromatin relaxation, and TE activation.","lang":"eng"}],"_id":"12192","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 8","status":"public","title":"Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation","ddc":["580"],"file":[{"file_name":"2019_elife_He.pdf","access_level":"open_access","file_size":2493837,"content_type":"application/pdf","creator":"alisjak","relation":"main_file","file_id":"12525","date_created":"2023-02-07T09:42:46Z","date_updated":"2023-02-07T09:42:46Z","checksum":"ea6b89c20d59e5eb3646916fe5d568ad","success":1}],"oa_version":"Published Version","scopus_import":"1","keyword":["General Immunology and Microbiology","General Biochemistry","Genetics and Molecular Biology","General Medicine","General Neuroscience"],"has_accepted_license":"1","article_processing_charge":"No","day":"28","citation":{"chicago":"He, Shengbo, Martin Vickers, Jingyi Zhang, and Xiaoqi Feng. “Natural Depletion of Histone H1 in Sex Cells Causes DNA Demethylation, Heterochromatin Decondensation and Transposon Activation.” ELife. eLife Sciences Publications, Ltd, 2019. https://doi.org/10.7554/elife.42530.","mla":"He, Shengbo, et al. “Natural Depletion of Histone H1 in Sex Cells Causes DNA Demethylation, Heterochromatin Decondensation and Transposon Activation.” ELife, vol. 8, 42530, eLife Sciences Publications, Ltd, 2019, doi:10.7554/elife.42530.","short":"S. He, M. Vickers, J. Zhang, X. Feng, ELife 8 (2019).","ista":"He S, Vickers M, Zhang J, Feng X. 2019. Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation. eLife. 8, 42530.","ieee":"S. He, M. Vickers, J. Zhang, and X. Feng, “Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation,” eLife, vol. 8. eLife Sciences Publications, Ltd, 2019.","apa":"He, S., Vickers, M., Zhang, J., & Feng, X. (2019). Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation. ELife. eLife Sciences Publications, Ltd. https://doi.org/10.7554/elife.42530","ama":"He S, Vickers M, Zhang J, Feng X. Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation. eLife. 2019;8. doi:10.7554/elife.42530"},"publication":"eLife","article_type":"original","date_published":"2019-05-28T00:00:00Z","article_number":"42530","file_date_updated":"2023-02-07T09:42:46Z","extern":"1","year":"2019","acknowledgement":"We thank David Twell for the pDONR-P4-P1R-pLAT52 and pDONR-P2R-P3-mRFP vectors, the John Innes Centre Bioimaging Facility (Elaine Barclay and Grant Calder) for their assistance with microscopy, and the Norwich BioScience Institute Partnership Computing infrastructure for Science Group for High Performance Computing resources. This work was funded by a Biotechnology and Biological Sciences Research Council (BBSRC) David Phillips Fellowship (BB/L025043/1; SH, JZ and XF), a European Research Council Starting Grant ('SexMeth' 804981; XF) and a Grant to Exceptional Researchers by the Gatsby Charitable Foundation (SH and XF).","department":[{"_id":"XiFe"}],"publisher":"eLife Sciences Publications, Ltd","publication_status":"published","author":[{"last_name":"He","first_name":"Shengbo","full_name":"He, Shengbo"},{"full_name":"Vickers, Martin","first_name":"Martin","last_name":"Vickers"},{"full_name":"Zhang, Jingyi","last_name":"Zhang","first_name":"Jingyi"},{"full_name":"Feng, Xiaoqi","first_name":"Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234"}],"volume":8,"date_updated":"2023-05-08T10:54:12Z","date_created":"2023-01-16T09:17:21Z","publication_identifier":{"issn":["2050-084X"]},"month":"05","external_id":{"unknown":["31135340"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6594752/","open_access":"1"}],"quality_controlled":"1","doi":"10.7554/elife.42530","language":[{"iso":"eng"}]},{"extern":"1","volume":29,"date_updated":"2023-05-08T10:54:54Z","date_created":"2023-01-16T09:16:33Z","author":[{"last_name":"Lawrence","first_name":"Emma J.","full_name":"Lawrence, Emma J."},{"first_name":"Hongbo","last_name":"Gao","full_name":"Gao, Hongbo"},{"full_name":"Tock, Andrew J.","last_name":"Tock","first_name":"Andrew J."},{"full_name":"Lambing, Christophe","last_name":"Lambing","first_name":"Christophe"},{"full_name":"Blackwell, Alexander R.","last_name":"Blackwell","first_name":"Alexander R."},{"full_name":"Feng, Xiaoqi","last_name":"Feng","first_name":"Xiaoqi","orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958"},{"full_name":"Henderson, Ian R.","first_name":"Ian R.","last_name":"Henderson"}],"publisher":"Elsevier BV","department":[{"_id":"XiFe"}],"publication_status":"published","pmid":1,"acknowledgement":"We thank Gregory Copenhaver (University of North Carolina), Avraham Levy (The Weizmann Institute), and Scott Poethig (University of Pennsylvania) for FTLs; Piotr Ziolkowski for Col-420/Bur seed; Sureshkumar Balasubramanian\r\n(Monash University) for providing British and Irish Arabidopsis accessions; Mathilde Grelon (INRA, Versailles) for providing the MLH1 antibody; and the Gurdon Institute for access to microscopes. This work was supported by a BBSRC DTP studentship (E.J.L.), European Research Area Network for Coordinating Action in Plant Sciences/BBSRC ‘‘DeCOP’’ (BB/M004937/1; C.L.), a BBSRC David Phillips Fellowship (BB/L025043/1; H.G. and X.F.), the European Research Council (CoG ‘‘SynthHotspot,’’ A.J.T., C.L., and I.R.H.; StG ‘‘SexMeth,’’ X.F.), and a Sainsbury Charitable Foundation Studentship (A.R.B.).","year":"2019","publication_identifier":{"issn":["0960-9822"]},"month":"08","language":[{"iso":"eng"}],"doi":"10.1016/j.cub.2019.06.084","quality_controlled":"1","external_id":{"pmid":["31378616"]},"issue":"16","abstract":[{"lang":"eng","text":"Meiotic crossover frequency varies within genomes, which influences genetic diversity and adaptation. In turn, genetic variation within populations can act to modify crossover frequency in cis and trans. To identify genetic variation that controls meiotic crossover frequency, we screened Arabidopsis accessions using fluorescent recombination reporters. We mapped a genetic modifier of crossover frequency in Col × Bur populations of Arabidopsis to a premature stop codon within TBP-ASSOCIATED FACTOR 4b (TAF4b), which encodes a subunit of the RNA polymerase II general transcription factor TFIID. The Arabidopsis taf4b mutation is a rare variant found in the British Isles, originating in South-West Ireland. Using genetics, genomics, and immunocytology, we demonstrate a genome-wide decrease in taf4b crossovers, with strongest reduction in the sub-telomeric regions. Using RNA sequencing (RNA-seq) from purified meiocytes, we show that TAF4b expression is meiocyte enriched, whereas its paralog TAF4 is broadly expressed. Consistent with the role of TFIID in promoting gene expression, RNA-seq of wild-type and taf4b meiocytes identified widespread transcriptional changes, including in genes that regulate the meiotic cell cycle and recombination. Therefore, TAF4b duplication is associated with acquisition of meiocyte-specific expression and promotion of germline transcription, which act directly or indirectly to elevate crossovers. This identifies a novel mode of meiotic recombination control via a general transcription factor."}],"type":"journal_article","oa_version":"None","intvolume":" 29","title":"Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis","status":"public","_id":"12190","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","day":"19","keyword":["General Agricultural and Biological Sciences","General Biochemistry","Genetics and Molecular Biology"],"scopus_import":"1","date_published":"2019-08-19T00:00:00Z","page":"2676-2686.e3","article_type":"original","citation":{"chicago":"Lawrence, Emma J., Hongbo Gao, Andrew J. Tock, Christophe Lambing, Alexander R. Blackwell, Xiaoqi Feng, and Ian R. Henderson. “Natural Variation in TBP-ASSOCIATED FACTOR 4b Controls Meiotic Crossover and Germline Transcription in Arabidopsis.” Current Biology. Elsevier BV, 2019. https://doi.org/10.1016/j.cub.2019.06.084.","short":"E.J. Lawrence, H. Gao, A.J. Tock, C. Lambing, A.R. Blackwell, X. Feng, I.R. Henderson, Current Biology 29 (2019) 2676–2686.e3.","mla":"Lawrence, Emma J., et al. “Natural Variation in TBP-ASSOCIATED FACTOR 4b Controls Meiotic Crossover and Germline Transcription in Arabidopsis.” Current Biology, vol. 29, no. 16, Elsevier BV, 2019, p. 2676–2686.e3, doi:10.1016/j.cub.2019.06.084.","ieee":"E. J. Lawrence et al., “Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis,” Current Biology, vol. 29, no. 16. Elsevier BV, p. 2676–2686.e3, 2019.","apa":"Lawrence, E. J., Gao, H., Tock, A. J., Lambing, C., Blackwell, A. R., Feng, X., & Henderson, I. R. (2019). Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. Current Biology. Elsevier BV. https://doi.org/10.1016/j.cub.2019.06.084","ista":"Lawrence EJ, Gao H, Tock AJ, Lambing C, Blackwell AR, Feng X, Henderson IR. 2019. Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. Current Biology. 29(16), 2676–2686.e3.","ama":"Lawrence EJ, Gao H, Tock AJ, et al. Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis. Current Biology. 2019;29(16):2676-2686.e3. doi:10.1016/j.cub.2019.06.084"},"publication":"Current Biology"},{"publication":"AHPC19 - Austrian HPC Meeting 2019 ","main_file_link":[{"open_access":"1","url":"https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ahpc19/BOOKLET_AHPC19.pdf"}],"oa":1,"citation":{"short":"A. Schlögl, J. Kiss, S. Elefante, in:, AHPC19 - Austrian HPC Meeting 2019 , Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019, p. 25.","mla":"Schlögl, Alois, et al. “Is Debian Suitable for Running an HPC Cluster?” AHPC19 - Austrian HPC Meeting 2019 , Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019, p. 25.","chicago":"Schlögl, Alois, Janos Kiss, and Stefano Elefante. “Is Debian Suitable for Running an HPC Cluster?” In AHPC19 - Austrian HPC Meeting 2019 , 25. Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz, 2019.","ama":"Schlögl A, Kiss J, Elefante S. Is Debian suitable for running an HPC Cluster? In: AHPC19 - Austrian HPC Meeting 2019 . Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz; 2019:25.","ieee":"A. Schlögl, J. Kiss, and S. Elefante, “Is Debian suitable for running an HPC Cluster?,” in AHPC19 - Austrian HPC Meeting 2019 , Grundlsee, Austria, 2019, p. 25.","apa":"Schlögl, A., Kiss, J., & Elefante, S. (2019). Is Debian suitable for running an HPC Cluster? In AHPC19 - Austrian HPC Meeting 2019 (p. 25). Grundlsee, Austria: Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz.","ista":"Schlögl A, Kiss J, Elefante S. 2019. Is Debian suitable for running an HPC Cluster? AHPC19 - Austrian HPC Meeting 2019 . AHPC: Austrian HPC Meeting, 25."},"page":"25","conference":{"name":"AHPC: Austrian HPC Meeting","end_date":"2019-02-27","location":"Grundlsee, Austria","start_date":"2019-02-25"},"date_published":"2019-02-27T00:00:00Z","language":[{"iso":"eng"}],"day":"27","month":"02","has_accepted_license":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12901","year":"2019","title":"Is Debian suitable for running an HPC Cluster?","ddc":["000"],"publication_status":"published","status":"public","publisher":"Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz","department":[{"_id":"ScienComp"}],"author":[{"full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois","last_name":"Schlögl"},{"full_name":"Kiss, Janos","first_name":"Janos","last_name":"Kiss","id":"3D3A06F8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Elefante, Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","last_name":"Elefante","first_name":"Stefano"}],"date_created":"2023-05-05T12:48:48Z","date_updated":"2023-05-16T07:29:32Z","file":[{"success":1,"checksum":"acc8272027faaf30709c51ac5c58ffa4","date_created":"2023-05-16T07:27:09Z","date_updated":"2023-05-16T07:27:09Z","file_id":"12970","relation":"main_file","creator":"dernst","file_size":1097603,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_AHPC_Schloegl.pdf"}],"oa_version":"Published Version","type":"conference_abstract","file_date_updated":"2023-05-16T07:27:09Z"},{"year":"2019","_id":"6989","acknowledgement":"This research was performed in part at the 33rd BellairsWinter Workshop on Computational Geometry. Wethank all other participants for a fruitful atmosphere.","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","publication_status":"published","status":"public","title":"Folding polyominoes with holes into a cube","publisher":"Canadian Conference on Computational Geometry","department":[{"_id":"HeEd"}],"author":[{"full_name":"Aichholzer, Oswin","last_name":"Aichholzer","first_name":"Oswin"},{"full_name":"Akitaya, Hugo A","last_name":"Akitaya","first_name":"Hugo A"},{"first_name":"Kenneth C","last_name":"Cheung","full_name":"Cheung, Kenneth C"},{"full_name":"Demaine, Erik D","first_name":"Erik D","last_name":"Demaine"},{"full_name":"Demaine, Martin L","first_name":"Martin L","last_name":"Demaine"},{"last_name":"Fekete","first_name":"Sandor P","full_name":"Fekete, Sandor P"},{"full_name":"Kleist, Linda","last_name":"Kleist","first_name":"Linda"},{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"full_name":"Löffler, Maarten","last_name":"Löffler","first_name":"Maarten"},{"full_name":"Masárová, Zuzana","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87","last_name":"Masárová","first_name":"Zuzana"},{"first_name":"Klara","last_name":"Mundilova","full_name":"Mundilova, Klara"},{"first_name":"Christiane","last_name":"Schmidt","full_name":"Schmidt, Christiane"}],"related_material":{"record":[{"relation":"extended_version","status":"public","id":"8317"}]},"date_created":"2019-11-04T16:46:11Z","date_updated":"2023-08-04T10:57:42Z","oa_version":"Published Version","type":"conference","abstract":[{"lang":"eng","text":"When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with hole(s) to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special simple holes guarantee foldability. "}],"publication":"Proceedings of the 31st Canadian Conference on Computational Geometry","main_file_link":[{"url":"https://cccg.ca/proceedings/2019/proceedings.pdf","open_access":"1"}],"citation":{"mla":"Aichholzer, Oswin, et al. “Folding Polyominoes with Holes into a Cube.” Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2019, pp. 164–70.","short":"O. Aichholzer, H.A. Akitaya, K.C. Cheung, E.D. Demaine, M.L. Demaine, S.P. Fekete, L. Kleist, I. Kostitsyna, M. Löffler, Z. Masárová, K. Mundilova, C. Schmidt, in:, Proceedings of the 31st Canadian Conference on Computational Geometry, Canadian Conference on Computational Geometry, 2019, pp. 164–170.","chicago":"Aichholzer, Oswin, Hugo A Akitaya, Kenneth C Cheung, Erik D Demaine, Martin L Demaine, Sandor P Fekete, Linda Kleist, et al. “Folding Polyominoes with Holes into a Cube.” In Proceedings of the 31st Canadian Conference on Computational Geometry, 164–70. Canadian Conference on Computational Geometry, 2019.","ama":"Aichholzer O, Akitaya HA, Cheung KC, et al. Folding polyominoes with holes into a cube. In: Proceedings of the 31st Canadian Conference on Computational Geometry. Canadian Conference on Computational Geometry; 2019:164-170.","ista":"Aichholzer O, Akitaya HA, Cheung KC, Demaine ED, Demaine ML, Fekete SP, Kleist L, Kostitsyna I, Löffler M, Masárová Z, Mundilova K, Schmidt C. 2019. Folding polyominoes with holes into a cube. Proceedings of the 31st Canadian Conference on Computational Geometry. CCCG: Canadian Conference in Computational Geometry, 164–170.","ieee":"O. Aichholzer et al., “Folding polyominoes with holes into a cube,” in Proceedings of the 31st Canadian Conference on Computational Geometry, Edmonton, Canada, 2019, pp. 164–170.","apa":"Aichholzer, O., Akitaya, H. A., Cheung, K. C., Demaine, E. D., Demaine, M. L., Fekete, S. P., … Schmidt, C. (2019). Folding polyominoes with holes into a cube. In Proceedings of the 31st Canadian Conference on Computational Geometry (pp. 164–170). Edmonton, Canada: Canadian Conference on Computational Geometry."},"external_id":{"arxiv":["1910.09917"]},"oa":1,"quality_controlled":"1","page":"164-170","conference":{"end_date":"2019-08-10","location":"Edmonton, Canada","start_date":"2019-08-08","name":"CCCG: Canadian Conference in Computational Geometry"},"date_published":"2019-08-01T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","month":"08","day":"01","article_processing_charge":"No"},{"ec_funded":1,"file_date_updated":"2020-07-14T12:47:42Z","article_number":"11","related_material":{"record":[{"relation":"later_version","status":"public","id":"9239"}]},"author":[{"orcid":"0000-0001-5588-8287","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","last_name":"Avni","first_name":"Guy","full_name":"Avni, Guy"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"volume":138,"date_updated":"2023-08-07T14:08:34Z","date_created":"2019-09-18T08:04:26Z","year":"2019","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","month":"08","doi":"10.4230/LIPICS.MFCS.2019.11","conference":{"start_date":"2019-08-26","location":"Aachen, Germany","end_date":"2019-08-30","name":"MFCS: nternational Symposium on Mathematical Foundations of Computer Science"},"language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["1905.03835"]},"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","grant_number":"M02369"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S11402-N23","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the \"bank\" rather than the other player. Taxman bidding spans the spectrum between Richman and poorman bidding. They are parameterized by a constant tau in [0,1]: portion tau of the winning bid is paid to the other player, and portion 1-tau to the bank. While finite-duration (reachability) taxman games have been studied before, we present, for the first time, results on infinite-duration taxman games. It was previously shown that both Richman and poorman infinite-duration games with qualitative objectives reduce to reachability games, and we show a similar result here. Our most interesting results concern quantitative taxman games, namely mean-payoff games, where poorman and Richman bidding differ significantly. A central quantity in these games is the ratio between the two players' initial budgets. While in poorman mean-payoff games, the optimal payoff of a player depends on the initial ratio, in Richman bidding, the payoff depends only on the structure of the game. In both games the optimal payoffs can be found using (different) probabilistic connections with random-turn games in which in each turn, instead of bidding, a coin is tossed to determine which player moves. While the value with Richman bidding equals the value of a random-turn game with an un-biased coin, with poorman bidding, the bias in the coin is the initial ratio of the budgets. We give a complete classification of mean-payoff taxman games that is based on a probabilistic connection: the value of a taxman bidding game with parameter tau and initial ratio r, equals the value of a random-turn game that uses a coin with bias F(tau, r) = (r+tau * (1-r))/(1+tau). Thus, we show that Richman bidding is the exception; namely, for every tau <1, the value of the game depends on the initial ratio. Our proof technique simplifies and unifies the previous proof techniques for both Richman and poorman bidding. "}],"type":"conference","alternative_title":["LIPIcs"],"file":[{"checksum":"6346e116a4f4ed1414174d96d2c4fbd7","date_created":"2019-09-27T11:45:15Z","date_updated":"2020-07-14T12:47:42Z","relation":"main_file","file_id":"6913","file_size":554457,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2019_LIPIcs_Avni.pdf"}],"oa_version":"Published Version","_id":"6884","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 138","title":"Bidding mechanisms in graph games","status":"public","ddc":["004"],"has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2019-08-01T00:00:00Z","citation":{"ista":"Avni G, Henzinger TA, Zikelic D. 2019. Bidding mechanisms in graph games. MFCS: nternational Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 138, 11.","apa":"Avni, G., Henzinger, T. A., & Zikelic, D. (2019). Bidding mechanisms in graph games (Vol. 138). Presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2019.11","ieee":"G. Avni, T. A. Henzinger, and D. Zikelic, “Bidding mechanisms in graph games,” presented at the MFCS: nternational Symposium on Mathematical Foundations of Computer Science, Aachen, Germany, 2019, vol. 138.","ama":"Avni G, Henzinger TA, Zikelic D. Bidding mechanisms in graph games. In: Vol 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.MFCS.2019.11","chicago":"Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,” Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.MFCS.2019.11.","mla":"Avni, Guy, et al. Bidding Mechanisms in Graph Games. Vol. 138, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.MFCS.2019.11.","short":"G. Avni, T.A. Henzinger, D. Zikelic, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019."}},{"doi":"10.1021/acs.nanolett.9b04445.s001","date_published":"2019-12-19T00:00:00Z","citation":{"ista":"Ucar MC, Lipowsky R. 2019. Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding, American Chemical Society , 10.1021/acs.nanolett.9b04445.s001.","ieee":"M. C. Ucar and R. Lipowsky, “Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding.” American Chemical Society , 2019.","apa":"Ucar, M. C., & Lipowsky, R. (2019). Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding. American Chemical Society . https://doi.org/10.1021/acs.nanolett.9b04445.s001","ama":"Ucar MC, Lipowsky R. Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding. 2019. doi:10.1021/acs.nanolett.9b04445.s001","chicago":"Ucar, Mehmet C, and Reinhard Lipowsky. “Supplementary Information - Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding.” American Chemical Society , 2019. https://doi.org/10.1021/acs.nanolett.9b04445.s001.","mla":"Ucar, Mehmet C., and Reinhard Lipowsky. Supplementary Information - Collective Force Generation by Molecular Motors Is Determined by Strain-Induced Unbinding. American Chemical Society , 2019, doi:10.1021/acs.nanolett.9b04445.s001.","short":"M.C. Ucar, R. Lipowsky, (2019)."},"day":"19","month":"12","article_processing_charge":"No","date_updated":"2023-08-17T14:07:52Z","date_created":"2021-07-27T09:51:46Z","oa_version":"Published Version","author":[{"full_name":"Ucar, Mehmet C","last_name":"Ucar","first_name":"Mehmet C","orcid":"0000-0003-0506-4217","id":"50B2A802-6007-11E9-A42B-EB23E6697425"},{"full_name":"Lipowsky, Reinhard","last_name":"Lipowsky","first_name":"Reinhard"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"7166"}]},"title":"Supplementary information - Collective force generation by molecular motors is determined by strain-induced unbinding","status":"public","publisher":"American Chemical Society ","department":[{"_id":"EdHa"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9726","year":"2019","abstract":[{"lang":"eng","text":"A detailed description of the two stochastic models, table of parameters, supplementary data for Figures 4 and 5, parameter dependence of the results, and an analysis on motors with different force–velocity functions (PDF)"}],"type":"research_data_reference"},{"day":"01","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","article_type":"original","page":"29–58","publication":"Journal of Applied and Computational Topology","citation":{"short":"J.-D. Boissonnat, A. Lieutier, M. Wintraecken, Journal of Applied and Computational Topology 3 (2019) 29–58.","mla":"Boissonnat, Jean-Daniel, et al. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology, vol. 3, no. 1–2, Springer Nature, 2019, pp. 29–58, doi:10.1007/s41468-019-00029-8.","chicago":"Boissonnat, Jean-Daniel, André Lieutier, and Mathijs Wintraecken. “The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces.” Journal of Applied and Computational Topology. Springer Nature, 2019. https://doi.org/10.1007/s41468-019-00029-8.","ama":"Boissonnat J-D, Lieutier A, Wintraecken M. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 2019;3(1-2):29–58. doi:10.1007/s41468-019-00029-8","apa":"Boissonnat, J.-D., Lieutier, A., & Wintraecken, M. (2019). The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. Springer Nature. https://doi.org/10.1007/s41468-019-00029-8","ieee":"J.-D. Boissonnat, A. Lieutier, and M. Wintraecken, “The reach, metric distortion, geodesic convexity and the variation of tangent spaces,” Journal of Applied and Computational Topology, vol. 3, no. 1–2. Springer Nature, pp. 29–58, 2019.","ista":"Boissonnat J-D, Lieutier A, Wintraecken M. 2019. The reach, metric distortion, geodesic convexity and the variation of tangent spaces. Journal of Applied and Computational Topology. 3(1–2), 29–58."},"date_published":"2019-06-01T00:00:00Z","type":"journal_article","abstract":[{"text":"In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points.","lang":"eng"}],"issue":"1-2","status":"public","ddc":["000"],"title":"The reach, metric distortion, geodesic convexity and the variation of tangent spaces","intvolume":" 3","_id":"6671","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":2215157,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2019_JournAppliedComputTopol_Boissonnat.pdf","checksum":"a5b244db9f751221409cf09c97ee0935","date_updated":"2020-07-14T12:47:36Z","date_created":"2019-07-31T08:09:56Z","relation":"main_file","file_id":"6741"}],"oa_version":"Published Version","month":"06","publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"language":[{"iso":"eng"}],"doi":"10.1007/s41468-019-00029-8","file_date_updated":"2020-07-14T12:47:36Z","ec_funded":1,"publication_status":"published","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"year":"2019","date_updated":"2023-08-22T12:37:47Z","date_created":"2019-07-24T08:37:29Z","volume":3,"author":[{"full_name":"Boissonnat, Jean-Daniel","last_name":"Boissonnat","first_name":"Jean-Daniel"},{"full_name":"Lieutier, André","last_name":"Lieutier","first_name":"André"},{"orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","first_name":"Mathijs","full_name":"Wintraecken, Mathijs"}]},{"month":"03","language":[{"iso":"eng"}],"doi":"10.1016/j.spa.2018.04.003","isi":1,"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1611.04177"}],"external_id":{"arxiv":["1611.04177"],"isi":["000458945300012"]},"oa":1,"date_updated":"2023-08-24T14:20:49Z","date_created":"2018-12-11T11:45:42Z","volume":129,"author":[{"full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser","first_name":"Mate"},{"last_name":"Gyöngy","first_name":"István","full_name":"Gyöngy, István"}],"publication_status":"published","department":[{"_id":"JaMa"}],"publisher":"Elsevier","year":"2019","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2019-03-01T00:00:00Z","article_type":"original","page":"995-1012","publication":"Stochastic Processes and their Applications","citation":{"chicago":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” Stochastic Processes and Their Applications. Elsevier, 2019. https://doi.org/10.1016/j.spa.2018.04.003.","short":"M. Gerencser, I. Gyöngy, Stochastic Processes and Their Applications 129 (2019) 995–1012.","mla":"Gerencser, Mate, and István Gyöngy. “A Feynman–Kac Formula for Stochastic Dirichlet Problems.” Stochastic Processes and Their Applications, vol. 129, no. 3, Elsevier, 2019, pp. 995–1012, doi:10.1016/j.spa.2018.04.003.","ieee":"M. Gerencser and I. Gyöngy, “A Feynman–Kac formula for stochastic Dirichlet problems,” Stochastic Processes and their Applications, vol. 129, no. 3. Elsevier, pp. 995–1012, 2019.","apa":"Gerencser, M., & Gyöngy, I. (2019). A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and Their Applications. Elsevier. https://doi.org/10.1016/j.spa.2018.04.003","ista":"Gerencser M, Gyöngy I. 2019. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 129(3), 995–1012.","ama":"Gerencser M, Gyöngy I. A Feynman–Kac formula for stochastic Dirichlet problems. Stochastic Processes and their Applications. 2019;129(3):995-1012. doi:10.1016/j.spa.2018.04.003"},"abstract":[{"lang":"eng","text":"A representation formula for solutions of stochastic partial differential equations with Dirichlet boundary conditions is proved. The scope of our setting is wide enough to cover the general situation when the backward characteristics that appear in the usual formulation are not even defined in the Itô sense."}],"issue":"3","type":"journal_article","oa_version":"Preprint","status":"public","title":"A Feynman–Kac formula for stochastic Dirichlet problems","intvolume":" 129","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"301"},{"date_published":"2019-06-01T00:00:00Z","page":"723-776","article_type":"original","citation":{"ama":"Deuchert A, Seiringer R, Yngvason J. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 2019;368(2):723-776. doi:10.1007/s00220-018-3239-0","ieee":"A. Deuchert, R. Seiringer, and J. Yngvason, “Bose–Einstein condensation in a dilute, trapped gas at positive temperature,” Communications in Mathematical Physics, vol. 368, no. 2. Springer, pp. 723–776, 2019.","apa":"Deuchert, A., Seiringer, R., & Yngvason, J. (2019). Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-018-3239-0","ista":"Deuchert A, Seiringer R, Yngvason J. 2019. Bose–Einstein condensation in a dilute, trapped gas at positive temperature. Communications in Mathematical Physics. 368(2), 723–776.","short":"A. Deuchert, R. Seiringer, J. Yngvason, Communications in Mathematical Physics 368 (2019) 723–776.","mla":"Deuchert, Andreas, et al. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications in Mathematical Physics, vol. 368, no. 2, Springer, 2019, pp. 723–76, doi:10.1007/s00220-018-3239-0.","chicago":"Deuchert, Andreas, Robert Seiringer, and Jakob Yngvason. “Bose–Einstein Condensation in a Dilute, Trapped Gas at Positive Temperature.” Communications in Mathematical Physics. Springer, 2019. https://doi.org/10.1007/s00220-018-3239-0."},"publication":"Communications in Mathematical Physics","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","scopus_import":"1","file":[{"checksum":"c7e9880b43ac726712c1365e9f2f73a6","date_updated":"2020-07-14T12:48:07Z","date_created":"2018-12-17T10:34:06Z","file_id":"5688","relation":"main_file","creator":"dernst","content_type":"application/pdf","file_size":893902,"access_level":"open_access","file_name":"2018_CommunMathPhys_Deuchert.pdf"}],"oa_version":"Published Version","intvolume":" 368","ddc":["530"],"title":"Bose–Einstein condensation in a dilute, trapped gas at positive temperature","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"80","issue":"2","abstract":[{"text":"We consider an interacting, dilute Bose gas trapped in a harmonic potential at a positive temperature. The system is analyzed in a combination of a thermodynamic and a Gross–Pitaevskii (GP) limit where the trap frequency ω, the temperature T, and the particle number N are related by N∼ (T/ ω) 3→ ∞ while the scattering length is so small that the interaction energy per particle around the center of the trap is of the same order of magnitude as the spectral gap in the trap. We prove that the difference between the canonical free energy of the interacting gas and the one of the noninteracting system can be obtained by minimizing the GP energy functional. We also prove Bose–Einstein condensation in the following sense: The one-particle density matrix of any approximate minimizer of the canonical free energy functional is to leading order given by that of the noninteracting gas but with the free condensate wavefunction replaced by the GP minimizer.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s00220-018-3239-0","project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"},{"grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"isi":1,"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000467796800007"]},"month":"06","volume":368,"date_created":"2018-12-11T11:44:31Z","date_updated":"2023-08-24T14:27:51Z","author":[{"last_name":"Deuchert","first_name":"Andreas","orcid":"0000-0003-3146-6746","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","full_name":"Deuchert, Andreas"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"},{"first_name":"Jakob","last_name":"Yngvason","full_name":"Yngvason, Jakob"}],"department":[{"_id":"RoSe"}],"publisher":"Springer","publication_status":"published","year":"2019","ec_funded":1,"publist_id":"7974","file_date_updated":"2020-07-14T12:48:07Z"},{"date_published":"2019-03-01T00:00:00Z","publication":"Trends in Ecology and Evolution","citation":{"mla":"Faria, Rui, et al. “Evolving Inversions.” Trends in Ecology and Evolution, vol. 34, no. 3, Elsevier, 2019, pp. 239–48, doi:10.1016/j.tree.2018.12.005.","short":"R. Faria, K. Johannesson, R.K. Butlin, A.M. Westram, Trends in Ecology and Evolution 34 (2019) 239–248.","chicago":"Faria, Rui, Kerstin Johannesson, Roger K. Butlin, and Anja M Westram. “Evolving Inversions.” Trends in Ecology and Evolution. Elsevier, 2019. https://doi.org/10.1016/j.tree.2018.12.005.","ama":"Faria R, Johannesson K, Butlin RK, Westram AM. Evolving inversions. Trends in Ecology and Evolution. 2019;34(3):239-248. doi:10.1016/j.tree.2018.12.005","ista":"Faria R, Johannesson K, Butlin RK, Westram AM. 2019. Evolving inversions. Trends in Ecology and Evolution. 34(3), 239–248.","apa":"Faria, R., Johannesson, K., Butlin, R. K., & Westram, A. M. (2019). Evolving inversions. Trends in Ecology and Evolution. Elsevier. https://doi.org/10.1016/j.tree.2018.12.005","ieee":"R. Faria, K. Johannesson, R. K. Butlin, and A. M. Westram, “Evolving inversions,” Trends in Ecology and Evolution, vol. 34, no. 3. Elsevier, pp. 239–248, 2019."},"article_type":"original","page":"239-248","day":"01","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","oa_version":"Published Version","file":[{"file_name":"2019_Trends_Evolution_Faria.pdf","access_level":"open_access","creator":"cziletti","file_size":1946795,"content_type":"application/pdf","file_id":"7245","relation":"main_file","date_updated":"2020-07-14T12:47:13Z","date_created":"2020-01-09T10:55:58Z","checksum":"ef24572d6ebcc1452c067e05410cc4a2"}],"_id":"5911","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","ddc":["570"],"title":"Evolving inversions","status":"public","intvolume":" 34","abstract":[{"text":"Empirical data suggest that inversions in many species contain genes important for intraspecific divergence and speciation, yet mechanisms of evolution remain unclear. While genes inside an inversion are tightly linked, inversions are not static but evolve separately from the rest of the genome by new mutations, recombination within arrangements, and gene flux between arrangements. Inversion polymorphisms are maintained by different processes, for example, divergent or balancing selection, or a mix of multiple processes. Moreover, the relative roles of selection, drift, mutation, and recombination will change over the lifetime of an inversion and within its area of distribution. We believe inversions are central to the evolution of many species, but we need many more data and new models to understand the complex mechanisms involved.","lang":"eng"}],"issue":"3","type":"journal_article","doi":"10.1016/j.tree.2018.12.005","language":[{"iso":"eng"}],"external_id":{"isi":["000459899000013"]},"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"isi":1,"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"month":"03","publication_identifier":{"issn":["01695347"]},"author":[{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"},{"full_name":"Johannesson, Kerstin","first_name":"Kerstin","last_name":"Johannesson"},{"first_name":"Roger K.","last_name":"Butlin","full_name":"Butlin, Roger K."},{"full_name":"Westram, Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1050-4969","first_name":"Anja M","last_name":"Westram"}],"date_created":"2019-02-03T22:59:15Z","date_updated":"2023-08-24T14:29:48Z","volume":34,"year":"2019","publication_status":"published","publisher":"Elsevier","department":[{"_id":"NiBa"}],"file_date_updated":"2020-07-14T12:47:13Z","ec_funded":1},{"publication_identifier":{"eissn":["1435-9855"]},"month":"10","project":[{"name":"Arithmetic and physics of Higgs moduli spaces","call_identifier":"FP7","_id":"25E549F4-B435-11E9-9278-68D0E5697425","grant_number":"320593"}],"isi":1,"quality_controlled":"1","oa":1,"external_id":{"isi":["000480413600002"],"arxiv":["1604.03382"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.03382"}],"language":[{"iso":"eng"}],"doi":"10.4171/JEMS/896","publist_id":"7384","ec_funded":1,"department":[{"_id":"TaHa"}],"publisher":"European Mathematical Society","publication_status":"published","year":"2019","volume":21,"date_created":"2018-12-11T11:46:29Z","date_updated":"2023-08-24T14:24:49Z","author":[{"full_name":"Hausel, Tamas","last_name":"Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mereb, Martin","id":"43D735EE-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Mereb"},{"last_name":"Wong","first_name":"Michael","full_name":"Wong, Michael"}],"scopus_import":"1","article_processing_charge":"No","day":"01","page":"2995-3052","article_type":"original","citation":{"chicago":"Hausel, Tamás, Martin Mereb, and Michael Wong. “Arithmetic and Representation Theory of Wild Character Varieties.” Journal of the European Mathematical Society. European Mathematical Society, 2019. https://doi.org/10.4171/JEMS/896.","mla":"Hausel, Tamás, et al. “Arithmetic and Representation Theory of Wild Character Varieties.” Journal of the European Mathematical Society, vol. 21, no. 10, European Mathematical Society, 2019, pp. 2995–3052, doi:10.4171/JEMS/896.","short":"T. Hausel, M. Mereb, M. Wong, Journal of the European Mathematical Society 21 (2019) 2995–3052.","ista":"Hausel T, Mereb M, Wong M. 2019. Arithmetic and representation theory of wild character varieties. Journal of the European Mathematical Society. 21(10), 2995–3052.","ieee":"T. Hausel, M. Mereb, and M. Wong, “Arithmetic and representation theory of wild character varieties,” Journal of the European Mathematical Society, vol. 21, no. 10. European Mathematical Society, pp. 2995–3052, 2019.","apa":"Hausel, T., Mereb, M., & Wong, M. (2019). Arithmetic and representation theory of wild character varieties. Journal of the European Mathematical Society. European Mathematical Society. https://doi.org/10.4171/JEMS/896","ama":"Hausel T, Mereb M, Wong M. Arithmetic and representation theory of wild character varieties. Journal of the European Mathematical Society. 2019;21(10):2995-3052. doi:10.4171/JEMS/896"},"publication":"Journal of the European Mathematical Society","date_published":"2019-10-01T00:00:00Z","type":"journal_article","issue":"10","abstract":[{"lang":"eng","text":"We count points over a finite field on wild character varieties,of Riemann surfaces for singularities with regular semisimple leading term. The new feature in our counting formulas is the appearance of characters of Yokonuma–Hecke algebras. Our result leads to the conjecture that the mixed Hodge polynomials of these character varieties agree with previously conjectured perverse Hodge polynomials of certain twisted parabolic Higgs moduli spaces, indicating the\r\npossibility of a P = W conjecture for a suitable wild Hitchin system."}],"intvolume":" 21","title":"Arithmetic and representation theory of wild character varieties","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"439","oa_version":"Preprint"},{"date_published":"2019-01-01T00:00:00Z","page":"161-166","article_type":"original","citation":{"ama":"Marsh A, Novarino G, Lockhart P, Leventer R. CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics. 2019;27:161-166. doi:10.1038/s41431-018-0231-2","apa":"Marsh, A., Novarino, G., Lockhart, P., & Leventer, R. (2019). CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics. Springer Nature. https://doi.org/10.1038/s41431-018-0231-2","ieee":"A. Marsh, G. Novarino, P. Lockhart, and R. Leventer, “CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63,” European Journal of Human Genetics, vol. 27. Springer Nature, pp. 161–166, 2019.","ista":"Marsh A, Novarino G, Lockhart P, Leventer R. 2019. CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63. European Journal of Human Genetics. 27, 161–166.","short":"A. Marsh, G. Novarino, P. Lockhart, R. Leventer, European Journal of Human Genetics 27 (2019) 161–166.","mla":"Marsh, Ashley, et al. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” European Journal of Human Genetics, vol. 27, Springer Nature, 2019, pp. 161–66, doi:10.1038/s41431-018-0231-2.","chicago":"Marsh, Ashley, Gaia Novarino, Paul Lockhart, and Richard Leventer. “CUGC for Pontocerebellar Hypoplasia Type 9 and Spastic Paraplegia-63.” European Journal of Human Genetics. Springer Nature, 2019. https://doi.org/10.1038/s41431-018-0231-2."},"publication":"European Journal of Human Genetics","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Published Version","intvolume":" 27","status":"public","title":"CUGC for pontocerebellar hypoplasia type 9 and spastic paraplegia-63","_id":"105","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"text":"Clinical Utility Gene Card. 1. Name of Disease (Synonyms): Pontocerebellar hypoplasia type 9 (PCH9) and spastic paraplegia-63 (SPG63). 2. OMIM# of the Disease: 615809 and 615686. 3. Name of the Analysed Genes or DNA/Chromosome Segments: AMPD2 at 1p13.3. 4. OMIM# of the Gene(s): 102771.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1038/s41431-018-0231-2","quality_controlled":"1","isi":1,"main_file_link":[{"url":"https://doi.org/10.1038/s41431-018-0231-2","open_access":"1"}],"oa":1,"external_id":{"pmid":["30089829"],"isi":["000454111500019"]},"month":"01","volume":27,"date_updated":"2023-08-24T14:28:24Z","date_created":"2018-12-11T11:44:39Z","author":[{"full_name":"Marsh, Ashley","first_name":"Ashley","last_name":"Marsh"},{"full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia"},{"first_name":"Paul","last_name":"Lockhart","full_name":"Lockhart, Paul"},{"last_name":"Leventer","first_name":"Richard","full_name":"Leventer, Richard"}],"department":[{"_id":"GaNo"}],"publisher":"Springer Nature","publication_status":"published","pmid":1,"acknowledgement":"This work was supported by EuroGentest2 (Unit 2: “Genetic testing as part of health care”), a Coordination Action under FP7 (Grant Agreement Number 261469) and the European Society of Human Genetics. We acknowledge the participation of the patients and their families in these studies, as well as the generous financial support of the Lefroy and Handbury families. APLM was supported by an Australian Postgraduate Award. PJL is supported by an NHMRC Career Development Fellowship (GNT1032364). RJL is supported by a Melbourne Children’s Clinician Scientist Fellowship.","year":"2019","publist_id":"7949"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"65","intvolume":" 266","status":"public","title":"Entropy solutions for stochastic porous media equations","oa_version":"Preprint","type":"journal_article","issue":"6","abstract":[{"text":"We provide an entropy formulation for porous medium-type equations with a stochastic, non-linear, spatially inhomogeneous forcing. Well-posedness and L1-contraction is obtained in the class of entropy solutions. Our scope allows for porous medium operators Δ(|u|m−1u) for all m∈(1,∞), and Hölder continuous diffusion nonlinearity with exponent 1/2.","lang":"eng"}],"citation":{"ama":"Dareiotis K, Gerencser M, Gess B. Entropy solutions for stochastic porous media equations. Journal of Differential Equations. 2019;266(6):3732-3763. doi:10.1016/j.jde.2018.09.012","ieee":"K. Dareiotis, M. Gerencser, and B. Gess, “Entropy solutions for stochastic porous media equations,” Journal of Differential Equations, vol. 266, no. 6. Elsevier, pp. 3732–3763, 2019.","apa":"Dareiotis, K., Gerencser, M., & Gess, B. (2019). Entropy solutions for stochastic porous media equations. Journal of Differential Equations. Elsevier. https://doi.org/10.1016/j.jde.2018.09.012","ista":"Dareiotis K, Gerencser M, Gess B. 2019. Entropy solutions for stochastic porous media equations. Journal of Differential Equations. 266(6), 3732–3763.","short":"K. Dareiotis, M. Gerencser, B. Gess, Journal of Differential Equations 266 (2019) 3732–3763.","mla":"Dareiotis, Konstantinos, et al. “Entropy Solutions for Stochastic Porous Media Equations.” Journal of Differential Equations, vol. 266, no. 6, Elsevier, 2019, pp. 3732–63, doi:10.1016/j.jde.2018.09.012.","chicago":"Dareiotis, Konstantinos, Mate Gerencser, and Benjamin Gess. “Entropy Solutions for Stochastic Porous Media Equations.” Journal of Differential Equations. Elsevier, 2019. https://doi.org/10.1016/j.jde.2018.09.012."},"publication":"Journal of Differential Equations","page":"3732-3763","article_type":"original","date_published":"2019-03-05T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"5","year":"2019","publisher":"Elsevier","department":[{"_id":"JaMa"}],"publication_status":"published","author":[{"full_name":"Dareiotis, Konstantinos","last_name":"Dareiotis","first_name":"Konstantinos"},{"full_name":"Gerencser, Mate","last_name":"Gerencser","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Gess, Benjamin","last_name":"Gess","first_name":"Benjamin"}],"volume":266,"date_updated":"2023-08-24T14:30:16Z","date_created":"2018-12-11T11:44:26Z","publist_id":"7989","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1803.06953","open_access":"1"}],"external_id":{"arxiv":["1803.06953"],"isi":["000456332500026"]},"quality_controlled":"1","isi":1,"doi":"10.1016/j.jde.2018.09.012","language":[{"iso":"eng"}],"month":"03"},{"volume":9,"date_updated":"2023-08-24T14:33:16Z","date_created":"2019-02-03T22:59:13Z","author":[{"first_name":"Réka","last_name":"Mócsai","full_name":"Mócsai, Réka"},{"full_name":"Figl, Rudolf","first_name":"Rudolf","last_name":"Figl"},{"first_name":"Clemens","last_name":"Troschl","full_name":"Troschl, Clemens"},{"full_name":"Strasser, Richard","last_name":"Strasser","first_name":"Richard"},{"last_name":"Svehla","first_name":"Elisabeth","full_name":"Svehla, Elisabeth"},{"full_name":"Windwarder, Markus","first_name":"Markus","last_name":"Windwarder"},{"full_name":"Thader, Andreas","first_name":"Andreas","last_name":"Thader","id":"3A18A7B8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Altmann, Friedrich","last_name":"Altmann","first_name":"Friedrich"}],"publisher":"Nature Publishing Group","department":[{"_id":"FlSc"}],"publication_status":"published","year":"2019","file_date_updated":"2020-07-14T12:47:13Z","article_number":"331","language":[{"iso":"eng"}],"doi":"10.1038/s41598-018-36884-1","quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000456392400012"]},"month":"01","file":[{"creator":"dernst","file_size":2124292,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_ScientificReports_Mocsai.pdf","checksum":"4129c7d7663d1f8a1edf8c4232372f66","date_created":"2019-02-05T13:10:02Z","date_updated":"2020-07-14T12:47:13Z","file_id":"5923","relation":"main_file"}],"oa_version":"Published Version","intvolume":" 9","title":"N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic type but highly methylated","ddc":["580"],"status":"public","_id":"5907","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","issue":"1","abstract":[{"lang":"eng","text":"Microalgae of the genus Chlorella vulgaris are candidates for the production of lipids for biofuel production. Besides that, Chlorella vulgaris is marketed as protein and vitamin rich food additive. Its potential as a novel expression system for recombinant proteins inspired us to study its asparagine-linked oligosaccharides (N-glycans) by mass spectrometry, chromatography and gas chromatography. Oligomannosidic N-glycans with up to nine mannoses were the structures found in culture collection strains as well as several commercial products. These glycans co-eluted with plant N-glycans in the highly shape selective porous graphitic carbon chromatography. Thus, Chlorella vulgaris generates oligomannosidic N-glycans of the structural type known from land plants and animals. In fact, Man5 (Man5GlcNAc2) served as substrate for GlcNAc-transferase I and a trace of an endogenous structure with terminal GlcNAc was seen. The unusual more linear Man5 structure recently found on glycoproteins of Chlamydomonas reinhardtii occurred - if at all - in traces only. Notably, a majority of the oligomannosidic glycans was multiply O-methylated with 3-O-methyl and 3,6-di-O-methyl mannoses at the non-reducing termini. This modification has so far been neither found on plant nor vertebrate N-glycans. It’s possible immunogenicity raises concerns as to the use of C. vulgaris for production of pharmaceutical glycoproteins."}],"type":"journal_article","date_published":"2019-01-23T00:00:00Z","citation":{"ista":"Mócsai R, Figl R, Troschl C, Strasser R, Svehla E, Windwarder M, Thader A, Altmann F. 2019. N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic type but highly methylated. Scientific Reports. 9(1), 331.","ieee":"R. Mócsai et al., “N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic type but highly methylated,” Scientific Reports, vol. 9, no. 1. Nature Publishing Group, 2019.","apa":"Mócsai, R., Figl, R., Troschl, C., Strasser, R., Svehla, E., Windwarder, M., … Altmann, F. (2019). N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic type but highly methylated. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-018-36884-1","ama":"Mócsai R, Figl R, Troschl C, et al. N-glycans of the microalga Chlorella vulgaris are of the oligomannosidic type but highly methylated. Scientific Reports. 2019;9(1). doi:10.1038/s41598-018-36884-1","chicago":"Mócsai, Réka, Rudolf Figl, Clemens Troschl, Richard Strasser, Elisabeth Svehla, Markus Windwarder, Andreas Thader, and Friedrich Altmann. “N-Glycans of the Microalga Chlorella Vulgaris Are of the Oligomannosidic Type but Highly Methylated.” Scientific Reports. Nature Publishing Group, 2019. https://doi.org/10.1038/s41598-018-36884-1.","mla":"Mócsai, Réka, et al. “N-Glycans of the Microalga Chlorella Vulgaris Are of the Oligomannosidic Type but Highly Methylated.” Scientific Reports, vol. 9, no. 1, 331, Nature Publishing Group, 2019, doi:10.1038/s41598-018-36884-1.","short":"R. Mócsai, R. Figl, C. Troschl, R. Strasser, E. Svehla, M. Windwarder, A. Thader, F. Altmann, Scientific Reports 9 (2019)."},"publication":"Scientific Reports","has_accepted_license":"1","article_processing_charge":"No","day":"23","scopus_import":"1"},{"department":[{"_id":"JiFr"}],"publisher":"National Academy of Sciences","publication_status":"published","pmid":1,"year":"2019","volume":116,"date_created":"2019-02-03T22:59:14Z","date_updated":"2023-08-24T14:31:09Z","author":[{"full_name":"Lee, Eunkyoung","last_name":"Lee","first_name":"Eunkyoung"},{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"full_name":"Pérez-Sancho, Jessica","last_name":"Pérez-Sancho","first_name":"Jessica"},{"full_name":"Benitez-Fuente, Francisco","last_name":"Benitez-Fuente","first_name":"Francisco"},{"first_name":"Matthew","last_name":"Strelau","full_name":"Strelau, Matthew"},{"first_name":"Alberto P.","last_name":"Macho","full_name":"Macho, Alberto P."},{"full_name":"Botella, Miguel A.","last_name":"Botella","first_name":"Miguel A."},{"full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rosado, Abel","last_name":"Rosado","first_name":"Abel"}],"isi":1,"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.1073/pnas.1818099116","open_access":"1"}],"external_id":{"pmid":["30610176"],"isi":["000456336100050"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1818099116","month":"01","intvolume":" 116","title":"Ionic stress enhances ER–PM connectivity via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5908","oa_version":"Published Version","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"The interorganelle communication mediated by membrane contact sites (MCSs) is an evolutionary hallmark of eukaryotic cells. MCS connections enable the nonvesicular exchange of information between organelles and allow them to coordinate responses to changing cellular environments. In plants, the importance of MCS components in the responses to environmental stress has been widely established, but the molecular mechanisms regulating interorganelle connectivity during stress still remain opaque. In this report, we use the model plant Arabidopsis thaliana to show that ionic stress increases endoplasmic reticulum (ER)–plasma membrane (PM) connectivity by promoting the cortical expansion of synaptotagmin 1 (SYT1)-enriched ER–PM contact sites (S-EPCSs). We define differential roles for the cortical cytoskeleton in the regulation of S-EPCS dynamics and ER–PM connectivity, and we identify the accumulation of phosphatidylinositol 4,5-bisphosphate [PI(4,5)P2] at the PM as a molecular signal associated with the ER–PM connectivity changes. Our study highlights the functional conservation of EPCS components and PM phosphoinositides as modulators of ER–PM connectivity in eukaryotes, and uncovers unique aspects of the spatiotemporal regulation of ER–PM connectivity in plants."}],"page":"1420-1429","article_type":"original","citation":{"ista":"Lee E, Vanneste S, Pérez-Sancho J, Benitez-Fuente F, Strelau M, Macho AP, Botella MA, Friml J, Rosado A. 2019. Ionic stress enhances ER–PM connectivity via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis. Proceedings of the National Academy of Sciences of the United States of America. 116(4), 1420–1429.","apa":"Lee, E., Vanneste, S., Pérez-Sancho, J., Benitez-Fuente, F., Strelau, M., Macho, A. P., … Rosado, A. (2019). Ionic stress enhances ER–PM connectivity via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis. Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences. https://doi.org/10.1073/pnas.1818099116","ieee":"E. Lee et al., “Ionic stress enhances ER–PM connectivity via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis,” Proceedings of the National Academy of Sciences of the United States of America, vol. 116, no. 4. National Academy of Sciences, pp. 1420–1429, 2019.","ama":"Lee E, Vanneste S, Pérez-Sancho J, et al. Ionic stress enhances ER–PM connectivity via phosphoinositide-associated SYT1 contact site expansion in Arabidopsis. Proceedings of the National Academy of Sciences of the United States of America. 2019;116(4):1420-1429. doi:10.1073/pnas.1818099116","chicago":"Lee, Eunkyoung, Steffen Vanneste, Jessica Pérez-Sancho, Francisco Benitez-Fuente, Matthew Strelau, Alberto P. Macho, Miguel A. Botella, Jiří Friml, and Abel Rosado. “Ionic Stress Enhances ER–PM Connectivity via Phosphoinositide-Associated SYT1 Contact Site Expansion in Arabidopsis.” Proceedings of the National Academy of Sciences of the United States of America. National Academy of Sciences, 2019. https://doi.org/10.1073/pnas.1818099116.","mla":"Lee, Eunkyoung, et al. “Ionic Stress Enhances ER–PM Connectivity via Phosphoinositide-Associated SYT1 Contact Site Expansion in Arabidopsis.” Proceedings of the National Academy of Sciences of the United States of America, vol. 116, no. 4, National Academy of Sciences, 2019, pp. 1420–29, doi:10.1073/pnas.1818099116.","short":"E. Lee, S. Vanneste, J. Pérez-Sancho, F. Benitez-Fuente, M. Strelau, A.P. Macho, M.A. Botella, J. Friml, A. Rosado, Proceedings of the National Academy of Sciences of the United States of America 116 (2019) 1420–1429."},"publication":"Proceedings of the National Academy of Sciences of the United States of America","date_published":"2019-01-22T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"22"},{"date_created":"2018-12-16T22:59:20Z","date_updated":"2023-08-24T14:34:12Z","volume":166,"author":[{"first_name":"Christophe","last_name":"Andalo","full_name":"Andalo, Christophe"},{"last_name":"Burrus","first_name":"Monique","full_name":"Burrus, Monique"},{"full_name":"Paute, Sandrine","last_name":"Paute","first_name":"Sandrine"},{"first_name":"Christine","last_name":"Lauzeral","full_name":"Lauzeral, Christine"},{"full_name":"Field, David","last_name":"Field","first_name":"David","orcid":"0000-0002-4014-8478","id":"419049E2-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","publisher":"Taylor and Francis","department":[{"_id":"NiBa"}],"year":"2019","language":[{"iso":"eng"}],"doi":"10.1080/23818107.2018.1545142","quality_controlled":"1","isi":1,"external_id":{"isi":["000463802800009"]},"month":"01","publication_identifier":{"eissn":["23818115"],"issn":["23818107"]},"oa_version":"None","title":"Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone","status":"public","intvolume":" 166","_id":"5680","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Pollinators display a remarkable diversity of foraging strategies with flowering plants, from primarily mutualistic interactions to cheating through nectar robbery. Despite numerous studies on the effect of nectar robbing on components of plant fitness, its contribution to reproductive isolation is unclear. We experimentally tested the impact of different pollinator strategies in a natural hybrid zone between two subspecies of Antirrhinum majus with alternate flower colour guides. On either side of a steep cline in flower colour between Antirrhinum majus pseudomajus (magenta) and A. m. striatum (yellow), we quantified the behaviour of all floral visitors at different time points during the flowering season. Using long-run camera surveys, we quantify the impact of nectar robbing on the number of flowers visited per inflorescence and the flower probing time. We further experimentally tested the effect of nectar robbing on female reproductive success by manipulating the intensity of robbing. While robbing increased over time the number of legitimate visitors tended to decrease concomitantly. We found that the number of flowers pollinated on a focal inflorescence decreased with the number of prior robbing events. However, in the manipulative experiment, fruit set and fruit volume did not vary significantly between low robbing and control treatments. Our findings challenge the idea that robbers have a negative impact on plant fitness through female function. This study also adds to our understanding of the components of pollinator-mediated reproductive isolation and the maintenance of Antirrhinum hybrid zones."}],"issue":"1","type":"journal_article","date_published":"2019-01-01T00:00:00Z","page":"80-92","publication":"Botany Letters","citation":{"short":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, D. Field, Botany Letters 166 (2019) 80–92.","mla":"Andalo, Christophe, et al. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” Botany Letters, vol. 166, no. 1, Taylor and Francis, 2019, pp. 80–92, doi:10.1080/23818107.2018.1545142.","chicago":"Andalo, Christophe, Monique Burrus, Sandrine Paute, Christine Lauzeral, and David Field. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” Botany Letters. Taylor and Francis, 2019. https://doi.org/10.1080/23818107.2018.1545142.","ama":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. 2019;166(1):80-92. doi:10.1080/23818107.2018.1545142","ieee":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, and D. Field, “Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone,” Botany Letters, vol. 166, no. 1. Taylor and Francis, pp. 80–92, 2019.","apa":"Andalo, C., Burrus, M., Paute, S., Lauzeral, C., & Field, D. (2019). Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. Taylor and Francis. https://doi.org/10.1080/23818107.2018.1545142","ista":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. 2019. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. 166(1), 80–92."},"day":"01","article_processing_charge":"No","scopus_import":"1"},{"language":[{"iso":"eng"}],"doi":"10.1002/jgt.22436","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2399"}],"oa":1,"external_id":{"isi":["000485392800004"],"arxiv":["1309.2399"]},"publication_identifier":{"issn":["03649024"]},"month":"08","volume":91,"date_created":"2018-12-30T22:59:15Z","date_updated":"2023-08-24T14:30:43Z","author":[{"full_name":"Chaplick, Steven","first_name":"Steven","last_name":"Chaplick"},{"orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav","full_name":"Fulek, Radoslav"},{"full_name":"Klavík, Pavel","last_name":"Klavík","first_name":"Pavel"}],"publisher":"Wiley","department":[{"_id":"UlWa"}],"publication_status":"published","year":"2019","ec_funded":1,"date_published":"2019-08-01T00:00:00Z","page":"365-394","article_type":"original","citation":{"ama":"Chaplick S, Fulek R, Klavík P. Extending partial representations of circle graphs. Journal of Graph Theory. 2019;91(4):365-394. doi:10.1002/jgt.22436","ista":"Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of circle graphs. Journal of Graph Theory. 91(4), 365–394.","ieee":"S. Chaplick, R. Fulek, and P. Klavík, “Extending partial representations of circle graphs,” Journal of Graph Theory, vol. 91, no. 4. Wiley, pp. 365–394, 2019.","apa":"Chaplick, S., Fulek, R., & Klavík, P. (2019). Extending partial representations of circle graphs. Journal of Graph Theory. Wiley. https://doi.org/10.1002/jgt.22436","mla":"Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.” Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.","short":"S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.","chicago":"Chaplick, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial Representations of Circle Graphs.” Journal of Graph Theory. Wiley, 2019. https://doi.org/10.1002/jgt.22436."},"publication":"Journal of Graph Theory","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","intvolume":" 91","status":"public","title":"Extending partial representations of circle graphs","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5790","issue":"4","abstract":[{"lang":"eng","text":"The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some predrawn chords that represent an induced subgraph of G. The question is whether one can extend R′ to a representation R of the entire graph G, that is, whether one can draw the remaining chords into a partially predrawn representation to obtain a representation of G. Our main result is an O(n3) time algorithm for partial representation extension of circle graphs, where n is the number of vertices. To show this, we describe the structure of all representations of a circle graph using split decomposition. This can be of independent interest."}],"type":"journal_article"},{"month":"09","oa":1,"external_id":{"arxiv":["1712.05324"],"isi":["000470955300005"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1712.05324"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"quality_controlled":"1","isi":1,"doi":"10.1016/j.laa.2018.03.002","language":[{"iso":"eng"}],"publist_id":"7424","ec_funded":1,"year":"2019","acknowledgement":"The author was supported by the ISTFELLOW program of the Institute of Science and Technology Austria (project code IC1027FELL01) and partially supported by the Hungarian National Research, Development and Innovation Office – NKFIH (grant no. K124152)","department":[{"_id":"LaEr"}],"publisher":"Elsevier","publication_status":"published","author":[{"full_name":"Virosztek, Daniel","last_name":"Virosztek","first_name":"Daniel","orcid":"0000-0003-1109-5511","id":"48DB45DA-F248-11E8-B48F-1D18A9856A87"}],"volume":576,"date_created":"2018-12-11T11:46:17Z","date_updated":"2023-08-24T14:31:47Z","scopus_import":"1","article_processing_charge":"No","day":"01","citation":{"ama":"Virosztek D. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 2019;576:67-78. doi:10.1016/j.laa.2018.03.002","apa":"Virosztek, D. (2019). Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. Elsevier. https://doi.org/10.1016/j.laa.2018.03.002","ieee":"D. Virosztek, “Jointly convex quantum Jensen divergences,” Linear Algebra and Its Applications, vol. 576. Elsevier, pp. 67–78, 2019.","ista":"Virosztek D. 2019. Jointly convex quantum Jensen divergences. Linear Algebra and Its Applications. 576, 67–78.","short":"D. Virosztek, Linear Algebra and Its Applications 576 (2019) 67–78.","mla":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra and Its Applications, vol. 576, Elsevier, 2019, pp. 67–78, doi:10.1016/j.laa.2018.03.002.","chicago":"Virosztek, Daniel. “Jointly Convex Quantum Jensen Divergences.” Linear Algebra and Its Applications. Elsevier, 2019. https://doi.org/10.1016/j.laa.2018.03.002."},"publication":"Linear Algebra and Its Applications","page":"67-78","article_type":"original","date_published":"2019-09-01T00:00:00Z","type":"journal_article","abstract":[{"text":"We investigate the quantum Jensen divergences from the viewpoint of joint convexity. It turns out that the set of the functions which generate jointly convex quantum Jensen divergences on positive matrices coincides with the Matrix Entropy Class which has been introduced by Chen and Tropp quite recently.","lang":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"405","intvolume":" 576","title":"Jointly convex quantum Jensen divergences","status":"public","oa_version":"Preprint"},{"intvolume":" 371","title":"Sieving rational points on varieties","status":"public","_id":"175","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","type":"journal_article","issue":"8","abstract":[{"text":"An upper bound sieve for rational points on suitable varieties isdeveloped, together with applications tocounting rational points in thin sets,to local solubility in families, and to the notion of “friable” rational pointswith respect to divisors. In the special case of quadrics, sharper estimates areobtained by developing a version of the Selberg sieve for rational points.","lang":"eng"}],"page":"5757-5785","citation":{"ama":"Browning TD, Loughran D. Sieving rational points on varieties. Transactions of the American Mathematical Society. 2019;371(8):5757-5785. doi:10.1090/tran/7514","ista":"Browning TD, Loughran D. 2019. Sieving rational points on varieties. Transactions of the American Mathematical Society. 371(8), 5757–5785.","apa":"Browning, T. D., & Loughran, D. (2019). Sieving rational points on varieties. Transactions of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/tran/7514","ieee":"T. D. Browning and D. Loughran, “Sieving rational points on varieties,” Transactions of the American Mathematical Society, vol. 371, no. 8. American Mathematical Society, pp. 5757–5785, 2019.","mla":"Browning, Timothy D., and Daniel Loughran. “Sieving Rational Points on Varieties.” Transactions of the American Mathematical Society, vol. 371, no. 8, American Mathematical Society, 2019, pp. 5757–85, doi:10.1090/tran/7514.","short":"T.D. Browning, D. Loughran, Transactions of the American Mathematical Society 371 (2019) 5757–5785.","chicago":"Browning, Timothy D, and Daniel Loughran. “Sieving Rational Points on Varieties.” Transactions of the American Mathematical Society. American Mathematical Society, 2019. https://doi.org/10.1090/tran/7514."},"publication":"Transactions of the American Mathematical Society","date_published":"2019-04-15T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"15","department":[{"_id":"TiBr"}],"publisher":"American Mathematical Society","publication_status":"published","year":"2019","volume":371,"date_created":"2018-12-11T11:45:01Z","date_updated":"2023-08-24T14:34:56Z","author":[{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D","full_name":"Browning, Timothy D"},{"full_name":"Loughran, Daniel","last_name":"Loughran","first_name":"Daniel"}],"publist_id":"7746","isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.01999"}],"external_id":{"arxiv":["1705.01999"],"isi":["000464034200019"]},"language":[{"iso":"eng"}],"doi":"10.1090/tran/7514","publication_identifier":{"issn":["00029947"],"eissn":["10886850"]},"month":"04"},{"page":"697–758","article_type":"original","citation":{"short":"M. Gerencser, M. Hairer, Probability Theory and Related Fields 173 (2019) 697–758.","mla":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields, vol. 173, no. 3–4, Springer, 2019, pp. 697–758, doi:10.1007/s00440-018-0841-1.","chicago":"Gerencser, Mate, and Martin Hairer. “Singular SPDEs in Domains with Boundaries.” Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0841-1.","ama":"Gerencser M, Hairer M. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 2019;173(3-4):697–758. doi:10.1007/s00440-018-0841-1","ieee":"M. Gerencser and M. Hairer, “Singular SPDEs in domains with boundaries,” Probability Theory and Related Fields, vol. 173, no. 3–4. Springer, pp. 697–758, 2019.","apa":"Gerencser, M., & Hairer, M. (2019). Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0841-1","ista":"Gerencser M, Hairer M. 2019. Singular SPDEs in domains with boundaries. Probability Theory and Related Fields. 173(3–4), 697–758."},"publication":"Probability Theory and Related Fields","date_published":"2019-04-01T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","intvolume":" 173","ddc":["510"],"title":"Singular SPDEs in domains with boundaries","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"319","oa_version":"Published Version","file":[{"creator":"dernst","file_size":893182,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_ProbTheory_Gerencser.pdf","checksum":"288d16ef7291242f485a9660979486e3","date_created":"2018-12-17T16:25:24Z","date_updated":"2020-07-14T12:46:03Z","file_id":"5722","relation":"main_file"}],"type":"journal_article","issue":"3-4","abstract":[{"lang":"eng","text":"We study spaces of modelled distributions with singular behaviour near the boundary of a domain that, in the context of the theory of regularity structures, allow one to give robust solution theories for singular stochastic PDEs with boundary conditions. The calculus of modelled distributions established in Hairer (Invent Math 198(2):269–504, 2014. https://doi.org/10.1007/s00222-014-0505-4) is extended to this setting. We formulate and solve fixed point problems in these spaces with a class of kernels that is sufficiently large to cover in particular the Dirichlet and Neumann heat kernels. These results are then used to provide solution theories for the KPZ equation with Dirichlet and Neumann boundary conditions and for the 2D generalised parabolic Anderson model with Dirichlet boundary conditions. In the case of the KPZ equation with Neumann boundary conditions, we show that, depending on the class of mollifiers one considers, a “boundary renormalisation” takes place. In other words, there are situations in which a certain boundary condition is applied to an approximation to the KPZ equation, but the limiting process is the Hopf–Cole solution to the KPZ equation with a different boundary condition."}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000463613800001"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00440-018-0841-1","publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"month":"04","publisher":"Springer","department":[{"_id":"JaMa"}],"publication_status":"published","acknowledgement":"MG thanks the support of the LMS Postdoctoral Mobility Grant.\r\n\r\n","year":"2019","volume":173,"date_created":"2018-12-11T11:45:48Z","date_updated":"2023-08-24T14:38:32Z","author":[{"full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Gerencser","first_name":"Mate"},{"full_name":"Hairer, Martin","last_name":"Hairer","first_name":"Martin"}],"publist_id":"7546","file_date_updated":"2020-07-14T12:46:03Z"},{"publist_id":"7394","ec_funded":1,"file_date_updated":"2020-07-14T12:46:26Z","publisher":"Springer","department":[{"_id":"LaEr"}],"publication_status":"published","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).\r\n","year":"2019","volume":173,"date_created":"2018-12-11T11:46:25Z","date_updated":"2023-08-24T14:39:00Z","author":[{"full_name":"Ajanki, Oskari H","first_name":"Oskari H","last_name":"Ajanki","id":"36F2FB7E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"},{"first_name":"Torben H","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H"}],"publication_identifier":{"eissn":["14322064"],"issn":["01788051"]},"month":"02","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"quality_controlled":"1","isi":1,"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000459396500007"]},"language":[{"iso":"eng"}],"doi":"10.1007/s00440-018-0835-z","type":"journal_article","issue":"1-2","abstract":[{"text":"We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay but are otherwise of general form. The key novelty is the detailed stability analysis of the corresponding matrix valued Dyson equation whose solution is the deterministic limit of the resolvent.","lang":"eng"}],"intvolume":" 173","title":"Stability of the matrix Dyson equation and random matrices with correlations","ddc":["510"],"status":"public","_id":"429","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","file":[{"creator":"dernst","file_size":1201840,"content_type":"application/pdf","access_level":"open_access","file_name":"2018_ProbTheory_Ajanki.pdf","checksum":"f9354fa5c71f9edd17132588f0dc7d01","date_updated":"2020-07-14T12:46:26Z","date_created":"2018-12-17T16:12:08Z","file_id":"5720","relation":"main_file"}],"oa_version":"Published Version","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","day":"01","page":"293–373","article_type":"original","citation":{"short":"O.H. Ajanki, L. Erdös, T.H. Krüger, Probability Theory and Related Fields 173 (2019) 293–373.","mla":"Ajanki, Oskari H., et al. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory and Related Fields, vol. 173, no. 1–2, Springer, 2019, pp. 293–373, doi:10.1007/s00440-018-0835-z.","chicago":"Ajanki, Oskari H, László Erdös, and Torben H Krüger. “Stability of the Matrix Dyson Equation and Random Matrices with Correlations.” Probability Theory and Related Fields. Springer, 2019. https://doi.org/10.1007/s00440-018-0835-z.","ama":"Ajanki OH, Erdös L, Krüger TH. Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. 2019;173(1-2):293–373. doi:10.1007/s00440-018-0835-z","ieee":"O. H. Ajanki, L. Erdös, and T. H. Krüger, “Stability of the matrix Dyson equation and random matrices with correlations,” Probability Theory and Related Fields, vol. 173, no. 1–2. Springer, pp. 293–373, 2019.","apa":"Ajanki, O. H., Erdös, L., & Krüger, T. H. (2019). Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-018-0835-z","ista":"Ajanki OH, Erdös L, Krüger TH. 2019. Stability of the matrix Dyson equation and random matrices with correlations. Probability Theory and Related Fields. 173(1–2), 293–373."},"publication":"Probability Theory and Related Fields","date_published":"2019-02-01T00:00:00Z"},{"publication_identifier":{"isbn":["978-1-4503-6094-4 "]},"month":"01","isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1809.00896","open_access":"1"}],"external_id":{"arxiv":["1809.00896"],"isi":["000484491600019"]},"language":[{"iso":"eng"}],"doi":"10.1145/3288599.3288617","conference":{"name":"ICDCN: Conference on Distributed Computing and Networking","end_date":"2019-01-07","location":"Bangalore, India","start_date":"2019-01-04"},"publisher":"ACM","department":[{"_id":"DaAl"}],"publication_status":"published","year":"2019","date_updated":"2023-08-24T14:41:53Z","date_created":"2019-02-10T22:59:17Z","author":[{"orcid":"0000-0002-2742-4028","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Bapi","full_name":"Chatterjee, Bapi"},{"full_name":"Peri, Sathya","first_name":"Sathya","last_name":"Peri"},{"full_name":"Sa, Muktikanta","first_name":"Muktikanta","last_name":"Sa"},{"full_name":"Singhal, Nandini","first_name":"Nandini","last_name":"Singhal"}],"scopus_import":"1","article_processing_charge":"No","day":"04","page":"168-177","citation":{"ista":"Chatterjee B, Peri S, Sa M, Singhal N. 2019. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. ACM International Conference Proceeding Series. ICDCN: Conference on Distributed Computing and Networking, 168–177.","apa":"Chatterjee, B., Peri, S., Sa, M., & Singhal, N. (2019). A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In ACM International Conference Proceeding Series (pp. 168–177). Bangalore, India: ACM. https://doi.org/10.1145/3288599.3288617","ieee":"B. Chatterjee, S. Peri, M. Sa, and N. Singhal, “A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries,” in ACM International Conference Proceeding Series, Bangalore, India, 2019, pp. 168–177.","ama":"Chatterjee B, Peri S, Sa M, Singhal N. A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries. In: ACM International Conference Proceeding Series. ACM; 2019:168-177. doi:10.1145/3288599.3288617","chicago":"Chatterjee, Bapi, Sathya Peri, Muktikanta Sa, and Nandini Singhal. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” In ACM International Conference Proceeding Series, 168–77. ACM, 2019. https://doi.org/10.1145/3288599.3288617.","mla":"Chatterjee, Bapi, et al. “A Simple and Practical Concurrent Non-Blocking Unbounded Graph with Linearizable Reachability Queries.” ACM International Conference Proceeding Series, ACM, 2019, pp. 168–77, doi:10.1145/3288599.3288617.","short":"B. Chatterjee, S. Peri, M. Sa, N. Singhal, in:, ACM International Conference Proceeding Series, ACM, 2019, pp. 168–177."},"publication":"ACM International Conference Proceeding Series","date_published":"2019-01-04T00:00:00Z","type":"conference","abstract":[{"text":"Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications - addition and removal of vertices and/or edges - in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a concurrent graph. The reachability queries in our algorithm are obstruction-free and thus impose minimal additional synchronization cost over other operations. We prove that each of the data structure operations are linearizable. We extensively evaluate a sample C/C++ implementation of the algorithm through a number of micro-benchmarks. The experimental results show that the proposed algorithm scales well with the number of threads and on an average provides 5 to 7x performance improvement over a concurrent graph implementation using coarse-grained locking.","lang":"eng"}],"status":"public","title":"A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries","_id":"5947","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint"},{"author":[{"full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek"},{"full_name":"Pach, János","last_name":"Pach","first_name":"János"}],"related_material":{"record":[{"id":"433","status":"public","relation":"earlier_version"}]},"date_created":"2019-01-20T22:59:17Z","date_updated":"2023-08-24T14:39:33Z","volume":259,"year":"2019","publication_status":"published","department":[{"_id":"UlWa"}],"publisher":"Elsevier","month":"04","publication_identifier":{"issn":["0166218X"]},"doi":"10.1016/j.dam.2018.12.025","language":[{"iso":"eng"}],"external_id":{"arxiv":["1708.08037"],"isi":["000466061100020"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.08037"}],"oa":1,"quality_controlled":"1","isi":1,"project":[{"name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281"}],"abstract":[{"text":"A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1), and that this bound is best possible for infinitely many values of n.","lang":"eng"}],"issue":"4","type":"journal_article","oa_version":"Preprint","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5857","status":"public","title":"Thrackles: An improved upper bound","intvolume":" 259","day":"30","article_processing_charge":"No","scopus_import":"1","date_published":"2019-04-30T00:00:00Z","publication":"Discrete Applied Mathematics","citation":{"ama":"Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics. 2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025","ista":"Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.","ieee":"R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.","apa":"Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025","mla":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.","short":"R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.","chicago":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.dam.2018.12.025."},"article_type":"original","page":"266-231"},{"intvolume":" 9","ddc":["570"],"title":"Thermodynamics of duplication thresholds in synthetic protocell systems","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5944","file":[{"date_created":"2019-02-11T10:45:27Z","date_updated":"2020-07-14T12:47:13Z","checksum":"7d2322cd96ace41959909b66702d5cf4","relation":"main_file","file_id":"5951","file_size":963454,"content_type":"application/pdf","creator":"dernst","file_name":"2019_Life_Corominas.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"Understanding the thermodynamics of the duplication process is a fundamental step towards a comprehensive physical theory of biological systems. However, the immense complexity of real cells obscures the fundamental tensions between energy gradients and entropic contributions that underlie duplication. The study of synthetic, feasible systems reproducing part of the key ingredients of living entities but overcoming major sources of biological complexity is of great relevance to deepen the comprehension of the fundamental thermodynamic processes underlying life and its prevalence. In this paper an abstract—yet realistic—synthetic system made of small synthetic protocell aggregates is studied in detail. A fundamental relation between free energy and entropic gradients is derived for a general, non-equilibrium scenario, setting the thermodynamic conditions for the occurrence and prevalence of duplication phenomena. This relation sets explicitly how the energy gradients invested in creating and maintaining structural—and eventually, functional—elements of the system must always compensate the entropic gradients, whose contributions come from changes in the translational, configurational, and macrostate entropies, as well as from dissipation due to irreversible transitions. Work/energy relations are also derived, defining lower bounds on the energy required for the duplication event to take place. A specific example including real ternary emulsions is provided in order to grasp the orders of magnitude involved in the problem. It is found that the minimal work invested over the system to trigger a duplication event is around ~ 10−13J , which results, in the case of duplication of all the vesicles contained in a liter of emulsion, in an amount of energy around ~ 1kJ . Without aiming to describe a truly biological process of duplication, this theoretical contribution seeks to explicitly define and identify the key actors that participate in it."}],"citation":{"chicago":"Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in Synthetic Protocell Systems.” Life. MDPI, 2019. https://doi.org/10.3390/life9010009.","mla":"Corominas-Murtra, Bernat. “Thermodynamics of Duplication Thresholds in Synthetic Protocell Systems.” Life, vol. 9, no. 1, 9, MDPI, 2019, doi:10.3390/life9010009.","short":"B. Corominas-Murtra, Life 9 (2019).","ista":"Corominas-Murtra B. 2019. Thermodynamics of duplication thresholds in synthetic protocell systems. Life. 9(1), 9.","ieee":"B. Corominas-Murtra, “Thermodynamics of duplication thresholds in synthetic protocell systems,” Life, vol. 9, no. 1. MDPI, 2019.","apa":"Corominas-Murtra, B. (2019). Thermodynamics of duplication thresholds in synthetic protocell systems. Life. MDPI. https://doi.org/10.3390/life9010009","ama":"Corominas-Murtra B. Thermodynamics of duplication thresholds in synthetic protocell systems. Life. 2019;9(1). doi:10.3390/life9010009"},"publication":"Life","date_published":"2019-01-15T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"15","department":[{"_id":"EdHa"}],"publisher":"MDPI","publication_status":"published","year":"2019","volume":9,"date_created":"2019-02-10T22:59:15Z","date_updated":"2023-08-24T14:43:41Z","author":[{"full_name":"Corominas-Murtra, Bernat","orcid":"0000-0001-9806-5643","id":"43BE2298-F248-11E8-B48F-1D18A9856A87","last_name":"Corominas-Murtra","first_name":"Bernat"}],"article_number":"9","file_date_updated":"2020-07-14T12:47:13Z","quality_controlled":"1","isi":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000464125500001"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.3390/life9010009","publication_identifier":{"eissn":["20751729"]},"month":"01"},{"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000456718000001"]},"isi":1,"quality_controlled":"1","doi":"10.3389/fchem.2018.00655","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"eissn":["22962646"]},"year":"2019","publication_status":"published","publisher":"Frontiers Media S.A.","department":[{"_id":"JoDa"}],"author":[{"full_name":"Lindner, Marco","first_name":"Marco","last_name":"Lindner"},{"last_name":"Tresztenyak","first_name":"Aliz","full_name":"Tresztenyak, Aliz"},{"last_name":"Fülöp","first_name":"Gergö","full_name":"Fülöp, Gergö"},{"full_name":"Jahr, Wiebke","last_name":"Jahr","first_name":"Wiebke","id":"425C1CE8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Prinz","first_name":"Adrian","full_name":"Prinz, Adrian"},{"first_name":"Iris","last_name":"Prinz","full_name":"Prinz, Iris"},{"last_name":"Danzl","first_name":"Johann G","orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G"},{"full_name":"Schütz, Gerhard J.","first_name":"Gerhard J.","last_name":"Schütz"},{"first_name":"Eva","last_name":"Sevcsik","full_name":"Sevcsik, Eva"}],"date_updated":"2023-08-24T14:45:38Z","date_created":"2019-02-17T22:59:24Z","volume":6,"article_number":"655","file_date_updated":"2020-07-14T12:47:17Z","publication":"Frontiers in Chemistry","citation":{"mla":"Lindner, Marco, et al. “A Fast and Simple Contact Printing Approach to Generate 2D Protein Nanopatterns.” Frontiers in Chemistry, vol. 6, 655, Frontiers Media S.A., 2019, doi:10.3389/fchem.2018.00655.","short":"M. Lindner, A. Tresztenyak, G. Fülöp, W. Jahr, A. Prinz, I. Prinz, J.G. Danzl, G.J. Schütz, E. Sevcsik, Frontiers in Chemistry 6 (2019).","chicago":"Lindner, Marco, Aliz Tresztenyak, Gergö Fülöp, Wiebke Jahr, Adrian Prinz, Iris Prinz, Johann G Danzl, Gerhard J. Schütz, and Eva Sevcsik. “A Fast and Simple Contact Printing Approach to Generate 2D Protein Nanopatterns.” Frontiers in Chemistry. Frontiers Media S.A., 2019. https://doi.org/10.3389/fchem.2018.00655.","ama":"Lindner M, Tresztenyak A, Fülöp G, et al. A fast and simple contact printing approach to generate 2D protein nanopatterns. Frontiers in Chemistry. 2019;6. doi:10.3389/fchem.2018.00655","ista":"Lindner M, Tresztenyak A, Fülöp G, Jahr W, Prinz A, Prinz I, Danzl JG, Schütz GJ, Sevcsik E. 2019. A fast and simple contact printing approach to generate 2D protein nanopatterns. Frontiers in Chemistry. 6, 655.","ieee":"M. Lindner et al., “A fast and simple contact printing approach to generate 2D protein nanopatterns,” Frontiers in Chemistry, vol. 6. Frontiers Media S.A., 2019.","apa":"Lindner, M., Tresztenyak, A., Fülöp, G., Jahr, W., Prinz, A., Prinz, I., … Sevcsik, E. (2019). A fast and simple contact printing approach to generate 2D protein nanopatterns. Frontiers in Chemistry. Frontiers Media S.A. https://doi.org/10.3389/fchem.2018.00655"},"date_published":"2019-01-24T00:00:00Z","scopus_import":"1","day":"24","article_processing_charge":"No","has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6029","ddc":["540"],"title":"A fast and simple contact printing approach to generate 2D protein nanopatterns","status":"public","intvolume":" 6","file":[{"date_created":"2019-02-18T15:10:34Z","date_updated":"2020-07-14T12:47:17Z","checksum":"7841301d7c53b56ef873791b4b6f7b24","relation":"main_file","file_id":"6039","content_type":"application/pdf","file_size":1766820,"creator":"dernst","file_name":"2019_frontiers_Lindner.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Protein micropatterning has become an important tool for many biomedical applications as well as in academic research. Current techniques that allow to reduce the feature size of patterns below 1 μm are, however, often costly and require sophisticated equipment. We present here a straightforward and convenient method to generate highly condensed nanopatterns of proteins without the need for clean room facilities or expensive equipment. Our approach is based on nanocontact printing and allows for the fabrication of protein patterns with feature sizes of 80 nm and periodicities down to 140 nm. This was made possible by the use of the material X-poly(dimethylsiloxane) (X-PDMS) in a two-layer stamp layout for protein printing. In a proof of principle, different proteins at various scales were printed and the pattern quality was evaluated by atomic force microscopy (AFM) and super-resolution fluorescence microscopy.","lang":"eng"}]},{"author":[{"last_name":"Gerencser","first_name":"Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87","full_name":"Gerencser, Mate"},{"first_name":"Martin","last_name":"Hairer","full_name":"Hairer, Martin"}],"volume":72,"date_updated":"2023-08-24T14:44:31Z","date_created":"2019-02-17T22:59:24Z","year":"2019","department":[{"_id":"JaMa"}],"publisher":"Wiley","publication_status":"published","file_date_updated":"2020-07-14T12:47:17Z","doi":"10.1002/cpa.21816","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"external_id":{"isi":["000475465000003"]},"isi":1,"quality_controlled":"1","month":"02","oa_version":"Published Version","file":[{"access_level":"open_access","file_name":"2019_Wiley_Gerencser.pdf","file_size":381350,"content_type":"application/pdf","creator":"kschuh","relation":"main_file","file_id":"7237","checksum":"09aec427eb48c0f96a1cce9ff53f013b","date_created":"2020-01-07T13:25:55Z","date_updated":"2020-07-14T12:47:17Z"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6028","intvolume":" 72","status":"public","title":"A solution theory for quasilinear singular SPDEs","ddc":["500"],"issue":"9","abstract":[{"text":"We give a construction allowing us to build local renormalized solutions to general quasilinear stochastic PDEs within the theory of regularity structures, thus greatly generalizing the recent results of [1, 5, 11]. Loosely speaking, our construction covers quasilinear variants of all classes of equations for which the general construction of [3, 4, 7] applies, including in particular one‐dimensional systems with KPZ‐type nonlinearities driven by space‐time white noise. In a less singular and more specific case, we furthermore show that the counterterms introduced by the renormalization procedure are given by local functionals of the solution. The main feature of our construction is that it allows exploitation of a number of existing results developed for the semilinear case, so that the number of additional arguments it requires is relatively small.","lang":"eng"}],"type":"journal_article","date_published":"2019-02-08T00:00:00Z","citation":{"ama":"Gerencser M, Hairer M. A solution theory for quasilinear singular SPDEs. Communications on Pure and Applied Mathematics. 2019;72(9):1983-2005. doi:10.1002/cpa.21816","ista":"Gerencser M, Hairer M. 2019. A solution theory for quasilinear singular SPDEs. Communications on Pure and Applied Mathematics. 72(9), 1983–2005.","ieee":"M. Gerencser and M. Hairer, “A solution theory for quasilinear singular SPDEs,” Communications on Pure and Applied Mathematics, vol. 72, no. 9. Wiley, pp. 1983–2005, 2019.","apa":"Gerencser, M., & Hairer, M. (2019). A solution theory for quasilinear singular SPDEs. Communications on Pure and Applied Mathematics. Wiley. https://doi.org/10.1002/cpa.21816","mla":"Gerencser, Mate, and Martin Hairer. “A Solution Theory for Quasilinear Singular SPDEs.” Communications on Pure and Applied Mathematics, vol. 72, no. 9, Wiley, 2019, pp. 1983–2005, doi:10.1002/cpa.21816.","short":"M. Gerencser, M. Hairer, Communications on Pure and Applied Mathematics 72 (2019) 1983–2005.","chicago":"Gerencser, Mate, and Martin Hairer. “A Solution Theory for Quasilinear Singular SPDEs.” Communications on Pure and Applied Mathematics. Wiley, 2019. https://doi.org/10.1002/cpa.21816."},"publication":"Communications on Pure and Applied Mathematics","page":"1983-2005","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"08","scopus_import":"1"},{"date_published":"2019-01-11T00:00:00Z","page":"468-490","publication":"International Conference on Verification, Model Checking, and Abstract Interpretation","citation":{"mla":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” International Conference on Verification, Model Checking, and Abstract Interpretation, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:10.1007/978-3-030-11245-5_22.","short":"H. Fu, K. Chatterjee, in:, International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490.","chicago":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” In International Conference on Verification, Model Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-11245-5_22.","ama":"Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs. In: International Conference on Verification, Model Checking, and Abstract Interpretation. Vol 11388. Springer Nature; 2019:468-490. doi:10.1007/978-3-030-11245-5_22","ista":"Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490.","apa":"Fu, H., & Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In International Conference on Verification, Model Checking, and Abstract Interpretation (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. https://doi.org/10.1007/978-3-030-11245-5_22","ieee":"H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” in International Conference on Verification, Model Checking, and Abstract Interpretation, Cascais, Portugal, 2019, vol. 11388, pp. 468–490."},"day":"11","article_processing_charge":"No","scopus_import":"1","oa_version":"Preprint","title":"Termination of nondeterministic probabilistic programs","status":"public","intvolume":" 11388","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5948","abstract":[{"lang":"eng","text":"We study the termination problem for nondeterministic probabilistic programs. We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded. First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs. For nondeterministic probabilistic programs a previous result claimed that RSMs are not complete for bounded termination, whereas our result corrects the previous flaw and establishes completeness with a rigorous proof. Second, we present the first sound approach to establish lower bounds on expected termination time through RSMs."}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"conference":{"name":"VMCAI: Verification, Model Checking, and Abstract Interpretation","end_date":"2019-01-15","location":"Cascais, Portugal","start_date":"2019-01-13"},"doi":"10.1007/978-3-030-11245-5_22","isi":1,"quality_controlled":"1","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"external_id":{"arxiv":["1701.02944"],"isi":["000931943000022"]},"main_file_link":[{"url":"https://arxiv.org/abs/1701.02944"}],"month":"01","date_created":"2019-02-10T22:59:17Z","date_updated":"2023-08-24T14:42:22Z","volume":11388,"author":[{"full_name":"Fu, Hongfei","last_name":"Fu","first_name":"Hongfei"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","year":"2019"},{"type":"journal_article","issue":"4","abstract":[{"text":"In developing organisms, spatially prescribed cell identities are thought to be determined by the expression levels of multiple genes. Quantitative tests of this idea, however, require a theoretical framework capable of exposing the rules and precision of cell specification over developmental time. We use the gap gene network in the early fly embryo as an example to show how expression levels of the four gap genes can be jointly decoded into an optimal specification of position with 1% accuracy. The decoder correctly predicts, with no free parameters, the dynamics of pair-rule expression patterns at different developmental time points and in various mutant backgrounds. Precise cellular identities are thus available at the earliest stages of development, contrasting the prevailing view of positional information being slowly refined across successive layers of the patterning network. Our results suggest that developmental enhancers closely approximate a mathematically optimal decoding strategy.","lang":"eng"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5945","intvolume":" 176","status":"public","title":"Optimal decoding of cellular identities in a genetic network","oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","day":"07","citation":{"ista":"Petkova MD, Tkačik G, Bialek W, Wieschaus EF, Gregor T. 2019. Optimal decoding of cellular identities in a genetic network. Cell. 176(4), 844–855.e15.","ieee":"M. D. Petkova, G. Tkačik, W. Bialek, E. F. Wieschaus, and T. Gregor, “Optimal decoding of cellular identities in a genetic network,” Cell, vol. 176, no. 4. Cell Press, p. 844–855.e15, 2019.","apa":"Petkova, M. D., Tkačik, G., Bialek, W., Wieschaus, E. F., & Gregor, T. (2019). Optimal decoding of cellular identities in a genetic network. Cell. Cell Press. https://doi.org/10.1016/j.cell.2019.01.007","ama":"Petkova MD, Tkačik G, Bialek W, Wieschaus EF, Gregor T. Optimal decoding of cellular identities in a genetic network. Cell. 2019;176(4):844-855.e15. doi:10.1016/j.cell.2019.01.007","chicago":"Petkova, Mariela D., Gašper Tkačik, William Bialek, Eric F. Wieschaus, and Thomas Gregor. “Optimal Decoding of Cellular Identities in a Genetic Network.” Cell. Cell Press, 2019. https://doi.org/10.1016/j.cell.2019.01.007.","mla":"Petkova, Mariela D., et al. “Optimal Decoding of Cellular Identities in a Genetic Network.” Cell, vol. 176, no. 4, Cell Press, 2019, p. 844–855.e15, doi:10.1016/j.cell.2019.01.007.","short":"M.D. Petkova, G. Tkačik, W. Bialek, E.F. Wieschaus, T. Gregor, Cell 176 (2019) 844–855.e15."},"publication":"Cell","page":"844-855.e15","article_type":"original","date_published":"2019-02-07T00:00:00Z","pmid":1,"year":"2019","department":[{"_id":"GaTk"}],"publisher":"Cell Press","publication_status":"published","related_material":{"link":[{"url":"https://ist.ac.at/en/news/cells-find-their-identity-using-a-mathematically-optimal-strategy/","relation":"press_release","description":"News on IST Homepage"}]},"author":[{"full_name":"Petkova, Mariela D.","last_name":"Petkova","first_name":"Mariela D."},{"first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"full_name":"Bialek, William","first_name":"William","last_name":"Bialek"},{"first_name":"Eric F.","last_name":"Wieschaus","full_name":"Wieschaus, Eric F."},{"full_name":"Gregor, Thomas","last_name":"Gregor","first_name":"Thomas"}],"volume":176,"date_created":"2019-02-10T22:59:16Z","date_updated":"2023-08-24T14:42:47Z","month":"02","main_file_link":[{"url":"https://doi.org/10.1016/j.cell.2019.01.007","open_access":"1"}],"external_id":{"pmid":["30712870"],"isi":["000457969200015"]},"oa":1,"project":[{"call_identifier":"FWF","name":"Biophysics of information processing in gene regulation","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"}],"isi":1,"quality_controlled":"1","doi":"10.1016/j.cell.2019.01.007","language":[{"iso":"eng"}]},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"5943","intvolume":" 863","status":"public","title":"Experiments on a jet in a crossflow in the low-velocity-ratio regime","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"The hairpin instability of a jet in a crossflow (JICF) for a low jet-to-crossflow velocity ratio is investigated experimentally for a velocity ratio range of R ∈ (0.14, 0.75) and crossflow Reynolds numbers ReD ∈ (260, 640). From spectral analysis we characterize the Strouhal number and amplitude of the hairpin instability as a function of R and ReD. We demonstrate that the dynamics of the hairpins is well described by the Landau model, and, hence, that the instability occurs through Hopf bifurcation, similarly to other hydrodynamical oscillators such as wake behind different bluff bodies. Using the Landau model, we determine the precise threshold values of hairpin shedding. We also study the spatial dependence of this hydrodynamical instability, which shows a global behaviour."}],"citation":{"ista":"Klotz L, Gumowski K, Wesfreid JE. 2019. Experiments on a jet in a crossflow in the low-velocity-ratio regime. Journal of Fluid Mechanics. 863, 386–406.","ieee":"L. Klotz, K. Gumowski, and J. E. Wesfreid, “Experiments on a jet in a crossflow in the low-velocity-ratio regime,” Journal of Fluid Mechanics, vol. 863. Cambridge University Press, pp. 386–406, 2019.","apa":"Klotz, L., Gumowski, K., & Wesfreid, J. E. (2019). Experiments on a jet in a crossflow in the low-velocity-ratio regime. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2018.974","ama":"Klotz L, Gumowski K, Wesfreid JE. Experiments on a jet in a crossflow in the low-velocity-ratio regime. Journal of Fluid Mechanics. 2019;863:386-406. doi:10.1017/jfm.2018.974","chicago":"Klotz, Lukasz, Konrad Gumowski, and José Eduardo Wesfreid. “Experiments on a Jet in a Crossflow in the Low-Velocity-Ratio Regime.” Journal of Fluid Mechanics. Cambridge University Press, 2019. https://doi.org/10.1017/jfm.2018.974.","mla":"Klotz, Lukasz, et al. “Experiments on a Jet in a Crossflow in the Low-Velocity-Ratio Regime.” Journal of Fluid Mechanics, vol. 863, Cambridge University Press, 2019, pp. 386–406, doi:10.1017/jfm.2018.974.","short":"L. Klotz, K. Gumowski, J.E. Wesfreid, Journal of Fluid Mechanics 863 (2019) 386–406."},"publication":"Journal of Fluid Mechanics","page":"386-406","article_type":"original","date_published":"2019-03-25T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"25","year":"2019","department":[{"_id":"BjHo"}],"publisher":"Cambridge University Press","publication_status":"published","author":[{"orcid":"0000-0003-1740-7635","id":"2C9AF1C2-F248-11E8-B48F-1D18A9856A87","last_name":"Klotz","first_name":"Lukasz","full_name":"Klotz, Lukasz"},{"full_name":"Gumowski, Konrad","last_name":"Gumowski","first_name":"Konrad"},{"first_name":"José Eduardo","last_name":"Wesfreid","full_name":"Wesfreid, José Eduardo"}],"volume":863,"date_created":"2019-02-10T22:59:15Z","date_updated":"2023-08-24T14:43:13Z","ec_funded":1,"oa":1,"external_id":{"arxiv":["1902.07931"],"isi":["000526029100016"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1902.07931"}],"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"doi":"10.1017/jfm.2018.974","language":[{"iso":"eng"}],"month":"03"},{"publication":"25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems ","citation":{"ama":"Christakis M, Heizmann M, Mansur MN, Schilling C, Wüstholz V. Semantic fault localization and suspiciousness ranking. In: 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems . Vol 11427. Springer Nature; 2019:226-243. doi:10.1007/978-3-030-17462-0_13","apa":"Christakis, M., Heizmann, M., Mansur, M. N., Schilling, C., & Wüstholz, V. (2019). Semantic fault localization and suspiciousness ranking. In 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 11427, pp. 226–243). Prague, Czech Republic: Springer Nature. https://doi.org/10.1007/978-3-030-17462-0_13","ieee":"M. Christakis, M. Heizmann, M. N. Mansur, C. Schilling, and V. Wüstholz, “Semantic fault localization and suspiciousness ranking,” in 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Prague, Czech Republic, 2019, vol. 11427, pp. 226–243.","ista":"Christakis M, Heizmann M, Mansur MN, Schilling C, Wüstholz V. 2019. Semantic fault localization and suspiciousness ranking. 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 11427, 226–243.","short":"M. Christakis, M. Heizmann, M.N. Mansur, C. Schilling, V. Wüstholz, in:, 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Springer Nature, 2019, pp. 226–243.","mla":"Christakis, Maria, et al. “Semantic Fault Localization and Suspiciousness Ranking.” 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , vol. 11427, Springer Nature, 2019, pp. 226–43, doi:10.1007/978-3-030-17462-0_13.","chicago":"Christakis, Maria, Matthias Heizmann, Muhammad Numair Mansur, Christian Schilling, and Valentin Wüstholz. “Semantic Fault Localization and Suspiciousness Ranking.” In 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , 11427:226–43. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-17462-0_13."},"page":"226-243","date_published":"2019-04-04T00:00:00Z","scopus_import":"1","day":"04","article_processing_charge":"No","has_accepted_license":"1","_id":"6042","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","status":"public","title":"Semantic fault localization and suspiciousness ranking","ddc":["000"],"intvolume":" 11427","file":[{"relation":"main_file","file_id":"6408","checksum":"9998496f6fe202c0a19124b4209154c6","date_created":"2019-05-10T14:16:05Z","date_updated":"2020-07-14T12:47:17Z","access_level":"open_access","file_name":"2019_LNCS_Christakis.pdf","content_type":"application/pdf","file_size":773083,"creator":"dernst"}],"oa_version":"Published Version","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Static program analyzers are increasingly effective in checking correctness properties of programs and reporting any errors found, often in the form of error traces. However, developers still spend a significant amount of time on debugging. This involves processing long error traces in an effort to localize a bug to a relatively small part of the program and to identify its cause. In this paper, we present a technique for automated fault localization that, given a program and an error trace, efficiently narrows down the cause of the error to a few statements. These statements are then ranked in terms of their suspiciousness. Our technique relies only on the semantics of the given program and does not require any test cases or user guidance. In experiments on a set of C benchmarks, we show that our technique is effective in quickly isolating the cause of error while out-performing other state-of-the-art fault-localization techniques.","lang":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000681166500013"]},"oa":1,"isi":1,"quality_controlled":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"}],"conference":{"end_date":"2019-04-11","start_date":"2019-04-06","location":"Prague, Czech Republic","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"doi":"10.1007/978-3-030-17462-0_13","language":[{"iso":"eng"}],"month":"04","year":"2019","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer Nature","author":[{"full_name":"Christakis, Maria","first_name":"Maria","last_name":"Christakis"},{"first_name":"Matthias","last_name":"Heizmann","full_name":"Heizmann, Matthias"},{"full_name":"Mansur, Muhammad Numair","last_name":"Mansur","first_name":"Muhammad Numair"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","first_name":"Christian"},{"full_name":"Wüstholz, Valentin","last_name":"Wüstholz","first_name":"Valentin"}],"date_created":"2019-02-18T16:44:06Z","date_updated":"2023-08-24T14:47:45Z","volume":11427,"file_date_updated":"2020-07-14T12:47:17Z","ec_funded":1},{"ec_funded":1,"file_date_updated":"2020-07-14T12:47:17Z","department":[{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","year":"2019","volume":22,"date_created":"2019-02-18T14:43:28Z","date_updated":"2023-08-24T14:47:21Z","author":[{"full_name":"Bogomolov, Sergiy","last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"last_name":"Potomkin","first_name":"Kostiantyn","full_name":"Potomkin, Kostiantyn"},{"full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3658-1065"}],"publication_identifier":{"isbn":["9781450362825"]},"month":"04","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"quality_controlled":"1","isi":1,"external_id":{"arxiv":["1901.10736"],"isi":["000516713900005"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/3302504.3311804","conference":{"start_date":"2019-04-16","location":"Montreal, QC, Canada","end_date":"2019-04-18","name":"HSCC: Hybrid Systems Computation and Control"},"type":"conference","abstract":[{"text":"We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of reachability algorithms for continuous and hybrid systems, and LazySets, a standalone library that implements state-of-the-art algorithms for calculus with convex sets. The library offers both concrete and lazy set representations, where the latter stands for the ability to delay set computations until they are needed. The choice of the programming language Julia and the accompanying documentation of our toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages. Combining lazy operations in high dimensions and explicit computations in low dimensions, JuliaReach can be applied to solve complex, large-scale problems.","lang":"eng"}],"intvolume":" 22","title":"JuliaReach: A toolbox for set-based reachability","ddc":["000"],"status":"public","_id":"6035","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Submitted Version","file":[{"creator":"cschilli","content_type":"application/pdf","file_size":3784414,"access_level":"open_access","file_name":"hscc19.pdf","checksum":"28ed56439aea5991c3122d4730fd828f","date_updated":"2020-07-14T12:47:17Z","date_created":"2019-03-05T09:27:18Z","file_id":"6067","relation":"main_file"}],"keyword":["reachability analysis","hybrid systems","lazy computation"],"scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"16","page":"39-44","citation":{"chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “JuliaReach: A Toolbox for Set-Based Reachability.” In Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, 22:39–44. ACM, 2019. https://doi.org/10.1145/3302504.3311804.","mla":"Bogomolov, Sergiy, et al. “JuliaReach: A Toolbox for Set-Based Reachability.” Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, vol. 22, ACM, 2019, pp. 39–44, doi:10.1145/3302504.3311804.","short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, in:, Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, ACM, 2019, pp. 39–44.","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2019. JuliaReach: A toolbox for set-based reachability. Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems Computation and Control vol. 22, 39–44.","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “JuliaReach: A toolbox for set-based reachability,” in Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control, Montreal, QC, Canada, 2019, vol. 22, pp. 39–44.","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., & Schilling, C. (2019). JuliaReach: A toolbox for set-based reachability. In Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control (Vol. 22, pp. 39–44). Montreal, QC, Canada: ACM. https://doi.org/10.1145/3302504.3311804","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. JuliaReach: A toolbox for set-based reachability. In: Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control. Vol 22. ACM; 2019:39-44. doi:10.1145/3302504.3311804"},"publication":"Proceedings of the 22nd International Conference on Hybrid Systems: Computation and Control","date_published":"2019-04-16T00:00:00Z"},{"article_type":"original","page":"832–863","publication":"Nature Protocols","citation":{"ama":"Truckenbrodt SM, Sommer CM, Rizzoli SO, Danzl JG. A practical guide to optimization in X10 expansion microscopy. Nature Protocols. 2019;14(3):832–863. doi:10.1038/s41596-018-0117-3","ista":"Truckenbrodt SM, Sommer CM, Rizzoli SO, Danzl JG. 2019. A practical guide to optimization in X10 expansion microscopy. Nature Protocols. 14(3), 832–863.","ieee":"S. M. Truckenbrodt, C. M. Sommer, S. O. Rizzoli, and J. G. Danzl, “A practical guide to optimization in X10 expansion microscopy,” Nature Protocols, vol. 14, no. 3. Nature Publishing Group, pp. 832–863, 2019.","apa":"Truckenbrodt, S. M., Sommer, C. M., Rizzoli, S. O., & Danzl, J. G. (2019). A practical guide to optimization in X10 expansion microscopy. Nature Protocols. Nature Publishing Group. https://doi.org/10.1038/s41596-018-0117-3","mla":"Truckenbrodt, Sven M., et al. “A Practical Guide to Optimization in X10 Expansion Microscopy.” Nature Protocols, vol. 14, no. 3, Nature Publishing Group, 2019, pp. 832–863, doi:10.1038/s41596-018-0117-3.","short":"S.M. Truckenbrodt, C.M. Sommer, S.O. Rizzoli, J.G. Danzl, Nature Protocols 14 (2019) 832–863.","chicago":"Truckenbrodt, Sven M, Christoph M Sommer, Silvio O Rizzoli, and Johann G Danzl. “A Practical Guide to Optimization in X10 Expansion Microscopy.” Nature Protocols. Nature Publishing Group, 2019. https://doi.org/10.1038/s41596-018-0117-3."},"date_published":"2019-03-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","has_accepted_license":"1","status":"public","title":"A practical guide to optimization in X10 expansion microscopy","ddc":["570"],"intvolume":" 14","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6052","oa_version":"Submitted Version","file":[{"success":1,"checksum":"7efb9951e7ddf3e3dcc2fb92b859c623","date_updated":"2021-06-29T14:41:46Z","date_created":"2021-06-29T14:41:46Z","file_id":"9619","relation":"main_file","creator":"kschuh","file_size":84478958,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","access_level":"open_access","file_name":"181031_Truckenbrodt_ExM_NatProtoc.docx"}],"type":"journal_article","abstract":[{"lang":"eng","text":"Expansion microscopy is a relatively new approach to super-resolution imaging that uses expandable hydrogels to isotropically increase the physical distance between fluorophores in biological samples such as cell cultures or tissue slices. The classic gel recipe results in an expansion factor of ~4×, with a resolution of 60–80 nm. We have recently developed X10 microscopy, which uses a gel that achieves an expansion factor of ~10×, with a resolution of ~25 nm. Here, we provide a step-by-step protocol for X10 expansion microscopy. A typical experiment consists of seven sequential stages: (i) immunostaining, (ii) anchoring, (iii) polymerization, (iv) homogenization, (v) expansion, (vi) imaging, and (vii) validation. The protocol presented here includes recommendations for optimization, pitfalls and their solutions, and detailed guidelines that should increase reproducibility. Although our protocol focuses on X10 expansion microscopy, we detail which of these suggestions are also applicable to classic fourfold expansion microscopy. We exemplify our protocol using primary hippocampal neurons from rats, but our approach can be used with other primary cells or cultured cell lines of interest. This protocol will enable any researcher with basic experience in immunostainings and access to an epifluorescence microscope to perform super-resolution microscopy with X10. The procedure takes 3 d and requires ~5 h of actively handling the sample for labeling and expansion, and another ~3 h for imaging and analysis."}],"issue":"3","isi":1,"quality_controlled":"1","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Optical control of synaptic function via adhesion molecules","_id":"265CB4D0-B435-11E9-9278-68D0E5697425","grant_number":"I03600"}],"external_id":{"isi":["000459890700008"],"pmid":["30778205"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/s41596-018-0117-3","month":"03","publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"JoDa"},{"_id":"Bio"}],"year":"2019","pmid":1,"date_created":"2019-02-24T22:59:20Z","date_updated":"2023-08-24T14:48:33Z","volume":14,"author":[{"full_name":"Truckenbrodt, Sven M","last_name":"Truckenbrodt","first_name":"Sven M","id":"45812BD4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Christoph M","last_name":"Sommer","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105","full_name":"Sommer, Christoph M"},{"last_name":"Rizzoli","first_name":"Silvio O","full_name":"Rizzoli, Silvio O"},{"id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","first_name":"Johann G","last_name":"Danzl","full_name":"Danzl, Johann G"}],"file_date_updated":"2021-06-29T14:41:46Z","ec_funded":1},{"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"language":[{"iso":"eng"}],"doi":"10.7554/eLife.42093","quality_controlled":"1","isi":1,"project":[{"grant_number":"742573","_id":"260F1432-B435-11E9-9278-68D0E5697425","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","call_identifier":"H2020"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000458025300001"]},"oa":1,"month":"02","date_updated":"2023-08-24T14:46:01Z","date_created":"2019-02-17T22:59:22Z","volume":8,"author":[{"first_name":"Daniel","last_name":"Capek","id":"31C42484-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-9940","full_name":"Capek, Daniel"},{"full_name":"Smutny, Michael","id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5920-9090","first_name":"Michael","last_name":"Smutny"},{"first_name":"Alexandra Madelaine","last_name":"Tichy","full_name":"Tichy, Alexandra Madelaine"},{"full_name":"Morri, Maurizio","id":"4863116E-F248-11E8-B48F-1D18A9856A87","last_name":"Morri","first_name":"Maurizio"},{"first_name":"Harald L","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8023-9315","full_name":"Janovjak, Harald L"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"publication_status":"published","department":[{"_id":"CaHe"},{"_id":"HaJa"}],"publisher":"eLife Sciences Publications","year":"2019","file_date_updated":"2020-07-14T12:47:17Z","ec_funded":1,"article_number":"e42093","date_published":"2019-02-06T00:00:00Z","publication":"eLife","citation":{"mla":"Capek, Daniel, et al. “Light-Activated Frizzled7 Reveals a Permissive Role of Non-Canonical Wnt Signaling in Mesendoderm Cell Migration.” ELife, vol. 8, e42093, eLife Sciences Publications, 2019, doi:10.7554/eLife.42093.","short":"D. Capek, M. Smutny, A.M. Tichy, M. Morri, H.L. Janovjak, C.-P.J. Heisenberg, ELife 8 (2019).","chicago":"Capek, Daniel, Michael Smutny, Alexandra Madelaine Tichy, Maurizio Morri, Harald L Janovjak, and Carl-Philipp J Heisenberg. “Light-Activated Frizzled7 Reveals a Permissive Role of Non-Canonical Wnt Signaling in Mesendoderm Cell Migration.” ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/eLife.42093.","ama":"Capek D, Smutny M, Tichy AM, Morri M, Janovjak HL, Heisenberg C-PJ. Light-activated Frizzled7 reveals a permissive role of non-canonical wnt signaling in mesendoderm cell migration. eLife. 2019;8. doi:10.7554/eLife.42093","ista":"Capek D, Smutny M, Tichy AM, Morri M, Janovjak HL, Heisenberg C-PJ. 2019. Light-activated Frizzled7 reveals a permissive role of non-canonical wnt signaling in mesendoderm cell migration. eLife. 8, e42093.","apa":"Capek, D., Smutny, M., Tichy, A. M., Morri, M., Janovjak, H. L., & Heisenberg, C.-P. J. (2019). Light-activated Frizzled7 reveals a permissive role of non-canonical wnt signaling in mesendoderm cell migration. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.42093","ieee":"D. Capek, M. Smutny, A. M. Tichy, M. Morri, H. L. Janovjak, and C.-P. J. Heisenberg, “Light-activated Frizzled7 reveals a permissive role of non-canonical wnt signaling in mesendoderm cell migration,” eLife, vol. 8. eLife Sciences Publications, 2019."},"day":"06","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1","file":[{"date_created":"2019-02-18T15:17:21Z","date_updated":"2020-07-14T12:47:17Z","checksum":"6cb4ca6d4aa96f6f187a5983aa3e660a","relation":"main_file","file_id":"6041","content_type":"application/pdf","file_size":5500707,"creator":"dernst","file_name":"2019_elife_Capek.pdf","access_level":"open_access"}],"oa_version":"Published Version","title":"Light-activated Frizzled7 reveals a permissive role of non-canonical wnt signaling in mesendoderm cell migration","ddc":["570"],"status":"public","intvolume":" 8","_id":"6025","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","abstract":[{"lang":"eng","text":"Non-canonical Wnt signaling plays a central role for coordinated cell polarization and directed migration in metazoan development. While spatiotemporally restricted activation of non-canonical Wnt-signaling drives cell polarization in epithelial tissues, it remains unclear whether such instructive activity is also critical for directed mesenchymal cell migration. Here, we developed a light-activated version of the non-canonical Wnt receptor Frizzled 7 (Fz7) to analyze how restricted activation of non-canonical Wnt signaling affects directed anterior axial mesendoderm (prechordal plate, ppl) cell migration within the zebrafish gastrula. We found that Fz7 signaling is required for ppl cell protrusion formation and migration and that spatiotemporally restricted ectopic activation is capable of redirecting their migration. Finally, we show that uniform activation of Fz7 signaling in ppl cells fully rescues defective directed cell migration in fz7 mutant embryos. Together, our findings reveal that in contrast to the situation in epithelial cells, non-canonical Wnt signaling functions permissively rather than instructively in directed mesenchymal cell migration during gastrulation."}],"type":"journal_article"},{"month":"02","external_id":{"isi":["000460317100001"]},"tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"oa":1,"quality_controlled":"1","isi":1,"doi":"10.1371/journal.pbio.2005902","language":[{"iso":"eng"}],"article_number":"e2005902","file_date_updated":"2020-07-14T12:47:17Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","year":"2019","publication_status":"published","department":[{"_id":"NiBa"}],"publisher":"Public Library of Science","author":[{"full_name":"Merrill, Richard M.","first_name":"Richard M.","last_name":"Merrill"},{"full_name":"Rastas, Pasi","last_name":"Rastas","first_name":"Pasi"},{"last_name":"Martin","first_name":"Simon H.","full_name":"Martin, Simon H."},{"full_name":"Melo Hurtado, Maria C","first_name":"Maria C","last_name":"Melo Hurtado","id":"386D7308-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Barker, Sarah","first_name":"Sarah","last_name":"Barker"},{"full_name":"Davey, John","last_name":"Davey","first_name":"John"},{"first_name":"W. Owen","last_name":"Mcmillan","full_name":"Mcmillan, W. Owen"},{"first_name":"Chris D.","last_name":"Jiggins","full_name":"Jiggins, Chris D."}],"related_material":{"record":[{"id":"9801","relation":"research_data","status":"public"}]},"date_created":"2019-02-17T22:59:21Z","date_updated":"2023-08-24T14:46:23Z","volume":17,"scopus_import":"1","day":"07","article_processing_charge":"No","has_accepted_license":"1","publication":"PLoS Biology","citation":{"apa":"Merrill, R. M., Rastas, P., Martin, S. H., Melo Hurtado, M. C., Barker, S., Davey, J., … Jiggins, C. D. (2019). Genetic dissection of assortative mating behavior. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005902","ieee":"R. M. Merrill et al., “Genetic dissection of assortative mating behavior,” PLoS Biology, vol. 17, no. 2. Public Library of Science, 2019.","ista":"Merrill RM, Rastas P, Martin SH, Melo Hurtado MC, Barker S, Davey J, Mcmillan WO, Jiggins CD. 2019. Genetic dissection of assortative mating behavior. PLoS Biology. 17(2), e2005902.","ama":"Merrill RM, Rastas P, Martin SH, et al. Genetic dissection of assortative mating behavior. PLoS Biology. 2019;17(2). doi:10.1371/journal.pbio.2005902","chicago":"Merrill, Richard M., Pasi Rastas, Simon H. Martin, Maria C Melo Hurtado, Sarah Barker, John Davey, W. Owen Mcmillan, and Chris D. Jiggins. “Genetic Dissection of Assortative Mating Behavior.” PLoS Biology. Public Library of Science, 2019. https://doi.org/10.1371/journal.pbio.2005902.","short":"R.M. Merrill, P. Rastas, S.H. Martin, M.C. Melo Hurtado, S. Barker, J. Davey, W.O. Mcmillan, C.D. Jiggins, PLoS Biology 17 (2019).","mla":"Merrill, Richard M., et al. “Genetic Dissection of Assortative Mating Behavior.” PLoS Biology, vol. 17, no. 2, e2005902, Public Library of Science, 2019, doi:10.1371/journal.pbio.2005902."},"date_published":"2019-02-07T00:00:00Z","type":"journal_article","abstract":[{"text":"The evolution of new species is made easier when traits under divergent ecological selection are also mating cues. Such ecological mating cues are now considered more common than previously thought, but we still know little about the genetic changes underlying their evolution or more generally about the genetic basis for assortative mating behaviors. Both tight physical linkage and the existence of large-effect preference loci will strengthen genetic associations between behavioral and ecological barriers, promoting the evolution of assortative mating. The warning patterns of Heliconius melpomene and H. cydno are under disruptive selection due to increased predation of nonmimetic hybrids and are used during mate recognition. We carried out a genome-wide quantitative trait locus (QTL) analysis of preference behaviors between these species and showed that divergent male preference has a simple genetic basis. We identify three QTLs that together explain a large proportion (approximately 60%) of the difference in preference behavior observed between the parental species. One of these QTLs is just 1.2 (0-4.8) centiMorgans (cM) from the major color pattern gene optix, and, individually, all three have a large effect on the preference phenotype. Genomic divergence between H. cydno and H. melpomene is high but broadly heterogenous, and admixture is reduced at the preference-optix color pattern locus but not the other preference QTLs. The simple genetic architecture we reveal will facilitate the evolution and maintenance of new species despite ongoing gene flow by coupling behavioral and ecological aspects of reproductive isolation.","lang":"eng"}],"issue":"2","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6022","ddc":["570"],"status":"public","title":"Genetic dissection of assortative mating behavior","intvolume":" 17","oa_version":"Published Version","file":[{"checksum":"5f34001617ee729314ca520c049b1112","date_created":"2019-02-18T14:57:24Z","date_updated":"2020-07-14T12:47:17Z","file_id":"6036","relation":"main_file","creator":"dernst","file_size":2005949,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_PLOS_Merrill.pdf"}]},{"issue":"2","abstract":[{"lang":"eng","text":"Multicellular development requires coordinated cell polarization relative to body axes, and translation to oriented cell division 1–3 . In plants, it is unknown how cell polarities are connected to organismal axes and translated to division. Here, we identify Arabidopsis SOSEKI proteins that integrate apical–basal and radial organismal axes to localize to polar cell edges. Localization does not depend on tissue context, requires cell wall integrity and is defined by a transferrable, protein-specific motif. A Domain of Unknown Function in SOSEKI proteins resembles the DIX oligomerization domain in the animal Dishevelled polarity regulator. The DIX-like domain self-interacts and is required for edge localization and for influencing division orientation, together with a second domain that defines the polar membrane domain. Our work shows that SOSEKI proteins locally interpret global polarity cues and can influence cell division orientation. Furthermore, this work reveals that, despite fundamental differences, cell polarity mechanisms in plants and animals converge on a similar protein domain."}],"type":"journal_article","oa_version":"Submitted Version","intvolume":" 5","title":"A SOSEKI-based coordinate system interprets global polarity cues in arabidopsis","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6023","article_processing_charge":"No","day":"08","scopus_import":"1","date_published":"2019-02-08T00:00:00Z","page":"160-166","citation":{"chicago":"Yoshida, Saiko, Alja Van Der Schuren, Maritza Van Dop, Luc Van Galen, Shunsuke Saiga, Milad Adibi, Barbara Möller, et al. “A SOSEKI-Based Coordinate System Interprets Global Polarity Cues in Arabidopsis.” Nature Plants. Springer Nature, 2019. https://doi.org/10.1038/s41477-019-0363-6.","mla":"Yoshida, Saiko, et al. “A SOSEKI-Based Coordinate System Interprets Global Polarity Cues in Arabidopsis.” Nature Plants, vol. 5, no. 2, Springer Nature, 2019, pp. 160–66, doi:10.1038/s41477-019-0363-6.","short":"S. Yoshida, A. Van Der Schuren, M. Van Dop, L. Van Galen, S. Saiga, M. Adibi, B. Möller, C.A. Ten Hove, P. Marhavý, R. Smith, J. Friml, D. Weijers, Nature Plants 5 (2019) 160–166.","ista":"Yoshida S, Van Der Schuren A, Van Dop M, Van Galen L, Saiga S, Adibi M, Möller B, Ten Hove CA, Marhavý P, Smith R, Friml J, Weijers D. 2019. A SOSEKI-based coordinate system interprets global polarity cues in arabidopsis. Nature Plants. 5(2), 160–166.","apa":"Yoshida, S., Van Der Schuren, A., Van Dop, M., Van Galen, L., Saiga, S., Adibi, M., … Weijers, D. (2019). A SOSEKI-based coordinate system interprets global polarity cues in arabidopsis. Nature Plants. Springer Nature. https://doi.org/10.1038/s41477-019-0363-6","ieee":"S. Yoshida et al., “A SOSEKI-based coordinate system interprets global polarity cues in arabidopsis,” Nature Plants, vol. 5, no. 2. Springer Nature, pp. 160–166, 2019.","ama":"Yoshida S, Van Der Schuren A, Van Dop M, et al. A SOSEKI-based coordinate system interprets global polarity cues in arabidopsis. Nature Plants. 2019;5(2):160-166. doi:10.1038/s41477-019-0363-6"},"publication":"Nature Plants","ec_funded":1,"volume":5,"date_updated":"2023-08-24T14:46:47Z","date_created":"2019-02-17T22:59:21Z","author":[{"id":"2E46069C-F248-11E8-B48F-1D18A9856A87","first_name":"Saiko","last_name":"Yoshida","full_name":"Yoshida, Saiko"},{"full_name":"Van Der Schuren, Alja","last_name":"Van Der Schuren","first_name":"Alja"},{"full_name":"Van Dop, Maritza","first_name":"Maritza","last_name":"Van Dop"},{"last_name":"Van Galen","first_name":"Luc","full_name":"Van Galen, Luc"},{"first_name":"Shunsuke","last_name":"Saiga","full_name":"Saiga, Shunsuke"},{"last_name":"Adibi","first_name":"Milad","full_name":"Adibi, Milad"},{"last_name":"Möller","first_name":"Barbara","full_name":"Möller, Barbara"},{"full_name":"Ten Hove, Colette A.","first_name":"Colette A.","last_name":"Ten Hove"},{"id":"3F45B078-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5227-5741","first_name":"Peter","last_name":"Marhavy","full_name":"Marhavy, Peter"},{"last_name":"Smith","first_name":"Richard","full_name":"Smith, Richard"},{"full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dolf","last_name":"Weijers","full_name":"Weijers, Dolf"}],"publisher":"Springer Nature","department":[{"_id":"JiFr"},{"_id":"EvBe"}],"publication_status":"published","year":"2019","month":"02","language":[{"iso":"eng"}],"doi":"10.1038/s41477-019-0363-6","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"oa":1,"external_id":{"isi":["000460479600014"]},"main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/479113v1.abstract"}]},{"author":[{"first_name":"Mahmoud","last_name":"Kalaee","full_name":"Kalaee, Mahmoud"},{"last_name":"Mirhosseini","first_name":"Mohammad","full_name":"Mirhosseini, Mohammad"},{"full_name":"Dieterle, Paul B.","first_name":"Paul B.","last_name":"Dieterle"},{"last_name":"Peruzzo","first_name":"Matilda","orcid":"0000-0002-3415-4628","id":"3F920B30-F248-11E8-B48F-1D18A9856A87","full_name":"Peruzzo, Matilda"},{"full_name":"Fink, Johannes M","last_name":"Fink","first_name":"Johannes M","orcid":"0000-0001-8112-028X","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Oskar","last_name":"Painter","full_name":"Painter, Oskar"}],"volume":14,"date_updated":"2023-08-24T14:48:08Z","date_created":"2019-02-24T22:59:21Z","year":"2019","department":[{"_id":"JoFi"}],"publisher":"Springer Nature","publication_status":"published","doi":"10.1038/s41565-019-0377-2","language":[{"iso":"eng"}],"external_id":{"isi":["000463195700014"]},"oa":1,"main_file_link":[{"url":"https://authors.library.caltech.edu/92123/","open_access":"1"}],"isi":1,"quality_controlled":"1","publication_identifier":{"issn":["1748-3387"],"eissn":["1748-3395"]},"month":"04","oa_version":"Submitted Version","_id":"6053","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","intvolume":" 14","title":"Quantum electromechanics of a hypersonic crystal","status":"public","issue":"4","abstract":[{"lang":"eng","text":"Recent technical developments in the fields of quantum electromechanics and optomechanics have spawned nanoscale mechanical transducers with the sensitivity to measure mechanical displacements at the femtometre scale and the ability to convert electromagnetic signals at the single photon level. A key challenge in this field is obtaining strong coupling between motion and electromagnetic fields without adding additional decoherence. Here we present an electromechanical transducer that integrates a high-frequency (0.42 GHz) hypersonic phononic crystal with a superconducting microwave circuit. The use of a phononic bandgap crystal enables quantum-level transduction of hypersonic mechanical motion and concurrently eliminates decoherence caused by acoustic radiation. Devices with hypersonic mechanical frequencies provide a natural pathway for integration with Josephson junction quantum circuits, a leading quantum computing technology, and nanophotonic systems capable of optical networking and distributing quantum information."}],"type":"journal_article","date_published":"2019-04-01T00:00:00Z","citation":{"apa":"Kalaee, M., Mirhosseini, M., Dieterle, P. B., Peruzzo, M., Fink, J. M., & Painter, O. (2019). Quantum electromechanics of a hypersonic crystal. Nature Nanotechnology. Springer Nature. https://doi.org/10.1038/s41565-019-0377-2","ieee":"M. Kalaee, M. Mirhosseini, P. B. Dieterle, M. Peruzzo, J. M. Fink, and O. Painter, “Quantum electromechanics of a hypersonic crystal,” Nature Nanotechnology, vol. 14, no. 4. Springer Nature, pp. 334–339, 2019.","ista":"Kalaee M, Mirhosseini M, Dieterle PB, Peruzzo M, Fink JM, Painter O. 2019. Quantum electromechanics of a hypersonic crystal. Nature Nanotechnology. 14(4), 334–339.","ama":"Kalaee M, Mirhosseini M, Dieterle PB, Peruzzo M, Fink JM, Painter O. Quantum electromechanics of a hypersonic crystal. Nature Nanotechnology. 2019;14(4):334–339. doi:10.1038/s41565-019-0377-2","chicago":"Kalaee, Mahmoud, Mohammad Mirhosseini, Paul B. Dieterle, Matilda Peruzzo, Johannes M Fink, and Oskar Painter. “Quantum Electromechanics of a Hypersonic Crystal.” Nature Nanotechnology. Springer Nature, 2019. https://doi.org/10.1038/s41565-019-0377-2.","short":"M. Kalaee, M. Mirhosseini, P.B. Dieterle, M. Peruzzo, J.M. Fink, O. Painter, Nature Nanotechnology 14 (2019) 334–339.","mla":"Kalaee, Mahmoud, et al. “Quantum Electromechanics of a Hypersonic Crystal.” Nature Nanotechnology, vol. 14, no. 4, Springer Nature, 2019, pp. 334–339, doi:10.1038/s41565-019-0377-2."},"publication":"Nature Nanotechnology","page":"334–339","article_type":"original","article_processing_charge":"No","day":"01","scopus_import":"1"},{"publisher":"AMS","department":[{"_id":"HeEd"}],"publication_status":"published","year":"2019","volume":147,"date_created":"2019-02-24T22:59:19Z","date_updated":"2023-08-24T14:48:59Z","author":[{"first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy"},{"last_name":"Fedorov","first_name":"Roman","full_name":"Fedorov, Roman"}],"isi":1,"quality_controlled":"1","external_id":{"isi":["000450363900008"],"arxiv":["1709.02562"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1709.02562","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1090/proc/14240","month":"01","intvolume":" 147","title":"Two circles and only a straightedge","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6050","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"We answer a question of David Hilbert: given two circles it is not possible in general to construct their centers using only a straightedge. On the other hand, we give infinitely many families of pairs of circles for which such construction is possible. ","lang":"eng"}],"page":"91-102","citation":{"ama":"Akopyan A, Fedorov R. Two circles and only a straightedge. Proceedings of the American Mathematical Society. 2019;147:91-102. doi:10.1090/proc/14240","ista":"Akopyan A, Fedorov R. 2019. Two circles and only a straightedge. Proceedings of the American Mathematical Society. 147, 91–102.","apa":"Akopyan, A., & Fedorov, R. (2019). Two circles and only a straightedge. Proceedings of the American Mathematical Society. AMS. https://doi.org/10.1090/proc/14240","ieee":"A. Akopyan and R. Fedorov, “Two circles and only a straightedge,” Proceedings of the American Mathematical Society, vol. 147. AMS, pp. 91–102, 2019.","mla":"Akopyan, Arseniy, and Roman Fedorov. “Two Circles and Only a Straightedge.” Proceedings of the American Mathematical Society, vol. 147, AMS, 2019, pp. 91–102, doi:10.1090/proc/14240.","short":"A. Akopyan, R. Fedorov, Proceedings of the American Mathematical Society 147 (2019) 91–102.","chicago":"Akopyan, Arseniy, and Roman Fedorov. “Two Circles and Only a Straightedge.” Proceedings of the American Mathematical Society. AMS, 2019. https://doi.org/10.1090/proc/14240."},"publication":"Proceedings of the American Mathematical Society","date_published":"2019-01-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"type":"research_data_reference","date_updated":"2023-08-24T14:46:23Z","date_created":"2021-08-06T11:34:56Z","oa_version":"Published Version","author":[{"full_name":"Merrill, Richard M.","last_name":"Merrill","first_name":"Richard M."},{"full_name":"Rastas, Pasi","last_name":"Rastas","first_name":"Pasi"},{"first_name":"Simon H.","last_name":"Martin","full_name":"Martin, Simon H."},{"id":"386D7308-F248-11E8-B48F-1D18A9856A87","last_name":"Melo Hurtado","first_name":"Maria C","full_name":"Melo Hurtado, Maria C"},{"full_name":"Barker, Sarah","last_name":"Barker","first_name":"Sarah"},{"full_name":"Davey, John","first_name":"John","last_name":"Davey"},{"last_name":"Mcmillan","first_name":"W. Owen","full_name":"Mcmillan, W. Owen"},{"first_name":"Chris D.","last_name":"Jiggins","full_name":"Jiggins, Chris D."}],"related_material":{"record":[{"id":"6022","status":"public","relation":"used_in_publication"}]},"status":"public","title":"Raw behavioral data","department":[{"_id":"NiBa"}],"publisher":"Public Library of Science","_id":"9801","year":"2019","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","month":"02","day":"07","article_processing_charge":"No","date_published":"2019-02-07T00:00:00Z","doi":"10.1371/journal.pbio.2005902.s006","citation":{"chicago":"Merrill, Richard M., Pasi Rastas, Simon H. Martin, Maria C Melo Hurtado, Sarah Barker, John Davey, W. Owen Mcmillan, and Chris D. Jiggins. “Raw Behavioral Data.” Public Library of Science, 2019. https://doi.org/10.1371/journal.pbio.2005902.s006.","mla":"Merrill, Richard M., et al. Raw Behavioral Data. Public Library of Science, 2019, doi:10.1371/journal.pbio.2005902.s006.","short":"R.M. Merrill, P. Rastas, S.H. Martin, M.C. Melo Hurtado, S. Barker, J. Davey, W.O. Mcmillan, C.D. Jiggins, (2019).","ista":"Merrill RM, Rastas P, Martin SH, Melo Hurtado MC, Barker S, Davey J, Mcmillan WO, Jiggins CD. 2019. Raw behavioral data, Public Library of Science, 10.1371/journal.pbio.2005902.s006.","apa":"Merrill, R. M., Rastas, P., Martin, S. H., Melo Hurtado, M. C., Barker, S., Davey, J., … Jiggins, C. D. (2019). Raw behavioral data. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005902.s006","ieee":"R. M. Merrill et al., “Raw behavioral data.” Public Library of Science, 2019.","ama":"Merrill RM, Rastas P, Martin SH, et al. Raw behavioral data. 2019. doi:10.1371/journal.pbio.2005902.s006"}},{"volume":28,"date_created":"2019-03-10T22:59:21Z","date_updated":"2023-08-24T14:50:27Z","related_material":{"record":[{"relation":"research_data","status":"public","id":"9837"}]},"author":[{"first_name":"Rui","last_name":"Faria","full_name":"Faria, Rui"},{"full_name":"Chaube, Pragya","last_name":"Chaube","first_name":"Pragya"},{"full_name":"Morales, Hernán E.","last_name":"Morales","first_name":"Hernán E."},{"first_name":"Tomas","last_name":"Larsson","full_name":"Larsson, Tomas"},{"first_name":"Alan R.","last_name":"Lemmon","full_name":"Lemmon, Alan R."},{"last_name":"Lemmon","first_name":"Emily M.","full_name":"Lemmon, Emily M."},{"last_name":"Rafajlović","first_name":"Marina","full_name":"Rafajlović, Marina"},{"last_name":"Panova","first_name":"Marina","full_name":"Panova, Marina"},{"full_name":"Ravinet, Mark","first_name":"Mark","last_name":"Ravinet"},{"last_name":"Johannesson","first_name":"Kerstin","full_name":"Johannesson, Kerstin"},{"orcid":"0000-0003-1050-4969","id":"3C147470-F248-11E8-B48F-1D18A9856A87","last_name":"Westram","first_name":"Anja M","full_name":"Westram, Anja M"},{"full_name":"Butlin, Roger K.","first_name":"Roger K.","last_name":"Butlin"}],"department":[{"_id":"NiBa"}],"publisher":"Wiley","publication_status":"published","year":"2019","file_date_updated":"2020-07-14T12:47:19Z","language":[{"iso":"eng"}],"doi":"10.1111/mec.14972","isi":1,"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000465219200013"]},"publication_identifier":{"issn":["0962-1083"],"eissn":["1365-294X"]},"month":"03","file":[{"checksum":"f915885756057ec0ca5912a41f46a887","date_created":"2019-03-11T16:12:54Z","date_updated":"2020-07-14T12:47:19Z","file_id":"6097","relation":"main_file","creator":"dernst","file_size":1510715,"content_type":"application/pdf","access_level":"open_access","file_name":"2019_MolecularEcology_Faria.pdf"}],"oa_version":"Published Version","intvolume":" 28","ddc":["570"],"title":"Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes","status":"public","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6095","issue":"6","abstract":[{"lang":"eng","text":"Both classical and recent studies suggest that chromosomal inversion polymorphisms are important in adaptation and speciation. However, biases in discovery and reporting of inversions make it difficult to assess their prevalence and biological importance. Here, we use an approach based on linkage disequilibrium among markers genotyped for samples collected across a transect between contrasting habitats to detect chromosomal rearrangements de novo. We report 17 polymorphic rearrangements in a single locality for the coastal marine snail, Littorina saxatilis. Patterns of diversity in the field and of recombination in controlled crosses provide strong evidence that at least the majority of these rearrangements are inversions. Most show clinal changes in frequency between habitats, suggestive of divergent selection, but only one appears to be fixed for different arrangements in the two habitats. Consistent with widespread evidence for balancing selection on inversion polymorphisms, we argue that a combination of heterosis and divergent selection can explain the observed patterns and should be considered in other systems spanning environmental gradients."}],"type":"journal_article","date_published":"2019-03-01T00:00:00Z","page":"1375-1393","citation":{"mla":"Faria, Rui, et al. “Multiple Chromosomal Rearrangements in a Hybrid Zone between Littorina Saxatilis Ecotypes.” Molecular Ecology, vol. 28, no. 6, Wiley, 2019, pp. 1375–93, doi:10.1111/mec.14972.","short":"R. Faria, P. Chaube, H.E. Morales, T. Larsson, A.R. Lemmon, E.M. Lemmon, M. Rafajlović, M. Panova, M. Ravinet, K. Johannesson, A.M. Westram, R.K. Butlin, Molecular Ecology 28 (2019) 1375–1393.","chicago":"Faria, Rui, Pragya Chaube, Hernán E. Morales, Tomas Larsson, Alan R. Lemmon, Emily M. Lemmon, Marina Rafajlović, et al. “Multiple Chromosomal Rearrangements in a Hybrid Zone between Littorina Saxatilis Ecotypes.” Molecular Ecology. Wiley, 2019. https://doi.org/10.1111/mec.14972.","ama":"Faria R, Chaube P, Morales HE, et al. Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes. Molecular Ecology. 2019;28(6):1375-1393. doi:10.1111/mec.14972","ista":"Faria R, Chaube P, Morales HE, Larsson T, Lemmon AR, Lemmon EM, Rafajlović M, Panova M, Ravinet M, Johannesson K, Westram AM, Butlin RK. 2019. Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes. Molecular Ecology. 28(6), 1375–1393.","apa":"Faria, R., Chaube, P., Morales, H. E., Larsson, T., Lemmon, A. R., Lemmon, E. M., … Butlin, R. K. (2019). Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.14972","ieee":"R. Faria et al., “Multiple chromosomal rearrangements in a hybrid zone between Littorina saxatilis ecotypes,” Molecular Ecology, vol. 28, no. 6. Wiley, pp. 1375–1393, 2019."},"publication":"Molecular Ecology","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1"},{"publication":"Journal of Physics A: Mathematical and Theoretical","citation":{"chicago":"De Martino, Daniele. “Feedback-Induced Self-Oscillations in Large Interacting Systems Subjected to Phase Transitions.” Journal of Physics A: Mathematical and Theoretical. IOP Publishing, 2019. https://doi.org/10.1088/1751-8121/aaf2dd.","mla":"De Martino, Daniele. “Feedback-Induced Self-Oscillations in Large Interacting Systems Subjected to Phase Transitions.” Journal of Physics A: Mathematical and Theoretical, vol. 52, no. 4, 045002, IOP Publishing, 2019, doi:10.1088/1751-8121/aaf2dd.","short":"D. De Martino, Journal of Physics A: Mathematical and Theoretical 52 (2019).","ista":"De Martino D. 2019. Feedback-induced self-oscillations in large interacting systems subjected to phase transitions. Journal of Physics A: Mathematical and Theoretical. 52(4), 045002.","apa":"De Martino, D. (2019). Feedback-induced self-oscillations in large interacting systems subjected to phase transitions. Journal of Physics A: Mathematical and Theoretical. IOP Publishing. https://doi.org/10.1088/1751-8121/aaf2dd","ieee":"D. De Martino, “Feedback-induced self-oscillations in large interacting systems subjected to phase transitions,” Journal of Physics A: Mathematical and Theoretical, vol. 52, no. 4. IOP Publishing, 2019.","ama":"De Martino D. Feedback-induced self-oscillations in large interacting systems subjected to phase transitions. Journal of Physics A: Mathematical and Theoretical. 2019;52(4). doi:10.1088/1751-8121/aaf2dd"},"date_published":"2019-01-07T00:00:00Z","scopus_import":"1","day":"07","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","_id":"6049","status":"public","title":"Feedback-induced self-oscillations in large interacting systems subjected to phase transitions","ddc":["570"],"intvolume":" 52","oa_version":"Published Version","file":[{"file_size":1804557,"content_type":"application/pdf","creator":"kschuh","access_level":"open_access","file_name":"2019_IOP_DeMartino.pdf","checksum":"1112304ad363a6d8afaeccece36473cf","date_created":"2019-04-19T12:18:57Z","date_updated":"2020-07-14T12:47:17Z","relation":"main_file","file_id":"6344"}],"type":"journal_article","abstract":[{"lang":"eng","text":"In this article it is shown that large systems with many interacting units endowing multiple phases display self-oscillations in the presence of linear feedback between the control and order parameters, where an Andronov–Hopf bifurcation takes over the phase transition. This is simply illustrated through the mean field Landau theory whose feedback dynamics turn out to be described by the Van der Pol equation and it is then validated for the fully connected Ising model following heat bath dynamics. Despite its simplicity, this theory accounts potentially for a rich range of phenomena: here it is applied to describe in a stylized way (i) excess demand-price cycles due to strong herding in a simple agent-based market model; (ii) congestion waves in queuing networks triggered by user feedback to delays in overloaded conditions; and (iii) metabolic network oscillations resulting from cell growth control in a bistable phenotypic landscape."}],"issue":"4","external_id":{"isi":["000455379500001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","isi":1,"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"doi":"10.1088/1751-8121/aaf2dd","language":[{"iso":"eng"}],"month":"01","year":"2019","publication_status":"published","publisher":"IOP Publishing","department":[{"_id":"GaTk"}],"author":[{"id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5214-4706","first_name":"Daniele","last_name":"De Martino","full_name":"De Martino, Daniele"}],"date_updated":"2023-08-24T14:49:23Z","date_created":"2019-02-24T22:59:19Z","volume":52,"article_number":"045002","file_date_updated":"2020-07-14T12:47:17Z","ec_funded":1}]