--- _id: '8983' abstract: - lang: eng text: Metabolic adaptation is a critical feature of migrating cells. It tunes the metabolic programs of migrating cells to allow them to efficiently exert their crucial roles in development, inflammatory responses and tumor metastasis. Cell migration through physically challenging contexts requires energy. However, how the metabolic reprogramming that underlies in vivo cell invasion is controlled is still unanswered. In my PhD project, I identify a novel conserved metabolic shift in Drosophila melanogaster immune cells that by modulating their bioenergetic potential controls developmentally programmed tissue invasion. We show that this regulation requires a novel conserved nuclear protein, named Atossa. Atossa enhances the transcription of a set of proteins, including an RNA helicase Porthos and two metabolic enzymes, each of which increases the tissue invasion of leading Drosophila macrophages and can rescue the atossa mutant phenotype. Porthos selectively regulates the translational efficiency of a subset of mRNAs containing a 5’-UTR cis-regulatory TOP-like sequence. These 5’TOPL mRNA targets encode mitochondrial-related proteins, including subunits of mitochondrial oxidative phosphorylation (OXPHOS) components III and V and other metabolic-related proteins. Porthos powers up mitochondrial OXPHOS to engender a sufficient ATP supply, which is required for tissue invasion of leading macrophages. Atossa’s two vertebrate orthologs rescue the invasion defect. In my PhD project, I elucidate that Atossa displays a conserved developmental metabolic control to modulate metabolic capacities and the cellular energy state, through altered transcription and translation, to aid the tissue infiltration of leading cells into energy demanding barriers. acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: E-Lib - _id: CampIT acknowledgement: Also, I would like to express my appreciation and thanks to the Bioimaging facility, LSF, GSO, library, and IT people at IST Austria. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Shamsi full_name: Emtenani, Shamsi id: 49D32318-F248-11E8-B48F-1D18A9856A87 last_name: Emtenani orcid: 0000-0001-6981-6938 citation: ama: Emtenani S. Metabolic regulation of Drosophila macrophage tissue invasion. 2020. doi:10.15479/AT:ISTA:8983 apa: Emtenani, S. (2020). Metabolic regulation of Drosophila macrophage tissue invasion. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8983 chicago: Emtenani, Shamsi. “Metabolic Regulation of Drosophila Macrophage Tissue Invasion.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8983. ieee: S. Emtenani, “Metabolic regulation of Drosophila macrophage tissue invasion,” Institute of Science and Technology Austria, 2020. ista: Emtenani S. 2020. Metabolic regulation of Drosophila macrophage tissue invasion. Institute of Science and Technology Austria. mla: Emtenani, Shamsi. Metabolic Regulation of Drosophila Macrophage Tissue Invasion. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8983. short: S. Emtenani, Metabolic Regulation of Drosophila Macrophage Tissue Invasion, Institute of Science and Technology Austria, 2020. date_created: 2020-12-30T15:41:26Z date_published: 2020-12-30T00:00:00Z date_updated: 2023-09-07T13:24:17Z day: '30' ddc: - '570' degree_awarded: PhD department: - _id: DaSi doi: 10.15479/AT:ISTA:8983 file: - access_level: open_access checksum: ec2797ab7a6f253b35df0572b36d1b43 content_type: application/pdf creator: semtenan date_created: 2020-12-30T15:34:01Z date_updated: 2021-12-31T23:30:04Z embargo: 2021-12-30 file_id: '8984' file_name: Thesis_Shamsi_Emtenani_pdfA.pdf file_size: 10848175 relation: main_file - access_level: closed checksum: cc30e6608a9815414024cf548dff3b3a content_type: application/pdf creator: semtenan date_created: 2020-12-30T15:37:36Z date_updated: 2021-12-31T23:30:04Z embargo_to: open_access file_id: '8985' file_name: Thesis_Shamsi_Emtenani_source file.pdf file_size: 10073648 relation: source_file file_date_updated: 2021-12-31T23:30:04Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: '141' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '8557' relation: part_of_dissertation status: public - id: '6187' relation: part_of_dissertation status: public status: public supervisor: - first_name: Daria E full_name: Siekhaus, Daria E id: 3D224B9E-F248-11E8-B48F-1D18A9856A87 last_name: Siekhaus orcid: 0000-0001-8323-8353 title: Metabolic regulation of Drosophila macrophage tissue invasion type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2020' ... --- _id: '8557' 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. acknowledged_ssus: - _id: LifeSc 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.' article_processing_charge: No author: - first_name: Vera full_name: Belyaeva, Vera id: 47F080FE-F248-11E8-B48F-1D18A9856A87 last_name: Belyaeva - first_name: Stephanie full_name: Wachner, Stephanie id: 2A95E7B0-F248-11E8-B48F-1D18A9856A87 last_name: Wachner - first_name: Igor full_name: Gridchyn, Igor id: 4B60654C-F248-11E8-B48F-1D18A9856A87 last_name: Gridchyn orcid: 0000-0002-1807-1929 - first_name: Markus full_name: Linder, Markus last_name: Linder - first_name: Shamsi full_name: Emtenani, Shamsi id: 49D32318-F248-11E8-B48F-1D18A9856A87 last_name: Emtenani orcid: 0000-0001-6981-6938 - first_name: Attila full_name: György, Attila id: 3BCEDBE0-F248-11E8-B48F-1D18A9856A87 last_name: György orcid: 0000-0002-1819-198X - first_name: Maria full_name: Sibilia, Maria last_name: Sibilia - first_name: Daria E full_name: Siekhaus, Daria E id: 3D224B9E-F248-11E8-B48F-1D18A9856A87 last_name: Siekhaus orcid: 0000-0001-8323-8353 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 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 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. ieee: V. Belyaeva et al., “Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance,” bioRxiv. . 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. 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.). date_created: 2020-09-23T09:36:47Z date_published: 2020-09-18T00:00:00Z date_updated: 2024-03-27T23:30:24Z day: '18' department: - _id: DaSi - _id: JoCs doi: 10.1101/2020.09.18.301481 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/2020.09.18.301481 month: '09' oa: 1 oa_version: Preprint project: - _id: 253B6E48-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P29638 name: Drosophila TNFa´s Funktion in Immunzellen - _id: 2536F660-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '334077' name: Investigating the role of transporters in invasive migration through junctions - _id: 26199CA4-B435-11E9-9278-68D0E5697425 grant_number: '24800' name: Tissue barrier penetration is crucial for immunity and metastasis publication: bioRxiv publication_status: submitted related_material: record: - id: '10614' relation: later_version status: public - id: '8983' relation: dissertation_contains status: public status: public title: Cortical actin properties controlled by Drosophila Fos aid macrophage infiltration against surrounding tissue resistance type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8831' 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. acknowledged_ssus: - _id: M-Shop - _id: NanoFab 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)." article_number: '2012.00322' article_processing_charge: No author: - first_name: Kushagra full_name: Aggarwal, Kushagra id: b22ab905-3539-11eb-84c3-fc159dcd79cb last_name: Aggarwal orcid: 0000-0001-9985-9293 - first_name: Andrea C full_name: Hofmann, Andrea C id: 340F461A-F248-11E8-B48F-1D18A9856A87 last_name: Hofmann - first_name: Daniel full_name: Jirovec, Daniel id: 4C473F58-F248-11E8-B48F-1D18A9856A87 last_name: Jirovec orcid: 0000-0002-7197-4801 - first_name: Ivan full_name: Prieto Gonzalez, Ivan id: 2A307FE2-F248-11E8-B48F-1D18A9856A87 last_name: Prieto Gonzalez orcid: 0000-0002-7370-5357 - first_name: Amir full_name: Sammak, Amir last_name: Sammak - first_name: Marc full_name: Botifoll, Marc last_name: Botifoll - first_name: Sara full_name: Marti-Sanchez, Sara last_name: Marti-Sanchez - first_name: Menno full_name: Veldhorst, Menno last_name: Veldhorst - first_name: Jordi full_name: Arbiol, Jordi last_name: Arbiol - first_name: Giordano full_name: Scappucci, Giordano last_name: Scappucci - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X citation: ama: Aggarwal K, Hofmann AC, Jirovec D, 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. 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. ieee: K. Aggarwal et al., “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. mla: Aggarwal, Kushagra, et al. “Enhancement of Proximity Induced Superconductivity in Planar Germanium.” ArXiv, 2012.00322. 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.). date_created: 2020-12-02T10:42:53Z date_published: 2020-12-02T00:00:00Z date_updated: 2024-03-27T23:30:26Z day: '02' ddc: - '530' department: - _id: GeKa ec_funded: 1 external_id: arxiv: - '2012.00322' file: - access_level: open_access checksum: 22a612e206232fa94b138b2c2f957582 content_type: application/pdf creator: gkatsaro date_created: 2020-12-02T10:42:31Z date_updated: 2020-12-02T10:42:31Z file_id: '8832' file_name: Superconducting_2D_Ge.pdf file_size: 1697939 relation: main_file file_date_updated: 2020-12-02T10:42:31Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Submitted Version project: - _id: 262116AA-B435-11E9-9278-68D0E5697425 name: Hybrid Semiconductor - Superconductor Quantum Devices - _id: 26A151DA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '844511' name: Majorana bound states in Ge/SiGe heterostructures - _id: 237E5020-32DE-11EA-91FC-C7463DDC885E call_identifier: H2020 grant_number: '862046' name: TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS publication: arXiv publication_status: submitted related_material: record: - id: '10559' relation: later_version status: public - id: '8834' relation: research_data status: public - id: '10058' relation: dissertation_contains status: public status: public title: Enhancement of proximity induced superconductivity in planar Germanium type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8532' abstract: - lang: eng 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. 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." article_number: '6737' article_processing_charge: No article_type: original author: - first_name: David full_name: Kleindienst, David id: 42E121A4-F248-11E8-B48F-1D18A9856A87 last_name: Kleindienst - first_name: Jacqueline-Claire full_name: Montanaro-Punzengruber, Jacqueline-Claire id: 3786AB44-F248-11E8-B48F-1D18A9856A87 last_name: Montanaro-Punzengruber - first_name: Pradeep full_name: Bhandari, Pradeep id: 45EDD1BC-F248-11E8-B48F-1D18A9856A87 last_name: Bhandari orcid: 0000-0003-0863-4481 - first_name: Matthew J full_name: Case, Matthew J id: 44B7CA5A-F248-11E8-B48F-1D18A9856A87 last_name: Case - first_name: Yugo full_name: Fukazawa, Yugo last_name: Fukazawa - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 citation: 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 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 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. 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. 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. short: D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M.J. Case, Y. Fukazawa, R. Shigemoto, International Journal of Molecular Sciences 21 (2020). date_created: 2020-09-20T22:01:35Z date_published: 2020-09-14T00:00:00Z date_updated: 2024-03-27T23:30:30Z day: '14' ddc: - '570' department: - _id: RySh doi: 10.3390/ijms21186737 ec_funded: 1 external_id: isi: - '000579945300001' file: - access_level: open_access checksum: 2e4f62f3cfe945b7391fc3070e5a289f content_type: application/pdf creator: dernst date_created: 2020-09-21T14:08:58Z date_updated: 2020-09-21T14:08:58Z file_id: '8551' file_name: 2020_JournMolecSciences_Kleindienst.pdf file_size: 5748456 relation: main_file success: 1 file_date_updated: 2020-09-21T14:08:58Z has_accepted_license: '1' intvolume: ' 21' isi: 1 issue: '18' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '09' oa: 1 oa_version: Published Version project: - _id: 25CA28EA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694539' name: 'In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour' - _id: 25D32BC0-B435-11E9-9278-68D0E5697425 name: Mechanism of formation and maintenance of input side-dependent asymmetry in the hippocampus - _id: 26436750-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '785907' name: Human Brain Project Specific Grant Agreement 2 (HBP SGA 2) publication: International Journal of Molecular Sciences publication_identifier: eissn: - '14220067' issn: - '16616596' publication_status: published publisher: MDPI quality_controlled: '1' related_material: record: - id: '9562' relation: dissertation_contains status: public scopus_import: '1' status: public title: Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 21 year: '2020' ... --- _id: '7810' abstract: - lang: eng 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." alternative_title: - LNCS article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 citation: 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' 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' 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. 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. 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.' 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. conference: end_date: 2020-04-30 location: Dublin, Ireland name: 'ESOP: Programming Languages and Systems' start_date: 2020-04-25 date_created: 2020-05-10T22:00:50Z date_published: 2020-04-18T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '18' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-030-44914-8_5 external_id: isi: - '000681656800005' file: - access_level: open_access checksum: 8618b80f4cf7b39a60e61a6445ad9807 content_type: application/pdf creator: dernst date_created: 2020-05-26T13:34:48Z date_updated: 2020-07-14T12:48:03Z file_id: '7895' file_name: 2020_LNCS_Chatterjee.pdf file_size: 651250 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' intvolume: ' 12075' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 112-140 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _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 publication: European Symposium on Programming publication_identifier: eissn: - '16113349' isbn: - '9783030449131' issn: - '03029743' publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Optimal and perfectly parallel algorithms for on-demand data-flow analysis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 12075 year: '2020' ... --- _id: '8728' 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. alternative_title: - LNCS article_processing_charge: No author: - first_name: Ali full_name: Asadi, Ali last_name: Asadi - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Kiarash full_name: Mohammadi, Kiarash last_name: Mohammadi - first_name: Andreas full_name: Pavlogiannis, Andreas id: 49704004-F248-11E8-B48F-1D18A9856A87 last_name: Pavlogiannis orcid: 0000-0002-8943-0722 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' 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' 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. 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. 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.' 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. conference: end_date: 2020-10-23 location: Hanoi, Vietnam name: 'ATVA: Automated Technology for Verification and Analysis' start_date: 2020-10-19 date_created: 2020-11-06T07:30:05Z date_published: 2020-10-12T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '12' ddc: - '000' department: - _id: KrCh doi: 10.1007/978-3-030-59152-6_14 external_id: isi: - '000723555700014' file: - access_level: open_access checksum: ae83f27e5b189d5abc2e7514f1b7e1b5 content_type: application/pdf creator: dernst date_created: 2020-11-06T07:41:03Z date_updated: 2020-11-06T07:41:03Z file_id: '8729' file_name: 2020_LNCS_ATVA_Asadi_accepted.pdf file_size: 726648 relation: main_file success: 1 file_date_updated: 2020-11-06T07:41:03Z has_accepted_license: '1' intvolume: ' 12302' isi: 1 language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 253-270 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies publication: Automated Technology for Verification and Analysis publication_identifier: eisbn: - '9783030591526' eissn: - 1611-3349 isbn: - '9783030591519' issn: - 0302-9743 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 12302 year: '2020' ... --- _id: '8089' 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." article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Hongfei full_name: Fu, Hongfei id: 3AAD03D6-F248-11E8-B48F-1D18A9856A87 last_name: Fu - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Ehsan Kafshdar full_name: Goharshady, Ehsan Kafshdar last_name: Goharshady 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' 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' 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. 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. 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.' 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. 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. conference: end_date: 2020-06-20 location: London, United Kingdom name: 'PLDI: Programming Language Design and Implementation' start_date: 2020-06-15 date_created: 2020-07-05T22:00:45Z date_published: 2020-06-11T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '11' department: - _id: KrCh doi: 10.1145/3385412.3385969 external_id: arxiv: - '1902.04373' isi: - '000614622300045' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1902.04373 month: '06' oa: 1 oa_version: Preprint page: 672-687 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation publication_identifier: isbn: - '9781450376136' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Polynomial invariant generation for non-deterministic recursive programs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '6918' abstract: - lang: eng 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." 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). article_number: '106665' article_processing_charge: No article_type: original author: - first_name: Amir Kafshdar full_name: Goharshady, Amir Kafshdar id: 391365CE-F248-11E8-B48F-1D18A9856A87 last_name: Goharshady orcid: 0000-0003-1702-6584 - first_name: Fatemeh full_name: Mohammadi, Fatemeh last_name: Mohammadi citation: 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 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 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. 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. ista: Goharshady AK, Mohammadi F. 2020. An efficient algorithm for computing network reliability in small treewidth. Reliability Engineering and System Safety. 193, 106665. 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). date_created: 2019-09-29T22:00:44Z date_published: 2020-01-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' department: - _id: KrCh doi: 10.1016/j.ress.2019.106665 external_id: arxiv: - '1712.09692' isi: - '000501641400050' intvolume: ' 193' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.09692 month: '01' oa: 1 oa_version: Preprint project: - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: Reliability Engineering and System Safety publication_identifier: issn: - '09518320' publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: An efficient algorithm for computing network reliability in small treewidth type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 193 year: '2020' ... --- _id: '7161' 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. 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). article_processing_charge: No article_type: original author: - first_name: Yekini full_name: Shehu, Yekini id: 3FC7CB58-F248-11E8-B48F-1D18A9856A87 last_name: Shehu orcid: 0000-0001-9224-7139 - first_name: Aviv full_name: Gibali, Aviv last_name: Gibali - first_name: Simone full_name: Sagratella, Simone last_name: Sagratella 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 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 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. 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. 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. 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. date_created: 2019-12-09T21:33:44Z date_published: 2020-03-01T00:00:00Z date_updated: 2023-09-06T11:27:15Z day: '01' ddc: - '518' - '510' - '515' department: - _id: VlKo doi: 10.1007/s10957-019-01616-6 ec_funded: 1 external_id: isi: - '000511805200009' file: - access_level: open_access checksum: 9f6dc6c6bf2b48cb3a2091a9ed5feaf2 content_type: application/pdf creator: dernst date_created: 2020-10-12T10:40:27Z date_updated: 2021-03-16T23:30:04Z embargo: 2021-03-15 file_id: '8647' file_name: 2020_JourOptimizationTheoryApplic_Shehu.pdf file_size: 332641 relation: main_file file_date_updated: 2021-03-16T23:30:04Z has_accepted_license: '1' intvolume: ' 184' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 877–894 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: Journal of Optimization Theory and Applications publication_identifier: eissn: - 1573-2878 issn: - 0022-3239 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 184 year: '2020' ... --- _id: '7652' 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. 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. article_processing_charge: No article_type: original author: - first_name: Isabella full_name: Tomanek, Isabella id: 3981F020-F248-11E8-B48F-1D18A9856A87 last_name: Tomanek orcid: 0000-0001-6197-363X - first_name: Rok full_name: Grah, Rok id: 483E70DE-F248-11E8-B48F-1D18A9856A87 last_name: Grah orcid: 0000-0003-2539-3560 - first_name: M. full_name: Lagator, M. last_name: Lagator - first_name: A. M. C. full_name: Andersson, A. M. C. last_name: Andersson - first_name: Jonathan P full_name: Bollback, Jonathan P id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87 last_name: Bollback orcid: 0000-0002-4624-4612 - first_name: Gašper full_name: Tkačik, Gašper id: 3D494DCA-F248-11E8-B48F-1D18A9856A87 last_name: Tkačik orcid: 0000-0002-6699-1455 - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 citation: 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 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 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. 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. 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. 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. date_created: 2020-04-08T15:20:53Z date_published: 2020-04-01T00:00:00Z date_updated: 2024-03-27T23:30:36Z day: '01' ddc: - '570' department: - _id: GaTk - _id: CaGu doi: 10.1038/s41559-020-1132-7 external_id: isi: - '000519008300005' file: - access_level: open_access checksum: ef3bbf42023e30b2c24a6278025d2040 content_type: application/pdf creator: dernst date_created: 2020-10-09T09:56:01Z date_updated: 2020-10-09T09:56:01Z file_id: '8640' file_name: 2020_NatureEcolEvo_Tomanek.pdf file_size: 745242 relation: main_file success: 1 file_date_updated: 2020-10-09T09:56:01Z has_accepted_license: '1' intvolume: ' 4' isi: 1 issue: '4' language: - iso: eng month: '04' oa: 1 oa_version: Submitted Version page: 612-625 project: - _id: 267C84F4-B435-11E9-9278-68D0E5697425 name: Biophysically realistic genotype-phenotype maps for regulatory networks publication: Nature Ecology & Evolution publication_identifier: issn: - 2397-334X publication_status: published publisher: Springer Nature quality_controlled: '1' 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 - id: '7383' relation: research_data status: public - id: '7016' relation: research_data status: public - id: '8653' relation: used_in_publication status: public scopus_import: '1' status: public title: Gene amplification as a form of population-level gene expression regulation type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 4 year: '2020' ... --- _id: '7258' abstract: - lang: eng 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. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Davide full_name: Scarselli, Davide id: 40315C30-F248-11E8-B48F-1D18A9856A87 last_name: Scarselli orcid: 0000-0001-5227-4271 citation: ama: Scarselli D. New approaches to reduce friction in turbulent pipe flow. 2020. doi:10.15479/AT:ISTA:7258 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 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. ieee: D. Scarselli, “New approaches to reduce friction in turbulent pipe flow,” Institute of Science and Technology Austria, 2020. ista: Scarselli D. 2020. New approaches to reduce friction in turbulent pipe flow. Institute of Science and Technology Austria. 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. date_created: 2020-01-12T16:07:26Z date_published: 2020-01-13T00:00:00Z date_updated: 2023-09-15T12:20:08Z day: '13' ddc: - '532' degree_awarded: PhD department: - _id: BjHo doi: 10.15479/AT:ISTA:7258 ec_funded: 1 file: - access_level: closed checksum: 4df1ab24e9896635106adde5a54615bf content_type: application/zip creator: dscarsel date_created: 2020-01-12T15:57:14Z date_updated: 2021-01-13T23:30:05Z embargo_to: open_access file_id: '7259' file_name: 2020_Scarselli_Thesis.zip file_size: 26640830 relation: source_file - access_level: open_access checksum: 48659ab98e3414293c7a721385c2fd1c content_type: application/pdf creator: dscarsel date_created: 2020-01-12T15:56:14Z date_updated: 2021-01-13T23:30:05Z embargo: 2021-01-12 file_id: '7260' file_name: 2020_Scarselli_Thesis.pdf file_size: 8515844 relation: main_file file_date_updated: 2021-01-13T23:30:05Z has_accepted_license: '1' language: - iso: eng month: '01' oa: 1 oa_version: None page: '174' project: - _id: 25152F3A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '306589' name: Decoding the complexity of turbulence at its origin - _id: 25104D44-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '737549' name: Eliminating turbulence in oil pipelines - _id: 25136C54-B435-11E9-9278-68D0E5697425 grant_number: HO 4393/1-2 name: Experimental studies of the turbulence transition and transport processes in turbulent Taylor-Couette currents publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '6228' relation: part_of_dissertation status: public - id: '6486' relation: part_of_dissertation status: public - id: '461' relation: part_of_dissertation status: public - id: '422' relation: part_of_dissertation status: public status: public supervisor: - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 title: New approaches to reduce friction in turbulent pipe flow type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2020' ... --- _id: '8653' 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.  " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Isabella full_name: Tomanek, Isabella id: 3981F020-F248-11E8-B48F-1D18A9856A87 last_name: Tomanek orcid: 0000-0001-6197-363X citation: ama: Tomanek I. The evolution of gene expression by copy number and point mutations. 2020. doi:10.15479/AT:ISTA:8653 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 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. ieee: I. Tomanek, “The evolution of gene expression by copy number and point mutations,” Institute of Science and Technology Austria, 2020. ista: Tomanek I. 2020. The evolution of gene expression by copy number and point mutations. Institute of Science and Technology Austria. 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. short: I. Tomanek, The Evolution of Gene Expression by Copy Number and Point Mutations, Institute of Science and Technology Austria, 2020. date_created: 2020-10-13T13:02:33Z date_published: 2020-10-13T00:00:00Z date_updated: 2023-09-07T13:22:42Z day: '13' ddc: - '576' degree_awarded: PhD department: - _id: CaGu doi: 10.15479/AT:ISTA:8653 file: - access_level: closed checksum: c01d9f59794b4b70528f37637c17ad02 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: itomanek date_created: 2020-10-16T12:14:21Z date_updated: 2021-10-20T22:30:03Z embargo_to: open_access file_id: '8666' file_name: Thesis_ITomanek_final_201016.docx file_size: 25131884 relation: source_file - access_level: open_access checksum: f8edbc3b0f81a780e13ca1e561d42d8b content_type: application/pdf creator: itomanek date_created: 2020-10-16T12:14:21Z date_updated: 2021-10-20T22:30:03Z embargo: 2021-10-19 file_id: '8667' file_name: Thesis_ITomanek_final_201016.pdf file_size: 15405675 relation: main_file file_date_updated: 2021-10-20T22:30:03Z has_accepted_license: '1' keyword: - duplication - amplification - promoter - CNV - AMGET - experimental evolution - Escherichia coli language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '117' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7652' relation: research_data status: public status: public supervisor: - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 title: The evolution of gene expression by copy number and point mutations type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2020' ... --- _id: '7427' abstract: - lang: eng 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. acknowledged_ssus: - _id: Bio - _id: LifeSc 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). " article_processing_charge: No article_type: original author: - first_name: Shutang full_name: Tan, Shutang id: 2DE75584-F248-11E8-B48F-1D18A9856A87 last_name: Tan orcid: 0000-0002-0471-8285 - first_name: Melinda F full_name: Abas, Melinda F id: 3CFB3B1C-F248-11E8-B48F-1D18A9856A87 last_name: Abas - first_name: Inge full_name: Verstraeten, Inge id: 362BF7FE-F248-11E8-B48F-1D18A9856A87 last_name: Verstraeten orcid: 0000-0001-7241-2328 - first_name: Matous full_name: Glanc, Matous id: 1AE1EA24-02D0-11E9-9BAA-DAF4881429F2 last_name: Glanc orcid: 0000-0003-0619-7783 - first_name: Gergely full_name: Molnar, Gergely id: 34F1AF46-F248-11E8-B48F-1D18A9856A87 last_name: Molnar - first_name: Jakub full_name: Hajny, Jakub id: 4800CC20-F248-11E8-B48F-1D18A9856A87 last_name: Hajny orcid: 0000-0003-2140-7195 - first_name: Pavel full_name: Lasák, Pavel last_name: Lasák - first_name: Ivan full_name: Petřík, Ivan last_name: Petřík - first_name: Eugenia full_name: Russinova, Eugenia last_name: Russinova - first_name: Jan full_name: Petrášek, Jan last_name: Petrášek - first_name: Ondřej full_name: Novák, Ondřej last_name: Novák - first_name: Jiří full_name: Pospíšil, Jiří last_name: Pospíšil - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: 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 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 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. 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. 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. 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. date_created: 2020-02-02T23:01:00Z date_published: 2020-02-03T00:00:00Z date_updated: 2024-03-27T23:30:37Z day: '03' ddc: - '580' department: - _id: JiFr - _id: EvBe doi: 10.1016/j.cub.2019.11.058 ec_funded: 1 external_id: isi: - '000511287900018' pmid: - '31956021' file: - access_level: open_access checksum: 16f7d51fe28f91c21e4896a2028df40b content_type: application/pdf creator: dernst date_created: 2020-09-22T09:51:28Z date_updated: 2020-09-22T09:51:28Z file_id: '8555' file_name: 2020_CurrentBiology_Tan.pdf file_size: 5360135 relation: main_file success: 1 file_date_updated: 2020-09-22T09:51:28Z has_accepted_license: '1' intvolume: ' 30' isi: 1 issue: '3' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 381-395.e8 pmid: 1 project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 256FEF10-B435-11E9-9278-68D0E5697425 grant_number: 723-2015 name: Long Term Fellowship publication: Current Biology publication_identifier: issn: - '09609822' publication_status: published publisher: Cell Press quality_controlled: '1' related_material: record: - id: '8822' relation: dissertation_contains status: public scopus_import: '1' status: public title: Salicylic acid targets protein phosphatase 2A to attenuate growth in plants tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 30 year: '2020' ... --- _id: '7500' abstract: - lang: eng 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." 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. article_processing_charge: No article_type: original author: - first_name: E full_name: Mazur, E last_name: Mazur - first_name: Ivan full_name: Kulik, Ivan id: F0AB3FCE-02D1-11E9-BD0E-99399A5D3DEB last_name: Kulik - first_name: Jakub full_name: Hajny, Jakub id: 4800CC20-F248-11E8-B48F-1D18A9856A87 last_name: Hajny orcid: 0000-0003-2140-7195 - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: 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 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 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. 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. 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. 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. date_created: 2020-02-18T10:03:47Z date_published: 2020-06-01T00:00:00Z date_updated: 2024-03-27T23:30:37Z day: '01' ddc: - '580' department: - _id: JiFr doi: 10.1111/nph.16446 ec_funded: 1 external_id: isi: - '000514939700001' pmid: - '31971254' file: - access_level: open_access checksum: 17de728b0205979feb95ce663ba918c2 content_type: application/pdf creator: dernst date_created: 2020-11-20T09:32:10Z date_updated: 2020-11-20T09:32:10Z file_id: '8781' file_name: 2020_NewPhytologist_Mazur.pdf file_size: 2106888 relation: main_file success: 1 file_date_updated: 2020-11-20T09:32:10Z has_accepted_license: '1' intvolume: ' 226' isi: 1 issue: '5' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 1375-1383 pmid: 1 project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 2699E3D2-B435-11E9-9278-68D0E5697425 grant_number: '25239' name: Cell surface receptor complexes for PIN polarity and auxin-mediated development publication: New Phytologist publication_identifier: eissn: - 1469-8137 issn: - 0028-646x publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '8822' relation: dissertation_contains status: public status: public title: Auxin canalization and vascular tissue formation by TIR1/AFB-mediated auxin signaling in arabidopsis tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 226 year: '2020' ... --- _id: '8822' 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jakub full_name: Hajny, Jakub id: 4800CC20-F248-11E8-B48F-1D18A9856A87 last_name: Hajny orcid: 0000-0003-2140-7195 citation: 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 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 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. 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. 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. 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. date_created: 2020-12-01T12:38:18Z date_published: 2020-12-01T00:00:00Z date_updated: 2023-09-19T10:39:33Z day: '01' ddc: - '580' degree_awarded: PhD department: - _id: JiFr doi: 10.15479/AT:ISTA:8822 file: - access_level: closed checksum: 210a9675af5e4c78b0b56d920ac82866 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: jhajny date_created: 2020-12-04T07:27:52Z date_updated: 2021-07-16T22:30:03Z embargo_to: open_access file_id: '8919' file_name: Jakub Hajný IST Austria final_JH.docx file_size: 91279806 relation: source_file - access_level: open_access checksum: 1781385b4aa73eba89cc76c6172f71d2 content_type: application/pdf creator: jhajny date_created: 2020-12-09T15:04:41Z date_updated: 2021-12-08T23:30:03Z embargo: 2021-12-07 file_id: '8933' file_name: Jakub Hajný IST Austria final_JH-merged without Science.pdf file_size: 68707697 relation: main_file file_date_updated: 2021-12-08T23:30:03Z has_accepted_license: '1' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: '249' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '7427' relation: part_of_dissertation status: public - id: '6260' relation: part_of_dissertation status: public - id: '7500' relation: part_of_dissertation status: public - id: '191' relation: part_of_dissertation status: public - id: '449' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: Identification and characterization of the molecular machinery of auxin-dependent canalization during vasculature formation and regeneration type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2020' ... --- _id: '8350' abstract: - lang: eng 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." acknowledged_ssus: - _id: PreCl - _id: Bio - _id: EM-Fac 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." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Shayan full_name: Shamipour, Shayan id: 40B34FE2-F248-11E8-B48F-1D18A9856A87 last_name: Shamipour citation: ama: Shamipour S. Bulk actin dynamics drive phase segregation in zebrafish oocytes . 2020. doi:10.15479/AT:ISTA:8350 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 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. 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. 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. short: S. Shamipour, Bulk Actin Dynamics Drive Phase Segregation in Zebrafish Oocytes , Institute of Science and Technology Austria, 2020. date_created: 2020-09-09T11:12:10Z date_published: 2020-09-09T00:00:00Z date_updated: 2023-09-27T14:16:45Z day: '09' ddc: - '570' degree_awarded: PhD department: - _id: BjHo - _id: CaHe doi: 10.15479/AT:ISTA:8350 file: - access_level: closed checksum: 6e47871c74f85008b9876112eb3fcfa1 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: sshamip date_created: 2020-09-09T11:06:27Z date_updated: 2021-09-11T22:30:05Z embargo_to: open_access file_id: '8351' file_name: Shayan-Thesis-Final.docx file_size: 65194814 relation: source_file - access_level: open_access checksum: 1b44c57f04d7e8a6fe41b1c9c55a52a3 content_type: application/pdf creator: sshamip date_created: 2020-09-09T11:06:13Z date_updated: 2021-09-11T22:30:05Z embargo: 2021-09-10 file_id: '8352' file_name: Shayan-Thesis-Final.pdf file_size: 23729605 relation: main_file file_date_updated: 2021-09-11T22:30:05Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: None page: '107' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '661' relation: part_of_dissertation status: public - id: '6508' relation: part_of_dissertation status: public - id: '7001' relation: part_of_dissertation status: public - id: '735' relation: part_of_dissertation status: public status: public supervisor: - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 title: 'Bulk actin dynamics drive phase segregation in zebrafish oocytes ' type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2020' ... --- _id: '8569' 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. 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. article_number: '574382' article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Andi H full_name: Hansen, Andi H id: 38853E16-F248-11E8-B48F-1D18A9856A87 last_name: Hansen - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: 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 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 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. 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. 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. 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. short: A.H. Hansen, S. Hippenmeyer, Frontiers in Cell and Developmental Biology 8 (2020). date_created: 2020-09-26T06:11:07Z date_published: 2020-09-25T00:00:00Z date_updated: 2024-03-27T23:30:40Z day: '25' ddc: - '570' department: - _id: SiHi doi: 10.3389/fcell.2020.574382 ec_funded: 1 external_id: isi: - '000577915900001' pmid: - '33102480' file: - access_level: open_access checksum: 01f731824194c94c81a5da360d997073 content_type: application/pdf creator: dernst date_created: 2020-09-28T13:11:17Z date_updated: 2020-09-28T13:11:17Z file_id: '8584' file_name: 2020_Frontiers_Hansen.pdf file_size: 5527139 relation: main_file success: 1 file_date_updated: 2020-09-28T13:11:17Z has_accepted_license: '1' intvolume: ' 8' isi: 1 issue: '9' language: - iso: eng month: '09' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 2625A13E-B435-11E9-9278-68D0E5697425 grant_number: '24812' name: Molecular Mechanisms of Radial Neuronal Migration - _id: 25D61E48-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618444' name: Molecular Mechanisms of Cerebral Cortex Development publication: Frontiers in Cell and Developmental Biology publication_identifier: issn: - 2296-634X publication_status: published publisher: Frontiers quality_controlled: '1' related_material: record: - id: '9962' relation: dissertation_contains status: public scopus_import: '1' status: public title: Non-cell-autonomous mechanisms in radial projection neuron migration in the developing cerebral cortex tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 8 year: '2020' ... --- _id: '7815' abstract: - lang: eng 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. acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: PreCl article_number: e61147 article_processing_charge: No article_type: original author: - first_name: Robert J full_name: Beattie, Robert J id: 2E26DF60-F248-11E8-B48F-1D18A9856A87 last_name: Beattie orcid: 0000-0002-8483-8753 - first_name: Carmen full_name: Streicher, Carmen id: 36BCB99C-F248-11E8-B48F-1D18A9856A87 last_name: Streicher - first_name: Nicole full_name: Amberg, Nicole id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87 last_name: Amberg orcid: 0000-0002-3183-8207 - first_name: Giselle T full_name: Cheung, Giselle T id: 471195F6-F248-11E8-B48F-1D18A9856A87 last_name: Cheung orcid: 0000-0001-8457-2572 - first_name: Ximena full_name: Contreras, Ximena id: 475990FE-F248-11E8-B48F-1D18A9856A87 last_name: Contreras - first_name: Andi H full_name: Hansen, Andi H id: 38853E16-F248-11E8-B48F-1D18A9856A87 last_name: Hansen - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: 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 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 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. 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. 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. 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). date_created: 2020-05-11T08:31:20Z date_published: 2020-05-08T00:00:00Z date_updated: 2024-03-27T23:30:41Z day: '08' ddc: - '570' department: - _id: SiHi doi: 10.3791/61147 ec_funded: 1 external_id: isi: - '000546406600043' file: - access_level: open_access checksum: 3154ea7f90b9fb45e084cd1c2770597d content_type: application/pdf creator: rbeattie date_created: 2020-05-11T08:28:38Z date_updated: 2020-07-14T12:48:03Z file_id: '7816' file_name: jove-protocol-61147-lineage-tracing-clonal-analysis-developing-cerebral-cortex-using.pdf file_size: 1352186 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' isi: 1 issue: '159' language: - iso: eng month: '05' oa: 1 oa_version: Published Version project: - _id: 264E56E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02416 name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex - _id: 268F8446-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: T0101031 name: Role of Eed in neural stem cell lineage progression - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 2625A13E-B435-11E9-9278-68D0E5697425 grant_number: '24812' name: Molecular Mechanisms of Radial Neuronal Migration - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: Journal of Visual Experiments publication_identifier: issn: - 1940-087X publication_status: published publisher: MyJove Corporation quality_controlled: '1' related_material: record: - id: '7902' relation: part_of_dissertation status: public scopus_import: '1' status: public title: Lineage tracing and clonal analysis in developing cerebral cortex using mosaic analysis with double markers (MADM) tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '7902' abstract: - lang: eng 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." acknowledged_ssus: - _id: PreCl - _id: Bio alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Ximena full_name: Contreras, Ximena id: 475990FE-F248-11E8-B48F-1D18A9856A87 last_name: Contreras citation: ama: Contreras X. Genetic dissection of neural development in health and disease at single cell resolution. 2020. doi:10.15479/AT:ISTA:7902 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 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. 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. 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. short: X. Contreras, Genetic Dissection of Neural Development in Health and Disease at Single Cell Resolution, Institute of Science and Technology Austria, 2020. date_created: 2020-05-29T08:27:32Z date_published: 2020-06-05T00:00:00Z date_updated: 2023-10-18T08:45:16Z day: '05' ddc: - '570' degree_awarded: PhD department: - _id: SiHi doi: 10.15479/AT:ISTA:7902 ec_funded: 1 file: - access_level: closed checksum: 43c172bf006c95b65992d473c7240d13 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: xcontreras date_created: 2020-06-05T08:18:08Z date_updated: 2021-06-07T22:30:03Z embargo_to: open_access file_id: '7927' file_name: PhDThesis_Contreras.docx file_size: 53134142 relation: source_file - access_level: open_access checksum: addfed9128271be05cae3608e03a6ec0 content_type: application/pdf creator: xcontreras date_created: 2020-06-05T08:18:07Z date_updated: 2021-06-07T22:30:03Z embargo: 2021-06-06 file_id: '7928' file_name: PhDThesis_Contreras.pdf file_size: 35117191 relation: main_file file_date_updated: 2021-06-07T22:30:03Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '214' project: - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '6830' relation: dissertation_contains status: public - id: '28' relation: dissertation_contains status: public - id: '7815' relation: dissertation_contains status: public status: public supervisor: - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 title: Genetic dissection of neural development in health and disease at single cell resolution type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2020' ... --- _id: '8190' article_number: e202007029 article_processing_charge: No article_type: letter_note author: - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 - first_name: Anna full_name: Huttenlocher, Anna last_name: Huttenlocher 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' 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' 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.' 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.' ista: 'Sixt MK, Huttenlocher A. 2020. Zena Werb (1945-2020): Cell biology in context. The Journal of Cell Biology. 219(8), e202007029.' 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). date_created: 2020-08-02T22:00:57Z date_published: 2020-07-22T00:00:00Z date_updated: 2023-10-17T10:04:49Z day: '22' ddc: - '570' department: - _id: MiSi doi: 10.1083/jcb.202007029 external_id: isi: - '000573631000004' file: - access_level: open_access checksum: 30016d778d266b8e17d01094917873b8 content_type: application/pdf creator: dernst date_created: 2020-08-04T13:11:52Z date_updated: 2021-02-02T23:30:03Z embargo: 2021-02-01 file_id: '8200' file_name: 2020_JCB_Sixt.pdf file_size: 830725 relation: main_file file_date_updated: 2021-02-02T23:30:03Z has_accepted_license: '1' intvolume: ' 219' isi: 1 issue: '8' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-sa/4.0/ month: '07' oa: 1 oa_version: Published Version publication: The Journal of Cell Biology publication_identifier: eissn: - 1540-8140 publication_status: published publisher: Rockefeller University Press scopus_import: '1' status: public title: 'Zena Werb (1945-2020): Cell biology in context' tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 219 year: '2020' ... --- _id: '8986' abstract: - lang: eng 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.' 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. ' article_number: eabc8895 article_processing_charge: No article_type: original author: - first_name: Yuzhou full_name: Zhang, Yuzhou id: 3B6137F2-F248-11E8-B48F-1D18A9856A87 last_name: Zhang orcid: 0000-0003-2627-6956 - first_name: Lesia full_name: Rodriguez Solovey, Lesia id: 3922B506-F248-11E8-B48F-1D18A9856A87 last_name: Rodriguez Solovey orcid: 0000-0002-7244-7237 - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Xixi full_name: Zhang, Xixi id: 61A66458-47E9-11EA-85BA-8AEAAF14E49A last_name: Zhang orcid: 0000-0001-7048-4627 - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 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 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 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. 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. 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. 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. short: Y. Zhang, L. Rodriguez Solovey, L. Li, X. Zhang, J. Friml, Science Advances 6 (2020). date_created: 2021-01-03T23:01:23Z date_published: 2020-12-11T00:00:00Z date_updated: 2024-03-27T23:30:43Z day: '11' ddc: - '580' department: - _id: JiFr doi: 10.1126/sciadv.abc8895 ec_funded: 1 external_id: isi: - '000599903600014' pmid: - '33310852' file: - access_level: open_access checksum: 5ac2500b191c08ef6dab5327f40ff663 content_type: application/pdf creator: dernst date_created: 2021-01-07T12:44:33Z date_updated: 2021-01-07T12:44:33Z file_id: '8994' file_name: 2020_ScienceAdvances_Zhang.pdf file_size: 10578145 relation: main_file success: 1 file_date_updated: 2021-01-07T12:44:33Z has_accepted_license: '1' intvolume: ' 6' isi: 1 issue: '50' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '12' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 261099A6-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742985' name: Tracing Evolution of Auxin Transport and Polarity in Plants - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants - _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' publication: Science Advances publication_identifier: eissn: - 2375-2548 publication_status: published publisher: AAAS quality_controlled: '1' related_material: record: - id: '10083' relation: dissertation_contains status: public scopus_import: '1' status: public title: Functional innovations of PIN auxin transporters mark crucial evolutionary transitions during rise of flowering plants tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 6 year: '2020' ... --- _id: '8283' 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. ' acknowledgement: 'We would like to thank the reviewers for their helpful comments on the original manuscript. ' article_number: '5272' article_processing_charge: No article_type: original author: - first_name: Huihuang full_name: Chen, Huihuang last_name: Chen - first_name: Linyi full_name: Lai, Linyi last_name: Lai - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Liping full_name: Liu, Liping last_name: Liu - first_name: Bello Hassan full_name: Jakada, Bello Hassan last_name: Jakada - first_name: Youmei full_name: Huang, Youmei last_name: Huang - first_name: Qing full_name: He, Qing last_name: He - first_name: Mengnan full_name: Chai, Mengnan last_name: Chai - first_name: Xiaoping full_name: Niu, Xiaoping last_name: Niu - first_name: Yuan full_name: Qin, Yuan last_name: Qin citation: 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 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 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. 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. 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. 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. 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). date_created: 2020-08-24T06:24:03Z date_published: 2020-08-10T00:00:00Z date_updated: 2024-03-27T23:30:43Z day: '10' ddc: - '570' department: - _id: JiFr doi: 10.3390/ijms21165727 external_id: isi: - '000565090300001' pmid: - '32785037' file: - access_level: open_access checksum: 03b039244e6ae80580385fd9f577e2b2 content_type: application/pdf creator: cziletti date_created: 2020-08-25T09:53:50Z date_updated: 2020-08-25T09:53:50Z file_id: '8292' file_name: 2020_IntMolecSciences_Chen.pdf file_size: 5718755 relation: main_file success: 1 file_date_updated: 2020-08-25T09:53:50Z has_accepted_license: '1' intvolume: ' 21' isi: 1 issue: '16' language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 publication: International Journal of Molecular Sciences publication_identifier: eissn: - '14220067' issn: - '16616596' publication_status: published publisher: MDPI quality_controlled: '1' related_material: record: - id: '10083' relation: dissertation_contains status: public scopus_import: '1' status: public title: AcoMYB4, an Ananas comosus L. MYB transcription factor, functions in osmotic stress through negative regulation of ABA signaling tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 21 year: '2020' ... --- _id: '8139' abstract: - lang: eng 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.' acknowledged_ssus: - _id: EM-Fac - _id: Bio 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. " article_number: jcs248062 article_processing_charge: No article_type: original author: - first_name: Alexander J full_name: Johnson, Alexander J id: 46A62C3A-F248-11E8-B48F-1D18A9856A87 last_name: Johnson orcid: 0000-0002-2739-8843 - first_name: Nataliia full_name: Gnyliukh, Nataliia id: 390C1120-F248-11E8-B48F-1D18A9856A87 last_name: Gnyliukh orcid: 0000-0002-2198-0509 - first_name: Walter full_name: Kaufmann, Walter id: 3F99E422-F248-11E8-B48F-1D18A9856A87 last_name: Kaufmann orcid: 0000-0001-9735-5315 - first_name: Madhumitha full_name: Narasimhan, Madhumitha id: 44BF24D0-F248-11E8-B48F-1D18A9856A87 last_name: Narasimhan orcid: 0000-0002-8600-0671 - first_name: G full_name: Vert, G last_name: Vert - first_name: SY full_name: Bednarek, SY last_name: Bednarek - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: 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 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 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. 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. 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. 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). date_created: 2020-07-21T08:58:19Z date_published: 2020-08-06T00:00:00Z date_updated: 2023-12-01T13:51:07Z day: '06' ddc: - '575' department: - _id: JiFr - _id: EM-Fac doi: 10.1242/jcs.248062 ec_funded: 1 external_id: isi: - '000561047900021' pmid: - '32616560' file: - access_level: open_access checksum: 2d11f79a0b4e0a380fb002b933da331a content_type: application/pdf creator: ajohnson date_created: 2020-11-26T17:12:51Z date_updated: 2021-08-08T22:30:03Z embargo: 2021-08-07 file_id: '8815' file_name: 2020 - Johnson - JSC - plant CME toolbox.pdf file_size: 15150403 relation: main_file file_date_updated: 2021-08-08T22:30:03Z has_accepted_license: '1' intvolume: ' 133' isi: 1 issue: '15' language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 26538374-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I03630 name: Molecular mechanisms of endocytic cargo recognition in plants - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: Journal of Cell Science publication_identifier: eissn: - 1477-9137 issn: - 0021-9533 publication_status: published publisher: The Company of Biologists quality_controlled: '1' related_material: record: - id: '14510' relation: dissertation_contains status: public scopus_import: '1' status: public title: Experimental toolbox for quantitative evaluation of clathrin-mediated endocytosis in the plant model Arabidopsis type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 133 year: '2020' ... --- _id: '9160' 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. 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. article_number: '100048' article_processing_charge: No article_type: original author: - first_name: Hana full_name: Semeradova, Hana id: 42FE702E-F248-11E8-B48F-1D18A9856A87 last_name: Semeradova - first_name: Juan C full_name: Montesinos López, Juan C id: 310A8E3E-F248-11E8-B48F-1D18A9856A87 last_name: Montesinos López orcid: 0000-0001-9179-6099 - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 citation: 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' 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' 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.' 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.' 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.' short: H. Semerádová, J.C. Montesinos López, E. Benková, Plant Communications 1 (2020). date_created: 2021-02-18T10:18:43Z date_published: 2020-05-11T00:00:00Z date_updated: 2024-03-27T23:30:46Z day: '11' ddc: - '580' department: - _id: EvBe doi: 10.1016/j.xplc.2020.100048 external_id: isi: - '000654052800010' pmid: - '33367243' file: - access_level: open_access checksum: 785b266d82a94b007cf40dbbe7c4847e content_type: application/pdf creator: dernst date_created: 2021-02-18T10:23:59Z date_updated: 2021-02-18T10:23:59Z file_id: '9161' file_name: 2020_PlantComm_Semeradova.pdf file_size: 840289 relation: main_file success: 1 file_date_updated: 2021-02-18T10:23:59Z has_accepted_license: '1' intvolume: ' 1' isi: 1 issue: '3' language: - iso: eng license: https://creativecommons.org/licenses/by-nc-nd/4.0/ month: '05' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 261821BC-B435-11E9-9278-68D0E5697425 grant_number: '24746' name: Molecular mechanisms of the cytokinin regulated endomembrane trafficking to coordinate plant organogenesis. - _id: 253E54C8-B435-11E9-9278-68D0E5697425 grant_number: ALTF710-2016 name: Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants publication: Plant Communications publication_identifier: issn: - 2590-3462 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '10135' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'All roads lead to auxin: Post-translational regulation of auxin transport by multiple hormonal pathways' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 1 year: '2020' ... --- _id: '10877' abstract: - lang: eng 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.' 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)." alternative_title: - EPiC Series in Computing article_processing_charge: No author: - first_name: Goran full_name: Frehse, Goran last_name: Frehse - first_name: Alessandro full_name: Abate, Alessandro last_name: Abate - first_name: Dieky full_name: Adzkiya, Dieky last_name: Adzkiya - first_name: Anna full_name: Becchi, Anna last_name: Becchi - first_name: Lei full_name: Bu, Lei last_name: Bu - first_name: Alessandro full_name: Cimatti, Alessandro last_name: Cimatti - first_name: Mirco full_name: Giacobbe, Mirco id: 3444EA5E-F248-11E8-B48F-1D18A9856A87 last_name: Giacobbe orcid: 0000-0001-8180-0904 - first_name: Alberto full_name: Griggio, Alberto last_name: Griggio - first_name: Sergio full_name: Mover, Sergio last_name: Mover - first_name: Muhammad Syifa'ul full_name: Mufid, Muhammad Syifa'ul last_name: Mufid - first_name: Idriss full_name: Riouak, Idriss last_name: Riouak - first_name: Stefano full_name: Tonetta, Stefano last_name: Tonetta - first_name: Enea full_name: Zaffanella, Enea last_name: Zaffanella citation: 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' 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' 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.' 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.' 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.' 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. conference: end_date: 2019-04-15 location: Montreal, Canada name: 'ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems' start_date: 2019-04-15 date_created: 2022-03-18T12:29:23Z date_published: 2019-05-25T00:00:00Z date_updated: 2022-05-17T07:09:47Z day: '25' ddc: - '000' department: - _id: ToHe doi: 10.29007/rjwn editor: - first_name: Goran full_name: Frehse, Goran last_name: Frehse - first_name: Matthias full_name: Althoff, Matthias last_name: Althoff file: - access_level: open_access checksum: 4b92e333db7b4e2349501a804dfede69 content_type: application/pdf creator: dernst date_created: 2022-05-17T06:55:49Z date_updated: 2022-05-17T06:55:49Z file_id: '11391' file_name: 2019_EPiCs_Frehse.pdf file_size: 346415 relation: main_file success: 1 file_date_updated: 2022-05-17T06:55:49Z has_accepted_license: '1' intvolume: ' 61' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 1-13 publication: ARCH19. 6th International Workshop on Applied Verification of Continuous and Hybrid Systems publication_identifier: issn: - 2398-7340 publication_status: published publisher: EasyChair quality_controlled: '1' scopus_import: '1' status: public title: 'ARCH-COMP19 Category Report: Hybrid systems with piecewise constant dynamics' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 61 year: '2019' ... --- _id: '441' article_processing_charge: No article_type: original author: - first_name: Nikita full_name: Kalinin, Nikita last_name: Kalinin - first_name: Mikhail full_name: Shkolnikov, Mikhail id: 35084A62-F248-11E8-B48F-1D18A9856A87 last_name: Shkolnikov orcid: 0000-0002-4310-178X citation: 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 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. 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. 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. short: N. Kalinin, M. Shkolnikov, European Journal of Mathematics 5 (2019) 909–928. date_created: 2018-12-11T11:46:29Z date_published: 2019-09-15T00:00:00Z date_updated: 2021-01-12T07:56:46Z day: '15' department: - _id: TaHa doi: 10.1007/s40879-018-0218-0 ec_funded: 1 external_id: arxiv: - '1711.02089' intvolume: ' 5' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.02089 month: '09' oa: 1 oa_version: Preprint page: 909–928 project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: European Journal of Mathematics publication_identifier: eissn: - 2199-6768 issn: - 2199-675X publication_status: published publisher: Springer Nature publist_id: '7382' quality_controlled: '1' scopus_import: 1 status: public title: Tropical formulae for summation over a part of SL(2,Z) type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 5 year: '2019' ... --- _id: '5793' abstract: - lang: eng 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. alternative_title: - MIMB author: - first_name: Yoichi full_name: Asaoka, Yoichi last_name: Asaoka - first_name: Hitoshi full_name: Morita, Hitoshi last_name: Morita - first_name: Hiroko full_name: Furumoto, Hiroko last_name: Furumoto - first_name: Carl-Philipp J full_name: Heisenberg, Carl-Philipp J id: 39427864-F248-11E8-B48F-1D18A9856A87 last_name: Heisenberg orcid: 0000-0002-0912-4566 - first_name: Makoto full_name: Furutani-Seiki, Makoto last_name: Furutani-Seiki 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' 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 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. 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. 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.' 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. 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. date_created: 2019-01-06T22:59:11Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:03:30Z day: '01' department: - _id: CaHe doi: 10.1007/978-1-4939-8910-2_14 editor: - first_name: Alexander full_name: Hergovich, Alexander last_name: Hergovich intvolume: ' 1893' language: - iso: eng month: '01' oa_version: None page: 167-181 publication: The hippo pathway publication_identifier: isbn: - 978-1-4939-8909-6 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: 1 series_title: Methods in Molecular Biology status: public title: Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1893 year: '2019' ... --- _id: '5887' abstract: - lang: eng 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.' article_processing_charge: No article_type: original author: - first_name: Gregory full_name: Demay, Gregory last_name: Demay - first_name: Peter full_name: Gazi, Peter id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87 last_name: Gazi - first_name: Ueli full_name: Maurer, Ueli last_name: Maurer - first_name: Bjorn full_name: Tackmann, Bjorn last_name: Tackmann citation: 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' 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' 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.' 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.' 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.' 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.' short: G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111. date_created: 2019-01-27T22:59:10Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:05:08Z day: '1' department: - _id: KrPi doi: 10.3233/JCS-181131 ec_funded: 1 intvolume: ' 27' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/166 month: '01' oa: 1 oa_version: Preprint page: 75-111 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Journal of Computer Security publication_identifier: issn: - 0926227X publication_status: published publisher: IOS Press quality_controlled: '1' scopus_import: '1' status: public title: 'Per-session security: Password-based cryptography revisited' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 27 year: '2019' ... --- _id: '6515' 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. author: - first_name: Ramsay full_name: Dyer, Ramsay last_name: Dyer - first_name: Gert full_name: Vegter, Gert last_name: Vegter - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 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 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 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. 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. ista: Dyer R, Vegter G, Wintraecken M. 2019. Simplices modelled on spaces of constant curvature. Journal of Computational Geometry . 10(1), 223–256. 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. date_created: 2019-06-03T09:35:33Z date_published: 2019-07-01T00:00:00Z date_updated: 2021-01-12T08:07:50Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.20382/jocg.v10i1a9 ec_funded: 1 file: - access_level: open_access checksum: 57b4df2f16a74eb499734ec8ee240178 content_type: application/pdf creator: mwintrae date_created: 2019-06-03T09:30:01Z date_updated: 2020-07-14T12:47:32Z file_id: '6516' file_name: mainJournalFinal.pdf file_size: 2170882 relation: main_file file_date_updated: 2020-07-14T12:47:32Z has_accepted_license: '1' intvolume: ' 10' issue: '1' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 223–256 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 'Journal of Computational Geometry ' publication_identifier: issn: - 1920-180X publication_status: published publisher: Carleton University quality_controlled: '1' scopus_import: 1 status: public title: Simplices modelled on spaces of constant curvature tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2019' ... --- _id: '6528' 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 article_number: '60' article_processing_charge: No author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 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' 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' 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. ieee: K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124. 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.' 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. conference: end_date: 2019-01-12 location: San Diego, CA, United States name: 'ITCS 2019: Innovations in Theoretical Computer Science' start_date: 2019-01-10 date_created: 2019-06-06T14:12:36Z date_published: 2019-01-10T00:00:00Z date_updated: 2021-01-12T08:07:53Z day: '10' ddc: - '000' department: - _id: KrPi doi: 10.4230/LIPICS.ITCS.2019.60 ec_funded: 1 file: - access_level: open_access checksum: f0ae1bb161431d9db3dea5ace082bfb5 content_type: application/pdf creator: dernst date_created: 2019-06-06T14:22:04Z date_updated: 2020-07-14T12:47:33Z file_id: '6529' file_name: 2019_LIPIcs_Pietrzak.pdf file_size: 558770 relation: main_file file_date_updated: 2020-07-14T12:47:33Z has_accepted_license: '1' intvolume: ' 124' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2018/627 month: '01' oa: 1 oa_version: Published Version project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 10th Innovations in Theoretical Computer Science Conference publication_identifier: isbn: - 978-3-95977-095-8 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Simple verifiable delay functions tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 124 year: '2019' ... --- _id: '6565' abstract: - lang: eng 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. article_number: '8715598' article_processing_charge: No author: - first_name: Atreyee full_name: Kundu, Atreyee last_name: Kundu - first_name: Miriam full_name: Garcia Soto, Miriam id: 4B3207F6-F248-11E8-B48F-1D18A9856A87 last_name: Garcia Soto orcid: 0000−0003−2936−5719 - first_name: Pavithra full_name: Prabhakar, Pavithra last_name: Prabhakar citation: 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' 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' 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. 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. 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. 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. short: A. Kundu, M. Garcia Soto, P. Prabhakar, in:, 5th Indian Control Conference Proceedings, IEEE, 2019. conference: end_date: 2019-01-11 location: Delhi, India name: ICC 2019 - Indian Control Conference start_date: 2019-01-09 date_created: 2019-06-17T06:57:33Z date_published: 2019-05-16T00:00:00Z date_updated: 2021-01-12T08:08:01Z day: '16' ddc: - '000' department: - _id: ToHe doi: 10.1109/INDIANCC.2019.8715598 file: - access_level: open_access checksum: d622a91af1e427f6b1e0ba8e18a2b767 content_type: application/pdf creator: dernst date_created: 2020-10-21T13:13:49Z date_updated: 2020-10-21T13:13:49Z file_id: '8687' file_name: 2019_ICC_Kundu.pdf file_size: 396031 relation: main_file success: 1 file_date_updated: 2020-10-21T13:13:49Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: 5th Indian Control Conference Proceedings publication_identifier: isbn: - 978-153866246-5 publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Formal synthesis of stabilizing controllers for periodically controlled linear switched systems type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6628' 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. author: - first_name: Gert full_name: Vegter, Gert last_name: Vegter - first_name: Mathijs full_name: Wintraecken, Mathijs id: 307CFBC8-F248-11E8-B48F-1D18A9856A87 last_name: Wintraecken orcid: 0000-0002-7472-2220 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.' 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. 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. 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. 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.' 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. conference: end_date: 2019-08-10 location: Edmonton, Canada name: 'CCCG: Canadian Conference in Computational Geometry' start_date: 2019-08-08 date_created: 2019-07-12T08:34:57Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:08:16Z day: '01' ddc: - '004' department: - _id: HeEd ec_funded: 1 file: - access_level: open_access checksum: ceabd152cfa55170d57763f9c6c60a53 content_type: application/pdf creator: mwintrae date_created: 2019-07-12T08:32:46Z date_updated: 2020-07-14T12:47:34Z file_id: '6629' file_name: IntrinsicExtrinsicCCCG2019.pdf file_size: 321176 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 275-279 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: The 31st Canadian Conference in Computational Geometry publication_status: published quality_controlled: '1' scopus_import: 1 status: public title: The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6648' 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 author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Ziga full_name: Virk, Ziga last_name: Virk - first_name: Hubert full_name: Wagner, Hubert id: 379CA8B8-F248-11E8-B48F-1D18A9856A87 last_name: Wagner citation: 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' 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' 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. 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. 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.' 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. conference: end_date: 2019-06-21 location: Portland, OR, United States name: 'SoCG 2019: Symposium on Computational Geometry' start_date: 2019-06-18 date_created: 2019-07-17T10:36:09Z date_published: 2019-06-01T00:00:00Z date_updated: 2021-01-12T08:08:23Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.4230/LIPICS.SOCG.2019.31 external_id: arxiv: - '1903.08510' file: - access_level: open_access checksum: 8ec8720730d4c789bf7b06540f1c29f4 content_type: application/pdf creator: dernst date_created: 2019-07-24T06:40:01Z date_updated: 2020-07-14T12:47:35Z file_id: '6666' file_name: 2019_LIPICS_Edelsbrunner.pdf file_size: 1355179 relation: main_file file_date_updated: 2020-07-14T12:47:35Z has_accepted_license: '1' intvolume: ' 129' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 31:1-31:14 project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: 35th International Symposium on Computational Geometry publication_identifier: isbn: - '9783959771047' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Topological data analysis in information space tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 129 year: '2019' ... --- _id: '6659' 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. 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. article_processing_charge: No article_type: original author: - first_name: Naoki full_name: Zenmyo, Naoki last_name: Zenmyo - first_name: Hiroki full_name: Tokumaru, Hiroki last_name: Tokumaru - first_name: Shohei full_name: Uchinomiya, Shohei last_name: Uchinomiya - first_name: Hirokazu full_name: Fuchida, Hirokazu last_name: Fuchida - first_name: Shigekazu full_name: Tabata, Shigekazu id: 4427179E-F248-11E8-B48F-1D18A9856A87 last_name: Tabata - first_name: Itaru full_name: Hamachi, Itaru last_name: Hamachi - first_name: Ryuichi full_name: Shigemoto, Ryuichi id: 499F3ABC-F248-11E8-B48F-1D18A9856A87 last_name: Shigemoto orcid: 0000-0001-8761-9444 - first_name: Akio full_name: Ojida, Akio last_name: Ojida citation: 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 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 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. 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. 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. 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. 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. date_created: 2019-07-21T21:59:16Z date_published: 2019-05-15T00:00:00Z date_updated: 2021-01-12T08:08:26Z day: '15' ddc: - '570' department: - _id: RySh doi: 10.1246/bcsj.20190034 ec_funded: 1 file: - access_level: open_access checksum: 186de511d6e0ca93f5d981e2443eb8cd content_type: application/pdf creator: dernst date_created: 2020-10-02T08:49:58Z date_updated: 2020-10-02T08:49:58Z file_id: '8594' file_name: 2019_BCSJ_Zenmyo.pdf file_size: 2464903 relation: main_file success: 1 file_date_updated: 2020-10-02T08:49:58Z has_accepted_license: '1' intvolume: ' 92' issue: '5' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 995-1000 project: - _id: 25CA28EA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694539' name: 'In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour' publication: Bulletin of the Chemical Society of Japan publication_identifier: issn: - '00092673' publication_status: published publisher: Bulletin of the Chemical Society of Japan quality_controlled: '1' scopus_import: '1' status: public title: Optimized reaction pair of the CysHis tag and Ni(II)-NTA probe for highly selective chemical labeling of membrane proteins type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 92 year: '2019' ... --- _id: '6725' abstract: - lang: eng 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." alternative_title: - LIPIcs author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov 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' 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' 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. 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. 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.' 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. 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. conference: end_date: 2019-07-12 location: Patras, Greece name: 'ICALP 2019: International Colloquim on Automata, Languages and Programming' start_date: 2019-07-08 date_created: 2019-07-29T12:23:29Z date_published: 2019-07-01T00:00:00Z date_updated: 2021-01-12T08:08:40Z day: '01' ddc: - '000' department: - _id: VlKo doi: 10.4230/LIPICS.ICALP.2019.77 ec_funded: 1 external_id: arxiv: - '1803.02289' file: - access_level: open_access checksum: f5ebee8eec6ae09e30365578ee63a492 content_type: application/pdf creator: dernst date_created: 2019-07-31T07:01:45Z date_updated: 2020-07-14T12:47:38Z file_id: '6738' file_name: 2019_LIPICS_Kolmogorov.pdf file_size: 575475 relation: main_file file_date_updated: 2020-07-14T12:47:38Z has_accepted_license: '1' intvolume: ' 132' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 77:1-77:12 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: 46th International Colloquium on Automata, Languages and Programming publication_identifier: isbn: - 978-3-95977-109-2 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Testing the complexity of a valued CSP language tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 132 year: '2019' ... --- _id: '6726' 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. article_processing_charge: No author: - first_name: Michael full_name: Walter, Michael id: 488F98B0-F248-11E8-B48F-1D18A9856A87 last_name: Walter orcid: 0000-0003-3186-2482 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' 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' 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.' 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.' ista: 'Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.' 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. conference: end_date: 2019-07-11 location: Rabat, Morocco name: 'AFRICACRYPT: International Conference on Cryptology in Africa' start_date: 2019-07-09 date_created: 2019-07-29T12:25:31Z date_published: 2019-06-29T00:00:00Z date_updated: 2023-02-23T12:50:15Z day: '29' department: - _id: KrPi doi: 10.1007/978-3-030-23696-0_9 ec_funded: 1 editor: - first_name: J full_name: Buchmann, J last_name: Buchmann - first_name: A full_name: Nitaj, A last_name: Nitaj - first_name: T full_name: Rachidi, T last_name: Rachidi intvolume: ' 11627' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2019/068 month: '06' oa: 1 oa_version: Preprint page: 157-180 place: Cham project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: Progress in Cryptology – AFRICACRYPT 2019 publication_identifier: eisbn: - 978-3-0302-3696-0 isbn: - 978-3-0302-3695-3 issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' series_title: LNCS status: public title: Sampling the integers with low relative error type: book_chapter user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 11627 year: '2019' ... --- _id: '6750' abstract: - lang: eng 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. ' article_number: '8854897' article_processing_charge: No article_type: original author: - first_name: Seyyed Ali full_name: Hashemi, Seyyed Ali last_name: Hashemi - first_name: Carlo full_name: Condo, Carlo last_name: Condo - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Warren J full_name: Gross, Warren J last_name: Gross citation: 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 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 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. 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. 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. short: S.A. Hashemi, C. Condo, M. Mondelli, W.J. Gross, IEEE Transactions on Signal Processing 67 (2019). date_created: 2019-07-31T09:51:14Z date_published: 2019-11-15T00:00:00Z date_updated: 2021-01-12T08:08:51Z day: '15' department: - _id: MaMo doi: 10.1109/TSP.2019.2944738 external_id: arxiv: - '1903.09203' intvolume: ' 67' issue: '22' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1903.09203 month: '11' oa: 1 oa_version: Preprint publication: IEEE Transactions on Signal Processing publication_identifier: issn: - 1053587X publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: 1 status: public title: Rate-flexible fast polar decoders type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 67 year: '2019' ... --- _id: '6759' 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." article_number: P3.17 article_processing_charge: No article_type: original author: - first_name: Vít full_name: Jelínek, Vít last_name: Jelínek - first_name: Martin full_name: Töpfer, Martin id: 4B865388-F248-11E8-B48F-1D18A9856A87 last_name: Töpfer citation: 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 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 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. 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. ista: Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17. 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). date_created: 2019-08-04T21:59:20Z date_published: 2019-07-19T00:00:00Z date_updated: 2022-03-18T12:32:02Z day: '19' ddc: - '510' department: - _id: DaAl doi: 10.37236/8096 ec_funded: 1 external_id: arxiv: - '1808.04148' file: - access_level: open_access checksum: 20fc366fc6683ef0b074a019b73a663a content_type: application/pdf creator: dernst date_created: 2019-08-05T06:46:55Z date_updated: 2020-07-14T12:47:39Z file_id: '6764' file_name: 2019_eJourCombinatorics_Jelinek.pdf file_size: 533697 relation: main_file file_date_updated: 2020-07-14T12:47:39Z has_accepted_license: '1' intvolume: ' 26' issue: '3' language: - iso: eng month: '07' oa: 1 oa_version: Published Version project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: Electronic Journal of Combinatorics publication_identifier: eissn: - '10778926' publication_status: published publisher: Electronic Journal of Combinatorics quality_controlled: '1' scopus_import: '1' status: public title: On grounded L-graphs and their relatives tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2019' ... --- _id: '6822' 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." alternative_title: - LNCS author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Petr full_name: Novotny, Petr last_name: Novotny 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' 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' 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. 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. 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.' 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. conference: end_date: 2019-09-13 location: Brussels, Belgium name: 'RP: Reachability Problems' start_date: 2019-09-11 date_created: 2019-08-19T07:58:10Z date_published: 2019-09-06T00:00:00Z date_updated: 2021-01-12T08:09:12Z day: '06' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-030-30806-3_1 file: - access_level: open_access checksum: 45ebbc709af2b247d28c7c293c01504b content_type: application/pdf creator: gavni date_created: 2019-08-19T07:56:40Z date_updated: 2020-07-14T12:47:41Z file_id: '6823' file_name: prob.pdf file_size: 436635 relation: main_file file_date_updated: 2020-07-14T12:47:41Z has_accepted_license: '1' intvolume: ' 11674' language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: 1-12 project: - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: ' Proceedings of the 13th International Conference of Reachability Problems' publication_identifier: isbn: - 978-303030805-6 issn: - 0302-9743 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: 1 status: public title: Bidding games on Markov decision processes type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11674 year: '2019' ... --- _id: '6887' 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 article_number: '7' article_processing_charge: No author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Wolfgang full_name: Dvorák, Wolfgang last_name: Dvorák - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Alexander full_name: Svozil, Alexander last_name: Svozil 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' 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' 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. 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. 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.' 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. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:07:58Z date_published: 2019-08-01T00:00:00Z date_updated: 2022-08-12T10:54:34Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.7 ec_funded: 1 file: - access_level: open_access checksum: e1f0e4061212454574f34a1368d018ec content_type: application/pdf creator: kschuh date_created: 2019-10-01T08:20:30Z date_updated: 2020-07-14T12:47:43Z file_id: '6922' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 730112 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Leibniz International Proceedings in Informatics publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Near-linear time algorithms for Streett objectives in graphs and MDPs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 140 year: '2019' ... --- _id: '6888' abstract: - lang: eng 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. alternative_title: - ICRA article_number: '8793840' article_processing_charge: No author: - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Manuel full_name: Zimmer, Manuel last_name: Zimmer - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Radu full_name: Grosu, Radu last_name: Grosu citation: 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' 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' 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. 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.' 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. short: M. Lechner, R. Hasani, M. Zimmer, T.A. Henzinger, R. Grosu, in:, Proceedings - IEEE International Conference on Robotics and Automation, IEEE, 2019. conference: end_date: 2019-05-24 location: Montreal, QC, Canada name: 'ICRA: International Conference on Robotics and Automation' start_date: 2019-05-20 date_created: 2019-09-18T08:09:51Z date_published: 2019-05-01T00:00:00Z date_updated: 2021-01-12T08:09:28Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.1109/icra.2019.8793840 file: - access_level: open_access checksum: f5545a6b60c3ffd01feb3613f81d03b6 content_type: application/pdf creator: dernst date_created: 2020-10-08T17:30:38Z date_updated: 2020-10-08T17:30:38Z file_id: '8636' file_name: 2019_ICRA_Lechner.pdf file_size: 3265107 relation: main_file success: 1 file_date_updated: 2020-10-08T17:30:38Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication: Proceedings - IEEE International Conference on Robotics and Automation publication_identifier: isbn: - '9781538660270' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: '1' status: public title: Designing worm-inspired neural networks for interpretable robotic control type: conference user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 2019-May year: '2019' ... --- _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 article_number: '20' article_processing_charge: No author: - first_name: Milad full_name: Aghajohari, Milad last_name: Aghajohari - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 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' 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' 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. 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.' 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.' 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. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:06:58Z date_published: 2019-08-01T00:00:00Z date_updated: 2022-01-26T08:27:10Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPICS.CONCUR.2019.20 external_id: arxiv: - '1905.03588' file: - access_level: open_access checksum: 4df6d3575c506edb17215adada03cc8e content_type: application/pdf creator: kschuh date_created: 2019-09-27T12:21:38Z date_updated: 2020-07-14T12:47:43Z file_id: '6915' file_name: 2019_LIPIcs_Aghajohari.pdf file_size: 741425 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng license: https://creativecommons.org/licenses/by/3.0/ month: '08' oa: 1 oa_version: Published Version project: - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Determinacy in discrete-bidding infinite-duration games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode name: Creative Commons Attribution 3.0 Unported (CC BY 3.0) short: CC BY (3.0) type: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 140 year: '2019' ... --- _id: '6885' abstract: - lang: eng 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. ' alternative_title: - LIPIcs article_number: '27' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan last_name: Otop citation: 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' 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' 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. 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.' 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.' 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. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:06:14Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:09:27Z day: '01' ddc: - '000' department: - _id: ToHe - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.27 file: - access_level: open_access checksum: 4985e26e1572d1575d64d38acabd71d6 content_type: application/pdf creator: kschuh date_created: 2019-09-27T12:09:35Z date_updated: 2020-07-14T12:47:43Z file_id: '6914' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 538120 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Long-run average behavior of vector addition systems with states tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 140 year: '2019' ... --- _id: '6889' abstract: - lang: eng 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. ' alternative_title: - LIPIcs article_number: '6' author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Nir full_name: Piterman, Nir last_name: Piterman 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' 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' 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. 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.' ista: 'Chatterjee K, Piterman N. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 140, 6.' 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. short: K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-08-30 location: Amsterdam, Netherlands name: 'CONCUR: International Conference on Concurrency Theory' start_date: 2019-08-27 date_created: 2019-09-18T08:11:43Z date_published: 2019-08-01T00:00:00Z date_updated: 2021-01-12T08:09:28Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.4230/LIPICS.CONCUR.2019.6 file: - access_level: open_access checksum: 7b2ecfd4d9d02360308c0ca986fc10a7 content_type: application/pdf creator: kschuh date_created: 2019-10-01T08:49:45Z date_updated: 2020-07-14T12:47:43Z file_id: '6923' file_name: 2019_LIPIcs_Chatterjee.pdf file_size: 509163 relation: main_file file_date_updated: 2020-07-14T12:47:43Z has_accepted_license: '1' intvolume: ' 140' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Combinations of Qualitative Winning for Stochastic Parity Games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 140 year: '2019' ... --- _id: '6931' abstract: - lang: eng 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." alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Thomas full_name: Nowak, Thomas last_name: Nowak - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 citation: 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' 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' 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. 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. 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.' 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. conference: end_date: 2019-10-18 location: Budapest, Hungary name: 'DISC: International Symposium on Distributed Computing' start_date: 2019-10-14 date_created: 2019-10-08T12:41:38Z date_published: 2019-01-01T00:00:00Z date_updated: 2021-01-12T08:09:38Z ddc: - '004' department: - _id: DaAl doi: 10.4230/LIPICS.DISC.2019.29 ec_funded: 1 external_id: arxiv: - '1908.02743' file: - access_level: open_access checksum: 2d2202f90c6ac991e50876451627c4b5 content_type: application/pdf creator: jrybicki date_created: 2019-10-08T12:47:19Z date_updated: 2020-07-14T12:47:44Z file_id: '6934' file_name: LIPIcs-DISC-2019-29.pdf file_size: 639378 relation: main_file file_date_updated: 2020-07-14T12:47:44Z has_accepted_license: '1' intvolume: ' 146' keyword: - consensus - approximate agreement - Byzantine faults - chordal graphs - lattice agreement language: - iso: eng oa: 1 oa_version: Published Version page: 29:1--29:17 project: - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships publication: 33rd International Symposium on Distributed Computing publication_identifier: eisbn: - 978-3-95977-126-9 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Byzantine approximate agreement on graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 146 year: '2019' ... --- _id: '6985' abstract: - lang: eng 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. article_number: '8851954' author: - first_name: Ramin full_name: Hasani, Ramin last_name: Hasani - first_name: Alexander full_name: Amini, Alexander last_name: Amini - first_name: Mathias full_name: Lechner, Mathias id: 3DC22916-F248-11E8-B48F-1D18A9856A87 last_name: Lechner - first_name: Felix full_name: Naser, Felix last_name: Naser - first_name: Radu full_name: Grosu, Radu last_name: Grosu - first_name: Daniela full_name: Rus, Daniela last_name: Rus citation: 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' 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' 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. 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. 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.' 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. conference: end_date: 2019-07-19 location: Budapest, Hungary name: 'IJCNN: International Joint Conference on Neural Networks' start_date: 2019-07-14 date_created: 2019-11-04T15:59:58Z date_published: 2019-09-30T00:00:00Z date_updated: 2021-01-12T08:11:19Z day: '30' department: - _id: ToHe doi: 10.1109/ijcnn.2019.8851954 external_id: arxiv: - '1809.03864' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.03864 month: '09' oa: 1 oa_version: Preprint publication: Proceedings of the International Joint Conference on Neural Networks publication_identifier: isbn: - '9781728119854' publication_status: published publisher: IEEE quality_controlled: '1' scopus_import: 1 status: public title: Response characterization for auditing cell dynamics in long short-term memory networks type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '7007' abstract: - lang: eng 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.' article_number: '218' article_type: original author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: S. Hamed full_name: Hassani, S. Hamed last_name: Hassani - first_name: Rüdiger full_name: Urbanke, Rüdiger last_name: Urbanke citation: 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 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. 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. 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. short: M. Mondelli, S.H. Hassani, R. Urbanke, Algorithms 12 (2019). date_created: 2019-11-12T14:46:19Z date_published: 2019-10-18T00:00:00Z date_updated: 2023-02-23T12:49:28Z day: '18' ddc: - '510' department: - _id: MaMo doi: 10.3390/a12100218 external_id: arxiv: - '1801.03153' file: - access_level: open_access checksum: 267756d8f9db572f496cd1663c89d59a content_type: application/pdf creator: dernst date_created: 2019-11-12T14:48:45Z date_updated: 2020-07-14T12:47:47Z file_id: '7008' file_name: 2019_Algorithms_Mondelli.pdf file_size: 696791 relation: main_file file_date_updated: 2020-07-14T12:47:47Z has_accepted_license: '1' intvolume: ' 12' issue: '10' language: - iso: eng month: '10' oa: 1 oa_version: Published Version publication: Algorithms publication_identifier: issn: - 1999-4893 publication_status: published publisher: MDPI quality_controlled: '1' related_material: record: - id: '6675' relation: earlier_version status: public scopus_import: 1 status: public title: A new coding paradigm for the primitive relay channel tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2019' ... --- _id: '7035' abstract: - lang: eng 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.' article_processing_charge: No author: - first_name: Gyorgy Pal full_name: Geher, Gyorgy Pal last_name: Geher - first_name: Tamas full_name: Titkos, Tamas last_name: Titkos - first_name: Daniel full_name: Virosztek, Daniel id: 48DB45DA-F248-11E8-B48F-1D18A9856A87 last_name: Virosztek orcid: 0000-0003-1109-5511 citation: 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.' 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.' 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. 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. 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. 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. conference: end_date: 2019-01-30 location: Kyoto, Japan name: Research on isometries as preserver problems and related topics start_date: 2019-01-28 date_created: 2019-11-18T15:39:53Z date_published: 2019-01-30T00:00:00Z date_updated: 2021-01-12T08:11:33Z day: '30' department: - _id: LaEr intvolume: ' 2125' language: - iso: eng main_file_link: - open_access: '1' url: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/2125.html month: '01' oa: 1 oa_version: Submitted Version page: 34-41 publication: Kyoto RIMS Kôkyûroku publication_status: published publisher: Research Institute for Mathematical Sciences, Kyoto University quality_controlled: '1' status: public title: Dirac masses and isometric rigidity type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2125 year: '2019' ... --- _id: '7171' abstract: - lang: ger 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!" article_processing_charge: No citation: 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' 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' 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.' 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.' 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.' 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.' date_created: 2019-12-11T14:15:56Z date_published: 2019-10-30T00:00:00Z date_updated: 2021-12-22T14:40:58Z day: '30' department: - _id: ChLa doi: 10.1007/978-3-658-26763-6 edition: '1' editor: - first_name: Kristian full_name: Kersting, Kristian last_name: Kersting - first_name: Christoph full_name: Lampert, Christoph id: 40C20FD2-F248-11E8-B48F-1D18A9856A87 last_name: Lampert orcid: 0000-0001-8622-7887 - first_name: Constantin full_name: Rothkopf, Constantin last_name: Rothkopf language: - iso: ger month: '10' oa_version: None page: XIV, 245 place: Wiesbaden publication_identifier: eisbn: - 978-3-658-26763-6 isbn: - 978-3-658-26762-9 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - description: News on IST Website relation: press_release url: https://ist.ac.at/en/news/book-release-how-machines-learn/ status: public title: 'Wie Maschinen Lernen: Künstliche Intelligenz Verständlich Erklärt' type: book_editor user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2019' ... --- _id: '7401' abstract: - lang: eng 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. ' alternative_title: - LIPIcs article_number: '39' article_processing_charge: No author: - first_name: Radoslav full_name: Fulek, Radoslav id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87 last_name: Fulek orcid: 0000-0001-8485-1774 - first_name: Jan full_name: Kyncl, Jan last_name: Kyncl citation: 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' 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' 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. 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. 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.' 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. short: R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. conference: end_date: 2019-06-21 location: Portland, OR, United States name: 'SoCG: Symposium on Computational Geometry' start_date: 2019-06-18 date_created: 2020-01-29T16:17:05Z date_published: 2019-06-01T00:00:00Z date_updated: 2021-01-12T08:13:24Z day: '01' ddc: - '000' department: - _id: UlWa doi: 10.4230/LIPICS.SOCG.2019.39 external_id: arxiv: - '1903.08637' file: - access_level: open_access checksum: aac37b09118cc0ab58cf77129e691f8c content_type: application/pdf creator: dernst date_created: 2020-02-04T09:14:31Z date_updated: 2020-07-14T12:47:57Z file_id: '7445' file_name: 2019_LIPIcs_Fulek.pdf file_size: 628347 relation: main_file file_date_updated: 2020-07-14T12:47:57Z has_accepted_license: '1' intvolume: ' 129' language: - iso: eng month: '06' oa: 1 oa_version: Published Version project: - _id: 261FA626-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02281 name: Eliminating intersections in drawings of graphs publication: 35th International Symposium on Computational Geometry (SoCG 2019) publication_identifier: isbn: - 978-3-95977-104-7 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Z_2-Genus of graphs and minimum rank of partial symmetric matrices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 129 year: '2019' ...