---
_id: '1929'
abstract:
- lang: eng
text: We propose an algorithm for the generalization of cartographic objects that
can be used to represent maps on different scales.
acknowledgement: We would like to offer our special thanks to students of the Department
of Mathematics of Demidov Yaroslavl State University A. A. Gorokhov and V. N. Knyazev
for participation in developing the program and assistance in preparation of test
data. This work was supported by grant 11.G34.31.0053 from the government of the
Russian Federation.
article_processing_charge: No
article_type: original
author:
- first_name: V V
full_name: Alexeev, V V
last_name: Alexeev
- first_name: V G
full_name: Bogaevskaya, V G
last_name: Bogaevskaya
- first_name: M M
full_name: Preobrazhenskaya, M M
last_name: Preobrazhenskaya
- first_name: A Y
full_name: Ukhalov, A Y
last_name: Ukhalov
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Olga
full_name: Yakimova, Olga
last_name: Yakimova
citation:
ama: Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H,
Yakimova O. An algorithm for cartographic generalization that preserves global
topology. Journal of Mathematical Sciences. 2014;203(6):754-760. doi:10.1007/s10958-014-2165-8
apa: Alexeev, V. V., Bogaevskaya, V. G., Preobrazhenskaya, M. M., Ukhalov, A. Y.,
Edelsbrunner, H., & Yakimova, O. (2014). An algorithm for cartographic generalization
that preserves global topology. Journal of Mathematical Sciences. Springer.
https://doi.org/10.1007/s10958-014-2165-8
chicago: Alexeev, V V, V G Bogaevskaya, M M Preobrazhenskaya, A Y Ukhalov, Herbert
Edelsbrunner, and Olga Yakimova. “An Algorithm for Cartographic Generalization
That Preserves Global Topology.” Journal of Mathematical Sciences. Springer,
2014. https://doi.org/10.1007/s10958-014-2165-8.
ieee: V. V. Alexeev, V. G. Bogaevskaya, M. M. Preobrazhenskaya, A. Y. Ukhalov, H.
Edelsbrunner, and O. Yakimova, “An algorithm for cartographic generalization that
preserves global topology,” Journal of Mathematical Sciences, vol. 203,
no. 6. Springer, pp. 754–760, 2014.
ista: Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner
H, Yakimova O. 2014. An algorithm for cartographic generalization that preserves
global topology. Journal of Mathematical Sciences. 203(6), 754–760.
mla: Alexeev, V. V., et al. “An Algorithm for Cartographic Generalization That Preserves
Global Topology.” Journal of Mathematical Sciences, vol. 203, no. 6, Springer,
2014, pp. 754–60, doi:10.1007/s10958-014-2165-8.
short: V.V. Alexeev, V.G. Bogaevskaya, M.M. Preobrazhenskaya, A.Y. Ukhalov, H. Edelsbrunner,
O. Yakimova, Journal of Mathematical Sciences 203 (2014) 754–760.
date_created: 2018-12-11T11:54:46Z
date_published: 2014-11-16T00:00:00Z
date_updated: 2022-05-24T10:39:06Z
day: '16'
department:
- _id: HeEd
doi: 10.1007/s10958-014-2165-8
intvolume: ' 203'
issue: '6'
language:
- iso: eng
month: '11'
oa_version: None
page: 754 - 760
publication: Journal of Mathematical Sciences
publication_identifier:
eissn:
- 1573-8795
issn:
- 1072-3374
publication_status: published
publisher: Springer
publist_id: '5165'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An algorithm for cartographic generalization that preserves global topology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 203
year: '2014'
...
---
_id: '1930'
abstract:
- lang: eng
text: (Figure Presented) Data acquisition, numerical inaccuracies, and sampling
often introduce noise in measurements and simulations. Removing this noise is
often necessary for efficient analysis and visualization of this data, yet many
denoising techniques change the minima and maxima of a scalar field. For example,
the extrema can appear or disappear, spatially move, and change their value. This
can lead to wrong interpretations of the data, e.g., when the maximum temperature
over an area is falsely reported being a few degrees cooler because the denoising
method is unaware of these features. Recently, a topological denoising technique
based on a global energy optimization was proposed, which allows the topology-controlled
denoising of 2D scalar fields. While this method preserves the minima and maxima,
it is constrained by the size of the data. We extend this work to large 2D data
and medium-sized 3D data by introducing a novel domain decomposition approach.
It allows processing small patches of the domain independently while still avoiding
the introduction of new critical points. Furthermore, we propose an iterative
refinement of the solution, which decreases the optimization energy compared to
the previous approach and therefore gives smoother results that are closer to
the input. We illustrate our technique on synthetic and real-world 2D and 3D data
sets that highlight potential applications.
acknowledgement: RTRA Digiteoproject; ERC grant; SNF award; Intel Doctoral Fellowship;
MPC-VCC
article_processing_charge: No
author:
- first_name: David
full_name: Günther, David
last_name: Günther
- first_name: Alec
full_name: Jacobson, Alec
last_name: Jacobson
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Hans
full_name: Seidel, Hans
last_name: Seidel
- first_name: Olga
full_name: Sorkine Hornung, Olga
last_name: Sorkine Hornung
- first_name: Tino
full_name: Weinkauf, Tino
last_name: Weinkauf
citation:
ama: Günther D, Jacobson A, Reininghaus J, Seidel H, Sorkine Hornung O, Weinkauf
T. Fast and memory-efficient topological denoising of 2D and 3D scalar fields.
IEEE Transactions on Visualization and Computer Graphics. 2014;20(12):2585-2594.
doi:10.1109/TVCG.2014.2346432
apa: Günther, D., Jacobson, A., Reininghaus, J., Seidel, H., Sorkine Hornung, O.,
& Weinkauf, T. (2014). Fast and memory-efficient topological denoising of
2D and 3D scalar fields. IEEE Transactions on Visualization and Computer Graphics.
IEEE. https://doi.org/10.1109/TVCG.2014.2346432
chicago: Günther, David, Alec Jacobson, Jan Reininghaus, Hans Seidel, Olga Sorkine
Hornung, and Tino Weinkauf. “Fast and Memory-Efficient Topological Denoising of
2D and 3D Scalar Fields.” IEEE Transactions on Visualization and Computer Graphics.
IEEE, 2014. https://doi.org/10.1109/TVCG.2014.2346432.
ieee: D. Günther, A. Jacobson, J. Reininghaus, H. Seidel, O. Sorkine Hornung, and
T. Weinkauf, “Fast and memory-efficient topological denoising of 2D and 3D scalar
fields,” IEEE Transactions on Visualization and Computer Graphics, vol.
20, no. 12. IEEE, pp. 2585–2594, 2014.
ista: Günther D, Jacobson A, Reininghaus J, Seidel H, Sorkine Hornung O, Weinkauf
T. 2014. Fast and memory-efficient topological denoising of 2D and 3D scalar fields.
IEEE Transactions on Visualization and Computer Graphics. 20(12), 2585–2594.
mla: Günther, David, et al. “Fast and Memory-Efficient Topological Denoising of
2D and 3D Scalar Fields.” IEEE Transactions on Visualization and Computer Graphics,
vol. 20, no. 12, IEEE, 2014, pp. 2585–94, doi:10.1109/TVCG.2014.2346432.
short: D. Günther, A. Jacobson, J. Reininghaus, H. Seidel, O. Sorkine Hornung, T.
Weinkauf, IEEE Transactions on Visualization and Computer Graphics 20 (2014) 2585–2594.
date_created: 2018-12-11T11:54:46Z
date_published: 2014-12-31T00:00:00Z
date_updated: 2025-09-29T12:11:45Z
day: '31'
department:
- _id: HeEd
doi: 10.1109/TVCG.2014.2346432
external_id:
isi:
- '000344991700104'
intvolume: ' 20'
isi: 1
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
page: 2585 - 2594
publication: IEEE Transactions on Visualization and Computer Graphics
publication_status: published
publisher: IEEE
publist_id: '5164'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast and memory-efficient topological denoising of 2D and 3D scalar fields
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 20
year: '2014'
...
---
_id: '1931'
abstract:
- lang: eng
text: A wealth of experimental evidence suggests that working memory circuits preferentially
represent information that is behaviorally relevant. Still, we are missing a mechanistic
account of how these representations come about. Here we provide a simple explanation
for a range of experimental findings, in light of prefrontal circuits adapting
to task constraints by reward-dependent learning. In particular, we model a neural
network shaped by reward-modulated spike-timing dependent plasticity (r-STDP)
and homeostatic plasticity (intrinsic excitability and synaptic scaling). We show
that the experimentally-observed neural representations naturally emerge in an
initially unstructured circuit as it learns to solve several working memory tasks.
These results point to a critical, and previously unappreciated, role for reward-dependent
learning in shaping prefrontal cortex activity.
acknowledgement: Supported in part by EC MEXT project PLICON and the LOEWE-Program
“Neuronal Coordination Research Focus Frankfurt” (NeFF). Jochen Triesch was supported
by the Quandt foundation.
article_number: '57'
article_processing_charge: No
author:
- first_name: Cristina
full_name: Savin, Cristina
id: 3933349E-F248-11E8-B48F-1D18A9856A87
last_name: Savin
- first_name: Jochen
full_name: Triesch, Jochen
last_name: Triesch
citation:
ama: Savin C, Triesch J. Emergence of task-dependent representations in working
memory circuits. Frontiers in Computational Neuroscience. 2014;8(MAY).
doi:10.3389/fncom.2014.00057
apa: Savin, C., & Triesch, J. (2014). Emergence of task-dependent representations
in working memory circuits. Frontiers in Computational Neuroscience. Frontiers
Research Foundation. https://doi.org/10.3389/fncom.2014.00057
chicago: Savin, Cristina, and Jochen Triesch. “Emergence of Task-Dependent Representations
in Working Memory Circuits.” Frontiers in Computational Neuroscience. Frontiers
Research Foundation, 2014. https://doi.org/10.3389/fncom.2014.00057.
ieee: C. Savin and J. Triesch, “Emergence of task-dependent representations in working
memory circuits,” Frontiers in Computational Neuroscience, vol. 8, no.
MAY. Frontiers Research Foundation, 2014.
ista: Savin C, Triesch J. 2014. Emergence of task-dependent representations in working
memory circuits. Frontiers in Computational Neuroscience. 8(MAY), 57.
mla: Savin, Cristina, and Jochen Triesch. “Emergence of Task-Dependent Representations
in Working Memory Circuits.” Frontiers in Computational Neuroscience, vol.
8, no. MAY, 57, Frontiers Research Foundation, 2014, doi:10.3389/fncom.2014.00057.
short: C. Savin, J. Triesch, Frontiers in Computational Neuroscience 8 (2014).
corr_author: '1'
date_created: 2018-12-11T11:54:46Z
date_published: 2014-05-28T00:00:00Z
date_updated: 2025-09-29T12:11:13Z
day: '28'
department:
- _id: GaTk
doi: 10.3389/fncom.2014.00057
external_id:
isi:
- '000336715400001'
intvolume: ' 8'
isi: 1
issue: MAY
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4035833/
month: '05'
oa: 1
oa_version: Submitted Version
publication: Frontiers in Computational Neuroscience
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '5163'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Emergence of task-dependent representations in working memory circuits
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 8
year: '2014'
...
---
_id: '1932'
abstract:
- lang: eng
text: The existence of complex (multiple-step) genetic adaptations that are "irreducible"
(i.e., all partial combinations are less fit than the original genotype) is one
of the longest standing problems in evolutionary biology. In standard genetics
parlance, these adaptations require the crossing of a wide adaptive valley of
deleterious intermediate stages. Here, we demonstrate, using a simple model, that
evolution can cross wide valleys to produce "irreducibly complex" adaptations
by making use of previously cryptic mutations. When revealed by an evolutionary
capacitor, previously cryptic mutants have higher initial frequencies than do
new mutations, bringing them closer to a valley-crossing saddle in allele frequency
space. Moreover, simple combinatorics implies an enormous number of candidate
combinations exist within available cryptic genetic variation. We model the dynamics
of crossing of a wide adaptive valley after a capacitance event using both numerical
simulations and analytical approximations. Although individual valley crossing
events become less likely as valleys widen, by taking the combinatorics of genotype
space into account, we see that revealing cryptic variation can cause the frequent
evolution of complex adaptations.
acknowledgement: "Funded by National Institutes of Health. Grant Numbers: R01GM076041,
R01GM104040 \r\n\r\nSimons Foundation\r\n\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Meredith
full_name: Trotter, Meredith
last_name: Trotter
- first_name: Daniel
full_name: Weissman, Daniel
id: 2D0CE020-F248-11E8-B48F-1D18A9856A87
last_name: Weissman
- first_name: Grant
full_name: Peterson, Grant
last_name: Peterson
- first_name: Kayla
full_name: Peck, Kayla
last_name: Peck
- first_name: Joanna
full_name: Masel, Joanna
last_name: Masel
citation:
ama: Trotter M, Weissman D, Peterson G, Peck K, Masel J. Cryptic genetic variation
can make "irreducible complexity" a common mode of adaptation
in sexual populations. Evolution. 2014;68(12):3357-3367. doi:10.1111/evo.12517
apa: Trotter, M., Weissman, D., Peterson, G., Peck, K., & Masel, J. (2014).
Cryptic genetic variation can make "irreducible complexity"
a common mode of adaptation in sexual populations. Evolution. Wiley-Blackwell.
https://doi.org/10.1111/evo.12517
chicago: Trotter, Meredith, Daniel Weissman, Grant Peterson, Kayla Peck, and Joanna
Masel. “Cryptic Genetic Variation Can Make "Irreducible Complexity"
a Common Mode of Adaptation in Sexual Populations.” Evolution. Wiley-Blackwell,
2014. https://doi.org/10.1111/evo.12517.
ieee: M. Trotter, D. Weissman, G. Peterson, K. Peck, and J. Masel, “Cryptic genetic
variation can make "irreducible complexity" a common mode of
adaptation in sexual populations,” Evolution, vol. 68, no. 12. Wiley-Blackwell,
pp. 3357–3367, 2014.
ista: Trotter M, Weissman D, Peterson G, Peck K, Masel J. 2014. Cryptic genetic
variation can make "irreducible complexity" a common mode of
adaptation in sexual populations. Evolution. 68(12), 3357–3367.
mla: Trotter, Meredith, et al. “Cryptic Genetic Variation Can Make "Irreducible
Complexity" a Common Mode of Adaptation in Sexual Populations.” Evolution,
vol. 68, no. 12, Wiley-Blackwell, 2014, pp. 3357–67, doi:10.1111/evo.12517.
short: M. Trotter, D. Weissman, G. Peterson, K. Peck, J. Masel, Evolution 68 (2014)
3357–3367.
date_created: 2018-12-11T11:54:47Z
date_published: 2014-12-01T00:00:00Z
date_updated: 2025-09-29T12:10:43Z
day: '01'
department:
- _id: NiBa
doi: 10.1111/evo.12517
ec_funded: 1
external_id:
arxiv:
- '1310.6077'
isi:
- '000346075600001'
intvolume: ' 68'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1310.6077
month: '12'
oa: 1
oa_version: Submitted Version
page: 3357 - 3367
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5162'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cryptic genetic variation can make "irreducible complexity" a common
mode of adaptation in sexual populations
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 68
year: '2014'
...
---
_id: '1933'
abstract:
- lang: eng
text: The development of the vertebrate brain requires an exquisite balance between
proliferation and differentiation of neural progenitors. Notch signaling plays
a pivotal role in regulating this balance, yet the interaction between signaling
and receiving cells remains poorly understood. We have found that numerous nascent
neurons and/or intermediate neurogenic progenitors expressing the ligand of Notch
retain apical endfeet transiently at the ventricular lumen that form adherens
junctions (AJs) with the endfeet of progenitors. Forced detachment of the apical
endfeet of those differentiating cells by disrupting AJs resulted in precocious
neurogenesis that was preceded by the downregulation of Notch signaling. Both
Notch1 and its ligand Dll1 are distributed around AJs in the apical endfeet, and
these proteins physically interact with ZO-1, a constituent of the AJ. Furthermore,
live imaging of a fluorescently tagged Notch1 demonstrated its trafficking from
the apical endfoot to the nucleus upon cleavage. Our results identified the apical
endfoot as the central site of active Notch signaling to securely prohibit inappropriate
differentiation of neural progenitors.
article_processing_charge: No
author:
- first_name: Jun
full_name: Hatakeyama, Jun
last_name: Hatakeyama
- first_name: Yoshio
full_name: Wakamatsu, Yoshio
last_name: Wakamatsu
- first_name: Akira
full_name: Nagafuchi, Akira
last_name: Nagafuchi
- first_name: Ryoichiro
full_name: Kageyama, Ryoichiro
last_name: Kageyama
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Kenji
full_name: Shimamura, Kenji
last_name: Shimamura
citation:
ama: Hatakeyama J, Wakamatsu Y, Nagafuchi A, Kageyama R, Shigemoto R, Shimamura
K. Cadherin-based adhesions in the apical endfoot are required for active Notch
signaling to control neurogenesis in vertebrates. Development. 2014;141(8):1671-1682.
doi:10.1242/dev.102988
apa: Hatakeyama, J., Wakamatsu, Y., Nagafuchi, A., Kageyama, R., Shigemoto, R.,
& Shimamura, K. (2014). Cadherin-based adhesions in the apical endfoot are
required for active Notch signaling to control neurogenesis in vertebrates. Development.
Company of Biologists. https://doi.org/10.1242/dev.102988
chicago: Hatakeyama, Jun, Yoshio Wakamatsu, Akira Nagafuchi, Ryoichiro Kageyama,
Ryuichi Shigemoto, and Kenji Shimamura. “Cadherin-Based Adhesions in the Apical
Endfoot Are Required for Active Notch Signaling to Control Neurogenesis in Vertebrates.”
Development. Company of Biologists, 2014. https://doi.org/10.1242/dev.102988.
ieee: J. Hatakeyama, Y. Wakamatsu, A. Nagafuchi, R. Kageyama, R. Shigemoto, and
K. Shimamura, “Cadherin-based adhesions in the apical endfoot are required for
active Notch signaling to control neurogenesis in vertebrates,” Development,
vol. 141, no. 8. Company of Biologists, pp. 1671–1682, 2014.
ista: Hatakeyama J, Wakamatsu Y, Nagafuchi A, Kageyama R, Shigemoto R, Shimamura
K. 2014. Cadherin-based adhesions in the apical endfoot are required for active
Notch signaling to control neurogenesis in vertebrates. Development. 141(8), 1671–1682.
mla: Hatakeyama, Jun, et al. “Cadherin-Based Adhesions in the Apical Endfoot Are
Required for Active Notch Signaling to Control Neurogenesis in Vertebrates.” Development,
vol. 141, no. 8, Company of Biologists, 2014, pp. 1671–82, doi:10.1242/dev.102988.
short: J. Hatakeyama, Y. Wakamatsu, A. Nagafuchi, R. Kageyama, R. Shigemoto, K.
Shimamura, Development 141 (2014) 1671–1682.
date_created: 2018-12-11T11:54:47Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2025-09-29T12:10:15Z
day: '01'
department:
- _id: RySh
doi: 10.1242/dev.102988
external_id:
isi:
- '000334347900007'
intvolume: ' 141'
isi: 1
issue: '8'
language:
- iso: eng
month: '04'
oa_version: None
page: 1671 - 1682
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '5161'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cadherin-based adhesions in the apical endfoot are required for active Notch
signaling to control neurogenesis in vertebrates
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 141
year: '2014'
...
---
_id: '1934'
abstract:
- lang: eng
text: The plant hormones auxin and cytokinin mutually coordinate their activities
to control various aspects of development [1-9], and their crosstalk occurs at
multiple levels [10, 11]. Cytokinin-mediated modulation of auxin transport provides
an efficient means to regulate auxin distribution in plant organs. Here, we demonstrate
that cytokinin does not merely control the overall auxin flow capacity, but might
also act as a polarizing cue and control the auxin stream directionality during
plant organogenesis. Cytokinin enhances the PIN-FORMED1 (PIN1) auxin transporter
depletion at specific polar domains, thus rearranging the cellular PIN polarities
and directly regulating the auxin flow direction. This selective cytokinin sensitivity
correlates with the PIN protein phosphorylation degree. PIN1 phosphomimicking
mutations, as well as enhanced phosphorylation in plants with modulated activities
of PIN-specific kinases and phosphatases, desensitize PIN1 to cytokinin. Our results
reveal conceptually novel, cytokinin-driven polarization mechanism that operates
in developmental processes involving rapid auxin stream redirection, such as lateral
root organogenesis, in which a gradual PIN polarity switch defines the growth
axis of the newly formed organ.
article_processing_charge: No
author:
- first_name: Peter
full_name: Marhavy, Peter
id: 3F45B078-F248-11E8-B48F-1D18A9856A87
last_name: Marhavy
orcid: 0000-0001-5227-5741
- first_name: Jérôme
full_name: Duclercq, Jérôme
last_name: Duclercq
- first_name: Benjamin
full_name: Weller, Benjamin
last_name: Weller
- first_name: Elena
full_name: Feraru, Elena
last_name: Feraru
- first_name: Agnieszka
full_name: Bielach, Agnieszka
last_name: Bielach
- first_name: Remko
full_name: Offringa, Remko
last_name: Offringa
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Claus
full_name: Schwechheimer, Claus
last_name: Schwechheimer
- first_name: Angus
full_name: Murphy, Angus
last_name: Murphy
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Marhavý P, Duclercq J, Weller B, et al. Cytokinin controls polarity of PIN1-dependent
Auxin transport during lateral root organogenesis. Current Biology. 2014;24(9):1031-1037.
doi:10.1016/j.cub.2014.04.002
apa: Marhavý, P., Duclercq, J., Weller, B., Feraru, E., Bielach, A., Offringa, R.,
… Benková, E. (2014). Cytokinin controls polarity of PIN1-dependent Auxin transport
during lateral root organogenesis. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2014.04.002
chicago: Marhavý, Peter, Jérôme Duclercq, Benjamin Weller, Elena Feraru, Agnieszka
Bielach, Remko Offringa, Jiří Friml, Claus Schwechheimer, Angus Murphy, and Eva
Benková. “Cytokinin Controls Polarity of PIN1-Dependent Auxin Transport during
Lateral Root Organogenesis.” Current Biology. Cell Press, 2014. https://doi.org/10.1016/j.cub.2014.04.002.
ieee: P. Marhavý et al., “Cytokinin controls polarity of PIN1-dependent Auxin
transport during lateral root organogenesis,” Current Biology, vol. 24,
no. 9. Cell Press, pp. 1031–1037, 2014.
ista: Marhavý P, Duclercq J, Weller B, Feraru E, Bielach A, Offringa R, Friml J,
Schwechheimer C, Murphy A, Benková E. 2014. Cytokinin controls polarity of PIN1-dependent
Auxin transport during lateral root organogenesis. Current Biology. 24(9), 1031–1037.
mla: Marhavý, Peter, et al. “Cytokinin Controls Polarity of PIN1-Dependent Auxin
Transport during Lateral Root Organogenesis.” Current Biology, vol. 24,
no. 9, Cell Press, 2014, pp. 1031–37, doi:10.1016/j.cub.2014.04.002.
short: P. Marhavý, J. Duclercq, B. Weller, E. Feraru, A. Bielach, R. Offringa, J.
Friml, C. Schwechheimer, A. Murphy, E. Benková, Current Biology 24 (2014) 1031–1037.
corr_author: '1'
date_created: 2018-12-11T11:54:48Z
date_published: 2014-05-05T00:00:00Z
date_updated: 2025-09-29T12:09:47Z
day: '05'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1016/j.cub.2014.04.002
ec_funded: 1
external_id:
isi:
- '000335542300029'
intvolume: ' 24'
isi: 1
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 1031 - 1037
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
publication: Current Biology
publication_status: published
publisher: Cell Press
publist_id: '5160'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cytokinin controls polarity of PIN1-dependent Auxin transport during lateral
root organogenesis
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 24
year: '2014'
...
---
_id: '1935'
abstract:
- lang: eng
text: 'We consider Ising models in d = 2 and d = 3 dimensions with nearest neighbor
ferromagnetic and long-range antiferromagnetic interactions, the latter decaying
as (distance)-p, p > 2d, at large distances. If the strength J of the ferromagnetic
interaction is larger than a critical value J c, then the ground state is homogeneous.
It has been conjectured that when J is smaller than but close to J c, the ground
state is periodic and striped, with stripes of constant width h = h(J), and h
→ ∞ as J → Jc -. (In d = 3 stripes mean slabs, not columns.) Here we rigorously
prove that, if we normalize the energy in such a way that the energy of the homogeneous
state is zero, then the ratio e 0(J)/e S(J) tends to 1 as J → Jc -, with e S(J)
being the energy per site of the optimal periodic striped/slabbed state and e
0(J) the actual ground state energy per site of the system. Our proof comes with
explicit bounds on the difference e 0(J)-e S(J) at small but positive J c-J, and
also shows that in this parameter range the ground state is striped/slabbed in
a certain sense: namely, if one looks at a randomly chosen window, of suitable
size ℓ (very large compared to the optimal stripe size h(J)), one finds a striped/slabbed
state with high probability.'
acknowledgement: "2014 by the authors. This paper may be reproduced, in its entirety,
for non-commercial purposes.\r\n\r\nThe research leading to these results has received
funding from the European Research\r\nCouncil under the European Union’s Seventh
Framework Programme ERC Starting Grant CoMBoS (Grant Agreement No. 239694; A.G.
and R.S.), the U.S. National Science Foundation (Grant PHY 0965859; E.H.L.), the
Simons Foundation (Grant # 230207; E.H.L) and the NSERC (R.S.). The work is part
of a project started in collaboration with Joel Lebowitz, whom we thank for many
useful discussions and for his constant encouragement."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Alessandro
full_name: Giuliani, Alessandro
last_name: Giuliani
- first_name: Élliott
full_name: Lieb, Élliott
last_name: Lieb
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Giuliani A, Lieb É, Seiringer R. Formation of stripes and slabs near the ferromagnetic
transition. Communications in Mathematical Physics. 2014;331:333-350. doi:10.1007/s00220-014-1923-2
apa: Giuliani, A., Lieb, É., & Seiringer, R. (2014). Formation of stripes and
slabs near the ferromagnetic transition. Communications in Mathematical Physics.
Springer. https://doi.org/10.1007/s00220-014-1923-2
chicago: Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Formation of
Stripes and Slabs near the Ferromagnetic Transition.” Communications in Mathematical
Physics. Springer, 2014. https://doi.org/10.1007/s00220-014-1923-2.
ieee: A. Giuliani, É. Lieb, and R. Seiringer, “Formation of stripes and slabs near
the ferromagnetic transition,” Communications in Mathematical Physics,
vol. 331. Springer, pp. 333–350, 2014.
ista: Giuliani A, Lieb É, Seiringer R. 2014. Formation of stripes and slabs near
the ferromagnetic transition. Communications in Mathematical Physics. 331, 333–350.
mla: Giuliani, Alessandro, et al. “Formation of Stripes and Slabs near the Ferromagnetic
Transition.” Communications in Mathematical Physics, vol. 331, Springer,
2014, pp. 333–50, doi:10.1007/s00220-014-1923-2.
short: A. Giuliani, É. Lieb, R. Seiringer, Communications in Mathematical Physics
331 (2014) 333–350.
date_created: 2018-12-11T11:54:48Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2025-09-29T12:08:54Z
day: '01'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s00220-014-1923-2
external_id:
arxiv:
- '1304.6344'
isi:
- '000339732500011'
file:
- access_level: open_access
checksum: c8423271cd1e1ba9e44c47af75efe7b6
content_type: application/pdf
creator: dernst
date_created: 2022-05-24T08:30:40Z
date_updated: 2022-05-24T08:30:40Z
file_id: '11409'
file_name: 2014_CommMathPhysics_Giuliani.pdf
file_size: 334064
relation: main_file
success: 1
file_date_updated: 2022-05-24T08:30:40Z
has_accepted_license: '1'
intvolume: ' 331'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 333 - 350
publication: Communications in Mathematical Physics
publication_identifier:
eissn:
- 1432-0916
issn:
- 0010-3616
publication_status: published
publisher: Springer
publist_id: '5159'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Formation of stripes and slabs near the ferromagnetic transition
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 331
year: '2014'
...
---
_id: '1936'
abstract:
- lang: eng
text: 'The social intelligence hypothesis states that the need to cope with complexities
of social life has driven the evolution of advanced cognitive abilities. It is
usually invoked in the context of challenges arising from complex intragroup structures,
hierarchies, and alliances. However, a fundamental aspect of group living remains
largely unexplored as a driving force in cognitive evolution: the competition
between individuals searching for resources (producers) and conspecifics that
parasitize their findings (scroungers). In populations of social foragers, abilities
that enable scroungers to steal by outsmarting producers, and those allowing producers
to prevent theft by outsmarting scroungers, are likely to be beneficial and may
fuel a cognitive arms race. Using analytical theory and agent-based simulations,
we present a general model for such a race that is driven by the producer-scrounger
game and show that the race''s plausibility is dramatically affected by the nature
of the evolving abilities. If scrounging and scrounging avoidance rely on separate,
strategy-specific cognitive abilities, arms races are short-lived and have a limited
effect on cognition. However, general cognitive abilities that facilitate both
scrounging and scrounging avoidance undergo stable, long-lasting arms races. Thus,
ubiquitous foraging interactions may lead to the evolution of general cognitive
abilities in social animals, without the requirement of complex intragroup structures.'
article_processing_charge: No
author:
- first_name: Michal
full_name: Arbilly, Michal
last_name: Arbilly
- first_name: Daniel
full_name: Weissman, Daniel
id: 2D0CE020-F248-11E8-B48F-1D18A9856A87
last_name: Weissman
- first_name: Marcus
full_name: Feldman, Marcus
last_name: Feldman
- first_name: Uri
full_name: Grodzinski, Uri
last_name: Grodzinski
citation:
ama: Arbilly M, Weissman D, Feldman M, Grodzinski U. An arms race between producers
and scroungers can drive the evolution of social cognition. Behavioral Ecology.
2014;25(3):487-495. doi:10.1093/beheco/aru002
apa: Arbilly, M., Weissman, D., Feldman, M., & Grodzinski, U. (2014). An arms
race between producers and scroungers can drive the evolution of social cognition.
Behavioral Ecology. Oxford University Press. https://doi.org/10.1093/beheco/aru002
chicago: Arbilly, Michal, Daniel Weissman, Marcus Feldman, and Uri Grodzinski. “An
Arms Race between Producers and Scroungers Can Drive the Evolution of Social Cognition.”
Behavioral Ecology. Oxford University Press, 2014. https://doi.org/10.1093/beheco/aru002.
ieee: M. Arbilly, D. Weissman, M. Feldman, and U. Grodzinski, “An arms race between
producers and scroungers can drive the evolution of social cognition,” Behavioral
Ecology, vol. 25, no. 3. Oxford University Press, pp. 487–495, 2014.
ista: Arbilly M, Weissman D, Feldman M, Grodzinski U. 2014. An arms race between
producers and scroungers can drive the evolution of social cognition. Behavioral
Ecology. 25(3), 487–495.
mla: Arbilly, Michal, et al. “An Arms Race between Producers and Scroungers Can
Drive the Evolution of Social Cognition.” Behavioral Ecology, vol. 25,
no. 3, Oxford University Press, 2014, pp. 487–95, doi:10.1093/beheco/aru002.
short: M. Arbilly, D. Weissman, M. Feldman, U. Grodzinski, Behavioral Ecology 25
(2014) 487–495.
date_created: 2018-12-11T11:54:48Z
date_published: 2014-02-13T00:00:00Z
date_updated: 2025-09-29T12:07:50Z
day: '13'
department:
- _id: NiBa
doi: 10.1093/beheco/aru002
ec_funded: 1
external_id:
isi:
- '000336486100012'
intvolume: ' 25'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4014306/
month: '02'
oa: 1
oa_version: Submitted Version
page: 487 - 495
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Behavioral Ecology
publication_status: published
publisher: Oxford University Press
publist_id: '5157'
quality_controlled: '1'
scopus_import: '1'
status: public
title: An arms race between producers and scroungers can drive the evolution of social
cognition
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 25
year: '2014'
...
---
_id: '1937'
abstract:
- lang: eng
text: We prove the edge universality of the beta ensembles for any β ≥ 1, provided
that the limiting spectrum is supported on a single interval, and the external
potential is C4 and regular. We also prove that the edge universality holds for
generalized Wigner matrices for all symmetry classes. Moreover, our results allow
us to extend bulk universality for beta ensembles from analytic potentials to
potentials in class C4.
article_processing_charge: No
arxiv: 1
author:
- first_name: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horngtzer
full_name: Yau, Horngtzer
last_name: Yau
citation:
ama: Bourgade P, Erdös L, Yau H. Edge universality of beta ensembles. Communications
in Mathematical Physics. 2014;332(1):261-353. doi:10.1007/s00220-014-2120-z
apa: Bourgade, P., Erdös, L., & Yau, H. (2014). Edge universality of beta ensembles.
Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-014-2120-z
chicago: Bourgade, Paul, László Erdös, and Horngtzer Yau. “Edge Universality of
Beta Ensembles.” Communications in Mathematical Physics. Springer, 2014.
https://doi.org/10.1007/s00220-014-2120-z.
ieee: P. Bourgade, L. Erdös, and H. Yau, “Edge universality of beta ensembles,”
Communications in Mathematical Physics, vol. 332, no. 1. Springer, pp.
261–353, 2014.
ista: Bourgade P, Erdös L, Yau H. 2014. Edge universality of beta ensembles. Communications
in Mathematical Physics. 332(1), 261–353.
mla: Bourgade, Paul, et al. “Edge Universality of Beta Ensembles.” Communications
in Mathematical Physics, vol. 332, no. 1, Springer, 2014, pp. 261–353, doi:10.1007/s00220-014-2120-z.
short: P. Bourgade, L. Erdös, H. Yau, Communications in Mathematical Physics 332
(2014) 261–353.
date_created: 2018-12-11T11:54:48Z
date_published: 2014-11-01T00:00:00Z
date_updated: 2025-09-29T12:08:21Z
day: '01'
department:
- _id: LaEr
doi: 10.1007/s00220-014-2120-z
external_id:
arxiv:
- '1306.5728'
isi:
- '000341491700007'
intvolume: ' 332'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1306.5728
month: '11'
oa: 1
oa_version: Submitted Version
page: 261 - 353
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: "Glutamaterge synaptische Ã\x9Cbertragung und Plastizität in hippocampalen
Mikroschaltkreisen"
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '5158'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Edge universality of beta ensembles
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 332
year: '2014'
...
---
_id: '475'
abstract:
- lang: eng
text: 'First cycle games (FCG) are played on a finite graph by two players who push
a token along the edges until a vertex is repeated, and a simple cycle is formed.
The winner is determined by some fixed property Y of the sequence of labels of
the edges (or nodes) forming this cycle. These games are traditionally of interest
because of their connection with infinite-duration games such as parity and mean-payoff
games. We study the memory requirements for winning strategies of FCGs and certain
associated infinite duration games. We exhibit a simple FCG that is not memoryless
determined (this corrects a mistake in Memoryless determinacy of parity and mean
payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims
that FCGs for which Y is closed under cyclic permutations are memoryless determined).
We show that θ (n)! memory (where n is the number of nodes in the graph), which
is always sufficient, may be necessary to win some FCGs. On the other hand, we
identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations,
and both Y and its complement are closed under concatenation) that are sufficient
to ensure that the corresponding FCGs and their associated infinite duration games
are memoryless determined. We demonstrate that many games considered in the literature,
such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity
side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE,
solving some families of FCGs is PSPACE-hard. '
alternative_title:
- EPTCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical
Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90.
doi:10.4204/EPTCS.146.11'
apa: 'Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings
in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France:
Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11'
chicago: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic
Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing
Association, 2014. https://doi.org/10.4204/EPTCS.146.11.
ieee: B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings
in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146,
pp. 83–90.
ista: 'Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical
Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.'
mla: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings
in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association,
2014, pp. 83–90, doi:10.4204/EPTCS.146.11.
short: B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer
Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
conference:
end_date: 2014-04-06
location: Grenoble, France
name: 'SR: Strategic Reasoning'
start_date: 2014-04-05
corr_author: '1'
date_created: 2018-12-11T11:46:41Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2025-04-14T13:51:05Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.146.11
ec_funded: 1
external_id:
arxiv:
- '1404.0843'
file:
- access_level: open_access
checksum: 4d7b4ab82980cca2b96ac7703992a8c8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:08Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5260'
file_name: IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf
file_size: 100115
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 146'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 83 - 90
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _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: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing Association
publist_id: '7345'
pubrep_id: '952'
quality_controlled: '1'
scopus_import: '1'
status: public
title: First cycle games
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: 146
year: '2014'
...
---
_id: '535'
abstract:
- lang: eng
text: Energy games belong to a class of turn-based two-player infinite-duration
games played on a weighted directed graph. It is one of the rare and intriguing
combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The
existence of polynomial-time algorithms has been a major open problem for decades
and apart from pseudopolynomial algorithms there is no algorithm that solves any
non-trivial subclass in polynomial time. In this paper, we give several results
based on the weight structures of the graph. First, we identify a notion of penalty
and present a polynomial-time algorithm when the penalty is large. Our algorithm
is the first polynomial-time algorithm on a large class of weighted graphs. It
includes several worst-case instances on which previous algorithms, such as value
iteration and random facet algorithms, require at least sub-exponential time.
Our main technique is developing the first non-trivial approximation algorithm
and showing how to convert it to an exact algorithm. Moreover, we show that in
a practical case in verification where weights are clustered around a constant
number of values, the energy game problem can be solved in polynomial time. We
also show that the problem is still as hard as in general when the clique-width
is bounded or the graph is strongly ergodic, suggesting that restricting the graph
structure does not necessarily help.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. Polynomial-time algorithms
for energy games with special weight structures. Algorithmica. 2014;70(3):457-492.
doi:10.1007/s00453-013-9843-7
apa: Chatterjee, K., Henzinger, M., Krinninger, S., & Nanongkai, D. (2014).
Polynomial-time algorithms for energy games with special weight structures. Algorithmica.
Springer. https://doi.org/10.1007/s00453-013-9843-7
chicago: Chatterjee, Krishnendu, Monika Henzinger, Sebastian Krinninger, and Danupon
Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”
Algorithmica. Springer, 2014. https://doi.org/10.1007/s00453-013-9843-7.
ieee: K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time
algorithms for energy games with special weight structures,” Algorithmica,
vol. 70, no. 3. Springer, pp. 457–492, 2014.
ista: Chatterjee K, Henzinger M, Krinninger S, Nanongkai D. 2014. Polynomial-time
algorithms for energy games with special weight structures. Algorithmica. 70(3),
457–492.
mla: Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games
with Special Weight Structures.” Algorithmica, vol. 70, no. 3, Springer,
2014, pp. 457–92, doi:10.1007/s00453-013-9843-7.
short: K. Chatterjee, M. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70
(2014) 457–492.
date_created: 2018-12-11T11:47:01Z
date_published: 2014-11-01T00:00:00Z
date_updated: 2025-09-29T13:18:38Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s00453-013-9843-7
ec_funded: 1
external_id:
arxiv:
- '1604.08234'
isi:
- '000340552300005'
intvolume: ' 70'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.08234
month: '11'
oa: 1
oa_version: Preprint
page: 457 - 492
project:
- _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: Algorithmica
publication_status: published
publisher: Springer
publist_id: '7282'
quality_controlled: '1'
related_material:
record:
- id: '10905'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Polynomial-time algorithms for energy games with special weight structures
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 70
year: '2014'
...
---
_id: '537'
abstract:
- lang: eng
text: Transgenerational effects are broader than only parental relationships. Despite
mounting evidence that multigenerational effects alter phenotypic and life-history
traits, our understanding of how they combine to determine fitness is not well
developed because of the added complexity necessary to study them. Here, we derive
a quantitative genetic model of adaptation to an extraordinary new environment
by an additive genetic component, phenotypic plasticity, maternal and grandmaternal
effects. We show how, at equilibrium, negative maternal and negative grandmaternal
effects maximize expected population mean fitness. We define negative transgenerational
effects as those that have a negative effect on trait expression in the subsequent
generation, that is, they slow, or potentially reverse, the expected evolutionary
dynamic. When maternal effects are positive, negative grandmaternal effects are
preferred. As expected under Mendelian inheritance, the grandmaternal effects
have a lower impact on fitness than the maternal effects, but this dual inheritance
model predicts a more complex relationship between maternal and grandmaternal
effects to constrain phenotypic variance and so maximize expected population mean
fitness in the offspring.
article_processing_charge: No
author:
- first_name: Roshan
full_name: Prizak, Roshan
id: 4456104E-F248-11E8-B48F-1D18A9856A87
last_name: Prizak
- first_name: Thomas
full_name: Ezard, Thomas
last_name: Ezard
- first_name: Rebecca
full_name: Hoyle, Rebecca
last_name: Hoyle
citation:
ama: Prizak R, Ezard T, Hoyle R. Fitness consequences of maternal and grandmaternal
effects. Ecology and Evolution. 2014;4(15):3139-3145. doi:10.1002/ece3.1150
apa: Prizak, R., Ezard, T., & Hoyle, R. (2014). Fitness consequences of maternal
and grandmaternal effects. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.1150
chicago: Prizak, Roshan, Thomas Ezard, and Rebecca Hoyle. “Fitness Consequences
of Maternal and Grandmaternal Effects.” Ecology and Evolution. Wiley-Blackwell,
2014. https://doi.org/10.1002/ece3.1150.
ieee: R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal
effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145,
2014.
ista: Prizak R, Ezard T, Hoyle R. 2014. Fitness consequences of maternal and grandmaternal
effects. Ecology and Evolution. 4(15), 3139–3145.
mla: Prizak, Roshan, et al. “Fitness Consequences of Maternal and Grandmaternal
Effects.” Ecology and Evolution, vol. 4, no. 15, Wiley-Blackwell, 2014,
pp. 3139–45, doi:10.1002/ece3.1150.
short: R. Prizak, T. Ezard, R. Hoyle, Ecology and Evolution 4 (2014) 3139–3145.
date_created: 2018-12-11T11:47:02Z
date_published: 2014-07-19T00:00:00Z
date_updated: 2025-09-29T13:17:53Z
day: '19'
ddc:
- '530'
- '571'
department:
- _id: NiBa
- _id: GaTk
doi: 10.1002/ece3.1150
external_id:
isi:
- '000340575000015'
file:
- access_level: open_access
checksum: e32abf75a248e7a11811fd7f60858769
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:31Z
date_updated: 2020-07-14T12:46:38Z
file_id: '4886'
file_name: IST-2018-934-v1+1_Prizak_et_al-2014-Ecology_and_Evolution.pdf
file_size: 621582
relation: main_file
file_date_updated: 2020-07-14T12:46:38Z
has_accepted_license: '1'
intvolume: ' 4'
isi: 1
issue: '15'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 3139 - 3145
publication: Ecology and Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7280'
pubrep_id: '934'
scopus_import: '1'
status: public
title: Fitness consequences of maternal and grandmaternal effects
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 4
year: '2014'
...
---
_id: '5411'
abstract:
- lang: eng
text: "Model-based testing is a promising technology for black-box software and
hardware testing, in which test cases are generated automatically from high-level
specifications. Nowadays, systems typically consist of multiple interacting components
and, due to their complexity, testing presents a considerable portion of the effort
and cost in the design process. Exploiting the compositional structure of system
specifications can considerably reduce the effort in model-based testing. Moreover,
inferring properties about the system from testing its individual components allows
the designer to reduce the amount of integration testing.\r\nIn this paper, we
study compositional properties of the IOCO-testing theory. We propose a new approach
to composition and hiding operations, inspired by contract-based design and interface
theories. These operations preserve behaviors that are compatible under composition
and hiding, and prune away incompatible ones. The resulting specification characterizes
the input sequences for which the unit testing of components is sufficient to
infer the correctness of component integration without the need for further tests.
We provide a methodology that uses these results to minimize integration testing
effort, but also to detect potential weaknesses in specifications. While we focus
on asynchronous models and the IOCO conformance relation, the resulting methodology
can be applied to a broader class of systems."
alternative_title:
- IST Austria Technical Report
author:
- 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: Willibald
full_name: Krenn, Willibald
last_name: Krenn
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional Specifications
for IOCO Testing. IST Austria; 2014. doi:10.15479/AT:IST-2014-148-v2-1
apa: Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). Compositional
specifications for IOCO testing. IST Austria. https://doi.org/10.15479/AT:IST-2014-148-v2-1
chicago: Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic.
Compositional Specifications for IOCO Testing. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-148-v2-1.
ieee: P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, Compositional specifications
for IOCO testing. IST Austria, 2014.
ista: Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications
for IOCO testing, IST Austria, 20p.
mla: Daca, Przemyslaw, et al. Compositional Specifications for IOCO Testing.
IST Austria, 2014, doi:10.15479/AT:IST-2014-148-v2-1.
short: P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, Compositional Specifications
for IOCO Testing, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-01-28T00:00:00Z
date_updated: 2025-09-29T11:40:47Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-148-v2-1
file:
- access_level: open_access
checksum: 0e03aba625cc334141a3148432aa5760
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:21Z
date_updated: 2020-07-14T12:46:46Z
file_id: '5543'
file_name: IST-2014-148-v2+1_main_tr.pdf
file_size: 534732
relation: main_file
file_date_updated: 2020-07-14T12:46:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '152'
related_material:
record:
- id: '2167'
relation: later_version
status: public
status: public
title: Compositional specifications for IOCO testing
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5412'
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.\r\nWe introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph theoretic algorithms with quadratic complexity to compute the simulation
relation.\r\nWe present an automated technique for assume-guarantee style reasoning
for compositional analysis of MDPs with qualitative properties by giving a counter-example
guided abstraction-refinement approach to compute our new simulation relation.
We have implemented our algorithms and show that the compositional analysis leads
to significant improvements. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
citation:
ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v1-1
apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative
analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1
chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for
Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v1-1.
ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis
of probabilistic systems. IST Austria, 2014.
ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
systems, IST Austria, 31p.
mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v1-1.
short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-01-29T00:00:00Z
date_updated: 2025-04-15T07:56:48Z
day: '29'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v1-1
file:
- access_level: open_access
checksum: 4d6cda4bebed970926403ad6ad8c745f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:39Z
date_updated: 2020-07-14T12:46:47Z
file_id: '5500'
file_name: IST-2014-153-v1+1_main.pdf
file_size: 423322
relation: main_file
file_date_updated: 2020-07-14T12:46:47Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '31'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '153'
related_material:
record:
- id: '5413'
relation: later_version
status: public
- id: '5414'
relation: later_version
status: public
- id: '2063'
relation: later_version
status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5413'
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.\r\nWe introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph theoretic algorithms with quadratic complexity to compute the simulation
relation.\r\nWe present an automated technique for assume-guarantee style reasoning
for compositional analysis of MDPs with qualitative properties by giving a counter-example
guided abstraction-refinement approach to compute our new simulation relation.
We have implemented our algorithms and show that the compositional analysis leads
to significant improvements. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
citation:
ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v2-2
apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative
analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2
chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for
Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v2-2.
ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis
of probabilistic systems. IST Austria, 2014.
ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
systems, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v2-2.
short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:11Z
date_published: 2014-02-06T00:00:00Z
date_updated: 2025-04-15T07:56:48Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v2-2
file:
- access_level: open_access
checksum: ce4967a184d84863eec76c66cbac1614
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:17Z
date_updated: 2020-07-14T12:46:47Z
file_id: '5539'
file_name: IST-2014-153-v2+2_main.pdf
file_size: 606049
relation: main_file
file_date_updated: 2020-07-14T12:46:47Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '164'
related_material:
record:
- id: '5412'
relation: earlier_version
status: public
- id: '5414'
relation: later_version
status: public
- id: '2063'
relation: later_version
status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5414'
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.\r\nWe introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph theoretic algorithms with quadratic complexity to compute the simulation
relation.\r\nWe present an automated technique for assume-guarantee style reasoning
for compositional analysis of MDPs with qualitative properties by giving a counter-example
guided abstraction-refinement approach to compute our new simulation relation.
\r\nWe have implemented our algorithms and show that the compositional analysis
leads to significant improvements. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
citation:
ama: Chatterjee K, Daca P, Chmelik M. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria; 2014. doi:10.15479/AT:IST-2014-153-v3-1
apa: Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative
analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1
chicago: Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for
Qualitative Analysis of Probabilistic Systems. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-153-v3-1.
ieee: K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis
of probabilistic systems. IST Austria, 2014.
ista: Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic
systems, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. CEGAR for Qualitative Analysis of Probabilistic
Systems. IST Austria, 2014, doi:10.15479/AT:IST-2014-153-v3-1.
short: K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic
Systems, IST Austria, 2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-07T00:00:00Z
date_updated: 2025-04-15T07:56:48Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-153-v3-1
file:
- access_level: open_access
checksum: 87b93fe9af71fc5c94b0eb6151537e11
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:03Z
date_updated: 2020-07-14T12:46:48Z
file_id: '5464'
file_name: IST-2014-153-v3+1_main.pdf
file_size: 606227
relation: main_file
file_date_updated: 2020-07-14T12:46:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '165'
related_material:
record:
- id: '5412'
relation: earlier_version
status: public
- id: '5413'
relation: earlier_version
status: public
- id: '2063'
relation: later_version
status: public
status: public
title: CEGAR for qualitative analysis of probabilistic systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5415'
abstract:
- lang: eng
text: 'Recently there has been a significant effort to add quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, several basic system properties such as average
response time cannot be expressed with weighted automata. In this work, we introduce
nested weighted automata as a new formalism for expressing important quantitative
properties such as average response time. We establish an almost complete decidability
picture for the basic decision problems for nested weighted automata, and illustrate
its applicability in several domains. '
alternative_title:
- IST Austria Technical Report
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria;
2014. doi:10.15479/AT:IST-2014-170-v1-1
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2014). Nested weighted
automata. IST Austria. https://doi.org/10.15479/AT:IST-2014-170-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted
Automata. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-170-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata.
IST Austria, 2014.
ista: Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria,
27p.
mla: Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria,
2014, doi:10.15479/AT:IST-2014-170-v1-1.
short: K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria,
2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2025-09-23T09:39:58Z
day: '19'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2014-170-v1-1
file:
- access_level: open_access
checksum: 31f90dcf2cf899c3f8c6427cfcc2b3c7
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:36Z
date_updated: 2020-07-14T12:46:48Z
file_id: '5497'
file_name: IST-2014-170-v1+1_main.pdf
file_size: 573457
relation: main_file
file_date_updated: 2020-07-14T12:46:48Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '170'
related_material:
record:
- id: '5436'
relation: later_version
status: public
- id: '467'
relation: later_version
status: public
- id: '1656'
relation: later_version
status: public
status: public
title: Nested weighted automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5416'
abstract:
- lang: eng
text: As hybrid systems involve continuous behaviors, they should be evaluated by
quantitative methods, rather than qualitative methods. In this paper we adapt
a quantitative framework, called model measuring, to the hybrid systems domain.
The model-measuring problem asks, given a model M and a specification, what is
the maximal distance such that all models within that distance from M satisfy
(or violate) the specification. A distance function on models is given as part
of the input of the problem. Distances, especially related to continuous behaviors
are more natural in the hybrid case than the discrete case. We are interested
in distances represented by monotonic hybrid automata, a hybrid counterpart of
(discrete) weighted automata, whose recognized timed languages are monotone (w.r.t.
inclusion) in the values of parameters.The contributions of this paper are twofold.
First, we give sufficient conditions under which the model-measuring problem can
be solved. Second, we discuss the modeling of distances and applications of the
model-measuring problem.
alternative_title:
- IST Austria Technical Report
author:
- 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: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Henzinger TA, Otop J. Model Measuring for Hybrid Systems. IST Austria;
2014. doi:10.15479/AT:IST-2014-171-v1-1
apa: Henzinger, T. A., & Otop, J. (2014). Model measuring for hybrid systems.
IST Austria. https://doi.org/10.15479/AT:IST-2014-171-v1-1
chicago: Henzinger, Thomas A, and Jan Otop. Model Measuring for Hybrid Systems.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-171-v1-1.
ieee: T. A. Henzinger and J. Otop, Model measuring for hybrid systems. IST
Austria, 2014.
ista: Henzinger TA, Otop J. 2014. Model measuring for hybrid systems, IST Austria,
22p.
mla: Henzinger, Thomas A., and Jan Otop. Model Measuring for Hybrid Systems.
IST Austria, 2014, doi:10.15479/AT:IST-2014-171-v1-1.
short: T.A. Henzinger, J. Otop, Model Measuring for Hybrid Systems, IST Austria,
2014.
date_created: 2018-12-12T11:39:12Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2025-06-26T08:32:32Z
day: '19'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-171-v1-1
file:
- access_level: open_access
checksum: 445456d22371e4e49aad2b9a0c13bf80
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:32Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5492'
file_name: IST-2014-171-v1+1_report.pdf
file_size: 712077
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '171'
related_material:
record:
- id: '2217'
relation: later_version
status: public
status: public
title: Model measuring for hybrid systems
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5417'
abstract:
- lang: eng
text: "We define the model-measuring problem: given a model M and specification
φ, what is the maximal distance ρ such that all models M'within distance ρ from
M satisfy (or violate)φ. The model measuring problem presupposes a distance function
on models. We concentrate on automatic distance functions, which are defined by
weighted automata.\r\nThe model-measuring problem subsumes several generalizations
of the classical model-checking problem, in particular, quantitative model-checking
problems that measure the degree of satisfaction of a specification, and robustness
problems that measure how much a model can be perturbed without violating the
specification.\r\nWe show that for automatic distance functions, and ω-regular
linear-time and branching-time specifications, the model-measuring problem can
be solved.\r\nWe use automata-theoretic model-checking methods for model measuring,
replacing the emptiness question for standard word and tree automata by the optimal-weight
question for the weighted versions of these automata. We consider weighted automata
that accumulate weights by maximizing, summing, discounting, and limit averaging.
\r\nWe give several examples of using the model-measuring problem to compute various
notions of robustness and quantitative satisfaction for temporal specifications."
alternative_title:
- IST Austria Technical Report
author:
- 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: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Henzinger TA, Otop J. From Model Checking to Model Measuring. IST Austria;
2014. doi:10.15479/AT:IST-2014-172-v1-1
apa: Henzinger, T. A., & Otop, J. (2014). From model checking to model measuring.
IST Austria. https://doi.org/10.15479/AT:IST-2014-172-v1-1
chicago: Henzinger, Thomas A, and Jan Otop. From Model Checking to Model Measuring.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-172-v1-1.
ieee: T. A. Henzinger and J. Otop, From model checking to model measuring.
IST Austria, 2014.
ista: Henzinger TA, Otop J. 2014. From model checking to model measuring, IST Austria,
14p.
mla: Henzinger, Thomas A., and Jan Otop. From Model Checking to Model Measuring.
IST Austria, 2014, doi:10.15479/AT:IST-2014-172-v1-1.
short: T.A. Henzinger, J. Otop, From Model Checking to Model Measuring, IST Austria,
2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-02-19T00:00:00Z
date_updated: 2024-10-21T06:02:58Z
day: '19'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2014-172-v1-1
file:
- access_level: open_access
checksum: fcc3eab903cfcd3778b338d2d0d44d18
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:20Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5481'
file_name: IST-2014-172-v1+1_report.pdf
file_size: 383052
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '14'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '175'
related_material:
record:
- id: '2327'
relation: later_version
status: public
status: public
title: From model checking to model measuring
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '5418'
abstract:
- lang: eng
text: We consider multi-player graph games with partial-observation and parity objective.
While the decision problem for three-player games with a coalition of the first
and second players against the third player is undecidable, we present a decidability
result for partial-observation games where the first and third player are in a
coalition against the second player, thus where the second player is adversarial
but weaker due to partial-observation. We establish tight complexity bounds in
the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness
for parity objectives. The symmetric case of player 1 more informed than player
2 is much more complicated, and we show that already in the case where player
1 has perfect observation, memory of size non-elementary is necessary in general
for reachability objectives, and the problem is decidable for safety and reachability
objectives. Our results have tight connections with partial-observation stochastic
games for which we derive new complexity results.
alternative_title:
- IST Austria Technical Report
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. Games with a Weak Adversary. IST Austria; 2014.
doi:10.15479/AT:IST-2014-176-v1-1
apa: Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary.
IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1
chicago: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary.
IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-176-v1-1.
ieee: K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria,
2014.
ista: Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
mla: Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary.
IST Austria, 2014, doi:10.15479/AT:IST-2014-176-v1-1.
short: K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.
date_created: 2018-12-12T11:39:13Z
date_published: 2014-03-22T00:00:00Z
date_updated: 2025-04-15T07:55:59Z
day: '22'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2014-176-v1-1
file:
- access_level: open_access
checksum: 1d6958aa60050e1c3e932c6e5f34c39f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:07Z
date_updated: 2020-07-14T12:46:49Z
file_id: '5468'
file_name: IST-2014-176-v1+1_icalp_14.pdf
file_size: 328253
relation: main_file
file_date_updated: 2020-07-14T12:46:49Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '176'
related_material:
record:
- id: '2163'
relation: later_version
status: public
status: public
title: Games with a weak adversary
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...