--- _id: '1498' 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. alternative_title: - LIPIcs author: - first_name: Cezara full_name: Dragoi, Cezara id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87 last_name: Dragoi - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Damien full_name: Zufferey, Damien id: 4397AC76-F248-11E8-B48F-1D18A9856A87 last_name: Zufferey orcid: 0000-0002-3197-8736 citation: 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' 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. 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. 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. conference: end_date: 2015-05-06 location: Asilomar, CA, United States name: 'SNAPL: Summit oN Advances in Programming Languages' start_date: 2015-05-03 date_created: 2018-12-11T11:52:22Z date_published: 2015-01-01T00:00:00Z date_updated: 2020-08-11T10:09:14Z day: '01' ddc: - '005' department: - _id: ToHe doi: 10.4230/LIPIcs.SNAPL.2015.90 ec_funded: 1 file: - access_level: open_access checksum: cf5e94baa89a2dc4c5de01abc676eda8 content_type: application/pdf creator: system date_created: 2018-12-12T10:14:02Z date_updated: 2020-07-14T12:44:58Z file_id: '5050' file_name: IST-2016-499-v1+1_9.pdf file_size: 489362 relation: main_file file_date_updated: 2020-07-14T12:44:58Z has_accepted_license: '1' intvolume: ' 32' language: - iso: eng license: https://creativecommons.org/licenses/by/4.0/ month: '01' oa: 1 oa_version: Published Version page: 90 - 102 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25F5A88A-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S11402-N23 name: Moderne Concurrency Paradigms - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize publication_identifier: isbn: - '978-3-939897-80-4 ' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '5681' pubrep_id: '499' quality_controlled: '1' scopus_import: 1 series_title: Leibniz International Proceedings in Informatics status: public title: The need for language support for fault-tolerant distributed systems tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 32 year: '2015' ... --- _id: '1497' 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. 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." article_number: e146 author: - first_name: Daniel full_name: Andergassen, Daniel last_name: Andergassen - first_name: Christoph full_name: Dotter, Christoph id: 4C66542E-F248-11E8-B48F-1D18A9856A87 last_name: Dotter - first_name: Tomasz full_name: Kulinski, Tomasz last_name: Kulinski - first_name: Philipp full_name: Guenzl, Philipp last_name: Guenzl - first_name: Philipp full_name: Bammer, Philipp last_name: Bammer - first_name: Denise full_name: Barlow, Denise last_name: Barlow - first_name: Florian full_name: Pauler, Florian last_name: Pauler - first_name: Quanah full_name: Hudson, Quanah last_name: Hudson citation: ama: Andergassen D, Dotter C, Kulinski T, et al. Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. Nucleic Acids Research. 2015;43(21). doi: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 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. 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. ista: Andergassen D, Dotter C, Kulinski T, Guenzl P, Bammer P, Barlow D, Pauler F, Hudson Q. 2015. Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data. Nucleic Acids Research. 43(21), e146. mla: Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing Data.” Nucleic Acids Research, vol. 43, no. 21, e146, Oxford University Press, 2015, 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). date_created: 2018-12-11T11:52:22Z date_published: 2015-07-21T00:00:00Z date_updated: 2021-01-12T06:51:09Z day: '21' ddc: - '570' department: - _id: GaNo doi: 10.1093/nar/gkv727 file: - access_level: open_access checksum: 385b83854fd0eb2e4f386867da2823e2 content_type: application/pdf creator: dernst date_created: 2018-12-20T14:18:57Z date_updated: 2020-07-14T12:44:58Z file_id: '5768' file_name: 2015_NucleicAcidsRes_Andergassen.pdf file_size: 6863297 relation: main_file file_date_updated: 2020-07-14T12:44:58Z has_accepted_license: '1' intvolume: ' 43' issue: '21' language: - iso: eng month: '07' oa: 1 oa_version: Published Version publication: Nucleic Acids Research publication_status: published publisher: Oxford University Press publist_id: '5682' quality_controlled: '1' scopus_import: 1 status: public title: Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput sequencing data tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 43 year: '2015' ... --- _id: '1499' 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." 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." alternative_title: - LIPIcs author: - first_name: Jan full_name: Kretinsky, Jan id: 44CEF464-F248-11E8-B48F-1D18A9856A87 last_name: Kretinsky orcid: 0000-0002-8122-2881 - first_name: Kim full_name: Larsen, Kim last_name: Larsen - first_name: Simon full_name: Laursen, Simon last_name: Laursen - first_name: Jiří full_name: Srba, Jiří last_name: Srba citation: ama: 'Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:142-154. doi: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. ieee: 'J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability of weighted synchronization under partial observability,” presented at the CONCUR: Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.' ista: 'Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability of weighted synchronization under partial observability. CONCUR: Concurrency Theory, LIPIcs, vol. 42, 142–154.' mla: Kretinsky, Jan, et al. 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. conference: end_date: 2015-09-04 location: Madrid, Spain name: 'CONCUR: Concurrency Theory' start_date: 2015-09-01 date_created: 2018-12-11T11:52:22Z date_published: 2015-01-01T00:00:00Z date_updated: 2021-01-12T06:51:10Z day: '01' ddc: - '000' - '003' department: - _id: ToHe - _id: KrCh doi: 10.4230/LIPIcs.CONCUR.2015.142 ec_funded: 1 file: - access_level: open_access checksum: 49eb5021caafaabe5356c65b9c5f8c9c content_type: application/pdf creator: system date_created: 2018-12-12T10:08:12Z date_updated: 2020-07-14T12:44:58Z file_id: '4672' file_name: IST-2016-498-v1+1_32.pdf file_size: 623563 relation: main_file file_date_updated: 2020-07-14T12:44:58Z has_accepted_license: '1' intvolume: ' 42' language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 142 - 154 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling - _id: 25832EC2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: S 11407_N23 name: Rigorous Systems Engineering - _id: 25F42A32-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z211 name: The Wittgenstein Prize - _id: 25681D80-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '291734' name: International IST Postdoc Fellowship Programme publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik publist_id: '5680' pubrep_id: '498' quality_controlled: '1' scopus_import: 1 status: public title: Polynomial time decidability of weighted synchronization under partial observability tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 42 year: '2015' ... --- _id: '1495' 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. ' author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Mabel full_name: Iglesias Ham, Mabel id: 41B58C0C-F248-11E8-B48F-1D18A9856A87 last_name: Iglesias Ham - first_name: Vitaliy full_name: Kurlin, Vitaliy last_name: Kurlin citation: 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.' 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. 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. ista: 'Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry vol. 2015–August, 128–135.' mla: Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the 27th Canadian Conference on Computational Geometry, vol. 2015–August, Queen’s University, 2015, pp. 128–35. 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. conference: end_date: 2015-08-12 location: Ontario, Canada name: 'CCCG: Canadian Conference on Computational Geometry' start_date: 2015-08-10 date_created: 2018-12-11T11:52:21Z date_published: 2015-08-01T00:00:00Z date_updated: 2021-01-12T06:51:09Z day: '01' department: - _id: HeEd ec_funded: 1 language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1505.03402 month: '08' oa: 1 oa_version: Submitted Version page: 128-135 project: - _id: 255D761E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '318493' name: Topological Complex Systems publication: Proceedings of the 27th Canadian Conference on Computational Geometry publication_status: published publisher: Queen's University publist_id: '5684' quality_controlled: '1' scopus_import: 1 status: public title: Relaxed disk packing type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 2015-August year: '2015' ... --- _id: '1504' 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. author: - first_name: Zhigang full_name: Bao, Zhigang id: 442E6A6C-F248-11E8-B48F-1D18A9856A87 last_name: Bao orcid: 0000-0003-3036-1475 - first_name: Liang full_name: Lin, Liang last_name: Lin - first_name: Guangming full_name: Pan, Guangming last_name: Pan - first_name: Wang full_name: Zhou, Wang last_name: Zhou citation: 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. 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. 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. 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. short: Z. Bao, L. Lin, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 2588–2623. date_created: 2018-12-11T11:52:24Z date_published: 2015-12-01T00:00:00Z date_updated: 2021-01-12T06:51:14Z day: '01' doi: 10.1214/15-AOS1353 extern: '1' intvolume: ' 43' issue: '6' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1312.5119 month: '12' oa: 1 oa_version: Published Version page: 2588 - 2623 publication: Annals of Statistics publication_status: published publisher: Institute of Mathematical Statistics publist_id: '5674' quality_controlled: '1' status: public title: Spectral statistics of large dimensional spearman s rank correlation matrix and its application type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 43 year: '2015' ...