---
_id: '478'
abstract:
- lang: eng
text: 'Magic: the Gathering is a game about magical combat for any number of players.
Formally it is a zero-sum, imperfect information stochastic game that consists
of a potentially unbounded number of steps. We consider the problem of deciding
if a move is legal in a given single step of Magic. We show that the problem is
(a) coNP-complete in general; and (b) in P if either of two small sets of cards
are not used. Our lower bound holds even for single-player Magic games. The significant
aspects of our results are as follows: First, in most real-life game problems,
the task of deciding whether a given move is legal in a single step is trivial,
and the computationally hard task is to find the best sequence of legal moves
in the presence of multiple players. In contrast, quite uniquely our hardness
result holds for single step and with only one-player. Second, we establish efficient
algorithms for important special cases of Magic.'
alternative_title:
- Frontiers in Artificial Intelligence and Applications
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single
step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:10.3233/978-1-61499-672-9-1432'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding
legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented
at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands:
IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432'
chicago: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016.
https://doi.org/10.3233/978-1-61499-672-9-1432.'
ieee: 'K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of
a single step of magic: The gathering,” presented at the ECAI: European Conference
on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.'
ista: 'Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of
a single step of magic: The gathering. ECAI: European Conference on Artificial
Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285,
1432–1439.'
mla: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016,
pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.'
short: K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
conference:
end_date: 2016-09-02
location: The Hague, Netherlands
name: 'ECAI: European Conference on Artificial Intelligence'
start_date: 2016-08-29
date_created: 2018-12-11T11:46:41Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2021-01-12T08:00:54Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.3233/978-1-61499-672-9-1432
file:
- access_level: open_access
checksum: 848043c812ace05e459579c923f3d3cf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:59Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4658'
file_name: IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf
file_size: 2116225
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 285'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 1432 - 1439
publication_status: published
publisher: IOS Press
publist_id: '7342'
pubrep_id: '950'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The complexity of deciding legality of a single step of magic: The gathering'
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 285
year: '2016'
...
---
_id: '479'
abstract:
- lang: eng
text: Clinical guidelines and decision support systems (DSS) play an important role
in daily practices of medicine. Many text-based guidelines have been encoded for
work-flow simulation of DSS to automate health care. During the collaboration
with Carle hospital to develop a DSS, we identify that, for some complex and life-critical
diseases, it is highly desirable to automatically rigorously verify some complex
temporal properties in guidelines, which brings new challenges to current simulation
based DSS with limited support of automatical formal verification and real-time
data analysis. In this paper, we conduct the first study on applying runtime verification
to cooperate with current DSS based on real-time data. Within the proposed technique,
a user-friendly domain specific language, named DRTV, is designed to specify vital
real-time data sampled by medical devices and temporal properties originated from
clinical guidelines. Some interfaces are developed for data acquisition and communication.
Then, for medical practice scenarios described in DRTV model, we will automatically
generate event sequences and runtime property verifier automata. If a temporal
property violates, real-time warnings will be produced by the formal verifier
and passed to medical DSS. We have used DRTV to specify different kinds of medical
care scenarios, and applied the proposed technique to assist existing DSS. As
presented in experiment results, in terms of warning detection, it outperforms
the only use of DSS or human inspection, and improves the quality of clinical
health care of hospital
acknowledgement: "This work is supported by NSF CNS 13-30077, NSF CNS 13-29886, NSF
CNS 15-45002, and NSFC 61303014.\r\nThe authors thank Dr. Bobby and Dr. Hill at
Carle Hospital, Urbana, IL for their help with the discussion on medical knowledge.\r\n\r\n"
alternative_title:
- Proceedings International Conference on Software Engineering
author:
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Han
full_name: Liu, Han
last_name: Liu
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Rui
full_name: Wang, Rui
last_name: Wang
- first_name: Mohamad
full_name: Hosseini, Mohamad
last_name: Hosseini
- first_name: Jiaguang
full_name: Sun, Jiaguang
last_name: Sun
- first_name: Lui
full_name: Sha, Lui
last_name: Sha
citation:
ama: 'Jiang Y, Liu H, Kong H, et al. Use runtime verification to improve the quality
of medical care practice. In: Proceedings of the 38th International Conference
on Software Engineering Companion . IEEE; 2016:112-121. doi:10.1145/2889160.2889233'
apa: 'Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., & Sha,
L. (2016). Use runtime verification to improve the quality of medical care practice.
In Proceedings of the 38th International Conference on Software Engineering
Companion (pp. 112–121). Austin, TX, USA: IEEE. https://doi.org/10.1145/2889160.2889233'
chicago: Jiang, Yu, Han Liu, Hui Kong, Rui Wang, Mohamad Hosseini, Jiaguang Sun,
and Lui Sha. “Use Runtime Verification to Improve the Quality of Medical Care
Practice.” In Proceedings of the 38th International Conference on Software
Engineering Companion , 112–21. IEEE, 2016. https://doi.org/10.1145/2889160.2889233.
ieee: Y. Jiang et al., “Use runtime verification to improve the quality of
medical care practice,” in Proceedings of the 38th International Conference
on Software Engineering Companion , Austin, TX, USA, 2016, pp. 112–121.
ista: 'Jiang Y, Liu H, Kong H, Wang R, Hosseini M, Sun J, Sha L. 2016. Use runtime
verification to improve the quality of medical care practice. Proceedings of the
38th International Conference on Software Engineering Companion . ICSE: International
Conference on Software Engineering, Proceedings International Conference on Software
Engineering, , 112–121.'
mla: Jiang, Yu, et al. “Use Runtime Verification to Improve the Quality of Medical
Care Practice.” Proceedings of the 38th International Conference on Software
Engineering Companion , IEEE, 2016, pp. 112–21, doi:10.1145/2889160.2889233.
short: Y. Jiang, H. Liu, H. Kong, R. Wang, M. Hosseini, J. Sun, L. Sha, in:, Proceedings
of the 38th International Conference on Software Engineering Companion , IEEE,
2016, pp. 112–121.
conference:
end_date: 2016-05-22
location: Austin, TX, USA
name: 'ICSE: International Conference on Software Engineering'
start_date: 2016-05-14
date_created: 2018-12-11T11:46:42Z
date_published: 2016-05-14T00:00:00Z
date_updated: 2021-01-12T08:00:55Z
day: '14'
department:
- _id: ToHe
doi: 10.1145/2889160.2889233
language:
- iso: eng
month: '05'
oa_version: None
page: 112 - 121
publication: 'Proceedings of the 38th International Conference on Software Engineering
Companion '
publication_status: published
publisher: IEEE
publist_id: '7341'
quality_controlled: '1'
scopus_import: 1
status: public
title: Use runtime verification to improve the quality of medical care practice
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '480'
abstract:
- lang: eng
text: Graph games provide the foundation for modeling and synthesizing reactive
processes. In the synthesis of stochastic reactive processes, the traditional
model is perfect-information stochastic games, where some transitions of the game
graph are controlled by two adversarial players, and the other transitions are
executed probabilistically. We consider such games where the objective is the
conjunction of several quantitative objectives (specified as mean-payoff conditions),
which we refer to as generalized mean-payoff objectives. The basic decision problem
asks for the existence of a finite-memory strategy for a player that ensures the
generalized mean-payoff objective be satisfied with a desired probability against
all strategies of the opponent. A special case of the decision problem is the
almost-sure problem where the desired probability is 1. Previous results presented
a semi-decision procedure for -approximations of the almost-sure problem. In this
work, we show that both the almost-sure problem as well as the general basic decision
problem are coNP-complete, significantly improving the previous results. Moreover,
we show that in the case of 1-player stochastic games, randomized memoryless strategies
are sufficient and the problem can be solved in polynomial time. In contrast,
in two-player stochastic games, we show that even with randomized strategies exponential
memory is required in general, and present a matching exponential upper bound.
We also study the basic decision problem with infinite-memory strategies and present
computational complexity results for the problem. Our results are relevant in
the synthesis of stochastic reactive systems with multiple quantitative requirements.
alternative_title:
- Proceedings Symposium on Logic in Computer Science
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Perfect-information stochastic games with generalized
mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:10.1145/2933575.2934513'
apa: 'Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games
with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented
at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE,
2016. https://doi.org/10.1145/2933575.2934513.
ieee: 'K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized
mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New
York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.'
ista: 'Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized
mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium
on Logic in Computer Science, vol. 05-08-July-2016, 247–256.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives. Vol. 05-08-July-2016, IEEE,
2016, pp. 247–56, doi:10.1145/2933575.2934513.
short: K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.
conference:
end_date: 2016-07-08
location: New York, NY, USA
name: 'LICS: Logic in Computer Science'
start_date: 2016-07-05
date_created: 2018-12-11T11:46:42Z
date_published: 2016-07-05T00:00:00Z
date_updated: 2021-01-12T08:00:56Z
day: '05'
department:
- _id: KrCh
doi: 10.1145/2933575.2934513
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.06376
month: '07'
oa: 1
oa_version: Preprint
page: 247 - 256
project:
- _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: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: IEEE
publist_id: '7340'
quality_controlled: '1'
scopus_import: 1
status: public
title: Perfect-information stochastic games with generalized mean-payoff objectives
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 05-08-July-2016
year: '2016'
...
---
_id: '482'
abstract:
- lang: eng
text: Nonlinear electro-optical conversion of microwave radiation into the optical
telecommunication band is achieved within a crystalline whispering gallery mode
resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth.
alternative_title:
- Optics InfoBase Conference Papers
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Rueda, Alfredo
last_name: Rueda
- first_name: Florian
full_name: Sedlmeir, Florian
last_name: Sedlmeir
- first_name: Michele
full_name: Collodo, Michele
last_name: Collodo
- first_name: Ulrich
full_name: Vogl, Ulrich
last_name: Vogl
- first_name: Birgit
full_name: Stiller, Birgit
last_name: Stiller
- first_name: Gerhard
full_name: Schunk, Gerhard
last_name: Schunk
- first_name: Dmitry
full_name: Strekalov, Dmitry
last_name: Strekalov
- first_name: Christoph
full_name: Marquardt, Christoph
last_name: Marquardt
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
- first_name: Gerd
full_name: Leuchs, Gerd
last_name: Leuchs
- first_name: Harald
full_name: Schwefel, Harald
last_name: Schwefel
citation:
ama: 'Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave
to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing
Group; 2016. doi:10.1364/NP.2016.NTh3A.6'
apa: 'Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., …
Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion
using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics,
Sydney, Australia: Optica Publishing Group. https://doi.org/10.1364/NP.2016.NTh3A.6'
chicago: Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit
Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave
to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing
Group, 2016. https://doi.org/10.1364/NP.2016.NTh3A.6.
ieee: 'A. Rueda et al., “Nonlinear single sideband microwave to optical conversion
using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics,
Sydney, Australia, 2016.'
ista: 'Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D,
Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single
sideband microwave to optical conversion using an electro-optic WGM-resonator.
NP: Nonlinear Photonics, Optics InfoBase Conference Papers, .'
mla: Rueda, Alfredo, et al. Nonlinear Single Sideband Microwave to Optical Conversion
Using an Electro-Optic WGM-Resonator. Optica Publishing Group, 2016, doi:10.1364/NP.2016.NTh3A.6.
short: A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov,
C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing
Group, 2016.
conference:
end_date: 2016-09-08
location: Sydney, Australia
name: 'NP: Nonlinear Photonics'
start_date: 2016-09-05
date_created: 2018-12-11T11:46:43Z
date_published: 2016-08-29T00:00:00Z
date_updated: 2023-10-17T12:16:43Z
day: '29'
department:
- _id: JoFi
doi: 10.1364/NP.2016.NTh3A.6
language:
- iso: eng
month: '08'
oa_version: None
publication_status: published
publisher: Optica Publishing Group
publist_id: '7339'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonlinear single sideband microwave to optical conversion using an electro-optic
WGM-resonator
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '510'
abstract:
- lang: eng
text: 'The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted
signaling peptides that are primarily involved in the regulation of stem cell
homeostasis in different plant meristems. Particularly, the characterization of
the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on
the potential roles of CLE peptides in vascular development and wood formation.
Nevertheless, our knowledge on this gene family in a tree species is limited.
In a recent study, we reported on a systematically investigation of the CLE gene
family in Populus trichocarpa . The potential roles of PtCLE genes were studied
by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members,
many PtCLE proteins share identical CLE motifs or contain the same CLE motif as
that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression
patterns comparing to their Arabidopsis counterparts. These fi ndings indicate
the existence of both functional conservation and functional divergence between
PtCLEs and their AtCLE orthologues. Our results provide valuable resources for
future functional investigations of these critical signaling molecules in woody
plants. '
acknowledgement: 'We are grateful to Dr. Long (Laboratoire de Reproduction et Developpement
des Plantes,CNRS,INRA,ENSLyon,UCBL,Universite de Lyon,France)for critical reading
of the article. Work in our group is supported by the National Natural Science Foundation
of China (31271575; 31200902), the Fundamental Research Funds for the Central Univ
ersities (GK201103005), the Specialized Research Fund for the Doctoral Program of
Higher Education from the Ministry of Education of China (20120202120009), the Scientific
Research Foundation for the Returned Overseas Chinese Scholars, State Education
Ministry, and the Natural Science Basic Research Plan in Shaanxi Province of China
(2014JM3064). '
article_number: e1191734
article_processing_charge: No
author:
- first_name: Zhijun
full_name: Liu, Zhijun
last_name: Liu
- first_name: 'Nan'
full_name: Yang, Nan
last_name: Yang
- first_name: Yanting
full_name: Lv, Yanting
last_name: Lv
- first_name: Lixia
full_name: Pan, Lixia
last_name: Pan
- first_name: Shuo
full_name: Lv, Shuo
last_name: Lv
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Guodong
full_name: Wang, Guodong
last_name: Wang
citation:
ama: Liu Z, Yang N, Lv Y, et al. The CLE gene family in Populus trichocarpa. Plant
Signaling & Behavior. 2016;11(6). doi:10.1080/15592324.2016.1191734
apa: Liu, Z., Yang, N., Lv, Y., Pan, L., Lv, S., Han, H., & Wang, G. (2016).
The CLE gene family in Populus trichocarpa. Plant Signaling & Behavior.
Taylor & Francis. https://doi.org/10.1080/15592324.2016.1191734
chicago: Liu, Zhijun, Nan Yang, Yanting Lv, Lixia Pan, Shuo Lv, Huibin Han, and
Guodong Wang. “The CLE Gene Family in Populus Trichocarpa.” Plant Signaling
& Behavior. Taylor & Francis, 2016. https://doi.org/10.1080/15592324.2016.1191734.
ieee: Z. Liu et al., “The CLE gene family in Populus trichocarpa,” Plant
Signaling & Behavior, vol. 11, no. 6. Taylor & Francis, 2016.
ista: Liu Z, Yang N, Lv Y, Pan L, Lv S, Han H, Wang G. 2016. The CLE gene family
in Populus trichocarpa. Plant Signaling & Behavior. 11(6), e1191734.
mla: Liu, Zhijun, et al. “The CLE Gene Family in Populus Trichocarpa.” Plant
Signaling & Behavior, vol. 11, no. 6, e1191734, Taylor & Francis,
2016, doi:10.1080/15592324.2016.1191734.
short: Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &
Behavior 11 (2016).
date_created: 2018-12-11T11:46:53Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2023-10-17T11:13:40Z
day: '02'
department:
- _id: JiFr
doi: 10.1080/15592324.2016.1191734
intvolume: ' 11'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/
month: '06'
oa: 1
oa_version: Submitted Version
publication: Plant Signaling & Behavior
publication_status: published
publisher: Taylor & Francis
publist_id: '7308'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The CLE gene family in Populus trichocarpa
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2016'
...
---
_id: '1241'
abstract:
- lang: eng
text: 'How likely is it that a population escapes extinction through adaptive evolution?
The answer to this question is of great relevance in conservation biology, where
we aim at species’ rescue and the maintenance of biodiversity, and in agriculture
and medicine, where we seek to hamper the emergence of pesticide or drug resistance.
By reshuffling the genome, recombination has two antagonistic effects on the probability
of evolutionary rescue: It generates and it breaks up favorable gene combinations.
Which of the two effects prevails depends on the fitness effects of mutations
and on the impact of stochasticity on the allele frequencies. In this article,
we analyze a mathematical model for rescue after a sudden environmental change
when adaptation is contingent on mutations at two loci. The analysis reveals a
complex nonlinear dependence of population survival on recombination. We moreover
find that, counterintuitively, a fast eradication of the wild type can promote
rescue in the presence of recombination. The model also shows that two-step rescue
is not unlikely to happen and can even be more likely than single-step rescue
(where adaptation relies on a single mutation), depending on the circumstances.'
acknowledgement: This work was made possible by a “For Women in Science” fellowship
(L’Oréal Österreich in cooperation with the Austrian Commission for the United Nations
Educational, Scientific, and Cultural Organization and the Austrian Academy of Sciences
with financial support from the Federal Ministry for Science and Research Austria)
and European Research Council grant 250152 (to Nick Barton).
article_processing_charge: No
author:
- first_name: Hildegard
full_name: Uecker, Hildegard
id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
last_name: Uecker
orcid: 0000-0001-9435-2813
- first_name: Joachim
full_name: Hermisson, Joachim
last_name: Hermisson
citation:
ama: Uecker H, Hermisson J. The role of recombination in evolutionary rescue. Genetics.
2016;202(2):721-732. doi:10.1534/genetics.115.180299
apa: Uecker, H., & Hermisson, J. (2016). The role of recombination in evolutionary
rescue. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.115.180299
chicago: Uecker, Hildegard, and Joachim Hermisson. “The Role of Recombination in
Evolutionary Rescue.” Genetics. Genetics Society of America, 2016. https://doi.org/10.1534/genetics.115.180299.
ieee: H. Uecker and J. Hermisson, “The role of recombination in evolutionary rescue,”
Genetics, vol. 202, no. 2. Genetics Society of America, pp. 721–732, 2016.
ista: Uecker H, Hermisson J. 2016. The role of recombination in evolutionary rescue.
Genetics. 202(2), 721–732.
mla: Uecker, Hildegard, and Joachim Hermisson. “The Role of Recombination in Evolutionary
Rescue.” Genetics, vol. 202, no. 2, Genetics Society of America, 2016,
pp. 721–32, doi:10.1534/genetics.115.180299.
short: H. Uecker, J. Hermisson, Genetics 202 (2016) 721–732.
das_tickbox: '1'
date_created: 2018-12-11T11:50:54Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2026-06-18T07:59:00Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1534/genetics.115.180299
ec_funded: 1
intvolume: ' 202'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://biorxiv.org/content/early/2015/07/06/022020.abstract
month: '02'
oa: 1
oa_version: Preprint
page: 721 - 732
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25B67606-B435-11E9-9278-68D0E5697425
name: L'OREAL Fellowship
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '6091'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The role of recombination in evolutionary rescue
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2016'
...
---
_id: '12196'
abstract:
- lang: eng
text: SNC1 (SUPPRESSOR OF NPR1, CONSTITUTIVE 1) is one of a suite of intracellular
Arabidopsis NOD-like receptor (NLR) proteins which, upon activation, result in
the induction of defense responses. However, the molecular mechanisms underlying
NLR activation and the subsequent provocation of immune responses are only partially
characterized. To identify negative regulators of NLR-mediated immunity, a forward
genetic screen was undertaken to search for enhancers of the dwarf, autoimmune
gain-of-function snc1 mutant. To avoid lethality resulting from severe dwarfism,
the screen was conducted using mos4 (modifier of snc1, 4) snc1 plants, which display
wild-type-like morphology and resistance. M2 progeny were screened for mutant,
snc1-enhancing (muse) mutants displaying a reversion to snc1-like phenotypes.
The muse9 mos4 snc1 triple mutant was found to exhibit dwarf morphology, elevated
expression of the pPR2-GUS defense marker reporter gene and enhanced resistance
to the oomycete pathogen Hyaloperonospora arabidopsidis Noco2. Via map-based cloning
and Illumina sequencing, it was determined that the muse9 mutation is in the gene
encoding the SWI/SNF chromatin remodeler SYD (SPLAYED), and was thus renamed syd-10.
The syd-10 single mutant has no observable alteration from wild-type-like resistance,
although the syd-4 T-DNA insertion allele displays enhanced resistance to the
bacterial pathogen Pseudomonas syringae pv. maculicola ES4326. Transcription of
SNC1 is increased in both syd-4 and syd-10. These data suggest that SYD plays
a subtle, specific role in the regulation of SNC1 expression and SNC1-mediated
immunity. SYD may work with other proteins at the chromatin level to repress SNC1
transcription; such regulation is important for fine-tuning the expression of
NLR-encoding genes to prevent unpropitious autoimmunity.
acknowledgement: "This work was supported by the National Sciences and Engineering
Research Council of Canada [Canada Graduate\r\nScholarship–Doctoral to K.J.; Discovery
Grant to X.L.]; the department of Botany at the University of f British Columbia\r\n[the
Dewar Cooper Memorial Fund to X.L.].The authors would like to thank Dr. Yuelin Zhang
and Ms. Yan Li for their assistance with next-generation sequencing, and Mr. Charles
Copeland for critical reading of the manuscript."
article_processing_charge: No
article_type: original
author:
- first_name: Kaeli C.M.
full_name: Johnson, Kaeli C.M.
last_name: Johnson
- first_name: Shitou
full_name: Xia, Shitou
last_name: Xia
- first_name: Xiaoqi
full_name: Feng, Xiaoqi
id: e0164712-22ee-11ed-b12a-d80fcdf35958
last_name: Feng
orcid: 0000-0002-4008-1234
- first_name: Xin
full_name: Li, Xin
last_name: Li
citation:
ama: Johnson KCM, Xia S, Feng X, Li X. The chromatin remodeler SPLAYED negatively
regulates SNC1-mediated immunity. Plant and Cell Physiology. 2015;56(8):1616-1623.
doi:10.1093/pcp/pcv087
apa: Johnson, K. C. M., Xia, S., Feng, X., & Li, X. (2015). The chromatin remodeler
SPLAYED negatively regulates SNC1-mediated immunity. Plant and Cell Physiology.
Oxford University Press. https://doi.org/10.1093/pcp/pcv087
chicago: Johnson, Kaeli C.M., Shitou Xia, Xiaoqi Feng, and Xin Li. “The Chromatin
Remodeler SPLAYED Negatively Regulates SNC1-Mediated Immunity.” Plant and Cell
Physiology. Oxford University Press, 2015. https://doi.org/10.1093/pcp/pcv087.
ieee: K. C. M. Johnson, S. Xia, X. Feng, and X. Li, “The chromatin remodeler SPLAYED
negatively regulates SNC1-mediated immunity,” Plant and Cell Physiology,
vol. 56, no. 8. Oxford University Press, pp. 1616–1623, 2015.
ista: Johnson KCM, Xia S, Feng X, Li X. 2015. The chromatin remodeler SPLAYED negatively
regulates SNC1-mediated immunity. Plant and Cell Physiology. 56(8), 1616–1623.
mla: Johnson, Kaeli C. M., et al. “The Chromatin Remodeler SPLAYED Negatively Regulates
SNC1-Mediated Immunity.” Plant and Cell Physiology, vol. 56, no. 8, Oxford
University Press, 2015, pp. 1616–23, doi:10.1093/pcp/pcv087.
short: K.C.M. Johnson, S. Xia, X. Feng, X. Li, Plant and Cell Physiology 56 (2015)
1616–1623.
date_created: 2023-01-16T09:20:22Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2023-05-08T11:03:23Z
department:
- _id: XiFe
doi: 10.1093/pcp/pcv087
extern: '1'
external_id:
pmid:
- '26063389'
intvolume: ' 56'
issue: '8'
keyword:
- Cell Biology
- Plant Science
- Physiology
- General Medicine
language:
- iso: eng
month: '08'
oa_version: None
page: 1616-1623
pmid: 1
publication: Plant and Cell Physiology
publication_identifier:
issn:
- 0032-0781
- 1471-9053
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2015'
...
---
_id: '12881'
acknowledgement: This work was supported by the DFG (SPP 1527) and the EU (FP7, REA
grant no 291734).
article_processing_charge: No
author:
- first_name: Georg S
full_name: Martius, Georg S
id: 3A276B68-F248-11E8-B48F-1D18A9856A87
last_name: Martius
- first_name: Eckehard
full_name: Olbrich, Eckehard
last_name: Olbrich
citation:
ama: 'Martius GS, Olbrich E. Quantifying self-organizing behavior of autonomous
robots. In: Proceedings of the 13th European Conference on Artificial Life.
MIT Press; 2015:78. doi:10.7551/978-0-262-33027-5-ch018'
apa: 'Martius, G. S., & Olbrich, E. (2015). Quantifying self-organizing behavior
of autonomous robots. In Proceedings of the 13th European Conference on Artificial
Life (p. 78). York, United Kingdom: MIT Press. https://doi.org/10.7551/978-0-262-33027-5-ch018'
chicago: Martius, Georg S, and Eckehard Olbrich. “Quantifying Self-Organizing Behavior
of Autonomous Robots.” In Proceedings of the 13th European Conference on Artificial
Life, 78. MIT Press, 2015. https://doi.org/10.7551/978-0-262-33027-5-ch018.
ieee: G. S. Martius and E. Olbrich, “Quantifying self-organizing behavior of autonomous
robots,” in Proceedings of the 13th European Conference on Artificial Life,
York, United Kingdom, 2015, p. 78.
ista: 'Martius GS, Olbrich E. 2015. Quantifying self-organizing behavior of autonomous
robots. Proceedings of the 13th European Conference on Artificial Life. ECAL:
European Conference on Artificial Life, 78.'
mla: Martius, Georg S., and Eckehard Olbrich. “Quantifying Self-Organizing Behavior
of Autonomous Robots.” Proceedings of the 13th European Conference on Artificial
Life, MIT Press, 2015, p. 78, doi:10.7551/978-0-262-33027-5-ch018.
short: G.S. Martius, E. Olbrich, in:, Proceedings of the 13th European Conference
on Artificial Life, MIT Press, 2015, p. 78.
conference:
end_date: 2015-07-24
location: York, United Kingdom
name: 'ECAL: European Conference on Artificial Life'
start_date: 2015-07-20
date_created: 2023-04-30T22:01:07Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2023-05-02T07:06:21Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
doi: 10.7551/978-0-262-33027-5-ch018
ec_funded: 1
file:
- access_level: open_access
checksum: 880eabe59c9df12f06a882aa1bc4e600
content_type: application/pdf
creator: dernst
date_created: 2023-05-02T07:02:59Z
date_updated: 2023-05-02T07:02:59Z
file_id: '12882'
file_name: 2015_ECAL_Martius.pdf
file_size: 1674241
relation: main_file
success: 1
file_date_updated: 2023-05-02T07:02:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '78'
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Proceedings of the 13th European Conference on Artificial Life
publication_identifier:
isbn:
- '9780262330275'
publication_status: published
publisher: MIT Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantifying self-organizing behavior of autonomous robots
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
year: '2015'
...
---
_id: '802'
abstract:
- lang: eng
text: Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at
the plasma membrane of various eukaryotes with the important exception of mammals.
In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man)
linked at position 2 of the inositol. However, several pathogenic fungi additionally
synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at
this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC
core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC,
which is the most abundant GIPC synthesized by this fungus. In this study, we
identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate
its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted
deletion of the gene encoding GntA in A. fumigatus resulted in complete absence
of zwitterionic GIPC; a phenotype that could be reverted by episomal expression
of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was
substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces
cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore
shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid
product resistant to saponification and to digestion by phosphatidylinositol-phospholipase
C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation
of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.
author:
- first_name: Jakob
full_name: Engel, Jakob
last_name: Engel
- first_name: Philipp S
full_name: Schmalhorst, Philipp S
id: 309D50DA-F248-11E8-B48F-1D18A9856A87
last_name: Schmalhorst
orcid: 0000-0002-5795-0133
- first_name: Anke
full_name: Kruger, Anke
last_name: Kruger
- first_name: Christina
full_name: Muller, Christina
last_name: Muller
- first_name: Falk
full_name: Buettner, Falk
last_name: Buettner
- first_name: Françoise
full_name: Routier, Françoise
last_name: Routier
citation:
ama: Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. Characterization
of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic
glycoinositolphosphoceramide biosynthesis. Glycobiology. 2015;25(12):1423-1430.
doi:10.1093/glycob/cwv059
apa: Engel, J., Schmalhorst, P. S., Kruger, A., Muller, C., Buettner, F., &
Routier, F. (2015). Characterization of an N-acetylglucosaminyltransferase involved
in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis.
Glycobiology. Oxford University Press. https://doi.org/10.1093/glycob/cwv059
chicago: Engel, Jakob, Philipp S Schmalhorst, Anke Kruger, Christina Muller, Falk
Buettner, and Françoise Routier. “Characterization of an N-Acetylglucosaminyltransferase
Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.”
Glycobiology. Oxford University Press, 2015. https://doi.org/10.1093/glycob/cwv059.
ieee: J. Engel, P. S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, and F. Routier,
“Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis,” Glycobiology,
vol. 25, no. 12. Oxford University Press, pp. 1423–1430, 2015.
ista: Engel J, Schmalhorst PS, Kruger A, Muller C, Buettner F, Routier F. 2015.
Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis. Glycobiology.
25(12), 1423–1430.
mla: Engel, Jakob, et al. “Characterization of an N-Acetylglucosaminyltransferase
Involved in Aspergillus Fumigatus Zwitterionic Glycoinositolphosphoceramide Biosynthesis.”
Glycobiology, vol. 25, no. 12, Oxford University Press, 2015, pp. 1423–30,
doi:10.1093/glycob/cwv059.
short: J. Engel, P.S. Schmalhorst, A. Kruger, C. Muller, F. Buettner, F. Routier,
Glycobiology 25 (2015) 1423–1430.
date_created: 2018-12-11T11:48:35Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2021-01-12T08:16:33Z
day: '01'
department:
- _id: CaHe
doi: 10.1093/glycob/cwv059
external_id:
pmid:
- '26306635'
intvolume: ' 25'
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
page: 1423 - 1430
pmid: 1
publication: Glycobiology
publication_status: published
publisher: Oxford University Press
publist_id: '6851'
quality_controlled: '1'
scopus_import: 1
status: public
title: Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus
fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2015'
...
---
_id: '8183'
abstract:
- lang: eng
text: "We study conditions under which a finite simplicial complex $K$ can be mapped
to $\\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding
is a map $f: K\\to \\mathbb R^d$ such that the images of any $r$\r\npairwise disjoint
simplices of $K$ do not have a common point. We show that if $r$ is not a prime
power and $d\\geq 2r+1$, then there is a counterexample to the topological Tverberg
conjecture, i.e., there is an almost $r$-embedding of\r\nthe $(d+1)(r-1)$-simplex
in $\\mathbb R^d$. This improves on previous constructions of counterexamples
(for $d\\geq 3r$) based on a series of papers by M. \\\"Ozaydin, M. Gromov, P.
Blagojevi\\'c, F. Frick, G. Ziegler, and the second and fourth present authors.
The counterexamples are obtained by proving the following algebraic criterion
in codimension 2: If $r\\ge3$ and if $K$ is a finite $2(r-1)$-complex then there
exists an almost $r$-embedding $K\\to \\mathbb R^{2r}$ if and only if there exists
a general position PL map $f:K\\to \\mathbb R^{2r}$ such that the algebraic intersection
number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero.
This result can be restated in terms of cohomological obstructions or equivariant
maps, and extends an analogous codimension 3 criterion by the second and fourth
authors. As another application we classify ornaments $f:S^3 \\sqcup S^3\\sqcup
S^3\\to \\mathbb R^5$ up to ornament\r\nconcordance. It follows from work of M.
Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is
false. We prove a lemma on singular higher-dimensional Borromean rings, yielding
an elementary proof of the counterexample."
acknowledgement: We would like to thank A. Klyachko, V. Krushkal, S. Melikhov, M.
Tancer, P. Teichner and anonymous referees for helpful discussions.
article_number: '1511.03501'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergey
full_name: Avvakumov, Sergey
id: 3827DAC8-F248-11E8-B48F-1D18A9856A87
last_name: Avvakumov
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: A.
full_name: Skopenkov, A.
last_name: Skopenkov
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv.
apa: Avvakumov, S., Mabillard, I., Skopenkov, A., & Wagner, U. (n.d.). Eliminating
higher-multiplicity intersections, III. Codimension 2. arXiv.
chicago: Avvakumov, Sergey, Isaac Mabillard, A. Skopenkov, and Uli Wagner. “Eliminating
Higher-Multiplicity Intersections, III. Codimension 2.” ArXiv, n.d.
ieee: S. Avvakumov, I. Mabillard, A. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity
intersections, III. Codimension 2,” arXiv. .
ista: Avvakumov S, Mabillard I, Skopenkov A, Wagner U. Eliminating higher-multiplicity
intersections, III. Codimension 2. arXiv, 1511.03501.
mla: Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III.
Codimension 2.” ArXiv, 1511.03501.
short: S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).
date_created: 2020-07-30T10:45:19Z
date_published: 2015-11-15T00:00:00Z
date_updated: 2023-09-07T13:12:17Z
day: '15'
department:
- _id: UlWa
external_id:
arxiv:
- '1511.03501'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.03501
month: '11'
oa: 1
oa_version: Preprint
publication: arXiv
publication_status: submitted
related_material:
record:
- id: '9308'
relation: later_version
status: public
- id: '10220'
relation: later_version
status: public
- id: '8156'
relation: dissertation_contains
status: public
status: public
title: Eliminating higher-multiplicity intersections, III. Codimension 2
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_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'
...