[{"date_updated":"2023-09-11T12:44:08Z","date_created":"2018-12-11T11:45:38Z","volume":20,"author":[{"full_name":"Lilja, Anna","first_name":"Anna","last_name":"Lilja"},{"full_name":"Rodilla, Veronica","first_name":"Veronica","last_name":"Rodilla"},{"full_name":"Huyghe, Mathilde","first_name":"Mathilde","last_name":"Huyghe"},{"full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","first_name":"Edouard B"},{"full_name":"Landragin, Camille","first_name":"Camille","last_name":"Landragin"},{"first_name":"Olivier","last_name":"Renaud","full_name":"Renaud, Olivier"},{"first_name":"Olivier","last_name":"Leroy","full_name":"Leroy, Olivier"},{"full_name":"Rulands, Steffen","first_name":"Steffen","last_name":"Rulands"},{"full_name":"Simons, Benjamin","first_name":"Benjamin","last_name":"Simons"},{"full_name":"Fré, Silvia","last_name":"Fré","first_name":"Silvia"}],"publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"EdHa"}],"year":"2018","pmid":1,"publist_id":"7594","language":[{"iso":"eng"}],"doi":"10.1038/s41556-018-0108-1","quality_controlled":"1","isi":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6984964"}],"external_id":{"pmid":["29784917"],"isi":["000433237300003"]},"month":"05","oa_version":"Submitted Version","title":"Clonal analysis of Notch1-expressing cells reveals the existence of unipotent stem cells that retain long-term plasticity in the embryonic mammary gland","status":"public","intvolume":" 20","_id":"288","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Recent lineage tracing studies have revealed that mammary gland homeostasis relies on unipotent stem cells. However, whether and when lineage restriction occurs during embryonic mammary development, and which signals orchestrate cell fate specification, remain unknown. Using a combination of in vivo clonal analysis with whole mount immunofluorescence and mathematical modelling of clonal dynamics, we found that embryonic multipotent mammary cells become lineage-restricted surprisingly early in development, with evidence for unipotency as early as E12.5 and no statistically discernable bipotency after E15.5. To gain insights into the mechanisms governing the switch from multipotency to unipotency, we used gain-of-function Notch1 mice and demonstrated that Notch activation cell autonomously dictates luminal cell fate specification to both embryonic and basally committed mammary cells. These functional studies have important implications for understanding the signals underlying cell plasticity and serve to clarify how reactivation of embryonic programs in adult cells can lead to cancer."}],"issue":"6","type":"journal_article","date_published":"2018-05-21T00:00:00Z","article_type":"original","page":"677 - 687","publication":"Nature Cell Biology","citation":{"chicago":"Lilja, Anna, Veronica Rodilla, Mathilde Huyghe, Edouard B Hannezo, Camille Landragin, Olivier Renaud, Olivier Leroy, Steffen Rulands, Benjamin Simons, and Silvia Fré. “Clonal Analysis of Notch1-Expressing Cells Reveals the Existence of Unipotent Stem Cells That Retain Long-Term Plasticity in the Embryonic Mammary Gland.” Nature Cell Biology. Nature Publishing Group, 2018. https://doi.org/10.1038/s41556-018-0108-1.","mla":"Lilja, Anna, et al. “Clonal Analysis of Notch1-Expressing Cells Reveals the Existence of Unipotent Stem Cells That Retain Long-Term Plasticity in the Embryonic Mammary Gland.” Nature Cell Biology, vol. 20, no. 6, Nature Publishing Group, 2018, pp. 677–87, doi:10.1038/s41556-018-0108-1.","short":"A. Lilja, V. Rodilla, M. Huyghe, E.B. Hannezo, C. Landragin, O. Renaud, O. Leroy, S. Rulands, B. Simons, S. Fré, Nature Cell Biology 20 (2018) 677–687.","ista":"Lilja A, Rodilla V, Huyghe M, Hannezo EB, Landragin C, Renaud O, Leroy O, Rulands S, Simons B, Fré S. 2018. Clonal analysis of Notch1-expressing cells reveals the existence of unipotent stem cells that retain long-term plasticity in the embryonic mammary gland. Nature Cell Biology. 20(6), 677–687.","apa":"Lilja, A., Rodilla, V., Huyghe, M., Hannezo, E. B., Landragin, C., Renaud, O., … Fré, S. (2018). Clonal analysis of Notch1-expressing cells reveals the existence of unipotent stem cells that retain long-term plasticity in the embryonic mammary gland. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/s41556-018-0108-1","ieee":"A. Lilja et al., “Clonal analysis of Notch1-expressing cells reveals the existence of unipotent stem cells that retain long-term plasticity in the embryonic mammary gland,” Nature Cell Biology, vol. 20, no. 6. Nature Publishing Group, pp. 677–687, 2018.","ama":"Lilja A, Rodilla V, Huyghe M, et al. Clonal analysis of Notch1-expressing cells reveals the existence of unipotent stem cells that retain long-term plasticity in the embryonic mammary gland. Nature Cell Biology. 2018;20(6):677-687. doi:10.1038/s41556-018-0108-1"},"day":"21","article_processing_charge":"No","scopus_import":"1"},{"date_published":"2018-08-01T00:00:00Z","citation":{"ista":"Auzinger T, Heidrich W, Bickel B. 2018. Computational design of nanostructural color for additive manufacturing. ACM Transactions on Graphics. 37(4), 159.","apa":"Auzinger, T., Heidrich, W., & Bickel, B. (2018). Computational design of nanostructural color for additive manufacturing. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/3197517.3201376","ieee":"T. Auzinger, W. Heidrich, and B. Bickel, “Computational design of nanostructural color for additive manufacturing,” ACM Transactions on Graphics, vol. 37, no. 4. ACM, 2018.","ama":"Auzinger T, Heidrich W, Bickel B. Computational design of nanostructural color for additive manufacturing. ACM Transactions on Graphics. 2018;37(4). doi:10.1145/3197517.3201376","chicago":"Auzinger, Thomas, Wolfgang Heidrich, and Bernd Bickel. “Computational Design of Nanostructural Color for Additive Manufacturing.” ACM Transactions on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201376.","mla":"Auzinger, Thomas, et al. “Computational Design of Nanostructural Color for Additive Manufacturing.” ACM Transactions on Graphics, vol. 37, no. 4, 159, ACM, 2018, doi:10.1145/3197517.3201376.","short":"T. Auzinger, W. Heidrich, B. Bickel, ACM Transactions on Graphics 37 (2018)."},"publication":"ACM Transactions on Graphics","article_processing_charge":"No","has_accepted_license":"1","day":"01","scopus_import":"1","oa_version":"Submitted Version","file":[{"file_name":"IST-2018-1024-v1+1_NanoStructColor-Auzinger-paper.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":10751684,"file_id":"5334","relation":"main_file","date_updated":"2020-07-14T12:45:59Z","date_created":"2018-12-12T10:18:14Z","checksum":"dcdcc955a4c1c6d2599aeebb97d2e7b9"},{"file_name":"IST-2018-1024-v1+2_NanoStructColor-Auzinger-supplemental.pdf","access_level":"open_access","file_size":20755095,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5335","date_created":"2018-12-12T10:18:15Z","date_updated":"2020-07-14T12:45:59Z","checksum":"cae52b3a8d5e97be84771cd61ea2f75e"},{"creator":"system","content_type":"image/jpeg","file_size":2186944,"file_name":"IST-2018-1024-v1+3_NanoStructColor-Auzinger-image.jpg","access_level":"open_access","date_updated":"2020-07-14T12:45:59Z","date_created":"2018-12-12T10:18:16Z","checksum":"76dd90648f75779d3f64e324b6daaffe","file_id":"5336","relation":"main_file"},{"date_updated":"2020-07-14T12:45:59Z","date_created":"2018-12-12T10:18:17Z","checksum":"c3a5b775a0ecdb20ccefb8d9646ec140","relation":"main_file","file_id":"5337","content_type":"application/x-7z-compressed","file_size":2734352,"creator":"system","file_name":"IST-2018-1024-v1+4_NanoStructColor-Auzinger-blueprint.7z","access_level":"open_access"},{"relation":"main_file","file_id":"5338","checksum":"dcdcc955a4c1c6d2599aeebb97d2e7b9","date_created":"2018-12-12T10:18:18Z","date_updated":"2020-07-14T12:45:59Z","access_level":"open_access","file_name":"IST-2018-1024-v2+1_NanoStructColor-Auzinger-paper.pdf","content_type":"application/pdf","file_size":10751684,"creator":"system"},{"checksum":"76dd90648f75779d3f64e324b6daaffe","date_created":"2018-12-12T10:18:19Z","date_updated":"2020-07-14T12:45:59Z","file_id":"5339","relation":"main_file","creator":"system","file_size":2186944,"content_type":"image/jpeg","access_level":"open_access","file_name":"IST-2018-1024-v2+3_NanoStructColor-Auzinger-image.jpg"},{"file_id":"5340","relation":"main_file","date_created":"2018-12-12T10:18:20Z","date_updated":"2020-07-14T12:45:59Z","checksum":"c3a5b775a0ecdb20ccefb8d9646ec140","file_name":"IST-2018-1024-v2+4_NanoStructColor-Auzinger-blueprint.7z","access_level":"open_access","creator":"system","content_type":"application/x-7z-compressed","file_size":2734352},{"file_id":"5341","relation":"main_file","date_updated":"2020-07-14T12:45:59Z","date_created":"2018-12-12T10:18:21Z","checksum":"667e91b686db41e44d855a4fb2137402","file_name":"IST-2018-1024-v2+5_NanoStructColor-Auzinger-supplemental.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":20755762},{"file_name":"IST-2018-1024-v3+1_NanoStructColor-Auzinger-paper.pdf","access_level":"open_access","file_size":10751684,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"5342","date_updated":"2020-07-14T12:45:59Z","date_created":"2018-12-12T10:18:22Z","checksum":"dcdcc955a4c1c6d2599aeebb97d2e7b9"},{"date_created":"2018-12-12T10:18:22Z","date_updated":"2020-07-14T12:45:59Z","checksum":"76dd90648f75779d3f64e324b6daaffe","relation":"main_file","file_id":"5343","content_type":"image/jpeg","file_size":2186944,"creator":"system","file_name":"IST-2018-1024-v3+3_NanoStructColor-Auzinger-image.jpg","access_level":"open_access"},{"creator":"system","content_type":"application/x-7z-compressed","file_size":2734352,"access_level":"open_access","file_name":"IST-2018-1024-v3+4_NanoStructColor-Auzinger-blueprint.7z","checksum":"c3a5b775a0ecdb20ccefb8d9646ec140","date_created":"2018-12-12T10:18:23Z","date_updated":"2020-07-14T12:45:59Z","file_id":"5344","relation":"main_file"},{"checksum":"667e91b686db41e44d855a4fb2137402","date_updated":"2020-07-14T12:45:59Z","date_created":"2018-12-12T10:18:24Z","file_id":"5345","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":20755762,"access_level":"open_access","file_name":"IST-2018-1024-v3+5_NanoStructColor-Auzinger-supplemental.pdf"},{"creator":"system","file_size":69698068,"content_type":"application/vnd.openxmlformats-officedocument.presentationml.presentation","file_name":"IST-2018-1024-v3+6_NanoStructColor-Auzinger-presentation.pptx","access_level":"open_access","date_created":"2018-12-12T10:18:25Z","date_updated":"2020-07-14T12:45:59Z","checksum":"72dce35388fb1aa7953df4d9ae3d02f1","file_id":"5346","relation":"main_file"}],"pubrep_id":"1028","intvolume":" 37","title":"Computational design of nanostructural color for additive manufacturing","ddc":["000","535","680"],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"304","issue":"4","abstract":[{"text":"Additive manufacturing has recently seen drastic improvements in resolution, making it now possible to fabricate features at scales of hundreds or even dozens of nanometers, which previously required very expensive lithographic methods.\r\nAs a result, additive manufacturing now seems poised for optical applications, including those relevant to computer graphics, such as material design, as well as display and imaging applications.\r\n \r\nIn this work, we explore the use of additive manufacturing for generating structural colors, where the structures are designed using a fabrication-aware optimization process.\r\nThis requires a combination of full-wave simulation, a feasible parameterization of the design space, and a tailored optimization procedure.\r\nMany of these components should be re-usable for the design of other optical structures at this scale.\r\n \r\nWe show initial results of material samples fabricated based on our designs.\r\nWhile these suffer from the prototype character of state-of-the-art fabrication hardware, we believe they clearly demonstrate the potential of additive nanofabrication for structural colors and other graphics applications.","lang":"eng"}],"alternative_title":["ACM Transactions on Graphics"],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1145/3197517.3201376","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"external_id":{"isi":["000448185000120"]},"oa":1,"month":"08","volume":37,"date_created":"2018-12-11T11:45:43Z","date_updated":"2023-09-11T12:46:13Z","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/color-effects-from-transparent-3d-printed-nanostructures/"}]},"author":[{"orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","first_name":"Thomas","full_name":"Auzinger, Thomas"},{"full_name":"Heidrich, Wolfgang","last_name":"Heidrich","first_name":"Wolfgang"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"}],"publisher":"ACM","department":[{"_id":"BeBi"}],"publication_status":"published","acknowledgement":"This work was in part supported by King Abdullah University of Science and Technology Baseline Funding.","year":"2018","ec_funded":1,"file_date_updated":"2020-07-14T12:45:59Z","article_number":"159"},{"related_material":{"link":[{"relation":"press_release","description":"News on IST Homepage","url":"https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/"}]},"author":[{"full_name":"Nakashima, Kazutaka","last_name":"Nakashima","first_name":"Kazutaka"},{"last_name":"Auzinger","first_name":"Thomas","orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","full_name":"Auzinger, Thomas"},{"full_name":"Iarussi, Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","last_name":"Iarussi","first_name":"Emmanuel"},{"full_name":"Zhang, Ran","last_name":"Zhang","first_name":"Ran","orcid":"0000-0002-3808-281X","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Igarashi","first_name":"Takeo","full_name":"Igarashi, Takeo"},{"full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd"}],"volume":37,"date_updated":"2023-09-11T12:48:09Z","date_created":"2018-12-11T11:44:09Z","year":"2018","department":[{"_id":"BeBi"}],"publisher":"ACM","publication_status":"published","publist_id":"8044","ec_funded":1,"file_date_updated":"2020-07-14T12:44:38Z","article_number":"135","doi":"10.1145/3197517.3201341","language":[{"iso":"eng"}],"external_id":{"isi":["000448185000096"]},"oa":1,"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"},{"grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Distributed 3D Object Design"}],"quality_controlled":"1","isi":1,"month":"08","pubrep_id":"1037","oa_version":"Submitted Version","file":[{"file_id":"5360","relation":"main_file","date_created":"2018-12-12T10:18:38Z","date_updated":"2020-07-14T12:44:38Z","checksum":"6a5368bc86c4e1a9fcfe588fd1f14ee8","file_name":"IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":104225664},{"file_size":377743553,"content_type":"application/zip","creator":"system","file_name":"IST-2018-1037-v1+2_CoreCavity-Supplemental.zip","access_level":"open_access","date_created":"2018-12-12T10:18:39Z","date_updated":"2020-07-14T12:44:38Z","checksum":"3861e693ba47c51f3ec7b7867d573a61","relation":"main_file","file_id":"5361"},{"relation":"main_file","file_id":"5362","date_updated":"2020-07-14T12:44:38Z","date_created":"2018-12-12T10:18:41Z","checksum":"490040c685ed869536e2a18f5a906b94","file_name":"IST-2018-1037-v1+3_CoreCavity-Video.mp4","access_level":"open_access","content_type":"video/vnd.objectvideo","file_size":162634396,"creator":"system"},{"access_level":"open_access","file_name":"IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg","content_type":"image/jpeg","file_size":527972,"creator":"system","relation":"main_file","file_id":"5363","checksum":"be7fc8b229adda727419b6504b3b9352","date_created":"2018-12-12T10:18:42Z","date_updated":"2020-07-14T12:44:38Z"}],"_id":"12","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":" 37","title":"CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds","status":"public","ddc":["004","516","670"],"issue":"4","abstract":[{"lang":"eng","text":"Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects."}],"type":"journal_article","date_published":"2018-08-04T00:00:00Z","citation":{"chicago":"Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” ACM Transaction on Graphics. ACM, 2018. https://doi.org/10.1145/3197517.3201341.","mla":"Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” ACM Transaction on Graphics, vol. 37, no. 4, 135, ACM, 2018, doi:10.1145/3197517.3201341.","short":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transaction on Graphics 37 (2018).","ista":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 37(4), 135.","ieee":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel, “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds,” ACM Transaction on Graphics, vol. 37, no. 4. ACM, 2018.","apa":"Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., & Bickel, B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. ACM. https://doi.org/10.1145/3197517.3201341","ama":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 2018;37(4). doi:10.1145/3197517.3201341"},"publication":"ACM Transaction on Graphics","article_processing_charge":"No","has_accepted_license":"1","day":"04","scopus_import":"1"},{"license":"https://creativecommons.org/licenses/by/4.0/","file_date_updated":"2020-07-14T12:46:31Z","publist_id":"7368","ec_funded":1,"article_number":"555","date_created":"2018-12-11T11:46:34Z","date_updated":"2023-09-11T12:51:03Z","volume":9,"author":[{"orcid":"0000-0002-0170-7353","id":"4A918E98-F248-11E8-B48F-1D18A9856A87","last_name":"Reiter","first_name":"Johannes","full_name":"Reiter, Johannes"},{"full_name":"Hilbe, Christian","first_name":"Christian","last_name":"Hilbe","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X"},{"first_name":"David","last_name":"Rand","full_name":"Rand, David"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Nowak","first_name":"Martin","full_name":"Nowak, Martin"}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Nature Publishing Group","year":"2018","acknowledgement":"This work was supported by the European Research Council (ERC) start grant 279307: Graph Games (C.K.), Austrian Science Fund (FWF) grant no P23499-N23 (C.K.), FWF\r\nNFN grant no S11407-N23 RiSE/SHiNE (C.K.), Office of Naval Research grant N00014-16-1-2914 (M.A.N.), National Cancer Institute grant CA179991 (M.A.N.) and by the John Templeton Foundation. J.G.R. is supported by an Erwin Schrödinger fellowship\r\n(Austrian Science Fund FWF J-3996). C.H. acknowledges generous support from the\r\nISTFELLOW program. The Program for Evolutionary Dynamics is supported in part by\r\na gift from B Wu and Eric Larson.","month":"02","language":[{"iso":"eng"}],"doi":"10.1038/s41467-017-02721-8","quality_controlled":"1","isi":1,"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"external_id":{"isi":["000424318200001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"abstract":[{"text":"Direct reciprocity is a mechanism for cooperation among humans. Many of our daily interactions are repeated. We interact repeatedly with our family, friends, colleagues, members of the local and even global community. In the theory of repeated games, it is a tacit assumption that the various games that a person plays simultaneously have no effect on each other. Here we introduce a general framework that allows us to analyze “crosstalk” between a player’s concurrent games. In the presence of crosstalk, the action a person experiences in one game can alter the person’s decision in another. We find that crosstalk impedes the maintenance of cooperation and requires stronger levels of forgiveness. The magnitude of the effect depends on the population structure. In more densely connected social groups, crosstalk has a stronger effect. A harsh retaliator, such as Tit-for-Tat, is unable to counteract crosstalk. The crosstalk framework provides a unified interpretation of direct and upstream reciprocity in the context of repeated games.","lang":"eng"}],"issue":"1","type":"journal_article","file":[{"date_created":"2018-12-12T10:09:18Z","date_updated":"2020-07-14T12:46:31Z","checksum":"b6b90367545b4c615891c960ab0567f1","file_id":"4741","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":843646,"file_name":"IST-2018-964-v1+1_2018_Hilbe_Crosstalk_in.pdf","access_level":"open_access"}],"oa_version":"Published Version","pubrep_id":"964","status":"public","title":"Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness","ddc":["004"],"intvolume":" 9","_id":"454","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","day":"07","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1","date_published":"2018-02-07T00:00:00Z","publication":"Nature Communications","citation":{"ama":"Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 2018;9(1). doi:10.1038/s41467-017-02721-8","ieee":"J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.","apa":"Reiter, J., Hilbe, C., Rand, D., Chatterjee, K., & Nowak, M. (2018). Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/s41467-017-02721-8","ista":"Reiter J, Hilbe C, Rand D, Chatterjee K, Nowak M. 2018. Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness. Nature Communications. 9(1), 555.","short":"J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, M. Nowak, Nature Communications 9 (2018).","mla":"Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.","chicago":"Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8."}},{"date_published":"2018-04-04T00:00:00Z","publication":"Neuron","citation":{"ieee":"H. Hu, F. Roth, D. H. Vandael, and P. M. Jonas, “Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons,” Neuron, vol. 98, no. 1. Elsevier, pp. 156–165, 2018.","apa":"Hu, H., Roth, F., Vandael, D. H., & Jonas, P. M. (2018). Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2018.02.024","ista":"Hu H, Roth F, Vandael DH, Jonas PM. 2018. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. 98(1), 156–165.","ama":"Hu H, Roth F, Vandael DH, Jonas PM. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. 2018;98(1):156-165. doi:10.1016/j.neuron.2018.02.024","chicago":"Hu, Hua, Fabian Roth, David H Vandael, and Peter M Jonas. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” Neuron. Elsevier, 2018. https://doi.org/10.1016/j.neuron.2018.02.024.","short":"H. Hu, F. Roth, D.H. Vandael, P.M. Jonas, Neuron 98 (2018) 156–165.","mla":"Hu, Hua, et al. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” Neuron, vol. 98, no. 1, Elsevier, 2018, pp. 156–65, doi:10.1016/j.neuron.2018.02.024."},"page":"156 - 165","day":"04","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","scopus_import":"1","file":[{"file_id":"5690","relation":"main_file","date_updated":"2020-07-14T12:46:03Z","date_created":"2018-12-17T10:37:50Z","checksum":"76070f3729f9c603e1080d0151aa2b11","file_name":"2018_Neuron_Hu.pdf","access_level":"open_access","creator":"dernst","file_size":3180444,"content_type":"application/pdf"}],"oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"320","status":"public","title":"Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons","ddc":["570"],"intvolume":" 98","abstract":[{"lang":"eng","text":"Fast-spiking, parvalbumin-expressing GABAergic interneurons (PV+-BCs) express a complex machinery of rapid signaling mechanisms, including specialized voltage-gated ion channels to generate brief action potentials (APs). However, short APs are associated with overlapping Na+ and K+ fluxes and are therefore energetically expensive. How the potentially vicious combination of high AP frequency and inefficient spike generation can be reconciled with limited energy supply is presently unclear. To address this question, we performed direct recordings from the PV+-BC axon, the subcellular structure where active conductances for AP initiation and propagation are located. Surprisingly, the energy required for the AP was, on average, only ∼1.6 times the theoretical minimum. High energy efficiency emerged from the combination of fast inactivation of Na+ channels and delayed activation of Kv3-type K+ channels, which minimized ion flux overlap during APs. Thus, the complementary tuning of axonal Na+ and K+ channel gating optimizes both fast signaling properties and metabolic efficiency. Hu et al. demonstrate that action potentials in parvalbumin-expressing GABAergic interneuron axons are energetically efficient, which is highly unexpected given their brief duration. High energy efficiency emerges from the combination of fast inactivation of voltage-gated Na+ channels and delayed activation of Kv3 channels in the axon. "}],"issue":"1","type":"journal_article","doi":"10.1016/j.neuron.2018.02.024","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000429192100016"]},"oa":1,"quality_controlled":"1","isi":1,"project":[{"call_identifier":"FP7","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","grant_number":"268548","_id":"25C0F108-B435-11E9-9278-68D0E5697425"},{"name":"Biophysics and circuit function of a giant cortical glumatergic synapse","call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","grant_number":"692692"},{"_id":"25C26B1E-B435-11E9-9278-68D0E5697425","grant_number":"P24909-B24","call_identifier":"FWF","name":"Mechanisms of transmitter release at GABAergic synapses"},{"grant_number":"Z00312","_id":"25C5A090-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"The Wittgenstein Prize"}],"month":"04","author":[{"full_name":"Hu, Hua","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","first_name":"Hua","last_name":"Hu"},{"last_name":"Roth","first_name":"Fabian","full_name":"Roth, Fabian"},{"full_name":"Vandael, David H","first_name":"David H","last_name":"Vandael","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7577-1676"},{"full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"}],"related_material":{"link":[{"url":"https://ist.ac.at/en/news/a-certain-type-of-neurons-is-more-energy-efficient-than-previously-assumed/","relation":"press_release","description":"News on IST Homepage"}]},"date_created":"2018-12-11T11:45:48Z","date_updated":"2023-09-11T12:45:10Z","volume":98,"year":"2018","publication_status":"published","publisher":"Elsevier","department":[{"_id":"PeJo"}],"file_date_updated":"2020-07-14T12:46:03Z","ec_funded":1,"publist_id":"7545"},{"project":[{"_id":"2578D616-B435-11E9-9278-68D0E5697425","grant_number":"648440","name":"Selective Barriers to Horizontal Gene Transfer","call_identifier":"H2020"}],"isi":1,"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"isi":["000431035800001"]},"language":[{"iso":"eng"}],"doi":"10.7554/eLife.32035","month":"03","department":[{"_id":"NiBa"},{"_id":"JoBo"}],"publisher":"eLife Sciences Publications","publication_status":"published","acknowledgement":"We are grateful to Remy Chait for his help and assistance with establishing our experimental setups and to Tobias Bergmiller for valuable insights into some specific experimental details. We thank Luciano Marraffini for donating us the pCas9 plasmid used in this study. We also want to express our gratitude to Seth Barribeau, Andrea Betancourt, Călin Guet, Mato Lagator, Tiago Paixão and Maroš Pleška for valuable discussions on the manuscript. Finally, we would like to thank the \r\neditors and reviewers for their helpful comments and suggestions.","year":"2018","volume":7,"date_created":"2018-12-11T11:46:23Z","date_updated":"2023-09-11T12:49:17Z","related_material":{"record":[{"relation":"research_data","status":"public","id":"9840"}]},"author":[{"full_name":"Payne, Pavel","first_name":"Pavel","last_name":"Payne","id":"35F78294-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2711-9453"},{"full_name":"Geyrhofer, Lukas","last_name":"Geyrhofer","first_name":"Lukas"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","last_name":"Bollback","first_name":"Jonathan P","full_name":"Bollback, Jonathan P"}],"article_number":"e32035","ec_funded":1,"publist_id":"7400","file_date_updated":"2020-07-14T12:46:25Z","citation":{"chicago":"Payne, Pavel, Lukas Geyrhofer, Nicholas H Barton, and Jonathan P Bollback. “CRISPR-Based Herd Immunity Can Limit Phage Epidemics in Bacterial Populations.” ELife. eLife Sciences Publications, 2018. https://doi.org/10.7554/eLife.32035.","short":"P. Payne, L. Geyrhofer, N.H. Barton, J.P. Bollback, ELife 7 (2018).","mla":"Payne, Pavel, et al. “CRISPR-Based Herd Immunity Can Limit Phage Epidemics in Bacterial Populations.” ELife, vol. 7, e32035, eLife Sciences Publications, 2018, doi:10.7554/eLife.32035.","ieee":"P. Payne, L. Geyrhofer, N. H. Barton, and J. P. Bollback, “CRISPR-based herd immunity can limit phage epidemics in bacterial populations,” eLife, vol. 7. eLife Sciences Publications, 2018.","apa":"Payne, P., Geyrhofer, L., Barton, N. H., & Bollback, J. P. (2018). CRISPR-based herd immunity can limit phage epidemics in bacterial populations. ELife. eLife Sciences Publications. https://doi.org/10.7554/eLife.32035","ista":"Payne P, Geyrhofer L, Barton NH, Bollback JP. 2018. CRISPR-based herd immunity can limit phage epidemics in bacterial populations. eLife. 7, e32035.","ama":"Payne P, Geyrhofer L, Barton NH, Bollback JP. CRISPR-based herd immunity can limit phage epidemics in bacterial populations. eLife. 2018;7. doi:10.7554/eLife.32035"},"publication":"eLife","date_published":"2018-03-09T00:00:00Z","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"09","intvolume":" 7","ddc":["576"],"status":"public","title":"CRISPR-based herd immunity can limit phage epidemics in bacterial populations","_id":"423","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"date_created":"2018-12-17T10:36:07Z","date_updated":"2020-07-14T12:46:25Z","checksum":"447cf6e680bdc3c01062a8737d876569","relation":"main_file","file_id":"5689","file_size":3533881,"content_type":"application/pdf","creator":"dernst","file_name":"2018_eLife_Payne.pdf","access_level":"open_access"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Herd immunity, a process in which resistant individuals limit the spread of a pathogen among susceptible hosts has been extensively studied in eukaryotes. Even though bacteria have evolved multiple immune systems against their phage pathogens, herd immunity in bacteria remains unexplored. Here we experimentally demonstrate that herd immunity arises during phage epidemics in structured and unstructured Escherichia coli populations consisting of differing frequencies of susceptible and resistant cells harboring CRISPR immunity. In addition, we develop a mathematical model that quantifies how herd immunity is affected by spatial population structure, bacterial growth rate, and phage replication rate. Using our model we infer a general epidemiological rule describing the relative speed of an epidemic in partially resistant spatially structured populations. Our experimental and theoretical findings indicate that herd immunity may be important in bacterial communities, allowing for stable coexistence of bacteria and their phages and the maintenance of polymorphism in bacterial immunity."}]},{"scopus_import":"1","day":"18","article_processing_charge":"No","page":"229-241","citation":{"apa":"Fulek, R., & Tóth, C. D. (2018). Crossing minimization in perturbed drawings (Vol. 11282, pp. 229–241). Presented at the Graph Drawing and Network Visualization, Barcelona, Spain: Springer. https://doi.org/10.1007/978-3-030-04414-5_16","ieee":"R. Fulek and C. D. Tóth, “Crossing minimization in perturbed drawings,” presented at the Graph Drawing and Network Visualization, Barcelona, Spain, 2018, vol. 11282, pp. 229–241.","ista":"Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. Graph Drawing and Network Visualization, LNCS, vol. 11282, 229–241.","ama":"Fulek R, Tóth CD. Crossing minimization in perturbed drawings. In: Vol 11282. Springer; 2018:229-241. doi:10.1007/978-3-030-04414-5_16","chicago":"Fulek, Radoslav, and Csaba D. Tóth. “Crossing Minimization in Perturbed Drawings,” 11282:229–41. Springer, 2018. https://doi.org/10.1007/978-3-030-04414-5_16.","short":"R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.","mla":"Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings. Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16."},"date_published":"2018-12-18T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a “compromised” drawing by a piecewise linear map φ:G → ℝ. We wish to perturb φ by an arbitrarily small ε>0 into a proper drawing (in which the vertices are distinct points, any two edges intersect in finitely many points, and no three edges have a common interior point) that minimizes the number of crossings. An ε-perturbation, for every ε>0, is given by a piecewise linear map (Formula Presented), where with ||·|| is the uniform norm (i.e., sup norm). We present a polynomial-time solution for this optimization problem when G is a cycle and the map φ has no spurs (i.e., no two adjacent edges are mapped to overlapping arcs). We also show that the problem becomes NP-complete (i) when G is an arbitrary graph and φ has no spurs, and (ii) when φ may have spurs and G is a cycle or a union of disjoint paths.","lang":"eng"}],"title":"Crossing minimization in perturbed drawings","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"5791","oa_version":"Preprint","month":"12","publication_identifier":{"isbn":["9783030044138"]},"quality_controlled":"1","isi":1,"external_id":{"arxiv":["1808.07608"],"isi":["000672802500016"]},"main_file_link":[{"url":"https://arxiv.org/abs/1808.07608","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"conference":{"name":"Graph Drawing and Network Visualization","location":"Barcelona, Spain","start_date":"2018-09-26","end_date":"2018-09-28"},"doi":"10.1007/978-3-030-04414-5_16","publication_status":"published","publisher":"Springer","department":[{"_id":"UlWa"}],"year":"2018","date_updated":"2023-09-11T12:49:55Z","date_created":"2018-12-30T22:59:15Z","volume":"11282 ","author":[{"full_name":"Fulek, Radoslav","first_name":"Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774"},{"full_name":"Tóth, Csaba D.","first_name":"Csaba D.","last_name":"Tóth"}]},{"isi":1,"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1802.01918","open_access":"1"}],"external_id":{"isi":["000433426200001"],"arxiv":["1802.01918"]},"language":[{"iso":"eng"}],"doi":"10.1103/PhysRevFluids.3.054401","month":"05","publication_status":"published","department":[{"_id":"BjHo"}],"publisher":"American Physical Society","year":"2018","date_created":"2018-12-11T11:45:39Z","date_updated":"2023-09-11T12:45:44Z","volume":3,"author":[{"full_name":"Budanur, Nazmi B","last_name":"Budanur","first_name":"Nazmi B","orcid":"0000-0003-0423-5010","id":"3EA1010E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hof, Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","first_name":"Björn","last_name":"Hof"}],"article_number":"054401","publist_id":"7590","publication":"Physical Review Fluids","citation":{"ieee":"N. B. Budanur and B. Hof, “Complexity of the laminar-turbulent boundary in pipe flow,” Physical Review Fluids, vol. 3, no. 5. American Physical Society, 2018.","apa":"Budanur, N. B., & Hof, B. (2018). Complexity of the laminar-turbulent boundary in pipe flow. Physical Review Fluids. American Physical Society. https://doi.org/10.1103/PhysRevFluids.3.054401","ista":"Budanur NB, Hof B. 2018. Complexity of the laminar-turbulent boundary in pipe flow. Physical Review Fluids. 3(5), 054401.","ama":"Budanur NB, Hof B. Complexity of the laminar-turbulent boundary in pipe flow. Physical Review Fluids. 2018;3(5). doi:10.1103/PhysRevFluids.3.054401","chicago":"Budanur, Nazmi B, and Björn Hof. “Complexity of the Laminar-Turbulent Boundary in Pipe Flow.” Physical Review Fluids. American Physical Society, 2018. https://doi.org/10.1103/PhysRevFluids.3.054401.","short":"N.B. Budanur, B. Hof, Physical Review Fluids 3 (2018).","mla":"Budanur, Nazmi B., and Björn Hof. “Complexity of the Laminar-Turbulent Boundary in Pipe Flow.” Physical Review Fluids, vol. 3, no. 5, 054401, American Physical Society, 2018, doi:10.1103/PhysRevFluids.3.054401."},"date_published":"2018-05-30T00:00:00Z","scopus_import":"1","day":"30","article_processing_charge":"No","status":"public","title":"Complexity of the laminar-turbulent boundary in pipe flow","intvolume":" 3","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"291","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"Over the past decade, the edge of chaos has proven to be a fruitful starting point for investigations of shear flows when the laminar base flow is linearly stable. Numerous computational studies of shear flows demonstrated the existence of states that separate laminar and turbulent regions of the state space. In addition, some studies determined invariant solutions that reside on this edge. In this paper, we study the unstable manifold of one such solution with the aid of continuous symmetry reduction, which we formulate here for the simultaneous quotiening of axial and azimuthal symmetries. Upon our investigation of the unstable manifold, we discover a previously unknown traveling-wave solution on the laminar-turbulent boundary with a relatively complex structure. By means of low-dimensional projections, we visualize different dynamical paths that connect these solutions to the turbulence. Our numerical experiments demonstrate that the laminar-turbulent boundary exhibits qualitatively different regions whose properties are influenced by the nearby invariant solutions.","lang":"eng"}],"issue":"5"},{"ec_funded":1,"publist_id":"7996","year":"2018","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics ","department":[{"_id":"HeEd"}],"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"full_name":"Segal Halevi, Erel","first_name":"Erel","last_name":"Segal Halevi"}],"date_updated":"2023-09-11T12:48:39Z","date_created":"2018-12-11T11:44:24Z","volume":32,"month":"09","oa":1,"external_id":{"isi":["000450810500036"],"arxiv":["1604.00960"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.00960"}],"isi":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"doi":"10.1137/16M110407X","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"Inside a two-dimensional region (``cake""), there are m nonoverlapping tiles of a certain kind (``toppings""). We want to expand the toppings while keeping them nonoverlapping, and possibly add some blank pieces of the same ``certain kind,"" such that the entire cake is covered. How many blanks must we add? We study this question in several cases: (1) The cake and toppings are general polygons. (2) The cake and toppings are convex figures. (3) The cake and toppings are axis-parallel rectangles. (4) The cake is an axis-parallel rectilinear polygon and the toppings are axis-parallel rectangles. In all four cases, we provide tight bounds on the number of blanks.","lang":"eng"}],"issue":"3","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"58","status":"public","title":"Counting blanks in polygonal arrangements","intvolume":" 32","oa_version":"Preprint","scopus_import":"1","day":"06","article_processing_charge":"No","publication":"SIAM Journal on Discrete Mathematics","citation":{"ama":"Akopyan A, Segal Halevi E. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 2018;32(3):2242-2257. doi:10.1137/16M110407X","ieee":"A. Akopyan and E. Segal Halevi, “Counting blanks in polygonal arrangements,” SIAM Journal on Discrete Mathematics, vol. 32, no. 3. Society for Industrial and Applied Mathematics , pp. 2242–2257, 2018.","apa":"Akopyan, A., & Segal Halevi, E. (2018). Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/16M110407X","ista":"Akopyan A, Segal Halevi E. 2018. Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics. 32(3), 2242–2257.","short":"A. Akopyan, E. Segal Halevi, SIAM Journal on Discrete Mathematics 32 (2018) 2242–2257.","mla":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” SIAM Journal on Discrete Mathematics, vol. 32, no. 3, Society for Industrial and Applied Mathematics , 2018, pp. 2242–57, doi:10.1137/16M110407X.","chicago":"Akopyan, Arseniy, and Erel Segal Halevi. “Counting Blanks in Polygonal Arrangements.” SIAM Journal on Discrete Mathematics. Society for Industrial and Applied Mathematics , 2018. https://doi.org/10.1137/16M110407X."},"page":"2242 - 2257","date_published":"2018-09-06T00:00:00Z"},{"type":"research_data_reference","abstract":[{"lang":"eng","text":"Herd immunity, a process in which resistant individuals limit the spread of a pathogen among susceptible hosts has been extensively studied in eukaryotes. Even though bacteria have evolved multiple immune systems against their phage pathogens, herd immunity in bacteria remains unexplored. Here we experimentally demonstrate that herd immunity arises during phage epidemics in structured and unstructured Escherichia coli populations consisting of differing frequencies of susceptible and resistant cells harboring CRISPR immunity. In addition, we develop a mathematical model that quantifies how herd immunity is affected by spatial population structure, bacterial growth rate, and phage replication rate. Using our model we infer a general epidemiological rule describing the relative speed of an epidemic in partially resistant spatially structured populations. Our experimental and theoretical findings indicate that herd immunity may be important in bacterial communities, allowing for stable coexistence of bacteria and their phages and the maintenance of polymorphism in bacterial immunity."}],"title":"Data from: CRISPR-based herd immunity limits phage epidemics in bacterial populations","status":"public","department":[{"_id":"NiBa"},{"_id":"JoBo"}],"publisher":"Dryad","_id":"9840","year":"2018","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","date_updated":"2023-09-11T12:49:17Z","date_created":"2021-08-09T13:10:02Z","oa_version":"Published Version","author":[{"first_name":"Pavel","last_name":"Payne","id":"35F78294-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2711-9453","full_name":"Payne, Pavel"},{"first_name":"Lukas","last_name":"Geyrhofer","full_name":"Geyrhofer, Lukas"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","full_name":"Bollback, Jonathan P"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"423"}]},"month":"03","day":"12","article_processing_charge":"No","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.42n44"}],"citation":{"ista":"Payne P, Geyrhofer L, Barton NH, Bollback JP. 2018. Data from: CRISPR-based herd immunity limits phage epidemics in bacterial populations, Dryad, 10.5061/dryad.42n44.","ieee":"P. Payne, L. Geyrhofer, N. H. Barton, and J. P. Bollback, “Data from: CRISPR-based herd immunity limits phage epidemics in bacterial populations.” Dryad, 2018.","apa":"Payne, P., Geyrhofer, L., Barton, N. H., & Bollback, J. P. (2018). Data from: CRISPR-based herd immunity limits phage epidemics in bacterial populations. Dryad. https://doi.org/10.5061/dryad.42n44","ama":"Payne P, Geyrhofer L, Barton NH, Bollback JP. Data from: CRISPR-based herd immunity limits phage epidemics in bacterial populations. 2018. doi:10.5061/dryad.42n44","chicago":"Payne, Pavel, Lukas Geyrhofer, Nicholas H Barton, and Jonathan P Bollback. “Data from: CRISPR-Based Herd Immunity Limits Phage Epidemics in Bacterial Populations.” Dryad, 2018. https://doi.org/10.5061/dryad.42n44.","mla":"Payne, Pavel, et al. Data from: CRISPR-Based Herd Immunity Limits Phage Epidemics in Bacterial Populations. Dryad, 2018, doi:10.5061/dryad.42n44.","short":"P. Payne, L. Geyrhofer, N.H. Barton, J.P. Bollback, (2018)."},"doi":"10.5061/dryad.42n44","date_published":"2018-03-12T00:00:00Z"}]