[{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","publication_status":"published","month":"06","page":"XLVIII, 1212","abstract":[{"text":"This book first explores the origins of this idea, grounded in theoretical work on temporal logic and automata. The editors and authors are among the world's leading researchers in this domain, and they contributed 32 chapters representing a thorough view of the development and application of the technique. Topics covered include binary decision diagrams, symbolic model checking, satisfiability modulo theories, partial-order reduction, abstraction, interpolation, concurrency, security protocols, games, probabilistic model checking, and process algebra, and chapters on the transfer of theory to industrial practice, property specification languages for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.","lang":"eng"}],"type":"book","date_created":"2018-12-11T12:02:32Z","oa_version":"None","department":[{"_id":"ToHe"}],"edition":"1","language":[{"iso":"eng"}],"publist_id":"3340","day":"08","doi":"10.1007/978-3-319-10575-8","publication_identifier":{"eisbn":["978-3-319-10575-8"],"isbn":["978-3-319-10574-1"]},"status":"public","_id":"3300","place":"Cham","scopus_import":"1","date_published":"2018-06-08T00:00:00Z","year":"2018","quality_controlled":"1","title":"Handbook of Model Checking","author":[{"first_name":"Edmund M.","full_name":"Clarke, Edmund M.","last_name":"Clarke"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"},{"last_name":"Bloem","first_name":"Roderick","full_name":"Bloem, Roderick"}],"date_updated":"2021-12-21T10:49:36Z","citation":{"mla":"Clarke, Edmund M., et al. <i>Handbook of Model Checking</i>. 1st ed., Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8\">10.1007/978-3-319-10575-8</a>.","ama":"Clarke EM, Henzinger TA, Veith H, Bloem R. <i>Handbook of Model Checking</i>. 1st ed. Cham: Springer Nature; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8\">10.1007/978-3-319-10575-8</a>","short":"E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking, 1st ed., Springer Nature, Cham, 2018.","apa":"Clarke, E. M., Henzinger, T. A., Veith, H., &#38; Bloem, R. (2018). <i>Handbook of Model Checking</i> (1st ed.). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-10575-8\">https://doi.org/10.1007/978-3-319-10575-8</a>","chicago":"Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem. <i>Handbook of Model Checking</i>. 1st ed. Cham: Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8\">https://doi.org/10.1007/978-3-319-10575-8</a>.","ieee":"E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, <i>Handbook of Model Checking</i>, 1st ed. Cham: Springer Nature, 2018.","ista":"Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking 1st ed., Cham: Springer Nature, XLVIII, 1212p."},"publisher":"Springer Nature"},{"date_published":"2018-10-16T00:00:00Z","_id":"37","title":"Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube","year":"2018","file_date_updated":"2020-10-13T14:20:37Z","file":[{"content_type":"application/pdf","file_size":4906815,"access_level":"open_access","date_created":"2020-10-13T14:20:37Z","creator":"dernst","checksum":"2a97d0649fdcfcf1bdca7c8ad1dce71b","relation":"main_file","date_updated":"2020-10-13T14:20:37Z","success":1,"file_id":"8656","file_name":"2018_MIMB_Zagorski.pdf"}],"month":"10","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:44:17Z","type":"book_chapter","intvolume":"      1863","language":[{"iso":"eng"}],"volume":1863,"oa":1,"status":"public","publication_identifier":{"issn":["1064-3745"],"isbn":["978-1-4939-8771-9"]},"alternative_title":["Methods in Molecular Biology"],"scopus_import":"1","publication":"Morphogen Gradients ","series_title":"MIMB","quality_controlled":"1","ec_funded":1,"citation":{"mla":"Zagórski, Marcin P., and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” <i>Morphogen Gradients </i>, vol. 1863, Springer Nature, 2018, pp. 47–63, doi:<a href=\"https://doi.org/10.1007/978-1-4939-8772-6_4\">10.1007/978-1-4939-8772-6_4</a>.","ama":"Zagórski MP, Kicheva A. Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: <i>Morphogen Gradients </i>. Vol 1863. MIMB. Springer Nature; 2018:47-63. doi:<a href=\"https://doi.org/10.1007/978-1-4939-8772-6_4\">10.1007/978-1-4939-8772-6_4</a>","short":"M.P. Zagórski, A. Kicheva, in:, Morphogen Gradients , Springer Nature, 2018, pp. 47–63.","apa":"Zagórski, M. P., &#38; Kicheva, A. (2018). Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In <i>Morphogen Gradients </i> (Vol. 1863, pp. 47–63). Springer Nature. <a href=\"https://doi.org/10.1007/978-1-4939-8772-6_4\">https://doi.org/10.1007/978-1-4939-8772-6_4</a>","chicago":"Zagórski, Marcin P, and Anna Kicheva. “Measuring Dorsoventral Pattern and Morphogen Signaling Profiles in the Growing Neural Tube.” In <i>Morphogen Gradients </i>, 1863:47–63. MIMB. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-1-4939-8772-6_4\">https://doi.org/10.1007/978-1-4939-8772-6_4</a>.","ieee":"M. P. Zagórski and A. Kicheva, “Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube,” in <i>Morphogen Gradients </i>, vol. 1863, Springer Nature, 2018, pp. 47–63.","ista":"Zagórski MP, Kicheva A. 2018.Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In: Morphogen Gradients . Methods in Molecular Biology, vol. 1863, 47–63."},"publisher":"Springer Nature","project":[{"call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037"}],"author":[{"first_name":"Marcin P","full_name":"Zagórski, Marcin P","last_name":"Zagórski","id":"343DA0DC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7896-7762"},{"id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","last_name":"Kicheva","full_name":"Kicheva, Anna","first_name":"Anna"}],"date_updated":"2025-04-14T07:27:29Z","abstract":[{"lang":"eng","text":"Developmental processes are inherently dynamic and understanding them requires quantitative measurements of gene and protein expression levels in space and time. While live imaging is a powerful approach for obtaining such data, it is still a challenge to apply it over long periods of time to large tissues, such as the embryonic spinal cord in mouse and chick. Nevertheless, dynamics of gene expression and signaling activity patterns in this organ can be studied by collecting tissue sections at different developmental stages. In combination with immunohistochemistry, this allows for measuring the levels of multiple developmental regulators in a quantitative manner with high spatiotemporal resolution. The mean protein expression levels over time, as well as embryo-to-embryo variability can be analyzed. A key aspect of the approach is the ability to compare protein levels across different samples. This requires a number of considerations in sample preparation, imaging and data analysis. Here we present a protocol for obtaining time course data of dorsoventral expression patterns from mouse and chick neural tube in the first 3 days of neural tube development. The described workflow starts from embryo dissection and ends with a processed dataset. Software scripts for data analysis are included. The protocol is adaptable and instructions that allow the user to modify different steps are provided. Thus, the procedure can be altered for analysis of time-lapse images and applied to systems other than the neural tube."}],"page":"47 - 63","ddc":["570"],"publication_status":"published","oa_version":"Submitted Version","department":[{"_id":"AnKi"}],"doi":"10.1007/978-1-4939-8772-6_4","day":"16","has_accepted_license":"1","publist_id":"8018"},{"date_created":"2018-12-11T11:46:15Z","oa_version":"None","type":"journal_article","page":"e568-e578","month":"05","abstract":[{"text":"Objective: To report long-term results after Pipeline Embolization Device (PED) implantation, characterize complex and standard aneurysms comprehensively, and introduce a modified flow disruption scale. Methods: We retrospectively reviewed a consecutive series of 40 patients harboring 59 aneurysms treated with 54 PEDs. Aneurysm complexity was assessed using our proposed classification. Immediate angiographic results were analyzed using previously published grading scales and our novel flow disruption scale. Results: According to our new definition, 46 (78%) aneurysms were classified as complex. Most PED interventions were performed in the paraophthalmic and cavernous internal carotid artery segments. Excellent neurologic outcome (modified Rankin Scale 0 and 1) was observed in 94% of patients. Our data showed low permanent procedure-related mortality (0%) and morbidity (3%) rates. Long-term angiographic follow-up showed complete occlusion in 81% and near-total obliteration in a further 14%. Complete obliteration after deployment of a single PED was achieved in all standard aneurysms with 1-year follow-up. Our new scale was an independent predictor of aneurysm occlusion in a multivariable analysis. All aneurysms with a high flow disruption grade showed complete occlusion at follow-up regardless of PED number or aneurysm complexity. Conclusions: Treatment with the PED should be recognized as a primary management strategy for a highly selected cohort with predominantly complex intracranial aneurysms. We further show that a priori assessment of aneurysm complexity and our new postinterventional angiographic flow disruption scale predict occlusion probability and may help to determine the adequate number of per-aneurysm devices.","lang":"eng"}],"publication_status":"published","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1016/j.wneu.2018.02.096","day":"01","publist_id":"7431","department":[{"_id":"BeBi"}],"isi":1,"intvolume":"        13","language":[{"iso":"eng"}],"volume":13,"scopus_import":"1","publication":"World Neurosurgery","date_published":"2018-05-01T00:00:00Z","_id":"398","status":"public","publisher":"Elsevier","citation":{"mla":"Dodier, Philippe, et al. “Immediate Flow Disruption as a Prognostic Factor after Flow Diverter Treatment Long Term Experience with the Pipeline Embolization Device.” <i>World Neurosurgery</i>, vol. 13, Elsevier, 2018, pp. e568–78, doi:<a href=\"https://doi.org/10.1016/j.wneu.2018.02.096\">10.1016/j.wneu.2018.02.096</a>.","ama":"Dodier P, Frischer J, Wang W, et al. Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device. <i>World Neurosurgery</i>. 2018;13:e568-e578. doi:<a href=\"https://doi.org/10.1016/j.wneu.2018.02.096\">10.1016/j.wneu.2018.02.096</a>","apa":"Dodier, P., Frischer, J., Wang, W., Auzinger, T., Mallouhi, A., Serles, W., … Bavinzski, G. (2018). Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device. <i>World Neurosurgery</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.wneu.2018.02.096\">https://doi.org/10.1016/j.wneu.2018.02.096</a>","short":"P. Dodier, J. Frischer, W. Wang, T. Auzinger, A. Mallouhi, W. Serles, A. Gruber, E. Knosp, G. Bavinzski, World Neurosurgery 13 (2018) e568–e578.","ieee":"P. Dodier <i>et al.</i>, “Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device,” <i>World Neurosurgery</i>, vol. 13. Elsevier, pp. e568–e578, 2018.","ista":"Dodier P, Frischer J, Wang W, Auzinger T, Mallouhi A, Serles W, Gruber A, Knosp E, Bavinzski G. 2018. Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device. World Neurosurgery. 13, e568–e578.","chicago":"Dodier, Philippe, Josa Frischer, Wei Wang, Thomas Auzinger, Ammar Mallouhi, Wolfgang Serles, Andreas Gruber, Engelbert Knosp, and Gerhard Bavinzski. “Immediate Flow Disruption as a Prognostic Factor after Flow Diverter Treatment Long Term Experience with the Pipeline Embolization Device.” <i>World Neurosurgery</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.wneu.2018.02.096\">https://doi.org/10.1016/j.wneu.2018.02.096</a>."},"external_id":{"isi":["000432942700070"]},"author":[{"first_name":"Philippe","full_name":"Dodier, Philippe","last_name":"Dodier"},{"last_name":"Frischer","first_name":"Josa","full_name":"Frischer, Josa"},{"last_name":"Wang","full_name":"Wang, Wei","first_name":"Wei"},{"orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","first_name":"Thomas","full_name":"Auzinger, Thomas"},{"last_name":"Mallouhi","first_name":"Ammar","full_name":"Mallouhi, Ammar"},{"last_name":"Serles","full_name":"Serles, Wolfgang","first_name":"Wolfgang"},{"last_name":"Gruber","full_name":"Gruber, Andreas","first_name":"Andreas"},{"first_name":"Engelbert","full_name":"Knosp, Engelbert","last_name":"Knosp"},{"full_name":"Bavinzski, Gerhard","first_name":"Gerhard","last_name":"Bavinzski"}],"date_updated":"2023-09-11T14:12:33Z","title":"Immediate flow disruption as a prognostic factor after flow diverter treatment long term experience with the pipeline embolization device","quality_controlled":"1","year":"2018"},{"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"06","type":"journal_article","date_created":"2018-12-11T11:46:18Z","volume":150,"intvolume":"       150","language":[{"iso":"eng"}],"_id":"407","date_published":"2018-06-01T00:00:00Z","year":"2018","title":"Design, synthesis and perception of fluorescently labeled isoprenoid cytokinins","external_id":{"isi":["000435623400001"]},"publication_status":"published","page":"1-11","abstract":[{"text":"Isoprenoid cytokinins play a number of crucial roles in the regulation of plant growth and development. To study cytokinin receptor properties in plants, we designed and prepared fluorescent derivatives of 6-[(3-methylbut-2-en-1-yl)amino]purine (N6-isopentenyladenine, iP) with several fluorescent labels attached to the C2 or N9 atom of the purine moiety via a 2- or 6-carbon linker. The fluorescent labels included dansyl (DS), fluorescein (FC), 7-nitrobenzofurazan (NBD), rhodamine B (RhoB), coumarin (Cou), 7-(diethylamino)coumarin (DEAC) and cyanine 5 dye (Cy5). All prepared compounds were screened for affinity for the Arabidopsis thaliana cytokinin receptor (CRE1/AHK4). Although the attachment of the fluorescent labels to iP via the linkers mostly disrupted binding to the receptor, several fluorescent derivatives interacted well. For this reason, three derivatives, two rhodamine B and one 4-chloro-7-nitrobenzofurazan labeled iP were tested for their interaction with CRE1/AHK4 and Zea mays cytokinin receptors in detail. We further showed that the three derivatives were able to activate transcription of cytokinin response regulator ARR5 in Arabidopsis seedlings. The activity of fluorescently labeled cytokinins was compared with corresponding 6-dimethylaminopurine fluorescently labeled negative controls. Selected rhodamine B C2-labeled compounds 17, 18 and 4-chloro-7-nitrobenzofurazan N9-labeled compound 28 and their respective negative controls (19, 20 and 29, respectively) were used for in planta staining experiments in Arabidopsis thaliana cell suspension culture using live cell confocal microscopy.","lang":"eng"}],"oa_version":"None","department":[{"_id":"EvBe"}],"isi":1,"day":"01","publist_id":"7422","doi":"10.1016/j.phytochem.2018.02.015","status":"public","acknowledgement":"This work was supported by the Ministry of Education Youth and Sports, Czech Republic (grant LO1204 from the National Program of Sustainability I and Agricultural Research ) and by Czech Science Foundation grants 16-04184S , 501/10/1450 and 13-39982S and by IGA projects IGA_PrF_2018_033 and IGA_PrF_2018_023 . We would like to thank Jarmila Balonová, Olga Hustáková and Miroslava Šubová for their skillful technical assistance and Mgr. Tomáš Pospíšil, Ph.D. for his measurement of 1 H NMR and analysis of some 2D NMR spectral data. \r\n","scopus_import":"1","publication":"Phytochemistry","quality_controlled":"1","author":[{"first_name":"Karolina","full_name":"Kubiasová, Karolina","last_name":"Kubiasová"},{"full_name":"Mik, Václav","first_name":"Václav","last_name":"Mik"},{"last_name":"Nisler","full_name":"Nisler, Jaroslav","first_name":"Jaroslav"},{"last_name":"Hönig","first_name":"Martin","full_name":"Hönig, Martin"},{"first_name":"Alexandra","full_name":"Husičková, Alexandra","last_name":"Husičková"},{"last_name":"Spíchal","first_name":"Lukáš","full_name":"Spíchal, Lukáš"},{"full_name":"Pěkná, Zuzana","first_name":"Zuzana","last_name":"Pěkná"},{"full_name":"Šamajová, Olga","first_name":"Olga","last_name":"Šamajová"},{"last_name":"Doležal","first_name":"Karel","full_name":"Doležal, Karel"},{"first_name":"Ondřej","full_name":"Plíhal, Ondřej","last_name":"Plíhal"},{"full_name":"Benková, Eva","first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739"},{"full_name":"Strnad, Miroslav","first_name":"Miroslav","last_name":"Strnad"},{"first_name":"Lucie","full_name":"Plíhalová, Lucie","last_name":"Plíhalová"}],"date_updated":"2023-09-11T12:53:11Z","citation":{"mla":"Kubiasová, Karolina, et al. “Design, Synthesis and Perception of Fluorescently Labeled Isoprenoid Cytokinins.” <i>Phytochemistry</i>, vol. 150, Elsevier, 2018, pp. 1–11, doi:<a href=\"https://doi.org/10.1016/j.phytochem.2018.02.015\">10.1016/j.phytochem.2018.02.015</a>.","ama":"Kubiasová K, Mik V, Nisler J, et al. Design, synthesis and perception of fluorescently labeled isoprenoid cytokinins. <i>Phytochemistry</i>. 2018;150:1-11. doi:<a href=\"https://doi.org/10.1016/j.phytochem.2018.02.015\">10.1016/j.phytochem.2018.02.015</a>","short":"K. Kubiasová, V. Mik, J. Nisler, M. Hönig, A. Husičková, L. Spíchal, Z. Pěkná, O. Šamajová, K. Doležal, O. Plíhal, E. Benková, M. Strnad, L. Plíhalová, Phytochemistry 150 (2018) 1–11.","apa":"Kubiasová, K., Mik, V., Nisler, J., Hönig, M., Husičková, A., Spíchal, L., … Plíhalová, L. (2018). Design, synthesis and perception of fluorescently labeled isoprenoid cytokinins. <i>Phytochemistry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.phytochem.2018.02.015\">https://doi.org/10.1016/j.phytochem.2018.02.015</a>","ieee":"K. Kubiasová <i>et al.</i>, “Design, synthesis and perception of fluorescently labeled isoprenoid cytokinins,” <i>Phytochemistry</i>, vol. 150. Elsevier, pp. 1–11, 2018.","ista":"Kubiasová K, Mik V, Nisler J, Hönig M, Husičková A, Spíchal L, Pěkná Z, Šamajová O, Doležal K, Plíhal O, Benková E, Strnad M, Plíhalová L. 2018. Design, synthesis and perception of fluorescently labeled isoprenoid cytokinins. Phytochemistry. 150, 1–11.","chicago":"Kubiasová, Karolina, Václav Mik, Jaroslav Nisler, Martin Hönig, Alexandra Husičková, Lukáš Spíchal, Zuzana Pěkná, et al. “Design, Synthesis and Perception of Fluorescently Labeled Isoprenoid Cytokinins.” <i>Phytochemistry</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.phytochem.2018.02.015\">https://doi.org/10.1016/j.phytochem.2018.02.015</a>."},"publisher":"Elsevier"},{"date_created":"2018-12-11T11:46:24Z","type":"journal_article","article_type":"original","month":"01","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","issue":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1402.0815"}],"language":[{"iso":"eng"}],"intvolume":"        65","volume":65,"date_published":"2018-01-01T00:00:00Z","_id":"425","external_id":{"arxiv":["1402.0815"],"isi":["000425685900006"]},"title":"Embeddability in the 3-Sphere is decidable","arxiv":1,"year":"2018","oa_version":"Preprint","abstract":[{"text":"We show that the following algorithmic problem is decidable: given a 2-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in R3? By a known reduction, it suffices to decide the embeddability of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which allows us to simplify X and recurse, is in proving that if X can be embedded in S3, then there is also an embedding in which X has a short meridian, that is, an essential curve in the boundary of X bounding a disk in S3 \\ X with length bounded by a computable function of the number of tetrahedra of X.","lang":"eng"}],"publication_status":"published","doi":"10.1145/3078632","article_number":"5","publist_id":"7398","day":"01","department":[{"_id":"UlWa"}],"isi":1,"scopus_import":"1","publication":"Journal of the ACM","oa":1,"status":"public","related_material":{"record":[{"id":"2157","status":"public","relation":"earlier_version"}]},"publisher":"ACM","citation":{"mla":"Matoušek, Jiří, et al. “Embeddability in the 3-Sphere Is Decidable.” <i>Journal of the ACM</i>, vol. 65, no. 1, 5, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3078632\">10.1145/3078632</a>.","ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3-Sphere is decidable. <i>Journal of the ACM</i>. 2018;65(1). doi:<a href=\"https://doi.org/10.1145/3078632\">10.1145/3078632</a>","apa":"Matoušek, J., Sedgwick, E., Tancer, M., &#38; Wagner, U. (2018). Embeddability in the 3-Sphere is decidable. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3078632\">https://doi.org/10.1145/3078632</a>","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, Journal of the ACM 65 (2018).","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability in the 3-Sphere Is Decidable.” <i>Journal of the ACM</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3078632\">https://doi.org/10.1145/3078632</a>.","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the 3-Sphere is decidable,” <i>Journal of the ACM</i>, vol. 65, no. 1. ACM, 2018.","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2018. Embeddability in the 3-Sphere is decidable. Journal of the ACM. 65(1), 5."},"date_updated":"2025-06-11T07:59:02Z","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Matoušek","full_name":"Matoušek, Jiří","first_name":"Jiří"},{"last_name":"Sedgwick","first_name":"Eric","full_name":"Sedgwick, Eric"},{"id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","last_name":"Tancer","first_name":"Martin","full_name":"Tancer, Martin"},{"first_name":"Uli","full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","last_name":"Wagner"}],"quality_controlled":"1","ec_funded":1},{"external_id":{"arxiv":["1708.08037"]},"year":"2018","title":"Thrackles: An improved upper bound","arxiv":1,"_id":"433","date_published":"2018-01-21T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.08037"}],"volume":10692,"intvolume":"     10692","language":[{"iso":"eng"}],"type":"conference","date_created":"2018-12-11T11:46:27Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","author":[{"full_name":"Fulek, Radoslav","first_name":"Radoslav","orcid":"0000-0001-8485-1774","last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pach","full_name":"Pach, János","first_name":"János"}],"date_updated":"2026-04-16T09:48:11Z","citation":{"ama":"Fulek R, Pach J. Thrackles: An improved upper bound. In: Vol 10692. Springer; 2018:160-166. doi:<a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">10.1007/978-3-319-73915-1_14</a>","mla":"Fulek, Radoslav, and János Pach. <i>Thrackles: An Improved Upper Bound</i>. Vol. 10692, Springer, 2018, pp. 160–66, doi:<a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">10.1007/978-3-319-73915-1_14</a>.","chicago":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound,” 10692:160–66. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">https://doi.org/10.1007/978-3-319-73915-1_14</a>.","ieee":"R. Fulek and J. Pach, “Thrackles: An improved upper bound,” presented at the GD: Graph Drawing and Network Visualization, Boston, MA, United States, 2018, vol. 10692, pp. 160–166.","ista":"Fulek R, Pach J. 2018. Thrackles: An improved upper bound. GD: Graph Drawing and Network Visualization, LNCS, vol. 10692, 160–166.","short":"R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.","apa":"Fulek, R., &#38; Pach, J. (2018). Thrackles: An improved upper bound (Vol. 10692, pp. 160–166). Presented at the GD: Graph Drawing and Network Visualization, Boston, MA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-73915-1_14\">https://doi.org/10.1007/978-3-319-73915-1_14</a>"},"publisher":"Springer","related_material":{"record":[{"status":"public","id":"5857","relation":"later_version"}]},"quality_controlled":"1","scopus_import":"1","alternative_title":["LNCS"],"status":"public","oa":1,"day":"21","publist_id":"7390","doi":"10.1007/978-3-319-73915-1_14","conference":{"start_date":"201-09-25","end_date":"2017-09-27","name":"GD: Graph Drawing and Network Visualization","location":"Boston, MA, United States"},"department":[{"_id":"UlWa"}],"oa_version":"Submitted Version","publication_status":"published","page":"160 - 166","corr_author":"1","abstract":[{"text":"A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound is best possible for infinitely many values of n.","lang":"eng"}]},{"publisher":"American Astronomical Society","citation":{"apa":"McKernan, B., Saavik Ford, K. E., Bellovary, J., Leigh, N. W. C., Haiman, Z., Kocsis, B., … Rosen, D. J. (2018). Constraining stellar-mass black hole mergers in AGN disks detectable with LIGO. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/1538-4357/aadae5\">https://doi.org/10.3847/1538-4357/aadae5</a>","short":"B. McKernan, K.E. Saavik Ford, J. Bellovary, N.W.C. Leigh, Z. Haiman, B. Kocsis, W. Lyra, M.-M. Mac Low, B. Metzger, M. O’Dowd, S. Endlich, D.J. Rosen, The Astrophysical Journal 866 (2018).","ieee":"B. McKernan <i>et al.</i>, “Constraining stellar-mass black hole mergers in AGN disks detectable with LIGO,” <i>The Astrophysical Journal</i>, vol. 866, no. 1. American Astronomical Society, 2018.","chicago":"McKernan, Barry, K. E. Saavik Ford, J. Bellovary, N. W. C. Leigh, Zoltán Haiman, B. Kocsis, W. Lyra, et al. “Constraining Stellar-Mass Black Hole Mergers in AGN Disks Detectable with LIGO.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2018. <a href=\"https://doi.org/10.3847/1538-4357/aadae5\">https://doi.org/10.3847/1538-4357/aadae5</a>.","ista":"McKernan B, Saavik Ford KE, Bellovary J, Leigh NWC, Haiman Z, Kocsis B, Lyra W, Mac Low M-M, Metzger B, O’Dowd M, Endlich S, Rosen DJ. 2018. Constraining stellar-mass black hole mergers in AGN disks detectable with LIGO. The Astrophysical Journal. 866(1), 66.","mla":"McKernan, Barry, et al. “Constraining Stellar-Mass Black Hole Mergers in AGN Disks Detectable with LIGO.” <i>The Astrophysical Journal</i>, vol. 866, no. 1, 66, American Astronomical Society, 2018, doi:<a href=\"https://doi.org/10.3847/1538-4357/aadae5\">10.3847/1538-4357/aadae5</a>.","ama":"McKernan B, Saavik Ford KE, Bellovary J, et al. Constraining stellar-mass black hole mergers in AGN disks detectable with LIGO. <i>The Astrophysical Journal</i>. 2018;866(1). doi:<a href=\"https://doi.org/10.3847/1538-4357/aadae5\">10.3847/1538-4357/aadae5</a>"},"author":[{"last_name":"McKernan","first_name":"Barry","full_name":"McKernan, Barry"},{"first_name":"K. E.","full_name":"Saavik Ford, K. E.","last_name":"Saavik Ford"},{"last_name":"Bellovary","first_name":"J.","full_name":"Bellovary, J."},{"last_name":"Leigh","first_name":"N. W. C.","full_name":"Leigh, N. W. C."},{"first_name":"Zoltán","full_name":"Haiman, Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman"},{"last_name":"Kocsis","first_name":"B.","full_name":"Kocsis, B."},{"last_name":"Lyra","first_name":"W.","full_name":"Lyra, W."},{"full_name":"Mac Low, M.-M.","first_name":"M.-M.","last_name":"Mac Low"},{"full_name":"Metzger, B.","first_name":"B.","last_name":"Metzger"},{"last_name":"O’Dowd","first_name":"M.","full_name":"O’Dowd, M."},{"last_name":"Endlich","full_name":"Endlich, S.","first_name":"S."},{"first_name":"D. J.","full_name":"Rosen, D. J.","last_name":"Rosen"}],"date_updated":"2024-09-19T07:49:42Z","quality_controlled":"1","scopus_import":"1","publication":"The Astrophysical Journal","oa":1,"publication_identifier":{"issn":["0004-637X","1538-4357"]},"status":"public","doi":"10.3847/1538-4357/aadae5","article_number":"66","day":"15","extern":"1","oa_version":"Published Version","abstract":[{"text":"Black hole (BH) mergers detectable with the Laser Interferometer Gravitational-wave Observatory (LIGO) can occur in active galactic nucleus (AGN) disks. Here we parameterize the merger rates, the mass spectrum, and the spin spectrum of BHs in AGN disks. The predicted merger rate spans ∼10−3–104 Gpc−1 yr−1, so upper limits from LIGO (<212 Gpc−1 yr−1) already constrain it. The predicted mass spectrum has the form of a broken power law, consisting of a pre-existing BH power-law mass spectrum and a harder power-law mass spectrum resulting from mergers. The predicted spin spectrum is multipeaked with the evolution of retrograde spin BHs in the gas disk playing a key role. We outline the large uncertainties in each of these LIGO observables for this channel and we discuss ways in which they can be constrained in the future.","lang":"eng"}],"publication_status":"published","title":"Constraining stellar-mass black hole mergers in AGN disks detectable with LIGO","year":"2018","date_published":"2018-10-15T00:00:00Z","_id":"17575","issue":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.3847/1538-4357/aadae5"}],"intvolume":"       866","language":[{"iso":"eng"}],"volume":866,"date_created":"2024-09-05T12:18:19Z","type":"journal_article","article_type":"original","month":"10","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No"},{"external_id":{"arxiv":["1805.05334"]},"title":"Gravitational waves from supermassive black hole binaries in ultraluminous infrared galaxies","arxiv":1,"year":"2018","date_published":"2018-08-20T00:00:00Z","_id":"17640","issue":"2","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1805.05334"}],"language":[{"iso":"eng"}],"intvolume":"       863","volume":863,"date_created":"2024-09-06T07:18:03Z","type":"journal_article","month":"08","article_type":"original","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"K. Inayoshi, K. Ichikawa, Z. Haiman, The Astrophysical Journal Letters 863 (2018).","apa":"Inayoshi, K., Ichikawa, K., &#38; Haiman, Z. (2018). Gravitational waves from supermassive black hole binaries in ultraluminous infrared galaxies. <i>The Astrophysical Journal Letters</i>. American Astronomical Society. <a href=\"https://doi.org/10.3847/2041-8213/aad8ad\">https://doi.org/10.3847/2041-8213/aad8ad</a>","ieee":"K. Inayoshi, K. Ichikawa, and Z. Haiman, “Gravitational waves from supermassive black hole binaries in ultraluminous infrared galaxies,” <i>The Astrophysical Journal Letters</i>, vol. 863, no. 2. American Astronomical Society, 2018.","ista":"Inayoshi K, Ichikawa K, Haiman Z. 2018. Gravitational waves from supermassive black hole binaries in ultraluminous infrared galaxies. The Astrophysical Journal Letters. 863(2), L36.","chicago":"Inayoshi, Kohei, Kohei Ichikawa, and Zoltán Haiman. “Gravitational Waves from Supermassive Black Hole Binaries in Ultraluminous Infrared Galaxies.” <i>The Astrophysical Journal Letters</i>. American Astronomical Society, 2018. <a href=\"https://doi.org/10.3847/2041-8213/aad8ad\">https://doi.org/10.3847/2041-8213/aad8ad</a>.","mla":"Inayoshi, Kohei, et al. “Gravitational Waves from Supermassive Black Hole Binaries in Ultraluminous Infrared Galaxies.” <i>The Astrophysical Journal Letters</i>, vol. 863, no. 2, L36, American Astronomical Society, 2018, doi:<a href=\"https://doi.org/10.3847/2041-8213/aad8ad\">10.3847/2041-8213/aad8ad</a>.","ama":"Inayoshi K, Ichikawa K, Haiman Z. Gravitational waves from supermassive black hole binaries in ultraluminous infrared galaxies. <i>The Astrophysical Journal Letters</i>. 2018;863(2). doi:<a href=\"https://doi.org/10.3847/2041-8213/aad8ad\">10.3847/2041-8213/aad8ad</a>"},"publisher":"American Astronomical Society","date_updated":"2024-09-24T11:47:28Z","author":[{"first_name":"Kohei","full_name":"Inayoshi, Kohei","last_name":"Inayoshi"},{"last_name":"Ichikawa","full_name":"Ichikawa, Kohei","first_name":"Kohei"},{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman","full_name":"Haiman, Zoltán","first_name":"Zoltán"}],"quality_controlled":"1","publication":"The Astrophysical Journal Letters","scopus_import":"1","oa":1,"publication_identifier":{"issn":["2041-8205","2041-8213"]},"status":"public","doi":"10.3847/2041-8213/aad8ad","article_number":"L36","day":"20","extern":"1","oa_version":"Preprint","abstract":[{"text":"Gravitational waves (GWs) in the nano-hertz band are great tools for understanding the cosmological evolution of supermassive black holes (SMBHs) in galactic nuclei. We consider SMBH binaries in high-z ultra-luminous infrared galaxies (ULIRGs) as sources of a stochastic GW background (GWB). ULIRGs are likely associated with gas-rich galaxy mergers containing SMBHs that possibly occur at most once in the life of galaxies, unlike multiple dry mergers at low redshift. Adopting a well-established sample of ULIRGs, we study the properties of the GWB due to coalescing binary SMBHs in these galaxies. Since the ULIRG population peaks at z>1.5, the amplitude of the GWB is not affected even if BH mergers are delayed by as long as ∼ 10 Gyrs. Despite the rarity of the high-z ULIRGs, we find a tension with the upper limits from Pulsar Timing Array (PTA) experiments. This result suggests that if a fraction fm,gal of ULIRGs are associated with SMBH binaries, then no more than 20fm,gal(λEdd/0.3)5/3(tlife/30 Myr) % of the binary SMBHs in ULIRGs can merge within a Hubble time, for plausible values of the Eddington ratio of ULIRGs (λEdd) and their lifetime (tlife).","lang":"eng"}],"publication_status":"published"},{"extern":"1","day":"01","doi":"10.1093/mnras/sty276","publication_status":"published","abstract":[{"text":"We study low-density axisymmetric accretion flows onto black holes (BHs) with two-dimensional hydrodynamical simulations, adopting the α-viscosity prescription. When the gas angular momentum is low enough to form a rotationally supported disk within the Bondi radius (RB), we find a global steady accretion solution. The solution consists of a rotational equilibrium distribution at r∼RB, where the density follows ρ∝(1+RB/r)^3/2, surrounding a geometrically thick and optically thin accretion disk at the centrifugal radius, where thermal energy generated by viscosity is transported via strong convection. Physical properties of the inner solution agree with those expected in convection-dominated accretion flows (CDAF; ρ∝r^−1/2). In the inner CDAF solution, the gas inflow rate decreases towards the center due to convection (M˙∝r), and the net accretion rate (including both inflows and outflows) is strongly suppressed by several orders of magnitude from the Bondi accretion rate M˙B The net accretion rate depends on the viscous strength, following M˙/M˙B∝(α/0.01)^0.6. This solution holds for low accretion rates of M˙B/M˙Edd<10^−3 having minimal radiation cooling, where M˙Edd is the Eddington rate. In a hot plasma at the bottom (r<10^−3 RB), thermal conduction would dominate the convective energy flux. Since suppression of the accretion by convection ceases, the final BH feeding rate is found to be M˙/M˙B∼10^−3−10^−2. This rate is as low as M˙/M˙Edd∼10^−7−10^−6 inferred for SgrA∗ and the nuclear BHs in M31 and M87, and can explain the low luminosities in these sources, without invoking any feedback mechanism.","lang":"eng"}],"page":"1412-1426","oa_version":"Published Version","quality_controlled":"1","date_updated":"2024-09-25T08:57:35Z","author":[{"full_name":"Inayoshi, Kohei","first_name":"Kohei","last_name":"Inayoshi"},{"last_name":"Ostriker","first_name":"Jeremiah P","full_name":"Ostriker, Jeremiah P"},{"full_name":"Haiman, Zoltán","first_name":"Zoltán","last_name":"Haiman","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"},{"first_name":"Rolf","full_name":"Kuiper, Rolf","last_name":"Kuiper"}],"publisher":"Oxford University Press","citation":{"ama":"Inayoshi K, Ostriker JP, Haiman Z, Kuiper R. Low-density, radiatively inefficient rotating-accretion flow on to a black hole. <i>Monthly Notices of the Royal Astronomical Society</i>. 2018;476(1):1412-1426. doi:<a href=\"https://doi.org/10.1093/mnras/sty276\">10.1093/mnras/sty276</a>","mla":"Inayoshi, Kohei, et al. “Low-Density, Radiatively Inefficient Rotating-Accretion Flow on to a Black Hole.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 476, no. 1, Oxford University Press, 2018, pp. 1412–26, doi:<a href=\"https://doi.org/10.1093/mnras/sty276\">10.1093/mnras/sty276</a>.","ista":"Inayoshi K, Ostriker JP, Haiman Z, Kuiper R. 2018. Low-density, radiatively inefficient rotating-accretion flow on to a black hole. Monthly Notices of the Royal Astronomical Society. 476(1), 1412–1426.","ieee":"K. Inayoshi, J. P. Ostriker, Z. Haiman, and R. Kuiper, “Low-density, radiatively inefficient rotating-accretion flow on to a black hole,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 476, no. 1. Oxford University Press, pp. 1412–1426, 2018.","chicago":"Inayoshi, Kohei, Jeremiah P Ostriker, Zoltán Haiman, and Rolf Kuiper. “Low-Density, Radiatively Inefficient Rotating-Accretion Flow on to a Black Hole.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/mnras/sty276\">https://doi.org/10.1093/mnras/sty276</a>.","short":"K. Inayoshi, J.P. Ostriker, Z. Haiman, R. Kuiper, Monthly Notices of the Royal Astronomical Society 476 (2018) 1412–1426.","apa":"Inayoshi, K., Ostriker, J. P., Haiman, Z., &#38; Kuiper, R. (2018). Low-density, radiatively inefficient rotating-accretion flow on to a black hole. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/sty276\">https://doi.org/10.1093/mnras/sty276</a>"},"status":"public","publication_identifier":{"issn":["0035-8711","1365-2966"]},"oa":1,"scopus_import":"1","publication":"Monthly Notices of the Royal Astronomical Society","volume":476,"intvolume":"       476","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/mnras/sty276"}],"issue":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","article_type":"original","month":"02","type":"journal_article","date_created":"2024-09-06T08:05:18Z","year":"2018","title":"Low-density, radiatively inefficient rotating-accretion flow on to a black hole","_id":"17679","date_published":"2018-02-01T00:00:00Z"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1093/mnras/sty1720"}],"issue":"3","volume":479,"intvolume":"       479","language":[{"iso":"eng"}],"type":"journal_article","date_created":"2024-09-06T08:22:23Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","month":"06","article_type":"original","year":"2018","title":"Massive black hole and Population III galaxy formation in overmassive dark-matter haloes with violent merger histories","_id":"17687","date_published":"2018-06-30T00:00:00Z","day":"30","doi":"10.1093/mnras/sty1720","extern":"1","oa_version":"Published Version","publication_status":"published","page":"4017-4027","abstract":[{"lang":"eng","text":"We propose the formation of massive pristine dark-matter (DM) halos with masses of ∼10^8 M⊙, due to the dynamical effects of frequent mergers in rare regions of the Universe with high baryonic streaming velocity relative to DM. Since the streaming motion prevents gas collapse into DM halos and delays prior star formation episodes, the gas remains metal-free until the halo virial temperatures ≳2×10^4 K. The minimum cooling mass of DM halos is boosted by a factor of ∼10−30 because frequent major mergers of halos further inhibit gas collapse. We use Monte Carlo merger trees to simulate the DM assembly history under a streaming velocity of twice the root-mean-square value, and estimate the number density of massive DM halos containing pristine gas as ≃10^−4 cMpc^−3. When the gas infall begins, efficient Lyα cooling drives cold streams penetrating inside the halo and feeding a central galactic disk. When one stream collides with the disk, strong shock forms a dense and hot gas cloud, where the gas never forms H2 molecules due to effective collisional dissociation. As a result, a massive gas cloud forms by gravitational instability and collapses directly into a massive black hole (BH) with M∙∼10^5 M⊙. Almost simultaneously, a galaxy with M⋆,tot∼10^6 M⊙ composed of Population III stars forms in the nuclear region. If the typical stellar mass is as high as ∼100 M⊙, the galaxy could be detected with the James Webb Space Telescope even at z≳15. These massive seed BHs would be fed by continuous gas accretion from the host galaxy, and grow to be bright quasars observed at z≳6."}],"author":[{"last_name":"Inayoshi","full_name":"Inayoshi, Kohei","first_name":"Kohei"},{"last_name":"Li","full_name":"Li, Miao","first_name":"Miao"},{"full_name":"Haiman, Zoltán","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman"}],"date_updated":"2024-09-25T09:46:30Z","citation":{"ama":"Inayoshi K, Li M, Haiman Z. Massive black hole and Population III galaxy formation in overmassive dark-matter haloes with violent merger histories. <i>Monthly Notices of the Royal Astronomical Society</i>. 2018;479(3):4017-4027. doi:<a href=\"https://doi.org/10.1093/mnras/sty1720\">10.1093/mnras/sty1720</a>","mla":"Inayoshi, Kohei, et al. “Massive Black Hole and Population III Galaxy Formation in Overmassive Dark-Matter Haloes with Violent Merger Histories.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 479, no. 3, Oxford University Press, 2018, pp. 4017–27, doi:<a href=\"https://doi.org/10.1093/mnras/sty1720\">10.1093/mnras/sty1720</a>.","ista":"Inayoshi K, Li M, Haiman Z. 2018. Massive black hole and Population III galaxy formation in overmassive dark-matter haloes with violent merger histories. Monthly Notices of the Royal Astronomical Society. 479(3), 4017–4027.","ieee":"K. Inayoshi, M. Li, and Z. Haiman, “Massive black hole and Population III galaxy formation in overmassive dark-matter haloes with violent merger histories,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 479, no. 3. Oxford University Press, pp. 4017–4027, 2018.","chicago":"Inayoshi, Kohei, Miao Li, and Zoltán Haiman. “Massive Black Hole and Population III Galaxy Formation in Overmassive Dark-Matter Haloes with Violent Merger Histories.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/mnras/sty1720\">https://doi.org/10.1093/mnras/sty1720</a>.","short":"K. Inayoshi, M. Li, Z. Haiman, Monthly Notices of the Royal Astronomical Society 479 (2018) 4017–4027.","apa":"Inayoshi, K., Li, M., &#38; Haiman, Z. (2018). Massive black hole and Population III galaxy formation in overmassive dark-matter haloes with violent merger histories. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/sty1720\">https://doi.org/10.1093/mnras/sty1720</a>"},"publisher":"Oxford University Press","quality_controlled":"1","scopus_import":"1","publication":"Monthly Notices of the Royal Astronomical Society","publication_identifier":{"issn":["0035-8711","1365-2966"]},"status":"public","oa":1},{"day":"09","doi":"10.1007/978-3-030-01216-8_27","issue":"Part II","conference":{"name":"ECCV: European Conference on Computer Vision","location":"Munich, Germany","end_date":"2018-09-14","start_date":"2018-09-08"},"volume":11206,"extern":"1","intvolume":"     11206","language":[{"iso":"eng"}],"type":"conference","oa_version":"None","date_created":"2024-10-09T07:47:30Z","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"In this paper, we introduce a random forest semantic hashing scheme that embeds tiny convolutional neural networks (CNN) into shallow random forests. A binary hash code for a data point is obtained by a set of decision trees, setting ‘1’ for the visited tree leaf, and ‘0’ for the rest. We propose to first randomly group arriving classes at each tree split node into two groups, obtaining a significantly simplified two-class classification problem that can be a handled with a light-weight CNN weak learner. Code uniqueness is achieved via the random class grouping, whilst code consistency is achieved using a low-rank loss in the CNN weak learners that encourages intra-class compactness for the two random class groups. Finally, we introduce an information-theoretic approach for aggregating codes of individual trees into a single hash code, producing a near-optimal unique hash for each class. The proposed approach significantly outperforms state-of-the-art hashing methods for image retrieval tasks on large-scale public datasets, and is comparable to image classification methods while utilizing a more compact, efficient and scalable representation. This work proposes a principled and robust procedure to train and deploy in parallel an ensemble of light-weight CNNs, instead of simply going deeper.","lang":"eng"}],"month":"10","date_updated":"2025-01-23T13:25:18Z","author":[{"last_name":"Qiu","first_name":"Qiang","full_name":"Qiu, Qiang"},{"first_name":"José","full_name":"Lezama, José","last_name":"Lezama"},{"full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Sapiro","first_name":"Guillermo","full_name":"Sapiro, Guillermo"}],"publisher":"Springer Nature","citation":{"mla":"Qiu, Qiang, et al. “ForestHash: Semantic Hashing with Shallow Random Forests and Tiny Convolutional Networks.” <i>European Conference on Computer Vision</i>, vol. 11206, no. Part II, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">10.1007/978-3-030-01216-8_27</a>.","ama":"Qiu Q, Lezama J, Bronstein AM, Sapiro G. ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. In: <i>European Conference on Computer Vision</i>. Vol 11206. Springer Nature; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">10.1007/978-3-030-01216-8_27</a>","apa":"Qiu, Q., Lezama, J., Bronstein, A. M., &#38; Sapiro, G. (2018). ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. In <i>European Conference on Computer Vision</i> (Vol. 11206). Munich, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">https://doi.org/10.1007/978-3-030-01216-8_27</a>","short":"Q. Qiu, J. Lezama, A.M. Bronstein, G. Sapiro, in:, European Conference on Computer Vision, Springer Nature, 2018.","ieee":"Q. Qiu, J. Lezama, A. M. Bronstein, and G. Sapiro, “ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks,” in <i>European Conference on Computer Vision</i>, Munich, Germany, 2018, vol. 11206, no. Part II.","chicago":"Qiu, Qiang, José Lezama, Alex M. Bronstein, and Guillermo Sapiro. “ForestHash: Semantic Hashing with Shallow Random Forests and Tiny Convolutional Networks.” In <i>European Conference on Computer Vision</i>, Vol. 11206. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-030-01216-8_27\">https://doi.org/10.1007/978-3-030-01216-8_27</a>.","ista":"Qiu Q, Lezama J, Bronstein AM, Sapiro G. 2018. ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks. European Conference on Computer Vision. ECCV: European Conference on Computer Vision, LNCS, vol. 11206."},"quality_controlled":"1","year":"2018","title":"ForestHash: Semantic hashing with shallow random forests and tiny convolutional networks","_id":"18282","alternative_title":["LNCS"],"scopus_import":"1","date_published":"2018-10-09T00:00:00Z","publication":"European Conference on Computer Vision","status":"public","publication_identifier":{"isbn":["9783030012151"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783030012168"]}},{"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783030009274"],"issn":["0302-9743"],"eisbn":["9783030009281"]},"status":"public","scopus_import":"1","publication":"International Conference on Medical Image Computing and Computer Assisted Intervention","alternative_title":["LNCS"],"quality_controlled":"1","date_updated":"2025-01-23T13:13:01Z","author":[{"full_name":"Senouf, Ortal","first_name":"Ortal","last_name":"Senouf"},{"last_name":"Vedula","full_name":"Vedula, Sanketh","first_name":"Sanketh"},{"first_name":"Grigoriy","full_name":"Zurakhov, Grigoriy","last_name":"Zurakhov"},{"first_name":"Alexander","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein"},{"last_name":"Zibulevsky","full_name":"Zibulevsky, Michael","first_name":"Michael"},{"last_name":"Michailovich","first_name":"Oleg","full_name":"Michailovich, Oleg"},{"first_name":"Dan","full_name":"Adam, Dan","last_name":"Adam"},{"last_name":"Blondheim","full_name":"Blondheim, David","first_name":"David"}],"citation":{"apa":"Senouf, O., Vedula, S., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich, O., … Blondheim, D. (2018). High frame-rate cardiac ultrasound imaging with deep learning. In <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i> (Vol. 11070, pp. 126–134). Granada, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">https://doi.org/10.1007/978-3-030-00928-1_15</a>","short":"O. Senouf, S. Vedula, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich, D. Adam, D. Blondheim, in:, International Conference on Medical Image Computing and Computer Assisted Intervention, Springer Nature, 2018, pp. 126–134.","chicago":"Senouf, Ortal, Sanketh Vedula, Grigoriy Zurakhov, Alex M. Bronstein, Michael Zibulevsky, Oleg Michailovich, Dan Adam, and David Blondheim. “High Frame-Rate Cardiac Ultrasound Imaging with Deep Learning.” In <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>, 11070:126–34. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">https://doi.org/10.1007/978-3-030-00928-1_15</a>.","ieee":"O. Senouf <i>et al.</i>, “High frame-rate cardiac ultrasound imaging with deep learning,” in <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>, Granada, Spain, 2018, vol. 11070, no. Part 1, pp. 126–134.","ista":"Senouf O, Vedula S, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich O, Adam D, Blondheim D. 2018. High frame-rate cardiac ultrasound imaging with deep learning. International Conference on Medical Image Computing and Computer Assisted Intervention. MICCAI: Medical Image Computing and Computer Assisted Intervention, LNCS, vol. 11070, 126–134.","mla":"Senouf, Ortal, et al. “High Frame-Rate Cardiac Ultrasound Imaging with Deep Learning.” <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>, vol. 11070, no. Part 1, Springer Nature, 2018, pp. 126–34, doi:<a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">10.1007/978-3-030-00928-1_15</a>.","ama":"Senouf O, Vedula S, Zurakhov G, et al. High frame-rate cardiac ultrasound imaging with deep learning. In: <i>International Conference on Medical Image Computing and Computer Assisted Intervention</i>. Vol 11070. Springer Nature; 2018:126-134. doi:<a href=\"https://doi.org/10.1007/978-3-030-00928-1_15\">10.1007/978-3-030-00928-1_15</a>"},"publisher":"Springer Nature","publication_status":"published","page":"126 - 134","abstract":[{"text":"Cardiac ultrasound imaging requires a high frame rate in order to capture rapid motion. This can be achieved by multi-line acquisition (MLA), where several narrow-focused received lines are obtained from each wide-focused transmitted line. This shortens the acquisition time at the expense of introducing block artifacts. In this paper, we propose a data-driven learning-based approach to improve the MLA image quality. We train an end-to-end convolutional neural network on pairs of real ultrasound cardiac data, acquired through MLA and the corresponding single-line acquisition (SLA). The network achieves a significant improvement in image quality for both 5- and 7-line MLA resulting in a decorrelation measure similar to that of SLA while having the frame rate of MLA.","lang":"eng"}],"oa_version":"None","conference":{"start_date":"2018-09-16","end_date":"2018-09-20","name":"MICCAI: Medical Image Computing and Computer Assisted Intervention","location":"Granada, Spain"},"extern":"1","day":"14","doi":"10.1007/978-3-030-00928-1_15","_id":"18283","date_published":"2018-09-14T00:00:00Z","year":"2018","title":"High frame-rate cardiac ultrasound imaging with deep learning","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","month":"09","type":"conference","date_created":"2024-10-09T07:47:49Z","volume":11070,"intvolume":"     11070","language":[{"iso":"eng"}],"issue":"Part 1"},{"title":"High quality ultrasonic multi-line transmission through deep learning","quality_controlled":"1","year":"2018","publisher":"Springer Nature","citation":{"mla":"Vedula, Sanketh, et al. “High Quality Ultrasonic Multi-Line Transmission through Deep Learning.” <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>, vol. 11074, Springer Nature, 2018, pp. 147–55, doi:<a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">10.1007/978-3-030-00129-2_17</a>.","ama":"Vedula S, Senouf O, Zurakhov G, et al. High quality ultrasonic multi-line transmission through deep learning. In: <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>. Vol 11074. Springer Nature; 2018:147-155. doi:<a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">10.1007/978-3-030-00129-2_17</a>","short":"S. Vedula, O. Senouf, G. Zurakhov, A.M. Bronstein, M. Zibulevsky, O. Michailovich, D. Adam, D. Gaitini, in:, First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018, Springer Nature, 2018, pp. 147–155.","apa":"Vedula, S., Senouf, O., Zurakhov, G., Bronstein, A. M., Zibulevsky, M., Michailovich, O., … Gaitini, D. (2018). High quality ultrasonic multi-line transmission through deep learning. In <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i> (Vol. 11074, pp. 147–155). Granada, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">https://doi.org/10.1007/978-3-030-00129-2_17</a>","ista":"Vedula S, Senouf O, Zurakhov G, Bronstein AM, Zibulevsky M, Michailovich O, Adam D, Gaitini D. 2018. High quality ultrasonic multi-line transmission through deep learning. First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018. MLMIR: Workshop on Machine Learning for Medical Image Reconstruction, LNCS, vol. 11074, 147–155.","chicago":"Vedula, Sanketh, Ortal Senouf, Grigoriy Zurakhov, Alex M. Bronstein, Michael Zibulevsky, Oleg Michailovich, Dan Adam, and Diana Gaitini. “High Quality Ultrasonic Multi-Line Transmission through Deep Learning.” In <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>, 11074:147–55. Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00129-2_17\">https://doi.org/10.1007/978-3-030-00129-2_17</a>.","ieee":"S. Vedula <i>et al.</i>, “High quality ultrasonic multi-line transmission through deep learning,” in <i>First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018</i>, Granada, Spain, 2018, vol. 11074, pp. 147–155."},"author":[{"first_name":"Sanketh","full_name":"Vedula, Sanketh","last_name":"Vedula"},{"last_name":"Senouf","full_name":"Senouf, Ortal","first_name":"Ortal"},{"full_name":"Zurakhov, Grigoriy","first_name":"Grigoriy","last_name":"Zurakhov"},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"full_name":"Zibulevsky, Michael","first_name":"Michael","last_name":"Zibulevsky"},{"full_name":"Michailovich, Oleg","first_name":"Oleg","last_name":"Michailovich"},{"last_name":"Adam","full_name":"Adam, Dan","first_name":"Dan"},{"first_name":"Diana","full_name":"Gaitini, Diana","last_name":"Gaitini"}],"date_updated":"2025-01-23T12:53:22Z","publication_identifier":{"eisbn":["9783030001292"],"issn":["0302-9743"],"isbn":["9783030001285"],"eissn":["1611-3349"]},"status":"public","publication":"First International Workshop, MLMIR 2018, Held in Conjunction with MICCAI 2018","scopus_import":"1","date_published":"2018-09-12T00:00:00Z","alternative_title":["LNCS"],"_id":"18284","intvolume":"     11074","extern":"1","language":[{"iso":"eng"}],"volume":11074,"conference":{"name":"MLMIR: Workshop on Machine Learning for Medical Image Reconstruction","location":"Granada, Spain","start_date":"2018-09-16","end_date":"2018-09-16"},"doi":"10.1007/978-3-030-00129-2_17","day":"12","month":"09","page":"147 - 155","abstract":[{"text":"Frame rate is a crucial consideration in cardiac ultrasound imaging and 3D sonography. Several methods have been proposed in the medical ultrasound literature aiming at accelerating the image acquisition. In this paper, we consider one such method called multi-line transmission (MLT), in which several evenly separated focused beams are transmitted simultaneously. While MLT reduces the acquisition time, it comes at the expense of a heavy loss of contrast due to the interactions between the beams (cross-talk artifact). In this paper, we introduce a data-driven method to reduce the artifacts arising in MLT. To this end, we propose to train an end-to-end convolutional neural network consisting of correction layers followed by a constant apodization layer. The network is trained on pairs of raw data obtained through MLT and the corresponding single-line transmission (SLT) data. Experimental evaluation demonstrates significant improvement both in the visual image quality and in objective measures such as contrast ratio and contrast-to-noise ratio, while preserving resolution unlike traditional apodization-based methods. We show that the proposed method is able to generalize well across different patients and anatomies on real and phantom data.","lang":"eng"}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_created":"2024-10-09T07:48:06Z","oa_version":"None","type":"conference"},{"month":"06","abstract":[{"lang":"eng","text":"Single image depth estimation is achieved using computational imaging and Deep Learning (DL). Imaging with phase-mask is also modeled as a DL-layer, and the mask and DL parameters are jointly designed using labeled data."}],"publication_status":"published","article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2024-10-09T07:48:24Z","oa_version":"None","type":"conference","extern":"1","language":[{"iso":"eng"}],"volume":"Part F99-COSI 2018","conference":{"name":"COSI: Computational Optical Sensing and Imaging","location":"Orlando, FL, United States","start_date":"2018-06-25","end_date":"2018-06-28"},"doi":"10.1364/cosi.2018.cw3b.3","article_number":"CW3B.3","day":"01","publication_identifier":{"isbn":["9781943580446"]},"status":"public","date_published":"2018-06-01T00:00:00Z","scopus_import":"1","publication":"Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&C, MATH, pcAOP)","_id":"18285","title":"Deep learned phase mask for single image depth estimation and 3D scanning","year":"2018","quality_controlled":"1","publisher":"OSA","citation":{"ama":"Haim H, Elmalem S, Giryes R, Bronstein AM, Marom E. Deep learned phase mask for single image depth estimation and 3D scanning. In: <i>Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&#38;C, MATH, PcAOP)</i>. Vol Part F99-COSI 2018. OSA; 2018. doi:<a href=\"https://doi.org/10.1364/cosi.2018.cw3b.3\">10.1364/cosi.2018.cw3b.3</a>","mla":"Haim, Harel, et al. “Deep Learned Phase Mask for Single Image Depth Estimation and 3D Scanning.” <i>Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&#38;C, MATH, PcAOP)</i>, vol. Part F99-COSI 2018, CW3B.3, OSA, 2018, doi:<a href=\"https://doi.org/10.1364/cosi.2018.cw3b.3\">10.1364/cosi.2018.cw3b.3</a>.","ista":"Haim H, Elmalem S, Giryes R, Bronstein AM, Marom E. 2018. Deep learned phase mask for single image depth estimation and 3D scanning. Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&#38;C, MATH, pcAOP). COSI: Computational Optical Sensing and Imaging vol. Part F99-COSI 2018, CW3B.3.","ieee":"H. Haim, S. Elmalem, R. Giryes, A. M. Bronstein, and E. Marom, “Deep learned phase mask for single image depth estimation and 3D scanning,” in <i>Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&#38;C, MATH, pcAOP)</i>, Orlando, FL, United States, 2018, vol. Part F99-COSI 2018.","chicago":"Haim, Harel, Shay Elmalem, Raja Giryes, Alex M. Bronstein, and Emanuel Marom. “Deep Learned Phase Mask for Single Image Depth Estimation and 3D Scanning.” In <i>Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&#38;C, MATH, PcAOP)</i>, Vol. Part F99-COSI 2018. OSA, 2018. <a href=\"https://doi.org/10.1364/cosi.2018.cw3b.3\">https://doi.org/10.1364/cosi.2018.cw3b.3</a>.","short":"H. Haim, S. Elmalem, R. Giryes, A.M. Bronstein, E. Marom, in:, Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&#38;C, MATH, PcAOP), OSA, 2018.","apa":"Haim, H., Elmalem, S., Giryes, R., Bronstein, A. M., &#38; Marom, E. (2018). Deep learned phase mask for single image depth estimation and 3D scanning. In <i>Imaging and Applied Optics 2018 (3D, AO, AIO, COSI, DH, IS, LACSEA, LS&#38;C, MATH, pcAOP)</i> (Vol. Part F99-COSI 2018). Orlando, FL, United States: OSA. <a href=\"https://doi.org/10.1364/cosi.2018.cw3b.3\">https://doi.org/10.1364/cosi.2018.cw3b.3</a>"},"date_updated":"2025-01-23T12:42:46Z","author":[{"last_name":"Haim","full_name":"Haim, Harel","first_name":"Harel"},{"first_name":"Shay","full_name":"Elmalem, Shay","last_name":"Elmalem"},{"last_name":"Giryes","full_name":"Giryes, Raja","first_name":"Raja"},{"first_name":"Alexander","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"full_name":"Marom, Emanuel","first_name":"Emanuel","last_name":"Marom"}]},{"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","month":"04","type":"conference","date_created":"2018-12-11T11:45:04Z","year":"2018","title":"Localizing faults in simulink/stateflow models with STL","external_id":{"isi":["000474781600022"]},"_id":"183","date_published":"2018-04-11T00:00:00Z","conference":{"location":"Porto, Portugal","name":"HSCC: Hybrid Systems - Computation and Control","end_date":"2018-04-13","start_date":"2018-04-11"},"isi":1,"department":[{"_id":"ToHe"}],"day":"11","publist_id":"7738","doi":"10.1145/3178126.3178131","publication_status":"published","abstract":[{"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.","lang":"eng"}],"page":"197 - 206","oa_version":"None","quality_controlled":"1","author":[{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","first_name":"Thomas"},{"first_name":"Niveditha","full_name":"Manjunath, Niveditha","last_name":"Manjunath"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"}],"date_updated":"2025-07-10T11:51:22Z","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"citation":{"ama":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. Localizing faults in simulink/stateflow models with STL. In: Association for Computing Machinery; 2018:197-206. doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>","mla":"Bartocci, Ezio, et al. <i>Localizing Faults in Simulink/Stateflow Models with STL</i>. Association for Computing Machinery, 2018, pp. 197–206, doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>.","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.","chicago":"Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic. “Localizing Faults in Simulink/Stateflow Models with STL,” 197–206. Association for Computing Machinery, 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. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>","short":"E. Bartocci, T. Ferrere, N. Manjunath, D. Nickovic, in:, Association for Computing Machinery, 2018, pp. 197–206."},"publisher":"Association for Computing Machinery","status":"public","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.","alternative_title":["HSCC Proceedings"],"scopus_import":"1"},{"year":"2018","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Shellability is NP-complete","file_date_updated":"2020-07-14T12:45:18Z","_id":"184","date_published":"2018-06-11T00:00:00Z","volume":99,"intvolume":"        99","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2018_LIPIcs_Goaoc.pdf","date_updated":"2020-07-14T12:45:18Z","relation":"main_file","file_id":"5725","checksum":"d12bdd60f04a57307867704b5f930afd","file_size":718414,"content_type":"application/pdf","creator":"dernst","date_created":"2018-12-17T16:35:02Z","access_level":"open_access"}],"month":"06","type":"conference","date_created":"2018-12-11T11:45:04Z","quality_controlled":"1","date_updated":"2025-06-04T07:49:02Z","author":[{"last_name":"Goaoc","first_name":"Xavier","full_name":"Goaoc, Xavier"},{"full_name":"Paták, Pavel","first_name":"Pavel","last_name":"Paták"},{"full_name":"Patakova, Zuzana","first_name":"Zuzana","last_name":"Patakova","orcid":"0000-0002-3975-1683","id":"48B57058-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Tancer, Martin","first_name":"Martin","id":"38AC689C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1191-6714","last_name":"Tancer"},{"last_name":"Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","full_name":"Wagner, Uli"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"ista":"Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99, 41:1-41:16.","chicago":"Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete,” 99:41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2018.41\">https://doi.org/10.4230/LIPIcs.SoCG.2018.41</a>.","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.","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>","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.","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>","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>."},"related_material":{"record":[{"status":"public","id":"7108","relation":"later_version"}]},"status":"public","oa":1,"acknowledgement":"Partially supported by the project EMBEDS II (CZ: 7AMB17FR029, FR: 38087RM) of Czech-French collaboration.","alternative_title":["Leibniz International Proceedings in Information, LIPIcs"],"scopus_import":1,"conference":{"location":"Budapest, Hungary","name":"SoCG: Symposium on Computational Geometry","start_date":"2018-06-11","end_date":"2018-06-14"},"department":[{"_id":"UlWa"}],"publist_id":"7736","day":"11","has_accepted_license":"1","doi":"10.4230/LIPIcs.SoCG.2018.41","ddc":["516","000"],"publication_status":"published","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."}],"page":"41:1 - 41:16","oa_version":"Published Version"},{"language":[{"iso":"eng"}],"type":"journal_article","date_created":"2018-12-11T11:44:30Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"Yes (via OA deal)","month":"09","file":[{"file_id":"5711","relation":"main_file","date_updated":"2020-07-14T12:48:01Z","file_name":"2018_DistributedComputing_Lenzen.pdf","date_created":"2018-12-17T14:21:22Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":799337,"checksum":"872db70bba9b401500abe3c6ae2f1a61"}],"file_date_updated":"2020-07-14T12:48:01Z","external_id":{"isi":["000475627800005"]},"year":"2018","title":"Near-optimal self-stabilising counting and firing squads","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"76","date_published":"2018-09-12T00:00:00Z","day":"12","has_accepted_license":"1","publist_id":"7978","doi":"10.1007/s00446-018-0342-6","isi":1,"department":[{"_id":"DaAl"}],"oa_version":"Published Version","ddc":["000"],"publication_status":"published","abstract":[{"text":"Consider a fully-connected synchronous distributed system consisting of n nodes, where up to f nodes may be faulty and every node starts in an arbitrary initial state. In the synchronous C-counting problem, all nodes need to eventually agree on a counter that is increased by one modulo C in each round for given C&gt;1. In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external “go” signal as input, then all correct nodes should agree on a round (in the not-too-distant future) in which to jointly output a “fire” signal. Moreover, no node should generate a “fire” signal without some correct node having previously received a “go” signal as input. We present a framework reducing both tasks to binary consensus at very small cost. For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f&lt;n/3, asymptotically optimal stabilisation and response time O(f), and message size O(log f). As our framework does not restrict the type of consensus routines used, we also obtain efficient randomised solutions.","lang":"eng"}],"corr_author":"1","author":[{"last_name":"Lenzen","first_name":"Christoph","full_name":"Lenzen, Christoph"},{"full_name":"Rybicki, Joel","first_name":"Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","last_name":"Rybicki"}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"date_updated":"2025-04-15T06:53:15Z","citation":{"mla":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” <i>Distributed Computing</i>, Springer, 2018, doi:<a href=\"https://doi.org/10.1007/s00446-018-0342-6\">10.1007/s00446-018-0342-6</a>.","ama":"Lenzen C, Rybicki J. Near-optimal self-stabilising counting and firing squads. <i>Distributed Computing</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s00446-018-0342-6\">10.1007/s00446-018-0342-6</a>","apa":"Lenzen, C., &#38; Rybicki, J. (2018). Near-optimal self-stabilising counting and firing squads. <i>Distributed Computing</i>. Springer. <a href=\"https://doi.org/10.1007/s00446-018-0342-6\">https://doi.org/10.1007/s00446-018-0342-6</a>","short":"C. Lenzen, J. Rybicki, Distributed Computing (2018).","ista":"Lenzen C, Rybicki J. 2018. Near-optimal self-stabilising counting and firing squads. Distributed Computing.","chicago":"Lenzen, Christoph, and Joel Rybicki. “Near-Optimal Self-Stabilising Counting and Firing Squads.” <i>Distributed Computing</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00446-018-0342-6\">https://doi.org/10.1007/s00446-018-0342-6</a>.","ieee":"C. Lenzen and J. Rybicki, “Near-optimal self-stabilising counting and firing squads,” <i>Distributed Computing</i>. Springer, 2018."},"publisher":"Springer","quality_controlled":"1","publication":"Distributed Computing","scopus_import":"1","status":"public","oa":1},{"year":"2018","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"A germanium hole spin qubit","file_date_updated":"2020-07-14T12:48:02Z","external_id":{"isi":["000445560800010"]},"_id":"77","date_published":"2018-09-25T00:00:00Z","volume":9,"language":[{"iso":"eng"}],"intvolume":"         9","issue":"3902 ","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"Yes","file":[{"checksum":"e7148c10a64497e279c4de570b6cc544","date_created":"2018-12-17T10:28:30Z","access_level":"open_access","creator":"dernst","file_size":1063469,"content_type":"application/pdf","file_name":"2018_NatureComm_Watzinger.pdf","file_id":"5687","date_updated":"2020-07-14T12:48:02Z","relation":"main_file"}],"month":"09","article_type":"original","type":"journal_article","date_created":"2018-12-11T11:44:30Z","quality_controlled":"1","ec_funded":1,"author":[{"full_name":"Watzinger, Hannes","first_name":"Hannes","last_name":"Watzinger","id":"35DF8E50-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Josip","full_name":"Kukucka, Josip","last_name":"Kukucka","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Lada","full_name":"Vukusic, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","last_name":"Vukusic","orcid":"0000-0003-2424-8636"},{"last_name":"Gao","full_name":"Gao, Fei","first_name":"Fei"},{"first_name":"Ting","full_name":"Wang, Ting","last_name":"Wang"},{"first_name":"Friedrich","full_name":"Schäffler, Friedrich","last_name":"Schäffler"},{"full_name":"Zhang, Jian","first_name":"Jian","last_name":"Zhang"},{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","last_name":"Katsaros","full_name":"Katsaros, Georgios","first_name":"Georgios"}],"date_updated":"2026-04-08T07:27:13Z","project":[{"_id":"25517E86-B435-11E9-9278-68D0E5697425","name":"Towards Spin qubits and Majorana fermions in Germanium self assembled hut-wires","grant_number":"335497","call_identifier":"FP7"},{"name":"Loch Spin-Qubits und Majorana-Fermionen in Germanium","grant_number":"Y00715","_id":"2552F888-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"citation":{"short":"H. Watzinger, J. Kukucka, L. Vukušić, F. Gao, T. Wang, F. Schäffler, J. Zhang, G. Katsaros, Nature Communications 9 (2018).","apa":"Watzinger, H., Kukucka, J., Vukušić, L., Gao, F., Wang, T., Schäffler, F., … Katsaros, G. (2018). A germanium hole spin qubit. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41467-018-06418-4\">https://doi.org/10.1038/s41467-018-06418-4</a>","chicago":"Watzinger, Hannes, Josip Kukucka, Lada Vukušić, Fei Gao, Ting Wang, Friedrich Schäffler, Jian Zhang, and Georgios Katsaros. “A Germanium Hole Spin Qubit.” <i>Nature Communications</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41467-018-06418-4\">https://doi.org/10.1038/s41467-018-06418-4</a>.","ieee":"H. Watzinger <i>et al.</i>, “A germanium hole spin qubit,” <i>Nature Communications</i>, vol. 9, no. 3902. Nature Publishing Group, 2018.","ista":"Watzinger H, Kukucka J, Vukušić L, Gao F, Wang T, Schäffler F, Zhang J, Katsaros G. 2018. A germanium hole spin qubit. Nature Communications. 9(3902).","mla":"Watzinger, Hannes, et al. “A Germanium Hole Spin Qubit.” <i>Nature Communications</i>, vol. 9, no. 3902, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41467-018-06418-4\">10.1038/s41467-018-06418-4</a>.","ama":"Watzinger H, Kukucka J, Vukušić L, et al. A germanium hole spin qubit. <i>Nature Communications</i>. 2018;9(3902). doi:<a href=\"https://doi.org/10.1038/s41467-018-06418-4\">10.1038/s41467-018-06418-4</a>"},"related_material":{"record":[{"id":"7977","relation":"popular_science"},{"id":"7996","status":"public","relation":"dissertation_contains"}]},"publisher":"Nature Publishing Group","status":"public","oa":1,"scopus_import":"1","publication":"Nature Communications","isi":1,"department":[{"_id":"GeKa"}],"has_accepted_license":"1","day":"25","doi":"10.1038/s41467-018-06418-4","ddc":["530"],"publication_status":"published","abstract":[{"text":"Holes confined in quantum dots have gained considerable interest in the past few years due to their potential as spin qubits. Here we demonstrate two-axis control of a spin 3/2 qubit in natural Ge. The qubit is formed in a hut wire double quantum dot device. The Pauli spin blockade principle allowed us to demonstrate electric dipole spin resonance by applying a radio frequency electric field to one of the electrodes defining the double quantum dot. Coherent hole spin oscillations with Rabi frequencies reaching 140 MHz are demonstrated and dephasing times of 130 ns are measured. The reported results emphasize the potential of Ge as a platform for fast and electrically tunable hole spin qubit devices.","lang":"eng"}],"oa_version":"Published Version"},{"title":"Imprint of assortative mating on the human genome","year":"2018","quality_controlled":"1","publisher":"Springer Nature","citation":{"ista":"Yengo L, Robinson MR, Keller MC, Kemper KE, Yang Y, Trzaskowski M, Gratten J, Turley P, Cesarini D, Benjamin DJ, Wray NR, Goddard ME, Yang J, Visscher PM. 2018. Imprint of assortative mating on the human genome. Nature Human Behaviour. 2(12), 948–954.","ieee":"L. Yengo <i>et al.</i>, “Imprint of assortative mating on the human genome,” <i>Nature Human Behaviour</i>, vol. 2, no. 12. Springer Nature, pp. 948–954, 2018.","chicago":"Yengo, Loic, Matthew Richard Robinson, Matthew C. Keller, Kathryn E. Kemper, Yuanhao Yang, Maciej Trzaskowski, Jacob Gratten, et al. “Imprint of Assortative Mating on the Human Genome.” <i>Nature Human Behaviour</i>. Springer Nature, 2018. <a href=\"https://doi.org/10.1038/s41562-018-0476-3\">https://doi.org/10.1038/s41562-018-0476-3</a>.","short":"L. Yengo, M.R. Robinson, M.C. Keller, K.E. Kemper, Y. Yang, M. Trzaskowski, J. Gratten, P. Turley, D. Cesarini, D.J. Benjamin, N.R. Wray, M.E. Goddard, J. Yang, P.M. Visscher, Nature Human Behaviour 2 (2018) 948–954.","apa":"Yengo, L., Robinson, M. R., Keller, M. C., Kemper, K. E., Yang, Y., Trzaskowski, M., … Visscher, P. M. (2018). Imprint of assortative mating on the human genome. <i>Nature Human Behaviour</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41562-018-0476-3\">https://doi.org/10.1038/s41562-018-0476-3</a>","ama":"Yengo L, Robinson MR, Keller MC, et al. Imprint of assortative mating on the human genome. <i>Nature Human Behaviour</i>. 2018;2(12):948-954. doi:<a href=\"https://doi.org/10.1038/s41562-018-0476-3\">10.1038/s41562-018-0476-3</a>","mla":"Yengo, Loic, et al. “Imprint of Assortative Mating on the Human Genome.” <i>Nature Human Behaviour</i>, vol. 2, no. 12, Springer Nature, 2018, pp. 948–54, doi:<a href=\"https://doi.org/10.1038/s41562-018-0476-3\">10.1038/s41562-018-0476-3</a>."},"author":[{"last_name":"Yengo","first_name":"Loic","full_name":"Yengo, Loic"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","last_name":"Robinson","orcid":"0000-0001-8982-8813","full_name":"Robinson, Matthew Richard","first_name":"Matthew Richard"},{"last_name":"Keller","first_name":"Matthew C.","full_name":"Keller, Matthew C."},{"last_name":"Kemper","first_name":"Kathryn E.","full_name":"Kemper, Kathryn E."},{"first_name":"Yuanhao","full_name":"Yang, Yuanhao","last_name":"Yang"},{"first_name":"Maciej","full_name":"Trzaskowski, Maciej","last_name":"Trzaskowski"},{"last_name":"Gratten","first_name":"Jacob","full_name":"Gratten, Jacob"},{"last_name":"Turley","full_name":"Turley, Patrick","first_name":"Patrick"},{"full_name":"Cesarini, David","first_name":"David","last_name":"Cesarini"},{"last_name":"Benjamin","first_name":"Daniel J.","full_name":"Benjamin, Daniel J."},{"first_name":"Naomi R.","full_name":"Wray, Naomi R.","last_name":"Wray"},{"first_name":"Michael E.","full_name":"Goddard, Michael E.","last_name":"Goddard"},{"last_name":"Yang","full_name":"Yang, Jian","first_name":"Jian"},{"first_name":"Peter M.","full_name":"Visscher, Peter M.","last_name":"Visscher"}],"date_updated":"2021-01-12T08:15:03Z","publication_identifier":{"issn":["2397-3374"]},"status":"public","date_published":"2018-11-26T00:00:00Z","publication":"Nature Human Behaviour","_id":"7715","intvolume":"         2","extern":"1","language":[{"iso":"eng"}],"volume":2,"doi":"10.1038/s41562-018-0476-3","issue":"12","day":"26","month":"11","article_type":"original","page":"948-954","abstract":[{"text":"Preference for mates with similar phenotypes; that is, assortative mating, is widely observed in humans1,2,3,4,5 and has evolutionary consequences6,7,8. Under Fisher's classical theory6, assortative mating is predicted to induce a signature in the genome at trait-associated loci that can be detected and quantified. Here, we develop and apply a method to quantify assortative mating on a specific trait by estimating the correlation (θ) between genetic predictors of the trait from single nucleotide polymorphisms on odd- versus even-numbered chromosomes. We show by theory and simulation that the effect of assortative mating can be quantified in the presence of population stratification. We applied this approach to 32 complex traits and diseases using single nucleotide polymorphism data from ~400,000 unrelated individuals of European ancestry. We found significant evidence of assortative mating for height (θ = 3.2%) and educational attainment (θ = 2.7%), both of which were consistent with theoretical predictions. Overall, our results imply that assortative mating involves multiple traits and affects the genomic architecture of loci that are associated with these traits, and that the consequence of mate choice can be detected from a random sample of genomes.","lang":"eng"}],"article_processing_charge":"No","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2020-04-30T10:42:12Z","oa_version":"None","type":"journal_article"},{"language":[{"iso":"eng"}],"intvolume":"     11022","volume":11022,"date_created":"2018-12-11T11:44:31Z","type":"conference","file":[{"checksum":"436b7574934324cfa7d1d3986fddc65b","creator":"dernst","access_level":"open_access","date_created":"2020-05-14T11:34:34Z","content_type":"application/pdf","file_size":374851,"file_name":"2018_LNCS_Bakhirkin.pdf","file_id":"7831","relation":"main_file","date_updated":"2020-07-14T12:48:03Z"}],"month":"08","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","external_id":{"isi":["000884993200013"]},"file_date_updated":"2020-07-14T12:48:03Z","title":"Online timed pattern matching using automata","year":"2018","date_published":"2018-08-26T00:00:00Z","_id":"78","doi":"10.1007/978-3-030-00151-3_13","publist_id":"7976","day":"26","has_accepted_license":"1","isi":1,"department":[{"_id":"ToHe"}],"conference":{"location":"Bejing, China","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","end_date":"2018-09-06","start_date":"2018-09-04"},"oa_version":"Submitted Version","abstract":[{"text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated.","lang":"eng"}],"page":"215 - 232","ddc":["000"],"publication_status":"published","publisher":"Springer","citation":{"ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>.","ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., &#38; Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>","ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>","mla":"Bakhirkin, Alexey, et al. <i>Online Timed Pattern Matching Using Automata</i>. Vol. 11022, Springer, 2018, pp. 215–32, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>."},"author":[{"full_name":"Bakhirkin, Alexey","first_name":"Alexey","last_name":"Bakhirkin"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","first_name":"Thomas"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"last_name":"Asarin","full_name":"Asarin, Eugene","first_name":"Eugene"}],"project":[{"call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"}],"date_updated":"2025-04-15T06:26:03Z","quality_controlled":"1","alternative_title":["LNCS"],"scopus_import":"1","oa":1,"status":"public","publication_identifier":{"isbn":["978-3-030-00150-6"]}}]