--- _id: '7396' abstract: - lang: eng text: The angular momentum of molecules, or, equivalently, their rotation in three-dimensional space, is ideally suited for quantum control. Molecular angular momentum is naturally quantized, time evolution is governed by a well-known Hamiltonian with only a few accurately known parameters, and transitions between rotational levels can be driven by external fields from various parts of the electromagnetic spectrum. Control over the rotational motion can be exerted in one-, two-, and many-body scenarios, thereby allowing one to probe Anderson localization, target stereoselectivity of bimolecular reactions, or encode quantum information to name just a few examples. The corresponding approaches to quantum control are pursued within separate, and typically disjoint, subfields of physics, including ultrafast science, cold collisions, ultracold gases, quantum information science, and condensed-matter physics. It is the purpose of this review to present the various control phenomena, which all rely on the same underlying physics, within a unified framework. To this end, recall the Hamiltonian for free rotations, assuming the rigid rotor approximation to be valid, and summarize the different ways for a rotor to interact with external electromagnetic fields. These interactions can be exploited for control—from achieving alignment, orientation, or laser cooling in a one-body framework, steering bimolecular collisions, or realizing a quantum computer or quantum simulator in the many-body setting. article_number: '035005 ' article_processing_charge: No article_type: original author: - first_name: Christiane P. full_name: Koch, Christiane P. last_name: Koch - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Dominique full_name: Sugny, Dominique last_name: Sugny citation: ama: Koch CP, Lemeshko M, Sugny D. Quantum control of molecular rotation. Reviews of Modern Physics. 2019;91(3). doi:10.1103/revmodphys.91.035005 apa: Koch, C. P., Lemeshko, M., & Sugny, D. (2019). Quantum control of molecular rotation. Reviews of Modern Physics. American Physical Society. https://doi.org/10.1103/revmodphys.91.035005 chicago: Koch, Christiane P., Mikhail Lemeshko, and Dominique Sugny. “Quantum Control of Molecular Rotation.” Reviews of Modern Physics. American Physical Society, 2019. https://doi.org/10.1103/revmodphys.91.035005. ieee: C. P. Koch, M. Lemeshko, and D. Sugny, “Quantum control of molecular rotation,” Reviews of Modern Physics, vol. 91, no. 3. American Physical Society, 2019. ista: Koch CP, Lemeshko M, Sugny D. 2019. Quantum control of molecular rotation. Reviews of Modern Physics. 91(3), 035005. mla: Koch, Christiane P., et al. “Quantum Control of Molecular Rotation.” Reviews of Modern Physics, vol. 91, no. 3, 035005, American Physical Society, 2019, doi:10.1103/revmodphys.91.035005. short: C.P. Koch, M. Lemeshko, D. Sugny, Reviews of Modern Physics 91 (2019). date_created: 2020-01-29T16:04:19Z date_published: 2019-09-18T00:00:00Z date_updated: 2024-02-28T13:15:33Z day: '18' department: - _id: MiLe doi: 10.1103/revmodphys.91.035005 external_id: arxiv: - '1810.11338' isi: - '000486661700001' intvolume: ' 91' isi: 1 issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1810.11338 month: '09' oa: 1 oa_version: Preprint project: - _id: 26031614-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P29902 name: Quantum rotations in the presence of a many-body environment publication: Reviews of Modern Physics publication_identifier: eissn: - 1539-0756 issn: - 0034-6861 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Quantum control of molecular rotation type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 91 year: '2019' ... --- _id: '7606' abstract: - lang: eng text: We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is sometimes used to lower bound the mutual information between signals and channel outputs. Our result provides a corresponding upper bound. article_number: '8989292' article_processing_charge: No author: - first_name: Michal full_name: Hledik, Michal id: 4171253A-F248-11E8-B48F-1D18A9856A87 last_name: Hledik - first_name: Thomas R full_name: Sokolowski, Thomas R id: 3E999752-F248-11E8-B48F-1D18A9856A87 last_name: Sokolowski orcid: 0000-0002-1287-3779 - 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 citation: ama: 'Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information. In: IEEE Information Theory Workshop, ITW 2019. IEEE; 2019. doi:10.1109/ITW44776.2019.8989292' apa: 'Hledik, M., Sokolowski, T. R., & Tkačik, G. (2019). A tight upper bound on mutual information. In IEEE Information Theory Workshop, ITW 2019. Visby, Sweden: IEEE. https://doi.org/10.1109/ITW44776.2019.8989292' chicago: Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper Bound on Mutual Information.” In IEEE Information Theory Workshop, ITW 2019. IEEE, 2019. https://doi.org/10.1109/ITW44776.2019.8989292. ieee: M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual information,” in IEEE Information Theory Workshop, ITW 2019, Visby, Sweden, 2019. ista: Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information. IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292. mla: Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” IEEE Information Theory Workshop, ITW 2019, 8989292, IEEE, 2019, doi:10.1109/ITW44776.2019.8989292. short: M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop, ITW 2019, IEEE, 2019. conference: end_date: 2019-08-28 location: Visby, Sweden name: Information Theory Workshop start_date: 2019-08-25 date_created: 2020-03-22T23:00:47Z date_published: 2019-08-01T00:00:00Z date_updated: 2024-03-06T14:22:51Z day: '01' department: - _id: GaTk doi: 10.1109/ITW44776.2019.8989292 ec_funded: 1 external_id: arxiv: - '1812.01475' isi: - '000540384500015' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1812.01475 month: '08' oa: 1 oa_version: Preprint project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: IEEE Information Theory Workshop, ITW 2019 publication_identifier: isbn: - '9781538669006' publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '15020' relation: dissertation_contains status: public scopus_import: '1' status: public title: A tight upper bound on mutual information type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6933' abstract: - lang: eng text: "We design fast deterministic algorithms for distance computation in the CONGESTED CLIQUE model. Our key contributions include:\r\n\r\n - A (2+ε)-approximation for all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n - A (1+ε)-approximation for multi-source shortest paths problem from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds." article_processing_charge: No author: - first_name: Keren full_name: Censor-Hillel, Keren last_name: Censor-Hillel - first_name: Michal full_name: Dory, Michal last_name: Dory - first_name: Janne full_name: Korhonen, Janne id: C5402D42-15BC-11E9-A202-CA2BE6697425 last_name: Korhonen - first_name: Dean full_name: Leitersdorf, Dean last_name: Leitersdorf citation: ama: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. ACM; 2019:74-83. doi:10.1145/3293611.3331633' apa: 'Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2019). Fast approximate shortest paths in the congested clique. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331633' chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, 74–83. ACM, 2019. https://doi.org/10.1145/3293611.3331633. ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83. ista: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing, 74–83.' mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633. short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83. conference: end_date: 2019-08-02 location: Toronto, ON, Canada name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2019-07-29 date_created: 2019-10-08T12:48:42Z date_published: 2019-08-01T00:00:00Z date_updated: 2024-03-07T14:43:38Z day: '01' department: - _id: DaAl doi: 10.1145/3293611.3331633 external_id: arxiv: - '1903.05956' isi: - '000570442000011' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1903.05956 month: '08' oa: 1 oa_version: Preprint page: 74-83 publication: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin publication_identifier: isbn: - '9781450362177' publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '7939' relation: later_version status: public scopus_import: '1' status: public title: Fast approximate shortest paths in the congested clique type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2019' ... --- _id: '6392' abstract: - lang: eng text: "The regulation of gene expression is one of the most fundamental processes in living systems. In recent years, thanks to advances in sequencing technology and automation, it has become possible to study gene expression quantitatively, genome-wide and in high-throughput. This leads to the possibility of exploring changes in gene expression in the context of many external perturbations and their combinations, and thus of characterising the basic principles governing gene regulation. In this thesis, I present quantitative experimental approaches to studying transcriptional and protein level changes in response to combinatorial drug treatment, as well as a theoretical data-driven approach to analysing thermodynamic principles guiding transcription of protein coding genes. \r\nIn the first part of this work, I present a novel methodological framework for quantifying gene expression changes in drug combinations, termed isogrowth profiling. External perturbations through small molecule drugs influence the growth rate of the cell, leading to wide-ranging changes in cellular physiology and gene expression. This confounds the gene expression changes specifically elicited by the particular drug. Combinatorial perturbations, owing to the increased stress they exert, influence the growth rate even more strongly and hence suffer the convolution problem to a greater extent when measuring gene expression changes. Isogrowth profiling is a way to experimentally abstract non-specific, growth rate related changes, by performing the measurement using varying ratios of two drugs at such concentrations that the overall inhibition rate is constant. Using a robotic setup for automated high-throughput re-dilution culture of Saccharomyces cerevisiae, the budding yeast, I investigate all pairwise interactions of four small molecule drugs through sequencing RNA along a growth isobole. Through principal component analysis, I demonstrate here that isogrowth profiling can uncover drug-specific as well as drug-interaction-specific gene expression changes. I show that drug-interaction-specific gene expression changes can be used for prediction of higher-order drug interactions. I propose a simplified generalised framework of isogrowth profiling, with few measurements needed for each drug pair, enabling the broad application of isogrowth profiling to high-throughput screening of inhibitors of cellular growth and beyond. Such high-throughput screenings of gene expression changes specific to pairwise drug interactions will be instrumental for predicting the higher-order interactions of the drugs.\r\n\r\nIn the second part of this work, I extend isogrowth profiling to single-cell measurements of gene expression, characterising population heterogeneity in the budding yeast in response to combinatorial drug perturbation while controlling for non-specific growth rate effects. Through flow cytometry of strains with protein products fused to green fluorescent protein, I discover multiple proteins with bi-modally distributed expression levels in the population in response to drug treatment. I characterize more closely the effect of an ionic stressor, lithium chloride, and find that it inhibits the splicing of mRNA, most strongly affecting ribosomal protein transcripts and leading to a bi-stable behaviour of a small ribosomal subunit protein Rps22B. Time-lapse microscopy of a microfluidic culture system revealed that the induced Rps22B heterogeneity leads to preferential survival of Rps22B-low cells after long starvation, but to preferential proliferation of Rps22B-high cells after short starvation. Overall, this suggests that yeast cells might use splicing of ribosomal genes for bet-hedging in fluctuating environments. I give specific examples of how further exploration of cellular heterogeneity in yeast in response to external perturbation has the potential to reveal yet-undiscovered gene regulation circuitry.\r\n\r\nIn the last part of this thesis, a re-analysis of a published sequencing dataset of nascent elongating transcripts is used to characterise the thermodynamic constraints for RNA polymerase II (RNAP) elongation. Population-level data on RNAP position throughout the transcribed genome with single nucleotide resolution are used to infer the sequence specific thermodynamic determinants of RNAP pausing and backtracking. This analysis reveals that the basepairing strength of the eight nucleotide-long RNA:DNA duplex relative to the basepairing strength of the same sequence when in DNA:DNA duplex, and the change in this quantity during RNA polymerase movement, is the key determinant of RNAP pausing. This is true for RNAP pausing while elongating, but also of RNAP pausing while backtracking and of the backtracking length. The quantitative dependence of RNAP pausing on basepairing energetics is used to infer the increase in pausing due to transcriptional mismatches, leading to a hypothesis that pervasive RNA polymerase II pausing is due to basepairing energetics, as an evolutionary cost for increased RNA polymerase II fidelity.\r\n\r\nThis work advances our understanding of the general principles governing gene expression, with the goal of making computational predictions of single-cell gene expression responses to combinatorial perturbations based on the individual perturbations possible. This ability would substantially facilitate the design of drug combination treatments and, in the long term, lead to our increased ability to more generally design targeted manipulations to any biological system. " acknowledged_ssus: - _id: LifeSc - _id: M-Shop - _id: Bio alternative_title: - IST Austria Thesis author: - first_name: Martin full_name: Lukacisin, Martin id: 298FFE8C-F248-11E8-B48F-1D18A9856A87 last_name: Lukacisin orcid: 0000-0001-6549-4177 citation: ama: Lukacisin M. Quantitative investigation of gene expression principles through combinatorial drug perturbation and theory. 2019. doi:10.15479/AT:ISTA:6392 apa: Lukacisin, M. (2019). Quantitative investigation of gene expression principles through combinatorial drug perturbation and theory. IST Austria. https://doi.org/10.15479/AT:ISTA:6392 chicago: Lukacisin, Martin. “Quantitative Investigation of Gene Expression Principles through Combinatorial Drug Perturbation and Theory.” IST Austria, 2019. https://doi.org/10.15479/AT:ISTA:6392. ieee: M. Lukacisin, “Quantitative investigation of gene expression principles through combinatorial drug perturbation and theory,” IST Austria, 2019. ista: Lukacisin M. 2019. Quantitative investigation of gene expression principles through combinatorial drug perturbation and theory. IST Austria. mla: Lukacisin, Martin. Quantitative Investigation of Gene Expression Principles through Combinatorial Drug Perturbation and Theory. IST Austria, 2019, doi:10.15479/AT:ISTA:6392. short: M. Lukacisin, Quantitative Investigation of Gene Expression Principles through Combinatorial Drug Perturbation and Theory, IST Austria, 2019. date_created: 2019-05-09T19:53:00Z date_published: 2019-05-09T00:00:00Z date_updated: 2023-09-22T09:19:41Z day: '09' ddc: - '570' department: - _id: ToBo doi: 10.15479/AT:ISTA:6392 extern: '1' file: - access_level: closed checksum: 829bda074444857c7935171237bb7c0c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: mlukacisin date_created: 2019-05-10T13:51:49Z date_updated: 2020-07-14T12:47:29Z embargo_to: open_access file_id: '6409' file_name: Thesis_Draft_v3.4Final.docx file_size: 43740796 relation: hidden - access_level: open_access checksum: 56cb5e97f5f8fc41692401b53832d8e0 content_type: application/pdf creator: mlukacisin date_created: 2019-05-10T14:13:42Z date_updated: 2021-02-11T11:17:16Z embargo: 2020-04-17 file_id: '6410' file_name: Thesis_Draft_v3.4FinalA.pdf file_size: 35228388 relation: main_file file_date_updated: 2021-02-11T11:17:16Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '103' publication_identifier: isbn: - 978-3-99078-001-5 issn: - 2663-337X publication_status: published publisher: IST Austria related_material: record: - id: '1029' relation: part_of_dissertation status: public status: public supervisor: - first_name: Mark Tobias full_name: Bollenbach, Mark Tobias id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87 last_name: Bollenbach orcid: 0000-0003-4398-476X title: Quantitative investigation of gene expression principles through combinatorial drug perturbation and theory type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6435' abstract: - lang: eng text: "Social insect colonies tend to have numerous members which function together like a single organism in such harmony that the term ``super-organism'' is often used. In this analogy the reproductive caste is analogous to the primordial germ\r\ncells of a metazoan, while the sterile worker caste corresponds to somatic cells. The worker castes, like tissues, are\r\nin charge of all functions of a living being, besides reproduction. The establishment of new super-organismal units\r\n(i.e. new colonies) is accomplished by the co-dependent castes. The term oftentimes goes beyond a metaphor. We invoke it when we speak about the metabolic rate, thermoregulation, nutrient regulation and gas exchange of a social insect colony. Furthermore, we assert that the super-organism has an immune system, and benefits from ``social immunity''.\r\n\r\nSocial immunity was first summoned by evolutionary biologists to resolve the apparent discrepancy between the expected high frequency of disease outbreak amongst numerous, closely related tightly-interacting hosts, living in stable and microbially-rich environments, against the exceptionally scarce epidemic accounts in natural populations. Social\r\nimmunity comprises a multi-layer assembly of behaviours which have evolved to effectively keep the pathogenic enemies of a colony at bay. The field of social immunity has drawn interest, as it becomes increasingly urgent to stop\r\nthe collapse of pollinator species and curb the growth of invasive pests. In the past decade, several mechanisms of\r\nsocial immune responses have been dissected, but many more questions remain open.\r\n\r\nI present my work in two experimental chapters. In the first, I use invasive garden ants (*Lasius neglectus*) to study how pathogen load and its distribution among nestmates affect the grooming response of the group. Any given group of ants will carry out the same total grooming work, but will direct their grooming effort towards individuals\r\ncarrying a relatively higher spore load. Contrary to expectation, the highest risk of transmission does not stem from grooming highly contaminated ants, but instead, we suggest that the grooming response likely minimizes spore loss to the environment, reducing contamination from inadvertent pickup from the substrate.\r\n\r\nThe second is a comparative developmental approach. I follow black garden ant queens (*Lasius niger*) and their colonies from mating flight, through hibernation for a year. Colonies which grow fast from the start, have a lower chance of survival through hibernation, and those which survive grow at a lower pace later. This is true for colonies of naive\r\nand challenged queens. Early pathogen exposure of the queens changes colony dynamics in an unexpected way: colonies from exposed queens are more likely to grow slowly and recover in numbers only after they survive hibernation.\r\n\r\nIn addition to the two experimental chapters, this thesis includes a co-authored published review on organisational\r\nimmunity, where we enlist the experimental evidence and theoretical framework on which this hypothesis is built,\r\nidentify the caveats and underline how the field is ripe to overcome them. In a final chapter, I describe my part in\r\ntwo collaborative efforts, one to develop an image-based tracker, and the second to develop a classifier for ant\r\nbehaviour." acknowledged_ssus: - _id: Bio - _id: ScienComp - _id: M-Shop - _id: LifeSc alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Barbara E full_name: Casillas Perez, Barbara E id: 351ED2AA-F248-11E8-B48F-1D18A9856A87 last_name: Casillas Perez citation: ama: Casillas Perez BE. Collective defenses of garden ants against a fungal pathogen. 2019. doi:10.15479/AT:ISTA:6435 apa: Casillas Perez, B. E. (2019). Collective defenses of garden ants against a fungal pathogen. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6435 chicago: Casillas Perez, Barbara E. “Collective Defenses of Garden Ants against a Fungal Pathogen.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6435. ieee: B. E. Casillas Perez, “Collective defenses of garden ants against a fungal pathogen,” Institute of Science and Technology Austria, 2019. ista: Casillas Perez BE. 2019. Collective defenses of garden ants against a fungal pathogen. Institute of Science and Technology Austria. mla: Casillas Perez, Barbara E. Collective Defenses of Garden Ants against a Fungal Pathogen. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6435. short: B.E. Casillas Perez, Collective Defenses of Garden Ants against a Fungal Pathogen, Institute of Science and Technology Austria, 2019. date_created: 2019-05-13T08:58:35Z date_published: 2019-05-07T00:00:00Z date_updated: 2023-09-07T12:57:04Z day: '07' ddc: - '570' - '006' - '578' - '592' degree_awarded: PhD department: - _id: SyCr doi: 10.15479/AT:ISTA:6435 ec_funded: 1 file: - access_level: open_access checksum: 6daf2d2086111aa8fd3fbc919a3e2833 content_type: application/pdf creator: casillas date_created: 2019-05-13T09:16:20Z date_updated: 2021-02-11T11:17:15Z embargo: 2020-05-08 file_id: '6438' file_name: tesisDoctoradoBC.pdf file_size: 3895187 relation: main_file - access_level: closed checksum: 3d221aaff7559a7060230a1ff610594f content_type: application/zip creator: casillas date_created: 2019-05-13T09:16:20Z date_updated: 2020-07-14T12:47:30Z embargo_to: open_access file_id: '6439' file_name: tesisDoctoradoBC.zip file_size: 7365118 relation: source_file file_date_updated: 2021-02-11T11:17:15Z has_accepted_license: '1' keyword: - Social Immunity - Sanitary care - Social Insects - Organisational Immunity - Colony development - Multi-target tracking language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '183' project: - _id: 2649B4DE-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '771402' name: Epidemics in ant societies on a chip publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '1999' relation: part_of_dissertation status: public status: public supervisor: - first_name: Sylvia M full_name: Cremer, Sylvia M id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 title: Collective defenses of garden ants against a fungal pathogen type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6269' abstract: - lang: eng text: 'Clathrin-Mediated Endocytosis (CME) is an aspect of cellular trafficking that is constantly regulated for mediating developmental and physiological responses. The main aim of my thesis is to decipher the basic mechanisms of CME and post-endocytic trafficking in the whole multicellular organ systems of Arabidopsis. The first chapter of my thesis describes the search for new components involved in CME. Tandem affinity purification was conducted using CLC and its interacting partners were identified. Amongst the identified proteins were the Auxilin-likes1 and 2 (Axl1/2), putative uncoating factors, for which we made a full functional analysis. Over-expression of Axl1/2 causes extreme modifications in the dynamics of the machinery proteins and inhibition of endocytosis altogether. However the loss of function of the axl1/2 did not present any cellular or physiological phenotype, meaning Auxilin-likes do not form the major uncoating machinery. The second chapter of my thesis describes the establishment/utilisation of techniques to capture the dynamicity and the complexity of CME and post-endocytic trafficking. We have studied the development of endocytic pits at the PM – specifically, the mode of membrane remodeling during pit development and the role of actin in it, given plant cells possess high turgor pressure. Utilizing the improved z-resolution of TIRF and VAEM techniques, we captured the time-lapse of the endocytic events at the plasma membrane; and using particle detection software, we quantitatively analysed all the endocytic trajectories in an unbiased way to obtain the endocytic rate of the system. This together with the direct analysis of cargo internalisation from the PM provided an estimate on the endocytic potential of the cell. We also developed a methodology for ultrastructural analysis of different populations of Clathrin-Coated Structures (CCSs) in both PM and endomembranes in unroofed protoplasts. Structural analysis, together with the intensity profile of CCSs at the PM show that the mode of CCP development at the PM follows ‘Constant curvature model’; meaning that clathrin polymerisation energy is a major contributing factor of membrane remodeling. In addition, other analyses clearly show that actin is not required for membrane remodeling during invagination or any other step of CCP development, despite the prevalent high turgor pressure. However, actin is essential in orchestrating the post-endocytic trafficking of CCVs facilitating the EE formation. We also observed that the uncoating process post-endocytosis is not immediate; an alternative mechanism of uncoating – Sequential multi-step process – functions in the cell. Finally we also looked at one of the important physiological stimuli modulating the process – hormone, auxin. auxin has been known to influence CME before. We have made a detailed study on the concentration-time based effect of auxin on the machinery proteins, CCP development, and the specificity of cargoes endocytosed. To this end, we saw no general effect of auxin on CME at earlier time points. However, very low concentration of IAA, such as 50nM, accelerates endocytosis of specifically PIN2 through CME. Such a tight regulatory control with high specificity to PIN2 could be essential in modulating its polarity. ' acknowledged_ssus: - _id: Bio - _id: EM-Fac alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Madhumitha full_name: Narasimhan, Madhumitha id: 44BF24D0-F248-11E8-B48F-1D18A9856A87 last_name: Narasimhan orcid: 0000-0002-8600-0671 citation: ama: Narasimhan M. Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants . 2019. doi:10.15479/at:ista:th1075 apa: Narasimhan, M. (2019). Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants . Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:th1075 chicago: Narasimhan, Madhumitha. “Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking and Their Regulatory Controls in Plants .” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/at:ista:th1075. ieee: M. Narasimhan, “Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants ,” Institute of Science and Technology Austria, 2019. ista: Narasimhan M. 2019. Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls in plants . Institute of Science and Technology Austria. mla: Narasimhan, Madhumitha. Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking and Their Regulatory Controls in Plants . Institute of Science and Technology Austria, 2019, doi:10.15479/at:ista:th1075. short: M. Narasimhan, Clathrin-Mediated Endocytosis, Post-Endocytic Trafficking and Their Regulatory Controls in Plants , Institute of Science and Technology Austria, 2019. date_created: 2019-04-09T14:37:06Z date_published: 2019-02-04T00:00:00Z date_updated: 2023-09-08T11:43:03Z day: '04' ddc: - '575' degree_awarded: PhD department: - _id: JiFr doi: 10.15479/at:ista:th1075 file: - access_level: open_access checksum: c958f27dd752712886e7e2638b847a3c content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:18Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6270' file_name: Supplementary_movie_1.avi file_size: 5402078 relation: main_file - access_level: open_access checksum: 8786fdc29c62987c0aad3c866a4d3691 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:18Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6271' file_name: 3.7_supplementary_movie_10.avi file_size: 5927736 relation: main_file - access_level: open_access checksum: 25f784c5159d6f4d966b2f9b371ebaf6 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:18Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6272' file_name: 3.7_supplementary_movie_9.avi file_size: 9570210 relation: main_file - access_level: open_access checksum: 917069272a7a08d1f38224d5e12765d6 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:18Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6273' file_name: 3.7_supplementary_movie_8.avi file_size: 2827360 relation: main_file - access_level: open_access checksum: 81e74f5ca0ad70050504f18192236dc0 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:18Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6274' file_name: 3.7_supplementary_movie_7.avi file_size: 5771410 relation: main_file - access_level: open_access checksum: 47eb37b27a2930252713924307ea8c6f content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:18Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6275' file_name: 3.7_supplementary_movie_6.avi file_size: 1113486 relation: main_file - access_level: open_access checksum: f68f66721041ce84e331959c9a5779c3 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:18Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6276' file_name: 3.7_supplementary_movie_5.avi file_size: 1057232 relation: main_file - access_level: open_access checksum: 67c01cefab51b363c5e214fe4cd671f3 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:23Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6277' file_name: 3.7_supplementary_movie_3.avi file_size: 127472916 relation: main_file - access_level: open_access checksum: e5a397edbee05b8821e2b19b3c1a9260 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:19Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6278' file_name: 3.7_supplementary_movie_4.avi file_size: 3181238 relation: main_file - access_level: open_access checksum: 32d92b2a9277f956fdb0b42351d07c0b content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:19Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6279' file_name: 3.7_supplementary_movie_2.avi file_size: 5970952 relation: main_file - access_level: open_access checksum: efe7001f5d9a8c61e631e12d5f324ade content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:21Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6280' file_name: 3.7_Supplementary_movie_1.avi file_size: 39835236 relation: main_file - access_level: open_access checksum: eeb0a5603c6449c5f34eacd5ff0b3a16 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:21Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6281' file_name: 2.5_Suppl_Movie_4_AP2A1_TagRFP.avi file_size: 3696740 relation: main_file - access_level: open_access checksum: 8e7c00ef6223bf0e177deb168338af13 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:21Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6282' file_name: 2.5_Suppl_Movie_3_TPLATE_GFP.avi file_size: 6741232 relation: main_file - access_level: open_access checksum: 3636006a7cb709a7543d6581e359b28d content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:22Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6283' file_name: 2.5_Suppl_Movie_2_CLC_GFP.avi file_size: 2445946 relation: main_file - access_level: open_access checksum: 39ca5519a6e9a38356e7b3704004fea7 content_type: video/x-msvideo creator: dernst date_created: 2019-04-09T14:35:22Z date_updated: 2021-02-11T23:30:15Z embargo: 2020-02-11 file_id: '6284' file_name: 2.5_Suppl_Movie_1_CLC_GFPxAxl1_mcherry.avi file_size: 58594 relation: main_file - access_level: open_access checksum: 4fcdaa3a6c645514a3b3205f0f69dc76 content_type: application/pdf creator: dernst date_created: 2019-04-09T14:35:33Z date_updated: 2021-02-11T11:17:15Z embargo: 2020-02-11 file_id: '6285' file_name: 2019_Thesis_Narasimhan.pdf file_size: 10553937 relation: main_file - access_level: closed checksum: 268f0b6bad21d5f0d671e5d4b88104a7 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: dernst date_created: 2019-04-09T14:35:36Z date_updated: 2020-07-14T12:47:26Z embargo_to: open_access file_id: '6286' file_name: 2019_Thesis_Narasimhan_source.docx file_size: 135291990 relation: source_file file_date_updated: 2021-02-11T23:30:15Z has_accepted_license: '1' language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: '138' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '412' 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: 'Clathrin-Mediated endocytosis, post-endocytic trafficking and their regulatory controls 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: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '11222' acknowledgement: This work was supported by the ERC and EU Horizon 2020 (ERC 692692; MSC-IF 708497) and FWF Z 312-B27 Wittgenstein award; W 1205-B09). article_number: A3.27 article_processing_charge: No author: - first_name: Olena full_name: Kim, Olena id: 3F8ABDDA-F248-11E8-B48F-1D18A9856A87 last_name: Kim - first_name: Carolina full_name: Borges Merjane, Carolina id: 4305C450-F248-11E8-B48F-1D18A9856A87 last_name: Borges Merjane orcid: 0000-0003-0005-401X - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: 'Kim O, Borges Merjane C, Jonas PM. Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy. In: Intrinsic Activity. Vol 7. Austrian Pharmacological Society; 2019. doi:10.25006/ia.7.s1-a3.27' apa: 'Kim, O., Borges Merjane, C., & Jonas, P. M. (2019). Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy. In Intrinsic Activity (Vol. 7). Innsbruck, Austria: Austrian Pharmacological Society. https://doi.org/10.25006/ia.7.s1-a3.27' chicago: Kim, Olena, Carolina Borges Merjane, and Peter M Jonas. “Functional Analysis of the Docked Vesicle Pool in Hippocampal Mossy Fiber Terminals by Electron Microscopy.” In Intrinsic Activity, Vol. 7. Austrian Pharmacological Society, 2019. https://doi.org/10.25006/ia.7.s1-a3.27. ieee: O. Kim, C. Borges Merjane, and P. M. Jonas, “Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy,” in Intrinsic Activity, Innsbruck, Austria, 2019, vol. 7, no. Suppl. 1. ista: 'Kim O, Borges Merjane C, Jonas PM. 2019. Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy. Intrinsic Activity. ANA: Austrian Neuroscience Association ; APHAR: Austrian Pharmacological Society vol. 7, A3.27.' mla: Kim, Olena, et al. “Functional Analysis of the Docked Vesicle Pool in Hippocampal Mossy Fiber Terminals by Electron Microscopy.” Intrinsic Activity, vol. 7, no. Suppl. 1, A3.27, Austrian Pharmacological Society, 2019, doi:10.25006/ia.7.s1-a3.27. short: O. Kim, C. Borges Merjane, P.M. Jonas, in:, Intrinsic Activity, Austrian Pharmacological Society, 2019. conference: end_date: 2019-09-27 location: Innsbruck, Austria name: 'ANA: Austrian Neuroscience Association ; APHAR: Austrian Pharmacological Society' start_date: 2019-09-25 date_created: 2022-04-20T15:06:05Z date_published: 2019-09-11T00:00:00Z date_updated: 2024-03-27T23:30:07Z day: '11' department: - _id: PeJo doi: 10.25006/ia.7.s1-a3.27 ec_funded: 1 intvolume: ' 7' issue: Suppl. 1 keyword: - hippocampus - mossy fibers - readily releasable pool - electron microscopy language: - iso: eng main_file_link: - open_access: '1' url: https://www.intrinsicactivity.org/2019/7/S1/A3.27/ month: '09' oa: 1 oa_version: Published Version project: - _id: 25B7EB9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '692692' name: Biophysics and circuit function of a giant cortical glumatergic synapse - _id: 25BAF7B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '708497' name: Presynaptic calcium channels distribution and impact on coupling at the hippocampal mossy fiber synapse - _id: 25C3DBB6-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W01205 name: Zellkommunikation in Gesundheit und Krankheit - _id: 25C5A090-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00312 name: The Wittgenstein Prize publication: Intrinsic Activity publication_identifier: issn: - 2309-8503 publication_status: published publisher: Austrian Pharmacological Society quality_controlled: '1' related_material: record: - id: '11196' relation: dissertation_contains status: public status: public title: Functional analysis of the docked vesicle pool in hippocampal mossy fiber terminals by electron microscopy type: conference_abstract user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 7 year: '2019' ... --- _id: '6947' abstract: - lang: eng text: Lymph nodes are es s ential organs of the immune s ys tem where adaptive immune responses originate, and consist of various leukocyte populations and a stromal backbone. Fibroblastic reticular cells (FRCs) are the main stromal cells and form a sponge-like extracellular matrix network, called conduits , which they thems elves enwrap and contract. Lymph, containing s oluble antigens , arrive in lymph nodes via afferent lymphatic vessels that connect to the s ubcaps ular s inus and conduit network. According to the current paradigm, the conduit network dis tributes afferent lymph through lymph nodes and thus provides acces s for immune cells to lymph-borne antigens. An elas tic caps ule s urrounds the organ and confines the immune cells and FRC network. Lymph nodes are completely packed with lymphocytes and lymphocyte numbers directly dictates the size of the organ. Although lymphocytes cons tantly enter and leave the lymph node, its s ize remains remarkedly s table under homeostatic conditions. It is only partly known how the cellularity and s ize of the lymph node is regulated and how the lymph node is able to swell in inflammation. The role of the FRC network in lymph node s welling and trans fer of fluids are inves tigated in this thes is. Furthermore, we s tudied what trafficking routes are us ed by cancer cells in lymph nodes to form distal metastases.We examined the role of a mechanical feedback in regulation of lymph node swelling. Using parallel plate compression and UV-las er cutting experiments we dis s ected the mechanical force dynamics of the whole lymph node, and individually for FRCs and the caps ule. Physical forces generated by packed lymphocytes directly affect the tens ion on the FRC network and capsule, which increases its resistance to swelling. This implies a feedback mechanism between tis s ue pres s ure and ability of lymphocytes to enter the organ. Following inflammation, the lymph node swells ∼10 fold in two weeks . Yet, what is the role for tens ion on the FRC network and caps ule, and how are lymphocytes able to enter in conditions that resist swelling remain open ques tions . We s how that tens ion on the FRC network is important to limit the swelling rate of the organ so that the FRC network can grow in a coordinated fashion. This is illustrated by interfering with FRC contractility, which leads to faster swelling rates and a dis organized FRC network in the inflamed lymph node. Growth of the FRC network in turn is expected to releas e tens ion on thes e s tructures and lowers the res is tance to swelling, thereby allowing more lymphocytes to enter the organ and drive more swelling. Halt of swelling coincides with a thickening of the caps ule, which forms a thick res is tant band around the organ and lowers tens ion on the FRC network to form a new force equilibrium.The FRC and conduit network are further believed to be a privileged s ite of s oluble information within the lymph node, although many details remain uns olved. We s how by 3D ultra-recons truction that FRCs and antigen pres enting cells cover the s urface of conduit s ys tem for more than 99% and we dis cus s the implications for s oluble information exchangeat the conduit level.Finally, there is an ongoing debate in the cancer field whether and how cancer cells in lymph nodes s eed dis tal metas tas es . We s how that cancer cells infus ed into the lymph node can utilize trafficking routes of immune cells and rapidly migrate to blood vessels. Once in the blood circulation, these cells are able to form metastases in distal tissues. acknowledged_ssus: - _id: Bio - _id: PreCl - _id: EM-Fac alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Frank P full_name: Assen, Frank P id: 3A8E7F24-F248-11E8-B48F-1D18A9856A87 last_name: Assen orcid: 0000-0003-3470-6119 citation: ama: 'Assen FP. Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking. 2019. doi:10.15479/AT:ISTA:6947' apa: 'Assen, F. P. (2019). Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6947' chicago: 'Assen, Frank P. “Lymph Node Mechanics: Deciphering the Interplay between Stroma Contractility, Morphology and Lymphocyte Trafficking.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6947.' ieee: 'F. P. Assen, “Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking,” Institute of Science and Technology Austria, 2019.' ista: 'Assen FP. 2019. Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking. Institute of Science and Technology Austria.' mla: 'Assen, Frank P. Lymph Node Mechanics: Deciphering the Interplay between Stroma Contractility, Morphology and Lymphocyte Trafficking. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6947.' short: 'F.P. Assen, Lymph Node Mechanics: Deciphering the Interplay between Stroma Contractility, Morphology and Lymphocyte Trafficking, Institute of Science and Technology Austria, 2019.' date_created: 2019-10-14T16:54:52Z date_published: 2019-10-09T00:00:00Z date_updated: 2023-09-13T08:50:57Z day: '9' ddc: - '570' degree_awarded: PhD department: - _id: MiSi doi: 10.15479/AT:ISTA:6947 file: - access_level: closed checksum: 53a739752a500f84d0f8ec953cbbd0b6 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: fassen date_created: 2019-11-06T12:30:02Z date_updated: 2020-11-07T23:30:03Z embargo_to: open_access file_id: '6990' file_name: PhDthesis_FrankAssen_revised2.docx file_size: 214172667 relation: source_file - access_level: open_access checksum: 8c156b65d9347bb599623a4b09f15d15 content_type: application/pdf creator: fassen date_created: 2019-11-06T12:30:57Z date_updated: 2020-11-07T23:30:03Z embargo: 2020-11-06 file_id: '6991' file_name: PhDthesis_FrankAssen_revised2.pdf file_size: 83637532 relation: main_file file_date_updated: 2020-11-07T23:30:03Z has_accepted_license: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: '142' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '664' relation: part_of_dissertation status: public - id: '402' relation: part_of_dissertation status: public status: public supervisor: - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 title: 'Lymph node mechanics: Deciphering the interplay between stroma contractility, morphology and lymphocyte trafficking' type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6849' abstract: - lang: eng text: 'Brain function is mediated by complex dynamical interactions between excitatory and inhibitory cell types. The Cholecystokinin-expressing inhibitory cells (CCK-interneurons) are one of the least studied types, despite being suspected to play important roles in cognitive processes. We studied the network effects of optogenetic silencing of CCK-interneurons in the CA1 hippocampal area during exploration and sleep states. The cell firing pattern in response to light pulses allowed us to classify the recorded neurons in 5 classes, including disinhibited and non-responsive pyramidal cell and interneurons, and the inhibited interneurons corresponding to the CCK group. The light application, which inhibited the activity of CCK interneurons triggered wider changes in the firing dynamics of cells. We observed rate changes (i.e. remapping) of pyramidal cells during the exploration session in which the light was applied relative to the previous control session that was not restricted neither in time nor space to the light delivery. Also, the disinhibited pyramidal cells had higher increase in bursting than in single spike firing rate as a result of CCK silencing. In addition, the firing activity patterns during exploratory periods were more weakly reactivated in sleep for those periods in which CCK-interneuron were silenced than in the unaffected periods. Furthermore, light pulses during sleep disrupted the reactivation of recent waking patterns. Hence, silencing CCK neurons during exploration suppressed the reactivation of waking firing patterns in sleep and CCK interneuron activity was also required during sleep for the normal reactivation of waking patterns. These findings demonstrate the involvement of CCK cells in reactivation-related memory consolidation. An important part of our analysis was to test the relationship of the identified CCKinterneurons to brain oscillations. Our findings showed that these cells exhibited different oscillatory behaviour during anaesthesia and natural waking and sleep conditions. We showed that: 1) Contrary to the past studies performed under anaesthesia, the identified CCKinterneurons fired on the descending portion of the theta phase in waking exploration. 2) CCKinterneuron preferred phases around the trough of gamma oscillations. 3) Contrary to anaesthesia conditions, the average firing rate of the CCK-interneurons increased around the peak activity of the sharp-wave ripple (SWR) events in natural sleep, which is congruent with new reports about their functional connectivity. We also found that light driven CCK-interneuron silencing altered the dynamics on the CA1 network oscillatory activity: 1) Pyramidal cells negatively shifted their preferred theta phases when the light was applied, while interneurons responses were less consistent. 2) As a population, pyramidal cells negatively shifted their preferred activity during gamma oscillations, albeit we did not find gamma modulation differences related to the light application when pyramidal cells were subdivided into the disinhibited and unaffected groups. 3) During the peak of SWR events, all but the CCK-interneurons had a reduction in their relative firing rate change during the light application as compared to the change observed at SWR initiation. Finally, regarding to the place field activity of the recorded pyramidal neurons, we showed that the disinhibited pyramidal cells had reduced place field similarity, coherence and spatial information, but only during the light application. The mechanisms behind such observed behaviours might involve eCB signalling and plastic changes in CCK-interneuron synapses. In conclusion, the observed changes related to the light-mediated silencing of CCKinterneurons have unravelled characteristics of this interneuron subpopulation that might change the understanding not only of their particular network interactions, but also of the current theories about the emergence of certain cognitive processes such as place coding needed for navigation or hippocampus-dependent memory consolidation. ' acknowledged_ssus: - _id: Bio - _id: PreCl - _id: M-Shop alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Dámaris K full_name: Rangel Guerrero, Dámaris K id: 4871BCE6-F248-11E8-B48F-1D18A9856A87 last_name: Rangel Guerrero orcid: 0000-0002-8602-4374 citation: ama: Rangel Guerrero DK. The role of CCK-interneurons in regulating hippocampal network dynamics. 2019. doi:10.15479/AT:ISTA:6849 apa: Rangel Guerrero, D. K. (2019). The role of CCK-interneurons in regulating hippocampal network dynamics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6849 chicago: Rangel Guerrero, Dámaris K. “The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6849. ieee: D. K. Rangel Guerrero, “The role of CCK-interneurons in regulating hippocampal network dynamics,” Institute of Science and Technology Austria, 2019. ista: Rangel Guerrero DK. 2019. The role of CCK-interneurons in regulating hippocampal network dynamics. Institute of Science and Technology Austria. mla: Rangel Guerrero, Dámaris K. The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6849. short: D.K. Rangel Guerrero, The Role of CCK-Interneurons in Regulating Hippocampal Network Dynamics, Institute of Science and Technology Austria, 2019. date_created: 2019-09-06T06:54:16Z date_published: 2019-09-09T00:00:00Z date_updated: 2023-09-19T10:01:12Z day: '09' ddc: - '570' degree_awarded: PhD department: - _id: JoCs doi: 10.15479/AT:ISTA:6849 file: - access_level: closed checksum: 244dc4f74dbfc94f414156092298831f content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: drangel date_created: 2019-09-09T13:09:45Z date_updated: 2021-02-10T23:30:09Z embargo_to: open_access file_id: '6865' file_name: Thesis_Damaris_Rangel_source.docx file_size: 18253100 relation: source_file - access_level: open_access checksum: 59c73be40eeaa1c4db24067270151555 content_type: application/pdf creator: drangel date_created: 2019-09-09T13:09:52Z date_updated: 2020-09-11T22:30:04Z embargo: 2020-09-10 file_id: '6866' file_name: Thesis_Damaris_Rangel_pdfa.pdf file_size: 2160109 relation: main_file request_a_copy: 0 file_date_updated: 2021-02-10T23:30:09Z has_accepted_license: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '97' publication_identifier: isbn: - '9783990780039' issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '5914' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 title: The role of CCK-interneurons in regulating hippocampal network dynamics type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6351' abstract: - lang: eng text: "A process of restorative patterning in plant roots correctly replaces eliminated cells to heal local injuries despite the absence of cell migration, which underpins wound healing in animals. \r\n\r\nPatterning in plants relies on oriented cell divisions and acquisition of specific cell identities. Plants regularly endure wounds caused by abiotic or biotic environmental stimuli and have developed extraordinary abilities to restore their tissues after injuries. Here, we provide insight into a mechanism of restorative patterning that repairs tissues after wounding. Laser-assisted elimination of different cells in Arabidopsis root combined with live-imaging tracking during vertical growth allowed analysis of the regeneration processes in vivo. Specifically, the cells adjacent to the inner side of the injury re-activated their stem cell transcriptional programs. They accelerated their progression through cell cycle, coordinately changed the cell division orientation, and ultimately acquired de novo the correct cell fates to replace missing cells. These observations highlight existence of unknown intercellular positional signaling and demonstrate the capability of specified cells to re-acquire stem cell programs as a crucial part of the plant-specific mechanism of wound healing." acknowledged_ssus: - _id: Bio article_processing_charge: No author: - first_name: Petra full_name: Marhavá, Petra id: 44E59624-F248-11E8-B48F-1D18A9856A87 last_name: Marhavá - first_name: Lukas full_name: Hörmayer, Lukas id: 2EEE7A2A-F248-11E8-B48F-1D18A9856A87 last_name: Hörmayer orcid: 0000-0001-8295-2926 - first_name: Saiko full_name: Yoshida, Saiko id: 2E46069C-F248-11E8-B48F-1D18A9856A87 last_name: Yoshida - first_name: Peter full_name: Marhavy, Peter id: 3F45B078-F248-11E8-B48F-1D18A9856A87 last_name: Marhavy orcid: 0000-0001-5227-5741 - first_name: Eva full_name: Benková, Eva id: 38F4F166-F248-11E8-B48F-1D18A9856A87 last_name: Benková orcid: 0000-0002-8510-9739 - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Marhavá P, Hörmayer L, Yoshida S, Marhavý P, Benková E, Friml J. Re-activation of stem cell pathways for pattern restoration in plant wound healing. Cell. 2019;177(4):957-969.e13. doi:10.1016/j.cell.2019.04.015 apa: Marhavá, P., Hörmayer, L., Yoshida, S., Marhavý, P., Benková, E., & Friml, J. (2019). Re-activation of stem cell pathways for pattern restoration in plant wound healing. Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.04.015 chicago: Marhavá, Petra, Lukas Hörmayer, Saiko Yoshida, Peter Marhavý, Eva Benková, and Jiří Friml. “Re-Activation of Stem Cell Pathways for Pattern Restoration in Plant Wound Healing.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.04.015. ieee: P. Marhavá, L. Hörmayer, S. Yoshida, P. Marhavý, E. Benková, and J. Friml, “Re-activation of stem cell pathways for pattern restoration in plant wound healing,” Cell, vol. 177, no. 4. Elsevier, p. 957–969.e13, 2019. ista: Marhavá P, Hörmayer L, Yoshida S, Marhavý P, Benková E, Friml J. 2019. Re-activation of stem cell pathways for pattern restoration in plant wound healing. Cell. 177(4), 957–969.e13. mla: Marhavá, Petra, et al. “Re-Activation of Stem Cell Pathways for Pattern Restoration in Plant Wound Healing.” Cell, vol. 177, no. 4, Elsevier, 2019, p. 957–969.e13, doi:10.1016/j.cell.2019.04.015. short: P. Marhavá, L. Hörmayer, S. Yoshida, P. Marhavý, E. Benková, J. Friml, Cell 177 (2019) 957–969.e13. date_created: 2019-04-28T21:59:14Z date_published: 2019-05-02T00:00:00Z date_updated: 2024-03-27T23:30:10Z day: '02' ddc: - '570' department: - _id: JiFr - _id: EvBe doi: 10.1016/j.cell.2019.04.015 ec_funded: 1 external_id: isi: - '000466843000015' pmid: - '31051107' file: - access_level: open_access checksum: 4ceba04a96a74f5092ec3ce2c579a0c7 content_type: application/pdf creator: dernst date_created: 2019-05-13T06:12:45Z date_updated: 2020-07-14T12:47:28Z file_id: '6411' file_name: 2019_Cell_Marhava.pdf file_size: 10272032 relation: main_file file_date_updated: 2020-07-14T12:47:28Z has_accepted_license: '1' intvolume: ' 177' isi: 1 issue: '4' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 957-969.e13 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 publication: Cell publication_identifier: eissn: - '10974172' issn: - '00928674' publication_status: published publisher: Elsevier quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/specialized-plant-cells-regain-stem-cell-features-to-heal-wounds/ record: - id: '9992' relation: dissertation_contains status: public scopus_import: '1' status: public title: Re-activation of stem cell pathways for pattern restoration in plant wound healing 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: 177 year: '2019' ... --- _id: '6943' abstract: - lang: eng text: Plants as sessile organisms are constantly under attack by herbivores, rough environmental situations, or mechanical pressure. These challenges often lead to the induction of wounds or destruction of already specified and developed tissues. Additionally, wounding makes plants vulnerable to invasion by pathogens, which is why wound signalling often triggers specific defence responses. To stay competitive or, eventually, survive under these circumstances, plants need to regenerate efficiently, which in rigid, tissue migration-incompatible plant tissues requires post-embryonic patterning and organogenesis. Now, several studies used laser-assisted single cell ablation in the Arabidopsis root tip as a minimal wounding proxy. Here, we discuss their findings and put them into context of a broader spectrum of wound signalling, pathogen responses and tissue as well as organ regeneration. article_processing_charge: No article_type: original author: - first_name: Lukas full_name: Hörmayer, Lukas id: 2EEE7A2A-F248-11E8-B48F-1D18A9856A87 last_name: Hörmayer orcid: 0000-0001-8295-2926 - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Hörmayer L, Friml J. Targeted cell ablation-based insights into wound healing and restorative patterning. Current Opinion in Plant Biology. 2019;52:124-130. doi:10.1016/j.pbi.2019.08.006 apa: Hörmayer, L., & Friml, J. (2019). Targeted cell ablation-based insights into wound healing and restorative patterning. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/j.pbi.2019.08.006 chicago: Hörmayer, Lukas, and Jiří Friml. “Targeted Cell Ablation-Based Insights into Wound Healing and Restorative Patterning.” Current Opinion in Plant Biology. Elsevier, 2019. https://doi.org/10.1016/j.pbi.2019.08.006. ieee: L. Hörmayer and J. Friml, “Targeted cell ablation-based insights into wound healing and restorative patterning,” Current Opinion in Plant Biology, vol. 52. Elsevier, pp. 124–130, 2019. ista: Hörmayer L, Friml J. 2019. Targeted cell ablation-based insights into wound healing and restorative patterning. Current Opinion in Plant Biology. 52, 124–130. mla: Hörmayer, Lukas, and Jiří Friml. “Targeted Cell Ablation-Based Insights into Wound Healing and Restorative Patterning.” Current Opinion in Plant Biology, vol. 52, Elsevier, 2019, pp. 124–30, doi:10.1016/j.pbi.2019.08.006. short: L. Hörmayer, J. Friml, Current Opinion in Plant Biology 52 (2019) 124–130. date_created: 2019-10-14T07:00:24Z date_published: 2019-12-01T00:00:00Z date_updated: 2024-03-27T23:30:11Z day: '01' ddc: - '580' department: - _id: JiFr doi: 10.1016/j.pbi.2019.08.006 ec_funded: 1 external_id: isi: - '000502890600017' pmid: - '31585333' file: - access_level: open_access checksum: d6fd68a6e965f1efe3f0bf2d2070a616 content_type: application/pdf creator: dernst date_created: 2019-10-14T14:48:21Z date_updated: 2020-07-14T12:47:45Z file_id: '6946' file_name: 2019_CurrentOpinionPlant_Hoermayer.pdf file_size: 1659288 relation: main_file file_date_updated: 2020-07-14T12:47:45Z has_accepted_license: '1' intvolume: ' 52' isi: 1 language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 124-130 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 publication: Current Opinion in Plant Biology publication_identifier: issn: - 1369-5266 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '9992' relation: dissertation_contains status: public scopus_import: '1' status: public title: Targeted cell ablation-based insights into wound healing and restorative patterning 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: 52 year: '2019' ... --- _id: '7391' abstract: - lang: eng text: Electron microscopy (EM) is a technology that enables visualization of single proteins at a nanometer resolution. However, current protein analysis by EM mainly relies on immunolabeling with gold-particle-conjugated antibodies, which is compromised by large size of antibody, precluding precise detection of protein location in biological samples. Here, we develop a specific chemical labeling method for EM detection of proteins at single-molecular level. Rational design of α-helical peptide tag and probe structure provided a complementary reaction pair that enabled specific cysteine conjugation of the tag. The developed chemical labeling with gold-nanoparticle-conjugated probe showed significantly higher labeling efficiency and detectability of high-density clusters of tag-fused G protein-coupled receptors in freeze-fracture replicas compared with immunogold labeling. Furthermore, in ultrathin sections, the spatial resolution of the chemical labeling was significantly higher than that of antibody-mediated labeling. These results demonstrate substantial advantages of the chemical labeling approach for single protein visualization by EM. article_processing_charge: No article_type: original author: - first_name: Shigekazu full_name: Tabata, Shigekazu id: 4427179E-F248-11E8-B48F-1D18A9856A87 last_name: Tabata - first_name: Marijo full_name: Jevtic, Marijo id: 4BE3BC94-F248-11E8-B48F-1D18A9856A87 last_name: Jevtic - first_name: Nobutaka full_name: Kurashige, Nobutaka last_name: Kurashige - first_name: Hirokazu full_name: Fuchida, Hirokazu last_name: Fuchida - first_name: Munetsugu full_name: Kido, Munetsugu last_name: Kido - first_name: Kazushi full_name: Tani, Kazushi last_name: Tani - first_name: Naoki full_name: Zenmyo, Naoki last_name: Zenmyo - first_name: Shohei full_name: Uchinomiya, Shohei last_name: Uchinomiya - first_name: Harumi full_name: Harada, Harumi id: 2E55CDF2-F248-11E8-B48F-1D18A9856A87 last_name: Harada orcid: 0000-0001-7429-7896 - first_name: Makoto full_name: Itakura, Makoto last_name: Itakura - 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: Tabata S, Jevtic M, Kurashige N, et al. Electron microscopic detection of single membrane proteins by a specific chemical labeling. iScience. 2019;22(12):256-268. doi:10.1016/j.isci.2019.11.025 apa: Tabata, S., Jevtic, M., Kurashige, N., Fuchida, H., Kido, M., Tani, K., … Ojida, A. (2019). Electron microscopic detection of single membrane proteins by a specific chemical labeling. IScience. Elsevier. https://doi.org/10.1016/j.isci.2019.11.025 chicago: Tabata, Shigekazu, Marijo Jevtic, Nobutaka Kurashige, Hirokazu Fuchida, Munetsugu Kido, Kazushi Tani, Naoki Zenmyo, et al. “Electron Microscopic Detection of Single Membrane Proteins by a Specific Chemical Labeling.” IScience. Elsevier, 2019. https://doi.org/10.1016/j.isci.2019.11.025. ieee: S. Tabata et al., “Electron microscopic detection of single membrane proteins by a specific chemical labeling,” iScience, vol. 22, no. 12. Elsevier, pp. 256–268, 2019. ista: Tabata S, Jevtic M, Kurashige N, Fuchida H, Kido M, Tani K, Zenmyo N, Uchinomiya S, Harada H, Itakura M, Hamachi I, Shigemoto R, Ojida A. 2019. Electron microscopic detection of single membrane proteins by a specific chemical labeling. iScience. 22(12), 256–268. mla: Tabata, Shigekazu, et al. “Electron Microscopic Detection of Single Membrane Proteins by a Specific Chemical Labeling.” IScience, vol. 22, no. 12, Elsevier, 2019, pp. 256–68, doi:10.1016/j.isci.2019.11.025. short: S. Tabata, M. Jevtic, N. Kurashige, H. Fuchida, M. Kido, K. Tani, N. Zenmyo, S. Uchinomiya, H. Harada, M. Itakura, I. Hamachi, R. Shigemoto, A. Ojida, IScience 22 (2019) 256–268. date_created: 2020-01-29T15:56:56Z date_published: 2019-12-20T00:00:00Z date_updated: 2024-03-27T23:30:13Z day: '20' ddc: - '570' department: - _id: RySh doi: 10.1016/j.isci.2019.11.025 ec_funded: 1 external_id: isi: - :000504652000020 pmid: - '31786521' file: - access_level: open_access checksum: f3e90056a49f09b205b1c4f8c739ffd1 content_type: application/pdf creator: dernst date_created: 2020-02-04T10:48:36Z date_updated: 2020-07-14T12:47:57Z file_id: '7448' file_name: 2019_iScience_Tabata.pdf file_size: 7197776 relation: main_file file_date_updated: 2020-07-14T12:47:57Z has_accepted_license: '1' intvolume: ' 22' issue: '12' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 256-268 pmid: 1 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: 25CBA828-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '720270' name: Human Brain Project Specific Grant Agreement 1 (HBP SGA 1) publication: iScience publication_identifier: issn: - 2589-0042 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '11393' relation: dissertation_contains status: public scopus_import: '1' status: public title: Electron microscopic detection of single membrane proteins by a specific chemical labeling 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: 22 year: '2019' ... --- _id: '6848' abstract: - lang: eng text: Proton-translocating transhydrogenase (also known as nicotinamide nucleotide transhydrogenase (NNT)) is found in the plasma membranes of bacteria and the inner mitochondrial membranes of eukaryotes. NNT catalyses the transfer of a hydride between NADH and NADP+, coupled to the translocation of one proton across the membrane. Its main physiological function is the generation of NADPH, which is a substrate in anabolic reactions and a regulator of oxidative status; however, NNT may also fine-tune the Krebs cycle1,2. NNT deficiency causes familial glucocorticoid deficiency in humans and metabolic abnormalities in mice, similar to those observed in type II diabetes3,4. The catalytic mechanism of NNT has been proposed to involve a rotation of around 180° of the entire NADP(H)-binding domain that alternately participates in hydride transfer and proton-channel gating. However, owing to the lack of high-resolution structures of intact NNT, the details of this process remain unclear5,6. Here we present the cryo-electron microscopy structure of intact mammalian NNT in different conformational states. We show how the NADP(H)-binding domain opens the proton channel to the opposite sides of the membrane, and we provide structures of these two states. We also describe the catalytically important interfaces and linkers between the membrane and the soluble domains and their roles in nucleotide exchange. These structures enable us to propose a revised mechanism for a coupling process in NNT that is consistent with a large body of previous biochemical work. Our results are relevant to the development of currently unavailable NNT inhibitors, which may have therapeutic potential in ischaemia reperfusion injury, metabolic syndrome and some cancers7,8,9. acknowledged_ssus: - _id: ScienComp acknowledgement: " We thank R. Thompson, G. Effantin and V.-V. Hodirnau for their assistance with collecting NADP+, NADPH and apo datasets, respectively. Data processing was performed at the IST high-performance computing cluster.\r\nThis project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement no. 665385." article_processing_charge: No article_type: letter_note author: - first_name: Domen full_name: Kampjut, Domen id: 37233050-F248-11E8-B48F-1D18A9856A87 last_name: Kampjut - first_name: Leonid A full_name: Sazanov, Leonid A id: 338D39FE-F248-11E8-B48F-1D18A9856A87 last_name: Sazanov orcid: 0000-0002-0977-7989 citation: ama: Kampjut D, Sazanov LA. Structure and mechanism of mitochondrial proton-translocating transhydrogenase. Nature. 2019;573(7773):291–295. doi:10.1038/s41586-019-1519-2 apa: Kampjut, D., & Sazanov, L. A. (2019). Structure and mechanism of mitochondrial proton-translocating transhydrogenase. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1519-2 chicago: Kampjut, Domen, and Leonid A Sazanov. “Structure and Mechanism of Mitochondrial Proton-Translocating Transhydrogenase.” Nature. Springer Nature, 2019. https://doi.org/10.1038/s41586-019-1519-2. ieee: D. Kampjut and L. A. Sazanov, “Structure and mechanism of mitochondrial proton-translocating transhydrogenase,” Nature, vol. 573, no. 7773. Springer Nature, pp. 291–295, 2019. ista: Kampjut D, Sazanov LA. 2019. Structure and mechanism of mitochondrial proton-translocating transhydrogenase. Nature. 573(7773), 291–295. mla: Kampjut, Domen, and Leonid A. Sazanov. “Structure and Mechanism of Mitochondrial Proton-Translocating Transhydrogenase.” Nature, vol. 573, no. 7773, Springer Nature, 2019, pp. 291–295, doi:10.1038/s41586-019-1519-2. short: D. Kampjut, L.A. Sazanov, Nature 573 (2019) 291–295. date_created: 2019-09-04T06:21:41Z date_published: 2019-09-12T00:00:00Z date_updated: 2024-03-27T23:30:14Z day: '12' ddc: - '572' department: - _id: LeSa doi: 10.1038/s41586-019-1519-2 ec_funded: 1 external_id: isi: - '000485415400061' pmid: - '31462775' file: - access_level: open_access checksum: 52728cda5210a3e9b74cc204e8aed3d5 content_type: application/pdf creator: lsazanov date_created: 2020-11-26T16:33:44Z date_updated: 2020-11-26T16:33:44Z file_id: '8821' file_name: Manuscript_final_acc_withFigs_SI_opt_red.pdf file_size: 3066206 relation: main_file success: 1 file_date_updated: 2020-11-26T16:33:44Z has_accepted_license: '1' intvolume: ' 573' isi: 1 issue: '7773' language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: 291–295 pmid: 1 project: - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: Nature publication_identifier: eissn: - 1476-4687 issn: - 0028-0836 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/high-end-microscopy-reveals-structure-and-function-of-crucial-metabolic-enzyme/ record: - id: '8340' relation: dissertation_contains status: public scopus_import: '1' status: public title: Structure and mechanism of mitochondrial proton-translocating transhydrogenase type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 573 year: '2019' ... --- _id: '6194' abstract: - lang: eng text: Grid cells with their rigid hexagonal firing fields are thought to provide an invariant metric to the hippocampal cognitive map, yet environmental geometrical features have recently been shown to distort the grid structure. Given that the hippocampal role goes beyond space, we tested the influence of nonspatial information on the grid organization. We trained rats to daily learn three new reward locations on a cheeseboard maze while recording from the medial entorhinal cortex and the hippocampal CA1 region. Many grid fields moved toward goal location, leading to long-lasting deformations of the entorhinal map. Therefore, distortions in the grid structure contribute to goal representation during both learning and recall, which demonstrates that grid cells participate in mnemonic coding and do not merely provide a simple metric of space. article_processing_charge: No article_type: original author: - first_name: Charlotte N. full_name: Boccara, Charlotte N. id: 3FC06552-F248-11E8-B48F-1D18A9856A87 last_name: Boccara orcid: 0000-0001-7237-5109 - first_name: Michele full_name: Nardin, Michele id: 30BD0376-F248-11E8-B48F-1D18A9856A87 last_name: Nardin orcid: 0000-0001-8849-6570 - first_name: Federico full_name: Stella, Federico id: 39AF1E74-F248-11E8-B48F-1D18A9856A87 last_name: Stella orcid: 0000-0001-9439-3148 - first_name: Joseph full_name: O'Neill, Joseph id: 426376DC-F248-11E8-B48F-1D18A9856A87 last_name: O'Neill - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 citation: ama: Boccara CN, Nardin M, Stella F, O’Neill J, Csicsvari JL. The entorhinal cognitive map is attracted to goals. Science. 2019;363(6434):1443-1447. doi:10.1126/science.aav4837 apa: Boccara, C. N., Nardin, M., Stella, F., O’Neill, J., & Csicsvari, J. L. (2019). The entorhinal cognitive map is attracted to goals. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aav4837 chicago: Boccara, Charlotte N., Michele Nardin, Federico Stella, Joseph O’Neill, and Jozsef L Csicsvari. “The Entorhinal Cognitive Map Is Attracted to Goals.” Science. American Association for the Advancement of Science, 2019. https://doi.org/10.1126/science.aav4837. ieee: C. N. Boccara, M. Nardin, F. Stella, J. O’Neill, and J. L. Csicsvari, “The entorhinal cognitive map is attracted to goals,” Science, vol. 363, no. 6434. American Association for the Advancement of Science, pp. 1443–1447, 2019. ista: Boccara CN, Nardin M, Stella F, O’Neill J, Csicsvari JL. 2019. The entorhinal cognitive map is attracted to goals. Science. 363(6434), 1443–1447. mla: Boccara, Charlotte N., et al. “The Entorhinal Cognitive Map Is Attracted to Goals.” Science, vol. 363, no. 6434, American Association for the Advancement of Science, 2019, pp. 1443–47, doi:10.1126/science.aav4837. short: C.N. Boccara, M. Nardin, F. Stella, J. O’Neill, J.L. Csicsvari, Science 363 (2019) 1443–1447. date_created: 2019-04-04T08:39:30Z date_published: 2019-03-29T00:00:00Z date_updated: 2024-03-27T23:30:16Z day: '29' ddc: - '570' department: - _id: JoCs doi: 10.1126/science.aav4837 ec_funded: 1 external_id: isi: - '000462738000034' file: - access_level: open_access checksum: 5e6b16742cde10a560cfaf2130764da1 content_type: application/pdf creator: dernst date_created: 2020-05-14T09:11:10Z date_updated: 2020-07-14T12:47:23Z file_id: '7826' file_name: 2019_Science_Boccara.pdf file_size: 9045923 relation: main_file file_date_updated: 2020-07-14T12:47:23Z has_accepted_license: '1' intvolume: ' 363' isi: 1 issue: '6434' language: - iso: eng month: '03' oa: 1 oa_version: Submitted Version page: 1443-1447 project: - _id: 257A4776-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '281511' name: Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: Science publication_identifier: eissn: - 1095-9203 issn: - 0036-8075 publication_status: published publisher: American Association for the Advancement of Science quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/grid-cells-create-treasure-map-in-rat-brain/ record: - id: '6062' relation: popular_science status: public - id: '11932' relation: dissertation_contains status: public scopus_import: '1' status: public title: The entorhinal cognitive map is attracted to goals type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 363 year: '2019' ... --- _id: '7132' abstract: - lang: eng text: "A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta.\r\nSynthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Catherine full_name: Mckenzie, Catherine id: 3EEDE19A-F248-11E8-B48F-1D18A9856A87 last_name: Mckenzie citation: ama: Mckenzie C. Design and characterization of methods and biological components to realize synthetic neurotransmission. 2019. doi:10.15479/at:ista:7132 apa: Mckenzie, C. (2019). Design and characterization of methods and biological components to realize synthetic neurotransmission. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:7132 chicago: Mckenzie, Catherine. “Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/at:ista:7132. ieee: C. Mckenzie, “Design and characterization of methods and biological components to realize synthetic neurotransmission,” Institute of Science and Technology Austria, 2019. ista: Mckenzie C. 2019. Design and characterization of methods and biological components to realize synthetic neurotransmission. Institute of Science and Technology Austria. mla: Mckenzie, Catherine. Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission. Institute of Science and Technology Austria, 2019, doi:10.15479/at:ista:7132. short: C. Mckenzie, Design and Characterization of Methods and Biological Components to Realize Synthetic Neurotransmission, Institute of Science and Technology Austria, 2019. date_created: 2019-11-27T09:07:14Z date_published: 2019-06-27T00:00:00Z date_updated: 2024-03-27T23:30:21Z day: '27' ddc: - '571' - '573' degree_awarded: PhD department: - _id: HaJa doi: 10.15479/at:ista:7132 file: - access_level: closed checksum: 34d0fe0f6e0af97b5937205a3e350423 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: dernst date_created: 2019-11-27T09:06:10Z date_updated: 2020-07-14T12:47:50Z file_id: '7133' file_name: McKenzie PhD Thesis August 2018 - Corrected Final.docx file_size: 5054633 relation: source_file - access_level: open_access checksum: 140dfb5e3df7edca34f4b6fcc55d876f content_type: application/pdf creator: dernst date_created: 2019-11-27T09:06:10Z date_updated: 2020-07-14T12:47:50Z file_id: '7134' file_name: McKenzie PhD Thesis August 2018 - Corrected Final.pdf file_size: 3231837 relation: main_file file_date_updated: 2020-07-14T12:47:50Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '95' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '6266' relation: old_edition status: public status: public supervisor: - first_name: Harald L full_name: Janovjak, Harald L id: 33BA6C30-F248-11E8-B48F-1D18A9856A87 last_name: Janovjak orcid: 0000-0002-8023-9315 title: Design and characterization of methods and biological components to realize synthetic neurotransmission type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '5949' abstract: - lang: eng text: Aberrant proteostasis of protein aggregation may lead to behavior disorders including chronic mental illnesses (CMI). Furthermore, the neuronal activity alterations that underlie CMI are not well understood. We recorded the local field potential and single-unit activity of the hippocampal CA1 region in vivo in rats transgenically overexpressing the Disrupted-in-Schizophrenia 1 (DISC1) gene (tgDISC1), modeling sporadic CMI. These tgDISC1 rats have previously been shown to exhibit DISC1 protein aggregation, disturbances in the dopaminergic system and attention-related deficits. Recordings were performed during exploration of familiar and novel open field environments and during sleep, allowing investigation of neuronal abnormalities in unconstrained behavior. Compared to controls, tgDISC1 place cells exhibited smaller place fields and decreased speed-modulation of their firing rates, demonstrating altered spatial coding and deficits in encoding location-independent sensory inputs. Oscillation analyses showed that tgDISC1 pyramidal neurons had higher theta phase locking strength during novelty, limiting their phase coding ability. However, their mean theta phases were more variable at the population level, reducing oscillatory network synchronization. Finally, tgDISC1 pyramidal neurons showed a lack of novelty-induced shift in their preferred theta and gamma firing phases, indicating deficits in coding of novel environments with oscillatory firing. By combining single cell and neuronal population analyses, we link DISC1 protein pathology with abnormal hippocampal neural coding and network synchrony, and thereby gain a more comprehensive understanding of CMI mechanisms. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Karola full_name: Käfer, Karola id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87 last_name: Käfer - first_name: Hugo full_name: Malagon-Vina, Hugo last_name: Malagon-Vina - first_name: Desiree full_name: Dickerson, Desiree id: 444EB89E-F248-11E8-B48F-1D18A9856A87 last_name: Dickerson - first_name: Joseph full_name: O'Neill, Joseph last_name: O'Neill - first_name: Svenja V. full_name: Trossbach, Svenja V. last_name: Trossbach - first_name: Carsten full_name: Korth, Carsten last_name: Korth - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 citation: ama: Käfer K, Malagon-Vina H, Dickerson D, et al. Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization. Hippocampus. 2019;29(9):802-816. doi:10.1002/hipo.23076 apa: Käfer, K., Malagon-Vina, H., Dickerson, D., O’Neill, J., Trossbach, S. V., Korth, C., & Csicsvari, J. L. (2019). Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization. Hippocampus. Wiley. https://doi.org/10.1002/hipo.23076 chicago: Käfer, Karola, Hugo Malagon-Vina, Desiree Dickerson, Joseph O’Neill, Svenja V. Trossbach, Carsten Korth, and Jozsef L Csicsvari. “Disrupted-in-Schizophrenia 1 Overexpression Disrupts Hippocampal Coding and Oscillatory Synchronization.” Hippocampus. Wiley, 2019. https://doi.org/10.1002/hipo.23076. ieee: K. Käfer et al., “Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization,” Hippocampus, vol. 29, no. 9. Wiley, pp. 802–816, 2019. ista: Käfer K, Malagon-Vina H, Dickerson D, O’Neill J, Trossbach SV, Korth C, Csicsvari JL. 2019. Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization. Hippocampus. 29(9), 802–816. mla: Käfer, Karola, et al. “Disrupted-in-Schizophrenia 1 Overexpression Disrupts Hippocampal Coding and Oscillatory Synchronization.” Hippocampus, vol. 29, no. 9, Wiley, 2019, pp. 802–16, doi:10.1002/hipo.23076. short: K. Käfer, H. Malagon-Vina, D. Dickerson, J. O’Neill, S.V. Trossbach, C. Korth, J.L. Csicsvari, Hippocampus 29 (2019) 802–816. date_created: 2019-02-10T22:59:18Z date_published: 2019-09-01T00:00:00Z date_updated: 2024-03-27T23:30:22Z day: '01' ddc: - '570' department: - _id: JoCs doi: 10.1002/hipo.23076 ec_funded: 1 external_id: isi: - '000480635400003' file: - access_level: open_access checksum: 5e8de271ca04aef92a5de42d6aac4404 content_type: application/pdf creator: dernst date_created: 2019-02-11T10:42:51Z date_updated: 2020-07-14T12:47:13Z file_id: '5950' file_name: 2019_Hippocampus_Kaefer.pdf file_size: 2132893 relation: main_file file_date_updated: 2020-07-14T12:47:13Z has_accepted_license: '1' intvolume: ' 29' isi: 1 issue: '9' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: 802-816 project: - _id: 257BBB4C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '607616' name: Inter-and intracellular signalling in schizophrenia publication: Hippocampus publication_status: published publisher: Wiley quality_controlled: '1' related_material: record: - id: '6825' relation: dissertation_contains status: public scopus_import: '1' status: public title: Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization 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: 29 year: '2019' ... --- _id: '6825' abstract: - lang: eng text: "The solving of complex tasks requires the functions of more than one brain area and their interaction. Whilst spatial navigation and memory is dependent on the hippocampus, flexible behavior relies on the medial prefrontal cortex (mPFC). To further examine the roles of the hippocampus and mPFC, we recorded their neural activity during a task that depends on both of these brain regions.\r\nWith tetrodes, we recorded the extracellular activity of dorsal hippocampal CA1 (HPC) and mPFC neurons in Long-Evans rats performing a rule-switching task on the plus-maze. The plus-maze task had a spatial component since it required navigation along one of the two start arms and at the maze center a choice between one of the two goal arms. Which goal contained a reward depended on the rule currently in place. After an uncued rule change the animal had to abandon the old strategy and switch to the new rule, testing cognitive flexibility. Investigating the coordination of activity between the HPC and mPFC allows determination during which task stages their interaction is required. Additionally, comparing neural activity patterns in these two brain regions allows delineation of the specialized functions of the HPC and mPFC in this task. We analyzed neural activity in the HPC and mPFC in terms of oscillatory interactions, rule coding and replay.\r\nWe found that theta coherence between the HPC and mPFC is increased at the center and goals of the maze, both when the rule was stable or has changed. Similar results were found for locking of HPC and mPFC neurons to HPC theta oscillations. However, no differences in HPC-mPFC theta coordination were observed between the spatially- and cue-guided rule. Phase locking of HPC and mPFC neurons to HPC gamma oscillations was not modulated by\r\nmaze position or rule type. We found that the HPC coded for the two different rules with cofiring relationships between\r\ncell pairs. However, we could not find conclusive evidence for rule coding in the mPFC. Spatially-selective firing in the mPFC generalized between the two start and two goal arms. With Bayesian positional decoding, we found that the mPFC reactivated non-local positions during awake immobility periods. Replay of these non-local positions could represent entire behavioral trajectories resembling trajectory replay of the HPC. Furthermore, mPFC\r\ntrajectory-replay at the goal positively correlated with rule-switching performance. \r\nFinally, HPC and mPFC trajectory replay occurred independently of each other. These results show that the mPFC can replay ordered patterns of activity during awake immobility, possibly underlying its role in flexible behavior. " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Karola full_name: Käfer, Karola id: 2DAA49AA-F248-11E8-B48F-1D18A9856A87 last_name: Käfer citation: ama: Käfer K. The hippocampus and medial prefrontal cortex during flexible behavior. 2019. doi:10.15479/AT:ISTA:6825 apa: Käfer, K. (2019). The hippocampus and medial prefrontal cortex during flexible behavior. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6825 chicago: Käfer, Karola. “The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6825. ieee: K. Käfer, “The hippocampus and medial prefrontal cortex during flexible behavior,” Institute of Science and Technology Austria, 2019. ista: Käfer K. 2019. The hippocampus and medial prefrontal cortex during flexible behavior. Institute of Science and Technology Austria. mla: Käfer, Karola. The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6825. short: K. Käfer, The Hippocampus and Medial Prefrontal Cortex during Flexible Behavior, Institute of Science and Technology Austria, 2019. date_created: 2019-08-21T15:00:57Z date_published: 2019-08-24T00:00:00Z date_updated: 2023-09-07T13:01:42Z day: '24' ddc: - '570' degree_awarded: PhD department: - _id: JoCs doi: 10.15479/AT:ISTA:6825 file: - access_level: open_access checksum: 2664420e332a33338568f4f3bfc59287 content_type: application/pdf creator: kkaefer date_created: 2019-09-03T08:07:13Z date_updated: 2020-09-06T22:30:03Z embargo: 2020-09-05 file_id: '6846' file_name: Thesis_Kaefer_PDFA.pdf file_size: 3205202 relation: main_file request_a_copy: 0 - access_level: closed checksum: 9a154eab6f07aa590a3d2651dc0d926a content_type: application/zip creator: kkaefer date_created: 2019-09-03T08:07:17Z date_updated: 2020-09-15T22:30:05Z embargo_to: open_access file_id: '6847' file_name: Thesis_Kaefer.zip file_size: 2506835 relation: main_file file_date_updated: 2020-09-15T22:30:05Z has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '89' publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '5949' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jozsef L full_name: Csicsvari, Jozsef L id: 3FA14672-F248-11E8-B48F-1D18A9856A87 last_name: Csicsvari orcid: 0000-0002-5193-4036 title: The hippocampus and medial prefrontal cortex during flexible behavior type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6713' abstract: - lang: eng text: Evolutionary studies are often limited by missing data that are critical to understanding the history of selection. Selection experiments, which reproduce rapid evolution under controlled conditions, are excellent tools to study how genomes evolve under selection. Here we present a genomic dissection of the Longshanks selection experiment, in which mice were selectively bred over 20 generations for longer tibiae relative to body mass, resulting in 13% longer tibiae in two replicates. We synthesized evolutionary theory, genome sequences and molecular genetics to understand the selection response and found that it involved both polygenic adaptation and discrete loci of major effect, with the strongest loci tending to be selected in parallel between replicates. We show that selection may favor de-repression of bone growth through inactivating two limb enhancers of an inhibitor, Nkx3-2. Our integrative genomic analyses thus show that it is possible to connect individual base-pair changes to the overall selection response. article_number: e42014 article_processing_charge: No author: - first_name: João Pl full_name: Castro, João Pl last_name: Castro - first_name: Michelle N. full_name: Yancoskie, Michelle N. last_name: Yancoskie - first_name: Marta full_name: Marchini, Marta last_name: Marchini - first_name: Stefanie full_name: Belohlavy, Stefanie id: 43FE426A-F248-11E8-B48F-1D18A9856A87 last_name: Belohlavy orcid: 0000-0002-9849-498X - first_name: Layla full_name: Hiramatsu, Layla last_name: Hiramatsu - first_name: Marek full_name: Kučka, Marek last_name: Kučka - first_name: William H. full_name: Beluch, William H. last_name: Beluch - first_name: Ronald full_name: Naumann, Ronald last_name: Naumann - first_name: Isabella full_name: Skuplik, Isabella last_name: Skuplik - first_name: John full_name: Cobb, John last_name: Cobb - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Campbell full_name: Rolian, Campbell last_name: Rolian - first_name: Yingguang Frank full_name: Chan, Yingguang Frank last_name: Chan citation: ama: Castro JP, Yancoskie MN, Marchini M, et al. An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice. eLife. 2019;8. doi:10.7554/eLife.42014 apa: Castro, J. P., Yancoskie, M. N., Marchini, M., Belohlavy, S., Hiramatsu, L., Kučka, M., … Chan, Y. F. (2019). An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.42014 chicago: Castro, João Pl, Michelle N. Yancoskie, Marta Marchini, Stefanie Belohlavy, Layla Hiramatsu, Marek Kučka, William H. Beluch, et al. “An Integrative Genomic Analysis of the Longshanks Selection Experiment for Longer Limbs in Mice.” ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/eLife.42014. ieee: J. P. Castro et al., “An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice,” eLife, vol. 8. eLife Sciences Publications, 2019. ista: Castro JP, Yancoskie MN, Marchini M, Belohlavy S, Hiramatsu L, Kučka M, Beluch WH, Naumann R, Skuplik I, Cobb J, Barton NH, Rolian C, Chan YF. 2019. An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice. eLife. 8, e42014. mla: Castro, João Pl, et al. “An Integrative Genomic Analysis of the Longshanks Selection Experiment for Longer Limbs in Mice.” ELife, vol. 8, e42014, eLife Sciences Publications, 2019, doi:10.7554/eLife.42014. short: J.P. Castro, M.N. Yancoskie, M. Marchini, S. Belohlavy, L. Hiramatsu, M. Kučka, W.H. Beluch, R. Naumann, I. Skuplik, J. Cobb, N.H. Barton, C. Rolian, Y.F. Chan, ELife 8 (2019). date_created: 2019-07-28T21:59:17Z date_published: 2019-06-06T00:00:00Z date_updated: 2024-03-27T23:30:22Z day: '06' ddc: - '576' department: - _id: NiBa doi: 10.7554/eLife.42014 external_id: isi: - '000473588700001' pmid: - '31169497' file: - access_level: open_access checksum: fa0936fe58f0d9e3f8e75038570e5a17 content_type: application/pdf creator: apreinsp date_created: 2019-07-29T07:41:18Z date_updated: 2020-07-14T12:47:38Z file_id: '6721' file_name: 2019_eLife_Castro.pdf file_size: 6748249 relation: main_file file_date_updated: 2020-07-14T12:47:38Z has_accepted_license: '1' intvolume: ' 8' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Published Version pmid: 1 publication: eLife publication_status: published publisher: eLife Sciences Publications quality_controlled: '1' related_material: record: - id: '9804' relation: research_data status: public - id: '11388' relation: dissertation_contains status: public scopus_import: '1' status: public title: An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice 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: '2019' ... --- _id: '10065' abstract: - lang: eng text: We study double quantum dots in a Ge/SiGe heterostructure and test their maturity towards singlet-triplet ($S-T_0$) qubits. We demonstrate a large range of tunability, from two single quantum dots to a double quantum dot. We measure Pauli spin blockade and study the anisotropy of the $g$-factor. We use an adjacent quantum dot for sensing charge transitions in the double quantum dot at interest. In conclusion, Ge/SiGe possesses all ingredients necessary for building a singlet-triplet qubit. acknowledged_ssus: - _id: M-Shop - _id: NanoFab acknowledgement: "We thank Matthias Brauns for helpful discussions and careful proofreading of the manuscript. This project has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No 844511 and from the FWF project P30207. The research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA machine shop and the nanofabrication\r\nfacility." article_number: '1910.05841' article_processing_charge: No author: - 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: Maxim full_name: Borovkov, Maxim last_name: Borovkov - 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: Andrea full_name: Ballabio, Andrea last_name: Ballabio - first_name: Jacopo full_name: Frigerio, Jacopo last_name: Frigerio - first_name: Daniel full_name: Chrastina, Daniel last_name: Chrastina - first_name: Giovanni full_name: Isella, Giovanni last_name: Isella - first_name: Georgios full_name: Katsaros, Georgios id: 38DB5788-F248-11E8-B48F-1D18A9856A87 last_name: Katsaros orcid: 0000-0001-8342-202X citation: ama: Hofmann AC, Jirovec D, Borovkov M, et al. Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. arXiv. doi:10.48550/arXiv.1910.05841 apa: Hofmann, A. C., Jirovec, D., Borovkov, M., Prieto Gonzalez, I., Ballabio, A., Frigerio, J., … Katsaros, G. (n.d.). Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. arXiv. https://doi.org/10.48550/arXiv.1910.05841 chicago: Hofmann, Andrea C, Daniel Jirovec, Maxim Borovkov, Ivan Prieto Gonzalez, Andrea Ballabio, Jacopo Frigerio, Daniel Chrastina, Giovanni Isella, and Georgios Katsaros. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet Qubits.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1910.05841. ieee: A. C. Hofmann et al., “Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits,” arXiv. . ista: Hofmann AC, Jirovec D, Borovkov M, Prieto Gonzalez I, Ballabio A, Frigerio J, Chrastina D, Isella G, Katsaros G. Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits. arXiv, 1910.05841. mla: Hofmann, Andrea C., et al. “Assessing the Potential of Ge/SiGe Quantum Dots as Hosts for Singlet-Triplet Qubits.” ArXiv, 1910.05841, doi:10.48550/arXiv.1910.05841. short: A.C. Hofmann, D. Jirovec, M. Borovkov, I. Prieto Gonzalez, A. Ballabio, J. Frigerio, D. Chrastina, G. Isella, G. Katsaros, ArXiv (n.d.). date_created: 2021-10-01T12:14:51Z date_published: 2019-10-13T00:00:00Z date_updated: 2024-03-27T23:30:26Z day: '13' department: - _id: GeKa doi: 10.48550/arXiv.1910.05841 ec_funded: 1 external_id: arxiv: - '1910.05841' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1910.05841 month: '10' oa: 1 oa_version: Preprint project: - _id: 26A151DA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '844511' name: Majorana bound states in Ge/SiGe heterostructures - _id: 2641CE5E-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P30207 name: Hole spin orbit qubits in Ge quantum wells publication: arXiv publication_status: submitted related_material: record: - id: '10058' relation: dissertation_contains status: public status: public title: Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6187' abstract: - lang: eng text: Aberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify a key conserved regulator that orchestrates O-glycosylation on a protein subset to activate a program governing migration steps important for both development and cancer metastasis. acknowledged_ssus: - _id: LifeSc article_number: e41801 article_processing_charge: No author: - first_name: Katarina full_name: Valosková, Katarina id: 46F146FC-F248-11E8-B48F-1D18A9856A87 last_name: Valosková - first_name: Julia full_name: Biebl, Julia id: 3CCBB46E-F248-11E8-B48F-1D18A9856A87 last_name: Biebl - first_name: Marko full_name: Roblek, Marko id: 3047D808-F248-11E8-B48F-1D18A9856A87 last_name: Roblek orcid: 0000-0001-9588-1389 - 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: Michaela full_name: Misova, Michaela id: 495A3C32-F248-11E8-B48F-1D18A9856A87 last_name: Misova orcid: 0000-0003-2427-6856 - first_name: Aparna full_name: Ratheesh, Aparna id: 2F064CFE-F248-11E8-B48F-1D18A9856A87 last_name: Ratheesh orcid: 0000-0001-7190-0776 - first_name: Patricia full_name: Rodrigues, Patricia id: 2CE4065A-F248-11E8-B48F-1D18A9856A87 last_name: Rodrigues - first_name: Katerina full_name: Shkarina, Katerina last_name: Shkarina - first_name: Ida Signe Bohse full_name: Larsen, Ida Signe Bohse last_name: Larsen - first_name: Sergey Y full_name: Vakhrushev, Sergey Y last_name: Vakhrushev - first_name: Henrik full_name: Clausen, Henrik last_name: Clausen - 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: Valosková K, Bicher J, Roblek M, et al. A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. eLife. 2019;8. doi:10.7554/elife.41801 apa: Valosková, K., Bicher, J., Roblek, M., Emtenani, S., György, A., Misova, M., … Siekhaus, D. E. (2019). A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.41801 chicago: Valosková, Katarina, Julia Bicher, Marko Roblek, Shamsi Emtenani, Attila György, Michaela Misova, Aparna Ratheesh, et al. “A Conserved Major Facilitator Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” ELife. eLife Sciences Publications, 2019. https://doi.org/10.7554/elife.41801. ieee: K. Valosková et al., “A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion,” eLife, vol. 8. eLife Sciences Publications, 2019. ista: Valosková K, Bicher J, Roblek M, Emtenani S, György A, Misova M, Ratheesh A, Rodrigues P, Shkarina K, Larsen ISB, Vakhrushev SY, Clausen H, Siekhaus DE. 2019. A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion. eLife. 8, e41801. mla: Valosková, Katarina, et al. “A Conserved Major Facilitator Superfamily Member Orchestrates a Subset of O-Glycosylation to Aid Macrophage Tissue Invasion.” ELife, vol. 8, e41801, eLife Sciences Publications, 2019, doi:10.7554/elife.41801. short: K. Valosková, J. Bicher, M. Roblek, S. Emtenani, A. György, M. Misova, A. Ratheesh, P. Rodrigues, K. Shkarina, I.S.B. Larsen, S.Y. Vakhrushev, H. Clausen, D.E. Siekhaus, ELife 8 (2019). date_created: 2019-03-28T13:37:45Z date_published: 2019-03-26T00:00:00Z date_updated: 2024-03-27T23:30:29Z day: '26' ddc: - '570' department: - _id: DaSi doi: 10.7554/elife.41801 ec_funded: 1 external_id: isi: - '000462530200001' file: - access_level: open_access checksum: cc0d1a512559d52e7e7cb0e9b9854b40 content_type: application/pdf creator: dernst date_created: 2019-03-28T14:00:41Z date_updated: 2020-07-14T12:47:23Z file_id: '6188' file_name: 2019_eLife_Valoskova.pdf file_size: 4496017 relation: main_file file_date_updated: 2020-07-14T12:47:23Z has_accepted_license: '1' intvolume: ' 8' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: 253CDE40-B435-11E9-9278-68D0E5697425 grant_number: '24283' name: Examination of the role of a MFS transporter in the migration of Drosophila immune cells - _id: 253B6E48-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P29638 name: The role of Drosophila TNF alpha in immune cell invasion - _id: 2536F660-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '334077' name: Investigating the role of transporters in invasive migration through junctions - _id: 25388084-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '329540' name: 'Breaking barriers: Investigating the junctional and mechanobiological changes underlying the ability of Drosophila immune cells to invade an epithelium' - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program publication: eLife publication_identifier: issn: - 2050-084X publication_status: published publisher: eLife Sciences Publications quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/new-gene-potentially-involved-in-metastasis-identified/ record: - id: '6530' relation: dissertation_contains - id: '8983' relation: dissertation_contains status: public - id: '6546' relation: dissertation_contains status: public scopus_import: '1' status: public title: A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion 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: '2019' ... --- _id: '6546' abstract: - lang: eng text: "Invasive migration plays a crucial role not only during development and homeostasis but also in pathological states, such as tumor metastasis. Drosophila macrophage migration into the extended germband is an interesting system to study invasive migration. It carries similarities to immune cell transmigration and cancer cell invasion, therefore studying this process could also bring new understanding of invasion in higher organisms. In our work, we uncover a highly conserved member of the major facilitator family that plays a role in tissue invasion through regulation of glycosylation on a subgroup of proteins and/or by aiding the precise timing of DN-Cadherin downregulation. \r\n\r\nAberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify \r\na key conserved regulator that orchestrates O-glycosylation on a protein subset to activate \r\na program governing migration steps important for both development and cancer metastasis. \r\n" acknowledged_ssus: - _id: Bio alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Katarina full_name: Valosková, Katarina id: 46F146FC-F248-11E8-B48F-1D18A9856A87 last_name: Valosková citation: ama: Valosková K. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. 2019. doi:10.15479/AT:ISTA:6546 apa: Valosková, K. (2019). The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6546 chicago: Valosková, Katarina. “The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6546. ieee: K. Valosková, “The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration,” Institute of Science and Technology Austria, 2019. ista: Valosková K. 2019. The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration. Institute of Science and Technology Austria. mla: Valosková, Katarina. The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6546. short: K. Valosková, The Role of a Highly Conserved Major Facilitator Superfamily Member in Drosophila Embryonic Macrophage Migration, Institute of Science and Technology Austria, 2019. date_created: 2019-06-07T12:49:19Z date_published: 2019-06-07T00:00:00Z date_updated: 2023-09-19T10:15:54Z day: '07' ddc: - '570' degree_awarded: PhD department: - _id: DaSi doi: 10.15479/AT:ISTA:6546 file: - access_level: closed checksum: 68949c2d96210b45b981a23e9c9cd93c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: khribikova date_created: 2019-06-07T13:00:04Z date_updated: 2020-07-14T12:47:33Z embargo_to: open_access file_id: '6549' file_name: Katarina Valoskova_PhD thesis_final version.docx file_size: 14110626 relation: source_file - access_level: open_access checksum: 555329cd76e196c96f5278c480ee2e6e content_type: application/pdf creator: khribikova date_created: 2019-06-07T13:00:08Z date_updated: 2021-02-11T11:17:14Z embargo: 2020-06-07 file_id: '6550' file_name: Katarina Valoskova_PhD thesis_final version.pdf file_size: 10054156 relation: main_file file_date_updated: 2021-02-11T11:17:14Z has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '141' project: - _id: 253CDE40-B435-11E9-9278-68D0E5697425 grant_number: '24283' name: Examination of the role of a MFS transporter in the migration of Drosophila immune cells publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '6187' relation: part_of_dissertation status: public - id: '544' 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: The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6363' abstract: - lang: eng text: "Distinguishing between similar experiences is achieved by the brain \ in a process called pattern separation. In the hippocampus, pattern \ separation reduces the interference of memories and increases the storage capacity by decorrelating similar inputs patterns of neuronal activity into \ non-overlapping output firing patterns. Winners-take-all (WTA) mechanism \ is a theoretical model for pattern separation in which a \"winner\" \ cell suppresses the activity of the neighboring neurons through feedback inhibition. However, if the network properties of the dentate gyrus support WTA as a biologically conceivable model remains unknown. Here, we showed that the connectivity rules of PV+interneurons and their synaptic properties are optimizedfor efficient pattern separation. We found using multiple whole-cell in vitrorecordings that PV+interneurons mainly connect to granule cells (GC) through lateral inhibition, a form of feedback inhibition in which a GC inhibits other GCs but not \ itself through the activation of PV+interneurons. Thus, lateral inhibition between GC–PV+interneurons was ~10 times more abundant than recurrent connections. Furthermore, the GC–PV+interneuron connectivity was more spatially confined \ but less abundant than PV+interneurons–GC connectivity, leading to an \ asymmetrical distribution of excitatory and inhibitory connectivity. Our network model of the dentate gyrus with incorporated real connectivity rules efficiently decorrelates neuronal activity patterns using WTA as the primary mechanism. \ This process relied on lateral inhibition, fast-signaling properties of \ PV+interneurons and the asymmetrical distribution of excitatory and inhibitory connectivity. Finally, we found that silencing the activity of PV+interneurons in vivoleads to acute deficits in discrimination between similar environments, suggesting that PV+interneuron networks are necessary for behavioral relevant computations. Our results demonstrate that PV+interneurons possess unique connectivity and fast signaling properties that confer to the dentate \ gyrus network properties that allow the emergence of pattern separation. Thus, our results contribute to the knowledge of how specific forms of network organization underlie sophisticated types of information processing. \r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: 'Claudia ' full_name: 'Espinoza Martinez, Claudia ' id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87 last_name: Espinoza Martinez orcid: 0000-0003-4710-2082 citation: ama: Espinoza Martinez C. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. 2019. doi:10.15479/AT:ISTA:6363 apa: Espinoza Martinez, C. (2019). Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6363 chicago: Espinoza Martinez, Claudia . “Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6363. ieee: C. Espinoza Martinez, “Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits,” Institute of Science and Technology Austria, 2019. ista: Espinoza Martinez C. 2019. Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits. Institute of Science and Technology Austria. mla: Espinoza Martinez, Claudia. Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6363. short: C. Espinoza Martinez, Parvalbumin+ Interneurons Enable Efficient Pattern Separation in Hippocampal Microcircuits, Institute of Science and Technology Austria, 2019. date_created: 2019-04-30T11:56:10Z date_published: 2019-04-30T00:00:00Z date_updated: 2023-09-15T12:03:48Z day: '30' ddc: - '570' degree_awarded: PhD department: - _id: PeJo doi: 10.15479/AT:ISTA:6363 file: - access_level: open_access checksum: 77c6c05cfe8b58c8abcf1b854375d084 content_type: application/pdf creator: cespinoza date_created: 2019-05-07T16:00:39Z date_updated: 2021-02-11T11:17:15Z embargo: 2020-05-09 file_id: '6389' file_name: Espinozathesis_all2.pdf file_size: 13966891 relation: main_file - access_level: closed checksum: f6aa819f127691a2b0fc21c76eb09746 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cespinoza date_created: 2019-05-07T16:00:48Z date_updated: 2020-07-14T12:47:28Z embargo_to: open_access file_id: '6390' file_name: Espinoza_Thesis.docx file_size: 11159900 relation: source_file file_date_updated: 2021-02-11T11:17:15Z has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '140' publication_identifier: isbn: - 978-3-99078-000-8 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '21' relation: part_of_dissertation status: public status: public supervisor: - first_name: Peter M full_name: Jonas, Peter M id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 title: Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6780' abstract: - lang: eng text: "In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property" article_number: '129' article_processing_charge: No author: - first_name: Mingzhang full_name: Huang, Mingzhang last_name: Huang - first_name: Hongfei full_name: Fu, Hongfei last_name: Fu - 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 citation: ama: 'Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . Vol 3. ACM; 2019. doi:10.1145/3360555' apa: 'Huang, M., Fu, H., Chatterjee, K., & Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vol. 3). Athens, Greece: ACM. https://doi.org/10.1145/3360555' chicago: Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019. https://doi.org/10.1145/3360555. ieee: M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Athens, Greece, 2019, vol. 3. ista: 'Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.' mla: Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , vol. 3, 129, ACM, 2019, doi:10.1145/3360555. short: M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019. conference: end_date: 2019-10-25 location: Athens, Greece name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications' start_date: 2019-10-23 date_created: 2019-08-09T09:54:20Z date_published: 2019-10-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1145/3360555 ec_funded: 1 external_id: arxiv: - '1901.06087' file: - access_level: open_access checksum: 3482d8ace6fb4991eb7810e3b70f1b9f content_type: application/pdf creator: akafshda date_created: 2019-08-12T15:40:57Z date_updated: 2020-07-14T12:47:40Z file_id: '6807' file_name: oopsla-2019.pdf file_size: 1024643 relation: main_file - access_level: open_access checksum: 4e5a6fb2b59a75222a4e8335a5a60eac content_type: application/pdf creator: dernst date_created: 2020-05-12T15:15:14Z date_updated: 2020-07-14T12:47:40Z file_id: '7821' file_name: 2019_ACM_Huang.pdf file_size: 538579 relation: main_file file_date_updated: 2020-07-14T12:47:40Z has_accepted_license: '1' intvolume: ' 3' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/4.0/ month: '10' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _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' - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: 'Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ' publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public status: public title: Modular verification for almost-sure termination of probabilistic programs 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: conference user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 3 year: '2019' ... --- _id: '6380' abstract: - lang: eng text: 'There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. ' article_number: '53' 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: Nastaran full_name: Okati, Nastaran last_name: Okati - 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, Okati N, Pavlogiannis A. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 2019;3(POPL). doi:10.1145/3290366 apa: Chatterjee, K., Goharshady, A. K., Okati, N., & Pavlogiannis, A. (2019). Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. ACM. https://doi.org/10.1145/3290366 chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages. ACM, 2019. https://doi.org/10.1145/3290366. ieee: K. Chatterjee, A. K. Goharshady, N. Okati, and A. Pavlogiannis, “Efficient parameterized algorithms for data packing,” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL. ACM, 2019. ista: Chatterjee K, Goharshady AK, Okati N, Pavlogiannis A. 2019. Efficient parameterized algorithms for data packing. Proceedings of the ACM on Programming Languages. 3(POPL), 53. mla: Chatterjee, Krishnendu, et al. “Efficient Parameterized Algorithms for Data Packing.” Proceedings of the ACM on Programming Languages, vol. 3, no. POPL, 53, ACM, 2019, doi:10.1145/3290366. short: K. Chatterjee, A.K. Goharshady, N. Okati, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 3 (2019). date_created: 2019-05-06T12:18:17Z date_published: 2019-01-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.1145/3290366 ec_funded: 1 file: - access_level: open_access checksum: c157752f96877b36685ad7063ada4524 content_type: application/pdf creator: dernst date_created: 2019-05-06T12:23:11Z date_updated: 2020-07-14T12:47:29Z file_id: '6381' file_name: 2019_ACM_POPL_Chatterjee.pdf file_size: 1294962 relation: main_file file_date_updated: 2020-07-14T12:47:29Z has_accepted_license: '1' intvolume: ' 3' issue: POPL language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' publication: Proceedings of the ACM on Programming Languages publication_identifier: issn: - 2475-1421 publication_status: published publisher: ACM pubrep_id: '1056' quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public status: public title: Efficient parameterized algorithms for data packing 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: 3 year: '2019' ... --- _id: '6056' abstract: - lang: eng text: In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs. article_number: '8751326' 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: Arash full_name: Pourdamghani, Arash last_name: Pourdamghani citation: ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Probabilistic smart contracts: Secure randomness on the blockchain. In: IEEE International Conference on Blockchain and Cryptocurrency. IEEE; 2019. doi:10.1109/BLOC.2019.8751326' apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Probabilistic smart contracts: Secure randomness on the blockchain. In IEEE International Conference on Blockchain and Cryptocurrency. Seoul, Korea: IEEE. https://doi.org/10.1109/BLOC.2019.8751326' chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019. https://doi.org/10.1109/BLOC.2019.8751326.' ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Probabilistic smart contracts: Secure randomness on the blockchain,” in IEEE International Conference on Blockchain and Cryptocurrency, Seoul, Korea, 2019.' ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Probabilistic smart contracts: Secure randomness on the blockchain. IEEE International Conference on Blockchain and Cryptocurrency. IEEE International Conference on Blockchain and Cryptocurrency, 8751326.' mla: 'Chatterjee, Krishnendu, et al. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.” IEEE International Conference on Blockchain and Cryptocurrency, 8751326, IEEE, 2019, doi:10.1109/BLOC.2019.8751326.' short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, IEEE International Conference on Blockchain and Cryptocurrency, IEEE, 2019. conference: end_date: 2019-05-17 location: Seoul, Korea name: IEEE International Conference on Blockchain and Cryptocurrency start_date: 2019-05-14 date_created: 2019-02-26T09:03:15Z date_published: 2019-05-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' department: - _id: KrCh doi: 10.1109/BLOC.2019.8751326 ec_funded: 1 external_id: arxiv: - '1902.07986' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1902.07986 month: '05' oa: 1 oa_version: Preprint project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _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: IEEE International Conference on Blockchain and Cryptocurrency publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: 1 status: public title: 'Probabilistic smart contracts: Secure randomness on the blockchain' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '6378' abstract: - lang: eng text: 'In today''s cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner''s chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.' 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: Arash full_name: Pourdamghani, Arash last_name: Pourdamghani citation: ama: 'Chatterjee K, Goharshady AK, Pourdamghani A. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; 2019:374-381. doi:10.1145/3297280.3297319' apa: 'Chatterjee, K., Goharshady, A. K., & Pourdamghani, A. (2019). Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 374–381). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297319' chicago: 'Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:374–81. ACM, 2019. https://doi.org/10.1145/3297280.3297319.' ieee: 'K. Chatterjee, A. K. Goharshady, and A. Pourdamghani, “Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, 2019, vol. Part F147772, pp. 374–381.' ista: 'Chatterjee K, Goharshady AK, Pourdamghani A. 2019. Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving. Proceedings of the 34th ACM Symposium on Applied Computing. ACM Symposium on Applied Computing vol. Part F147772, 374–381.' mla: 'Chatterjee, Krishnendu, et al. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, 2019, pp. 374–81, doi:10.1145/3297280.3297319.' short: K. Chatterjee, A.K. Goharshady, A. Pourdamghani, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, 2019, pp. 374–381. conference: end_date: 2019-04-12 location: Limassol, Cyprus name: ACM Symposium on Applied Computing start_date: 2019-04-08 date_created: 2019-05-06T12:11:36Z date_published: 2019-04-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '004' department: - _id: KrCh doi: 10.1145/3297280.3297319 ec_funded: 1 external_id: isi: - '000474685800049' file: - access_level: open_access checksum: fbfbcd5a0c7a743862bfc3045539a614 content_type: application/pdf creator: dernst date_created: 2019-05-06T12:09:27Z date_updated: 2020-07-14T12:47:29Z file_id: '6379' file_name: 2019_ACM_Chatterjee.pdf file_size: 1023934 relation: main_file file_date_updated: 2020-07-14T12:47:29Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Submitted Version page: 374-381 project: - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication: Proceedings of the 34th ACM Symposium on Applied Computing publication_identifier: isbn: - '9781450359337' publication_status: published publisher: ACM pubrep_id: '1069' quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving' type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: Part F147772 year: '2019' ... --- _id: '6175' abstract: - lang: eng text: "We consider the problem of expected cost analysis over nondeterministic probabilistic programs,\r\nwhich aims at automated methods for analyzing the resource-usage of such programs.\r\nPrevious approaches for this problem could only handle nonnegative bounded costs.\r\nHowever, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols,\r\nboth positive and negative costs are necessary and the costs are unbounded as well.\r\n\r\nIn this work, we present a sound and efficient approach to obtain polynomial bounds on the\r\nexpected accumulated cost of nondeterministic probabilistic programs.\r\nOur approach can handle (a) general positive and negative costs with bounded updates in\r\nvariables; and (b) nonnegative costs with general updates to variables.\r\nWe show that several natural examples which could not be\r\nhandled by previous approaches are captured in our framework.\r\n\r\nMoreover, our approach leads to an efficient polynomial-time algorithm, while no\r\nprevious approach for cost analysis of probabilistic programs could guarantee polynomial runtime.\r\nFinally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds." article_processing_charge: No author: - first_name: Peixin full_name: Wang, Peixin last_name: Wang - 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: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Xudong full_name: Qin, Xudong last_name: Qin - first_name: Wenjun full_name: Shi, Wenjun last_name: Shi citation: ama: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. Cost analysis of nondeterministic probabilistic programs. In: PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2019:204-220. doi:10.1145/3314221.3314581' apa: 'Wang, P., Fu, H., Goharshady, A. K., Chatterjee, K., Qin, X., & Shi, W. (2019). Cost analysis of nondeterministic probabilistic programs. In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 204–220). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3314221.3314581' chicago: 'Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.' ieee: 'P. Wang, H. Fu, A. K. Goharshady, K. Chatterjee, X. Qin, and W. Shi, “Cost analysis of nondeterministic probabilistic programs,” in PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Phoenix, AZ, United States, 2019, pp. 204–220.' ista: 'Wang P, Fu H, Goharshady AK, Chatterjee K, Qin X, Shi W. 2019. Cost analysis of nondeterministic probabilistic programs. PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Conference on Programming Language Design and Implementation, 204–220.' mla: 'Wang, Peixin, et al. “Cost Analysis of Nondeterministic Probabilistic Programs.” PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–20, doi:10.1145/3314221.3314581.' short: 'P. Wang, H. Fu, A.K. Goharshady, K. Chatterjee, X. Qin, W. Shi, in:, PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2019, pp. 204–220.' conference: end_date: 2019-06-26 location: Phoenix, AZ, United States name: 'PLDI: Conference on Programming Language Design and Implementation' start_date: 2019-06-22 date_created: 2019-03-25T10:13:25Z date_published: 2019-06-08T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '08' ddc: - '000' department: - _id: KrCh doi: 10.1145/3314221.3314581 ec_funded: 1 external_id: arxiv: - '1902.04659' isi: - '000523190300014' file: - access_level: open_access checksum: 703a5e9b8c8587f2a44085ffd9a4db64 content_type: application/pdf creator: akafshda date_created: 2019-03-25T10:11:22Z date_updated: 2020-07-14T12:47:20Z file_id: '6176' file_name: paper.pdf file_size: 4051066 relation: main_file file_date_updated: 2020-07-14T12:47:20Z has_accepted_license: '1' isi: 1 keyword: - Program Cost Analysis - Program Termination - Probabilistic Programs - Martingales language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 204-220 project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: 'PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation' publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '5457' relation: earlier_version status: public - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Cost analysis of nondeterministic probabilistic programs type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2019' ... --- _id: '6490' abstract: - lang: eng text: "Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy.\r\n\r\nTwo classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses.\r\n\r\nIn this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case.\r\n" 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: Ehsan Kafshdar full_name: Goharshady, Ehsan Kafshdar last_name: Goharshady citation: ama: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :400-408. doi:10.1145/3297280.3297322' apa: 'Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322' chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322. ieee: K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 400–408. ista: 'Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.' mla: Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 400–08, doi:10.1145/3297280.3297322. short: K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408. conference: end_date: 2019-04-12 location: Limassol, Cyprus name: 'SAC: Symposium on Applied Computing' start_date: 2019-04-08 date_created: 2019-05-26T21:59:15Z date_published: 2019-04-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1145/3297280.3297322 external_id: isi: - '000474685800052' file: - access_level: open_access checksum: dddc20f6d9881f23b8755eb720ec9d6f content_type: application/pdf creator: dernst date_created: 2020-05-14T09:50:11Z date_updated: 2020-07-14T12:47:32Z file_id: '7827' file_name: 2019_ACM_Chatterjee.pdf file_size: 6937138 relation: main_file file_date_updated: 2020-07-14T12:47:32Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '04' oa: 1 oa_version: Submitted Version page: 400-408 publication: Proceedings of the 34th ACM Symposium on Applied Computing publication_identifier: isbn: - '9781450359337' publication_status: submitted publisher: ACM pubrep_id: '1070' quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: The treewidth of smart contracts type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: Part F147772 year: '2019' ... --- _id: '7158' abstract: - lang: eng text: "Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth.\r\n\r\nOur main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches.\r\n" article_number: '23' article_processing_charge: No article_type: original 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: Prateesh full_name: Goyal, Prateesh last_name: Goyal - 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, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525 apa: Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525 chicago: Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525. ieee: K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019. ista: Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23. mla: Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525. short: K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019). date_created: 2019-12-09T08:33:33Z date_published: 2019-11-01T00:00:00Z date_updated: 2024-03-27T23:30:34Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1145/3363525 ec_funded: 1 external_id: isi: - '000564108400004' file: - access_level: open_access checksum: 291cc86a07bd010d4815e177dac57b70 content_type: application/pdf creator: dernst date_created: 2020-10-08T12:58:10Z date_updated: 2020-10-08T12:58:10Z file_id: '8632' file_name: 2019_ACMTransactions_Chatterjee.pdf file_size: 667357 relation: main_file success: 1 file_date_updated: 2020-10-08T12:58:10Z has_accepted_license: '1' intvolume: ' 41' isi: 1 issue: '4' language: - iso: eng month: '11' oa: 1 oa_version: Submitted Version project: - _id: 2584A770-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P 23499-N23 name: Modern Graph Algorithmic Techniques in Formal Verification - _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: ACM Transactions on Programming Languages and Systems publication_identifier: issn: - 0164-0925 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 41 year: '2019' ... --- _id: '7014' abstract: - lang: eng text: "We study the problem of developing efficient approaches for proving\r\nworst-case bounds of non-deterministic recursive programs. Ranking functions\r\nare sound and complete for proving termination and worst-case bounds of\r\nnonrecursive programs. First, we apply ranking functions to recursion,\r\nresulting in measure functions. We show that measure functions provide a sound\r\nand complete approach to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second contribution is the synthesis of measure functions in\r\nnonpolynomial forms. We show that non-polynomial measure functions with\r\nlogarithm and exponentiation can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$ is not an integer. We present\r\nexperimental results to demonstrate that our approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii) Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that $r$ is not an integer and\r\nclose to the best-known bounds for the respective algorithms." article_number: '20' article_processing_charge: No article_type: original 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 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 citation: ama: Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3339984 apa: Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984 chicago: Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984. ieee: K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019. ista: Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20. mla: Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 20, ACM, 2019, doi:10.1145/3339984. short: K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019). date_created: 2019-11-13T08:33:43Z date_published: 2019-10-01T00:00:00Z date_updated: 2024-03-27T23:30:33Z day: '01' department: - _id: KrCh doi: 10.1145/3339984 ec_funded: 1 external_id: arxiv: - '1705.00317' isi: - '000564108400001' intvolume: ' 41' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1705.00317 month: '10' oa: 1 oa_version: Preprint project: - _id: 25892FC0-B435-11E9-9278-68D0E5697425 grant_number: ICT15-003 name: Efficient Algorithms for Computer Aided Verification - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 2581B60A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '279307' name: 'Quantitative Graph Games: Theory and Applications' - _id: 267066CE-B435-11E9-9278-68D0E5697425 name: Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies - _id: 266EEEC0-B435-11E9-9278-68D0E5697425 name: Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts publication: ACM Transactions on Programming Languages and Systems publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '639' relation: earlier_version status: public - id: '8934' relation: dissertation_contains status: public scopus_import: '1' status: public title: Non-polynomial worst-case analysis of recursive programs type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 41 year: '2019' ... --- _id: '6486' abstract: - lang: eng text: Based on a novel control scheme, where a steady modification of the streamwise velocity profile leads to complete relaminarization of initially fully turbulent pipe flow, we investigate the applicability and usefulness of custom-shaped honeycombs for such control. The custom-shaped honeycombs are used as stationary flow management devices which generate specific modifications of the streamwise velocity profile. Stereoscopic particle image velocimetry and pressure drop measurements are used to investigate and capture the development of the relaminarizing flow downstream these devices. We compare the performance of straight (constant length across the radius of the pipe) honeycombs with custom-shaped ones (variable length across the radius) and try to determine the optimal shape for maximal relaminarization at minimal pressure loss. The optimally modified streamwise velocity profile is found to be M-shaped, and the maximum attainable Reynolds number for total relaminarization is found to be of the order of 10,000. Consequently, the respective reduction in skin friction downstream of the device is almost by a factor of 5. The break-even point, where the additional pressure drop caused by the device is balanced by the savings due to relaminarization and a net gain is obtained, corresponds to a downstream stretch of distances as low as approximately 100 pipe diameters of laminar flow. acknowledged_ssus: - _id: M-Shop article_number: '111105' article_processing_charge: No article_type: original author: - first_name: Jakob full_name: Kühnen, Jakob id: 3A47AE32-F248-11E8-B48F-1D18A9856A87 last_name: Kühnen orcid: 0000-0003-4312-0179 - first_name: Davide full_name: Scarselli, Davide id: 40315C30-F248-11E8-B48F-1D18A9856A87 last_name: Scarselli orcid: 0000-0001-5227-4271 - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Kühnen J, Scarselli D, Hof B. Relaminarization of pipe flow by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering. 2019;141(11). doi:10.1115/1.4043494 apa: Kühnen, J., Scarselli, D., & Hof, B. (2019). Relaminarization of pipe flow by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering. ASME. https://doi.org/10.1115/1.4043494 chicago: Kühnen, Jakob, Davide Scarselli, and Björn Hof. “Relaminarization of Pipe Flow by Means of 3D-Printed Shaped Honeycombs.” Journal of Fluids Engineering. ASME, 2019. https://doi.org/10.1115/1.4043494. ieee: J. Kühnen, D. Scarselli, and B. Hof, “Relaminarization of pipe flow by means of 3D-printed shaped honeycombs,” Journal of Fluids Engineering, vol. 141, no. 11. ASME, 2019. ista: Kühnen J, Scarselli D, Hof B. 2019. Relaminarization of pipe flow by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering. 141(11), 111105. mla: Kühnen, Jakob, et al. “Relaminarization of Pipe Flow by Means of 3D-Printed Shaped Honeycombs.” Journal of Fluids Engineering, vol. 141, no. 11, 111105, ASME, 2019, doi:10.1115/1.4043494. short: J. Kühnen, D. Scarselli, B. Hof, Journal of Fluids Engineering 141 (2019). date_created: 2019-05-26T21:59:13Z date_published: 2019-11-01T00:00:00Z date_updated: 2024-03-27T23:30:35Z day: '01' department: - _id: BjHo doi: 10.1115/1.4043494 ec_funded: 1 external_id: arxiv: - '1809.07625' isi: - '000487748600005' intvolume: ' 141' isi: 1 issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.07625 month: '11' oa: 1 oa_version: Preprint project: - _id: 25152F3A-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '306589' name: Decoding the complexity of turbulence at its origin publication: Journal of Fluids Engineering publication_identifier: eissn: - 1528901X issn: - '00982202' publication_status: published publisher: ASME quality_controlled: '1' related_material: record: - id: '7258' relation: dissertation_contains status: public scopus_import: '1' status: public title: Relaminarization of pipe flow by means of 3D-printed shaped honeycombs type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 141 year: '2019' ... --- _id: '6228' abstract: - lang: eng text: Following the recent observation that turbulent pipe flow can be relaminarised bya relatively simple modification of the mean velocity profile, we here carry out aquantitative experimental investigation of this phenomenon. Our study confirms thata flat velocity profile leads to a collapse of turbulence and in order to achieve theblunted profile shape, we employ a moving pipe segment that is briefly and rapidlyshifted in the streamwise direction. The relaminarisation threshold and the minimumshift length and speeds are determined as a function of Reynolds number. Althoughturbulence is still active after the acceleration phase, the modulated profile possessesa severely decreased lift-up potential as measured by transient growth. As shown,this results in an exponential decay of fluctuations and the flow relaminarises. Whilethis method can be easily applied at low to moderate flow speeds, the minimumstreamwise length over which the acceleration needs to act increases linearly with theReynolds number. 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 - first_name: Jakob full_name: Kühnen, Jakob id: 3A47AE32-F248-11E8-B48F-1D18A9856A87 last_name: Kühnen orcid: 0000-0003-4312-0179 - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Scarselli D, Kühnen J, Hof B. Relaminarising pipe flow by wall movement. Journal of Fluid Mechanics. 2019;867:934-948. doi:10.1017/jfm.2019.191 apa: Scarselli, D., Kühnen, J., & Hof, B. (2019). Relaminarising pipe flow by wall movement. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2019.191 chicago: Scarselli, Davide, Jakob Kühnen, and Björn Hof. “Relaminarising Pipe Flow by Wall Movement.” Journal of Fluid Mechanics. Cambridge University Press, 2019. https://doi.org/10.1017/jfm.2019.191. ieee: D. Scarselli, J. Kühnen, and B. Hof, “Relaminarising pipe flow by wall movement,” Journal of Fluid Mechanics, vol. 867. Cambridge University Press, pp. 934–948, 2019. ista: Scarselli D, Kühnen J, Hof B. 2019. Relaminarising pipe flow by wall movement. Journal of Fluid Mechanics. 867, 934–948. mla: Scarselli, Davide, et al. “Relaminarising Pipe Flow by Wall Movement.” Journal of Fluid Mechanics, vol. 867, Cambridge University Press, 2019, pp. 934–48, doi:10.1017/jfm.2019.191. short: D. Scarselli, J. Kühnen, B. Hof, Journal of Fluid Mechanics 867 (2019) 934–948. date_created: 2019-04-07T21:59:14Z date_published: 2019-05-25T00:00:00Z date_updated: 2024-03-27T23:30:35Z day: '25' department: - _id: BjHo doi: 10.1017/jfm.2019.191 ec_funded: 1 external_id: arxiv: - '1807.05357' isi: - '000462606100001' intvolume: ' 867' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1807.05357 month: '05' oa: 1 oa_version: Preprint page: 934-948 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 publication: Journal of Fluid Mechanics publication_identifier: eissn: - '14697645' issn: - '00221120' publication_status: published publisher: Cambridge University Press quality_controlled: '1' related_material: link: - relation: supplementary_material url: https://doi.org/10.1017/jfm.2019.191 record: - id: '7258' relation: dissertation_contains status: public scopus_import: '1' status: public title: Relaminarising pipe flow by wall movement type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 867 year: '2019' ... --- _id: '6260' abstract: - lang: eng text: Polar auxin transport plays a pivotal role in plant growth and development. PIN auxin efflux carriers regulate directional auxin movement by establishing local auxin maxima, minima, and gradients that drive multiple developmental processes and responses to environmental signals. Auxin has been proposed to modulate its own transport by regulating subcellular PIN trafficking via processes such as clathrin-mediated PIN endocytosis and constitutive recycling. Here, we further investigated the mechanisms by which auxin affects PIN trafficking by screening auxin analogs and identified pinstatic acid (PISA) as a positive modulator of polar auxin transport in Arabidopsis thaliana. PISA had an auxin-like effect on hypocotyl elongation and adventitious root formation via positive regulation of auxin transport. PISA did not activate SCFTIR1/AFB signaling and yet induced PIN accumulation at the cell surface by inhibiting PIN internalization from the plasma membrane. This work demonstrates PISA to be a promising chemical tool to dissect the regulatory mechanisms behind subcellular PIN trafficking and auxin transport. acknowledgement: "We thank Dr. H. Fukaki (University of Kobe), Dr. R. Offringa (Leiden University), Dr. Jianwei Pan (Zhejiang Normal University), and Dr. M. Estelle (University of California at San Diego) for providing mutants and transgenic line seeds.\r\nThis work was supported by the Ministry of Education, Culture, Sports, Science, and Technology (Grant-in-Aid for Scientific Research no. JP25114518 to K.H.), the Biotechnology and Biological Sciences Research Council (award no. BB/L009366/1 to R.N. and S.K.), and the European Union’s Horizon2020 program (European Research Council grant agreement no. 742985 to J.F.)." article_processing_charge: No article_type: original author: - first_name: A full_name: Oochi, A last_name: Oochi - first_name: Jakub full_name: Hajny, Jakub id: 4800CC20-F248-11E8-B48F-1D18A9856A87 last_name: Hajny orcid: 0000-0003-2140-7195 - first_name: K full_name: Fukui, K last_name: Fukui - first_name: Y full_name: Nakao, Y last_name: Nakao - first_name: Michelle C full_name: Gallei, Michelle C id: 35A03822-F248-11E8-B48F-1D18A9856A87 last_name: Gallei orcid: 0000-0003-1286-7368 - first_name: M full_name: Quareshy, M last_name: Quareshy - first_name: K full_name: Takahashi, K last_name: Takahashi - first_name: T full_name: Kinoshita, T last_name: Kinoshita - first_name: SR full_name: Harborough, SR last_name: Harborough - first_name: S full_name: Kepinski, S last_name: Kepinski - first_name: H full_name: Kasahara, H last_name: Kasahara - first_name: RM full_name: Napier, RM last_name: Napier - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 - first_name: KI full_name: Hayashi, KI last_name: Hayashi citation: ama: Oochi A, Hajny J, Fukui K, et al. Pinstatic acid promotes auxin transport by inhibiting PIN internalization. Plant Physiology. 2019;180(2):1152-1165. doi:10.1104/pp.19.00201 apa: Oochi, A., Hajny, J., Fukui, K., Nakao, Y., Gallei, M. C., Quareshy, M., … Hayashi, K. (2019). Pinstatic acid promotes auxin transport by inhibiting PIN internalization. Plant Physiology. ASPB. https://doi.org/10.1104/pp.19.00201 chicago: Oochi, A, Jakub Hajny, K Fukui, Y Nakao, Michelle C Gallei, M Quareshy, K Takahashi, et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN Internalization.” Plant Physiology. ASPB, 2019. https://doi.org/10.1104/pp.19.00201. ieee: A. Oochi et al., “Pinstatic acid promotes auxin transport by inhibiting PIN internalization,” Plant Physiology, vol. 180, no. 2. ASPB, pp. 1152–1165, 2019. ista: Oochi A, Hajny J, Fukui K, Nakao Y, Gallei MC, Quareshy M, Takahashi K, Kinoshita T, Harborough S, Kepinski S, Kasahara H, Napier R, Friml J, Hayashi K. 2019. Pinstatic acid promotes auxin transport by inhibiting PIN internalization. Plant Physiology. 180(2), 1152–1165. mla: Oochi, A., et al. “Pinstatic Acid Promotes Auxin Transport by Inhibiting PIN Internalization.” Plant Physiology, vol. 180, no. 2, ASPB, 2019, pp. 1152–65, doi:10.1104/pp.19.00201. short: A. Oochi, J. Hajny, K. Fukui, Y. Nakao, M.C. Gallei, M. Quareshy, K. Takahashi, T. Kinoshita, S. Harborough, S. Kepinski, H. Kasahara, R. Napier, J. Friml, K. Hayashi, Plant Physiology 180 (2019) 1152–1165. date_created: 2019-04-09T08:38:20Z date_published: 2019-06-01T00:00:00Z date_updated: 2024-03-27T23:30:37Z day: '01' department: - _id: JiFr doi: 10.1104/pp.19.00201 ec_funded: 1 external_id: isi: - '000470086100045' pmid: - '30936248' intvolume: ' 180' isi: 1 issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1104/pp.19.00201 month: '06' oa: 1 oa_version: Published Version page: 1152-1165 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 publication: Plant Physiology publication_identifier: eissn: - 1532-2548 issn: - 0032-0889 publication_status: published publisher: ASPB quality_controlled: '1' related_material: record: - id: '11626' relation: dissertation_contains status: public - id: '8822' relation: dissertation_contains status: public scopus_import: '1' status: public title: Pinstatic acid promotes auxin transport by inhibiting PIN internalization type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 180 year: '2019' ... --- _id: '6508' abstract: - lang: eng text: Segregation of maternal determinants within the oocyte constitutes the first step in embryo patterning. In zebrafish oocytes, extensive ooplasmic streaming leads to the segregation of ooplasm from yolk granules along the animal-vegetal axis of the oocyte. Here, we 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 oocyte. This wave functions in segregation by both pulling ooplasm animally and pushing yolk granules vegetally. Using biophysical experimentation and theory, we show that ooplasm pulling is mediated by bulk actin network flows exerting friction forces on the ooplasm, while yolk granule pushing is achieved by a mechanism closely resembling actin comet formation on yolk granules. Our study defines a novel role of cell-cycle-controlled bulk actin polymerization waves in oocyte polarization via ooplasmic segregation. acknowledged_ssus: - _id: Bio - _id: PreCl acknowledgement: We would like to thank Pierre Recho, Guillaume Salbreux, and Silvia Grigolon for advice on the theory, Lila Solnica-Krezel for kindly providing us with zebrafish dachsous mutants, members of the Heisenberg and Hannezo groups for fruitful discussions, and the Bioimaging and zebrafish facilities at IST Austria for their continuous support. This project has received funding from the European Union (European Research Council Advanced Grant 742573 to C.P.H.) and from the Austrian Science Fund (FWF) (P 31639 to E.H.). article_processing_charge: No article_type: original author: - first_name: Shayan full_name: Shamipour, Shayan id: 40B34FE2-F248-11E8-B48F-1D18A9856A87 last_name: Shamipour - first_name: Roland full_name: Kardos, Roland id: 4039350E-F248-11E8-B48F-1D18A9856A87 last_name: Kardos - first_name: Shi-lei full_name: Xue, Shi-lei id: 31D2C804-F248-11E8-B48F-1D18A9856A87 last_name: Xue - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 - first_name: Edouard B full_name: Hannezo, Edouard B id: 3A9DB764-F248-11E8-B48F-1D18A9856A87 last_name: Hannezo orcid: 0000-0001-6005-1561 - 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 citation: ama: Shamipour S, Kardos R, Xue S, Hof B, Hannezo EB, Heisenberg C-PJ. Bulk actin dynamics drive phase segregation in zebrafish oocytes. Cell. 2019;177(6):1463-1479.e18. doi:10.1016/j.cell.2019.04.030 apa: Shamipour, S., Kardos, R., Xue, S., Hof, B., Hannezo, E. B., & Heisenberg, C.-P. J. (2019). Bulk actin dynamics drive phase segregation in zebrafish oocytes. Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.04.030 chicago: Shamipour, Shayan, Roland Kardos, Shi-lei Xue, Björn Hof, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Bulk Actin Dynamics Drive Phase Segregation in Zebrafish Oocytes.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.04.030. ieee: S. Shamipour, R. Kardos, S. Xue, B. Hof, E. B. Hannezo, and C.-P. J. Heisenberg, “Bulk actin dynamics drive phase segregation in zebrafish oocytes,” Cell, vol. 177, no. 6. Elsevier, p. 1463–1479.e18, 2019. ista: Shamipour S, Kardos R, Xue S, Hof B, Hannezo EB, Heisenberg C-PJ. 2019. Bulk actin dynamics drive phase segregation in zebrafish oocytes. Cell. 177(6), 1463–1479.e18. mla: Shamipour, Shayan, et al. “Bulk Actin Dynamics Drive Phase Segregation in Zebrafish Oocytes.” Cell, vol. 177, no. 6, Elsevier, 2019, p. 1463–1479.e18, doi:10.1016/j.cell.2019.04.030. short: S. Shamipour, R. Kardos, S. Xue, B. Hof, E.B. Hannezo, C.-P.J. Heisenberg, Cell 177 (2019) 1463–1479.e18. date_created: 2019-06-02T21:59:12Z date_published: 2019-05-30T00:00:00Z date_updated: 2024-03-27T23:30:38Z day: '30' ddc: - '570' department: - _id: CaHe - _id: EdHa - _id: BjHo doi: 10.1016/j.cell.2019.04.030 ec_funded: 1 external_id: isi: - '000469415100013' pmid: - '31080065' file: - access_level: open_access checksum: aea43726d80e35ce3885073a5f05c3e3 content_type: application/pdf creator: dernst date_created: 2020-10-21T07:22:34Z date_updated: 2020-10-21T07:22:34Z file_id: '8686' file_name: 2019_Cell_Shamipour_accepted.pdf file_size: 3356292 relation: main_file success: 1 file_date_updated: 2020-10-21T07:22:34Z has_accepted_license: '1' intvolume: ' 177' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.cell.2019.04.030 month: '05' oa: 1 oa_version: Published Version page: 1463-1479.e18 pmid: 1 project: - _id: 260F1432-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742573' name: Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation - _id: 268294B6-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P31639 name: Active mechano-chemical description of the cell cytoskeleton publication: Cell publication_identifier: eissn: - '10974172' issn: - '00928674' publication_status: published publisher: Elsevier quality_controlled: '1' related_material: link: - description: News on IST Homepage relation: press_release url: https://ist.ac.at/en/news/how-the-cytoplasm-separates-from-the-yolk/ record: - id: '8350' relation: dissertation_contains status: public scopus_import: '1' status: public title: Bulk actin dynamics drive phase segregation in zebrafish oocytes type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 177 year: '2019' ... --- _id: '7001' acknowledged_ssus: - _id: PreCl - _id: Bio article_processing_charge: No article_type: original author: - first_name: Cornelia full_name: Schwayer, Cornelia id: 3436488C-F248-11E8-B48F-1D18A9856A87 last_name: Schwayer orcid: 0000-0001-5130-2226 - first_name: Shayan full_name: Shamipour, Shayan id: 40B34FE2-F248-11E8-B48F-1D18A9856A87 last_name: Shamipour - first_name: Kornelija full_name: Pranjic-Ferscha, Kornelija id: 4362B3C2-F248-11E8-B48F-1D18A9856A87 last_name: Pranjic-Ferscha - first_name: Alexandra full_name: Schauer, Alexandra id: 30A536BA-F248-11E8-B48F-1D18A9856A87 last_name: Schauer orcid: 0000-0001-7659-9142 - first_name: M full_name: Balda, M last_name: Balda - first_name: M full_name: Tada, M last_name: Tada - first_name: K full_name: Matter, K last_name: Matter - 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 citation: ama: Schwayer C, Shamipour S, Pranjic-Ferscha K, et al. Mechanosensation of tight junctions depends on ZO-1 phase separation and flow. Cell. 2019;179(4):937-952.e18. doi:10.1016/j.cell.2019.10.006 apa: Schwayer, C., Shamipour, S., Pranjic-Ferscha, K., Schauer, A., Balda, M., Tada, M., … Heisenberg, C.-P. J. (2019). Mechanosensation of tight junctions depends on ZO-1 phase separation and flow. Cell. Cell Press. https://doi.org/10.1016/j.cell.2019.10.006 chicago: Schwayer, Cornelia, Shayan Shamipour, Kornelija Pranjic-Ferscha, Alexandra Schauer, M Balda, M Tada, K Matter, and Carl-Philipp J Heisenberg. “Mechanosensation of Tight Junctions Depends on ZO-1 Phase Separation and Flow.” Cell. Cell Press, 2019. https://doi.org/10.1016/j.cell.2019.10.006. ieee: C. Schwayer et al., “Mechanosensation of tight junctions depends on ZO-1 phase separation and flow,” Cell, vol. 179, no. 4. Cell Press, p. 937–952.e18, 2019. ista: Schwayer C, Shamipour S, Pranjic-Ferscha K, Schauer A, Balda M, Tada M, Matter K, Heisenberg C-PJ. 2019. Mechanosensation of tight junctions depends on ZO-1 phase separation and flow. Cell. 179(4), 937–952.e18. mla: Schwayer, Cornelia, et al. “Mechanosensation of Tight Junctions Depends on ZO-1 Phase Separation and Flow.” Cell, vol. 179, no. 4, Cell Press, 2019, p. 937–952.e18, doi:10.1016/j.cell.2019.10.006. short: C. Schwayer, S. Shamipour, K. Pranjic-Ferscha, A. Schauer, M. Balda, M. Tada, K. Matter, C.-P.J. Heisenberg, Cell 179 (2019) 937–952.e18. date_created: 2019-11-12T12:51:06Z date_published: 2019-10-31T00:00:00Z date_updated: 2024-03-27T23:30:38Z day: '31' ddc: - '570' department: - _id: CaHe - _id: BjHo doi: 10.1016/j.cell.2019.10.006 ec_funded: 1 external_id: isi: - '000493898000012' pmid: - '31675500' file: - access_level: open_access checksum: 33dac4bb77ee630e2666e936b4d57980 content_type: application/pdf creator: dernst date_created: 2020-10-21T07:09:45Z date_updated: 2020-10-21T07:09:45Z file_id: '8684' file_name: 2019_Cell_Schwayer_accepted.pdf file_size: 8805878 relation: main_file success: 1 file_date_updated: 2020-10-21T07:09:45Z has_accepted_license: '1' intvolume: ' 179' isi: 1 issue: '4' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 937-952.e18 pmid: 1 project: - _id: 260F1432-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '742573' name: Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation publication: Cell publication_identifier: eissn: - 1097-4172 issn: - 0092-8674 publication_status: published publisher: Cell Press quality_controlled: '1' related_material: link: - description: News auf IST Website relation: press_release url: https://ist.ac.at/en/news/biochemistry-meets-mechanics-the-sensitive-nature-of-cell-cell-contact-formation-in-embryo-development/ record: - id: '7186' relation: dissertation_contains status: public - id: '8350' relation: dissertation_contains status: public scopus_import: '1' status: public title: Mechanosensation of tight junctions depends on ZO-1 phase separation and flow type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 179 year: '2019' ... --- _id: '6891' abstract: - lang: eng text: "While cells of mesenchymal or epithelial origin perform their effector functions in a purely anchorage dependent manner, cells derived from the hematopoietic lineage are not committed to operate only within a specific niche. Instead, these cells are able to function autonomously of the molecular composition in a broad range of tissue compartments. By this means, cells of the hematopoietic lineage retain the capacity to disseminate into connective tissue and recirculate between organs, building the foundation for essential processes such as tissue regeneration or immune surveillance. \r\nCells of the immune system, specifically leukocytes, are extraordinarily good at performing this task. These cells are able to flexibly shift their mode of migration between an adhesion-mediated and an adhesion-independent manner, instantaneously accommodating for any changes in molecular composition of the external scaffold. The key component driving directed leukocyte migration is the chemokine receptor 7, which guides the cell along gradients of chemokine ligand. Therefore, the physical destination of migrating leukocytes is purely deterministic, i.e. given by global directional cues such as chemokine gradients. \r\nNevertheless, these cells typically reside in three-dimensional scaffolds of inhomogeneous complexity, raising the question whether cells are able to locally discriminate between multiple optional migration routes. Current literature provides evidence that leukocytes, specifically dendritic cells, do indeed probe their surrounding by virtue of multiple explorative protrusions. However, it remains enigmatic how these cells decide which one is the more favorable route to follow and what are the key players involved in performing this task. Due to the heterogeneous environment of most tissues, and the vast adaptability of migrating leukocytes, at this time it is not clear to what extent leukocytes are able to optimize their migratory strategy by adapting their level of adhesiveness. And, given the fact that leukocyte migration is characterized by branched cell shapes in combination with high migration velocities, it is reasonable to assume that these cells require fine tuned shape maintenance mechanisms that tightly coordinate protrusion and adhesion dynamics in a spatiotemporal manner. \r\nTherefore, this study aimed to elucidate how rapidly migrating leukocytes opt for an ideal migratory path while maintaining a continuous cell shape and balancing adhesive forces to efficiently navigate through complex microenvironments. \r\nThe results of this study unraveled a role for the microtubule cytoskeleton in promoting the decision making process during path finding and for the first time point towards a microtubule-mediated function in cell shape maintenance of highly ramified cells such as dendritic cells. Furthermore, we found that migrating low-adhesive leukocytes are able to instantaneously adapt to increased tensile load by engaging adhesion receptors. This response was only occurring tangential to the substrate while adhesive properties in the vertical direction were not increased. As leukocytes are primed for rapid migration velocities, these results demonstrate that leukocyte integrins are able to confer a high level of traction forces parallel to the cell membrane along the direction of migration without wasting energy in gluing the cell to the substrate. \r\nThus, the data in the here presented thesis provide new insights into the pivotal role of cytoskeletal dynamics and the mechanisms of force transduction during leukocyte migration. \r\nThereby the here presented results help to further define fundamental principles underlying leukocyte migration and open up potential therapeutic avenues of clinical relevance.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Aglaja full_name: Kopf, Aglaja id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87 last_name: Kopf orcid: 0000-0002-2187-6656 citation: ama: Kopf A. The implication of cytoskeletal dynamics on leukocyte migration. 2019. doi:10.15479/AT:ISTA:6891 apa: Kopf, A. (2019). The implication of cytoskeletal dynamics on leukocyte migration. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6891 chicago: Kopf, Aglaja. “The Implication of Cytoskeletal Dynamics on Leukocyte Migration.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6891. ieee: A. Kopf, “The implication of cytoskeletal dynamics on leukocyte migration,” Institute of Science and Technology Austria, 2019. ista: Kopf A. 2019. The implication of cytoskeletal dynamics on leukocyte migration. Institute of Science and Technology Austria. mla: Kopf, Aglaja. The Implication of Cytoskeletal Dynamics on Leukocyte Migration. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6891. short: A. Kopf, The Implication of Cytoskeletal Dynamics on Leukocyte Migration, Institute of Science and Technology Austria, 2019. date_created: 2019-09-19T08:19:44Z date_published: 2019-07-24T00:00:00Z date_updated: 2023-10-18T08:49:17Z day: '24' ddc: - '570' degree_awarded: PhD department: - _id: MiSi doi: 10.15479/AT:ISTA:6891 file: - access_level: closed checksum: 00d100d6468e31e583051e0a006b640c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: akopf date_created: 2019-10-15T05:28:42Z date_updated: 2020-10-17T22:30:03Z embargo_to: open_access file_id: '6950' file_name: Kopf_PhD_Thesis.docx file_size: 74735267 relation: source_file - access_level: open_access checksum: 5d1baa899993ae6ca81aebebe1797000 content_type: application/pdf creator: akopf date_created: 2019-10-15T05:28:47Z date_updated: 2020-10-17T22:30:03Z embargo: 2020-10-16 file_id: '6951' file_name: Kopf_PhD_Thesis1.pdf file_size: 52787224 relation: main_file file_date_updated: 2020-10-17T22:30:03Z has_accepted_license: '1' keyword: - cell biology - immunology - leukocyte - migration - microfluidics language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: '171' project: - _id: 265E2996-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W01250-B20 name: Nano-Analytics of Cellular Systems publication_identifier: eissn: - 2663-337X isbn: - 978-3-99078-002-2 publication_status: published publisher: Institute of Science and Technology Austria related_material: link: - relation: press_release url: https://ist.ac.at/en/news/feeling-like-a-cell/ record: - id: '6328' relation: part_of_dissertation status: public - id: '15' relation: part_of_dissertation status: public - id: '6877' relation: part_of_dissertation status: public status: public supervisor: - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 title: The implication of cytoskeletal dynamics on leukocyte migration type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '6328' abstract: - lang: eng text: During metazoan development, immune surveillance and cancer dissemination, cells migrate in complex three-dimensional microenvironments1,2,3. These spaces are crowded by cells and extracellular matrix, generating mazes with differently sized gaps that are typically smaller than the diameter of the migrating cell4,5. Most mesenchymal and epithelial cells and some—but not all—cancer cells actively generate their migratory path using pericellular tissue proteolysis6. By contrast, amoeboid cells such as leukocytes use non-destructive strategies of locomotion7, raising the question how these extremely fast cells navigate through dense tissues. Here we reveal that leukocytes sample their immediate vicinity for large pore sizes, and are thereby able to choose the path of least resistance. This allows them to circumnavigate local obstacles while effectively following global directional cues such as chemotactic gradients. Pore-size discrimination is facilitated by frontward positioning of the nucleus, which enables the cells to use their bulkiest compartment as a mechanical gauge. Once the nucleus and the closely associated microtubule organizing centre pass the largest pore, cytoplasmic protrusions still lingering in smaller pores are retracted. These retractions are coordinated by dynamic microtubules; when microtubules are disrupted, migrating cells lose coherence and frequently fragment into migratory cytoplasmic pieces. As nuclear positioning in front of the microtubule organizing centre is a typical feature of amoeboid migration, our findings link the fundamental organization of cellular polarity to the strategy of locomotion. acknowledged_ssus: - _id: SSU article_processing_charge: No article_type: letter_note author: - first_name: Jörg full_name: Renkawitz, Jörg id: 3F0587C8-F248-11E8-B48F-1D18A9856A87 last_name: Renkawitz orcid: 0000-0003-2856-3369 - first_name: Aglaja full_name: Kopf, Aglaja id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87 last_name: Kopf orcid: 0000-0002-2187-6656 - first_name: Julian A full_name: Stopp, Julian A id: 489E3F00-F248-11E8-B48F-1D18A9856A87 last_name: Stopp - first_name: Ingrid full_name: de Vries, Ingrid id: 4C7D837E-F248-11E8-B48F-1D18A9856A87 last_name: de Vries - first_name: Meghan K. full_name: Driscoll, Meghan K. last_name: Driscoll - first_name: Jack full_name: Merrin, Jack id: 4515C308-F248-11E8-B48F-1D18A9856A87 last_name: Merrin orcid: 0000-0001-5145-4609 - first_name: Robert full_name: Hauschild, Robert id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87 last_name: Hauschild orcid: 0000-0001-9843-3522 - first_name: Erik S. full_name: Welf, Erik S. last_name: Welf - first_name: Gaudenz full_name: Danuser, Gaudenz last_name: Danuser - first_name: Reto full_name: Fiolka, Reto last_name: Fiolka - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: ama: Renkawitz J, Kopf A, Stopp JA, et al. Nuclear positioning facilitates amoeboid migration along the path of least resistance. Nature. 2019;568:546-550. doi:10.1038/s41586-019-1087-5 apa: Renkawitz, J., Kopf, A., Stopp, J. A., de Vries, I., Driscoll, M. K., Merrin, J., … Sixt, M. K. (2019). Nuclear positioning facilitates amoeboid migration along the path of least resistance. Nature. Springer Nature. https://doi.org/10.1038/s41586-019-1087-5 chicago: Renkawitz, Jörg, Aglaja Kopf, Julian A Stopp, Ingrid de Vries, Meghan K. Driscoll, Jack Merrin, Robert Hauschild, et al. “Nuclear Positioning Facilitates Amoeboid Migration along the Path of Least Resistance.” Nature. Springer Nature, 2019. https://doi.org/10.1038/s41586-019-1087-5. ieee: J. Renkawitz et al., “Nuclear positioning facilitates amoeboid migration along the path of least resistance,” Nature, vol. 568. Springer Nature, pp. 546–550, 2019. ista: Renkawitz J, Kopf A, Stopp JA, de Vries I, Driscoll MK, Merrin J, Hauschild R, Welf ES, Danuser G, Fiolka R, Sixt MK. 2019. Nuclear positioning facilitates amoeboid migration along the path of least resistance. Nature. 568, 546–550. mla: Renkawitz, Jörg, et al. “Nuclear Positioning Facilitates Amoeboid Migration along the Path of Least Resistance.” Nature, vol. 568, Springer Nature, 2019, pp. 546–50, doi:10.1038/s41586-019-1087-5. short: J. Renkawitz, A. Kopf, J.A. Stopp, I. de Vries, M.K. Driscoll, J. Merrin, R. Hauschild, E.S. Welf, G. Danuser, R. Fiolka, M.K. Sixt, Nature 568 (2019) 546–550. date_created: 2019-04-17T06:52:28Z date_published: 2019-04-25T00:00:00Z date_updated: 2024-03-27T23:30:39Z day: '25' department: - _id: MiSi - _id: NanoFab - _id: Bio doi: 10.1038/s41586-019-1087-5 ec_funded: 1 external_id: isi: - '000465594200050' pmid: - '30944468' intvolume: ' 568' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7217284/ month: '04' oa: 1 oa_version: Submitted Version page: 546-550 pmid: 1 project: - _id: 25A603A2-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '281556' name: Cytoskeletal force generation and force transduction of migrating leukocytes (EU) - _id: 25FE9508-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '724373' name: Cellular navigation along spatial gradients - _id: 265FAEBA-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: W01250-B20 name: Nano-Analytics of Cellular Systems - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme - _id: 25A48D24-B435-11E9-9278-68D0E5697425 grant_number: ALTF 1396-2014 name: Molecular and system level view of immune cell migration publication: Nature 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/leukocytes-use-their-nucleus-as-a-ruler-to-choose-path-of-least-resistance/ record: - id: '14697' relation: dissertation_contains status: public - id: '6891' relation: dissertation_contains status: public scopus_import: '1' status: public title: Nuclear positioning facilitates amoeboid migration along the path of least resistance type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 568 year: '2019' ... --- _id: '6877' article_processing_charge: No article_type: original author: - first_name: Aglaja full_name: Kopf, Aglaja id: 31DAC7B6-F248-11E8-B48F-1D18A9856A87 last_name: Kopf orcid: 0000-0002-2187-6656 - first_name: Michael K full_name: Sixt, Michael K id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87 last_name: Sixt orcid: 0000-0002-6620-9179 citation: ama: Kopf A, Sixt MK. The neural crest pitches in to remove apoptotic debris. Cell. 2019;179(1):51-53. doi:10.1016/j.cell.2019.08.047 apa: Kopf, A., & Sixt, M. K. (2019). The neural crest pitches in to remove apoptotic debris. Cell. Elsevier. https://doi.org/10.1016/j.cell.2019.08.047 chicago: Kopf, Aglaja, and Michael K Sixt. “The Neural Crest Pitches in to Remove Apoptotic Debris.” Cell. Elsevier, 2019. https://doi.org/10.1016/j.cell.2019.08.047. ieee: A. Kopf and M. K. Sixt, “The neural crest pitches in to remove apoptotic debris,” Cell, vol. 179, no. 1. Elsevier, pp. 51–53, 2019. ista: Kopf A, Sixt MK. 2019. The neural crest pitches in to remove apoptotic debris. Cell. 179(1), 51–53. mla: Kopf, Aglaja, and Michael K. Sixt. “The Neural Crest Pitches in to Remove Apoptotic Debris.” Cell, vol. 179, no. 1, Elsevier, 2019, pp. 51–53, doi:10.1016/j.cell.2019.08.047. short: A. Kopf, M.K. Sixt, Cell 179 (2019) 51–53. date_created: 2019-09-15T22:00:46Z date_published: 2019-09-19T00:00:00Z date_updated: 2024-03-27T23:30:40Z day: '19' department: - _id: MiSi doi: 10.1016/j.cell.2019.08.047 external_id: isi: - '000486618500011' pmid: - '31539498' intvolume: ' 179' isi: 1 issue: '1' language: - iso: eng month: '09' oa_version: None page: 51-53 pmid: 1 publication: Cell publication_identifier: eissn: - 1097-4172 issn: - 0092-8674 publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '6891' relation: dissertation_contains status: public scopus_import: '1' status: public title: The neural crest pitches in to remove apoptotic debris type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 179 year: '2019' ... --- _id: '6830' article_processing_charge: No article_type: letter_note author: - first_name: Ximena full_name: Contreras, Ximena id: 475990FE-F248-11E8-B48F-1D18A9856A87 last_name: Contreras - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Contreras X, Hippenmeyer S. Memo1 tiles the radial glial cell grid. Neuron. 2019;103(5):750-752. doi:10.1016/j.neuron.2019.08.021 apa: Contreras, X., & Hippenmeyer, S. (2019). Memo1 tiles the radial glial cell grid. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2019.08.021 chicago: Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” Neuron. Elsevier, 2019. https://doi.org/10.1016/j.neuron.2019.08.021. ieee: X. Contreras and S. Hippenmeyer, “Memo1 tiles the radial glial cell grid,” Neuron, vol. 103, no. 5. Elsevier, pp. 750–752, 2019. ista: Contreras X, Hippenmeyer S. 2019. Memo1 tiles the radial glial cell grid. Neuron. 103(5), 750–752. mla: Contreras, Ximena, and Simon Hippenmeyer. “Memo1 Tiles the Radial Glial Cell Grid.” Neuron, vol. 103, no. 5, Elsevier, 2019, pp. 750–52, doi:10.1016/j.neuron.2019.08.021. short: X. Contreras, S. Hippenmeyer, Neuron 103 (2019) 750–752. date_created: 2019-08-25T22:00:50Z date_published: 2019-09-04T00:00:00Z date_updated: 2024-03-27T23:30:41Z day: '04' department: - _id: SiHi doi: 10.1016/j.neuron.2019.08.021 external_id: isi: - '000484400200002' pmid: - '31487522' intvolume: ' 103' isi: 1 issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.neuron.2019.08.021 month: '09' oa: 1 oa_version: Published Version page: 750-752 pmid: 1 publication: Neuron publication_identifier: eissn: - '10974199' issn: - '08966273' publication_status: published publisher: Elsevier quality_controlled: '1' related_material: record: - id: '7902' relation: part_of_dissertation status: public scopus_import: '1' status: public title: Memo1 tiles the radial glial cell grid type: journal_article user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 volume: 103 year: '2019' ... --- _id: '6627' abstract: - lang: eng text: Cortical microtubule arrays in elongating epidermal cells in both the root and stem of plants have the propensity of dynamic reorientations that are correlated with the activation or inhibition of growth. Factors regulating plant growth, among them the hormone auxin, have been recognized as regulators of microtubule array orientations. Some previous work in the field has aimed at elucidating the causal relationship between cell growth, the signaling of auxin or other growth-regulating factors, and microtubule array reorientations, with various conclusions. Here, we revisit this problem of causality with a comprehensive set of experiments in Arabidopsis thaliana, using the now available pharmacological and genetic tools. We use isolated, auxin-depleted hypocotyls, an experimental system allowing for full control of both growth and auxin signaling. We demonstrate that reorientation of microtubules is not directly triggered by an auxin signal during growth activation. Instead, reorientation is triggered by the activation of the growth process itself and is auxin-independent in its nature. We discuss these findings in the context of previous relevant work, including that on the mechanical regulation of microtubule array orientation. article_number: '3337' article_processing_charge: Yes article_type: original author: - first_name: Maciek full_name: Adamowski, Maciek id: 45F536D2-F248-11E8-B48F-1D18A9856A87 last_name: Adamowski orcid: 0000-0001-6463-5257 - first_name: Lanxin full_name: Li, Lanxin id: 367EF8FA-F248-11E8-B48F-1D18A9856A87 last_name: Li orcid: 0000-0002-5607-272X - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 citation: ama: Adamowski M, Li L, Friml J. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 2019;20(13). doi:10.3390/ijms20133337 apa: Adamowski, M., Li, L., & Friml, J. (2019). Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. MDPI. https://doi.org/10.3390/ijms20133337 chicago: Adamowski, Maciek, Lanxin Li, and Jiří Friml. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” International Journal of Molecular Sciences. MDPI, 2019. https://doi.org/10.3390/ijms20133337. ieee: M. Adamowski, L. Li, and J. Friml, “Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling,” International Journal of Molecular Sciences, vol. 20, no. 13. MDPI, 2019. ista: Adamowski M, Li L, Friml J. 2019. Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin signaling. International Journal of Molecular Sciences. 20(13), 3337. mla: Adamowski, Maciek, et al. “Reorientation of Cortical Microtubule Arrays in the Hypocotyl of Arabidopsis Thaliana Is Induced by the Cell Growth Process and Independent of Auxin Signaling.” International Journal of Molecular Sciences, vol. 20, no. 13, 3337, MDPI, 2019, doi:10.3390/ijms20133337. short: M. Adamowski, L. Li, J. Friml, International Journal of Molecular Sciences 20 (2019). date_created: 2019-07-11T12:00:32Z date_published: 2019-07-07T00:00:00Z date_updated: 2024-03-27T23:30:43Z day: '07' ddc: - '580' department: - _id: JiFr doi: 10.3390/ijms20133337 ec_funded: 1 external_id: isi: - '000477041100221' pmid: - '31284661' file: - access_level: open_access checksum: dd9d1cbb933a72ceb666c9667890ac51 content_type: application/pdf creator: dernst date_created: 2019-07-17T06:17:15Z date_updated: 2020-07-14T12:47:34Z file_id: '6645' file_name: 2019_JournalMolecularScience_Adamowski.pdf file_size: 3330291 relation: main_file file_date_updated: 2020-07-14T12:47:34Z has_accepted_license: '1' intvolume: ' 20' isi: 1 issue: '13' language: - iso: eng month: '07' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 25716A02-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '282300' name: Polarity and subcellular dynamics in plants - _id: 2564DBCA-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '665385' name: International IST Doctoral Program - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: International Journal of Molecular Sciences publication_identifier: eissn: - 1422-0067 publication_status: published publisher: MDPI quality_controlled: '1' related_material: record: - id: '10083' relation: dissertation_contains status: public scopus_import: '1' status: public title: Reorientation of cortical microtubule arrays in the hypocotyl of arabidopsis thaliana is induced by the cell growth process and independent of auxin 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: 20 year: '2019' ... --- _id: '7117' abstract: - lang: eng text: We propose a novel generic shape optimization method for CAD models based on the eXtended Finite Element Method (XFEM). Our method works directly on the intersection between the model and a regular simulation grid, without the need to mesh or remesh, thus removing a bottleneck of classical shape optimization strategies. This is made possible by a novel hierarchical integration scheme that accurately integrates finite element quantities with sub-element precision. For optimization, we efficiently compute analytical shape derivatives of the entire framework, from model intersection to integration rule generation and XFEM simulation. Moreover, we describe a differentiable projection of shape parameters onto a constraint manifold spanned by user-specified shape preservation, consistency, and manufacturability constraints. We demonstrate the utility of our approach by optimizing mass distribution, strength-to-weight ratio, and inverse elastic shape design objectives directly on parameterized 3D CAD models. article_number: '157' article_processing_charge: No article_type: original author: - first_name: Christian full_name: Hafner, Christian id: 400429CC-F248-11E8-B48F-1D18A9856A87 last_name: Hafner - first_name: Christian full_name: Schumacher, Christian last_name: Schumacher - first_name: Espen full_name: Knoop, Espen last_name: Knoop - first_name: Thomas full_name: Auzinger, Thomas id: 4718F954-F248-11E8-B48F-1D18A9856A87 last_name: Auzinger orcid: 0000-0002-1546-3265 - first_name: Bernd full_name: Bickel, Bernd id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Moritz full_name: Bächer, Moritz last_name: Bächer citation: ama: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 2019;38(6). doi:10.1145/3355089.3356576' apa: 'Hafner, C., Schumacher, C., Knoop, E., Auzinger, T., Bickel, B., & Bächer, M. (2019). X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3355089.3356576' chicago: 'Hafner, Christian, Christian Schumacher, Espen Knoop, Thomas Auzinger, Bernd Bickel, and Moritz Bächer. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” ACM Transactions on Graphics. ACM, 2019. https://doi.org/10.1145/3355089.3356576.' ieee: 'C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, and M. Bächer, “X-CAD: Optimizing CAD Models with Extended Finite Elements,” ACM Transactions on Graphics, vol. 38, no. 6. ACM, 2019.' ista: 'Hafner C, Schumacher C, Knoop E, Auzinger T, Bickel B, Bächer M. 2019. X-CAD: Optimizing CAD Models with Extended Finite Elements. ACM Transactions on Graphics. 38(6), 157.' mla: 'Hafner, Christian, et al. “X-CAD: Optimizing CAD Models with Extended Finite Elements.” ACM Transactions on Graphics, vol. 38, no. 6, 157, ACM, 2019, doi:10.1145/3355089.3356576.' short: C. Hafner, C. Schumacher, E. Knoop, T. Auzinger, B. Bickel, M. Bächer, ACM Transactions on Graphics 38 (2019). date_created: 2019-11-26T14:22:09Z date_published: 2019-11-06T00:00:00Z date_updated: 2024-03-27T23:30:46Z day: '06' ddc: - '000' department: - _id: BeBi doi: 10.1145/3355089.3356576 ec_funded: 1 external_id: isi: - '000498397300007' file: - access_level: open_access checksum: 56a2fb019adcb556d2b022f5e5acb68c content_type: application/pdf creator: bbickel date_created: 2019-11-26T14:24:26Z date_updated: 2020-07-14T12:47:49Z file_id: '7119' file_name: xcad_sup_mat_siga19.pdf file_size: 1673176 relation: supplementary_material title: X-CAD Supplemental Material - access_level: open_access checksum: 5f29d76aceb5102e766cbab9b17d776e content_type: application/pdf creator: bbickel date_created: 2019-11-26T14:24:27Z date_updated: 2020-07-14T12:47:49Z description: This is the author's version of the work. file_id: '7120' file_name: XCAD_authors_version.pdf file_size: 14563618 relation: main_file title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements' - access_level: open_access checksum: 0d31e123286cbec9e28b2001c2bb0d55 content_type: video/mp4 creator: bbickel date_created: 2019-11-26T14:27:37Z date_updated: 2020-07-14T12:47:49Z file_id: '7121' file_name: XCAD_video.mp4 file_size: 259979129 relation: main_file file_date_updated: 2020-07-14T12:47:49Z has_accepted_license: '1' intvolume: ' 38' isi: 1 issue: '6' language: - iso: eng month: '11' oa: 1 oa_version: Submitted Version project: - _id: 24F9549A-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '715767' name: 'MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling' publication: ACM Transactions on Graphics publication_identifier: issn: - 0730-0301 publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '12897' relation: dissertation_contains status: public scopus_import: '1' status: public title: 'X-CAD: Optimizing CAD Models with Extended Finite Elements' type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 38 year: '2019' ... --- _id: '6189' abstract: - lang: eng text: 'Suspended particles can alter the properties of fluids and in particular also affect the transition fromlaminar to turbulent flow. An earlier study [Mataset al.,Phys. Rev. Lett.90, 014501 (2003)] reported howthe subcritical (i.e., hysteretic) transition to turbulent puffs is affected by the addition of particles. Here weshow that in addition to this known transition, with increasing concentration a supercritical (i.e.,continuous) transition to a globally fluctuating state is found. At the same time the Newtonian-typetransition to puffs is delayed to larger Reynolds numbers. At even higher concentration only the globallyfluctuating state is found. The dynamics of particle laden flows are hence determined by two competinginstabilities that give rise to three flow regimes: Newtonian-type turbulence at low, a particle inducedglobally fluctuating state at high, and a coexistence state at intermediate concentrations.' article_number: '114502' article_processing_charge: No author: - first_name: Nishchal full_name: Agrawal, Nishchal id: 469E6004-F248-11E8-B48F-1D18A9856A87 last_name: Agrawal - first_name: George H full_name: Choueiri, George H id: 448BD5BC-F248-11E8-B48F-1D18A9856A87 last_name: Choueiri - first_name: Björn full_name: Hof, Björn id: 3A374330-F248-11E8-B48F-1D18A9856A87 last_name: Hof orcid: 0000-0003-2057-2754 citation: ama: Agrawal N, Choueiri GH, Hof B. Transition to turbulence in particle laden flows. Physical Review Letters. 2019;122(11). doi:10.1103/PhysRevLett.122.114502 apa: Agrawal, N., Choueiri, G. H., & Hof, B. (2019). Transition to turbulence in particle laden flows. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.122.114502 chicago: Agrawal, Nishchal, George H Choueiri, and Björn Hof. “Transition to Turbulence in Particle Laden Flows.” Physical Review Letters. American Physical Society, 2019. https://doi.org/10.1103/PhysRevLett.122.114502. ieee: N. Agrawal, G. H. Choueiri, and B. Hof, “Transition to turbulence in particle laden flows,” Physical Review Letters, vol. 122, no. 11. American Physical Society, 2019. ista: Agrawal N, Choueiri GH, Hof B. 2019. Transition to turbulence in particle laden flows. Physical Review Letters. 122(11), 114502. mla: Agrawal, Nishchal, et al. “Transition to Turbulence in Particle Laden Flows.” Physical Review Letters, vol. 122, no. 11, 114502, American Physical Society, 2019, doi:10.1103/PhysRevLett.122.114502. short: N. Agrawal, G.H. Choueiri, B. Hof, Physical Review Letters 122 (2019). date_created: 2019-03-31T21:59:12Z date_published: 2019-03-22T00:00:00Z date_updated: 2024-03-27T23:30:47Z day: '22' department: - _id: BjHo doi: 10.1103/PhysRevLett.122.114502 external_id: arxiv: - '1809.06358' isi: - '000461922000006' intvolume: ' 122' isi: 1 issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.06358 month: '03' oa: 1 oa_version: Preprint publication: Physical Review Letters publication_identifier: eissn: - '10797114' issn: - '00319007' publication_status: published publisher: American Physical Society quality_controlled: '1' related_material: record: - id: '9728' relation: dissertation_contains status: public scopus_import: '1' status: public title: Transition to turbulence in particle laden flows type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 122 year: '2019' ... --- _id: '6371' abstract: - lang: eng text: "Decades of studies have revealed the mechanisms of gene regulation in molecular detail. We make use of such well-described regulatory systems to explore how the molecular mechanisms of protein-protein and protein-DNA interactions shape the dynamics and evolution of gene regulation. \r\n\r\ni) We uncover how the biophysics of protein-DNA binding determines the potential of regulatory networks to evolve and adapt, which can be captured using a simple mathematical model. \r\nii) The evolution of regulatory connections can lead to a significant amount of crosstalk between binding proteins. We explore the effect of crosstalk on gene expression from a target promoter, which seems to be modulated through binding competition at non-specific DNA sites. \r\niii) We investigate how the very same biophysical characteristics as in i) can generate significant fitness costs for cells through global crosstalk, meaning non-specific DNA binding across the genomic background. \r\niv) Binding competition between proteins at a target promoter is a prevailing regulatory feature due to the prevalence of co-regulation at bacterial promoters. However, the dynamics of these systems are not always straightforward to determine even if the molecular mechanisms of regulation are known. A detailed model of the biophysical interactions reveals that interference between the regulatory proteins can constitute a new, generic form of system memory that records the history of the input signals at the promoter. \r\n\r\nWe demonstrate how the biophysics of protein-DNA binding can be harnessed to investigate the principles that shape and ultimately limit cellular gene regulation. These results provide a basis for studies of higher-level functionality, which arises from the underlying regulation. \ \r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Claudia full_name: Igler, Claudia id: 46613666-F248-11E8-B48F-1D18A9856A87 last_name: Igler citation: ama: Igler C. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. 2019. doi:10.15479/AT:ISTA:6371 apa: Igler, C. (2019). On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6371 chicago: Igler, Claudia. “On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6371. ieee: C. Igler, “On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation,” Institute of Science and Technology Austria, 2019. ista: Igler C. 2019. On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation. Institute of Science and Technology Austria. mla: Igler, Claudia. On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6371. short: C. Igler, On the Nature of Gene Regulatory Design - The Biophysics of Transcription Factor Binding Shapes Gene Regulation, Institute of Science and Technology Austria, 2019. date_created: 2019-05-03T11:55:51Z date_published: 2019-05-03T00:00:00Z date_updated: 2024-02-21T13:45:52Z day: '03' ddc: - '576' - '579' degree_awarded: PhD department: - _id: CaGu doi: 10.15479/AT:ISTA:6371 file: - access_level: open_access checksum: c0085d47c58c9cbcab1b0a783480f6da content_type: application/pdf creator: cigler date_created: 2019-05-03T11:54:52Z date_updated: 2021-02-11T11:17:13Z embargo: 2020-05-02 file_id: '6373' file_name: IglerClaudia_OntheNatureofGeneRegulatoryDesign.pdf file_size: 12597663 relation: main_file - access_level: closed checksum: 2eac954de1c8bbf7e6fb35ed0221ae8c content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: cigler date_created: 2019-05-03T11:54:54Z date_updated: 2020-07-14T12:47:28Z embargo_to: open_access file_id: '6374' file_name: IglerClaudia_OntheNatureofGeneRegulatoryDesign.docx file_size: 34644426 relation: source_file file_date_updated: 2021-02-11T11:17:13Z has_accepted_license: '1' keyword: - gene regulation - biophysics - transcription factor binding - bacteria language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: '152' project: - _id: 251EE76E-B435-11E9-9278-68D0E5697425 grant_number: '24573' name: Design principles underlying genetic switch architecture (DOC Fellowship) publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '67' relation: part_of_dissertation status: public - id: '5585' relation: popular_science 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: On the nature of gene regulatory design - The biophysics of transcription factor binding shapes gene regulation type: dissertation user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 year: '2019' ... --- _id: '10286' abstract: - lang: eng text: 'In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied.' article_processing_charge: No article_type: original author: - first_name: Elie Noumon full_name: Allini, Elie Noumon last_name: Allini - first_name: Maciej full_name: Skórski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skórski - first_name: Oto full_name: Petura, Oto last_name: Petura - first_name: Florent full_name: Bernard, Florent last_name: Bernard - first_name: Marek full_name: Laban, Marek last_name: Laban - first_name: Viktor full_name: Fischer, Viktor last_name: Fischer citation: ama: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018;2018(3):214-242. doi:10.13154/tches.v2018.i3.214-242 apa: Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., & Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research. https://doi.org/10.13154/tches.v2018.i3.214-242 chicago: Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research, 2018. https://doi.org/10.13154/tches.v2018.i3.214-242. ieee: E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018. ista: Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242. mla: Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242. short: E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242. date_created: 2021-11-14T23:01:25Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-11-15T10:48:49Z day: '01' ddc: - '000' department: - _id: KrPi doi: 10.13154/tches.v2018.i3.214-242 file: - access_level: open_access checksum: b816b848f046c48a8357700d9305dce5 content_type: application/pdf creator: cchlebak date_created: 2021-11-15T10:27:29Z date_updated: 2021-11-15T10:27:29Z file_id: '10289' file_name: 2018_IACR_Allini.pdf file_size: 955755 relation: main_file success: 1 file_date_updated: 2021-11-15T10:27:29Z has_accepted_license: '1' intvolume: ' 2018' issue: '3' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 214-242 publication: IACR Transactions on Cryptographic Hardware and Embedded Systems publication_identifier: eissn: - 2569-2925 publication_status: published publisher: International Association for Cryptologic Research quality_controlled: '1' scopus_import: '1' status: public title: Evaluation and monitoring of free running oscillators serving as source of randomness 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: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 2018 year: '2018' ... --- _id: '10883' abstract: - lang: eng text: 'Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.' acknowledgement: 'A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.' alternative_title: - EPiC Series in Computing 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: Dvořák, Wolfgang last_name: Dvořá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, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Vol 57. EasyChair; 2018:233-253. doi:10.29007/5z5k' apa: 'Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. https://doi.org/10.29007/5z5k' chicago: Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k. ieee: K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253. ista: 'Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.' mla: Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol. 57, EasyChair, 2018, pp. 233–53, doi:10.29007/5z5k. short: K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253. conference: end_date: 2018-11-21 location: Awassa, Ethiopia name: 'LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning' start_date: 2018-11-17 date_created: 2022-03-18T12:46:32Z date_published: 2018-10-23T00:00:00Z date_updated: 2022-07-29T09:24:31Z day: '23' ddc: - '000' department: - _id: KrCh doi: 10.29007/5z5k ec_funded: 1 external_id: arxiv: - '1909.04983' file: - access_level: open_access checksum: 1229aa8640bd6db610c85decf2265480 content_type: application/pdf creator: dernst date_created: 2022-05-17T07:51:08Z date_updated: 2022-05-17T07:51:08Z file_id: '11392' file_name: 2018_EPiCs_Chatterjee.pdf file_size: 720893 relation: main_file success: 1 file_date_updated: 2022-05-17T07:51:08Z has_accepted_license: '1' intvolume: ' 57' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 233-253 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: 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning publication_identifier: issn: - 2398-7340 publication_status: published publisher: EasyChair quality_controlled: '1' scopus_import: '1' status: public title: Quasipolynomial set-based symbolic algorithms for parity games type: conference user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 57 year: '2018' ... --- _id: '11' abstract: - lang: eng text: We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm. author: - first_name: Nikolai K full_name: Leopold, Nikolai K id: 4BC40BEC-F248-11E8-B48F-1D18A9856A87 last_name: Leopold orcid: 0000-0002-0495-6822 - first_name: Peter full_name: Pickl, Peter last_name: Pickl citation: ama: 'Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:10.1007/978-3-030-01602-9_9' apa: 'Leopold, N. K., & Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. https://doi.org/10.1007/978-3-030-01602-9_9' chicago: Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. https://doi.org/10.1007/978-3-030-01602-9_9. ieee: 'N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.' ista: 'Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214.' mla: Leopold, Nikolai K., and Peter Pickl. Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields. Vol. 270, Springer, 2018, pp. 185–214, doi:10.1007/978-3-030-01602-9_9. short: N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214. conference: end_date: 2017-04-01 location: Munich, Germany name: 'MaLiQS: Macroscopic Limits of Quantum Systems' start_date: 2017-03-30 date_created: 2018-12-11T11:44:08Z date_published: 2018-10-27T00:00:00Z date_updated: 2021-01-12T06:48:16Z day: '27' department: - _id: RoSe doi: 10.1007/978-3-030-01602-9_9 ec_funded: 1 external_id: arxiv: - '1806.10843' intvolume: ' 270' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1806.10843 month: '10' oa: 1 oa_version: Preprint page: 185 - 214 project: - _id: 25C6DC12-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '694227' name: Analysis of quantum many-body systems publication_status: published publisher: Springer publist_id: '8045' quality_controlled: '1' scopus_import: 1 status: public title: Mean-field limits of particles in interaction with quantised radiation fields type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 270 year: '2018' ... --- _id: '1215' abstract: - lang: eng text: "Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus." acknowledgement: Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA. article_processing_charge: Yes (via OA deal) author: - first_name: Franco full_name: Flandoli, Franco last_name: Flandoli - first_name: Francesco full_name: Russo, Francesco last_name: Russo - first_name: Giovanni A full_name: Zanco, Giovanni A id: 47491882-F248-11E8-B48F-1D18A9856A87 last_name: Zanco citation: ama: Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 2018;31(2):789-826. doi:10.1007/s10959-016-0724-2 apa: Flandoli, F., Russo, F., & Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer. https://doi.org/10.1007/s10959-016-0724-2 chicago: Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability. Springer, 2018. https://doi.org/10.1007/s10959-016-0724-2. ieee: F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” Journal of Theoretical Probability, vol. 31, no. 2. Springer, pp. 789–826, 2018. ista: Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826. mla: Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” Journal of Theoretical Probability, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:10.1007/s10959-016-0724-2. short: F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826. date_created: 2018-12-11T11:50:45Z date_published: 2018-06-01T00:00:00Z date_updated: 2021-01-12T06:49:09Z day: '01' ddc: - '519' department: - _id: JaMa doi: 10.1007/s10959-016-0724-2 file: - access_level: open_access checksum: 47686d58ec21c164540f1a980ff2163f content_type: application/pdf creator: system date_created: 2018-12-12T10:17:13Z date_updated: 2020-07-14T12:44:39Z file_id: '5266' file_name: IST-2016-712-v1+1_s10959-016-0724-2.pdf file_size: 671125 relation: main_file file_date_updated: 2020-07-14T12:44:39Z has_accepted_license: '1' intvolume: ' 31' issue: '2' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 789-826 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Journal of Theoretical Probability publication_status: published publisher: Springer publist_id: '6119' pubrep_id: '712' quality_controlled: '1' scopus_import: 1 status: public title: Infinite-dimensional calculus under weak spatial regularity of the processes 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: 31 year: '2018' ... --- _id: '185' abstract: - lang: eng text: We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once. alternative_title: - Leibniz International Proceedings in Information, LIPIcs article_number: '39' 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: Kynčl, Jan last_name: Kynčl citation: ama: 'Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39' apa: 'Fulek, R., & Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.39' chicago: Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39. ieee: 'R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.' ista: 'Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.' mla: Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39. short: R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-06-14 location: Budapest, Hungary name: 'SoCG: Symposium on Computational Geometry' start_date: 2018-06-11 date_created: 2018-12-11T11:45:04Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T06:53:36Z day: '01' ddc: - '510' department: - _id: UlWa doi: 10.4230/LIPIcs.SoCG.2018.39 file: - access_level: open_access checksum: f1b94f1a75b37c414a1f61d59fb2cd4c content_type: application/pdf creator: dernst date_created: 2018-12-17T12:33:52Z date_updated: 2020-07-14T12:45:19Z file_id: '5701' file_name: 2018_LIPIcs_Fulek.pdf file_size: 718857 relation: main_file file_date_updated: 2020-07-14T12:45:19Z has_accepted_license: '1' intvolume: ' 99' language: - iso: eng month: '01' 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_identifier: isbn: - 978-3-95977-066-8 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7735' quality_controlled: '1' scopus_import: 1 status: public title: Hanani-Tutte for approximating maps of 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: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 99 year: '2018' ... --- _id: '188' abstract: - lang: eng text: Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex. acknowledgement: This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund alternative_title: - Leibniz International Proceedings in Information, 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. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:10.4230/LIPIcs.SoCG.2018.35' apa: 'Edelsbrunner, H., Virk, Z., & Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2018.35' chicago: Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.35. ieee: 'H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.' ista: 'Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13.' mla: Edelsbrunner, Herbert, et al. Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:10.4230/LIPIcs.SoCG.2018.35. short: H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13. conference: end_date: 2018-06-14 location: Budapest, Hungary name: 'SoCG: Symposium on Computational Geometry' start_date: 2018-06-11 date_created: 2018-12-11T11:45:05Z date_published: 2018-06-11T00:00:00Z date_updated: 2021-01-12T06:53:48Z day: '11' ddc: - '000' department: - _id: HeEd doi: 10.4230/LIPIcs.SoCG.2018.35 file: - access_level: open_access checksum: 7509403803b3ac1aee94bbc2ad293d21 content_type: application/pdf creator: dernst date_created: 2018-12-17T16:31:31Z date_updated: 2020-07-14T12:45:20Z file_id: '5724' file_name: 2018_LIPIcs_Edelsbrunner.pdf file_size: 489080 relation: main_file file_date_updated: 2020-07-14T12:45:20Z has_accepted_license: '1' intvolume: ' 99' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 35:1 - 35:13 project: - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '7733' quality_controlled: '1' scopus_import: 1 status: public title: Smallest enclosing spheres and Chernoff points in Bregman geometry 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: 99 year: '2018' ... --- _id: '306' abstract: - lang: eng text: A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data. article_number: e00596 author: - first_name: Andrea full_name: De Martino, Andrea last_name: De Martino - first_name: Daniele full_name: De Martino, Daniele id: 3FF5848A-F248-11E8-B48F-1D18A9856A87 last_name: De Martino orcid: 0000-0002-5214-4706 citation: ama: De Martino A, De Martino D. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 2018;4(4). doi:10.1016/j.heliyon.2018.e00596 apa: De Martino, A., & De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier. https://doi.org/10.1016/j.heliyon.2018.e00596 chicago: De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon. Elsevier, 2018. https://doi.org/10.1016/j.heliyon.2018.e00596. ieee: A. De Martino and D. De Martino, “An introduction to the maximum entropy approach and its application to inference problems in biology,” Heliyon, vol. 4, no. 4. Elsevier, 2018. ista: De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 4(4), e00596. mla: De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” Heliyon, vol. 4, no. 4, e00596, Elsevier, 2018, doi:10.1016/j.heliyon.2018.e00596. short: A. De Martino, D. De Martino, Heliyon 4 (2018). date_created: 2018-12-11T11:45:44Z date_published: 2018-04-01T00:00:00Z date_updated: 2021-01-12T07:40:46Z day: '01' ddc: - '530' department: - _id: GaTk doi: 10.1016/j.heliyon.2018.e00596 ec_funded: 1 file: - access_level: open_access checksum: 67010cf5e3b3e0637c659371714a715a content_type: application/pdf creator: dernst date_created: 2019-02-06T07:36:24Z date_updated: 2020-07-14T12:45:59Z file_id: '5929' file_name: 2018_Heliyon_DeMartino.pdf file_size: 994490 relation: main_file file_date_updated: 2020-07-14T12:45:59Z has_accepted_license: '1' intvolume: ' 4' issue: '4' language: - iso: eng month: '04' oa: 1 oa_version: Published Version project: - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication: Heliyon publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: 1 status: public title: An introduction to the maximum entropy approach and its application to inference problems in biology 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: 4 year: '2018' ...