--- _id: '303' abstract: - lang: eng text: The theory of tropical series, that we develop here, firstly appeared in the study of the growth of pluriharmonic functions. Motivated by waves in sandpile models we introduce a dynamic on the set of tropical series, and it is experimentally observed that this dynamic obeys a power law. So, this paper serves as a compilation of results we need for other articles and also introduces several objects interesting by themselves. acknowledgement: The first author, Nikita Kalinin, is funded by SNCF PostDoc.Mobility grant 168647. Support from the Basic Research Program of the National Research University Higher School of Economics is gratefully acknowledged. The second author, Mikhail Shkolnikov, is supported in part by the grant 159240 of the Swiss National Science Foundation as well as by the National Center of Competence in Research SwissMAP of the Swiss National Science Foundation. article_processing_charge: No author: - first_name: Nikita full_name: Kalinin, Nikita last_name: Kalinin - first_name: Mikhail full_name: Shkolnikov, Mikhail id: 35084A62-F248-11E8-B48F-1D18A9856A87 last_name: Shkolnikov orcid: 0000-0002-4310-178X citation: ama: Kalinin N, Shkolnikov M. Introduction to tropical series and wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A. 2018;38(6):2827-2849. doi:10.3934/dcds.2018120 apa: Kalinin, N., & Shkolnikov, M. (2018). Introduction to tropical series and wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A. AIMS. https://doi.org/10.3934/dcds.2018120 chicago: Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series and Wave Dynamic on Them.” Discrete and Continuous Dynamical Systems- Series A. AIMS, 2018. https://doi.org/10.3934/dcds.2018120. ieee: N. Kalinin and M. Shkolnikov, “Introduction to tropical series and wave dynamic on them,” Discrete and Continuous Dynamical Systems- Series A, vol. 38, no. 6. AIMS, pp. 2827–2849, 2018. ista: Kalinin N, Shkolnikov M. 2018. Introduction to tropical series and wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A. 38(6), 2827–2849. mla: Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series and Wave Dynamic on Them.” Discrete and Continuous Dynamical Systems- Series A, vol. 38, no. 6, AIMS, 2018, pp. 2827–49, doi:10.3934/dcds.2018120. short: N. Kalinin, M. Shkolnikov, Discrete and Continuous Dynamical Systems- Series A 38 (2018) 2827–2849. date_created: 2018-12-11T11:45:43Z date_published: 2018-06-01T00:00:00Z date_updated: 2023-09-12T07:45:37Z day: '01' department: - _id: TaHa doi: 10.3934/dcds.2018120 external_id: arxiv: - '1706.03062' isi: - '000438818400007' intvolume: ' 38' isi: 1 issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1706.03062 month: '06' oa: 1 oa_version: Submitted Version page: 2827 - 2849 publication: Discrete and Continuous Dynamical Systems- Series A publication_status: published publisher: AIMS publist_id: '7576' quality_controlled: '1' scopus_import: '1' status: public title: Introduction to tropical series and wave dynamic on them type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 38 year: '2018' ... --- _id: '282' abstract: - lang: eng text: Adaptive introgression is common in nature and can be driven by selection acting on multiple, linked genes. We explore the effects of polygenic selection on introgression under the infinitesimal model with linkage. This model assumes that the introgressing block has an effectively infinite number of genes, each with an infinitesimal effect on the trait under selection. The block is assumed to introgress under directional selection within a native population that is genetically homogeneous. We use individual-based simulations and a branching process approximation to compute various statistics of the introgressing block, and explore how these depend on parameters such as the map length and initial trait value associated with the introgressing block, the genetic variability along the block, and the strength of selection. Our results show that the introgression dynamics of a block under infinitesimal selection is qualitatively different from the dynamics of neutral introgression. We also find that in the long run, surviving descendant blocks are likely to have intermediate lengths, and clarify how the length is shaped by the interplay between linkage and infinitesimal selection. Our results suggest that it may be difficult to distinguish introgression of single loci from that of genomic blocks with multiple, tightly linked and weakly selected loci. article_processing_charge: No author: - first_name: Himani full_name: Sachdeva, Himani id: 42377A0A-F248-11E8-B48F-1D18A9856A87 last_name: Sachdeva - 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: Sachdeva H, Barton NH. Introgression of a block of genome under infinitesimal selection. Genetics. 2018;209(4):1279-1303. doi:10.1534/genetics.118.301018 apa: Sachdeva, H., & Barton, N. H. (2018). Introgression of a block of genome under infinitesimal selection. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.118.301018 chicago: Sachdeva, Himani, and Nicholas H Barton. “Introgression of a Block of Genome under Infinitesimal Selection.” Genetics. Genetics Society of America, 2018. https://doi.org/10.1534/genetics.118.301018. ieee: H. Sachdeva and N. H. Barton, “Introgression of a block of genome under infinitesimal selection,” Genetics, vol. 209, no. 4. Genetics Society of America, pp. 1279–1303, 2018. ista: Sachdeva H, Barton NH. 2018. Introgression of a block of genome under infinitesimal selection. Genetics. 209(4), 1279–1303. mla: Sachdeva, Himani, and Nicholas H. Barton. “Introgression of a Block of Genome under Infinitesimal Selection.” Genetics, vol. 209, no. 4, Genetics Society of America, 2018, pp. 1279–303, doi:10.1534/genetics.118.301018. short: H. Sachdeva, N.H. Barton, Genetics 209 (2018) 1279–1303. date_created: 2018-12-11T11:45:36Z date_published: 2018-08-01T00:00:00Z date_updated: 2023-09-13T08:22:32Z day: '01' department: - _id: NiBa doi: 10.1534/genetics.118.301018 external_id: isi: - '000440014100020' intvolume: ' 209' isi: 1 issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: https://www.biorxiv.org/content/early/2017/11/30/227082 month: '08' oa: 1 oa_version: Submitted Version page: 1279 - 1303 publication: Genetics publication_status: published publisher: Genetics Society of America publist_id: '7617' quality_controlled: '1' scopus_import: '1' status: public title: Introgression of a block of genome under infinitesimal selection type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 209 year: '2018' ... --- _id: '108' abstract: - lang: eng text: Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \'collision graph\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes. alternative_title: - ISIT Proceedings article_processing_charge: No author: - first_name: Marciej full_name: Obremski, Marciej last_name: Obremski - first_name: Maciej full_name: Skorski, Maciej id: EC09FA6A-02D0-11E9-8223-86B7C91467DD last_name: Skorski citation: ama: 'Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:10.1109/ISIT.2018.8437654' apa: 'Obremski, M., & Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. https://doi.org/10.1109/ISIT.2018.8437654' chicago: Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. https://doi.org/10.1109/ISIT.2018.8437654. ieee: 'M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.' ista: 'Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.' mla: Obremski, Marciej, and Maciej Skórski. Inverted Leftover Hash Lemma. Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654. short: M. Obremski, M. Skórski, in:, IEEE, 2018. conference: end_date: 2018-06-22 location: Vail, CO, USA name: 'ISIT: International Symposium on Information Theory' start_date: '2018-06-17 ' date_created: 2018-12-11T11:44:40Z date_published: 2018-08-16T00:00:00Z date_updated: 2023-09-13T08:23:18Z day: '16' department: - _id: KrPi doi: 10.1109/ISIT.2018.8437654 external_id: isi: - '000448139300368' intvolume: ' 2018' isi: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2017/507 month: '08' oa: 1 oa_version: Submitted Version publication_status: published publisher: IEEE publist_id: '7946' quality_controlled: '1' scopus_import: '1' status: public title: Inverted leftover hash lemma type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2018 year: '2018' ... --- _id: '160' abstract: - lang: eng text: We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. These programs are expressed in the ordinary syntax of imperative concurrent programs using gated atomic actions, sequencing, choice, and (recursive) procedure calls. Each concurrent program is automatically extracted from the layered program. We reduce refinement to the safety of a sequence of concurrent checker programs, one each to justify the connection between every two consecutive concurrent programs. These checker programs are also automatically extracted from the layered program. Layered concurrent programs have been implemented in the CIVL verifier which has been successfully used for the verification of several complex concurrent programs. alternative_title: - LNCS article_processing_charge: No author: - first_name: Bernhard full_name: Kragl, Bernhard id: 320FC952-F248-11E8-B48F-1D18A9856A87 last_name: Kragl orcid: 0000-0001-7745-9117 - first_name: Shaz full_name: Qadeer, Shaz last_name: Qadeer citation: ama: 'Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:10.1007/978-3-319-96145-3_5' apa: 'Kragl, B., & Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. https://doi.org/10.1007/978-3-319-96145-3_5' chicago: Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. https://doi.org/10.1007/978-3-319-96145-3_5. ieee: 'B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.' ista: 'Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.' mla: Kragl, Bernhard, and Shaz Qadeer. Layered Concurrent Programs. Vol. 10981, Springer, 2018, pp. 79–102, doi:10.1007/978-3-319-96145-3_5. short: B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102. conference: end_date: 2018-07-17 location: Oxford, UK name: 'CAV: Computer Aided Verification' start_date: 2018-07-14 date_created: 2018-12-11T11:44:57Z date_published: 2018-07-18T00:00:00Z date_updated: 2023-09-13T08:45:09Z day: '18' ddc: - '000' department: - _id: ToHe doi: 10.1007/978-3-319-96145-3_5 external_id: isi: - '000491481600005' file: - access_level: open_access checksum: c64fff560fe5a7532ec10626ad1c215e content_type: application/pdf creator: dernst date_created: 2018-12-17T12:52:12Z date_updated: 2020-07-14T12:45:04Z file_id: '5705' file_name: 2018_LNCS_Kragl.pdf file_size: 1603844 relation: main_file file_date_updated: 2020-07-14T12:45:04Z has_accepted_license: '1' intvolume: ' 10981' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 79 - 102 project: - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering publication_status: published publisher: Springer publist_id: '7761' quality_controlled: '1' related_material: record: - id: '8332' relation: dissertation_contains status: public scopus_import: '1' status: public title: Layered Concurrent Programs 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: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 10981 year: '2018' ... --- _id: '82' abstract: - lang: eng text: In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term "leaky resistance." We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”. article_number: '2005971' article_processing_charge: Yes author: - first_name: Waqas full_name: Chaudhry, Waqas last_name: Chaudhry - first_name: Maros full_name: Pleska, Maros id: 4569785E-F248-11E8-B48F-1D18A9856A87 last_name: Pleska orcid: 0000-0001-7460-7479 - first_name: Nilang full_name: Shah, Nilang last_name: Shah - first_name: Howard full_name: Weiss, Howard last_name: Weiss - first_name: Ingrid full_name: Mccall, Ingrid last_name: Mccall - first_name: Justin full_name: Meyer, Justin last_name: Meyer - first_name: Animesh full_name: Gupta, Animesh last_name: Gupta - first_name: Calin C full_name: Guet, Calin C id: 47F8433E-F248-11E8-B48F-1D18A9856A87 last_name: Guet orcid: 0000-0001-6220-2052 - first_name: Bruce full_name: Levin, Bruce last_name: Levin citation: ama: Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 2018;16(8). doi:10.1371/journal.pbio.2005971 apa: Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.2005971 chicago: Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” PLoS Biology. Public Library of Science, 2018. https://doi.org/10.1371/journal.pbio.2005971. ieee: W. Chaudhry et al., “Leaky resistance and the conditions for the existence of lytic bacteriophage,” PLoS Biology, vol. 16, no. 8. Public Library of Science, 2018. ista: Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 16(8), 2005971. mla: Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” PLoS Biology, vol. 16, no. 8, 2005971, Public Library of Science, 2018, doi:10.1371/journal.pbio.2005971. short: W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, PLoS Biology 16 (2018). date_created: 2018-12-11T11:44:32Z date_published: 2018-08-16T00:00:00Z date_updated: 2023-09-13T08:45:41Z day: '16' ddc: - '570' department: - _id: CaGu doi: 10.1371/journal.pbio.2005971 external_id: isi: - '000443383300024' file: - access_level: open_access checksum: 527076f78265cd4ea192cd1569851587 content_type: application/pdf creator: dernst date_created: 2018-12-17T12:55:31Z date_updated: 2020-07-14T12:48:10Z file_id: '5706' file_name: 2018_Plos_Chaudhry.pdf file_size: 4007095 relation: main_file file_date_updated: 2020-07-14T12:48:10Z has_accepted_license: '1' intvolume: ' 16' isi: 1 issue: '8' language: - iso: eng month: '08' oa: 1 oa_version: Published Version publication: PLoS Biology publication_status: published publisher: Public Library of Science publist_id: '7972' quality_controlled: '1' related_material: record: - id: '9810' relation: research_data status: public scopus_import: '1' status: public title: Leaky resistance and the conditions for the existence of lytic bacteriophage tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 16 year: '2018' ...