[{"month":"01","oa_version":"None","quality_controlled":"1","status":"public","_id":"638","publist_id":"7150","publisher":"Springer","volume":10152,"date_created":"2018-12-11T11:47:38Z","abstract":[{"lang":"eng","text":"This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.\r\nThe NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability."}],"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"doi":"10.1007/978-3-319-54292-8","intvolume":"     10152","citation":{"chicago":"Bogomolov, Sergiy, Matthieu Martel, and Pavithra Prabhakar, eds. <i>Numerical Software Verification</i>. Vol. 10152. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>.","short":"S. Bogomolov, M. Martel, P. Prabhakar, eds., Numerical Software Verification, Springer, 2017.","mla":"Bogomolov, Sergiy, et al., editors. <i>Numerical Software Verification</i>. Vol. 10152, Springer, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>.","ieee":"S. Bogomolov, M. Martel, and P. Prabhakar, Eds., <i>Numerical Software Verification</i>, vol. 10152. Springer, 2017.","ista":"Bogomolov S, Martel M, Prabhakar P eds. 2017. Numerical Software Verification, Springer,p.","ama":"Bogomolov S, Martel M, Prabhakar P, eds. <i>Numerical Software Verification</i>. Vol 10152. Springer; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-54292-8\">10.1007/978-3-319-54292-8</a>","apa":"Bogomolov, S., Martel, M., &#38; Prabhakar, P. (Eds.). (2017). <i>Numerical Software Verification</i> (Vol. 10152). Presented at the NSV: Numerical Software Verification, Toronto, ON, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-54292-8\">https://doi.org/10.1007/978-3-319-54292-8</a>"},"language":[{"iso":"eng"}],"publication_status":"published","year":"2017","article_processing_charge":"No","title":"Numerical Software Verification","date_published":"2017-01-01T00:00:00Z","date_updated":"2026-03-31T12:28:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"first_name":"Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Martel","first_name":"Matthieu","full_name":"Martel, Matthieu"},{"first_name":"Pavithra","last_name":"Prabhakar","full_name":"Prabhakar, Pavithra"}],"day":"01","publication_identifier":{"eisbn":["978-3-319-54292-8"],"issn":["0302-9743"]},"conference":{"end_date":"2016-07-18","location":"Toronto, ON, Canada","name":"NSV: Numerical Software Verification","start_date":"2016-07-17"},"type":"conference_editor"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2017-04-01T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2017","type":"conference","isi":1,"ec_funded":1,"oa":1,"editor":[{"first_name":"Jean-Sébastien","last_name":"Coron","full_name":"Coron, Jean-Sébastien"},{"full_name":"Buus Nielsen, Jesper","first_name":"Jesper","last_name":"Buus Nielsen"}],"page":"3 - 32","corr_author":"1","month":"04","status":"public","language":[{"iso":"eng"}],"intvolume":"     10212","date_created":"2018-12-11T11:47:39Z","abstract":[{"lang":"eng","text":"Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions."}],"alternative_title":["LNCS"],"publisher":"Springer","title":"Depth-robust graphs and their cumulative memory complexity","date_updated":"2025-09-11T07:21:36Z","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","first_name":"Joel F","last_name":"Alwen"},{"full_name":"Blocki, Jeremiah","last_name":"Blocki","first_name":"Jeremiah"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"conference":{"end_date":"2017-05-04","start_date":"2017-04-30","location":"Paris, France","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"external_id":{"isi":["000419175900001"]},"day":"01","publication_identifier":{"isbn":["978-331956616-0"]},"_id":"640","publist_id":"7148","quality_controlled":"1","oa_version":"Submitted Version","main_file_link":[{"url":"https://eprint.iacr.org/2016/875","open_access":"1"}],"project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"doi":"10.1007/978-3-319-56617-7_1","citation":{"apa":"Alwen, J. F., Blocki, J., &#38; Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron &#38; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">https://doi.org/10.1007/978-3-319-56617-7_1</a>","ama":"Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">10.1007/978-3-319-56617-7_1</a>","ista":"Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32.","ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.","mla":"Alwen, Joel F., et al. <i>Depth-Robust Graphs and Their Cumulative Memory Complexity</i>. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">10.1007/978-3-319-56617-7_1</a>.","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">https://doi.org/10.1007/978-3-319-56617-7_1</a>."},"scopus_import":"1","department":[{"_id":"KrPi"}],"volume":10212},{"date_published":"2017-01-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","year":"2017","article_processing_charge":"No","isi":1,"type":"conference","editor":[{"last_name":"Lauze","first_name":"François","full_name":"Lauze, François"},{"full_name":"Dong, Yiqiu","first_name":"Yiqiu","last_name":"Dong"},{"full_name":"Bjorholm Dahl, Anders","last_name":"Bjorholm Dahl","first_name":"Anders"}],"page":"323 - 334","month":"01","status":"public","intvolume":"     10302","language":[{"iso":"eng"}],"publisher":"Springer","date_created":"2018-12-11T11:47:39Z","abstract":[{"lang":"eng","text":"We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches."}],"alternative_title":["LNCS"],"title":"Graphical model parameter learning by inverse linear programming","date_updated":"2025-09-11T07:20:56Z","author":[{"full_name":"Trajkovska, Vera","first_name":"Vera","last_name":"Trajkovska"},{"id":"446560C6-F248-11E8-B48F-1D18A9856A87","full_name":"Swoboda, Paul","last_name":"Swoboda","first_name":"Paul"},{"full_name":"Åström, Freddie","first_name":"Freddie","last_name":"Åström"},{"first_name":"Stefanie","last_name":"Petra","full_name":"Petra, Stefanie"}],"external_id":{"isi":["000432210900026"]},"conference":{"end_date":"2017-06-08","name":"SSVM: Scale Space and Variational Methods in Computer Vision","location":"Kolding, Denmark","start_date":"2017-06-04"},"day":"01","publication_identifier":{"isbn":["978-331958770-7"]},"oa_version":"None","quality_controlled":"1","_id":"641","publist_id":"7147","citation":{"ama":"Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">10.1007/978-3-319-58771-4_26</a>","apa":"Trajkovska, V., Swoboda, P., Åström, F., &#38; Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, &#38; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">https://doi.org/10.1007/978-3-319-58771-4_26</a>","ista":"Trajkovska V, Swoboda P, Åström F, Petra S. 2017. Graphical model parameter learning by inverse linear programming. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 323–334.","ieee":"V. Trajkovska, P. Swoboda, F. Åström, and S. Petra, “Graphical model parameter learning by inverse linear programming,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 323–334.","mla":"Trajkovska, Vera, et al. <i>Graphical Model Parameter Learning by Inverse Linear Programming</i>. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">10.1007/978-3-319-58771-4_26</a>.","short":"V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.","chicago":"Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_26\">https://doi.org/10.1007/978-3-319-58771-4_26</a>."},"doi":"10.1007/978-3-319-58771-4_26","volume":10302,"scopus_import":"1","department":[{"_id":"VlKo"}]},{"article_processing_charge":"No","year":"2017","publication_status":"published","date_published":"2017-06-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"285 - 306","oa":1,"isi":1,"type":"journal_article","issue":"2","publication":"Scandinavian Journal of Statistics","status":"public","month":"06","publisher":"Wiley-Blackwell","abstract":[{"lang":"eng","text":"The Ising model is one of the simplest and most famous models of interacting systems. It was originally proposed to model ferromagnetic interactions in statistical physics and is now widely used to model spatial processes in many areas such as ecology, sociology, and genetics, usually without testing its goodness-of-fit. Here, we propose an exact goodness-of-fit test for the finite-lattice Ising model. The theory of Markov bases has been developed in algebraic statistics for exact goodness-of-fit testing using a Monte Carlo approach. However, this beautiful theory has fallen short of its promise for applications, because finding a Markov basis is usually computationally intractable. We develop a Monte Carlo method for exact goodness-of-fit testing for the Ising model which avoids computing a Markov basis and also leads to a better connectivity of the Markov chain and hence to a faster convergence. We show how this method can be applied to analyze the spatial organization of receptors on the cell membrane."}],"date_created":"2018-12-11T11:55:13Z","intvolume":"        44","language":[{"iso":"eng"}],"author":[{"first_name":"Abraham","last_name":"Martin Del Campo Sanchez","full_name":"Martin Del Campo Sanchez, Abraham"},{"last_name":"Cepeda Humerez","first_name":"Sarah A","id":"3DEE19A4-F248-11E8-B48F-1D18A9856A87","full_name":"Cepeda Humerez, Sarah A"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","last_name":"Uhler","first_name":"Caroline"}],"date_updated":"2026-04-08T13:55:45Z","title":"Exact goodness-of-fit testing for the Ising model","arxiv":1,"publication_identifier":{"issn":["03036898"]},"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"6473"}]},"day":"01","external_id":{"arxiv":["1410.1242"],"isi":["000400985000001"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1410.1242"}],"quality_controlled":"1","oa_version":"Preprint","publist_id":"5060","_id":"2016","volume":44,"scopus_import":"1","department":[{"_id":"GaTk"}],"citation":{"apa":"Martin Del Campo Sanchez, A., Cepeda Humerez, S. A., &#38; Uhler, C. (2017). Exact goodness-of-fit testing for the Ising model. <i>Scandinavian Journal of Statistics</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/sjos.12251\">https://doi.org/10.1111/sjos.12251</a>","ama":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. Exact goodness-of-fit testing for the Ising model. <i>Scandinavian Journal of Statistics</i>. 2017;44(2):285-306. doi:<a href=\"https://doi.org/10.1111/sjos.12251\">10.1111/sjos.12251</a>","ista":"Martin Del Campo Sanchez A, Cepeda Humerez SA, Uhler C. 2017. Exact goodness-of-fit testing for the Ising model. Scandinavian Journal of Statistics. 44(2), 285–306.","mla":"Martin Del Campo Sanchez, Abraham, et al. “Exact Goodness-of-Fit Testing for the Ising Model.” <i>Scandinavian Journal of Statistics</i>, vol. 44, no. 2, Wiley-Blackwell, 2017, pp. 285–306, doi:<a href=\"https://doi.org/10.1111/sjos.12251\">10.1111/sjos.12251</a>.","ieee":"A. Martin Del Campo Sanchez, S. A. Cepeda Humerez, and C. Uhler, “Exact goodness-of-fit testing for the Ising model,” <i>Scandinavian Journal of Statistics</i>, vol. 44, no. 2. Wiley-Blackwell, pp. 285–306, 2017.","short":"A. Martin Del Campo Sanchez, S.A. Cepeda Humerez, C. Uhler, Scandinavian Journal of Statistics 44 (2017) 285–306.","chicago":"Martin Del Campo Sanchez, Abraham, Sarah A Cepeda Humerez, and Caroline Uhler. “Exact Goodness-of-Fit Testing for the Ising Model.” <i>Scandinavian Journal of Statistics</i>. Wiley-Blackwell, 2017. <a href=\"https://doi.org/10.1111/sjos.12251\">https://doi.org/10.1111/sjos.12251</a>."},"doi":"10.1111/sjos.12251"},{"date_published":"2017-10-01T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","file":[{"file_size":18569590,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:08:48Z","creator":"system","checksum":"33cfb59674e91f82e3738396d3fb3776","file_name":"IST-2018-916-v1+3_2017_Pleska_Maros_Thesis.pdf","date_updated":"2020-07-14T12:45:24Z","file_id":"4710"},{"file_size":2801649,"access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2019-04-05T08:33:14Z","relation":"source_file","creator":"dernst","file_name":"2017_Pleska_Maros_Thesis.docx","checksum":"dcc239968decb233e7f98cf1083d8c26","date_updated":"2020-07-14T12:45:24Z","file_id":"6204"}],"publication_status":"published","year":"2017","article_processing_charge":"No","oa":1,"type":"dissertation","page":"126","ddc":["576","579"],"status":"public","corr_author":"1","month":"10","degree_awarded":"PhD","supervisor":[{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C"}],"language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"Restriction-modification (RM) represents the simplest and possibly the most widespread mechanism of self/non-self discrimination in nature. In order to provide bacteria with immunity against bacteriophages and other parasitic genetic elements, RM systems rely on a balance between two enzymes: the restriction enzyme, which cleaves non-self DNA at specific restriction sites, and the modification enzyme, which tags the host’s DNA as self and thus protects it from cleavage. In this thesis, I use population and single-cell level experiments in combination with mathematical modeling to study different aspects of the interplay between RM systems, bacteria and bacteriophages. First, I analyze how mutations in phage restriction sites affect the probability of phage escape – an inherently stochastic process, during which phages accidently get modified instead of restricted. Next, I use single-cell experiments to show that RM systems can, with a low probability, attack the genome of their bacterial host and that this primitive form of autoimmunity leads to a tradeoff between the evolutionary cost and benefit of RM systems. Finally, I investigate the nature of interactions between bacteria, RM systems and temperate bacteriophages to find that, as a consequence of phage escape and its impact on population dynamics, RM systems can promote acquisition of symbiotic bacteriophages, rather than limit it. The results presented here uncover new fundamental biological properties of RM systems and highlight their importance in the ecology and evolution of bacteria, bacteriophages and their interactions.","lang":"eng"}],"has_accepted_license":"1","date_created":"2018-12-11T11:45:10Z","alternative_title":["ISTA Thesis"],"title":"Biology of restriction-modification systems at the single-cell and population level","date_updated":"2026-06-18T18:54:19Z","author":[{"full_name":"Pleska, Maros","id":"4569785E-F248-11E8-B48F-1D18A9856A87","first_name":"Maros","last_name":"Pleska","orcid":"0000-0001-7460-7479"}],"OA_place":"publisher","day":"01","publication_identifier":{"issn":["2663-337X"]},"related_material":{"record":[{"id":"457","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"1243","status":"public"},{"relation":"part_of_dissertation","id":"561","status":"public"}]},"file_date_updated":"2020-07-14T12:45:24Z","acknowledgement":"During my PhD studies, I received help from many people, all of which unfortunately cannot be listed here. I thank them deeply and hope that I never made them regret their kindness.\r\nI would like to express my deepest gratitude to Călin Guet, who went far beyond his responsibilities as an advisor and was to me also a great mentor and a friend. Călin never questioned my potential or lacked compassion and I cannot thank him enough for cultivating in me an independent scientist. I was amazed by his ability to recognize the most fascinating scientific problems in objects of study that others would find mundane. I hope I adopted at least a fraction of this ability.\r\nI will be forever grateful to Bruce Levin for all his support and especially for giving me the best possible example of how one can practice excellent science with humor and style. Working with Bruce was a true privilege.\r\nI thank Jonathan Bollback and Gašper Tkačik for serving in my PhD committee and the Austrian Academy of Science for funding my PhD research via the DOC fellowship.\r\nI thank all our lab members: Tobias Bergmiller for his guidance, especially in the first years of my research, and for being a good friend throughout; Remy Chait for staying in the lab at unreasonable hours and for the good laughs at bad jokes we shared; Anna Staron for supportively listening to my whines whenever I had to run a gel; Magdalena Steinrück for her pioneering work in the lab; Kathrin Tomasek for keeping the entropic forces in check and for her FACS virtuosity; Isabella Tomanek for always being nice to me, no matter how much bench space I took from her.\r\nI thank all my collaborators: Reiko Okura and Yuichi Wakamoto for performing and analyzing the microfluidic experiments; Long Qian and Edo Kussell for their bioinformatics analysis; Dominik Refardt for the λ kan phage; Moritz for his help with the mathematical modeling. I thank Fabienne Jesse for her tireless editorial work on all our manuscripts.\r\nFinally, I would like to thank my family and especially my wife Edita, who sacrificed a lot so that I can pursue my goals and dreams.\r\n","oa_version":"Published Version","_id":"202","publist_id":"7711","pubrep_id":"916","citation":{"mla":"Pleska, Maros. <i>Biology of Restriction-Modification Systems at the Single-Cell and Population Level</i>. Institute of Science and Technology Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">10.15479/AT:ISTA:th_916</a>.","ieee":"M. Pleska, “Biology of restriction-modification systems at the single-cell and population level,” Institute of Science and Technology Austria, 2017.","apa":"Pleska, M. (2017). <i>Biology of restriction-modification systems at the single-cell and population level</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">https://doi.org/10.15479/AT:ISTA:th_916</a>","ama":"Pleska M. Biology of restriction-modification systems at the single-cell and population level. 2017. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">10.15479/AT:ISTA:th_916</a>","ista":"Pleska M. 2017. Biology of restriction-modification systems at the single-cell and population level. Institute of Science and Technology Austria.","chicago":"Pleska, Maros. “Biology of Restriction-Modification Systems at the Single-Cell and Population Level.” Institute of Science and Technology Austria, 2017. <a href=\"https://doi.org/10.15479/AT:ISTA:th_916\">https://doi.org/10.15479/AT:ISTA:th_916</a>.","short":"M. Pleska, Biology of Restriction-Modification Systems at the Single-Cell and Population Level, Institute of Science and Technology Austria, 2017."},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.15479/AT:ISTA:th_916","project":[{"grant_number":"24210","name":"Effects of Stochasticity on the Function of Restriction-Modi cation Systems at the Single-Cell Level","_id":"251D65D8-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"CaGu"}]},{"author":[{"last_name":"Guseinov","orcid":"0000-0001-9819-5077","first_name":"Ruslan","full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"}],"date_updated":"2026-04-08T07:25:22Z","title":"CurveUps: Shaping objects from flat plates with tension-actuated curvature","related_material":{"record":[{"status":"public","id":"8366","relation":"dissertation_contains"}]},"file_date_updated":"2018-12-12T10:10:24Z","day":"01","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","location":"Los Angeles, CA, United States","start_date":"2017-08-19","end_date":"2017-08-25"},"external_id":{"isi":["000406432100032"]},"pubrep_id":"1053","publist_id":"6397","_id":"1001","oa_version":"Submitted Version","quality_controlled":"1","department":[{"_id":"BeBi"}],"scopus_import":"1","volume":36,"project":[{"call_identifier":"H2020","_id":"25082902-B435-11E9-9278-68D0E5697425","name":"Soft-bodied intelligence for Manipulation","grant_number":"645599"},{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"doi":"10.1145/3072959.3073709","citation":{"mla":"Guseinov, Ruslan, et al. <i>CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature</i>. Vol. 36, no. 4, 64, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>.","ieee":"R. Guseinov, E. Miguel, and B. Bickel, “CurveUps: Shaping objects from flat plates with tension-actuated curvature,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2017, vol. 36, no. 4.","ista":"Guseinov R, Miguel E, Bickel B. 2017. CurveUps: Shaping objects from flat plates with tension-actuated curvature. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 64.","apa":"Guseinov, R., Miguel, E., &#38; Bickel, B. (2017). CurveUps: Shaping objects from flat plates with tension-actuated curvature (Vol. 36). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>","ama":"Guseinov R, Miguel E, Bickel B. CurveUps: Shaping objects from flat plates with tension-actuated curvature. In: Vol 36. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3072959.3073709\">10.1145/3072959.3073709</a>","chicago":"Guseinov, Ruslan, Eder Miguel, and Bernd Bickel. “CurveUps: Shaping Objects from Flat Plates with Tension-Actuated Curvature,” Vol. 36. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073709\">https://doi.org/10.1145/3072959.3073709</a>.","short":"R. Guseinov, E. Miguel, B. Bickel, in:, ACM, 2017."},"article_processing_charge":"No","year":"2017","publication_status":"published","file":[{"file_id":"4811","date_updated":"2018-12-12T10:10:24Z","relation":"main_file","date_created":"2018-12-12T10:10:24Z","creator":"system","file_name":"IST-2018-1053-v1+1_CurveUp.pdf","file_size":36159696,"content_type":"application/pdf","access_level":"open_access"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_number":"64","date_published":"2017-01-01T00:00:00Z","type":"conference","isi":1,"ec_funded":1,"oa":1,"issue":"4","month":"01","status":"public","ddc":["003","004"],"alternative_title":["ACM Transactions on Graphics"],"date_created":"2018-12-11T11:49:38Z","has_accepted_license":"1","abstract":[{"text":"We present a computational approach for designing CurveUps, curvy shells that form from an initially flat state. They consist of small rigid tiles that are tightly held together by two pre-stretched elastic sheets attached to them. Our method allows the realization of smooth, doubly curved surfaces that can be fabricated as a flat piece. Once released, the restoring forces of the pre-stretched sheets support the object to take shape in 3D. CurveUps are structurally stable in their target configuration. The design process starts with a target surface. Our method generates a tile layout in 2D and optimizes the distribution, shape, and attachment areas of the tiles to obtain a configuration that is fabricable and in which the curved up state closely matches the target. Our approach is based on an efficient approximate model and a local optimization strategy for an otherwise intractable nonlinear optimization problem. We demonstrate the effectiveness of our approach for a wide range of shapes, all realized as physical prototypes.","lang":"eng"}],"publisher":"ACM","language":[{"iso":"eng"}],"intvolume":"        36"},{"month":"06","status":"public","ddc":["003","004"],"issue":"4","language":[{"iso":"eng"}],"intvolume":"        36","alternative_title":["ACM Transactions on Graphics"],"abstract":[{"text":"  We present an interactive design system to create functional mechanical  objects. Our computational approach allows novice users to retarget an  existing mechanical template to a user-specified input shape. Our proposed  representation for a mechanical template encodes a parameterized mechanism,  mechanical constraints that ensure a physically valid configuration, spatial relationships of mechanical parts to the user-provided shape, and functional constraints that specify an intended functionality. We provide an intuitive interface and optimization-in-the-loop approach for finding a valid  configuration of the mechanism and the shape to ensure that higher-level  functional goals are met. Our algorithm interactively optimizes the mechanism  while the user manipulates the placement of mechanical components and the shape. Our system allows users to efficiently explore various design choices and to synthesize customized mechanical objects that can be fabricated with rapid prototyping technologies. We demonstrate the efficacy of our approach by retargeting various mechanical templates to different shapes and fabricating the resulting functional mechanical objects.\r\n","lang":"eng"}],"date_created":"2018-12-11T11:49:38Z","has_accepted_license":"1","publisher":"ACM","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2017-06-01T00:00:00Z","article_number":"81","year":"2017","article_processing_charge":"No","publication_status":"published","file":[{"file_id":"4728","date_updated":"2018-12-12T10:09:05Z","creator":"system","file_name":"IST-2018-1050-v1+1_MechRet.pdf","date_created":"2018-12-12T10:09:05Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":25463895}],"isi":1,"type":"conference","ec_funded":1,"oa":1,"publist_id":"6396","_id":"1002","quality_controlled":"1","oa_version":"Submitted Version","pubrep_id":"1050","project":[{"name":"Distributed 3D Object Design","grant_number":"642841","call_identifier":"H2020","_id":"2508E324-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767"}],"doi":"10.1145/3072959.3073710","citation":{"apa":"Zhang, R., Auzinger, T., Ceylan, D., Li, W., &#38; Bickel, B. (2017). Functionality-aware retargeting of mechanisms to 3D shapes (Vol. 36). Presented at the SIGGRAPH: Computer Graphics and Interactive Techniques, Los Angeles, CA, United States : ACM. <a href=\"https://doi.org/10.1145/3072959.3073710\">https://doi.org/10.1145/3072959.3073710</a>","ista":"Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. 2017. Functionality-aware retargeting of mechanisms to 3D shapes. SIGGRAPH: Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 36, 81.","ama":"Zhang R, Auzinger T, Ceylan D, Li W, Bickel B. Functionality-aware retargeting of mechanisms to 3D shapes. In: Vol 36. ACM; 2017. doi:<a href=\"https://doi.org/10.1145/3072959.3073710\">10.1145/3072959.3073710</a>","ieee":"R. Zhang, T. Auzinger, D. Ceylan, W. Li, and B. Bickel, “Functionality-aware retargeting of mechanisms to 3D shapes,” presented at the SIGGRAPH: Computer Graphics and Interactive Techniques, Los Angeles, CA, United States , 2017, vol. 36, no. 4.","mla":"Zhang, Ran, et al. <i>Functionality-Aware Retargeting of Mechanisms to 3D Shapes</i>. Vol. 36, no. 4, 81, ACM, 2017, doi:<a href=\"https://doi.org/10.1145/3072959.3073710\">10.1145/3072959.3073710</a>.","short":"R. Zhang, T. Auzinger, D. Ceylan, W. Li, B. Bickel, in:, ACM, 2017.","chicago":"Zhang, Ran, Thomas Auzinger, Duygu Ceylan, Wilmot Li, and Bernd Bickel. “Functionality-Aware Retargeting of Mechanisms to 3D Shapes,” Vol. 36. ACM, 2017. <a href=\"https://doi.org/10.1145/3072959.3073710\">https://doi.org/10.1145/3072959.3073710</a>."},"department":[{"_id":"BeBi"}],"scopus_import":"1","volume":36,"date_updated":"2026-04-16T10:06:32Z","title":"Functionality-aware retargeting of mechanisms to 3D shapes","author":[{"first_name":"Ran","last_name":"Zhang","orcid":"0000-0002-3808-281X","full_name":"Zhang, Ran","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas","orcid":"0000-0002-1546-3265","last_name":"Auzinger","id":"4718F954-F248-11E8-B48F-1D18A9856A87","full_name":"Auzinger, Thomas"},{"first_name":"Duygu","last_name":"Ceylan","full_name":"Ceylan, Duygu"},{"first_name":"Wilmot","last_name":"Li","full_name":"Li, Wilmot"},{"orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"}],"conference":{"start_date":"2017-07-30","location":"Los Angeles, CA, United States ","name":"SIGGRAPH: Computer Graphics and Interactive Techniques","end_date":"2017-08-03"},"external_id":{"isi":["000406432100049"]},"publication_identifier":{"issn":["0730-0301"]},"file_date_updated":"2018-12-12T10:09:05Z","related_material":{"record":[{"id":"8386","relation":"dissertation_contains","status":"public"}]},"day":"01"},{"month":"05","status":"public","ddc":["004"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an overapproximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. Our experimental results demonstrate the efficiency of the methodology."}],"has_accepted_license":"1","date_created":"2018-12-11T11:49:38Z","publisher":"AAAI Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-05-30T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2017","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":365172,"file_name":"IST-2017-818-v1+1_allIJCAI_CR.pdf","creator":"system","relation":"main_file","date_created":"2018-12-12T10:16:58Z","date_updated":"2018-12-12T10:16:58Z","file_id":"5249"}],"isi":1,"type":"conference","oa":1,"page":"70 - 76","_id":"1003","publist_id":"6395","quality_controlled":"1","oa_version":"Submitted Version","pubrep_id":"818","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"}],"doi":"10.24963/ijcai.2017/11","citation":{"apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2017). An abstraction-refinement methodology for reasoning about network games (pp. 70–76). Presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia: AAAI Press. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. In: AAAI Press; 2017:70-76. doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>","ista":"Avni G, Guha S, Kupferman O. 2017. An abstraction-refinement methodology for reasoning about network games. IJCAI: International Joint Conference on Artificial Intelligence , 70–76.","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” presented at the IJCAI: International Joint Conference on Artificial Intelligence , Melbourne, Australia, 2017, pp. 70–76.","mla":"Avni, Guy, et al. <i>An Abstraction-Refinement Methodology for Reasoning about Network Games</i>. AAAI Press, 2017, pp. 70–76, doi:<a href=\"https://doi.org/10.24963/ijcai.2017/11\">10.24963/ijcai.2017/11</a>.","short":"G. Avni, S. Guha, O. Kupferman, in:, AAAI Press, 2017, pp. 70–76.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games,” 70–76. AAAI Press, 2017. <a href=\"https://doi.org/10.24963/ijcai.2017/11\">https://doi.org/10.24963/ijcai.2017/11</a>."},"department":[{"_id":"ToHe"}],"scopus_import":"1","title":"An abstraction-refinement methodology for reasoning about network games","date_updated":"2025-07-10T11:49:38Z","author":[{"first_name":"Guy","orcid":"0000-0001-5588-8287","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Avni, Guy"},{"full_name":"Guha, Shibashis","first_name":"Shibashis","last_name":"Guha"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"conference":{"end_date":"2017-08-25","location":"Melbourne, Australia","name":"IJCAI: International Joint Conference on Artificial Intelligence ","start_date":"2017-08-19"},"external_id":{"isi":["000764137500011"]},"day":"30","publication_identifier":{"issn":["1045-0823"]},"file_date_updated":"2018-12-12T10:16:58Z","related_material":{"record":[{"status":"public","id":"6006","relation":"later_version"}]}},{"publication":"Current Opinion in Genetics & Development","month":"08","ddc":["575"],"status":"public","publisher":"Elsevier","abstract":[{"text":"The fundamental tasks of the root system are, besides anchoring, mediating interactions between plant and soil and providing the plant with water and nutrients. The architecture of the root system is controlled by endogenous mechanisms that constantly integrate environmental signals, such as availability of nutrients and water. Extremely important for efficient soil exploitation and survival under less favorable conditions is the developmental flexibility of the root system that is largely determined by its postembryonic branching capacity. Modulation of initiation and outgrowth of lateral roots provides roots with an exceptional plasticity, allows optimal adjustment to underground heterogeneity, and enables effective soil exploitation and use of resources. Here we discuss recent advances in understanding the molecular mechanisms that shape the plant root system and integrate external cues to adapt to the changing environment.","lang":"eng"}],"pmid":1,"date_created":"2018-12-11T11:49:38Z","has_accepted_license":"1","intvolume":"        45","language":[{"iso":"eng"}],"file":[{"file_name":"Otvos_Benkova_CurOpDevBiol_2017.pdf","creator":"dernst","relation":"main_file","date_created":"2019-04-17T08:00:36Z","content_type":"application/pdf","access_level":"open_access","file_size":364133,"file_id":"6336","success":1,"date_updated":"2019-04-17T08:00:36Z"}],"publication_status":"published","year":"2017","article_processing_charge":"No","date_published":"2017-08-01T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"82 - 89","oa":1,"isi":1,"type":"journal_article","pubrep_id":"1017","quality_controlled":"1","oa_version":"Submitted Version","_id":"1004","publist_id":"6394","volume":45,"scopus_import":"1","department":[{"_id":"EvBe"}],"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"citation":{"chicago":"Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.” <i>Current Opinion in Genetics &#38; Development</i>. Elsevier, 2017. <a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">https://doi.org/10.1016/j.gde.2017.03.010</a>.","short":"K. Ötvös, E. Benková, Current Opinion in Genetics &#38; Development 45 (2017) 82–89.","ieee":"K. Ötvös and E. Benková, “Spatiotemporal mechanisms of root branching,” <i>Current Opinion in Genetics &#38; Development</i>, vol. 45. Elsevier, pp. 82–89, 2017.","mla":"Ötvös, Krisztina, and Eva Benková. “Spatiotemporal Mechanisms of Root Branching.” <i>Current Opinion in Genetics &#38; Development</i>, vol. 45, Elsevier, 2017, pp. 82–89, doi:<a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">10.1016/j.gde.2017.03.010</a>.","apa":"Ötvös, K., &#38; Benková, E. (2017). Spatiotemporal mechanisms of root branching. <i>Current Opinion in Genetics &#38; Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">https://doi.org/10.1016/j.gde.2017.03.010</a>","ista":"Ötvös K, Benková E. 2017. Spatiotemporal mechanisms of root branching. Current Opinion in Genetics &#38; Development. 45, 82–89.","ama":"Ötvös K, Benková E. Spatiotemporal mechanisms of root branching. <i>Current Opinion in Genetics &#38; Development</i>. 2017;45:82-89. doi:<a href=\"https://doi.org/10.1016/j.gde.2017.03.010\">10.1016/j.gde.2017.03.010</a>"},"doi":"10.1016/j.gde.2017.03.010","project":[{"grant_number":"I 1774-B16","name":"Hormone cross-talk drives nutrient dependent plant development","_id":"2542D156-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"author":[{"full_name":"Ötvös, Krisztina","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","last_name":"Ötvös","orcid":"0000-0002-5503-4983","first_name":"Krisztina"},{"last_name":"Benková","orcid":"0000-0002-8510-9739","first_name":"Eva","full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"}],"title":"Spatiotemporal mechanisms of root branching","date_updated":"2026-04-16T09:56:36Z","day":"01","file_date_updated":"2019-04-17T08:00:36Z","publication_identifier":{"issn":["0959-437X"]},"external_id":{"isi":["000404880400013"],"pmid":["28391060"]},"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/"},{"title":"Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae","date_updated":"2025-07-10T11:49:40Z","author":[{"last_name":"Greenwood","first_name":"Jenny","full_name":"Greenwood, Jenny"},{"first_name":"Barbara","orcid":"0000-0002-8214-4758","last_name":"Milutinovic","id":"2CDC32B8-F248-11E8-B48F-1D18A9856A87","full_name":"Milutinovic, Barbara"},{"full_name":"Peuß, Robert","first_name":"Robert","last_name":"Peuß"},{"last_name":"Behrens","first_name":"Sarah","full_name":"Behrens, Sarah"},{"full_name":"Essar, Daniela","first_name":"Daniela","last_name":"Essar"},{"first_name":"Philip","last_name":"Rosenstiel","full_name":"Rosenstiel, Philip"},{"full_name":"Schulenburg, Hinrich","first_name":"Hinrich","last_name":"Schulenburg"},{"last_name":"Kurtz","first_name":"Joachim","full_name":"Kurtz, Joachim"}],"external_id":{"isi":["000400625200004"]},"day":"26","publication_identifier":{"issn":["1471-2164"]},"related_material":{"record":[{"id":"9859","relation":"research_data","status":"public"},{"status":"public","id":"9860","relation":"research_data"}]},"file_date_updated":"2018-12-12T10:16:46Z","oa_version":"Published Version","quality_controlled":"1","_id":"1006","publist_id":"6392","pubrep_id":"814","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1186/s12864-017-3705-7","citation":{"short":"J. Greenwood, B. Milutinovic, R. Peuß, S. Behrens, D. Essar, P. Rosenstiel, H. Schulenburg, J. Kurtz, BMC Genomics 18 (2017) 329.","chicago":"Greenwood, Jenny, Barbara Milutinovic, Robert Peuß, Sarah Behrens, Daniela Essar, Philip Rosenstiel, Hinrich Schulenburg, and Joachim Kurtz. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>. BioMed Central, 2017. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>.","ista":"Greenwood J, Milutinovic B, Peuß R, Behrens S, Essar D, Rosenstiel P, Schulenburg H, Kurtz J. 2017. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. BMC Genomics. 18(1), 329.","ama":"Greenwood J, Milutinovic B, Peuß R, et al. Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. 2017;18(1):329. doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>","apa":"Greenwood, J., Milutinovic, B., Peuß, R., Behrens, S., Essar, D., Rosenstiel, P., … Kurtz, J. (2017). Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s12864-017-3705-7\">https://doi.org/10.1186/s12864-017-3705-7</a>","ieee":"J. Greenwood <i>et al.</i>, “Oral immune priming with Bacillus thuringiensis induces a shift in the gene expression of Tribolium castaneum larvae,” <i>BMC Genomics</i>, vol. 18, no. 1. BioMed Central, p. 329, 2017.","mla":"Greenwood, Jenny, et al. “Oral Immune Priming with Bacillus Thuringiensis Induces a Shift in the Gene Expression of Tribolium Castaneum Larvae.” <i>BMC Genomics</i>, vol. 18, no. 1, BioMed Central, 2017, p. 329, doi:<a href=\"https://doi.org/10.1186/s12864-017-3705-7\">10.1186/s12864-017-3705-7</a>."},"volume":18,"scopus_import":"1","department":[{"_id":"SyCr"}],"date_published":"2017-04-26T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"5236","date_updated":"2018-12-12T10:16:46Z","date_created":"2018-12-12T10:16:46Z","relation":"main_file","creator":"system","file_name":"IST-2017-814-v1+1_s12864-017-3705-7.pdf","file_size":2379672,"access_level":"open_access","content_type":"application/pdf"}],"publication_status":"published","year":"2017","article_processing_charge":"No","oa":1,"isi":1,"type":"journal_article","page":"329","ddc":["570"],"status":"public","month":"04","publication":"BMC Genomics","issue":"1","intvolume":"        18","language":[{"iso":"eng"}],"publisher":"BioMed Central","has_accepted_license":"1","date_created":"2018-12-11T11:49:39Z","abstract":[{"text":"Background: The phenomenon of immune priming, i.e. enhanced protection following a secondary exposure to a pathogen, has now been demonstrated in a wide range of invertebrate species. Despite accumulating phenotypic evidence, knowledge of its mechanistic underpinnings is currently very limited. Here we used the system of the red flour beetle, Tribolium castaneum and the insect pathogen Bacillus thuringiensis (Bt) to further our molecular understanding of the oral immune priming phenomenon. We addressed how ingestion of bacterial cues (derived from spore supernatants) of an orally pathogenic and non-pathogenic Bt strain affects gene expression upon later challenge exposure, using a whole-transcriptome sequencing approach. Results: Whereas gene expression of individuals primed with the orally non-pathogenic strain showed minor changes to controls, we found that priming with the pathogenic strain induced regulation of a large set of distinct genes, many of which are known immune candidates. Intriguingly, the immune repertoire activated upon priming and subsequent challenge qualitatively differed from the one mounted upon infection with Bt without previous priming. Moreover, a large subset of priming-specific genes showed an inverse regulation compared to their regulation upon challenge only. Conclusions: Our data demonstrate that gene expression upon infection is strongly affected by previous immune priming. We hypothesise that this shift in gene expression indicates activation of a more targeted and efficient response towards a previously encountered pathogen, in anticipation of potential secondary encounter.","lang":"eng"}]},{"oa":1,"ec_funded":1,"type":"journal_article","isi":1,"page":"46 - 55","date_published":"2017-06-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2018-12-12T10:11:29Z","file_id":"4884","file_size":1401954,"access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:11:29Z","relation":"main_file","file_name":"IST-2017-813-v1+1_ZerosOfNonlinearSystems.pdf","creator":"system"}],"publication_status":"published","year":"2017","article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"publisher":"International Federation of Automatic Control","has_accepted_license":"1","date_created":"2018-12-11T11:49:39Z","abstract":[{"text":"A nonlinear system possesses an invariance with respect to a set of transformations if its output dynamics remain invariant when transforming the input, and adjusting the initial condition accordingly. Most research has focused on invariances with respect to time-independent pointwise transformations like translational-invariance (u(t) -&gt; u(t) + p, p in R) or scale-invariance (u(t) -&gt; pu(t), p in R&gt;0). In this article, we introduce the concept of s0-invariances with respect to continuous input transformations exponentially growing/decaying over time. We show that s0-invariant systems not only encompass linear time-invariant (LTI) systems with transfer functions having an irreducible zero at s0 in R, but also that the input/output relationship of nonlinear s0-invariant systems possesses properties well known from their linear counterparts. Furthermore, we extend the concept of s0-invariances to second- and higher-order s0-invariances, corresponding to invariances with respect to transformations of the time-derivatives of the input, and encompassing LTI systems with zeros of multiplicity two or higher. Finally, we show that nth-order 0-invariant systems realize – under mild conditions – nth-order nonlinear differential operators: when excited by an input of a characteristic functional form, the system’s output converges to a constant value only depending on the nth (nonlinear) derivative of the input.","lang":"eng"}],"status":"public","ddc":["000"],"month":"06","publication":"Automatica","external_id":{"isi":["000403513900006"]},"day":"01","file_date_updated":"2018-12-12T10:11:29Z","publication_identifier":{"issn":["0005-1098"]},"title":"Zeros of nonlinear systems with input invariances","date_updated":"2025-04-15T06:50:01Z","author":[{"first_name":"Moritz","last_name":"Lang","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","full_name":"Lang, Moritz"},{"full_name":"Sontag, Eduardo","first_name":"Eduardo","last_name":"Sontag"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1016/j.automatica.2017.03.030","citation":{"short":"M. Lang, E. Sontag, Automatica 81C (2017) 46–55.","chicago":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>. International Federation of Automatic Control, 2017. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>.","ama":"Lang M, Sontag E. Zeros of nonlinear systems with input invariances. <i>Automatica</i>. 2017;81C:46-55. doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>","apa":"Lang, M., &#38; Sontag, E. (2017). Zeros of nonlinear systems with input invariances. <i>Automatica</i>. International Federation of Automatic Control. <a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">https://doi.org/10.1016/j.automatica.2017.03.030</a>","ista":"Lang M, Sontag E. 2017. Zeros of nonlinear systems with input invariances. Automatica. 81C, 46–55.","mla":"Lang, Moritz, and Eduardo Sontag. “Zeros of Nonlinear Systems with Input Invariances.” <i>Automatica</i>, vol. 81C, International Federation of Automatic Control, 2017, pp. 46–55, doi:<a href=\"https://doi.org/10.1016/j.automatica.2017.03.030\">10.1016/j.automatica.2017.03.030</a>.","ieee":"M. Lang and E. Sontag, “Zeros of nonlinear systems with input invariances,” <i>Automatica</i>, vol. 81C. International Federation of Automatic Control, pp. 46–55, 2017."},"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"volume":"81C","department":[{"_id":"CaGu"},{"_id":"GaTk"}],"scopus_import":"1","quality_controlled":"1","oa_version":"Published Version","_id":"1007","publist_id":"6391","pubrep_id":"813"},{"status":"public","publication":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","month":"01","intvolume":"         5","language":[{"iso":"eng"}],"publisher":"AAAI Press","abstract":[{"text":"A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the “expectation” and “threshold” approaches and consider a “guaranteed payoff optimization (GPO)” problem for POMDPs, where we are given a threshold t and the objective is to find a policy σ such that a) each possible outcome of σ yields a discounted-sum payoff of at least t, and b) the expected discounted-sum payoff of σ is optimal (or near-optimal) among all policies satisfying a). We present a practical approach to tackle the GPO problem and evaluate it on standard POMDP benchmarks.","lang":"eng"}],"date_created":"2018-12-11T11:49:40Z","date_published":"2017-01-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2017","article_processing_charge":"No","publication_status":"published","oa":1,"isi":1,"type":"conference","ec_funded":1,"page":"3725 - 3732","main_file_link":[{"open_access":"1","url":"http://www.aaai.org/ocs/index.php/AAAI/AAAI17/paper/download/14354/14092"}],"quality_controlled":"1","oa_version":"Submitted Version","publist_id":"6387","_id":"1009","citation":{"chicago":"Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, 5:3725–32. AAAI Press, 2017.","short":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.","mla":"Chatterjee, Krishnendu, et al. “Optimizing Expectation with Guarantees in POMDPs.” <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, vol. 5, AAAI Press, 2017, pp. 3725–32.","ieee":"K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, and D. Zikelic, “Optimizing expectation with guarantees in POMDPs,” in <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>, San Francisco, CA, United States, 2017, vol. 5, pp. 3725–3732.","ista":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. 2017. Optimizing expectation with guarantees in POMDPs. Proceedings of the 31st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 5, 3725–3732.","apa":"Chatterjee, K., Novotný, P., Pérez, G., Raskin, J., &#38; Zikelic, D. (2017). Optimizing expectation with guarantees in POMDPs. In <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i> (Vol. 5, pp. 3725–3732). San Francisco, CA, United States: AAAI Press.","ama":"Chatterjee K, Novotný P, Pérez G, Raskin J, Zikelic D. Optimizing expectation with guarantees in POMDPs. In: <i>Proceedings of the 31st AAAI Conference on Artificial Intelligence</i>. Vol 5. AAAI Press; 2017:3725-3732."},"project":[{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"volume":5,"department":[{"_id":"KrCh"}],"scopus_import":"1","date_updated":"2025-04-14T13:51:03Z","title":"Optimizing expectation with guarantees in POMDPs","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Novotny, Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotny"},{"full_name":"Pérez, Guillermo","first_name":"Guillermo","last_name":"Pérez"},{"full_name":"Raskin, Jean","first_name":"Jean","last_name":"Raskin"},{"first_name":"Djordje","last_name":"Zikelic","full_name":"Zikelic, Djordje"}],"external_id":{"isi":["000485630703107"]},"conference":{"name":"AAAI: Conference on Artificial Intelligence","location":"San Francisco, CA, United States","start_date":"2017-02-04","end_date":"2017-02-10"},"acknowledgement":"he research leading to these results was supported by the Austrian Science Fund (FWF) NFN Grant no. S11407-N23 (RiSE/SHiNE); two ERC Starting grants (279307: Graph Games, 279499: inVEST); the Vienna Science and Tech- nology Fund (WWTF) through project ICT15-003; and the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734].","day":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"25","date_published":"2017-03-08T00:00:00Z","article_processing_charge":"No","year":"2017","publication_status":"published","file":[{"file_size":639384,"access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:13:39Z","relation":"main_file","file_name":"IST-2017-807-v1+1_euclid.ejp.1488942016.pdf","creator":"system","date_updated":"2018-12-12T10:13:39Z","file_id":"5024"}],"ec_funded":1,"isi":1,"type":"journal_article","oa":1,"status":"public","ddc":["510","539"],"month":"03","publication":"Electronic Journal of Probability","language":[{"iso":"eng"}],"intvolume":"        22","has_accepted_license":"1","abstract":[{"text":"We prove a local law in the bulk of the spectrum for random Gram matrices XX∗, a generalization of sample covariance matrices, where X is a large matrix with independent, centered entries with arbitrary variances. The limiting eigenvalue density that generalizes the Marchenko-Pastur law is determined by solving a system of nonlinear equations. Our entrywise and averaged local laws are on the optimal scale with the optimal error bounds. They hold both in the square case (hard edge) and in the properly rectangular case (soft edge). In the latter case we also establish a macroscopic gap away from zero in the spectrum of XX∗. ","lang":"eng"}],"date_created":"2018-12-11T11:49:40Z","publisher":"Institute of Mathematical Statistics","date_updated":"2026-04-08T14:11:36Z","title":"Local law for random Gram matrices","author":[{"full_name":"Alt, Johannes","id":"36D3D8B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes","last_name":"Alt"},{"first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"full_name":"Krüger, Torben H","id":"3020C786-F248-11E8-B48F-1D18A9856A87","first_name":"Torben H","last_name":"Krüger","orcid":"0000-0002-4821-3297"}],"external_id":{"arxiv":["1606.07353"],"isi":["000396611900025"]},"related_material":{"record":[{"status":"public","id":"149","relation":"dissertation_contains"}]},"publication_identifier":{"issn":["1083-6489"]},"file_date_updated":"2018-12-12T10:13:39Z","day":"08","arxiv":1,"publist_id":"6386","_id":"1010","oa_version":"Published Version","quality_controlled":"1","pubrep_id":"807","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Alt, Johannes, László Erdös, and Torben H Krüger. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2017. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>.","short":"J. Alt, L. Erdös, T.H. Krüger, Electronic Journal of Probability 22 (2017).","mla":"Alt, Johannes, et al. “Local Law for Random Gram Matrices.” <i>Electronic Journal of Probability</i>, vol. 22, 25, Institute of Mathematical Statistics, 2017, doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>.","ieee":"J. Alt, L. Erdös, and T. H. Krüger, “Local law for random Gram matrices,” <i>Electronic Journal of Probability</i>, vol. 22. Institute of Mathematical Statistics, 2017.","ista":"Alt J, Erdös L, Krüger TH. 2017. Local law for random Gram matrices. Electronic Journal of Probability. 22, 25.","apa":"Alt, J., Erdös, L., &#38; Krüger, T. H. (2017). Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/17-EJP42\">https://doi.org/10.1214/17-EJP42</a>","ama":"Alt J, Erdös L, Krüger TH. Local law for random Gram matrices. <i>Electronic Journal of Probability</i>. 2017;22. doi:<a href=\"https://doi.org/10.1214/17-EJP42\">10.1214/17-EJP42</a>"},"doi":"10.1214/17-EJP42","scopus_import":"1","department":[{"_id":"LaEr"}],"volume":22},{"_id":"1011","publist_id":"6384","oa_version":"Submitted Version","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1701.04914","open_access":"1"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"scopus_import":"1","volume":10201,"project":[{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Game Theory","grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","grant_number":"Z211"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"doi":"10.1007/978-3-662-54434-1_11","citation":{"short":"K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.","chicago":"Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.” edited by Hongseok Yang, 10201:287–313. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>.","ista":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. 2017. Faster algorithms for weighted recursive state machines. ESOP: European Symposium on Programming, LNCS, vol. 10201, 287–313.","apa":"Chatterjee, K., Kragl, B., Mishra, S., &#38; Pavlogiannis, A. (2017). Faster algorithms for weighted recursive state machines. In H. Yang (Ed.) (Vol. 10201, pp. 287–313). Presented at the ESOP: European Symposium on Programming, Uppsala, Sweden: Springer. <a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">https://doi.org/10.1007/978-3-662-54434-1_11</a>","ama":"Chatterjee K, Kragl B, Mishra S, Pavlogiannis A. Faster algorithms for weighted recursive state machines. In: Yang H, ed. Vol 10201. Springer; 2017:287-313. doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>","ieee":"K. Chatterjee, B. Kragl, S. Mishra, and A. Pavlogiannis, “Faster algorithms for weighted recursive state machines,” presented at the ESOP: European Symposium on Programming, Uppsala, Sweden, 2017, vol. 10201, pp. 287–313.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Weighted Recursive State Machines</i>. Edited by Hongseok Yang, vol. 10201, Springer, 2017, pp. 287–313, doi:<a href=\"https://doi.org/10.1007/978-3-662-54434-1_11\">10.1007/978-3-662-54434-1_11</a>."},"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl","orcid":"0000-0001-7745-9117"},{"full_name":"Mishra, Samarth","last_name":"Mishra","first_name":"Samarth"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","first_name":"Andreas","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722"}],"title":"Faster algorithms for weighted recursive state machines","date_updated":"2025-06-04T08:09:18Z","day":"19","publication_identifier":{"issn":["0302-9743"]},"arxiv":1,"conference":{"end_date":"2017-04-29","start_date":"2017-04-22","name":"ESOP: European Symposium on Programming","location":"Uppsala, Sweden"},"external_id":{"isi":["000681702400011"],"arxiv":["1701.04914"]},"status":"public","month":"03","date_created":"2018-12-11T11:49:41Z","abstract":[{"lang":"eng","text":"Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b) specify many natural parameters for algorithmic analysis, e.g., the number of entries and exits. We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow analysis problems. Our main contributions are new algorithms for several fundamental problems. As compared to a direct translation of RSMs to PDSs and the best-known existing bounds of PDSs, our analysis algorithm improves the complexity for finite-height semirings (that subsumes reachability and standard dataflow properties). We further consider the problem of extracting distance values from the representation structures computed by our algorithm, and give efficient algorithms that distinguish the complexity of a one-time preprocessing from the complexity of each individual query. Another advantage of our algorithm is that our improvements carry over to the concurrent setting, where we improve the bestknown complexity for the context-bounded analysis of concurrent RSMs. Finally, we provide a prototype implementation that gives a significant speed-up on several benchmarks from the SLAM/SDV project."}],"alternative_title":["LNCS"],"publisher":"Springer","language":[{"iso":"eng"}],"intvolume":"     10201","publication_status":"published","year":"2017","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-03-19T00:00:00Z","editor":[{"first_name":"Hongseok","last_name":"Yang","full_name":"Yang, Hongseok"}],"page":"287 - 313","type":"conference","isi":1,"ec_funded":1,"oa":1},{"quality_controlled":"1","oa_version":"Published Version","publist_id":"6382","_id":"1013","volume":10,"department":[{"_id":"JoFi"}],"citation":{"mla":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” <i>Physics</i>, vol. 10, no. 32, American Physical Society, 2017, doi:<a href=\"https://doi.org/10.1103/Physics.10.32\">10.1103/Physics.10.32</a>.","ieee":"J. M. Fink, “Viewpoint: Microwave quantum states beat the heat,” <i>Physics</i>, vol. 10, no. 32. American Physical Society, 2017.","apa":"Fink, J. M. (2017). Viewpoint: Microwave quantum states beat the heat. <i>Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/Physics.10.32\">https://doi.org/10.1103/Physics.10.32</a>","ista":"Fink JM. 2017. Viewpoint: Microwave quantum states beat the heat. Physics. 10(32).","ama":"Fink JM. Viewpoint: Microwave quantum states beat the heat. <i>Physics</i>. 2017;10(32). doi:<a href=\"https://doi.org/10.1103/Physics.10.32\">10.1103/Physics.10.32</a>","chicago":"Fink, Johannes M. “Viewpoint: Microwave Quantum States Beat the Heat.” <i>Physics</i>. American Physical Society, 2017. <a href=\"https://doi.org/10.1103/Physics.10.32\">https://doi.org/10.1103/Physics.10.32</a>.","short":"J.M. Fink, Physics 10 (2017)."},"doi":"10.1103/Physics.10.32","author":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","first_name":"Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink"}],"date_updated":"2024-10-09T20:57:21Z","title":"Viewpoint: Microwave quantum states beat the heat","article_type":"review","file_date_updated":"2019-10-24T11:38:14Z","day":"27","issue":"32","month":"03","status":"public","corr_author":"1","ddc":["530"],"publication":"Physics","publisher":"American Physical Society","has_accepted_license":"1","date_created":"2018-12-11T11:49:41Z","abstract":[{"lang":"eng","text":"From microwave ovens to satellite television to the GPS and data services on our mobile phones, microwave technology is everywhere today. But one technology that has so far failed to prove its worth in this wavelength regime is quantum communication that uses the states of single photons as information carriers. This is because single microwave photons, as opposed to classical microwave signals, are extremely vulnerable to noise from thermal excitations in the channels through which they travel. Two new independent studies, one by Ze-Liang Xiang at Technische Universität Wien (Vienna), Austria, and colleagues [1] and another by Benoît Vermersch at the University of Innsbruck, also in Austria, and colleagues [2] now describe a theoretical protocol for microwave quantum communication that is resilient to thermal and other types of noise. Their approach could become a powerful technique to establish fast links between superconducting data processors in a future all-microwave quantum network."}],"intvolume":"        10","language":[{"iso":"eng"}],"file":[{"relation":"main_file","date_created":"2019-10-24T11:38:14Z","creator":"dernst","file_name":"2017_Physics_Fink.pdf","file_size":193622,"content_type":"application/pdf","access_level":"open_access","file_id":"6968","success":1,"date_updated":"2019-10-24T11:38:14Z"}],"article_processing_charge":"No","year":"2017","publication_status":"published","date_published":"2017-03-27T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"type":"journal_article"},{"oa":1,"type":"journal_article","isi":1,"date_published":"2017-04-04T00:00:00Z","article_number":"45702","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2018-12-12T10:12:32Z","file_id":"4950","content_type":"application/pdf","access_level":"open_access","file_size":478289,"file_name":"IST-2017-809-v1+1_srep45702.pdf","creator":"system","relation":"main_file","date_created":"2018-12-12T10:12:32Z"}],"year":"2017","article_processing_charge":"No","publication_status":"published","intvolume":"         7","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group","has_accepted_license":"1","abstract":[{"text":"Vortices are commonly observed in the context of classical hydrodynamics: from whirlpools after stirring the coffee in a cup to a violent atmospheric phenomenon such as a tornado, all classical vortices are characterized by an arbitrary circulation value of the local velocity field. On the other hand the appearance of vortices with quantized circulation represents one of the fundamental signatures of macroscopic quantum phenomena. In two-dimensional superfluids quantized vortices play a key role in determining finite-temperature properties, as the superfluid phase and the normal state are separated by a vortex unbinding transition, the Berezinskii-Kosterlitz-Thouless transition. Very recent experiments with two-dimensional superfluid fermions motivate the present work: we present theoretical results based on the renormalization group showing that the universal jump of the superfluid density and the critical temperature crucially depend on the interaction strength, providing a strong benchmark for forthcoming investigations.","lang":"eng"}],"date_created":"2018-12-11T11:49:42Z","status":"public","ddc":["539"],"month":"04","publication":"Scientific Reports","external_id":{"isi":["000398148100001"]},"publication_identifier":{"issn":["2045-2322"]},"file_date_updated":"2018-12-12T10:12:32Z","day":"04","date_updated":"2025-07-10T11:49:43Z","title":"Vortices and antivortices in two-dimensional ultracold Fermi gases","author":[{"full_name":"Bighin, Giacomo","id":"4CA96FD4-F248-11E8-B48F-1D18A9856A87","first_name":"Giacomo","last_name":"Bighin","orcid":"0000-0001-8823-9777"},{"last_name":"Salasnich","first_name":"Luca","full_name":"Salasnich, Luca"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional Ultracold Fermi Gases.” <i>Scientific Reports</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/srep45702\">https://doi.org/10.1038/srep45702</a>.","short":"G. Bighin, L. Salasnich, Scientific Reports 7 (2017).","ieee":"G. Bighin and L. Salasnich, “Vortices and antivortices in two-dimensional ultracold Fermi gases,” <i>Scientific Reports</i>, vol. 7. Nature Publishing Group, 2017.","mla":"Bighin, Giacomo, and Luca Salasnich. “Vortices and Antivortices in Two-Dimensional Ultracold Fermi Gases.” <i>Scientific Reports</i>, vol. 7, 45702, Nature Publishing Group, 2017, doi:<a href=\"https://doi.org/10.1038/srep45702\">10.1038/srep45702</a>.","ama":"Bighin G, Salasnich L. Vortices and antivortices in two-dimensional ultracold Fermi gases. <i>Scientific Reports</i>. 2017;7. doi:<a href=\"https://doi.org/10.1038/srep45702\">10.1038/srep45702</a>","ista":"Bighin G, Salasnich L. 2017. Vortices and antivortices in two-dimensional ultracold Fermi gases. Scientific Reports. 7, 45702.","apa":"Bighin, G., &#38; Salasnich, L. (2017). Vortices and antivortices in two-dimensional ultracold Fermi gases. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep45702\">https://doi.org/10.1038/srep45702</a>"},"doi":"10.1038/srep45702","volume":7,"department":[{"_id":"MiLe"}],"scopus_import":"1","quality_controlled":"1","oa_version":"Published Version","publist_id":"6380","_id":"1015","pubrep_id":"809"},{"quality_controlled":"1","oa_version":"None","_id":"1016","publist_id":"6379","volume":26,"department":[{"_id":"SiHi"}],"scopus_import":"1","citation":{"chicago":"Breuss, Martin, Thai Nguyen, Anjana Srivatsan, Ines Leca, Guoling Tian, Tanja Fritz, Andi H Hansen, et al. “Uner Tan Syndrome Caused by a Homozygous TUBB2B Mutation Affecting Microtubule Stability.” <i>Human Molecular Genetics</i>. Oxford University Press, 2017. <a href=\"https://doi.org/10.1093/hmg/ddw383\">https://doi.org/10.1093/hmg/ddw383</a>.","short":"M. Breuss, T. Nguyen, A. Srivatsan, I. Leca, G. Tian, T. Fritz, A.H. Hansen, D. Musaev, J. Mcevoy Venneri, J. Kiely, R. Rosti, E. Scott, U. Tan, R. Kolodner, N. Cowan, D. Keays, J. Gleeson, Human Molecular Genetics 26 (2017) 258–269.","mla":"Breuss, Martin, et al. “Uner Tan Syndrome Caused by a Homozygous TUBB2B Mutation Affecting Microtubule Stability.” <i>Human Molecular Genetics</i>, vol. 26, no. 2, Oxford University Press, 2017, pp. 258–69, doi:<a href=\"https://doi.org/10.1093/hmg/ddw383\">10.1093/hmg/ddw383</a>.","ieee":"M. Breuss <i>et al.</i>, “Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability,” <i>Human Molecular Genetics</i>, vol. 26, no. 2. Oxford University Press, pp. 258–269, 2017.","ista":"Breuss M, Nguyen T, Srivatsan A, Leca I, Tian G, Fritz T, Hansen AH, Musaev D, Mcevoy Venneri J, Kiely J, Rosti R, Scott E, Tan U, Kolodner R, Cowan N, Keays D, Gleeson J. 2017. Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability. Human Molecular Genetics. 26(2), 258–269.","ama":"Breuss M, Nguyen T, Srivatsan A, et al. Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability. <i>Human Molecular Genetics</i>. 2017;26(2):258-269. doi:<a href=\"https://doi.org/10.1093/hmg/ddw383\">10.1093/hmg/ddw383</a>","apa":"Breuss, M., Nguyen, T., Srivatsan, A., Leca, I., Tian, G., Fritz, T., … Gleeson, J. (2017). Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability. <i>Human Molecular Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/hmg/ddw383\">https://doi.org/10.1093/hmg/ddw383</a>"},"doi":"10.1093/hmg/ddw383","author":[{"last_name":"Breuss","first_name":"Martin","full_name":"Breuss, Martin"},{"last_name":"Nguyen","first_name":"Thai","full_name":"Nguyen, Thai"},{"first_name":"Anjana","last_name":"Srivatsan","full_name":"Srivatsan, Anjana"},{"first_name":"Ines","last_name":"Leca","full_name":"Leca, Ines"},{"last_name":"Tian","first_name":"Guoling","full_name":"Tian, Guoling"},{"last_name":"Fritz","first_name":"Tanja","full_name":"Fritz, Tanja"},{"full_name":"Hansen, Andi H","id":"38853E16-F248-11E8-B48F-1D18A9856A87","first_name":"Andi H","last_name":"Hansen"},{"first_name":"Damir","last_name":"Musaev","full_name":"Musaev, Damir"},{"first_name":"Jennifer","last_name":"Mcevoy Venneri","full_name":"Mcevoy Venneri, Jennifer"},{"full_name":"Kiely, James","first_name":"James","last_name":"Kiely"},{"last_name":"Rosti","first_name":"Rasim","full_name":"Rosti, Rasim"},{"last_name":"Scott","first_name":"Eric","full_name":"Scott, Eric"},{"first_name":"Uner","last_name":"Tan","full_name":"Tan, Uner"},{"full_name":"Kolodner, Richard","last_name":"Kolodner","first_name":"Richard"},{"full_name":"Cowan, Nicholas","last_name":"Cowan","first_name":"Nicholas"},{"full_name":"Keays, David","last_name":"Keays","first_name":"David"},{"last_name":"Gleeson","first_name":"Joseph","full_name":"Gleeson, Joseph"}],"title":"Uner Tan syndrome caused by a homozygous TUBB2B mutation affecting microtubule stability","date_updated":"2026-04-16T09:56:51Z","day":"01","publication_identifier":{"issn":["0964-6906"]},"external_id":{"isi":["000397066400002"]},"issue":"2","status":"public","publication":"Human Molecular Genetics","month":"01","publisher":"Oxford University Press","date_created":"2018-12-11T11:49:42Z","abstract":[{"text":"The integrity and dynamic properties of the microtubule cytoskeleton are indispensable for the development of the mammalian brain. Consequently, mutations in the genes that encode the structural component (the α/β-tubulin heterodimer) can give rise to severe, sporadic neurodevelopmental disorders. These are commonly referred to as the tubulinopathies. Here we report the addition of recessive quadrupedalism, also known as Uner Tan syndrome (UTS), to the growing list of diseases caused by tubulin variants. Analysis of a consanguineous UTS family identified a biallelic TUBB2B mutation, resulting in a p.R390Q amino acid substitution. In addition to the identifying quadrupedal locomotion, all three patients showed severe cerebellar hypoplasia. None, however, displayed the basal ganglia malformations typically associated with TUBB2B mutations. Functional analysis of the R390Q substitution revealed that it did not affect the ability of β-tubulin to fold or become assembled into the α/β-heterodimer, nor did it influence the incorporation of mutant-containing heterodimers into microtubule polymers. The 390Q mutation in S. cerevisiae TUB2 did not affect growth under basal conditions, but did result in increased sensitivity to microtubule-depolymerizing drugs, indicative of a mild impact of this mutation on microtubule function. The TUBB2B mutation described here represents an unusual recessive mode of inheritance for missense-mediated tubulinopathies and reinforces the sensitivity of the developing cerebellum to microtubule defects.","lang":"eng"}],"intvolume":"        26","language":[{"iso":"eng"}],"publication_status":"published","article_processing_charge":"No","year":"2017","date_published":"2017-01-01T00:00:00Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"258 - 269","isi":1,"type":"journal_article"},{"publication":"Molecular and Cellular Neuroscience","ddc":["571"],"status":"public","month":"10","language":[{"iso":"eng"}],"intvolume":"        84","date_created":"2018-12-11T11:49:42Z","abstract":[{"lang":"eng","text":"The development of the vertebrate central nervous system is reliant on a complex cascade of biological processes that include mitotic division, relocation of migrating neurons, and the extension of dendritic and axonal processes. Each of these cellular events requires the diverse functional repertoire of the microtubule cytoskeleton for the generation of forces, assembly of macromolecular complexes and transport of molecules and organelles. The tubulins are a multi-gene family that encode for the constituents of microtubules, and have been implicated in a spectrum of neurological disorders. Evidence is building that different tubulins tune the functional properties of the microtubule cytoskeleton dependent on the cell type, developmental profile and subcellular localisation. Here we review of the origins of the functional specification of the tubulin gene family in the developing brain at a transcriptional, translational, and post-transcriptional level. We remind the reader that tubulins are not just loading controls for your average Western blot."}],"has_accepted_license":"1","publisher":"Academic Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-10-01T00:00:00Z","publication_status":"published","year":"2017","article_processing_charge":"No","file":[{"date_updated":"2018-12-12T10:09:19Z","file_id":"4742","file_size":1436377,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:09:19Z","file_name":"IST-2017-806-v1+2_1-s2.0-S1044743116302500-main_1_.pdf","creator":"system"}],"isi":1,"type":"journal_article","oa":1,"page":"58 - 67","_id":"1017","publist_id":"6377","quality_controlled":"1","oa_version":"Published Version","pubrep_id":"806","doi":"10.1016/j.mcn.2017.03.002","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"citation":{"apa":"Breuss, M., Leca, I., Gstrein, T., Hansen, A. H., &#38; Keays, D. (2017). Tubulins and brain development: The origins of functional specification. <i>Molecular and Cellular Neuroscience</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">https://doi.org/10.1016/j.mcn.2017.03.002</a>","ista":"Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. 2017. Tubulins and brain development: The origins of functional specification. Molecular and Cellular Neuroscience. 84, 58–67.","ama":"Breuss M, Leca I, Gstrein T, Hansen AH, Keays D. Tubulins and brain development: The origins of functional specification. <i>Molecular and Cellular Neuroscience</i>. 2017;84:58-67. doi:<a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">10.1016/j.mcn.2017.03.002</a>","mla":"Breuss, Martin, et al. “Tubulins and Brain Development: The Origins of Functional Specification.” <i>Molecular and Cellular Neuroscience</i>, vol. 84, Academic Press, 2017, pp. 58–67, doi:<a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">10.1016/j.mcn.2017.03.002</a>.","ieee":"M. Breuss, I. Leca, T. Gstrein, A. H. Hansen, and D. Keays, “Tubulins and brain development: The origins of functional specification,” <i>Molecular and Cellular Neuroscience</i>, vol. 84. Academic Press, pp. 58–67, 2017.","short":"M. Breuss, I. Leca, T. Gstrein, A.H. Hansen, D. Keays, Molecular and Cellular Neuroscience 84 (2017) 58–67.","chicago":"Breuss, Martin, Ines Leca, Thomas Gstrein, Andi H Hansen, and David Keays. “Tubulins and Brain Development: The Origins of Functional Specification.” <i>Molecular and Cellular Neuroscience</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.mcn.2017.03.002\">https://doi.org/10.1016/j.mcn.2017.03.002</a>."},"scopus_import":"1","department":[{"_id":"SiHi"}],"volume":84,"title":"Tubulins and brain development: The origins of functional specification","date_updated":"2025-07-10T11:49:44Z","author":[{"full_name":"Breuss, Martin","last_name":"Breuss","first_name":"Martin"},{"first_name":"Ines","last_name":"Leca","full_name":"Leca, Ines"},{"full_name":"Gstrein, Thomas","first_name":"Thomas","last_name":"Gstrein"},{"full_name":"Hansen, Andi H","id":"38853E16-F248-11E8-B48F-1D18A9856A87","last_name":"Hansen","first_name":"Andi H"},{"full_name":"Keays, David","last_name":"Keays","first_name":"David"}],"external_id":{"isi":["000415140700007"]},"day":"01","publication_identifier":{"issn":["1044-7431"]},"file_date_updated":"2018-12-12T10:09:19Z"},{"month":"05","status":"public","publication":"Plant Physiology","issue":"1","intvolume":"       174","language":[{"iso":"eng"}],"publisher":"American Society of Plant Biologists","date_created":"2018-12-11T11:49:43Z","abstract":[{"lang":"eng","text":"In plants, the multistep phosphorelay (MSP) pathway mediates a range of regulatory processes, including those activated by cytokinins. The crosstalk between cytokinin response and light is known for a long time. However, the molecular mechanism underlying the interactionbetween light and cytokinin signaling remains elusive. In the screen for upstream regulators we identified a LONG PALE HYPOCOTYL (LPH) gene whose activity is indispensable for spatiotemporally correct expression of CYTOKININ INDEPENDENT-1 (CKI1), encoding the constitutively active sensor histidine kinase that activates MSP signaling. lph is a new allele of HEME OXYGENASE 1 (HY1) which encodes the key protein in the biosynthesis of phytochromobilin, a cofactor of photoconvertiblephytochromes. Our analysis confirmed the light-dependent regulation oftheCKI1 expression pattern. We show that CKI1 expression is under the control of phytochrome A (phyA), functioning as a dual (both positive and negative) regulator of CKI1 expression, presumably via the phyA-regulated transcription factors PHYTOCHROME INTERACTING FACTOR 3 (PIF3) and CIRCADIAN CLOCK ASSOCIATED 1 (CCA1). Changes in CKI1 expression observed in lph/hy1-7 and phy mutants correlatewithmisregulation of MSP signaling, changedcytokinin sensitivity and developmental aberrations,previously shown to be associated with cytokinin and/or CKI1 action. Besides that, we demonstrate novel role of phyA-dependent CKI1 expression in the hypocotyl elongation and hook development during skotomorphogenesis. Based on these results, we propose that the light-dependent regulation of CKI1 provides a plausible mechanistic link underlying the well-known interaction between light- and cytokinin-controlled plant development."}],"date_published":"2017-05-17T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2017","article_processing_charge":"No","publication_status":"published","isi":1,"type":"journal_article","page":"387 - 404","oa_version":"None","quality_controlled":"1","publist_id":"6375","_id":"1018","citation":{"ieee":"T. Dobisova <i>et al.</i>, “Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development,” <i>Plant Physiology</i>, vol. 174, no. 1. American Society of Plant Biologists, pp. 387–404, 2017.","mla":"Dobisova, Tereza, et al. “Light Regulated Expression of Sensor Histidine Kinase CKI1 Controls Cytokinin Related Development.” <i>Plant Physiology</i>, vol. 174, no. 1, American Society of Plant Biologists, 2017, pp. 387–404, doi:<a href=\"https://doi.org/10.1104/pp.16.01964\">10.1104/pp.16.01964</a>.","ama":"Dobisova T, Hrdinova V, Cuesta C, et al. Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. <i>Plant Physiology</i>. 2017;174(1):387-404. doi:<a href=\"https://doi.org/10.1104/pp.16.01964\">10.1104/pp.16.01964</a>","ista":"Dobisova T, Hrdinova V, Cuesta C, Michlickova S, Urbankova I, Hejatkova R, Zadnikova P, Pernisová M, Benková E, Hejátko J. 2017. Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. Plant Physiology. 174(1), 387–404.","apa":"Dobisova, T., Hrdinova, V., Cuesta, C., Michlickova, S., Urbankova, I., Hejatkova, R., … Hejátko, J. (2017). Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.16.01964\">https://doi.org/10.1104/pp.16.01964</a>","chicago":"Dobisova, Tereza, Vendula Hrdinova, Candela Cuesta, Sarka Michlickova, Ivana Urbankova, Romana Hejatkova, Petra Zadnikova, Markéta Pernisová, Eva Benková, and Jan Hejátko. “Light Regulated Expression of Sensor Histidine Kinase CKI1 Controls Cytokinin Related Development.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2017. <a href=\"https://doi.org/10.1104/pp.16.01964\">https://doi.org/10.1104/pp.16.01964</a>.","short":"T. Dobisova, V. Hrdinova, C. Cuesta, S. Michlickova, I. Urbankova, R. Hejatkova, P. Zadnikova, M. Pernisová, E. Benková, J. Hejátko, Plant Physiology 174 (2017) 387–404."},"doi":"10.1104/pp.16.01964","volume":174,"scopus_import":"1","department":[{"_id":"EvBe"}],"date_updated":"2023-09-22T09:41:48Z","title":"Light regulated expression of sensor histidine kinase CKI1 controls cytokinin related development","author":[{"last_name":"Dobisova","first_name":"Tereza","full_name":"Dobisova, Tereza"},{"full_name":"Hrdinova, Vendula","last_name":"Hrdinova","first_name":"Vendula"},{"full_name":"Cuesta, Candela","id":"33A3C818-F248-11E8-B48F-1D18A9856A87","first_name":"Candela","last_name":"Cuesta","orcid":"0000-0003-1923-2410"},{"first_name":"Sarka","last_name":"Michlickova","full_name":"Michlickova, Sarka"},{"full_name":"Urbankova, Ivana","first_name":"Ivana","last_name":"Urbankova"},{"full_name":"Hejatkova, Romana","first_name":"Romana","last_name":"Hejatkova"},{"full_name":"Zadnikova, Petra","last_name":"Zadnikova","first_name":"Petra"},{"first_name":"Markéta","last_name":"Pernisová","full_name":"Pernisová, Markéta"},{"full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","orcid":"0000-0002-8510-9739","first_name":"Eva"},{"last_name":"Hejátko","first_name":"Jan","full_name":"Hejátko, Jan"}],"external_id":{"isi":["000402057200028"]},"day":"17"},{"_id":"1019","publist_id":"6374","oa_version":"None","quality_controlled":"1","department":[{"_id":"BeVi"}],"scopus_import":"1","volume":119,"citation":{"short":"E. Argyridou, A.K. Huylmans, A. Königer, J. Parsch, Heredity 119 (2017) 27–34.","chicago":"Argyridou, Eliza, Ann K Huylmans, Annabella Königer, and John Parsch. “X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.” <i>Heredity</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/hdy.2017.12\">https://doi.org/10.1038/hdy.2017.12</a>.","ista":"Argyridou E, Huylmans AK, Königer A, Parsch J. 2017. X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. Heredity. 119(1), 27–34.","ama":"Argyridou E, Huylmans AK, Königer A, Parsch J. X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. <i>Heredity</i>. 2017;119(1):27-34. doi:<a href=\"https://doi.org/10.1038/hdy.2017.12\">10.1038/hdy.2017.12</a>","apa":"Argyridou, E., Huylmans, A. K., Königer, A., &#38; Parsch, J. (2017). X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.2017.12\">https://doi.org/10.1038/hdy.2017.12</a>","mla":"Argyridou, Eliza, et al. “X-Linkage Is Not a General Inhibitor of Tissue-Specific Gene Expression in Drosophila Melanogaster.” <i>Heredity</i>, vol. 119, no. 1, Nature Publishing Group, 2017, pp. 27–34, doi:<a href=\"https://doi.org/10.1038/hdy.2017.12\">10.1038/hdy.2017.12</a>.","ieee":"E. Argyridou, A. K. Huylmans, A. Königer, and J. Parsch, “X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster,” <i>Heredity</i>, vol. 119, no. 1. Nature Publishing Group, pp. 27–34, 2017."},"doi":"10.1038/hdy.2017.12","author":[{"full_name":"Argyridou, Eliza","first_name":"Eliza","last_name":"Argyridou"},{"full_name":"Huylmans, Ann K","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","last_name":"Huylmans","orcid":"0000-0001-8871-4961","first_name":"Ann K"},{"last_name":"Königer","first_name":"Annabella","full_name":"Königer, Annabella"},{"first_name":"John","last_name":"Parsch","full_name":"Parsch, John"}],"title":"X-linkage is not a general inhibitor of tissue-specific gene expression in Drosophila melanogaster","date_updated":"2025-07-10T11:49:45Z","day":"01","publication_identifier":{"issn":["0018-067X"]},"related_material":{"record":[{"status":"public","id":"9861","relation":"research_data"}]},"external_id":{"isi":["000405397800004"]},"issue":"1","month":"07","status":"public","publication":"Heredity","date_created":"2018-12-11T11:49:43Z","abstract":[{"lang":"eng","text":"As a consequence of its difference in copy number between males and females, the X chromosome is subject to unique evolutionary forces and gene regulatory mechanisms. Previous studies of Drosophila melanogaster have shown that the expression of X-linked, testis-specific reporter genes is suppressed in the male germline. However, it is not known whether this phenomenon is restricted to testis-expressed genes or if it is a more general property of genes with tissue-specific expression, which are also underrepresented on the X chromosome. To test this, we compared the expression of three tissue-specific reporter genes (ovary, accessory gland and Malpighian tubule) inserted at various autosomal and X-chromosomal locations. In contrast to testis-specific reporter genes, we found no reduction of X-linked expression in any of the other tissues. In accessory gland and Malpighian tubule, we detected higher expression of the X-linked reporter genes, which suggests that they are at least partially dosage compensated. We found no difference in the tissue-specificity of X-linked and autosomal reporter genes. These findings indicate that, in general, the X chromosome is not a detrimental environment for tissue-specific gene expression and that the suppression of X-linked expression is limited to the male germline."}],"publisher":"Nature Publishing Group","language":[{"iso":"eng"}],"intvolume":"       119","publication_status":"published","year":"2017","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2017-07-01T00:00:00Z","page":"27 - 34","isi":1,"type":"journal_article"}]