---
_id: '1481'
abstract:
- lang: eng
text: 'Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role
not only in the development of mathematical and logical skills, but also in the
emotional and social development. In this paper, we address the problem of generating
targeted starting positions for such games. This can facilitate new approaches
for bringing novice players to mastery, and also leads to discovery of interesting
game variants. We present an approach that generates starting states of varying
hardness levels for player 1 in a two-player board game, given rules of the board
game, the desired number of steps required for player 1 to win, and the expertise
levels of the two players. Our approach leverages symbolic methods and iterative
simulation to efficiently search the extremely large state space. We present experimental
results that include discovery of states of varying hardness levels for several
simple grid-based board games. The presence of such states for standard game variants
like 4×4 Tic-Tac-Toe opens up new games to be played that have never been played
as the default start state is heavily biased. '
acknowledgement: "A Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/146.\r\n"
article_processing_charge: No
author:
- first_name: Umair
full_name: Ahmed, Umair
last_name: Ahmed
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Sumit
full_name: Gulwani, Sumit
last_name: Gulwani
citation:
ama: 'Ahmed U, Chatterjee K, Gulwani S. Automatic generation of alternative starting
positions for simple traditional board games. In: Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. Vol 2. AAAI Press; 2015:745-752.'
apa: 'Ahmed, U., Chatterjee, K., & Gulwani, S. (2015). Automatic generation
of alternative starting positions for simple traditional board games. In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp.
745–752). Austin, TX, USA: AAAI Press.'
chicago: Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation
of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings
of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52.
AAAI Press, 2015.
ieee: U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative
starting positions for simple traditional board games,” in Proceedings of the
Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA,
2015, vol. 2, pp. 745–752.
ista: 'Ahmed U, Chatterjee K, Gulwani S. 2015. Automatic generation of alternative
starting positions for simple traditional board games. Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence
vol. 2, 745–752.'
mla: Ahmed, Umair, et al. “Automatic Generation of Alternative Starting Positions
for Simple Traditional Board Games.” Proceedings of the Twenty-Ninth AAAI Conference
on Artificial Intelligence, vol. 2, AAAI Press, 2015, pp. 745–52.
short: U. Ahmed, K. Chatterjee, S. Gulwani, in:, Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence, AAAI Press, 2015, pp. 745–752.
conference:
end_date: 2015-01-30
location: Austin, TX, USA
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2015-01-25
date_created: 2018-12-11T11:52:16Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:07Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
intvolume: ' 2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/download/9523/9300
month: '01'
oa: 1
oa_version: None
page: 745 - 752
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '5713'
quality_controlled: '1'
related_material:
record:
- id: '5410'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Automatic generation of alternative starting positions for simple traditional
board games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2015'
...
---
_id: '1483'
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.
author:
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Roland
full_name: Kwitt, Roland
last_name: Kwitt
citation:
ama: 'Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for
topological machine learning. In: IEEE; 2015:4741-4748. doi: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'
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.
ieee: 'J. Reininghaus, S. Huber, U. Bauer, and R. Kwitt, “A stable multi-scale kernel
for topological machine learning,” presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, USA, 2015, pp. 4741–4748.'
ista: 'Reininghaus J, Huber S, Bauer U, Kwitt R. 2015. A stable multi-scale kernel
for topological machine learning. CVPR: Computer Vision and Pattern Recognition,
4741–4748.'
mla: Reininghaus, Jan, et al. A Stable Multi-Scale Kernel for Topological Machine
Learning. IEEE, 2015, pp. 4741–48, doi:10.1109/CVPR.2015.7299106.
short: J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 4741–4748.
conference:
end_date: 2015-06-12
location: Boston, MA, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:52:17Z
date_published: 2015-10-14T00:00:00Z
date_updated: 2021-01-12T06:51:03Z
day: '14'
department:
- _id: HeEd
doi: 10.1109/CVPR.2015.7299106
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.6821
month: '10'
oa: 1
oa_version: Preprint
page: 4741 - 4748
publication_identifier:
eisbn:
- '978-1-4673-6964-0 '
publication_status: published
publisher: IEEE
publist_id: '5709'
scopus_import: 1
status: public
title: A stable multi-scale kernel for topological machine learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
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: '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: '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
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: '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: '1501'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express
that desired behaviors of the system arise almost-surely (with probability 1)
or with positive probability. We introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph algorithms with quadratic complexity to compute the simulation
relation. We present an automated technique for assume-guarantee style reasoning
for compositional analysis of two-player games by giving a counterexample guided
abstraction-refinement approach to compute our new simulation relation. We show
a tight link between two-player games and MDPs, and as a consequence the results
for games are lifted to MDPs with qualitative properties. We have implemented
our algorithms and show that the compositional analysis leads to significant improvements. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No. P23499- N23, FWF NFN Grant No. S11407-N23, FWF Grant S11403-N23 (RiSE),
and FWF Grant Z211-N23 (Wittgenstein Award), ERC Start Grant (279307: Graph Games),
Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (Quantitative Reactive
Modeling).'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
citation:
ama: Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative
properties in Markov decision processes. Formal Methods in System Design.
2015;47(2):230-264. doi:10.1007/s10703-015-0235-2
apa: Chatterjee, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional
analysis of qualitative properties in Markov decision processes. Formal Methods
in System Design. Springer. https://doi.org/10.1007/s10703-015-0235-2
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for
Compositional Analysis of Qualitative Properties in Markov Decision Processes.”
Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
ieee: K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis
of qualitative properties in Markov decision processes,” Formal Methods in
System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.
ista: Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of
qualitative properties in Markov decision processes. Formal Methods in System
Design. 47(2), 230–264.
mla: Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative
Properties in Markov Decision Processes.” Formal Methods in System Design,
vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.
short: K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015)
230–264.
date_created: 2018-12-11T11:52:23Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-015-0235-2
ec_funded: 1
intvolume: ' 47'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.0835
month: '10'
oa: 1
oa_version: Preprint
page: 230 - 264
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '5677'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: CEGAR for compositional analysis of qualitative properties in Markov decision
processes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2015'
...
---
_id: '1502'
abstract:
- lang: eng
text: We extend the theory of input-output conformance with operators for merge
and quotient. The former is useful when testing against multiple requirements
or views. The latter can be used to generate tests for patches of an already tested
system. Both operators can combine systems with different action alphabets, which
is usually the case when constructing complex systems and specifications from
parts, for instance different views as well as newly defined functionality of
a~previous version of the system.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
projects S11402-N23(RiSE) and Z211-N23 (Wittgestein Award), by People Programme
(Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013)
under REA grant agreement 291734, and by the ARTEMIS JU under grant agreement 295373
(nSafeCer). Jan Křetínský has been partially supported by the Czech Science Foundation,
grant No. P202/12/G061. Nikola Beneš has been supported by the\r\nMEYS project
No. CZ.1.07/2.3.00/30.0009 Employment of Newly Graduated Doctors of Science for
Scientific Excellence."
alternative_title:
- 'Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering '
author:
- first_name: Nikola
full_name: Beneš, Nikola
last_name: Beneš
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- 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: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Dejan
full_name: Nickovic, Dejan
last_name: Nickovic
citation:
ama: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. Complete composition
operators for IOCO-testing theory. In: ACM; 2015:101-110. doi:10.1145/2737166.2737175'
apa: 'Beneš, N., Daca, P., Henzinger, T. A., Kretinsky, J., & Nickovic, D. (2015).
Complete composition operators for IOCO-testing theory (pp. 101–110). Presented
at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.
https://doi.org/10.1145/2737166.2737175'
chicago: Beneš, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and
Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,” 101–10.
ACM, 2015. https://doi.org/10.1145/2737166.2737175.
ieee: 'N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete
composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based
Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.'
ista: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition
operators for IOCO-testing theory. CBSE: Component-Based Software Engineering
, Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering , , 101–110.'
mla: Beneš, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory.
ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.
short: N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015,
pp. 101–110.
conference:
end_date: 2015-05-08
location: Montreal, QC, Canada
name: 'CBSE: Component-Based Software Engineering '
start_date: 2015-05-04
date_created: 2018-12-11T11:52:24Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1145/2737166.2737175
ec_funded: 1
file:
- access_level: open_access
checksum: c6ce681035c163a158751f240cb7d389
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:46Z
date_updated: 2020-07-14T12:44:59Z
file_id: '5303'
file_name: IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf
file_size: 467561
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 101 - 110
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_identifier:
isbn:
- 978-1-4503-3471-6
publication_status: published
publisher: ACM
publist_id: '5676'
pubrep_id: '625'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Complete composition operators for IOCO-testing theory
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1505'
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.
acknowledgement: "B.Z. was supported in part by NSFC Grant 11071213, ZJNSF
\ Grant R6090034 and SRFDP Grant 20100101110001. P.G. was supported in part
by the Ministry of Education, Singapore, under Grant ARC 14/11. Z.W. was supported
\ in part by the Ministry of Education, Singapore, under Grant ARC 14/11,
\ and by a Grant R-155-000-131-112 at the National University of Singapore\r\n"
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
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
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.
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.
ista: Bao Z, Pan G, Zhou W. 2015. Universality for the largest eigenvalue of sample
covariance matrices with general population. Annals of Statistics. 43(1), 382–421.
mla: Bao, Zhigang, et al. “Universality for the Largest Eigenvalue of Sample Covariance
Matrices with General Population.” Annals of Statistics, vol. 43, no. 1,
Institute of Mathematical Statistics, 2015, pp. 382–421, doi:10.1214/14-AOS1281.
short: Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.
date_created: 2018-12-11T11:52:25Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/14-AOS1281
intvolume: ' 43'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1304.5690
month: '02'
oa: 1
oa_version: Preprint
page: 382 - 421
publication: Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5672'
quality_controlled: '1'
status: public
title: Universality for the largest eigenvalue of sample covariance matrices with
general population
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2015'
...
---
_id: '1506'
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).
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
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
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.
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.
ista: Bao Z, Pan G, Zhou W. 2015. The logarithmic law of random determinant. Bernoulli.
21(3), 1600–1628.
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.
short: Z. Bao, G. Pan, W. Zhou, Bernoulli 21 (2015) 1600–1628.
date_created: 2018-12-11T11:52:25Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
department:
- _id: LaEr
doi: 10.3150/14-BEJ615
intvolume: ' 21'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1208.5823
month: '08'
oa: 1
oa_version: Preprint
page: 1600 - 1628
publication: Bernoulli
publication_status: published
publisher: Bernoulli Society for Mathematical Statistics and Probability
publist_id: '5671'
quality_controlled: '1'
status: public
title: The logarithmic law of random determinant
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2015'
...
---
_id: '1508'
abstract:
- lang: eng
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.
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
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
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
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.
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.
ista: Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles.
Journal of the European Mathematical Society. 17(8), 1927–2036.
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.
short: L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015)
1927–2036.
date_created: 2018-12-11T11:52:26Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:15Z
day: '01'
department:
- _id: LaEr
doi: 10.4171/JEMS/548
intvolume: ' 17'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1211.3786
month: '08'
oa: 1
oa_version: Preprint
page: 1927 - 2036
publication: Journal of the European Mathematical Society
publication_status: published
publisher: European Mathematical Society
publist_id: '5669'
quality_controlled: '1'
scopus_import: 1
status: public
title: Gap universality of generalized Wigner and β ensembles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2015'
...
---
_id: '1509'
abstract:
- lang: eng
text: The Auxin Binding Protein1 (ABP1) has been identified based on its ability
to bind auxin with high affinity and studied for a long time as a prime candidate
for the extracellular auxin receptor responsible for mediating in particular the
fast non-transcriptional auxin responses. However, the contradiction between the
embryo-lethal phenotypes of the originally described Arabidopsis T-DNA insertional
knock-out alleles (abp1-1 and abp1-1s) and the wild type-like phenotypes of other
recently described loss-of-function alleles (abp1-c1 and abp1-TD1) questions the
biological importance of ABP1 and relevance of the previous genetic studies. Here
we show that there is no hidden copy of the ABP1 gene in the Arabidopsis genome
but the embryo-lethal phenotypes of abp1-1 and abp1-1s alleles are very similar
to the knock-out phenotypes of the neighboring gene, BELAYA SMERT (BSM). Furthermore,
the allelic complementation test between bsm and abp1 alleles shows that the embryo-lethality
in the abp1-1 and abp1-1s alleles is caused by the off-target disruption of the
BSM locus by the T-DNA insertions. This clarifies the controversy of different
phenotypes among published abp1 knock-out alleles and asks for reflections on
the developmental role of ABP1.
acknowledgement: "This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP
to JF). JM internship was supported by the grant “Action Austria – Slovakia”.\r\nData
associated with the article are available under the terms of the Creative Commons
Zero \"No rights reserved\" data waiver (CC0 1.0 Public domain dedication). \r\n\r\nData
availability: \r\nF1000Research: Dataset 1. Dataset 1, 10.5256/f1000research.7143.d104552\r\n\r\nF1000Research:
Dataset 2. Dataset 2, 10.5256/f1000research.7143.d104553\r\n\r\nF1000Research: Dataset
3. Dataset 3, 10.5256/f1000research.7143.d104554"
article_processing_charge: No
author:
- first_name: Jaroslav
full_name: Michalko, Jaroslav
id: 483727CA-F248-11E8-B48F-1D18A9856A87
last_name: Michalko
- first_name: Marta
full_name: Dravecka, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Dravecka
orcid: 0000-0002-2519-8004
- first_name: Tobias
full_name: Bollenbach, Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Michalko J, Lukacisinova M, Bollenbach MT, Friml J. Embryo-lethal phenotypes
in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000
Research . 2015;4. doi:10.12688/f1000research.7143.1
apa: Michalko, J., Lukacisinova, M., Bollenbach, M. T., & Friml, J. (2015).
Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring
BSM gene. F1000 Research . F1000 Research. https://doi.org/10.12688/f1000research.7143.1
chicago: Michalko, Jaroslav, Marta Lukacisinova, Mark Tobias Bollenbach, and Jiří
Friml. “Embryo-Lethal Phenotypes in Early Abp1 Mutants Are Due to Disruption of
the Neighboring BSM Gene.” F1000 Research . F1000 Research, 2015. https://doi.org/10.12688/f1000research.7143.1.
ieee: J. Michalko, M. Lukacisinova, M. T. Bollenbach, and J. Friml, “Embryo-lethal
phenotypes in early abp1 mutants are due to disruption of the neighboring BSM
gene,” F1000 Research , vol. 4. F1000 Research, 2015.
ista: Michalko J, Lukacisinova M, Bollenbach MT, Friml J. 2015. Embryo-lethal phenotypes
in early abp1 mutants are due to disruption of the neighboring BSM gene. F1000
Research . 4.
mla: Michalko, Jaroslav, et al. “Embryo-Lethal Phenotypes in Early Abp1 Mutants
Are Due to Disruption of the Neighboring BSM Gene.” F1000 Research , vol.
4, F1000 Research, 2015, doi:10.12688/f1000research.7143.1.
short: J. Michalko, M. Lukacisinova, M.T. Bollenbach, J. Friml, F1000 Research 4
(2015).
date_created: 2018-12-11T11:52:26Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2025-05-07T11:12:30Z
day: '01'
ddc:
- '570'
department:
- _id: JiFr
- _id: ToBo
doi: 10.12688/f1000research.7143.1
ec_funded: 1
file:
- access_level: open_access
checksum: 8beae5cbe988e1060265ae7de2ee8306
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:12Z
date_updated: 2020-07-14T12:44:59Z
file_id: '5198'
file_name: IST-2016-497-v1+1_10.12688_f1000research.7143.1_20151102.pdf
file_size: 4414248
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
intvolume: ' 4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: 'F1000 Research '
publication_status: published
publisher: F1000 Research
publist_id: '5668'
pubrep_id: '497'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the
neighboring BSM gene
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: 4
year: '2015'
...
---
_id: '1510'
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. '
alternative_title:
- LIPIcs
author:
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
citation:
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'
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.
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.'
ista: 'Franek P, Krcál M. 2015. On computability and triviality of well groups.
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 842–856.'
mla: Franek, Peter, and Marek Krcál. 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.
short: P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015, pp. 842–856.
conference:
end_date: 2015-06-25
location: Eindhoven, Netherlands
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2015-06-22
date_created: 2018-12-11T11:52:26Z
date_published: 2015-06-11T00:00:00Z
date_updated: 2023-02-21T17:02:57Z
day: '11'
ddc:
- '510'
department:
- _id: UlWa
- _id: HeEd
doi: 10.4230/LIPIcs.SOCG.2015.842
ec_funded: 1
file:
- access_level: open_access
checksum: 49eb5021caafaabe5356c65b9c5f8c9c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:19Z
date_updated: 2020-07-14T12:44:59Z
file_id: '5001'
file_name: IST-2016-503-v1+1_32.pdf
file_size: 623563
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
intvolume: ' 34'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 842 - 856
project:
- _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: '5667'
pubrep_id: '503'
quality_controlled: '1'
related_material:
record:
- id: '1408'
relation: later_version
status: public
scopus_import: 1
status: public
title: On computability and triviality of well groups
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: 34
year: '2015'
...
---
_id: '1511'
abstract:
- lang: eng
text: 'The fact that the complete graph K_5 does not embed in the plane has been
generalized in two independent directions. On the one hand, the solution of the
classical Heawood problem for graphs on surfaces established that the complete
graph K_n embeds in a closed surface M if and only if (n-3)(n-4) is at most 6b_1(M),
where b_1(M) is the first Z_2-Betti number of M. On the other hand, Van Kampen
and Flores proved that the k-skeleton of the n-dimensional simplex (the higher-dimensional
analogue of K_{n+1}) embeds in R^{2k} if and only if n is less or equal to 2k+2.
Two decades ago, Kuhnel conjectured that the k-skeleton of the n-simplex embeds
in a compact, (k-1)-connected 2k-manifold with kth Z_2-Betti number b_k only if
the following generalized Heawood inequality holds: binom{n-k-1}{k+1} is at most
binom{2k+1}{k+1} b_k. This is a common generalization of the case of graphs on
surfaces as well as the Van Kampen--Flores theorem. In the spirit of Kuhnel''s
conjecture, we prove that if the k-skeleton of the n-simplex embeds in a 2k-manifold
with kth Z_2-Betti number b_k, then n is at most 2b_k binom{2k+2}{k} + 2k + 5.
This bound is weaker than the generalized Heawood inequality, but does not require
the assumption that M is (k-1)-connected. Our proof uses a result of Volovikov
about maps that satisfy a certain homological triviality condition.'
acknowledgement: "The work by Z. P. was partially supported by the Charles University
Grant SVV-2014-260103. The\r\nwork by Z. P. and M. T. was partially supported by
the project CE-ITI (GACR P202/12/G061) of\r\nthe Czech Science Foundation and by
the ERC Advanced Grant No. 267165. Part of the research\r\nwork of M. T. was conducted
at IST Austria, supported by an IST Fellowship. The work by U.W.\r\nwas partially
supported by the Swiss National Science Foundation (grants SNSF-200020-138230 and\r\nSNSF-PP00P2-138948)."
alternative_title:
- LIPIcs
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
id: 48B57058-F248-11E8-B48F-1D18A9856A87
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. On generalized
Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability
result. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:476-490.
doi:10.4230/LIPIcs.SOCG.2015.476'
apa: 'Goaoc, X., Mabillard, I., Paták, P., Patakova, Z., Tancer, M., & Wagner,
U. (2015). On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type
nonembeddability result (Vol. 34, pp. 476–490). 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.476'
chicago: 'Goaoc, Xavier, Isaac Mabillard, Pavel Paták, Zuzana Patakova, Martin Tancer,
and Uli Wagner. “On Generalized Heawood Inequalities for Manifolds: A Van Kampen–Flores-Type
Nonembeddability Result,” 34:476–90. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.476.'
ieee: 'X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, and U. Wagner,
“On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability
result,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven,
Netherlands, 2015, vol. 34, pp. 476–490.'
ista: 'Goaoc X, Mabillard I, Paták P, Patakova Z, Tancer M, Wagner U. 2015. On generalized
Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability
result. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 476–490.'
mla: 'Goaoc, Xavier, et al. On Generalized Heawood Inequalities for Manifolds:
A Van Kampen–Flores-Type Nonembeddability Result. Vol. 34, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2015, pp. 476–90, doi:10.4230/LIPIcs.SOCG.2015.476.'
short: X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–490.
conference:
end_date: 2015-06-25
location: Eindhoven, Netherlands
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2015-06-22
date_created: 2018-12-11T11:52:27Z
date_published: 2015-06-11T00:00:00Z
date_updated: 2023-02-23T12:38:00Z
day: '11'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SOCG.2015.476
ec_funded: 1
file:
- access_level: open_access
checksum: 0945811875351796324189312ca29e9e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:18Z
date_updated: 2020-07-14T12:44:59Z
file_id: '4871'
file_name: IST-2016-502-v1+1_42.pdf
file_size: 636735
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 476 - 490
project:
- _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: '5666'
pubrep_id: '502'
quality_controlled: '1'
related_material:
record:
- id: '610'
relation: later_version
status: public
scopus_import: 1
status: public
title: 'On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type
nonembeddability result'
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: '34 '
year: '2015'
...
---
_id: '1512'
abstract:
- lang: eng
text: 'We show that very weak topological assumptions are enough to ensure the existence
of a Helly-type theorem. More precisely, we show that for any non-negative integers
b and d there exists an integer h(b,d) such that the following holds. If F is
a finite family of subsets of R^d such that the ith reduced Betti number (with
Z_2 coefficients in singular homology) of the intersection of any proper subfamily
G of F is at most b for every non-negative integer i less or equal to (d-1)/2,
then F has Helly number at most h(b,d). These topological conditions are sharp:
not controlling any of these first Betti numbers allow for families with unbounded
Helly number. Our proofs combine homological non-embeddability results with a
Ramsey-based approach to build, given an arbitrary simplicial complex K, some
well-behaved chain map from C_*(K) to C_*(R^d). Both techniques are of independent
interest.'
acknowledgement: "PP, ZP and MT were partially supported by the Charles University
Grant GAUK 421511. ZP was\r\npartially supported by the Charles University Grant
SVV-2014-260103. ZP and MT were partially\r\nsupported by the ERC Advanced Grant
No. 267165 and by the project CE-ITI (GACR P202/12/G061)\r\nof the Czech Science
Foundation. UW was partially supported by the Swiss National Science Foundation\r\n(grants
SNSF-200020-138230 and SNSF-PP00P2-138948). Part of this work was done when XG was
affiliated with INRIA Nancy Grand-Est and when MT was affiliated with Institutionen
för matematik, Kungliga Tekniska Högskolan, then IST Austria."
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Xavier
full_name: Goaoc, Xavier
last_name: Goaoc
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. Bounding Helly numbers via
Betti numbers. In: Vol 34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2015:507-521. doi:10.4230/LIPIcs.SOCG.2015.507'
apa: 'Goaoc, X., Paták, P., Patakova, Z., Tancer, M., & Wagner, U. (2015). Bounding
Helly numbers via Betti numbers (Vol. 34, pp. 507–521). 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.507'
chicago: Goaoc, Xavier, Pavel Paták, Zuzana Patakova, Martin Tancer, and Uli Wagner.
“Bounding Helly Numbers via Betti Numbers,” 34:507–21. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.507.
ieee: 'X. Goaoc, P. Paták, Z. Patakova, M. Tancer, and U. Wagner, “Bounding Helly
numbers via Betti numbers,” presented at the SoCG: Symposium on Computational
Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 507–521.'
ista: 'Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2015. Bounding Helly numbers
via Betti numbers. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34,
507–521.'
mla: Goaoc, Xavier, et al. Bounding Helly Numbers via Betti Numbers. Vol.
34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–21, doi:10.4230/LIPIcs.SOCG.2015.507.
short: X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2015, pp. 507–521.
conference:
end_date: 2015-06-25
location: Eindhoven, Netherlands
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2015-06-22
date_created: 2018-12-11T11:52:27Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2024-02-28T12:59:37Z
day: '01'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SOCG.2015.507
file:
- access_level: open_access
checksum: e6881df44d87fe0c2529c9f7b2724614
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:09Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4794'
file_name: IST-2016-501-v1+1_46.pdf
file_size: 633712
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 34'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 507 - 521
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5665'
pubrep_id: '501'
quality_controlled: '1'
related_material:
record:
- id: '424'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Bounding Helly numbers via Betti numbers
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: 34
year: '2015'
...
---
_id: '1513'
abstract:
- lang: eng
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. "
article_processing_charge: No
author:
- first_name: Arka
full_name: Pal, Arka
id: 6AAB2240-CA9A-11E9-9C1A-D9D1E5697425
last_name: Pal
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
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'
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'
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.'
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.'
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.'
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.'
short: A. Pal, B. Vicoso, Genome Biology and Evolution 7 (2015) 3259–3268.
date_created: 2018-12-11T11:52:27Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2021-01-12T06:51:18Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1093/gbe/evv215
ec_funded: 1
file:
- access_level: open_access
checksum: 2b56b8c2e2a1d4cc3c9cb8daba26dd9b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:29Z
date_updated: 2020-07-14T12:45:00Z
file_id: '5284'
file_name: IST-2016-496-v1+1_Genome_Biol_Evol-2015-Pal-3259-68.pdf
file_size: 858027
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 3259 - 3268
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Genome Biology and Evolution
publication_status: published
publisher: Oxford University Press
publist_id: '5664'
pubrep_id: '496'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The X chromosome of hemipteran insects: Conservation, dosage compensation
and sex-biased expression'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2015'
...
---
_id: '1517'
abstract:
- lang: eng
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"
article_number: '89'
author:
- first_name: Matthias
full_name: Erbar, Matthias
last_name: Erbar
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Michiel
full_name: Renger, Michiel
last_name: Renger
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
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.
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.
ista: Erbar M, Maas J, Renger M. 2015. From large deviations to Wasserstein gradient
flows in multiple dimensions. Electronic Communications in Probability. 20, 89.
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.
short: M. Erbar, J. Maas, M. Renger, Electronic Communications in Probability 20
(2015).
date_created: 2018-12-11T11:52:29Z
date_published: 2015-11-29T00:00:00Z
date_updated: 2021-01-12T06:51:19Z
day: '29'
ddc:
- '519'
department:
- _id: JaMa
doi: 10.1214/ECP.v20-4315
file:
- access_level: open_access
checksum: 135741c17d3e1547ca696b6fbdcd559c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:39Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4828'
file_name: IST-2016-494-v1+1_4315-23820-1-PB.pdf
file_size: 230525
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 20'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Electronic Communications in Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5660'
pubrep_id: '494'
quality_controlled: '1'
scopus_import: 1
status: public
title: From large deviations to Wasserstein gradient flows in multiple dimensions
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2015'
...
---
_id: '1519'
abstract:
- lang: eng
text: Evolutionary biologists have an array of powerful theoretical techniques that
can accurately predict changes in the genetic composition of populations. Changes
in gene frequencies and genetic associations between loci can be tracked as they
respond to a wide variety of evolutionary forces. However, it is often less clear
how to decompose these various forces into components that accurately reflect
the underlying biology. Here, we present several issues that arise in the definition
and interpretation of selection and selection coefficients, focusing on insights
gained through the examination of selection coefficients in multilocus notation.
Using this notation, we discuss how its flexibility-which allows different biological
units to be identified as targets of selection-is reflected in the interpretation
of the coefficients that the notation generates. In many situations, it can be
difficult to agree on whether loci can be considered to be under "direct"
versus "indirect" selection, or to quantify this selection. We present
arguments for what the terms direct and indirect selection might best encompass,
considering a range of issues, from viability and sexual selection to kin selection.
We show how multilocus notation can discriminate between direct and indirect selection,
and describe when it can do so.
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Maria
full_name: Servedio, Maria
last_name: Servedio
citation:
ama: Barton NH, Servedio M. The interpretation of selection coefficients. Evolution.
2015;69(5):1101-1112. doi:10.1111/evo.12641
apa: Barton, N. H., & Servedio, M. (2015). The interpretation of selection coefficients.
Evolution. Wiley. https://doi.org/10.1111/evo.12641
chicago: Barton, Nicholas H, and Maria Servedio. “The Interpretation of Selection
Coefficients.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12641.
ieee: N. H. Barton and M. Servedio, “The interpretation of selection coefficients,”
Evolution, vol. 69, no. 5. Wiley, pp. 1101–1112, 2015.
ista: Barton NH, Servedio M. 2015. The interpretation of selection coefficients.
Evolution. 69(5), 1101–1112.
mla: Barton, Nicholas H., and Maria Servedio. “The Interpretation of Selection Coefficients.”
Evolution, vol. 69, no. 5, Wiley, 2015, pp. 1101–12, doi:10.1111/evo.12641.
short: N.H. Barton, M. Servedio, Evolution 69 (2015) 1101–1112.
date_created: 2018-12-11T11:52:29Z
date_published: 2015-03-19T00:00:00Z
date_updated: 2021-01-12T06:51:20Z
day: '19'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/evo.12641
ec_funded: 1
file:
- access_level: open_access
checksum: fd8d23f476bc194419929b72ca265c02
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:34Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4822'
file_name: IST-2016-560-v1+1_Interpreting_ML_coefficients_11.2.15_App.pdf
file_size: 188872
relation: main_file
- access_level: open_access
checksum: b774911e70044641d556e258efcb52ef
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:35Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4823'
file_name: IST-2016-560-v1+2_Interpreting_ML_coefficients_11.2.15_mainText.pdf
file_size: 577415
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 69'
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 1101 - 1112
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Evolution
publication_status: published
publisher: Wiley
publist_id: '5656'
pubrep_id: '560'
quality_controlled: '1'
scopus_import: 1
status: public
title: The interpretation of selection coefficients
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2015'
...
---
_id: '1520'
abstract:
- lang: eng
text: Creating mechanical automata that can walk in stable and pleasing manners
is a challenging task that requires both skill and expertise. We propose to use
computational design to offset the technical difficulties of this process. A simple
drag-and-drop interface allows casual users to create personalized walking toys
from a library of pre-defined template mechanisms. Provided with this input, our
method leverages physical simulation and evolutionary optimization to refine the
mechanical designs such that the resulting toys are able to walk. The optimization
process is guided by an intuitive set of objectives that measure the quality of
the walking motions. We demonstrate our approach on a set of simulated mechanical
toys with different numbers of legs and various distinct gaits. Two fabricated
prototypes showcase the feasibility of our designs.
author:
- first_name: Gaurav
full_name: Bharaj, Gaurav
last_name: Bharaj
- first_name: Stelian
full_name: Coros, Stelian
last_name: Coros
- first_name: Bernhard
full_name: Thomaszewski, Bernhard
last_name: Thomaszewski
- first_name: James
full_name: Tompkin, James
last_name: Tompkin
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
citation:
ama: 'Bharaj G, Coros S, Thomaszewski B, Tompkin J, Bickel B, Pfister H. Computational
design of walking automata. In: ACM; 2015:93-100. doi:10.1145/2786784.2786803'
apa: 'Bharaj, G., Coros, S., Thomaszewski, B., Tompkin, J., Bickel, B., & Pfister,
H. (2015). Computational design of walking automata (pp. 93–100). Presented at
the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Los Angeles,
CA, United States: ACM. https://doi.org/10.1145/2786784.2786803'
chicago: Bharaj, Gaurav, Stelian Coros, Bernhard Thomaszewski, James Tompkin, Bernd
Bickel, and Hanspeter Pfister. “Computational Design of Walking Automata,” 93–100.
ACM, 2015. https://doi.org/10.1145/2786784.2786803.
ieee: 'G. Bharaj, S. Coros, B. Thomaszewski, J. Tompkin, B. Bickel, and H. Pfister,
“Computational design of walking automata,” presented at the SCA: ACM SIGGRAPH/Eurographics
Symposium on Computer animation, Los Angeles, CA, United States, 2015, pp. 93–100.'
ista: 'Bharaj G, Coros S, Thomaszewski B, Tompkin J, Bickel B, Pfister H. 2015.
Computational design of walking automata. SCA: ACM SIGGRAPH/Eurographics Symposium
on Computer animation, 93–100.'
mla: Bharaj, Gaurav, et al. Computational Design of Walking Automata. ACM,
2015, pp. 93–100, doi:10.1145/2786784.2786803.
short: G. Bharaj, S. Coros, B. Thomaszewski, J. Tompkin, B. Bickel, H. Pfister,
in:, ACM, 2015, pp. 93–100.
conference:
end_date: 2015-08-09
location: Los Angeles, CA, United States
name: 'SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation'
start_date: 2015-08-07
date_created: 2018-12-11T11:52:30Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:21Z
day: '01'
department:
- _id: BeBi
doi: 10.1145/2786784.2786803
language:
- iso: eng
month: '08'
oa_version: None
page: 93 - 100
publication_identifier:
isbn:
- 978-1-4503-3496-9
publication_status: published
publisher: ACM
publist_id: '5655'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computational design of walking automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1525'
abstract:
- lang: eng
text: 'Based on 16 recommendations, efforts should be made to achieve the following
goal: By 2025, all scholarly publication activity in Austria should be Open Access.
In other words, the final versions of all scholarly publications resulting from
the support of public resources must be freely accessible on the Internet without
delay (Gold Open Access). The resources required to meet this obligation shall
be provided to the authors, or the cost of the publication venues shall be borne
directly by the research organisations.'
article_processing_charge: No
article_type: original
author:
- first_name: Bruno
full_name: Bauer, Bruno
last_name: Bauer
- first_name: Guido
full_name: Blechl, Guido
last_name: Blechl
- first_name: Christoph
full_name: Bock, Christoph
last_name: Bock
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Andreas
full_name: Ferus, Andreas
last_name: Ferus
- first_name: Anton
full_name: Graschopf, Anton
last_name: Graschopf
- first_name: Thomas
full_name: König, Thomas
last_name: König
- first_name: Katja
full_name: Mayer, Katja
last_name: Mayer
- first_name: Falk
full_name: Reckling, Falk
last_name: Reckling
- first_name: Katharina
full_name: Rieck, Katharina
last_name: Rieck
- first_name: Peter
full_name: Seitz, Peter
last_name: Seitz
- first_name: Herwig
full_name: Stöger, Herwig
last_name: Stöger
- first_name: Elvira
full_name: Welzig, Elvira
last_name: Welzig
citation:
ama: Bauer B, Blechl G, Bock C, et al. Arbeitsgruppe „Nationale Strategie“ des Open
Access Network Austria OANA. VÖB Mitteilungen. 2015;68(3):580-607. doi:10.5281/zenodo.33178
apa: Bauer, B., Blechl, G., Bock, C., Danowski, P., Ferus, A., Graschopf, A., …
Welzig, E. (2015). Arbeitsgruppe „Nationale Strategie“ des Open Access Network
Austria OANA. VÖB Mitteilungen. Verein Österreichischer Bibliothekare.
https://doi.org/10.5281/zenodo.33178
chicago: Bauer, Bruno, Guido Blechl, Christoph Bock, Patrick Danowski, Andreas Ferus,
Anton Graschopf, Thomas König, et al. “Arbeitsgruppe „Nationale Strategie“ Des
Open Access Network Austria OANA.” VÖB Mitteilungen. Verein Österreichischer
Bibliothekare, 2015. https://doi.org/10.5281/zenodo.33178.
ieee: B. Bauer et al., “Arbeitsgruppe „Nationale Strategie“ des Open Access
Network Austria OANA,” VÖB Mitteilungen, vol. 68, no. 3. Verein Österreichischer
Bibliothekare, pp. 580–607, 2015.
ista: Bauer B, Blechl G, Bock C, Danowski P, Ferus A, Graschopf A, König T, Mayer
K, Reckling F, Rieck K, Seitz P, Stöger H, Welzig E. 2015. Arbeitsgruppe „Nationale
Strategie“ des Open Access Network Austria OANA. VÖB Mitteilungen. 68(3), 580–607.
mla: Bauer, Bruno, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network
Austria OANA.” VÖB Mitteilungen, vol. 68, no. 3, Verein Österreichischer
Bibliothekare, 2015, pp. 580–607, doi:10.5281/zenodo.33178.
short: B. Bauer, G. Blechl, C. Bock, P. Danowski, A. Ferus, A. Graschopf, T. König,
K. Mayer, F. Reckling, K. Rieck, P. Seitz, H. Stöger, E. Welzig, VÖB Mitteilungen
68 (2015) 580–607.
date_created: 2018-12-11T11:52:31Z
date_published: 2015-11-12T00:00:00Z
date_updated: 2021-01-12T06:51:22Z
day: '12'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.33178
file:
- access_level: open_access
checksum: a495fe253bbc7615b1d60e9e85c94408
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:59Z
date_updated: 2020-07-14T12:45:00Z
file_id: '5317'
file_name: IST-2016-720-v1+1_OANA_OA-Empfehlungen_12-11-2015.pdf
file_size: 931707
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 68'
issue: '3'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 580 - 607
publication: VÖB Mitteilungen
publication_status: published
publisher: Verein Österreichischer Bibliothekare
publist_id: '5648'
pubrep_id: '720'
quality_controlled: '1'
scopus_import: 1
status: public
title: Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA
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: 68
year: '2015'
...