[{"author":[{"full_name":"Jesse, Fabienne","first_name":"Fabienne","last_name":"Jesse","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-07T12:01:21Z","date_created":"2018-12-11T11:48:41Z","acknowledgement":"ERC H2020 programme (grant agreement no. 648440)\r\nThanks to Jon Bollback for giving me the chance to do this work, for sharing the ideas that lay at the basis of this work, for his honesty and openness, showing himself to me as a person and not just as a boss. Thanks to Nick Barton for his guidance at the last stage, reading and commenting extensively on several versions of this manuscript, and for his encouragement; thanks to both Jon and Nick for their kindness and patience. Thanks to Erik van Nimwegen and Calin Guet for their time and willingness to be in my thesis committee, and to Erik van Nimwegen especially for agreeing to enter my thesis committee at the last moment, and for his very sharp, helpful and relevant comments during and after the defense. Thanks to my collaborators and discussion partners: Anne Kupczok, for her guidance, ideas and discussions during the construction of the manuscript of Chapter Two, and her comments on the manuscript; Georg Rieckh for making me aware of the issue of parameter identifiability, suggesting how to solve it, and for his unfortunate idea to start the plasmid enterprise in the first place; Murat Tugrul for sharing his model, for his enthusiasm, and his comments on Chapter Three; Srdjan Sarikas for his collaboration on the Monod model fitting, fast forwarding the analysis to turbo speed and making beautiful figures, and making the discussion fun on top of it all; Vanessa Barone for her last minute comments, especially on Chapter Three, providing a sharp and very helpful experimentalist perspective at the last moment; Maros Pleska and Marjon de Vos for their comments on the manuscript of Chapter Two; Gasper Tkacik for his crucial input on the relation between growth rate and lactose concentration; Bor Kavcic for his input on growth rate modeling and error propagation. Thanks to the Bollback, Bollenbach, Barton, Guet and Tkacik group members for both pro- viding an inspiring and supportive scientific environment to work in, as well as a lot of warmth and colour to everyday life. And thanks to the friends I found here, to the people who were there for me and to the people who changed my life, making it stranger and more beautiful than I could have imagined, Maros, Vanessa, Tade, Suzi, Andrej, Peter, Tiago, Kristof, Karin, Irene, Misha, Mato, Guillaume and Zanin. ","year":"2017","publication_status":"published","department":[{"_id":"JoBo"}],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:48:10Z","publist_id":"6829","ec_funded":1,"doi":"10.15479/AT:ISTA:th_857","supervisor":[{"full_name":"Bollback, Jonathan P","first_name":"Jonathan P","last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"project":[{"_id":"2578D616-B435-11E9-9278-68D0E5697425","grant_number":"648440","call_identifier":"H2020","name":"Selective Barriers to Horizontal Gene Transfer"}],"month":"08","publication_identifier":{"issn":["2663-337X"]},"pubrep_id":"857","oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":3417773,"creator":"system","file_name":"IST-2017-857-v1+1_thesis_fabienne.pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:10Z","date_created":"2018-12-12T10:17:00Z","checksum":"c62257a7bff0c5f39e1abffc6bfcca5c","relation":"main_file","file_id":"5252"},{"content_type":"application/x-tex","file_size":215899,"creator":"dernst","file_name":"2017_thesis_Jesse_source.tex","access_level":"closed","date_updated":"2020-07-14T12:48:10Z","date_created":"2019-04-05T08:51:59Z","checksum":"fc87d7d72fce52824a3ae7dcad0413a8","relation":"source_file","file_id":"6212"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"820","title":"The lac operon in the wild","ddc":["576","577","579"],"status":"public","abstract":[{"text":"The lac operon is a classic model system for bacterial gene regulation, and has been studied extensively in E. coli, a classic model organism. However, not much is known about E. coli’s ecology and life outside the laboratory, in particular in soil and water environments. The natural diversity of the lac operon outside the laboratory, its role in the ecology of E. coli and the selection pressures it is exposed to, are similarly unknown.\r\nIn Chapter Two of this thesis, I explore the genetic diversity, phylogenetic history and signatures of selection of the lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia. I found that complete lac operons were present in all isolates examined, which in all but one case were functional. The lac operon phylogeny conformed to the whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal gene transfer as an explanation for the presence of functional lac operons in these clades. All lac operon genes showed a signature of purifying selection; this signature was strongest for the lacY gene. Lac operon genes of human and environmental isolates showed similar signatures of selection, except the lacZ gene, which showed a stronger signature of selection in environmental isolates.\r\nIn Chapter Three, I try to identify the natural genetic variation relevant for phenotype and fitness in the lac operon, comparing growth rate on lactose and LacZ activity of the lac operons of these wild isolates in a common genetic background. Sequence variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase binding motif, predicted variation in LacZ activity at full induction, using a thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation in LacZ activity, nor RNA polymerase binding predicted by the model correlated with variation in growth rate. Lac operons of human and environmental isolates did not differ systematically in either growth rate on lactose or LacZ protein activity, suggesting that these lac operons have been exposed to similar selection pressures. We thus have no evidence that the phenotypic variation we measured is relevant for fitness.\r\nTo start assessing the effect of genomic background on the growth phenotype conferred by the lac operon, I compared growth on minimal medium with lactose between lac operon constructs and the corresponding original isolates, I found that maximal growth rate was determined by genomic background, with almost all backgrounds conferring higher growth rates than lab strain K12 MG1655. However, I found no evidence that the lactose concentration at which growth was half maximal depended on genomic background.","lang":"eng"}],"type":"dissertation","alternative_title":["ISTA Thesis"],"date_published":"2017-08-25T00:00:00Z","citation":{"ama":"Jesse F. The lac operon in the wild. 2017. doi:10.15479/AT:ISTA:th_857","apa":"Jesse, F. (2017). The lac operon in the wild. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_857","ieee":"F. Jesse, “The lac operon in the wild,” Institute of Science and Technology Austria, 2017.","ista":"Jesse F. 2017. The lac operon in the wild. Institute of Science and Technology Austria.","short":"F. Jesse, The Lac Operon in the Wild, Institute of Science and Technology Austria, 2017.","mla":"Jesse, Fabienne. The Lac Operon in the Wild. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_857.","chicago":"Jesse, Fabienne. “The Lac Operon in the Wild.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_857."},"page":"87","day":"25","has_accepted_license":"1","article_processing_charge":"No"},{"publication_identifier":{"issn":["2663-337X"]},"month":"06","oa":1,"doi":"10.15479/AT:ISTA:th_828","language":[{"iso":"eng"}],"degree_awarded":"PhD","publist_id":"6810","file_date_updated":"2020-07-14T12:48:12Z","year":"2017","department":[{"_id":"KrPi"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"id":"2082","relation":"part_of_dissertation","status":"public"},{"id":"6196","relation":"part_of_dissertation","status":"public"}]},"author":[{"id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","first_name":"Michal","last_name":"Rybar","full_name":"Rybar, Michal"}],"date_created":"2018-12-11T11:48:46Z","date_updated":"2023-09-07T12:02:28Z","article_processing_charge":"No","has_accepted_license":"1","day":"26","citation":{"short":"M. Rybar, (The Exact Security of) Message Authentication Codes, Institute of Science and Technology Austria, 2017.","mla":"Rybar, Michal. (The Exact Security of) Message Authentication Codes. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828.","chicago":"Rybar, Michal. “(The Exact Security of) Message Authentication Codes.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_828.","ama":"Rybar M. (The exact security of) Message authentication codes. 2017. doi:10.15479/AT:ISTA:th_828","apa":"Rybar, M. (2017). (The exact security of) Message authentication codes. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_828","ieee":"M. Rybar, “(The exact security of) Message authentication codes,” Institute of Science and Technology Austria, 2017.","ista":"Rybar M. 2017. (The exact security of) Message authentication codes. Institute of Science and Technology Austria."},"page":"86","date_published":"2017-06-26T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"In this thesis we discuss the exact security of message authentications codes HMAC , NMAC , and PMAC . NMAC is a mode of operation which turns a fixed input-length keyed hash function f into a variable input-length function. A practical single-key variant of NMAC called HMAC is a very popular and widely deployed message authentication code (MAC). PMAC is a block-cipher based mode of operation, which also happens to be the most famous fully parallel MAC. NMAC was introduced by Bellare, Canetti and Krawczyk Crypto’96, who proved it to be a secure pseudorandom function (PRF), and thus also a MAC, under two assumptions. Unfortunately, for many instantiations of HMAC one of them has been found to be wrong. To restore the provable guarantees for NMAC , Bellare [Crypto’06] showed its security without this assumption. PMAC was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a pseudorandom permutation over n -bit strings, PMAC constitutes a provably secure variable input-length PRF. For adversaries making q queries, each of length at most ` (in n -bit blocks), and of total length σ ≤ q` , the original paper proves an upper bound on the distinguishing advantage of O ( σ 2 / 2 n ), while the currently best bound is O ( qσ/ 2 n ). In this work we show that this bound is tight by giving an attack with advantage Ω( q 2 `/ 2 n ). In the PMAC construction one initially XORs a mask to every message block, where the mask for the i th block is computed as τ i := γ i · L , where L is a (secret) random value, and γ i is the i -th codeword of the Gray code. Our attack applies more generally to any sequence of γ i ’s which contains a large coset of a subgroup of GF (2 n ). As for NMAC , our first contribution is a simpler and uniform proof: If f is an ε -secure PRF (against q queries) and a δ - non-adaptively secure PRF (against q queries), then NMAC f is an ( ε + `qδ )-secure PRF against q queries of length at most ` blocks each. We also show that this ε + `qδ bound is basically tight by constructing an f for which an attack with advantage `qδ exists. Moreover, we analyze the PRF-security of a modification of NMAC called NI by An and Bellare that avoids the constant rekeying on multi-block messages in NMAC and allows for an information-theoretic analysis. We carry out such an analysis, obtaining a tight `q 2 / 2 c bound for this step, improving over the trivial bound of ` 2 q 2 / 2 c . Finally, we investigate, if the security of PMAC can be further improved by using τ i ’s that are k -wise independent, for k > 1 (the original has k = 1). We observe that the security of PMAC will not increase in general if k = 2, and then prove that the security increases to O ( q 2 / 2 n ), if the k = 4. Due to simple extension attacks, this is the best bound one can hope for, using any distribution on the masks. Whether k = 3 is already sufficient to get this level of security is left as an open problem. Keywords: Message authentication codes, Pseudorandom functions, HMAC, PMAC. "}],"_id":"838","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","ddc":["000"],"status":"public","title":"(The exact security of) Message authentication codes","pubrep_id":"828","oa_version":"Published Version","file":[{"checksum":"ff8639ec4bded6186f44c7bd3ee26804","date_created":"2018-12-12T10:10:13Z","date_updated":"2020-07-14T12:48:12Z","file_id":"4799","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":847400,"access_level":"open_access","file_name":"IST-2017-828-v1+3_2017_Rybar_thesis.pdf"},{"file_id":"6202","relation":"source_file","checksum":"3462101745ce8ad199c2d0f75dae4a7e","date_updated":"2020-07-14T12:48:12Z","date_created":"2019-04-05T08:24:11Z","access_level":"closed","file_name":"2017_Thesis_Rybar_source.zip","creator":"dernst","content_type":"application/zip","file_size":26054879}]},{"day":"03","has_accepted_license":"1","page":"145-161","publication":"IACR Transactions on Symmetric Cryptology","citation":{"ieee":"P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum, pp. 145–161, 2017.","apa":"Gazi, P., Pietrzak, K. Z., & Rybar, M. (2017). The exact security of PMAC. IACR Transactions on Symmetric Cryptology. Ruhr University Bochum. https://doi.org/10.13154/TOSC.V2016.I2.145-161","ista":"Gazi P, Pietrzak KZ, Rybar M. 2017. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2016(2), 145–161.","ama":"Gazi P, Pietrzak KZ, Rybar M. The exact security of PMAC. IACR Transactions on Symmetric Cryptology. 2017;2016(2):145-161. doi:10.13154/TOSC.V2016.I2.145-161","chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology. Ruhr University Bochum, 2017. https://doi.org/10.13154/TOSC.V2016.I2.145-161.","short":"P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161.","mla":"Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161."},"date_published":"2017-02-03T00:00:00Z","type":"journal_article","abstract":[{"text":"PMAC is a simple and parallel block-cipher mode of operation, which was introduced by Black and Rogaway at Eurocrypt 2002. If instantiated with a (pseudo)random permutation over n-bit strings, PMAC constitutes a provably secure variable input-length (pseudo)random function. For adversaries making q queries, each of length at most l (in n-bit blocks), and of total length σ ≤ ql, the original paper proves an upper bound on the distinguishing advantage of Ο(σ2/2n), while the currently best bound is Ο (qσ/2n).In this work we show that this bound is tight by giving an attack with advantage Ω (q2l/2n). In the PMAC construction one initially XORs a mask to every message block, where the mask for the ith block is computed as τi := γi·L, where L is a (secret) random value, and γi is the i-th codeword of the Gray code. Our attack applies more generally to any sequence of γi’s which contains a large coset of a subgroup of GF(2n). We then investigate if the security of PMAC can be further improved by using τi’s that are k-wise independent, for k > 1 (the original distribution is only 1-wise independent). We observe that the security of PMAC will not increase in general, even if the masks are chosen from a 2-wise independent distribution, and then prove that the security increases to O(q<2/2n), if the τi are 4-wise independent. Due to simple extension attacks, this is the best bound one can hope for, using any distribution on the masks. Whether 3-wise independence is already sufficient to get this level of security is left as an open problem.","lang":"eng"}],"issue":"2","ddc":["000"],"status":"public","title":"The exact security of PMAC","intvolume":" 2016","_id":"6196","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file":[{"date_created":"2019-04-04T13:53:58Z","date_updated":"2020-07-14T12:47:24Z","checksum":"f23161d685dd957ae8d7274132999684","file_id":"6197","relation":"main_file","creator":"dernst","file_size":597335,"content_type":"application/pdf","file_name":"2017_IACR_Gazi.pdf","access_level":"open_access"}],"oa_version":"Published Version","month":"02","publication_identifier":{"eissn":["2519-173X"]},"quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.13154/TOSC.V2016.I2.145-161","file_date_updated":"2020-07-14T12:47:24Z","ec_funded":1,"publication_status":"published","publisher":"Ruhr University Bochum","department":[{"_id":"KrPi"}],"year":"2017","date_updated":"2023-09-07T12:02:27Z","date_created":"2019-04-04T13:48:23Z","volume":2016,"author":[{"first_name":"Peter","last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","full_name":"Gazi, Peter"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87","last_name":"Rybar","first_name":"Michal","full_name":"Rybar, Michal"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"838"}]}},{"type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"The hippocampus is a key brain region for memory and notably for spatial memory, and is needed for both spatial working and reference memories. Hippocampal place cells selectively discharge in specific locations of the environment to form mnemonic represen tations of space. Several behavioral protocols have been designed to test spatial memory which requires the experimental subject to utilize working memory and reference memory. However, less is known about how these memory traces are presented in the hippo campus, especially considering tasks that require both spatial working and long -term reference memory demand. The aim of my thesis was to elucidate how spatial working memory, reference memory, and the combination of both are represented in the hippocampus. In this thesis, using a radial eight -arm maze, I examined how the combined demand on these memories influenced place cell assemblies while reference memories were partially updated by changing some of the reward- arms. This was contrasted with task varian ts requiring working or reference memories only. Reference memory update led to gradual place field shifts towards the rewards on the switched arms. Cells developed enhanced firing in passes between newly -rewarded arms as compared to those containing an unchanged reward. The working memory task did not show such gradual changes. Place assemblies on occasions replayed trajectories of the maze; at decision points the next arm choice was preferentially replayed in tasks needing reference memory while in the pure working memory task the previously visited arm was replayed. Hence trajectory replay only reflected the decision of the animal in tasks needing reference memory update. At the reward locations, in all three tasks outbound trajectories of the current arm were preferentially replayed, showing the animals’ next path to the center. At reward locations trajectories were replayed preferentially in reverse temporal order. Moreover, in the center reverse replay was seen in the working memory task but in the other tasks forward replay was seen. Hence, the direction of reactivation was determined by the goal locations so that part of the trajectory which was closer to the goal was reactivated later in an HSE while places further away from the goal were reactivated earlier. Altogether my work demonstrated that reference memory update triggers several levels of reorganization of the hippocampal cognitive map which are not seen in simpler working memory demand s. Moreover, hippocampus is likely to be involved in spatial decisions through reactivating planned trajectories when reference memory recall is required for such a decision. "}],"_id":"837","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["571"],"title":"Reactivation of the hippocampal cognitive map in goal-directed spatial tasks","pubrep_id":"858","file":[{"access_level":"closed","file_name":"2017_Xu_Haibing_Thesis_Source.docx","creator":"dernst","file_size":3589490,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_id":"6213","relation":"source_file","checksum":"f11925fbbce31e495124b6bc4f10573c","date_created":"2019-04-05T08:59:51Z","date_updated":"2020-07-14T12:48:12Z"},{"access_level":"open_access","file_name":"2017_Xu_Thesis_IST.pdf","creator":"dernst","file_size":11668613,"content_type":"application/pdf","file_id":"6214","relation":"main_file","checksum":"ffb10749a537d615fab1ef0937ccb157","date_created":"2019-04-05T08:59:51Z","date_updated":"2020-07-14T12:48:12Z"}],"oa_version":"Published Version","has_accepted_license":"1","article_processing_charge":"No","day":"23","citation":{"chicago":"Xu, Haibing. “Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_858.","short":"H. Xu, Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks, Institute of Science and Technology Austria, 2017.","mla":"Xu, Haibing. Reactivation of the Hippocampal Cognitive Map in Goal-Directed Spatial Tasks. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_858.","apa":"Xu, H. (2017). Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_858","ieee":"H. Xu, “Reactivation of the hippocampal cognitive map in goal-directed spatial tasks,” Institute of Science and Technology Austria, 2017.","ista":"Xu H. 2017. Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. Institute of Science and Technology Austria.","ama":"Xu H. Reactivation of the hippocampal cognitive map in goal-directed spatial tasks. 2017. doi:10.15479/AT:ISTA:th_858"},"page":"93","date_published":"2017-08-23T00:00:00Z","publist_id":"6811","file_date_updated":"2020-07-14T12:48:12Z","acknowledgement":"I am very grateful for the opportunity I have had as a graduate student to explore and incredibly interesting branch of neuroscience, and for the people who made it possible. Firstly, I would like to offer my thanks to my supervisor Professor Jozsef Csicsvari for his great support, guidance and patience offered over the years. The door to his office was always open whenever I had questions. I have learned a lot from him about carefully designing experiments, asking interesting questions and how to integrate results into a broader picture. I also express my gratitude to the remarkable post- doc , Dr. Joseph O’Neill. He is a gre at scientific role model who is always willing to teach , and advice and talk through problems with his full attention. Many thanks to my wonderful “office mates” over the years and their support and encouragement, Alice Avernhe, Philipp Schönenberger, Desiree Dickerson, Karel Blahna, Charlotte Boccara, Igor Gridchyn, Peter Baracskay, Krisztián Kovács, Dámaris Rangel, Karola Käfer and Federico Stella. They were the ones in the lab for the many useful discussions about science and for making the laboratory such a nice and friendly place to work in. A special thank goes to Michael LoBianco and Jago Wallenschus for wonderful technical support. I would also like to thank Professor Peter Jonas and Professor David M Bannerman for being my qualifying exam and thesi s committee members despite their busy schedule. I am also very thankful to IST Austria for their support all throughout my PhD. ","year":"2017","department":[{"_id":"JoCs"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"5828"}]},"author":[{"full_name":"Xu, Haibing","first_name":"Haibing","last_name":"Xu","id":"310349D0-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-09-07T12:06:38Z","date_created":"2018-12-11T11:48:46Z","publication_identifier":{"issn":["2663-337X"]},"month":"08","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"doi":"10.15479/AT:ISTA:th_858","language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L"}]},{"oa":1,"language":[{"iso":"eng"}],"degree_awarded":"PhD","supervisor":[{"full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří"}],"doi":"10.15479/AT:ISTA:th_842","publication_identifier":{"issn":["2663-337X"]},"month":"06","department":[{"_id":"JiFr"}],"publisher":"Institute of Science and Technology Austria","publication_status":"published","year":"2017","date_updated":"2023-09-07T12:06:09Z","date_created":"2018-12-11T11:49:18Z","related_material":{"record":[{"id":"1591","status":"public","relation":"part_of_dissertation"}]},"author":[{"last_name":"Adamowski","first_name":"Maciek","orcid":"0000-0001-6463-5257","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","full_name":"Adamowski, Maciek"}],"publist_id":"6483","file_date_updated":"2020-07-14T12:48:15Z","page":"117","citation":{"ista":"Adamowski M. 2017. Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . Institute of Science and Technology Austria.","ieee":"M. Adamowski, “Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana ,” Institute of Science and Technology Austria, 2017.","apa":"Adamowski, M. (2017). Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_842","ama":"Adamowski M. Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana . 2017. doi:10.15479/AT:ISTA:th_842","chicago":"Adamowski, Maciek. “Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana .” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_842.","mla":"Adamowski, Maciek. Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana . Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_842.","short":"M. Adamowski, Investigations into Cell Polarity and Trafficking in the Plant Model Arabidopsis Thaliana , Institute of Science and Technology Austria, 2017."},"date_published":"2017-06-02T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No","day":"02","ddc":["581","583","580"],"status":"public","title":"Investigations into cell polarity and trafficking in the plant model Arabidopsis thaliana ","_id":"938","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","file":[{"date_created":"2019-04-05T09:03:20Z","date_updated":"2020-07-14T12:48:15Z","checksum":"193425764d9aaaed3ac57062a867b315","relation":"source_file","file_id":"6215","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":46903863,"creator":"dernst","file_name":"2017_Adamowski-Thesis_Source.docx","access_level":"closed"},{"file_size":8698888,"content_type":"application/pdf","creator":"dernst","file_name":"2017_Adamowski-Thesis.pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:15Z","date_created":"2019-04-05T09:03:19Z","checksum":"df5ab01be81f821e1b958596a1ec8d21","relation":"main_file","file_id":"6216"}],"pubrep_id":"842","alternative_title":["ISTA Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"The thesis encompasses several topics of plant cell biology which were studied in the model plant Arabidopsis thaliana. Chapter 1 concerns the plant hormone auxin and its polar transport through cells and tissues. The highly controlled, directional transport of auxin is facilitated by plasma membrane-localized transporters. Transporters from the PIN family direct auxin transport due to their polarized localizations at cell membranes. Substantial effort has been put into research on cellular trafficking of PIN proteins, which is thought to underlie their polar distribution. I participated in a forward genetic screen aimed at identifying novel regulators of PIN polarity. The screen yielded several genes which may be involved in PIN polarity regulation or participate in polar auxin transport by other means. Chapter 2 focuses on the endomembrane system, with particular attention to clathrin-mediated endocytosis. The project started with identification of several proteins that interact with clathrin light chains. Among them, I focused on two putative homologues of auxilin, which in non-plant systems is an endocytotic factor known for uncoating clathrin-coated vesicles in the final step of endocytosis. The body of my work consisted of an in-depth characterization of transgenic A. thaliana lines overexpressing these putative auxilins in an inducible manner. Overexpression of these proteins leads to an inhibition of endocytosis, as documented by imaging of cargoes and clathrin-related endocytic machinery. An extension of this work is an investigation into a concept of homeostatic regulation acting between distinct transport processes in the endomembrane system. With auxilin overexpressing lines, where endocytosis is blocked specifically, I made observations on the mutual relationship between two opposite trafficking processes of secretion and endocytosis. In Chapter 3, I analyze cortical microtubule arrays and their relationship to auxin signaling and polarized growth in elongating cells. In plants, microtubules are organized into arrays just below the plasma membrane, and it is thought that their function is to guide membrane-docked cellulose synthase complexes. These, in turn, influence cell wall structure and cell shape by directed deposition of cellulose fibres. In elongating cells, cortical microtubule arrays are able to reorient in relation to long cell axis, and these reorientations have been linked to cell growth and to signaling of growth-regulating factors such as auxin or light. In this chapter, I am addressing the causal relationship between microtubule array reorientation, growth, and auxin signaling. I arrive at a model where array reorientation is not guided by auxin directly, but instead is only controlled by growth, which, in turn, is regulated by auxin."}]},{"month":"05","publication_identifier":{"issn":["2663-337X"]},"oa":1,"project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"doi":"10.15479/AT:ISTA:th_815","degree_awarded":"PhD","supervisor":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:48:18Z","ec_funded":1,"publist_id":"6407","year":"2017","acknowledgement":"FP7/2007-2013/ERC grant agreement no 616160","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Institute of Science and Technology Austria","author":[{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"date_created":"2018-12-11T11:49:35Z","date_updated":"2023-09-07T12:05:41Z","day":"01","has_accepted_license":"1","article_processing_charge":"No","citation":{"chicago":"Rolinek, Michal. “Complexity of Constraint Satisfaction.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.","short":"M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.","mla":"Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.","apa":"Rolinek, M. (2017). Complexity of constraint satisfaction. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815","ieee":"M. Rolinek, “Complexity of constraint satisfaction,” Institute of Science and Technology Austria, 2017.","ista":"Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.","ama":"Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815"},"page":"97","date_published":"2017-05-01T00:00:00Z","type":"dissertation","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"An instance of the Constraint Satisfaction Problem (CSP) is given by a finite set of\r\nvariables, a finite domain of labels, and a set of constraints, each constraint acting on\r\na subset of the variables. The goal is to find an assignment of labels to its variables\r\nthat satisfies all constraints (or decide whether one exists). If we allow more general\r\n“soft” constraints, which come with (possibly infinite) costs of particular assignments,\r\nwe obtain instances from a richer class called Valued Constraint Satisfaction Problem\r\n(VCSP). There the goal is to find an assignment with minimum total cost.\r\nIn this thesis, we focus (assuming that P\r\n6\r\n=\r\nNP) on classifying computational com-\r\nplexity of CSPs and VCSPs under certain restricting conditions. Two results are the core\r\ncontent of the work. In one of them, we consider VCSPs parametrized by a constraint\r\nlanguage, that is the set of “soft” constraints allowed to form the instances, and finish\r\nthe complexity classification modulo (missing pieces of) complexity classification for\r\nanalogously parametrized CSP. The other result is a generalization of Edmonds’ perfect\r\nmatching algorithm. This generalization contributes to complexity classfications in two\r\nways. First, it gives a new (largest known) polynomial-time solvable class of Boolean\r\nCSPs in which every variable may appear in at most two constraints and second, it\r\nsettles full classification of Boolean CSPs with planar drawing (again parametrized by a\r\nconstraint language)."}],"_id":"992","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","ddc":["004"],"title":"Complexity of constraint satisfaction","pubrep_id":"815","oa_version":"Published Version","file":[{"file_id":"4654","relation":"main_file","checksum":"81761fb939acb7585c36629f765b4373","date_created":"2018-12-12T10:07:55Z","date_updated":"2020-07-14T12:48:18Z","access_level":"open_access","file_name":"IST-2017-815-v1+3_final_blank_signature_maybe_pdfa.pdf","creator":"system","file_size":786145,"content_type":"application/pdf"},{"file_size":5936337,"content_type":"application/zip","creator":"dernst","access_level":"closed","file_name":"2017_Thesis_Rolinek_source.zip","checksum":"2b2d7e1d6c1c79a9795a7aa0f860baf3","date_created":"2019-04-05T08:43:24Z","date_updated":"2020-07-14T12:48:18Z","relation":"source_file","file_id":"6208"}]},{"citation":{"apa":"Edelsbrunner, H., Nikitenko, A., & Reitzner, M. (2017). Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. Cambridge University Press. https://doi.org/10.1017/apr.2017.20","ieee":"H. Edelsbrunner, A. Nikitenko, and M. Reitzner, “Expected sizes of poisson Delaunay mosaics and their discrete Morse functions,” Advances in Applied Probability, vol. 49, no. 3. Cambridge University Press, pp. 745–767, 2017.","ista":"Edelsbrunner H, Nikitenko A, Reitzner M. 2017. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 49(3), 745–767.","ama":"Edelsbrunner H, Nikitenko A, Reitzner M. Expected sizes of poisson Delaunay mosaics and their discrete Morse functions. Advances in Applied Probability. 2017;49(3):745-767. doi:10.1017/apr.2017.20","chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Matthias Reitzner. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability. Cambridge University Press, 2017. https://doi.org/10.1017/apr.2017.20.","short":"H. Edelsbrunner, A. Nikitenko, M. Reitzner, Advances in Applied Probability 49 (2017) 745–767.","mla":"Edelsbrunner, Herbert, et al. “Expected Sizes of Poisson Delaunay Mosaics and Their Discrete Morse Functions.” Advances in Applied Probability, vol. 49, no. 3, Cambridge University Press, 2017, pp. 745–67, doi:10.1017/apr.2017.20."},"publication":"Advances in Applied Probability","page":"745 - 767","date_published":"2017-09-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"718","intvolume":" 49","status":"public","title":"Expected sizes of poisson Delaunay mosaics and their discrete Morse functions","oa_version":"Preprint","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from a Poisson point process in ℝ n , we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and nonsingular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we obtain the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions n ≤ 4."}],"main_file_link":[{"url":"https://arxiv.org/abs/1607.05915","open_access":"1"}],"external_id":{"arxiv":["1607.05915"]},"oa":1,"project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","doi":"10.1017/apr.2017.20","language":[{"iso":"eng"}],"publication_identifier":{"issn":["00018678"]},"month":"09","year":"2017","department":[{"_id":"HeEd"}],"publisher":"Cambridge University Press","publication_status":"published","related_material":{"record":[{"id":"6287","relation":"dissertation_contains","status":"public"}]},"author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Nikitenko, Anton","first_name":"Anton","last_name":"Nikitenko","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201"},{"full_name":"Reitzner, Matthias","last_name":"Reitzner","first_name":"Matthias"}],"volume":49,"date_updated":"2023-09-07T12:07:12Z","date_created":"2018-12-11T11:48:07Z","ec_funded":1,"publist_id":"6962"},{"scopus_import":1,"day":"18","citation":{"mla":"Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13.","short":"H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.","chicago":"Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13.","ama":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. In: Vol 10625. Springer; 2017:357-379. doi:10.1007/978-3-319-70697-9_13","ista":"Abusalah HM, Alwen JF, Cohen B, Khilko D, Pietrzak KZ, Reyzin L. 2017. Beyond Hellman’s time-memory trade-offs with applications to proofs of space. ASIACRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 10625, 357–379.","apa":"Abusalah, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., & Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer. https://doi.org/10.1007/978-3-319-70697-9_13","ieee":"H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379."},"page":"357 - 379","date_published":"2017-11-18T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don’t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size N can be inverted in time T by an algorithm that is given S bits of auxiliary information whenever (Formula presented). For functions Hellman gives a weaker attack with S2· T≈ N2 (e.g., S= T≈ N2/3). To prove lower bounds, one considers an adversary who has access to an oracle f: [ N] → [N] and can make T oracle queries. The best known lower bound is S· T∈ Ω(N) and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant k we construct a function [N] → [N] that cannot be inverted unless Sk· T∈ Ω(Nk) (in particular, S= T≈ (Formula presented). Our construction does not contradict Hellman’s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in N, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle g: [N] × [N] → [ N] and a random permutation oracle f: [N] → N] and is defined as h(x) = g(x, x′) where f(x) = π(f(x′)) with π being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets S bits of auxiliary information, makes at most T oracle queries, and inverts h on an ϵ fraction of outputs must satisfy S2· T∈ Ω(ϵ2N2)."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"559","title":"Beyond Hellman’s time-memory trade-offs with applications to proofs of space","status":"public","intvolume":" 10625","oa_version":"Submitted Version","month":"11","publication_identifier":{"isbn":["978-331970696-2"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/893.pdf"}],"quality_controlled":"1","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"conference":{"location":"Hong Kong, China","start_date":"2017-12-03","end_date":"2017-12-07","name":"ASIACRYPT: Theory and Applications of Cryptology and Information Security"},"doi":"10.1007/978-3-319-70697-9_13","language":[{"iso":"eng"}],"publist_id":"7257","ec_funded":1,"year":"2017","publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","author":[{"last_name":"Abusalah","first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","full_name":"Abusalah, Hamza M"},{"full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cohen, Bram","last_name":"Cohen","first_name":"Bram"},{"first_name":"Danylo","last_name":"Khilko","full_name":"Khilko, Danylo"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"full_name":"Reyzin, Leonid","first_name":"Leonid","last_name":"Reyzin"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"83"}]},"date_updated":"2023-09-07T12:30:22Z","date_created":"2018-12-11T11:47:10Z","volume":10625},{"year":"2017","publication_status":"published","department":[{"_id":"LaEr"}],"publisher":"Institute of Mathematical Statistics","author":[{"last_name":"Alt","first_name":"Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","full_name":"Alt, Johannes"}],"related_material":{"record":[{"id":"149","status":"public","relation":"dissertation_contains"}]},"date_updated":"2023-09-07T12:38:08Z","date_created":"2018-12-11T11:47:07Z","volume":22,"article_number":"63","file_date_updated":"2020-07-14T12:47:00Z","ec_funded":1,"publist_id":"7265","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"grant_number":"338804","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"doi":"10.1214/17-ECP97","language":[{"iso":"eng"}],"month":"11","publication_identifier":{"issn":["1083589X"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"550","title":"Singularities of the density of states of random Gram matrices","ddc":["539"],"status":"public","intvolume":" 22","pubrep_id":"926","oa_version":"Published Version","file":[{"file_name":"IST-2018-926-v1+1_euclid.ecp.1511233247.pdf","access_level":"open_access","content_type":"application/pdf","file_size":470876,"creator":"system","relation":"main_file","file_id":"4663","date_updated":"2020-07-14T12:47:00Z","date_created":"2018-12-12T10:08:04Z","checksum":"0ec05303a0de190de145654237984c79"}],"type":"journal_article","abstract":[{"lang":"eng","text":"For large random matrices X with independent, centered entries but not necessarily identical variances, the eigenvalue density of XX* is well-approximated by a deterministic measure on ℝ. We show that the density of this measure has only square and cubic-root singularities away from zero. We also extend the bulk local law in [5] to the vicinity of these singularities."}],"publication":"Electronic Communications in Probability","citation":{"chicago":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2017. https://doi.org/10.1214/17-ECP97.","short":"J. Alt, Electronic Communications in Probability 22 (2017).","mla":"Alt, Johannes. “Singularities of the Density of States of Random Gram Matrices.” Electronic Communications in Probability, vol. 22, 63, Institute of Mathematical Statistics, 2017, doi:10.1214/17-ECP97.","apa":"Alt, J. (2017). Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/17-ECP97","ieee":"J. Alt, “Singularities of the density of states of random Gram matrices,” Electronic Communications in Probability, vol. 22. Institute of Mathematical Statistics, 2017.","ista":"Alt J. 2017. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 22, 63.","ama":"Alt J. Singularities of the density of states of random Gram matrices. Electronic Communications in Probability. 2017;22. doi:10.1214/17-ECP97"},"date_published":"2017-11-21T00:00:00Z","scopus_import":1,"day":"21","has_accepted_license":"1"},{"publication_identifier":{"isbn":["978-331965764-6"]},"month":"09","oa":1,"project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"quality_controlled":"1","doi":"10.1007/978-3-319-65765-3_7","conference":{"name":"FORMATS: Formal Modelling and Analysis of Timed Systems","end_date":"2017-09-07","start_date":"2017-09-05","location":"Berlin, Germany"},"language":[{"iso":"eng"}],"publist_id":"7129","file_date_updated":"2020-07-14T12:47:31Z","year":"2017","publisher":"Springer","department":[{"_id":"ToHe"}],"publication_status":"published","related_material":{"record":[{"id":"6894","relation":"dissertation_contains","status":"public"}]},"author":[{"full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy"},{"full_name":"Giacobbe, Mirco","first_name":"Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8180-0904"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Kong, Hui","first_name":"Hui","last_name":"Kong","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3066-6941"}],"volume":"10419 ","date_created":"2018-12-11T11:47:41Z","date_updated":"2023-09-07T12:53:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","citation":{"ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:10.1007/978-3-319-65765-3_7","ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132.","ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., & Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. https://doi.org/10.1007/978-3-319-65765-3_7","mla":"Bogomolov, Sergiy, et al. Conic Abstractions for Hybrid Systems. Vol. 10419, Springer, 2017, pp. 116–32, doi:10.1007/978-3-319-65765-3_7.","short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132.","chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. https://doi.org/10.1007/978-3-319-65765-3_7."},"page":"116 - 132","date_published":"2017-09-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems.","lang":"eng"}],"_id":"647","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Conic abstractions for hybrid systems","ddc":["005"],"pubrep_id":"831","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IST-2017-831-v1+1_main.pdf","creator":"system","file_size":3806864,"content_type":"application/pdf","file_id":"4956","relation":"main_file","checksum":"faf546914ba29bcf9974ee36b6b16750","date_created":"2018-12-12T10:12:38Z","date_updated":"2020-07-14T12:47:31Z"}]}]