[{"_id":"156","publisher":"Springer","publist_id":"7765","ddc":["000"],"file_date_updated":"2020-10-09T06:22:41Z","publication_status":"published","page":"147 - 164","title":"The compound interest in relaxing punctuality","project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"has_accepted_license":"1","volume":10951,"scopus_import":"1","year":"2018","author":[{"orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","full_name":"Ferrere, Thomas","first_name":"Thomas"}],"conference":{"location":"Oxford, UK","start_date":"2018-07-15","name":"FM: International Symposium on Formal Methods","end_date":"2018-07-17"},"language":[{"iso":"eng"}],"abstract":[{"text":"Imprecision in timing can sometimes be beneficial: Metric interval temporal logic (MITL), disabling the expression of punctuality constraints, was shown to translate to timed automata, yielding an elementary decision procedure. We show how this principle extends to other forms of dense-time specification using regular expressions. By providing a clean, automaton-based formal framework for non-punctual languages, we are able to recover and extend several results in timed systems. Metric interval regular expressions (MIRE) are introduced, providing regular expressions with non-singular duration constraints. We obtain that MIRE are expressively complete relative to a class of one-clock timed automata, which can be determinized using additional clocks. Metric interval dynamic logic (MIDL) is then defined using MIRE as temporal modalities. We show that MIDL generalizes known extensions of MITL, while translating to timed automata at comparable cost.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","file":[{"checksum":"a045c213c42c445f1889326f8db82a0a","file_name":"2018_LNCS_Ferrere.pdf","date_updated":"2020-10-09T06:22:41Z","success":1,"file_size":485576,"date_created":"2020-10-09T06:22:41Z","file_id":"8637","relation":"main_file","access_level":"open_access","content_type":"application/pdf","creator":"dernst"}],"date_updated":"2023-09-19T10:05:37Z","isi":1,"date_published":"2018-07-12T00:00:00Z","doi":"10.1007/978-3-319-95582-7_9","intvolume":"     10951","status":"public","oa":1,"external_id":{"isi":["000489765800009"]},"day":"12","type":"conference","citation":{"ista":"Ferrere T. 2018. The compound interest in relaxing punctuality. FM: International Symposium on Formal Methods, LNCS, vol. 10951, 147–164.","chicago":"Ferrere, Thomas. “The Compound Interest in Relaxing Punctuality,” 10951:147–64. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>.","short":"T. Ferrere, in:, Springer, 2018, pp. 147–164.","ieee":"T. Ferrere, “The compound interest in relaxing punctuality,” presented at the FM: International Symposium on Formal Methods, Oxford, UK, 2018, vol. 10951, pp. 147–164.","apa":"Ferrere, T. (2018). The compound interest in relaxing punctuality (Vol. 10951, pp. 147–164). Presented at the FM: International Symposium on Formal Methods, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>","mla":"Ferrere, Thomas. <i>The Compound Interest in Relaxing Punctuality</i>. Vol. 10951, Springer, 2018, pp. 147–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>.","ama":"Ferrere T. The compound interest in relaxing punctuality. In: Vol 10951. Springer; 2018:147-164. doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>"},"oa_version":"Submitted Version","date_created":"2018-12-11T11:44:55Z","month":"07","quality_controlled":"1"},{"isi":1,"date_published":"2018-07-04T00:00:00Z","doi":"10.1038/s41586-018-0277-x","intvolume":"       559","related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/engineering-cooperation/"}]},"status":"public","oa":1,"external_id":{"isi":["000438240900054"]},"day":"04","type":"journal_article","citation":{"ista":"Hilbe C, Šimsa Š, Chatterjee K, Nowak M. 2018. Evolution of cooperation in stochastic games. Nature. 559(7713), 246–249.","chicago":"Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” <i>Nature</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41586-018-0277-x\">https://doi.org/10.1038/s41586-018-0277-x</a>.","short":"C. Hilbe, Š. Šimsa, K. Chatterjee, M. Nowak, Nature 559 (2018) 246–249.","ieee":"C. Hilbe, Š. Šimsa, K. Chatterjee, and M. Nowak, “Evolution of cooperation in stochastic games,” <i>Nature</i>, vol. 559, no. 7713. Nature Publishing Group, pp. 246–249, 2018.","apa":"Hilbe, C., Šimsa, Š., Chatterjee, K., &#38; Nowak, M. (2018). Evolution of cooperation in stochastic games. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41586-018-0277-x\">https://doi.org/10.1038/s41586-018-0277-x</a>","mla":"Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.” <i>Nature</i>, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:<a href=\"https://doi.org/10.1038/s41586-018-0277-x\">10.1038/s41586-018-0277-x</a>.","ama":"Hilbe C, Šimsa Š, Chatterjee K, Nowak M. Evolution of cooperation in stochastic games. <i>Nature</i>. 2018;559(7713):246-249. doi:<a href=\"https://doi.org/10.1038/s41586-018-0277-x\">10.1038/s41586-018-0277-x</a>"},"oa_version":"Submitted Version","date_created":"2018-12-11T11:44:56Z","publication":"Nature","month":"07","acknowledgement":"European Research Council Start Grant 279307, Austrian Science Fund (FWF) grant P23499-N23, \r\nC.H. acknowledges support from the ISTFELLOW programme.","quality_controlled":"1","ec_funded":1,"_id":"157","publisher":"Nature Publishing Group","publist_id":"7764","publication_status":"published","file_date_updated":"2020-07-14T12:45:02Z","ddc":["000"],"title":"Evolution of cooperation in stochastic games","page":"246 - 249","project":[{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"department":[{"_id":"KrCh"}],"has_accepted_license":"1","volume":559,"issue":"7713","scopus_import":"1","year":"2018","author":[{"first_name":"Christian","last_name":"Hilbe","full_name":"Hilbe, Christian","id":"2FDF8F3C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5116-955X"},{"first_name":"Štepán","full_name":"Šimsa, Štepán","last_name":"Šimsa"},{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Nowak, Martin","last_name":"Nowak","first_name":"Martin"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Social dilemmas occur when incentives for individuals are misaligned with group interests 1-7 . According to the 'tragedy of the commons', these misalignments can lead to overexploitation and collapse of public resources. The resulting behaviours can be analysed with the tools of game theory 8 . The theory of direct reciprocity 9-15 suggests that repeated interactions can alleviate such dilemmas, but previous work has assumed that the public resource remains constant over time. Here we introduce the idea that the public resource is instead changeable and depends on the strategic choices of individuals. An intuitive scenario is that cooperation increases the public resource, whereas defection decreases it. Thus, cooperation allows the possibility of playing a more valuable game with higher payoffs, whereas defection leads to a less valuable game. We analyse this idea using the theory of stochastic games 16-19 and evolutionary game theory. We find that the dependence of the public resource on previous interactions can greatly enhance the propensity for cooperation. For these results, the interaction between reciprocity and payoff feedback is crucial: neither repeated interactions in a constant environment nor single interactions in a changing environment yield similar cooperation rates. Our framework shows which feedbacks between exploitation and environment - either naturally occurring or designed - help to overcome social dilemmas."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","file":[{"date_updated":"2020-07-14T12:45:02Z","file_name":"2018_Nature_Hilbe.pdf","checksum":"011ab905cf9a410bc2b96f15174d654d","date_created":"2019-11-19T08:09:57Z","file_size":2834442,"creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"7049"}],"date_updated":"2023-09-11T13:43:22Z"},{"type":"journal_article","publication":"Nature Plants","date_created":"2018-12-11T11:44:56Z","citation":{"ieee":"H. Robert <i>et al.</i>, “Maternal auxin supply contributes to early embryo patterning in Arabidopsis,” <i>Nature Plants</i>, vol. 4, no. 8. Nature Publishing Group, pp. 548–553, 2018.","short":"H. Robert, C. Park, C. Gutièrrez, B. Wójcikowska, A. Pěnčík, O. Novák, J. Chen, W. Grunewald, T. Dresselhaus, J. Friml, T. Laux, Nature Plants 4 (2018) 548–553.","ista":"Robert H, Park C, Gutièrrez C, Wójcikowska B, Pěnčík A, Novák O, Chen J, Grunewald W, Dresselhaus T, Friml J, Laux T. 2018. Maternal auxin supply contributes to early embryo patterning in Arabidopsis. Nature Plants. 4(8), 548–553.","chicago":"Robert, Hélène, Chulmin Park, Carla Gutièrrez, Barbara Wójcikowska, Aleš Pěnčík, Ondřej Novák, Junyi Chen, et al. “Maternal Auxin Supply Contributes to Early Embryo Patterning in Arabidopsis.” <i>Nature Plants</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41477-018-0204-z\">https://doi.org/10.1038/s41477-018-0204-z</a>.","ama":"Robert H, Park C, Gutièrrez C, et al. Maternal auxin supply contributes to early embryo patterning in Arabidopsis. <i>Nature Plants</i>. 2018;4(8):548-553. doi:<a href=\"https://doi.org/10.1038/s41477-018-0204-z\">10.1038/s41477-018-0204-z</a>","apa":"Robert, H., Park, C., Gutièrrez, C., Wójcikowska, B., Pěnčík, A., Novák, O., … Laux, T. (2018). Maternal auxin supply contributes to early embryo patterning in Arabidopsis. <i>Nature Plants</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41477-018-0204-z\">https://doi.org/10.1038/s41477-018-0204-z</a>","mla":"Robert, Hélène, et al. “Maternal Auxin Supply Contributes to Early Embryo Patterning in Arabidopsis.” <i>Nature Plants</i>, vol. 4, no. 8, Nature Publishing Group, 2018, pp. 548–53, doi:<a href=\"https://doi.org/10.1038/s41477-018-0204-z\">10.1038/s41477-018-0204-z</a>."},"oa_version":"Submitted Version","month":"07","quality_controlled":"1","acknowledgement":"This work was further supported by the Czech Science Foundation GACR (GA13-40637S) to J.F.;","intvolume":"         4","date_published":"2018-07-16T00:00:00Z","doi":"10.1038/s41477-018-0204-z","isi":1,"status":"public","related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/plant-mothers-talk-to-their-embryos-via-the-hormone-auxin/","relation":"press_release"}]},"day":"16","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30013211","open_access":"1"}],"external_id":{"pmid":["30013211"],"isi":["000443861300011"]},"oa":1,"volume":4,"year":"2018","issue":"8","scopus_import":"1","language":[{"iso":"eng"}],"pmid":1,"author":[{"first_name":"Hélène","full_name":"Robert, Hélène","last_name":"Robert"},{"first_name":"Chulmin","full_name":"Park, Chulmin","last_name":"Park"},{"last_name":"Gutièrrez","full_name":"Gutièrrez, Carla","first_name":"Carla"},{"first_name":"Barbara","full_name":"Wójcikowska, Barbara","last_name":"Wójcikowska"},{"first_name":"Aleš","full_name":"Pěnčík, Aleš","last_name":"Pěnčík"},{"last_name":"Novák","full_name":"Novák, Ondřej","first_name":"Ondřej"},{"last_name":"Chen","full_name":"Chen, Junyi","first_name":"Junyi"},{"first_name":"Wim","full_name":"Grunewald, Wim","last_name":"Grunewald"},{"first_name":"Thomas","last_name":"Dresselhaus","full_name":"Dresselhaus, Thomas"},{"full_name":"Friml, Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","orcid":"0000-0002-8302-7596"},{"full_name":"Laux, Thomas","last_name":"Laux","first_name":"Thomas"}],"date_updated":"2025-05-07T11:12:31Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"The angiosperm seed is composed of three genetically distinct tissues: the diploid embryo that originates from the fertilized egg cell, the triploid endosperm that is produced from the fertilized central cell, and the maternal sporophytic integuments that develop into the seed coat1. At the onset of embryo development in Arabidopsis thaliana, the zygote divides asymmetrically, producing a small apical embryonic cell and a larger basal cell that connects the embryo to the maternal tissue2. The coordinated and synchronous development of the embryo and the surrounding integuments, and the alignment of their growth axes, suggest communication between maternal tissues and the embryo. In contrast to animals, however, where a network of maternal factors that direct embryo patterning have been identified3,4, only a few maternal mutations have been described to affect embryo development in plants5–7. Early embryo patterning in Arabidopsis requires accumulation of the phytohormone auxin in the apical cell by directed transport from the suspensor8–10. However, the origin of this auxin has remained obscure. Here we investigate the source of auxin for early embryogenesis and provide evidence that the mother plant coordinates seed development by supplying auxin to the early embryo from the integuments of the ovule. We show that auxin response increases in ovules after fertilization, due to upregulated auxin biosynthesis in the integuments, and this maternally produced auxin is required for correct embryo development.","lang":"eng"}],"publist_id":"7763","publisher":"Nature Publishing Group","_id":"158","ec_funded":1,"publication_status":"published","project":[{"grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants"}],"title":"Maternal auxin supply contributes to early embryo patterning in Arabidopsis","page":"548 - 553","department":[{"_id":"JiFr"}]},{"author":[{"last_name":"Fehrentz","full_name":"Fehrentz, Timm","first_name":"Timm"},{"first_name":"Florian","last_name":"Huber","full_name":"Huber, Florian"},{"full_name":"Hartrampf, Nina","last_name":"Hartrampf","first_name":"Nina"},{"first_name":"Tobias","full_name":"Bruegmann, Tobias","last_name":"Bruegmann"},{"full_name":"Frank, James","last_name":"Frank","first_name":"James"},{"first_name":"Nicholas","last_name":"Fine","full_name":"Fine, Nicholas"},{"last_name":"Malan","full_name":"Malan, Daniela","first_name":"Daniela"},{"first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G","last_name":"Danzl","orcid":"0000-0001-8559-3973"},{"first_name":"Denis","last_name":"Tikhonov","full_name":"Tikhonov, Denis"},{"full_name":"Sumser, Maritn","last_name":"Sumser","first_name":"Maritn"},{"first_name":"Philipp","full_name":"Sasse, Philipp","last_name":"Sasse"},{"full_name":"Hodson, David","last_name":"Hodson","first_name":"David"},{"first_name":"Boris","last_name":"Zhorov","full_name":"Zhorov, Boris"},{"first_name":"Nikolaj","full_name":"Klocker, Nikolaj","last_name":"Klocker"},{"first_name":"Dirk","last_name":"Trauner","full_name":"Trauner, Dirk"}],"language":[{"iso":"eng"}],"abstract":[{"text":"L-type Ca2+ channels (LTCCs) play a crucial role in excitation-contraction coupling and release of hormones from secretory cells. They are targets of antihypertensive and antiarrhythmic drugs such as diltiazem. Here, we present a photoswitchable diltiazem, FHU-779, which can be used to reversibly block endogenous LTCCs by light. FHU-779 is as potent as diltiazem and can be used to place pancreatic β-cell function and cardiac activity under optical control.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-13T09:36:35Z","file":[{"date_created":"2020-05-14T12:14:09Z","file_size":6321000,"relation":"main_file","file_id":"7832","creator":"dernst","access_level":"open_access","content_type":"application/pdf","checksum":"d42935094ec845f54a0688bf12986d62","date_updated":"2020-07-14T12:45:03Z","file_name":"2018_NatureChemicalBiology_Fehrentz.pdf"}],"has_accepted_license":"1","volume":14,"scopus_import":"1","issue":"8","year":"2018","title":"Optical control of L-type Ca2+ channels using a diltiazem photoswitch","page":"764 - 767","department":[{"_id":"JoDa"}],"_id":"159","publisher":"Nature Publishing Group","article_type":"original","publist_id":"7762","publication_status":"published","ddc":["570"],"file_date_updated":"2020-07-14T12:45:03Z","month":"07","quality_controlled":"1","type":"journal_article","oa_version":"Submitted Version","citation":{"short":"T. Fehrentz, F. Huber, N. Hartrampf, T. Bruegmann, J. Frank, N. Fine, D. Malan, J.G. Danzl, D. Tikhonov, M. Sumser, P. Sasse, D. Hodson, B. Zhorov, N. Klocker, D. Trauner, Nature Chemical Biology 14 (2018) 764–767.","ieee":"T. Fehrentz <i>et al.</i>, “Optical control of L-type Ca2+ channels using a diltiazem photoswitch,” <i>Nature Chemical Biology</i>, vol. 14, no. 8. Nature Publishing Group, pp. 764–767, 2018.","chicago":"Fehrentz, Timm, Florian Huber, Nina Hartrampf, Tobias Bruegmann, James Frank, Nicholas Fine, Daniela Malan, et al. “Optical Control of L-Type Ca2+ Channels Using a Diltiazem Photoswitch.” <i>Nature Chemical Biology</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41589-018-0090-8\">https://doi.org/10.1038/s41589-018-0090-8</a>.","ista":"Fehrentz T, Huber F, Hartrampf N, Bruegmann T, Frank J, Fine N, Malan D, Danzl JG, Tikhonov D, Sumser M, Sasse P, Hodson D, Zhorov B, Klocker N, Trauner D. 2018. Optical control of L-type Ca2+ channels using a diltiazem photoswitch. Nature Chemical Biology. 14(8), 764–767.","ama":"Fehrentz T, Huber F, Hartrampf N, et al. Optical control of L-type Ca2+ channels using a diltiazem photoswitch. <i>Nature Chemical Biology</i>. 2018;14(8):764-767. doi:<a href=\"https://doi.org/10.1038/s41589-018-0090-8\">10.1038/s41589-018-0090-8</a>","apa":"Fehrentz, T., Huber, F., Hartrampf, N., Bruegmann, T., Frank, J., Fine, N., … Trauner, D. (2018). Optical control of L-type Ca2+ channels using a diltiazem photoswitch. <i>Nature Chemical Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41589-018-0090-8\">https://doi.org/10.1038/s41589-018-0090-8</a>","mla":"Fehrentz, Timm, et al. “Optical Control of L-Type Ca2+ Channels Using a Diltiazem Photoswitch.” <i>Nature Chemical Biology</i>, vol. 14, no. 8, Nature Publishing Group, 2018, pp. 764–67, doi:<a href=\"https://doi.org/10.1038/s41589-018-0090-8\">10.1038/s41589-018-0090-8</a>."},"date_created":"2018-12-11T11:44:56Z","publication":"Nature Chemical Biology","oa":1,"external_id":{"isi":["000438970200010"]},"day":"16","isi":1,"doi":"10.1038/s41589-018-0090-8","date_published":"2018-07-16T00:00:00Z","intvolume":"        14","related_material":{"link":[{"url":"https://doi.org/10.1038/s41589-021-00744-3","relation":"erratum"}]},"status":"public"},{"status":"public","isi":1,"article_number":"103303","date_published":"2018-10-16T00:00:00Z","doi":"10.1103/PhysRevFluids.3.103303","intvolume":"         3","oa":1,"external_id":{"isi":["000447469200001"]},"day":"16","citation":{"short":"A. Varshney, V. Steinberg, Physical Review Fluids 3 (2018).","ieee":"A. Varshney and V. Steinberg, “Mixing layer instability and vorticity amplification in a creeping viscoelastic flow,” <i>Physical Review Fluids</i>, vol. 3, no. 10. American Physical Society, 2018.","chicago":"Varshney, Atul, and Victor Steinberg. “Mixing Layer Instability and Vorticity Amplification in a Creeping Viscoelastic Flow.” <i>Physical Review Fluids</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevFluids.3.103303\">https://doi.org/10.1103/PhysRevFluids.3.103303</a>.","ista":"Varshney A, Steinberg V. 2018. Mixing layer instability and vorticity amplification in a creeping viscoelastic flow. Physical Review Fluids. 3(10), 103303.","ama":"Varshney A, Steinberg V. Mixing layer instability and vorticity amplification in a creeping viscoelastic flow. <i>Physical Review Fluids</i>. 2018;3(10). doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.3.103303\">10.1103/PhysRevFluids.3.103303</a>","mla":"Varshney, Atul, and Victor Steinberg. “Mixing Layer Instability and Vorticity Amplification in a Creeping Viscoelastic Flow.” <i>Physical Review Fluids</i>, vol. 3, no. 10, 103303, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.3.103303\">10.1103/PhysRevFluids.3.103303</a>.","apa":"Varshney, A., &#38; Steinberg, V. (2018). Mixing layer instability and vorticity amplification in a creeping viscoelastic flow. <i>Physical Review Fluids</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevFluids.3.103303\">https://doi.org/10.1103/PhysRevFluids.3.103303</a>"},"oa_version":"Submitted Version","date_created":"2018-12-11T11:44:10Z","publication":"Physical Review Fluids","type":"journal_article","acknowledgement":"This work was partially supported by the Israel Science Foundation (ISF; Grant No. 882/15) and the Binational USA-Israel Foundation (BSF; Grant No. 2016145).","quality_controlled":"1","month":"10","pubrep_id":"1062","file_date_updated":"2020-07-14T12:45:04Z","ddc":["532"],"publication_status":"published","ec_funded":1,"_id":"16","publisher":"American Physical Society","article_type":"original","publist_id":"8039","department":[{"_id":"BjHo"}],"title":"Mixing layer instability and vorticity amplification in a creeping viscoelastic flow","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"scopus_import":"1","issue":"10","year":"2018","has_accepted_license":"1","volume":3,"abstract":[{"lang":"eng","text":"We report quantitative evidence of mixing-layer elastic instability in a viscoelastic fluid flow between two widely spaced obstacles hindering a channel flow at Re 1 and Wi 1. Two mixing layers with nonuniform shear velocity profiles are formed in the region between the obstacles. The mixing-layer instability arises in the vicinity of an inflection point on the shear velocity profile with a steep variation in the elastic stress. The instability results in an intermittent appearance of small vortices in the mixing layers and an amplification of spatiotemporal averaged vorticity in the elastic turbulence regime. The latter is characterized through scaling of friction factor with Wi and both pressure and velocity spectra. Furthermore, the observations reported provide improved understanding of the stability of the mixing layer in a viscoelastic fluid at large elasticity, i.e., Wi 1 and Re 1 and oppose the current view of suppression of vorticity solely by polymer additives."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-13T08:57:05Z","file":[{"checksum":"7fc0a2322214d1c04debef36d5bf2e8a","date_updated":"2020-07-14T12:45:04Z","file_name":"IST-2018-1062-v1+1_PhysRevFluids.3.103303.pdf","date_created":"2018-12-12T10:13:56Z","file_size":1838431,"relation":"main_file","file_id":"5043","creator":"system","content_type":"application/pdf","access_level":"open_access"}],"author":[{"first_name":"Atul","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","full_name":"Varshney, Atul","last_name":"Varshney","orcid":"0000-0002-3072-5999"},{"last_name":"Steinberg","full_name":"Steinberg, Victor","first_name":"Victor"}],"language":[{"iso":"eng"}]},{"date_created":"2018-12-11T11:44:57Z","oa_version":"Published Version","citation":{"mla":"Kragl, Bernhard, and Shaz Qadeer. <i>Layered Concurrent Programs</i>. Vol. 10981, Springer, 2018, pp. 79–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>.","apa":"Kragl, B., &#38; Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>","ama":"Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>","ista":"Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>.","short":"B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.","ieee":"B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102."},"type":"conference","quality_controlled":"1","month":"07","status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"8332","status":"public"}]},"intvolume":"     10981","doi":"10.1007/978-3-319-96145-3_5","date_published":"2018-07-18T00:00:00Z","isi":1,"day":"18","external_id":{"isi":["000491481600005"]},"oa":1,"year":"2018","scopus_import":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":10981,"has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:45:04Z","file_name":"2018_LNCS_Kragl.pdf","checksum":"c64fff560fe5a7532ec10626ad1c215e","creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5705","date_created":"2018-12-17T12:52:12Z","file_size":1603844}],"date_updated":"2023-09-13T08:45:09Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","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."}],"language":[{"iso":"eng"}],"author":[{"orcid":"0000-0001-7745-9117","first_name":"Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"}],"conference":{"location":"Oxford, UK","name":"CAV: Computer Aided Verification","start_date":"2018-07-14","end_date":"2018-07-17"},"publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:45:04Z","publist_id":"7761","publisher":"Springer","_id":"160","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"project":[{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"title":"Layered Concurrent Programs","page":"79 - 102"},{"month":"07","quality_controlled":"1","type":"journal_article","date_created":"2018-12-11T11:44:57Z","citation":{"ieee":"D. De Martino, A. A. Mc, T. Bergmiller, C. C. Guet, and G. Tkačik, “Statistical mechanics for metabolic networks during steady state growth,” <i>Nature Communications</i>, vol. 9, no. 1. Springer Nature, 2018.","short":"D. De Martino, A.A. Mc, T. Bergmiller, C.C. Guet, G. Tkačik, Nature Communications 9 (2018).","chicago":"De Martino, Daniele, Andersson Anna Mc, Tobias Bergmiller, Calin C Guet, and Gašper Tkačik. “Statistical Mechanics for Metabolic Networks during Steady State Growth.” <i>Nature Communications</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41467-018-05417-9\">https://doi.org/10.1038/s41467-018-05417-9</a>.","ista":"De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. 2018. Statistical mechanics for metabolic networks during steady state growth. Nature Communications. 9(1), 2988.","ama":"De Martino D, Mc AA, Bergmiller T, Guet CC, Tkačik G. Statistical mechanics for metabolic networks during steady state growth. <i>Nature Communications</i>. 2018;9(1). doi:<a href=\"https://doi.org/10.1038/s41467-018-05417-9\">10.1038/s41467-018-05417-9</a>","apa":"De Martino, D., Mc, A. A., Bergmiller, T., Guet, C. C., &#38; Tkačik, G. (2018). Statistical mechanics for metabolic networks during steady state growth. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-018-05417-9\">https://doi.org/10.1038/s41467-018-05417-9</a>","mla":"De Martino, Daniele, et al. “Statistical Mechanics for Metabolic Networks during Steady State Growth.” <i>Nature Communications</i>, vol. 9, no. 1, 2988, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-05417-9\">10.1038/s41467-018-05417-9</a>."},"oa_version":"Published Version","publication":"Nature Communications","oa":1,"day":"30","external_id":{"isi":["000440149300021"]},"article_number":"2988","isi":1,"intvolume":"         9","date_published":"2018-07-30T00:00:00Z","doi":"10.1038/s41467-018-05417-9","related_material":{"record":[{"id":"5587","relation":"popular_science","status":"public"}]},"status":"public","author":[{"last_name":"De Martino","full_name":"De Martino, Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","first_name":"Daniele","orcid":"0000-0002-5214-4706"},{"first_name":"Andersson Anna","last_name":"Mc","full_name":"Mc, Andersson Anna"},{"orcid":"0000-0001-5396-4346","last_name":"Bergmiller","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias","first_name":"Tobias"},{"orcid":"0000-0001-6220-2052","first_name":"Calin C","last_name":"Guet","full_name":"Guet, Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tkacik, Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik","first_name":"Gasper","orcid":"0000-0002-6699-1455"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Which properties of metabolic networks can be derived solely from stoichiometry? Predictive results have been obtained by flux balance analysis (FBA), by postulating that cells set metabolic fluxes to maximize growth rate. Here we consider a generalization of FBA to single-cell level using maximum entropy modeling, which we extend and test experimentally. Specifically, we define for Escherichia coli metabolism a flux distribution that yields the experimental growth rate: the model, containing FBA as a limit, provides a better match to measured fluxes and it makes a wide range of predictions: on flux variability, regulation, and correlations; on the relative importance of stoichiometry vs. optimization; on scaling relations for growth rate distributions. We validate the latter here with single-cell data at different sub-inhibitory antibiotic concentrations. The model quantifies growth optimization as emerging from the interplay of competitive dynamics in the population and regulation of metabolism at the level of single cells.","lang":"eng"}],"file":[{"relation":"main_file","file_id":"5728","creator":"dernst","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-17T16:44:28Z","file_size":1043205,"checksum":"3ba7ab27b27723c7dcf633e8fc1f8f18","date_updated":"2020-07-14T12:45:06Z","file_name":"2018_NatureComm_DeMartino.pdf"}],"date_updated":"2024-02-21T13:45:39Z","article_processing_charge":"No","has_accepted_license":"1","volume":9,"year":"2018","issue":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","title":"Statistical mechanics for metabolic networks during steady state growth","project":[{"name":"Biophysics of information processing in gene regulation","call_identifier":"FWF","_id":"254E9036-B435-11E9-9278-68D0E5697425","grant_number":"P28844-B27"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"department":[{"_id":"GaTk"},{"_id":"CaGu"}],"_id":"161","ec_funded":1,"publist_id":"7760","publisher":"Springer Nature","file_date_updated":"2020-07-14T12:45:06Z","publication_status":"published","ddc":["570"]},{"department":[{"_id":"AnKi"}],"project":[{"grant_number":"680037","name":"Coordination of Patterning And Growth In the Spinal Cord","call_identifier":"H2020","_id":"B6FC0238-B512-11E9-945C-1524E6697425"}],"title":"Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage","ddc":["571"],"file_date_updated":"2020-07-14T12:45:07Z","publication_status":"published","publist_id":"7759","publisher":"eLife Sciences Publications","_id":"162","ec_funded":1,"file":[{"file_id":"5727","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"dernst","file_size":9816484,"date_created":"2018-12-17T16:41:58Z","checksum":"da2378cdcf6b5461dcde194e4d608343","file_name":"2018_eLife_Kaucka.pdf","date_updated":"2020-07-14T12:45:07Z"}],"date_updated":"2023-09-18T09:29:07Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Facial shape is the basis for facial recognition and categorization. Facial features reflect the underlying geometry of the skeletal structures. Here, we reveal that cartilaginous nasal capsule (corresponding to upper jaw and face) is shaped by signals generated by neural structures: brain and olfactory epithelium. Brain-derived Sonic Hedgehog (SHH) enables the induction of nasal septum and posterior nasal capsule, whereas the formation of a capsule roof is controlled by signals from the olfactory epithelium. Unexpectedly, the cartilage of the nasal capsule turned out to be important for shaping membranous facial bones during development. This suggests that conserved neurosensory structures could benefit from protection and have evolved signals inducing cranial cartilages encasing them. Experiments with mutant mice revealed that the genomic regulatory regions controlling production of SHH in the nervous system contribute to facial cartilage morphogenesis, which might be a mechanism responsible for the adaptive evolution of animal faces and snouts.","lang":"eng"}],"language":[{"iso":"eng"}],"author":[{"first_name":"Marketa","full_name":"Kaucka, Marketa","last_name":"Kaucka"},{"last_name":"Petersen","full_name":"Petersen, Julian","first_name":"Julian"},{"first_name":"Marketa","last_name":"Tesarova","full_name":"Tesarova, Marketa"},{"full_name":"Szarowska, Bara","last_name":"Szarowska","first_name":"Bara"},{"last_name":"Kastriti","full_name":"Kastriti, Maria","first_name":"Maria"},{"first_name":"Meng","last_name":"Xie","full_name":"Xie, Meng"},{"orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","last_name":"Kicheva","first_name":"Anna"},{"first_name":"Karl","last_name":"Annusver","full_name":"Annusver, Karl"},{"first_name":"Maria","full_name":"Kasper, Maria","last_name":"Kasper"},{"first_name":"Orsolya","last_name":"Symmons","full_name":"Symmons, Orsolya"},{"first_name":"Leslie","last_name":"Pan","full_name":"Pan, Leslie"},{"first_name":"Francois","last_name":"Spitz","full_name":"Spitz, Francois"},{"last_name":"Kaiser","full_name":"Kaiser, Jozef","first_name":"Jozef"},{"first_name":"Maria","full_name":"Hovorakova, Maria","last_name":"Hovorakova"},{"first_name":"Tomas","full_name":"Zikmund, Tomas","last_name":"Zikmund"},{"first_name":"Kazunori","last_name":"Sunadome","full_name":"Sunadome, Kazunori"},{"full_name":"Matise, Michael P","last_name":"Matise","first_name":"Michael P"},{"first_name":"Hui","last_name":"Wang","full_name":"Wang, Hui"},{"full_name":"Marklund, Ulrika","last_name":"Marklund","first_name":"Ulrika"},{"first_name":"Hind","full_name":"Abdo, Hind","last_name":"Abdo"},{"first_name":"Patrik","full_name":"Ernfors, Patrik","last_name":"Ernfors"},{"last_name":"Maire","full_name":"Maire, Pascal","first_name":"Pascal"},{"first_name":"Maud","last_name":"Wurmser","full_name":"Wurmser, Maud"},{"first_name":"Andrei S","last_name":"Chagin","full_name":"Chagin, Andrei S"},{"last_name":"Fried","full_name":"Fried, Kaj","first_name":"Kaj"},{"first_name":"Igor","full_name":"Adameyko, Igor","last_name":"Adameyko"}],"year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":"1","volume":7,"has_accepted_license":"1","day":"13","external_id":{"isi":["000436227500001"]},"oa":1,"status":"public","related_material":{"record":[{"status":"public","id":"9838","relation":"research_data"}]},"intvolume":"         7","doi":"10.7554/eLife.34465","date_published":"2018-06-13T00:00:00Z","article_number":"e34465","isi":1,"quality_controlled":"1","month":"06","publication":"eLife","date_created":"2018-12-11T11:44:57Z","citation":{"apa":"Kaucka, M., Petersen, J., Tesarova, M., Szarowska, B., Kastriti, M., Xie, M., … Adameyko, I. (2018). Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.34465\">https://doi.org/10.7554/eLife.34465</a>","mla":"Kaucka, Marketa, et al. “Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage.” <i>ELife</i>, vol. 7, e34465, eLife Sciences Publications, 2018, doi:<a href=\"https://doi.org/10.7554/eLife.34465\">10.7554/eLife.34465</a>.","ama":"Kaucka M, Petersen J, Tesarova M, et al. Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. <i>eLife</i>. 2018;7. doi:<a href=\"https://doi.org/10.7554/eLife.34465\">10.7554/eLife.34465</a>","chicago":"Kaucka, Marketa, Julian Petersen, Marketa Tesarova, Bara Szarowska, Maria Kastriti, Meng Xie, Anna Kicheva, et al. “Signals from the Brain and Olfactory Epithelium Control Shaping of the Mammalian Nasal Capsule Cartilage.” <i>ELife</i>. eLife Sciences Publications, 2018. <a href=\"https://doi.org/10.7554/eLife.34465\">https://doi.org/10.7554/eLife.34465</a>.","ista":"Kaucka M, Petersen J, Tesarova M, Szarowska B, Kastriti M, Xie M, Kicheva A, Annusver K, Kasper M, Symmons O, Pan L, Spitz F, Kaiser J, Hovorakova M, Zikmund T, Sunadome K, Matise MP, Wang H, Marklund U, Abdo H, Ernfors P, Maire P, Wurmser M, Chagin AS, Fried K, Adameyko I. 2018. Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage. eLife. 7, e34465.","short":"M. Kaucka, J. Petersen, M. Tesarova, B. Szarowska, M. Kastriti, M. Xie, A. Kicheva, K. Annusver, M. Kasper, O. Symmons, L. Pan, F. Spitz, J. Kaiser, M. Hovorakova, T. Zikmund, K. Sunadome, M.P. Matise, H. Wang, U. Marklund, H. Abdo, P. Ernfors, P. Maire, M. Wurmser, A.S. Chagin, K. Fried, I. Adameyko, ELife 7 (2018).","ieee":"M. Kaucka <i>et al.</i>, “Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage,” <i>eLife</i>, vol. 7. eLife Sciences Publications, 2018."},"oa_version":"Published Version","type":"journal_article"},{"month":"12","quality_controlled":"1","type":"journal_article","publication":"Journal of Histochemistry and Cytochemistry","oa_version":"Published Version","citation":{"chicago":"Reipert, Siegfried, Helmuth Goldammer, Christine Richardson, Martin Goldberg, Timothy Hawkins, Elena Saeckl, Walter Kaufmann, Sebastian Antreich, and York Stierhof. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” <i>Journal of Histochemistry and Cytochemistry</i>. SAGE Publications, 2018. <a href=\"https://doi.org/10.1369/0022155418786698\">https://doi.org/10.1369/0022155418786698</a>.","ista":"Reipert S, Goldammer H, Richardson C, Goldberg M, Hawkins T, Saeckl E, Kaufmann W, Antreich S, Stierhof Y. 2018. Agitation modules: Flexible means to accelerate automated freeze substitution. Journal of Histochemistry and Cytochemistry. 66(12), 903–921.","short":"S. Reipert, H. Goldammer, C. Richardson, M. Goldberg, T. Hawkins, E. Saeckl, W. Kaufmann, S. Antreich, Y. Stierhof, Journal of Histochemistry and Cytochemistry 66 (2018) 903–921.","ieee":"S. Reipert <i>et al.</i>, “Agitation modules: Flexible means to accelerate automated freeze substitution,” <i>Journal of Histochemistry and Cytochemistry</i>, vol. 66, no. 12. SAGE Publications, pp. 903–921, 2018.","apa":"Reipert, S., Goldammer, H., Richardson, C., Goldberg, M., Hawkins, T., Saeckl, E., … Stierhof, Y. (2018). Agitation modules: Flexible means to accelerate automated freeze substitution. <i>Journal of Histochemistry and Cytochemistry</i>. SAGE Publications. <a href=\"https://doi.org/10.1369/0022155418786698\">https://doi.org/10.1369/0022155418786698</a>","mla":"Reipert, Siegfried, et al. “Agitation Modules: Flexible Means to Accelerate Automated Freeze Substitution.” <i>Journal of Histochemistry and Cytochemistry</i>, vol. 66, no. 12, SAGE Publications, 2018, pp. 903–21, doi:<a href=\"https://doi.org/10.1369/0022155418786698\">10.1369/0022155418786698</a>.","ama":"Reipert S, Goldammer H, Richardson C, et al. Agitation modules: Flexible means to accelerate automated freeze substitution. <i>Journal of Histochemistry and Cytochemistry</i>. 2018;66(12):903-921. doi:<a href=\"https://doi.org/10.1369/0022155418786698\">10.1369/0022155418786698</a>"},"date_created":"2018-12-11T11:44:57Z","external_id":{"isi":["000452277700005"],"pmid":["29969056"]},"main_file_link":[{"url":"https://doi.org/10.1369/0022155418786698","open_access":"1"}],"day":"01","oa":1,"doi":"10.1369/0022155418786698","date_published":"2018-12-01T00:00:00Z","intvolume":"        66","isi":1,"status":"public","pmid":1,"language":[{"iso":"eng"}],"author":[{"first_name":"Siegfried","last_name":"Reipert","full_name":"Reipert, Siegfried"},{"full_name":"Goldammer, Helmuth","last_name":"Goldammer","first_name":"Helmuth"},{"last_name":"Richardson","full_name":"Richardson, Christine","first_name":"Christine"},{"full_name":"Goldberg, Martin","last_name":"Goldberg","first_name":"Martin"},{"last_name":"Hawkins","full_name":"Hawkins, Timothy","first_name":"Timothy"},{"first_name":"Elena","id":"3C054040-F248-11E8-B48F-1D18A9856A87","full_name":"Hollergschwandtner, Elena","last_name":"Hollergschwandtner"},{"orcid":"0000-0001-9735-5315","last_name":"Kaufmann","full_name":"Kaufmann, Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","first_name":"Walter"},{"last_name":"Antreich","full_name":"Antreich, Sebastian","first_name":"Sebastian"},{"first_name":"York","full_name":"Stierhof, York","last_name":"Stierhof"}],"publication_identifier":{"issn":["0022-1554"]},"article_processing_charge":"No","date_updated":"2023-10-17T08:42:24Z","abstract":[{"text":"For ultrafast fixation of biological samples to avoid artifacts, high-pressure freezing (HPF) followed by freeze substitution (FS) is preferred over chemical fixation at room temperature. After HPF, samples are maintained at low temperature during dehydration and fixation, while avoiding damaging recrystallization. This is a notoriously slow process. McDonald and Webb demonstrated, in 2011, that sample agitation during FS dramatically reduces the necessary time. Then, in 2015, we (H.G. and S.R.) introduced an agitation module into the cryochamber of an automated FS unit and demonstrated that the preparation of algae could be shortened from days to a couple of hours. We argued that variability in the processing, reproducibility, and safety issues are better addressed using automated FS units. For dissemination, we started low-cost manufacturing of agitation modules for two of the most widely used FS units, the Automatic Freeze Substitution Systems, AFS(1) and AFS2, from Leica Microsystems, using three dimensional (3D)-printing of the major components. To test them, several labs independently used the modules on a wide variety of specimens that had previously been processed by manual agitation, or without agitation. We demonstrate that automated processing with sample agitation saves time, increases flexibility with respect to sample requirements and protocols, and produces data of at least as good quality as other approaches.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":66,"scopus_import":"1","issue":"12","year":"2018","page":"903-921","title":"Agitation modules: Flexible means to accelerate automated freeze substitution","department":[{"_id":"RySh"},{"_id":"EM-Fac"}],"publisher":"SAGE Publications","article_type":"original","_id":"163","publication_status":"published"},{"date_created":"2018-12-11T11:44:11Z","oa_version":"Published Version","citation":{"chicago":"Varshney, Atul, and Victor Steinberg. “Drag Enhancement and Drag Reduction in Viscoelastic Flow.” <i>Physical Review Fluids</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">https://doi.org/10.1103/PhysRevFluids.3.103302</a>.","ista":"Varshney A, Steinberg V. 2018. Drag enhancement and drag reduction in viscoelastic flow. Physical Review Fluids. 3(10), 103302.","short":"A. Varshney, V. Steinberg, Physical Review Fluids 3 (2018).","ieee":"A. Varshney and V. Steinberg, “Drag enhancement and drag reduction in viscoelastic flow,” <i>Physical Review Fluids</i>, vol. 3, no. 10. American Physical Society, 2018.","mla":"Varshney, Atul, and Victor Steinberg. “Drag Enhancement and Drag Reduction in Viscoelastic Flow.” <i>Physical Review Fluids</i>, vol. 3, no. 10, 103302, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">10.1103/PhysRevFluids.3.103302</a>.","apa":"Varshney, A., &#38; Steinberg, V. (2018). Drag enhancement and drag reduction in viscoelastic flow. <i>Physical Review Fluids</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">https://doi.org/10.1103/PhysRevFluids.3.103302</a>","ama":"Varshney A, Steinberg V. Drag enhancement and drag reduction in viscoelastic flow. <i>Physical Review Fluids</i>. 2018;3(10). doi:<a href=\"https://doi.org/10.1103/PhysRevFluids.3.103302\">10.1103/PhysRevFluids.3.103302</a>"},"publication":"Physical Review Fluids","type":"journal_article","quality_controlled":"1","month":"10","pubrep_id":"1061","status":"public","article_number":"103302 ","isi":1,"intvolume":"         3","doi":"10.1103/PhysRevFluids.3.103302","date_published":"2018-10-15T00:00:00Z","oa":1,"day":"15","external_id":{"isi":["000447311500001"]},"year":"2018","scopus_import":"1","issue":"10","has_accepted_license":"1","volume":3,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Creeping flow of polymeric fluid without inertia exhibits elastic instabilities and elastic turbulence accompanied by drag enhancement due to elastic stress produced by flow-stretched polymers. However, in inertia-dominated flow at high Re and low fluid elasticity El, a reduction in turbulent frictional drag is caused by an intricate competition between inertial and elastic stresses. Here we explore the effect of inertia on the stability of viscoelastic flow in a broad range of control parameters El and (Re,Wi). We present the stability diagram of observed flow regimes in Wi-Re coordinates and find that the instabilities' onsets show an unexpectedly nonmonotonic dependence on El. Further, three distinct regions in the diagram are identified based on El. Strikingly, for high-elasticity fluids we discover a complete relaminarization of flow at Reynolds number in the range of 1 to 10, different from a well-known turbulent drag reduction. These counterintuitive effects may be explained by a finite polymer extensibility and a suppression of vorticity at high Wi. Our results call for further theoretical and numerical development to uncover the role of inertial effect on elastic turbulence in a viscoelastic flow.","lang":"eng"}],"date_updated":"2023-09-11T12:59:28Z","file":[{"file_name":"IST-2018-1061-v1+1_PhysRevFluids.3.103302.pdf","date_updated":"2020-07-14T12:45:12Z","checksum":"e1445be33e8165114e96246275600750","content_type":"application/pdf","access_level":"open_access","creator":"system","file_id":"4800","relation":"main_file","file_size":1409040,"date_created":"2018-12-12T10:10:14Z"}],"article_processing_charge":"No","author":[{"first_name":"Atul","last_name":"Varshney","id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","full_name":"Varshney, Atul","orcid":"0000-0002-3072-5999"},{"first_name":"Victor","full_name":"Steinberg, Victor","last_name":"Steinberg"}],"language":[{"iso":"eng"}],"publication_status":"published","ddc":["532"],"file_date_updated":"2020-07-14T12:45:12Z","_id":"17","ec_funded":1,"publist_id":"8038","publisher":"American Physical Society","department":[{"_id":"BjHo"}],"title":"Drag enhancement and drag reduction in viscoelastic flow","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"}]},{"external_id":{"arxiv":["1405.7828"],"isi":["000446809500022"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.7828"}],"day":"01","oa":1,"status":"public","date_published":"2018-10-01T00:00:00Z","intvolume":"       141","isi":1,"quality_controlled":"1","arxiv":1,"month":"10","publication":"Ars Combinatoria","citation":{"ama":"Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. 2018;141(10):269-304.","mla":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.","apa":"Kolmogorov, V., &#38; Rolinek, M. (2018). Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. Charles Babbage Research Centre.","short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","ieee":"V. Kolmogorov and M. Rolinek, “Superconcentrators of density 25.3,” <i>Ars Combinatoria</i>, vol. 141, no. 10. Charles Babbage Research Centre, pp. 269–304, 2018.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>. Charles Babbage Research Centre, 2018.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304."},"oa_version":"Preprint","date_created":"2018-12-11T11:44:11Z","type":"journal_article","department":[{"_id":"VlKo"}],"title":"Superconcentrators of density 25.3","page":"269 - 304","publication_status":"published","publisher":"Charles Babbage Research Centre","publist_id":"8037","_id":"18","article_processing_charge":"No","date_updated":"2023-09-19T14:46:18Z","abstract":[{"text":"An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators with asymptotic density 25.3 (where the density is the number of edges divided by N). The previously best known densities were 28 [12] and 27.4136 [17].","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Michal","full_name":"Rolinek, Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek"}],"publication_identifier":{"issn":["0381-7032"]},"scopus_import":"1","issue":"10","year":"2018","volume":141},{"department":[{"_id":"RoSe"}],"project":[{"call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","grant_number":"694227"},{"grant_number":"P27533_N27","_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems"}],"title":"Statistical mechanics of the uniform electron gas","page":"79 - 116","ddc":["510"],"publication_status":"published","file_date_updated":"2020-07-14T12:45:16Z","publisher":"Ecole Polytechnique","article_type":"original","publist_id":"7741","ec_funded":1,"_id":"180","article_processing_charge":"No","date_updated":"2023-10-17T08:05:28Z","file":[{"checksum":"1ba7cccdf3900f42c4f715ae75d6813c","file_name":"2018_JournaldeLecoleMath_Lewi.pdf","date_updated":"2020-07-14T12:45:16Z","file_size":843938,"date_created":"2018-12-17T16:38:18Z","file_id":"5726","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"dernst"}],"abstract":[{"text":"In this paper we define and study the classical Uniform Electron Gas (UEG), a system of infinitely many electrons whose density is constant everywhere in space. The UEG is defined differently from Jellium, which has a positive constant background but no constraint on the density. We prove that the UEG arises in Density Functional Theory in the limit of a slowly varying density, minimizing the indirect Coulomb energy. We also construct the quantum UEG and compare it to the classical UEG at low density.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"full_name":"Lewi, Mathieu","last_name":"Lewi","first_name":"Mathieu"},{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott"},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"publication_identifier":{"issn":["2429-7100"],"eissn":["2270-518X"]},"scopus_import":"1","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)"},"year":"2018","volume":5,"has_accepted_license":"1","external_id":{"arxiv":["1705.10676"]},"day":"01","oa":1,"status":"public","doi":"10.5802/jep.64","date_published":"2018-07-01T00:00:00Z","intvolume":"         5","quality_controlled":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement 694227 for R.S. and MDFT 725528 for M.L.). Financial support by the Austrian Science Fund (FWF), project No P 27533-N27 (R.S.) and by the US National Science Foundation, grant No PHY12-1265118 (E.H.L.) are gratefully acknowledged.","arxiv":1,"month":"07","publication":"Journal de l'Ecole Polytechnique - Mathematiques","citation":{"ama":"Lewi M, Lieb É, Seiringer R. Statistical mechanics of the uniform electron gas. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. 2018;5:79-116. doi:<a href=\"https://doi.org/10.5802/jep.64\">10.5802/jep.64</a>","apa":"Lewi, M., Lieb, É., &#38; Seiringer, R. (2018). Statistical mechanics of the uniform electron gas. <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique. <a href=\"https://doi.org/10.5802/jep.64\">https://doi.org/10.5802/jep.64</a>","mla":"Lewi, Mathieu, et al. “Statistical Mechanics of the Uniform Electron Gas.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 5, Ecole Polytechnique, 2018, pp. 79–116, doi:<a href=\"https://doi.org/10.5802/jep.64\">10.5802/jep.64</a>.","short":"M. Lewi, É. Lieb, R. Seiringer, Journal de l’Ecole Polytechnique - Mathematiques 5 (2018) 79–116.","ieee":"M. Lewi, É. Lieb, and R. Seiringer, “Statistical mechanics of the uniform electron gas,” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>, vol. 5. Ecole Polytechnique, pp. 79–116, 2018.","chicago":"Lewi, Mathieu, Élliott Lieb, and Robert Seiringer. “Statistical Mechanics of the Uniform Electron Gas.” <i>Journal de l’Ecole Polytechnique - Mathematiques</i>. Ecole Polytechnique, 2018. <a href=\"https://doi.org/10.5802/jep.64\">https://doi.org/10.5802/jep.64</a>.","ista":"Lewi M, Lieb É, Seiringer R. 2018. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 5, 79–116."},"oa_version":"Published Version","date_created":"2018-12-11T11:45:03Z","type":"journal_article"},{"type":"journal_article","date_created":"2018-12-11T11:45:03Z","oa_version":"Published Version","citation":{"ista":"Erdös L, Krüger TH, Renfrew DT. 2018. Power law decay for systems of randomly coupled differential equations. SIAM Journal on Mathematical Analysis. 50(3), 3271–3290.","chicago":"Erdös, László, Torben H Krüger, and David T Renfrew. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics , 2018. <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>.","ieee":"L. Erdös, T. H. Krüger, and D. T. Renfrew, “Power law decay for systems of randomly coupled differential equations,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3. Society for Industrial and Applied Mathematics , pp. 3271–3290, 2018.","short":"L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis 50 (2018) 3271–3290.","apa":"Erdös, L., Krüger, T. H., &#38; Renfrew, D. T. (2018). Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/17M1143125\">https://doi.org/10.1137/17M1143125</a>","mla":"Erdös, László, et al. “Power Law Decay for Systems of Randomly Coupled Differential Equations.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 50, no. 3, Society for Industrial and Applied Mathematics , 2018, pp. 3271–90, doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>.","ama":"Erdös L, Krüger TH, Renfrew DT. Power law decay for systems of randomly coupled differential equations. <i>SIAM Journal on Mathematical Analysis</i>. 2018;50(3):3271-3290. doi:<a href=\"https://doi.org/10.1137/17M1143125\">10.1137/17M1143125</a>"},"publication":"SIAM Journal on Mathematical Analysis","month":"01","arxiv":1,"acknowledgement":"The work of the second author was also partially supported by the Hausdorff Center of Mathematics.","quality_controlled":"1","isi":1,"intvolume":"        50","date_published":"2018-01-01T00:00:00Z","doi":"10.1137/17M1143125","status":"public","oa":1,"day":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.01546"}],"external_id":{"isi":["000437018500032"],"arxiv":["1708.01546"]},"volume":50,"year":"2018","scopus_import":"1","issue":"3","author":[{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","first_name":"László","orcid":"0000-0001-5366-9603"},{"orcid":"0000-0002-4821-3297","last_name":"Krüger","id":"3020C786-F248-11E8-B48F-1D18A9856A87","full_name":"Krüger, Torben H","first_name":"Torben H"},{"orcid":"0000-0003-3493-121X","first_name":"David T","full_name":"Renfrew, David T","last_name":"Renfrew","id":"4845BF6A-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We consider large random matrices X with centered, independent entries but possibly di erent variances. We compute the normalized trace of f(X)g(X∗) for f, g functions analytic on the spectrum of X. We use these results to compute the long time asymptotics for systems of coupled di erential equations with random coe cients. We show that when the coupling is critical, the norm squared of the solution decays like t−1/2."}],"date_updated":"2023-09-15T12:05:52Z","article_processing_charge":"No","_id":"181","ec_funded":1,"publist_id":"7740","publisher":"Society for Industrial and Applied Mathematics ","publication_status":"published","page":"3271 - 3290","title":"Power law decay for systems of randomly coupled differential equations","project":[{"grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Structured Non-Hermitian Random Matrices","_id":"258F40A4-B435-11E9-9278-68D0E5697425","grant_number":"M02080"}],"department":[{"_id":"LaEr"}]},{"month":"04","quality_controlled":"1","type":"conference","date_created":"2018-12-11T11:45:04Z","oa_version":"Submitted Version","citation":{"mla":"Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.” <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, ACM, 2018, pp. 177–86, doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>.","apa":"Bakhirkin, A., Ferrere, T., &#38; Maler, O. (2018). Efficient parametric identification for STL. In <i>Proceedings of the 21st International Conference on Hybrid Systems</i> (pp. 177–186). Porto, Portugal: ACM. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>","ama":"Bakhirkin A, Ferrere T, Maler O. Efficient parametric identification for STL. In: <i>Proceedings of the 21st International Conference on Hybrid Systems</i>. ACM; 2018:177-186. doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>","ista":"Bakhirkin A, Ferrere T, Maler O. 2018. Efficient parametric identification for STL. Proceedings of the 21st International Conference on Hybrid Systems. HSCC: Hybrid Systems: Computation and Control, HSCC Proceedings, , 177–186.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric Identification for STL.” In <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, 177–86. ACM, 2018. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>.","short":"A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–186.","ieee":"A. Bakhirkin, T. Ferrere, and O. Maler, “Efficient parametric identification for STL,” in <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, Porto, Portugal, 2018, pp. 177–186."},"publication":"Proceedings of the 21st International Conference on Hybrid Systems","oa":1,"day":"11","external_id":{"isi":["000474781600020"]},"isi":1,"date_published":"2018-04-11T00:00:00Z","doi":"10.1145/3178126.3178132","status":"public","publication_identifier":{"isbn":["978-1-4503-5642-8 "]},"author":[{"first_name":"Alexey","full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin"},{"last_name":"Ferrere","full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","orcid":"0000-0001-5199-3143"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"}],"conference":{"end_date":"2018-04-13","location":"Porto, Portugal","start_date":"2018-04-11","name":"HSCC: Hybrid Systems: Computation and Control"},"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We describe a new algorithm for the parametric identification problem for signal temporal logic (STL), stated as follows. Given a densetime real-valued signal w and a parameterized temporal logic formula φ, compute the subset of the parameter space that renders the formula satisfied by the signal. Unlike previous solutions, which were based on search in the parameter space or quantifier elimination, our procedure works recursively on φ and computes the evolution over time of the set of valid parameter assignments. This procedure is similar to that of monitoring or computing the robustness of φ relative to w. Our implementation and experiments demonstrate that this approach can work well in practice."}],"date_updated":"2023-09-11T13:30:51Z","file":[{"checksum":"81eabc96430e84336ea88310ac0a1ad0","date_updated":"2020-07-14T12:45:17Z","file_name":"2018_HSCC_Bakhirkin.pdf","date_created":"2020-05-14T12:18:29Z","file_size":5900421,"relation":"main_file","file_id":"7833","creator":"dernst","content_type":"application/pdf","access_level":"open_access"}],"article_processing_charge":"No","has_accepted_license":"1","year":"2018","scopus_import":"1","page":"177 - 186","title":"Efficient parametric identification for STL","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"ToHe"}],"alternative_title":["HSCC Proceedings"],"_id":"182","publist_id":"7739","publisher":"ACM","publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:45:17Z"},{"external_id":{"isi":["000474781600022"]},"day":"11","isi":1,"doi":"10.1145/3178126.3178131","date_published":"2018-04-11T00:00:00Z","status":"public","month":"04","acknowledgement":"This work was partially supported by the Austrian Science Fund (FWF) under grants S11402-N23 and S11405-N23 (RiSE/SHiNE), the CPS/IoT project (HRSM), the EU ICT COST Action IC1402 on Run-time Verification beyond Monitoring (ARVI), the AMASS project (ECSEL 692474), and the ENABLE-S3 project (ECSEL 692455). The CPS/IoT project receives support from the Austrian government through the Federal Ministry of Science, Research and Economy (BMWFW) in the funding program Hochschulraum-Strukturmittel (HRSM) 2016. The ECSEL Joint Undertaking receives support from the European Union’s Horizon 2020 research and innovation programme and Austria, Denmark, Germany, Finland, Czech Republic, Italy, Spain, Portugal, Poland, Ireland, Belgium, France, Netherlands, United Kingdom, Slovakia, Norway.","quality_controlled":"1","type":"conference","oa_version":"None","citation":{"ista":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. 2018. Localizing faults in simulink/stateflow models with STL. HSCC: Hybrid Systems: Computation and Control, HSCC Proceedings, , 197–206.","chicago":"Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic. “Localizing Faults in Simulink/Stateflow Models with STL,” 197–206. Association for Computing Machinery, Inc, 2018. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>.","short":"E. Bartocci, T. Ferrere, N. Manjunath, D. Nickovic, in:, Association for Computing Machinery, Inc, 2018, pp. 197–206.","ieee":"E. Bartocci, T. Ferrere, N. Manjunath, and D. Nickovic, “Localizing faults in simulink/stateflow models with STL,” presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal, 2018, pp. 197–206.","apa":"Bartocci, E., Ferrere, T., Manjunath, N., &#38; Nickovic, D. (2018). Localizing faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal: Association for Computing Machinery, Inc. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>","mla":"Bartocci, Ezio, et al. <i>Localizing Faults in Simulink/Stateflow Models with STL</i>. Association for Computing Machinery, Inc, 2018, pp. 197–206, doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>.","ama":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. Localizing faults in simulink/stateflow models with STL. In: Association for Computing Machinery, Inc; 2018:197-206. doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>"},"date_created":"2018-12-11T11:45:04Z","page":"197 - 206","title":"Localizing faults in simulink/stateflow models with STL","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"alternative_title":["HSCC Proceedings"],"department":[{"_id":"ToHe"}],"_id":"183","publisher":"Association for Computing Machinery, Inc","publist_id":"7738","publication_status":"published","conference":{"start_date":"2018-04-11","location":"Porto, Portugal","name":"HSCC: Hybrid Systems: Computation and Control","end_date":"2018-04-13"},"author":[{"last_name":"Bartocci","full_name":"Bartocci, Ezio","first_name":"Ezio"},{"first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143"},{"first_name":"Niveditha","last_name":"Manjunath","full_name":"Manjunath, Niveditha"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"}],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Fault-localization is considered to be a very tedious and time-consuming activity in the design of complex Cyber-Physical Systems (CPS). This laborious task essentially requires expert knowledge of the system in order to discover the cause of the fault. In this context, we propose a new procedure that AIDS designers in debugging Simulink/Stateflow hybrid system models, guided by Signal Temporal Logic (STL) specifications. The proposed method relies on three main ingredients: (1) a monitoring and a trace diagnostics procedure that checks whether a tested behavior satisfies or violates an STL specification, localizes time segments and interfaces variables contributing to the property violations; (2) a slicing procedure that maps these observable behavior segments to the internal states and transitions of the Simulink model; and (3) a spectrum-based fault-localization method that combines the previous analysis from multiple tests to identify the internal states and/or transitions that are the most likely to explain the fault. We demonstrate the applicability of our approach on two Simulink models from the automotive and the avionics domain."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_updated":"2023-09-13T08:48:46Z","scopus_import":"1","year":"2018"},{"type":"conference","oa_version":"Published Version","citation":{"ieee":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Shellability is NP-complete,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 41:1-41:16.","short":"X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.","ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">https://doi.org/10.4230/LIPIcs.SoCG.2018.41</a>.","ama":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:41:1-41:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">10.4230/LIPIcs.SoCG.2018.41</a>","apa":"Goaoc, X., Paták, P., Patakova, Z., Tancer, M., &#38; Wagner, U. (2018). Shellability is NP-complete (Vol. 99, p. 41:1-41:16). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">https://doi.org/10.4230/LIPIcs.SoCG.2018.41</a>","mla":"Goaoc, Xavier, et al. <i>Shellability Is NP-Complete</i>. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">10.4230/LIPIcs.SoCG.2018.41</a>."},"date_created":"2018-12-11T11:45:04Z","month":"06","quality_controlled":"1","acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","date_published":"2018-06-11T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.41","intvolume":"        99","status":"public","related_material":{"record":[{"status":"public","relation":"later_version","id":"7108"}]},"day":"11","oa":1,"volume":99,"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":1,"year":"2018","language":[{"iso":"eng"}],"author":[{"first_name":"Xavier","last_name":"Goaoc","full_name":"Goaoc, Xavier"},{"last_name":"Paták","full_name":"Paták, Pavel","first_name":"Pavel"},{"first_name":"Zuzana","full_name":"Patakova, Zuzana","last_name":"Patakova","id":"48B57058-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3975-1683"},{"orcid":"0000-0002-1191-6714","first_name":"Martin","full_name":"Tancer, Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer"},{"orcid":"0000-0002-1494-0568","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","first_name":"Uli"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"file":[{"date_updated":"2020-07-14T12:45:18Z","file_name":"2018_LIPIcs_Goaoc.pdf","checksum":"d12bdd60f04a57307867704b5f930afd","creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5725","date_created":"2018-12-17T16:35:02Z","file_size":718414}],"date_updated":"2023-09-06T11:10:57Z","abstract":[{"lang":"eng","text":"We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every d ≥ 2 and k ≥ 0, deciding if a pure, d-dimensional, simplicial complex is k-decomposable is NP-hard. For d ≥ 3, both problems remain NP-hard when restricted to contractible pure d-dimensional complexes."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"7736","_id":"184","file_date_updated":"2020-07-14T12:45:18Z","ddc":["516","000"],"publication_status":"published","title":"Shellability is NP-complete","page":"41:1 - 41:16","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"department":[{"_id":"UlWa"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We resolve in the affirmative conjectures of A. Skopenkov and Repovš (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint &quot;pipes&quot; corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once."}],"file":[{"checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c","file_name":"2018_LIPIcs_Fulek.pdf","date_updated":"2020-07-14T12:45:19Z","file_id":"5701","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"dernst","file_size":718857,"date_created":"2018-12-17T12:33:52Z"}],"date_updated":"2021-01-12T06:53:36Z","publication_identifier":{"isbn":["978-3-95977-066-8"]},"conference":{"end_date":"2018-06-14","name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary"},"author":[{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","full_name":"Fulek, Radoslav","last_name":"Fulek","orcid":"0000-0001-8485-1774"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"}],"language":[{"iso":"eng"}],"year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":1,"has_accepted_license":"1","volume":99,"department":[{"_id":"UlWa"}],"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"title":"Hanani-Tutte for approximating maps of graphs","project":[{"grant_number":"M02281","_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF"}],"publication_status":"published","ddc":["510"],"file_date_updated":"2020-07-14T12:45:19Z","_id":"185","publist_id":"7735","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","month":"01","date_created":"2018-12-11T11:45:04Z","citation":{"short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","ieee":"R. Fulek and J. Kynčl, “Hanani-Tutte for approximating maps of graphs,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","chicago":"Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">https://doi.org/10.4230/LIPIcs.SoCG.2018.39</a>.","ista":"Fulek R, Kynčl J. 2018. Hanani-Tutte for approximating maps of graphs. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 39.","ama":"Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">10.4230/LIPIcs.SoCG.2018.39</a>","mla":"Fulek, Radoslav, and Jan Kynčl. <i>Hanani-Tutte for Approximating Maps of Graphs</i>. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">10.4230/LIPIcs.SoCG.2018.39</a>.","apa":"Fulek, R., &#38; Kynčl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.39\">https://doi.org/10.4230/LIPIcs.SoCG.2018.39</a>"},"oa_version":"Published Version","type":"conference","oa":1,"day":"01","status":"public","article_number":"39","intvolume":"        99","doi":"10.4230/LIPIcs.SoCG.2018.39","date_published":"2018-01-01T00:00:00Z"},{"_id":"186","publist_id":"7734","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","title":"The ℤ2-Genus of Kuratowski minors","page":"40.1 - 40.14","project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","name":"Eliminating intersections in drawings of graphs","call_identifier":"FWF","grant_number":"M02281"}],"department":[{"_id":"UlWa"}],"alternative_title":["LIPIcs"],"volume":99,"year":"2018","scopus_import":"1","author":[{"orcid":"0000-0001-8485-1774","first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"}],"conference":{"end_date":"2018-06-14","location":"Budapest, Hungary","start_date":"2018-06-11","name":"SoCG: Symposium on Computational Geometry"},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"A drawing of a graph on a surface is independently even if every pair of nonadjacent edges in the drawing crosses an even number of times. The ℤ2-genus of a graph G is the minimum g such that G has an independently even drawing on the orientable surface of genus g. An unpublished result by Robertson and Seymour implies that for every t, every graph of sufficiently large genus contains as a minor a projective t × t grid or one of the following so-called t-Kuratowski graphs: K3, t, or t copies of K5 or K3,3 sharing at most 2 common vertices. We show that the ℤ2-genus of graphs in these families is unbounded in t; in fact, equal to their genus. Together, this implies that the genus of a graph is bounded from above by a function of its ℤ2-genus, solving a problem posed by Schaefer and Štefankovič, and giving an approximate version of the Hanani-Tutte theorem on orientable surfaces."}],"date_updated":"2023-08-14T12:43:51Z","article_processing_charge":"No","intvolume":"        99","date_published":"2018-06-11T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.40","related_material":{"record":[{"relation":"later_version","id":"11593","status":"public"}]},"status":"public","oa":1,"day":"11","main_file_link":[{"url":"https://arxiv.org/abs/1803.05085","open_access":"1"}],"external_id":{"arxiv":["1803.05085"]},"type":"conference","date_created":"2018-12-11T11:45:05Z","citation":{"chicago":"Fulek, Radoslav, and Jan Kynčl. “The ℤ2-Genus of Kuratowski Minors,” 99:40.1-40.14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.40\">https://doi.org/10.4230/LIPIcs.SoCG.2018.40</a>.","ista":"Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 40.1-40.14.","ieee":"R. Fulek and J. Kynčl, “The ℤ2-Genus of Kuratowski minors,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 40.1-40.14.","short":"R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14.","mla":"Fulek, Radoslav, and Jan Kynčl. <i>The ℤ2-Genus of Kuratowski Minors</i>. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.40\">10.4230/LIPIcs.SoCG.2018.40</a>.","apa":"Fulek, R., &#38; Kynčl, J. (2018). The ℤ2-Genus of Kuratowski minors (Vol. 99, p. 40.1-40.14). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.40\">https://doi.org/10.4230/LIPIcs.SoCG.2018.40</a>","ama":"Fulek R, Kynčl J. The ℤ2-Genus of Kuratowski minors. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:40.1-40.14. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.40\">10.4230/LIPIcs.SoCG.2018.40</a>"},"oa_version":"Submitted Version","month":"06","arxiv":1,"quality_controlled":"1"},{"date_updated":"2023-09-07T13:29:00Z","file":[{"creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5738","date_created":"2018-12-18T09:27:22Z","file_size":528018,"date_updated":"2020-07-14T12:45:19Z","file_name":"2018_LIPIcs_Edelsbrunner_Osang.pdf","checksum":"d8c0533ad0018eb4ed1077475eb8fc18"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Given a locally finite X ⊆ ℝd and a radius r ≥ 0, the k-fold cover of X and r consists of all points in ℝd that have k or more points of X within distance r. We consider two filtrations - one in scale obtained by fixing k and increasing r, and the other in depth obtained by fixing r and decreasing k - and we compute the persistence diagrams of both. While standard methods suffice for the filtration in scale, we need novel geometric and topological concepts for the filtration in depth. In particular, we introduce a rhomboid tiling in ℝd+1 whose horizontal integer slices are the order-k Delaunay mosaics of X, and construct a zigzag module from Delaunay mosaics that is isomorphic to the persistence module of the multi-covers. "}],"language":[{"iso":"eng"}],"author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"},{"orcid":"0000-0002-8882-5116","first_name":"Georg F","full_name":"Osang, Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","last_name":"Osang"}],"conference":{"start_date":"2018-06-11","location":"Budapest, Hungary","name":"SoCG: Symposium on Computational Geometry","end_date":"2018-06-14"},"year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":1,"volume":99,"has_accepted_license":"1","department":[{"_id":"HeEd"}],"alternative_title":["LIPIcs"],"project":[{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"title":"The multi-cover persistence of Euclidean balls","publication_status":"published","file_date_updated":"2020-07-14T12:45:19Z","ddc":["516"],"publist_id":"7732","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"187","quality_controlled":"1","acknowledgement":"This work is partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund (FWF).","month":"06","date_created":"2018-12-11T11:45:05Z","citation":{"apa":"Edelsbrunner, H., &#38; Osang, G. F. (2018). The multi-cover persistence of Euclidean balls (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">https://doi.org/10.4230/LIPIcs.SoCG.2018.34</a>","mla":"Edelsbrunner, Herbert, and Georg F. Osang. <i>The Multi-Cover Persistence of Euclidean Balls</i>. Vol. 99, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">10.4230/LIPIcs.SoCG.2018.34</a>.","ama":"Edelsbrunner H, Osang GF. The multi-cover persistence of Euclidean balls. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">10.4230/LIPIcs.SoCG.2018.34</a>","ista":"Edelsbrunner H, Osang GF. 2018. The multi-cover persistence of Euclidean balls. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99, 34.","chicago":"Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.34\">https://doi.org/10.4230/LIPIcs.SoCG.2018.34</a>.","ieee":"H. Edelsbrunner and G. F. Osang, “The multi-cover persistence of Euclidean balls,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99.","short":"H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018."},"oa_version":"Published Version","type":"conference","day":"11","oa":1,"status":"public","related_material":{"record":[{"status":"public","relation":"later_version","id":"9317"},{"relation":"dissertation_contains","id":"9056","status":"public"}]},"intvolume":"        99","doi":"10.4230/LIPIcs.SoCG.2018.34","date_published":"2018-06-11T00:00:00Z","article_number":"34"},{"day":"11","oa":1,"status":"public","intvolume":"        99","date_published":"2018-06-11T00:00:00Z","doi":"10.4230/LIPIcs.SoCG.2018.35","quality_controlled":"1","acknowledgement":"This research is partially supported by the Office of Naval Research, through grant no. N62909-18-1-2038, and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, through grant no. I02979-N35 of the Austrian Science Fund","month":"06","date_created":"2018-12-11T11:45:05Z","oa_version":"Published Version","citation":{"ama":"Edelsbrunner H, Virk Z, Wagner H. Smallest enclosing spheres and Chernoff points in Bregman geometry. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:35:1-35:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.35\">10.4230/LIPIcs.SoCG.2018.35</a>","apa":"Edelsbrunner, H., Virk, Z., &#38; Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.35\">https://doi.org/10.4230/LIPIcs.SoCG.2018.35</a>","mla":"Edelsbrunner, Herbert, et al. <i>Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry</i>. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.35\">10.4230/LIPIcs.SoCG.2018.35</a>.","ieee":"H. Edelsbrunner, Z. Virk, and H. Wagner, “Smallest enclosing spheres and Chernoff points in Bregman geometry,” presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary, 2018, vol. 99, p. 35:1-35:13.","short":"H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13.","chicago":"Edelsbrunner, Herbert, Ziga Virk, and Hubert Wagner. “Smallest Enclosing Spheres and Chernoff Points in Bregman Geometry,” 99:35:1-35:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.35\">https://doi.org/10.4230/LIPIcs.SoCG.2018.35</a>.","ista":"Edelsbrunner H, Virk Z, Wagner H. 2018. Smallest enclosing spheres and Chernoff points in Bregman geometry. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 35:1-35:13."},"type":"conference","department":[{"_id":"HeEd"}],"alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"project":[{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"title":"Smallest enclosing spheres and Chernoff points in Bregman geometry","page":"35:1 - 35:13","publication_status":"published","ddc":["000"],"file_date_updated":"2020-07-14T12:45:20Z","publist_id":"7733","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"188","file":[{"checksum":"7509403803b3ac1aee94bbc2ad293d21","date_updated":"2020-07-14T12:45:20Z","file_name":"2018_LIPIcs_Edelsbrunner.pdf","relation":"main_file","file_id":"5724","creator":"dernst","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-17T16:31:31Z","file_size":489080}],"date_updated":"2021-01-12T06:53:48Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Smallest enclosing spheres of finite point sets are central to methods in topological data analysis. Focusing on Bregman divergences to measure dissimilarity, we prove bounds on the location of the center of a smallest enclosing sphere. These bounds depend on the range of radii for which Bregman balls are convex."}],"language":[{"iso":"eng"}],"conference":{"end_date":"2018-06-14","start_date":"2018-06-11","location":"Budapest, Hungary","name":"SoCG: Symposium on Computational Geometry"},"author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"last_name":"Virk","full_name":"Virk, Ziga","first_name":"Ziga"},{"first_name":"Hubert","full_name":"Wagner, Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"year":"2018","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"scopus_import":1,"volume":99,"has_accepted_license":"1"}]