[{"volume":11014,"acknowledgement":"Trevor Brown was supported in part by the ISF (grants 2005/17 & 1749/14) and by a NSERC post-doctoral fellowship.","day":"01","date_published":"2018-08-01T00:00:00Z","has_accepted_license":"1","intvolume":"     11014","file_date_updated":"2020-07-14T12:48:14Z","doi":"10.1007/978-3-319-96983-1_33","article_processing_charge":"No","oa":1,"conference":{"location":"Turin, Italy","end_date":"2018-08-31","name":"Euro-Par: European Conference on Parallel Processing","start_date":"2018-08-27"},"quality_controlled":"1","citation":{"ama":"Gilad E, Brown TA, Oskin M, Etsion Y. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. In: Vol 11014. Springer; 2018:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>","short":"E. Gilad, T.A. Brown, M. Oskin, Y. Etsion, in:, Springer, 2018, pp. 465–479.","ista":"Gilad E, Brown TA, Oskin M, Etsion Y. 2018. Snapshot based synchronization: A fast replacement for Hand-over-Hand locking. Euro-Par: European Conference on Parallel Processing, LNCS, vol. 11014, 465–479.","ieee":"E. Gilad, T. A. Brown, M. Oskin, and Y. Etsion, “Snapshot based synchronization: A fast replacement for Hand-over-Hand locking,” presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy, 2018, vol. 11014, pp. 465–479.","mla":"Gilad, Eran, et al. <i>Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking</i>. Vol. 11014, Springer, 2018, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">10.1007/978-3-319-96983-1_33</a>.","apa":"Gilad, E., Brown, T. A., Oskin, M., &#38; Etsion, Y. (2018). Snapshot based synchronization: A fast replacement for Hand-over-Hand locking (Vol. 11014, pp. 465–479). Presented at the Euro-Par: European Conference on Parallel Processing, Turin, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>","chicago":"Gilad, Eran, Trevor A Brown, Mark Oskin, and Yoav Etsion. “Snapshot Based Synchronization: A Fast Replacement for Hand-over-Hand Locking,” 11014:465–79. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96983-1_33\">https://doi.org/10.1007/978-3-319-96983-1_33</a>."},"date_created":"2018-12-11T11:44:33Z","publist_id":"7969","page":"465 - 479","title":"Snapshot based synchronization: A fast replacement for Hand-over-Hand locking","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-18T09:32:36Z","scopus_import":"1","abstract":[{"lang":"eng","text":"Concurrent accesses to shared data structures must be synchronized to avoid data races. Coarse-grained synchronization, which locks the entire data structure, is easy to implement but does not scale. Fine-grained synchronization can scale well, but can be hard to reason about. Hand-over-hand locking, in which operations are pipelined as they traverse the data structure, combines fine-grained synchronization with ease of use. However, the traditional implementation suffers from inherent overheads. This paper introduces snapshot-based synchronization (SBS), a novel hand-over-hand locking mechanism. SBS decouples the synchronization state from the data, significantly improving cache utilization. Further, it relies on guarantees provided by pipelining to minimize synchronization that requires cross-thread communication. Snapshot-based synchronization thus scales much better than traditional hand-over-hand locking, while maintaining the same ease of use."}],"author":[{"full_name":"Gilad, Eran","last_name":"Gilad","first_name":"Eran"},{"last_name":"Brown","full_name":"Brown, Trevor A","first_name":"Trevor A","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mark","full_name":"Oskin, Mark","last_name":"Oskin"},{"last_name":"Etsion","full_name":"Etsion, Yoav","first_name":"Yoav"}],"status":"public","publisher":"Springer","_id":"85","publication_status":"published","alternative_title":["LNCS"],"external_id":{"isi":["000851042300031"]},"type":"conference","file":[{"file_size":665372,"checksum":"13a3f250be8878405e791b53c19722ad","date_created":"2019-02-12T07:40:40Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:48:14Z","file_id":"5954","creator":"dernst","relation":"main_file","file_name":"2018_Brown.pdf"}],"ddc":["000"],"oa_version":"Preprint","month":"08","year":"2018","project":[{"_id":"26450934-B435-11E9-9278-68D0E5697425","name":"NSERC Postdoctoral fellowship"}],"isi":1,"publication_identifier":{"issn":["03029743"]},"department":[{"_id":"DaAl"}]},{"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:20:00Z","day":"13","acknowledgement":"We thank I. Andrew and S.E. Bae for excellent technical assistance, F. Gage for plasmids, and K. Nave (Nex-Cre) for mouse colonies. We thank members of the Marín and Rico laboratories for stimulating discussions and ideas. Our research on this topic is supported by grants from the European Research Council (ERC-2017-AdG 787355 to O.M and ERC2016-CoG 725780 to S.H.) and Wellcome Trust (103714MA) to O.M. L.L. was the recipient of an EMBO long-term postdoctoral fellowship, R.B. received support from FWF Lise-Meitner program (M 2416) and F.K.W. was supported by an EMBO postdoctoral fellowship and is currently a Marie Skłodowska-Curie Fellow from the European Commission under the H2020 Programme.","publication":"bioRxiv","date_published":"2018-12-13T00:00:00Z","abstract":[{"text":"The cerebral cortex contains multiple hierarchically organized areas with distinctive cytoarchitectonical patterns, but the cellular mechanisms underlying the emergence of this diversity remain unclear. Here, we have quantitatively investigated the neuronal output of individual progenitor cells in the ventricular zone of the developing mouse neocortex using a combination of methods that together circumvent the biases and limitations of individual approaches. We found that individual cortical progenitor cells show a high degree of stochasticity and generate pyramidal cell lineages that adopt a wide range of laminar configurations. Mathematical modelling these lineage data suggests that a small number of progenitor cell populations, each generating pyramidal cells following different stochastic developmental programs, suffice to generate the heterogenous complement of pyramidal cell lineages that collectively build the complex cytoarchitecture of the neocortex.","lang":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1101/494088","open_access":"1"}],"doi":"10.1101/494088","author":[{"first_name":"Alfredo","last_name":"Llorca","full_name":"Llorca, Alfredo"},{"last_name":"Ciceri","full_name":"Ciceri, Gabriele","first_name":"Gabriele"},{"full_name":"Beattie, Robert J","last_name":"Beattie","orcid":"0000-0002-8483-8753","id":"2E26DF60-F248-11E8-B48F-1D18A9856A87","first_name":"Robert J"},{"full_name":"Wong, Fong K.","last_name":"Wong","first_name":"Fong K."},{"last_name":"Diana","full_name":"Diana, Giovanni","first_name":"Giovanni"},{"first_name":"Eleni","full_name":"Serafeimidou, Eleni","last_name":"Serafeimidou"},{"last_name":"Fernández-Otero","full_name":"Fernández-Otero, Marian","first_name":"Marian"},{"first_name":"Carmen","id":"36BCB99C-F248-11E8-B48F-1D18A9856A87","last_name":"Streicher","full_name":"Streicher, Carmen"},{"first_name":"Sebastian J.","full_name":"Arnold, Sebastian J.","last_name":"Arnold"},{"first_name":"Martin","last_name":"Meyer","full_name":"Meyer, Martin"},{"last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"first_name":"Miguel","full_name":"Maravall, Miguel","last_name":"Maravall"},{"last_name":"Marín","full_name":"Marín, Oscar","first_name":"Oscar"}],"article_processing_charge":"No","ec_funded":1,"status":"public","oa":1,"publisher":"Cold Spring Harbor Laboratory","_id":"8547","publication_status":"submitted","date_created":"2020-09-21T12:01:50Z","citation":{"short":"A. Llorca, G. Ciceri, R.J. Beattie, F.K. Wong, G. Diana, E. Serafeimidou, M. Fernández-Otero, C. Streicher, S.J. Arnold, M. Meyer, S. Hippenmeyer, M. Maravall, O. Marín, BioRxiv (n.d.).","ieee":"A. Llorca <i>et al.</i>, “Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture,” <i>bioRxiv</i>. Cold Spring Harbor Laboratory.","ista":"Llorca A, Ciceri G, Beattie RJ, Wong FK, Diana G, Serafeimidou E, Fernández-Otero M, Streicher C, Arnold SJ, Meyer M, Hippenmeyer S, Maravall M, Marín O. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. bioRxiv, <a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>.","ama":"Llorca A, Ciceri G, Beattie RJ, et al. Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>","mla":"Llorca, Alfredo, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>, Cold Spring Harbor Laboratory, doi:<a href=\"https://doi.org/10.1101/494088\">10.1101/494088</a>.","chicago":"Llorca, Alfredo, Gabriele Ciceri, Robert J Beattie, Fong K. Wong, Giovanni Diana, Eleni Serafeimidou, Marian Fernández-Otero, et al. “Heterogeneous Progenitor Cell Behaviors Underlie the Assembly of Neocortical Cytoarchitecture.” <i>BioRxiv</i>. Cold Spring Harbor Laboratory, n.d. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>.","apa":"Llorca, A., Ciceri, G., Beattie, R. J., Wong, F. K., Diana, G., Serafeimidou, E., … Marín, O. (n.d.). Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture. <i>bioRxiv</i>. Cold Spring Harbor Laboratory. <a href=\"https://doi.org/10.1101/494088\">https://doi.org/10.1101/494088</a>"},"type":"preprint","oa_version":"Preprint","year":"2018","month":"12","project":[{"grant_number":"725780","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development","_id":"260018B0-B435-11E9-9278-68D0E5697425"},{"_id":"264E56E2-B435-11E9-9278-68D0E5697425","name":"Molecular Mechanisms Regulating Gliogenesis in the Cerebral Cortex","call_identifier":"FWF","grant_number":"M02416"}],"title":"Heterogeneous progenitor cell behaviors underlie the assembly of neocortical cytoarchitecture","department":[{"_id":"SiHi"}]},{"month":"07","year":"2018","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory","grant_number":"S11407"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","ddc":["000"],"oa_version":"Submitted Version","file":[{"relation":"main_file","creator":"dernst","file_id":"7053","file_name":"2018_PrinciplesModeling_Chatterjee.pdf","date_created":"2019-11-19T08:22:18Z","file_size":516307,"checksum":"9995c6ce6957333baf616fc4f20be597","date_updated":"2020-07-14T12:48:14Z","content_type":"application/pdf","access_level":"open_access"}],"type":"book_chapter","_id":"86","publication_status":"published","alternative_title":["LNCS"],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","full_name":"Otop, Jan","last_name":"Otop"}],"status":"public","date_updated":"2021-01-12T08:20:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms."}],"scopus_import":1,"page":"143 - 161","publist_id":"7968","title":"Computing average response time","oa":1,"date_created":"2018-12-11T11:44:33Z","citation":{"mla":"Chatterjee, Krishnendu, et al. “Computing Average Response Time.” <i>Principles of Modeling</i>, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &#38; M. Sirjani (Eds.), <i>Principles of Modeling</i> (Vol. 10760, pp. 143–161). Springer. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In <i>Principles of Modeling</i>, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>.","ama":"Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. <i>Principles of Modeling</i>. Vol 10760. Springer; 2018:143-161. doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in <i>Principles of Modeling</i>, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","ista":"Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161."},"quality_controlled":"1","doi":"10.1007/978-3-319-95246-8_9","file_date_updated":"2020-07-14T12:48:14Z","ec_funded":1,"volume":10760,"publication":"Principles of Modeling","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.","day":"20","intvolume":"     10760","editor":[{"last_name":"Lohstroh","full_name":"Lohstroh, Marten","first_name":"Marten"},{"full_name":"Derler, Patricia","last_name":"Derler","first_name":"Patricia"},{"first_name":"Marjan","full_name":"Sirjani, Marjan","last_name":"Sirjani"}],"has_accepted_license":"1","date_published":"2018-07-20T00:00:00Z"},{"quality_controlled":"1","date_created":"2020-10-06T16:33:37Z","citation":{"ama":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. 2018;8. doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>","short":"C. Gregor, S.C. Sidenstein, M. Andresen, S.J. Sahl, J.G. Danzl, S.W. Hell, Scientific Reports 8 (2018).","ista":"Gregor C, Sidenstein SC, Andresen M, Sahl SJ, Danzl JG, Hell SW. 2018. Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. Scientific Reports. 8, 2724.","ieee":"C. Gregor, S. C. Sidenstein, M. Andresen, S. J. Sahl, J. G. Danzl, and S. W. Hell, “Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA,” <i>Scientific Reports</i>, vol. 8. Springer Nature, 2018.","mla":"Gregor, Carola, et al. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>, vol. 8, 2724, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-19947-1\">10.1038/s41598-018-19947-1</a>.","apa":"Gregor, C., Sidenstein, S. C., Andresen, M., Sahl, S. J., Danzl, J. G., &#38; Hell, S. W. (2018). Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA. <i>Scientific Reports</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>","chicago":"Gregor, Carola, Sven C. Sidenstein, Martin Andresen, Steffen J. Sahl, Johann G Danzl, and Stefan W. Hell. “Novel Reversibly Switchable Fluorescent Proteins for RESOLFT and STED Nanoscopy Engineered from the Bacterial Photoreceptor YtvA.” <i>Scientific Reports</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41598-018-19947-1\">https://doi.org/10.1038/s41598-018-19947-1</a>."},"article_number":"2724","oa":1,"title":"Novel reversibly switchable fluorescent proteins for RESOLFT and STED nanoscopy engineered from the bacterial photoreceptor YtvA","date_published":"2018-02-09T00:00:00Z","has_accepted_license":"1","intvolume":"         8","pmid":1,"volume":8,"publication":"Scientific Reports","day":"09","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2020-10-06T16:35:16Z","doi":"10.1038/s41598-018-19947-1","_id":"8618","external_id":{"pmid":["29426833"],"isi":["000424630400037"]},"publication_status":"published","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-10-06T16:35:16Z","success":1,"checksum":"e642080fcbde9584c63544f587c74f03","file_size":2818077,"date_created":"2020-10-06T16:35:16Z","file_name":"2018_ScientificReports_Gregor.pdf","file_id":"8619","creator":"dernst","relation":"main_file"}],"oa_version":"Published Version","ddc":["570"],"type":"journal_article","publisher":"Springer Nature","article_type":"original","department":[{"_id":"JoDa"}],"year":"2018","month":"02","isi":1,"publication_identifier":{"issn":["2045-2322"]},"abstract":[{"text":"The reversibly switchable fluorescent proteins (RSFPs) commonly used for RESOLFT nanoscopy have been developed from fluorescent proteins of the GFP superfamily. These proteins are bright, but exhibit several drawbacks such as relatively large size, oxygen-dependence, sensitivity to low pH, and limited switching speed. Therefore, RSFPs from other origins with improved properties need to be explored. Here, we report the development of two RSFPs based on the LOV domain of the photoreceptor protein YtvA from Bacillus subtilis. LOV domains obtain their fluorescence by association with the abundant cellular cofactor flavin mononucleotide (FMN). Under illumination with blue and ultraviolet light, they undergo a photocycle, making these proteins inherently photoswitchable. Our first improved variant, rsLOV1, can be used for RESOLFT imaging, whereas rsLOV2 proved useful for STED nanoscopy of living cells with a resolution of down to 50 nm. In addition to their smaller size compared to GFP-related proteins (17 kDa instead of 27 kDa) and their usability at low pH, rsLOV1 and rsLOV2 exhibit faster switching kinetics, switching on and off 3 times faster than rsEGFP2, the fastest-switching RSFP reported to date. Therefore, LOV-domain-based RSFPs have potential for applications where the switching speed of GFP-based proteins is limiting.","lang":"eng"}],"keyword":["Multidisciplinary"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-19T15:04:49Z","author":[{"full_name":"Gregor, Carola","last_name":"Gregor","first_name":"Carola"},{"full_name":"Sidenstein, Sven C.","last_name":"Sidenstein","first_name":"Sven C."},{"first_name":"Martin","last_name":"Andresen","full_name":"Andresen, Martin"},{"full_name":"Sahl, Steffen J.","last_name":"Sahl","first_name":"Steffen J."},{"orcid":"0000-0001-8559-3973","last_name":"Danzl","full_name":"Danzl, Johann G","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hell, Stefan W.","last_name":"Hell","first_name":"Stefan W."}],"status":"public"},{"date_updated":"2023-09-15T12:10:35Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics."}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6287"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1705.02870","open_access":"1"}],"scopus_import":"1","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton","last_name":"Nikitenko","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","publisher":"Institute of Mathematical Statistics","oa_version":"Preprint","type":"journal_article","_id":"87","issue":"5","external_id":{"isi":["000442893500018"],"arxiv":["1705.02870"]},"publication_status":"published","isi":1,"year":"2018","month":"10","project":[{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"department":[{"_id":"HeEd"}],"article_type":"original","volume":28,"publication":"Annals of Applied Probability","day":"01","intvolume":"        28","date_published":"2018-10-01T00:00:00Z","doi":"10.1214/18-AAP1389","article_processing_charge":"No","oa":1,"citation":{"mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>, vol. 28, no. 5, Institute of Mathematical Statistics, 2018, pp. 3215–38, doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2018). Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Random Inscribed Polytopes Have Similar Radius Functions as Poisson-Delaunay Mosaics.” <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2018. <a href=\"https://doi.org/10.1214/18-AAP1389\">https://doi.org/10.1214/18-AAP1389</a>.","ama":"Edelsbrunner H, Nikitenko A. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. <i>Annals of Applied Probability</i>. 2018;28(5):3215-3238. doi:<a href=\"https://doi.org/10.1214/18-AAP1389\">10.1214/18-AAP1389</a>","ista":"Edelsbrunner H, Nikitenko A. 2018. Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics. Annals of Applied Probability. 28(5), 3215–3238.","short":"H. Edelsbrunner, A. Nikitenko, Annals of Applied Probability 28 (2018) 3215–3238.","ieee":"H. Edelsbrunner and A. Nikitenko, “Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics,” <i>Annals of Applied Probability</i>, vol. 28, no. 5. Institute of Mathematical Statistics, pp. 3215–3238, 2018."},"date_created":"2018-12-11T11:44:33Z","arxiv":1,"quality_controlled":"1","page":"3215 - 3238","publist_id":"7967","title":"Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics"},{"publist_id":"8047","page":"96","title":"Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ","oa":1,"date_created":"2018-12-11T11:44:08Z","citation":{"short":"V. Belyaeva, Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo , Institute of Science and Technology Austria, 2018.","ieee":"V. Belyaeva, “Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo ,” Institute of Science and Technology Austria, 2018.","ista":"Belyaeva V. 2018. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . Institute of Science and Technology Austria.","ama":"Belyaeva V. Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo . 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">10.15479/AT:ISTA:th1064</a>","chicago":"Belyaeva, Vera. “Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo .” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">https://doi.org/10.15479/AT:ISTA:th1064</a>.","apa":"Belyaeva, V. (2018). <i>Transcriptional regulation of macrophage migration in the Drosophila melanogaster embryo </i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">https://doi.org/10.15479/AT:ISTA:th1064</a>","mla":"Belyaeva, Vera. <i>Transcriptional Regulation of Macrophage Migration in the Drosophila Melanogaster Embryo </i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1064\">10.15479/AT:ISTA:th1064</a>."},"file_date_updated":"2021-02-11T11:17:16Z","doi":"10.15479/AT:ISTA:th1064","article_processing_charge":"No","day":"01","date_published":"2018-07-01T00:00:00Z","degree_awarded":"PhD","has_accepted_license":"1","year":"2018","month":"07","publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"DaSi"}],"pubrep_id":"1064","supervisor":[{"orcid":"0000-0001-8323-8353","last_name":"Siekhaus","full_name":"Siekhaus, Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E"}],"publisher":"Institute of Science and Technology Austria","_id":"9","alternative_title":["ISTA Thesis"],"publication_status":"published","file":[{"file_name":"2018_Thesis_Belyaeva_source.docx","file_id":"6243","creator":"dernst","relation":"source_file","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2020-07-14T12:48:14Z","file_size":102737483,"checksum":"d27b2465cb70d0c9678a0381b9b6ced1","embargo_to":"open_access","date_created":"2019-04-08T14:13:12Z"},{"content_type":"application/pdf","access_level":"open_access","embargo":"2019-11-19","date_updated":"2021-02-11T11:17:16Z","file_size":88077843,"checksum":"a2939b61bde2de7b8ced77bbae0eaaed","date_created":"2019-04-08T14:14:08Z","file_name":"2018_Thesis_Belyaeva.pdf","creator":"dernst","file_id":"6244","relation":"main_file"}],"type":"dissertation","oa_version":"Published Version","ddc":["570"],"author":[{"full_name":"Belyaeva, Vera","last_name":"Belyaeva","id":"47F080FE-F248-11E8-B48F-1D18A9856A87","first_name":"Vera"}],"status":"public","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-07T12:43:10Z","abstract":[{"lang":"eng","text":"Immune cells migrating to the sites of infection navigate through diverse tissue architectures and switch their migratory mechanisms upon demand. However, little is known about systemic regulators that could allow the acquisition of these mechanisms. We performed a genetic screen in Drosophila melanogaster to identify regulators of germband invasion by embryonic macrophages into the confined space between the ectoderm and mesoderm. We have found that bZIP circadian transcription factors (TFs) Kayak (dFos) and Vrille (dNFIL3) have opposite effects on macrophage germband infiltration: Kayak facilitated and Vrille inhibited it. These TFs are enriched in the macrophages during migration and genetically interact to control it. Kayak sets a less coordinated mode of migration of the macrophage group and increases the probability and length of Levy walks. Intriguingly, the motility of kayak mutant macrophages was also strongly affected during initial germband invasion but not along another less confined route. Inhibiting Rho1 signaling within the tail ectoderm partially rescued the Kayak mutant phenotype, strongly suggesting that migrating macrophages have to overcome a barrier imposed by the stiffness of the ectoderm. Also, Kayak appeared to be important for the maintenance of the round cell shape and the rear edge translocation of the macrophages invading the germband. Complementary to this, the cortical actin cytoskeleton of Kayak- deficient macrophages was strongly affected. RNA sequencing revealed the filamin Cheerio and tetraspanin TM4SF to be downstream of Kayak. Chromatin immunoprecipitation and immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Immunostaining revealed that the formin Diaphanous is another downstream target of Kayak. Indeed, Cheerio, TM4SF and Diaphanous are required within macrophages for germband invasion, and expression of constitutively active Diaphanous in macrophages was able to rescue the kayak mutant phenotype. Moreover, Cher and Diaphanous are also reduced in the macrophages overexpressing Vrille. We hypothesize that Kayak, through its targets, increases actin polymerization and cortical tension in macrophages and thus allows extra force generation necessary for macrophage dissemination and migration through confined stiff tissues, while Vrille counterbalances it."}]},{"file_date_updated":"2020-07-14T12:45:07Z","doi":"10.7554/eLife.34465","ec_funded":1,"article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":7,"day":"13","publication":"eLife","date_published":"2018-06-13T00:00:00Z","intvolume":"         7","has_accepted_license":"1","publist_id":"7759","title":"Signals from the brain and olfactory epithelium control shaping of the mammalian nasal capsule cartilage","article_number":"e34465","oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:44:57Z","citation":{"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.","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.","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>.","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>."},"author":[{"full_name":"Kaucka, Marketa","last_name":"Kaucka","first_name":"Marketa"},{"first_name":"Julian","full_name":"Petersen, Julian","last_name":"Petersen"},{"first_name":"Marketa","last_name":"Tesarova","full_name":"Tesarova, Marketa"},{"first_name":"Bara","last_name":"Szarowska","full_name":"Szarowska, Bara"},{"first_name":"Maria","last_name":"Kastriti","full_name":"Kastriti, Maria"},{"full_name":"Xie, Meng","last_name":"Xie","first_name":"Meng"},{"orcid":"0000-0003-4509-4998","full_name":"Kicheva, Anna","last_name":"Kicheva","first_name":"Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Annusver, Karl","last_name":"Annusver","first_name":"Karl"},{"last_name":"Kasper","full_name":"Kasper, Maria","first_name":"Maria"},{"first_name":"Orsolya","last_name":"Symmons","full_name":"Symmons, Orsolya"},{"last_name":"Pan","full_name":"Pan, Leslie","first_name":"Leslie"},{"full_name":"Spitz, Francois","last_name":"Spitz","first_name":"Francois"},{"first_name":"Jozef","last_name":"Kaiser","full_name":"Kaiser, Jozef"},{"last_name":"Hovorakova","full_name":"Hovorakova, Maria","first_name":"Maria"},{"first_name":"Tomas","full_name":"Zikmund, Tomas","last_name":"Zikmund"},{"first_name":"Kazunori","last_name":"Sunadome","full_name":"Sunadome, Kazunori"},{"first_name":"Michael P","last_name":"Matise","full_name":"Matise, Michael P"},{"first_name":"Hui","last_name":"Wang","full_name":"Wang, Hui"},{"first_name":"Ulrika","full_name":"Marklund, Ulrika","last_name":"Marklund"},{"first_name":"Hind","full_name":"Abdo, Hind","last_name":"Abdo"},{"first_name":"Patrik","full_name":"Ernfors, Patrik","last_name":"Ernfors"},{"first_name":"Pascal","last_name":"Maire","full_name":"Maire, Pascal"},{"first_name":"Maud","full_name":"Wurmser, Maud","last_name":"Wurmser"},{"full_name":"Chagin, Andrei S","last_name":"Chagin","first_name":"Andrei S"},{"full_name":"Fried, Kaj","last_name":"Fried","first_name":"Kaj"},{"full_name":"Adameyko, Igor","last_name":"Adameyko","first_name":"Igor"}],"status":"public","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-18T09:29:07Z","scopus_import":"1","abstract":[{"lang":"eng","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."}],"related_material":{"record":[{"id":"9838","status":"public","relation":"research_data"}]},"month":"06","year":"2018","project":[{"grant_number":"680037","call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425"}],"isi":1,"department":[{"_id":"AnKi"}],"publisher":"eLife Sciences Publications","_id":"162","publication_status":"published","external_id":{"isi":["000436227500001"]},"oa_version":"Published Version","ddc":["571"],"file":[{"date_updated":"2020-07-14T12:45:07Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-17T16:41:58Z","file_size":9816484,"checksum":"da2378cdcf6b5461dcde194e4d608343","file_name":"2018_eLife_Kaucka.pdf","relation":"main_file","file_id":"5727","creator":"dernst"}],"type":"journal_article"},{"title":"Agitation modules: Flexible means to accelerate automated freeze substitution","page":"903-921","citation":{"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>.","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>","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>.","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>","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.","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.","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."},"date_created":"2018-12-11T11:44:57Z","quality_controlled":"1","oa":1,"article_processing_charge":"No","doi":"10.1369/0022155418786698","intvolume":"        66","date_published":"2018-12-01T00:00:00Z","volume":66,"publication":"Journal of Histochemistry and Cytochemistry","day":"01","pmid":1,"department":[{"_id":"RySh"},{"_id":"EM-Fac"}],"article_type":"original","isi":1,"publication_identifier":{"issn":["0022-1554"]},"month":"12","year":"2018","type":"journal_article","oa_version":"Published Version","_id":"163","issue":"12","publication_status":"published","external_id":{"pmid":["29969056"],"isi":["000452277700005"]},"publisher":"SAGE Publications","author":[{"first_name":"Siegfried","full_name":"Reipert, Siegfried","last_name":"Reipert"},{"full_name":"Goldammer, Helmuth","last_name":"Goldammer","first_name":"Helmuth"},{"full_name":"Richardson, Christine","last_name":"Richardson","first_name":"Christine"},{"last_name":"Goldberg","full_name":"Goldberg, Martin","first_name":"Martin"},{"first_name":"Timothy","full_name":"Hawkins, Timothy","last_name":"Hawkins"},{"full_name":"Hollergschwandtner, Elena","last_name":"Hollergschwandtner","first_name":"Elena","id":"3C054040-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kaufmann, Walter","last_name":"Kaufmann","orcid":"0000-0001-9735-5315","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","first_name":"Walter"},{"last_name":"Antreich","full_name":"Antreich, Sebastian","first_name":"Sebastian"},{"last_name":"Stierhof","full_name":"Stierhof, York","first_name":"York"}],"status":"public","abstract":[{"lang":"eng","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."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1369/0022155418786698"}],"scopus_import":"1","date_updated":"2023-10-17T08:42:24Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.1103/PhysRevFluids.3.103302","file_date_updated":"2020-07-14T12:45:12Z","article_processing_charge":"No","ec_funded":1,"volume":3,"publication":"Physical Review Fluids","day":"15","has_accepted_license":"1","intvolume":"         3","date_published":"2018-10-15T00:00:00Z","publist_id":"8038","title":"Drag enhancement and drag reduction in viscoelastic flow","article_number":"103302 ","oa":1,"citation":{"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>","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.","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).","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>","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>.","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>."},"date_created":"2018-12-11T11:44:11Z","quality_controlled":"1","author":[{"id":"2A2006B2-F248-11E8-B48F-1D18A9856A87","first_name":"Atul","last_name":"Varshney","full_name":"Varshney, Atul","orcid":"0000-0002-3072-5999"},{"first_name":"Victor","last_name":"Steinberg","full_name":"Steinberg, Victor"}],"status":"public","date_updated":"2023-09-11T12:59:28Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"scopus_import":"1","isi":1,"month":"10","year":"2018","project":[{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"BjHo"}],"pubrep_id":"1061","publisher":"American Physical Society","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:45:12Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:10:14Z","file_size":1409040,"checksum":"e1445be33e8165114e96246275600750","file_name":"IST-2018-1061-v1+1_PhysRevFluids.3.103302.pdf","relation":"main_file","file_id":"4800","creator":"system"}],"type":"journal_article","ddc":["532"],"issue":"10","_id":"17","external_id":{"isi":["000447311500001"]},"publication_status":"published"},{"page":"269 - 304","publist_id":"8037","title":"Superconcentrators of density 25.3","oa":1,"citation":{"short":"V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.","ista":"Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 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.","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.","chicago":"Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” <i>Ars Combinatoria</i>. Charles Babbage Research Centre, 2018.","apa":"Kolmogorov, V., &#38; Rolinek, M. (2018). Superconcentrators of density 25.3. <i>Ars Combinatoria</i>. Charles Babbage Research Centre."},"date_created":"2018-12-11T11:44:11Z","arxiv":1,"quality_controlled":"1","article_processing_charge":"No","publication":"Ars Combinatoria","day":"01","volume":141,"intvolume":"       141","date_published":"2018-10-01T00:00:00Z","publication_identifier":{"issn":["0381-7032"]},"isi":1,"month":"10","year":"2018","department":[{"_id":"VlKo"}],"publisher":"Charles Babbage Research Centre","oa_version":"Preprint","type":"journal_article","external_id":{"arxiv":["1405.7828"],"isi":["000446809500022"]},"publication_status":"published","issue":"10","_id":"18","status":"public","author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"full_name":"Rolinek, Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","first_name":"Michal"}],"date_updated":"2023-09-19T14:46:18Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.7828"}],"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"}],"scopus_import":"1"},{"title":"Statistical mechanics of the uniform electron gas","page":"79 - 116","publist_id":"7741","citation":{"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>.","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>","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>.","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>","short":"M. Lewi, É. Lieb, R. Seiringer, Journal de l’Ecole Polytechnique - Mathematiques 5 (2018) 79–116.","ista":"Lewi M, Lieb É, Seiringer R. 2018. Statistical mechanics of the uniform electron gas. Journal de l’Ecole Polytechnique - Mathematiques. 5, 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."},"date_created":"2018-12-11T11:45:03Z","quality_controlled":"1","arxiv":1,"oa":1,"ec_funded":1,"article_processing_charge":"No","tmp":{"image":"/image/cc_by_nd.png","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","short":"CC BY-ND (4.0)"},"doi":"10.5802/jep.64","file_date_updated":"2020-07-14T12:45:16Z","has_accepted_license":"1","intvolume":"         5","date_published":"2018-07-01T00:00:00Z","volume":5,"day":"01","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.","publication":"Journal de l'Ecole Polytechnique - Mathematiques","department":[{"_id":"RoSe"}],"article_type":"original","publication_identifier":{"eissn":["2270-518X"],"issn":["2429-7100"]},"year":"2018","month":"07","project":[{"grant_number":"694227","call_identifier":"H2020","name":"Analysis of quantum many-body systems","_id":"25C6DC12-B435-11E9-9278-68D0E5697425"},{"grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425"}],"file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:16Z","checksum":"1ba7cccdf3900f42c4f715ae75d6813c","file_size":843938,"date_created":"2018-12-17T16:38:18Z","file_name":"2018_JournaldeLecoleMath_Lewi.pdf","creator":"dernst","file_id":"5726","relation":"main_file"}],"type":"journal_article","ddc":["510"],"oa_version":"Published Version","_id":"180","publication_status":"published","external_id":{"arxiv":["1705.10676"]},"publisher":"Ecole Polytechnique","author":[{"first_name":"Mathieu","last_name":"Lewi","full_name":"Lewi, Mathieu"},{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer"}],"status":"public","license":"https://creativecommons.org/licenses/by-nd/4.0/","abstract":[{"lang":"eng","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."}],"scopus_import":"1","date_updated":"2023-10-17T08:05:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"publist_id":"7740","page":"3271 - 3290","title":"Power law decay for systems of randomly coupled differential equations","oa":1,"citation":{"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>","short":"L. Erdös, T.H. Krüger, D.T. Renfrew, SIAM Journal on Mathematical Analysis 50 (2018) 3271–3290.","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.","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.","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>.","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>","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>."},"date_created":"2018-12-11T11:45:03Z","quality_controlled":"1","arxiv":1,"doi":"10.1137/17M1143125","article_processing_charge":"No","ec_funded":1,"publication":"SIAM Journal on Mathematical Analysis","acknowledgement":"The work of the second author was also partially supported by the Hausdorff Center of Mathematics.","day":"01","volume":50,"intvolume":"        50","date_published":"2018-01-01T00:00:00Z","isi":1,"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"},{"grant_number":"M02080","_id":"258F40A4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Structured Non-Hermitian Random Matrices"}],"month":"01","year":"2018","department":[{"_id":"LaEr"}],"publisher":"Society for Industrial and Applied Mathematics ","type":"journal_article","oa_version":"Published Version","external_id":{"arxiv":["1708.01546"],"isi":["000437018500032"]},"publication_status":"published","issue":"3","_id":"181","status":"public","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","orcid":"0000-0002-4821-3297","full_name":"Krüger, Torben H","last_name":"Krüger"},{"last_name":"Renfrew","full_name":"Renfrew, David T","orcid":"0000-0003-3493-121X","first_name":"David T","id":"4845BF6A-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-15T12:05:52Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.01546"}],"abstract":[{"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.","lang":"eng"}],"scopus_import":"1"},{"title":"Efficient parametric identification for STL","page":"177 - 186","publist_id":"7739","date_created":"2018-12-11T11:45:04Z","citation":{"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.","short":"A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–186.","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.","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>","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>.","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>.","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>"},"quality_controlled":"1","conference":{"name":"HSCC: Hybrid Systems: Computation and Control","start_date":"2018-04-11","location":"Porto, Portugal","end_date":"2018-04-13"},"oa":1,"article_processing_charge":"No","doi":"10.1145/3178126.3178132","file_date_updated":"2020-07-14T12:45:17Z","has_accepted_license":"1","date_published":"2018-04-11T00:00:00Z","publication":"Proceedings of the 21st International Conference on Hybrid Systems","day":"11","department":[{"_id":"ToHe"}],"publication_identifier":{"isbn":["978-1-4503-5642-8 "]},"isi":1,"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"year":"2018","month":"04","ddc":["000"],"oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:45:17Z","access_level":"open_access","content_type":"application/pdf","date_created":"2020-05-14T12:18:29Z","checksum":"81eabc96430e84336ea88310ac0a1ad0","file_size":5900421,"file_name":"2018_HSCC_Bakhirkin.pdf","relation":"main_file","file_id":"7833","creator":"dernst"}],"type":"conference","publication_status":"published","external_id":{"isi":["000474781600020"]},"alternative_title":["HSCC Proceedings"],"_id":"182","publisher":"ACM","status":"public","author":[{"first_name":"Alexey","last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","full_name":"Ferrere, Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143"},{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"}],"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."}],"scopus_import":"1","date_updated":"2023-09-11T13:30:51Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}]},{"date_published":"2018-04-11T00:00:00Z","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.","day":"11","article_processing_charge":"No","doi":"10.1145/3178126.3178131","date_created":"2018-12-11T11:45:04Z","citation":{"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.","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.","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>","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>.","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>."},"conference":{"end_date":"2018-04-13","location":"Porto, Portugal","name":"HSCC: Hybrid Systems: Computation and Control","start_date":"2018-04-11"},"quality_controlled":"1","title":"Localizing faults in simulink/stateflow models with STL","publist_id":"7738","page":"197 - 206","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."}],"scopus_import":"1","date_updated":"2023-09-13T08:48:46Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","last_name":"Ferrere"},{"first_name":"Niveditha","full_name":"Manjunath, Niveditha","last_name":"Manjunath"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"}],"status":"public","type":"conference","oa_version":"None","_id":"183","external_id":{"isi":["000474781600022"]},"alternative_title":["HSCC Proceedings"],"publication_status":"published","publisher":"Association for Computing Machinery, Inc","department":[{"_id":"ToHe"}],"isi":1,"year":"2018","month":"04","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}]},{"status":"public","author":[{"full_name":"Goaoc, Xavier","last_name":"Goaoc","first_name":"Xavier"},{"last_name":"Paták","full_name":"Paták, Pavel","first_name":"Pavel"},{"full_name":"Patakova, Zuzana","last_name":"Patakova","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87","first_name":"Zuzana"},{"first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","last_name":"Tancer","full_name":"Tancer, Martin","orcid":"0000-0002-1191-6714"},{"full_name":"Wagner, Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"related_material":{"record":[{"relation":"later_version","status":"public","id":"7108"}]},"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."}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-06T11:10:57Z","department":[{"_id":"UlWa"}],"year":"2018","month":"06","publication_status":"published","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"_id":"184","type":"conference","file":[{"file_name":"2018_LIPIcs_Goaoc.pdf","relation":"main_file","file_id":"5725","creator":"dernst","date_updated":"2020-07-14T12:45:18Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-17T16:35:02Z","file_size":718414,"checksum":"d12bdd60f04a57307867704b5f930afd"}],"oa_version":"Published Version","ddc":["516","000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file_date_updated":"2020-07-14T12:45:18Z","doi":"10.4230/LIPIcs.SoCG.2018.41","date_published":"2018-06-11T00:00:00Z","has_accepted_license":"1","intvolume":"        99","acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","day":"11","volume":99,"title":"Shellability is NP-complete","publist_id":"7736","page":"41:1 - 41:16","quality_controlled":"1","conference":{"end_date":"2018-06-14","location":"Budapest, Hungary","start_date":"2018-06-11","name":"SoCG: Symposium on Computational Geometry"},"date_created":"2018-12-11T11:45:04Z","citation":{"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>","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>.","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>.","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>","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.","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.","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."},"oa":1},{"title":"Hanani-Tutte for approximating maps of graphs","publist_id":"7735","citation":{"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>.","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>.","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>","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.","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>"},"date_created":"2018-12-11T11:45:04Z","conference":{"end_date":"2018-06-14","location":"Budapest, Hungary","name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11"},"quality_controlled":"1","article_number":"39","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.SoCG.2018.39","file_date_updated":"2020-07-14T12:45:19Z","intvolume":"        99","has_accepted_license":"1","date_published":"2018-01-01T00:00:00Z","volume":99,"day":"01","department":[{"_id":"UlWa"}],"publication_identifier":{"isbn":["978-3-95977-066-8"]},"month":"01","year":"2018","project":[{"grant_number":"M02281","call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"file":[{"file_id":"5701","creator":"dernst","relation":"main_file","file_name":"2018_LIPIcs_Fulek.pdf","checksum":"f1b94f1a75b37c414a1f61d59fb2cd4c","file_size":718857,"date_created":"2018-12-17T12:33:52Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:19Z"}],"oa_version":"Published Version","ddc":["510"],"type":"conference","_id":"185","publication_status":"published","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav"},{"last_name":"Kynčl","full_name":"Kynčl, Jan","first_name":"Jan"}],"status":"public","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."}],"scopus_import":1,"date_updated":"2021-01-12T06:53:36Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"doi":"10.4230/LIPIcs.SoCG.2018.40","article_processing_charge":"No","day":"11","volume":99,"intvolume":"        99","date_published":"2018-06-11T00:00:00Z","publist_id":"7734","page":"40.1 - 40.14","title":"The ℤ2-Genus of Kuratowski minors","oa":1,"date_created":"2018-12-11T11:45:05Z","citation":{"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>","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>.","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>.","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>","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."},"quality_controlled":"1","arxiv":1,"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","end_date":"2018-06-14","location":"Budapest, Hungary"},"status":"public","author":[{"first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","full_name":"Fulek, Radoslav","last_name":"Fulek","orcid":"0000-0001-8485-1774"},{"last_name":"Kynčl","full_name":"Kynčl, Jan","first_name":"Jan"}],"date_updated":"2023-08-14T12:43:51Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.05085"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"11593"}]},"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."}],"scopus_import":"1","project":[{"_id":"261FA626-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","grant_number":"M02281"}],"month":"06","year":"2018","department":[{"_id":"UlWa"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","oa_version":"Submitted Version","publication_status":"published","external_id":{"arxiv":["1803.05085"]},"alternative_title":["LIPIcs"],"_id":"186"},{"author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8882-5116","full_name":"Osang, Georg F","last_name":"Osang","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","first_name":"Georg F"}],"status":"public","abstract":[{"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. ","lang":"eng"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"9317"},{"id":"9056","status":"public","relation":"dissertation_contains"}]},"scopus_import":1,"date_updated":"2023-09-07T13:29:00Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"year":"2018","month":"06","project":[{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes"}],"file":[{"relation":"main_file","creator":"dernst","file_id":"5738","file_name":"2018_LIPIcs_Edelsbrunner_Osang.pdf","date_created":"2018-12-18T09:27:22Z","file_size":528018,"checksum":"d8c0533ad0018eb4ed1077475eb8fc18","date_updated":"2020-07-14T12:45:19Z","content_type":"application/pdf","access_level":"open_access"}],"type":"conference","ddc":["516"],"oa_version":"Published Version","_id":"187","publication_status":"published","alternative_title":["LIPIcs"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.SoCG.2018.34","file_date_updated":"2020-07-14T12:45:19Z","intvolume":"        99","has_accepted_license":"1","date_published":"2018-06-11T00:00:00Z","volume":99,"day":"11","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).","title":"The multi-cover persistence of Euclidean balls","publist_id":"7732","citation":{"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>.","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>","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>.","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.","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."},"date_created":"2018-12-11T11:45:05Z","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","location":"Budapest, Hungary","end_date":"2018-06-14"},"quality_controlled":"1","article_number":"34","oa":1},{"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.SoCG.2018.35","file_date_updated":"2020-07-14T12:45:20Z","has_accepted_license":"1","intvolume":"        99","date_published":"2018-06-11T00:00:00Z","volume":99,"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","day":"11","title":"Smallest enclosing spheres and Chernoff points in Bregman geometry","publist_id":"7733","page":"35:1 - 35:13","citation":{"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>.","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>","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>.","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>","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.","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."},"date_created":"2018-12-11T11:45:05Z","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","end_date":"2018-06-14","location":"Budapest, Hungary"},"quality_controlled":"1","oa":1,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Virk, Ziga","last_name":"Virk","first_name":"Ziga"},{"full_name":"Wagner, Hubert","last_name":"Wagner","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","first_name":"Hubert"}],"status":"public","abstract":[{"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.","lang":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T06:53:48Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"month":"06","year":"2018","project":[{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"file":[{"content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:20Z","file_size":489080,"checksum":"7509403803b3ac1aee94bbc2ad293d21","date_created":"2018-12-17T16:31:31Z","file_name":"2018_LIPIcs_Edelsbrunner.pdf","creator":"dernst","file_id":"5724","relation":"main_file"}],"oa_version":"Published Version","ddc":["000"],"type":"conference","_id":"188","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"page":"2669 - 2684","publist_id":"8036","title":"Nonoptimal gene expression creates latent potential for antibiotic resistance","oa":1,"citation":{"ama":"Palmer A, Chait RP, Kishony R. Nonoptimal gene expression creates latent potential for antibiotic resistance. <i>Molecular Biology and Evolution</i>. 2018;35(11):2669-2684. doi:<a href=\"https://doi.org/10.1093/molbev/msy163\">10.1093/molbev/msy163</a>","ista":"Palmer A, Chait RP, Kishony R. 2018. Nonoptimal gene expression creates latent potential for antibiotic resistance. Molecular Biology and Evolution. 35(11), 2669–2684.","short":"A. Palmer, R.P. Chait, R. Kishony, Molecular Biology and Evolution 35 (2018) 2669–2684.","ieee":"A. Palmer, R. P. Chait, and R. Kishony, “Nonoptimal gene expression creates latent potential for antibiotic resistance,” <i>Molecular Biology and Evolution</i>, vol. 35, no. 11. Oxford University Press, pp. 2669–2684, 2018.","apa":"Palmer, A., Chait, R. P., &#38; Kishony, R. (2018). Nonoptimal gene expression creates latent potential for antibiotic resistance. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msy163\">https://doi.org/10.1093/molbev/msy163</a>","chicago":"Palmer, Adam, Remy P Chait, and Roy Kishony. “Nonoptimal Gene Expression Creates Latent Potential for Antibiotic Resistance.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/molbev/msy163\">https://doi.org/10.1093/molbev/msy163</a>.","mla":"Palmer, Adam, et al. “Nonoptimal Gene Expression Creates Latent Potential for Antibiotic Resistance.” <i>Molecular Biology and Evolution</i>, vol. 35, no. 11, Oxford University Press, 2018, pp. 2669–84, doi:<a href=\"https://doi.org/10.1093/molbev/msy163\">10.1093/molbev/msy163</a>."},"date_created":"2018-12-11T11:44:11Z","quality_controlled":"1","doi":"10.1093/molbev/msy163","article_processing_charge":"No","publication":"Molecular Biology and Evolution","day":"28","volume":35,"pmid":1,"intvolume":"        35","date_published":"2018-08-28T00:00:00Z","publication_identifier":{"issn":["0737-4038"]},"isi":1,"month":"08","year":"2018","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"article_type":"original","publisher":"Oxford University Press","type":"journal_article","oa_version":"Submitted Version","external_id":{"isi":["000452567200006"],"pmid":["30169679"]},"publication_status":"published","_id":"19","issue":"11","status":"public","author":[{"first_name":"Adam","last_name":"Palmer","full_name":"Palmer, Adam"},{"orcid":"0000-0003-0876-3187","full_name":"Chait, Remy P","last_name":"Chait","first_name":"Remy P","id":"3464AE84-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Roy","full_name":"Kishony, Roy","last_name":"Kishony"}],"date_updated":"2023-10-17T11:51:06Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/30169679","open_access":"1"}],"abstract":[{"text":"Bacteria regulate genes to survive antibiotic stress, but regulation can be far from perfect. When regulation is not optimal, mutations that change gene expression can contribute to antibiotic resistance. It is not systematically understood to what extent natural gene regulation is or is not optimal for distinct antibiotics, and how changes in expression of specific genes quantitatively affect antibiotic resistance. Here we discover a simple quantitative relation between fitness, gene expression, and antibiotic potency, which rationalizes our observation that a multitude of genes and even innate antibiotic defense mechanisms have expression that is critically nonoptimal under antibiotic treatment. First, we developed a pooled-strain drug-diffusion assay and screened Escherichia coli overexpression and knockout libraries, finding that resistance to a range of 31 antibiotics could result from changing expression of a large and functionally diverse set of genes, in a primarily but not exclusively drug-specific manner. Second, by synthetically controlling the expression of single-drug and multidrug resistance genes, we observed that their fitness-expression functions changed dramatically under antibiotic treatment in accordance with a log-sensitivity relation. Thus, because many genes are nonoptimally expressed under antibiotic treatment, many regulatory mutations can contribute to resistance by altering expression and by activating latent defenses.","lang":"eng"}],"scopus_import":"1"}]