[{"abstract":[{"text":"NADH-ubiquinone oxidoreductase (complex I) is the largest (∼1 MDa) and the least characterized complex of the mitochondrial electron transport chain. Because of the ease of sample availability, previous work has focused almost exclusively on bovine complex I. However, only medium resolution structural analyses of this complex have been reported. Working with other mammalian complex I homologues is a potential approach for overcoming these limitations. Due to the inherent difficulty of expressing large membrane protein complexes, screening of complex I homologues is limited to large mammals reared for human consumption. The high sequence identity among these available sources may preclude the benefits of screening. Here, we report the characterization of complex I purified from Ovis aries (ovine) heart mitochondria. All 44 unique subunits of the intact complex were identified by mass spectrometry. We identified differences in the subunit composition of subcomplexes of ovine complex I as compared with bovine, suggesting differential stability of inter-subunit interactions within the complex. Furthermore, the 42-kDa subunit, which is easily lost from the bovine enzyme, remains tightly bound to ovine complex I. Additionally, we developed a novel purification protocol for highly active and stable mitochondrial complex I using the branched-chain detergent lauryl maltose neopentyl glycol. Our data demonstrate that, although closely related, significant differences exist between the biochemical properties of complex I prepared from ovine and bovine mitochondria and that ovine complex I represents a suitable alternative target for further structural studies. ","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"       291","quality_controlled":"1","doi":"10.1074/jbc.M116.735142","page":"24657 - 24675","title":"Purification of ovine respiratory complex i results in a highly active and stable preparation","publist_id":"6139","publisher":"American Society for Biochemistry and Molecular Biology","publication_status":"published","scopus_import":1,"date_published":"2016-11-18T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:44Z","publication":"Journal of Biological Chemistry","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5114416/","open_access":"1"}],"day":"18","ec_funded":1,"volume":291,"project":[{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (FEBS)","_id":"2593EBD6-B435-11E9-9278-68D0E5697425"},{"_id":"2590DB08-B435-11E9-9278-68D0E5697425","grant_number":"701309","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","call_identifier":"H2020"}],"_id":"1209","year":"2016","citation":{"ieee":"J. A. Letts, G. Degliesposti, K. Fiedorczuk, M. Skehel, and L. A. Sazanov, “Purification of ovine respiratory complex i results in a highly active and stable preparation,” <i>Journal of Biological Chemistry</i>, vol. 291, no. 47. American Society for Biochemistry and Molecular Biology, pp. 24657–24675, 2016.","ama":"Letts JA, Degliesposti G, Fiedorczuk K, Skehel M, Sazanov LA. Purification of ovine respiratory complex i results in a highly active and stable preparation. <i>Journal of Biological Chemistry</i>. 2016;291(47):24657-24675. doi:<a href=\"https://doi.org/10.1074/jbc.M116.735142\">10.1074/jbc.M116.735142</a>","chicago":"Letts, James A, Gianluca Degliesposti, Karol Fiedorczuk, Mark Skehel, and Leonid A Sazanov. “Purification of Ovine Respiratory Complex i Results in a Highly Active and Stable Preparation.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2016. <a href=\"https://doi.org/10.1074/jbc.M116.735142\">https://doi.org/10.1074/jbc.M116.735142</a>.","short":"J.A. Letts, G. Degliesposti, K. Fiedorczuk, M. Skehel, L.A. Sazanov, Journal of Biological Chemistry 291 (2016) 24657–24675.","apa":"Letts, J. A., Degliesposti, G., Fiedorczuk, K., Skehel, M., &#38; Sazanov, L. A. (2016). Purification of ovine respiratory complex i results in a highly active and stable preparation. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M116.735142\">https://doi.org/10.1074/jbc.M116.735142</a>","mla":"Letts, James A., et al. “Purification of Ovine Respiratory Complex i Results in a Highly Active and Stable Preparation.” <i>Journal of Biological Chemistry</i>, vol. 291, no. 47, American Society for Biochemistry and Molecular Biology, 2016, pp. 24657–75, doi:<a href=\"https://doi.org/10.1074/jbc.M116.735142\">10.1074/jbc.M116.735142</a>.","ista":"Letts JA, Degliesposti G, Fiedorczuk K, Skehel M, Sazanov LA. 2016. Purification of ovine respiratory complex i results in a highly active and stable preparation. Journal of Biological Chemistry. 291(47), 24657–24675."},"department":[{"_id":"LeSa"}],"status":"public","date_updated":"2021-01-12T06:49:06Z","type":"journal_article","author":[{"full_name":"Letts, James A","first_name":"James A","orcid":"0000-0002-9864-3586","id":"322DA418-F248-11E8-B48F-1D18A9856A87","last_name":"Letts"},{"last_name":"Degliesposti","full_name":"Degliesposti, Gianluca","first_name":"Gianluca"},{"full_name":"Fiedorczuk, Karol","first_name":"Karol","id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0","last_name":"Fiedorczuk"},{"full_name":"Skehel, Mark","first_name":"Mark","last_name":"Skehel"},{"id":"338D39FE-F248-11E8-B48F-1D18A9856A87","last_name":"Sazanov","full_name":"Sazanov, Leonid A","orcid":"0000-0002-0977-7989","first_name":"Leonid A"}],"acknowledgement":"J.A.S supported in part by a Medical Research D.G.Council UK Ph.D. fellowship.\r\nThis work was supported in part by European Union's 2020 Research and Innovation Program under Grant 701309. \r\n","issue":"47","oa_version":"Submitted Version","oa":1,"month":"11"},{"type":"book_chapter","publist_id":"6135","publisher":"Humana Press","date_updated":"2021-01-12T06:49:07Z","status":"public","title":"Real time analysis of the apical hook development","page":"1 - 8","doi":"10.1007/978-1-4939-6469-7_1","department":[{"_id":"EvBe"}],"date_created":"2018-12-11T11:50:44Z","month":"11","language":[{"iso":"eng"}],"publication":"Plant Hormones","oa_version":"None","date_published":"2016-11-19T00:00:00Z","publication_status":"published","scopus_import":1,"author":[{"first_name":"Qiang","full_name":"Zhu, Qiang","last_name":"Zhu","id":"40A4B9E6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Žádníková","first_name":"Petra","full_name":"Žádníková, Petra"},{"last_name":"Smet","first_name":"Dajo","full_name":"Smet, Dajo"},{"first_name":"Dominique","full_name":"Van Der Straeten, Dominique","last_name":"Van Der Straeten"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","first_name":"Eva"}],"acknowledgement":"We thank Herman  \r\nHöfte \r\n, Todor Asenov, Robert Hauschield, and \r\nMarcal  Gallemi  for  help  with  the  establishment  of  the  real-time  \r\nimaging platform and technical support. This work was supported \r\nby the Czech Science Foundation (GA13-39982S) to Eva Benková. \r\nDominique   Van   Der   Straeten   acknowledges   the   Research   \r\nFoundation  Flanders  for  fi\r\n  nancial  support  (G.0656.13N).  Dajo  \r\nSmet holds a PhD fellowship of the Research Foundation Flanders. ","alternative_title":["Methods in Molecular Biology"],"volume":1497,"abstract":[{"lang":"eng","text":"Mechanisms for cell protection are essential for survival of multicellular organisms. In plants, the apical hook, which is transiently formed in darkness when the germinating seedling penetrates towards the soil surface, plays such protective role and shields the vitally important shoot apical meristem and cotyledons from damage. The apical hook is formed by bending of the upper hypocotyl soon after germination, and it is maintained in a closed stage while the hypocotyl continues to penetrate through the soil and rapidly opens when exposed to light in proximity of the soil surface. To uncover the complex molecular network orchestrating this spatiotemporally tightly coordinated process, monitoring of the apical hook development in real time is indispensable. Here we describe an imaging platform that enables high-resolution kinetic analysis of this dynamic developmental process. © Springer Science+Business Media New York 2017."}],"day":"19","citation":{"chicago":"Zhu, Qiang, Petra Žádníková, Dajo Smet, Dominique Van Der Straeten, and Eva Benková. “Real Time Analysis of the Apical Hook Development.” In <i>Plant Hormones</i>, 1497:1–8. Humana Press, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">https://doi.org/10.1007/978-1-4939-6469-7_1</a>.","short":"Q. Zhu, P. Žádníková, D. Smet, D. Van Der Straeten, E. Benková, in:, Plant Hormones, Humana Press, 2016, pp. 1–8.","apa":"Zhu, Q., Žádníková, P., Smet, D., Van Der Straeten, D., &#38; Benková, E. (2016). Real time analysis of the apical hook development. In <i>Plant Hormones</i> (Vol. 1497, pp. 1–8). Humana Press. <a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">https://doi.org/10.1007/978-1-4939-6469-7_1</a>","ieee":"Q. Zhu, P. Žádníková, D. Smet, D. Van Der Straeten, and E. Benková, “Real time analysis of the apical hook development,” in <i>Plant Hormones</i>, vol. 1497, Humana Press, 2016, pp. 1–8.","ama":"Zhu Q, Žádníková P, Smet D, Van Der Straeten D, Benková E. Real time analysis of the apical hook development. In: <i>Plant Hormones</i>. Vol 1497. Humana Press; 2016:1-8. doi:<a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">10.1007/978-1-4939-6469-7_1</a>","ista":"Zhu Q, Žádníková P, Smet D, Van Der Straeten D, Benková E. 2016.Real time analysis of the apical hook development. In: Plant Hormones. Methods in Molecular Biology, vol. 1497, 1–8.","mla":"Zhu, Qiang, et al. “Real Time Analysis of the Apical Hook Development.” <i>Plant Hormones</i>, vol. 1497, Humana Press, 2016, pp. 1–8, doi:<a href=\"https://doi.org/10.1007/978-1-4939-6469-7_1\">10.1007/978-1-4939-6469-7_1</a>."},"quality_controlled":"1","intvolume":"      1497","_id":"1210","year":"2016","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Cell Press","publist_id":"6138","pubrep_id":"1008","doi":"10.1016/j.cub.2016.08.067","page":"3026 - 3032","title":"Termination of shoot gravitropic responses by auxin feedback on PIN3 polarity","file_date_updated":"2020-07-14T12:44:39Z","date_published":"2016-11-21T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:44Z","publication":"Current Biology","has_accepted_license":"1","publication_status":"published","scopus_import":1,"abstract":[{"text":"Plants adjust their growth according to gravity. Gravitropism involves gravity perception, signal transduction, and asymmetric growth response, with organ bending as a consequence [1]. Asymmetric growth results from the asymmetric distribution of the plant-specific signaling molecule auxin [2] that is generated by lateral transport, mediated in the hypocotyl predominantly by the auxin transporter PIN-FORMED3 (PIN3) [3–5]. Gravity stimulation polarizes PIN3 to the bottom sides of endodermal cells, correlating with increased auxin accumulation in adjacent tissues at the lower side of the stimulated organ, where auxin induces cell elongation and, hence, organ bending. A curvature response allows the hypocotyl to resume straight growth at a defined angle [6], implying that at some point auxin symmetry is restored to prevent overbending. Here, we present initial insights into cellular and molecular mechanisms that lead to the termination of the tropic response. We identified an auxin feedback on PIN3 polarization as underlying mechanism that restores symmetry of the PIN3-dependent auxin flow. Thus, two mechanistically distinct PIN3 polarization events redirect auxin fluxes at different time points of the gravity response: first, gravity-mediated redirection of PIN3-mediated auxin flow toward the lower hypocotyl side, where auxin gradually accumulates and promotes growth, and later PIN3 polarization to the opposite cell side, depleting this auxin maximum to end the bending. Accordingly, genetic or pharmacological interference with the late PIN3 polarization prevents termination of the response and leads to hypocotyl overbending. This observation reveals a role of auxin feedback on PIN polarity in the termination of the tropic response. © 2016 Elsevier Ltd","lang":"eng"}],"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:09:33Z","date_updated":"2020-07-14T12:44:39Z","creator":"system","access_level":"open_access","checksum":"79ed2498185a027cf51a8f88100379e6","file_name":"IST-2018-1008-v1+1_Rakusova_CurrBiol_2016_proof.pdf","file_id":"4757","relation":"main_file","file_size":5391923}],"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"        26","status":"public","date_updated":"2021-01-12T06:49:08Z","type":"journal_article","department":[{"_id":"JiFr"}],"oa_version":"Submitted Version","oa":1,"month":"11","acknowledgement":"We thank Dr. Jie Li (Key Laboratory of Plant Molecular Physiology, Chinese Academy of Science, China) for the pPIN3::PIN3-GFP/DII::VENUS line and Martine De Cock for help in preparing the manuscript. This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP), by the Czech Science Foundation GAČR (GA13-40637S) to J.F., and by the Ministry of Education, Youth and Sports of the Czech Republic under the project CEITEC 2020 (LQ1601) to H.S.R. H.R. is indebted to the Agency for Innovation by Science and Technology (IWT) for a predoctoral fellowship.\r\n","author":[{"last_name":"Rakusová","full_name":"Rakusová, Hana","first_name":"Hana"},{"id":"47E8FC1C-F248-11E8-B48F-1D18A9856A87","last_name":"Abbas","full_name":"Abbas, Mohamad","first_name":"Mohamad"},{"last_name":"Han","id":"31435098-F248-11E8-B48F-1D18A9856A87","first_name":"Huibin","full_name":"Han, Huibin"},{"full_name":"Song, Siyuan","first_name":"Siyuan","last_name":"Song"},{"full_name":"Robert, Hélène","first_name":"Hélène","last_name":"Robert"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","first_name":"Jirí"}],"ddc":["581"],"issue":"22","volume":26,"project":[{"call_identifier":"FP7","name":"Polarity and subcellular dynamics in plants","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"}],"day":"21","ec_funded":1,"citation":{"short":"H. Rakusová, M. Abbas, H. Han, S. Song, H. Robert, J. Friml, Current Biology 26 (2016) 3026–3032.","chicago":"Rakusová, Hana, Mohamad Abbas, Huibin Han, Siyuan Song, Hélène Robert, and Jiří Friml. “Termination of Shoot Gravitropic Responses by Auxin Feedback on PIN3 Polarity.” <i>Current Biology</i>. Cell Press, 2016. <a href=\"https://doi.org/10.1016/j.cub.2016.08.067\">https://doi.org/10.1016/j.cub.2016.08.067</a>.","apa":"Rakusová, H., Abbas, M., Han, H., Song, S., Robert, H., &#38; Friml, J. (2016). Termination of shoot gravitropic responses by auxin feedback on PIN3 polarity. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2016.08.067\">https://doi.org/10.1016/j.cub.2016.08.067</a>","ama":"Rakusová H, Abbas M, Han H, Song S, Robert H, Friml J. Termination of shoot gravitropic responses by auxin feedback on PIN3 polarity. <i>Current Biology</i>. 2016;26(22):3026-3032. doi:<a href=\"https://doi.org/10.1016/j.cub.2016.08.067\">10.1016/j.cub.2016.08.067</a>","ieee":"H. Rakusová, M. Abbas, H. Han, S. Song, H. Robert, and J. Friml, “Termination of shoot gravitropic responses by auxin feedback on PIN3 polarity,” <i>Current Biology</i>, vol. 26, no. 22. Cell Press, pp. 3026–3032, 2016.","ista":"Rakusová H, Abbas M, Han H, Song S, Robert H, Friml J. 2016. Termination of shoot gravitropic responses by auxin feedback on PIN3 polarity. Current Biology. 26(22), 3026–3032.","mla":"Rakusová, Hana, et al. “Termination of Shoot Gravitropic Responses by Auxin Feedback on PIN3 Polarity.” <i>Current Biology</i>, vol. 26, no. 22, Cell Press, 2016, pp. 3026–32, doi:<a href=\"https://doi.org/10.1016/j.cub.2016.08.067\">10.1016/j.cub.2016.08.067</a>."},"year":"2016","_id":"1212"},{"year":"2016","_id":"1214","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Martius, Georg S, Raphael Hostettler, Alois Knoll, and Ralf Der. “Compliant Control for Soft Robots: Emergent Behavior of a Tendon Driven Anthropomorphic Arm,” Vol. 2016–November. IEEE, 2016. <a href=\"https://doi.org/10.1109/IROS.2016.7759138\">https://doi.org/10.1109/IROS.2016.7759138</a>.","short":"G.S. Martius, R. Hostettler, A. Knoll, R. Der, in:, IEEE, 2016.","apa":"Martius, G. S., Hostettler, R., Knoll, A., &#38; Der, R. (2016). Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm (Vol. 2016–November). Presented at the IEEE RSJ International Conference on Intelligent Robots and Systems IROS , Daejeon, Korea: IEEE. <a href=\"https://doi.org/10.1109/IROS.2016.7759138\">https://doi.org/10.1109/IROS.2016.7759138</a>","ama":"Martius GS, Hostettler R, Knoll A, Der R. Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm. In: Vol 2016-November. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/IROS.2016.7759138\">10.1109/IROS.2016.7759138</a>","ieee":"G. S. Martius, R. Hostettler, A. Knoll, and R. Der, “Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm,” presented at the IEEE RSJ International Conference on Intelligent Robots and Systems IROS , Daejeon, Korea, 2016, vol. 2016–November.","ista":"Martius GS, Hostettler R, Knoll A, Der R. 2016. Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm. IEEE RSJ International Conference on Intelligent Robots and Systems IROS  vol. 2016–November, 7759138.","mla":"Martius, Georg S., et al. <i>Compliant Control for Soft Robots: Emergent Behavior of a Tendon Driven Anthropomorphic Arm</i>. Vol. 2016–November, 7759138, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/IROS.2016.7759138\">10.1109/IROS.2016.7759138</a>."},"article_number":"7759138","quality_controlled":"1","abstract":[{"lang":"eng","text":"With the accelerated development of robot technologies, optimal control becomes one of the central themes of research. In traditional approaches, the controller, by its internal functionality, finds appropriate actions on the basis of the history of sensor values, guided by the goals, intentions, objectives, learning schemes, and so forth. While very successful with classical robots, these methods run into severe difficulties when applied to soft robots, a new field of robotics with large interest for human-robot interaction. We claim that a novel controller paradigm opens new perspective for this field. This paper applies a recently developed neuro controller with differential extrinsic synaptic plasticity to a muscle-tendon driven arm-shoulder system from the Myorobotics toolkit. In the experiments, we observe a vast variety of self-organized behavior patterns: when left alone, the arm realizes pseudo-random sequences of different poses. By applying physical forces, the system can be entrained into definite motion patterns like wiping a table. Most interestingly, after attaching an object, the controller gets in a functional resonance with the object's internal dynamics, starting to shake spontaneously bottles half-filled with water or sensitively driving an attached pendulum into a circular mode. When attached to the crank of a wheel the neural system independently develops to rotate it. In this way, the robot discovers affordances of objects its body is interacting with."}],"day":"28","volume":"2016-November","conference":{"start_date":"2016-09-09","end_date":"2016-09-14","location":"Daejeon, Korea","name":"IEEE RSJ International Conference on Intelligent Robots and Systems IROS "},"publication_status":"published","scopus_import":1,"acknowledgement":"RD thanks for the hospitality at the Max-Planck-Institute and for helpful discussions with Nihat Ay and Keyan Zahedi.","author":[{"first_name":"Georg S","full_name":"Martius, Georg S","last_name":"Martius","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hostettler","first_name":"Raphael","full_name":"Hostettler, Raphael"},{"last_name":"Knoll","first_name":"Alois","full_name":"Knoll, Alois"},{"first_name":"Ralf","full_name":"Der, Ralf","last_name":"Der"}],"month":"11","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:45Z","oa_version":"None","date_published":"2016-11-28T00:00:00Z","title":"Compliant control for soft robots: Emergent behavior of a tendon driven anthropomorphic arm","doi":"10.1109/IROS.2016.7759138","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"type":"conference","publist_id":"6121","publisher":"IEEE","date_updated":"2021-01-12T06:49:08Z","status":"public"},{"abstract":[{"lang":"eng","text":"How likely is it that a population escapes extinction through adaptive evolution? The answer to this question is of great relevance in conservation biology, where we aim at species’ rescue and the maintenance of biodiversity, and in agriculture and medicine, where we seek to hamper the emergence of pesticide or drug resistance. By reshuffling the genome, recombination has two antagonistic effects on the probability of evolutionary rescue: It generates and it breaks up favorable gene combinations. Which of the two effects prevails depends on the fitness effects of mutations and on the impact of stochasticity on the allele frequencies. In this article, we analyze a mathematical model for rescue after a sudden environmental change when adaptation is contingent on mutations at two loci. The analysis reveals a complex nonlinear dependence of population survival on recombination. We moreover find that, counterintuitively, a fast eradication of the wild type can promote rescue in the presence of recombination. The model also shows that two-step rescue is not unlikely to happen and can even be more likely than single-step rescue (where adaptation relies on a single mutation), depending on the circumstances."}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"       202","publist_id":"6091","publisher":"Genetics Society of America","page":"721 - 732","doi":"10.1534/genetics.115.180299","title":"The role of recombination in evolutionary rescue","date_published":"2016-02-01T00:00:00Z","date_created":"2018-12-11T11:50:54Z","language":[{"iso":"eng"}],"publication":"Genetics","scopus_import":"1","publication_status":"published","project":[{"name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","call_identifier":"FP7"},{"_id":"25B67606-B435-11E9-9278-68D0E5697425","name":"L'OREAL Fellowship"}],"volume":202,"main_file_link":[{"open_access":"1","url":"http://biorxiv.org/content/early/2015/07/06/022020.abstract"}],"article_processing_charge":"No","ec_funded":1,"day":"01","citation":{"ama":"Uecker H, Hermisson J. The role of recombination in evolutionary rescue. <i>Genetics</i>. 2016;202(2):721-732. doi:<a href=\"https://doi.org/10.1534/genetics.115.180299\">10.1534/genetics.115.180299</a>","ieee":"H. Uecker and J. Hermisson, “The role of recombination in evolutionary rescue,” <i>Genetics</i>, vol. 202, no. 2. Genetics Society of America, pp. 721–732, 2016.","chicago":"Uecker, Hildegard, and Joachim Hermisson. “The Role of Recombination in Evolutionary Rescue.” <i>Genetics</i>. Genetics Society of America, 2016. <a href=\"https://doi.org/10.1534/genetics.115.180299\">https://doi.org/10.1534/genetics.115.180299</a>.","short":"H. Uecker, J. Hermisson, Genetics 202 (2016) 721–732.","apa":"Uecker, H., &#38; Hermisson, J. (2016). The role of recombination in evolutionary rescue. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.115.180299\">https://doi.org/10.1534/genetics.115.180299</a>","mla":"Uecker, Hildegard, and Joachim Hermisson. “The Role of Recombination in Evolutionary Rescue.” <i>Genetics</i>, vol. 202, no. 2, Genetics Society of America, 2016, pp. 721–32, doi:<a href=\"https://doi.org/10.1534/genetics.115.180299\">10.1534/genetics.115.180299</a>.","ista":"Uecker H, Hermisson J. 2016. The role of recombination in evolutionary rescue. Genetics. 202(2), 721–732."},"year":"2016","_id":"1241","status":"public","date_updated":"2026-06-18T07:59:00Z","type":"journal_article","department":[{"_id":"NiBa"}],"oa_version":"Preprint","oa":1,"month":"02","author":[{"last_name":"Uecker","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87","first_name":"Hildegard","orcid":"0000-0001-9435-2813","full_name":"Uecker, Hildegard"},{"last_name":"Hermisson","full_name":"Hermisson, Joachim","first_name":"Joachim"}],"acknowledgement":"This work was made possible by a “For Women in Science” fellowship (L’Oréal Österreich in cooperation with the Austrian Commission for the United Nations Educational, Scientific, and Cultural Organization and the Austrian Academy of Sciences with financial support from the Federal Ministry for Science and Research Austria) and European Research Council grant 250152 (to Nick Barton).","das_tickbox":"1","ddc":["570"],"issue":"2"},{"volume":56,"article_processing_charge":"No","publication_identifier":{"issn":["0032-0781","1471-9053"]},"citation":{"ista":"Johnson KCM, Xia S, Feng X, Li X. 2015. The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity. Plant and Cell Physiology. 56(8), 1616–1623.","mla":"Johnson, Kaeli C. M., et al. “The Chromatin Remodeler SPLAYED Negatively Regulates SNC1-Mediated Immunity.” <i>Plant and Cell Physiology</i>, vol. 56, no. 8, Oxford University Press, 2015, pp. 1616–23, doi:<a href=\"https://doi.org/10.1093/pcp/pcv087\">10.1093/pcp/pcv087</a>.","apa":"Johnson, K. C. M., Xia, S., Feng, X., &#38; Li, X. (2015). The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity. <i>Plant and Cell Physiology</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/pcp/pcv087\">https://doi.org/10.1093/pcp/pcv087</a>","short":"K.C.M. Johnson, S. Xia, X. Feng, X. Li, Plant and Cell Physiology 56 (2015) 1616–1623.","chicago":"Johnson, Kaeli C.M., Shitou Xia, Xiaoqi Feng, and Xin Li. “The Chromatin Remodeler SPLAYED Negatively Regulates SNC1-Mediated Immunity.” <i>Plant and Cell Physiology</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/pcp/pcv087\">https://doi.org/10.1093/pcp/pcv087</a>.","ama":"Johnson KCM, Xia S, Feng X, Li X. The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity. <i>Plant and Cell Physiology</i>. 2015;56(8):1616-1623. doi:<a href=\"https://doi.org/10.1093/pcp/pcv087\">10.1093/pcp/pcv087</a>","ieee":"K. C. M. Johnson, S. Xia, X. Feng, and X. Li, “The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity,” <i>Plant and Cell Physiology</i>, vol. 56, no. 8. Oxford University Press, pp. 1616–1623, 2015."},"article_type":"original","year":"2015","_id":"12196","status":"public","date_updated":"2023-05-08T11:03:23Z","type":"journal_article","department":[{"_id":"XiFe"}],"external_id":{"pmid":["26063389"]},"keyword":["Cell Biology","Plant Science","Physiology","General Medicine"],"oa_version":"None","month":"08","acknowledgement":"This work was supported by the National Sciences and Engineering Research Council of Canada [Canada Graduate\r\nScholarship–Doctoral to K.J.; Discovery Grant to X.L.]; the department of Botany at the University of f British Columbia\r\n[the Dewar Cooper Memorial Fund to X.L.].The authors would like to thank Dr. Yuelin Zhang and Ms. Yan Li for their assistance with next-generation sequencing, and Mr. Charles Copeland for critical reading of the manuscript.","author":[{"last_name":"Johnson","first_name":"Kaeli C.M.","full_name":"Johnson, Kaeli C.M."},{"last_name":"Xia","full_name":"Xia, Shitou","first_name":"Shitou"},{"first_name":"Xiaoqi","orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi","last_name":"Feng","id":"e0164712-22ee-11ed-b12a-d80fcdf35958"},{"first_name":"Xin","full_name":"Li, Xin","last_name":"Li"}],"extern":"1","issue":"8","pmid":1,"abstract":[{"text":"SNC1 (SUPPRESSOR OF NPR1, CONSTITUTIVE 1) is one of a suite of intracellular Arabidopsis NOD-like receptor (NLR) proteins which, upon activation, result in the induction of defense responses. However, the molecular mechanisms underlying NLR activation and the subsequent provocation of immune responses are only partially characterized. To identify negative regulators of NLR-mediated immunity, a forward genetic screen was undertaken to search for enhancers of the dwarf, autoimmune gain-of-function snc1 mutant. To avoid lethality resulting from severe dwarfism, the screen was conducted using mos4 (modifier of snc1, 4) snc1 plants, which display wild-type-like morphology and resistance. M2 progeny were screened for mutant, snc1-enhancing (muse) mutants displaying a reversion to snc1-like phenotypes. The muse9 mos4 snc1 triple mutant was found to exhibit dwarf morphology, elevated expression of the pPR2-GUS defense marker reporter gene and enhanced resistance to the oomycete pathogen Hyaloperonospora arabidopsidis Noco2. Via map-based cloning and Illumina sequencing, it was determined that the muse9 mutation is in the gene encoding the SWI/SNF chromatin remodeler SYD (SPLAYED), and was thus renamed syd-10. The syd-10 single mutant has no observable alteration from wild-type-like resistance, although the syd-4 T-DNA insertion allele displays enhanced resistance to the bacterial pathogen Pseudomonas syringae pv. maculicola ES4326. Transcription of SNC1 is increased in both syd-4 and syd-10. These data suggest that SYD plays a subtle, specific role in the regulation of SNC1 expression and SNC1-mediated immunity. SYD may work with other proteins at the chromatin level to repress SNC1 transcription; such regulation is important for fine-tuning the expression of NLR-encoding genes to prevent unpropitious autoimmunity.","lang":"eng"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        56","publisher":"Oxford University Press","page":"1616-1623","doi":"10.1093/pcp/pcv087","title":"The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity","date_published":"2015-08-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2023-01-16T09:20:22Z","publication":"Plant and Cell Physiology","publication_status":"published","scopus_import":"1"},{"publisher":"MIT Press","page":"78","doi":"10.7551/978-0-262-33027-5-ch018","file_date_updated":"2023-05-02T07:02:59Z","title":"Quantifying self-organizing behavior of autonomous robots","date_published":"2015-07-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2023-04-30T22:01:07Z","publication":"Proceedings of the 13th European Conference on Artificial Life","has_accepted_license":"1","publication_status":"published","scopus_import":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"content_type":"application/pdf","date_created":"2023-05-02T07:02:59Z","creator":"dernst","date_updated":"2023-05-02T07:02:59Z","file_size":1674241,"relation":"main_file","file_id":"12882","file_name":"2015_ECAL_Martius.pdf","access_level":"open_access","checksum":"880eabe59c9df12f06a882aa1bc4e600"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2023-05-02T07:06:21Z","type":"conference","department":[{"_id":"ChLa"}],"oa_version":"Published Version","month":"07","oa":1,"acknowledgement":"This work was supported by the DFG (SPP 1527) and the EU (FP7, REA grant no 291734).","author":[{"last_name":"Martius","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","first_name":"Georg S","full_name":"Martius, Georg S"},{"full_name":"Olbrich, Eckehard","first_name":"Eckehard","last_name":"Olbrich"}],"ddc":["000"],"conference":{"start_date":"2015-07-20","location":"York, United Kingdom","end_date":"2015-07-24","name":"ECAL: European Conference on Artificial Life"},"project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"article_processing_charge":"No","day":"01","ec_funded":1,"publication_identifier":{"isbn":["9780262330275"]},"citation":{"ista":"Martius GS, Olbrich E. 2015. Quantifying self-organizing behavior of autonomous robots. Proceedings of the 13th European Conference on Artificial Life. ECAL: European Conference on Artificial Life, 78.","mla":"Martius, Georg S., and Eckehard Olbrich. “Quantifying Self-Organizing Behavior of Autonomous Robots.” <i>Proceedings of the 13th European Conference on Artificial Life</i>, MIT Press, 2015, p. 78, doi:<a href=\"https://doi.org/10.7551/978-0-262-33027-5-ch018\">10.7551/978-0-262-33027-5-ch018</a>.","apa":"Martius, G. S., &#38; Olbrich, E. (2015). Quantifying self-organizing behavior of autonomous robots. In <i>Proceedings of the 13th European Conference on Artificial Life</i> (p. 78). York, United Kingdom: MIT Press. <a href=\"https://doi.org/10.7551/978-0-262-33027-5-ch018\">https://doi.org/10.7551/978-0-262-33027-5-ch018</a>","short":"G.S. Martius, E. Olbrich, in:, Proceedings of the 13th European Conference on Artificial Life, MIT Press, 2015, p. 78.","chicago":"Martius, Georg S, and Eckehard Olbrich. “Quantifying Self-Organizing Behavior of Autonomous Robots.” In <i>Proceedings of the 13th European Conference on Artificial Life</i>, 78. MIT Press, 2015. <a href=\"https://doi.org/10.7551/978-0-262-33027-5-ch018\">https://doi.org/10.7551/978-0-262-33027-5-ch018</a>.","ama":"Martius GS, Olbrich E. Quantifying self-organizing behavior of autonomous robots. In: <i>Proceedings of the 13th European Conference on Artificial Life</i>. MIT Press; 2015:78. doi:<a href=\"https://doi.org/10.7551/978-0-262-33027-5-ch018\">10.7551/978-0-262-33027-5-ch018</a>","ieee":"G. S. Martius and E. Olbrich, “Quantifying self-organizing behavior of autonomous robots,” in <i>Proceedings of the 13th European Conference on Artificial Life</i>, York, United Kingdom, 2015, p. 78."},"year":"2015","_id":"12881"},{"status":"public","date_updated":"2021-01-12T08:16:33Z","publist_id":"6851","publisher":"Oxford University Press","type":"journal_article","department":[{"_id":"CaHe"}],"page":"1423 - 1430","doi":"10.1093/glycob/cwv059","external_id":{"pmid":["26306635"]},"title":"Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis","date_published":"2015-12-01T00:00:00Z","oa_version":"None","date_created":"2018-12-11T11:48:35Z","language":[{"iso":"eng"}],"publication":"Glycobiology","month":"12","author":[{"full_name":"Engel, Jakob","first_name":"Jakob","last_name":"Engel"},{"full_name":"Schmalhorst, Philipp S","orcid":"0000-0002-5795-0133","first_name":"Philipp S","id":"309D50DA-F248-11E8-B48F-1D18A9856A87","last_name":"Schmalhorst"},{"first_name":"Anke","full_name":"Kruger, Anke","last_name":"Kruger"},{"full_name":"Muller, Christina","first_name":"Christina","last_name":"Muller"},{"first_name":"Falk","full_name":"Buettner, Falk","last_name":"Buettner"},{"full_name":"Routier, Françoise","first_name":"Françoise","last_name":"Routier"}],"scopus_import":1,"publication_status":"published","issue":"12","volume":25,"pmid":1,"abstract":[{"text":"Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at the plasma membrane of various eukaryotes with the important exception of mammals. In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man) linked at position 2 of the inositol. However, several pathogenic fungi additionally synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC, which is the most abundant GIPC synthesized by this fungus. In this study, we identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted deletion of the gene encoding GntA in A. fumigatus resulted in complete absence of zwitterionic GIPC; a phenotype that could be reverted by episomal expression of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid product resistant to saponification and to digestion by phosphatidylinositol-phospholipase C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.","lang":"eng"}],"day":"01","quality_controlled":"1","citation":{"mla":"Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” <i>Glycobiology</i>, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30, doi:<a href=\"https://doi.org/10.1093/glycob/cwv059\">10.1093/glycob/cwv059</a>.","ista":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology. 25(12), 1423–1430.","ama":"Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. <i>Glycobiology</i>. 2015;25(12):1423-1430. doi:<a href=\"https://doi.org/10.1093/glycob/cwv059\">10.1093/glycob/cwv059</a>","ieee":"J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier, “Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” <i>Glycobiology</i>, vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.","short":"J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier, Glycobiology 25 (2015) 1423–1430.","chicago":"Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.” <i>Glycobiology</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/glycob/cwv059\">https://doi.org/10.1093/glycob/cwv059</a>.","apa":"Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., &#38; Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. <i>Glycobiology</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/glycob/cwv059\">https://doi.org/10.1093/glycob/cwv059</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"802","year":"2015","intvolume":"        25"},{"date_updated":"2023-09-07T13:12:17Z","status":"public","type":"preprint","related_material":{"record":[{"id":"9308","relation":"later_version","status":"public"},{"relation":"later_version","id":"10220","status":"public"},{"status":"public","id":"8156","relation":"dissertation_contains"}]},"arxiv":1,"department":[{"_id":"UlWa"}],"external_id":{"arxiv":["1511.03501"]},"title":"Eliminating higher-multiplicity intersections, III. Codimension 2","date_published":"2015-11-15T00:00:00Z","date_created":"2020-07-30T10:45:19Z","oa":1,"language":[{"iso":"eng"}],"month":"11","publication":"arXiv","oa_version":"Preprint","author":[{"full_name":"Avvakumov, Sergey","first_name":"Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","last_name":"Avvakumov"},{"first_name":"Isaac","full_name":"Mabillard, Isaac","last_name":"Mabillard","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"A.","full_name":"Skopenkov, A.","last_name":"Skopenkov"},{"first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M. Tancer, P. Teichner and anonymous referees for helpful discussions.","publication_status":"submitted","article_processing_charge":"No","main_file_link":[{"url":"https://arxiv.org/abs/1511.03501","open_access":"1"}],"abstract":[{"text":"We study conditions under which a finite simplicial complex $K$ can be mapped to $\\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\\to \\mathbb R^d$ such that the images of any $r$\r\npairwise disjoint simplices of $K$ do not have a common point. We show that if $r$ is not a prime power and $d\\geq 2r+1$, then there is a counterexample to the topological Tverberg conjecture, i.e., there is an almost $r$-embedding of\r\nthe $(d+1)(r-1)$-simplex in $\\mathbb R^d$. This improves on previous constructions of counterexamples (for $d\\geq 3r$) based on a series of papers by M. \\\"Ozaydin, M. Gromov, P. Blagojevi\\'c, F. Frick, G. Ziegler, and the second and fourth present authors. The counterexamples are obtained by proving the following algebraic criterion in codimension 2: If $r\\ge3$ and if $K$ is a finite $2(r-1)$-complex then there exists an almost $r$-embedding $K\\to \\mathbb R^{2r}$ if and only if there exists a general position PL map $f:K\\to \\mathbb R^{2r}$ such that the algebraic intersection number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero. This result can be restated in terms of cohomological obstructions or equivariant maps, and extends an analogous codimension 3 criterion by the second and fourth authors. As another application we classify ornaments $f:S^3 \\sqcup S^3\\sqcup S^3\\to \\mathbb R^5$ up to ornament\r\nconcordance. It follows from work of M. Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is false. We prove a lemma on singular higher-dimensional Borromean rings, yielding an elementary proof of the counterexample.","lang":"eng"}],"day":"15","article_number":"1511.03501","citation":{"mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” <i>ArXiv</i>, 1511.03501.","ista":"Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. arXiv, 1511.03501.","ama":"Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. <i>arXiv</i>.","ieee":"S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections, III. Codimension 2,” <i>arXiv</i>. .","chicago":"Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” <i>ArXiv</i>, n.d.","short":"S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).","apa":"Avvakumov, S., Mabillard, I., Skopenkov, A., &#38; Wagner, U. (n.d.). Eliminating higher-multiplicity intersections, III. Codimension 2. <i>arXiv</i>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8183","year":"2015"},{"publisher":"AAAI Press","publist_id":"5713","title":"Automatic generation of alternative starting positions for simple traditional board games","page":"745 - 752","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:52:16Z","publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","date_published":"2015-01-01T00:00:00Z","scopus_import":1,"publication_status":"published","abstract":[{"lang":"eng","text":"Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating targeted starting positions for such games. This can facilitate new approaches for bringing novice players to mastery, and also leads to discovery of interesting game variants. We present an approach that generates starting states of varying hardness levels for player 1 in a two-player board game, given rules of the board game, the desired number of steps required for player 1 to win, and the expertise levels of the two players. Our approach leverages symbolic methods and iterative simulation to efficiently search the extremely large state space. We present experimental results that include discovery of states of varying hardness levels for several simple grid-based board games. The presence of such states for standard game variants like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played as the default start state is heavily biased. "}],"quality_controlled":"1","intvolume":"         2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","date_updated":"2023-02-23T12:25:07Z","status":"public","related_material":{"record":[{"id":"5410","relation":"earlier_version","status":"public"}]},"department":[{"_id":"KrCh"}],"oa":1,"month":"01","oa_version":"None","author":[{"last_name":"Ahmed","full_name":"Ahmed, Umair","first_name":"Umair"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Sumit","full_name":"Gulwani, Sumit","last_name":"Gulwani"}],"acknowledgement":"A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n","volume":2,"conference":{"name":"AAAI: Conference on Artificial Intelligence","end_date":"2015-01-30","location":"Austin, TX, USA","start_date":"2015-01-25"},"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"day":"01","ec_funded":1,"main_file_link":[{"url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300","open_access":"1"}],"article_processing_charge":"No","citation":{"mla":"Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>, vol. 2, AAAI Press, 2015, pp. 745–52.","ista":"Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative starting positions for simple traditional board games. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2, 745–752.","ama":"Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting positions for simple traditional board games. In: <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>. Vol 2. AAAI Press; 2015:745-752.","ieee":"U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>, Austin, TX, USA, 2015, vol. 2, pp. 745–752.","chicago":"Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i>, 2:745–52. AAAI Press, 2015.","short":"U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.","apa":"Ahmed, U., Chatterjee, K., &#38; Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In <i>Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence</i> (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press."},"_id":"1481","year":"2015"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1483","year":"2015","publication_identifier":{"eisbn":["978-1-4673-6964-0 "]},"citation":{"chicago":"Reininghaus, Jan, Stefan Huber, Ulrich Bauer, and Roland Kwitt. “A Stable Multi-Scale Kernel for Topological Machine Learning,” 4741–48. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">https://doi.org/10.1109/CVPR.2015.7299106</a>.","short":"J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 4741–4748.","apa":"Reininghaus, J., Huber, S., Bauer, U., &#38; Kwitt, R. (2015). A stable multi-scale kernel for topological machine learning (pp. 4741–4748). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">https://doi.org/10.1109/CVPR.2015.7299106</a>","ama":"Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for topological machine learning. In: IEEE; 2015:4741-4748. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">10.1109/CVPR.2015.7299106</a>","ieee":"J. Reininghaus, S. Huber, U. Bauer, and R. Kwitt, “A stable multi-scale kernel for topological machine learning,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 4741–4748.","ista":"Reininghaus J, Huber S, Bauer U, Kwitt R. 2015. A stable multi-scale kernel for topological machine learning. CVPR: Computer Vision and Pattern Recognition, 4741–4748.","mla":"Reininghaus, Jan, et al. <i>A Stable Multi-Scale Kernel for Topological Machine Learning</i>. IEEE, 2015, pp. 4741–48, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299106\">10.1109/CVPR.2015.7299106</a>."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1412.6821"}],"day":"14","abstract":[{"lang":"eng","text":"Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this work, we establish such a connection by designing a multi-scale kernel for persistence diagrams, a stable summary representation of topological features in data. We show that this kernel is positive definite and prove its stability with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets for 3D shape classification/retrieval and texture recognition show considerable performance gains of the proposed method compared to an alternative approach that is based on the recently introduced persistence landscapes."}],"conference":{"start_date":"2015-06-07","end_date":"2015-06-12","location":"Boston, MA, USA","name":"CVPR: Computer Vision and Pattern Recognition"},"author":[{"first_name":"Jan","full_name":"Reininghaus, Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-8871-5814","first_name":"Stefan","full_name":"Huber, Stefan","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Bauer","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"full_name":"Kwitt, Roland","first_name":"Roland","last_name":"Kwitt"}],"scopus_import":1,"publication_status":"published","date_published":"2015-10-14T00:00:00Z","oa_version":"Preprint","language":[{"iso":"eng"}],"month":"10","oa":1,"date_created":"2018-12-11T11:52:17Z","department":[{"_id":"HeEd"}],"page":"4741 - 4748","doi":"10.1109/CVPR.2015.7299106","title":"A stable multi-scale kernel for topological machine learning","status":"public","publisher":"IEEE","publist_id":"5709","date_updated":"2021-01-12T06:51:03Z","type":"conference"},{"year":"2015","_id":"1495","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","citation":{"apa":"Edelsbrunner, H., Iglesias Ham, M., &#38; Kurlin, V. (2015). Relaxed disk packing. In <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i> (Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.","chicago":"Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed Disk Packing.” In <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, 2015–August:128–35. Queen’s University, 2015.","short":"H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th Canadian Conference on Computational Geometry, Queen’s University, 2015, pp. 128–135.","ieee":"H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, Ontario, Canada, 2015, vol. 2015–August, pp. 128–135.","ama":"Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>. Vol 2015-August. Queen’s University; 2015:128-135.","ista":"Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry vol. 2015–August, 128–135.","mla":"Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, vol. 2015–August, Queen’s University, 2015, pp. 128–35."},"abstract":[{"text":"Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the regular hexagonal grid gives the maximum among lattice configurations. ","lang":"eng"}],"ec_funded":1,"day":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1505.03402"}],"project":[{"call_identifier":"FP7","name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"CCCG: Canadian Conference on Computational Geometry","start_date":"2015-08-10","end_date":"2015-08-12","location":"Ontario, Canada"},"volume":"2015-August","publication_status":"published","scopus_import":1,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Mabel","full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vitaliy","full_name":"Kurlin, Vitaliy","last_name":"Kurlin"}],"oa_version":"Submitted Version","month":"08","oa":1,"date_created":"2018-12-11T11:52:21Z","publication":"Proceedings of the 27th Canadian Conference on Computational Geometry","language":[{"iso":"eng"}],"date_published":"2015-08-01T00:00:00Z","title":"Relaxed disk packing","department":[{"_id":"HeEd"}],"page":"128-135","type":"conference","status":"public","publist_id":"5684","date_updated":"2021-01-12T06:51:09Z","publisher":"Queen's University"},{"oa_version":"Published Version","month":"07","oa":1,"issue":"21","author":[{"last_name":"Andergassen","first_name":"Daniel","full_name":"Andergassen, Daniel"},{"full_name":"Dotter, Christoph","first_name":"Christoph","id":"4C66542E-F248-11E8-B48F-1D18A9856A87","last_name":"Dotter"},{"first_name":"Tomasz","full_name":"Kulinski, Tomasz","last_name":"Kulinski"},{"full_name":"Guenzl, Philipp","first_name":"Philipp","last_name":"Guenzl"},{"first_name":"Philipp","full_name":"Bammer, Philipp","last_name":"Bammer"},{"full_name":"Barlow, Denise","first_name":"Denise","last_name":"Barlow"},{"full_name":"Pauler, Florian","first_name":"Florian","last_name":"Pauler"},{"last_name":"Hudson","first_name":"Quanah","full_name":"Hudson, Quanah"}],"acknowledgement":"Austrian Science Fund [FWF P25185-B22, FWF F4302- B09, FWFW1207-B09]. Funding for open access charge: Austrian Science Fund.\r\nWe thank Florian Breitwieser for advice during the early stages of this project. High-throughput sequencing was conducted by the Biomedical Sequencing Facility (BSF) at CeMM in Vienna.","ddc":["570"],"type":"journal_article","status":"public","date_updated":"2021-01-12T06:51:09Z","department":[{"_id":"GaNo"}],"citation":{"ama":"Andergassen D, Dotter C, Kulinski T, et al. Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. <i>Nucleic Acids Research</i>. 2015;43(21). doi:<a href=\"https://doi.org/10.1093/nar/gkv727\">10.1093/nar/gkv727</a>","ieee":"D. Andergassen <i>et al.</i>, “Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data,” <i>Nucleic Acids Research</i>, vol. 43, no. 21. Oxford University Press, 2015.","apa":"Andergassen, D., Dotter, C., Kulinski, T., Guenzl, P., Bammer, P., Barlow, D., … Hudson, Q. (2015). Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. <i>Nucleic Acids Research</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/nar/gkv727\">https://doi.org/10.1093/nar/gkv727</a>","chicago":"Andergassen, Daniel, Christoph Dotter, Tomasz Kulinski, Philipp Guenzl, Philipp Bammer, Denise Barlow, Florian Pauler, and Quanah Hudson. “Allelome.PRO, a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing Data.” <i>Nucleic Acids Research</i>. Oxford University Press, 2015. <a href=\"https://doi.org/10.1093/nar/gkv727\">https://doi.org/10.1093/nar/gkv727</a>.","short":"D. Andergassen, C. Dotter, T. Kulinski, P. Guenzl, P. Bammer, D. Barlow, F. Pauler, Q. Hudson, Nucleic Acids Research 43 (2015).","mla":"Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing Data.” <i>Nucleic Acids Research</i>, vol. 43, no. 21, e146, Oxford University Press, 2015, doi:<a href=\"https://doi.org/10.1093/nar/gkv727\">10.1093/nar/gkv727</a>.","ista":"Andergassen D, Dotter C, Kulinski T, Guenzl P, Bammer P, Barlow D, Pauler F, Hudson Q. 2015. Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. Nucleic Acids Research. 43(21), e146."},"article_number":"e146","_id":"1497","year":"2015","volume":43,"day":"21","publication":"Nucleic Acids Research","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:52:22Z","date_published":"2015-07-21T00:00:00Z","scopus_import":1,"publication_status":"published","has_accepted_license":"1","publist_id":"5682","publisher":"Oxford University Press","file_date_updated":"2020-07-14T12:44:58Z","title":"Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data","doi":"10.1093/nar/gkv727","quality_controlled":"1","intvolume":"        43","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Detecting allelic biases from high-throughput sequencing data requires an approach that maximises sensitivity while minimizing false positives. Here, we present Allelome.PRO, an automated user-friendly bioinformatics pipeline, which uses high-throughput sequencing data from reciprocal crosses of two genetically distinct mouse strains to detect allele-specific expression and chromatin modifications. Allelome.PRO extends approaches used in previous studies that exclusively analyzed imprinted expression to give a complete picture of the ‘allelome’ by automatically categorising the allelic expression of all genes in a given cell type into imprinted, strain-biased, biallelic or non-informative. Allelome.PRO offers increased sensitivity to analyze lowly expressed transcripts, together with a robust false discovery rate empirically calculated from variation in the sequencing data. We used RNA-seq data from mouse embryonic fibroblasts from F1 reciprocal crosses to determine a biologically relevant allelic ratio cutoff, and define for the first time an entire allelome. Furthermore, we show that Allelome.PRO detects differential enrichment of H3K4me3 over promoters from ChIP-seq data validating the RNA-seq results. This approach can be easily extended to analyze histone marks of active enhancers, or transcription factor binding sites and therefore provides a powerful tool to identify candidate cis regulatory elements genome wide."}],"file":[{"date_created":"2018-12-20T14:18:57Z","content_type":"application/pdf","file_name":"2015_NucleicAcidsRes_Andergassen.pdf","relation":"main_file","file_size":6863297,"file_id":"5768","checksum":"385b83854fd0eb2e4f386867da2823e2","access_level":"open_access","creator":"dernst","date_updated":"2020-07-14T12:44:58Z"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"publication_status":"published","scopus_import":1,"has_accepted_license":"1","date_created":"2018-12-11T11:52:22Z","language":[{"iso":"eng"}],"date_published":"2015-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:44:58Z","title":"The need for language support for fault-tolerant distributed systems","pubrep_id":"499","page":"90 - 102","doi":"10.4230/LIPIcs.SNAPL.2015.90","publist_id":"5681","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","intvolume":"        32","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","abstract":[{"text":"Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. Nonetheless there is surprisingly little language and verification support to build distributed systems based on fault-tolerant algorithms. In this paper, we present some of the challenges that a designer has to overcome to implement a fault-tolerant distributed system. Then we review different models that have been proposed to reason about distributed algorithms and sketch how such a model can form the basis for a domain-specific programming language. Adopting a high-level programming model can simplify the programmer's life and make the code amenable to automated verification, while still compiling to efficiently executable code. We conclude by summarizing the current status of an ongoing language design and implementation project that is based on this idea.","lang":"eng"}],"file":[{"access_level":"open_access","checksum":"cf5e94baa89a2dc4c5de01abc676eda8","file_size":489362,"relation":"main_file","file_id":"5050","file_name":"IST-2016-499-v1+1_9.pdf","date_updated":"2020-07-14T12:44:58Z","creator":"system","content_type":"application/pdf","date_created":"2018-12-12T10:14:02Z"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"series_title":"Leibniz International Proceedings in Informatics","author":[{"first_name":"Cezara","full_name":"Dragoi, Cezara","last_name":"Dragoi","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Damien","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"ddc":["005"],"oa_version":"Published Version","oa":1,"month":"01","department":[{"_id":"ToHe"}],"type":"conference","status":"public","date_updated":"2020-08-11T10:09:14Z","year":"2015","_id":"1498","publication_identifier":{"isbn":["978-3-939897-80-4 "]},"citation":{"mla":"Dragoi, Cezara, et al. <i>The Need for Language Support for Fault-Tolerant Distributed Systems</i>. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">10.4230/LIPIcs.SNAPL.2015.90</a>.","ista":"Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for fault-tolerant distributed systems. 32, 90–102.","ama":"Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant distributed systems. 2015;32:90-102. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">10.4230/LIPIcs.SNAPL.2015.90</a>","ieee":"C. Dragoi, T. A. Henzinger, and D. Zufferey, “The need for language support for fault-tolerant distributed systems,” vol. 32. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 90–102, 2015.","apa":"Dragoi, C., Henzinger, T. A., &#38; Zufferey, D. (2015). The need for language support for fault-tolerant distributed systems. Presented at the SNAPL: Summit oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">https://doi.org/10.4230/LIPIcs.SNAPL.2015.90</a>","chicago":"Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “The Need for Language Support for Fault-Tolerant Distributed Systems.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">https://doi.org/10.4230/LIPIcs.SNAPL.2015.90</a>.","short":"C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102."},"day":"01","ec_funded":1,"alternative_title":["LIPIcs"],"conference":{"end_date":"2015-05-06","location":"Asilomar, CA, United States","start_date":"2015-05-03","name":"SNAPL: Summit oN Advances in Programming Languages"},"volume":32,"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"}]},{"_id":"1499","year":"2015","citation":{"apa":"Kretinsky, J., Larsen, K., Laursen, S., &#38; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">https://doi.org/10.4230/LIPIcs.CONCUR.2015.142</a>","chicago":"Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time Decidability of Weighted Synchronization under Partial Observability,” 42:142–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">https://doi.org/10.4230/LIPIcs.CONCUR.2015.142</a>.","short":"J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.","ama":"Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:142-154. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">10.4230/LIPIcs.CONCUR.2015.142</a>","ieee":"J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability of weighted synchronization under partial observability,” presented at the CONCUR: Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.","ista":"Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability of weighted synchronization under partial observability. CONCUR: Concurrency Theory, LIPIcs, vol. 42, 142–154.","mla":"Kretinsky, Jan, et al. <i>Polynomial Time Decidability of Weighted Synchronization under Partial Observability</i>. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">10.4230/LIPIcs.CONCUR.2015.142</a>."},"ec_funded":1,"day":"01","alternative_title":["LIPIcs"],"volume":42,"conference":{"location":"Madrid, Spain","end_date":"2015-09-04","start_date":"2015-09-01","name":"CONCUR: Concurrency Theory"},"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7"}],"ddc":["000","003"],"acknowledgement":"The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement 601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM), the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), the Czech Science Foundation under grant agreement P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734.","author":[{"last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"},{"full_name":"Larsen, Kim","first_name":"Kim","last_name":"Larsen"},{"last_name":"Laursen","full_name":"Laursen, Simon","first_name":"Simon"},{"last_name":"Srba","first_name":"Jiří","full_name":"Srba, Jiří"}],"month":"01","oa":1,"oa_version":"Published Version","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"type":"conference","date_updated":"2021-01-12T06:51:10Z","status":"public","intvolume":"        42","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:08:12Z","file_size":623563,"file_id":"4672","relation":"main_file","file_name":"IST-2016-498-v1+1_32.pdf","checksum":"49eb5021caafaabe5356c65b9c5f8c9c","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:44:58Z"}],"abstract":[{"lang":"eng","text":"We consider weighted automata with both positive and negative integer weights on edges and\r\nstudy the problem of synchronization using adaptive strategies that may only observe whether\r\nthe current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata."}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":1,"publication_status":"published","has_accepted_license":"1","date_created":"2018-12-11T11:52:22Z","language":[{"iso":"eng"}],"date_published":"2015-01-01T00:00:00Z","title":"Polynomial time decidability of weighted synchronization under partial observability","file_date_updated":"2020-07-14T12:44:58Z","doi":"10.4230/LIPIcs.CONCUR.2015.142","page":"142 - 154","pubrep_id":"498","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"5680"},{"date_published":"2015-10-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:52:23Z","publication":"Formal Methods in System Design","scopus_import":1,"publication_status":"published","publist_id":"5677","publisher":"Springer","doi":"10.1007/s10703-015-0235-2","page":"230 - 264","title":"CEGAR for compositional analysis of qualitative properties in Markov decision processes","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        47","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph algorithms with quadratic complexity to compute the simulation relation. We present an automated technique for assume-guarantee style reasoning for compositional analysis of two-player games by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We show a tight link between two-player games and MDPs, and as a consequence the results for games are lifted to MDPs with qualitative properties. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"oa_version":"Preprint","oa":1,"month":"10","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No. P23499- N23, FWF NFN Grant No. S11407-N23, FWF Grant S11403-N23 (RiSE), and FWF Grant Z211-N23 (Wittgenstein Award), ERC Start Grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Martin","full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"}],"issue":"2","status":"public","date_updated":"2023-09-07T11:58:33Z","type":"journal_article","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"1155","status":"public"}]},"citation":{"ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” <i>Formal Methods in System Design</i>, vol. 47, no. 2. Springer, pp. 230–264, 2015.","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative properties in Markov decision processes. <i>Formal Methods in System Design</i>. 2015;47(2):230-264. doi:<a href=\"https://doi.org/10.1007/s10703-015-0235-2\">10.1007/s10703-015-0235-2</a>","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” <i>Formal Methods in System Design</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s10703-015-0235-2\">https://doi.org/10.1007/s10703-015-0235-2</a>.","short":"K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015) 230–264.","apa":"Chatterjee, K., Chmelik, M., &#38; Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. <i>Formal Methods in System Design</i>. Springer. <a href=\"https://doi.org/10.1007/s10703-015-0235-2\">https://doi.org/10.1007/s10703-015-0235-2</a>","mla":"Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” <i>Formal Methods in System Design</i>, vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:<a href=\"https://doi.org/10.1007/s10703-015-0235-2\">10.1007/s10703-015-0235-2</a>.","ista":"Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264."},"year":"2015","_id":"1501","volume":47,"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.0835"}],"day":"01","ec_funded":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","abstract":[{"text":"We extend the theory of input-output conformance with operators for merge and quotient. The former is useful when testing against multiple requirements or views. The latter can be used to generate tests for patches of an already tested system. Both operators can combine systems with different action alphabets, which is usually the case when constructing complex systems and specifications from parts, for instance different views as well as newly defined functionality of a~previous version of the system.","lang":"eng"}],"file":[{"date_created":"2018-12-12T10:17:46Z","content_type":"application/pdf","file_size":467561,"relation":"main_file","file_id":"5303","file_name":"IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf","access_level":"open_access","checksum":"c6ce681035c163a158751f240cb7d389","creator":"system","date_updated":"2020-07-14T12:44:59Z"}],"has_accepted_license":"1","publication_status":"published","scopus_import":1,"date_published":"2015-05-01T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:52:24Z","pubrep_id":"625","page":"101 - 110","doi":"10.1145/2737166.2737175","title":"Complete composition operators for IOCO-testing theory","file_date_updated":"2020-07-14T12:44:59Z","publisher":"ACM","publist_id":"5676","year":"2015","_id":"1502","publication_identifier":{"isbn":["978-1-4503-3471-6"]},"citation":{"apa":"Beneš, N., Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM. <a href=\"https://doi.org/10.1145/2737166.2737175\">https://doi.org/10.1145/2737166.2737175</a>","short":"N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015, pp. 101–110.","chicago":"Beneš, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,” 101–10. ACM, 2015. <a href=\"https://doi.org/10.1145/2737166.2737175\">https://doi.org/10.1145/2737166.2737175</a>.","ieee":"N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.","ama":"Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. Complete composition operators for IOCO-testing theory. In: ACM; 2015:101-110. doi:<a href=\"https://doi.org/10.1145/2737166.2737175\">10.1145/2737166.2737175</a>","ista":"Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition operators for IOCO-testing theory. CBSE: Component-Based Software Engineering , Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering , , 101–110.","mla":"Beneš, Nikola, et al. <i>Complete Composition Operators for IOCO-Testing Theory</i>. ACM, 2015, pp. 101–10, doi:<a href=\"https://doi.org/10.1145/2737166.2737175\">10.1145/2737166.2737175</a>."},"ec_funded":1,"day":"01","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"alternative_title":["Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering "],"conference":{"name":"CBSE: Component-Based Software Engineering ","start_date":"2015-05-04","location":"Montreal, QC, Canada","end_date":"2015-05-08"},"acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23(RiSE) and Z211-N23 (Wittgestein Award), by People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement 291734, and by the ARTEMIS JU under grant agreement 295373 (nSafeCer).  Jan Křetínský has been partially supported by the Czech Science Foundation, grant No.  P202/12/G061.  Nikola Beneš has been supported by the\r\nMEYS project No. CZ.1.07/2.3.00/30.0009 Employment of Newly Graduated Doctors of Science for Scientific Excellence.","author":[{"last_name":"Beneš","first_name":"Nikola","full_name":"Beneš, Nikola"},{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nickovic, Dejan","first_name":"Dejan","last_name":"Nickovic"}],"ddc":["000"],"oa_version":"Submitted Version","oa":1,"month":"05","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"related_material":{"record":[{"id":"1155","relation":"dissertation_contains","status":"public"}]},"status":"public","date_updated":"2023-09-07T11:58:33Z","type":"conference"},{"citation":{"apa":"Bao, Z., Pan, G., &#38; Zhou, W. (2015). Universality for the largest eigenvalue of sample covariance matrices with general population. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/14-AOS1281\">https://doi.org/10.1214/14-AOS1281</a>","short":"Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.","chicago":"Bao, Zhigang, Guangming Pan, and Wang Zhou. “Universality for the Largest Eigenvalue of Sample Covariance Matrices with General Population.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2015. <a href=\"https://doi.org/10.1214/14-AOS1281\">https://doi.org/10.1214/14-AOS1281</a>.","ieee":"Z. Bao, G. Pan, and W. Zhou, “Universality for the largest eigenvalue of sample covariance matrices with general population,” <i>Annals of Statistics</i>, vol. 43, no. 1. Institute of Mathematical Statistics, pp. 382–421, 2015.","ama":"Bao Z, Pan G, Zhou W. Universality for the largest eigenvalue of sample covariance matrices with general population. <i>Annals of Statistics</i>. 2015;43(1):382-421. doi:<a href=\"https://doi.org/10.1214/14-AOS1281\">10.1214/14-AOS1281</a>","ista":"Bao Z, Pan G, Zhou W. 2015. Universality for the largest eigenvalue of sample covariance matrices with general population. Annals of Statistics. 43(1), 382–421.","mla":"Bao, Zhigang, et al. “Universality for the Largest Eigenvalue of Sample Covariance Matrices with General Population.” <i>Annals of Statistics</i>, vol. 43, no. 1, Institute of Mathematical Statistics, 2015, pp. 382–421, doi:<a href=\"https://doi.org/10.1214/14-AOS1281\">10.1214/14-AOS1281</a>."},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        43","year":"2015","_id":"1505","volume":43,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1304.5690"}],"abstract":[{"lang":"eng","text":"This paper is aimed at deriving the universality of the largest eigenvalue of a class of high-dimensional real or complex sample covariance matrices of the form W N =Σ 1/2XX∗Σ 1/2 . Here, X = (xij )M,N is an M× N random matrix with independent entries xij , 1 ≤ i M,≤ 1 ≤ j ≤ N such that Exij = 0, E|xij |2 = 1/N . On dimensionality, we assume that M = M(N) and N/M → d ε (0, ∞) as N ∞→. For a class of general deterministic positive-definite M × M matrices Σ , under some additional assumptions on the distribution of xij 's, we show that the limiting behavior of the largest eigenvalue of W N is universal, via pursuing a Green function comparison strategy raised in [Probab. Theory Related Fields 154 (2012) 341-407, Adv. Math. 229 (2012) 1435-1515] by Erd″os, Yau and Yin for Wigner matrices and extended by Pillai and Yin [Ann. Appl. Probab. 24 (2014) 935-1001] to sample covariance matrices in the null case (&amp;Epsi = I ). Consequently, in the standard complex case (Ex2 ij = 0), combing this universality property and the results known for Gaussian matrices obtained by El Karoui in [Ann. Probab. 35 (2007) 663-714] (nonsingular case) and Onatski in [Ann. Appl. Probab. 18 (2008) 470-490] (singular case), we show that after an appropriate normalization the largest eigenvalue of W N converges weakly to the type 2 Tracy-Widom distribution TW2 . Moreover, in the real case, we show that whenΣ is spiked with a fixed number of subcritical spikes, the type 1 Tracy-Widom limit TW1 holds for the normalized largest eigenvalue of W N , which extends a result of Féral and Péché in [J. Math. Phys. 50 (2009) 073302] to the scenario of nondiagonal Σ and more generally distributed X . In summary, we establish the Tracy-Widom type universality for the largest eigenvalue of generally distributed sample covariance matrices under quite light assumptions on &amp;Sigma . Applications of these limiting results to statistical signal detection and structure recognition of separable covariance matrices are also discussed."}],"day":"01","date_published":"2015-02-01T00:00:00Z","date_created":"2018-12-11T11:52:25Z","oa":1,"language":[{"iso":"eng"}],"month":"02","publication":"Annals of Statistics","oa_version":"Preprint","acknowledgement":"B.Z. was supported  in  part  by  NSFC  Grant  11071213,  ZJNSF  Grant  R6090034  and  SRFDP  Grant 20100101110001. P.G. was supported in part by the Ministry of Education, Singapore, under Grant ARC 14/11. Z.W. was supported  in  part  by  the  Ministry  of  Education,  Singapore,  under  Grant  ARC  14/11,  and  by a Grant R-155-000-131-112 at the National University of Singapore\r\n","author":[{"id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","last_name":"Bao","full_name":"Bao, Zhigang","first_name":"Zhigang","orcid":"0000-0003-3036-1475"},{"last_name":"Pan","first_name":"Guangming","full_name":"Pan, Guangming"},{"last_name":"Zhou","first_name":"Wang","full_name":"Zhou, Wang"}],"publication_status":"published","issue":"1","publist_id":"5672","date_updated":"2021-01-12T06:51:14Z","publisher":"Institute of Mathematical Statistics","status":"public","type":"journal_article","page":"382 - 421","doi":"10.1214/14-AOS1281","department":[{"_id":"LaEr"}],"title":"Universality for the largest eigenvalue of sample covariance matrices with general population"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","_id":"1506","intvolume":"        21","quality_controlled":"1","citation":{"mla":"Bao, Zhigang, et al. “The Logarithmic Law of Random Determinant.” <i>Bernoulli</i>, vol. 21, no. 3, Bernoulli Society for Mathematical Statistics and Probability, 2015, pp. 1600–28, doi:<a href=\"https://doi.org/10.3150/14-BEJ615\">10.3150/14-BEJ615</a>.","ista":"Bao Z, Pan G, Zhou W. 2015. The logarithmic law of random determinant. Bernoulli. 21(3), 1600–1628.","ieee":"Z. Bao, G. Pan, and W. Zhou, “The logarithmic law of random determinant,” <i>Bernoulli</i>, vol. 21, no. 3. Bernoulli Society for Mathematical Statistics and Probability, pp. 1600–1628, 2015.","ama":"Bao Z, Pan G, Zhou W. The logarithmic law of random determinant. <i>Bernoulli</i>. 2015;21(3):1600-1628. doi:<a href=\"https://doi.org/10.3150/14-BEJ615\">10.3150/14-BEJ615</a>","apa":"Bao, Z., Pan, G., &#38; Zhou, W. (2015). The logarithmic law of random determinant. <i>Bernoulli</i>. Bernoulli Society for Mathematical Statistics and Probability. <a href=\"https://doi.org/10.3150/14-BEJ615\">https://doi.org/10.3150/14-BEJ615</a>","short":"Z. Bao, G. Pan, W. Zhou, Bernoulli 21 (2015) 1600–1628.","chicago":"Bao, Zhigang, Guangming Pan, and Wang Zhou. “The Logarithmic Law of Random Determinant.” <i>Bernoulli</i>. Bernoulli Society for Mathematical Statistics and Probability, 2015. <a href=\"https://doi.org/10.3150/14-BEJ615\">https://doi.org/10.3150/14-BEJ615</a>."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1208.5823"}],"abstract":[{"lang":"eng","text":"Consider the square random matrix An = (aij)n,n, where {aij:= a(n)ij , i, j = 1, . . . , n} is a collection of independent real random variables with means zero and variances one. Under the additional moment condition supn max1≤i,j ≤n Ea4ij &lt;∞, we prove Girko's logarithmic law of det An in the sense that as n→∞ log | detAn| ? (1/2) log(n-1)! d/→√(1/2) log n N(0, 1)."}],"day":"01","volume":21,"author":[{"orcid":"0000-0003-3036-1475","first_name":"Zhigang","full_name":"Bao, Zhigang","last_name":"Bao","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pan","full_name":"Pan, Guangming","first_name":"Guangming"},{"last_name":"Zhou","first_name":"Wang","full_name":"Zhou, Wang"}],"publication_status":"published","issue":"3","date_published":"2015-08-01T00:00:00Z","oa_version":"Preprint","month":"08","oa":1,"publication":"Bernoulli","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:52:25Z","department":[{"_id":"LaEr"}],"doi":"10.3150/14-BEJ615","page":"1600 - 1628","title":"The logarithmic law of random determinant","status":"public","publist_id":"5671","date_updated":"2021-01-12T06:51:14Z","publisher":"Bernoulli Society for Mathematical Statistics and Probability","type":"journal_article"},{"publication_status":"published","issue":"8","scopus_import":1,"author":[{"full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös"},{"last_name":"Yau","full_name":"Yau, Horng","first_name":"Horng"}],"oa":1,"publication":"Journal of the European Mathematical Society","date_created":"2018-12-11T11:52:26Z","month":"08","language":[{"iso":"eng"}],"oa_version":"Preprint","date_published":"2015-08-01T00:00:00Z","title":"Gap universality of generalized Wigner and β ensembles","doi":"10.4171/JEMS/548","page":"1927 - 2036","department":[{"_id":"LaEr"}],"type":"journal_article","date_updated":"2021-01-12T06:51:15Z","publist_id":"5669","publisher":"European Mathematical Society","status":"public","intvolume":"        17","year":"2015","_id":"1508","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8, European Mathematical Society, 2015, pp. 1927–2036, doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>.","ista":"Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 17(8), 1927–2036.","ama":"Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. 2015;17(8):1927-2036. doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>","ieee":"L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8. European Mathematical Society, pp. 1927–2036, 2015.","apa":"Erdös, L., &#38; Yau, H. (2015). Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>","short":"L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015) 1927–2036.","chicago":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society, 2015. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>."},"quality_controlled":"1","abstract":[{"text":"We consider generalized Wigner ensembles and general β-ensembles with analytic potentials for any β ≥ 1. The recent universality results in particular assert that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum are universal in the sense that they coincide with those of the corresponding Gaussian β-ensembles. In this article, we show that local averaging is not necessary for this result, i.e. we prove that the single gap distributions in the bulk are universal. In fact, with an additional step, our result can be extended to any C4(ℝ) potential.","lang":"eng"}],"day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1211.3786","open_access":"1"}],"volume":17}]