--- _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-28T23:30:40Z 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: '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-28T23:30:42Z 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-28T23:30:44Z 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-28T23:30:47Z 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-28T23:30:48Z 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: '10359' abstract: - lang: eng text: Biological membranes typically contain a large number of different components dispersed in small concentrations in the main membrane phase, including proteins, sugars, and lipids of varying geometrical properties. Most of these components do not bind the cargo. Here, we show that such “inert” components can be crucial for the precise control of cross-membrane trafficking. Using a statistical mechanics model and molecular dynamics simulations, we demonstrate that the presence of inert membrane components of small isotropic curvatures dramatically influences cargo endocytosis, even if the total spontaneous curvature of such a membrane remains unchanged. Curved lipids, such as cholesterol, as well as asymmetrically included proteins and tethered sugars can, therefore, actively participate in the control of the membrane trafficking of nanoscopic cargo. We find that even a low-level expression of curved inert membrane components can determine the membrane selectivity toward the cargo size and can be used to selectively target membranes of certain compositions. Our results suggest a robust and general method of controlling cargo trafficking by adjusting the membrane composition without needing to alter the concentration of receptors or the average membrane curvature. This study indicates that cells can prepare for any trafficking event by incorporating curved inert components in either of the membrane leaflets. acknowledgement: We acknowledge discussions with Giuseppe Battaglia as well as support from the Herchel Smith scholarship (T.C.), the CAS PIFI fellowship (T.C.), the UCL Institute for the Physics of Living Systems (T.C. and A.Š.), the Austrian Academy of Sciences through a DOC fellowship (P.W.), the European Union Horizon 2020 programme under ETN grant no. 674979-NANOTRANS and FET grant no. 766972-NANOPHLOW (J.D. and D.F.), the Engineering and Physical Sciences Research Council (D.F. and A.Š.), the Academy of Medical Sciences and Wellcome Trust (A.Š.), and the Royal Society (A.Š.). We thank Claudia Flandoli for help with Figure 1. article_processing_charge: No article_type: original author: - first_name: Tine full_name: Curk, Tine last_name: Curk - first_name: Peter full_name: Wirnsberger, Peter last_name: Wirnsberger - first_name: Jure full_name: Dobnikar, Jure last_name: Dobnikar - first_name: Daan full_name: Frenkel, Daan last_name: Frenkel - first_name: Anđela full_name: Šarić, Anđela id: bf63d406-f056-11eb-b41d-f263a6566d8b last_name: Šarić orcid: 0000-0002-7854-2139 citation: ama: Curk T, Wirnsberger P, Dobnikar J, Frenkel D, Šarić A. Controlling cargo trafficking in multicomponent membranes. Nano Letters. 2018;18(9):5350-5356. doi:10.1021/acs.nanolett.8b00786 apa: Curk, T., Wirnsberger, P., Dobnikar, J., Frenkel, D., & Šarić, A. (2018). Controlling cargo trafficking in multicomponent membranes. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b00786 chicago: Curk, Tine, Peter Wirnsberger, Jure Dobnikar, Daan Frenkel, and Anđela Šarić. “Controlling Cargo Trafficking in Multicomponent Membranes.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b00786. ieee: T. Curk, P. Wirnsberger, J. Dobnikar, D. Frenkel, and A. Šarić, “Controlling cargo trafficking in multicomponent membranes,” Nano Letters, vol. 18, no. 9. American Chemical Society, pp. 5350–5356, 2018. ista: Curk T, Wirnsberger P, Dobnikar J, Frenkel D, Šarić A. 2018. Controlling cargo trafficking in multicomponent membranes. Nano Letters. 18(9), 5350–5356. mla: Curk, Tine, et al. “Controlling Cargo Trafficking in Multicomponent Membranes.” Nano Letters, vol. 18, no. 9, American Chemical Society, 2018, pp. 5350–56, doi:10.1021/acs.nanolett.8b00786. short: T. Curk, P. Wirnsberger, J. Dobnikar, D. Frenkel, A. Šarić, Nano Letters 18 (2018) 5350–5356. date_created: 2021-11-26T12:15:47Z date_published: 2018-04-18T00:00:00Z date_updated: 2021-11-26T15:14:08Z day: '18' doi: 10.1021/acs.nanolett.8b00786 extern: '1' external_id: pmid: - '29667410' intvolume: ' 18' issue: '9' keyword: - mechanical engineering - condensed matter physics language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.10147 month: '04' oa: 1 oa_version: Preprint page: 5350-5356 pmid: 1 publication: Nano Letters publication_identifier: eissn: - 1530-6992 issn: - 1530-6984 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: Controlling cargo trafficking in multicomponent membranes type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 18 year: '2018' ... --- _id: '10358' abstract: - lang: eng text: Probing reaction mechanisms of supramolecular processes in soft and biological matter, such as protein aggregation, is inherently challenging. This is because these processes involve multiple molecular mechanisms that are associated with the rearrangement of large numbers of weak bonds, resulting in complex free energy landscapes with many kinetic barriers. Reaction rate measurements at different temperatures can offer unprecedented insights into the underlying molecular mechanisms. However, to be able to interpret such measurements, a key challenge is to establish which properties of the complex free energy landscapes are probed by the reaction rate. Here, we present a reaction rate theory for supramolecular kinetics based on Kramers theory of diffusive reactions over multiple kinetic barriers. We find that reaction rates for protein aggregation are of the Arrhenius–Eyring type and that the associated activation energies probe only one relevant barrier along the respective free energy landscapes. We apply this advancement to interpret, in experiments and in coarse-grained computer simulations, reaction rates of amyloid aggregation in terms of molecular mechanisms and associated thermodynamic signatures. These results suggest a practical extension of the concept of rate-determining steps for complex supramolecular processes and establish a general platform for probing the underlying energy landscape using kinetic measurements. acknowledgement: We thank Claudia Flandoli for the help with illustrations. article_processing_charge: No article_type: original author: - first_name: Thomas C. T. full_name: Michaels, Thomas C. T. last_name: Michaels - first_name: Lucie X. full_name: Liu, Lucie X. last_name: Liu - first_name: Samo full_name: Curk, Samo last_name: Curk - first_name: Peter G. full_name: Bolhuis, Peter G. last_name: Bolhuis - first_name: Anđela full_name: Šarić, Anđela id: bf63d406-f056-11eb-b41d-f263a6566d8b last_name: Šarić orcid: 0000-0002-7854-2139 - first_name: Tuomas P. J. full_name: Knowles, Tuomas P. J. last_name: Knowles citation: ama: 'Michaels TCT, Liu LX, Curk S, Bolhuis PG, Šarić A, Knowles TPJ. Reaction rate theory for supramolecular kinetics: application to protein aggregation. Molecular Physics. 2018;116(21-22):3055-3065. doi:10.1080/00268976.2018.1474280' apa: 'Michaels, T. C. T., Liu, L. X., Curk, S., Bolhuis, P. G., Šarić, A., & Knowles, T. P. J. (2018). Reaction rate theory for supramolecular kinetics: application to protein aggregation. Molecular Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2018.1474280' chicago: 'Michaels, Thomas C. T., Lucie X. Liu, Samo Curk, Peter G. Bolhuis, Anđela Šarić, and Tuomas P. J. Knowles. “Reaction Rate Theory for Supramolecular Kinetics: Application to Protein Aggregation.” Molecular Physics. Taylor & Francis, 2018. https://doi.org/10.1080/00268976.2018.1474280.' ieee: 'T. C. T. Michaels, L. X. Liu, S. Curk, P. G. Bolhuis, A. Šarić, and T. P. J. Knowles, “Reaction rate theory for supramolecular kinetics: application to protein aggregation,” Molecular Physics, vol. 116, no. 21–22. Taylor & Francis, pp. 3055–3065, 2018.' ista: 'Michaels TCT, Liu LX, Curk S, Bolhuis PG, Šarić A, Knowles TPJ. 2018. Reaction rate theory for supramolecular kinetics: application to protein aggregation. Molecular Physics. 116(21–22), 3055–3065.' mla: 'Michaels, Thomas C. T., et al. “Reaction Rate Theory for Supramolecular Kinetics: Application to Protein Aggregation.” Molecular Physics, vol. 116, no. 21–22, Taylor & Francis, 2018, pp. 3055–65, doi:10.1080/00268976.2018.1474280.' short: T.C.T. Michaels, L.X. Liu, S. Curk, P.G. Bolhuis, A. Šarić, T.P.J. Knowles, Molecular Physics 116 (2018) 3055–3065. date_created: 2021-11-26T12:08:02Z date_published: 2018-05-24T00:00:00Z date_updated: 2021-11-26T12:39:58Z day: '24' doi: 10.1080/00268976.2018.1474280 extern: '1' external_id: arxiv: - '1803.04851' intvolume: ' 116' issue: 21-22 keyword: - physical chemistry language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1803.04851 month: '05' oa: 1 oa_version: Preprint page: 3055-3065 publication: Molecular Physics publication_identifier: eissn: - 1362-3028 issn: - 0026-8976 publication_status: published publisher: Taylor & Francis quality_controlled: '1' scopus_import: '1' status: public title: 'Reaction rate theory for supramolecular kinetics: application to protein aggregation' type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 116 year: '2018' ... --- _id: '10626' abstract: - lang: eng text: "Owing to their wide tunability, multiple internal degrees of freedom, and low disorder, graphene heterostructures are emerging as a promising experimental platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal activation gap measurements in dual graphite-gated monolayer graphene devices fabricated in an edgeless Corbino geometry. In devices with substrate-induced sublattice splitting, we find a tunable crossover between single- and multicomponent FQH states in the zero energy Landau level. Activation gaps in the single-component regime show excellent agreement with numerical calculations using a single broadening parameter \r\nΓ≈7.2K. In the first excited Landau level, in contrast, FQH gaps are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered state at integer filling ν=−4." acknowledgement: We thank Cory Dean, S. Chen, Y. Zeng, M. Yankowitz, and J. Li for discussing their unpublished data and for sharing the stack inversion technique. The authors acknowledge further discussions of the results with I. Sodemann, M. Zaletel, C. Nayak, and J. Jain. A. F. Y., H. P., H. Z., and E. M. S. were supported by the ARO under awards 69188PHH and MURI W911NF-17-1-0323. A portion of this work was performed at the National High Magnetic Field Laboratory, which is supported by National Science Foundation Cooperative Agreement No. DMR-1644779 and the State of Florida. K. W. and T. T. acknowledge support from the Elemental Strategy Initiative conducted by the MEXT, Japan, and JSPS KAKENHI Grant No. JP15K21722. E. M. S. acknowledges the support of the Elings Prize Fellowship in Science of the California Nanosystems Institute at the University of California, Santa Barbara. A. F. Y. acknowledges the support of the David and Lucile Packard Foundation. article_number: '226801' article_processing_charge: No article_type: original author: - first_name: Hryhoriy full_name: Polshyn, Hryhoriy id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48 last_name: Polshyn orcid: 0000-0001-8223-8896 - first_name: H. full_name: Zhou, H. last_name: Zhou - first_name: E. M. full_name: Spanton, E. M. last_name: Spanton - first_name: T. full_name: Taniguchi, T. last_name: Taniguchi - first_name: K. full_name: Watanabe, K. last_name: Watanabe - first_name: A. F. full_name: Young, A. F. last_name: Young citation: ama: Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. Physical Review Letters. 2018;121(22). doi:10.1103/physrevlett.121.226801 apa: Polshyn, H., Zhou, H., Spanton, E. M., Taniguchi, T., Watanabe, K., & Young, A. F. (2018). Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.121.226801 chicago: Polshyn, Hryhoriy, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young. “Quantitative Transport Measurements of Fractional Quantum Hall Energy Gaps in Edgeless Graphene Devices.” Physical Review Letters. American Physical Society, 2018. https://doi.org/10.1103/physrevlett.121.226801. ieee: H. Polshyn, H. Zhou, E. M. Spanton, T. Taniguchi, K. Watanabe, and A. F. Young, “Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices,” Physical Review Letters, vol. 121, no. 22. American Physical Society, 2018. ista: Polshyn H, Zhou H, Spanton EM, Taniguchi T, Watanabe K, Young AF. 2018. Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices. Physical Review Letters. 121(22), 226801. mla: Polshyn, Hryhoriy, et al. “Quantitative Transport Measurements of Fractional Quantum Hall Energy Gaps in Edgeless Graphene Devices.” Physical Review Letters, vol. 121, no. 22, 226801, American Physical Society, 2018, doi:10.1103/physrevlett.121.226801. short: H. Polshyn, H. Zhou, E.M. Spanton, T. Taniguchi, K. Watanabe, A.F. Young, Physical Review Letters 121 (2018). date_created: 2022-01-14T12:15:47Z date_published: 2018-11-28T00:00:00Z date_updated: 2022-01-14T13:48:35Z day: '28' doi: 10.1103/physrevlett.121.226801 extern: '1' external_id: arxiv: - '1805.04199' intvolume: ' 121' issue: '22' keyword: - general physics and astronomy language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1805.04199 month: '11' oa: 1 oa_version: Preprint publication: Physical Review Letters publication_identifier: eissn: - 1079-7114 issn: - 0031-9007 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 121 year: '2018' ... --- _id: '10627' abstract: - lang: eng text: We present a scanning probe technique for measuring the dynamics of individual fluxoid transitions in multiply connected superconducting structures. In these measurements, a small magnetic particle attached to the tip of a silicon cantilever is scanned over a micron-size superconducting ring fabricated from a thin aluminum film. We find that near the superconducting transition temperature of the aluminum, the dissipation and frequency of the cantilever changes significantly at particular locations where the tip-induced magnetic flux penetrating the ring causes the two lowest-energy fluxoid states to become nearly degenerate. In this regime, we show that changes in the cantilever frequency and dissipation are well-described by a stochastic resonance (SR) process, wherein small oscillations of the cantilever in the presence of thermally activated phase slips (TAPS) in the ring give rise to a dynamical force that modifies the mechanical properties of the cantilever. Using the SR model, we calculate the average fluctuation rate of the TAPS as a function of temperature over a 32-dB range in frequency, and we compare it to the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting structures. acknowledgement: "We are grateful to Nadya Mason for useful discussions. This work was supported by the DOE Basic Energy Sciences under Contract No. DE-SC0012649, the Department of Physics and the Frederick Seitz Materials Research Laboratory Central Facilities at the University of Illinois.\r\n" article_number: '184501' article_processing_charge: No article_type: original author: - first_name: Hryhoriy full_name: Polshyn, Hryhoriy id: edfc7cb1-526e-11ec-b05a-e6ecc27e4e48 last_name: Polshyn orcid: 0000-0001-8223-8896 - first_name: Tyler R. full_name: Naibert, Tyler R. last_name: Naibert - first_name: Raffi full_name: Budakian, Raffi last_name: Budakian citation: ama: Polshyn H, Naibert TR, Budakian R. Imaging phase slip dynamics in micron-size superconducting rings. Physical Review B. 2018;97(18). doi:10.1103/physrevb.97.184501 apa: Polshyn, H., Naibert, T. R., & Budakian, R. (2018). Imaging phase slip dynamics in micron-size superconducting rings. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.97.184501 chicago: Polshyn, Hryhoriy, Tyler R. Naibert, and Raffi Budakian. “Imaging Phase Slip Dynamics in Micron-Size Superconducting Rings.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.97.184501. ieee: H. Polshyn, T. R. Naibert, and R. Budakian, “Imaging phase slip dynamics in micron-size superconducting rings,” Physical Review B, vol. 97, no. 18. American Physical Society, 2018. ista: Polshyn H, Naibert TR, Budakian R. 2018. Imaging phase slip dynamics in micron-size superconducting rings. Physical Review B. 97(18), 184501. mla: Polshyn, Hryhoriy, et al. “Imaging Phase Slip Dynamics in Micron-Size Superconducting Rings.” Physical Review B, vol. 97, no. 18, 184501, American Physical Society, 2018, doi:10.1103/physrevb.97.184501. short: H. Polshyn, T.R. Naibert, R. Budakian, Physical Review B 97 (2018). date_created: 2022-01-14T13:48:47Z date_published: 2018-05-08T00:00:00Z date_updated: 2022-01-14T13:58:24Z day: '08' doi: 10.1103/physrevb.97.184501 extern: '1' external_id: arxiv: - '1703.08184' intvolume: ' 97' issue: '18' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1703.08184 month: '05' oa: 1 oa_version: Preprint publication: Physical Review B publication_identifier: eissn: - 2469-9969 issn: - 2469-9950 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: Imaging phase slip dynamics in micron-size superconducting rings type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 97 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: '1092' abstract: - lang: eng text: 'A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be constructed as a Minkowski sum of standard simplices. We show that there is an analogous polytope for conditional independence relations coming from a regular Gaussian model, and it can be defined using multiinformation or relative entropy. For directed acyclic graphical models we give a construction of this polytope as a Minkowski sum of matroid polytopes. Finally, we apply this geometric insight to construct a new ordering-based search algorithm for causal inference via directed acyclic graphical models. ' author: - first_name: Fatemeh full_name: Mohammadi, Fatemeh id: 2C29581E-F248-11E8-B48F-1D18A9856A87 last_name: Mohammadi - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 - first_name: Charles full_name: Wang, Charles last_name: Wang - first_name: Josephine full_name: Yu, Josephine last_name: Yu citation: ama: Mohammadi F, Uhler C, Wang C, Yu J. Generalized permutohedra from probabilistic graphical models. SIAM Journal on Discrete Mathematics. 2018;32(1):64-93. doi:10.1137/16M107894X apa: Mohammadi, F., Uhler, C., Wang, C., & Yu, J. (2018). Generalized permutohedra from probabilistic graphical models. SIAM Journal on Discrete Mathematics. SIAM. https://doi.org/10.1137/16M107894X chicago: Mohammadi, Fatemeh, Caroline Uhler, Charles Wang, and Josephine Yu. “Generalized Permutohedra from Probabilistic Graphical Models.” SIAM Journal on Discrete Mathematics. SIAM, 2018. https://doi.org/10.1137/16M107894X. ieee: F. Mohammadi, C. Uhler, C. Wang, and J. Yu, “Generalized permutohedra from probabilistic graphical models,” SIAM Journal on Discrete Mathematics, vol. 32, no. 1. SIAM, pp. 64–93, 2018. ista: Mohammadi F, Uhler C, Wang C, Yu J. 2018. Generalized permutohedra from probabilistic graphical models. SIAM Journal on Discrete Mathematics. 32(1), 64–93. mla: Mohammadi, Fatemeh, et al. “Generalized Permutohedra from Probabilistic Graphical Models.” SIAM Journal on Discrete Mathematics, vol. 32, no. 1, SIAM, 2018, pp. 64–93, doi:10.1137/16M107894X. short: F. Mohammadi, C. Uhler, C. Wang, J. Yu, SIAM Journal on Discrete Mathematics 32 (2018) 64–93. date_created: 2018-12-11T11:50:06Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T06:48:13Z day: '01' doi: 10.1137/16M107894X extern: '1' intvolume: ' 32' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1606.01814 month: '01' oa: 1 oa_version: Preprint page: 64-93 publication: SIAM Journal on Discrete Mathematics publication_status: published publisher: SIAM publist_id: '6284' quality_controlled: '1' status: public title: Generalized permutohedra from probabilistic graphical models type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 32 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: '11063' abstract: - lang: eng text: The total number of nuclear pore complexes (NPCs) per nucleus varies greatly between different cell types and is known to change during cell differentiation and cell transformation. However, the underlying mechanisms that control how many nuclear transport channels are assembled into a given nuclear envelope remain unclear. Here, we report that depletion of the NPC basket protein Tpr, but not Nup153, dramatically increases the total NPC number in various cell types. This negative regulation of Tpr occurs via a phosphorylation cascade of extracellular signal-regulated kinase (ERK), the central kinase of the mitogen-activated protein kinase (MAPK) pathway. Tpr serves as a scaffold for ERK to phosphorylate the nucleoporin (Nup) Nup153, which is critical for early stages of NPC biogenesis. Our results reveal a critical role of the Nup Tpr in coordinating signal transduction pathways during cell proliferation and the dynamic organization of the nucleus. article_processing_charge: No article_type: original author: - first_name: Asako full_name: McCloskey, Asako last_name: McCloskey - first_name: Arkaitz full_name: Ibarra, Arkaitz last_name: Ibarra - first_name: Martin W full_name: HETZER, Martin W id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed last_name: HETZER orcid: 0000-0002-2111-992X citation: ama: McCloskey A, Ibarra A, Hetzer M. Tpr regulates the total number of nuclear pore complexes per cell nucleus. Genes & Development. 2018;32(19-20):1321-1331. doi:10.1101/gad.315523.118 apa: McCloskey, A., Ibarra, A., & Hetzer, M. (2018). Tpr regulates the total number of nuclear pore complexes per cell nucleus. Genes & Development. Cold Spring Harbor Laboratory. https://doi.org/10.1101/gad.315523.118 chicago: McCloskey, Asako, Arkaitz Ibarra, and Martin Hetzer. “Tpr Regulates the Total Number of Nuclear Pore Complexes per Cell Nucleus.” Genes & Development. Cold Spring Harbor Laboratory, 2018. https://doi.org/10.1101/gad.315523.118. ieee: A. McCloskey, A. Ibarra, and M. Hetzer, “Tpr regulates the total number of nuclear pore complexes per cell nucleus,” Genes & Development, vol. 32, no. 19–20. Cold Spring Harbor Laboratory, pp. 1321–1331, 2018. ista: McCloskey A, Ibarra A, Hetzer M. 2018. Tpr regulates the total number of nuclear pore complexes per cell nucleus. Genes & Development. 32(19–20), 1321–1331. mla: McCloskey, Asako, et al. “Tpr Regulates the Total Number of Nuclear Pore Complexes per Cell Nucleus.” Genes & Development, vol. 32, no. 19–20, Cold Spring Harbor Laboratory, 2018, pp. 1321–31, doi:10.1101/gad.315523.118. short: A. McCloskey, A. Ibarra, M. Hetzer, Genes & Development 32 (2018) 1321–1331. date_created: 2022-04-07T07:45:30Z date_published: 2018-09-18T00:00:00Z date_updated: 2022-07-18T08:32:32Z day: '18' doi: 10.1101/gad.315523.118 extern: '1' external_id: pmid: - '30228202' intvolume: ' 32' issue: 19-20 keyword: - Developmental Biology - Genetics language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/gad.315523.118 month: '09' oa: 1 oa_version: Published Version page: 1321-1331 pmid: 1 publication: Genes & Development publication_identifier: issn: - 0890-9369 - 1549-5477 publication_status: published publisher: Cold Spring Harbor Laboratory quality_controlled: '1' scopus_import: '1' status: public title: Tpr regulates the total number of nuclear pore complexes per cell nucleus type: journal_article user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 32 year: '2018' ... --- _id: '11064' abstract: - lang: eng text: Biomarkers of aging can be used to assess the health of individuals and to study aging and age-related diseases. We generate a large dataset of genome-wide RNA-seq profiles of human dermal fibroblasts from 133 people aged 1 to 94 years old to test whether signatures of aging are encoded within the transcriptome. We develop an ensemble machine learning method that predicts age to a median error of 4 years, outperforming previous methods used to predict age. The ensemble was further validated by testing it on ten progeria patients, and our method is the only one that predicts accelerated aging in these patients. article_number: '221' article_processing_charge: No article_type: original author: - first_name: Jason G. full_name: Fleischer, Jason G. last_name: Fleischer - first_name: Roberta full_name: Schulte, Roberta last_name: Schulte - first_name: Hsiao H. full_name: Tsai, Hsiao H. last_name: Tsai - first_name: Swati full_name: Tyagi, Swati last_name: Tyagi - first_name: Arkaitz full_name: Ibarra, Arkaitz last_name: Ibarra - first_name: Maxim N. full_name: Shokhirev, Maxim N. last_name: Shokhirev - first_name: Ling full_name: Huang, Ling last_name: Huang - first_name: Martin W full_name: HETZER, Martin W id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed last_name: HETZER orcid: 0000-0002-2111-992X - first_name: Saket full_name: Navlakha, Saket last_name: Navlakha citation: ama: Fleischer JG, Schulte R, Tsai HH, et al. Predicting age from the transcriptome of human dermal fibroblasts. Genome Biology. 2018;19. doi:10.1186/s13059-018-1599-6 apa: Fleischer, J. G., Schulte, R., Tsai, H. H., Tyagi, S., Ibarra, A., Shokhirev, M. N., … Navlakha, S. (2018). Predicting age from the transcriptome of human dermal fibroblasts. Genome Biology. BioMed Central. https://doi.org/10.1186/s13059-018-1599-6 chicago: Fleischer, Jason G., Roberta Schulte, Hsiao H. Tsai, Swati Tyagi, Arkaitz Ibarra, Maxim N. Shokhirev, Ling Huang, Martin Hetzer, and Saket Navlakha. “Predicting Age from the Transcriptome of Human Dermal Fibroblasts.” Genome Biology. BioMed Central, 2018. https://doi.org/10.1186/s13059-018-1599-6. ieee: J. G. Fleischer et al., “Predicting age from the transcriptome of human dermal fibroblasts,” Genome Biology, vol. 19. BioMed Central, 2018. ista: Fleischer JG, Schulte R, Tsai HH, Tyagi S, Ibarra A, Shokhirev MN, Huang L, Hetzer M, Navlakha S. 2018. Predicting age from the transcriptome of human dermal fibroblasts. Genome Biology. 19, 221. mla: Fleischer, Jason G., et al. “Predicting Age from the Transcriptome of Human Dermal Fibroblasts.” Genome Biology, vol. 19, 221, BioMed Central, 2018, doi:10.1186/s13059-018-1599-6. short: J.G. Fleischer, R. Schulte, H.H. Tsai, S. Tyagi, A. Ibarra, M.N. Shokhirev, L. Huang, M. Hetzer, S. Navlakha, Genome Biology 19 (2018). date_created: 2022-04-07T07:45:40Z date_published: 2018-12-20T00:00:00Z date_updated: 2022-07-18T08:32:34Z day: '20' doi: 10.1186/s13059-018-1599-6 extern: '1' external_id: pmid: - '30567591' intvolume: ' 19' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1186/s13059-018-1599-6 month: '12' oa: 1 oa_version: Published Version pmid: 1 publication: Genome Biology publication_identifier: issn: - 1474-760X publication_status: published publisher: BioMed Central quality_controlled: '1' scopus_import: '1' status: public title: Predicting age from the transcriptome of human dermal fibroblasts type: journal_article user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 19 year: '2018' ... --- _id: '11508' abstract: - lang: eng text: Distant luminous Lyman-α emitters (LAEs) are excellent targets for spectroscopic observations of galaxies in the epoch of reionisation (EoR). We present deep high-resolution (R = 5000) VLT/X-shooter observations, along with an extensive collection of photometric data of COLA1, a proposed double peaked LAE at z = 6.6. We rule out the possibility that COLA1’s emission line is an [OII] doublet at z = 1.475 on the basis of i) the asymmetric red line-profile and flux ratio of the peaks (blue/red=0.31 ± 0.03) and ii) an unphysical [OII]/Hα ratio ([OII]/Hα >  22). We show that COLA1’s observed B-band flux is explained by a faint extended foreground LAE, for which we detect Lyα and [OIII] at z = 2.142. We thus conclude that COLA1 is a real double-peaked LAE at z = 6.593, the first discovered at z >  6. COLA1 is UV luminous (M1500 = −21.6 ± 0.3), has a high equivalent width (EW0,Lyα = 120−40+50 Å) and very compact Lyα emission (r50,Lyα = 0.33−0.04+0.07 kpc). Relatively weak inferred Hβ+[OIII] line-emission from Spitzer/IRAC indicates an extremely low metallicity of Z <  1/20 Z⊙ or reduced strength of nebular lines due to high escape of ionising photons. The small Lyα peak separation of 220 ± 20 km s−1 implies a low HI column density and an ionising photon escape fraction of ≈15 − 30%, providing the first direct evidence that such galaxies contribute actively to the reionisation of the Universe at z >  6. Based on simple estimates, we find that COLA1 could have provided just enough photons to reionise its own ≈0.3 pMpc (2.3 cMpc) bubble, allowing the blue Lyα line to be observed. However, we also discuss alternative scenarios explaining the detected double peaked nature of COLA1. Our results show that future high-resolution observations of statistical samples of double peaked LAEs at z >  5 are a promising probe of the occurrence of ionised regions around galaxies in the EoR. acknowledgement: JM acknowledges the award of a Huygens PhD fellowship from Leiden University. MG acknowledges support from NASA grant NNX17AK58G. APA, PhD::SPACE fellow, acknowledges support from the FCT through the fellowship PD/BD/52706/2014. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 294.A-5018, 098.A-0819, 099.A-0254 and 0100.A-0213. We are grateful for the excellent data-sets from the COSMOS and UltraVISTA survey teams. This research was supported by the Munich Institute for Astro- and Particle Physics (MIAPP) of the DFG cluster of excellence “Origin and Structure of the Universe”. We thank the referee for their comments that improved the paper. We also thank Christoph Behrens, Len Cowie, Koki Kakiichi, Peter Laursen, Charlotte Mason, Eros Vanzella, Lewis Weinberger and Johannes Zabl for discussions. We have benefited from the public available programming language Python, including the numpy, matplotlib, scipy and astropy packages (Hunter 2007; Astropy Collaboration 2013), the astronomical imaging tools Swarp (Bertin 2010) and ds9 and the Topcat analysis tool (Taylor 2013). article_number: A136 article_processing_charge: No article_type: original author: - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: David full_name: Sobral, David last_name: Sobral - first_name: Max full_name: Gronke, Max last_name: Gronke - first_name: Ana full_name: Paulino-Afonso, Ana last_name: Paulino-Afonso - first_name: Mauro full_name: Stefanon, Mauro last_name: Stefanon - first_name: Huub full_name: Röttgering, Huub last_name: Röttgering citation: ama: 'Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. Astronomy & Astrophysics. 2018;619. doi:10.1051/0004-6361/201833528' apa: 'Matthee, J. J., Sobral, D., Gronke, M., Paulino-Afonso, A., Stefanon, M., & Röttgering, H. (2018). Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833528' chicago: 'Matthee, Jorryt J, David Sobral, Max Gronke, Ana Paulino-Afonso, Mauro Stefanon, and Huub Röttgering. “Confirmation of Double Peaked Lyα Emission at z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the Universe.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201833528.' ieee: 'J. J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, and H. Röttgering, “Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe,” Astronomy & Astrophysics, vol. 619. EDP Sciences, 2018.' ista: 'Matthee JJ, Sobral D, Gronke M, Paulino-Afonso A, Stefanon M, Röttgering H. 2018. Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe. Astronomy & Astrophysics. 619, A136.' mla: 'Matthee, Jorryt J., et al. “Confirmation of Double Peaked Lyα Emission at z = 6.593: Witnessing a Galaxy Directly Contributing to the Reionisation of the Universe.” Astronomy & Astrophysics, vol. 619, A136, EDP Sciences, 2018, doi:10.1051/0004-6361/201833528.' short: J.J. Matthee, D. Sobral, M. Gronke, A. Paulino-Afonso, M. Stefanon, H. Röttgering, Astronomy & Astrophysics 619 (2018). date_created: 2022-07-06T11:14:23Z date_published: 2018-11-19T00:00:00Z date_updated: 2022-07-19T09:32:08Z day: '19' doi: 10.1051/0004-6361/201833528 extern: '1' external_id: arxiv: - '1805.11621' intvolume: ' 619' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: high-redshift / galaxies: formation / dark ages / reionization / first stars / techniques: spectroscopic / intergalactic medium' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1805.11621 month: '11' oa: 1 oa_version: Published Version publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'Confirmation of double peaked Lyα emission at z = 6.593: Witnessing a galaxy directly contributing to the reionisation of the universe' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 619 year: '2018' ... --- _id: '11557' abstract: - lang: eng text: Deep narrow-band surveys have revealed a large population of faint Ly α emitters (LAEs) in the distant Universe, but relatively little is known about the most luminous sources (⁠LLyα≳1042.7 erg s−1; LLyα≳L∗Lyα⁠). Here we present the spectroscopic follow-up of 21 luminous LAEs at z ∼ 2–3 found with panoramic narrow-band surveys over five independent extragalactic fields (≈4 × 106 Mpc3 surveyed at z ∼ 2.2 and z ∼ 3.1). We use WHT/ISIS, Keck/DEIMOS, and VLT/X-SHOOTER to study these sources using high ionization UV lines. Luminous LAEs at z ∼ 2–3 have blue UV slopes (⁠β=−2.0+0.3−0.1⁠) and high Ly α escape fractions (⁠50+20−15 per cent) and span five orders of magnitude in UV luminosity (MUV ≈ −19 to −24). Many (70 per cent) show at least one high ionization rest-frame UV line such as C IV, N V, C III], He II or O III], typically blue-shifted by ≈100–200 km s−1 relative to Ly α. Their Ly α profiles reveal a wide variety of shapes, including significant blue-shifted components and widths from 200 to 4000 km s−1. Overall, 60 ± 11  per cent appear to be active galactic nucleus (AGN) dominated, and at LLyα > 1043.3 erg s−1 and/or MUV < −21.5 virtually all LAEs are AGNs with high ionization parameters (log U = 0.6 ± 0.5) and with metallicities of ≈0.5 − 1 Z⊙. Those lacking signatures of AGNs (40 ± 11  per cent) have lower ionization parameters (⁠logU=−3.0+1.6−0.9 and log ξion = 25.4 ± 0.2) and are apparently metal-poor sources likely powered by young, dust-poor ‘maximal’ starbursts. Our results show that luminous LAEs at z ∼ 2–3 are a diverse population and that 2×L∗Lyα and 2×M∗UV mark a sharp transition in the nature of LAEs, from star formation dominated to AGN dominated. acknowledgement: 'We thank the anonymous reviewer for their timely and constructive comments that greatly helped us to improve the manuscript. DS acknowledges financial support from the Netherlands Organization for Scientific research (NWO) through a Veni fellowship and from Lancaster University through an Early Career Internal Grant A100679. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. BD acknowledges financial support from NASA through the Astrophysics Data Analysis Program (ADAP), grant number NNX12AE20G, and the National Science Foundation, grant number 1716907. IRS acknowledges support from the ERC Advanced Grant DUSTYGAL (321334), STFC (ST/P000541/1), and a Royal Society/Wolfson Merit Award. PNB is grateful for support from STFC via grant ST/M001229/1. We thank Anne Verhamme, Kimihiko Nakajima, Ryan Trainor, Sangeeta Malhotra, Max Gronke, James Rhoads, Fang Xia An, Matthew Hayes, Takashi Kojima, Mark Dijkstra, and Anne Jaskot for many helpful and engaging discussions, particularly during the SnowCLAW Ly α workshop. We thank Bruno Ribeiro, Stephane Charlot, and Joseph Caruana for comments on the manuscript. The authors would also like to thank Ingrid Tengs, Meg Singleton, Ali Khostovan, and Sara Perez for participating in part of the observations. We also thank Joao Calhau, Leah Morabito, Sergio Santos, and Aayush Saxena for their assistance with the narrow-band observations which allowed to select some of the sour ces. Based on observations obtained with the William Herschel Telescope, program: W16AN004; the Very Large Telescope, programs: 098.A-0819 & 099.A-0254; and the Keck II telescope, program: C267D. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 294.A-5039, 092.A-0786, 093.A-0561, 097.A-0943, 098.A-0819, 099.A-0254 and 179.A-2005. The authors acknowledge the award of service time (SW2014b20) on the WHT. WHT and its service programme are operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. The authors would also like to thank all the extremely helpful observatory staff that have greatly contributed towards our observations, particularly Fiona Riddick, Lilian Dominguez, Florencia Jimenez, and Ian Skillen. We have benefited greatly from the publicly available programming language PYTHON, including the NUMPY & SCIPY (Van Der Walt, Colbert & Varoquaux 2011; Jones et al. 2001), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program (Taylor 2013). This research has made use of the VizieR catalogue access tool, CDS, Strasbourg, France.' article_processing_charge: No article_type: original author: - first_name: David full_name: Sobral, David last_name: Sobral - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Behnam full_name: Darvish, Behnam last_name: Darvish - first_name: Ian full_name: Smail, Ian last_name: Smail - first_name: Philip N full_name: Best, Philip N last_name: Best - first_name: Lara full_name: Alegre, Lara last_name: Alegre - first_name: Huub full_name: Röttgering, Huub last_name: Röttgering - first_name: Bahram full_name: Mobasher, Bahram last_name: Mobasher - first_name: Ana full_name: Paulino-Afonso, Ana last_name: Paulino-Afonso - first_name: Andra full_name: Stroe, Andra last_name: Stroe - first_name: Iván full_name: Oteo, Iván last_name: Oteo citation: ama: 'Sobral D, Matthee JJ, Darvish B, et al. The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical Society. 2018;477(2):2817-2840. doi:10.1093/mnras/sty782' apa: 'Sobral, D., Matthee, J. J., Darvish, B., Smail, I., Best, P. N., Alegre, L., … Oteo, I. (2018). The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty782' chicago: 'Sobral, David, Jorryt J Matthee, Behnam Darvish, Ian Smail, Philip N Best, Lara Alegre, Huub Röttgering, et al. “The Nature of Luminous Ly α Emitters at z ∼ 2–3: Maximal Dust-Poor Starbursts and Highly Ionizing AGN.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty782.' ieee: 'D. Sobral et al., “The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN,” Monthly Notices of the Royal Astronomical Society, vol. 477, no. 2. Oxford University Press, pp. 2817–2840, 2018.' ista: 'Sobral D, Matthee JJ, Darvish B, Smail I, Best PN, Alegre L, Röttgering H, Mobasher B, Paulino-Afonso A, Stroe A, Oteo I. 2018. The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN. Monthly Notices of the Royal Astronomical Society. 477(2), 2817–2840.' mla: 'Sobral, David, et al. “The Nature of Luminous Ly α Emitters at z ∼ 2–3: Maximal Dust-Poor Starbursts and Highly Ionizing AGN.” Monthly Notices of the Royal Astronomical Society, vol. 477, no. 2, Oxford University Press, 2018, pp. 2817–40, doi:10.1093/mnras/sty782.' short: D. Sobral, J.J. Matthee, B. Darvish, I. Smail, P.N. Best, L. Alegre, H. Röttgering, B. Mobasher, A. Paulino-Afonso, A. Stroe, I. Oteo, Monthly Notices of the Royal Astronomical Society 477 (2018) 2817–2840. date_created: 2022-07-12T07:18:02Z date_published: 2018-06-01T00:00:00Z date_updated: 2022-08-19T07:01:08Z day: '01' doi: 10.1093/mnras/sty782 extern: '1' external_id: arxiv: - '1802.10102' intvolume: ' 477' issue: '2' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: active' - 'galaxies: evolution' - 'galaxies: high-redshift' - 'galaxies: ISM' - 'galaxies: starburst' - 'cosmology: observations' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.10102 month: '06' oa: 1 oa_version: Preprint page: 2817-2840 publication: Monthly Notices of the Royal Astronomical Society publication_identifier: eissn: - 1365-2966 issn: - 0035-8711 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: 'The nature of luminous Ly α emitters at z ∼ 2–3: Maximal dust-poor starbursts and highly ionizing AGN' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 477 year: '2018' ... --- _id: '11558' abstract: - lang: eng text: We present and explore deep narrow- and medium-band data obtained with the Subaru and the Isaac Newton Telescopes in the ∼2 deg2 COSMOS field. We use these data as an extremely wide, low-resolution (R ∼ 20–80) Integral Field Unit survey to slice through the COSMOS field and obtain a large sample of ∼4000 Ly α emitters (LAEs) from z ∼ 2 to 6 in 16 redshift slices (SC4K). We present new Ly α luminosity functions (LFs) covering a comoving volume of ∼108 Mpc3. SC4K extensively complements ultradeep surveys, jointly covering over 4 dex in Ly α luminosity and revealing a global (2.5 < z < 6) synergy LF with α=−1.93+0.12−0.12⁠, log10Φ∗Lyα=−3.45+0.22−0.29 Mpc−3, and log10L∗Lyα=42.93+0.15−0.11 erg s−1. The Schechter component of the Ly α LF reveals a factor ∼5 rise in L∗Lyα and a ∼7 × decline in Φ∗Lyα from z ∼ 2 to 6. The data reveal an extra power-law (or Schechter) component above LLy α ≈ 1043.3 erg s−1 at z ∼ 2.2–3.5 and we show that it is partially driven by X-ray and radio active galactic nucleus (AGN), as their Ly α LF resembles the excess. The power-law component vanishes and/or is below our detection limits above z > 3.5, likely linked with the evolution of the AGN population. The Ly α luminosity density rises by a factor ∼2 from z ∼ 2 to 3 but is then found to be roughly constant (⁠1.1+0.2−0.2×1040 erg s−1 Mpc−3) to z ∼ 6, despite the ∼0.7 dex drop in ultraviolet (UV) luminosity density. The Ly α/UV luminosity density ratio rises from 4 ± 1 per cent to 30 ± 6 per cent from z ∼ 2.2 to 6. Our results imply a rise of a factor of ≈2 in the global ionization efficiency (ξion) and a factor ≈4 ± 1 in the Ly α escape fraction from z ∼ 2 to 6, hinting for evolution in both the typical burstiness/stellar populations and even more so in the typical interstellar medium conditions allowing Ly α photons to escape. acknowledgement: "We thank the anonymous referee for their constructive comments that helped us improve the manuscript. DS acknowledges the hospitality of the IAC and a Severo Ochoa visiting grant. SS and JC acknowledge studentships from the Lancaster University. JM acknowledges a Huygens PhD fellowship from Leiden University. APA acknowledges financial support from the Science and Technology Foundation (FCT, Portugal) through research grants UID/FIS/04434/2013 and fellowship PD/BD/52706/2014. The authors thank Alyssa Drake, Kimihiko Nakajima, Yuichi Harikane, Max Gronke, Irene Shivaei, Helmut Dannerbauer, Huub Rottgering, ¨ Marius Eide, and Masami Ouchi for many engaging and stimulating discussions. We also thank Sara Perez, Alex Bennett, and Tom Rose for their involvement in the early stages of this project. Based on data products from observations made with European Southern Observatory (ESO) Telescopes at the La Silla Paranal Observatory under ESO programme IDs 294.A-5018, 097.A 0943,\r\n098.A-0819, 099.A-0254, and 179.A-2005 and on data products produced by TERAPIX and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. Based on observations using the WFC on the 2.5 m INT, as part of programmes 2013AN002, 2013BN008, 2014AC88, 2014AN002, 2014BN006, 2014BC118, and 2016AN001. The INT is operated on the island of La Palma by the Isaac Newton Group in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofisica de Canarias. This work is based in part on data products produced at TERAPIX available at the Canadian Astronomy Data Centre as part of the Canada–France– Hawaii Telescope Legacy Survey (CFHTLS), a collaborative project of NRC and CNRS.\r\nWe are grateful to the CFHTLS, COSMOS-UltraVISTA, and COSMOS survey teams. We are also unmeasurably thankful to the pioneering and continuous work from previous Ly α surveys’ teams. Without these previous Ly α and the wider reach legacy surveys, this research would have been impossible. We also thank the VUDS team for making available spectroscopic redshifts from data obtained with VIMOS at the European Southern Observatory Very Large Telescope, Paranal, Chile, under Large Programme 185.A-0791. Finally, the authors acknowledge the unique value of the publicly available programming language PYTHON, including the NUMPY and SCIPY (Van Der Walt, Colbert & Varoquaux 2011; Jones et al. 2001), MATPLOTLIB (Hunter 2007), ASTROPY (Astropy Collaboration et al. 2013), and the TOPCAT analysis program (Taylor 2005). We publicly release a catalogue with all LAEs used in this paper (SC4K), so it can be freely explored by the community (see five example entries in Table A1)." article_processing_charge: No article_type: original author: - first_name: David full_name: Sobral, David last_name: Sobral - first_name: Sérgio full_name: Santos, Sérgio last_name: Santos - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Ana full_name: Paulino-Afonso, Ana last_name: Paulino-Afonso - first_name: Bruno full_name: Ribeiro, Bruno last_name: Ribeiro - first_name: João full_name: Calhau, João last_name: Calhau - first_name: Ali A full_name: Khostovan, Ali A last_name: Khostovan citation: ama: 'Sobral D, Santos S, Matthee JJ, et al. Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical Society. 2018;476(4):4725-4752. doi:10.1093/mnras/sty378' apa: 'Sobral, D., Santos, S., Matthee, J. J., Paulino-Afonso, A., Ribeiro, B., Calhau, J., & Khostovan, A. A. (2018). Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty378' chicago: 'Sobral, David, Sérgio Santos, Jorryt J Matthee, Ana Paulino-Afonso, Bruno Ribeiro, João Calhau, and Ali A Khostovan. “Slicing COSMOS with SC4K: The Evolution of Typical Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty378.' ieee: 'D. Sobral et al., “Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6,” Monthly Notices of the Royal Astronomical Society, vol. 476, no. 4. Oxford University Press, pp. 4725–4752, 2018.' ista: 'Sobral D, Santos S, Matthee JJ, Paulino-Afonso A, Ribeiro B, Calhau J, Khostovan AA. 2018. Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6. Monthly Notices of the Royal Astronomical Society. 476(4), 4725–4752.' mla: 'Sobral, David, et al. “Slicing COSMOS with SC4K: The Evolution of Typical Ly α Emitters and the Ly α Escape Fraction from z ∼ 2 to 6.” Monthly Notices of the Royal Astronomical Society, vol. 476, no. 4, Oxford University Press, 2018, pp. 4725–52, doi:10.1093/mnras/sty378.' short: D. Sobral, S. Santos, J.J. Matthee, A. Paulino-Afonso, B. Ribeiro, J. Calhau, A.A. Khostovan, Monthly Notices of the Royal Astronomical Society 476 (2018) 4725–4752. date_created: 2022-07-12T10:41:08Z date_published: 2018-06-01T00:00:00Z date_updated: 2022-08-19T07:04:45Z day: '01' doi: 10.1093/mnras/sty378 extern: '1' external_id: arxiv: - '1712.04451' intvolume: ' 476' issue: '4' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: evolution' - 'galaxies: formation' - 'galaxies: high-redshift' - 'galaxies: luminosity function' - mass function - 'galaxies: statistics' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.04451 month: '06' oa: 1 oa_version: Preprint page: 4725-4752 publication: Monthly Notices of the Royal Astronomical Society publication_identifier: eissn: - 1365-2966 issn: - 0035-8711 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: 'Slicing COSMOS with SC4K: The evolution of typical Ly α emitters and the Ly α escape fraction from z ∼ 2 to 6' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 476 year: '2018' ... --- _id: '11555' abstract: - lang: eng text: We investigate the morphology of the [C II] emission in a sample of ‘normal’ star-forming galaxies at 5 < z < 7.2 in relation to their UV (rest-frame) counterpart. We use new Atacama Large Millimetre/submillimetre Array (ALMA) observations of galaxies at z ∼ 6–7, as well as a careful re-analysis of archival ALMA data. In total 29 galaxies were analysed, 21 of which are detected in [C II]. For several of the latter the [C II] emission breaks into multiple components. Only a fraction of these [C II] components, if any, is associated with the primary UV systems, while the bulk of the [C II] emission is associated either with fainter UV components, or not associated with any UV counterpart at the current limits. By taking into account the presence of all these components, we find that the L[CII]–SFR (star formation rate) relation at early epochs is fully consistent with the local relation, but it has a dispersion of 0.48 ± 0.07 dex, which is about two times larger than observed locally. We also find that the deviation from the local L[CII]–SFR relation has a weak anticorrelation with the EW(Ly α). The morphological analysis also reveals that [C II] emission is generally much more extended than the UV emission. As a consequence, these primordial galaxies are characterized by a [C II] surface brightness generally much lower than expected from the local Σ[CII]−ΣSFR relation. These properties are likely a consequence of a combination of different effects, namely gas metallicity, [C II] emission from obscured star-forming regions, strong variations of the ionization parameter, and circumgalactic gas in accretion or ejected by these primeval galaxies. acknowledgement: "This paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2012.1.00719.S, ADS/JAO.ALMA#2012.A.00040.S,\r\nADS/JAO.ALMA#2013.A.00433.S, ADS/JAO.ALMA#2011.0.00115.S,\r\nADS/JAO.ALMA#2012.1.00033.S, ADS/JAO.ALMA#2012.1.00523.S,\r\nADS/JAO.ALMA#2013.1.00815.S, ADS/JAO.ALMA#2015.1.00834.S.,\r\nADS/JAO.ALMA#2015.1.01105.S, AND ADS/JAO.ALMA#2016.1.01240.S\r\nwhich can be retrieved from the ALMA data archive:\r\nhttps://almascience.eso.org/ alma-data/archive. ALMA is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan), together with NRC (Canada) and NSC and ASIAA (Taiwan), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO, and NAOJ. We are grateful to G. Jones to for providing his [C II] flux maps. RM and SC acknowledge support by the Science and Technology Facilities Council (STFC). RM acknowledges ERC Advanced Grant 695671 ‘QUENCH’. AF acknowledges support from the ERC Advanced Grant INTERSTELLAR H2020/740120." article_processing_charge: No article_type: original author: - first_name: S full_name: Carniani, S last_name: Carniani - first_name: R full_name: Maiolino, R last_name: Maiolino - first_name: R full_name: Amorin, R last_name: Amorin - first_name: L full_name: Pentericci, L last_name: Pentericci - first_name: A full_name: Pallottini, A last_name: Pallottini - first_name: A full_name: Ferrara, A last_name: Ferrara - first_name: C J full_name: Willott, C J last_name: Willott - first_name: R full_name: Smit, R last_name: Smit - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: D full_name: Sobral, D last_name: Sobral - first_name: P full_name: Santini, P last_name: Santini - first_name: M full_name: Castellano, M last_name: Castellano - first_name: S full_name: De Barros, S last_name: De Barros - first_name: A full_name: Fontana, A last_name: Fontana - first_name: A full_name: Grazian, A last_name: Grazian - first_name: L full_name: Guaita, L last_name: Guaita citation: ama: Carniani S, Maiolino R, Amorin R, et al. Kiloparsec-scale gaseous clumps and star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society. 2018;478(1):1170-1184. doi:10.1093/mnras/sty1088 apa: Carniani, S., Maiolino, R., Amorin, R., Pentericci, L., Pallottini, A., Ferrara, A., … Guaita, L. (2018). Kiloparsec-scale gaseous clumps and star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty1088 chicago: Carniani, S, R Maiolino, R Amorin, L Pentericci, A Pallottini, A Ferrara, C J Willott, et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at z = 5–7.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty1088. ieee: S. Carniani et al., “Kiloparsec-scale gaseous clumps and star formation at z = 5–7,” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 1. Oxford University Press, pp. 1170–1184, 2018. ista: Carniani S, Maiolino R, Amorin R, Pentericci L, Pallottini A, Ferrara A, Willott CJ, Smit R, Matthee JJ, Sobral D, Santini P, Castellano M, De Barros S, Fontana A, Grazian A, Guaita L. 2018. Kiloparsec-scale gaseous clumps and star formation at z = 5–7. Monthly Notices of the Royal Astronomical Society. 478(1), 1170–1184. mla: Carniani, S., et al. “Kiloparsec-Scale Gaseous Clumps and Star Formation at z = 5–7.” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 1, Oxford University Press, 2018, pp. 1170–84, doi:10.1093/mnras/sty1088. short: S. Carniani, R. Maiolino, R. Amorin, L. Pentericci, A. Pallottini, A. Ferrara, C.J. Willott, R. Smit, J.J. Matthee, D. Sobral, P. Santini, M. Castellano, S. De Barros, A. Fontana, A. Grazian, L. Guaita, Monthly Notices of the Royal Astronomical Society 478 (2018) 1170–1184. date_created: 2022-07-11T08:05:42Z date_published: 2018-07-01T00:00:00Z date_updated: 2022-08-19T06:58:06Z day: '01' doi: 10.1093/mnras/sty1088 extern: '1' external_id: arxiv: - '1712.03985' intvolume: ' 478' issue: '1' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: evolution' - 'galaxies: high-redshift' - 'galaxies: ISM' - 'galaxies: formation' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.03985 month: '07' oa: 1 oa_version: Preprint page: 1170-1184 publication: Monthly Notices of the Royal Astronomical Society publication_identifier: eissn: - 1365-2966 issn: - 0035-8711 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Kiloparsec-scale gaseous clumps and star formation at z = 5–7 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 478 year: '2018' ... --- _id: '11584' abstract: - lang: eng text: Observations show that star-forming galaxies reside on a tight 3D plane between mass, gas-phase metallicity, and star formation rate (SFR), which can be explained by the interplay between metal-poor gas inflows, SFR and outflows. However, different metals are released on different time-scales, which may affect the slope of this relation. Here, we use central, star-forming galaxies with Mstar = 109.0–10.5 M⊙ from the EAGLE hydrodynamical simulation to examine 3D relations between mass, SFR, and chemical enrichment using absolute and relative C, N, O, and Fe abundances. We show that the scatter is smaller when gas-phase α-enhancement is used rather than metallicity. A similar plane also exists for stellar α-enhancement, implying that present-day specific SFRs are correlated with long time-scale star formation histories. Between z = 0 and 1, the α-enhancement plane is even more insensitive to redshift than the plane using metallicity. However, it evolves at z > 1 due to lagging iron yields. At fixed mass, galaxies with higher SFRs have star formation histories shifted towards late times, are more α-enhanced, and this α-enhancement increases with redshift as observed. These findings suggest that relations between physical properties inferred from observations may be affected by systematic variations in α-enhancements. acknowledgement: We thank the anonymous referee for their constructive comments. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. We thank Jarle Brinchmann, Rob Crain and David Sobral for discussions. We acknowledge the use of the TOPCAT software (Taylor 2013) for assisting in rapid exploration of multidimensional data sets and the use of PYTHON and its NUMPY, MATPLOTLIB, and PANDAS packages. article_processing_charge: No article_type: original author: - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Joop full_name: Schaye, Joop last_name: Schaye citation: ama: 'Matthee JJ, Schaye J. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. 2018;479(1):L34-L39. doi:10.1093/mnrasl/sly093' apa: 'Matthee, J. J., & Schaye, J. (2018). Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. Oxford University Press. https://doi.org/10.1093/mnrasl/sly093' chicago: 'Matthee, Jorryt J, and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” Monthly Notices of the Royal Astronomical Society: Letters. Oxford University Press, 2018. https://doi.org/10.1093/mnrasl/sly093.' ieee: 'J. J. Matthee and J. Schaye, “Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement,” Monthly Notices of the Royal Astronomical Society: Letters, vol. 479, no. 1. Oxford University Press, pp. L34–L39, 2018.' ista: 'Matthee JJ, Schaye J. 2018. Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement. Monthly Notices of the Royal Astronomical Society: Letters. 479(1), L34–L39.' mla: 'Matthee, Jorryt J., and Joop Schaye. “Star-Forming Galaxies Are Predicted to Lie on a Fundamental Plane of Mass, Star Formation Rate, and α-Enhancement.” Monthly Notices of the Royal Astronomical Society: Letters, vol. 479, no. 1, Oxford University Press, 2018, pp. L34–39, doi:10.1093/mnrasl/sly093.' short: 'J.J. Matthee, J. Schaye, Monthly Notices of the Royal Astronomical Society: Letters 479 (2018) L34–L39.' date_created: 2022-07-14T12:49:47Z date_published: 2018-09-01T00:00:00Z date_updated: 2022-08-19T08:35:45Z day: '01' doi: 10.1093/mnrasl/sly093 extern: '1' external_id: arxiv: - '1802.06786' intvolume: ' 479' issue: '1' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: abundances' - 'galaxies: evolution' - 'galaxies: formation' - 'galaxies: star formation' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.06786 month: '09' oa: 1 oa_version: Preprint page: L34 - L39 publication: 'Monthly Notices of the Royal Astronomical Society: Letters' publication_identifier: eissn: - 1745-3933 issn: - 1745-3925 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Star-forming galaxies are predicted to lie on a fundamental plane of mass, star formation rate, and α-enhancement type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 479 year: '2018' ... --- _id: '11619' abstract: - lang: eng text: We report on the confirmation and mass determination of π Men c, the first transiting planet discovered by NASA’s TESS space mission. π Men is a naked-eye (V = 5.65 mag), quiet G0 V star that was previously known to host a sub-stellar companion (π Men b) on a longperiod (Porb = 2091 days), eccentric (e = 0.64) orbit. Using TESS time-series photometry, combined with Gaia data, published UCLES at AAT Doppler measurements, and archival HARPS at ESO-3.6m radial velocities, we found that π Men c is a close-in planet with an orbital period of Porb = 6.27 days, a mass of Mc = 4.52 ± 0.81 M⊕, and a radius of Rc = 2.06 ± 0.03 R⊕. Based on the planet’s orbital period and size, π Men c is a super-Earth located at, or close to, the radius gap, while its mass and bulk density suggest it may have held on to a significant atmosphere. Because of the brightness of the host star, this system is highly suitable for a wide range of further studies to characterize the planetary atmosphere and dynamical properties. We also performed an asteroseismic analysis of the TESS data and detected a hint of power excess consistent with the seismic values expected for this star, although this result depends on the photometric aperture used to extract the light curve. This marginal detection is expected from pre-launch simulations hinting at the asteroseismic potential of the TESS mission for longer, multi-sector observations and/or for more evolved bright stars. article_number: L10 article_processing_charge: No article_type: letter_note author: - first_name: D. full_name: Gandolfi, D. last_name: Gandolfi - first_name: O. full_name: Barragán, O. last_name: Barragán - first_name: J. H. full_name: Livingston, J. H. last_name: Livingston - first_name: M. full_name: Fridlund, M. last_name: Fridlund - first_name: A. B. full_name: Justesen, A. B. last_name: Justesen - first_name: S. full_name: Redfield, S. last_name: Redfield - first_name: L. full_name: Fossati, L. last_name: Fossati - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: S. full_name: Grziwa, S. last_name: Grziwa - first_name: J. full_name: Cabrera, J. last_name: Cabrera - first_name: R. A. full_name: García, R. A. last_name: García - first_name: C. M. full_name: Persson, C. M. last_name: Persson - first_name: V. full_name: Van Eylen, V. last_name: Van Eylen - first_name: A. P. full_name: Hatzes, A. P. last_name: Hatzes - first_name: D. full_name: Hidalgo, D. last_name: Hidalgo - first_name: S. full_name: Albrecht, S. last_name: Albrecht - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: W. D. full_name: Cochran, W. D. last_name: Cochran - first_name: Sz. full_name: Csizmadia, Sz. last_name: Csizmadia - first_name: H. full_name: Deeg, H. last_name: Deeg - first_name: Ph. full_name: Eigmüller, Ph. last_name: Eigmüller - first_name: M. full_name: Endl, M. last_name: Endl - first_name: A. full_name: Erikson, A. last_name: Erikson - first_name: M. full_name: Esposito, M. last_name: Esposito - first_name: E. full_name: Guenther, E. last_name: Guenther - first_name: J. full_name: Korth, J. last_name: Korth - first_name: R. full_name: Luque, R. last_name: Luque - first_name: P. full_name: Montañes Rodríguez, P. last_name: Montañes Rodríguez - first_name: D. full_name: Nespral, D. last_name: Nespral - first_name: G. full_name: Nowak, G. last_name: Nowak - first_name: M. full_name: Pätzold, M. last_name: Pätzold - first_name: J. full_name: Prieto-Arranz, J. last_name: Prieto-Arranz citation: ama: 'Gandolfi D, Barragán O, Livingston JH, et al. TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae. Astronomy & Astrophysics. 2018;619. doi:10.1051/0004-6361/201834289' apa: 'Gandolfi, D., Barragán, O., Livingston, J. H., Fridlund, M., Justesen, A. B., Redfield, S., … Prieto-Arranz, J. (2018). TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201834289' chicago: 'Gandolfi, D., O. Barragán, J. H. Livingston, M. Fridlund, A. B. Justesen, S. Redfield, L. Fossati, et al. “TESS’s First Planet: A Super-Earth Transiting the Naked-Eye Star π Mensae.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201834289.' ieee: 'D. Gandolfi et al., “TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae,” Astronomy & Astrophysics, vol. 619. EDP Sciences, 2018.' ista: 'Gandolfi D, Barragán O, Livingston JH, Fridlund M, Justesen AB, Redfield S, Fossati L, Mathur S, Grziwa S, Cabrera J, García RA, Persson CM, Van Eylen V, Hatzes AP, Hidalgo D, Albrecht S, Bugnet LA, Cochran WD, Csizmadia S, Deeg H, Eigmüller P, Endl M, Erikson A, Esposito M, Guenther E, Korth J, Luque R, Montañes Rodríguez P, Nespral D, Nowak G, Pätzold M, Prieto-Arranz J. 2018. TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae. Astronomy & Astrophysics. 619, L10.' mla: 'Gandolfi, D., et al. “TESS’s First Planet: A Super-Earth Transiting the Naked-Eye Star π Mensae.” Astronomy & Astrophysics, vol. 619, L10, EDP Sciences, 2018, doi:10.1051/0004-6361/201834289.' short: D. Gandolfi, O. Barragán, J.H. Livingston, M. Fridlund, A.B. Justesen, S. Redfield, L. Fossati, S. Mathur, S. Grziwa, J. Cabrera, R.A. García, C.M. Persson, V. Van Eylen, A.P. Hatzes, D. Hidalgo, S. Albrecht, L.A. Bugnet, W.D. Cochran, S. Csizmadia, H. Deeg, P. Eigmüller, M. Endl, A. Erikson, M. Esposito, E. Guenther, J. Korth, R. Luque, P. Montañes Rodríguez, D. Nespral, G. Nowak, M. Pätzold, J. Prieto-Arranz, Astronomy & Astrophysics 619 (2018). date_created: 2022-07-18T14:41:16Z date_published: 2018-11-22T00:00:00Z date_updated: 2022-08-22T07:43:29Z day: '22' doi: 10.1051/0004-6361/201834289 extern: '1' external_id: arxiv: - '1809.07573' intvolume: ' 619' keyword: - Space and Planetary Science - Astronomy and Astrophysics - planetary systems / planets and satellites - detection / planets and satellites - fundamental parameters / planets and satellites - terrestrial planets / stars - fundamental parameters language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.07573 month: '11' oa: 1 oa_version: Preprint publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'TESS’s first planet: A super-Earth transiting the naked-eye star π Mensae' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 619 year: '2018' ... --- _id: '11618' abstract: - lang: eng text: Asteroseismology provides global stellar parameters such as masses, radii, or surface gravities using mean global seismic parameters and effective temperature for thousands of low-mass stars (0.8 M⊙ < M < 3 M⊙). This methodology has been successfully applied to stars in which acoustic modes excited by turbulent convection are measured. Other methods such as the Flicker technique can also be used to determine stellar surface gravities, but only works for log g above 2.5 dex. In this work, we present a new metric called FliPer (Flicker in spectral power density, in opposition to the standard Flicker measurement which is computed in the time domain); it is able to extend the range for which reliable surface gravities can be obtained (0.1 < log g < 4.6 dex) without performing any seismic analysis for stars brighter than Kp < 14. FliPer takes into account the average variability of a star measured in the power density spectrum in a given range of frequencies. However, FliPer values calculated on several ranges of frequency are required to better characterize a star. Using a large set of asteroseismic targets it is possible to calibrate the behavior of surface gravity with FliPer through machine learning. This calibration made with a random forest regressor covers a wide range of surface gravities from main-sequence stars to subgiants and red giants, with very small uncertainties from 0.04 to 0.1 dex. FliPer values can be inserted in automatic global seismic pipelines to either give an estimation of the stellar surface gravity or to assess the quality of the seismic results by detecting any outliers in the obtained νmax values. FliPer also constrains the surface gravities of main-sequence dwarfs using only long-cadence data for which the Nyquist frequency is too low to measure the acoustic-mode properties. acknowledgement: We thank the anonymous referee for the very useful comments. We would also like to thank M. Benbakoura for his help in analyzing the light curves of several binary systems included in our set of stars. L.B. and R.A.G. acknowledge the support from PLATO and GOLF CNES grants. S.M. acknowledges support from the National Aeronautics and Space Administration under Grant NNX15AF13G, the National Science Foundation grant AST-1411685, and the Ramon y Cajal fellowship no. RYC-2015-17697. E.C. is funded by the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement no. 664931. O.J.H and B.M.R. acknowledge the support of the UK Science and Technology Facilities Council (STFC). Funding for the Stellar Astrophysics Centre is provided by the Danish National Research Foundation (Grant DNRF106). This research has made use of NASA’s Astrophysics Data System. Data presented in this paper were obtained from the Mikulski Archive for Space Telescopes (MAST). STScI is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555. article_number: A38 article_processing_charge: No article_type: original author: - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: R. A. full_name: García, R. A. last_name: García - first_name: G. R. full_name: Davies, G. R. last_name: Davies - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: E. full_name: Corsaro, E. last_name: Corsaro - first_name: O. J. full_name: Hall, O. J. last_name: Hall - first_name: B. M. full_name: Rendle, B. M. last_name: Rendle citation: ama: 'Bugnet LA, García RA, Davies GR, et al. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. 2018;620. doi:10.1051/0004-6361/201833106' apa: 'Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Corsaro, E., Hall, O. J., & Rendle, B. M. (2018). FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201833106' chicago: 'Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, E. Corsaro, O. J. Hall, and B. M. Rendle. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” Astronomy & Astrophysics. EDP Sciences, 2018. https://doi.org/10.1051/0004-6361/201833106.' ieee: 'L. A. Bugnet et al., “FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants,” Astronomy & Astrophysics, vol. 620. EDP Sciences, 2018.' ista: 'Bugnet LA, García RA, Davies GR, Mathur S, Corsaro E, Hall OJ, Rendle BM. 2018. FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants. Astronomy & Astrophysics. 620, A38.' mla: 'Bugnet, Lisa Annabelle, et al. “FliPer: A Global Measure of Power Density to Estimate Surface Gravities of Main-Sequence Solar-like Stars and Red Giants.” Astronomy & Astrophysics, vol. 620, A38, EDP Sciences, 2018, doi:10.1051/0004-6361/201833106.' short: L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, E. Corsaro, O.J. Hall, B.M. Rendle, Astronomy & Astrophysics 620 (2018). date_created: 2022-07-18T14:37:39Z date_published: 2018-12-01T00:00:00Z date_updated: 2022-08-22T07:41:07Z day: '01' doi: 10.1051/0004-6361/201833106 extern: '1' external_id: arxiv: - '1809.05105' intvolume: ' 620' keyword: - Space and Planetary Science - Astronomy and Astrophysics - asteroseismology / methods - data analysis / stars - oscillations language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1809.05105 month: '12' oa: 1 oa_version: Preprint publication: Astronomy & Astrophysics publication_identifier: eissn: - 1432-0746 issn: - 0004-6361 publication_status: published publisher: EDP Sciences quality_controlled: '1' scopus_import: '1' status: public title: 'FliPer: A global measure of power density to estimate surface gravities of main-sequence solar-like stars and red giants' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 620 year: '2018' ... --- _id: '11620' abstract: - lang: eng text: We report the discovery and characterization of HD 89345b (K2-234b; EPIC 248777106b), a Saturn-sized planet orbiting a slightly evolved star. HD 89345 is a bright star (V = 9.3 mag) observed by the K2 mission with 1 min time sampling. It exhibits solar-like oscillations. We conducted asteroseismology to determine the parameters of the star, finding the mass and radius to be 1.12+0.04−0.01M⊙ and 1.657+0.020−0.004R⊙⁠, respectively. The star appears to have recently left the main sequence, based on the inferred age, 9.4+0.4−1.3Gyr⁠, and the non-detection of mixed modes. The star hosts a ‘warm Saturn’ (P = 11.8 d, Rp = 6.86 ± 0.14 R⊕). Radial-velocity follow-up observations performed with the FIbre-fed Echelle Spectrograph, HARPS, and HARPS-N spectrographs show that the planet has a mass of 35.7 ± 3.3 M⊕. The data also show that the planet’s orbit is eccentric (e ≈ 0.2). An investigation of the rotational splitting of the oscillation frequencies of the star yields no conclusive evidence on the stellar inclination angle. We further obtained Rossiter–McLaughlin observations, which result in a broad posterior of the stellar obliquity. The planet seems to confirm to the same patterns that have been observed for other sub-Saturns regarding planet mass and multiplicity, orbital eccentricity, and stellar metallicity. acknowledgement: 'We gratefully acknowledge many helpful suggestions by the anonymous referee. Based on observations made with a) the Nordic Optical Telescope, operated by the Nordic Optical Telescope Scientific Association at the Observatorio del Roque de los Muchachos; b) the ESO-3.6m telescope at La Silla Observatory under programme ID 0100.C-0808; c) the Italian Telescopio Nazionale Galileo operated on the island of La Palma by the Fundación Galileo Galilei of the Istituto Nazionale di Astrofisica. NESSI was funded by the NASA Exoplanet Exploration Program and the NASA Ames Research Center. NESSI was built at the Ames Research Center by Steve B. Howell, Nic Scott, Elliott P. Horch, and Emmett Quigley. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 730890. This material reflects only the authors views and the Commission is not liable for any use that may be made of the information contained therein. DG gratefully acknowledges the financial support of the Programma Giovani Ricercatori – Rita Levi Montalcini – Rientro dei Cervelli (2012) awarded by the Italian Ministry of Education, Universities and Research (MIUR). SaM would like to acknowledge support from the Ramon y Cajal fellowship number RYC-2015-17697. AJ, MH, and SA acknowledge support by the Danish Council for Independent Research, through a DFF Sapere Aude Starting Grant nr. 4181-00487B. SzCs, APH, MP, and HR acknowledge the support of the DFG priority program SPP 1992Exploring the Diversity of Extrasolar Planets (grants HA 3279/12-1, PA 525/18-1, PA5 25/19-1 and PA525/20-1, RA 714/14-1) HD, CR, and FPH acknowledge the financial support from MINECO under grants ESP2015-65712-C5-4-R and AYA2016-76378-P. This paper has made use of the IAC Supercomputing facility HTCondor (http://research.cs.wisc.edu/htcondor/), partly financed by the Ministry of Economy and Competitiveness with FEDER funds, code IACA13-3E-2493. MF and CMP gratefully acknowledge the support of the Swedish National Space Board. RAG and StM thanks the support of the CNES PLATO grant. PGB is a postdoctoral fellow in the MINECO-programme ’Juan de la Cierva Incorporacion’ (IJCI-2015-26034). StM acknowledges support from ERC through SPIRE grant (647383) and from ISSI through the ENCELADE 2.0 team. VSA acknowledges support from VILLUM FONDEN (research grant 10118). MNL acknowledges support from the ESA-PRODEX programme. Funding for the Stellar Astrophysics Centre is provided by The Danish National Research Foundation (Grant agreement no.: DNRF106) This work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for the DPAC has been provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement. This research was made with the use of NASA’s Astrophysics Data System and the NASA Exoplanet Archive, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program.' article_processing_charge: No article_type: original author: - first_name: V full_name: Van Eylen, V last_name: Van Eylen - first_name: F full_name: Dai, F last_name: Dai - first_name: S full_name: Mathur, S last_name: Mathur - first_name: D full_name: Gandolfi, D last_name: Gandolfi - first_name: S full_name: Albrecht, S last_name: Albrecht - first_name: M full_name: Fridlund, M last_name: Fridlund - first_name: R A full_name: García, R A last_name: García - first_name: E full_name: Guenther, E last_name: Guenther - first_name: M full_name: Hjorth, M last_name: Hjorth - first_name: A B full_name: Justesen, A B last_name: Justesen - first_name: J full_name: Livingston, J last_name: Livingston - first_name: M N full_name: Lund, M N last_name: Lund - first_name: F full_name: Pérez Hernández, F last_name: Pérez Hernández - first_name: J full_name: Prieto-Arranz, J last_name: Prieto-Arranz - first_name: C full_name: Regulo, C last_name: Regulo - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: M E full_name: Everett, M E last_name: Everett - first_name: T full_name: Hirano, T last_name: Hirano - first_name: D full_name: Nespral, D last_name: Nespral - first_name: G full_name: Nowak, G last_name: Nowak - first_name: E full_name: Palle, E last_name: Palle - first_name: V full_name: Silva Aguirre, V last_name: Silva Aguirre - first_name: T full_name: Trifonov, T last_name: Trifonov - first_name: J N full_name: Winn, J N last_name: Winn - first_name: O full_name: Barragán, O last_name: Barragán - first_name: P G full_name: Beck, P G last_name: Beck - first_name: W J full_name: Chaplin, W J last_name: Chaplin - first_name: W D full_name: Cochran, W D last_name: Cochran - first_name: S full_name: Csizmadia, S last_name: Csizmadia - first_name: H full_name: Deeg, H last_name: Deeg - first_name: M full_name: Endl, M last_name: Endl - first_name: P full_name: Heeren, P last_name: Heeren - first_name: S full_name: Grziwa, S last_name: Grziwa - first_name: A P full_name: Hatzes, A P last_name: Hatzes - first_name: D full_name: Hidalgo, D last_name: Hidalgo - first_name: J full_name: Korth, J last_name: Korth - first_name: S full_name: Mathis, S last_name: Mathis - first_name: P full_name: Montañes Rodriguez, P last_name: Montañes Rodriguez - first_name: N full_name: Narita, N last_name: Narita - first_name: M full_name: Patzold, M last_name: Patzold - first_name: C M full_name: Persson, C M last_name: Persson - first_name: F full_name: Rodler, F last_name: Rodler - first_name: A M S full_name: Smith, A M S last_name: Smith citation: ama: 'Van Eylen V, Dai F, Mathur S, et al. HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. 2018;478(4):4866-4880. doi:10.1093/mnras/sty1390' apa: 'Van Eylen, V., Dai, F., Mathur, S., Gandolfi, D., Albrecht, S., Fridlund, M., … Smith, A. M. S. (2018). HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/sty1390' chicago: 'Van Eylen, V, F Dai, S Mathur, D Gandolfi, S Albrecht, M Fridlund, R A García, et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting Warm Saturn-Sized Planet Observed by K2.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2018. https://doi.org/10.1093/mnras/sty1390.' ieee: 'V. Van Eylen et al., “HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2,” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 4. Oxford University Press, pp. 4866–4880, 2018.' ista: 'Van Eylen V, Dai F, Mathur S, Gandolfi D, Albrecht S, Fridlund M, García RA, Guenther E, Hjorth M, Justesen AB, Livingston J, Lund MN, Pérez Hernández F, Prieto-Arranz J, Regulo C, Bugnet LA, Everett ME, Hirano T, Nespral D, Nowak G, Palle E, Silva Aguirre V, Trifonov T, Winn JN, Barragán O, Beck PG, Chaplin WJ, Cochran WD, Csizmadia S, Deeg H, Endl M, Heeren P, Grziwa S, Hatzes AP, Hidalgo D, Korth J, Mathis S, Montañes Rodriguez P, Narita N, Patzold M, Persson CM, Rodler F, Smith AMS. 2018. HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2. Monthly Notices of the Royal Astronomical Society. 478(4), 4866–4880.' mla: 'Van Eylen, V., et al. “HD 89345: A Bright Oscillating Star Hosting a Transiting Warm Saturn-Sized Planet Observed by K2.” Monthly Notices of the Royal Astronomical Society, vol. 478, no. 4, Oxford University Press, 2018, pp. 4866–80, doi:10.1093/mnras/sty1390.' short: V. Van Eylen, F. Dai, S. Mathur, D. Gandolfi, S. Albrecht, M. Fridlund, R.A. García, E. Guenther, M. Hjorth, A.B. Justesen, J. Livingston, M.N. Lund, F. Pérez Hernández, J. Prieto-Arranz, C. Regulo, L.A. Bugnet, M.E. Everett, T. Hirano, D. Nespral, G. Nowak, E. Palle, V. Silva Aguirre, T. Trifonov, J.N. Winn, O. Barragán, P.G. Beck, W.J. Chaplin, W.D. Cochran, S. Csizmadia, H. Deeg, M. Endl, P. Heeren, S. Grziwa, A.P. Hatzes, D. Hidalgo, J. Korth, S. Mathis, P. Montañes Rodriguez, N. Narita, M. Patzold, C.M. Persson, F. Rodler, A.M.S. Smith, Monthly Notices of the Royal Astronomical Society 478 (2018) 4866–4880. date_created: 2022-07-18T14:43:17Z date_published: 2018-08-01T00:00:00Z date_updated: 2022-08-22T07:45:38Z day: '01' doi: 10.1093/mnras/sty1390 extern: '1' external_id: arxiv: - '1805.01860' intvolume: ' 478' issue: '4' keyword: - Space and Planetary Science - Astronomy and Astrophysics - asteroseismology - 'planets and satellites: composition' - 'planets and satellites: formation' - 'planets and satellites: fundamental parameters' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1805.01860 month: '08' oa: 1 oa_version: Preprint page: 4866-4880 publication: Monthly Notices of the Royal Astronomical Society publication_identifier: eissn: - 1365-2966 issn: - 0035-8711 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: 'HD 89345: A bright oscillating star hosting a transiting warm Saturn-sized planet observed by K2' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 478 year: '2018' ... --- _id: '11631' abstract: - lang: eng text: "The recently launched NASA Transiting Exoplanet Survey Satellite (TESS) mission is going to collect lightcurves for a few hundred million of stars and we expect to increase the number of pulsating stars to analyze compared to the few thousand stars observed by the CoRoT, Kepler and K2 missions. However, most of the TESS targets have not yet been properly classified and characterized. In order to improve the analysis of the TESS data, it is crucial to determine the type of stellar pulsations in a timely manner. We propose an automatic method to classify stars attending to their pulsation properties, in particular, to identify solar-like pulsators among all TESS targets. It relies on the use of the global amount of power contained in the power spectrum (already known as the FliPer method) as a key parameter, along with\r\nthe effective temperature, to feed into a machine learning classifier. Our study, based on TESS simulated datasets, shows that we are able to classify pulsators with a 98% accuracy." article_number: '1811.12140' article_processing_charge: No author: - first_name: Lisa Annabelle full_name: Bugnet, Lisa Annabelle id: d9edb345-f866-11ec-9b37-d119b5234501 last_name: Bugnet orcid: 0000-0003-0142-4000 - first_name: R. A. full_name: García, R. A. last_name: García - first_name: G. R. full_name: Davies, G. R. last_name: Davies - first_name: S. full_name: Mathur, S. last_name: Mathur - first_name: O. J. full_name: Hall, O. J. last_name: Hall - first_name: B. M. full_name: Rendle, B. M. last_name: Rendle citation: ama: 'Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv. doi:10.48550/arXiv.1811.12140' apa: 'Bugnet, L. A., García, R. A., Davies, G. R., Mathur, S., Hall, O. J., & Rendle, B. M. (n.d.). FliPer: Classifying TESS pulsating stars. arXiv. https://doi.org/10.48550/arXiv.1811.12140' chicago: 'Bugnet, Lisa Annabelle, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1811.12140.' ieee: 'L. A. Bugnet, R. A. García, G. R. Davies, S. Mathur, O. J. Hall, and B. M. Rendle, “FliPer: Classifying TESS pulsating stars,” arXiv. .' ista: 'Bugnet LA, García RA, Davies GR, Mathur S, Hall OJ, Rendle BM. FliPer: Classifying TESS pulsating stars. arXiv, 1811.12140.' mla: 'Bugnet, Lisa Annabelle, et al. “FliPer: Classifying TESS Pulsating Stars.” ArXiv, 1811.12140, doi:10.48550/arXiv.1811.12140.' short: L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle, ArXiv (n.d.). date_created: 2022-07-21T07:05:23Z date_published: 2018-11-29T00:00:00Z date_updated: 2022-08-22T08:41:55Z day: '29' doi: 10.48550/arXiv.1811.12140 extern: '1' external_id: arxiv: - '1811.12140' keyword: - asteroseismology - methods - data analysis - stars - oscillations language: - iso: eng main_file_link: - open_access: '1' url: ' https://doi.org/10.48550/arXiv.1811.12140' month: '11' oa: 1 oa_version: Preprint publication: arXiv publication_status: submitted status: public title: 'FliPer: Classifying TESS pulsating stars' type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11657' abstract: - lang: eng text: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi’s contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm runs a factor 7.5× faster on average when using 32 threads. To further speed up computations, we also give a version of our algorithm that performs random edge contractions as preprocessing. This version achieves a lower running time and better parallel scalability at the expense of a higher error rate. article_processing_charge: No article_type: original author: - 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: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Darren full_name: Strash, Darren last_name: Strash citation: ama: Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 2018;23:1-22. doi:10.1145/3274662 apa: Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. Association for Computing Machinery. https://doi.org/10.1145/3274662 chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” ACM Journal of Experimental Algorithmics. Association for Computing Machinery, 2018. https://doi.org/10.1145/3274662. ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” ACM Journal of Experimental Algorithmics, vol. 23. Association for Computing Machinery, pp. 1–22, 2018. ista: Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. 23, 1–22. mla: Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” ACM Journal of Experimental Algorithmics, vol. 23, Association for Computing Machinery, 2018, pp. 1–22, doi:10.1145/3274662. short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22. date_created: 2022-07-27T08:28:26Z date_published: 2018-10-01T00:00:00Z date_updated: 2022-09-09T11:32:52Z day: '01' doi: 10.1145/3274662 extern: '1' external_id: arxiv: - '1708.06127' intvolume: ' 23' keyword: - Theoretical Computer Science language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.06127 month: '10' oa: 1 oa_version: Preprint page: 1-22 publication: ACM Journal of Experimental Algorithmics publication_identifier: eissn: - 1084-6654 issn: - 1084-6654 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Practical minimum cut algorithms type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 23 year: '2018' ... --- _id: '11667' abstract: - lang: eng text: The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions, the truthful direct-revelation mechanism that maximizes social welfare is the Vickrey-Clarke-Groves mechanism. For many valuation spaces, computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that increased expressiveness can give rise to additional equilibria of poorer efficiency. article_number: '5' article_processing_charge: No article_type: original author: - first_name: Paul full_name: Dütting, Paul last_name: Dütting - 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: Martin full_name: Starnberger, Martin last_name: Starnberger citation: ama: Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 2018;6(2). doi:10.1145/3232860 apa: Dütting, P., Henzinger, M. H., & Starnberger, M. (2018). Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. Association for Computing Machinery. https://doi.org/10.1145/3232860 chicago: Dütting, Paul, Monika H Henzinger, and Martin Starnberger. “Valuation Compressions in VCG-Based Combinatorial Auctions.” ACM Transactions on Economics and Computation. Association for Computing Machinery, 2018. https://doi.org/10.1145/3232860. ieee: P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” ACM Transactions on Economics and Computation, vol. 6, no. 2. Association for Computing Machinery, 2018. ista: Dütting P, Henzinger MH, Starnberger M. 2018. Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. 6(2), 5. mla: Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” ACM Transactions on Economics and Computation, vol. 6, no. 2, 5, Association for Computing Machinery, 2018, doi:10.1145/3232860. short: P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018). date_created: 2022-07-27T11:46:46Z date_published: 2018-05-01T00:00:00Z date_updated: 2022-09-09T12:04:42Z day: '01' doi: 10.1145/3232860 extern: '1' external_id: arxiv: - '1310.3153' intvolume: ' 6' issue: '2' keyword: - Theory of computation - Algorithmic game theory and mechanism design - Applied computing - Economics - Simplified mechanisms - Combinatorial auctions with item bidding - Price of anarchy language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1310.3153 month: '05' oa: 1 oa_version: Preprint publication: ACM Transactions on Economics and Computation publication_identifier: eissn: - 2167-8383 issn: - 2167-8375 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Valuation compressions in VCG-based combinatorial auctions type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2018' ... --- _id: '11664' abstract: - lang: eng text: "We present a deterministic incremental algorithm for exactly maintaining the size of a minimum cut with O(log3 n log log2 n) amortized time per edge insertion and O(1) query time. This result partially answers an open question posed by Thorup (2007). It also stays in sharp contrast to a polynomial conditional lower bound for the fully dynamic weighted minimum cut problem. Our algorithm is obtained by combining a sparsification technique of Kawarabayashi and Thorup (2015) or its recent improvement by Henzinger, Rao, and Wang (2017), and an exact incremental algorithm of Henzinger (1997).\r\n\r\nWe also study space-efficient incremental algorithms for the minimum cut problem. Concretely, we show that there exists an O(nlog n/ε2) space Monte Carlo algorithm that can process a stream of edge insertions starting from an empty graph, and with high probability, the algorithm maintains a (1+ε)-approximation to the minimum cut. The algorithm has O((α (n) log3 n)/ε 2) amortized update time and constant query time, where α (n) stands for the inverse of Ackermann function." acknowledgement: "We thank the two anonymous reviewers for their suggestions and comments, which improved the\r\nquality of the article." article_number: '17' article_processing_charge: No article_type: original author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - 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: Mikkel full_name: Thorup, Mikkel last_name: Thorup citation: ama: Goranci G, Henzinger MH, Thorup M. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 2018;14(2). doi:10.1145/3174803 apa: Goranci, G., Henzinger, M. H., & Thorup, M. (2018). Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3174803 chicago: Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.” ACM Transactions on Algorithms. Association for Computing Machinery, 2018. https://doi.org/10.1145/3174803. ieee: G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in polylogarithmic amortized update time,” ACM Transactions on Algorithms, vol. 14, no. 2. Association for Computing Machinery, 2018. ista: Goranci G, Henzinger MH, Thorup M. 2018. Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. 14(2), 17. mla: Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.” ACM Transactions on Algorithms, vol. 14, no. 2, 17, Association for Computing Machinery, 2018, doi:10.1145/3174803. short: G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018). date_created: 2022-07-27T11:29:39Z date_published: 2018-04-01T00:00:00Z date_updated: 2022-09-09T11:38:14Z day: '01' doi: 10.1145/3174803 extern: '1' external_id: arxiv: - '1611.06500' intvolume: ' 14' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1611.06500 month: '04' oa: 1 oa_version: Preprint publication: ACM Transactions on Algorithms publication_identifier: eissn: - 1549-6333 issn: - 1549-6325 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Incremental exact min-cut in polylogarithmic amortized update time type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2018' ... --- _id: '11757' abstract: - lang: eng text: We develop a dynamic version of the primal-dual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic set-cover problem, we maintain an O ( f 2)-approximately optimal solution in O ( f · log(m + n)) amortized update time, where f is the maximum “frequency” of an element, n is the number of sets, and m is the maximum number of elements in the universe at any point in time. (2) For the dynamic b-matching problem, we maintain an O (1)-approximately optimal solution in O (log3 n) amortized update time, where n is the number of nodes in the graph. article_processing_charge: No article_type: original author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - 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: Giuseppe full_name: Italiano, Giuseppe last_name: Italiano citation: ama: Bhattacharya S, Henzinger MH, Italiano G. Dynamic algorithms via the primal-dual method. Information and Computation. 2018;261(08):219-239. doi:10.1016/j.ic.2018.02.005 apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. (2018). Dynamic algorithms via the primal-dual method. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2018.02.005 chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic Algorithms via the Primal-Dual Method.” Information and Computation. Elsevier, 2018. https://doi.org/10.1016/j.ic.2018.02.005. ieee: S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” Information and Computation, vol. 261, no. 08. Elsevier, pp. 219–239, 2018. ista: Bhattacharya S, Henzinger MH, Italiano G. 2018. Dynamic algorithms via the primal-dual method. Information and Computation. 261(08), 219–239. mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms via the Primal-Dual Method.” Information and Computation, vol. 261, no. 08, Elsevier, 2018, pp. 219–39, doi:10.1016/j.ic.2018.02.005. short: S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239. date_created: 2022-08-08T11:20:03Z date_published: 2018-08-01T00:00:00Z date_updated: 2023-02-10T07:27:39Z day: '01' doi: 10.1016/j.ic.2018.02.005 extern: '1' intvolume: ' 261' issue: '08' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.ic.2018.02.005 month: '08' oa: 1 oa_version: Published Version page: 219-239 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Dynamic algorithms via the primal-dual method type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 261 year: '2018' ... --- _id: '11828' abstract: - lang: eng text: "We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.\r\nWe complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.\r\nWe further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false." alternative_title: - LIPIcs article_number: '40' article_processing_charge: No author: - first_name: Gramoz full_name: Goranci, Gramoz last_name: Goranci - 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: Pan full_name: Peng, Pan last_name: Peng citation: ama: 'Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate schur complement on separable graphs. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.40' apa: 'Goranci, G., Henzinger, M. H., & Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.40' chicago: Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.40. ieee: G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112. ista: 'Goranci G, Henzinger MH, Peng P. 2018. Dynamic effective resistances and approximate schur complement on separable graphs. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 40.' mla: Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” 26th Annual European Symposium on Algorithms, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40. short: G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-08-22 location: Helsinki, Finland name: 'ESA: Annual European Symposium on Algorithms' start_date: 2018-08-20 date_created: 2022-08-12T08:26:42Z date_published: 2018-08-14T00:00:00Z date_updated: 2023-02-16T11:08:08Z day: '14' doi: 10.4230/LIPICS.ESA.2018.40 extern: '1' external_id: arxiv: - '1802.09111' intvolume: ' 112' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2018.40 month: '08' oa: 1 oa_version: Published Version publication: 26th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959770811' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Dynamic effective resistances and approximate schur complement on separable graphs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 112 year: '2018' ... --- _id: '11827' abstract: - lang: eng text: We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem. alternative_title: - LIPIcs article_number: '39' article_processing_charge: No author: - first_name: 'Gramoz ' full_name: 'Goranci, Gramoz ' last_name: Goranci - 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: Dariusz full_name: Leniowski, Dariusz last_name: Leniowski citation: ama: 'Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility location. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.39' apa: 'Goranci, G., Henzinger, M. H., & Leniowski, D. (2018). A tree structure for dynamic facility location. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ESA.2018.39' chicago: Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.” In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ESA.2018.39. ieee: G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112. ista: 'Goranci G, Henzinger MH, Leniowski D. 2018. A tree structure for dynamic facility location. 26th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 112, 39.' mla: Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” 26th Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39. short: G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-08-22 location: Helsinki, Finland name: 'ESA: Annual European Symposium on Algorithms' start_date: 2018-08-20 date_created: 2022-08-12T08:20:57Z date_published: 2018-08-14T00:00:00Z date_updated: 2023-02-16T10:50:51Z day: '14' doi: 10.4230/LIPICS.ESA.2018.39 extern: '1' external_id: arxiv: - '1909.06653' intvolume: ' 112' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPIcs.ESA.2018.39 month: '08' oa: 1 oa_version: Published Version publication: 26th Annual European Symposium on Algorithms publication_identifier: isbn: - '9783959770811' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: A tree structure for dynamic facility location type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 112 year: '2018' ... --- _id: '11768' abstract: - lang: eng text: "In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ϵ)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary.\r\n\r\nIn contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools might be of independent interest." article_processing_charge: No article_type: original author: - 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: Sebastian full_name: Krinninger, Sebastian last_name: Krinninger - first_name: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 2018;65(6):1-40. doi:10.1145/3218657 apa: Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. Association for Computing Machinery. https://doi.org/10.1145/3218657 chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” Journal of the ACM. Association for Computing Machinery, 2018. https://doi.org/10.1145/3218657. ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018. ista: Henzinger MH, Krinninger S, Nanongkai D. 2018. Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. 65(6), 1–40. mla: Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” Journal of the ACM, vol. 65, no. 6, Association for Computing Machinery, 2018, pp. 1–40, doi:10.1145/3218657. short: M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40. date_created: 2022-08-08T12:33:17Z date_published: 2018-12-01T00:00:00Z date_updated: 2023-02-21T16:30:41Z day: '01' doi: 10.1145/3218657 extern: '1' external_id: arxiv: - '1512.08148' intvolume: ' 65' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1512.08148 month: '12' oa: 1 oa_version: Preprint page: 1-40 publication: Journal of the ACM publication_identifier: eissn: - 1557-735X issn: - 0004-5411 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' related_material: record: - id: '11855' relation: earlier_version status: public scopus_import: '1' status: public title: Decremental single-source shortest paths on undirected graphs in near-linear total update time type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 65 year: '2018' ... --- _id: '11872' abstract: - lang: eng text: We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with worst-case update time [4]. article_processing_charge: No author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - first_name: Deeparnab full_name: Chakrabarty, Deeparnab last_name: Chakrabarty - 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: Danupon full_name: Nanongkai, Danupon last_name: Nanongkai citation: ama: 'Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. Dynamic algorithms for graph coloring. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2018:1-20. doi:10.1137/1.9781611975031.1' apa: 'Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., & Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975031.1' chicago: Bhattacharya, Sayan, Deeparnab Chakrabarty, Monika H Henzinger, and Danupon Nanongkai. “Dynamic Algorithms for Graph Coloring.” In 29th Annual ACM-SIAM Symposium on Discrete Algorithms, 1–20. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/1.9781611975031.1. ieee: S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 1–20. ista: 'Bhattacharya S, Chakrabarty D, Henzinger MH, Nanongkai D. 2018. Dynamic algorithms for graph coloring. 29th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1–20.' mla: Bhattacharya, Sayan, et al. “Dynamic Algorithms for Graph Coloring.” 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20, doi:10.1137/1.9781611975031.1. short: S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20. conference: end_date: 2018-01-10 location: New Orleans, LA, United States name: 'SODA: Symposium on Discrete Algorithms' start_date: 2018-01-07 date_created: 2022-08-16T12:07:14Z date_published: 2018-01-01T00:00:00Z date_updated: 2023-02-17T11:39:01Z day: '01' doi: 10.1137/1.9781611975031.1 extern: '1' external_id: arxiv: - '1711.04355' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1711.04355 month: '01' oa: 1 oa_version: Preprint page: 1 - 20 publication: 29th Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: eisbn: - 978-161197503-1 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Dynamic algorithms for graph coloring type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11882' abstract: - lang: eng text: The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability. article_processing_charge: No author: - 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: Noe, Alexander last_name: Noe - first_name: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Darren full_name: Strash, Darren last_name: Strash citation: ama: 'Henzinger MH, Noe A, Schulz C, Strash D. Practical minimum cut algorithms. In: 20th Workshop on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2018:48-61. doi:10.1137/1.9781611975055.5' apa: 'Henzinger, M. H., Noe, A., Schulz, C., & Strash, D. (2018). Practical minimum cut algorithms. In 20th Workshop on Algorithm Engineering and Experiments (pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975055.5' chicago: Henzinger, Monika H, Alexander Noe, Christian Schulz, and Darren Strash. “Practical Minimum Cut Algorithms.” In 20th Workshop on Algorithm Engineering and Experiments, 48–61. Society for Industrial and Applied Mathematics, 2018. https://doi.org/10.1137/1.9781611975055.5. ieee: M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” in 20th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2018, pp. 48–61. ista: 'Henzinger MH, Noe A, Schulz C, Strash D. 2018. Practical minimum cut algorithms. 20th Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 48–61.' mla: Henzinger, Monika H., et al. “Practical Minimum Cut Algorithms.” 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61, doi:10.1137/1.9781611975055.5. short: M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61. conference: end_date: 2018-01-08 location: New Orleans, LA, United States name: 'ALENEX: Symposium on Algorithm Engineering and Experiments' start_date: 2018-01-07 date_created: 2022-08-17T07:04:57Z date_published: 2018-01-01T00:00:00Z date_updated: 2023-02-17T14:03:39Z day: '01' doi: 10.1137/1.9781611975055.5 extern: '1' external_id: arxiv: - '1708.06127' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1708.06127 month: '01' oa: 1 oa_version: Preprint page: 48-61 publication: 20th Workshop on Algorithm Engineering and Experiments publication_identifier: eisbn: - 978-1-61197-505-5 publication_status: published publisher: Society for Industrial and Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Practical minimum cut algorithms type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '11890' abstract: - lang: eng text: "We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph \U0001D43A=(\U0001D449,\U0001D438), with |\U0001D449|=\U0001D45B and |\U0001D438|=\U0001D45A, in \U0001D45C(\U0001D45A‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+\U0001D716) approximation in \U0001D442(log\U0001D45B/\U0001D7162) amortized time per update. For maximum matching, we show how to maintain a (3+\U0001D716) approximation in \U0001D442(min(\U0001D45B√/\U0001D716,\U0001D45A1/3/\U0001D7162) amortized time per update and a (4+\U0001D716) approximation in \U0001D442(\U0001D45A1/3/\U0001D7162) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464]." article_processing_charge: No article_type: original author: - first_name: Sayan full_name: Bhattacharya, Sayan last_name: Bhattacharya - 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: Giuseppe F. full_name: Italiano, Giuseppe F. last_name: Italiano citation: ama: Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 2018;47(3):859-887. doi:10.1137/140998925 apa: Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/140998925 chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2018. https://doi.org/10.1137/140998925. ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” SIAM Journal on Computing, vol. 47, no. 3. Society for Industrial & Applied Mathematics, pp. 859–887, 2018. ista: Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887. mla: Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” SIAM Journal on Computing, vol. 47, no. 3, Society for Industrial & Applied Mathematics, 2018, pp. 859–87, doi:10.1137/140998925. short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887. date_created: 2022-08-17T08:21:23Z date_published: 2018-05-01T00:00:00Z date_updated: 2023-02-21T16:31:30Z day: '01' doi: 10.1137/140998925 extern: '1' external_id: arxiv: - '1412.1318' intvolume: ' 47' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1412.1318 month: '05' oa: 1 oa_version: Preprint page: 859-887 publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial & Applied Mathematics quality_controlled: '1' related_material: record: - id: '11875' relation: earlier_version status: public scopus_import: '1' status: public title: Deterministic fully dynamic data structures for vertex cover and matching type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 47 year: '2018' ... --- _id: '11911' abstract: - lang: eng text: It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time. alternative_title: - LIPIcs article_number: '3' article_processing_charge: No author: - first_name: Sonja full_name: Biedermann, Sonja last_name: Biedermann - 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: Christian full_name: Schulz, Christian last_name: Schulz - first_name: Bernhard full_name: Schuster, Bernhard last_name: Schuster citation: ama: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: 17th International Symposium on Experimental Algorithms. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.SEA.2018.3' apa: 'Biedermann, S., Henzinger, M. H., Schulz, C., & Schuster, B. (2018). Memetic graph clustering. In 17th International Symposium on Experimental Algorithms (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.SEA.2018.3' chicago: Biedermann, Sonja, Monika H Henzinger, Christian Schulz, and Bernhard Schuster. “Memetic Graph Clustering.” In 17th International Symposium on Experimental Algorithms, Vol. 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.SEA.2018.3. ieee: S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103. ista: 'Biedermann S, Henzinger MH, Schulz C, Schuster B. 2018. Memetic graph clustering. 17th International Symposium on Experimental Algorithms. SEA: Symposium on Experimental Algorithms, LIPIcs, vol. 103, 3.' mla: Biedermann, Sonja, et al. “Memetic Graph Clustering.” 17th International Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3. short: S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-07-29 location: L'Aquila, Italy name: 'SEA: Symposium on Experimental Algorithms' start_date: 2018-07-27 date_created: 2022-08-18T06:49:40Z date_published: 2018-07-01T00:00:00Z date_updated: 2023-02-16T11:45:14Z day: '01' doi: 10.4230/LIPICS.SEA.2018.3 extern: '1' external_id: arxiv: - '1802.07034' intvolume: ' 103' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.4230/LIPICS.SEA.2018.3 month: '07' oa: 1 oa_version: Published Version publication: 17th International Symposium on Experimental Algorithms publication_identifier: isbn: - '9783959770705' issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: '1' status: public title: Memetic graph clustering type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 103 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: '176' abstract: - lang: eng text: For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with integer coefficients. article_processing_charge: No article_type: original author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Efthymios full_name: Sofos, Efthymios last_name: Sofos citation: ama: Browning TD, Sofos E. Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. 2018;15(3):547-567. doi:10.1142/S1793042119500283 apa: Browning, T. D., & Sofos, E. (2018). Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. World Scientific Publishing. https://doi.org/10.1142/S1793042119500283 chicago: Browning, Timothy D, and Efthymios Sofos. “Averages of Arithmetic Functions over Principal Ideals.” International Journal of Nuber Theory. World Scientific Publishing, 2018. https://doi.org/10.1142/S1793042119500283. ieee: T. D. Browning and E. Sofos, “Averages of arithmetic functions over principal ideals,” International Journal of Nuber Theory, vol. 15, no. 3. World Scientific Publishing, pp. 547–567, 2018. ista: Browning TD, Sofos E. 2018. Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. 15(3), 547–567. mla: Browning, Timothy D., and Efthymios Sofos. “Averages of Arithmetic Functions over Principal Ideals.” International Journal of Nuber Theory, vol. 15, no. 3, World Scientific Publishing, 2018, pp. 547–67, doi:10.1142/S1793042119500283. short: T.D. Browning, E. Sofos, International Journal of Nuber Theory 15 (2018) 547–567. date_created: 2018-12-11T11:45:01Z date_published: 2018-11-16T00:00:00Z date_updated: 2021-01-12T06:53:01Z day: '16' doi: 10.1142/S1793042119500283 extern: '1' external_id: arxiv: - '1706.04331' intvolume: ' 15' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1706.04331 month: '11' oa: 1 oa_version: Preprint page: 547-567 publication: International Journal of Nuber Theory publication_status: published publisher: World Scientific Publishing status: public title: Averages of arithmetic functions over principal ideals type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 15 year: '2018' ... --- _id: '178' abstract: - lang: eng text: We give an upper bound for the number of rational points of height at most B, lying on a surface defined by a quadratic form Q. The bound shows an explicit dependence on Q. It is optimal with respect to B, and is also optimal for typical forms Q. article_processing_charge: No author: - first_name: Timothy D full_name: Browning, Timothy D id: 35827D50-F248-11E8-B48F-1D18A9856A87 last_name: Browning orcid: 0000-0002-8314-0177 - first_name: Roger full_name: Heath-Brown, Roger last_name: Heath-Brown citation: ama: Browning TD, Heath-Brown R. Counting rational points on quadric surfaces. Discrete Analysis. 2018;15:1-29. doi:10.19086/da.4375 apa: Browning, T. D., & Heath-Brown, R. (2018). Counting rational points on quadric surfaces. Discrete Analysis. Alliance of Diamond Open Access Journals. https://doi.org/10.19086/da.4375 chicago: Browning, Timothy D, and Roger Heath-Brown. “Counting Rational Points on Quadric Surfaces.” Discrete Analysis. Alliance of Diamond Open Access Journals, 2018. https://doi.org/10.19086/da.4375. ieee: T. D. Browning and R. Heath-Brown, “Counting rational points on quadric surfaces,” Discrete Analysis, vol. 15. Alliance of Diamond Open Access Journals, pp. 1–29, 2018. ista: Browning TD, Heath-Brown R. 2018. Counting rational points on quadric surfaces. Discrete Analysis. 15, 1–29. mla: Browning, Timothy D., and Roger Heath-Brown. “Counting Rational Points on Quadric Surfaces.” Discrete Analysis, vol. 15, Alliance of Diamond Open Access Journals, 2018, pp. 1–29, doi:10.19086/da.4375. short: T.D. Browning, R. Heath-Brown, Discrete Analysis 15 (2018) 1–29. date_created: 2018-12-11T11:45:02Z date_published: 2018-09-07T00:00:00Z date_updated: 2022-08-26T09:13:02Z day: '07' ddc: - '512' doi: 10.19086/da.4375 extern: '1' external_id: arxiv: - '1801.00979' intvolume: ' 15' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1801.00979 month: '09' oa: 1 oa_version: Preprint page: 1 - 29 publication: Discrete Analysis publication_identifier: eissn: - 2397-3129 publication_status: published publisher: Alliance of Diamond Open Access Journals quality_controlled: '1' status: public title: Counting rational points on quadric surfaces 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: 15 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: '2015' abstract: - lang: eng text: We consider the problem of learning a Bayesian network or directed acyclic graph model from observational data. A number of constraint‐based, score‐based and hybrid algorithms have been developed for this purpose. Statistical consistency guarantees of these algorithms rely on the faithfulness assumption, which has been shown to be restrictive especially for graphs with cycles in the skeleton. We here propose the sparsest permutation (SP) algorithm, showing that learning Bayesian networks is possible under strictly weaker assumptions than faithfulness. This comes at a computational price, thereby indicating a statistical‐computational trade‐off for causal inference algorithms. In the Gaussian noiseless setting, we prove that the SP algorithm boils down to finding the permutation of the variables with the sparsest Cholesky decomposition of the inverse covariance matrix, which is equivalent to ℓ0‐penalized maximum likelihood estimation. We end with a simulation study showing that in line with the proven stronger consistency guarantees, and the SP algorithm compares favourably to standard causal inference algorithms in terms of accuracy for a given sample size. article_number: e183 article_processing_charge: No article_type: original author: - first_name: Garvesh full_name: Raskutti, Garvesh last_name: Raskutti - first_name: Caroline full_name: Uhler, Caroline id: 49ADD78E-F248-11E8-B48F-1D18A9856A87 last_name: Uhler orcid: 0000-0002-7008-0216 citation: ama: Raskutti G, Uhler C. Learning directed acyclic graphs based on sparsest permutations. STAT. 2018;7(1). doi:10.1002/sta4.183 apa: Raskutti, G., & Uhler, C. (2018). Learning directed acyclic graphs based on sparsest permutations. STAT. Wiley. https://doi.org/10.1002/sta4.183 chicago: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT. Wiley, 2018. https://doi.org/10.1002/sta4.183. ieee: G. Raskutti and C. Uhler, “Learning directed acyclic graphs based on sparsest permutations,” STAT, vol. 7, no. 1. Wiley, 2018. ista: Raskutti G, Uhler C. 2018. Learning directed acyclic graphs based on sparsest permutations. STAT. 7(1), e183. mla: Raskutti, Garvesh, and Caroline Uhler. “Learning Directed Acyclic Graphs Based on Sparsest Permutations.” STAT, vol. 7, no. 1, e183, Wiley, 2018, doi:10.1002/sta4.183. short: G. Raskutti, C. Uhler, STAT 7 (2018). date_created: 2018-12-11T11:55:13Z date_published: 2018-04-17T00:00:00Z date_updated: 2021-01-12T06:54:44Z day: '17' doi: 10.1002/sta4.183 extern: '1' external_id: arxiv: - '1307.0366' intvolume: ' 7' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1307.0366 month: '04' oa: 1 oa_version: Preprint publication: STAT publication_status: published publisher: Wiley publist_id: '5061' quality_controlled: '1' status: public title: Learning directed acyclic graphs based on sparsest permutations type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 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' ... --- _id: '37' abstract: - lang: eng text: Developmental processes are inherently dynamic and understanding them requires quantitative measurements of gene and protein expression levels in space and time. While live imaging is a powerful approach for obtaining such data, it is still a challenge to apply it over long periods of time to large tissues, such as the embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression and signaling activity patterns in this organ can be studied by collecting tissue sections at different developmental stages. In combination with immunohistochemistry, this allows for measuring the levels of multiple developmental regulators in a quantitative manner with high spatiotemporal resolution. The mean protein expression levels over time, as well as embryo-to-embryo variability can be analyzed. A key aspect of the approach is the ability to compare protein levels across different samples. This requires a number of considerations in sample preparation, imaging and data analysis. Here we present a protocol for obtaining time course data of dorsoventral expression patterns from mouse and chick neural tube in the first 3 days of neural tube development. The described workflow starts from embryo dissection and ends with a processed dataset. Software scripts for data analysis are included. The protocol is adaptable and instructions that allow the user to modify different steps are provided. Thus, the procedure can be altered for analysis of time-lapse images and applied to systems other than the neural tube. alternative_title: - Methods in Molecular Biology article_processing_charge: No author: - first_name: Marcin P full_name: Zagórski, Marcin P id: 343DA0DC-F248-11E8-B48F-1D18A9856A87 last_name: Zagórski orcid: 0000-0001-7896-7762 - first_name: Anna full_name: Kicheva, Anna id: 3959A2A0-F248-11E8-B48F-1D18A9856A87 last_name: Kicheva orcid: 0000-0003-4509-4998 citation: ama: 'Zagórski MP, Kicheva A. Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Vol 1863. MIMB. Springer Nature; 2018:47-63. doi:10.1007/978-1-4939-8772-6_4' apa: Zagórski, M. P., & Kicheva, A. (2018). Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In Morphogen Gradients (Vol. 1863, pp. 47–63). Springer Nature. https://doi.org/10.1007/978-1-4939-8772-6_4 chicago: Zagórski, Marcin P, and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” In Morphogen Gradients , 1863:47–63. MIMB. Springer Nature, 2018. https://doi.org/10.1007/978-1-4939-8772-6_4. ieee: M. P. Zagórski and A. Kicheva, “Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube,” in Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63. ista: 'Zagórski MP, Kicheva A. 2018.Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Methods in Molecular Biology, vol. 1863, 47–63.' mla: Zagórski, Marcin P., and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” Morphogen Gradients , vol. 1863, Springer Nature, 2018, pp. 47–63, doi:10.1007/978-1-4939-8772-6_4. short: M.P. Zagórski, A. Kicheva, in:, Morphogen Gradients , Springer Nature, 2018, pp. 47–63. date_created: 2018-12-11T11:44:17Z date_published: 2018-10-16T00:00:00Z date_updated: 2021-01-12T07:49:03Z day: '16' ddc: - '570' department: - _id: AnKi doi: 10.1007/978-1-4939-8772-6_4 ec_funded: 1 file: - access_level: open_access checksum: 2a97d0649fdcfcf1bdca7c8ad1dce71b content_type: application/pdf creator: dernst date_created: 2020-10-13T14:20:37Z date_updated: 2020-10-13T14:20:37Z file_id: '8656' file_name: 2018_MIMB_Zagorski.pdf file_size: 4906815 relation: main_file success: 1 file_date_updated: 2020-10-13T14:20:37Z has_accepted_license: '1' intvolume: ' 1863' language: - iso: eng month: '10' oa: 1 oa_version: Submitted Version page: 47 - 63 project: - _id: B6FC0238-B512-11E9-945C-1524E6697425 call_identifier: H2020 grant_number: '680037' name: Coordination of Patterning And Growth In the Spinal Cord publication: 'Morphogen Gradients ' publication_identifier: isbn: - 978-1-4939-8771-9 issn: - 1064-3745 publication_status: published publisher: Springer Nature publist_id: '8018' quality_controlled: '1' scopus_import: '1' series_title: MIMB status: public title: Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1863 year: '2018' ... --- _id: '325' abstract: - lang: eng text: Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem asks whether a given program program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). Although deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to programs of restricted control-flow structure. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost-sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on benchmarks adapted from previous work to demonstrate the effectiveness of our approach. article_number: '34' author: - first_name: Sheshansh full_name: Agrawal, Sheshansh last_name: Agrawal - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Petr full_name: Novotny, Petr id: 3CC3B868-F248-11E8-B48F-1D18A9856A87 last_name: Novotny citation: ama: 'Agrawal S, Chatterjee K, Novotný P. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. In: Vol 2. ACM; 2018. doi:10.1145/3158122' apa: 'Agrawal, S., Chatterjee, K., & Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/3158122' chicago: 'Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.' ieee: 'S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.' ista: 'Agrawal S, Chatterjee K, Novotný P. 2018. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. POPL: Principles of Programming Languages vol. 2, 34.' mla: 'Agrawal, Sheshansh, et al. Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. Vol. 2, no. POPL, 34, ACM, 2018, doi:10.1145/3158122.' short: S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018. conference: end_date: 2018-01-13 location: Los Angeles, CA, USA name: 'POPL: Principles of Programming Languages' start_date: 2018-01-07 date_created: 2018-12-11T11:45:50Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T07:42:07Z day: '01' department: - _id: KrCh doi: 10.1145/3158122 external_id: arxiv: - '1709.04037' intvolume: ' 2' issue: POPL language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1709.04037 month: '01' oa: 1 oa_version: Preprint project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: ACM publist_id: '7540' quality_controlled: '1' status: public title: 'Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2 year: '2018' ... --- _id: '394' abstract: - lang: eng text: 'The valley pseudospin in monolayer transition metal dichalcogenides (TMDs) has been proposed as a new way to manipulate information in various optoelectronic devices. This relies on a large valley polarization that remains stable over long time scales (hundreds of nanoseconds). However, time-resolved measurements report valley lifetimes of only a few picoseconds. This has been attributed to mechanisms such as phonon-mediated intervalley scattering and a precession of the valley pseudospin through electron-hole exchange. Here we use transient spin grating to directly measure the valley depolarization lifetime in monolayer MoSe2. We find a fast valley decay rate that scales linearly with the excitation density at different temperatures. This establishes the presence of strong exciton-exciton Coulomb exchange interactions enhancing the valley depolarization. Our work highlights the microscopic processes inhibiting the efficient use of the exciton valley pseudospin in monolayer TMDs. ' author: - first_name: Fahad full_name: Mahmood, Fahad last_name: Mahmood - first_name: Zhanybek full_name: Alpichshev, Zhanybek id: 45E67A2A-F248-11E8-B48F-1D18A9856A87 last_name: Alpichshev orcid: 0000-0002-7183-5203 - first_name: Yi full_name: Lee, Yi last_name: Lee - first_name: Jing full_name: Kong, Jing last_name: Kong - first_name: Nuh full_name: Gedik, Nuh last_name: Gedik citation: ama: Mahmood F, Alpichshev Z, Lee Y, Kong J, Gedik N. Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters. 2018;18(1):223-228. doi:10.1021/acs.nanolett.7b03953 apa: Mahmood, F., Alpichshev, Z., Lee, Y., Kong, J., & Gedik, N. (2018). Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.7b03953 chicago: Mahmood, Fahad, Zhanybek Alpichshev, Yi Lee, Jing Kong, and Nuh Gedik. “Observation of Exciton-Exciton Interaction Mediated Valley Depolarization in Monolayer MoSe2.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.7b03953. ieee: F. Mahmood, Z. Alpichshev, Y. Lee, J. Kong, and N. Gedik, “Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2,” Nano Letters, vol. 18, no. 1. American Chemical Society, pp. 223–228, 2018. ista: Mahmood F, Alpichshev Z, Lee Y, Kong J, Gedik N. 2018. Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2. Nano Letters. 18(1), 223–228. mla: Mahmood, Fahad, et al. “Observation of Exciton-Exciton Interaction Mediated Valley Depolarization in Monolayer MoSe2.” Nano Letters, vol. 18, no. 1, American Chemical Society, 2018, pp. 223–28, doi:10.1021/acs.nanolett.7b03953. short: F. Mahmood, Z. Alpichshev, Y. Lee, J. Kong, N. Gedik, Nano Letters 18 (2018) 223–228. date_created: 2018-12-11T11:46:13Z date_published: 2018-01-10T00:00:00Z date_updated: 2021-01-12T07:53:20Z day: '10' doi: 10.1021/acs.nanolett.7b03953 extern: '1' external_id: arxiv: - '1712.07925' intvolume: ' 18' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.07925 month: '01' oa: 1 oa_version: Submitted Version page: 223 - 228 publication: Nano Letters publication_status: published publisher: American Chemical Society publist_id: '7435' quality_controlled: '1' status: public title: Observation of exciton-exciton interaction mediated valley Depolarization in Monolayer MoSe2 type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 18 year: '2018' ... --- _id: '53' abstract: - lang: eng text: In 2013, a publication repository was implemented at IST Austria and 2015 after a thorough preparation phase a data repository was implemented - both based on the Open Source Software EPrints. In this text, designed as field report, we will reflect on our experiences with Open Source Software in general and specifically with EPrints regarding technical aspects but also regarding their characteristics of the user community. The second part is a pleading for including the end users in the process of implementation, adaption and evaluation. author: - first_name: Barbara full_name: Petritsch, Barbara id: 406048EC-F248-11E8-B48F-1D18A9856A87 last_name: Petritsch orcid: 0000-0003-2724-4614 - first_name: Jana full_name: Porsche, Jana id: 3252EDC2-F248-11E8-B48F-1D18A9856A87 last_name: Porsche citation: ama: 'Petritsch B, Porsche J. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 2018;71(1):199-206. doi:10.31263/voebm.v71i1.1993' apa: 'Petritsch, B., & Porsche, J. (2018). IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. https://doi.org/10.31263/voebm.v71i1.1993' chicago: 'Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018. https://doi.org/10.31263/voebm.v71i1.1993.' ieee: 'B. Petritsch and J. Porsche, “IST PubRep and IST DataRep: the institutional repositories at IST Austria,” VÖB Mitteilungen, vol. 71, no. 1. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 199–206, 2018.' ista: 'Petritsch B, Porsche J. 2018. IST PubRep and IST DataRep: the institutional repositories at IST Austria. VÖB Mitteilungen. 71(1), 199–206.' mla: 'Petritsch, Barbara, and Jana Porsche. “IST PubRep and IST DataRep: The Institutional Repositories at IST Austria.” VÖB Mitteilungen, vol. 71, no. 1, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2018, pp. 199–206, doi:10.31263/voebm.v71i1.1993.' short: B. Petritsch, J. Porsche, VÖB Mitteilungen 71 (2018) 199–206. date_created: 2018-12-11T11:44:22Z date_published: 2018-10-01T00:00:00Z date_updated: 2021-01-12T08:01:26Z day: '01' ddc: - '020' department: - _id: E-Lib doi: 10.31263/voebm.v71i1.1993 file: - access_level: open_access checksum: 7ac61bade5f37db011ca435ebcf86797 content_type: application/pdf creator: dernst date_created: 2018-12-17T12:40:27Z date_updated: 2020-07-14T12:46:38Z file_id: '5702' file_name: 2018_VOEB_Petritsch.pdf file_size: 509434 relation: main_file file_date_updated: 2020-07-14T12:46:38Z has_accepted_license: '1' intvolume: ' 71' issue: '1' language: - iso: eng month: '10' oa: 1 oa_version: Published Version page: 199 - 206 publication: VÖB Mitteilungen publication_status: published publisher: Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare publist_id: '8001' scopus_import: 1 status: public title: 'IST PubRep and IST DataRep: the institutional repositories at IST Austria' 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: 71 year: '2018' ... --- _id: '536' abstract: - lang: eng text: 'We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary. We describe a new randomized consensus protocol with expected message complexity O(n2log2n) when fewer than n / 2 processes may fail by crashing. This is an almost-linear improvement over the best previously known protocol, and within logarithmic factors of a known Ω(n2) message lower bound. The protocol further ensures that no process sends more than O(nlog3n) messages in expectation, which is again within logarithmic factors of optimal. We also present a generalization of the algorithm to an arbitrary number of failures t, which uses expected O(nt+t2log2t) total messages. Our approach is to build a message-efficient, resilient mechanism for aggregating individual processor votes, implementing the message-passing equivalent of a weak shared coin. Roughly, in our protocol, a processor first announces its votes to small groups, then propagates them to increasingly larger groups as it generates more and more votes. To bound the number of messages that an individual process might have to send or receive, the protocol progressively increases the weight of generated votes. The main technical challenge is bounding the impact of votes that are still “in flight” (generated, but not fully propagated) on the final outcome of the shared coin, especially since such votes might have different weights. We achieve this by leveraging the structure of the algorithm, and a technical argument based on martingale concentration bounds. Overall, we show that it is possible to build an efficient message-passing implementation of a shared coin, and in the process (almost-optimally) solve the classic consensus problem in the asynchronous message-passing model.' article_processing_charge: Yes (via OA deal) author: - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: James full_name: Aspnes, James last_name: Aspnes - first_name: Valerie full_name: King, Valerie last_name: King - first_name: Jared full_name: Saia, Jared last_name: Saia citation: ama: Alistarh D-A, Aspnes J, King V, Saia J. Communication-efficient randomized consensus. Distributed Computing. 2018;31(6):489-501. doi:10.1007/s00446-017-0315-1 apa: Alistarh, D.-A., Aspnes, J., King, V., & Saia, J. (2018). Communication-efficient randomized consensus. Distributed Computing. Springer. https://doi.org/10.1007/s00446-017-0315-1 chicago: Alistarh, Dan-Adrian, James Aspnes, Valerie King, and Jared Saia. “Communication-Efficient Randomized Consensus.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-017-0315-1. ieee: D.-A. Alistarh, J. Aspnes, V. King, and J. Saia, “Communication-efficient randomized consensus,” Distributed Computing, vol. 31, no. 6. Springer, pp. 489–501, 2018. ista: Alistarh D-A, Aspnes J, King V, Saia J. 2018. Communication-efficient randomized consensus. Distributed Computing. 31(6), 489–501. mla: Alistarh, Dan-Adrian, et al. “Communication-Efficient Randomized Consensus.” Distributed Computing, vol. 31, no. 6, Springer, 2018, pp. 489–501, doi:10.1007/s00446-017-0315-1. short: D.-A. Alistarh, J. Aspnes, V. King, J. Saia, Distributed Computing 31 (2018) 489–501. date_created: 2018-12-11T11:47:01Z date_published: 2018-11-01T00:00:00Z date_updated: 2023-02-23T12:23:25Z day: '01' ddc: - '000' department: - _id: DaAl doi: 10.1007/s00446-017-0315-1 file: - access_level: open_access checksum: 69b46e537acdcac745237ddb853fcbb5 content_type: application/pdf creator: dernst date_created: 2019-01-22T07:25:51Z date_updated: 2020-07-14T12:46:38Z file_id: '5867' file_name: 2017_DistribComp_Alistarh.pdf file_size: 595707 relation: main_file file_date_updated: 2020-07-14T12:46:38Z has_accepted_license: '1' intvolume: ' 31' issue: '6' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: 489-501 project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Distributed Computing publication_identifier: issn: - '01782770' publication_status: published publisher: Springer publist_id: '7281' quality_controlled: '1' scopus_import: 1 status: public title: Communication-efficient randomized consensus 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: '554' abstract: - lang: eng text: We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.). author: - first_name: Marcin M full_name: Napiórkowski, Marcin M id: 4197AD04-F248-11E8-B48F-1D18A9856A87 last_name: Napiórkowski - first_name: Robin full_name: Reuvers, Robin last_name: Reuvers - first_name: Jan full_name: Solovej, Jan last_name: Solovej citation: ama: 'Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 2018;360(1):347-403. doi:10.1007/s00220-017-3064-x' apa: 'Napiórkowski, M. M., Reuvers, R., & Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-017-3064-x' chicago: 'Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics. Springer, 2018. https://doi.org/10.1007/s00220-017-3064-x.' ieee: 'M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” Communications in Mathematical Physics, vol. 360, no. 1. Springer, pp. 347–403, 2018.' ista: 'Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.' mla: 'Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” Communications in Mathematical Physics, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:10.1007/s00220-017-3064-x.' short: M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403. date_created: 2018-12-11T11:47:09Z date_published: 2018-05-01T00:00:00Z date_updated: 2021-01-12T08:02:35Z day: '01' department: - _id: RoSe doi: 10.1007/s00220-017-3064-x external_id: arxiv: - '1511.05953' intvolume: ' 360' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1511.05953 month: '05' oa: 1 oa_version: Submitted Version page: 347-403 project: - _id: 25C878CE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: P27533_N27 name: Structure of the Excitation Spectrum for Many-Body Quantum Systems publication: Communications in Mathematical Physics publication_identifier: issn: - '00103616' publication_status: published publisher: Springer publist_id: '7260' quality_controlled: '1' scopus_import: 1 status: public title: 'The Bogoliubov free energy functional II: The dilute Limit' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 360 year: '2018' ... --- _id: '562' abstract: - lang: eng text: Primary neuronal cell culture preparations are widely used to investigate synaptic functions. This chapter describes a detailed protocol for the preparation of a neuronal cell culture in which giant calyx-type synaptic terminals are formed. This chapter also presents detailed protocols for utilizing the main technical advantages provided by such a preparation, namely, labeling and imaging of synaptic organelles and electrophysiological recordings directly from presynaptic terminals. alternative_title: - Methods in Molecular Biology article_processing_charge: No author: - first_name: Dimitar full_name: Dimitrov, Dimitar last_name: Dimitrov - first_name: Laurent full_name: Guillaud, Laurent last_name: Guillaud - first_name: Kohgaku full_name: Eguchi, Kohgaku id: 2B7846DC-F248-11E8-B48F-1D18A9856A87 last_name: Eguchi orcid: 0000-0002-6170-2546 - first_name: Tomoyuki full_name: Takahashi, Tomoyuki last_name: Takahashi citation: ama: 'Dimitrov D, Guillaud L, Eguchi K, Takahashi T. Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Skaper SD, ed. Neurotrophic Factors. Vol 1727. Springer; 2018:201-215. doi:10.1007/978-1-4939-7571-6_15' apa: Dimitrov, D., Guillaud, L., Eguchi, K., & Takahashi, T. (2018). Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In S. D. Skaper (Ed.), Neurotrophic Factors (Vol. 1727, pp. 201–215). Springer. https://doi.org/10.1007/978-1-4939-7571-6_15 chicago: Dimitrov, Dimitar, Laurent Guillaud, Kohgaku Eguchi, and Tomoyuki Takahashi. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” In Neurotrophic Factors, edited by Stephen D. Skaper, 1727:201–15. Springer, 2018. https://doi.org/10.1007/978-1-4939-7571-6_15. ieee: D. Dimitrov, L. Guillaud, K. Eguchi, and T. Takahashi, “Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses,” in Neurotrophic Factors, vol. 1727, S. D. Skaper, Ed. Springer, 2018, pp. 201–215. ista: 'Dimitrov D, Guillaud L, Eguchi K, Takahashi T. 2018.Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses. In: Neurotrophic Factors. Methods in Molecular Biology, vol. 1727, 201–215.' mla: Dimitrov, Dimitar, et al. “Culture of Mouse Giant Central Nervous System Synapses and Application for Imaging and Electrophysiological Analyses.” Neurotrophic Factors, edited by Stephen D. Skaper, vol. 1727, Springer, 2018, pp. 201–15, doi:10.1007/978-1-4939-7571-6_15. short: D. Dimitrov, L. Guillaud, K. Eguchi, T. Takahashi, in:, S.D. Skaper (Ed.), Neurotrophic Factors, Springer, 2018, pp. 201–215. date_created: 2018-12-11T11:47:11Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T08:03:05Z day: '01' ddc: - '570' department: - _id: RySh doi: 10.1007/978-1-4939-7571-6_15 editor: - first_name: Stephen D. full_name: Skaper, Stephen D. last_name: Skaper external_id: pmid: - '29222783' file: - access_level: open_access checksum: 8aa174ca65a56fbb19e9f88cff3ac3fd content_type: application/pdf creator: dernst date_created: 2019-11-19T07:47:43Z date_updated: 2020-07-14T12:47:09Z file_id: '7046' file_name: 2018_NeurotrophicFactors_Dimitrov.pdf file_size: 787407 relation: main_file file_date_updated: 2020-07-14T12:47:09Z has_accepted_license: '1' intvolume: ' 1727' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 201 - 215 pmid: 1 publication: Neurotrophic Factors publication_status: published publisher: Springer publist_id: '7252' quality_controlled: '1' scopus_import: 1 status: public title: Culture of mouse giant central nervous system synapses and application for imaging and electrophysiological analyses type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 1727 year: '2018' ... --- _id: '61' abstract: - lang: eng text: 'We prove that there is no strongly regular graph (SRG) with parameters (460; 153; 32; 60). The proof is based on a recent lower bound on the number of 4-cliques in a SRG and some applications of Euclidean representation of SRGs. ' article_processing_charge: No author: - first_name: Andriy full_name: Bondarenko, Andriy last_name: Bondarenko - first_name: Anton full_name: Mellit, Anton id: 388D3134-F248-11E8-B48F-1D18A9856A87 last_name: Mellit - first_name: Andriy full_name: Prymak, Andriy last_name: Prymak - first_name: Danylo full_name: Radchenko, Danylo last_name: Radchenko - first_name: Maryna full_name: Viazovska, Maryna last_name: Viazovska citation: ama: 'Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. Springer; 2018:131-134. doi:10.1007/978-3-319-72456-0_7' apa: Bondarenko, A., Mellit, A., Prymak, A., Radchenko, D., & Viazovska, M. (2018). There is no strongly regular graph with parameters (460; 153; 32; 60). In Contemporary Computational Mathematics (pp. 131–134). Springer. https://doi.org/10.1007/978-3-319-72456-0_7 chicago: Bondarenko, Andriy, Anton Mellit, Andriy Prymak, Danylo Radchenko, and Maryna Viazovska. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” In Contemporary Computational Mathematics, 131–34. Springer, 2018. https://doi.org/10.1007/978-3-319-72456-0_7. ieee: A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, and M. Viazovska, “There is no strongly regular graph with parameters (460; 153; 32; 60),” in Contemporary Computational Mathematics, Springer, 2018, pp. 131–134. ista: 'Bondarenko A, Mellit A, Prymak A, Radchenko D, Viazovska M. 2018.There is no strongly regular graph with parameters (460; 153; 32; 60). In: Contemporary Computational Mathematics. , 131–134.' mla: Bondarenko, Andriy, et al. “There Is No Strongly Regular Graph with Parameters (460; 153; 32; 60).” Contemporary Computational Mathematics, Springer, 2018, pp. 131–34, doi:10.1007/978-3-319-72456-0_7. short: A. Bondarenko, A. Mellit, A. Prymak, D. Radchenko, M. Viazovska, in:, Contemporary Computational Mathematics, Springer, 2018, pp. 131–134. date_created: 2018-12-11T11:44:25Z date_published: 2018-05-23T00:00:00Z date_updated: 2021-01-12T08:06:06Z day: '23' department: - _id: TaHa doi: 10.1007/978-3-319-72456-0_7 extern: '1' external_id: arxiv: - '1509.06286' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1509.06286 month: '05' oa: 1 oa_version: Preprint page: 131 - 134 publication: Contemporary Computational Mathematics publication_status: published publisher: Springer publist_id: '7993' quality_controlled: '1' status: public title: There is no strongly regular graph with parameters (460; 153; 32; 60) type: book_chapter user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '6111' abstract: - lang: eng text: 'Neurons develop elaborate morphologies that provide a model for understanding cellular architecture. By studying C. elegans sensory dendrites, we previously identified genes that act to promote the extension of ciliated sensory dendrites during embryogenesis. Interestingly, the nonciliated dendrite of the oxygen-sensing neuron URX is not affected by these genes, suggesting it develops through a distinct mechanism. Here, we use a visual forward genetic screen to identify mutants that affect URX dendrite morphogenesis. We find that disruption of the MAP kinase MAPK-15 or the βH-spectrin SMA-1 causes a phenotype opposite to what we had seen before: dendrites extend normally during embryogenesis but begin to overgrow as the animals reach adulthood, ultimately extending up to 150% of their normal length. SMA-1 is broadly expressed and acts non-cell-autonomously, while MAPK-15 is expressed in many sensory neurons including URX and acts cell-autonomously. MAPK-15 acts at the time of overgrowth, localizes at the dendrite ending, and requires its kinase activity, suggesting it acts locally in time and space to constrain dendrite growth. Finally, we find that the oxygen-sensing guanylate cyclase GCY-35, which normally localizes at the dendrite ending, is localized throughout the overgrown region, and that overgrowth can be suppressed by overexpressing GCY-35 or by genetically mimicking elevated cGMP signaling. These results suggest that overgrowth may correspond to expansion of a sensory compartment at the dendrite ending, reminiscent of the remodeling of sensory cilia or dendritic spines. Thus, in contrast to established pathways that promote dendrite growth during early development, our results reveal a distinct mechanism that constrains dendrite growth throughout the life of the animal, possibly by controlling the size of a sensory compartment at the dendrite ending.' article_number: e1007435 author: - first_name: Ian G. full_name: McLachlan, Ian G. last_name: McLachlan - first_name: Isabel full_name: Beets, Isabel last_name: Beets - first_name: Mario full_name: de Bono, Mario id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87 last_name: de Bono orcid: 0000-0001-8347-0443 - first_name: Maxwell G. full_name: Heiman, Maxwell G. last_name: Heiman citation: ama: McLachlan IG, Beets I, de Bono M, Heiman MG. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. 2018;14(6). doi:10.1371/journal.pgen.1007435 apa: McLachlan, I. G., Beets, I., de Bono, M., & Heiman, M. G. (2018). A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1007435 chicago: McLachlan, Ian G., Isabel Beets, Mario de Bono, and Maxwell G. Heiman. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” PLOS Genetics. Public Library of Science, 2018. https://doi.org/10.1371/journal.pgen.1007435. ieee: I. G. McLachlan, I. Beets, M. de Bono, and M. G. Heiman, “A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism,” PLOS Genetics, vol. 14, no. 6. Public Library of Science, 2018. ista: McLachlan IG, Beets I, de Bono M, Heiman MG. 2018. A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism. PLOS Genetics. 14(6), e1007435. mla: McLachlan, Ian G., et al. “A Neuronal MAP Kinase Constrains Growth of a Caenorhabditis Elegans Sensory Dendrite throughout the Life of the Organism.” PLOS Genetics, vol. 14, no. 6, e1007435, Public Library of Science, 2018, doi:10.1371/journal.pgen.1007435. short: I.G. McLachlan, I. Beets, M. de Bono, M.G. Heiman, PLOS Genetics 14 (2018). date_created: 2019-03-19T13:09:28Z date_published: 2018-06-07T00:00:00Z date_updated: 2021-01-12T08:06:11Z day: '07' ddc: - '570' doi: 10.1371/journal.pgen.1007435 extern: '1' external_id: pmid: - '29879119' file: - access_level: open_access checksum: 622036b945365dbc575bea2768aa9bc8 content_type: application/pdf creator: kschuh date_created: 2019-03-19T13:18:01Z date_updated: 2020-07-14T12:47:19Z file_id: '6112' file_name: 2018_PLOS_McLachlan.pdf file_size: 13011506 relation: main_file file_date_updated: 2020-07-14T12:47:19Z has_accepted_license: '1' intvolume: ' 14' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version pmid: 1 publication: PLOS Genetics publication_identifier: issn: - 1553-7404 publication_status: published publisher: Public Library of Science quality_controlled: '1' status: public title: A neuronal MAP kinase constrains growth of a Caenorhabditis elegans sensory dendrite throughout the life of the organism 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: 14 year: '2018' ... --- _id: '6109' abstract: - lang: eng text: Neuropeptides are ubiquitous modulators of behavior and physiology. They are packaged in specialized secretory organelles called dense core vesicles (DCVs) that are released upon neural stimulation. Unlike synaptic vesicles, which can be recycled and refilled close to release sites, DCVs must be replenished by de novo synthesis in the cell body. Here, we dissect DCV cell biology in vivo in a Caenorhabditis elegans sensory neuron whose tonic activity we can control using a natural stimulus. We express fluorescently tagged neuropeptides in the neuron and define parameters that describe their subcellular distribution. We measure these parameters at high and low neural activity in 187 mutants defective in proteins implicated in membrane traffic, neuroendocrine secretion, and neuronal or synaptic activity. Using unsupervised hierarchical clustering methods, we analyze these data and identify 62 groups of genes with similar mutant phenotypes. We explore the function of a subset of these groups. We recapitulate many previous findings, validating our paradigm. We uncover a large battery of proteins involved in recycling DCV membrane proteins, something hitherto poorly explored. We show that the unfolded protein response promotes DCV production, which may contribute to intertissue communication of stress. We also find evidence that different mechanisms of priming and exocytosis may operate at high and low neural activity. Our work provides a defined framework to study DCV biology at different neural activity levels. author: - first_name: Patrick full_name: Laurent, Patrick last_name: Laurent - first_name: QueeLim full_name: Ch’ng, QueeLim last_name: Ch’ng - first_name: Maëlle full_name: Jospin, Maëlle last_name: Jospin - first_name: Changchun full_name: Chen, Changchun last_name: Chen - first_name: Ramiro full_name: Lorenzo, Ramiro last_name: Lorenzo - first_name: Mario full_name: de Bono, Mario id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87 last_name: de Bono orcid: 0000-0001-8347-0443 citation: ama: Laurent P, Ch’ng Q, Jospin M, Chen C, Lorenzo R, de Bono M. Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. Proceedings of the National Academy of Sciences. 2018;115(29):E6890-E6899. doi:10.1073/pnas.1714610115 apa: Laurent, P., Ch’ng, Q., Jospin, M., Chen, C., Lorenzo, R., & de Bono, M. (2018). Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.1714610115 chicago: Laurent, Patrick, QueeLim Ch’ng, Maëlle Jospin, Changchun Chen, Ramiro Lorenzo, and Mario de Bono. “Genetic Dissection of Neuropeptide Cell Biology at High and Low Activity in a Defined Sensory Neuron.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1714610115. ieee: P. Laurent, Q. Ch’ng, M. Jospin, C. Chen, R. Lorenzo, and M. de Bono, “Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron,” Proceedings of the National Academy of Sciences, vol. 115, no. 29. National Academy of Sciences, pp. E6890–E6899, 2018. ista: Laurent P, Ch’ng Q, Jospin M, Chen C, Lorenzo R, de Bono M. 2018. Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron. Proceedings of the National Academy of Sciences. 115(29), E6890–E6899. mla: Laurent, Patrick, et al. “Genetic Dissection of Neuropeptide Cell Biology at High and Low Activity in a Defined Sensory Neuron.” Proceedings of the National Academy of Sciences, vol. 115, no. 29, National Academy of Sciences, 2018, pp. E6890–99, doi:10.1073/pnas.1714610115. short: P. Laurent, Q. Ch’ng, M. Jospin, C. Chen, R. Lorenzo, M. de Bono, Proceedings of the National Academy of Sciences 115 (2018) E6890–E6899. date_created: 2019-03-19T12:41:33Z date_published: 2018-07-17T00:00:00Z date_updated: 2021-01-12T08:06:09Z day: '17' ddc: - '570' doi: 10.1073/pnas.1714610115 extern: '1' external_id: pmid: - '29959203' file: - access_level: open_access checksum: 5e81665377441cdd8d99ab952c534319 content_type: application/pdf creator: kschuh date_created: 2019-03-19T13:01:58Z date_updated: 2020-07-14T12:47:19Z file_id: '6110' file_name: 2018_PNAS_Laurent.pdf file_size: 1567765 relation: main_file file_date_updated: 2020-07-14T12:47:19Z has_accepted_license: '1' intvolume: ' 115' issue: '29' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: E6890-E6899 pmid: 1 publication: Proceedings of the National Academy of Sciences publication_identifier: issn: - 0027-8424 - 1091-6490 publication_status: published publisher: National Academy of Sciences quality_controlled: '1' status: public title: Genetic dissection of neuropeptide cell biology at high and low activity in a defined sensory neuron tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 115 year: '2018' ... --- _id: '6354' abstract: - lang: eng text: Blood platelets are critical for hemostasis and thrombosis, but also play diverse roles during immune responses. We have recently reported that platelets migrate at sites of infection in vitro and in vivo. Importantly, platelets use their ability to migrate to collect and bundle fibrin (ogen)-bound bacteria accomplishing efficient intravascular bacterial trapping. Here, we describe a method that allows analyzing platelet migration in vitro, focusing on their ability to collect bacteria and trap bacteria under flow. acknowledgement: ' FöFoLe project 947 (F.G.), the Friedrich-Baur-Stiftung project 41/16 (F.G.)' article_number: e3018 author: - first_name: Shuxia full_name: Fan, Shuxia last_name: Fan - first_name: Michael full_name: Lorenz, Michael last_name: Lorenz - first_name: Steffen full_name: Massberg, Steffen last_name: Massberg - first_name: Florian R full_name: Gärtner, Florian R id: 397A88EE-F248-11E8-B48F-1D18A9856A87 last_name: Gärtner orcid: 0000-0001-6120-3723 citation: ama: Fan S, Lorenz M, Massberg S, Gärtner FR. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 2018;8(18). doi:10.21769/bioprotoc.3018 apa: Fan, S., Lorenz, M., Massberg, S., & Gärtner, F. R. (2018). Platelet migration and bacterial trapping assay under flow. Bio-Protocol. Bio-Protocol. https://doi.org/10.21769/bioprotoc.3018 chicago: Fan, Shuxia, Michael Lorenz, Steffen Massberg, and Florian R Gärtner. “Platelet Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol. Bio-Protocol, 2018. https://doi.org/10.21769/bioprotoc.3018. ieee: S. Fan, M. Lorenz, S. Massberg, and F. R. Gärtner, “Platelet migration and bacterial trapping assay under flow,” Bio-Protocol, vol. 8, no. 18. Bio-Protocol, 2018. ista: Fan S, Lorenz M, Massberg S, Gärtner FR. 2018. Platelet migration and bacterial trapping assay under flow. Bio-Protocol. 8(18), e3018. mla: Fan, Shuxia, et al. “Platelet Migration and Bacterial Trapping Assay under Flow.” Bio-Protocol, vol. 8, no. 18, e3018, Bio-Protocol, 2018, doi:10.21769/bioprotoc.3018. short: S. Fan, M. Lorenz, S. Massberg, F.R. Gärtner, Bio-Protocol 8 (2018). date_created: 2019-04-29T09:40:33Z date_published: 2018-09-20T00:00:00Z date_updated: 2021-01-12T08:07:12Z day: '20' ddc: - '570' department: - _id: MiSi doi: 10.21769/bioprotoc.3018 ec_funded: 1 file: - access_level: open_access checksum: d4588377e789da7f360b553ae02c5119 content_type: application/pdf creator: dernst date_created: 2019-04-30T08:04:33Z date_updated: 2020-07-14T12:47:28Z file_id: '6360' file_name: 2018_BioProtocol_Fan.pdf file_size: 2928337 relation: main_file file_date_updated: 2020-07-14T12:47:28Z has_accepted_license: '1' intvolume: ' 8' issue: '18' keyword: - Platelets - Cell migration - Bacteria - Shear flow - Fibrinogen - E. coli language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: 260AA4E2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '747687' name: Mechanical Adaptation of Lamellipodial Actin Networks in Migrating Cells publication: Bio-Protocol publication_identifier: issn: - 2331-8325 publication_status: published publisher: Bio-Protocol quality_controlled: '1' status: public title: Platelet migration and bacterial trapping assay under flow 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: 8 year: '2018' ... --- _id: '6368' abstract: - lang: eng text: An optical network of superconducting quantum bits (qubits) is an appealing platform for quantum communication and distributed quantum computing, but developing a quantum-compatible link between the microwave and optical domains remains an outstanding challenge. Operating at T < 100 mK temperatures, as required for quantum electrical circuits, we demonstrate a mechanically mediated microwave–optical converter with 47% conversion efficiency, and use a classical feed-forward protocol to reduce added noise to 38 photons. The feed-forward protocol harnesses our discovery that noise emitted from the two converter output ports is strongly correlated because both outputs record thermal motion of the same mechanical mode. We also discuss a quantum feed-forward protocol that, given high system efficiencies, would allow quantum information to be transferred even when thermal phonons enter the mechanical element faster than the electro-optic conversion rate. author: - first_name: Andrew P full_name: Higginbotham, Andrew P id: 4AD6785A-F248-11E8-B48F-1D18A9856A87 last_name: Higginbotham orcid: 0000-0003-2607-2363 - first_name: P. S. full_name: Burns, P. S. last_name: Burns - first_name: M. D. full_name: Urmey, M. D. last_name: Urmey - first_name: R. W. full_name: Peterson, R. W. last_name: Peterson - first_name: N. S. full_name: Kampel, N. S. last_name: Kampel - first_name: B. M. full_name: Brubaker, B. M. last_name: Brubaker - first_name: G. full_name: Smith, G. last_name: Smith - first_name: K. W. full_name: Lehnert, K. W. last_name: Lehnert - first_name: C. A. full_name: Regal, C. A. last_name: Regal citation: ama: Higginbotham AP, Burns PS, Urmey MD, et al. Harnessing electro-optic correlations in an efficient mechanical converter. Nature Physics. 2018;14(10):1038-1042. doi:10.1038/s41567-018-0210-0 apa: Higginbotham, A. P., Burns, P. S., Urmey, M. D., Peterson, R. W., Kampel, N. S., Brubaker, B. M., … Regal, C. A. (2018). Harnessing electro-optic correlations in an efficient mechanical converter. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-018-0210-0 chicago: Higginbotham, Andrew P, P. S. Burns, M. D. Urmey, R. W. Peterson, N. S. Kampel, B. M. Brubaker, G. Smith, K. W. Lehnert, and C. A. Regal. “Harnessing Electro-Optic Correlations in an Efficient Mechanical Converter.” Nature Physics. Springer Nature, 2018. https://doi.org/10.1038/s41567-018-0210-0. ieee: A. P. Higginbotham et al., “Harnessing electro-optic correlations in an efficient mechanical converter,” Nature Physics, vol. 14, no. 10. Springer Nature, pp. 1038–1042, 2018. ista: Higginbotham AP, Burns PS, Urmey MD, Peterson RW, Kampel NS, Brubaker BM, Smith G, Lehnert KW, Regal CA. 2018. Harnessing electro-optic correlations in an efficient mechanical converter. Nature Physics. 14(10), 1038–1042. mla: Higginbotham, Andrew P., et al. “Harnessing Electro-Optic Correlations in an Efficient Mechanical Converter.” Nature Physics, vol. 14, no. 10, Springer Nature, 2018, pp. 1038–42, doi:10.1038/s41567-018-0210-0. short: A.P. Higginbotham, P.S. Burns, M.D. Urmey, R.W. Peterson, N.S. Kampel, B.M. Brubaker, G. Smith, K.W. Lehnert, C.A. Regal, Nature Physics 14 (2018) 1038–1042. date_created: 2019-05-03T09:17:20Z date_published: 2018-10-01T00:00:00Z date_updated: 2021-01-12T08:07:15Z day: '01' doi: 10.1038/s41567-018-0210-0 extern: '1' external_id: arxiv: - '1712.06535' intvolume: ' 14' issue: '10' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1712.06535 month: '10' oa: 1 oa_version: Preprint page: 1038-1042 publication: Nature Physics publication_identifier: issn: - 1745-2473 - 1745-2481 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Harnessing electro-optic correlations in an efficient mechanical converter type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 14 year: '2018' ... --- _id: '6369' abstract: - lang: eng text: We construct a metamaterial from radio-frequency harmonic oscillators, and find two topologically distinct phases resulting from dissipation engineered into the system. These phases are distinguished by a quantized value of bulk energy transport. The impulse response of our circuit is measured and used to reconstruct the band structure and winding number of circuit eigenfunctions around a dark mode. Our results demonstrate that dissipative topological transport can occur in a wider class of physical systems than considered before. article_number: '220301' author: - first_name: Eric I. full_name: Rosenthal, Eric I. last_name: Rosenthal - first_name: Nicole K. full_name: Ehrlich, Nicole K. last_name: Ehrlich - first_name: Mark S. full_name: Rudner, Mark S. last_name: Rudner - first_name: Andrew P full_name: Higginbotham, Andrew P id: 4AD6785A-F248-11E8-B48F-1D18A9856A87 last_name: Higginbotham orcid: 0000-0003-2607-2363 - first_name: K. W. full_name: Lehnert, K. W. last_name: Lehnert citation: ama: Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. Topological phase transition measured in a dissipative metamaterial. Physical Review B. 2018;97(22). doi:10.1103/physrevb.97.220301 apa: Rosenthal, E. I., Ehrlich, N. K., Rudner, M. S., Higginbotham, A. P., & Lehnert, K. W. (2018). Topological phase transition measured in a dissipative metamaterial. Physical Review B. American Physical Society (APS). https://doi.org/10.1103/physrevb.97.220301 chicago: Rosenthal, Eric I., Nicole K. Ehrlich, Mark S. Rudner, Andrew P Higginbotham, and K. W. Lehnert. “Topological Phase Transition Measured in a Dissipative Metamaterial.” Physical Review B. American Physical Society (APS), 2018. https://doi.org/10.1103/physrevb.97.220301. ieee: E. I. Rosenthal, N. K. Ehrlich, M. S. Rudner, A. P. Higginbotham, and K. W. Lehnert, “Topological phase transition measured in a dissipative metamaterial,” Physical Review B, vol. 97, no. 22. American Physical Society (APS), 2018. ista: Rosenthal EI, Ehrlich NK, Rudner MS, Higginbotham AP, Lehnert KW. 2018. Topological phase transition measured in a dissipative metamaterial. Physical Review B. 97(22), 220301. mla: Rosenthal, Eric I., et al. “Topological Phase Transition Measured in a Dissipative Metamaterial.” Physical Review B, vol. 97, no. 22, 220301, American Physical Society (APS), 2018, doi:10.1103/physrevb.97.220301. short: E.I. Rosenthal, N.K. Ehrlich, M.S. Rudner, A.P. Higginbotham, K.W. Lehnert, Physical Review B 97 (2018). date_created: 2019-05-03T09:29:49Z date_published: 2018-06-04T00:00:00Z date_updated: 2021-01-12T08:07:16Z day: '04' doi: 10.1103/physrevb.97.220301 extern: '1' external_id: arxiv: - '1802.02243' intvolume: ' 97' issue: '22' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1802.02243 month: '06' oa: 1 oa_version: Preprint publication: Physical Review B publication_identifier: issn: - 2469-9950 - 2469-9969 publication_status: published publisher: American Physical Society (APS) quality_controlled: '1' status: public title: Topological phase transition measured in a dissipative metamaterial type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 97 year: '2018' ... --- _id: '6459' author: - first_name: Barbara full_name: Petritsch, Barbara id: 406048EC-F248-11E8-B48F-1D18A9856A87 last_name: Petritsch orcid: 0000-0003-2724-4614 citation: ama: Petritsch B. Open Access at IST Austria 2009-2017. IST Austria; 2018. doi:10.5281/zenodo.1410279 apa: 'Petritsch, B. (2018). Open Access at IST Austria 2009-2017. Presented at the Open-Access-Tage, Graz, Austria: IST Austria. https://doi.org/10.5281/zenodo.1410279' chicago: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018. https://doi.org/10.5281/zenodo.1410279. ieee: B. Petritsch, Open Access at IST Austria 2009-2017. IST Austria, 2018. ista: Petritsch B. 2018. Open Access at IST Austria 2009-2017, IST Austria,p. mla: Petritsch, Barbara. Open Access at IST Austria 2009-2017. IST Austria, 2018, doi:10.5281/zenodo.1410279. short: B. Petritsch, Open Access at IST Austria 2009-2017, IST Austria, 2018. conference: end_date: 2018-09-26 location: Graz, Austria name: Open-Access-Tage start_date: 2018-09-24 date_created: 2019-05-16T07:27:14Z date_published: 2018-09-24T00:00:00Z date_updated: 2020-07-14T23:06:21Z day: '24' ddc: - '020' department: - _id: E-Lib doi: 10.5281/zenodo.1410279 file: - access_level: open_access checksum: 9063ab4d10ea93353c3a03bbf53fbcf1 content_type: application/pdf creator: dernst date_created: 2019-05-16T07:26:25Z date_updated: 2020-07-14T12:47:30Z file_id: '6460' file_name: Poster_Beitrag_125_Petritsch.pdf file_size: 1967778 relation: main_file file_date_updated: 2020-07-14T12:47:30Z has_accepted_license: '1' keyword: - Open Access - Publication Analysis language: - iso: eng month: '09' oa: 1 oa_version: Published Version publication_status: published publisher: IST Austria status: public title: Open Access at IST Austria 2009-2017 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_poster user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '6664' abstract: - lang: eng text: Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes. Using the symmetric group of RM and polar codes, the specific decoding algorithm can be carried out on multiple permutations of the factor graph to boost the error-correction performance. However, this approach results in high decoding complexity. In this paper, we first derive the total number of factor graph permutations on which the decoding can be performed. We further propose a successive permutation (SP) scheme which finds the permutations on the fly, thus the decoding always progresses on a single factor graph permutation. We show that SP can be used to improve the error-correction performance of RM and polar codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping the memory requirements of the decoders unaltered. Our results for RM and polar codes of length 128 and rate 0.5 show that when SP is used and at a target frame error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for RM and polar codes respectively. author: - first_name: Seyyed Ali full_name: Hashemi, Seyyed Ali last_name: Hashemi - first_name: Nghia full_name: Doan, Nghia last_name: Doan - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: 'Warren ' full_name: 'Gross, Warren ' last_name: Gross citation: ama: 'Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes by successive factor graph permutations. In: 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing. IEEE; 2018:1-5. doi:10.1109/istc.2018.8625281' apa: 'Hashemi, S. A., Doan, N., Mondelli, M., & Gross, W. (2018). Decoding Reed-Muller and polar codes by successive factor graph permutations. In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (pp. 1–5). Hong Kong, China: IEEE. https://doi.org/10.1109/istc.2018.8625281' chicago: Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren Gross. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, 1–5. IEEE, 2018. https://doi.org/10.1109/istc.2018.8625281. ieee: S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and polar codes by successive factor graph permutations,” in 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, Hong Kong, China, 2018, pp. 1–5. ista: 'Hashemi SA, Doan N, Mondelli M, Gross W. 2018. Decoding Reed-Muller and polar codes by successive factor graph permutations. 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing. ISTC: Symposium on Turbo Codes & Iterative Information Processing, 1–5.' mla: Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5, doi:10.1109/istc.2018.8625281. short: S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5. conference: end_date: 2018-12-07 location: Hong Kong, China name: 'ISTC: Symposium on Turbo Codes & Iterative Information Processing' start_date: 2018-12-03 date_created: 2019-07-23T09:12:43Z date_published: 2018-12-01T00:00:00Z date_updated: 2021-01-12T08:08:29Z day: '01' doi: 10.1109/istc.2018.8625281 extern: '1' external_id: arxiv: - '1807.03912' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1807.03912 month: '12' oa: 1 oa_version: Preprint page: 1-5 publication: 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing publication_status: published publisher: IEEE quality_controlled: '1' status: public title: Decoding Reed-Muller and polar codes by successive factor graph permutations type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '6728' abstract: - lang: eng text: Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications. However, the error-correction performance of polar codes under BP decoding is far from the requirements of 5G. It has been shown that the error-correction performance of BP can be improved if the decoding is performed on multiple permuted factor graphs of polar codes. However, a different BP decoding scheduling is required for each factor graph permutation which results in the design of a different decoder for each permutation. Moreover, the selection of the different factor graph permutations is at random, which prevents the decoder to achieve a desirable error correction performance with a small number of permutations. In this paper, we first show that the permutations on the factor graph can be mapped into suitable permutations on the codeword positions. As a result, we can make use of a single decoder for all the permutations. In addition, we introduce a method to construct a set of predetermined permutations which can provide the correct codeword if the decoding fails on the original permutation. We show that for the 5G polar code of length 1024, the error-correction performance of the proposed decoder is more than 0.25 dB better than that of the BP decoder with the same number of random permutations at the frame error rate of 10 -4 . author: - first_name: Nghia full_name: Doan, Nghia last_name: Doan - first_name: Seyyed Ali full_name: Hashemi, Seyyed Ali last_name: Hashemi - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Warren J. full_name: Gross, Warren J. last_name: Gross citation: ama: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on permuted factor graphs. In: 2018 IEEE Global Communications Conference . IEEE; 2018. doi:10.1109/glocom.2018.8647308' apa: 'Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2018). On the decoding of polar codes on permuted factor graphs. In 2018 IEEE Global Communications Conference . Abu Dhabi, United Arab Emirates: IEEE. https://doi.org/10.1109/glocom.2018.8647308' chicago: Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On the Decoding of Polar Codes on Permuted Factor Graphs.” In 2018 IEEE Global Communications Conference . IEEE, 2018. https://doi.org/10.1109/glocom.2018.8647308. ieee: N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of polar codes on permuted factor graphs,” in 2018 IEEE Global Communications Conference , Abu Dhabi, United Arab Emirates, 2018. ista: 'Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar codes on permuted factor graphs. 2018 IEEE Global Communications Conference . GLOBECOM: Global Communications Conference.' mla: Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.” 2018 IEEE Global Communications Conference , IEEE, 2018, doi:10.1109/glocom.2018.8647308. short: N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications Conference , IEEE, 2018. conference: end_date: 2018-12-13 location: Abu Dhabi, United Arab Emirates name: 'GLOBECOM: Global Communications Conference' start_date: 2018-12-09 date_created: 2019-07-30T06:43:15Z date_published: 2018-12-01T00:00:00Z date_updated: 2021-01-12T08:08:42Z day: '01' doi: 10.1109/glocom.2018.8647308 extern: '1' external_id: arxiv: - '1806.11195' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1806.11195 month: '12' oa: 1 oa_version: Preprint publication: '2018 IEEE Global Communications Conference ' publication_identifier: isbn: - '9781538647271' publication_status: published publisher: IEEE quality_controlled: '1' status: public title: On the decoding of polar codes on permuted factor graphs type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '6678' abstract: - lang: eng text: We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances in coding for symmetric channels help provide more efficient solutions for the asymmetric case. We consider, in more detail, three basic coding paradigms. The first one is Gallager's scheme that consists of concatenating a linear code with a non-linear mapping so that the input distribution can be appropriately shaped. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Furthermore, we derive a scaling law between the gap to capacity, the cardinality of the input and output alphabets, and the required size of the mapper. The second one is an integrated scheme in which the code is used both for source coding, in order to create codewords distributed according to the capacity-achieving input distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates the two tasks of source coding and channel coding by a chaining construction that binds together several codewords. We present conditions for the source code and the channel code, and we describe how to combine any source code with any channel code that fulfill those conditions, in order to provide capacity-achieving schemes for asymmetric channels. In particular, we show that polar codes, spatially coupled codes, and homophonic codes are suitable as basic building blocks of the proposed coding strategy. Rather than focusing on the exact details of the schemes, the purpose of this tutorial is to present different coding techniques that can then be implemented with many variants. There is no absolute winner and, in order to understand the most suitable technique for a specific application scenario, we provide a detailed comparison that takes into account several performance metrics. article_type: original author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Hamed full_name: Hassani, Hamed last_name: Hassani - first_name: 'Rudiger ' full_name: 'Urbanke, Rudiger ' last_name: Urbanke citation: ama: Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 2018;64(5):3371-3393. doi:10.1109/tit.2018.2789885 apa: Mondelli, M., Hassani, H., & Urbanke, R. (2018). How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2018.2789885 chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory. IEEE, 2018. https://doi.org/10.1109/tit.2018.2789885. ieee: M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric channels,” IEEE Transactions on Information Theory, vol. 64, no. 5. IEEE, pp. 3371–3393, 2018. ista: Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 64(5), 3371–3393. mla: Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory, vol. 64, no. 5, IEEE, 2018, pp. 3371–93, doi:10.1109/tit.2018.2789885. short: M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393. date_created: 2019-07-24T12:38:49Z date_published: 2018-05-01T00:00:00Z date_updated: 2023-02-23T12:50:46Z day: '01' doi: 10.1109/tit.2018.2789885 extern: '1' external_id: arxiv: - '1406.7373' intvolume: ' 64' issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1406.7373 month: '05' oa: 1 oa_version: Preprint page: 3371-3393 publication: IEEE Transactions on Information Theory publication_identifier: issn: - 0018-9448 - 1557-9654 publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '6740' relation: earlier_version status: public status: public title: How to achieve the capacity of asymmetric channels type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 64 year: '2018' ... --- _id: '690' abstract: - lang: eng text: We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1. article_number: 543-616 author: - first_name: Jii full_name: Lee, Jii last_name: Lee - first_name: Kevin full_name: Schnelli, Kevin id: 434AD0AE-F248-11E8-B48F-1D18A9856A87 last_name: Schnelli orcid: 0000-0003-0954-3231 citation: ama: Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8 apa: Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8 chicago: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8. ieee: J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018. ista: Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616. mla: Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8. short: J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018). date_created: 2018-12-11T11:47:56Z date_published: 2018-06-14T00:00:00Z date_updated: 2021-01-12T08:09:33Z day: '14' department: - _id: LaEr doi: 10.1007/s00440-017-0787-8 ec_funded: 1 external_id: arxiv: - '1605.08767' intvolume: ' 171' issue: 1-2 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1605.08767 month: '06' oa: 1 oa_version: Preprint project: - _id: 258DCDE6-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '338804' name: Random matrices, universality and disordered quantum systems publication: Probability Theory and Related Fields publication_status: published publisher: Springer publist_id: '7017' quality_controlled: '1' scopus_import: 1 status: public title: Local law and Tracy–Widom limit for sparse random matrices type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 171 year: '2018' ... --- _id: '6675' abstract: - lang: eng text: 'We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a separate channel. Two well-known coding approaches for this setting are decode-and-forward and compress-and-forward: in the former, the relay decodes the message and sends some of the information to the destination; in the latter, the relay does not attempt to decode, but it sends a compressed description of the received sequence to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs of blocks and we use compress-and-forward for the first block and decode-and-forward for the second. In particular, in the first block, the relay does not attempt to decode and it sends only a part of the compressed description of the received sequence; in the second block, the relay decodes the message and sends this information plus the remaining part of the compressed sequence relative to the first block. As a result, we strictly outperform both compress-and- forward and decode-and-forward. Furthermore, this paradigm can be implemented with a low-complexity polar coding scheme that has the typical attractive features of polar codes, i.e., quasi-linear encoding/decoding complexity and super-polynomial decay of the error probability. Throughout the paper we consider as a running example the special case of the erasure relay channel and we compare the rates achievable by our proposed scheme with the existing upper and lower bounds.' author: - first_name: Marco full_name: Mondelli, Marco id: 27EB676C-8706-11E9-9510-7717E6697425 last_name: Mondelli orcid: 0000-0002-3242-7020 - first_name: Hamed full_name: Hassani, Hamed last_name: Hassani - first_name: Rudiger full_name: Urbanke, Rudiger last_name: Urbanke citation: ama: 'Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive relay channel. In: 2018 IEEE International Symposium on Information Theory. IEEE; 2018:351-355. doi:10.1109/isit.2018.8437479' apa: 'Mondelli, M., Hassani, H., & Urbanke, R. (2018). A new coding paradigm for the primitive relay channel. In 2018 IEEE International Symposium on Information Theory (pp. 351–355). Vail, CO, United States: IEEE. https://doi.org/10.1109/isit.2018.8437479' chicago: Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” In 2018 IEEE International Symposium on Information Theory, 351–55. IEEE, 2018. https://doi.org/10.1109/isit.2018.8437479. ieee: M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” in 2018 IEEE International Symposium on Information Theory, Vail, CO, United States, 2018, pp. 351–355. ista: 'Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive relay channel. 2018 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory , 351–355.' mla: Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–55, doi:10.1109/isit.2018.8437479. short: M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–355. conference: end_date: 2018-06-22 location: Vail, CO, United States name: 'ISIT: International Symposium on Information Theory ' start_date: 2018-06-17 date_created: 2019-07-24T09:10:38Z date_published: 2018-06-16T00:00:00Z date_updated: 2023-02-23T12:56:49Z day: '16' doi: 10.1109/isit.2018.8437479 extern: '1' external_id: arxiv: - '1801.03153' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1801.03153 month: '06' oa: 1 oa_version: Preprint page: 351-355 publication: 2018 IEEE International Symposium on Information Theory publication_identifier: eissn: - 2157-8117 publication_status: published publisher: IEEE quality_controlled: '1' related_material: record: - id: '7007' relation: later_version status: public status: public title: A new coding paradigm for the primitive relay channel type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '703' abstract: - lang: eng text: We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision. author: - first_name: Alexander full_name: Shekhovtsov, Alexander last_name: Shekhovtsov - first_name: Paul full_name: Swoboda, Paul id: 446560C6-F248-11E8-B48F-1D18A9856A87 last_name: Swoboda - first_name: Bogdan full_name: Savchynskyy, Bogdan last_name: Savchynskyy citation: ama: Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884 apa: Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884 chicago: Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884. ieee: A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018. ista: Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682. mla: Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884. short: A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682. date_created: 2018-12-11T11:48:01Z date_published: 2018-07-01T00:00:00Z date_updated: 2021-01-12T08:11:32Z day: '01' department: - _id: VlKo doi: 10.1109/TPAMI.2017.2730884 external_id: arxiv: - '1508.07902' intvolume: ' 40' issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1508.07902 month: '07' oa: 1 oa_version: Preprint page: 1668-1682 publication: IEEE Transactions on Pattern Analysis and Machine Intelligence publication_identifier: issn: - '01628828' publication_status: published publisher: IEEE publist_id: '6992' quality_controlled: '1' scopus_import: 1 status: public title: Maximum persistency via iterative relaxed inference with graphical models type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 40 year: '2018' ... --- _id: '7063' abstract: - lang: eng text: The high-pressure synthesis and incommensurately modulated structure are reported for the new compound Sr2Pt8−xAs, with x = 0.715 (5). The structure consists of Sr2Pt3As layers alternating with Pt-only corrugated grids. Ab initio calculations predict a metallic character with a dominant role of the Pt d electrons. The electrical resistivity (ρ) and Seebeck coefficient confirm the metallic character, but surprisingly, ρ showed a near-flat temperature dependence. This observation fits the description of the Mooij correlation for electrical resistivity in disordered metals, originally developed for statistically distributed point defects. The discussed material has a long-range crystallographic order, but the high concentration of Pt vacancies, incommensurately ordered, strongly influences the electronic conduction properties. This result extends the range of validity of the Mooij correlation to long-range ordered incommensurately modulated vacancies. Motivated by the layered structure, the resistivity anisotropy was measured in a focused-ion-beam micro-fabricated well oriented single crystal. A low resistivity anisotropy indicates that the layers are electrically coupled and conduction channels along different directions are intermixed. article_processing_charge: No article_type: original author: - first_name: Edoardo full_name: Martino, Edoardo last_name: Martino - first_name: Alla full_name: Arakcheeva, Alla last_name: Arakcheeva - first_name: Gabriel full_name: Autès, Gabriel last_name: Autès - first_name: Andrea full_name: Pisoni, Andrea last_name: Pisoni - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Toni full_name: Helm, Toni last_name: Helm - first_name: Oleg V. full_name: Yazyev, Oleg V. last_name: Yazyev - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll - first_name: László full_name: Forró, László last_name: Forró - first_name: Sergiy full_name: Katrych, Sergiy last_name: Katrych citation: ama: 'Martino E, Arakcheeva A, Autès G, et al. Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. IUCrJ. 2018;5(4):470-477. doi:10.1107/s2052252518007303' apa: 'Martino, E., Arakcheeva, A., Autès, G., Pisoni, A., Bachmann, M. D., Modic, K. A., … Katrych, S. (2018). Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. IUCrJ. International Union of Crystallography (IUCr). https://doi.org/10.1107/s2052252518007303' chicago: 'Martino, Edoardo, Alla Arakcheeva, Gabriel Autès, Andrea Pisoni, Maja D. Bachmann, Kimberly A Modic, Toni Helm, et al. “Sr2Pt8−xAs: A Layered Incommensurately Modulated Metal with Saturated Resistivity.” IUCrJ. International Union of Crystallography (IUCr), 2018. https://doi.org/10.1107/s2052252518007303.' ieee: 'E. Martino et al., “Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity,” IUCrJ, vol. 5, no. 4. International Union of Crystallography (IUCr), pp. 470–477, 2018.' ista: 'Martino E, Arakcheeva A, Autès G, Pisoni A, Bachmann MD, Modic KA, Helm T, Yazyev OV, Moll PJW, Forró L, Katrych S. 2018. Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity. IUCrJ. 5(4), 470–477.' mla: 'Martino, Edoardo, et al. “Sr2Pt8−xAs: A Layered Incommensurately Modulated Metal with Saturated Resistivity.” IUCrJ, vol. 5, no. 4, International Union of Crystallography (IUCr), 2018, pp. 470–77, doi:10.1107/s2052252518007303.' short: E. Martino, A. Arakcheeva, G. Autès, A. Pisoni, M.D. Bachmann, K.A. Modic, T. Helm, O.V. Yazyev, P.J.W. Moll, L. Forró, S. Katrych, IUCrJ 5 (2018) 470–477. date_created: 2019-11-19T13:11:15Z date_published: 2018-07-01T00:00:00Z date_updated: 2021-01-12T08:11:38Z day: '01' ddc: - '530' doi: 10.1107/s2052252518007303 extern: '1' file: - access_level: open_access checksum: 5c6180c7d19da599dd50a067eb2efd50 content_type: application/pdf creator: dernst date_created: 2019-11-20T14:00:27Z date_updated: 2020-07-14T12:47:48Z file_id: '7090' file_name: 2018_IUCrJ_Martino.pdf file_size: 1563353 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 5' issue: '4' language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 470-477 publication: IUCrJ publication_identifier: eissn: - 2052-2525 publication_status: published publisher: International Union of Crystallography (IUCr) quality_controlled: '1' status: public title: 'Sr2Pt8−xAs: A layered incommensurately modulated metal with saturated resistivity' 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: 5 year: '2018' ... --- _id: '7062' abstract: - lang: eng text: 'Weyl fermions are a recently discovered ingredient for correlated states of electronic matter. A key difficulty has been that real materials also contain non-Weyl quasiparticles, and disentangling the experimental signatures has proven challenging. Here we use magnetic fields up to 95 T to drive the Weyl semimetal TaAs far into its quantum limit, where only the purely chiral 0th Landau levels of the Weyl fermions are occupied. We find the electrical resistivity to be nearly independent of magnetic field up to 50 T: unusual for conventional metals but consistent with the chiral anomaly for Weyl fermions. Above 50 T we observe a two-order-of-magnitude increase in resistivity, indicating that a gap opens in the chiral Landau levels. Above 80 T we observe strong ultrasonic attenuation below 2 K, suggesting a mesoscopically textured state of matter. These results point the way to inducing new correlated states of matter in the quantum limit of Weyl semimetals.' article_number: '2217' article_processing_charge: No article_type: original author: - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Arkady full_name: Shekhter, Arkady last_name: Shekhter - first_name: Yi full_name: Zhang, Yi last_name: Zhang - first_name: Eun-Ah full_name: Kim, Eun-Ah last_name: Kim - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: M. K. full_name: Chan, M. K. last_name: Chan - first_name: J. B. full_name: Betts, J. B. last_name: Betts - first_name: F. full_name: Balakirev, F. last_name: Balakirev - first_name: A. full_name: Migliori, A. last_name: Migliori - first_name: N. J. full_name: Ghimire, N. J. last_name: Ghimire - first_name: E. D. full_name: Bauer, E. D. last_name: Bauer - first_name: F. full_name: Ronning, F. last_name: Ronning - first_name: R. D. full_name: McDonald, R. D. last_name: McDonald citation: ama: Ramshaw BJ, Modic KA, Shekhter A, et al. Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04542-9 apa: Ramshaw, B. J., Modic, K. A., Shekhter, A., Zhang, Y., Kim, E.-A., Moll, P. J. W., … McDonald, R. D. (2018). Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04542-9 chicago: Ramshaw, B. J., Kimberly A Modic, Arkady Shekhter, Yi Zhang, Eun-Ah Kim, Philip J. W. Moll, Maja D. Bachmann, et al. “Quantum Limit Transport and Destruction of the Weyl Nodes in TaAs.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04542-9. ieee: B. J. Ramshaw et al., “Quantum limit transport and destruction of the Weyl nodes in TaAs,” Nature Communications, vol. 9, no. 1. Springer Nature, 2018. ista: Ramshaw BJ, Modic KA, Shekhter A, Zhang Y, Kim E-A, Moll PJW, Bachmann MD, Chan MK, Betts JB, Balakirev F, Migliori A, Ghimire NJ, Bauer ED, Ronning F, McDonald RD. 2018. Quantum limit transport and destruction of the Weyl nodes in TaAs. Nature Communications. 9(1), 2217. mla: Ramshaw, B. J., et al. “Quantum Limit Transport and Destruction of the Weyl Nodes in TaAs.” Nature Communications, vol. 9, no. 1, 2217, Springer Nature, 2018, doi:10.1038/s41467-018-04542-9. short: B.J. Ramshaw, K.A. Modic, A. Shekhter, Y. Zhang, E.-A. Kim, P.J.W. Moll, M.D. Bachmann, M.K. Chan, J.B. Betts, F. Balakirev, A. Migliori, N.J. Ghimire, E.D. Bauer, F. Ronning, R.D. McDonald, Nature Communications 9 (2018). date_created: 2019-11-19T13:10:33Z date_published: 2018-06-07T00:00:00Z date_updated: 2021-01-12T08:11:38Z day: '07' ddc: - '530' doi: 10.1038/s41467-018-04542-9 extern: '1' file: - access_level: open_access checksum: 9c53f9a1f06a4d83d5fe879d2478b7d7 content_type: application/pdf creator: dernst date_created: 2019-11-20T13:55:44Z date_updated: 2020-07-14T12:47:48Z file_id: '7089' file_name: 2018_NatureComm_Ramshaw.pdf file_size: 1794797 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 9' issue: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Quantum limit transport and destruction of the Weyl nodes in TaAs 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: 9 year: '2018' ... --- _id: '7059' abstract: - lang: eng text: Unusual behavior in quantum materials commonly arises from their effective low-dimensional physics, reflecting the underlying anisotropy in the spin and charge degrees of freedom. Here we introduce the magnetotropic coefficient k = ∂2F/∂θ2, the second derivative of the free energy F with respect to the magnetic field orientation θ in the crystal. We show that the magnetotropic coefficient can be quantitatively determined from a shift in the resonant frequency of a commercially available atomic force microscopy cantilever under magnetic field. This detection method enables part per 100 million sensitivity and the ability to measure magnetic anisotropy in nanogram-scale samples, as demonstrated on the Weyl semimetal NbP. Measurement of the magnetotropic coefficient in the spin-liquid candidate RuCl3 highlights its sensitivity to anisotropic phase transitions and allows a quantitative comparison to other thermodynamic coefficients via the Ehrenfest relations. article_processing_charge: No article_type: original author: - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: Maja D. full_name: Bachmann, Maja D. last_name: Bachmann - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: F. full_name: Arnold, F. last_name: Arnold - first_name: K. R. full_name: Shirer, K. R. last_name: Shirer - first_name: Amelia full_name: Estry, Amelia last_name: Estry - first_name: J. B. full_name: Betts, J. B. last_name: Betts - first_name: Nirmal J. full_name: Ghimire, Nirmal J. last_name: Ghimire - first_name: E. D. full_name: Bauer, E. D. last_name: Bauer - first_name: Marcus full_name: Schmidt, Marcus last_name: Schmidt - first_name: Michael full_name: Baenitz, Michael last_name: Baenitz - first_name: E. full_name: Svanidze, E. last_name: Svanidze - first_name: Ross D. full_name: McDonald, Ross D. last_name: McDonald - first_name: Arkady full_name: Shekhter, Arkady last_name: Shekhter - first_name: Philip J. W. full_name: Moll, Philip J. W. last_name: Moll citation: ama: Modic KA, Bachmann MD, Ramshaw BJ, et al. Resonant torsion magnetometry in anisotropic quantum materials. Nature Communications. 2018;9(1):3975. doi:10.1038/s41467-018-06412-w apa: Modic, K. A., Bachmann, M. D., Ramshaw, B. J., Arnold, F., Shirer, K. R., Estry, A., … Moll, P. J. W. (2018). Resonant torsion magnetometry in anisotropic quantum materials. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-06412-w chicago: Modic, Kimberly A, Maja D. Bachmann, B. J. Ramshaw, F. Arnold, K. R. Shirer, Amelia Estry, J. B. Betts, et al. “Resonant Torsion Magnetometry in Anisotropic Quantum Materials.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-06412-w. ieee: K. A. Modic et al., “Resonant torsion magnetometry in anisotropic quantum materials,” Nature Communications, vol. 9, no. 1. Springer Nature, p. 3975, 2018. ista: Modic KA, Bachmann MD, Ramshaw BJ, Arnold F, Shirer KR, Estry A, Betts JB, Ghimire NJ, Bauer ED, Schmidt M, Baenitz M, Svanidze E, McDonald RD, Shekhter A, Moll PJW. 2018. Resonant torsion magnetometry in anisotropic quantum materials. Nature Communications. 9(1), 3975. mla: Modic, Kimberly A., et al. “Resonant Torsion Magnetometry in Anisotropic Quantum Materials.” Nature Communications, vol. 9, no. 1, Springer Nature, 2018, p. 3975, doi:10.1038/s41467-018-06412-w. short: K.A. Modic, M.D. Bachmann, B.J. Ramshaw, F. Arnold, K.R. Shirer, A. Estry, J.B. Betts, N.J. Ghimire, E.D. Bauer, M. Schmidt, M. Baenitz, E. Svanidze, R.D. McDonald, A. Shekhter, P.J.W. Moll, Nature Communications 9 (2018) 3975. date_created: 2019-11-19T13:02:20Z date_published: 2018-09-28T00:00:00Z date_updated: 2021-01-12T08:11:37Z day: '28' ddc: - '530' doi: 10.1038/s41467-018-06412-w extern: '1' file: - access_level: open_access checksum: 46a313c816e66899d4dad2cf3583e5b0 content_type: application/pdf creator: dernst date_created: 2019-11-20T12:48:58Z date_updated: 2020-07-14T12:47:48Z file_id: '7088' file_name: 2018_NatureComm_Modic.pdf file_size: 1257681 relation: main_file file_date_updated: 2020-07-14T12:47:48Z has_accepted_license: '1' intvolume: ' 9' issue: '1' language: - iso: eng month: '09' oa: 1 oa_version: Published Version page: '3975' publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Resonant torsion magnetometry in anisotropic quantum materials 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: 9 year: '2018' ... --- _id: '7058' abstract: - lang: eng text: We examine recent magnetic torque measurements in two compounds, γ−Li2IrO3 and RuCl3, which have been discussed as possible realizations of the Kitaev model. The analysis of the reported discontinuity in torque, as an external magnetic field is rotated across the c axis in both crystals, suggests that they have a translationally invariant chiral spin order of the form ⟨Si⋅(Sj×Sk)⟩≠0 in the ground state and persisting over a very wide range of magnetic field and temperature. An extraordinary |B|B2 dependence of the torque for small fields, beside the usual B2 part, is predicted by the chiral spin order. Data for small fields are available for γ−Li2IrO3 and are found to be consistent with the prediction upon further analysis. Other experiments such as inelastic scattering and thermal Hall effect and several questions raised by the discovery of chiral spin order, including its topological consequences, are discussed. article_number: '205110 ' article_processing_charge: No article_type: original author: - first_name: Kimberly A full_name: Modic, Kimberly A id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425 last_name: Modic orcid: 0000-0001-9760-3147 - first_name: B. J. full_name: Ramshaw, B. J. last_name: Ramshaw - first_name: A. full_name: Shekhter, A. last_name: Shekhter - first_name: C. M. full_name: Varma, C. M. last_name: Varma citation: ama: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. Chiral spin order in some purported Kitaev spin-liquid compounds. Physical Review B. 2018;98(20). doi:10.1103/physrevb.98.205110 apa: Modic, K. A., Ramshaw, B. J., Shekhter, A., & Varma, C. M. (2018). Chiral spin order in some purported Kitaev spin-liquid compounds. Physical Review B. APS. https://doi.org/10.1103/physrevb.98.205110 chicago: Modic, Kimberly A, B. J. Ramshaw, A. Shekhter, and C. M. Varma. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” Physical Review B. APS, 2018. https://doi.org/10.1103/physrevb.98.205110. ieee: K. A. Modic, B. J. Ramshaw, A. Shekhter, and C. M. Varma, “Chiral spin order in some purported Kitaev spin-liquid compounds,” Physical Review B, vol. 98, no. 20. APS, 2018. ista: Modic KA, Ramshaw BJ, Shekhter A, Varma CM. 2018. Chiral spin order in some purported Kitaev spin-liquid compounds. Physical Review B. 98(20), 205110. mla: Modic, Kimberly A., et al. “Chiral Spin Order in Some Purported Kitaev Spin-Liquid Compounds.” Physical Review B, vol. 98, no. 20, 205110, APS, 2018, doi:10.1103/physrevb.98.205110. short: K.A. Modic, B.J. Ramshaw, A. Shekhter, C.M. Varma, Physical Review B 98 (2018). date_created: 2019-11-19T13:01:31Z date_published: 2018-11-05T00:00:00Z date_updated: 2021-01-12T08:11:36Z day: '05' doi: 10.1103/physrevb.98.205110 extern: '1' external_id: arxiv: - '1807.06637' intvolume: ' 98' issue: '20' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1807.06637 month: '11' oa: 1 oa_version: Preprint publication: Physical Review B publication_identifier: eissn: - 2469-9969 issn: - 2469-9950 publication_status: published publisher: APS quality_controlled: '1' status: public title: Chiral spin order in some purported Kitaev spin-liquid compounds type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 98 year: '2018' ... --- _id: '7116' abstract: - lang: eng text: 'Training deep learning models has received tremendous research interest recently. In particular, there has been intensive research on reducing the communication cost of training when using multiple computational devices, through reducing the precision of the underlying data representation. Naturally, such methods induce system trade-offs—lowering communication precision could de-crease communication overheads and improve scalability; but, on the other hand, it can also reduce the accuracy of training. In this paper, we study this trade-off space, and ask:Can low-precision communication consistently improve the end-to-end performance of training modern neural networks, with no accuracy loss?From the performance point of view, the answer to this question may appear deceptively easy: compressing communication through low precision should help when the ratio between communication and computation is high. However, this answer is less straightforward when we try to generalize this principle across various neural network architectures (e.g., AlexNet vs. ResNet),number of GPUs (e.g., 2 vs. 8 GPUs), machine configurations(e.g., EC2 instances vs. NVIDIA DGX-1), communication primitives (e.g., MPI vs. NCCL), and even different GPU architectures(e.g., Kepler vs. Pascal). Currently, it is not clear how a realistic realization of all these factors maps to the speed up provided by low-precision communication. In this paper, we conduct an empirical study to answer this question and report the insights.' article_processing_charge: No author: - first_name: Demjan full_name: Grubic, Demjan last_name: Grubic - first_name: Leo full_name: Tam, Leo last_name: Tam - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X - first_name: Ce full_name: Zhang, Ce last_name: Zhang citation: ama: 'Grubic D, Tam L, Alistarh D-A, Zhang C. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In: Proceedings of the 21st International Conference on Extending Database Technology. OpenProceedings; 2018:145-156. doi:10.5441/002/EDBT.2018.14' apa: 'Grubic, D., Tam, L., Alistarh, D.-A., & Zhang, C. (2018). Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. In Proceedings of the 21st International Conference on Extending Database Technology (pp. 145–156). Vienna, Austria: OpenProceedings. https://doi.org/10.5441/002/EDBT.2018.14' chicago: 'Grubic, Demjan, Leo Tam, Dan-Adrian Alistarh, and Ce Zhang. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” In Proceedings of the 21st International Conference on Extending Database Technology, 145–56. OpenProceedings, 2018. https://doi.org/10.5441/002/EDBT.2018.14.' ieee: 'D. Grubic, L. Tam, D.-A. Alistarh, and C. Zhang, “Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study,” in Proceedings of the 21st International Conference on Extending Database Technology, Vienna, Austria, 2018, pp. 145–156.' ista: 'Grubic D, Tam L, Alistarh D-A, Zhang C. 2018. Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study. Proceedings of the 21st International Conference on Extending Database Technology. EDBT: Conference on Extending Database Technology, 145–156.' mla: 'Grubic, Demjan, et al. “Synchronous Multi-GPU Training for Deep Learning with Low-Precision Communications: An Empirical Study.” Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–56, doi:10.5441/002/EDBT.2018.14.' short: D. Grubic, L. Tam, D.-A. Alistarh, C. Zhang, in:, Proceedings of the 21st International Conference on Extending Database Technology, OpenProceedings, 2018, pp. 145–156. conference: end_date: 2018-03-29 location: Vienna, Austria name: 'EDBT: Conference on Extending Database Technology' start_date: 2018-03-26 date_created: 2019-11-26T14:19:11Z date_published: 2018-03-26T00:00:00Z date_updated: 2023-02-23T12:59:17Z day: '26' ddc: - '000' department: - _id: DaAl doi: 10.5441/002/EDBT.2018.14 file: - access_level: open_access checksum: ec979b56abc71016d6e6adfdadbb4afe content_type: application/pdf creator: dernst date_created: 2019-11-26T14:23:04Z date_updated: 2020-07-14T12:47:49Z file_id: '7118' file_name: 2018_OpenProceedings_Grubic.pdf file_size: 1603204 relation: main_file file_date_updated: 2020-07-14T12:47:49Z has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 145-156 publication: Proceedings of the 21st International Conference on Extending Database Technology publication_identifier: isbn: - '9783893180783' issn: - 2367-2005 publication_status: published publisher: OpenProceedings quality_controlled: '1' scopus_import: 1 status: public title: 'Synchronous multi-GPU training for deep learning with low-precision communications: An empirical study' tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '7126' abstract: - lang: eng text: In the Minimum Description Length (MDL) principle, learning from the data is equivalent to an optimal coding problem. We show that the codes that achieve optimal compression in MDL are critical in a very precise sense. First, when they are taken as generative models of samples, they generate samples with broad empirical distributions and with a high value of the relevance, defined as the entropy of the empirical frequencies. These results are derived for different statistical models (Dirichlet model, independent and pairwise dependent spin models, and restricted Boltzmann machines). Second, MDL codes sit precisely at a second order phase transition point where the symmetry between the sampled outcomes is spontaneously broken. The order parameter controlling the phase transition is the coding cost of the samples. The phase transition is a manifestation of the optimality of MDL codes, and it arises because codes that achieve a higher compression do not exist. These results suggest a clear interpretation of the widespread occurrence of statistical criticality as a characterization of samples which are maximally informative on the underlying generative process. article_number: '755' article_processing_charge: No article_type: original author: - first_name: Ryan J full_name: Cubero, Ryan J id: 850B2E12-9CD4-11E9-837F-E719E6697425 last_name: Cubero orcid: 0000-0003-0002-1867 - first_name: Matteo full_name: Marsili, Matteo last_name: Marsili - first_name: Yasser full_name: Roudi, Yasser last_name: Roudi citation: ama: Cubero RJ, Marsili M, Roudi Y. Minimum description length codes are critical. Entropy. 2018;20(10). doi:10.3390/e20100755 apa: Cubero, R. J., Marsili, M., & Roudi, Y. (2018). Minimum description length codes are critical. Entropy. MDPI. https://doi.org/10.3390/e20100755 chicago: Cubero, Ryan J, Matteo Marsili, and Yasser Roudi. “Minimum Description Length Codes Are Critical.” Entropy. MDPI, 2018. https://doi.org/10.3390/e20100755. ieee: R. J. Cubero, M. Marsili, and Y. Roudi, “Minimum description length codes are critical,” Entropy, vol. 20, no. 10. MDPI, 2018. ista: Cubero RJ, Marsili M, Roudi Y. 2018. Minimum description length codes are critical. Entropy. 20(10), 755. mla: Cubero, Ryan J., et al. “Minimum Description Length Codes Are Critical.” Entropy, vol. 20, no. 10, 755, MDPI, 2018, doi:10.3390/e20100755. short: R.J. Cubero, M. Marsili, Y. Roudi, Entropy 20 (2018). date_created: 2019-11-26T22:18:05Z date_published: 2018-10-01T00:00:00Z date_updated: 2021-01-12T08:11:56Z day: '01' ddc: - '519' doi: 10.3390/e20100755 extern: '1' file: - access_level: open_access checksum: d642b7b661e1d5066b62e6ea9986b917 content_type: application/pdf creator: rcubero date_created: 2019-11-26T22:23:08Z date_updated: 2020-07-14T12:47:50Z file_id: '7127' file_name: entropy-20-00755-v2.pdf file_size: 1366813 relation: main_file file_date_updated: 2020-07-14T12:47:50Z has_accepted_license: '1' intvolume: ' 20' issue: '10' keyword: - Minimum Description Length - normalized maximum likelihood - statistical criticality - phase transitions - large deviations language: - iso: eng month: '10' oa: 1 oa_version: Published Version publication: Entropy publication_identifier: issn: - 1099-4300 publication_status: published publisher: MDPI quality_controlled: '1' status: public title: Minimum description length codes are critical 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: 20 year: '2018' ... --- _id: '7277' abstract: - lang: eng text: 'Solid alkali metal carbonates are universal passivation layer components of intercalation battery materials and common side products in metal‐O2 batteries, and are believed to form and decompose reversibly in metal‐O2/CO2 cells. In these cathodes, Li2CO3 decomposes to CO2 when exposed to potentials above 3.8 V vs. Li/Li+. However, O2 evolution, as would be expected according to the decomposition reaction 2 Li2CO3→4 Li++4 e−+2 CO2+O2, is not detected. O atoms are thus unaccounted for, which was previously ascribed to unidentified parasitic reactions. Here, we show that highly reactive singlet oxygen (1O2) forms upon oxidizing Li2CO3 in an aprotic electrolyte and therefore does not evolve as O2. These results have substantial implications for the long‐term cyclability of batteries: they underpin the importance of avoiding 1O2 in metal‐O2 batteries, question the possibility of a reversible metal‐O2/CO2 battery based on a carbonate discharge product, and help explain the interfacial reactivity of transition‐metal cathodes with residual Li2CO3.' article_processing_charge: No article_type: original author: - first_name: Nika full_name: Mahne, Nika last_name: Mahne - first_name: Sara E. full_name: Renfrew, Sara E. last_name: Renfrew - first_name: Bryan D. full_name: McCloskey, Bryan D. last_name: McCloskey - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. Electrochemical oxidation of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International Edition. 2018;57(19):5529-5533. doi:10.1002/anie.201802277 apa: Mahne, N., Renfrew, S. E., McCloskey, B. D., & Freunberger, S. A. (2018). Electrochemical oxidation of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.201802277 chicago: Mahne, Nika, Sara E. Renfrew, Bryan D. McCloskey, and Stefan Alexander Freunberger. “Electrochemical Oxidation of Lithium Carbonate Generates Singlet Oxygen.” Angewandte Chemie International Edition. Wiley, 2018. https://doi.org/10.1002/anie.201802277. ieee: N. Mahne, S. E. Renfrew, B. D. McCloskey, and S. A. Freunberger, “Electrochemical oxidation of Lithium Carbonate generates singlet oxygen,” Angewandte Chemie International Edition, vol. 57, no. 19. Wiley, pp. 5529–5533, 2018. ista: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. 2018. Electrochemical oxidation of Lithium Carbonate generates singlet oxygen. Angewandte Chemie International Edition. 57(19), 5529–5533. mla: Mahne, Nika, et al. “Electrochemical Oxidation of Lithium Carbonate Generates Singlet Oxygen.” Angewandte Chemie International Edition, vol. 57, no. 19, Wiley, 2018, pp. 5529–33, doi:10.1002/anie.201802277. short: N. Mahne, S.E. Renfrew, B.D. McCloskey, S.A. Freunberger, Angewandte Chemie International Edition 57 (2018) 5529–5533. date_created: 2020-01-15T07:20:09Z date_published: 2018-03-15T00:00:00Z date_updated: 2021-01-12T08:12:42Z day: '15' ddc: - '540' doi: 10.1002/anie.201802277 extern: '1' file: - access_level: open_access checksum: 45868d0adc2d13a506bb9a59eb4f409c content_type: application/pdf creator: dernst date_created: 2020-01-22T16:28:31Z date_updated: 2020-07-14T12:47:55Z file_id: '7357' file_name: 2018_AngewChemie_Mahne.pdf file_size: 657963 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 57' issue: '19' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: 5529-5533 publication: Angewandte Chemie International Edition publication_identifier: issn: - 1433-7851 publication_status: published publisher: Wiley quality_controlled: '1' status: public title: Electrochemical oxidation of Lithium Carbonate generates singlet oxygen tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 57 year: '2018' ... --- _id: '7287' abstract: - lang: eng text: Passivation layers on electrode materials are ubiquitous in nonaqueous battery chemistries and strongly govern performance and lifetime. They comprise breakdown products of the electrolyte including carbonate, alkyl carbonates, alkoxides, carboxylates, and polymers. Parasitic chemistry in metal–O2 batteries forms similar products and is tied to the deviation of the O2 balance from the ideal stoichiometry during formation/decomposition of alkaline peroxides or superoxides. Accurate and integral quantification of carbonaceous species and peroxides or superoxides in battery electrodes remains, however, elusive. We present a refined procedure to quantify them accurately and sensitively by pointing out and rectifying pitfalls of previous procedures. Carbonaceous compounds are differentiated into inorganic and organic ones. We combine mass and UV–vis spectrometry to quantify evolved O2 and complexed peroxide and CO2 evolved from carbonaceous compounds by acid treatment and Fenton’s reaction. The capabilities of the method are exemplified by means of Li–O2 and Na–O2 cathodes, graphite anodes, and LiNi0.8Co0.15Al0.05O2 cathodes. article_processing_charge: No article_type: letter_note author: - first_name: Bettina full_name: Schafzahl, Bettina last_name: Schafzahl - first_name: Eléonore full_name: Mourad, Eléonore last_name: Mourad - first_name: Lukas full_name: Schafzahl, Lukas last_name: Schafzahl - first_name: Yann K. full_name: Petit, Yann K. last_name: Petit - first_name: Anjana R. full_name: Raju, Anjana R. last_name: Raju - first_name: Musthafa Ottakam full_name: Thotiyl, Musthafa Ottakam last_name: Thotiyl - first_name: Martin full_name: Wilkening, Martin last_name: Wilkening - first_name: Christian full_name: Slugovc, Christian last_name: Slugovc - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Schafzahl B, Mourad E, Schafzahl L, et al. Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. 2018;3(1):170-176. doi:10.1021/acsenergylett.7b01111 apa: Schafzahl, B., Mourad, E., Schafzahl, L., Petit, Y. K., Raju, A. R., Thotiyl, M. O., … Freunberger, S. A. (2018). Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. ACS. https://doi.org/10.1021/acsenergylett.7b01111 chicago: Schafzahl, Bettina, Eléonore Mourad, Lukas Schafzahl, Yann K. Petit, Anjana R. Raju, Musthafa Ottakam Thotiyl, Martin Wilkening, Christian Slugovc, and Stefan Alexander Freunberger. “Quantifying Total Superoxide, Peroxide, and Carbonaceous Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS Energy Letters. ACS, 2018. https://doi.org/10.1021/acsenergylett.7b01111. ieee: B. Schafzahl et al., “Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase,” ACS Energy Letters, vol. 3, no. 1. ACS, pp. 170–176, 2018. ista: Schafzahl B, Mourad E, Schafzahl L, Petit YK, Raju AR, Thotiyl MO, Wilkening M, Slugovc C, Freunberger SA. 2018. Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase. ACS Energy Letters. 3(1), 170–176. mla: Schafzahl, Bettina, et al. “Quantifying Total Superoxide, Peroxide, and Carbonaceous Compounds in Metal–O2 Batteries and the Solid Electrolyte Interphase.” ACS Energy Letters, vol. 3, no. 1, ACS, 2018, pp. 170–76, doi:10.1021/acsenergylett.7b01111. short: B. Schafzahl, E. Mourad, L. Schafzahl, Y.K. Petit, A.R. Raju, M.O. Thotiyl, M. Wilkening, C. Slugovc, S.A. Freunberger, ACS Energy Letters 3 (2018) 170–176. date_created: 2020-01-15T12:13:52Z date_published: 2018-01-01T00:00:00Z date_updated: 2021-01-12T08:12:46Z day: '01' ddc: - '540' - '543' - '546' - '547' doi: 10.1021/acsenergylett.7b01111 extern: '1' file: - access_level: open_access checksum: 461ccf575ba077af90314fe72d20521e content_type: application/pdf creator: sfreunbe date_created: 2020-06-29T14:19:36Z date_updated: 2020-07-14T12:47:55Z file_id: '8049' file_name: O2 TIOC_fin_incl_SI.pdf file_size: 1892355 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 3' issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 170-176 publication: ACS Energy Letters publication_identifier: issn: - 2380-8195 - 2380-8195 publication_status: published publisher: ACS quality_controlled: '1' status: public title: Quantifying total superoxide, peroxide, and carbonaceous compounds in metal–O2 batteries and the solid electrolyte interphase type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 3 year: '2018' ... --- _id: '7285' abstract: - lang: eng text: Hydrogelation, the self-assembly of molecules into soft, water-loaded networks, is one way to bridge the structural gap between single molecules and functional materials. The potential of hydrogels, such as those based on perylene bisimides, lies in their chemical, physical, optical, and electronic properties, which are governed by the supramolecular structure of the gel. However, the structural motifs and their precise role for long-range conductivity are yet to be explored. Here, we present a comprehensive structural picture of a perylene bisimide hydrogel, suggesting that its long-range conductivity is limited by charge transfer between electronic backbones. We reveal nanocrystalline ribbon-like structures as the electronic and structural backbone units between which charge transfer is mediated by polar solvent bridges. We exemplify this effect with sensing, where exposure to polar vapor enhances conductivity by 5 orders of magnitude, emphasizing the crucial role of the interplay between structural motif and surrounding medium for the rational design of devices based on nanocrystalline hydrogels. article_processing_charge: No article_type: original author: - first_name: Max full_name: Burian, Max last_name: Burian - first_name: Francesco full_name: Rigodanza, Francesco last_name: Rigodanza - first_name: Nicola full_name: Demitri, Nicola last_name: Demitri - first_name: Luka full_name: D̵ord̵ević, Luka last_name: D̵ord̵ević - first_name: Silvia full_name: Marchesan, Silvia last_name: Marchesan - first_name: Tereza full_name: Steinhartova, Tereza last_name: Steinhartova - first_name: Ilse full_name: Letofsky-Papst, Ilse last_name: Letofsky-Papst - first_name: Ivan full_name: Khalakhan, Ivan last_name: Khalakhan - first_name: Eléonore full_name: Mourad, Eléonore last_name: Mourad - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 - first_name: Heinz full_name: Amenitsch, Heinz last_name: Amenitsch - first_name: Maurizio full_name: Prato, Maurizio last_name: Prato - first_name: Zois full_name: Syrgiannis, Zois last_name: Syrgiannis citation: ama: Burian M, Rigodanza F, Demitri N, et al. Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. 2018;12(6):5800-5806. doi:10.1021/acsnano.8b01689 apa: Burian, M., Rigodanza, F., Demitri, N., D̵ord̵ević, L., Marchesan, S., Steinhartova, T., … Syrgiannis, Z. (2018). Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. ACS. https://doi.org/10.1021/acsnano.8b01689 chicago: Burian, Max, Francesco Rigodanza, Nicola Demitri, Luka D̵ord̵ević, Silvia Marchesan, Tereza Steinhartova, Ilse Letofsky-Papst, et al. “Inter-Backbone Charge Transfer as Prerequisite for Long-Range Conductivity in Perylene Bisimide Hydrogels.” ACS Nano. ACS, 2018. https://doi.org/10.1021/acsnano.8b01689. ieee: M. Burian et al., “Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels,” ACS Nano, vol. 12, no. 6. ACS, pp. 5800–5806, 2018. ista: Burian M, Rigodanza F, Demitri N, D̵ord̵ević L, Marchesan S, Steinhartova T, Letofsky-Papst I, Khalakhan I, Mourad E, Freunberger SA, Amenitsch H, Prato M, Syrgiannis Z. 2018. Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels. ACS Nano. 12(6), 5800–5806. mla: Burian, Max, et al. “Inter-Backbone Charge Transfer as Prerequisite for Long-Range Conductivity in Perylene Bisimide Hydrogels.” ACS Nano, vol. 12, no. 6, ACS, 2018, pp. 5800–06, doi:10.1021/acsnano.8b01689. short: M. Burian, F. Rigodanza, N. Demitri, L. D̵ord̵ević, S. Marchesan, T. Steinhartova, I. Letofsky-Papst, I. Khalakhan, E. Mourad, S.A. Freunberger, H. Amenitsch, M. Prato, Z. Syrgiannis, ACS Nano 12 (2018) 5800–5806. date_created: 2020-01-15T12:13:25Z date_published: 2018-06-05T00:00:00Z date_updated: 2021-01-12T08:12:46Z day: '05' ddc: - '540' - '541' doi: 10.1021/acsnano.8b01689 extern: '1' file: - access_level: open_access checksum: 050f7f0ba5d845c5c71779ef14ad5ef3 content_type: application/pdf creator: sfreunbe date_created: 2020-06-29T14:56:40Z date_updated: 2020-07-14T12:47:55Z file_id: '8052' file_name: Manuscript 20092017_subm.pdf file_size: 1333353 relation: main_file file_date_updated: 2020-07-14T12:47:55Z has_accepted_license: '1' intvolume: ' 12' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Submitted Version page: 5800-5806 publication: ACS Nano publication_identifier: issn: - 1936-0851 publication_status: published publisher: ACS quality_controlled: '1' status: public title: Inter-backbone charge transfer as prerequisite for long-range conductivity in perylene bisimide hydrogels type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 12 year: '2018' ... --- _id: '7407' abstract: - lang: eng text: 'Proofs of space (PoS) [Dziembowski et al., CRYPTO''15] are proof systems where a prover can convince a verifier that he "wastes" disk space. PoS were introduced as a more ecological and economical replacement for proofs of work which are currently used to secure blockchains like Bitcoin. In this work we investigate extensions of PoS which allow the prover to embed useful data into the dedicated space, which later can be recovered. Our first contribution is a security proof for the original PoS from CRYPTO''15 in the random oracle model (the original proof only applied to a restricted class of adversaries which can store a subset of the data an honest prover would store). When this PoS is instantiated with recent constructions of maximally depth robust graphs, our proof implies basically optimal security. As a second contribution we show three different extensions of this PoS where useful data can be embedded into the space required by the prover. Our security proof for the PoS extends (non-trivially) to these constructions. We discuss how some of these variants can be used as proofs of catalytic space (PoCS), a notion we put forward in this work, and which basically is a PoS where most of the space required by the prover can be used to backup useful data. Finally we discuss how one of the extensions is a candidate construction for a proof of replication (PoR), a proof system recently suggested in the Filecoin whitepaper. ' alternative_title: - LIPIcs article_processing_charge: No author: - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59' apa: 'Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.59' chicago: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59. ieee: K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25. ista: 'Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.' mla: Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59. short: K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25. conference: end_date: 2019-01-12 location: San Diego, CA, United States name: 'ITCS: Innovations in theoretical Computer Science Conference' start_date: 2019-01-10 date_created: 2020-01-30T09:16:05Z date_published: 2018-12-31T00:00:00Z date_updated: 2021-01-12T08:13:26Z day: '31' ddc: - '000' department: - _id: KrPi doi: 10.4230/LIPICS.ITCS.2019.59 ec_funded: 1 file: - access_level: open_access checksum: 5cebb7f7849a3beda898f697d755dd96 content_type: application/pdf creator: dernst date_created: 2020-02-04T08:17:52Z date_updated: 2020-07-14T12:47:57Z file_id: '7443' file_name: 2018_LIPIcs_Pietrzak.pdf file_size: 822884 relation: main_file file_date_updated: 2020-07-14T12:47:57Z has_accepted_license: '1' intvolume: ' 124' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2018/194 month: '12' oa: 1 oa_version: Published Version page: 59:1-59:25 project: - _id: 258AA5B2-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '682815' name: Teaching Old Crypto New Tricks publication: 10th Innovations in Theoretical Computer Science Conference (ITCS 2019) publication_identifier: isbn: - 978-3-95977-095-8 issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' scopus_import: 1 status: public title: Proofs of catalytic space tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 124 year: '2018' ... --- _id: '7717' abstract: - lang: eng text: "Background: DNA methylation levels change along with age, but few studies have examined the variation in the rate of such changes between individuals.\r\nMethods: We performed a longitudinal analysis to quantify the variation in the rate of change of DNA methylation between individuals using whole blood DNA methylation array profiles collected at 2–4 time points (N = 2894) in 954 individuals (67–90 years).\r\nResults: After stringent quality control, we identified 1507 DNA methylation CpG sites (rsCpGs) with statistically significant variation in the rate of change (random slope) of DNA methylation among individuals in a mixed linear model analysis. Genes in the vicinity of these rsCpGs were found to be enriched in Homeobox transcription factors and the Wnt signalling pathway, both of which are related to ageing processes. Furthermore, we investigated the SNP effect on the random slope. We found that 4 out of 1507 rsCpGs had one significant (P < 5 × 10−8/1507) SNP effect and 343 rsCpGs had at least one SNP effect (436 SNP-probe pairs) reaching genome-wide significance (P < 5 × 10−8). Ninety-five percent of the significant (P < 5 × 10−8) SNPs are on different chromosomes from their corresponding probes.\r\nConclusions: We identified CpG sites that have variability in the rate of change of DNA methylation between individuals, and our results suggest a genetic basis of this variation. Genes around these CpG sites have been reported to be involved in the ageing process." article_number: '75' article_processing_charge: No article_type: original author: - first_name: Qian full_name: Zhang, Qian last_name: Zhang - first_name: Riccardo E full_name: Marioni, Riccardo E last_name: Marioni - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Jon full_name: Higham, Jon last_name: Higham - first_name: Duncan full_name: Sproul, Duncan last_name: Sproul - first_name: Naomi R full_name: Wray, Naomi R last_name: Wray - first_name: Ian J full_name: Deary, Ian J last_name: Deary - first_name: Allan F full_name: McRae, Allan F last_name: McRae - first_name: Peter M full_name: Visscher, Peter M last_name: Visscher citation: ama: Zhang Q, Marioni RE, Robinson MR, et al. Genotype effects contribute to variation in longitudinal methylome patterns in older people. Genome Medicine. 2018;10(1). doi:10.1186/s13073-018-0585-7 apa: Zhang, Q., Marioni, R. E., Robinson, M. R., Higham, J., Sproul, D., Wray, N. R., … Visscher, P. M. (2018). Genotype effects contribute to variation in longitudinal methylome patterns in older people. Genome Medicine. Springer Nature. https://doi.org/10.1186/s13073-018-0585-7 chicago: Zhang, Qian, Riccardo E Marioni, Matthew Richard Robinson, Jon Higham, Duncan Sproul, Naomi R Wray, Ian J Deary, Allan F McRae, and Peter M Visscher. “Genotype Effects Contribute to Variation in Longitudinal Methylome Patterns in Older People.” Genome Medicine. Springer Nature, 2018. https://doi.org/10.1186/s13073-018-0585-7. ieee: Q. Zhang et al., “Genotype effects contribute to variation in longitudinal methylome patterns in older people,” Genome Medicine, vol. 10, no. 1. Springer Nature, 2018. ista: Zhang Q, Marioni RE, Robinson MR, Higham J, Sproul D, Wray NR, Deary IJ, McRae AF, Visscher PM. 2018. Genotype effects contribute to variation in longitudinal methylome patterns in older people. Genome Medicine. 10(1), 75. mla: Zhang, Qian, et al. “Genotype Effects Contribute to Variation in Longitudinal Methylome Patterns in Older People.” Genome Medicine, vol. 10, no. 1, 75, Springer Nature, 2018, doi:10.1186/s13073-018-0585-7. short: Q. Zhang, R.E. Marioni, M.R. Robinson, J. Higham, D. Sproul, N.R. Wray, I.J. Deary, A.F. McRae, P.M. Visscher, Genome Medicine 10 (2018). date_created: 2020-04-30T10:42:50Z date_published: 2018-10-22T00:00:00Z date_updated: 2021-01-12T08:15:04Z day: '22' doi: 10.1186/s13073-018-0585-7 extern: '1' intvolume: ' 10' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1186/s13073-018-0585-7 month: '10' oa: 1 oa_version: Published Version publication: Genome Medicine publication_identifier: issn: - 1756-994X publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Genotype effects contribute to variation in longitudinal methylome patterns in older people type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2018' ... --- _id: '7712' abstract: - lang: eng text: 'Male pattern baldness (MPB) is a sex-limited, age-related, complex trait. We study MPB genetics in 205,327 European males from the UK Biobank. Here we show that MPB is strongly heritable and polygenic, with pedigree-heritability of 0.62 (SE = 0.03) estimated from close relatives, and SNP-heritability of 0.39 (SE = 0.01) from conventionally-unrelated males. We detect 624 near-independent genome-wide loci, contributing SNP-heritability of 0.25 (SE = 0.01), of which 26 X-chromosome loci explain 11.6%. Autosomal genetic variance is enriched for common variants and regions of lower linkage disequilibrium. We identify plausible genetic correlations between MPB and multiple sex-limited markers of earlier puberty, increased bone mineral density (rg = 0.15) and pancreatic β-cell function (rg = 0.12). Correlations with reproductive traits imply an effect on fitness, consistent with an estimated linear selection gradient of -0.018 per MPB standard deviation. Overall, we provide genetic insights into MPB: a phenotype of interest in its own right, with value as a model sex-limited, complex trait.' article_number: '5407' article_processing_charge: No article_type: original author: - first_name: Chloe X. full_name: Yap, Chloe X. last_name: Yap - first_name: Julia full_name: Sidorenko, Julia last_name: Sidorenko - first_name: Yang full_name: Wu, Yang last_name: Wu - first_name: Kathryn E. full_name: Kemper, Kathryn E. last_name: Kemper - first_name: Jian full_name: Yang, Jian last_name: Yang - first_name: Naomi R. full_name: Wray, Naomi R. last_name: Wray - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher citation: ama: Yap CX, Sidorenko J, Wu Y, et al. Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. 2018;9. doi:10.1038/s41467-018-07862-y apa: Yap, C. X., Sidorenko, J., Wu, Y., Kemper, K. E., Yang, J., Wray, N. R., … Visscher, P. M. (2018). Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-07862-y chicago: Yap, Chloe X., Julia Sidorenko, Yang Wu, Kathryn E. Kemper, Jian Yang, Naomi R. Wray, Matthew Richard Robinson, and Peter M. Visscher. “Dissection of Genetic Variation and Evidence for Pleiotropy in Male Pattern Baldness.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-07862-y. ieee: C. X. Yap et al., “Dissection of genetic variation and evidence for pleiotropy in male pattern baldness,” Nature Communications, vol. 9. Springer Nature, 2018. ista: Yap CX, Sidorenko J, Wu Y, Kemper KE, Yang J, Wray NR, Robinson MR, Visscher PM. 2018. Dissection of genetic variation and evidence for pleiotropy in male pattern baldness. Nature Communications. 9, 5407. mla: Yap, Chloe X., et al. “Dissection of Genetic Variation and Evidence for Pleiotropy in Male Pattern Baldness.” Nature Communications, vol. 9, 5407, Springer Nature, 2018, doi:10.1038/s41467-018-07862-y. short: C.X. Yap, J. Sidorenko, Y. Wu, K.E. Kemper, J. Yang, N.R. Wray, M.R. Robinson, P.M. Visscher, Nature Communications 9 (2018). date_created: 2020-04-30T10:41:19Z date_published: 2018-12-20T00:00:00Z date_updated: 2021-01-12T08:15:02Z day: '20' doi: 10.1038/s41467-018-07862-y extern: '1' intvolume: ' 9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-018-07862-y month: '12' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Dissection of genetic variation and evidence for pleiotropy in male pattern baldness type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2018' ... --- _id: '7716' abstract: - lang: eng text: Genomic prediction has the potential to contribute to precision medicine. However, to date, the utility of such predictors is limited due to low accuracy for most traits. Here theory and simulation study are used to demonstrate that widespread pleiotropy among phenotypes can be utilised to improve genomic risk prediction. We show how a genetic predictor can be created as a weighted index that combines published genome-wide association study (GWAS) summary statistics across many different traits. We apply this framework to predict risk of schizophrenia and bipolar disorder in the Psychiatric Genomics consortium data, finding substantial heterogeneity in prediction accuracy increases across cohorts. For six additional phenotypes in the UK Biobank data, we find increases in prediction accuracy ranging from 0.7% for height to 47% for type 2 diabetes, when using a multi-trait predictor that combines published summary statistics from multiple traits, as compared to a predictor based only on one trait. article_number: '989' article_processing_charge: No article_type: original author: - first_name: Robert M. full_name: Maier, Robert M. last_name: Maier - first_name: Zhihong full_name: Zhu, Zhihong last_name: Zhu - first_name: Sang Hong full_name: Lee, Sang Hong last_name: Lee - first_name: Maciej full_name: Trzaskowski, Maciej last_name: Trzaskowski - first_name: Douglas M. full_name: Ruderfer, Douglas M. last_name: Ruderfer - first_name: Eli A. full_name: Stahl, Eli A. last_name: Stahl - first_name: Stephan full_name: Ripke, Stephan last_name: Ripke - first_name: Naomi R. full_name: Wray, Naomi R. last_name: Wray - first_name: Jian full_name: Yang, Jian last_name: Yang - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 citation: ama: Maier RM, Zhu Z, Lee SH, et al. Improving genetic prediction by leveraging genetic correlations among human diseases and traits. Nature Communications. 2018;9. doi:10.1038/s41467-017-02769-6 apa: Maier, R. M., Zhu, Z., Lee, S. H., Trzaskowski, M., Ruderfer, D. M., Stahl, E. A., … Robinson, M. R. (2018). Improving genetic prediction by leveraging genetic correlations among human diseases and traits. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-017-02769-6 chicago: Maier, Robert M., Zhihong Zhu, Sang Hong Lee, Maciej Trzaskowski, Douglas M. Ruderfer, Eli A. Stahl, Stephan Ripke, et al. “Improving Genetic Prediction by Leveraging Genetic Correlations among Human Diseases and Traits.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-017-02769-6. ieee: R. M. Maier et al., “Improving genetic prediction by leveraging genetic correlations among human diseases and traits,” Nature Communications, vol. 9. Springer Nature, 2018. ista: Maier RM, Zhu Z, Lee SH, Trzaskowski M, Ruderfer DM, Stahl EA, Ripke S, Wray NR, Yang J, Visscher PM, Robinson MR. 2018. Improving genetic prediction by leveraging genetic correlations among human diseases and traits. Nature Communications. 9, 989. mla: Maier, Robert M., et al. “Improving Genetic Prediction by Leveraging Genetic Correlations among Human Diseases and Traits.” Nature Communications, vol. 9, 989, Springer Nature, 2018, doi:10.1038/s41467-017-02769-6. short: R.M. Maier, Z. Zhu, S.H. Lee, M. Trzaskowski, D.M. Ruderfer, E.A. Stahl, S. Ripke, N.R. Wray, J. Yang, P.M. Visscher, M.R. Robinson, Nature Communications 9 (2018). date_created: 2020-04-30T10:42:29Z date_published: 2018-03-07T00:00:00Z date_updated: 2021-01-12T08:15:03Z day: '07' doi: 10.1038/s41467-017-02769-6 extern: '1' intvolume: ' 9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-017-02769-6 month: '03' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Improving genetic prediction by leveraging genetic correlations among human diseases and traits type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2018' ... --- _id: '7714' abstract: - lang: eng text: Health risk factors such as body mass index (BMI) and serum cholesterol are associated with many common diseases. It often remains unclear whether the risk factors are cause or consequence of disease, or whether the associations are the result of confounding. We develop and apply a method (called GSMR) that performs a multi-SNP Mendelian randomization analysis using summary-level data from genome-wide association studies to test the causal associations of BMI, waist-to-hip ratio, serum cholesterols, blood pressures, height, and years of schooling (EduYears) with common diseases (sample sizes of up to 405,072). We identify a number of causal associations including a protective effect of LDL-cholesterol against type-2 diabetes (T2D) that might explain the side effects of statins on T2D, a protective effect of EduYears against Alzheimer’s disease, and bidirectional associations with opposite effects (e.g., higher BMI increases the risk of T2D but the effect of T2D on BMI is negative). article_number: '224' article_processing_charge: No article_type: original author: - first_name: Zhihong full_name: Zhu, Zhihong last_name: Zhu - first_name: Zhili full_name: Zheng, Zhili last_name: Zheng - first_name: Futao full_name: Zhang, Futao last_name: Zhang - first_name: Yang full_name: Wu, Yang last_name: Wu - first_name: Maciej full_name: Trzaskowski, Maciej last_name: Trzaskowski - first_name: Robert full_name: Maier, Robert last_name: Maier - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: John J. full_name: McGrath, John J. last_name: McGrath - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher - first_name: Naomi R. full_name: Wray, Naomi R. last_name: Wray - first_name: Jian full_name: Yang, Jian last_name: Yang citation: ama: Zhu Z, Zheng Z, Zhang F, et al. Causal associations between risk factors and common diseases inferred from GWAS summary data. Nature Communications. 2018;9. doi:10.1038/s41467-017-02317-2 apa: Zhu, Z., Zheng, Z., Zhang, F., Wu, Y., Trzaskowski, M., Maier, R., … Yang, J. (2018). Causal associations between risk factors and common diseases inferred from GWAS summary data. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-017-02317-2 chicago: Zhu, Zhihong, Zhili Zheng, Futao Zhang, Yang Wu, Maciej Trzaskowski, Robert Maier, Matthew Richard Robinson, et al. “Causal Associations between Risk Factors and Common Diseases Inferred from GWAS Summary Data.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-017-02317-2. ieee: Z. Zhu et al., “Causal associations between risk factors and common diseases inferred from GWAS summary data,” Nature Communications, vol. 9. Springer Nature, 2018. ista: Zhu Z, Zheng Z, Zhang F, Wu Y, Trzaskowski M, Maier R, Robinson MR, McGrath JJ, Visscher PM, Wray NR, Yang J. 2018. Causal associations between risk factors and common diseases inferred from GWAS summary data. Nature Communications. 9, 224. mla: Zhu, Zhihong, et al. “Causal Associations between Risk Factors and Common Diseases Inferred from GWAS Summary Data.” Nature Communications, vol. 9, 224, Springer Nature, 2018, doi:10.1038/s41467-017-02317-2. short: Z. Zhu, Z. Zheng, F. Zhang, Y. Wu, M. Trzaskowski, R. Maier, M.R. Robinson, J.J. McGrath, P.M. Visscher, N.R. Wray, J. Yang, Nature Communications 9 (2018). date_created: 2020-04-30T10:41:55Z date_published: 2018-01-15T00:00:00Z date_updated: 2021-01-12T08:15:03Z day: '15' doi: 10.1038/s41467-017-02317-2 extern: '1' intvolume: ' 9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-017-02317-2 month: '01' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Causal associations between risk factors and common diseases inferred from GWAS summary data type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2018' ... --- _id: '7713' abstract: - lang: eng text: There are mean differences in complex traits among global human populations. We hypothesize that part of the phenotypic differentiation is due to natural selection. To address this hypothesis, we assess the differentiation in allele frequencies of trait-associated SNPs among African, Eastern Asian, and European populations for ten complex traits using data of large sample size (up to ~405,000). We show that SNPs associated with height (P=2.46×10−5), waist-to-hip ratio (P=2.77×10−4), and schizophrenia (P=3.96×10−5) are significantly more differentiated among populations than matched “control” SNPs, suggesting that these trait-associated SNPs have undergone natural selection. We further find that SNPs associated with height (P=2.01×10−6) and schizophrenia (P=5.16×10−18) show significantly higher variance in linkage disequilibrium (LD) scores across populations than control SNPs. Our results support the hypothesis that natural selection has shaped the genetic differentiation of complex traits, such as height and schizophrenia, among worldwide populations. article_number: '1865' article_processing_charge: No article_type: original author: - first_name: Jing full_name: Guo, Jing last_name: Guo - first_name: Yang full_name: Wu, Yang last_name: Wu - first_name: Zhihong full_name: Zhu, Zhihong last_name: Zhu - first_name: Zhili full_name: Zheng, Zhili last_name: Zheng - first_name: Maciej full_name: Trzaskowski, Maciej last_name: Trzaskowski - first_name: Jian full_name: Zeng, Jian last_name: Zeng - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher - first_name: Jian full_name: Yang, Jian last_name: Yang citation: ama: Guo J, Wu Y, Zhu Z, et al. Global genetic differentiation of complex traits shaped by natural selection in humans. Nature Communications. 2018;9. doi:10.1038/s41467-018-04191-y apa: Guo, J., Wu, Y., Zhu, Z., Zheng, Z., Trzaskowski, M., Zeng, J., … Yang, J. (2018). Global genetic differentiation of complex traits shaped by natural selection in humans. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-04191-y chicago: Guo, Jing, Yang Wu, Zhihong Zhu, Zhili Zheng, Maciej Trzaskowski, Jian Zeng, Matthew Richard Robinson, Peter M. Visscher, and Jian Yang. “Global Genetic Differentiation of Complex Traits Shaped by Natural Selection in Humans.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-04191-y. ieee: J. Guo et al., “Global genetic differentiation of complex traits shaped by natural selection in humans,” Nature Communications, vol. 9. Springer Nature, 2018. ista: Guo J, Wu Y, Zhu Z, Zheng Z, Trzaskowski M, Zeng J, Robinson MR, Visscher PM, Yang J. 2018. Global genetic differentiation of complex traits shaped by natural selection in humans. Nature Communications. 9, 1865. mla: Guo, Jing, et al. “Global Genetic Differentiation of Complex Traits Shaped by Natural Selection in Humans.” Nature Communications, vol. 9, 1865, Springer Nature, 2018, doi:10.1038/s41467-018-04191-y. short: J. Guo, Y. Wu, Z. Zhu, Z. Zheng, M. Trzaskowski, J. Zeng, M.R. Robinson, P.M. Visscher, J. Yang, Nature Communications 9 (2018). date_created: 2020-04-30T10:41:36Z date_published: 2018-05-14T00:00:00Z date_updated: 2021-01-12T08:15:02Z day: '14' doi: 10.1038/s41467-018-04191-y extern: '1' intvolume: ' 9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-018-04191-y month: '05' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Global genetic differentiation of complex traits shaped by natural selection in humans type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2018' ... --- _id: '7721' abstract: - lang: eng text: 'The availability of genome-wide genetic data on hundreds of thousands of people has led to an equally rapid growth in methodologies available to analyse these data. While the motivation for undertaking genome-wide association studies (GWAS) is identification of genetic markers associated with complex traits, once generated these data can be used for many other analyses. GWAS have demonstrated that complex traits exhibit a highly polygenic genetic architecture, often with shared genetic risk factors across traits. New methods to analyse data from GWAS are increasingly being used to address a diverse set of questions about the aetiology of complex traits and diseases, including psychiatric disorders. Here, we give an overview of some of these methods and present examples of how they have contributed to our understanding of psychiatric disorders. We consider: (i) estimation of the extent of genetic influence on traits, (ii) uncovering of shared genetic control between traits, (iii) predictions of genetic risk for individuals, (iv) uncovering of causal relationships between traits, (v) identifying causal single-nucleotide polymorphisms and genes or (vi) the detection of genetic heterogeneity. This classification helps organise the large number of recently developed methods, although some could be placed in more than one category. While some methods require GWAS data on individual people, others simply use GWAS summary statistics data, allowing novel well-powered analyses to be conducted at a low computational burden.' article_processing_charge: No article_type: original author: - first_name: R. M. full_name: Maier, R. M. last_name: Maier - first_name: P. M. full_name: Visscher, P. M. last_name: Visscher - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: N. R. full_name: Wray, N. R. last_name: Wray citation: ama: 'Maier RM, Visscher PM, Robinson MR, Wray NR. Embracing polygenicity: A review of methods and tools for psychiatric genetics research. Psychological Medicine. 2018;48(7):1055-1067. doi:10.1017/s0033291717002318' apa: 'Maier, R. M., Visscher, P. M., Robinson, M. R., & Wray, N. R. (2018). Embracing polygenicity: A review of methods and tools for psychiatric genetics research. Psychological Medicine. Cambridge University Press. https://doi.org/10.1017/s0033291717002318' chicago: 'Maier, R. M., P. M. Visscher, Matthew Richard Robinson, and N. R. Wray. “Embracing Polygenicity: A Review of Methods and Tools for Psychiatric Genetics Research.” Psychological Medicine. Cambridge University Press, 2018. https://doi.org/10.1017/s0033291717002318.' ieee: 'R. M. Maier, P. M. Visscher, M. R. Robinson, and N. R. Wray, “Embracing polygenicity: A review of methods and tools for psychiatric genetics research,” Psychological Medicine, vol. 48, no. 7. Cambridge University Press, pp. 1055–1067, 2018.' ista: 'Maier RM, Visscher PM, Robinson MR, Wray NR. 2018. Embracing polygenicity: A review of methods and tools for psychiatric genetics research. Psychological Medicine. 48(7), 1055–1067.' mla: 'Maier, R. M., et al. “Embracing Polygenicity: A Review of Methods and Tools for Psychiatric Genetics Research.” Psychological Medicine, vol. 48, no. 7, Cambridge University Press, 2018, pp. 1055–67, doi:10.1017/s0033291717002318.' short: R.M. Maier, P.M. Visscher, M.R. Robinson, N.R. Wray, Psychological Medicine 48 (2018) 1055–1067. date_created: 2020-04-30T10:44:35Z date_published: 2018-05-01T00:00:00Z date_updated: 2021-01-12T08:15:05Z day: '01' doi: 10.1017/s0033291717002318 extern: '1' intvolume: ' 48' issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1017/s0033291717002318 month: '05' oa: 1 oa_version: Published Version page: 1055-1067 publication: Psychological Medicine publication_identifier: issn: - 0033-2917 - 1469-8978 publication_status: published publisher: Cambridge University Press quality_controlled: '1' status: public title: 'Embracing polygenicity: A review of methods and tools for psychiatric genetics research' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 48 year: '2018' ... --- _id: '7754' abstract: - lang: eng text: Creating a selective gel that filters particles based on their interactions is a major goal of nanotechnology, with far-reaching implications from drug delivery to controlling assembly pathways. However, this is particularly difficult when the particles are larger than the gel’s characteristic mesh size because such particles cannot passively pass through the gel. Thus, filtering requires the interacting particles to transiently reorganize the gel’s internal structure. While significant advances, e.g., in DNA engineering, have enabled the design of nano-materials with programmable interactions, it is not clear what physical principles such a designer gel could exploit to achieve selective permeability. We present an equilibrium mechanism where crosslink binding dynamics are affected by interacting particles such that particle diffusion is enhanced. In addition to revealing specific design rules for manufacturing selective gels, our results have the potential to explain the origin of selective permeability in certain biological materials, including the nuclear pore complex. article_number: '4348' article_processing_charge: No article_type: original author: - first_name: Carl Peter full_name: Goodrich, Carl Peter id: EB352CD2-F68A-11E9-89C5-A432E6697425 last_name: Goodrich orcid: 0000-0002-1307-5074 - first_name: Michael P. full_name: Brenner, Michael P. last_name: Brenner - first_name: Katharina full_name: Ribbeck, Katharina last_name: Ribbeck citation: ama: Goodrich CP, Brenner MP, Ribbeck K. Enhanced diffusion by binding to the crosslinks of a polymer gel. Nature Communications. 2018;9. doi:10.1038/s41467-018-06851-5 apa: Goodrich, C. P., Brenner, M. P., & Ribbeck, K. (2018). Enhanced diffusion by binding to the crosslinks of a polymer gel. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-018-06851-5 chicago: Goodrich, Carl Peter, Michael P. Brenner, and Katharina Ribbeck. “Enhanced Diffusion by Binding to the Crosslinks of a Polymer Gel.” Nature Communications. Springer Nature, 2018. https://doi.org/10.1038/s41467-018-06851-5. ieee: C. P. Goodrich, M. P. Brenner, and K. Ribbeck, “Enhanced diffusion by binding to the crosslinks of a polymer gel,” Nature Communications, vol. 9. Springer Nature, 2018. ista: Goodrich CP, Brenner MP, Ribbeck K. 2018. Enhanced diffusion by binding to the crosslinks of a polymer gel. Nature Communications. 9, 4348. mla: Goodrich, Carl Peter, et al. “Enhanced Diffusion by Binding to the Crosslinks of a Polymer Gel.” Nature Communications, vol. 9, 4348, Springer Nature, 2018, doi:10.1038/s41467-018-06851-5. short: C.P. Goodrich, M.P. Brenner, K. Ribbeck, Nature Communications 9 (2018). date_created: 2020-04-30T11:38:01Z date_published: 2018-10-19T00:00:00Z date_updated: 2021-01-12T08:15:18Z day: '19' doi: 10.1038/s41467-018-06851-5 extern: '1' intvolume: ' 9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41467-018-06851-5 month: '10' oa: 1 oa_version: Published Version publication: Nature Communications publication_identifier: issn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Enhanced diffusion by binding to the crosslinks of a polymer gel type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2018' ... --- _id: '7783' abstract: - lang: eng text: The Drosophila Genetic Reference Panel (DGRP) serves as a valuable resource to better understand the genetic landscapes underlying quantitative traits. However, such DGRP studies have so far only focused on nuclear genetic variants. To address this, we sequenced the mitochondrial genomes of >170 DGRP lines, identifying 229 variants including 21 indels and 7 frameshifts. We used our mitochondrial variation data to identify 12 genetically distinct mitochondrial haplotypes, thus revealing important population structure at the mitochondrial level. We further examined whether this population structure was reflected on the nuclear genome by screening for the presence of potential mito-nuclear genetic incompatibilities in the form of significant genotype ratio distortions (GRDs) between mitochondrial and nuclear variants. In total, we detected a remarkable 1,845 mito-nuclear GRDs, with the highest enrichment observed in a 40 kb region around the gene Sex-lethal (Sxl). Intriguingly, downstream phenotypic analyses did not uncover major fitness effects associated with these GRDs, suggesting that a large number of mito-nuclear GRDs may reflect population structure at the mitochondrial level rather than actual genomic incompatibilities. This is further supported by the GRD landscape showing particular large genomic regions associated with a single mitochondrial haplotype. Next, we explored the functional relevance of the detected mitochondrial haplotypes through an association analysis on a set of 259 assembled, non-correlating DGRP phenotypes. We found multiple significant associations with stress- and metabolism-related phenotypes, including food intake in males. We validated the latter observation by reciprocal swapping of mitochondrial genomes from high food intake DGRP lines to low food intake ones. In conclusion, our study uncovered important mitochondrial population structure and haplotype-specific metabolic variation in the DGRP, thus demonstrating the significance of incorporating mitochondrial haplotypes in geno-phenotype relationship studies. article_processing_charge: No author: - first_name: Roel P.J. full_name: Bevers, Roel P.J. last_name: Bevers - first_name: Maria full_name: Litovchenko, Maria last_name: Litovchenko - first_name: Adamandia full_name: Kapopoulou, Adamandia last_name: Kapopoulou - first_name: Virginie S. full_name: Braman, Virginie S. last_name: Braman - first_name: Matthew Richard full_name: Robinson, Matthew Richard id: E5D42276-F5DA-11E9-8E24-6303E6697425 last_name: Robinson orcid: 0000-0001-8982-8813 - first_name: Johan full_name: Auwerx, Johan last_name: Auwerx - first_name: Brian full_name: Hollis, Brian last_name: Hollis - first_name: Bart full_name: Deplancke, Bart last_name: Deplancke citation: ama: Bevers RPJ, Litovchenko M, Kapopoulou A, et al. Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel. bioRxiv. 2018. apa: Bevers, R. P. J., Litovchenko, M., Kapopoulou, A., Braman, V. S., Robinson, M. R., Auwerx, J., … Deplancke, B. (2018). Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel. bioRxiv. Cold Spring Harbor Laboratory. chicago: Bevers, Roel P.J., Maria Litovchenko, Adamandia Kapopoulou, Virginie S. Braman, Matthew Richard Robinson, Johan Auwerx, Brian Hollis, and Bart Deplancke. “Extensive Mitochondrial Population Structure and Haplotype-Specific Phenotypic Variation in the Drosophila Genetic Reference Panel.” BioRxiv. Cold Spring Harbor Laboratory, 2018. ieee: R. P. J. Bevers et al., “Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel,” bioRxiv. Cold Spring Harbor Laboratory, 2018. ista: Bevers RPJ, Litovchenko M, Kapopoulou A, Braman VS, Robinson MR, Auwerx J, Hollis B, Deplancke B. 2018. Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel. bioRxiv, . mla: Bevers, Roel P. J., et al. “Extensive Mitochondrial Population Structure and Haplotype-Specific Phenotypic Variation in the Drosophila Genetic Reference Panel.” BioRxiv, Cold Spring Harbor Laboratory, 2018. short: R.P.J. Bevers, M. Litovchenko, A. Kapopoulou, V.S. Braman, M.R. Robinson, J. Auwerx, B. Hollis, B. Deplancke, BioRxiv (2018). date_created: 2020-04-30T13:09:37Z date_published: 2018-11-09T00:00:00Z date_updated: 2021-01-12T08:15:30Z day: '09' extern: '1' language: - iso: eng main_file_link: - open_access: '1' url: 'https://doi.org/10.1101/466771 ' month: '11' oa: 1 oa_version: Preprint page: '49' publication: bioRxiv publication_status: published publisher: Cold Spring Harbor Laboratory status: public title: Extensive mitochondrial population structure and haplotype-specific phenotypic variation in the Drosophila Genetic Reference Panel type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '7812' abstract: - lang: eng text: Deep neural networks (DNNs) continue to make significant advances, solving tasks from image classification to translation or reinforcement learning. One aspect of the field receiving considerable attention is efficiently executing deep models in resource-constrained environments, such as mobile or embedded devices. This paper focuses on this problem, and proposes two new compression methods, which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks. The first method we propose is called quantized distillation and leverages distillation during the training process, by incorporating distillation loss, expressed with respect to the teacher, into the training of a student network whose weights are quantized to a limited set of levels. The second method, differentiable quantization, optimizes the location of quantization points through stochastic gradient descent, to better fit the behavior of the teacher model. We validate both methods through experiments on convolutional and recurrent architectures. We show that quantized shallow students can reach similar accuracy levels to full-precision teacher models, while providing order of magnitude compression, and inference speedup that is linear in the depth reduction. In sum, our results enable DNNs for resource-constrained environments to leverage architecture and accuracy advances developed on more powerful devices. article_processing_charge: No author: - first_name: Antonio full_name: Polino, Antonio last_name: Polino - first_name: Razvan full_name: Pascanu, Razvan last_name: Pascanu - first_name: Dan-Adrian full_name: Alistarh, Dan-Adrian id: 4A899BFC-F248-11E8-B48F-1D18A9856A87 last_name: Alistarh orcid: 0000-0003-3650-940X citation: ama: 'Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: 6th International Conference on Learning Representations. ; 2018.' apa: Polino, A., Pascanu, R., & Alistarh, D.-A. (2018). Model compression via distillation and quantization. In 6th International Conference on Learning Representations. Vancouver, Canada. chicago: Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In 6th International Conference on Learning Representations, 2018. ieee: A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in 6th International Conference on Learning Representations, Vancouver, Canada, 2018. ista: 'Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation and quantization. 6th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.' mla: Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” 6th International Conference on Learning Representations, 2018. short: A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018. conference: end_date: 2018-05-03 location: Vancouver, Canada name: 'ICLR: International Conference on Learning Representations' start_date: 2018-04-30 date_created: 2020-05-10T22:00:51Z date_published: 2018-05-01T00:00:00Z date_updated: 2023-02-23T13:18:41Z day: '01' ddc: - '000' department: - _id: DaAl external_id: arxiv: - '1802.05668' file: - access_level: open_access checksum: a4336c167978e81891970e4e4517a8c3 content_type: application/pdf creator: dernst date_created: 2020-05-26T13:02:00Z date_updated: 2020-07-14T12:48:03Z file_id: '7894' file_name: 2018_ICLR_Polino.pdf file_size: 308339 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Published Version publication: 6th International Conference on Learning Representations publication_status: published quality_controlled: '1' scopus_import: 1 status: public title: Model compression via distillation and quantization type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '7983' abstract: - lang: ger text: 'Feste Alkalicarbonate sind universelle Bestandteile von Passivierungsschichten an Materialien für Interkalationsbatterien, übliche Nebenprodukte in Metall‐O2‐Batterien, und es wird angenommen, dass sie sich reversibel in Metall‐O2 /CO2‐Zellen bilden und zersetzen. In all diesen Kathoden zersetzt sich Li2CO3 zu CO2, sobald es Spannungen >3.8 V vs. Li/Li+ ausgesetzt wird. Beachtenswert ist, dass keine O2‐Entwicklung detektiert wird, wie gemäß der Zersetzungsreaktion 2 Li2CO3 → 4 Li+ + 4 e− + 2 CO2 + O2 zu erwarten wäre. Deswegen war der Verbleib eines der O‐Atome ungeklärt und wurde nicht identifizierten parasitären Reaktionen zugerechnet. Hier zeigen wir, dass hochreaktiver Singulett‐Sauerstoff (1O2) bei der Oxidation von Li2CO3 in einem aprotischen Elektrolyten gebildet und daher nicht als O2 freigesetzt wird. Diese Ergebnisse haben weitreichende Auswirkungen auf die langfristige Zyklisierbarkeit von Batterien: sie untermauern die Wichtigkeit, 1O2 in Metall‐O2‐Batterien zu verhindern, stellen die Möglichkeit einer reversiblen Metall‐O2 /CO2‐Batterie basierend auf einem Carbonat‐Entladeprodukt in Frage und helfen, Grenzflächenreaktivität von Übergangsmetallkathoden mit Li2CO3‐Resten zu erklären.' article_processing_charge: No article_type: original author: - first_name: Nika full_name: Mahne, Nika last_name: Mahne - first_name: Sara E. full_name: Renfrew, Sara E. last_name: Renfrew - first_name: Bryan D. full_name: McCloskey, Bryan D. last_name: McCloskey - first_name: Stefan Alexander full_name: Freunberger, Stefan Alexander id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425 last_name: Freunberger orcid: 0000-0003-2902-5319 citation: ama: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie. 2018;130(19):5627-5631. doi:10.1002/ange.201802277 apa: Mahne, N., Renfrew, S. E., McCloskey, B. D., & Freunberger, S. A. (2018). Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie. Wiley. https://doi.org/10.1002/ange.201802277 chicago: Mahne, Nika, Sara E. Renfrew, Bryan D. McCloskey, and Stefan Alexander Freunberger. “Elektrochemische Oxidation von Lithiumcarbonat Generiert Singulett-Sauerstoff.” Angewandte Chemie. Wiley, 2018. https://doi.org/10.1002/ange.201802277. ieee: N. Mahne, S. E. Renfrew, B. D. McCloskey, and S. A. Freunberger, “Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff,” Angewandte Chemie, vol. 130, no. 19. Wiley, pp. 5627–5631, 2018. ista: Mahne N, Renfrew SE, McCloskey BD, Freunberger SA. 2018. Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff. Angewandte Chemie. 130(19), 5627–5631. mla: Mahne, Nika, et al. “Elektrochemische Oxidation von Lithiumcarbonat Generiert Singulett-Sauerstoff.” Angewandte Chemie, vol. 130, no. 19, Wiley, 2018, pp. 5627–31, doi:10.1002/ange.201802277. short: N. Mahne, S.E. Renfrew, B.D. McCloskey, S.A. Freunberger, Angewandte Chemie 130 (2018) 5627–5631. date_created: 2020-06-19T08:33:24Z date_published: 2018-05-04T00:00:00Z date_updated: 2021-01-12T08:16:21Z day: '04' ddc: - '540' doi: 10.1002/ange.201802277 extern: '1' file: - access_level: open_access checksum: 81506e0f7079e1e3591f3cd9f626bf67 content_type: application/pdf creator: dernst date_created: 2020-06-19T11:58:06Z date_updated: 2020-07-14T12:48:06Z file_id: '7988' file_name: 2018_AngChemieDT_Mahne.pdf file_size: 674789 relation: main_file file_date_updated: 2020-07-14T12:48:06Z has_accepted_license: '1' intvolume: ' 130' issue: '19' language: - iso: eng month: '05' oa: 1 oa_version: Published Version page: 5627-5631 publication: Angewandte Chemie publication_identifier: issn: - 0044-8249 publication_status: published publisher: Wiley quality_controlled: '1' status: public title: Elektrochemische Oxidation von Lithiumcarbonat generiert Singulett-Sauerstoff tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 130 year: '2018' ... --- _id: '8015' abstract: - lang: eng text: 'The neural code of cortical processing remains uncracked; however, it must necessarily rely on faithful signal propagation between cortical areas. In this issue of Neuron, Joglekar et al. (2018) show that strong inter-areal excitation balanced by local inhibition can enable reliable signal propagation in data-constrained network models of macaque cortex. ' article_processing_charge: No article_type: original author: - first_name: Jake P. full_name: Stroud, Jake P. last_name: Stroud - first_name: Tim P full_name: Vogels, Tim P id: CB6FF8D2-008F-11EA-8E08-2637E6697425 last_name: Vogels orcid: 0000-0003-3295-6181 citation: ama: 'Stroud JP, Vogels TP. Cortical signal propagation: Balance, amplify, transmit. Neuron. 2018;98(1):8-9. doi:10.1016/j.neuron.2018.03.028' apa: 'Stroud, J. P., & Vogels, T. P. (2018). Cortical signal propagation: Balance, amplify, transmit. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.03.028' chicago: 'Stroud, Jake P., and Tim P Vogels. “Cortical Signal Propagation: Balance, Amplify, Transmit.” Neuron. Elsevier, 2018. https://doi.org/10.1016/j.neuron.2018.03.028.' ieee: 'J. P. Stroud and T. P. Vogels, “Cortical signal propagation: Balance, amplify, transmit,” Neuron, vol. 98, no. 1. Elsevier, pp. 8–9, 2018.' ista: 'Stroud JP, Vogels TP. 2018. Cortical signal propagation: Balance, amplify, transmit. Neuron. 98(1), 8–9.' mla: 'Stroud, Jake P., and Tim P. Vogels. “Cortical Signal Propagation: Balance, Amplify, Transmit.” Neuron, vol. 98, no. 1, Elsevier, 2018, pp. 8–9, doi:10.1016/j.neuron.2018.03.028.' short: J.P. Stroud, T.P. Vogels, Neuron 98 (2018) 8–9. date_created: 2020-06-25T12:53:39Z date_published: 2018-04-04T00:00:00Z date_updated: 2021-01-12T08:16:31Z day: '04' doi: 10.1016/j.neuron.2018.03.028 extern: '1' external_id: pmid: - '29621492' intvolume: ' 98' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.neuron.2018.03.028 month: '04' oa: 1 oa_version: Published Version page: 8-9 pmid: 1 publication: Neuron publication_identifier: issn: - 0896-6273 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: 'Cortical signal propagation: Balance, amplify, transmit' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 98 year: '2018' ... --- _id: '8073' abstract: - lang: eng text: Motor cortex (M1) exhibits a rich repertoire of neuronal activities to support the generation of complex movements. Although recent neuronal-network models capture many qualitative aspects of M1 dynamics, they can generate only a few distinct movements. Additionally, it is unclear how M1 efficiently controls movements over a wide range of shapes and speeds. We demonstrate that modulation of neuronal input–output gains in recurrent neuronal-network models with a fixed architecture can dramatically reorganize neuronal activity and thus downstream muscle outputs. Consistent with the observation of diffuse neuromodulatory projections to M1, a relatively small number of modulatory control units provide sufficient flexibility to adjust high-dimensional network activity using a simple reward-based learning rule. Furthermore, it is possible to assemble novel movements from previously learned primitives, and one can separately change movement speed while preserving movement shape. Our results provide a new perspective on the role of modulatory systems in controlling recurrent cortical activity. article_processing_charge: No article_type: original author: - first_name: Jake P. full_name: Stroud, Jake P. last_name: Stroud - first_name: Mason A. full_name: Porter, Mason A. last_name: Porter - first_name: Guillaume full_name: Hennequin, Guillaume last_name: Hennequin - first_name: Tim P full_name: Vogels, Tim P id: CB6FF8D2-008F-11EA-8E08-2637E6697425 last_name: Vogels orcid: 0000-0003-3295-6181 citation: ama: Stroud JP, Porter MA, Hennequin G, Vogels TP. Motor primitives in space and time via targeted gain modulation in cortical networks. Nature Neuroscience. 2018;21(12):1774-1783. doi:10.1038/s41593-018-0276-0 apa: Stroud, J. P., Porter, M. A., Hennequin, G., & Vogels, T. P. (2018). Motor primitives in space and time via targeted gain modulation in cortical networks. Nature Neuroscience. Springer Nature. https://doi.org/10.1038/s41593-018-0276-0 chicago: Stroud, Jake P., Mason A. Porter, Guillaume Hennequin, and Tim P Vogels. “Motor Primitives in Space and Time via Targeted Gain Modulation in Cortical Networks.” Nature Neuroscience. Springer Nature, 2018. https://doi.org/10.1038/s41593-018-0276-0. ieee: J. P. Stroud, M. A. Porter, G. Hennequin, and T. P. Vogels, “Motor primitives in space and time via targeted gain modulation in cortical networks,” Nature Neuroscience, vol. 21, no. 12. Springer Nature, pp. 1774–1783, 2018. ista: Stroud JP, Porter MA, Hennequin G, Vogels TP. 2018. Motor primitives in space and time via targeted gain modulation in cortical networks. Nature Neuroscience. 21(12), 1774–1783. mla: Stroud, Jake P., et al. “Motor Primitives in Space and Time via Targeted Gain Modulation in Cortical Networks.” Nature Neuroscience, vol. 21, no. 12, Springer Nature, 2018, pp. 1774–83, doi:10.1038/s41593-018-0276-0. short: J.P. Stroud, M.A. Porter, G. Hennequin, T.P. Vogels, Nature Neuroscience 21 (2018) 1774–1783. date_created: 2020-06-30T13:18:02Z date_published: 2018-12-01T00:00:00Z date_updated: 2021-01-12T08:16:46Z day: '01' doi: 10.1038/s41593-018-0276-0 extern: '1' external_id: pmid: - '30482949' intvolume: ' 21' issue: '12' language: - iso: eng main_file_link: - open_access: '1' url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6276991/ month: '12' oa: 1 oa_version: Submitted Version page: 1774-1783 pmid: 1 publication: Nature Neuroscience publication_identifier: issn: - 1097-6256 - 1546-1726 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: link: - relation: erratum url: https://doi.org/10.1038/s41593-018-0307-x status: public title: Motor primitives in space and time via targeted gain modulation in cortical networks type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 21 year: '2018' ... --- _id: '8231' article_processing_charge: No article_type: letter_note author: - first_name: Judit full_name: Fazekas-Singer, Judit id: 36432834-F248-11E8-B48F-1D18A9856A87 last_name: Fazekas-Singer orcid: 0000-0002-8777-3502 - first_name: Josef full_name: Singer, Josef last_name: Singer - first_name: Kristina M. full_name: Ilieva, Kristina M. last_name: Ilieva - first_name: Miroslawa full_name: Matz, Miroslawa last_name: Matz - first_name: Ina full_name: Herrmann, Ina last_name: Herrmann - first_name: Edzard full_name: Spillner, Edzard last_name: Spillner - first_name: Sophia N. full_name: Karagiannis, Sophia N. last_name: Karagiannis - first_name: Erika full_name: Jensen-Jarolim, Erika last_name: Jensen-Jarolim citation: ama: 'Singer J, Singer J, Ilieva KM, et al. AllergoOncology: Generating a canine anticancer IgE against the epidermal growth factor receptor. Journal of Allergy and Clinical Immunology. 2018;142(3):973-976.e11. doi:10.1016/j.jaci.2018.04.021' apa: 'Singer, J., Singer, J., Ilieva, K. M., Matz, M., Herrmann, I., Spillner, E., … Jensen-Jarolim, E. (2018). AllergoOncology: Generating a canine anticancer IgE against the epidermal growth factor receptor. Journal of Allergy and Clinical Immunology. Elsevier. https://doi.org/10.1016/j.jaci.2018.04.021' chicago: 'Singer, Judit, Josef Singer, Kristina M. Ilieva, Miroslawa Matz, Ina Herrmann, Edzard Spillner, Sophia N. Karagiannis, and Erika Jensen-Jarolim. “AllergoOncology: Generating a Canine Anticancer IgE against the Epidermal Growth Factor Receptor.” Journal of Allergy and Clinical Immunology. Elsevier, 2018. https://doi.org/10.1016/j.jaci.2018.04.021.' ieee: 'J. Singer et al., “AllergoOncology: Generating a canine anticancer IgE against the epidermal growth factor receptor,” Journal of Allergy and Clinical Immunology, vol. 142, no. 3. Elsevier, p. 973–976.e11, 2018.' ista: 'Singer J, Singer J, Ilieva KM, Matz M, Herrmann I, Spillner E, Karagiannis SN, Jensen-Jarolim E. 2018. AllergoOncology: Generating a canine anticancer IgE against the epidermal growth factor receptor. Journal of Allergy and Clinical Immunology. 142(3), 973–976.e11.' mla: 'Singer, Judit, et al. “AllergoOncology: Generating a Canine Anticancer IgE against the Epidermal Growth Factor Receptor.” Journal of Allergy and Clinical Immunology, vol. 142, no. 3, Elsevier, 2018, p. 973–976.e11, doi:10.1016/j.jaci.2018.04.021.' short: J. Singer, J. Singer, K.M. Ilieva, M. Matz, I. Herrmann, E. Spillner, S.N. Karagiannis, E. Jensen-Jarolim, Journal of Allergy and Clinical Immunology 142 (2018) 973–976.e11. date_created: 2020-08-10T11:51:36Z date_published: 2018-09-01T00:00:00Z date_updated: 2021-01-12T08:17:37Z day: '01' doi: 10.1016/j.jaci.2018.04.021 extern: '1' intvolume: ' 142' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.jaci.2018.04.021 month: '09' oa: 1 oa_version: Published Version page: 973-976.e11 publication: Journal of Allergy and Clinical Immunology publication_identifier: issn: - 0091-6749 publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: 'AllergoOncology: Generating a canine anticancer IgE against the epidermal growth factor receptor' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 142 year: '2018' ... --- _id: '8234' abstract: - lang: eng text: Molecular imaging probes such as PET-tracers have the potential to improve the accuracy of tumor characterization by directly visualizing the biochemical situation. Thus, molecular changes can be detected early before morphological manifestation. The A3 adenosine receptor (A3AR) is described to be highly expressed in colon cancer cell lines and human colorectal cancer (CRC), suggesting this receptor as a tumor marker. The aim of this preclinical study was the evaluation of FE@SUPPY as a PET-tracer for CRC using in vitro imaging and in vivo PET imaging. First, affinity and selectivity of FE@SUPPY and its metabolites were determined, proving the favorable binding profile of FE@SUPPY. The human adenocarcinoma cell line HT-29 was characterized regarding its hA3AR expression and was subsequently chosen as tumor graft. Promising results regarding the potential of FE@SUPPY as a PET-tracer for CRC imaging were obtained by autoradiography as ≥2.3-fold higher accumulation of FE@SUPPY was found in CRC tissue compared to adjacent healthy colon tissue from the same patient. Nevertheless, first in vivo studies using HT-29 xenografts showed insufficient tumor uptake due to (1) poor conservation of target expression in xenografts and (2) unfavorable pharmacokinetics of FE@SUPPY in mice. We therefore conclude that HT-29 xenografts are not adequate to visualize hA3ARs using FE@SUPPY. article_number: '1269830' article_processing_charge: No article_type: original author: - first_name: T. full_name: Balber, T. last_name: Balber - first_name: Judit full_name: Singer, Judit id: 36432834-F248-11E8-B48F-1D18A9856A87 last_name: Singer orcid: 0000-0002-8777-3502 - first_name: N. full_name: Berroterán-Infante, N. last_name: Berroterán-Infante - first_name: M. full_name: Dumanic, M. last_name: Dumanic - first_name: L. full_name: Fetty, L. last_name: Fetty - first_name: J. full_name: Fazekas-Singer, J. last_name: Fazekas-Singer orcid: 0000-0002-8777-3502 - first_name: C. full_name: Vraka, C. last_name: Vraka - first_name: L. full_name: Nics, L. last_name: Nics - first_name: M. full_name: Bergmann, M. last_name: Bergmann - first_name: K. full_name: Pallitsch, K. last_name: Pallitsch - first_name: H. full_name: Spreitzer, H. last_name: Spreitzer - first_name: W. full_name: Wadsak, W. last_name: Wadsak orcid: 0000-0003-4479-8053 - first_name: M. full_name: Hacker, M. last_name: Hacker - first_name: E. full_name: Jensen-Jarolim, E. last_name: Jensen-Jarolim - first_name: H. full_name: Viernstein, H. last_name: Viernstein - first_name: M. full_name: Mitterhauser, M. last_name: Mitterhauser orcid: 0000-0003-3173-5272 citation: ama: 'Balber T, Singer J, Berroterán-Infante N, et al. Preclinical in vitro and in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal cancer. Contrast Media & Molecular Imaging. 2018;2018. doi:10.1155/2018/1269830' apa: 'Balber, T., Singer, J., Berroterán-Infante, N., Dumanic, M., Fetty, L., Fazekas-Singer, J., … Mitterhauser, M. (2018). Preclinical in vitro and in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal cancer. Contrast Media & Molecular Imaging. Hindawi. https://doi.org/10.1155/2018/1269830' chicago: 'Balber, T., Judit Singer, N. Berroterán-Infante, M. Dumanic, L. Fetty, J. Fazekas-Singer, C. Vraka, et al. “Preclinical in Vitro and in Vivo Evaluation of [18F]FE@SUPPY for Cancer PET Imaging: Limitations of a Xenograft Model for Colorectal Cancer.” Contrast Media & Molecular Imaging. Hindawi, 2018. https://doi.org/10.1155/2018/1269830.' ieee: 'T. Balber et al., “Preclinical in vitro and in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal cancer,” Contrast Media & Molecular Imaging, vol. 2018. Hindawi, 2018.' ista: 'Balber T, Singer J, Berroterán-Infante N, Dumanic M, Fetty L, Fazekas-Singer J, Vraka C, Nics L, Bergmann M, Pallitsch K, Spreitzer H, Wadsak W, Hacker M, Jensen-Jarolim E, Viernstein H, Mitterhauser M. 2018. Preclinical in vitro and in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal cancer. Contrast Media & Molecular Imaging. 2018, 1269830.' mla: 'Balber, T., et al. “Preclinical in Vitro and in Vivo Evaluation of [18F]FE@SUPPY for Cancer PET Imaging: Limitations of a Xenograft Model for Colorectal Cancer.” Contrast Media & Molecular Imaging, vol. 2018, 1269830, Hindawi, 2018, doi:10.1155/2018/1269830.' short: T. Balber, J. Singer, N. Berroterán-Infante, M. Dumanic, L. Fetty, J. Fazekas-Singer, C. Vraka, L. Nics, M. Bergmann, K. Pallitsch, H. Spreitzer, W. Wadsak, M. Hacker, E. Jensen-Jarolim, H. Viernstein, M. Mitterhauser, Contrast Media & Molecular Imaging 2018 (2018). date_created: 2020-08-10T11:53:07Z date_published: 2018-02-13T00:00:00Z date_updated: 2021-01-12T08:17:38Z day: '13' doi: 10.1155/2018/1269830 extern: '1' intvolume: ' 2018' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1155/2018/1269830 month: '02' oa: 1 oa_version: Published Version publication: Contrast Media & Molecular Imaging publication_identifier: issn: - 1555-4309 - 1555-4317 publication_status: published publisher: Hindawi quality_controlled: '1' status: public title: 'Preclinical in vitro and in vivo evaluation of [18F]FE@SUPPY for cancer PET imaging: Limitations of a xenograft model for colorectal cancer' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2018 year: '2018' ... --- _id: '8232' abstract: - lang: eng text: 'Anti-epidermal growth factor receptor (EGFR) antibody therapy is used in EGFR expressing cancers including lung, colon, head and neck, and bladder cancers, however results have been modest. Near infrared photoimmunotherapy (NIR-PIT) is a highly selective tumor treatment that employs an antibody-photo-absorber conjugate which is activated by NIR light. NIR-PIT is in clinical trials in patients with recurrent head and neck cancers using cetuximab-IR700 as the conjugate. However, its use has otherwise been restricted to mouse models. This is an effort to explore larger animal models with NIR-PIT. We describe the use of a recombinant canine anti-EGFR monoclonal antibody (mAb), can225IgG, conjugated to the photo-absorber, IR700DX, in three EGFR expressing canine transitional cell carcinoma (TCC) cell lines as a prelude to possible canine clinical studies. Can225-IR700 conjugate showed specific binding and cell-specific killing after NIR-PIT on EGFR expressing cells in vitro. In the in vivo study, can225-IR700 conjugate demonstrated accumulation of the fluorescent conjugate with high tumor-to-background ratio. Tumor-bearing mice were separated into 4 groups: (1) no treatment; (2) 100 μg of can225-IR700 i.v. only; (3) NIR light exposure only; (4) 100 μg of can225-IR700 i.v., NIR light exposure. Tumor growth was significantly inhibited by NIR-PIT treatment compared with the other groups (p < 0.001), and significantly prolonged survival was achieved (p < 0.001 vs. other groups) in the treatment groups. In conclusion, NIR-PIT with can225-IR700 is a promising treatment for canine EGFR-expressing cancers, including invasive transitional cell carcinoma in pet dogs, that could provide a pathway to translation to humans.' article_processing_charge: No article_type: original author: - first_name: Tadanobu full_name: Nagaya, Tadanobu last_name: Nagaya - first_name: Shuhei full_name: Okuyama, Shuhei last_name: Okuyama - first_name: Fusa full_name: Ogata, Fusa last_name: Ogata - first_name: Yasuhiro full_name: Maruoka, Yasuhiro last_name: Maruoka - first_name: Deborah W. full_name: Knapp, Deborah W. last_name: Knapp - first_name: Sophia N. full_name: Karagiannis, Sophia N. last_name: Karagiannis - first_name: Judit full_name: Fazekas-Singer, Judit id: 36432834-F248-11E8-B48F-1D18A9856A87 last_name: Fazekas-Singer orcid: 0000-0002-8777-3502 - first_name: Peter L. full_name: Choyke, Peter L. last_name: Choyke - first_name: Amy K. full_name: LeBlanc, Amy K. last_name: LeBlanc - first_name: Erika full_name: Jensen-Jarolim, Erika last_name: Jensen-Jarolim - first_name: Hisataka full_name: Kobayashi, Hisataka last_name: Kobayashi citation: ama: Nagaya T, Okuyama S, Ogata F, et al. Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody. Oncotarget. 2018;9:19026-19038. doi:10.18632/oncotarget.24876 apa: Nagaya, T., Okuyama, S., Ogata, F., Maruoka, Y., Knapp, D. W., Karagiannis, S. N., … Kobayashi, H. (2018). Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody. Oncotarget. Impact Journals. https://doi.org/10.18632/oncotarget.24876 chicago: Nagaya, Tadanobu, Shuhei Okuyama, Fusa Ogata, Yasuhiro Maruoka, Deborah W. Knapp, Sophia N. Karagiannis, Judit Singer, et al. “Near Infrared Photoimmunotherapy Targeting Bladder Cancer with a Canine Anti-Epidermal Growth Factor Receptor (EGFR) Antibody.” Oncotarget. Impact Journals, 2018. https://doi.org/10.18632/oncotarget.24876. ieee: T. Nagaya et al., “Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody,” Oncotarget, vol. 9. Impact Journals, pp. 19026–19038, 2018. ista: Nagaya T, Okuyama S, Ogata F, Maruoka Y, Knapp DW, Karagiannis SN, Singer J, Choyke PL, LeBlanc AK, Jensen-Jarolim E, Kobayashi H. 2018. Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody. Oncotarget. 9, 19026–19038. mla: Nagaya, Tadanobu, et al. “Near Infrared Photoimmunotherapy Targeting Bladder Cancer with a Canine Anti-Epidermal Growth Factor Receptor (EGFR) Antibody.” Oncotarget, vol. 9, Impact Journals, 2018, pp. 19026–38, doi:10.18632/oncotarget.24876. short: T. Nagaya, S. Okuyama, F. Ogata, Y. Maruoka, D.W. Knapp, S.N. Karagiannis, J. Singer, P.L. Choyke, A.K. LeBlanc, E. Jensen-Jarolim, H. Kobayashi, Oncotarget 9 (2018) 19026–19038. date_created: 2020-08-10T11:52:54Z date_published: 2018-04-10T00:00:00Z date_updated: 2021-01-12T08:17:37Z day: '10' doi: 10.18632/oncotarget.24876 extern: '1' intvolume: ' 9' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.18632/oncotarget.24876 month: '04' oa: 1 oa_version: Published Version page: 19026-19038 publication: Oncotarget publication_identifier: eissn: - 1949-2553 publication_status: published publisher: Impact Journals quality_controlled: '1' status: public title: Near infrared photoimmunotherapy targeting bladder cancer with a canine anti-epidermal growth factor receptor (EGFR) antibody type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2018' ... --- _id: '8233' abstract: - lang: eng text: The M2a subtype of macrophages plays an important role in human immunoglobulin E (IgE-mediated allergies) and other Th2 type immune reactions. In contrast, very little is known about these cells in the dog. Here we describe an in vitro method to activate canine histiocytic DH82 cells and primary canine monocyte-derived macrophages (MDMs) toward the M2a macrophages using human cytokines. For a side-by-side comparison, we compared the canine cells to human MDMs, and the human monocytic cell line U937 activated towards M1 and M2a cells on the cellular and molecular level. In analogy to activated human M2a cells, canine M2a, differentiated from both DH82 and MDMs, showed an increase in CD206 surface receptor expression compared to M1. Interestingly, canine M2a, but not M1 derived from MDM, upregulated the high-affinity IgE receptor (FcεRI). Transcription levels of M2a-associated genes (IL10, CCL22, TGFβ, CD163) showed a diverse pattern between the human and dog species, whereas M1 genes (IDO1, CXCL11, IL6, TNF-α) were similarly upregulated in canine and human M1 cells (cell lines and MDMs). We suggest that our novel in vitro method will be suitable in comparative allergology studies focussing on macrophages. article_processing_charge: No article_type: original author: - first_name: Ina full_name: Herrmann, Ina last_name: Herrmann - first_name: Jelena full_name: Gotovina, Jelena last_name: Gotovina - first_name: Judit full_name: Fazekas-Singer, Judit id: 36432834-F248-11E8-B48F-1D18A9856A87 last_name: Fazekas-Singer orcid: 0000-0002-8777-3502 - first_name: Michael B. full_name: Fischer, Michael B. last_name: Fischer - first_name: Karin full_name: Hufnagl, Karin last_name: Hufnagl - first_name: Rodolfo full_name: Bianchini, Rodolfo last_name: Bianchini - first_name: Erika full_name: Jensen-Jarolim, Erika last_name: Jensen-Jarolim citation: ama: Herrmann I, Gotovina J, Singer J, et al. Canine macrophages can like human macrophages be in vitro activated toward the M2a subtype relevant in allergy. Developmental & Comparative Immunology. 2018;82(5):118-127. doi:10.1016/j.dci.2018.01.005 apa: Herrmann, I., Gotovina, J., Singer, J., Fischer, M. B., Hufnagl, K., Bianchini, R., & Jensen-Jarolim, E. (2018). Canine macrophages can like human macrophages be in vitro activated toward the M2a subtype relevant in allergy. Developmental & Comparative Immunology. Elsevier. https://doi.org/10.1016/j.dci.2018.01.005 chicago: Herrmann, Ina, Jelena Gotovina, Judit Singer, Michael B. Fischer, Karin Hufnagl, Rodolfo Bianchini, and Erika Jensen-Jarolim. “Canine Macrophages Can like Human Macrophages Be in Vitro Activated toward the M2a Subtype Relevant in Allergy.” Developmental & Comparative Immunology. Elsevier, 2018. https://doi.org/10.1016/j.dci.2018.01.005. ieee: I. Herrmann et al., “Canine macrophages can like human macrophages be in vitro activated toward the M2a subtype relevant in allergy,” Developmental & Comparative Immunology, vol. 82, no. 5. Elsevier, pp. 118–127, 2018. ista: Herrmann I, Gotovina J, Singer J, Fischer MB, Hufnagl K, Bianchini R, Jensen-Jarolim E. 2018. Canine macrophages can like human macrophages be in vitro activated toward the M2a subtype relevant in allergy. Developmental & Comparative Immunology. 82(5), 118–127. mla: Herrmann, Ina, et al. “Canine Macrophages Can like Human Macrophages Be in Vitro Activated toward the M2a Subtype Relevant in Allergy.” Developmental & Comparative Immunology, vol. 82, no. 5, Elsevier, 2018, pp. 118–27, doi:10.1016/j.dci.2018.01.005. short: I. Herrmann, J. Gotovina, J. Singer, M.B. Fischer, K. Hufnagl, R. Bianchini, E. Jensen-Jarolim, Developmental & Comparative Immunology 82 (2018) 118–127. date_created: 2020-08-10T11:53:01Z date_published: 2018-05-01T00:00:00Z date_updated: 2021-01-12T08:17:38Z day: '01' doi: 10.1016/j.dci.2018.01.005 extern: '1' intvolume: ' 82' issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1016/j.dci.2018.01.005 month: '05' oa: 1 oa_version: Published Version page: 118-127 publication: Developmental & Comparative Immunology publication_identifier: issn: - 0145-305X publication_status: published publisher: Elsevier quality_controlled: '1' status: public title: Canine macrophages can like human macrophages be in vitro activated toward the M2a subtype relevant in allergy type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 82 year: '2018' ... --- _id: '8262' abstract: - lang: eng text: "Background: The genus Burkholderia consists of species that occupy remarkably diverse ecological niches. Its best known members are important pathogens, B. mallei and B. pseudomallei, which cause glanders and melioidosis, respectively. Burkholderia genomes are unusual due to their multichromosomal organization, generally comprised of 2-3 chromosomes.\r\n\r\nResults: We performed integrated genomic analysis of 127 Burkholderia strains. The pan-genome is open with the saturation to be reached between 86,000 and 88,000 genes. The reconstructed rearrangements indicate a strong avoidance of intra-replichore inversions that is likely caused by selection against the transfer of large groups of genes between the leading and the lagging strands. Translocated genes also tend to retain their position in the leading or the lagging strand, and this selection is stronger for large syntenies. Integrated reconstruction of chromosome rearrangements in the context of strains phylogeny reveals parallel rearrangements that may indicate inversion-based phase variation and integration of new genomic islands. In particular, we detected parallel inversions in the second chromosomes of B. pseudomallei with breakpoints formed by genes encoding membrane components of multidrug resistance complex, that may be linked to a phase variation mechanism. Two genomic islands, spreading horizontally between chromosomes, were detected in the B. cepacia group.\r\n\r\nConclusions: This study demonstrates the power of integrated analysis of pan-genomes, chromosome rearrangements, and selection regimes. Non-random inversion patterns indicate selective pressure, inversions are particularly frequent in a recent pathogen B. mallei, and, together with periods of positive selection at other branches, may indicate adaptation to new niches. One such adaptation could be a possible phase variation mechanism in B. pseudomallei." article_number: '965' article_processing_charge: No article_type: original author: - first_name: Olga full_name: Bochkareva, Olga id: C4558D3C-6102-11E9-A62E-F418E6697425 last_name: Bochkareva orcid: 0000-0003-1006-6639 - first_name: Elena V. full_name: Moroz, Elena V. last_name: Moroz - first_name: Iakov I. full_name: Davydov, Iakov I. last_name: Davydov - first_name: Mikhail S. full_name: Gelfand, Mikhail S. last_name: Gelfand citation: ama: Bochkareva O, Moroz EV, Davydov II, Gelfand MS. Genome rearrangements and selection in multi-chromosome bacteria Burkholderia spp. BMC Genomics. 2018;19. doi:10.1186/s12864-018-5245-1 apa: Bochkareva, O., Moroz, E. V., Davydov, I. I., & Gelfand, M. S. (2018). Genome rearrangements and selection in multi-chromosome bacteria Burkholderia spp. BMC Genomics. Springer Nature. https://doi.org/10.1186/s12864-018-5245-1 chicago: Bochkareva, Olga, Elena V. Moroz, Iakov I. Davydov, and Mikhail S. Gelfand. “Genome Rearrangements and Selection in Multi-Chromosome Bacteria Burkholderia Spp.” BMC Genomics. Springer Nature, 2018. https://doi.org/10.1186/s12864-018-5245-1. ieee: O. Bochkareva, E. V. Moroz, I. I. Davydov, and M. S. Gelfand, “Genome rearrangements and selection in multi-chromosome bacteria Burkholderia spp.,” BMC Genomics, vol. 19. Springer Nature, 2018. ista: Bochkareva O, Moroz EV, Davydov II, Gelfand MS. 2018. Genome rearrangements and selection in multi-chromosome bacteria Burkholderia spp. BMC Genomics. 19, 965. mla: Bochkareva, Olga, et al. “Genome Rearrangements and Selection in Multi-Chromosome Bacteria Burkholderia Spp.” BMC Genomics, vol. 19, 965, Springer Nature, 2018, doi:10.1186/s12864-018-5245-1. short: O. Bochkareva, E.V. Moroz, I.I. Davydov, M.S. Gelfand, BMC Genomics 19 (2018). date_created: 2020-08-15T11:02:08Z date_published: 2018-12-27T00:00:00Z date_updated: 2023-02-23T13:28:52Z day: '27' doi: 10.1186/s12864-018-5245-1 extern: '1' intvolume: ' 19' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1186/s12864-018-5245-1 month: '12' oa: 1 oa_version: Published Version publication: BMC Genomics publication_identifier: issn: - 1471-2164 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Genome rearrangements and selection in multi-chromosome bacteria Burkholderia spp. type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 19 year: '2018' ... --- _id: '8265' abstract: - lang: eng text: Genome rearrangements have played an important role in the evolution of Yersinia pestis from its progenitor Yersinia pseudotuberculosis. Traditional phylogenetic trees for Y. pestis based on sequence comparison have short internal branches and low bootstrap supports as only a small number of nucleotide substitutions have occurred. On the other hand, even a small number of genome rearrangements may resolve topological ambiguities in a phylogenetic tree. We reconstructed phylogenetic trees based on genome rearrangements using several popular approaches such as Maximum likelihood for Gene Order and the Bayesian model of genome rearrangements by inversions. We also reconciled phylogenetic trees for each of the three CRISPR loci to obtain an integrated scenario of the CRISPR cassette evolution. Analysis of contradictions between the obtained evolutionary trees yielded numerous parallel inversions and gain/loss events. Our data indicate that an integrated analysis of sequence-based and inversion-based trees enhances the resolution of phylogenetic reconstruction. In contrast, reconstructions of strain relationships based on solely CRISPR loci may not be reliable, as the history is obscured by large deletions, obliterating the order of spacer gains. Similarly, numerous parallel gene losses preclude reconstruction of phylogeny based on gene content. article_number: e4545 article_processing_charge: No article_type: original author: - first_name: Olga full_name: Bochkareva, Olga id: C4558D3C-6102-11E9-A62E-F418E6697425 last_name: Bochkareva orcid: 0000-0003-1006-6639 - first_name: Natalia O. full_name: Dranenko, Natalia O. last_name: Dranenko - first_name: Elena S. full_name: Ocheredko, Elena S. last_name: Ocheredko - first_name: German M. full_name: Kanevsky, German M. last_name: Kanevsky - first_name: Yaroslav N. full_name: Lozinsky, Yaroslav N. last_name: Lozinsky - first_name: Vera A. full_name: Khalaycheva, Vera A. last_name: Khalaycheva - first_name: Irena I. full_name: Artamonova, Irena I. last_name: Artamonova - first_name: Mikhail S. full_name: Gelfand, Mikhail S. last_name: Gelfand citation: ama: Bochkareva O, Dranenko NO, Ocheredko ES, et al. Genome rearrangements and phylogeny reconstruction in Yersinia pestis. PeerJ. 2018;6. doi:10.7717/peerj.4545 apa: Bochkareva, O., Dranenko, N. O., Ocheredko, E. S., Kanevsky, G. M., Lozinsky, Y. N., Khalaycheva, V. A., … Gelfand, M. S. (2018). Genome rearrangements and phylogeny reconstruction in Yersinia pestis. PeerJ. PeerJ. https://doi.org/10.7717/peerj.4545 chicago: Bochkareva, Olga, Natalia O. Dranenko, Elena S. Ocheredko, German M. Kanevsky, Yaroslav N. Lozinsky, Vera A. Khalaycheva, Irena I. Artamonova, and Mikhail S. Gelfand. “Genome Rearrangements and Phylogeny Reconstruction in Yersinia Pestis.” PeerJ. PeerJ, 2018. https://doi.org/10.7717/peerj.4545. ieee: O. Bochkareva et al., “Genome rearrangements and phylogeny reconstruction in Yersinia pestis,” PeerJ, vol. 6. PeerJ, 2018. ista: Bochkareva O, Dranenko NO, Ocheredko ES, Kanevsky GM, Lozinsky YN, Khalaycheva VA, Artamonova II, Gelfand MS. 2018. Genome rearrangements and phylogeny reconstruction in Yersinia pestis. PeerJ. 6, e4545. mla: Bochkareva, Olga, et al. “Genome Rearrangements and Phylogeny Reconstruction in Yersinia Pestis.” PeerJ, vol. 6, e4545, PeerJ, 2018, doi:10.7717/peerj.4545. short: O. Bochkareva, N.O. Dranenko, E.S. Ocheredko, G.M. Kanevsky, Y.N. Lozinsky, V.A. Khalaycheva, I.I. Artamonova, M.S. Gelfand, PeerJ 6 (2018). date_created: 2020-08-15T11:08:23Z date_published: 2018-03-27T00:00:00Z date_updated: 2023-02-23T13:28:57Z day: '27' doi: 10.7717/peerj.4545 extern: '1' external_id: pmid: - '29607260' intvolume: ' 6' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.7717/peerj.4545 month: '03' oa: 1 oa_version: Published Version pmid: 1 publication: PeerJ publication_identifier: issn: - 2167-8359 publication_status: published publisher: PeerJ quality_controlled: '1' status: public title: Genome rearrangements and phylogeny reconstruction in Yersinia pestis type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 6 year: '2018' ... --- _id: '8297' abstract: - lang: eng text: "Designing a secure permissionless distributed ledger (blockchain) that performs on par with centralized payment\r\nprocessors, such as Visa, is a challenging task. Most existing distributed ledgers are unable to scale-out, i.e., to grow their totalprocessing capacity with the number of validators; and those that do, compromise security or decentralization. We present OmniLedger, a novel scale-out distributed ledger that preserves longterm security under permissionless operation. It ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient crossshard commit protocol that atomically handles transactions affecting multiple shards. OmniLedger also optimizes performance via parallel intra-shard transaction processing, ledger pruning via collectively-signed state blocks, and low-latency “trust-butverify” \r\nvalidation for low-value transactions. An evaluation ofour experimental prototype shows that OmniLedger’s throughput\r\nscales linearly in the number of active validators, supporting Visa-level workloads and beyond, while confirming typical transactions in under two seconds." article_processing_charge: No author: - first_name: Eleftherios full_name: Kokoris Kogias, Eleftherios id: f5983044-d7ef-11ea-ac6d-fd1430a26d30 last_name: Kokoris Kogias - first_name: Philipp full_name: Jovanovic, Philipp last_name: Jovanovic - first_name: Linus full_name: Gasser, Linus last_name: Gasser - first_name: Nicolas full_name: Gailly, Nicolas last_name: Gailly - first_name: Ewa full_name: Syta, Ewa last_name: Syta - first_name: Bryan full_name: Ford, Bryan last_name: Ford citation: ama: 'Kokoris Kogias E, Jovanovic P, Gasser L, Gailly N, Syta E, Ford B. OmniLedger: A secure, scale-out, decentralized ledger via sharding. In: 2018 IEEE Symposium on Security and Privacy. IEEE; 2018:583-598. doi:10.1109/sp.2018.000-5' apa: 'Kokoris Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., & Ford, B. (2018). OmniLedger: A secure, scale-out, decentralized ledger via sharding. In 2018 IEEE Symposium on Security and Privacy (pp. 583–598). San Francisco, CA, United States: IEEE. https://doi.org/10.1109/sp.2018.000-5' chicago: 'Kokoris Kogias, Eleftherios, Philipp Jovanovic, Linus Gasser, Nicolas Gailly, Ewa Syta, and Bryan Ford. “OmniLedger: A Secure, Scale-out, Decentralized Ledger via Sharding.” In 2018 IEEE Symposium on Security and Privacy, 583–98. IEEE, 2018. https://doi.org/10.1109/sp.2018.000-5.' ieee: 'E. Kokoris Kogias, P. Jovanovic, L. Gasser, N. Gailly, E. Syta, and B. Ford, “OmniLedger: A secure, scale-out, decentralized ledger via sharding,” in 2018 IEEE Symposium on Security and Privacy, San Francisco, CA, United States, 2018, pp. 583–598.' ista: 'Kokoris Kogias E, Jovanovic P, Gasser L, Gailly N, Syta E, Ford B. 2018. OmniLedger: A secure, scale-out, decentralized ledger via sharding. 2018 IEEE Symposium on Security and Privacy. SP: Symposium on Security and Privacy, 583–598.' mla: 'Kokoris Kogias, Eleftherios, et al. “OmniLedger: A Secure, Scale-out, Decentralized Ledger via Sharding.” 2018 IEEE Symposium on Security and Privacy, IEEE, 2018, pp. 583–98, doi:10.1109/sp.2018.000-5.' short: E. Kokoris Kogias, P. Jovanovic, L. Gasser, N. Gailly, E. Syta, B. Ford, in:, 2018 IEEE Symposium on Security and Privacy, IEEE, 2018, pp. 583–598. conference: end_date: 2018-05-24 location: San Francisco, CA, United States name: 'SP: Symposium on Security and Privacy' start_date: 2018-05-20 date_created: 2020-08-26T11:46:35Z date_published: 2018-07-26T00:00:00Z date_updated: 2021-01-12T08:17:56Z day: '26' doi: 10.1109/sp.2018.000-5 extern: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2017/406 month: '07' oa: 1 oa_version: Preprint page: 583-598 publication: 2018 IEEE Symposium on Security and Privacy publication_identifier: isbn: - '9781538643532' issn: - 2375-1207 publication_status: published publisher: IEEE quality_controlled: '1' status: public title: 'OmniLedger: A secure, scale-out, decentralized ledger via sharding' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '8547' abstract: - lang: eng text: The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex. acknowledgement: We thank I. Andrew and S.E. Bae for excellent technical assistance, F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members of the Marín and Rico laboratories for stimulating discussions and ideas. Our research on this topic is supported by grants from the European Research Council (ERC-2017-AdG 787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M. L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the European Commission under the H2020 Programme. article_processing_charge: No author: - first_name: Alfredo full_name: Llorca, Alfredo last_name: Llorca - first_name: Gabriele full_name: Ciceri, Gabriele last_name: Ciceri - first_name: Robert J full_name: Beattie, Robert J id: 2E26DF60-F248-11E8-B48F-1D18A9856A87 last_name: Beattie orcid: 0000-0002-8483-8753 - first_name: Fong K. full_name: Wong, Fong K. last_name: Wong - first_name: Giovanni full_name: Diana, Giovanni last_name: Diana - first_name: Eleni full_name: Serafeimidou, Eleni last_name: Serafeimidou - first_name: Marian full_name: Fernández-Otero, Marian last_name: Fernández-Otero - first_name: Carmen full_name: Streicher, Carmen id: 36BCB99C-F248-11E8-B48F-1D18A9856A87 last_name: Streicher - first_name: Sebastian J. full_name: Arnold, Sebastian J. last_name: Arnold - first_name: Martin full_name: Meyer, Martin last_name: Meyer - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Miguel full_name: Maravall, Miguel last_name: Maravall - first_name: Oscar full_name: Marín, Oscar last_name: Marín citation: ama: Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv. doi:10.1101/494088 apa: Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/494088 chicago: Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/494088. ieee: A. Llorca et al., “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” bioRxiv. Cold Spring Harbor Laboratory. ista: Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv, 10.1101/494088. mla: Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/494088. short: A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou, M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall, O. Marín, BioRxiv (n.d.). date_created: 2020-09-21T12:01:50Z date_published: 2018-12-13T00:00:00Z date_updated: 2021-01-12T08:20:00Z day: '13' department: - _id: SiHi doi: 10.1101/494088 ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/494088 month: '12' oa: 1 oa_version: Preprint project: - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development - _id: 264E56E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02416 name: Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex publication: bioRxiv publication_status: submitted publisher: Cold Spring Harbor Laboratory status: public title: Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2018' ... --- _id: '86' abstract: - lang: eng text: Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms. acknowledgement: 'This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.' alternative_title: - LNCS author: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Jan full_name: Otop, Jan id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87 last_name: Otop citation: ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer; 2018:143-161. doi:10.1007/978-3-319-95246-8_9' apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9 chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9. ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161. ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.' mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9. short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161. date_created: 2018-12-11T11:44:33Z date_published: 2018-07-20T00:00:00Z date_updated: 2021-01-12T08:20:14Z day: '20' ddc: - '000' department: - _id: KrCh - _id: ToHe doi: 10.1007/978-3-319-95246-8_9 ec_funded: 1 editor: - first_name: Marten full_name: Lohstroh, Marten last_name: Lohstroh - first_name: Patricia full_name: Derler, Patricia last_name: Derler - first_name: Marjan full_name: Sirjani, Marjan last_name: Sirjani file: - access_level: open_access checksum: 9995c6ce6957333baf616fc4f20be597 content_type: application/pdf creator: dernst date_created: 2019-11-19T08:22:18Z date_updated: 2020-07-14T12:48:14Z file_id: '7053' file_name: 2018_PrinciplesModeling_Chatterjee.pdf file_size: 516307 relation: main_file file_date_updated: 2020-07-14T12:48:14Z has_accepted_license: '1' intvolume: ' 10760' language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 143 - 161 project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25863FF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11407 name: Game Theory - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _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 publication: Principles of Modeling publication_status: published publisher: Springer publist_id: '7968' quality_controlled: '1' scopus_import: 1 status: public title: Computing average response time type: book_chapter user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10760 year: '2018' ... --- _id: '9062' abstract: - lang: eng text: 'Self-assembly is the autonomous organization of components into patterns or structures: an essential ingredient of biology and a desired route to complex organization1. At equilibrium, the structure is encoded through specific interactions2,3,4,5,6,7,8, at an unfavourable entropic cost for the system. An alternative approach, widely used by nature, uses energy input to bypass the entropy bottleneck and develop features otherwise impossible at equilibrium9. Dissipative building blocks that inject energy locally were made available by recent advances in colloidal science10,11 but have not been used to control self-assembly. Here we show the targeted formation of self-powered microgears from active particles and their autonomous synchronization into dynamical superstructures. We use a photoactive component that consumes fuel, haematite, to devise phototactic microswimmers that form self-spinning microgears following spatiotemporal light patterns. The gears are coupled via their chemical clouds by diffusiophoresis12 and constitute the elementary bricks of synchronized superstructures, which autonomously regulate their dynamics. The results are quantitatively rationalized on the basis of a stochastic description of diffusio-phoretic oscillators dynamically coupled by chemical gradients. Our findings harness non-equilibrium phoretic phenomena to program interactions and direct self-assembly with fidelity and specificity. It lays the groundwork for the autonomous construction of dynamical architectures and functional micro-machinery.' article_processing_charge: No article_type: original author: - first_name: Antoine full_name: Aubret, Antoine last_name: Aubret - first_name: Mena full_name: Youssef, Mena last_name: Youssef - first_name: Stefano full_name: Sacanna, Stefano last_name: Sacanna - first_name: Jérémie A full_name: Palacci, Jérémie A id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d last_name: Palacci orcid: 0000-0002-7253-9465 citation: ama: Aubret A, Youssef M, Sacanna S, Palacci JA. Targeted assembly and synchronization of self-spinning microgears. Nature Physics. 2018;14(11):1114-1118. doi:10.1038/s41567-018-0227-4 apa: Aubret, A., Youssef, M., Sacanna, S., & Palacci, J. A. (2018). Targeted assembly and synchronization of self-spinning microgears. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-018-0227-4 chicago: Aubret, Antoine, Mena Youssef, Stefano Sacanna, and Jérémie A Palacci. “Targeted Assembly and Synchronization of Self-Spinning Microgears.” Nature Physics. Springer Nature, 2018. https://doi.org/10.1038/s41567-018-0227-4. ieee: A. Aubret, M. Youssef, S. Sacanna, and J. A. Palacci, “Targeted assembly and synchronization of self-spinning microgears,” Nature Physics, vol. 14, no. 11. Springer Nature, pp. 1114–1118, 2018. ista: Aubret A, Youssef M, Sacanna S, Palacci JA. 2018. Targeted assembly and synchronization of self-spinning microgears. Nature Physics. 14(11), 1114–1118. mla: Aubret, Antoine, et al. “Targeted Assembly and Synchronization of Self-Spinning Microgears.” Nature Physics, vol. 14, no. 11, Springer Nature, 2018, pp. 1114–18, doi:10.1038/s41567-018-0227-4. short: A. Aubret, M. Youssef, S. Sacanna, J.A. Palacci, Nature Physics 14 (2018) 1114–1118. date_created: 2021-02-02T13:52:49Z date_published: 2018-11-01T00:00:00Z date_updated: 2023-02-23T13:48:02Z day: '01' doi: 10.1038/s41567-018-0227-4 extern: '1' external_id: arxiv: - '1810.01033' intvolume: ' 14' issue: '11' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1810.01033 month: '11' oa: 1 oa_version: Preprint page: 1114-1118 publication: Nature Physics publication_identifier: eissn: - 1745-2481 issn: - 1745-2473 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Targeted assembly and synchronization of self-spinning microgears type: journal_article user_id: D865714E-FA4E-11E9-B85B-F5C5E5697425 volume: 14 year: '2018' ... --- _id: '9229' alternative_title: - Molecular and cellular neuroscience article_processing_charge: No article_type: letter_note author: - first_name: Johann G full_name: Danzl, Johann G id: 42EFD3B6-F248-11E8-B48F-1D18A9856A87 last_name: Danzl orcid: 0000-0001-8559-3973 citation: ama: Danzl JG. Diffraction-unlimited optical imaging for synaptic physiology. Opera Medica et Physiologica. 2018;4(S1):11. doi:10.20388/omp2018.00s1.001 apa: Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology. Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod. https://doi.org/10.20388/omp2018.00s1.001 chicago: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.” Opera Medica et Physiologica. Lobachevsky State University of Nizhny Novgorod, 2018. https://doi.org/10.20388/omp2018.00s1.001. ieee: J. G. Danzl, “Diffraction-unlimited optical imaging for synaptic physiology,” Opera Medica et Physiologica, vol. 4, no. S1. Lobachevsky State University of Nizhny Novgorod, p. 11, 2018. ista: Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology. Opera Medica et Physiologica. 4(S1), 11. mla: Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.” Opera Medica et Physiologica, vol. 4, no. S1, Lobachevsky State University of Nizhny Novgorod, 2018, p. 11, doi:10.20388/omp2018.00s1.001. short: J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11. date_created: 2021-03-07T23:01:25Z date_published: 2018-06-30T00:00:00Z date_updated: 2021-12-03T07:31:05Z day: '30' department: - _id: JoDa doi: 10.20388/omp2018.00s1.001 intvolume: ' 4' issue: S1 language: - iso: eng main_file_link: - open_access: '1' url: http://operamedphys.org/content/molecular-and-cellular-neuroscience month: '06' oa: 1 oa_version: Published Version page: '11' publication: Opera Medica et Physiologica publication_identifier: eissn: - 2500-2295 issn: - 2500-2287 publication_status: published publisher: Lobachevsky State University of Nizhny Novgorod quality_controlled: '1' scopus_import: '1' status: public title: Diffraction-unlimited optical imaging for synaptic physiology type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 4 year: '2018' ... --- _id: '6005' abstract: - lang: eng text: Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load. Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks. The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting. alternative_title: - LIPIcs article_number: '23' article_processing_charge: No author: - first_name: Guy full_name: Avni, Guy id: 463C8BC2-F248-11E8-B48F-1D18A9856A87 last_name: Avni orcid: 0000-0001-5588-8287 - first_name: Shibashis full_name: Guha, Shibashis last_name: Guha - first_name: Orna full_name: Kupferman, Orna last_name: Kupferman citation: ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23' apa: 'Avni, G., Guha, S., & Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2018.23' chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.MFCS.2018.23. ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.' ista: 'Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.' mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23. short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. conference: end_date: 2018-08-31 location: Liverpool, United Kingdom name: 'MFCS: Mathematical Foundations of Computer Science' start_date: 2018-08-27 date_created: 2019-02-14T14:12:09Z date_published: 2018-08-01T00:00:00Z date_updated: 2023-02-23T14:02:58Z day: '01' ddc: - '000' department: - _id: ToHe doi: 10.4230/LIPICS.MFCS.2018.23 file: - access_level: open_access checksum: 41ab2ae9b63f5eb49fa995250c0ba128 content_type: application/pdf creator: dernst date_created: 2019-02-14T14:22:04Z date_updated: 2020-07-14T12:47:15Z file_id: '6007' file_name: 2018_LIPIcs_Avni.pdf file_size: 542889 relation: main_file file_date_updated: 2020-07-14T12:47:15Z has_accepted_license: '1' intvolume: ' 117' language: - iso: eng month: '08' oa: 1 oa_version: Published Version project: - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory publication_identifier: issn: - 1868-8969 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '963' relation: earlier_version status: public scopus_import: '1' status: public title: Timed network games with clocks 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: 117 year: '2018' ... --- _id: '9668' abstract: - lang: eng text: Estimating the homogeneous ice nucleation rate from undercooled liquid water is crucial for understanding many important physical phenomena and technological applications, and challenging for both experiments and theory. From a theoretical point of view, difficulties arise due to the long time scales required, as well as the numerous nucleation pathways involved to form ice nuclei with different stacking disorders. We computed the homogeneous ice nucleation rate at a physically relevant undercooling for a single-site water model, taking into account the diffuse nature of ice–water interfaces, stacking disorders in ice nuclei, and the addition rate of particles to the critical nucleus. We disentangled and investigated the relative importance of all the terms, including interfacial free energy, entropic contributions and the kinetic prefactor, that contribute to the overall nucleation rate. Breaking down the problem into pieces not only provides physical insights into ice nucleation, but also sheds light on the long-standing discrepancy between different theoretical predictions, as well as between theoretical and experimental determinations of the nucleation rate. Moreover, we pinpoint the main shortcomings and suggest strategies to systematically improve the existing simulation methods. article_processing_charge: No article_type: original author: - first_name: Bingqing full_name: Cheng, Bingqing id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9 last_name: Cheng orcid: 0000-0002-3584-9632 - first_name: Christoph full_name: Dellago, Christoph last_name: Dellago - first_name: Michele full_name: Ceriotti, Michele last_name: Ceriotti citation: ama: 'Cheng B, Dellago C, Ceriotti M. Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics. Physical Chemistry Chemical Physics. 2018;20(45):28732-28740. doi:10.1039/c8cp04561e' apa: 'Cheng, B., Dellago, C., & Ceriotti, M. (2018). Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics. Physical Chemistry Chemical Physics. Royal Society of Chemistry. https://doi.org/10.1039/c8cp04561e' chicago: 'Cheng, Bingqing, Christoph Dellago, and Michele Ceriotti. “Theoretical Prediction of the Homogeneous Ice Nucleation Rate: Disentangling Thermodynamics and Kinetics.” Physical Chemistry Chemical Physics. Royal Society of Chemistry, 2018. https://doi.org/10.1039/c8cp04561e.' ieee: 'B. Cheng, C. Dellago, and M. Ceriotti, “Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics,” Physical Chemistry Chemical Physics, vol. 20, no. 45. Royal Society of Chemistry, pp. 28732–28740, 2018.' ista: 'Cheng B, Dellago C, Ceriotti M. 2018. Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics. Physical Chemistry Chemical Physics. 20(45), 28732–28740.' mla: 'Cheng, Bingqing, et al. “Theoretical Prediction of the Homogeneous Ice Nucleation Rate: Disentangling Thermodynamics and Kinetics.” Physical Chemistry Chemical Physics, vol. 20, no. 45, Royal Society of Chemistry, 2018, pp. 28732–40, doi:10.1039/c8cp04561e.' short: B. Cheng, C. Dellago, M. Ceriotti, Physical Chemistry Chemical Physics 20 (2018) 28732–28740. date_created: 2021-07-15T12:51:44Z date_published: 2018-12-07T00:00:00Z date_updated: 2021-08-09T12:36:47Z day: '07' doi: 10.1039/c8cp04561e extern: '1' external_id: arxiv: - '1807.05551' pmid: - '30412211' intvolume: ' 20' issue: '45' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1807.05551 month: '12' oa: 1 oa_version: Preprint page: 28732-28740 pmid: 1 publication: Physical Chemistry Chemical Physics publication_identifier: eissn: - 1463-9084 issn: - 1463-9076 publication_status: published publisher: Royal Society of Chemistry quality_controlled: '1' scopus_import: '1' status: public title: 'Theoretical prediction of the homogeneous ice nucleation rate: Disentangling thermodynamics and kinetics' type: journal_article user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 20 year: '2018' ... --- _id: '9687' abstract: - lang: eng text: The Gibbs free energy is the fundamental thermodynamic potential underlying the relative stability of different states of matter under constant-pressure conditions. However, computing this quantity from atomic-scale simulations is far from trivial, so the potential energy of a system is often used as a proxy. In this paper, we use a combination of thermodynamic integration methods to accurately evaluate the Gibbs free energies associated with defects in crystals, including the vacancy formation energy in bcc iron, and the stacking fault energy in fcc nickel, iron, and cobalt. We quantify the importance of entropic and anharmonic effects in determining the free energies of defects at high temperatures, and show that the potential energy approximation as well as the harmonic approximation may produce inaccurate or even qualitatively wrong results. Our calculations manifest the necessity to employ accurate free energy methods such as thermodynamic integration to estimate the stability of crystallographic defects at high temperatures. article_number: '054102' article_processing_charge: No article_type: original author: - first_name: Bingqing full_name: Cheng, Bingqing id: cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9 last_name: Cheng orcid: 0000-0002-3584-9632 - first_name: Michele full_name: Ceriotti, Michele last_name: Ceriotti citation: ama: 'Cheng B, Ceriotti M. Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids. Physical Review B. 2018;97(5). doi:10.1103/physrevb.97.054102' apa: 'Cheng, B., & Ceriotti, M. (2018). Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids. Physical Review B. American Physical Society. https://doi.org/10.1103/physrevb.97.054102' chicago: 'Cheng, Bingqing, and Michele Ceriotti. “Computing the Absolute Gibbs Free Energy in Atomistic Simulations: Applications to Defects in Solids.” Physical Review B. American Physical Society, 2018. https://doi.org/10.1103/physrevb.97.054102.' ieee: 'B. Cheng and M. Ceriotti, “Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids,” Physical Review B, vol. 97, no. 5. American Physical Society, 2018.' ista: 'Cheng B, Ceriotti M. 2018. Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids. Physical Review B. 97(5), 054102.' mla: 'Cheng, Bingqing, and Michele Ceriotti. “Computing the Absolute Gibbs Free Energy in Atomistic Simulations: Applications to Defects in Solids.” Physical Review B, vol. 97, no. 5, 054102, American Physical Society, 2018, doi:10.1103/physrevb.97.054102.' short: B. Cheng, M. Ceriotti, Physical Review B 97 (2018). date_created: 2021-07-19T09:39:48Z date_published: 2018-02-01T00:00:00Z date_updated: 2021-08-09T12:38:26Z day: '01' doi: 10.1103/physrevb.97.054102 extern: '1' external_id: arxiv: - '1710.02815' intvolume: ' 97' issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1710.02815 month: '02' oa: 1 oa_version: Preprint publication: Physical Review B publication_identifier: eissn: - 2469-9969 issn: - 2469-9950 publication_status: published publisher: American Physical Society quality_controlled: '1' scopus_import: '1' status: public title: 'Computing the absolute Gibbs free energy in atomistic simulations: Applications to defects in solids' type: journal_article user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf volume: 97 year: '2018' ... --- _id: '315' abstract: - lang: eng text: 'More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range.' article_number: e2005372 author: - first_name: Jitka full_name: Polechova, Jitka id: 3BBFB084-F248-11E8-B48F-1D18A9856A87 last_name: Polechova orcid: 0000-0003-0951-3112 citation: ama: Polechova J. Is the sky the limit? On the expansion threshold of a species’ range. PLoS Biology. 2018;16(6). doi:10.1371/journal.pbio.2005372 apa: Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a species’ range. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005372 chicago: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” PLoS Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005372. ieee: J. Polechova, “Is the sky the limit? On the expansion threshold of a species’ range,” PLoS Biology, vol. 16, no. 6. Public Library of Science, 2018. ista: Polechova J. 2018. Is the sky the limit? On the expansion threshold of a species’ range. PLoS Biology. 16(6), e2005372. mla: Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” PLoS Biology, vol. 16, no. 6, e2005372, Public Library of Science, 2018, doi:10.1371/journal.pbio.2005372. short: J. Polechova, PLoS Biology 16 (2018). date_created: 2018-12-11T11:45:46Z date_published: 2018-06-15T00:00:00Z date_updated: 2023-02-23T14:10:16Z day: '15' ddc: - '576' department: - _id: NiBa doi: 10.1371/journal.pbio.2005372 file: - access_level: open_access checksum: 908c52751bba30c55ed36789e5e4c84d content_type: application/pdf creator: dernst date_created: 2019-01-22T08:30:03Z date_updated: 2020-07-14T12:46:01Z file_id: '5870' file_name: 2017_PLOS_Polechova.pdf file_size: 6968201 relation: main_file file_date_updated: 2020-07-14T12:46:01Z has_accepted_license: '1' intvolume: ' 16' issue: '6' language: - iso: eng month: '06' oa: 1 oa_version: Published Version publication: PLoS Biology publication_identifier: issn: - '15449173' publication_status: published publisher: Public Library of Science publist_id: '7550' quality_controlled: '1' related_material: record: - id: '9839' relation: research_data status: public scopus_import: 1 status: public title: Is the sky the limit? On the expansion threshold of a species’ range 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: 16 year: '2018' ...