[{"ddc":["004"],"file":[{"checksum":"848043c812ace05e459579c923f3d3cf","relation":"main_file","file_size":2116225,"date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_name":"IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf","access_level":"open_access","file_id":"4658","date_created":"2018-12-12T10:07:59Z","creator":"system"}],"citation":{"chicago":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">https://doi.org/10.3233/978-1-61499-672-9-1432</a>.","ama":"Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">10.3233/978-1-61499-672-9-1432</a>","ista":"Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of a single step of magic: The gathering. ECAI: European Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285, 1432–1439.","mla":"Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. <i>The Complexity of Deciding Legality of a Single Step of Magic: The Gathering</i>. Vol. 285, IOS Press, 2016, pp. 1432–39, doi:<a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">10.3233/978-1-61499-672-9-1432</a>.","short":"K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.","apa":"Chatterjee, K., &#38; Ibsen-Jensen, R. (2016). The complexity of deciding legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands: IOS Press. <a href=\"https://doi.org/10.3233/978-1-61499-672-9-1432\">https://doi.org/10.3233/978-1-61499-672-9-1432</a>","ieee":"K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439."},"type":"conference","quality_controlled":"1","abstract":[{"lang":"eng","text":"Magic: the Gathering is a game about magical combat for any number of players. Formally it is a zero-sum, imperfect information stochastic game that consists of a potentially unbounded number of steps. We consider the problem of deciding if a move is legal in a given single step of Magic. We show that the problem is (a) coNP-complete in general; and (b) in P if either of two small sets of cards are not used. Our lower bound holds even for single-player Magic games. The significant aspects of our results are as follows: First, in most real-life game problems, the task of deciding whether a given move is legal in a single step is trivial, and the computationally hard task is to find the best sequence of legal moves in the presence of multiple players. In contrast, quite uniquely our hardness result holds for single step and with only one-player. Second, we establish efficient algorithms for important special cases of Magic."}],"publication_status":"published","publist_id":"7342","language":[{"iso":"eng"}],"has_accepted_license":"1","status":"public","publisher":"IOS Press","day":"01","doi":"10.3233/978-1-61499-672-9-1432","oa_version":"Published Version","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389"}],"year":"2016","conference":{"name":"ECAI: European Conference on Artificial Intelligence","location":"The Hague, Netherlands","start_date":"2016-08-29","end_date":"2016-09-02"},"department":[{"_id":"KrCh"}],"tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"       285","oa":1,"volume":285,"alternative_title":["Frontiers in Artificial Intelligence and Applications"],"_id":"478","date_created":"2018-12-11T11:46:41Z","pubrep_id":"950","file_date_updated":"2020-07-14T12:46:35Z","page":"1432 - 1439","date_published":"2016-01-01T00:00:00Z","title":"The complexity of deciding legality of a single step of magic: The gathering","date_updated":"2021-01-12T08:00:54Z","month":"01"},{"oa_version":"None","page":"112 - 121","doi":"10.1145/2889160.2889233","publication":"Proceedings of the 38th International Conference on Software Engineering Companion ","day":"14","date_created":"2018-12-11T11:46:42Z","publisher":"IEEE","_id":"479","month":"05","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T08:00:55Z","title":"Use runtime verification to improve the quality of medical care practice","conference":{"end_date":"2016-05-22","start_date":"2016-05-14","location":"Austin, TX, USA","name":"ICSE: International Conference on Software Engineering"},"year":"2016","author":[{"first_name":"Yu","last_name":"Jiang","full_name":"Jiang, Yu"},{"full_name":"Liu, Han","last_name":"Liu","first_name":"Han"},{"last_name":"Kong","full_name":"Kong, Hui","orcid":"0000-0002-3066-6941","first_name":"Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wang, Rui","last_name":"Wang","first_name":"Rui"},{"full_name":"Hosseini, Mohamad","last_name":"Hosseini","first_name":"Mohamad"},{"first_name":"Jiaguang","full_name":"Sun, Jiaguang","last_name":"Sun"},{"last_name":"Sha","full_name":"Sha, Lui","first_name":"Lui"}],"date_published":"2016-05-14T00:00:00Z","scopus_import":1,"citation":{"chicago":"Jiang, Yu, Han Liu, Hui Kong, Rui Wang, Mohamad Hosseini, Jiaguang Sun, and Lui Sha. “Use Runtime Verification to Improve the Quality of Medical Care Practice.” In <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, 112–21. IEEE, 2016. <a href=\"https://doi.org/10.1145/2889160.2889233\">https://doi.org/10.1145/2889160.2889233</a>.","ama":"Jiang Y, Liu H, Kong H, et al. Use runtime verification to improve the quality of medical care practice. In: <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>. IEEE; 2016:112-121. doi:<a href=\"https://doi.org/10.1145/2889160.2889233\">10.1145/2889160.2889233</a>","ista":"Jiang Y, Liu H, Kong H, Wang R, Hosseini M, Sun J, Sha L. 2016. Use runtime verification to improve the quality of medical care practice. Proceedings of the 38th International Conference on Software Engineering Companion . ICSE: International Conference on Software Engineering, Proceedings International Conference on Software Engineering, , 112–121.","mla":"Jiang, Yu, et al. “Use Runtime Verification to Improve the Quality of Medical Care Practice.” <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, IEEE, 2016, pp. 112–21, doi:<a href=\"https://doi.org/10.1145/2889160.2889233\">10.1145/2889160.2889233</a>.","apa":"Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., &#38; Sha, L. (2016). Use runtime verification to improve the quality of medical care practice. In <i>Proceedings of the 38th International Conference on Software Engineering Companion </i> (pp. 112–121). Austin, TX, USA: IEEE. <a href=\"https://doi.org/10.1145/2889160.2889233\">https://doi.org/10.1145/2889160.2889233</a>","short":"Y. Jiang, H. Liu, H. Kong, R. Wang, M. Hosseini, J. Sun, L. Sha, in:, Proceedings of the 38th International Conference on Software Engineering Companion , IEEE, 2016, pp. 112–121.","ieee":"Y. Jiang <i>et al.</i>, “Use runtime verification to improve the quality of medical care practice,” in <i>Proceedings of the 38th International Conference on Software Engineering Companion </i>, Austin, TX, USA, 2016, pp. 112–121."},"type":"conference","status":"public","language":[{"iso":"eng"}],"publist_id":"7341","alternative_title":["Proceedings International Conference on Software Engineering"],"publication_status":"published","abstract":[{"lang":"eng","text":"Clinical guidelines and decision support systems (DSS) play an important role in daily practices of medicine. Many text-based guidelines have been encoded for work-flow simulation of DSS to automate health care. During the collaboration with Carle hospital to develop a DSS, we identify that, for some complex and life-critical diseases, it is highly desirable to automatically rigorously verify some complex temporal properties in guidelines, which brings new challenges to current simulation based DSS with limited support of automatical formal verification and real-time data analysis. In this paper, we conduct the first study on applying runtime verification to cooperate with current DSS based on real-time data. Within the proposed technique, a user-friendly domain specific language, named DRTV, is designed to specify vital real-time data sampled by medical devices and temporal properties originated from clinical guidelines. Some interfaces are developed for data acquisition and communication. Then, for medical practice scenarios described in DRTV model, we will automatically generate event sequences and runtime property verifier automata. If a temporal property violates, real-time warnings will be produced by the formal verifier and passed to medical DSS. We have used DRTV to specify different kinds of medical care scenarios, and applied the proposed technique to assist existing DSS. As presented in experiment results, in terms of warning detection, it outperforms the only use of DSS or human inspection, and improves the quality of clinical health care of hospital"}],"acknowledgement":"This work is supported by NSF CNS 13-30077, NSF CNS 13-29886, NSF CNS 15-45002, and NSFC 61303014.\r\nThe authors thank Dr.  Bobby and Dr.  Hill at Carle Hospital, Urbana, IL for their help with the discussion on medical  knowledge.\r\n\r\n","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1"},{"citation":{"ieee":"K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.","apa":"Chatterjee, K., &#38; Doyen, L. (2016). Perfect-information stochastic games with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. <a href=\"https://doi.org/10.1145/2933575.2934513\">https://doi.org/10.1145/2933575.2934513</a>","short":"K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.","ista":"Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, vol. 05-08-July-2016, 247–256.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives</i>. Vol. 05-08-July-2016, IEEE, 2016, pp. 247–56, doi:<a href=\"https://doi.org/10.1145/2933575.2934513\">10.1145/2933575.2934513</a>.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE, 2016. <a href=\"https://doi.org/10.1145/2933575.2934513\">https://doi.org/10.1145/2933575.2934513</a>.","ama":"Chatterjee K, Doyen L. Perfect-information stochastic games with generalized mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:<a href=\"https://doi.org/10.1145/2933575.2934513\">10.1145/2933575.2934513</a>"},"type":"conference","language":[{"iso":"eng"}],"status":"public","abstract":[{"text":"Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph are controlled by two adversarial players, and the other transitions are executed probabilistically. We consider such games where the objective is the conjunction of several quantitative objectives (specified as mean-payoff conditions), which we refer to as generalized mean-payoff objectives. The basic decision problem asks for the existence of a finite-memory strategy for a player that ensures the generalized mean-payoff objective be satisfied with a desired probability against all strategies of the opponent. A special case of the decision problem is the almost-sure problem where the desired probability is 1. Previous results presented a semi-decision procedure for -approximations of the almost-sure problem. In this work, we show that both the almost-sure problem as well as the general basic decision problem are coNP-complete, significantly improving the previous results. Moreover, we show that in the case of 1-player stochastic games, randomized memoryless strategies are sufficient and the problem can be solved in polynomial time. In contrast, in two-player stochastic games, we show that even with randomized strategies exponential memory is required in general, and present a matching exponential upper bound. We also study the basic decision problem with infinite-memory strategies and present computational complexity results for the problem. Our results are relevant in the synthesis of stochastic reactive systems with multiple quantitative requirements.","lang":"eng"}],"publication_status":"published","publist_id":"7340","quality_controlled":"1","oa_version":"Preprint","doi":"10.1145/2933575.2934513","day":"05","publisher":"IEEE","department":[{"_id":"KrCh"}],"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"}],"conference":{"start_date":"2016-07-05","location":"New York, NY, USA","end_date":"2016-07-08","name":"LICS: Logic in Computer Science"},"year":"2016","scopus_import":1,"alternative_title":["Proceedings Symposium on Logic in Computer Science"],"volume":"05-08-July-2016","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1604.06376"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"page":"247 - 256","date_created":"2018-12-11T11:46:42Z","project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"_id":"480","month":"07","date_updated":"2021-01-12T08:00:56Z","title":"Perfect-information stochastic games with generalized mean-payoff objectives","ec_funded":1,"date_published":"2016-07-05T00:00:00Z"},{"publisher":"Optica Publishing Group","_id":"482","date_created":"2018-12-11T11:46:43Z","day":"29","doi":"10.1364/NP.2016.NTh3A.6","oa_version":"None","author":[{"first_name":"Alfredo","last_name":"Rueda","full_name":"Rueda, Alfredo"},{"first_name":"Florian","full_name":"Sedlmeir, Florian","last_name":"Sedlmeir"},{"full_name":"Collodo, Michele","last_name":"Collodo","first_name":"Michele"},{"full_name":"Vogl, Ulrich","last_name":"Vogl","first_name":"Ulrich"},{"first_name":"Birgit","last_name":"Stiller","full_name":"Stiller, Birgit"},{"first_name":"Gerhard","full_name":"Schunk, Gerhard","last_name":"Schunk"},{"first_name":"Dmitry","last_name":"Strekalov","full_name":"Strekalov, Dmitry"},{"full_name":"Marquardt, Christoph","last_name":"Marquardt","first_name":"Christoph"},{"full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M"},{"full_name":"Painter, Oskar","last_name":"Painter","first_name":"Oskar"},{"full_name":"Leuchs, Gerd","last_name":"Leuchs","first_name":"Gerd"},{"first_name":"Harald","full_name":"Schwefel, Harald","last_name":"Schwefel"}],"date_published":"2016-08-29T00:00:00Z","year":"2016","conference":{"name":"NP: Nonlinear Photonics","start_date":"2016-09-05","location":"Sydney, Australia","end_date":"2016-09-08"},"article_processing_charge":"No","title":"Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator","date_updated":"2023-10-17T12:16:43Z","department":[{"_id":"JoFi"}],"month":"08","scopus_import":"1","type":"conference","citation":{"ama":"Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing Group; 2016. doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>","chicago":"Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing Group, 2016. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>.","ista":"Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D, Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. NP: Nonlinear Photonics, Optics InfoBase Conference Papers, .","mla":"Rueda, Alfredo, et al. <i>Nonlinear Single Sideband Microwave to Optical Conversion Using an Electro-Optic WGM-Resonator</i>. Optica Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">10.1364/NP.2016.NTh3A.6</a>.","apa":"Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., … Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics, Sydney, Australia: Optica Publishing Group. <a href=\"https://doi.org/10.1364/NP.2016.NTh3A.6\">https://doi.org/10.1364/NP.2016.NTh3A.6</a>","short":"A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov, C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing Group, 2016.","ieee":"A. Rueda <i>et al.</i>, “Nonlinear single sideband microwave to optical conversion using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics, Sydney, Australia, 2016."},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Nonlinear electro-optical conversion of microwave radiation into the optical telecommunication band is achieved within a crystalline whispering gallery mode resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth.","lang":"eng"}],"alternative_title":["Optics InfoBase Conference Papers"],"publication_status":"published","publist_id":"7339","language":[{"iso":"eng"}],"status":"public"},{"publication":"Plant Signaling & Behavior","date_created":"2018-12-11T11:46:53Z","_id":"510","month":"06","title":"The CLE gene family in Populus trichocarpa","date_updated":"2023-10-17T11:13:40Z","article_processing_charge":"No","date_published":"2016-06-02T00:00:00Z","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/"}],"volume":11,"oa":1,"intvolume":"        11","acknowledgement":"We are grateful to Dr. Long (Laboratoire de Reproduction et Developpement des Plantes,CNRS,INRA,ENSLyon,UCBL,Universite de Lyon,France)for critical reading of the article. Work in our group is supported by the National Natural Science Foundation of China (31271575; 31200902), the Fundamental Research Funds for the Central Univ ersities (GK201103005), the Specialized Research Fund for the Doctoral Program of Higher Education from the Ministry of Education of China (20120202120009), the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, and the Natural Science Basic Research Plan in Shaanxi Province of China (2014JM3064). ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","article_number":"e1191734","oa_version":"Submitted Version","doi":"10.1080/15592324.2016.1191734","day":"02","publisher":"Taylor & Francis","department":[{"_id":"JiFr"}],"year":"2016","author":[{"first_name":"Zhijun","full_name":"Liu, Zhijun","last_name":"Liu"},{"last_name":"Yang","full_name":"Yang, Nan","first_name":"Nan"},{"first_name":"Yanting","last_name":"Lv","full_name":"Lv, Yanting"},{"full_name":"Pan, Lixia","last_name":"Pan","first_name":"Lixia"},{"last_name":"Lv","full_name":"Lv, Shuo","first_name":"Shuo"},{"full_name":"Han, Huibin","last_name":"Han","id":"31435098-F248-11E8-B48F-1D18A9856A87","first_name":"Huibin"},{"first_name":"Guodong","last_name":"Wang","full_name":"Wang, Guodong"}],"type":"journal_article","citation":{"apa":"Liu, Z., Yang, N., Lv, Y., Pan, L., Lv, S., Han, H., &#38; Wang, G. (2016). The CLE gene family in Populus trichocarpa. <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/15592324.2016.1191734\">https://doi.org/10.1080/15592324.2016.1191734</a>","short":"Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &#38; Behavior 11 (2016).","ieee":"Z. Liu <i>et al.</i>, “The CLE gene family in Populus trichocarpa,” <i>Plant Signaling &#38; Behavior</i>, vol. 11, no. 6. Taylor &#38; Francis, 2016.","ama":"Liu Z, Yang N, Lv Y, et al. The CLE gene family in Populus trichocarpa. <i>Plant Signaling &#38; Behavior</i>. 2016;11(6). doi:<a href=\"https://doi.org/10.1080/15592324.2016.1191734\">10.1080/15592324.2016.1191734</a>","chicago":"Liu, Zhijun, Nan Yang, Yanting Lv, Lixia Pan, Shuo Lv, Huibin Han, and Guodong Wang. “The CLE Gene Family in Populus Trichocarpa.” <i>Plant Signaling &#38; Behavior</i>. Taylor &#38; Francis, 2016. <a href=\"https://doi.org/10.1080/15592324.2016.1191734\">https://doi.org/10.1080/15592324.2016.1191734</a>.","ista":"Liu Z, Yang N, Lv Y, Pan L, Lv S, Han H, Wang G. 2016. The CLE gene family in Populus trichocarpa. Plant Signaling &#38; Behavior. 11(6), e1191734.","mla":"Liu, Zhijun, et al. “The CLE Gene Family in Populus Trichocarpa.” <i>Plant Signaling &#38; Behavior</i>, vol. 11, no. 6, e1191734, Taylor &#38; Francis, 2016, doi:<a href=\"https://doi.org/10.1080/15592324.2016.1191734\">10.1080/15592324.2016.1191734</a>."},"status":"public","language":[{"iso":"eng"}],"publist_id":"7308","abstract":[{"lang":"eng","text":"The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted signaling peptides that are primarily involved in the regulation of stem cell homeostasis in different plant meristems. Particularly, the characterization of the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on the potential roles of CLE peptides in vascular development and wood formation. Nevertheless, our knowledge on this gene family in a tree species is limited. In a recent study, we reported on a systematically investigation of the CLE gene family in Populus trichocarpa . The potential roles of PtCLE genes were studied by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members, many PtCLE proteins share identical CLE motifs or contain the same CLE motif as that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression patterns comparing to their Arabidopsis counterparts. These fi ndings indicate the existence of both functional conservation and functional divergence between PtCLEs and their AtCLE orthologues. Our results provide valuable resources for future functional investigations of these critical signaling molecules in woody plants. "}],"publication_status":"published","quality_controlled":"1"},{"scopus_import":"1","intvolume":"       202","oa":1,"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).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"2","main_file_link":[{"open_access":"1","url":"http://biorxiv.org/content/early/2015/07/06/022020.abstract"}],"volume":202,"project":[{"name":"Limits to selection in biology and in evolutionary computation","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","call_identifier":"FP7"},{"name":"L'OREAL Fellowship","_id":"25B67606-B435-11E9-9278-68D0E5697425"}],"_id":"1241","date_created":"2018-12-11T11:50:54Z","publication":"Genetics","page":"721 - 732","article_processing_charge":"No","date_published":"2016-02-01T00:00:00Z","ec_funded":1,"date_updated":"2026-06-18T07:59:00Z","title":"The role of recombination in evolutionary rescue","month":"02","ddc":["570"],"citation":{"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.","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>","short":"H. Uecker, J. Hermisson, Genetics 202 (2016) 721–732.","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.","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>.","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>"},"type":"journal_article","quality_controlled":"1","publist_id":"6091","abstract":[{"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.","lang":"eng"}],"publication_status":"published","das_tickbox":"1","status":"public","language":[{"iso":"eng"}],"publisher":"Genetics Society of America","day":"01","doi":"10.1534/genetics.115.180299","oa_version":"Preprint","year":"2016","author":[{"last_name":"Uecker","orcid":"0000-0001-9435-2813","full_name":"Uecker, Hildegard","first_name":"Hildegard","id":"2DB8F68A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joachim","full_name":"Hermisson, Joachim","last_name":"Hermisson"}],"department":[{"_id":"NiBa"}]},{"language":[{"iso":"eng"}],"pmid":1,"status":"public","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"}],"publication_status":"published","quality_controlled":"1","type":"journal_article","citation":{"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>.","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.","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.","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."},"article_type":"original","publication_identifier":{"issn":["0032-0781","1471-9053"]},"department":[{"_id":"XiFe"}],"author":[{"first_name":"Kaeli C.M.","full_name":"Johnson, Kaeli C.M.","last_name":"Johnson"},{"first_name":"Shitou","full_name":"Xia, Shitou","last_name":"Xia"},{"id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi","last_name":"Feng","full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234"},{"first_name":"Xin","last_name":"Li","full_name":"Li, Xin"}],"year":"2015","oa_version":"None","doi":"10.1093/pcp/pcv087","publisher":"Oxford University Press","volume":56,"issue":"8","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","intvolume":"        56","scopus_import":"1","extern":"1","month":"08","date_updated":"2023-05-08T11:03:23Z","title":"The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity","date_published":"2015-08-01T00:00:00Z","article_processing_charge":"No","keyword":["Cell Biology","Plant Science","Physiology","General Medicine"],"page":"1616-1623","publication":"Plant and Cell Physiology","date_created":"2023-01-16T09:20:22Z","external_id":{"pmid":["26063389"]},"_id":"12196"},{"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by the DFG (SPP 1527) and the EU (FP7, REA grant no 291734).","oa":1,"file_date_updated":"2023-05-02T07:02:59Z","publication":"Proceedings of the 13th European Conference on Artificial Life","page":"78","_id":"12881","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"date_created":"2023-04-30T22:01:07Z","title":"Quantifying self-organizing behavior of autonomous robots","date_updated":"2023-05-02T07:06:21Z","month":"07","date_published":"2015-07-01T00:00:00Z","article_processing_charge":"No","ec_funded":1,"file":[{"success":1,"access_level":"open_access","file_name":"2015_ECAL_Martius.pdf","date_updated":"2023-05-02T07:02:59Z","content_type":"application/pdf","file_size":1674241,"relation":"main_file","checksum":"880eabe59c9df12f06a882aa1bc4e600","creator":"dernst","date_created":"2023-05-02T07:02:59Z","file_id":"12882"}],"citation":{"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>","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>.","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>.","short":"G.S. Martius, E. Olbrich, in:, Proceedings of the 13th European Conference on Artificial Life, MIT Press, 2015, p. 78.","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>","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."},"type":"conference","ddc":["000"],"publication_status":"published","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","quality_controlled":"1","doi":"10.7551/978-0-262-33027-5-ch018","oa_version":"Published Version","publisher":"MIT Press","day":"01","publication_identifier":{"isbn":["9780262330275"]},"department":[{"_id":"ChLa"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Martius, Georg S","last_name":"Martius","first_name":"Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Eckehard","last_name":"Olbrich","full_name":"Olbrich, Eckehard"}],"conference":{"name":"ECAL: European Conference on Artificial Life","end_date":"2015-07-24","start_date":"2015-07-20","location":"York, United Kingdom"},"year":"2015"},{"author":[{"full_name":"Engel, Jakob","last_name":"Engel","first_name":"Jakob"},{"id":"309D50DA-F248-11E8-B48F-1D18A9856A87","first_name":"Philipp S","last_name":"Schmalhorst","full_name":"Schmalhorst, Philipp S","orcid":"0000-0002-5795-0133"},{"first_name":"Anke","last_name":"Kruger","full_name":"Kruger, Anke"},{"full_name":"Muller, Christina","last_name":"Muller","first_name":"Christina"},{"full_name":"Buettner, Falk","last_name":"Buettner","first_name":"Falk"},{"first_name":"Françoise","full_name":"Routier, Françoise","last_name":"Routier"}],"date_published":"2015-12-01T00:00:00Z","year":"2015","title":"Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis","date_updated":"2021-01-12T08:16:33Z","department":[{"_id":"CaHe"}],"month":"12","publisher":"Oxford University Press","_id":"802","date_created":"2018-12-11T11:48:35Z","external_id":{"pmid":["26306635"]},"day":"01","doi":"10.1093/glycob/cwv059","publication":"Glycobiology","oa_version":"None","page":"1423 - 1430","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"12","intvolume":"        25","volume":25,"publication_status":"published","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"}],"publist_id":"6851","language":[{"iso":"eng"}],"status":"public","pmid":1,"scopus_import":1,"citation":{"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>","short":"J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier, Glycobiology 25 (2015) 1423–1430.","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.","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>.","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>","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."},"type":"journal_article"},{"article_processing_charge":"No","year":"2015","date_published":"2015-11-15T00:00:00Z","author":[{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey","last_name":"Avvakumov","full_name":"Avvakumov, Sergey"},{"last_name":"Mabillard","full_name":"Mabillard, Isaac","id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac"},{"full_name":"Skopenkov, A.","last_name":"Skopenkov","first_name":"A."},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner"}],"department":[{"_id":"UlWa"}],"date_updated":"2023-09-07T13:12:17Z","title":"Eliminating higher-multiplicity intersections, III. Codimension 2","month":"11","_id":"8183","day":"15","external_id":{"arxiv":["1511.03501"]},"date_created":"2020-07-30T10:45:19Z","publication":"arXiv","arxiv":1,"oa_version":"Preprint","article_number":"1511.03501","oa":1,"acknowledgement":"We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M. Tancer, P. Teichner and anonymous referees for helpful discussions.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"9308","relation":"later_version","status":"public"},{"status":"public","relation":"later_version","id":"10220"},{"id":"8156","status":"public","relation":"dissertation_contains"}]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}],"publication_status":"submitted","abstract":[{"lang":"eng","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."}],"status":"public","language":[{"iso":"eng"}],"type":"preprint","citation":{"ieee":"S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections, III. Codimension 2,” <i>arXiv</i>. .","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>.","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.","chicago":"Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” <i>ArXiv</i>, n.d.","ama":"Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity intersections, III. Codimension 2. <i>arXiv</i>."}},{"quality_controlled":"1","language":[{"iso":"eng"}],"status":"public","publication_status":"published","abstract":[{"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. ","lang":"eng"}],"publist_id":"5713","citation":{"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.","short":"U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 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.","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.","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.","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.","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."},"type":"conference","author":[{"last_name":"Ahmed","full_name":"Ahmed, Umair","first_name":"Umair"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Gulwani","full_name":"Gulwani, Sumit","first_name":"Sumit"}],"conference":{"start_date":"2015-01-25","location":"Austin, TX, USA","end_date":"2015-01-30","name":"AAAI: Conference on Artificial Intelligence"},"year":"2015","department":[{"_id":"KrCh"}],"day":"01","publisher":"AAAI Press","oa_version":"None","acknowledgement":"A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         2","oa":1,"volume":2,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5410"}]},"main_file_link":[{"open_access":"1","url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300"}],"scopus_import":1,"ec_funded":1,"date_published":"2015-01-01T00:00:00Z","article_processing_charge":"No","month":"01","date_updated":"2023-02-23T12:25:07Z","title":"Automatic generation of alternative starting positions for simple traditional board games","date_created":"2018-12-11T11:52:16Z","_id":"1481","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"745 - 752","publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence"},{"_id":"1483","publisher":"IEEE","day":"14","date_created":"2018-12-11T11:52:17Z","doi":"10.1109/CVPR.2015.7299106","oa_version":"Preprint","page":"4741 - 4748","conference":{"end_date":"2015-06-12","start_date":"2015-06-07","location":"Boston, MA, USA","name":"CVPR: Computer Vision and Pattern Recognition"},"year":"2015","author":[{"id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Reininghaus","full_name":"Reininghaus, Jan"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Huber","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan"},{"first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724"},{"first_name":"Roland","full_name":"Kwitt, Roland","last_name":"Kwitt"}],"date_published":"2015-10-14T00:00:00Z","publication_identifier":{"eisbn":["978-1-4673-6964-0 "]},"department":[{"_id":"HeEd"}],"title":"A stable multi-scale kernel for topological machine learning","date_updated":"2021-01-12T06:51:03Z","month":"10","type":"conference","scopus_import":1,"citation":{"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>","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.","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>.","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>","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>."},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"http://arxiv.org/abs/1412.6821","open_access":"1"}],"publist_id":"5709","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."}],"publication_status":"published","status":"public","language":[{"iso":"eng"}]},{"oa":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","status":"public","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1505.03402"}],"publist_id":"5684","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"}],"publication_status":"published","volume":"2015-August","scopus_import":1,"citation":{"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.","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.","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.","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.","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.","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."},"type":"conference","ec_funded":1,"year":"2015","conference":{"name":"CCCG: Canadian Conference on Computational Geometry","start_date":"2015-08-10","location":"Ontario, Canada","end_date":"2015-08-12"},"date_published":"2015-08-01T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vitaliy","last_name":"Kurlin","full_name":"Kurlin, Vitaliy"}],"month":"08","department":[{"_id":"HeEd"}],"title":"Relaxed disk packing","date_updated":"2021-01-12T06:51:09Z","day":"01","date_created":"2018-12-11T11:52:21Z","publisher":"Queen's University","_id":"1495","project":[{"_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems"}],"page":"128-135","oa_version":"Submitted Version","publication":"Proceedings of the 27th Canadian Conference on Computational Geometry"},{"publication":"Nucleic Acids Research","file_date_updated":"2020-07-14T12:44:58Z","_id":"1497","date_created":"2018-12-11T11:52:22Z","title":"Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data","date_updated":"2021-01-12T06:51:09Z","month":"07","date_published":"2015-07-21T00:00:00Z","scopus_import":1,"volume":43,"article_number":"e146","oa":1,"intvolume":"        43","issue":"21","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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1093/nar/gkv727","oa_version":"Published Version","publisher":"Oxford University Press","day":"21","department":[{"_id":"GaNo"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2015","author":[{"last_name":"Andergassen","full_name":"Andergassen, Daniel","first_name":"Daniel"},{"last_name":"Dotter","full_name":"Dotter, Christoph","first_name":"Christoph","id":"4C66542E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kulinski, Tomasz","last_name":"Kulinski","first_name":"Tomasz"},{"first_name":"Philipp","full_name":"Guenzl, Philipp","last_name":"Guenzl"},{"first_name":"Philipp","full_name":"Bammer, Philipp","last_name":"Bammer"},{"last_name":"Barlow","full_name":"Barlow, Denise","first_name":"Denise"},{"last_name":"Pauler","full_name":"Pauler, Florian","first_name":"Florian"},{"full_name":"Hudson, Quanah","last_name":"Hudson","first_name":"Quanah"}],"file":[{"file_id":"5768","date_created":"2018-12-20T14:18:57Z","creator":"dernst","checksum":"385b83854fd0eb2e4f386867da2823e2","relation":"main_file","content_type":"application/pdf","date_updated":"2020-07-14T12:44:58Z","file_size":6863297,"file_name":"2015_NucleicAcidsRes_Andergassen.pdf","access_level":"open_access"}],"citation":{"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>.","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>","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.","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>.","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>","short":"D. Andergassen, C. Dotter, T. Kulinski, P. Guenzl, P. Bammer, D. Barlow, F. Pauler, Q. Hudson, Nucleic Acids Research 43 (2015).","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."},"type":"journal_article","ddc":["570"],"publist_id":"5682","publication_status":"published","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."}],"status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"quality_controlled":"1"},{"citation":{"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>","short":"C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.","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.","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>.","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>","ista":"Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for fault-tolerant distributed systems. 32, 90–102.","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>."},"type":"conference","file":[{"relation":"main_file","checksum":"cf5e94baa89a2dc4c5de01abc676eda8","file_size":489362,"content_type":"application/pdf","date_updated":"2020-07-14T12:44:58Z","file_name":"IST-2016-499-v1+1_9.pdf","access_level":"open_access","file_id":"5050","creator":"system","date_created":"2018-12-12T10:14:02Z"}],"ddc":["005"],"status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"publist_id":"5681","publication_status":"published","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"}],"quality_controlled":"1","oa_version":"Published Version","doi":"10.4230/LIPIcs.SNAPL.2015.90","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","series_title":"Leibniz International Proceedings in Informatics","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"ToHe"}],"publication_identifier":{"isbn":["978-3-939897-80-4 "]},"conference":{"end_date":"2015-05-06","location":"Asilomar, CA, United States","start_date":"2015-05-03","name":"SNAPL: Summit oN Advances in Programming Languages"},"year":"2015","author":[{"first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara","last_name":"Dragoi"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zufferey","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":1,"alternative_title":["LIPIcs"],"volume":32,"oa":1,"intvolume":"        32","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"90 - 102","pubrep_id":"499","file_date_updated":"2020-07-14T12:44:58Z","date_created":"2018-12-11T11:52:22Z","_id":"1498","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"}],"month":"01","title":"The need for language support for fault-tolerant distributed systems","date_updated":"2020-08-11T10:09:14Z","ec_funded":1,"date_published":"2015-01-01T00:00:00Z"},{"has_accepted_license":"1","status":"public","language":[{"iso":"eng"}],"publist_id":"5680","abstract":[{"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.","lang":"eng"}],"publication_status":"published","quality_controlled":"1","citation":{"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>","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>.","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>.","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.","short":"J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.","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>","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."},"type":"conference","file":[{"date_created":"2018-12-12T10:08:12Z","creator":"system","file_id":"4672","access_level":"open_access","file_name":"IST-2016-498-v1+1_32.pdf","date_updated":"2020-07-14T12:44:58Z","content_type":"application/pdf","file_size":623563,"checksum":"49eb5021caafaabe5356c65b9c5f8c9c","relation":"main_file"}],"ddc":["000","003"],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"conference":{"name":"CONCUR: Concurrency Theory","location":"Madrid, Spain","start_date":"2015-09-01","end_date":"2015-09-04"},"year":"2015","author":[{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"},{"full_name":"Larsen, Kim","last_name":"Larsen","first_name":"Kim"},{"first_name":"Simon","full_name":"Laursen, Simon","last_name":"Laursen"},{"first_name":"Jiří","last_name":"Srba","full_name":"Srba, Jiří"}],"oa_version":"Published Version","doi":"10.4230/LIPIcs.CONCUR.2015.142","day":"01","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"volume":42,"oa":1,"intvolume":"        42","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","scopus_import":1,"month":"01","date_updated":"2021-01-12T06:51:10Z","title":"Polynomial time decidability of weighted synchronization under partial observability","ec_funded":1,"date_published":"2015-01-01T00:00:00Z","page":"142 - 154","pubrep_id":"498","file_date_updated":"2020-07-14T12:44:58Z","date_created":"2018-12-11T11:52:22Z","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"_id":"1499"},{"volume":47,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.0835"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"1155"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"2","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).","oa":1,"intvolume":"        47","scopus_import":1,"title":"CEGAR for compositional analysis of qualitative properties in Markov decision processes","date_updated":"2023-09-07T11:58:33Z","month":"10","date_published":"2015-10-01T00:00:00Z","ec_funded":1,"publication":"Formal Methods in System Design","page":"230 - 264","_id":"1501","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_created":"2018-12-11T11:52:23Z","publication_status":"published","abstract":[{"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. ","lang":"eng"}],"publist_id":"5677","language":[{"iso":"eng"}],"status":"public","quality_controlled":"1","citation":{"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>","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.","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>.","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>","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.","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>."},"type":"journal_article","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"last_name":"Daca","full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87"}],"year":"2015","doi":"10.1007/s10703-015-0235-2","oa_version":"Preprint","publisher":"Springer","day":"01"},{"month":"05","date_updated":"2023-09-07T11:58:33Z","title":"Complete composition operators for IOCO-testing theory","ec_funded":1,"date_published":"2015-05-01T00:00:00Z","page":"101 - 110","file_date_updated":"2020-07-14T12:44:59Z","pubrep_id":"625","date_created":"2018-12-11T11:52:24Z","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"_id":"1502","alternative_title":["Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering "],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1155"}]},"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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"scopus_import":1,"publication_identifier":{"isbn":["978-1-4503-3471-6"]},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"author":[{"first_name":"Nikola","full_name":"Beneš, Nikola","last_name":"Beneš"},{"full_name":"Daca, Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"}],"conference":{"start_date":"2015-05-04","location":"Montreal, QC, Canada","end_date":"2015-05-08","name":"CBSE: Component-Based Software Engineering "},"year":"2015","oa_version":"Submitted Version","doi":"10.1145/2737166.2737175","day":"01","publisher":"ACM","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"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"}],"publication_status":"published","publist_id":"5676","quality_controlled":"1","citation":{"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>.","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>.","short":"N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015, pp. 101–110.","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>","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."},"type":"conference","file":[{"file_id":"5303","date_created":"2018-12-12T10:17:46Z","creator":"system","relation":"main_file","checksum":"c6ce681035c163a158751f240cb7d389","content_type":"application/pdf","date_updated":"2020-07-14T12:44:59Z","file_size":467561,"file_name":"IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf","access_level":"open_access"}],"ddc":["000"]},{"department":[{"_id":"LaEr"}],"date_updated":"2021-01-12T06:51:14Z","title":"Universality for the largest eigenvalue of sample covariance matrices with general population","month":"02","year":"2015","author":[{"last_name":"Bao","orcid":"0000-0003-3036-1475","full_name":"Bao, Zhigang","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pan, Guangming","last_name":"Pan","first_name":"Guangming"},{"last_name":"Zhou","full_name":"Zhou, Wang","first_name":"Wang"}],"date_published":"2015-02-01T00:00:00Z","doi":"10.1214/14-AOS1281","publication":"Annals of Statistics","oa_version":"Preprint","page":"382 - 421","_id":"1505","publisher":"Institute of Mathematical Statistics","day":"01","date_created":"2018-12-11T11:52:25Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1304.5690"}],"publist_id":"5672","publication_status":"published","abstract":[{"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.","lang":"eng"}],"volume":43,"status":"public","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"intvolume":"        43","issue":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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","type":"journal_article","citation":{"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>.","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.","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>.","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>","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.","short":"Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.","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>"}},{"page":"1600 - 1628","oa_version":"Preprint","publication":"Bernoulli","doi":"10.3150/14-BEJ615","date_created":"2018-12-11T11:52:25Z","day":"01","publisher":"Bernoulli Society for Mathematical Statistics and Probability","_id":"1506","month":"08","date_updated":"2021-01-12T06:51:14Z","title":"The logarithmic law of random determinant","department":[{"_id":"LaEr"}],"author":[{"id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","first_name":"Zhigang","last_name":"Bao","orcid":"0000-0003-3036-1475","full_name":"Bao, Zhigang"},{"first_name":"Guangming","last_name":"Pan","full_name":"Pan, Guangming"},{"last_name":"Zhou","full_name":"Zhou, Wang","first_name":"Wang"}],"date_published":"2015-08-01T00:00:00Z","year":"2015","type":"journal_article","citation":{"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.","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>","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>.","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."},"language":[{"iso":"eng"}],"status":"public","publication_status":"published","volume":21,"abstract":[{"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).","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1208.5823","open_access":"1"}],"publist_id":"5671","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","oa":1,"intvolume":"        21","quality_controlled":"1"}]