[{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["25760081"]},"date_updated":"2021-01-12T08:06:13Z","extern":"1","citation":{"ieee":"P. Laurent <i>et al.</i>, “Decoding a neural circuit controlling global animal state in C. elegans,” <i>eLife</i>, vol. 4. eLife Sciences Publications, 2015.","ista":"Laurent P, Soltesz Z, Nelson GM, Chen C, Arellano-Carbajal F, Levy E, de Bono M. 2015. Decoding a neural circuit controlling global animal state in C. elegans. eLife. 4, e04241.","chicago":"Laurent, Patrick, Zoltan Soltesz, Geoffrey M Nelson, Changchun Chen, Fausto Arellano-Carbajal, Emmanuel Levy, and Mario de Bono. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” <i>ELife</i>. eLife Sciences Publications, 2015. <a href=\"https://doi.org/10.7554/elife.04241\">https://doi.org/10.7554/elife.04241</a>.","ama":"Laurent P, Soltesz Z, Nelson GM, et al. Decoding a neural circuit controlling global animal state in C. elegans. <i>eLife</i>. 2015;4. doi:<a href=\"https://doi.org/10.7554/elife.04241\">10.7554/elife.04241</a>","apa":"Laurent, P., Soltesz, Z., Nelson, G. M., Chen, C., Arellano-Carbajal, F., Levy, E., &#38; de Bono, M. (2015). Decoding a neural circuit controlling global animal state in C. elegans. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.04241\">https://doi.org/10.7554/elife.04241</a>","short":"P. Laurent, Z. Soltesz, G.M. Nelson, C. Chen, F. Arellano-Carbajal, E. Levy, M. de Bono, ELife 4 (2015).","mla":"Laurent, Patrick, et al. “Decoding a Neural Circuit Controlling Global Animal State in C. Elegans.” <i>ELife</i>, vol. 4, e04241, eLife Sciences Publications, 2015, doi:<a href=\"https://doi.org/10.7554/elife.04241\">10.7554/elife.04241</a>."},"publisher":"eLife Sciences Publications","date_published":"2015-03-11T00:00:00Z","file_date_updated":"2020-07-14T12:47:20Z","pmid":1,"title":"Decoding a neural circuit controlling global animal state in C. elegans","abstract":[{"lang":"eng","text":"Brains organize behavior and physiology to optimize the response to threats or opportunities. We dissect how 21% O2, an indicator of surface exposure, reprograms C. elegans' global state, inducing sustained locomotory arousal and altering expression of neuropeptides, metabolic enzymes, and other non-neural genes. The URX O2-sensing neurons drive arousal at 21% O2 by tonically activating the RMG interneurons. Stimulating RMG is sufficient to switch behavioral state. Ablating the ASH, ADL, or ASK sensory neurons connected to RMG by gap junctions does not disrupt arousal. However, disrupting cation currents in these neurons curtails RMG neurosecretion and arousal. RMG signals high O2 by peptidergic secretion. Neuropeptide reporters reveal neural circuit state, as neurosecretion stimulates neuropeptide expression. Neural imaging in unrestrained animals shows that URX and RMG encode O2 concentration rather than behavior, while the activity of downstream interneurons such as AVB and AIY reflect both O2 levels and the behavior being executed."}],"publication_status":"published","ddc":["570"],"day":"11","year":"2015","doi":"10.7554/elife.04241","oa":1,"intvolume":"         4","publication":"eLife","author":[{"first_name":"Patrick","last_name":"Laurent","full_name":"Laurent, Patrick"},{"first_name":"Zoltan","last_name":"Soltesz","full_name":"Soltesz, Zoltan"},{"first_name":"Geoffrey M","last_name":"Nelson","full_name":"Nelson, Geoffrey M"},{"full_name":"Chen, Changchun","first_name":"Changchun","last_name":"Chen"},{"last_name":"Arellano-Carbajal","first_name":"Fausto","full_name":"Arellano-Carbajal, Fausto"},{"full_name":"Levy, Emmanuel","last_name":"Levy","first_name":"Emmanuel"},{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario","last_name":"de Bono","first_name":"Mario","orcid":"0000-0001-8347-0443"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"volume":4,"has_accepted_license":"1","month":"03","file":[{"creator":"kschuh","file_id":"6121","checksum":"cf641b7a363aecd0a101755d23dee7e0","file_size":6723528,"access_level":"open_access","relation":"main_file","file_name":"2015_elife_Laurent.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:20Z","date_created":"2019-03-19T14:29:43Z"}],"article_number":"e04241","status":"public","license":"https://creativecommons.org/licenses/by/4.0/","publication_identifier":{"issn":["2050-084X"]},"date_created":"2019-03-19T14:23:51Z","type":"journal_article","_id":"6120"},{"page":"529-537","doi":"10.1182/blood-2015-08-667055","status":"public","publication_identifier":{"issn":["0006-4971","1528-0020"]},"day":"02","year":"2015","type":"journal_article","_id":"6507","date_created":"2019-05-31T09:38:50Z","publication":"Blood","intvolume":"       127","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["26552697"]},"author":[{"orcid":"0000-0002-1864-8951","last_name":"Zhou","first_name":"Long","full_name":"Zhou, Long","id":"3E751364-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hinerman, J. M.","first_name":"J. M.","last_name":"Hinerman"},{"full_name":"Blaszczyk, M.","last_name":"Blaszczyk","first_name":"M."},{"last_name":"Miller","first_name":"J. L. C.","full_name":"Miller, J. L. C."},{"full_name":"Conrady, D. G.","first_name":"D. G.","last_name":"Conrady"},{"first_name":"A. D.","last_name":"Barrow","full_name":"Barrow, A. D."},{"first_name":"D. Y.","last_name":"Chirgadze","full_name":"Chirgadze, D. Y."},{"full_name":"Bihan, D.","first_name":"D.","last_name":"Bihan"},{"full_name":"Farndale, R. W.","first_name":"R. W.","last_name":"Farndale"},{"last_name":"Herr","first_name":"A. B.","full_name":"Herr, A. B."}],"citation":{"ieee":"L. Zhou <i>et al.</i>, “Structural basis for collagen recognition by the immune receptor OSCAR,” <i>Blood</i>, vol. 127, no. 5. American Society of Hematology, pp. 529–537, 2015.","ama":"Zhou L, Hinerman JM, Blaszczyk M, et al. Structural basis for collagen recognition by the immune receptor OSCAR. <i>Blood</i>. 2015;127(5):529-537. doi:<a href=\"https://doi.org/10.1182/blood-2015-08-667055\">10.1182/blood-2015-08-667055</a>","chicago":"Zhou, Long, J. M. Hinerman, M. Blaszczyk, J. L. C. Miller, D. G. Conrady, A. D. Barrow, D. Y. Chirgadze, D. Bihan, R. W. Farndale, and A. B. Herr. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” <i>Blood</i>. American Society of Hematology, 2015. <a href=\"https://doi.org/10.1182/blood-2015-08-667055\">https://doi.org/10.1182/blood-2015-08-667055</a>.","ista":"Zhou L, Hinerman JM, Blaszczyk M, Miller JLC, Conrady DG, Barrow AD, Chirgadze DY, Bihan D, Farndale RW, Herr AB. 2015. Structural basis for collagen recognition by the immune receptor OSCAR. Blood. 127(5), 529–537.","apa":"Zhou, L., Hinerman, J. M., Blaszczyk, M., Miller, J. L. C., Conrady, D. G., Barrow, A. D., … Herr, A. B. (2015). Structural basis for collagen recognition by the immune receptor OSCAR. <i>Blood</i>. American Society of Hematology. <a href=\"https://doi.org/10.1182/blood-2015-08-667055\">https://doi.org/10.1182/blood-2015-08-667055</a>","short":"L. Zhou, J.M. Hinerman, M. Blaszczyk, J.L.C. Miller, D.G. Conrady, A.D. Barrow, D.Y. Chirgadze, D. Bihan, R.W. Farndale, A.B. Herr, Blood 127 (2015) 529–537.","mla":"Zhou, Long, et al. “Structural Basis for Collagen Recognition by the Immune Receptor OSCAR.” <i>Blood</i>, vol. 127, no. 5, American Society of Hematology, 2015, pp. 529–37, doi:<a href=\"https://doi.org/10.1182/blood-2015-08-667055\">10.1182/blood-2015-08-667055</a>."},"oa_version":"None","date_updated":"2021-01-12T08:07:47Z","extern":"1","quality_controlled":"1","volume":127,"title":"Structural basis for collagen recognition by the immune receptor OSCAR","publisher":"American Society of Hematology","date_published":"2015-11-02T00:00:00Z","language":[{"iso":"eng"}],"pmid":1,"issue":"5","abstract":[{"lang":"eng","text":"The osteoclast-associated receptor (OSCAR) is a collagen-binding immune receptor with important roles in dendritic cell maturation and activation of inflammatory monocytes as well as in osteoclastogenesis. The crystal structure of the OSCAR ectodomain is presented, both free and in complex with a consensus triple-helical peptide (THP). The structures revealed a collagen-binding site in each immunoglobulin-like domain (D1 and D2). The THP binds near a predicted collagen-binding groove in D1, but a more extensive interaction with D2 is facilitated by the unusually wide D1-D2 interdomain angle in OSCAR. Direct binding assays, combined with site-directed mutagenesis, confirm that the primary collagen-binding site in OSCAR resides in D2, in marked contrast to the related collagen receptors, glycoprotein VI (GPVI) and leukocyte-associated immunoglobulin-like receptor-1 (LAIR-1). Monomeric OSCAR D1D2 binds to the consensus THP with a KD of 28 µM measured in solution, but shows a higher affinity (KD 1.5 μM) when binding to a solid-phase THP, most likely due to an avidity effect. These data suggest a 2-stage model for the interaction of OSCAR with a collagen fibril, with transient, low-affinity interactions initiated by the membrane-distal D1, followed by firm adhesion to the primary binding site in D2."}],"publication_status":"published","month":"11"},{"_id":"1473","type":"review","oa":1,"date_created":"2018-12-11T11:52:13Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.4914"}],"page":"113 - 156","year":"2015","day":"01","status":"public","publication":"Asterisque","intvolume":"      2015","publist_id":"5723","citation":{"short":"T. Hausel, F. Rodríguez Villegas, Asterisque 2015 (2015) 113–156.","mla":"Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective Hyperkähler Varieties.” <i>Asterisque</i>, vol. 2015, no. 370, Societe Mathematique de France, 2015, pp. 113–56.","ieee":"T. Hausel and F. Rodríguez Villegas, “Cohomology of large semiprojective hyperkähler varieties,” <i>Asterisque</i>, vol. 2015, no. 370. Societe Mathematique de France, pp. 113–156, 2015.","apa":"Hausel, T., &#38; Rodríguez Villegas, F. (2015). Cohomology of large semiprojective hyperkähler varieties. <i>Asterisque</i>. Societe Mathematique de France.","chicago":"Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective Hyperkähler Varieties.” <i>Asterisque</i>. Societe Mathematique de France, 2015.","ista":"Hausel T, Rodríguez Villegas F. 2015. Cohomology of large semiprojective hyperkähler varieties. Asterisque. 2015(370), 113–156.","ama":"Hausel T, Rodríguez Villegas F. Cohomology of large semiprojective hyperkähler varieties. <i>Asterisque</i>. 2015;2015(370):113-156."},"date_updated":"2021-01-12T06:50:59Z","extern":1,"quality_controlled":0,"author":[{"last_name":"Hausel","first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rodríguez Villegas","first_name":"Fernando","full_name":"Rodríguez Villegas, Fernando"}],"issue":"370","abstract":[{"lang":"eng","text":"In this paper we survey geometric and arithmetic techniques to study the cohomology of semiprojective hyperkähler manifolds including toric hyperkähler varieties, Nakajima quiver varieties and moduli spaces of Higgs bundles on Riemann surfaces. The resulting formulae for their Poincaré polynomials are combinatorial and representation theoretical in nature. In particular we will look at their Betti numbers and will establish some results and state some expectations on their asymptotic shape."}],"month":"01","publication_status":"published","title":"Cohomology of large semiprojective hyperkähler varieties","volume":2015,"publisher":"Societe Mathematique de France","date_published":"2015-01-01T00:00:00Z"},{"doi":"10.1109/CSF.2015.11","main_file_link":[{"open_access":"1","url":"http://epubs.surrey.ac.uk/808055/"}],"page":"46-60","day":"04","status":"public","year":"2015","date_created":"2018-12-11T11:52:14Z","oa":1,"type":"conference","_id":"1474","ec_funded":1,"conference":{"name":"CSF: Computer Security Foundations","location":"Verona, Italy","start_date":"2015-07-13","end_date":"2015-07-17"},"publist_id":"5722","author":[{"full_name":"Ferrara, Anna","first_name":"Anna","last_name":"Ferrara"},{"last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"full_name":"Liu, Bin","first_name":"Bin","last_name":"Liu"},{"first_name":"Bogdan","last_name":"Warinschi","full_name":"Warinschi, Bogdan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:50:59Z","quality_controlled":"1","department":[{"_id":"KrPi"}],"project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"citation":{"mla":"Ferrara, Anna, et al. <i>Policy Privacy in Cryptographic Access Control</i>. IEEE, 2015, pp. 46–60, doi:<a href=\"https://doi.org/10.1109/CSF.2015.11\">10.1109/CSF.2015.11</a>.","short":"A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.","ieee":"A. Ferrara, G. Fuchsbauer, B. Liu, and B. Warinschi, “Policy privacy in cryptographic access control,” presented at the CSF: Computer Security Foundations, Verona, Italy, 2015, pp. 46–60.","ama":"Ferrara A, Fuchsbauer G, Liu B, Warinschi B. Policy privacy in cryptographic access control. In: IEEE; 2015:46-60. doi:<a href=\"https://doi.org/10.1109/CSF.2015.11\">10.1109/CSF.2015.11</a>","ista":"Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic access control. CSF: Computer Security Foundations, 46–60.","chicago":"Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy Privacy in Cryptographic Access Control,” 46–60. IEEE, 2015. <a href=\"https://doi.org/10.1109/CSF.2015.11\">https://doi.org/10.1109/CSF.2015.11</a>.","apa":"Ferrara, A., Fuchsbauer, G., Liu, B., &#38; Warinschi, B. (2015). Policy privacy in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security Foundations, Verona, Italy: IEEE. <a href=\"https://doi.org/10.1109/CSF.2015.11\">https://doi.org/10.1109/CSF.2015.11</a>"},"oa_version":"Submitted Version","date_published":"2015-09-04T00:00:00Z","publisher":"IEEE","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Policy privacy in cryptographic access control","abstract":[{"text":"Cryptographic access control offers selective access to encrypted data via a combination of key management and functionality-rich cryptographic schemes, such as attribute-based encryption. Using this approach, publicly available meta-data may inadvertently leak information on the access policy that is enforced by cryptography, which renders cryptographic access control unusable in settings where this information is highly sensitive. We begin to address this problem by presenting rigorous definitions for policy privacy in cryptographic access control. For concreteness we set our results in the model of Role-Based Access Control (RBAC), where we identify and formalize several different flavors of privacy, however, our framework should serve as inspiration for other models of access control. Based on our insights we propose a new system which significantly improves on the privacy properties of state-of-the-art constructions. Our design is based on a novel type of privacy-preserving attribute-based encryption, which we introduce and show how to instantiate. We present our results in the context of a cryptographic RBAC system by Ferrara et al. (CSF'13), which uses cryptography to control read access to files, while write access is still delegated to trusted monitors. We give an extension of the construction that permits cryptographic control over write access. Our construction assumes that key management uses out-of-band channels between the policy enforcer and the users but eliminates completely the need for monitoring read/write access to the data.","lang":"eng"}],"publication_status":"published","month":"09"},{"page":"745 - 752","day":"01","year":"2015","acknowledgement":"A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n","oa":1,"publication":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","publist_id":"5713","intvolume":"         2","scopus_import":1,"related_material":{"record":[{"id":"5410","relation":"earlier_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 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.","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.","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.","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.","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.","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."},"department":[{"_id":"KrCh"}],"date_updated":"2023-02-23T12:25:07Z","title":"Automatic generation of alternative starting positions for simple traditional board games","publisher":"AAAI Press","date_published":"2015-01-01T00:00:00Z","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"}],"main_file_link":[{"open_access":"1","url":"https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300"}],"status":"public","type":"conference","_id":"1481","date_created":"2018-12-11T11:52:16Z","conference":{"location":"Austin, TX, USA","name":"AAAI: Conference on Artificial Intelligence","end_date":"2015-01-30","start_date":"2015-01-25"},"ec_funded":1,"author":[{"last_name":"Ahmed","first_name":"Umair","full_name":"Ahmed, Umair"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Sumit","last_name":"Gulwani","full_name":"Gulwani, Sumit"}],"oa_version":"None","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","volume":2,"article_processing_charge":"No","language":[{"iso":"eng"}],"month":"01"},{"publist_id":"5709","conference":{"start_date":"2015-06-07","end_date":"2015-06-12","location":"Boston, MA, USA","name":"CVPR: Computer Vision and Pattern Recognition"},"scopus_import":1,"doi":"10.1109/CVPR.2015.7299106","day":"14","year":"2015","status":"public","page":"4741 - 4748","publication_identifier":{"eisbn":["978-1-4673-6964-0 "]},"main_file_link":[{"url":"http://arxiv.org/abs/1412.6821","open_access":"1"}],"_id":"1483","type":"conference","oa":1,"date_created":"2018-12-11T11:52:17Z","title":"A stable multi-scale kernel for topological machine learning","date_published":"2015-10-14T00:00:00Z","publisher":"IEEE","language":[{"iso":"eng"}],"month":"10","publication_status":"published","abstract":[{"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.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan"},{"full_name":"Huber, Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814","last_name":"Huber","first_name":"Stefan"},{"full_name":"Bauer, Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","first_name":"Ulrich","last_name":"Bauer"},{"first_name":"Roland","last_name":"Kwitt","full_name":"Kwitt, Roland"}],"oa_version":"Preprint","citation":{"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>","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>.","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.","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.","short":"J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 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>."},"department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:51:03Z"},{"publication_status":"published","month":"08","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"}],"date_published":"2015-08-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Queen's University","volume":"2015-August","title":"Relaxed disk packing","department":[{"_id":"HeEd"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"date_updated":"2021-01-12T06:51:09Z","citation":{"apa":"Edelsbrunner, H., Iglesias Ham, M., &#38; Kurlin, V. (2015). Relaxed disk packing. In <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i> (Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.","ama":"Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>. Vol 2015-August. Queen’s University; 2015:128-135.","ista":"Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry vol. 2015–August, 128–135.","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.","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.","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.","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."},"oa_version":"Submitted Version","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","full_name":"Iglesias Ham, Mabel","first_name":"Mabel","last_name":"Iglesias Ham"},{"last_name":"Kurlin","first_name":"Vitaliy","full_name":"Kurlin, Vitaliy"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"conference":{"name":"CCCG: Canadian Conference on Computational Geometry","location":"Ontario, Canada","end_date":"2015-08-12","start_date":"2015-08-10"},"publist_id":"5684","ec_funded":1,"publication":"Proceedings of the 27th Canadian Conference on Computational Geometry","date_created":"2018-12-11T11:52:21Z","oa":1,"type":"conference","_id":"1495","page":"128-135","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1505.03402"}],"status":"public","year":"2015","day":"01"},{"author":[{"last_name":"Andergassen","first_name":"Daniel","full_name":"Andergassen, Daniel"},{"id":"4C66542E-F248-11E8-B48F-1D18A9856A87","full_name":"Dotter, Christoph","last_name":"Dotter","first_name":"Christoph"},{"first_name":"Tomasz","last_name":"Kulinski","full_name":"Kulinski, Tomasz"},{"last_name":"Guenzl","first_name":"Philipp","full_name":"Guenzl, Philipp"},{"first_name":"Philipp","last_name":"Bammer","full_name":"Bammer, Philipp"},{"full_name":"Barlow, Denise","last_name":"Barlow","first_name":"Denise"},{"first_name":"Florian","last_name":"Pauler","full_name":"Pauler, Florian"},{"last_name":"Hudson","first_name":"Quanah","full_name":"Hudson, Quanah"}],"quality_controlled":"1","oa_version":"Published Version","language":[{"iso":"eng"}],"volume":43,"has_accepted_license":"1","month":"07","issue":"21","article_number":"e146","file":[{"file_size":6863297,"access_level":"open_access","creator":"dernst","file_id":"5768","checksum":"385b83854fd0eb2e4f386867da2823e2","relation":"main_file","file_name":"2015_NucleicAcidsRes_Andergassen.pdf","date_updated":"2020-07-14T12:44:58Z","date_created":"2018-12-20T14:18:57Z","content_type":"application/pdf"}],"status":"public","date_created":"2018-12-11T11:52:22Z","type":"journal_article","_id":"1497","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:51:09Z","department":[{"_id":"GaNo"}],"citation":{"short":"D. Andergassen, C. Dotter, T. Kulinski, P. Guenzl, P. Bammer, D. Barlow, F. Pauler, Q. Hudson, Nucleic Acids Research 43 (2015).","mla":"Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing Data.” <i>Nucleic Acids Research</i>, vol. 43, no. 21, e146, Oxford University Press, 2015, doi:<a href=\"https://doi.org/10.1093/nar/gkv727\">10.1093/nar/gkv727</a>.","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.","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>","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."},"date_published":"2015-07-21T00:00:00Z","file_date_updated":"2020-07-14T12:44:58Z","publisher":"Oxford University Press","title":"Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data","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."}],"publication_status":"published","ddc":["570"],"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.","year":"2015","doi":"10.1093/nar/gkv727","day":"21","oa":1,"intvolume":"        43","publist_id":"5682","publication":"Nucleic Acids Research","scopus_import":1},{"day":"01","year":"2015","page":"90 - 102","doi":"10.4230/LIPIcs.SNAPL.2015.90","oa":1,"intvolume":"        32","publist_id":"5681","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"alternative_title":["LIPIcs"],"date_updated":"2020-08-11T10:09:14Z","department":[{"_id":"ToHe"}],"citation":{"short":"C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 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>.","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.","ista":"Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for fault-tolerant distributed systems. 32, 90–102.","ama":"Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant distributed systems. 2015;32:90-102. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SNAPL.2015.90\">10.4230/LIPIcs.SNAPL.2015.90</a>","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>.","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>"},"date_published":"2015-01-01T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:44:58Z","title":"The need for language support for fault-tolerant distributed systems","abstract":[{"lang":"eng","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."}],"publication_status":"published","series_title":"Leibniz International Proceedings in Informatics","ddc":["005"],"publication_identifier":{"isbn":["978-3-939897-80-4 "]},"status":"public","date_created":"2018-12-11T11:52:22Z","_id":"1498","type":"conference","ec_funded":1,"conference":{"location":"Asilomar, CA, United States","name":"SNAPL: Summit oN Advances in Programming Languages","start_date":"2015-05-03","end_date":"2015-05-06"},"pubrep_id":"499","author":[{"full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","last_name":"Dragoi"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"volume":32,"has_accepted_license":"1","month":"01","file":[{"date_created":"2018-12-12T10:14:02Z","date_updated":"2020-07-14T12:44:58Z","content_type":"application/pdf","file_name":"IST-2016-499-v1+1_9.pdf","relation":"main_file","access_level":"open_access","file_size":489362,"file_id":"5050","checksum":"cf5e94baa89a2dc4c5de01abc676eda8","creator":"system"}]},{"ddc":["000","003"],"abstract":[{"lang":"eng","text":"We consider weighted automata with both positive and negative integer weights on edges and\r\nstudy the problem of synchronization using adaptive strategies that may only observe whether\r\nthe current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata."}],"publication_status":"published","title":"Polynomial time decidability of weighted synchronization under partial observability","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:44:58Z","date_published":"2015-01-01T00:00:00Z","citation":{"apa":"Kretinsky, J., Larsen, K., Laursen, S., &#38; Srba, J. (2015). Polynomial time decidability of weighted synchronization under partial observability (Vol. 42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">https://doi.org/10.4230/LIPIcs.CONCUR.2015.142</a>","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.","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>.","ama":"Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:142-154. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">10.4230/LIPIcs.CONCUR.2015.142</a>","ieee":"J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability of weighted synchronization under partial observability,” presented at the CONCUR: Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.","short":"J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.","mla":"Kretinsky, Jan, et al. <i>Polynomial Time Decidability of Weighted Synchronization under Partial Observability</i>. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2015.142\">10.4230/LIPIcs.CONCUR.2015.142</a>."},"date_updated":"2021-01-12T06:51:10Z","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"scopus_import":1,"intvolume":"        42","publist_id":"5680","oa":1,"page":"142 - 154","doi":"10.4230/LIPIcs.CONCUR.2015.142","year":"2015","day":"01","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.","file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:08:12Z","date_updated":"2020-07-14T12:44:58Z","file_name":"IST-2016-498-v1+1_32.pdf","relation":"main_file","file_id":"4672","checksum":"49eb5021caafaabe5356c65b9c5f8c9c","creator":"system","access_level":"open_access","file_size":623563}],"month":"01","has_accepted_license":"1","volume":42,"language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"author":[{"orcid":"0000-0002-8122-2881","first_name":"Jan","last_name":"Kretinsky","full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kim","last_name":"Larsen","full_name":"Larsen, Kim"},{"full_name":"Laursen, Simon","last_name":"Laursen","first_name":"Simon"},{"full_name":"Srba, Jiří","last_name":"Srba","first_name":"Jiří"}],"pubrep_id":"498","ec_funded":1,"conference":{"name":"CONCUR: Concurrency Theory","location":"Madrid, Spain","end_date":"2015-09-04","start_date":"2015-09-01"},"_id":"1499","type":"conference","date_created":"2018-12-11T11:52:22Z","status":"public"},{"publication_status":"published","month":"04","abstract":[{"lang":"eng","text":"In this poster, we present methods for randomly generating hybrid automata with affine differential equations, invariants, guards, and assignments. Selecting an arbitrary affine function from the set of all affine functions results in a low likelihood of generating hybrid automata with diverse and interesting behaviors, as there are an uncountable number of elements in the set of all affine functions. Instead, we partition the set of all affine functions into potentially interesting classes and randomly select elements from these classes. For example, we partition the set of all affine differential equations by using restrictions on eigenvalues such as those that yield stable, unstable, etc. equilibrium points. We partition the components describing discrete behavior (guards, assignments, and invariants) to allow either time-dependent or state-dependent switching, and in particular provide the ability to generate subclasses of piecewise-affine hybrid automata. Our preliminary experimental results with a prototype tool called HyRG (Hybrid Random Generator) illustrate the feasibility of this generation method to automatically create standard hybrid automaton examples like the bouncing ball and thermostat."}],"date_published":"2015-04-14T00:00:00Z","publisher":"Springer","title":"Poster: HyRG: A random generation tool for affine hybrid automata","quality_controlled":0,"extern":1,"date_updated":"2019-04-26T07:22:03Z","citation":{"apa":"Nguyen, L., Schilling, C., Bogomolov, S., &#38; Johnson, T. (2015). <i>Poster: HyRG: A random generation tool for affine hybrid automata</i>. <i>HSCC: Hybrid Systems - Computation and Control</i> (pp. 289–290). Springer. <a href=\"https://doi.org/10.1145/2728606.2728650\">https://doi.org/10.1145/2728606.2728650</a>","chicago":"Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson. <i>Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata</i>. <i>HSCC: Hybrid Systems - Computation and Control</i>. Springer, 2015. <a href=\"https://doi.org/10.1145/2728606.2728650\">https://doi.org/10.1145/2728606.2728650</a>.","ama":"Nguyen L, Schilling C, Bogomolov S, Johnson T. <i>Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata</i>. Springer; 2015:289-290. doi:<a href=\"https://doi.org/10.1145/2728606.2728650\">10.1145/2728606.2728650</a>","ista":"Nguyen L, Schilling C, Bogomolov S, Johnson T. 2015. Poster: HyRG: A random generation tool for affine hybrid automata, Springer,p.","ieee":"L. Nguyen, C. Schilling, S. Bogomolov, and T. Johnson, <i>Poster: HyRG: A random generation tool for affine hybrid automata</i>. Springer, 2015, pp. 289–290.","short":"L. Nguyen, C. Schilling, S. Bogomolov, T. Johnson, Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata, Springer, 2015.","mla":"Nguyen, Luan, et al. “Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata.” <i>HSCC: Hybrid Systems - Computation and Control</i>, Springer, 2015, pp. 289–90, doi:<a href=\"https://doi.org/10.1145/2728606.2728650\">10.1145/2728606.2728650</a>."},"author":[{"full_name":"Nguyen, Luan V","last_name":"Nguyen","first_name":"Luan"},{"last_name":"Schilling","first_name":"Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Christian Schilling"},{"orcid":"0000-0002-0686-0365","first_name":"Sergiy","last_name":"Bogomolov","full_name":"Sergiy Bogomolov","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Johnson, Taylor T","last_name":"Johnson","first_name":"Taylor"}],"alternative_title":["18th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2015"],"publist_id":"5678","publication":"HSCC: Hybrid Systems - Computation and Control","date_created":"2018-12-11T11:52:23Z","type":"conference_poster","_id":"1500","status":"public","day":"14","doi":"10.1145/2728606.2728650","year":"2015","page":"289 - 290"},{"author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"first_name":"Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin"},{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","first_name":"Przemyslaw"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","oa_version":"Preprint","language":[{"iso":"eng"}],"volume":47,"month":"10","issue":"2","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.0835"}],"status":"public","date_created":"2018-12-11T11:52:23Z","type":"journal_article","_id":"1501","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-07T11:58:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"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>.","short":"K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015) 230–264.","ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative properties in Markov decision processes. <i>Formal Methods in System Design</i>. 2015;47(2):230-264. doi:<a href=\"https://doi.org/10.1007/s10703-015-0235-2\">10.1007/s10703-015-0235-2</a>","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” <i>Formal Methods in System Design</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s10703-015-0235-2\">https://doi.org/10.1007/s10703-015-0235-2</a>.","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.","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."},"publisher":"Springer","date_published":"2015-10-01T00:00:00Z","title":"CEGAR for compositional analysis of qualitative properties in Markov decision processes","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"}],"publication_status":"published","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).","day":"01","doi":"10.1007/s10703-015-0235-2","page":"230 - 264","year":"2015","oa":1,"intvolume":"        47","publist_id":"5677","publication":"Formal Methods in System Design","related_material":{"record":[{"id":"1155","relation":"dissertation_contains","status":"public"}]},"scopus_import":1},{"alternative_title":["Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering "],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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>","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>.","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.","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>","short":"N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015, pp. 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>."},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2023-09-07T11:58:33Z","title":"Complete composition operators for IOCO-testing theory","publisher":"ACM","date_published":"2015-05-01T00:00:00Z","file_date_updated":"2020-07-14T12:44:59Z","ddc":["000"],"publication_status":"published","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"}],"page":"101 - 110","day":"01","year":"2015","doi":"10.1145/2737166.2737175","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.","oa":1,"publist_id":"5676","scopus_import":1,"related_material":{"record":[{"relation":"dissertation_contains","id":"1155","status":"public"}]},"author":[{"last_name":"Beneš","first_name":"Nikola","full_name":"Beneš, Nikola"},{"full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","first_name":"Przemyslaw","last_name":"Daca"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kretinsky, Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","first_name":"Jan"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan"}],"oa_version":"Submitted Version","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"creator":"system","file_id":"5303","checksum":"c6ce681035c163a158751f240cb7d389","file_size":467561,"access_level":"open_access","relation":"main_file","file_name":"IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:59Z","date_created":"2018-12-12T10:17:46Z"}],"has_accepted_license":"1","month":"05","status":"public","publication_identifier":{"isbn":["978-1-4503-3471-6"]},"_id":"1502","type":"conference","date_created":"2018-12-11T11:52:24Z","conference":{"start_date":"2015-05-04","end_date":"2015-05-08","name":"CBSE: Component-Based Software Engineering ","location":"Montreal, QC, Canada"},"ec_funded":1,"pubrep_id":"625"},{"oa":1,"date_created":"2018-12-11T11:52:24Z","_id":"1503","type":"journal_article","year":"2015","status":"public","day":"14","page":"1582 - 1591","doi":"10.1017/etds.2013.103","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1307.8414"}],"intvolume":"        35","publist_id":"5675","publication":"Ergodic Theory and Dynamical Systems","date_updated":"2021-01-12T06:51:13Z","extern":"1","quality_controlled":"1","citation":{"mla":"Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional Pseudo-Unitary and Hermitian-Symplectic-Cocycles.” <i>Ergodic Theory and Dynamical Systems</i>, vol. 35, no. 5, Cambridge University Press, 2015, pp. 1582–91, doi:<a href=\"https://doi.org/10.1017/etds.2013.103\">10.1017/etds.2013.103</a>.","short":"C. Sadel, Ergodic Theory and Dynamical Systems 35 (2015) 1582–1591.","ama":"Sadel C. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. <i>Ergodic Theory and Dynamical Systems</i>. 2015;35(5):1582-1591. doi:<a href=\"https://doi.org/10.1017/etds.2013.103\">10.1017/etds.2013.103</a>","ista":"Sadel C. 2015. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems. 35(5), 1582–1591.","chicago":"Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional Pseudo-Unitary and Hermitian-Symplectic-Cocycles.” <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press, 2015. <a href=\"https://doi.org/10.1017/etds.2013.103\">https://doi.org/10.1017/etds.2013.103</a>.","apa":"Sadel, C. (2015). A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/etds.2013.103\">https://doi.org/10.1017/etds.2013.103</a>","ieee":"C. Sadel, “A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles,” <i>Ergodic Theory and Dynamical Systems</i>, vol. 35, no. 5. Cambridge University Press, pp. 1582–1591, 2015."},"oa_version":"Preprint","author":[{"full_name":"Sadel, Christian","id":"4760E9F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8255-3968","first_name":"Christian","last_name":"Sadel"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"A Herman-Avila-Bochi type formula is obtained for the average sum of the top d Lyapunov exponents over a one-parameter family of double-struck G-cocycles, where double-struck G is the group that leaves a certain, non-degenerate Hermitian form of signature (c, d) invariant. The generic example of such a group is the pseudo-unitary group U(c, d) or, in the case c = d, the Hermitian-symplectic group HSp(2d) which naturally appears for cocycles related to Schrödinger operators. In the case d = 1, the formula for HSp(2d) cocycles reduces to the Herman-Avila-Bochi formula for SL(2, ℝ) cocycles.","lang":"eng"}],"publication_status":"published","month":"03","issue":"5","date_published":"2015-03-14T00:00:00Z","publisher":"Cambridge University Press","language":[{"iso":"eng"}],"title":"A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles","volume":35},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0003-3036-1475","first_name":"Zhigang","last_name":"Bao","full_name":"Bao, Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lin, Liang","first_name":"Liang","last_name":"Lin"},{"full_name":"Pan, Guangming","last_name":"Pan","first_name":"Guangming"},{"full_name":"Zhou, Wang","last_name":"Zhou","first_name":"Wang"}],"citation":{"apa":"Bao, Z., Lin, L., Pan, G., &#38; Zhou, W. (2015). Spectral statistics of large dimensional spearman s rank correlation matrix and its application. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AOS1353\">https://doi.org/10.1214/15-AOS1353</a>","ama":"Bao Z, Lin L, Pan G, Zhou W. Spectral statistics of large dimensional spearman s rank correlation matrix and its application. <i>Annals of Statistics</i>. 2015;43(6):2588-2623. doi:<a href=\"https://doi.org/10.1214/15-AOS1353\">10.1214/15-AOS1353</a>","ista":"Bao Z, Lin L, Pan G, Zhou W. 2015. Spectral statistics of large dimensional spearman s rank correlation matrix and its application. Annals of Statistics. 43(6), 2588–2623.","chicago":"Bao, Zhigang, Liang Lin, Guangming Pan, and Wang Zhou. “Spectral Statistics of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.” <i>Annals of Statistics</i>. Institute of Mathematical Statistics, 2015. <a href=\"https://doi.org/10.1214/15-AOS1353\">https://doi.org/10.1214/15-AOS1353</a>.","ieee":"Z. Bao, L. Lin, G. Pan, and W. Zhou, “Spectral statistics of large dimensional spearman s rank correlation matrix and its application,” <i>Annals of Statistics</i>, vol. 43, no. 6. Institute of Mathematical Statistics, pp. 2588–2623, 2015.","mla":"Bao, Zhigang, et al. “Spectral Statistics of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.” <i>Annals of Statistics</i>, vol. 43, no. 6, Institute of Mathematical Statistics, 2015, pp. 2588–623, doi:<a href=\"https://doi.org/10.1214/15-AOS1353\">10.1214/15-AOS1353</a>.","short":"Z. Bao, L. Lin, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 2588–2623."},"oa_version":"Published Version","date_updated":"2021-01-12T06:51:14Z","quality_controlled":"1","extern":"1","title":"Spectral statistics of large dimensional spearman s rank correlation matrix and its application","volume":43,"date_published":"2015-12-01T00:00:00Z","publisher":"Institute of Mathematical Statistics","language":[{"iso":"eng"}],"issue":"6","abstract":[{"lang":"eng","text":"Let Q = (Q1, . . . , Qn) be a random vector drawn from the uniform distribution on the set of all n! permutations of {1, 2, . . . , n}. Let Z = (Z1, . . . , Zn), where Zj is the mean zero variance one random variable obtained by centralizing and normalizing Qj , j = 1, . . . , n. Assume that Xi , i = 1, . . . ,p are i.i.d. copies of 1/√ p Z and X = Xp,n is the p × n random matrix with Xi as its ith row. Then Sn = XX is called the p × n Spearman's rank correlation matrix which can be regarded as a high dimensional extension of the classical nonparametric statistic Spearman's rank correlation coefficient between two independent random variables. In this paper, we establish a CLT for the linear spectral statistics of this nonparametric random matrix model in the scenario of high dimension, namely, p = p(n) and p/n→c ∈ (0,∞) as n→∞.We propose a novel evaluation scheme to estimate the core quantity in Anderson and Zeitouni's cumulant method in [Ann. Statist. 36 (2008) 2553-2576] to bypass the so-called joint cumulant summability. In addition, we raise a two-step comparison approach to obtain the explicit formulae for the mean and covariance functions in the CLT. Relying on this CLT, we then construct a distribution-free statistic to test complete independence for components of random vectors. Owing to the nonparametric property, we can use this test on generally distributed random variables including the heavy-tailed ones."}],"month":"12","publication_status":"published","page":"2588 - 2623","doi":"10.1214/15-AOS1353","day":"01","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1312.5119"}],"year":"2015","status":"public","type":"journal_article","_id":"1504","oa":1,"date_created":"2018-12-11T11:52:24Z","publication":"Annals of Statistics","intvolume":"        43","publist_id":"5674"},{"author":[{"full_name":"Bao, Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3036-1475","first_name":"Zhigang","last_name":"Bao"},{"full_name":"Pan, Guangming","first_name":"Guangming","last_name":"Pan"},{"full_name":"Zhou, Wang","last_name":"Zhou","first_name":"Wang"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"quality_controlled":"1","date_updated":"2021-01-12T06:51:14Z","oa_version":"Preprint","citation":{"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.","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.","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>","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>.","apa":"Bao, Z., Pan, G., &#38; Zhou, W. (2015). Universality for the largest eigenvalue of sample covariance matrices with general population. <i>Annals of Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/14-AOS1281\">https://doi.org/10.1214/14-AOS1281</a>","short":"Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.","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>."},"language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","publisher":"Institute of Mathematical Statistics","volume":43,"title":"Universality for the largest eigenvalue of sample covariance matrices with general population","publication_status":"published","month":"02","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"}],"issue":"1","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","year":"2015","doi":"10.1214/14-AOS1281","main_file_link":[{"url":"https://arxiv.org/abs/1304.5690","open_access":"1"}],"page":"382 - 421","status":"public","day":"01","date_created":"2018-12-11T11:52:25Z","oa":1,"type":"journal_article","_id":"1505","publist_id":"5672","intvolume":"        43","publication":"Annals of Statistics"},{"publist_id":"5671","intvolume":"        21","publication":"Bernoulli","doi":"10.3150/14-BEJ615","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1208.5823"}],"page":"1600 - 1628","day":"01","status":"public","year":"2015","oa":1,"date_created":"2018-12-11T11:52:25Z","_id":"1506","type":"journal_article","date_published":"2015-08-01T00:00:00Z","publisher":"Bernoulli Society for Mathematical Statistics and Probability","language":[{"iso":"eng"}],"volume":21,"title":"The logarithmic law of random determinant","month":"08","publication_status":"published","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"}],"issue":"3","author":[{"first_name":"Zhigang","last_name":"Bao","orcid":"0000-0003-3036-1475","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","full_name":"Bao, Zhigang"},{"last_name":"Pan","first_name":"Guangming","full_name":"Pan, Guangming"},{"full_name":"Zhou, Wang","last_name":"Zhou","first_name":"Wang"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"LaEr"}],"quality_controlled":"1","date_updated":"2021-01-12T06:51:14Z","oa_version":"Preprint","citation":{"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.","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>","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>","ista":"Bao Z, Pan G, Zhou W. 2015. The logarithmic law of random determinant. Bernoulli. 21(3), 1600–1628.","chicago":"Bao, Zhigang, Guangming Pan, and Wang Zhou. “The Logarithmic Law of Random Determinant.” <i>Bernoulli</i>. Bernoulli Society for Mathematical Statistics and Probability, 2015. <a href=\"https://doi.org/10.3150/14-BEJ615\">https://doi.org/10.3150/14-BEJ615</a>.","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>.","short":"Z. Bao, G. Pan, W. Zhou, Bernoulli 21 (2015) 1600–1628."}},{"issue":"8","abstract":[{"text":"We consider generalized Wigner ensembles and general β-ensembles with analytic potentials for any β ≥ 1. The recent universality results in particular assert that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum are universal in the sense that they coincide with those of the corresponding Gaussian β-ensembles. In this article, we show that local averaging is not necessary for this result, i.e. we prove that the single gap distributions in the bulk are universal. In fact, with an additional step, our result can be extended to any C4(ℝ) potential.","lang":"eng"}],"publication_status":"published","month":"08","volume":17,"title":"Gap universality of generalized Wigner and β ensembles","date_published":"2015-08-01T00:00:00Z","publisher":"European Mathematical Society","language":[{"iso":"eng"}],"oa_version":"Preprint","citation":{"mla":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8, European Mathematical Society, 2015, pp. 1927–2036, doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>.","short":"L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015) 1927–2036.","ieee":"L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8. European Mathematical Society, pp. 1927–2036, 2015.","apa":"Erdös, L., &#38; Yau, H. (2015). Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>","chicago":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society, 2015. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>.","ista":"Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 17(8), 1927–2036.","ama":"Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. 2015;17(8):1927-2036. doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>"},"date_updated":"2021-01-12T06:51:15Z","quality_controlled":"1","department":[{"_id":"LaEr"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yau, Horng","last_name":"Yau","first_name":"Horng"}],"scopus_import":1,"publication":"Journal of the European Mathematical Society","intvolume":"        17","publist_id":"5669","_id":"1508","type":"journal_article","oa":1,"date_created":"2018-12-11T11:52:26Z","page":"1927 - 2036","doi":"10.4171/JEMS/548","main_file_link":[{"url":"http://arxiv.org/abs/1211.3786","open_access":"1"}],"year":"2015","day":"01","status":"public"},{"citation":{"short":"J. Michalko, M. Lukacisinova, M.T. Bollenbach, J. Friml, F1000 Research  4 (2015).","mla":"Michalko, Jaroslav, et al. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” <i>F1000 Research </i>, vol. 4, F1000 Research, 2015, doi:<a href=\"https://doi.org/10.12688/f1000research.7143.1\">10.12688/f1000research.7143.1</a>.","ieee":"J. Michalko, M. Lukacisinova, M. T. Bollenbach, and J. Friml, “Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene,” <i>F1000 Research </i>, vol. 4. F1000 Research, 2015.","ista":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. 2015. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000 Research . 4.","chicago":"Michalko, Jaroslav, Marta Lukacisinova, Mark Tobias Bollenbach, and Jiří Friml. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of the Neighboring BSM Gene.” <i>F1000 Research </i>. F1000 Research, 2015. <a href=\"https://doi.org/10.12688/f1000research.7143.1\">https://doi.org/10.12688/f1000research.7143.1</a>.","ama":"Michalko J, Lukacisinova M, Bollenbach MT, Friml J. Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. <i>F1000 Research </i>. 2015;4. doi:<a href=\"https://doi.org/10.12688/f1000research.7143.1\">10.12688/f1000research.7143.1</a>","apa":"Michalko, J., Lukacisinova, M., Bollenbach, M. T., &#38; Friml, J. (2015). Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene. <i>F1000 Research </i>. F1000 Research. <a href=\"https://doi.org/10.12688/f1000research.7143.1\">https://doi.org/10.12688/f1000research.7143.1</a>"},"department":[{"_id":"JiFr"},{"_id":"ToBo"}],"date_updated":"2025-05-07T11:12:30Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"publication_status":"published","abstract":[{"lang":"eng","text":"The Auxin Binding Protein1 (ABP1) has been identified based on its ability to bind auxin with high affinity and studied for a long time as a prime candidate for the extracellular auxin receptor responsible for mediating in particular the fast non-transcriptional auxin responses. However, the contradiction between the embryo-lethal phenotypes of the originally described Arabidopsis T-DNA insertional knock-out alleles (abp1-1 and abp1-1s) and the wild type-like phenotypes of other recently described loss-of-function alleles (abp1-c1 and abp1-TD1) questions the biological importance of ABP1 and relevance of the previous genetic studies. Here we show that there is no hidden copy of the ABP1 gene in the Arabidopsis genome but the embryo-lethal phenotypes of abp1-1 and abp1-1s alleles are very similar to the knock-out phenotypes of the neighboring gene, BELAYA SMERT (BSM). Furthermore, the allelic complementation test between bsm and abp1 alleles shows that the embryo-lethality in the abp1-1 and abp1-1s alleles is caused by the off-target disruption of the BSM locus by the T-DNA insertions. This clarifies the controversy of different phenotypes among published abp1 knock-out alleles and asks for reflections on the developmental role of ABP1."}],"title":"Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene","publisher":"F1000 Research","file_date_updated":"2020-07-14T12:44:59Z","date_published":"2015-10-01T00:00:00Z","oa":1,"day":"01","year":"2015","doi":"10.12688/f1000research.7143.1","acknowledgement":"This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP to JF). JM internship was supported by the grant “Action Austria – Slovakia”.\r\nData associated with the article are available under the terms of the Creative Commons Zero \"No rights reserved\" data waiver (CC0 1.0 Public domain dedication). \r\n\r\nData availability: \r\nF1000Research: Dataset 1. Dataset 1, 10.5256/f1000research.7143.d104552\r\n\r\nF1000Research: Dataset 2. Dataset 2, 10.5256/f1000research.7143.d104553\r\n\r\nF1000Research: Dataset 3. Dataset 3, 10.5256/f1000research.7143.d104554","scopus_import":"1","publication":"F1000 Research ","publist_id":"5668","intvolume":"         4","oa_version":"Published Version","quality_controlled":"1","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7"}],"author":[{"id":"483727CA-F248-11E8-B48F-1D18A9856A87","full_name":"Michalko, Jaroslav","last_name":"Michalko","first_name":"Jaroslav"},{"last_name":"Dravecka","first_name":"Marta","orcid":"0000-0002-2519-8004","id":"4342E402-F248-11E8-B48F-1D18A9856A87","full_name":"Dravecka, Marta"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Tobias","last_name":"Bollenbach","first_name":"Tobias","orcid":"0000-0003-4398-476X"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:44:59Z","date_created":"2018-12-12T10:16:12Z","file_name":"IST-2016-497-v1+1_10.12688_f1000research.7143.1_20151102.pdf","relation":"main_file","creator":"system","checksum":"8beae5cbe988e1060265ae7de2ee8306","file_id":"5198","file_size":4414248,"access_level":"open_access"}],"month":"10","has_accepted_license":"1","volume":4,"article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"1509","type":"journal_article","date_created":"2018-12-11T11:52:26Z","status":"public","pubrep_id":"497","ec_funded":1},{"volume":34,"language":[{"iso":"eng"}],"file":[{"creator":"system","checksum":"49eb5021caafaabe5356c65b9c5f8c9c","file_id":"5001","file_size":623563,"access_level":"open_access","relation":"main_file","file_name":"IST-2016-503-v1+1_32.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:59Z","date_created":"2018-12-12T10:13:19Z"}],"has_accepted_license":"1","month":"06","author":[{"first_name":"Peter","last_name":"Franek","id":"473294AE-F248-11E8-B48F-1D18A9856A87","full_name":"Franek, Peter"},{"full_name":"Krcál, Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","first_name":"Marek","last_name":"Krcál"}],"oa_version":"Published Version","quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","location":"Eindhoven, Netherlands","end_date":"2015-06-25","start_date":"2015-06-22"},"ec_funded":1,"pubrep_id":"503","status":"public","type":"conference","_id":"1510","date_created":"2018-12-11T11:52:26Z","title":"On computability and triviality of well groups","date_published":"2015-06-11T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2020-07-14T12:44:59Z","ddc":["510"],"publication_status":"published","abstract":[{"lang":"eng","text":"The concept of well group in a special but important case captures homological properties of the zero set of a continuous map f from K to R^n on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within L_infty distance r from f for a given r &gt; 0. The main drawback of the approach is that the computability of well groups was shown only when dim K = n or n = 1. Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of R^n by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and dim K &lt; 2n-2, our approximation of the (dim K-n)th well group is exact. For the second part, we find examples of maps f, f' from K to R^n with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status. "}],"alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"ieee":"P. Franek and M. Krcál, “On computability and triviality of well groups,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 842–856.","apa":"Franek, P., &#38; Krcál, M. (2015). On computability and triviality of well groups (Vol. 34, pp. 842–856). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">https://doi.org/10.4230/LIPIcs.SOCG.2015.842</a>","chicago":"Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well Groups,” 34:842–56. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. <a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">https://doi.org/10.4230/LIPIcs.SOCG.2015.842</a>.","ama":"Franek P, Krcál M. On computability and triviality of well groups. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:842-856. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">10.4230/LIPIcs.SOCG.2015.842</a>","ista":"Franek P, Krcál M. 2015. On computability and triviality of well groups. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 842–856.","mla":"Franek, Peter, and Marek Krcál. <i>On Computability and Triviality of Well Groups</i>. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–56, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SOCG.2015.842\">10.4230/LIPIcs.SOCG.2015.842</a>.","short":"P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–856."},"department":[{"_id":"UlWa"},{"_id":"HeEd"}],"date_updated":"2023-02-21T17:02:57Z","publist_id":"5667","intvolume":"        34","scopus_import":1,"related_material":{"record":[{"relation":"later_version","id":"1408","status":"public"}]},"doi":"10.4230/LIPIcs.SOCG.2015.842","page":"842 - 856","year":"2015","day":"11","oa":1}]