---
_id: '1831'
abstract:
- lang: eng
text: This paper introduces a theme issue presenting the latest developments in
research on the impacts of sociality on health and fitness. The articles that
follow cover research on societies ranging from insects to humans. Variation in
measures of fitness (i.e. survival and reproduction) has been linked to various
aspects of sociality in humans and animals alike, and variability in individual
health and condition has been recognized as a key mediator of these relationships.
Viewed from a broad evolutionary perspective, the evolutionary transitions from
a solitary lifestyle to group living have resulted in several new health-related
costs and benefits of sociality. Social transmission of parasites within groups
represents a major cost of group living, but some behavioural mechanisms, such
as grooming, have evolved repeatedly to reduce this cost. Group living also has
created novel costs in terms of altered susceptibility to infectious and non-infectious
disease as a result of the unavoidable physiological consequences of social competition
and integration, which are partly alleviated by social buffering in some vertebrates.
Here, we define the relevant aspects of sociality, summarize their health-related
costs and benefits, and discuss possible fitness measures in different study systems.
Given the pervasive effects of social factors on health and fitness, we propose
a synthesis of existing conceptual approaches in disease ecology, ecological immunology
and behavioural neurosciences by adding sociality as a key factor, with the goal
to generate a broader framework for organismal integration of health-related research.
acknowledgement: We thank the German Research Foundation (DFG), the Ministry of Science
and Culture of Lower-Saxony (MWK Hannover) and the German Primate Centre (DPZ) for
their support of the 9. Göttinger Freilandtage in 2013, a conference at which most
contributions to this issue were first presented, the referees of the contributions
to this issue for their constructive comments, Meggan Craft for comments, and Helen
Eaton for her support in producing this theme issue.
article_number: '20140116'
author:
- first_name: Peter
full_name: Kappeler, Peter
last_name: Kappeler
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Charles
full_name: Nunn, Charles
last_name: Nunn
citation:
ama: 'Kappeler P, Cremer S, Nunn C. Sociality and health: Impacts of sociality on
disease susceptibility and transmission in animal and human societies. Philosophical
Transactions of the Royal Society of London Series B, Biological Sciences.
2015;370(1669). doi:10.1098/rstb.2014.0116'
apa: 'Kappeler, P., Cremer, S., & Nunn, C. (2015). Sociality and health: Impacts
of sociality on disease susceptibility and transmission in animal and human societies.
Philosophical Transactions of the Royal Society of London. Series B, Biological
Sciences. Royal Society. https://doi.org/10.1098/rstb.2014.0116'
chicago: 'Kappeler, Peter, Sylvia Cremer, and Charles Nunn. “Sociality and Health:
Impacts of Sociality on Disease Susceptibility and Transmission in Animal and
Human Societies.” Philosophical Transactions of the Royal Society of London.
Series B, Biological Sciences. Royal Society, 2015. https://doi.org/10.1098/rstb.2014.0116.'
ieee: 'P. Kappeler, S. Cremer, and C. Nunn, “Sociality and health: Impacts of sociality
on disease susceptibility and transmission in animal and human societies,” Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences,
vol. 370, no. 1669. Royal Society, 2015.'
ista: 'Kappeler P, Cremer S, Nunn C. 2015. Sociality and health: Impacts of sociality
on disease susceptibility and transmission in animal and human societies. Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences. 370(1669),
20140116.'
mla: 'Kappeler, Peter, et al. “Sociality and Health: Impacts of Sociality on Disease
Susceptibility and Transmission in Animal and Human Societies.” Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences,
vol. 370, no. 1669, 20140116, Royal Society, 2015, doi:10.1098/rstb.2014.0116.'
short: P. Kappeler, S. Cremer, C. Nunn, Philosophical Transactions of the Royal
Society of London. Series B, Biological Sciences 370 (2015).
date_created: 2018-12-11T11:54:15Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:29Z
day: '01'
department:
- _id: SyCr
doi: 10.1098/rstb.2014.0116
external_id:
pmid:
- '25870402'
intvolume: ' 370'
issue: '1669'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4410382/
month: '05'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Philosophical Transactions of the Royal Society of London. Series B,
Biological Sciences
publication_status: published
publisher: Royal Society
publist_id: '5272'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Sociality and health: Impacts of sociality on disease susceptibility and transmission
in animal and human societies'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 370
year: '2015'
...
---
_id: '1832'
abstract:
- lang: eng
text: 'Linearizability of concurrent data structures is usually proved by monolithic
simulation arguments relying on the identification of the so-called linearization
points. Regrettably, such proofs, whether manual or automatic, are often complicated
and scale poorly to advanced non-blocking concurrency patterns, such as helping
and optimistic updates. In response, we propose a more modular way of checking
linearizability of concurrent queue algorithms that does not involve identifying
linearization points. We reduce the task of proving linearizability with respect
to the queue specification to establishing four basic properties, each of which
can be proved independently by simpler arguments. As a demonstration of our approach,
we verify the Herlihy and Wing queue, an algorithm that is challenging to verify
by a simulation proof. '
article_number: '20'
article_processing_charge: No
article_type: original
author:
- first_name: Soham
full_name: Chakraborty, Soham
last_name: Chakraborty
- 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: Ali
full_name: Sezgin, Ali
last_name: Sezgin
- first_name: Viktor
full_name: Vafeiadis, Viktor
last_name: Vafeiadis
citation:
ama: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability
proofs. Logical Methods in Computer Science. 2015;11(1). doi:10.2168/LMCS-11(1:20)2015
apa: Chakraborty, S., Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2015).
Aspect-oriented linearizability proofs. Logical Methods in Computer Science.
International Federation of Computational Logic. https://doi.org/10.2168/LMCS-11(1:20)2015
chicago: Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis.
“Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science.
International Federation of Computational Logic, 2015. https://doi.org/10.2168/LMCS-11(1:20)2015.
ieee: S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented
linearizability proofs,” Logical Methods in Computer Science, vol. 11,
no. 1. International Federation of Computational Logic, 2015.
ista: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented
linearizability proofs. Logical Methods in Computer Science. 11(1), 20.
mla: Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” Logical
Methods in Computer Science, vol. 11, no. 1, 20, International Federation
of Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015.
short: S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods
in Computer Science 11 (2015).
date_created: 2018-12-11T11:54:15Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2023-02-23T10:38:13Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.2168/LMCS-11(1:20)2015
ec_funded: 1
file:
- access_level: open_access
checksum: 7370e164d0a731f442424a92669efc34
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:27Z
date_updated: 2020-07-14T12:45:17Z
file_id: '4881'
file_name: IST-2015-390-v1+1_1502.07639.pdf
file_size: 380203
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '5271'
pubrep_id: '390'
quality_controlled: '1'
related_material:
record:
- id: '2328'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Aspect-oriented linearizability proofs
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2015'
...
---
_id: '1834'
abstract:
- lang: eng
text: Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal
neurogenesis and neurocognitive functions, and most of them showed impairment
at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane
on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats
at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours.
Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology
recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear
discrimination learning tests were performed to determine the influence on spatial
learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted
hippocampal neurogenesis and increased the survival of newborn cells and the proportion
of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated
rats performed better during the training days of the Morris water maze test and
in contextual-fear discrimination learning test. These results suggest that a
subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal
rats and facilitates their performance in dentate gyrus-dependent learning tasks.
article_processing_charge: No
article_type: original
author:
- first_name: Chong
full_name: Chen, Chong
id: 3DFD581A-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Chao
full_name: Wang, Chao
last_name: Wang
- first_name: Xuan
full_name: Zhao, Xuan
last_name: Zhao
- first_name: Tao
full_name: Zhou, Tao
last_name: Zhou
- first_name: Dao
full_name: Xu, Dao
last_name: Xu
- first_name: Zhi
full_name: Wang, Zhi
last_name: Wang
- first_name: Ying
full_name: Wang, Ying
last_name: Wang
citation:
ama: Chen C, Wang C, Zhao X, et al. Low-dose sevoflurane promoteshippocampal neurogenesis
and facilitates the development of dentate gyrus-dependent learning in neonatal
rats. ASN Neuro. 2015;7(2). doi:10.1177/1759091415575845
apa: Chen, C., Wang, C., Zhao, X., Zhou, T., Xu, D., Wang, Z., & Wang, Y. (2015).
Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development
of dentate gyrus-dependent learning in neonatal rats. ASN Neuro. SAGE Publications.
https://doi.org/10.1177/1759091415575845
chicago: Chen, Chong, Chao Wang, Xuan Zhao, Tao Zhou, Dao Xu, Zhi Wang, and Ying
Wang. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis and Facilitates the
Development of Dentate Gyrus-Dependent Learning in Neonatal Rats.” ASN Neuro.
SAGE Publications, 2015. https://doi.org/10.1177/1759091415575845.
ieee: C. Chen et al., “Low-dose sevoflurane promoteshippocampal neurogenesis
and facilitates the development of dentate gyrus-dependent learning in neonatal
rats,” ASN Neuro, vol. 7, no. 2. SAGE Publications, 2015.
ista: Chen C, Wang C, Zhao X, Zhou T, Xu D, Wang Z, Wang Y. 2015. Low-dose sevoflurane
promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent
learning in neonatal rats. ASN Neuro. 7(2).
mla: Chen, Chong, et al. “Low-Dose Sevoflurane Promoteshippocampal Neurogenesis
and Facilitates the Development of Dentate Gyrus-Dependent Learning in Neonatal
Rats.” ASN Neuro, vol. 7, no. 2, SAGE Publications, 2015, doi:10.1177/1759091415575845.
short: C. Chen, C. Wang, X. Zhao, T. Zhou, D. Xu, Z. Wang, Y. Wang, ASN Neuro 7
(2015).
date_created: 2018-12-11T11:54:16Z
date_published: 2015-04-13T00:00:00Z
date_updated: 2023-10-18T06:47:30Z
day: '13'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1177/1759091415575845
file:
- access_level: open_access
checksum: 53e16bd3fc2ae2c0d7de9164626c37aa
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:08Z
date_updated: 2020-07-14T12:45:18Z
file_id: '5057'
file_name: IST-2016-456-v1+1_ASN_Neuro-2015-Chen-.pdf
file_size: 1146814
relation: main_file
file_date_updated: 2020-07-14T12:45:18Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/3.0/
month: '04'
oa: 1
oa_version: Published Version
publication: ASN Neuro
publication_status: published
publisher: SAGE Publications
publist_id: '5269'
pubrep_id: '456'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development
of dentate gyrus-dependent learning in neonatal rats
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/3.0/legalcode
name: Creative Commons Attribution 3.0 Unported (CC BY 3.0)
short: CC BY (3.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2015'
...
---
_id: '1835'
abstract:
- lang: eng
text: The behaviour of gene regulatory networks (GRNs) is typically analysed using
simulation-based statistical testing-like methods. In this paper, we demonstrate
that we can replace this approach by a formal verification-like method that gives
higher assurance and scalability. We focus on Wagner’s weighted GRN model with
varying weights, which is used in evolutionary biology. In the model, weight parameters
represent the gene interaction strength that may change due to genetic mutations.
For a property of interest, we synthesise the constraints over the parameter space
that represent the set of GRNs satisfying the property. We experimentally show
that our parameter synthesis procedure computes the mutational robustness of GRNs
–an important problem of interest in evolutionary biology– more efficiently than
the classical simulation method. We specify the property in linear temporal logics.
We employ symbolic bounded model checking and SMT solving to compute the space
of GRNs that satisfy the property, which amounts to synthesizing a set of linear
constraints on the weights.
acknowledgement: "SNSF Early Postdoc.Mobility Fellowship, the grant number P2EZP2
148797.\r\n"
alternative_title:
- LNCS
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- 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: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. Model checking
gene regulatory networks. 2015;9035:469-483. doi:10.1007/978-3-662-46681-0_47
apa: 'Giacobbe, M., Guet, C. C., Gupta, A., Henzinger, T. A., Paixao, T., &
Petrov, T. (2015). Model checking gene regulatory networks. Presented at the TACAS:
Tools and Algorithms for the Construction and Analysis of Systems, London, United
Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_47'
chicago: Giacobbe, Mirco, Calin C Guet, Ashutosh Gupta, Thomas A Henzinger, Tiago
Paixao, and Tatjana Petrov. “Model Checking Gene Regulatory Networks.” Lecture
Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_47.
ieee: M. Giacobbe, C. C. Guet, A. Gupta, T. A. Henzinger, T. Paixao, and T. Petrov,
“Model checking gene regulatory networks,” vol. 9035. Springer, pp. 469–483, 2015.
ista: Giacobbe M, Guet CC, Gupta A, Henzinger TA, Paixao T, Petrov T. 2015. Model
checking gene regulatory networks. 9035, 469–483.
mla: Giacobbe, Mirco, et al. Model Checking Gene Regulatory Networks. Vol.
9035, Springer, 2015, pp. 469–83, doi:10.1007/978-3-662-46681-0_47.
short: M. Giacobbe, C.C. Guet, A. Gupta, T.A. Henzinger, T. Paixao, T. Petrov, 9035
(2015) 469–483.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:16Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2025-05-28T11:57:04Z
day: '01'
department:
- _id: ToHe
- _id: CaGu
- _id: NiBa
doi: 10.1007/978-3-662-46681-0_47
ec_funded: 1
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.7704
month: '04'
oa: 1
oa_version: Preprint
page: 469 - 483
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: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5267'
quality_controlled: '1'
related_material:
record:
- id: '1351'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Model checking gene regulatory networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '1836'
abstract:
- lang: eng
text: In the standard framework for worst-case execution time (WCET) analysis of
programs, the main data structure is a single instance of integer linear programming
(ILP) that represents the whole program. The instance of this NP-hard problem
must be solved to find an estimate forWCET, and it must be refined if the estimate
is not tight.We propose a new framework for WCET analysis, based on abstract segment
trees (ASTs) as the main data structure. The ASTs have two advantages. First,
they allow computing WCET by solving a number of independent small ILP instances.
Second, ASTs store more expressive constraints, thus enabling a more efficient
and precise refinement procedure. In order to realize our framework algorithmically,
we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based
counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework
to obtain parametric estimates of WCET. We experimentally evaluate our approach
on a set of examples from WCET benchmark suites and linear-algebra packages. We
show that our analysis, with comparable effort, provides WCET estimates that in
many cases significantly improve those computed by existing tools.
alternative_title:
- LNCS
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- 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: Laura
full_name: Kovács, Laura
last_name: Kovács
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Jakob
full_name: Zwirchmayr, Jakob
last_name: Zwirchmayr
citation:
ama: Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. Segment abstraction
for worst-case execution time analysis. 2015;9032:105-131. doi:10.1007/978-3-662-46669-8_5
apa: 'Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., & Zwirchmayr,
J. (2015). Segment abstraction for worst-case execution time analysis. Presented
at the ESOP: European Symposium on Programming, London, United Kingdom: Springer.
https://doi.org/10.1007/978-3-662-46669-8_5'
chicago: Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and
Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.”
Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46669-8_5.
ieee: P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr,
“Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer,
pp. 105–131, 2015.
ista: Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment
abstraction for worst-case execution time analysis. 9032, 105–131.
mla: Cerny, Pavol, et al. Segment Abstraction for Worst-Case Execution Time Analysis.
Vol. 9032, Springer, 2015, pp. 105–31, doi:10.1007/978-3-662-46669-8_5.
short: P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032
(2015) 105–131.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'ESOP: European Symposium on Programming'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:16Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2020-08-11T10:09:32Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-662-46669-8_5
ec_funded: 1
intvolume: ' 9032'
language:
- iso: eng
month: '04'
oa_version: None
page: 105 - 131
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
publication_status: published
publisher: Springer
publist_id: '5266'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Segment abstraction for worst-case execution time analysis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9032
year: '2015'
...
---
_id: '1837'
abstract:
- lang: eng
text: 'Transition to turbulence in straight pipes occurs in spite of the linear
stability of the laminar Hagen-Poiseuille flow if both the amplitude of flow perturbations
and the Reynolds number Re exceed a minimum threshold (subcritical transition).
As the pipe curvature increases, centrifugal effects become important, modifying
the basic flow as well as the most unstable linear modes. If the curvature (tube-to-coiling
diameter d/D) is sufficiently large, a Hopf bifurcation (supercritical instability)
is encountered before turbulence can be excited (subcritical instability). We
trace the instability thresholds in the Re - d/D parameter space in the range
0.01 ≤ d/D\ ≤ 0.1 by means of laser-Doppler velocimetry and determine the point
where the subcritical and supercritical instabilities meet. Two different experimental
set-ups are used: a closed system where the pipe forms an axisymmetric torus and
an open system employing a helical pipe. Implications for the measurement of friction
factors in curved pipes are discussed.'
article_number: R3
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: P
full_name: Braunshier, P
last_name: Braunshier
- first_name: M
full_name: Schwegel, M
last_name: Schwegel
- first_name: Hendrik
full_name: Kuhlmann, Hendrik
last_name: Kuhlmann
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. Subcritical versus supercritical
transition to turbulence in curved pipes. Journal of Fluid Mechanics. 2015;770(5).
doi:10.1017/jfm.2015.184
apa: Kühnen, J., Braunshier, P., Schwegel, M., Kuhlmann, H., & Hof, B. (2015).
Subcritical versus supercritical transition to turbulence in curved pipes. Journal
of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2015.184
chicago: Kühnen, Jakob, P Braunshier, M Schwegel, Hendrik Kuhlmann, and Björn Hof.
“Subcritical versus Supercritical Transition to Turbulence in Curved Pipes.” Journal
of Fluid Mechanics. Cambridge University Press, 2015. https://doi.org/10.1017/jfm.2015.184.
ieee: J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, and B. Hof, “Subcritical
versus supercritical transition to turbulence in curved pipes,” Journal of
Fluid Mechanics, vol. 770, no. 5. Cambridge University Press, 2015.
ista: Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. 2015. Subcritical versus
supercritical transition to turbulence in curved pipes. Journal of Fluid Mechanics.
770(5), R3.
mla: Kühnen, Jakob, et al. “Subcritical versus Supercritical Transition to Turbulence
in Curved Pipes.” Journal of Fluid Mechanics, vol. 770, no. 5, R3, Cambridge
University Press, 2015, doi:10.1017/jfm.2015.184.
short: J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, B. Hof, Journal of Fluid
Mechanics 770 (2015).
date_created: 2018-12-11T11:54:17Z
date_published: 2015-04-08T00:00:00Z
date_updated: 2021-01-12T06:53:31Z
day: '08'
department:
- _id: BjHo
doi: 10.1017/jfm.2015.184
ec_funded: 1
external_id:
arxiv:
- '1508.06559'
intvolume: ' 770'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.06559
month: '04'
oa: 1
oa_version: Preprint
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '5265'
quality_controlled: '1'
scopus_import: 1
status: public
title: Subcritical versus supercritical transition to turbulence in curved pipes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 770
year: '2015'
...
---
_id: '1838'
abstract:
- lang: eng
text: Synthesis of program parts is particularly useful for concurrent systems.
However, most approaches do not support common design tasks, like modifying a
single process without having to re-synthesize or verify the whole system. Assume-guarantee
synthesis (AGS) provides robustness against modifications of system parts, but
thus far has been limited to the perfect information setting. This means that
local variables cannot be hidden from other processes, which renders synthesis
results cumbersome or even impossible to realize.We resolve this shortcoming by
defining AGS under partial information. We analyze the complexity and decidability
in different settings, showing that the problem has a high worstcase complexity
and is undecidable in many interesting cases. Based on these observations, we
present a pragmatic algorithm based on bounded synthesis, and demonstrate its
practical applicability on several examples.
acknowledgement: 'This work was supported by the Austrian Science Fund (FWF) through
the research network RiSE (S11406-N23, S11407-N23) and grant nr. P23499-N23, by
the European Commission through an ERC Start grant (279307: Graph Games) and project
STANCE (317753), as well as by the German Research Foundation (DFG) through SFB/TR
14 AVACS and project ASDPS(JA 2357/2-1).'
alternative_title:
- LNCS
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Swen
full_name: Jacobs, Swen
last_name: Jacobs
- first_name: Robert
full_name: Könighofer, Robert
last_name: Könighofer
citation:
ama: 'Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis
for concurrent reactive programs with partial information. In: Vol 9035. Springer;
2015:517-532. doi:10.1007/978-3-662-46681-0_50'
apa: 'Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee
synthesis for concurrent reactive programs with partial information (Vol. 9035,
pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer.
“Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,”
9035:517–32. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_50.
ieee: 'R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee
synthesis for concurrent reactive programs with partial information,” presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
London, United Kingdom, 2015, vol. 9035, pp. 517–532.'
ista: 'Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis
for concurrent reactive programs with partial information. TACAS: Tools and Algorithms
for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.'
mla: Bloem, Roderick, et al. Assume-Guarantee Synthesis for Concurrent Reactive
Programs with Partial Information. Vol. 9035, Springer, 2015, pp. 517–32,
doi:10.1007/978-3-662-46681-0_50.
short: R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp.
517–532.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:17Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:53:32Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-46681-0_50
ec_funded: 1
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1411.4604
month: '01'
oa: 1
oa_version: Preprint
page: 517 - 532
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '5264'
scopus_import: 1
status: public
title: Assume-guarantee synthesis for concurrent reactive programs with partial information
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '1839'
abstract:
- lang: eng
text: We present MultiGain, a tool to synthesize strategies for Markov decision
processes (MDPs) with multiple mean-payoff objectives. Our models are described
in PRISM, and our tool uses the existing interface and simulator of PRISM. Our
tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives,
and also provides features such as (i) generating strategies and exploring them
for simulation, and checking them with respect to other properties; and (ii) generating
an approximate Pareto curve for two mean-payoff objectives. In addition, we present
a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives
under memoryless strategies.
alternative_title:
- LNCS
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
citation:
ama: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. Multigain: A controller synthesis
tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. doi:10.1007/978-3-662-46681-0_12'
apa: 'Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain:
A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_12'
chicago: 'Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera.
“Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.”
Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_12.'
ieee: 'T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller
synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer,
pp. 181–187, 2015.'
ista: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller
synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.'
mla: 'Brázdil, Tomáš, et al. Multigain: A Controller Synthesis Tool for MDPs
with Multiple Mean-Payoff Objectives. Vol. 9035, Springer, 2015, pp. 181–87,
doi:10.1007/978-3-662-46681-0_12.'
short: T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:18Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2020-01-21T13:18:52Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-46681-0_12
ec_funded: 1
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.03093
month: '01'
oa: 1
oa_version: Preprint
page: 181 - 187
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'
publication_status: published
publisher: Springer
publist_id: '5263'
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: 'Multigain: A controller synthesis tool for MDPs with multiple mean-payoff
objectives'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '1840'
abstract:
- lang: eng
text: In this paper, we present a method for reducing a regular, discrete-time Markov
chain (DTMC) to another DTMC with a given, typically much smaller number of states.
The cost of reduction is defined as the Kullback-Leibler divergence rate between
a projection of the original process through a partition function and a DTMC on
the correspondingly partitioned state space. Finding the reduced model with minimal
cost is computationally expensive, as it requires an exhaustive search among all
state space partitions, and an exact evaluation of the reduction cost for each
candidate partition. Our approach deals with the latter problem by minimizing
an upper bound on the reduction cost instead of minimizing the exact cost. The
proposed upper bound is easy to compute and it is tight if the original chain
is lumpable with respect to the partition. Then, we express the problem in the
form of information bottleneck optimization, and propose using the agglomerative
information bottleneck algorithm for searching a suboptimal partition greedily,
rather than exhaustively. The theory is illustrated with examples and one application
scenario in the context of modeling bio-molecular interactions.
acknowledgement: "This work was supported by the Austrian Research Association under
Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2
128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by
a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n"
author:
- first_name: Bernhard
full_name: Geiger, Bernhard
last_name: Geiger
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
- first_name: Gernot
full_name: Kubin, Gernot
last_name: Kubin
- first_name: Heinz
full_name: Koeppl, Heinz
last_name: Koeppl
citation:
ama: Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation
via information bottleneck. IEEE Transactions on Automatic Control. 2015;60(4):1010-1022.
doi:10.1109/TAC.2014.2364971
apa: Geiger, B., Petrov, T., Kubin, G., & Koeppl, H. (2015). Optimal Kullback-Leibler
aggregation via information bottleneck. IEEE Transactions on Automatic Control.
IEEE. https://doi.org/10.1109/TAC.2014.2364971
chicago: Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal
Kullback-Leibler Aggregation via Information Bottleneck.” IEEE Transactions
on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2014.2364971.
ieee: B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation
via information bottleneck,” IEEE Transactions on Automatic Control, vol.
60, no. 4. IEEE, pp. 1010–1022, 2015.
ista: Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation
via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.
mla: Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information
Bottleneck.” IEEE Transactions on Automatic Control, vol. 60, no. 4, IEEE,
2015, pp. 1010–22, doi:10.1109/TAC.2014.2364971.
short: B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic
Control 60 (2015) 1010–1022.
date_created: 2018-12-11T11:54:18Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:53:33Z
day: '01'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1109/TAC.2014.2364971
intvolume: ' 60'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1304.6603
month: '04'
oa: 1
oa_version: Preprint
page: 1010 - 1022
publication: IEEE Transactions on Automatic Control
publication_identifier:
issn:
- 0018-9286
publication_status: published
publisher: IEEE
publist_id: '5262'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimal Kullback-Leibler aggregation via information bottleneck
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2015'
...
---
_id: '1841'
abstract:
- lang: eng
text: We propose a new family of message passing techniques for MAP estimation in
graphical models which we call Sequential Reweighted Message Passing (SRMP). Special
cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster
Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation
is simpler than the original derivation of TRW-S, and does not involve a decomposition
into trees. This allows easy generalizations. The new family of algorithms can
be viewed as a generalization of TRW-S from pairwise to higher-order graphical
models. We test SRMP on several real-world problems with promising results.
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465
apa: Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465
chicago: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE
Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/TPAMI.2014.2363465.
ieee: V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930,
2015.
ista: Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 37(5), 919–930.
mla: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015,
pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
short: V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence
37 (2015) 919–930.
date_created: 2018-12-11T11:54:18Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:33Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2014.2363465
ec_funded: 1
intvolume: ' 37'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5655
month: '05'
oa: 1
oa_version: Preprint
page: 919 - 930
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '5261'
quality_controlled: '1'
scopus_import: 1
status: public
title: A new look at reweighted message passing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2015'
...
---
_id: '1845'
abstract:
- lang: eng
text: Based on extrapolation from excitatory synapses, it is often assumed that
depletion of the releasable pool of synaptic vesicles is the main factor underlying
depression at inhibitory synapses. In this issue of Neuron, using subcellular
patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba
(2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes
in presynaptic action potential waveform substantially contribute to synaptic
depression. Based on extrapolation from excitatory synapses, it is often assumed
that depletion of the releasable pool of synaptic vesicles is the main factor
underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular
patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba
(2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes
in presynaptic action potential waveform substantially contribute to synaptic
depression.
article_processing_charge: No
author:
- first_name: David H
full_name: Vandael, David H
id: 3AE48E0A-F248-11E8-B48F-1D18A9856A87
last_name: Vandael
orcid: 0000-0001-7577-1676
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Vandael DH, Espinoza Martinez C, Jonas PM. Excitement about inhibitory presynaptic
terminals. Neuron. 2015;85(6):1149-1151. doi:10.1016/j.neuron.2015.03.006
apa: Vandael, D. H., Espinoza Martinez, C., & Jonas, P. M. (2015). Excitement
about inhibitory presynaptic terminals. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2015.03.006
chicago: Vandael, David H, Claudia Espinoza Martinez, and Peter M Jonas. “Excitement
about Inhibitory Presynaptic Terminals.” Neuron. Elsevier, 2015. https://doi.org/10.1016/j.neuron.2015.03.006.
ieee: D. H. Vandael, C. Espinoza Martinez, and P. M. Jonas, “Excitement about inhibitory
presynaptic terminals,” Neuron, vol. 85, no. 6. Elsevier, pp. 1149–1151,
2015.
ista: Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory
presynaptic terminals. Neuron. 85(6), 1149–1151.
mla: Vandael, David H., et al. “Excitement about Inhibitory Presynaptic Terminals.”
Neuron, vol. 85, no. 6, Elsevier, 2015, pp. 1149–51, doi:10.1016/j.neuron.2015.03.006.
short: D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151.
date_created: 2018-12-11T11:54:19Z
date_published: 2015-03-18T00:00:00Z
date_updated: 2021-10-08T09:07:34Z
day: '18'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2015.03.006
file:
- access_level: open_access
checksum: d1808550e376a0eca2a950fda017cfa6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5192'
file_name: IST-2017-822-v1+1_Perspective_Fig__Final.pdf
file_size: 411832
relation: main_file
- access_level: open_access
checksum: a279f4ae61e6c8f33d68f69a0d02097d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5193'
file_name: IST-2017-822-v1+2_Perspective_Final2.pdf
file_size: 100769
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 85'
issue: '6'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 1149 - 1151
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '5256'
pubrep_id: '822'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Excitement about inhibitory presynaptic terminals
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: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 85
year: '2015'
...
---
_id: '1846'
abstract:
- lang: eng
text: Modal transition systems (MTS) is a well-studied specification formalism of
reactive systems supporting a step-wise refinement methodology. Despite its many
advantages, the formalism as well as its currently known extensions are incapable
of expressing some practically needed aspects in the refinement process like exclusive,
conditional and persistent choices. We introduce a new model called parametric
modal transition systems (PMTS) together with a general modal refinement notion
that overcomes many of the limitations. We investigate the computational complexity
of modal and thorough refinement checking on PMTS and its subclasses and provide
a direct encoding of the modal refinement problem into quantified Boolean formulae,
allowing us to employ state-of-the-art QBF solvers for modal refinement checking.
The experiments we report on show that the feasibility of refinement checking
is more influenced by the degree of nondeterminism rather than by the syntactic
restrictions on the types of formulae allowed in the description of the PMTS.
article_processing_charge: No
article_type: original
author:
- first_name: Nikola
full_name: Beneš, Nikola
last_name: Beneš
- 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: Mikael
full_name: Möller, Mikael
last_name: Möller
- first_name: Salomon
full_name: Sickert, Salomon
last_name: Sickert
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking
on parametric modal transition systems. Acta Informatica. 2015;52(2-3):269-297.
doi:10.1007/s00236-015-0215-4
apa: Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., & Srba,
J. (2015). Refinement checking on parametric modal transition systems. Acta
Informatica. Springer. https://doi.org/10.1007/s00236-015-0215-4
chicago: Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert,
and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” Acta
Informatica. Springer, 2015. https://doi.org/10.1007/s00236-015-0215-4.
ieee: N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement
checking on parametric modal transition systems,” Acta Informatica, vol.
52, no. 2–3. Springer, pp. 269–297, 2015.
ista: Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement
checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.
mla: Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.”
Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4.
short: N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica
52 (2015) 269–297.
date_created: 2018-12-11T11:54:20Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:53:35Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/s00236-015-0215-4
ec_funded: 1
file:
- access_level: open_access
checksum: fb4037ddc4fc05f33080dd3547ede350
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:57:44Z
date_updated: 2020-07-14T12:45:19Z
file_id: '7854'
file_name: 2015_ActaInfo_Benes.pdf
file_size: 488482
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 52'
issue: 2-3
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 269 - 297
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
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '5255'
quality_controlled: '1'
scopus_import: 1
status: public
title: Refinement checking on parametric modal transition systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2015'
...
---
_id: '1847'
acknowledgement: This work was supported by the European Research Council (project
ERC-2011-StG-20101109-PSDP), European Social Fund (CZ.1.07/2.3.00/20.0043), and
the Czech Science Foundation GAČR (GA13-40637S).
author:
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Grones P, Friml J. ABP1: Finally docking. Molecular Plant. 2015;8(3):356-358.
doi:10.1016/j.molp.2014.12.013'
apa: 'Grones, P., & Friml, J. (2015). ABP1: Finally docking. Molecular Plant.
Elsevier. https://doi.org/10.1016/j.molp.2014.12.013'
chicago: 'Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant.
Elsevier, 2015. https://doi.org/10.1016/j.molp.2014.12.013.'
ieee: 'P. Grones and J. Friml, “ABP1: Finally docking,” Molecular Plant,
vol. 8, no. 3. Elsevier, pp. 356–358, 2015.'
ista: 'Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.'
mla: 'Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant,
vol. 8, no. 3, Elsevier, 2015, pp. 356–58, doi:10.1016/j.molp.2014.12.013.'
short: P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.
date_created: 2018-12-11T11:54:20Z
date_published: 2015-03-02T00:00:00Z
date_updated: 2021-01-12T06:53:35Z
day: '02'
department:
- _id: JiFr
doi: 10.1016/j.molp.2014.12.013
intvolume: ' 8'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 356 - 358
publication: Molecular Plant
publication_status: published
publisher: Elsevier
publist_id: '5254'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'ABP1: Finally docking'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2015'
...
---
_id: '1849'
abstract:
- lang: eng
text: 'Cell polarity is a fundamental property of pro- and eukaryotic cells. It
is necessary for coordination of cell division, cell morphogenesis and signaling
processes. How polarity is generated and maintained is a complex issue governed
by interconnected feed-back regulations between small GTPase signaling and membrane
tension-based signaling that controls membrane trafficking, and cytoskeleton organization
and dynamics. Here, we will review the potential role for calcium as a crucial
signal that connects and coordinates the respective processes during polarization
processes in plants. This article is part of a Special Issue entitled: 13th European
Symposium on Calcium.'
acknowledgement: The contributing authors were supported by the Ghent University Special
Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33
and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP,
to J.F.), and the Research Foundation Flanders (to S.V.).
author:
- first_name: Ellie
full_name: Himschoot, Ellie
last_name: Himschoot
- first_name: Tom
full_name: Beeckman, Tom
last_name: Beeckman
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
citation:
ama: Himschoot E, Beeckman T, Friml J, Vanneste S. Calcium is an organizer of cell
polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research.
2015;1853(9):2168-2172. doi:10.1016/j.bbamcr.2015.02.017
apa: Himschoot, E., Beeckman, T., Friml, J., & Vanneste, S. (2015). Calcium
is an organizer of cell polarity in plants. Biochimica et Biophysica Acta -
Molecular Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2015.02.017
chicago: Himschoot, Ellie, Tom Beeckman, Jiří Friml, and Steffen Vanneste. “Calcium
Is an Organizer of Cell Polarity in Plants.” Biochimica et Biophysica Acta
- Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2015.02.017.
ieee: E. Himschoot, T. Beeckman, J. Friml, and S. Vanneste, “Calcium is an organizer
of cell polarity in plants,” Biochimica et Biophysica Acta - Molecular Cell
Research, vol. 1853, no. 9. Elsevier, pp. 2168–2172, 2015.
ista: Himschoot E, Beeckman T, Friml J, Vanneste S. 2015. Calcium is an organizer
of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research.
1853(9), 2168–2172.
mla: Himschoot, Ellie, et al. “Calcium Is an Organizer of Cell Polarity in Plants.”
Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no.
9, Elsevier, 2015, pp. 2168–72, doi:10.1016/j.bbamcr.2015.02.017.
short: E. Himschoot, T. Beeckman, J. Friml, S. Vanneste, Biochimica et Biophysica
Acta - Molecular Cell Research 1853 (2015) 2168–2172.
date_created: 2018-12-11T11:54:21Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2021-01-12T06:53:36Z
day: '01'
department:
- _id: JiFr
doi: 10.1016/j.bbamcr.2015.02.017
intvolume: ' 1853'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 2168 - 2172
publication: Biochimica et Biophysica Acta - Molecular Cell Research
publication_status: published
publisher: Elsevier
publist_id: '5252'
quality_controlled: '1'
scopus_import: 1
status: public
title: Calcium is an organizer of cell polarity in plants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1853
year: '2015'
...
---
_id: '1850'
abstract:
- lang: eng
text: 'Entomopathogenic fungi are potent biocontrol agents that are widely used
against insect pests, many of which are social insects. Nevertheless, theoretical
investigations of their particular life history are scarce. We develop a model
that takes into account the main distinguishing features between traditionally
studied diseases and obligate killing pathogens, like the (biocontrol-relevant)
insect-pathogenic fungi Metarhizium and Beauveria. First, obligate killing entomopathogenic
fungi produce new infectious particles (conidiospores) only after host death and
not yet on the living host. Second, the killing rates of entomopathogenic fungi
depend strongly on the initial exposure dosage, thus we explicitly consider the
pathogen load of individual hosts. Further, we make the model applicable not only
to solitary host species, but also to group living species by incorporating social
interactions between hosts, like the collective disease defences of insect societies.
Our results identify the optimal killing rate for the pathogen that minimises
its invasion threshold. Furthermore, we find that the rate of contact between
hosts has an ambivalent effect: dense interaction networks between individuals
are considered to facilitate disease outbreaks because of increased pathogen transmission.
In social insects, this is compensated by their collective disease defences, i.e.,
social immunity. For the type of pathogens considered here, we show that even
without social immunity, high contact rates between live individuals dilute the
pathogen in the host colony and hence can reduce individual pathogen loads below
disease-causing levels.'
author:
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Novak S, Cremer S. Fungal disease dynamics in insect societies: Optimal killing
rates and the ambivalent effect of high social interaction rates. Journal of
Theoretical Biology. 2015;372(5):54-64. doi:10.1016/j.jtbi.2015.02.018'
apa: 'Novak, S., & Cremer, S. (2015). Fungal disease dynamics in insect societies:
Optimal killing rates and the ambivalent effect of high social interaction rates.
Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2015.02.018'
chicago: 'Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect
Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction
Rates.” Journal of Theoretical Biology. Elsevier, 2015. https://doi.org/10.1016/j.jtbi.2015.02.018.'
ieee: 'S. Novak and S. Cremer, “Fungal disease dynamics in insect societies: Optimal
killing rates and the ambivalent effect of high social interaction rates,” Journal
of Theoretical Biology, vol. 372, no. 5. Elsevier, pp. 54–64, 2015.'
ista: 'Novak S, Cremer S. 2015. Fungal disease dynamics in insect societies: Optimal
killing rates and the ambivalent effect of high social interaction rates. Journal
of Theoretical Biology. 372(5), 54–64.'
mla: 'Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies:
Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.”
Journal of Theoretical Biology, vol. 372, no. 5, Elsevier, 2015, pp. 54–64,
doi:10.1016/j.jtbi.2015.02.018.'
short: S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64.
date_created: 2018-12-11T11:54:21Z
date_published: 2015-05-07T00:00:00Z
date_updated: 2025-05-28T11:42:49Z
day: '07'
ddc:
- '576'
department:
- _id: NiBa
- _id: SyCr
doi: 10.1016/j.jtbi.2015.02.018
ec_funded: 1
file:
- access_level: open_access
checksum: 3c0dcacc900bc45cc65a453dfda4ca43
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5326'
file_name: IST-2015-329-v1+1_manuscript.pdf
file_size: 1546914
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 372'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 54 - 64
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '5251'
pubrep_id: '329'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Fungal disease dynamics in insect societies: Optimal killing rates and the
ambivalent effect of high social interaction rates'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 372
year: '2015'
...
---
_id: '1851'
abstract:
- lang: eng
text: We consider mating strategies for females who search for males sequentially
during a season of limited length. We show that the best strategy rejects a given
male type if encountered before a time-threshold but accepts him after. For frequency-independent
benefits, we obtain the optimal time-thresholds explicitly for both discrete and
continuous distributions of males, and allow for mistakes being made in assessing
the correct male type. When the benefits are indirect (genes for the offspring)
and the population is under frequency-dependent ecological selection, the benefits
depend on the mating strategy of other females as well. This case is particularly
relevant to speciation models that seek to explore the stability of reproductive
isolation by assortative mating under frequency-dependent ecological selection.
We show that the indirect benefits are to be quantified by the reproductive values
of couples, and describe how the evolutionarily stable time-thresholds can be
found. We conclude with an example based on the Levene model, in which we analyze
the evolutionarily stable assortative mating strategies and the strength of reproductive
isolation provided by them.
article_processing_charge: No
article_type: original
author:
- first_name: Tadeas
full_name: Priklopil, Tadeas
id: 3C869AA0-F248-11E8-B48F-1D18A9856A87
last_name: Priklopil
- first_name: Eva
full_name: Kisdi, Eva
last_name: Kisdi
- first_name: Mats
full_name: Gyllenberg, Mats
last_name: Gyllenberg
citation:
ama: Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating. Evolution. 2015;69(4):1015-1026. doi:10.1111/evo.12618
apa: Priklopil, T., Kisdi, E., & Gyllenberg, M. (2015). Evolutionarily stable
mating decisions for sequentially searching females and the stability of reproductive
isolation by assortative mating. Evolution. Wiley. https://doi.org/10.1111/evo.12618
chicago: Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable
Mating Decisions for Sequentially Searching Females and the Stability of Reproductive
Isolation by Assortative Mating.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12618.
ieee: T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating,” Evolution, vol. 69, no. 4. Wiley, pp. 1015–1026,
2015.
ista: Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating. Evolution. 69(4), 1015–1026.
mla: Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially
Searching Females and the Stability of Reproductive Isolation by Assortative Mating.”
Evolution, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:10.1111/evo.12618.
short: T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.
date_created: 2018-12-11T11:54:21Z
date_published: 2015-02-09T00:00:00Z
date_updated: 2022-06-07T10:52:37Z
day: '09'
ddc:
- '570'
department:
- _id: NiBa
- _id: KrCh
doi: 10.1111/evo.12618
ec_funded: 1
external_id:
pmid:
- '25662095'
file:
- access_level: open_access
checksum: 1e8be0b1d7598a78cd2623d8ee8e7798
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T09:05:34Z
date_updated: 2020-07-14T12:45:19Z
file_id: '7855'
file_name: 2015_Evolution_Priklopil.pdf
file_size: 967214
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 69'
issue: '4'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 1015 - 1026
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley
publist_id: '5249'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolutionarily stable mating decisions for sequentially searching females and
the stability of reproductive isolation by assortative mating
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2015'
...
---
_id: '1855'
abstract:
- lang: eng
text: 'Summary: Declining populations of bee pollinators are a cause of concern,
with major repercussions for biodiversity loss and food security. RNA viruses
associated with honeybees represent a potential threat to other insect pollinators,
but the extent of this threat is poorly understood. This study aims to attain
a detailed understanding of the current and ongoing risk of emerging infectious
disease (EID) transmission between managed and wild pollinator species across
a wide range of RNA viruses. Within a structured large-scale national survey across
26 independent sites, we quantify the prevalence and pathogen loads of multiple
RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee
(Bombus spp.) populations. We then construct models that compare virus prevalence
between wild and managed pollinators. Multiple RNA viruses associated with honeybees
are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees
is a significant predictor of virus prevalence in bumblebees, but we remain cautious
in speculating over the principle direction of pathogen transmission. We demonstrate
species-specific differences in prevalence, indicating significant variation in
disease susceptibility or tolerance. Pathogen loads within individual bumblebees
may be high and in the case of at least one RNA virus, prevalence is higher in
wild bumblebees than in managed honeybee populations. Our findings indicate widespread
transmission of RNA viruses between managed and wild bee pollinators, pointing
to an interconnected network of potential disease pressures within and among pollinator
species. In the context of the biodiversity crisis, our study emphasizes the importance
of targeting a wide range of pathogens and defining host associations when considering
potential drivers of population decline.'
acknowledgement: We thank J.R. de Miranda, L. De Smet and D. de Graaf for supplying
qRT-PCR and MLPA positive controls, respectively, in the form of plasmids. This
work was supported by the Insect Pollinators Initiative (IPI grants BB/1000100/1
and BB/I000151/1). The IPI is funded jointly by the Biotechnology and Biological
Sciences Research Council, the Department for Environment, Food and Rural Affairs,
the Natural Environment Research Council, The Scottish Government and The Wellcome
Trust, under the Living with Environmental Change Partnership.
article_processing_charge: No
article_type: original
author:
- first_name: Dino
full_name: Mcmahon, Dino
last_name: Mcmahon
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
- first_name: Jesicca
full_name: Caspar, Jesicca
last_name: Caspar
- first_name: Panagiotis
full_name: Theodorou, Panagiotis
last_name: Theodorou
- first_name: Mark
full_name: Brown, Mark
last_name: Brown
- first_name: Robert
full_name: Paxton, Robert
last_name: Paxton
citation:
ama: 'Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. A sting in the
spit: Widespread cross-infection of multiple RNA viruses across wild and managed
bees. Journal of Animal Ecology. 2015;84(3):615-624. doi:10.1111/1365-2656.12345'
apa: 'Mcmahon, D., Fürst, M., Caspar, J., Theodorou, P., Brown, M., & Paxton,
R. (2015). A sting in the spit: Widespread cross-infection of multiple RNA viruses
across wild and managed bees. Journal of Animal Ecology. Wiley. https://doi.org/10.1111/1365-2656.12345'
chicago: 'Mcmahon, Dino, Matthias Fürst, Jesicca Caspar, Panagiotis Theodorou, Mark
Brown, and Robert Paxton. “A Sting in the Spit: Widespread Cross-Infection of
Multiple RNA Viruses across Wild and Managed Bees.” Journal of Animal Ecology.
Wiley, 2015. https://doi.org/10.1111/1365-2656.12345.'
ieee: 'D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, and R. Paxton, “A
sting in the spit: Widespread cross-infection of multiple RNA viruses across wild
and managed bees,” Journal of Animal Ecology, vol. 84, no. 3. Wiley, pp.
615–624, 2015.'
ista: 'Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. 2015. A sting
in the spit: Widespread cross-infection of multiple RNA viruses across wild and
managed bees. Journal of Animal Ecology. 84(3), 615–624.'
mla: 'Mcmahon, Dino, et al. “A Sting in the Spit: Widespread Cross-Infection of
Multiple RNA Viruses across Wild and Managed Bees.” Journal of Animal Ecology,
vol. 84, no. 3, Wiley, 2015, pp. 615–24, doi:10.1111/1365-2656.12345.'
short: D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, R. Paxton, Journal
of Animal Ecology 84 (2015) 615–624.
date_created: 2018-12-11T11:54:23Z
date_published: 2015-03-03T00:00:00Z
date_updated: 2023-02-23T14:06:09Z
day: '03'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1111/1365-2656.12345
external_id:
pmid:
- '25646973'
file:
- access_level: open_access
checksum: 542a0b9b07e78050a81b35f26f0b82da
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:29Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5350'
file_name: IST-2016-460-v1+1_McMahon_et_al-2015-Journal_of_Animal_Ecology.pdf
file_size: 1823045
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 84'
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 615 - 624
pmid: 1
publication: Journal of Animal Ecology
publication_status: published
publisher: Wiley
publist_id: '5245'
pubrep_id: '460'
quality_controlled: '1'
related_material:
record:
- id: '9720'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'A sting in the spit: Widespread cross-infection of multiple RNA viruses across
wild and managed bees'
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: 6785fbc1-c503-11eb-8a32-93094b40e1cf
volume: 84
year: '2015'
...
---
_id: '1856'
abstract:
- lang: eng
text: 'The traditional synthesis question given a specification asks for the automatic
construction of a system that satisfies the specification, whereas often there
exists a preference order among the different systems that satisfy the given specification.
Under a probabilistic assumption about the possible inputs, such a preference
order is naturally expressed by a weighted automaton, which assigns to each word
a value, such that a system is preferred if it generates a higher expected value.
We solve the following optimal synthesis problem: given an omega-regular specification,
a Markov chain that describes the distribution of inputs, and a weighted automaton
that measures how well a system satisfies the given specification under the input
assumption, synthesize a system that optimizes the measured value. For safety
specifications and quantitative measures that are defined by mean-payoff automata,
the optimal synthesis problem reduces to finding a strategy in a Markov decision
process (MDP) that is optimal for a long-run average reward objective, which can
be achieved in polynomial time. For general omega-regular specifications along
with mean-payoff automata, the solution rests on a new, polynomial-time algorithm
for computing optimal strategies in MDPs with mean-payoff parity objectives. Our
algorithm constructs optimal strategies that consist of two memoryless strategies
and a counter. The counter is in general not bounded. To obtain a finite-state
system, we show how to construct an ε-optimal strategy with a bounded counter,
for all ε > 0. Furthermore, we show how to decide in polynomial time if it
is possible to construct an optimal finite-state system (i.e., a system without
a counter) for a given specification. We have implemented our approach and the
underlying algorithms in a tool that takes qualitative and quantitative specifications
and automatically constructs a system that satisfies the qualitative specification
and optimizes the quantitative specification, if such a system exists. We present
some experimental results showing optimal systems that were automatically generated
in this way.'
article_number: '9'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing
systems in probabilistic environments. Journal of the ACM. 2015;62(1).
doi:10.1145/2699430
apa: Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring
and synthesizing systems in probabilistic environments. Journal of the ACM.
ACM. https://doi.org/10.1145/2699430
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit
Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal
of the ACM. ACM, 2015. https://doi.org/10.1145/2699430.
ieee: K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and
synthesizing systems in probabilistic environments,” Journal of the ACM,
vol. 62, no. 1. ACM, 2015.
ista: Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing
systems in probabilistic environments. Journal of the ACM. 62(1), 9.
mla: Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic
Environments.” Journal of the ACM, vol. 62, no. 1, 9, ACM, 2015, doi:10.1145/2699430.
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM
62 (2015).
date_created: 2018-12-11T11:54:23Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2023-02-23T11:46:04Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/2699430
ec_funded: 1
intvolume: ' 62'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1004.0739
month: '02'
oa: 1
oa_version: Preprint
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: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _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: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '5244'
quality_controlled: '1'
related_material:
record:
- id: '3864'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Measuring and synthesizing systems in probabilistic environments
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 62
year: '2015'
...
---
_id: '1857'
abstract:
- lang: eng
text: 'Sharing information between multiple tasks enables algorithms to achieve
good generalization performance even from small amounts of training data. However,
in a realistic scenario of multi-task learning not all tasks are equally related
to each other, hence it could be advantageous to transfer information only between
the most related tasks. In this work we propose an approach that processes multiple
tasks in a sequence with sharing between subsequent tasks instead of solving all
tasks jointly. Subsequently, we address the question of curriculum learning of
tasks, i.e. finding the best order of tasks to be learned. Our approach is based
on a generalization bound criterion for choosing the task order that optimizes
the average expected classification performance over all tasks. Our experimental
results show that learning multiple related tasks sequentially can be more effective
than learning them jointly, the order in which tasks are being solved affects
the overall performance, and that our model is able to automatically discover
the favourable order of tasks. '
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Sharmanska V, Lampert C. Curriculum learning of multiple tasks.
In: IEEE; 2015:5492-5500. doi:10.1109/CVPR.2015.7299188'
apa: 'Pentina, A., Sharmanska, V., & Lampert, C. (2015). Curriculum learning
of multiple tasks (pp. 5492–5500). Presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7299188'
chicago: Pentina, Anastasia, Viktoriia Sharmanska, and Christoph Lampert. “Curriculum
Learning of Multiple Tasks,” 5492–5500. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299188.
ieee: 'A. Pentina, V. Sharmanska, and C. Lampert, “Curriculum learning of multiple
tasks,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston,
MA, United States, 2015, pp. 5492–5500.'
ista: 'Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple
tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.'
mla: Pentina, Anastasia, et al. Curriculum Learning of Multiple Tasks. IEEE,
2015, pp. 5492–500, doi:10.1109/CVPR.2015.7299188.
short: A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:54:23Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-23T10:17:31Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7299188
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.1353
month: '06'
oa: 1
oa_version: Preprint
page: 5492 - 5500
publication_status: published
publisher: IEEE
publist_id: '5243'
quality_controlled: '1'
scopus_import: 1
status: public
title: Curriculum learning of multiple tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1858'
abstract:
- lang: eng
text: 'We study the problem of predicting the future, though only in the probabilistic
sense of estimating a future state of a time-varying probability distribution.
This is not only an interesting academic problem, but solving this extrapolation
problem also has many practical application, e.g. for training classifiers that
have to operate under time-varying conditions. Our main contribution is a method
for predicting the next step of the time-varying distribution from a given sequence
of sample sets from earlier time steps. For this we rely on two recent machine
learning techniques: embedding probability distributions into a reproducing kernel
Hilbert space, and learning operators by vector-valued regression. We illustrate
the working principles and the practical usefulness of our method by experiments
on synthetic and real data. We also highlight an exemplary application: training
a classifier in a domain adaptation setting without having access to examples
from the test time distribution at training time.'
arxiv: 1
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Lampert C. Predicting the future behavior of a time-varying probability distribution.
In: IEEE; 2015:942-950. doi:10.1109/CVPR.2015.7298696'
apa: 'Lampert, C. (2015). Predicting the future behavior of a time-varying probability
distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern
Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298696'
chicago: Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability
Distribution,” 942–50. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298696.
ieee: 'C. Lampert, “Predicting the future behavior of a time-varying probability
distribution,” presented at the CVPR: Computer Vision and Pattern Recognition,
Boston, MA, United States, 2015, pp. 942–950.'
ista: 'Lampert C. 2015. Predicting the future behavior of a time-varying probability
distribution. CVPR: Computer Vision and Pattern Recognition, 942–950.'
mla: Lampert, Christoph. Predicting the Future Behavior of a Time-Varying Probability
Distribution. IEEE, 2015, pp. 942–50, doi:10.1109/CVPR.2015.7298696.
short: C. Lampert, in:, IEEE, 2015, pp. 942–950.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:54:24Z
date_published: 2015-10-15T00:00:00Z
date_updated: 2021-01-12T06:53:40Z
day: '15'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7298696
external_id:
arxiv:
- '1406.5362'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.5362
month: '10'
oa: 1
oa_version: Preprint
page: 942 - 950
publication_status: published
publisher: IEEE
publist_id: '5241'
quality_controlled: '1'
scopus_import: 1
status: public
title: Predicting the future behavior of a time-varying probability distribution
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...