[{"department":[{"_id":"HeEd"}],"title":"Statistical topological data analysis-A kernel perspective","author":[{"first_name":"Roland","last_name":"Kwitt","full_name":"Kwitt, Roland"},{"full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","last_name":"Huber","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Niethammer, Marc","last_name":"Niethammer","first_name":"Marc"},{"full_name":"Lin, Weili","last_name":"Lin","first_name":"Weili"},{"first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer"}],"publist_id":"5782","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:50:38Z","citation":{"mla":"Kwitt, Roland, et al. Statistical Topological Data Analysis-A Kernel Perspective. Vol. 28, Neural Information Processing Systems, 2015, pp. 3070–78.","short":"R. Kwitt, S. Huber, M. Niethammer, W. Lin, U. Bauer, in:, Neural Information Processing Systems, 2015, pp. 3070–3078.","ieee":"R. Kwitt, S. Huber, M. Niethammer, W. Lin, and U. Bauer, “Statistical topological data analysis-A kernel perspective,” presented at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2015, vol. 28, pp. 3070–3078.","apa":"Kwitt, R., Huber, S., Niethammer, M., Lin, W., & Bauer, U. (2015). Statistical topological data analysis-A kernel perspective (Vol. 28, pp. 3070–3078). Presented at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information Processing Systems.","ama":"Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. Statistical topological data analysis-A kernel perspective. In: Vol 28. Neural Information Processing Systems; 2015:3070-3078.","chicago":"Kwitt, Roland, Stefan Huber, Marc Niethammer, Weili Lin, and Ulrich Bauer. “Statistical Topological Data Analysis-A Kernel Perspective,” 28:3070–78. Neural Information Processing Systems, 2015.","ista":"Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. 2015. Statistical topological data analysis-A kernel perspective. NIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 28, 3070–3078."},"status":"public","type":"conference","conference":{"name":"NIPS: Neural Information Processing Systems","end_date":"2015-12-12","location":"Montreal, Canada","start_date":"2015-12-07"},"_id":"1424","date_published":"2015-12-01T00:00:00Z","volume":28,"date_created":"2018-12-11T11:51:56Z","page":"3070 - 3078","day":"01","language":[{"iso":"eng"}],"publication_status":"published","year":"2015","month":"12","intvolume":" 28","alternative_title":["Advances in Neural Information Processing Systems"],"publisher":"Neural Information Processing Systems","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://papers.nips.cc/paper/5887-statistical-topological-data-analysis-a-kernel-perspective","open_access":"1"}],"oa_version":"Submitted Version","acknowledgement":"This work was partially supported by the Austrian Science FUnd, project no. KLI 00012.","abstract":[{"text":"We consider the problem of statistical computations with persistence diagrams, a summary representation of topological features in data. These diagrams encode persistent homology, a widely used invariant in topological data analysis. While several avenues towards a statistical treatment of the diagrams have been explored recently, we follow an alternative route that is motivated by the success of methods based on the embedding of probability measures into reproducing kernel Hilbert spaces. In fact, a positive definite kernel on persistence diagrams has recently been proposed, connecting persistent homology to popular kernel-based learning techniques such as support vector machines. However, important properties of that kernel enabling a principled use in the context of probability measure embeddings remain to be explored. Our contribution is to close this gap by proving universality of a variant of the original kernel, and to demonstrate its effective use in twosample hypothesis testing on synthetic as well as real-world data.","lang":"eng"}]},{"year":"2015","publication_status":"published","day":"11","language":[{"iso":"eng"}],"publication":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","page":"1455 - 1462","date_published":"2015-07-11T00:00:00Z","doi":"10.1145/2739480.2754758","ec_funded":1,"date_created":"2018-12-11T11:51:58Z","abstract":[{"text":"Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired by natural evolution. In recent years the field of evolutionary computation has developed a rigorous analytical theory to analyse their runtime on many illustrative problems. Here we apply this theory to a simple model of natural evolution. In the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between occurrence of new mutations is much longer than the time it takes for a new beneficial mutation to take over the population. In this situation, the population only contains copies of one genotype and evolution can be modelled as a (1+1)-type process where the probability of accepting a new genotype (improvements or worsenings) depends on the change in fitness. We present an initial runtime analysis of SSWM, quantifying its performance for various parameters and investigating differences to the (1+1) EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking advantage of information on the fitness gradient.","lang":"eng"}],"oa_version":"Preprint","scopus_import":1,"publisher":"ACM","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1504.06260"}],"month":"07","citation":{"chicago":"Paixao, Tiago, Dirk Sudholt, Jorge Heredia, and Barbora Trubenova. “First Steps towards a Runtime Comparison of Natural and Artificial Evolution.” In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, 1455–62. ACM, 2015. https://doi.org/10.1145/2739480.2754758.","ista":"Paixao T, Sudholt D, Heredia J, Trubenova B. 2015. First steps towards a runtime comparison of natural and artificial evolution. Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. GECCO: Genetic and evolutionary computation conference, 1455–1462.","mla":"Paixao, Tiago, et al. “First Steps towards a Runtime Comparison of Natural and Artificial Evolution.” Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, ACM, 2015, pp. 1455–62, doi:10.1145/2739480.2754758.","ieee":"T. Paixao, D. Sudholt, J. Heredia, and B. Trubenova, “First steps towards a runtime comparison of natural and artificial evolution,” in Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, Madrid, Spain, 2015, pp. 1455–1462.","short":"T. Paixao, D. Sudholt, J. Heredia, B. Trubenova, in:, Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, ACM, 2015, pp. 1455–1462.","apa":"Paixao, T., Sudholt, D., Heredia, J., & Trubenova, B. (2015). First steps towards a runtime comparison of natural and artificial evolution. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation (pp. 1455–1462). Madrid, Spain: ACM. https://doi.org/10.1145/2739480.2754758","ama":"Paixao T, Sudholt D, Heredia J, Trubenova B. First steps towards a runtime comparison of natural and artificial evolution. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. ACM; 2015:1455-1462. doi:10.1145/2739480.2754758"},"date_updated":"2021-01-12T06:50:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5768","author":[{"first_name":"Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao","full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953"},{"last_name":"Sudholt","full_name":"Sudholt, Dirk","first_name":"Dirk"},{"first_name":"Jorge","full_name":"Heredia, Jorge","last_name":"Heredia"},{"full_name":"Trubenova, Barbora","orcid":"0000-0002-6873-2967","last_name":"Trubenova","id":"42302D54-F248-11E8-B48F-1D18A9856A87","first_name":"Barbora"}],"title":"First steps towards a runtime comparison of natural and artificial evolution","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"_id":"1430","type":"conference","conference":{"name":"GECCO: Genetic and evolutionary computation conference","start_date":"2015-07-11","location":"Madrid, Spain","end_date":"2015-07-15"},"status":"public","project":[{"call_identifier":"FP7","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","grant_number":"618091","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"}]},{"status":"public","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"conference":{"start_date":"2015-07-13","location":"Verona, Italy","end_date":"2015-07-17","name":"CSF: Computer Security Foundations"},"type":"conference","_id":"1474","department":[{"_id":"KrPi"}],"title":"Policy privacy in cryptographic access control","article_processing_charge":"No","publist_id":"5722","author":[{"last_name":"Ferrara","full_name":"Ferrara, Anna","first_name":"Anna"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"},{"first_name":"Bin","full_name":"Liu, Bin","last_name":"Liu"},{"first_name":"Bogdan","last_name":"Warinschi","full_name":"Warinschi, Bogdan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Ferrara, Anna, et al. Policy Privacy in Cryptographic Access Control. IEEE, 2015, pp. 46–60, doi:10.1109/CSF.2015.11.","ama":"Ferrara A, Fuchsbauer G, Liu B, Warinschi B. Policy privacy in cryptographic access control. In: IEEE; 2015:46-60. doi:10.1109/CSF.2015.11","apa":"Ferrara, A., Fuchsbauer, G., Liu, B., & Warinschi, B. (2015). Policy privacy in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security Foundations, Verona, Italy: IEEE. https://doi.org/10.1109/CSF.2015.11","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.","short":"A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.","chicago":"Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy Privacy in Cryptographic Access Control,” 46–60. IEEE, 2015. https://doi.org/10.1109/CSF.2015.11.","ista":"Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic access control. CSF: Computer Security Foundations, 46–60."},"date_updated":"2021-01-12T06:50:59Z","month":"09","oa":1,"main_file_link":[{"url":"http://epubs.surrey.ac.uk/808055/","open_access":"1"}],"quality_controlled":"1","publisher":"IEEE","oa_version":"Submitted Version","abstract":[{"lang":"eng","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."}],"date_created":"2018-12-11T11:52:14Z","ec_funded":1,"date_published":"2015-09-04T00:00:00Z","doi":"10.1109/CSF.2015.11","page":"46-60","language":[{"iso":"eng"}],"day":"04","year":"2015","publication_status":"published"},{"extern":1,"citation":{"ista":"Hausel T, Rodríguez Villegas F. 2015. Cohomology of large semiprojective hyperkähler varieties. Asterisque. 2015(370), 113–156.","chicago":"Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective Hyperkähler Varieties.” Asterisque. Societe Mathematique de France, 2015.","apa":"Hausel, T., & Rodríguez Villegas, F. (2015). Cohomology of large semiprojective hyperkähler varieties. Asterisque. Societe Mathematique de France.","ama":"Hausel T, Rodríguez Villegas F. Cohomology of large semiprojective hyperkähler varieties. Asterisque. 2015;2015(370):113-156.","short":"T. Hausel, F. Rodríguez Villegas, Asterisque 2015 (2015) 113–156.","ieee":"T. Hausel and F. Rodríguez Villegas, “Cohomology of large semiprojective hyperkähler varieties,” Asterisque, vol. 2015, no. 370. Societe Mathematique de France, pp. 113–156, 2015.","mla":"Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective Hyperkähler Varieties.” Asterisque, vol. 2015, no. 370, Societe Mathematique de France, 2015, pp. 113–56."},"date_updated":"2021-01-12T06:50:59Z","title":"Cohomology of large semiprojective hyperkähler varieties","publist_id":"5723","author":[{"full_name":"Tamas Hausel","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas"},{"last_name":"Rodríguez Villegas","full_name":"Rodríguez Villegas, Fernando","first_name":"Fernando"}],"_id":"1473","status":"public","type":"review","publication":"Asterisque","day":"01","year":"2015","publication_status":"published","date_created":"2018-12-11T11:52:13Z","volume":2015,"date_published":"2015-01-01T00:00:00Z","issue":"370","page":"113 - 156","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."}],"intvolume":" 2015","month":"01","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1309.4914","open_access":"1"}],"quality_controlled":0,"publisher":"Societe Mathematique de France"},{"oa_version":"Preprint","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."}],"month":"10","scopus_import":1,"publisher":"IEEE","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1412.6821"}],"oa":1,"day":"14","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-1-4673-6964-0 "]},"publication_status":"published","year":"2015","doi":"10.1109/CVPR.2015.7299106","date_published":"2015-10-14T00:00:00Z","date_created":"2018-12-11T11:52:17Z","page":"4741 - 4748","_id":"1483","status":"public","type":"conference","conference":{"name":"CVPR: Computer Vision and Pattern Recognition","start_date":"2015-06-07","location":"Boston, MA, USA","end_date":"2015-06-12"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:51:03Z","citation":{"mla":"Reininghaus, Jan, et al. A Stable Multi-Scale Kernel for Topological Machine Learning. IEEE, 2015, pp. 4741–48, doi:10.1109/CVPR.2015.7299106.","apa":"Reininghaus, J., Huber, S., Bauer, U., & 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. https://doi.org/10.1109/CVPR.2015.7299106","ama":"Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for topological machine learning. In: IEEE; 2015:4741-4748. doi:10.1109/CVPR.2015.7299106","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.","chicago":"Reininghaus, Jan, Stefan Huber, Ulrich Bauer, and Roland Kwitt. “A Stable Multi-Scale Kernel for Topological Machine Learning,” 4741–48. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299106.","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."},"title":"A stable multi-scale kernel for topological machine learning","department":[{"_id":"HeEd"}],"author":[{"last_name":"Reininghaus","full_name":"Reininghaus, Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"last_name":"Huber","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bauer, Ulrich","orcid":"0000-0002-9683-0724","last_name":"Bauer","first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kwitt, Roland","last_name":"Kwitt","first_name":"Roland"}],"publist_id":"5709"},{"oa_version":"Published Version","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"}],"month":"01","intvolume":" 32","alternative_title":["LIPIcs"],"scopus_import":1,"file":[{"date_created":"2018-12-12T10:14:02Z","file_name":"IST-2016-499-v1+1_9.pdf","creator":"system","date_updated":"2020-07-14T12:44:58Z","file_size":489362,"file_id":"5050","checksum":"cf5e94baa89a2dc4c5de01abc676eda8","access_level":"open_access","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-939897-80-4 "]},"publication_status":"published","volume":32,"ec_funded":1,"_id":"1498","series_title":"Leibniz International Proceedings in Informatics","status":"public","pubrep_id":"499","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"SNAPL: Summit oN Advances in Programming Languages","start_date":"2015-05-03","end_date":"2015-05-06","location":"Asilomar, CA, United States"},"ddc":["005"],"date_updated":"2020-08-11T10:09:14Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:44:58Z","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"day":"01","has_accepted_license":"1","year":"2015","doi":"10.4230/LIPIcs.SNAPL.2015.90","date_published":"2015-01-01T00:00:00Z","date_created":"2018-12-11T11:52:22Z","page":"90 - 102","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90.","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. The Need for Language Support for Fault-Tolerant Distributed Systems. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:10.4230/LIPIcs.SNAPL.2015.90.","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.","ama":"Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant distributed systems. 2015;32:90-102. doi:10.4230/LIPIcs.SNAPL.2015.90","apa":"Dragoi, C., Henzinger, T. A., & 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. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90"},"title":"The need for language support for fault-tolerant distributed systems","author":[{"last_name":"Dragoi","full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","last_name":"Zufferey"}],"publist_id":"5681"},{"department":[{"_id":"GaNo"}],"file_date_updated":"2020-07-14T12:44:58Z","date_updated":"2021-01-12T06:51:09Z","ddc":["570"],"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","_id":"1497","issue":"21","volume":43,"publication_status":"published","file":[{"file_name":"2015_NucleicAcidsRes_Andergassen.pdf","date_created":"2018-12-20T14:18:57Z","file_size":6863297,"date_updated":"2020-07-14T12:44:58Z","creator":"dernst","file_id":"5768","checksum":"385b83854fd0eb2e4f386867da2823e2","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"scopus_import":1,"month":"07","intvolume":" 43","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."}],"oa_version":"Published Version","publist_id":"5682","author":[{"first_name":"Daniel","last_name":"Andergassen","full_name":"Andergassen, Daniel"},{"id":"4C66542E-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Dotter, Christoph","last_name":"Dotter"},{"last_name":"Kulinski","full_name":"Kulinski, Tomasz","first_name":"Tomasz"},{"first_name":"Philipp","last_name":"Guenzl","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"},{"first_name":"Quanah","last_name":"Hudson","full_name":"Hudson, Quanah"}],"title":"Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data","citation":{"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.","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.” Nucleic Acids Research. Oxford University Press, 2015. https://doi.org/10.1093/nar/gkv727.","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. Nucleic Acids Research. Oxford University Press. https://doi.org/10.1093/nar/gkv727","ama":"Andergassen D, Dotter C, Kulinski T, et al. Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. Nucleic Acids Research. 2015;43(21). doi:10.1093/nar/gkv727","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 et al., “Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data,” Nucleic Acids Research, vol. 43, no. 21. Oxford University Press, 2015.","mla":"Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing Data.” Nucleic Acids Research, vol. 43, no. 21, e146, Oxford University Press, 2015, doi:10.1093/nar/gkv727."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"e146","doi":"10.1093/nar/gkv727","date_published":"2015-07-21T00:00:00Z","date_created":"2018-12-11T11:52:22Z","has_accepted_license":"1","year":"2015","day":"21","publication":"Nucleic Acids Research","publisher":"Oxford University Press","quality_controlled":"1","oa":1,"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."},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:44:58Z","ddc":["000","003"],"date_updated":"2021-01-12T06:51:10Z","pubrep_id":"498","status":"public","conference":{"name":"CONCUR: Concurrency Theory","location":"Madrid, Spain","end_date":"2015-09-04","start_date":"2015-09-01"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"conference","_id":"1499","ec_funded":1,"volume":42,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","checksum":"49eb5021caafaabe5356c65b9c5f8c9c","file_id":"4672","creator":"system","file_size":623563,"date_updated":"2020-07-14T12:44:58Z","file_name":"IST-2016-498-v1+1_32.pdf","date_created":"2018-12-12T10:08:12Z"}],"publication_status":"published","intvolume":" 42","month":"01","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","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."}],"title":"Polynomial time decidability of weighted synchronization under partial observability","author":[{"last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kim","full_name":"Larsen, Kim","last_name":"Larsen"},{"full_name":"Laursen, Simon","last_name":"Laursen","first_name":"Simon"},{"first_name":"Jiří","last_name":"Srba","full_name":"Srba, Jiří"}],"publist_id":"5680","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.","short":"J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 142–154.","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.","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:10.4230/LIPIcs.CONCUR.2015.142","apa":"Kretinsky, J., Larsen, K., Laursen, S., & 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. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142","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. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.","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."},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_created":"2018-12-11T11:52:22Z","doi":"10.4230/LIPIcs.CONCUR.2015.142","date_published":"2015-01-01T00:00:00Z","page":"142 - 154","day":"01","year":"2015","has_accepted_license":"1","oa":1,"quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","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,"quality_controlled":"1","publisher":"Queen's University","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1505.03402"}],"month":"08","abstract":[{"lang":"eng","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. "}],"oa_version":"Submitted Version","page":"128-135","volume":"2015-August","date_published":"2015-08-01T00:00:00Z","date_created":"2018-12-11T11:52:21Z","ec_funded":1,"year":"2015","publication_status":"published","day":"01","language":[{"iso":"eng"}],"publication":"Proceedings of the 27th Canadian Conference on Computational Geometry","type":"conference","conference":{"name":"CCCG: Canadian Conference on Computational Geometry","location":"Ontario, Canada","end_date":"2015-08-12","start_date":"2015-08-10"},"project":[{"name":"Topological Complex Systems","grant_number":"318493","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"status":"public","_id":"1495","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel"},{"first_name":"Vitaliy","full_name":"Kurlin, Vitaliy","last_name":"Kurlin"}],"publist_id":"5684","title":"Relaxed disk packing","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:51:09Z","citation":{"short":"H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th Canadian Conference on Computational Geometry, Queen’s University, 2015, pp. 128–135.","ieee":"H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in Proceedings of the 27th Canadian Conference on Computational Geometry, Ontario, Canada, 2015, vol. 2015–August, pp. 128–135.","ama":"Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: Proceedings of the 27th Canadian Conference on Computational Geometry. Vol 2015-August. Queen’s University; 2015:128-135.","apa":"Edelsbrunner, H., Iglesias Ham, M., & Kurlin, V. (2015). Relaxed disk packing. In Proceedings of the 27th Canadian Conference on Computational Geometry (Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.","mla":"Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the 27th Canadian Conference on Computational Geometry, vol. 2015–August, Queen’s University, 2015, pp. 128–35.","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 Proceedings of the 27th Canadian Conference on Computational Geometry, 2015–August:128–35. Queen’s University, 2015."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"_id":"1504","type":"journal_article","status":"public","citation":{"mla":"Bao, Zhigang, et al. “Spectral Statistics of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.” Annals of Statistics, vol. 43, no. 6, Institute of Mathematical Statistics, 2015, pp. 2588–623, doi:10.1214/15-AOS1353.","ieee":"Z. Bao, L. Lin, G. Pan, and W. Zhou, “Spectral statistics of large dimensional spearman s rank correlation matrix and its application,” Annals of Statistics, vol. 43, no. 6. Institute of Mathematical Statistics, pp. 2588–2623, 2015.","short":"Z. Bao, L. Lin, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 2588–2623.","ama":"Bao Z, Lin L, Pan G, Zhou W. Spectral statistics of large dimensional spearman s rank correlation matrix and its application. Annals of Statistics. 2015;43(6):2588-2623. doi:10.1214/15-AOS1353","apa":"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. Institute of Mathematical Statistics. https://doi.org/10.1214/15-AOS1353","chicago":"Bao, Zhigang, Liang Lin, Guangming Pan, and Wang Zhou. “Spectral Statistics of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.” Annals of Statistics. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/15-AOS1353.","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."},"date_updated":"2021-01-12T06:51:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","author":[{"full_name":"Bao, Zhigang","orcid":"0000-0003-3036-1475","last_name":"Bao","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lin, Liang","last_name":"Lin","first_name":"Liang"},{"last_name":"Pan","full_name":"Pan, Guangming","first_name":"Guangming"},{"first_name":"Wang","full_name":"Zhou, Wang","last_name":"Zhou"}],"publist_id":"5674","title":"Spectral statistics of large dimensional spearman s rank correlation matrix and its application","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."}],"oa_version":"Published Version","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1312.5119","open_access":"1"}],"publisher":"Institute of Mathematical Statistics","quality_controlled":"1","intvolume":" 43","month":"12","publication_status":"published","year":"2015","publication":"Annals of Statistics","language":[{"iso":"eng"}],"day":"01","page":"2588 - 2623","date_created":"2018-12-11T11:52:24Z","volume":43,"date_published":"2015-12-01T00:00:00Z","issue":"6","doi":"10.1214/15-AOS1353"},{"publication_status":"published","year":"2015","day":"14","publication":"HSCC: Hybrid Systems - Computation and Control","page":"289 - 290","date_published":"2015-04-14T00:00:00Z","doi":"10.1145/2728606.2728650","date_created":"2018-12-11T11:52:23Z","abstract":[{"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.","lang":"eng"}],"quality_controlled":0,"alternative_title":["18th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2015"],"publisher":"Springer","month":"04","date_updated":"2019-04-26T07:22:03Z","citation":{"chicago":"Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson. Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata. HSCC: Hybrid Systems - Computation and Control. Springer, 2015. https://doi.org/10.1145/2728606.2728650.","ista":"Nguyen L, Schilling C, Bogomolov S, Johnson T. 2015. Poster: HyRG: A random generation tool for affine hybrid automata, Springer,p.","mla":"Nguyen, Luan, et al. “Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata.” HSCC: Hybrid Systems - Computation and Control, Springer, 2015, pp. 289–90, doi:10.1145/2728606.2728650.","ieee":"L. Nguyen, C. Schilling, S. Bogomolov, and T. Johnson, Poster: HyRG: A random generation tool for affine hybrid automata. 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.","apa":"Nguyen, L., Schilling, C., Bogomolov, S., & Johnson, T. (2015). Poster: HyRG: A random generation tool for affine hybrid automata. HSCC: Hybrid Systems - Computation and Control (pp. 289–290). Springer. https://doi.org/10.1145/2728606.2728650","ama":"Nguyen L, Schilling C, Bogomolov S, Johnson T. Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata. Springer; 2015:289-290. doi:10.1145/2728606.2728650"},"extern":1,"publist_id":"5678","author":[{"first_name":"Luan","last_name":"Nguyen","full_name":"Nguyen, Luan V"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0003-3658-1065","full_name":"Christian Schilling","last_name":"Schilling"},{"last_name":"Bogomolov","full_name":"Sergiy Bogomolov","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","first_name":"Sergiy"},{"first_name":"Taylor","full_name":"Johnson, Taylor T","last_name":"Johnson"}],"title":"Poster: HyRG: A random generation tool for affine hybrid automata","_id":"1500","type":"conference_poster","status":"public"},{"date_updated":"2021-01-12T06:51:13Z","citation":{"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.” Ergodic Theory and Dynamical Systems. Cambridge University Press, 2015. https://doi.org/10.1017/etds.2013.103.","ama":"Sadel C. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems. 2015;35(5):1582-1591. doi:10.1017/etds.2013.103","apa":"Sadel, C. (2015). A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems. Cambridge University Press. https://doi.org/10.1017/etds.2013.103","ieee":"C. Sadel, “A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles,” Ergodic Theory and Dynamical Systems, vol. 35, no. 5. Cambridge University Press, pp. 1582–1591, 2015.","short":"C. Sadel, Ergodic Theory and Dynamical Systems 35 (2015) 1582–1591.","mla":"Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional Pseudo-Unitary and Hermitian-Symplectic-Cocycles.” Ergodic Theory and Dynamical Systems, vol. 35, no. 5, Cambridge University Press, 2015, pp. 1582–91, doi:10.1017/etds.2013.103."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","publist_id":"5675","author":[{"first_name":"Christian","id":"4760E9F8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8255-3968","full_name":"Sadel, Christian","last_name":"Sadel"}],"title":"A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles","_id":"1503","type":"journal_article","status":"public","publication_status":"published","year":"2015","language":[{"iso":"eng"}],"publication":"Ergodic Theory and Dynamical Systems","day":"14","page":"1582 - 1591","date_created":"2018-12-11T11:52:24Z","volume":35,"issue":"5","date_published":"2015-03-14T00:00:00Z","doi":"10.1017/etds.2013.103","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"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1307.8414"}],"oa":1,"publisher":"Cambridge University Press","quality_controlled":"1","intvolume":" 35","month":"03"},{"file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5001","checksum":"49eb5021caafaabe5356c65b9c5f8c9c","creator":"system","date_updated":"2020-07-14T12:44:59Z","file_size":623563,"date_created":"2018-12-12T10:13:19Z","file_name":"IST-2016-503-v1+1_32.pdf"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":34,"related_material":{"record":[{"relation":"later_version","id":"1408","status":"public"}]},"ec_funded":1,"oa_version":"Published Version","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 > 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 < 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. "}],"month":"06","intvolume":" 34","scopus_import":1,"alternative_title":["LIPIcs"],"ddc":["510"],"date_updated":"2023-02-21T17:02:57Z","file_date_updated":"2020-07-14T12:44:59Z","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"_id":"1510","status":"public","pubrep_id":"503","type":"conference","conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2015-06-22","end_date":"2015-06-25","location":"Eindhoven, Netherlands"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"11","has_accepted_license":"1","year":"2015","doi":"10.4230/LIPIcs.SOCG.2015.842","date_published":"2015-06-11T00:00:00Z","date_created":"2018-12-11T11:52:26Z","page":"842 - 856","quality_controlled":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Franek, Peter, and Marek Krcál. On Computability and Triviality of Well Groups. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–56, doi:10.4230/LIPIcs.SOCG.2015.842.","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:10.4230/LIPIcs.SOCG.2015.842","apa":"Franek, P., & 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. https://doi.org/10.4230/LIPIcs.SOCG.2015.842","short":"P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–856.","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.","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. https://doi.org/10.4230/LIPIcs.SOCG.2015.842.","ista":"Franek P, Krcál M. 2015. On computability and triviality of well groups. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 842–856."},"title":"On computability and triviality of well groups","publist_id":"5667","author":[{"first_name":"Peter","id":"473294AE-F248-11E8-B48F-1D18A9856A87","last_name":"Franek","full_name":"Franek, Peter"},{"first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","full_name":"Krcál, Marek","last_name":"Krcál"}],"project":[{"name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}]},{"publisher":"Institute of Mathematical Statistics","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1304.5690","open_access":"1"}],"month":"02","intvolume":" 43","abstract":[{"lang":"eng","text":"This paper is aimed at deriving the universality of the largest eigenvalue of a class of high-dimensional real or complex sample covariance matrices of the form W N =Σ 1/2XX∗Σ 1/2 . Here, X = (xij )M,N is an M× N random matrix with independent entries xij , 1 ≤ i M,≤ 1 ≤ j ≤ N such that Exij = 0, E|xij |2 = 1/N . On dimensionality, we assume that M = M(N) and N/M → d ε (0, ∞) as N ∞→. For a class of general deterministic positive-definite M × M matrices Σ , under some additional assumptions on the distribution of xij 's, we show that the limiting behavior of the largest eigenvalue of W N is universal, via pursuing a Green function comparison strategy raised in [Probab. Theory Related Fields 154 (2012) 341-407, Adv. Math. 229 (2012) 1435-1515] by Erd″os, Yau and Yin for Wigner matrices and extended by Pillai and Yin [Ann. Appl. Probab. 24 (2014) 935-1001] to sample covariance matrices in the null case (&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 &Sigma . Applications of these limiting results to statistical signal detection and structure recognition of separable covariance matrices are also discussed."}],"oa_version":"Preprint","acknowledgement":"B.Z. was supported in part by NSFC Grant 11071213, ZJNSF Grant R6090034 and SRFDP Grant 20100101110001. P.G. was supported in part by the Ministry of Education, Singapore, under Grant ARC 14/11. Z.W. was supported in part by the Ministry of Education, Singapore, under Grant ARC 14/11, and by a Grant R-155-000-131-112 at the National University of Singapore\r\n","page":"382 - 421","date_published":"2015-02-01T00:00:00Z","volume":43,"issue":"1","doi":"10.1214/14-AOS1281","date_created":"2018-12-11T11:52:25Z","publication_status":"published","year":"2015","day":"01","language":[{"iso":"eng"}],"publication":"Annals of Statistics","type":"journal_article","status":"public","_id":"1505","publist_id":"5672","author":[{"orcid":"0000-0003-3036-1475","full_name":"Bao, Zhigang","last_name":"Bao","first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pan, Guangming","last_name":"Pan","first_name":"Guangming"},{"first_name":"Wang","last_name":"Zhou","full_name":"Zhou, Wang"}],"department":[{"_id":"LaEr"}],"title":"Universality for the largest eigenvalue of sample covariance matrices with general population","date_updated":"2021-01-12T06:51:14Z","citation":{"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.” Annals of Statistics. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/14-AOS1281.","ama":"Bao Z, Pan G, Zhou W. Universality for the largest eigenvalue of sample covariance matrices with general population. Annals of Statistics. 2015;43(1):382-421. doi:10.1214/14-AOS1281","apa":"Bao, Z., Pan, G., & Zhou, W. (2015). Universality for the largest eigenvalue of sample covariance matrices with general population. Annals of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/14-AOS1281","short":"Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.","ieee":"Z. Bao, G. Pan, and W. Zhou, “Universality for the largest eigenvalue of sample covariance matrices with general population,” Annals of Statistics, vol. 43, no. 1. Institute of Mathematical Statistics, pp. 382–421, 2015.","mla":"Bao, Zhigang, et al. “Universality for the Largest Eigenvalue of Sample Covariance Matrices with General Population.” Annals of Statistics, vol. 43, no. 1, Institute of Mathematical Statistics, 2015, pp. 382–421, doi:10.1214/14-AOS1281."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"citation":{"mla":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” Journal of the European Mathematical Society, vol. 17, no. 8, European Mathematical Society, 2015, pp. 1927–2036, doi:10.4171/JEMS/548.","apa":"Erdös, L., & Yau, H. (2015). Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. European Mathematical Society. https://doi.org/10.4171/JEMS/548","ama":"Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 2015;17(8):1927-2036. doi:10.4171/JEMS/548","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,” Journal of the European Mathematical Society, vol. 17, no. 8. European Mathematical Society, pp. 1927–2036, 2015.","chicago":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” Journal of the European Mathematical Society. European Mathematical Society, 2015. https://doi.org/10.4171/JEMS/548.","ista":"Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 17(8), 1927–2036."},"date_updated":"2021-01-12T06:51:15Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5669","author":[{"orcid":"0000-0001-5366-9603","full_name":"Erdös, László","last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László"},{"first_name":"Horng","last_name":"Yau","full_name":"Yau, Horng"}],"department":[{"_id":"LaEr"}],"title":"Gap universality of generalized Wigner and β ensembles","_id":"1508","type":"journal_article","status":"public","year":"2015","publication_status":"published","language":[{"iso":"eng"}],"publication":"Journal of the European Mathematical Society","day":"01","page":"1927 - 2036","date_created":"2018-12-11T11:52:26Z","date_published":"2015-08-01T00:00:00Z","issue":"8","volume":17,"doi":"10.4171/JEMS/548","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"}],"oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1211.3786"}],"publisher":"European Mathematical Society","scopus_import":1,"quality_controlled":"1","intvolume":" 17","month":"08"},{"department":[{"_id":"LaEr"}],"title":"The logarithmic law of random determinant","publist_id":"5671","author":[{"first_name":"Zhigang","id":"442E6A6C-F248-11E8-B48F-1D18A9856A87","full_name":"Bao, Zhigang","orcid":"0000-0003-3036-1475","last_name":"Bao"},{"last_name":"Pan","full_name":"Pan, Guangming","first_name":"Guangming"},{"last_name":"Zhou","full_name":"Zhou, Wang","first_name":"Wang"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:51:14Z","citation":{"ieee":"Z. Bao, G. Pan, and W. Zhou, “The logarithmic law of random determinant,” Bernoulli, vol. 21, no. 3. Bernoulli Society for Mathematical Statistics and Probability, pp. 1600–1628, 2015.","short":"Z. Bao, G. Pan, W. Zhou, Bernoulli 21 (2015) 1600–1628.","ama":"Bao Z, Pan G, Zhou W. The logarithmic law of random determinant. Bernoulli. 2015;21(3):1600-1628. doi:10.3150/14-BEJ615","apa":"Bao, Z., Pan, G., & Zhou, W. (2015). The logarithmic law of random determinant. Bernoulli. Bernoulli Society for Mathematical Statistics and Probability. https://doi.org/10.3150/14-BEJ615","mla":"Bao, Zhigang, et al. “The Logarithmic Law of Random Determinant.” Bernoulli, vol. 21, no. 3, Bernoulli Society for Mathematical Statistics and Probability, 2015, pp. 1600–28, doi:10.3150/14-BEJ615.","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.” Bernoulli. Bernoulli Society for Mathematical Statistics and Probability, 2015. https://doi.org/10.3150/14-BEJ615."},"status":"public","type":"journal_article","_id":"1506","doi":"10.3150/14-BEJ615","issue":"3","volume":21,"date_published":"2015-08-01T00:00:00Z","date_created":"2018-12-11T11:52:25Z","page":"1600 - 1628","day":"01","publication":"Bernoulli","language":[{"iso":"eng"}],"publication_status":"published","year":"2015","month":"08","intvolume":" 21","publisher":"Bernoulli Society for Mathematical Statistics and Probability","quality_controlled":"1","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1208.5823","open_access":"1"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Consider the square random matrix An = (aij)n,n, where {aij:= a(n)ij , i, j = 1, . . . , n} is a collection of independent real random variables with means zero and variances one. Under the additional moment condition supn max1≤i,j ≤n Ea4ij <∞, 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)."}]},{"oa_version":"Published Version","abstract":[{"text":"Insects of the order Hemiptera (true bugs) use a wide range of mechanisms of sex determination, including genetic sex determination, paternal genome elimination, and haplodiploidy. Genetic sex determination, the prevalent mode, is generally controlled by a pair of XY sex chromosomes or by an XX/X0 system, but different configurations that include additional sex chromosomes are also present. Although this diversity of sex determining systems has been extensively studied at the cytogenetic level, only the X chromosome of the model pea aphid Acyrthosiphon pisum has been analyzed at the genomic level, and little is known about X chromosome biology in the rest of the order.\r\n\r\nIn this study, we take advantage of published DNA- and RNA-seq data from three additional Hemiptera species to perform a comparative analysis of the gene content and expression of the X chromosome throughout this clade. We find that, despite showing evidence of dosage compensation, the X chromosomes of these species show female-biased expression, and a deficit of male-biased genes, in direct contrast to the pea aphid X. We further detect an excess of shared gene content between these very distant species, suggesting that despite the diversity of sex determining systems, the same chromosomal element is used as the X throughout a large portion of the order. ","lang":"eng"}],"month":"12","intvolume":" 7","scopus_import":1,"file":[{"file_id":"5284","checksum":"2b56b8c2e2a1d4cc3c9cb8daba26dd9b","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-496-v1+1_Genome_Biol_Evol-2015-Pal-3259-68.pdf","date_created":"2018-12-12T10:17:29Z","creator":"system","file_size":858027,"date_updated":"2020-07-14T12:45:00Z"}],"language":[{"iso":"eng"}],"publication_status":"published","issue":"12","volume":7,"ec_funded":1,"_id":"1513","status":"public","pubrep_id":"496","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ddc":["570"],"date_updated":"2021-01-12T06:51:18Z","file_date_updated":"2020-07-14T12:45:00Z","department":[{"_id":"BeVi"}],"quality_controlled":"1","publisher":"Oxford University Press","oa":1,"day":"01","publication":"Genome Biology and Evolution","has_accepted_license":"1","year":"2015","date_published":"2015-12-01T00:00:00Z","doi":"10.1093/gbe/evv215","date_created":"2018-12-11T11:52:27Z","page":"3259 - 3268","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Pal A, Vicoso B. 2015. The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression. Genome Biology and Evolution. 7(12), 3259–3268.","chicago":"Pal, Arka, and Beatriz Vicoso. “The X Chromosome of Hemipteran Insects: Conservation, Dosage Compensation and Sex-Biased Expression.” Genome Biology and Evolution. Oxford University Press, 2015. https://doi.org/10.1093/gbe/evv215.","apa":"Pal, A., & Vicoso, B. (2015). The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression. Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evv215","ama":"Pal A, Vicoso B. The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression. Genome Biology and Evolution. 2015;7(12):3259-3268. doi:10.1093/gbe/evv215","short":"A. Pal, B. Vicoso, Genome Biology and Evolution 7 (2015) 3259–3268.","ieee":"A. Pal and B. Vicoso, “The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression,” Genome Biology and Evolution, vol. 7, no. 12. Oxford University Press, pp. 3259–3268, 2015.","mla":"Pal, Arka, and Beatriz Vicoso. “The X Chromosome of Hemipteran Insects: Conservation, Dosage Compensation and Sex-Biased Expression.” Genome Biology and Evolution, vol. 7, no. 12, Oxford University Press, 2015, pp. 3259–68, doi:10.1093/gbe/evv215."},"title":"The X chromosome of hemipteran insects: Conservation, dosage compensation and sex-biased expression","author":[{"first_name":"Arka","id":"6AAB2240-CA9A-11E9-9C1A-D9D1E5697425","full_name":"Pal, Arka","last_name":"Pal"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz"}],"publist_id":"5664","article_processing_charge":"No"},{"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","pubrep_id":"494","_id":"1517","department":[{"_id":"JaMa"}],"file_date_updated":"2020-07-14T12:45:00Z","date_updated":"2021-01-12T06:51:19Z","ddc":["519"],"scopus_import":1,"month":"11","intvolume":" 20","abstract":[{"text":"We study the large deviation rate functional for the empirical distribution of independent Brownian particles with drift. In one dimension, it has been shown by Adams, Dirr, Peletier and Zimmer that this functional is asymptotically equivalent (in the sense of Γ-convergence) to the Jordan-Kinderlehrer-Otto functional arising in the Wasserstein gradient flow structure of the Fokker-Planck equation. In higher dimensions, part of this statement (the lower bound) has been recently proved by Duong, Laschos and Renger, but the upper bound remained open, since the proof of Duong et al relies on regularity properties of optimal transport maps that are restricted to one dimension. In this note we present a new proof of the upper bound, thereby generalising the result of Adams et al to arbitrary dimensions.\r\n","lang":"eng"}],"oa_version":"Published Version","volume":20,"publication_status":"published","file":[{"checksum":"135741c17d3e1547ca696b6fbdcd559c","file_id":"4828","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2016-494-v1+1_4315-23820-1-PB.pdf","date_created":"2018-12-12T10:10:39Z","creator":"system","file_size":230525,"date_updated":"2020-07-14T12:45:00Z"}],"language":[{"iso":"eng"}],"article_number":"89","publist_id":"5660","author":[{"last_name":"Erbar","full_name":"Erbar, Matthias","first_name":"Matthias"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","full_name":"Maas, Jan"},{"first_name":"Michiel","last_name":"Renger","full_name":"Renger, Michiel"}],"title":"From large deviations to Wasserstein gradient flows in multiple dimensions","citation":{"ama":"Erbar M, Maas J, Renger M. From large deviations to Wasserstein gradient flows in multiple dimensions. Electronic Communications in Probability. 2015;20. doi:10.1214/ECP.v20-4315","apa":"Erbar, M., Maas, J., & Renger, M. (2015). From large deviations to Wasserstein gradient flows in multiple dimensions. Electronic Communications in Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/ECP.v20-4315","ieee":"M. Erbar, J. Maas, and M. Renger, “From large deviations to Wasserstein gradient flows in multiple dimensions,” Electronic Communications in Probability, vol. 20. Institute of Mathematical Statistics, 2015.","short":"M. Erbar, J. Maas, M. Renger, Electronic Communications in Probability 20 (2015).","mla":"Erbar, Matthias, et al. “From Large Deviations to Wasserstein Gradient Flows in Multiple Dimensions.” Electronic Communications in Probability, vol. 20, 89, Institute of Mathematical Statistics, 2015, doi:10.1214/ECP.v20-4315.","ista":"Erbar M, Maas J, Renger M. 2015. From large deviations to Wasserstein gradient flows in multiple dimensions. Electronic Communications in Probability. 20, 89.","chicago":"Erbar, Matthias, Jan Maas, and Michiel Renger. “From Large Deviations to Wasserstein Gradient Flows in Multiple Dimensions.” Electronic Communications in Probability. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/ECP.v20-4315."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Institute of Mathematical Statistics","oa":1,"doi":"10.1214/ECP.v20-4315","date_published":"2015-11-29T00:00:00Z","date_created":"2018-12-11T11:52:29Z","has_accepted_license":"1","year":"2015","day":"29","publication":"Electronic Communications in Probability"},{"page":"157 - 167","date_created":"2018-12-11T11:52:28Z","doi":"10.1111/ejn.12779","volume":41,"issue":"2","date_published":"2015-01-01T00:00:00Z","publication_status":"published","year":"2015","publication":"European Journal of Neuroscience","day":"01","publisher":"Wiley-Blackwell","quality_controlled":0,"intvolume":" 41","month":"01","abstract":[{"lang":"eng","text":"Type 1 metabotropic glutamate (mGlu1) receptors play a pivotal role in different forms of synaptic plasticity in the cerebellar cortex, e.g. long-term depression at glutamatergic synapses and rebound potentiation at GABAergic synapses. These various forms of plasticity might depend on the subsynaptic arrangement of the receptor in Purkinje cells that can be regulated by protein-protein interactions. This study investigated, by means of the freeze-fracture replica immunogold labelling method, the subcellular localization of mGlu1 receptors in the rodent cerebellum and whether Homer proteins regulate their subsynaptic distribution. We observed a widespread extrasynaptic localization of mGlu1 receptors and confirmed their peri-synaptic enrichment at glutamatergic synapses. Conversely, we detected mGlu1 receptors within the main body of GABAergic synapses onto Purkinje cell dendrites. Although Homer proteins are known to interact with the mGlu1 receptor C-terminus, we could not detect Homer3, the most abundant Homer protein in the cerebellar cortex, at GABAergic synapses by pre-embedding and post-embedding immunoelectron microscopy. We then hypothesized a critical role for Homer proteins in the peri-junctional localization of mGlu1 receptors at glutamatergic synapses. To disrupt Homer-associated protein complexes, mice were tail-vein injected with the membrane-permeable dominant-negative TAT-Homer1a. Freeze-fracture replica immunogold labelling analysis showed no significant alteration in the mGlu1 receptor distribution pattern at parallel fibre-Purkinje cell synapses, suggesting that other scaffolding proteins are involved in the peri-synaptic confinement. The identification of interactors that regulate the subsynaptic localization of the mGlu1 receptor at neurochemically distinct synapses may offer new insight into its trafficking and intracellular signalling."}],"acknowledgement":"This work was supported by the Austrian Science Fund (FWF) (project W012060-10 to F.F.), The Japan Society for the Promotion of Science (JSPS) (to R.S.) and Agence Nationale de la Recherche (ANR-11-BSV4-018-03, DELTAPLAN), Région Languedoc-Roussillon (Chercheur d’Avenir) (to J.P.). The authors thank S. Schönherr for excellent technical support and Dr Furuichi for kindly providing anti-Homer3 antibodies.","publist_id":"5662","author":[{"first_name":"Mahnaz","full_name":"Mansouri, Mahnaz","last_name":"Mansouri"},{"last_name":"Kasugai","full_name":"Kasugai, Yu","first_name":"Yu"},{"first_name":"Yugo","full_name":"Fukazawa, Yugo","last_name":"Fukazawa"},{"last_name":"Bertaso","full_name":"Bertaso, Federica","first_name":"Federica"},{"full_name":"Raynaud, Fabrice","last_name":"Raynaud","first_name":"Fabrice"},{"first_name":"Julie","full_name":"Perroy, Julie","last_name":"Perroy"},{"first_name":"Laurent","full_name":"Fagni, Laurent","last_name":"Fagni"},{"last_name":"Kaufmann","orcid":"0000-0001-9735-5315","full_name":"Walter Kaufmann","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","first_name":"Walter"},{"full_name":"Watanabe, Masahiko","last_name":"Watanabe","first_name":"Masahiko"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Francesco","full_name":"Ferraguti, Francesco","last_name":"Ferraguti"}],"title":"Distinct subsynaptic localization of type 1 metabotropic glutamate receptors at glutamatergic and GABAergic synapses in the rodent cerebellar cortex","date_updated":"2023-02-23T10:02:24Z","citation":{"mla":"Mansouri, Mahnaz, et al. “Distinct Subsynaptic Localization of Type 1 Metabotropic Glutamate Receptors at Glutamatergic and GABAergic Synapses in the Rodent Cerebellar Cortex.” European Journal of Neuroscience, vol. 41, no. 2, Wiley-Blackwell, 2015, pp. 157–67, doi:10.1111/ejn.12779.","ama":"Mansouri M, Kasugai Y, Fukazawa Y, et al. Distinct subsynaptic localization of type 1 metabotropic glutamate receptors at glutamatergic and GABAergic synapses in the rodent cerebellar cortex. European Journal of Neuroscience. 2015;41(2):157-167. doi:10.1111/ejn.12779","apa":"Mansouri, M., Kasugai, Y., Fukazawa, Y., Bertaso, F., Raynaud, F., Perroy, J., … Ferraguti, F. (2015). Distinct subsynaptic localization of type 1 metabotropic glutamate receptors at glutamatergic and GABAergic synapses in the rodent cerebellar cortex. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1111/ejn.12779","ieee":"M. Mansouri et al., “Distinct subsynaptic localization of type 1 metabotropic glutamate receptors at glutamatergic and GABAergic synapses in the rodent cerebellar cortex,” European Journal of Neuroscience, vol. 41, no. 2. Wiley-Blackwell, pp. 157–167, 2015.","short":"M. Mansouri, Y. Kasugai, Y. Fukazawa, F. Bertaso, F. Raynaud, J. Perroy, L. Fagni, W. Kaufmann, M. Watanabe, R. Shigemoto, F. Ferraguti, European Journal of Neuroscience 41 (2015) 157–167.","chicago":"Mansouri, Mahnaz, Yu Kasugai, Yugo Fukazawa, Federica Bertaso, Fabrice Raynaud, Julie Perroy, Laurent Fagni, et al. “Distinct Subsynaptic Localization of Type 1 Metabotropic Glutamate Receptors at Glutamatergic and GABAergic Synapses in the Rodent Cerebellar Cortex.” European Journal of Neuroscience. Wiley-Blackwell, 2015. https://doi.org/10.1111/ejn.12779.","ista":"Mansouri M, Kasugai Y, Fukazawa Y, Bertaso F, Raynaud F, Perroy J, Fagni L, Kaufmann W, Watanabe M, Shigemoto R, Ferraguti F. 2015. Distinct subsynaptic localization of type 1 metabotropic glutamate receptors at glutamatergic and GABAergic synapses in the rodent cerebellar cortex. European Journal of Neuroscience. 41(2), 157–167."},"extern":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","status":"public","_id":"1515"},{"_id":"1514","type":"journal_article","status":"public","citation":{"apa":"Gómez Gonzalo, M., Navarrete, M., Perea, G., Covelo, A., Martín Fernández, M., Shigemoto, R., … Araque, A. (2015). Endocannabinoids induce lateral long term potentiation of transmitter release by stimulation of gliotransmission. Cerebral Cortex. Oxford University Press. https://doi.org/10.1093/cercor/bhu231","ama":"Gómez Gonzalo M, Navarrete M, Perea G, et al. Endocannabinoids induce lateral long term potentiation of transmitter release by stimulation of gliotransmission. Cerebral Cortex. 2015;25(10):3699-3712. doi:10.1093/cercor/bhu231","short":"M. Gómez Gonzalo, M. Navarrete, G. Perea, A. Covelo, M. Martín Fernández, R. Shigemoto, R. Luján, A. Araque, Cerebral Cortex 25 (2015) 3699–3712.","ieee":"M. Gómez Gonzalo et al., “Endocannabinoids induce lateral long term potentiation of transmitter release by stimulation of gliotransmission,” Cerebral Cortex, vol. 25, no. 10. Oxford University Press, pp. 3699–3712, 2015.","mla":"Gómez Gonzalo, Marta, et al. “Endocannabinoids Induce Lateral Long Term Potentiation of Transmitter Release by Stimulation of Gliotransmission.” Cerebral Cortex, vol. 25, no. 10, Oxford University Press, 2015, pp. 3699–712, doi:10.1093/cercor/bhu231.","ista":"Gómez Gonzalo M, Navarrete M, Perea G, Covelo A, Martín Fernández M, Shigemoto R, Luján R, Araque A. 2015. Endocannabinoids induce lateral long term potentiation of transmitter release by stimulation of gliotransmission. Cerebral Cortex. 25(10), 3699–3712.","chicago":"Gómez Gonzalo, Marta, Marta Navarrete, Gertrudis Perea, Ana Covelo, Mario Martín Fernández, Ryuichi Shigemoto, Rafael Luján, and Alfonso Araque. “Endocannabinoids Induce Lateral Long Term Potentiation of Transmitter Release by Stimulation of Gliotransmission.” Cerebral Cortex. Oxford University Press, 2015. https://doi.org/10.1093/cercor/bhu231."},"date_updated":"2021-01-12T06:51:18Z","extern":1,"author":[{"first_name":"Marta","full_name":"Gómez-Gonzalo, Marta","last_name":"Gómez Gonzalo"},{"first_name":"Marta","last_name":"Navarrete","full_name":"Navarrete, Marta"},{"first_name":"Gertrudis","last_name":"Perea","full_name":"Perea, Gertrudis"},{"first_name":"Ana","full_name":"Covelo, Ana","last_name":"Covelo"},{"first_name":"Mario","last_name":"Martín Fernández","full_name":"Martín-Fernández, Mario"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"last_name":"Luján","full_name":"Luján, Rafael","first_name":"Rafael"},{"full_name":"Araque, Alfonso","last_name":"Araque","first_name":"Alfonso"}],"publist_id":"5663","title":"Endocannabinoids induce lateral long term potentiation of transmitter release by stimulation of gliotransmission","abstract":[{"lang":"eng","text":"Endocannabinoids (eCBs) play key roles in brain function, acting as modulatory signals in synaptic transmission and plasticity. They are recognized as retrograde messengers that mediate long-term synaptic depression (LTD), but their ability to induce long-term potentiation (LTP) is poorly known. We show that eCBs induce the long-term enhancement of transmitter release at single hippocampal synapses through stimulation of astrocytes when coincident with postsynaptic activity. This LTP requires the coordinated activity of the 3 elements of the tripartite synapse: 1) eCB-evoked astrocyte calcium signal that stimulates glutamate release; 2) postsynaptic nitric oxide production; and 3) activation of protein kinase C and presynaptic group I metabotropic glutamate receptors, whose location at presynaptic sites was confirmed by immunoelectron microscopy. Hence, while eCBs act as retrograde signals to depress homoneuronal synapses, they serve as lateral messengers to induce LTP in distant heteroneuronal synapses through stimulation of astrocytes. Therefore, eCBs can trigger LTP through stimulation of astrocyte-neuron signaling, revealing novel cellular mechanisms of eCB effects on synaptic plasticity."}],"acknowledgement":"This work was supported by grants from Ministerio de Economia y Competitividad, Spain (MINECO; BFU2010-15832), European Union (HEALTH-F2-2007-202167), and Cajal Blue Brain to A.A. Grants from Spain (MINECO; BFU-2009-08404 and\nCSD2008-00005) to R.L. Grants from Spain (MINECO; Consolider, CSD2010-00045; Ramón y Cajal Program, RYC-2012-12014; and BFU2013-47265) to G.P. We thank Dr Atsu Aiba (Animal Resources, Center for Disease Biology and Integrative Medicine, Faculty of Medicine, University of Tokyo) for the donation of the mGluR1b rescue mice.","quality_controlled":0,"publisher":"Oxford University Press","month":"10","intvolume":" 25","publication_status":"published","year":"2015","day":"10","publication":"Cerebral Cortex","page":"3699 - 3712","volume":25,"issue":"10","date_published":"2015-10-10T00:00:00Z","doi":"10.1093/cercor/bhu231","date_created":"2018-12-11T11:52:27Z"}]