--- _id: '6819' abstract: - lang: eng text: Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations have been shown to exert toxicity via various mechanisms. It has been asserted that glyphosate substitutes for glycine in polypeptide chains leading to protein misfolding and toxicity. However, as no direct evidence exists for glycine to glyphosate substitution in proteins, including in mammalian organisms, we tested this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts from three treated and three untreated cell cultures were analysed as one TMT-6plex labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities for peptides bearing true glyphosate treatment induced-post translational modifications as well as allowing an investigation of the total proteome. article_number: '494' article_processing_charge: No author: - first_name: Michael N. full_name: Antoniou, Michael N. last_name: Antoniou - first_name: Armel full_name: Nicolas, Armel id: 2A103192-F248-11E8-B48F-1D18A9856A87 last_name: Nicolas - first_name: Robin full_name: Mesnage, Robin last_name: Mesnage - first_name: Martina full_name: Biserni, Martina last_name: Biserni - first_name: Francesco V. full_name: Rao, Francesco V. last_name: Rao - first_name: Cristina Vazquez full_name: Martin, Cristina Vazquez last_name: Martin citation: ama: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 2019;12. doi:10.1186/s13104-019-4534-3 apa: Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. BioMed Central. https://doi.org/10.1186/s13104-019-4534-3 chicago: Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes. BioMed Central, 2019. https://doi.org/10.1186/s13104-019-4534-3. ieee: M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells,” BMC Research Notes, vol. 12. BioMed Central, 2019. ista: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. BMC Research Notes. 12, 494. mla: Antoniou, Michael N., et al. “Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” BMC Research Notes, vol. 12, 494, BioMed Central, 2019, doi:10.1186/s13104-019-4534-3. short: M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, BMC Research Notes 12 (2019). date_created: 2019-08-18T22:00:39Z date_published: 2019-08-08T00:00:00Z date_updated: 2023-02-23T14:08:14Z day: '08' ddc: - '570' department: - _id: LifeSc doi: 10.1186/s13104-019-4534-3 external_id: pmid: - '31395095' file: - access_level: open_access checksum: 4a2bb7994b7f2c432bf44f5127ea3102 content_type: application/pdf creator: dernst date_created: 2019-08-23T11:10:35Z date_updated: 2020-07-14T12:47:40Z file_id: '6829' file_name: 2019_BMC_Antoniou.pdf file_size: 1177482 relation: main_file file_date_updated: 2020-07-14T12:47:40Z has_accepted_license: '1' intvolume: ' 12' language: - iso: eng month: '08' oa: 1 oa_version: Published Version pmid: 1 publication: BMC Research Notes publication_identifier: eissn: - 1756-0500 publication_status: published publisher: BioMed Central quality_controlled: '1' related_material: record: - id: '9784' relation: research_data status: public scopus_import: 1 status: public title: Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells 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: 12 year: '2019' ... --- _id: '6822' abstract: - lang: eng text: "In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the qualitative winner or quantitative payoff of the game. In bidding games, in each turn, we hold an auction between the two players to determine which player moves the token. Bidding games have largely been studied with concrete bidding mechanisms that are variants of a first-price auction: in each turn both players simultaneously submit bids, the higher\r\nbidder moves the token, and pays his bid to the lower bidder in Richman bidding, to the bank in poorman bidding, and in taxman bidding, the bid is split between the other player and the bank according to a predefined constant factor. Bidding games are deterministic games. They have an intriguing connection with a fragment of stochastic games called \r\n randomturn games. We study, for the first time, a combination of bidding games with probabilistic behavior; namely, we study bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. We study parity and meanpayoff bidding games on MDPs and extend results from the deterministic bidding setting to the probabilistic one." alternative_title: - LNCS 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: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Rasmus full_name: Ibsen-Jensen, Rasmus id: 3B699956-F248-11E8-B48F-1D18A9856A87 last_name: Ibsen-Jensen orcid: 0000-0003-4783-0389 - first_name: Petr full_name: Novotny, Petr last_name: Novotny citation: ama: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. Bidding games on Markov decision processes. In: Proceedings of the 13th International Conference of Reachability Problems. Vol 11674. Springer; 2019:1-12. doi:10.1007/978-3-030-30806-3_1' apa: 'Avni, G., Henzinger, T. A., Ibsen-Jensen, R., & Novotny, P. (2019). Bidding games on Markov decision processes. In Proceedings of the 13th International Conference of Reachability Problems (Vol. 11674, pp. 1–12). Brussels, Belgium: Springer. https://doi.org/10.1007/978-3-030-30806-3_1' chicago: Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1. ieee: G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12. ista: 'Avni G, Henzinger TA, Ibsen-Jensen R, Novotny P. 2019. Bidding games on Markov decision processes. Proceedings of the 13th International Conference of Reachability Problems. RP: Reachability Problems, LNCS, vol. 11674, 1–12.' mla: Avni, Guy, et al. “Bidding Games on Markov Decision Processes.” Proceedings of the 13th International Conference of Reachability Problems, vol. 11674, Springer, 2019, pp. 1–12, doi:10.1007/978-3-030-30806-3_1. short: G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12. conference: end_date: 2019-09-13 location: Brussels, Belgium name: 'RP: Reachability Problems' start_date: 2019-09-11 date_created: 2019-08-19T07:58:10Z date_published: 2019-09-06T00:00:00Z date_updated: 2025-09-10T10:39:56Z day: '06' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-030-30806-3_1 external_id: isi: - '001333747500001' file: - access_level: open_access checksum: 45ebbc709af2b247d28c7c293c01504b content_type: application/pdf creator: gavni date_created: 2019-08-19T07:56:40Z date_updated: 2020-07-14T12:47:41Z file_id: '6823' file_name: prob.pdf file_size: 436635 relation: main_file file_date_updated: 2020-07-14T12:47:41Z has_accepted_license: '1' intvolume: ' 11674' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Submitted Version page: 1-12 project: - _id: 264B3912-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02369 name: Formal Methods meets Algorithmic Game Theory - _id: 25F2ACDE-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: Formal methods for the design and analysis of complex systems publication: ' Proceedings of the 13th International Conference of Reachability Problems' publication_identifier: isbn: - 978-303030805-6 issn: - 0302-9743 publication_status: published publisher: Springer quality_controlled: '1' scopus_import: '1' status: public title: Bidding games on Markov decision processes type: conference user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 11674 year: '2019' ... --- _id: '6933' abstract: - lang: eng text: "We design fast deterministic algorithms for distance computation in the CONGESTED CLIQUE model. Our key contributions include:\r\n\r\n - A (2+ε)-approximation for all-pairs shortest paths problem in O(log²n / ε) rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model.\r\n - A (1+ε)-approximation for multi-source shortest paths problem from O(√n) sources in O(log² n / ε) rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size.\r\n\r\nOur main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in Õ(n^{1/6}) rounds." article_processing_charge: No arxiv: 1 author: - first_name: Keren full_name: Censor-Hillel, Keren last_name: Censor-Hillel - first_name: Michal full_name: Dory, Michal last_name: Dory - first_name: Janne full_name: Korhonen, Janne id: C5402D42-15BC-11E9-A202-CA2BE6697425 last_name: Korhonen - first_name: Dean full_name: Leitersdorf, Dean last_name: Leitersdorf citation: ama: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. Fast approximate shortest paths in the congested clique. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. ACM; 2019:74-83. doi:10.1145/3293611.3331633' apa: 'Censor-Hillel, K., Dory, M., Korhonen, J., & Leitersdorf, D. (2019). Fast approximate shortest paths in the congested clique. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin (pp. 74–83). Toronto, ON, Canada: ACM. https://doi.org/10.1145/3293611.3331633' chicago: Censor-Hillel, Keren, Michal Dory, Janne Korhonen, and Dean Leitersdorf. “Fast Approximate Shortest Paths in the Congested Clique.” In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, 74–83. ACM, 2019. https://doi.org/10.1145/3293611.3331633. ieee: K. Censor-Hillel, M. Dory, J. Korhonen, and D. Leitersdorf, “Fast approximate shortest paths in the congested clique,” in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, Toronto, ON, Canada, 2019, pp. 74–83. ista: 'Censor-Hillel K, Dory M, Korhonen J, Leitersdorf D. 2019. Fast approximate shortest paths in the congested clique. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin. PODC: Symposium on Principles of Distributed Computing, 74–83.' mla: Censor-Hillel, Keren, et al. “Fast Approximate Shortest Paths in the Congested Clique.” Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83, doi:10.1145/3293611.3331633. short: K. Censor-Hillel, M. Dory, J. Korhonen, D. Leitersdorf, in:, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin, ACM, 2019, pp. 74–83. conference: end_date: 2019-08-02 location: Toronto, ON, Canada name: 'PODC: Symposium on Principles of Distributed Computing' start_date: 2019-07-29 date_created: 2019-10-08T12:48:42Z date_published: 2019-08-01T00:00:00Z date_updated: 2026-06-18T19:28:41Z day: '01' department: - _id: DaAl doi: 10.1145/3293611.3331633 external_id: arxiv: - '1903.05956' isi: - '000570442000011' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1903.05956 month: '08' oa: 1 oa_version: Preprint page: 74-83 publication: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computin publication_identifier: isbn: - '9781450362177' publication_status: published publisher: ACM quality_controlled: '1' related_material: record: - id: '7939' relation: later_version status: public scopus_import: '1' status: public title: Fast approximate shortest paths in the congested clique type: conference user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8 year: '2019' ... --- _id: '9784' abstract: - lang: eng text: 'Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1 of seeding flasks and following 6-days of continuous culture. Note: no differences in cell numbers were observed between negative control and glyphosate treated cultures.' article_processing_charge: No author: - first_name: Michael N. full_name: Antoniou, Michael N. last_name: Antoniou - first_name: Armel full_name: Nicolas, Armel id: 2A103192-F248-11E8-B48F-1D18A9856A87 last_name: Nicolas - first_name: Robin full_name: Mesnage, Robin last_name: Mesnage - first_name: Martina full_name: Biserni, Martina last_name: Biserni - first_name: Francesco V. full_name: Rao, Francesco V. last_name: Rao - first_name: Cristina Vazquez full_name: Martin, Cristina Vazquez last_name: Martin citation: ama: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. 2019. doi:10.6084/m9.figshare.9411761.v1 apa: Antoniou, M. N., Nicolas, A., Mesnage, R., Biserni, M., Rao, F. V., & Martin, C. V. (2019). MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells. Springer Nature. https://doi.org/10.6084/m9.figshare.9411761.v1 chicago: Antoniou, Michael N., Armel Nicolas, Robin Mesnage, Martina Biserni, Francesco V. Rao, and Cristina Vazquez Martin. “MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells.” Springer Nature, 2019. https://doi.org/10.6084/m9.figshare.9411761.v1. ieee: M. N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F. V. Rao, and C. V. Martin, “MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells.” Springer Nature, 2019. ista: Antoniou MN, Nicolas A, Mesnage R, Biserni M, Rao FV, Martin CV. 2019. MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells, Springer Nature, 10.6084/m9.figshare.9411761.v1. mla: Antoniou, Michael N., et al. MOESM1 of Glyphosate Does Not Substitute for Glycine in Proteins of Actively Dividing Mammalian Cells. Springer Nature, 2019, doi:10.6084/m9.figshare.9411761.v1. short: M.N. Antoniou, A. Nicolas, R. Mesnage, M. Biserni, F.V. Rao, C.V. Martin, (2019). date_created: 2021-08-06T08:14:05Z date_published: 2019-08-09T00:00:00Z date_updated: 2023-02-23T12:52:29Z day: '09' department: - _id: LifeSc doi: 10.6084/m9.figshare.9411761.v1 main_file_link: - open_access: '1' url: https://doi.org/10.6084/m9.figshare.9411761.v1 month: '08' oa: 1 oa_version: Published Version publisher: Springer Nature related_material: record: - id: '6819' relation: used_in_publication status: public status: public title: MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2019' ... --- _id: '9805' abstract: - lang: eng text: The spread of adaptive alleles is fundamental to evolution, and in theory, this process is well‐understood. However, only rarely can we follow this process—whether it originates from the spread of a new mutation, or by introgression from another population. In this issue of Molecular Ecology, Hanemaaijer et al. (2018) report on a 25‐year long study of the mosquitoes Anopheles gambiae (Figure 1) and Anopheles coluzzi in Mali, based on genotypes at 15 single‐nucleotide polymorphism (SNP). The species are usually reproductively isolated from each other, but in 2002 and 2006, bursts of hybridization were observed, when F1 hybrids became abundant. Alleles backcrossed from A. gambiae into A. coluzzi, but after the first event, these declined over the following years. In contrast, after 2006, an insecticide resistance allele that had established in A. gambiae spread into A. coluzzi, and rose to high frequency there, over 6 years (~75 generations). Whole genome sequences of 74 individuals showed that A. gambiae SNP from across the genome had become common in the A. coluzzi population, but that most of these were clustered in 34 genes around the resistance locus. A new set of SNP from 25 of these genes were assayed over time; over the 4 years since near‐fixation of the resistance allele; some remained common, whereas others declined. What do these patterns tell us about this introgression event? article_processing_charge: No author: - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 citation: ama: 'Barton NH. Data from: The consequences of an introgression event. 2019. doi:10.5061/dryad.2kb6fh4' apa: 'Barton, N. H. (2019). Data from: The consequences of an introgression event. Dryad. https://doi.org/10.5061/dryad.2kb6fh4' chicago: 'Barton, Nicholas H. “Data from: The Consequences of an Introgression Event.” Dryad, 2019. https://doi.org/10.5061/dryad.2kb6fh4.' ieee: 'N. H. Barton, “Data from: The consequences of an introgression event.” Dryad, 2019.' ista: 'Barton NH. 2019. Data from: The consequences of an introgression event, Dryad, 10.5061/dryad.2kb6fh4.' mla: 'Barton, Nicholas H. Data from: The Consequences of an Introgression Event. Dryad, 2019, doi:10.5061/dryad.2kb6fh4.' short: N.H. Barton, (2019). date_created: 2021-08-06T12:03:50Z date_published: 2019-01-09T00:00:00Z date_updated: 2025-07-10T11:52:34Z day: '09' department: - _id: NiBa doi: 10.5061/dryad.2kb6fh4 main_file_link: - open_access: '1' url: https://doi.org/10.5061/dryad.2kb6fh4 month: '01' oa: 1 oa_version: Published Version publisher: Dryad related_material: record: - id: '40' relation: used_in_publication status: public status: public title: 'Data from: The consequences of an introgression event' type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2019' ... --- _id: '9897' abstract: - lang: eng text: Frameshift and nonsense mutations near homopolymeric tracts of OG1 genes. Only 374 genes with typical length and domain composition were considered. (CSV 6 kb) article_processing_charge: No author: - first_name: Olga M. full_name: Sigalova, Olga M. last_name: Sigalova - first_name: Andrei V. full_name: Chaplin, Andrei V. last_name: Chaplin - first_name: Olga full_name: Bochkareva, Olga id: C4558D3C-6102-11E9-A62E-F418E6697425 last_name: Bochkareva orcid: 0000-0003-1006-6639 - first_name: Pavel V. full_name: Shelyakin, Pavel V. last_name: Shelyakin - first_name: Vsevolod A. full_name: Filaretov, Vsevolod A. last_name: Filaretov - first_name: Evgeny E. full_name: Akkuratov, Evgeny E. last_name: Akkuratov - first_name: Valentina full_name: Burskaia, Valentina last_name: Burskaia - first_name: Mikhail S. full_name: Gelfand, Mikhail S. last_name: Gelfand citation: ama: Sigalova OM, Chaplin AV, Bochkareva O, et al. Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction. 2019. doi:10.6084/m9.figshare.9808850.v1 apa: Sigalova, O. M., Chaplin, A. V., Bochkareva, O., Shelyakin, P. V., Filaretov, V. A., Akkuratov, E. E., … Gelfand, M. S. (2019). Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction. Springer Nature. https://doi.org/10.6084/m9.figshare.9808850.v1 chicago: Sigalova, Olga M., Andrei V. Chaplin, Olga Bochkareva, Pavel V. Shelyakin, Vsevolod A. Filaretov, Evgeny E. Akkuratov, Valentina Burskaia, and Mikhail S. Gelfand. “Additional File 20 of Chlamydia Pan-Genomic Analysis Reveals Balance between Host Adaptation and Selective Pressure to Genome Reduction.” Springer Nature, 2019. https://doi.org/10.6084/m9.figshare.9808850.v1. ieee: O. M. Sigalova et al., “Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction.” Springer Nature, 2019. ista: Sigalova OM, Chaplin AV, Bochkareva O, Shelyakin PV, Filaretov VA, Akkuratov EE, Burskaia V, Gelfand MS. 2019. Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction, Springer Nature, 10.6084/m9.figshare.9808850.v1. mla: Sigalova, Olga M., et al. Additional File 20 of Chlamydia Pan-Genomic Analysis Reveals Balance between Host Adaptation and Selective Pressure to Genome Reduction. Springer Nature, 2019, doi:10.6084/m9.figshare.9808850.v1. short: O.M. Sigalova, A.V. Chaplin, O. Bochkareva, P.V. Shelyakin, V.A. Filaretov, E.E. Akkuratov, V. Burskaia, M.S. Gelfand, (2019). date_created: 2021-08-12T07:58:15Z date_published: 2019-09-12T00:00:00Z date_updated: 2026-04-03T09:39:41Z day: '12' department: - _id: FyKo doi: 10.6084/m9.figshare.9808850.v1 main_file_link: - open_access: '1' url: https://doi.org/10.6084/m9.figshare.9808850.v1 month: '09' oa: 1 oa_version: Published Version publisher: Springer Nature related_material: record: - id: '6898' relation: used_in_publication status: public status: public title: Additional file 20 of Chlamydia pan-genomic analysis reveals balance between host adaptation and selective pressure to genome reduction type: research_data_reference user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf year: '2019' ... --- _id: '10874' abstract: - lang: eng text: In this article we prove an analogue of a theorem of Lachaud, Ritzenthaler, and Zykin, which allows us to connect invariants of binary octics to Siegel modular forms of genus 3. We use this connection to show that certain modular functions, when restricted to the hyperelliptic locus, assume values whose denominators are products of powers of primes of bad reduction for the associated hyperelliptic curves. We illustrate our theorem with explicit computations. This work is motivated by the study of the values of these modular functions at CM points of the Siegel upper half-space, which, if their denominators are known, can be used to effectively compute models of (hyperelliptic, in our case) curves with CM. acknowledgement: "The authors would like to thank the Lorentz Center in Leiden for hosting the Women in Numbers Europe 2 workshop and providing a productive and enjoyable environment for our initial work on this project. We are grateful to the organizers of WIN-E2, Irene Bouw, Rachel Newton and Ekin Ozman, for making this conference and this collaboration possible. We\r\nthank Irene Bouw and Christophe Ritzenhaler for helpful discussions. Ionica acknowledges support from the Thomas Jefferson Fund of the Embassy of France in the United States and the FACE Foundation. Most of Kılıçer’s work was carried out during her stay in Universiteit Leiden and Carl von Ossietzky Universität Oldenburg. Massierer was supported by the Australian Research Council (DP150101689). Vincent is supported by the National Science Foundation under Grant No. DMS-1802323 and by the Thomas Jefferson Fund of the Embassy of France in the United States and the FACE Foundation. " article_number: '9' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Sorina full_name: Ionica, Sorina last_name: Ionica - first_name: Pınar full_name: Kılıçer, Pınar last_name: Kılıçer - first_name: Kristin full_name: Lauter, Kristin last_name: Lauter - first_name: Elisa full_name: Lorenzo García, Elisa last_name: Lorenzo García - first_name: Maria-Adelina full_name: Manzateanu, Maria-Adelina id: be8d652e-a908-11ec-82a4-e2867729459c last_name: Manzateanu - first_name: Maike full_name: Massierer, Maike last_name: Massierer - first_name: Christelle full_name: Vincent, Christelle last_name: Vincent citation: ama: Ionica S, Kılıçer P, Lauter K, et al. Modular invariants for genus 3 hyperelliptic curves. Research in Number Theory. 2019;5. doi:10.1007/s40993-018-0146-6 apa: Ionica, S., Kılıçer, P., Lauter, K., Lorenzo García, E., Manzateanu, M.-A., Massierer, M., & Vincent, C. (2019). Modular invariants for genus 3 hyperelliptic curves. Research in Number Theory. Springer Nature. https://doi.org/10.1007/s40993-018-0146-6 chicago: Ionica, Sorina, Pınar Kılıçer, Kristin Lauter, Elisa Lorenzo García, Maria-Adelina Manzateanu, Maike Massierer, and Christelle Vincent. “Modular Invariants for Genus 3 Hyperelliptic Curves.” Research in Number Theory. Springer Nature, 2019. https://doi.org/10.1007/s40993-018-0146-6. ieee: S. Ionica et al., “Modular invariants for genus 3 hyperelliptic curves,” Research in Number Theory, vol. 5. Springer Nature, 2019. ista: Ionica S, Kılıçer P, Lauter K, Lorenzo García E, Manzateanu M-A, Massierer M, Vincent C. 2019. Modular invariants for genus 3 hyperelliptic curves. Research in Number Theory. 5, 9. mla: Ionica, Sorina, et al. “Modular Invariants for Genus 3 Hyperelliptic Curves.” Research in Number Theory, vol. 5, 9, Springer Nature, 2019, doi:10.1007/s40993-018-0146-6. short: S. Ionica, P. Kılıçer, K. Lauter, E. Lorenzo García, M.-A. Manzateanu, M. Massierer, C. Vincent, Research in Number Theory 5 (2019). date_created: 2022-03-18T12:09:48Z date_published: 2019-01-02T00:00:00Z date_updated: 2023-09-05T15:39:31Z day: '02' department: - _id: TiBr doi: 10.1007/s40993-018-0146-6 external_id: arxiv: - '1807.08986' intvolume: ' 5' keyword: - Algebra and Number Theory language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1807.08986 month: '01' oa: 1 oa_version: Preprint publication: Research in Number Theory publication_identifier: eissn: - 2363-9555 issn: - 2522-0160 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Modular invariants for genus 3 hyperelliptic curves type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 5 year: '2019' ... --- _id: '11505' abstract: - lang: eng text: "Contact. This paper presents the results obtained with the Multi-Unit Spectroscopic Explorer (MUSE) at the ESO Very Large Telescope on the faint end of the Lyman-alpha luminosity function (LF) based on deep observations of four lensing clusters. The goal of our project is to set strong constraints on the relative contribution of the Lyman-alpha emitter (LAE) population to cosmic reionization.\r\n\r\nAims. The precise aim of the present study is to further constrain the abundance of LAEs by taking advantage of the magnification provided by lensing clusters to build a blindly selected sample of galaxies which is less biased than current blank field samples in redshift and luminosity. By construction, this sample of LAEs is complementary to those built from deep blank fields, whether observed by MUSE or by other facilities, and makes it possible to determine the shape of the LF at fainter levels, as well as its evolution with redshift.\r\n\r\nMethods. We selected a sample of 156 LAEs with redshifts between 2.9 ≤ z ≤ 6.7 and magnification-corrected luminosities in the range 39 ≲ log LLyα [erg s−1] ≲43. To properly take into account the individual differences in detection conditions between the LAEs when computing the LF, including lensing configurations, and spatial and spectral morphologies, the non-parametric 1/Vmax method was adopted. The price to pay to benefit from magnification is a reduction of the effective volume of the survey, together with a more complex analysis procedure to properly determine the effective volume Vmax for each galaxy. In this paper we present a complete procedure for the determination of the LF based on IFU detections in lensing clusters. This procedure, including some new methods for masking, effective volume integration and (individual) completeness determinations, has been fully automated when possible, and it can be easily generalized to the analysis of IFU observations in blank fields.\r\n\r\nResults. As a result of this analysis, the Lyman-alpha LF has been obtained in four different redshift bins: 2.9 <  z <  6, 7, 2.9 <  z <  4.0, 4.0 <  z <  5.0, and 5.0 <  z <  6.7 with constraints down to log LLyα = 40.5. From our data only, no significant evolution of LF mean slope can be found. When performing a Schechter analysis also including data from the literature to complete the present sample towards the brightest luminosities, a steep faint end slope was measured varying from α = −1.69−0.08+0.08 to α = −1.87−0.12+0.12 between the lowest and the highest redshift bins.\r\n\r\nConclusions. The contribution of the LAE population to the star formation rate density at z ∼ 6 is ≲50% depending on the luminosity limit considered, which is of the same order as the Lyman-break galaxy (LBG) contribution. The evolution of the LAE contribution with redshift depends on the assumed escape fraction of Lyman-alpha photons, and appears to slightly increase with increasing redshift when this fraction is conservatively set to one. Depending on the intersection between the LAE/LBG populations, the contribution of the observed galaxies to the ionizing flux may suffice to keep the universe ionized at z ∼ 6." acknowledgement: We thank the anonymous referee for their critical review and useful suggestions. This work has been carried out thanks to the support of the OCEVU Labex (ANR-11-LABX-0060) and the A*MIDEX project (ANR-11-IDEX-0001-02) funded by the “Investissements d’Avenir” French government programme managed by the ANR. Partially funded by the ERC starting grant CALENDS (JR, VP, BC, JM), the Agence Nationale de la recherche bearing the reference ANR-13-BS05-0010-02 (FOGHAR), and the “Programme National de Cosmologie and Galaxies” (PNCG) of CNRS/INSU, France. GdV, RP, JR, GM, JM, BC, and VP also acknowledge support by the Programa de Cooperacion Cientifica – ECOS SUD Program C16U02. NL acknowledges funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 669253), ABD acknowledges support from the ERC advanced grant “Cosmic Gas”. LW acknowledges support by the Competitive Fund of the Leibniz Association through grant SAW-2015-AIP-2, and TG acknowledges support from the European Research Council under grant agreement ERC-stg-757258 (TRIPLE).. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under programme IDs 060.A-9345, 094.A-0115, 095.A-0181, 096.A-0710, 097.A0269, 100.A-0249, and 294.A-5032. Also based on observations obtained with the NASA/ESA Hubble Space Telescope, retrieved from the Mikulski Archive for Space Telescopes (MAST) at the Space Telescope Science Institute (STScI). STScI is operated by the Association of Universities for Research in Astronomy, Inc. under NASA contract NAS 5-26555. This research made use of Astropy, a community-developed core Python package for Astronomy (Astropy Collaboration 2013). All plots in this paper were created using Matplotlib (Hunter 2007). article_number: A3 article_processing_charge: No article_type: original arxiv: 1 author: - first_name: G. full_name: de La Vieuville, G. last_name: de La Vieuville - first_name: D. full_name: Bina, D. last_name: Bina - first_name: R. full_name: Pello, R. last_name: Pello - first_name: G. full_name: Mahler, G. last_name: Mahler - first_name: J. full_name: Richard, J. last_name: Richard - first_name: A. B. full_name: Drake, A. B. last_name: Drake - first_name: E. C. full_name: Herenz, E. C. last_name: Herenz - first_name: F. E. full_name: Bauer, F. E. last_name: Bauer - first_name: B. full_name: Clément, B. last_name: Clément - first_name: D. full_name: Lagattuta, D. last_name: Lagattuta - first_name: N. full_name: Laporte, N. last_name: Laporte - first_name: J. full_name: Martinez, J. last_name: Martinez - first_name: V. full_name: Patrício, V. last_name: Patrício - first_name: L. full_name: Wisotzki, L. last_name: Wisotzki - first_name: J. full_name: Zabl, J. last_name: Zabl - first_name: R. J. full_name: Bouwens, R. J. last_name: Bouwens - first_name: T. full_name: Contini, T. last_name: Contini - first_name: T. full_name: Garel, T. last_name: Garel - first_name: B. full_name: Guiderdoni, B. last_name: Guiderdoni - first_name: R. A. full_name: Marino, R. A. last_name: Marino - first_name: M. V. full_name: Maseda, M. V. last_name: Maseda - 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: J. full_name: Schaye, J. last_name: Schaye - first_name: G. full_name: Soucail, G. last_name: Soucail citation: ama: de La Vieuville G, Bina D, Pello R, et al. Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha emitters behind lensing clusters observed with MUSE. Astronomy & Astrophysics. 2019;628. doi:10.1051/0004-6361/201834471 apa: de La Vieuville, G., Bina, D., Pello, R., Mahler, G., Richard, J., Drake, A. B., … Soucail, G. (2019). Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha emitters behind lensing clusters observed with MUSE. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/201834471 chicago: La Vieuville, G. de, D. Bina, R. Pello, G. Mahler, J. Richard, A. B. Drake, E. C. Herenz, et al. “Faint End of the z ∼ 3–7 Luminosity Function of Lyman-Alpha Emitters behind Lensing Clusters Observed with MUSE.” Astronomy & Astrophysics. EDP Sciences, 2019. https://doi.org/10.1051/0004-6361/201834471. ieee: G. de La Vieuville et al., “Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha emitters behind lensing clusters observed with MUSE,” Astronomy & Astrophysics, vol. 628. EDP Sciences, 2019. ista: de La Vieuville G, Bina D, Pello R, Mahler G, Richard J, Drake AB, Herenz EC, Bauer FE, Clément B, Lagattuta D, Laporte N, Martinez J, Patrício V, Wisotzki L, Zabl J, Bouwens RJ, Contini T, Garel T, Guiderdoni B, Marino RA, Maseda MV, Matthee JJ, Schaye J, Soucail G. 2019. Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha emitters behind lensing clusters observed with MUSE. Astronomy & Astrophysics. 628, A3. mla: de La Vieuville, G., et al. “Faint End of the z ∼ 3–7 Luminosity Function of Lyman-Alpha Emitters behind Lensing Clusters Observed with MUSE.” Astronomy & Astrophysics, vol. 628, A3, EDP Sciences, 2019, doi:10.1051/0004-6361/201834471. short: G. de La Vieuville, D. Bina, R. Pello, G. Mahler, J. Richard, A.B. Drake, E.C. Herenz, F.E. Bauer, B. Clément, D. Lagattuta, N. Laporte, J. Martinez, V. Patrício, L. Wisotzki, J. Zabl, R.J. Bouwens, T. Contini, T. Garel, B. Guiderdoni, R.A. Marino, M.V. Maseda, J.J. Matthee, J. Schaye, G. Soucail, Astronomy & Astrophysics 628 (2019). date_created: 2022-07-06T10:09:36Z date_published: 2019-07-25T00:00:00Z date_updated: 2022-07-19T09:36:31Z day: '25' doi: 10.1051/0004-6361/201834471 extern: '1' external_id: arxiv: - '1905.13696' intvolume: ' 628' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'gravitational lensing: strong / galaxies: high-redshift / dark ages' - reionization - 'first stars / galaxies: clusters: general / galaxies: luminosity function' - mass function language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1905.13696 month: '07' 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: Faint end of the z ∼ 3–7 luminosity function of Lyman-alpha emitters behind lensing clusters observed with MUSE type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 628 year: '2019' ... --- _id: '11535' abstract: - lang: eng text: We investigate the clustering and halo properties of ∼5000 Ly α-selected emission-line galaxies (LAEs) from the Slicing COSMOS 4K (SC4K) and from archival NB497 imaging of SA22 split in 15 discrete redshift slices between z ∼ 2.5 and 6. We measure clustering lengths of r0 ∼ 3–6 h−1 Mpc and typical halo masses of ∼1011 M⊙ for our narrowband-selected LAEs with typical LLy α ∼ 1042–43 erg s−1. The intermediate-band-selected LAEs are observed to have r0 ∼ 3.5–15 h−1 Mpc with typical halo masses of ∼1011–12 M⊙ and typical LLy α ∼ 1043–43.6 erg s−1. We find a strong, redshift-independent correlation between halo mass and Ly α luminosity normalized by the characteristic Ly α luminosity, L⋆(z). The faintest LAEs (L ∼ 0.1 L⋆(z)) typically identified by deep narrowband surveys are found in 1010 M⊙ haloes and the brightest LAEs (L ∼ 7 L⋆(z)) are found in ∼5 × 1012 M⊙ haloes. A dependency on the rest-frame 1500 Å UV luminosity, MUV, is also observed where the halo masses increase from 1011 to 1013 M⊙ for MUV ∼ −19 to −23.5 mag. Halo mass is also observed to increase from 109.8 to 1012 M⊙ for dust-corrected UV star formation rates from ∼0.6 to 10 M⊙ yr−1 and continues to increase up to 1013 M⊙ in halo mass, where the majority of those sources are active galactic nuclei. All the trends we observe are found to be redshift independent. Our results reveal that LAEs are the likely progenitors of a wide range of galaxies depending on their luminosity, from dwarf-like, to Milky Way-type, to bright cluster galaxies. LAEs therefore provide unique insight into the early formation and evolution of the galaxies we observe in the local Universe. acknowledgement: We thank the anonymous referee for their useful comments and suggestions that helped improve this study. AAK acknowledges that this work was supported by NASA Headquarters under the NASA Earth and Space Science Fellowship Program – Grant NNX16AO92H. JM acknowledges support from the ETH Zwicky fellowship. RKC acknowledges funding from STFC via a studentship. APA acknowledges support from the Fundac¸ao para a Ci ˜ encia e a Tecnologia FCT through the fellowship PD/BD/52706/2014 and the research grant UID/FIS/04434/2013. JC and SS both acknowledge their support from the Lancaster University PhD Fellowship. We have benefited greatly from the publicly available programming language PYTHON, including the NUMPY, SCIPY, MATPLOTLIB, SCIKIT-LEARN, and ASTROPY packages, as well as the TOPCAT analysis program. The SC4K samples used in this paper are all publicly available for use by the community (Sobral et al. 2018a). The catalogue is also available on the COSMOS IPAC website (https://irsa.ipac.caltech.edu/data/COSMOS/overview.html). article_processing_charge: No article_type: original arxiv: 1 author: - first_name: A A full_name: Khostovan, A A last_name: Khostovan - first_name: D full_name: Sobral, D last_name: Sobral - first_name: B full_name: Mobasher, B last_name: Mobasher - 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: R K full_name: Cochrane, R K last_name: Cochrane - first_name: N full_name: Chartab, N last_name: Chartab - first_name: M full_name: Jafariyazani, M last_name: Jafariyazani - first_name: A full_name: Paulino-Afonso, A last_name: Paulino-Afonso - first_name: S full_name: Santos, S last_name: Santos - first_name: J full_name: Calhau, J last_name: Calhau citation: ama: 'Khostovan AA, Sobral D, Mobasher B, et al. The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. Monthly Notices of the Royal Astronomical Society. 2019;489(1):555-573. doi:10.1093/mnras/stz2149' apa: 'Khostovan, A. A., Sobral, D., Mobasher, B., Matthee, J. J., Cochrane, R. K., Chartab, N., … Calhau, J. (2019). The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stz2149' chicago: 'Khostovan, A A, D Sobral, B Mobasher, Jorryt J Matthee, R K Cochrane, N Chartab, M Jafariyazani, A Paulino-Afonso, S Santos, and J Calhau. “The Clustering of Typical Ly α Emitters from z ∼ 2.5–6: Host Halo Masses Depend on Ly α and UV Luminosities.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2019. https://doi.org/10.1093/mnras/stz2149.' ieee: 'A. A. Khostovan et al., “The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities,” Monthly Notices of the Royal Astronomical Society, vol. 489, no. 1. Oxford University Press, pp. 555–573, 2019.' ista: 'Khostovan AA, Sobral D, Mobasher B, Matthee JJ, Cochrane RK, Chartab N, Jafariyazani M, Paulino-Afonso A, Santos S, Calhau J. 2019. The clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities. Monthly Notices of the Royal Astronomical Society. 489(1), 555–573.' mla: 'Khostovan, A. A., et al. “The Clustering of Typical Ly α Emitters from z ∼ 2.5–6: Host Halo Masses Depend on Ly α and UV Luminosities.” Monthly Notices of the Royal Astronomical Society, vol. 489, no. 1, Oxford University Press, 2019, pp. 555–73, doi:10.1093/mnras/stz2149.' short: A.A. Khostovan, D. Sobral, B. Mobasher, J.J. Matthee, R.K. Cochrane, N. Chartab, M. Jafariyazani, A. Paulino-Afonso, S. Santos, J. Calhau, Monthly Notices of the Royal Astronomical Society 489 (2019) 555–573. date_created: 2022-07-07T13:01:03Z date_published: 2019-10-01T00:00:00Z date_updated: 2022-08-19T06:38:42Z day: '01' doi: 10.1093/mnras/stz2149 extern: '1' external_id: arxiv: - '1811.00556' intvolume: ' 489' issue: '1' keyword: - Space and Planetary Science - Astronomy and Astrophysics - 'galaxies: evolution' - 'galaxies: haloes' - 'galaxies: high-redshift' - 'galaxies: star formation' - 'cosmology: observations' - large-scale structure of Universe language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1811.00556 month: '10' oa: 1 oa_version: Preprint page: 555-573 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 clustering of typical Ly α emitters from z ∼ 2.5–6: Host halo masses depend on Ly α and UV luminosities' type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 489 year: '2019' ... --- _id: '11850' abstract: - lang: eng text: 'Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.' article_processing_charge: No arxiv: 1 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: Stefan full_name: Neumann, Stefan last_name: Neumann - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Henzinger M, Neumann S, Schmid S. Efficient distributed workload (re-)embedding. In: SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. Association for Computing Machinery; 2019:43–44. doi:10.1145/3309697.3331503' apa: 'Henzinger, M., Neumann, S., & Schmid, S. (2019). Efficient distributed workload (re-)embedding. In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems (pp. 43–44). Phoenix, AZ, United States: Association for Computing Machinery. https://doi.org/10.1145/3309697.3331503' chicago: 'Henzinger, Monika, Stefan Neumann, and Stefan Schmid. “Efficient Distributed Workload (Re-)Embedding.” In SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, 43–44. Association for Computing Machinery, 2019. https://doi.org/10.1145/3309697.3331503.' ieee: 'M. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.' ista: 'Henzinger M, Neumann S, Schmid S. 2019. Efficient distributed workload (re-)embedding. SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems. SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems, 43–44.' mla: 'Henzinger, Monika, et al. “Efficient Distributed Workload (Re-)Embedding.” SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44, doi:10.1145/3309697.3331503.' short: 'M. Henzinger, S. Neumann, S. Schmid, in:, SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, 2019, pp. 43–44.' conference: end_date: 2019-06-28 location: Phoenix, AZ, United States name: 'SIGMETRICS: International Conference on Measurement and Modeling of Computer Systems' start_date: 2019-06-24 date_created: 2022-08-16T07:14:57Z date_published: 2019-06-20T00:00:00Z date_updated: 2024-11-06T12:17:32Z day: '20' doi: 10.1145/3309697.3331503 extern: '1' external_id: arxiv: - '1904.05474' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1904.05474 month: '06' oa: 1 oa_version: Preprint page: 43–44 publication: 'SIGMETRICS''19: International Conference on Measurement and Modeling of Computer Systems' publication_identifier: isbn: - 978-1-4503-6678-6 publication_status: published publisher: Association for Computing Machinery quality_controlled: '1' scopus_import: '1' status: public title: Efficient distributed workload (re-)embedding type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '11851' 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 weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem. article_number: '8820968' article_processing_charge: No arxiv: 1 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 citation: ama: 'Henzinger M, Noe A, Schulz C. Shared-memory exact minimum cuts. In: 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers; 2019. doi:10.1109/ipdps.2019.00013' apa: 'Henzinger, M., Noe, A., & Schulz, C. (2019). Shared-memory exact minimum cuts. In 33rd International Parallel and Distributed Processing Symposium. Rio de Janeiro, Brazil: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ipdps.2019.00013' chicago: Henzinger, Monika, Alexander Noe, and Christian Schulz. “Shared-Memory Exact Minimum Cuts.” In 33rd International Parallel and Distributed Processing Symposium. Institute of Electrical and Electronics Engineers, 2019. https://doi.org/10.1109/ipdps.2019.00013. ieee: M. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in 33rd International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, 2019. ista: 'Henzinger M, Noe A, Schulz C. 2019. Shared-memory exact minimum cuts. 33rd International Parallel and Distributed Processing Symposium. IPDPS: International Parallel and Distributed Processing Symposium, 8820968.' mla: Henzinger, Monika, et al. “Shared-Memory Exact Minimum Cuts.” 33rd International Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013. short: M. Henzinger, A. Noe, C. Schulz, in:, 33rd International Parallel and Distributed Processing Symposium, Institute of Electrical and Electronics Engineers, 2019. conference: end_date: 2019-05-24 location: Rio de Janeiro, Brazil name: 'IPDPS: International Parallel and Distributed Processing Symposium' start_date: 2019-05-20 date_created: 2022-08-16T07:25:23Z date_published: 2019-05-01T00:00:00Z date_updated: 2024-11-06T12:17:43Z day: '01' doi: 10.1109/ipdps.2019.00013 extern: '1' external_id: arxiv: - '1808.05458' language: - iso: eng main_file_link: - url: https://arxiv.org/abs/1808.05458 month: '05' oa_version: Preprint publication: 33rd International Parallel and Distributed Processing Symposium publication_identifier: eisbn: - 978-1-7281-1246-6 eissn: - 1530-2075 isbn: - 978-1-7281-1247-3 publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' related_material: record: - id: '11851' relation: later_version status: public scopus_import: '1' status: public title: Shared-memory exact minimum cuts type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2019' ... --- _id: '15230' abstract: - lang: eng text: 'We have searched the Gaia DR2 catalog for previously unknown hot white dwarfs in the direction of young open star clusters. The aim of this experiment was to try and extend the initial–final mass relation (IFMR) to somewhat higher masses, potentially challenging the Chandrasekhar limit currently thought to be around 1.38 M⊙. We discovered a particularly interesting white dwarf in the direction of the young ∼150 Myr old cluster Messier 47 (NGC 2422). All Gaia indicators (proper motion, parallax, location in the Gaia color–magnitude diagram) suggest that it is a cluster member. Its spectrum, obtained from Gemini-South, yields a number of anomalies: it is a DB (helium-rich atmosphere) white dwarf, it has a large magnetic field (2.5 MG), is of high mass (∼1.06 M⊙), and its colors are very peculiar—particularly the redder ones (r, i, z and y), which suggests that it may have a late-type companion. This may be the only magnetized, detached binary white dwarf with a non-degenerate companion of any spectral type known in or out of a star cluster. If the white dwarf is a cluster member, as all indicators suggest, its progenitor had a mass just over 6 M⊙. It may, however, be telling an even more interesting story than the one related to the IFMR, one about the origin of stellar magnetic fields, SNe I, and gravitational waves from low-mass stellar systems.' article_number: '75' article_processing_charge: No article_type: original arxiv: 1 author: - first_name: Harvey B. full_name: Richer, Harvey B. last_name: Richer - first_name: Ronan full_name: Kerr, Ronan last_name: Kerr - first_name: Jeremy full_name: Heyl, Jeremy last_name: Heyl - first_name: Ilaria full_name: Caiazzo, Ilaria id: 8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d last_name: Caiazzo orcid: 0000-0002-4770-5388 - first_name: Jeffrey full_name: Cummings, Jeffrey last_name: Cummings - first_name: Pierre full_name: Bergeron, Pierre last_name: Bergeron - first_name: Patrick full_name: Dufour, Patrick last_name: Dufour citation: ama: Richer HB, Kerr R, Heyl J, et al. A massive magnetic helium atmosphere white dwarf binary in a young star cluster. The Astrophysical Journal. 2019;880(2). doi:10.3847/1538-4357/ab2874 apa: Richer, H. B., Kerr, R., Heyl, J., Caiazzo, I., Cummings, J., Bergeron, P., & Dufour, P. (2019). A massive magnetic helium atmosphere white dwarf binary in a young star cluster. The Astrophysical Journal. American Astronomical Society. https://doi.org/10.3847/1538-4357/ab2874 chicago: Richer, Harvey B., Ronan Kerr, Jeremy Heyl, Ilaria Caiazzo, Jeffrey Cummings, Pierre Bergeron, and Patrick Dufour. “A Massive Magnetic Helium Atmosphere White Dwarf Binary in a Young Star Cluster.” The Astrophysical Journal. American Astronomical Society, 2019. https://doi.org/10.3847/1538-4357/ab2874. ieee: H. B. Richer et al., “A massive magnetic helium atmosphere white dwarf binary in a young star cluster,” The Astrophysical Journal, vol. 880, no. 2. American Astronomical Society, 2019. ista: Richer HB, Kerr R, Heyl J, Caiazzo I, Cummings J, Bergeron P, Dufour P. 2019. A massive magnetic helium atmosphere white dwarf binary in a young star cluster. The Astrophysical Journal. 880(2), 75. mla: Richer, Harvey B., et al. “A Massive Magnetic Helium Atmosphere White Dwarf Binary in a Young Star Cluster.” The Astrophysical Journal, vol. 880, no. 2, 75, American Astronomical Society, 2019, doi:10.3847/1538-4357/ab2874. short: H.B. Richer, R. Kerr, J. Heyl, I. Caiazzo, J. Cummings, P. Bergeron, P. Dufour, The Astrophysical Journal 880 (2019). date_created: 2024-03-26T10:37:01Z date_published: 2019-07-26T00:00:00Z date_updated: 2024-04-04T14:06:08Z day: '26' doi: 10.3847/1538-4357/ab2874 extern: '1' external_id: arxiv: - '1906.04727' intvolume: ' 880' issue: '2' keyword: - Space and Planetary Science - Astronomy and Astrophysics language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.1906.04727 month: '07' oa: 1 oa_version: Preprint publication: The Astrophysical Journal publication_identifier: eissn: - 1538-4357 issn: - 0004-637X publication_status: published publisher: American Astronomical Society quality_controlled: '1' scopus_import: '1' status: public title: A massive magnetic helium atmosphere white dwarf binary in a young star cluster type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 880 year: '2019' ... --- _id: '170' abstract: - lang: eng text: Upper and lower bounds, of the expected order of magnitude, are obtained for the number of rational points of bounded height on any quartic del Pezzo surface over ℚ that contains a conic defined over ℚ . arxiv: 1 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. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 2019;373(3-4):977-1016. doi:10.1007/s00208-018-1716-6 apa: Browning, T. D., & Sofos, E. (2019). Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. Springer Nature. https://doi.org/10.1007/s00208-018-1716-6 chicago: Browning, Timothy D, and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen. Springer Nature, 2019. https://doi.org/10.1007/s00208-018-1716-6. ieee: T. D. Browning and E. Sofos, “Counting rational points on quartic del Pezzo surfaces with a rational conic,” Mathematische Annalen, vol. 373, no. 3–4. Springer Nature, pp. 977–1016, 2019. ista: Browning TD, Sofos E. 2019. Counting rational points on quartic del Pezzo surfaces with a rational conic. Mathematische Annalen. 373(3–4), 977–1016. mla: Browning, Timothy D., and Efthymios Sofos. “Counting Rational Points on Quartic Del Pezzo Surfaces with a Rational Conic.” Mathematische Annalen, vol. 373, no. 3–4, Springer Nature, 2019, pp. 977–1016, doi:10.1007/s00208-018-1716-6. short: T.D. Browning, E. Sofos, Mathematische Annalen 373 (2019) 977–1016. date_created: 2018-12-11T11:44:59Z date_published: 2019-04-01T00:00:00Z date_updated: 2021-01-12T06:52:37Z day: '01' ddc: - '510' doi: 10.1007/s00208-018-1716-6 extern: '1' external_id: arxiv: - '1609.09057' file: - access_level: open_access checksum: 4061dc2fe99bee25d9adf2d2018cf608 content_type: application/pdf creator: dernst date_created: 2019-05-23T07:53:27Z date_updated: 2020-07-14T12:45:12Z file_id: '6479' file_name: 2019_MathAnnalen_Browning.pdf file_size: 712847 relation: main_file file_date_updated: 2020-07-14T12:45:12Z has_accepted_license: '1' intvolume: ' 373' issue: 3-4 language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: 977-1016 publication: Mathematische Annalen publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Counting rational points on quartic del Pezzo surfaces with a rational conic 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: 373 year: '2019' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '17924' abstract: - lang: eng text: We demonstrate that imidazole based π–π stacked dimers form strong and efficient conductance pathways in single-molecule junctions using the scanning-tunneling microscope-break junction (STM-BJ) technique and density functional theory-based calculations. We first characterize an imidazole-gold contact by measuring the conductance of imidazolyl-terminated alkanes (im-N-im, N = 3–6). We show that the conductance of these alkanes decays exponentially with increasing length, indicating that the mechanism for electron transport is through tunneling or super-exchange. We also reveal that π–π stacked dimers can be formed between imidazoles and have better coupling than through-bond tunneling. These experimental results are rationalized by calculations of molecular junction transmission using non-equilibrium Green's function formalism. This study verifies the capability of imidazole as a Au-binding ligand to form stable single- and π-stacked molecule junctions at room temperature. article_processing_charge: Yes article_type: original author: - first_name: Tianren full_name: Fu, Tianren last_name: Fu - first_name: Shanelle full_name: Smith, Shanelle last_name: Smith - first_name: María full_name: Camarasa-Gómez, María last_name: Camarasa-Gómez - first_name: Xiaofang full_name: Yu, Xiaofang last_name: Yu - first_name: Jiayi full_name: Xue, Jiayi last_name: Xue - first_name: Colin full_name: Nuckolls, Colin last_name: Nuckolls - first_name: Ferdinand full_name: Evers, Ferdinand last_name: Evers - first_name: Latha full_name: Venkataraman, Latha id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf last_name: Venkataraman orcid: 0000-0002-6957-6089 - first_name: Sujun full_name: Wei, Sujun last_name: Wei citation: ama: Fu T, Smith S, Camarasa-Gómez M, et al. Enhanced coupling through π-stacking in imidazole-based molecular junctions. Chemical Science. 2019;10(43):9998-10002. doi:10.1039/c9sc03760h apa: Fu, T., Smith, S., Camarasa-Gómez, M., Yu, X., Xue, J., Nuckolls, C., … Wei, S. (2019). Enhanced coupling through π-stacking in imidazole-based molecular junctions. Chemical Science. Royal Society of Chemistry. https://doi.org/10.1039/c9sc03760h chicago: Fu, Tianren, Shanelle Smith, María Camarasa-Gómez, Xiaofang Yu, Jiayi Xue, Colin Nuckolls, Ferdinand Evers, Latha Venkataraman, and Sujun Wei. “Enhanced Coupling through π-Stacking in Imidazole-Based Molecular Junctions.” Chemical Science. Royal Society of Chemistry, 2019. https://doi.org/10.1039/c9sc03760h. ieee: T. Fu et al., “Enhanced coupling through π-stacking in imidazole-based molecular junctions,” Chemical Science, vol. 10, no. 43. Royal Society of Chemistry, pp. 9998–10002, 2019. ista: Fu T, Smith S, Camarasa-Gómez M, Yu X, Xue J, Nuckolls C, Evers F, Venkataraman L, Wei S. 2019. Enhanced coupling through π-stacking in imidazole-based molecular junctions. Chemical Science. 10(43), 9998–10002. mla: Fu, Tianren, et al. “Enhanced Coupling through π-Stacking in Imidazole-Based Molecular Junctions.” Chemical Science, vol. 10, no. 43, Royal Society of Chemistry, 2019, pp. 9998–10002, doi:10.1039/c9sc03760h. short: T. Fu, S. Smith, M. Camarasa-Gómez, X. Yu, J. Xue, C. Nuckolls, F. Evers, L. Venkataraman, S. Wei, Chemical Science 10 (2019) 9998–10002. date_created: 2024-09-09T07:49:24Z date_published: 2019-09-16T00:00:00Z date_updated: 2024-12-11T08:08:34Z day: '16' doi: 10.1039/c9sc03760h extern: '1' external_id: pmid: - '32055356' intvolume: ' 10' issue: '43' language: - iso: eng license: https://creativecommons.org/licenses/by-nc/3.0/ main_file_link: - open_access: '1' url: https://doi.org/10.1039/C9SC03760H month: '09' oa: 1 oa_version: Published Version page: 9998-10002 pmid: 1 publication: Chemical Science publication_identifier: eissn: - 2041-6539 issn: - 2041-6520 publication_status: published publisher: Royal Society of Chemistry quality_controlled: '1' scopus_import: '1' status: public title: Enhanced coupling through π-stacking in imidazole-based molecular junctions tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/3.0/legalcode name: Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) short: CC BY-NC (3.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2019' ... --- _id: '76' abstract: - lang: eng text: 'Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C>1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.' article_processing_charge: Yes (via OA deal) author: - first_name: Christoph full_name: Lenzen, Christoph last_name: Lenzen - first_name: Joel full_name: Rybicki, Joel id: 334EFD2E-F248-11E8-B48F-1D18A9856A87 last_name: Rybicki orcid: 0000-0002-6432-6646 citation: ama: Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. Distributed Computing. 2018. doi:10.1007/s00446-018-0342-6 apa: Lenzen, C., & Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. Distributed Computing. Springer. https://doi.org/10.1007/s00446-018-0342-6 chicago: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing. Springer, 2018. https://doi.org/10.1007/s00446-018-0342-6. ieee: C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” Distributed Computing. Springer, 2018. ista: Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing. mla: Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” Distributed Computing, Springer, 2018, doi:10.1007/s00446-018-0342-6. short: C. Lenzen, J. Rybicki, Distributed Computing (2018). corr_author: '1' date_created: 2018-12-11T11:44:30Z date_published: 2018-09-12T00:00:00Z date_updated: 2025-04-15T06:53:15Z day: '12' ddc: - '000' department: - _id: DaAl doi: 10.1007/s00446-018-0342-6 external_id: isi: - '000475627800005' file: - access_level: open_access checksum: 872db70bba9b401500abe3c6ae2f1a61 content_type: application/pdf creator: dernst date_created: 2018-12-17T14:21:22Z date_updated: 2020-07-14T12:48:01Z file_id: '5711' file_name: 2018_DistributedComputing_Lenzen.pdf file_size: 799337 relation: main_file file_date_updated: 2020-07-14T12:48:01Z has_accepted_license: '1' isi: 1 language: - iso: eng month: '09' oa: 1 oa_version: Published Version project: - _id: B67AFEDC-15C9-11EA-A837-991A96BB2854 name: IST Austria Open Access Fund publication: Distributed Computing publication_status: published publisher: Springer publist_id: '7978' quality_controlled: '1' scopus_import: '1' status: public title: Near-optimal self-stabilising counting and firing squads tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 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: '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: '7722' abstract: - lang: eng text: We develop a Bayesian mixed linear model that simultaneously estimates single-nucleotide polymorphism (SNP)-based heritability, polygenicity (proportion of SNPs with nonzero effects), and the relationship between SNP effect size and minor allele frequency for complex traits in conventionally unrelated individuals using genome-wide SNP data. We apply the method to 28 complex traits in the UK Biobank data (N = 126,752) and show that on average, 6% of SNPs have nonzero effects, which in total explain 22% of phenotypic variance. We detect significant (P < 0.05/28) signatures of natural selection in the genetic architecture of 23 traits, including reproductive, cardiovascular, and anthropometric traits, as well as educational attainment. The significant estimates of the relationship between effect size and minor allele frequency in complex traits are consistent with a model of negative (or purifying) selection, as confirmed by forward simulation. We conclude that negative selection acts pervasively on the genetic variants associated with human complex traits. article_processing_charge: No article_type: original author: - first_name: Jian full_name: Zeng, Jian last_name: Zeng - first_name: Ronald full_name: de Vlaming, Ronald last_name: de Vlaming - first_name: Yang full_name: Wu, Yang last_name: Wu - 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: Luke R. full_name: Lloyd-Jones, Luke R. last_name: Lloyd-Jones - first_name: Loic full_name: Yengo, Loic last_name: Yengo - first_name: Chloe X. full_name: Yap, Chloe X. last_name: Yap - first_name: Angli full_name: Xue, Angli last_name: Xue - first_name: Julia full_name: Sidorenko, Julia last_name: Sidorenko - first_name: Allan F. full_name: McRae, Allan F. last_name: McRae - first_name: Joseph E. full_name: Powell, Joseph E. last_name: Powell - first_name: Grant W. full_name: Montgomery, Grant W. last_name: Montgomery - first_name: Andres full_name: Metspalu, Andres last_name: Metspalu - first_name: Tonu full_name: Esko, Tonu last_name: Esko - first_name: Greg full_name: Gibson, Greg last_name: Gibson - first_name: Naomi R. full_name: Wray, Naomi R. last_name: Wray - first_name: Peter M. full_name: Visscher, Peter M. last_name: Visscher - first_name: Jian full_name: Yang, Jian last_name: Yang citation: ama: Zeng J, de Vlaming R, Wu Y, et al. Signatures of negative selection in the genetic architecture of human complex traits. Nature Genetics. 2018;50(5):746-753. doi:10.1038/s41588-018-0101-4 apa: Zeng, J., de Vlaming, R., Wu, Y., Robinson, M. R., Lloyd-Jones, L. R., Yengo, L., … Yang, J. (2018). Signatures of negative selection in the genetic architecture of human complex traits. Nature Genetics. Springer Nature. https://doi.org/10.1038/s41588-018-0101-4 chicago: Zeng, Jian, Ronald de Vlaming, Yang Wu, Matthew Richard Robinson, Luke R. Lloyd-Jones, Loic Yengo, Chloe X. Yap, et al. “Signatures of Negative Selection in the Genetic Architecture of Human Complex Traits.” Nature Genetics. Springer Nature, 2018. https://doi.org/10.1038/s41588-018-0101-4. ieee: J. Zeng et al., “Signatures of negative selection in the genetic architecture of human complex traits,” Nature Genetics, vol. 50, no. 5. Springer Nature, pp. 746–753, 2018. ista: Zeng J, de Vlaming R, Wu Y, Robinson MR, Lloyd-Jones LR, Yengo L, Yap CX, Xue A, Sidorenko J, McRae AF, Powell JE, Montgomery GW, Metspalu A, Esko T, Gibson G, Wray NR, Visscher PM, Yang J. 2018. Signatures of negative selection in the genetic architecture of human complex traits. Nature Genetics. 50(5), 746–753. mla: Zeng, Jian, et al. “Signatures of Negative Selection in the Genetic Architecture of Human Complex Traits.” Nature Genetics, vol. 50, no. 5, Springer Nature, 2018, pp. 746–53, doi:10.1038/s41588-018-0101-4. short: J. Zeng, R. de Vlaming, Y. Wu, M.R. Robinson, L.R. Lloyd-Jones, L. Yengo, C.X. Yap, A. Xue, J. Sidorenko, A.F. McRae, J.E. Powell, G.W. Montgomery, A. Metspalu, T. Esko, G. Gibson, N.R. Wray, P.M. Visscher, J. Yang, Nature Genetics 50 (2018) 746–753. date_created: 2020-04-30T10:44:57Z date_published: 2018-04-16T00:00:00Z date_updated: 2021-01-12T08:15:06Z day: '16' doi: 10.1038/s41588-018-0101-4 extern: '1' intvolume: ' 50' issue: '5' language: - iso: eng month: '04' oa_version: None page: 746-753 publication: Nature Genetics publication_identifier: issn: - 1061-4036 - 1546-1718 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Signatures of negative selection in the genetic architecture of human complex traits type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 50 year: '2018' ... --- _id: '78' abstract: - lang: eng text: We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated. alternative_title: - LNCS article_processing_charge: No author: - first_name: Alexey full_name: Bakhirkin, Alexey last_name: Bakhirkin - first_name: Thomas full_name: Ferrere, Thomas id: 40960E6E-F248-11E8-B48F-1D18A9856A87 last_name: Ferrere orcid: 0000-0001-5199-3143 - first_name: Dejan full_name: Nickovic, Dejan last_name: Nickovic - first_name: Oded full_name: Maler, Oded last_name: Maler - first_name: Eugene full_name: Asarin, Eugene last_name: Asarin citation: ama: 'Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:10.1007/978-3-030-00151-3_13' apa: 'Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., & Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. https://doi.org/10.1007/978-3-030-00151-3_13' chicago: Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. https://doi.org/10.1007/978-3-030-00151-3_13. ieee: 'A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.' ista: 'Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.' mla: Bakhirkin, Alexey, et al. Online Timed Pattern Matching Using Automata. Vol. 11022, Springer, 2018, pp. 215–32, doi:10.1007/978-3-030-00151-3_13. short: A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232. conference: end_date: 2018-09-06 location: Bejing, China name: 'FORMATS: Formal Modeling and Analysis of Timed Systems' start_date: 2018-09-04 date_created: 2018-12-11T11:44:31Z date_published: 2018-08-26T00:00:00Z date_updated: 2025-04-15T06:26:03Z day: '26' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-030-00151-3_13 external_id: isi: - '000884993200013' file: - access_level: open_access checksum: 436b7574934324cfa7d1d3986fddc65b content_type: application/pdf creator: dernst date_created: 2020-05-14T11:34:34Z date_updated: 2020-07-14T12:48:03Z file_id: '7831' file_name: 2018_LNCS_Bakhirkin.pdf file_size: 374851 relation: main_file file_date_updated: 2020-07-14T12:48:03Z has_accepted_license: '1' intvolume: ' 11022' isi: 1 language: - iso: eng month: '08' oa: 1 oa_version: Submitted Version page: 215 - 232 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: Formal methods for the design and analysis of complex systems publication_identifier: isbn: - 978-3-030-00150-6 publication_status: published publisher: Springer publist_id: '7976' quality_controlled: '1' scopus_import: '1' status: public title: Online timed pattern matching using automata type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 11022 year: '2018' ... --- _id: '6' abstract: - lang: eng text: Lesion and electrode location verification are traditionally done via histological examination of stained brain slices, a time-consuming procedure that requires manual estimation. Here, we describe a simple, straightforward method for quantifying lesions and locating electrodes in the brain that is less laborious and yields more detailed results. Whole brains are stained with osmium tetroxide, embedded in resin, and imaged with a micro-CT scanner. The scans result in 3D digital volumes of the brains with resolutions and virtual section thicknesses dependent on the sample size (12-15 and 5-6 µm per voxel for rat and zebra finch brains, respectively). Surface and deep lesions can be characterized, and single tetrodes, tetrode arrays, electrolytic lesions, and silicon probes can also be localized. Free and proprietary software allows experimenters to examine the sample volume from any plane and segment the volume manually or automatically. Because this method generates whole brain volume, lesions and electrodes can be quantified to a much higher degree than in current methods, which will help standardize comparisons within and across studies. article_processing_charge: No author: - first_name: Javier full_name: Masís, Javier last_name: Masís - first_name: David full_name: Mankus, David last_name: Mankus - first_name: Steffen full_name: Wolff, Steffen last_name: Wolff - first_name: Grigori full_name: Guitchounts, Grigori last_name: Guitchounts - first_name: Maximilian A full_name: Jösch, Maximilian A id: 2BD278E6-F248-11E8-B48F-1D18A9856A87 last_name: Jösch orcid: 0000-0002-3937-1330 - first_name: David full_name: Cox, David last_name: Cox citation: ama: Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. Journal of visualized experiments. 2018;141. doi:10.3791/58585 apa: Masís, J., Mankus, D., Wolff, S., Guitchounts, G., Jösch, M. A., & Cox, D. (2018). A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. Journal of Visualized Experiments. MyJove Corporation. https://doi.org/10.3791/58585 chicago: Masís, Javier, David Mankus, Steffen Wolff, Grigori Guitchounts, Maximilian A Jösch, and David Cox. “A Micro-CT-Based Method for Characterising Lesions and Locating Electrodes in Small Animal Brains.” Journal of Visualized Experiments. MyJove Corporation, 2018. https://doi.org/10.3791/58585. ieee: J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M. A. Jösch, and D. Cox, “A micro-CT-based method for characterising lesions and locating electrodes in small animal brains,” Journal of visualized experiments, vol. 141. MyJove Corporation, 2018. ista: Masís J, Mankus D, Wolff S, Guitchounts G, Jösch MA, Cox D. 2018. A micro-CT-based method for characterising lesions and locating electrodes in small animal brains. Journal of visualized experiments. 141. mla: Masís, Javier, et al. “A Micro-CT-Based Method for Characterising Lesions and Locating Electrodes in Small Animal Brains.” Journal of Visualized Experiments, vol. 141, MyJove Corporation, 2018, doi:10.3791/58585. short: J. Masís, D. Mankus, S. Wolff, G. Guitchounts, M.A. Jösch, D. Cox, Journal of Visualized Experiments 141 (2018). date_created: 2018-12-11T11:44:07Z date_published: 2018-11-08T00:00:00Z date_updated: 2023-10-17T11:49:25Z day: '08' department: - _id: MaJö doi: 10.3791/58585 external_id: isi: - '000456469400103' intvolume: ' 141' isi: 1 language: - iso: eng month: '11' oa_version: None publication: Journal of visualized experiments publication_status: published publisher: MyJove Corporation publist_id: '8050' quality_controlled: '1' scopus_import: '1' status: public title: A micro-CT-based method for characterising lesions and locating electrodes in small animal brains type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 141 year: '2018' ...