---
_id: '2000'
abstract:
- lang: eng
text: In this work we present a flexible tool for tumor progression, which simulates
the evolutionary dynamics of cancer. Tumor progression implements a multi-type
branching process where the key parameters are the fitness landscape, the mutation
rate, and the average time of cell division. The fitness of a cancer cell depends
on the mutations it has accumulated. The input to our tool could be any fitness
landscape, mutation rate, and cell division time, and the tool produces the growth
dynamics and all relevant statistics.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Reiter J, Božić I, Chatterjee K, Nowak M. TTP: Tool for tumor progression.
In: Proceedings of 25th Int. Conf. on Computer Aided Verification. Vol
8044. Lecture Notes in Computer Science. Springer; 2013:101-106. doi:10.1007/978-3-642-39799-8_6'
apa: 'Reiter, J., Božić, I., Chatterjee, K., & Nowak, M. (2013). TTP: Tool for
tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification
(Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_6'
chicago: 'Reiter, Johannes, Ivana Božić, Krishnendu Chatterjee, and Martin Nowak.
“TTP: Tool for Tumor Progression.” In Proceedings of 25th Int. Conf. on Computer
Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer,
2013. https://doi.org/10.1007/978-3-642-39799-8_6.'
ieee: 'J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,”
in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg,
Russia, 2013, vol. 8044, pp. 101–106.'
ista: 'Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression.
Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided
VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.'
mla: 'Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.” Proceedings
of 25th Int. Conf. on Computer Aided Verification, vol. 8044, Springer, 2013,
pp. 101–06, doi:10.1007/978-3-642-39799-8_6.'
short: J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int.
Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
conference:
end_date: 2013-07-19
location: St. Petersburg, Russia
name: 'CAV: Computer Aided Verification'
start_date: 2013-07-13
date_created: 2018-12-11T11:55:08Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2026-07-29T10:15:25Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-39799-8_6
ec_funded: 1
external_id:
arxiv:
- '1303.5251'
fulldoi: https://doi.org/10.1007/978-3-642-39799-8_6
intvolume: ' 8044'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1303.5251
month: '01'
oa: 1
oa_version: Preprint
page: 101 - 106
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of 25th Int. Conf. on Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '5077'
quality_controlled: '1'
related_material:
record:
- id: '5399'
relation: earlier_version
status: public
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'TTP: Tool for tumor progression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8044
year: '2013'
...
---
_id: '450'
abstract:
- lang: eng
text: Understanding the relative importance of heterosis and outbreeding depression
over multiple generations is a key question in evolutionary biology and is essential
for identifying appropriate genetic sources for population and ecosystem restoration.
Here we use 2455 experimental crosses between 12 population pairs of the rare
perennial plant Rutidosis leptorrhynchoides (Asteraceae) to investigate the multi-generational
(F1, F2, F3) fitness outcomes of inter-population hybridization. We detected no
evidence of outbreeding depression, with inter-population hybrids and backcrosses
showing either similar fitness or significant heterosis for fitness components
across the three generations. Variation in heterosis among population pairs was
best explained by characteristics of the foreign source or home population, and
was greatest when the source population was large, with high genetic diversity
and low inbreeding, and the home population was small and inbred. Our results
indicate that the primary consideration for maximizing progeny fitness following
population augmentation or restoration is the use of seed from large, genetically
diverse populations.
article_number: '2058'
article_processing_charge: No
author:
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
- first_name: David
full_name: Rowell, David
last_name: Rowell
- first_name: Andrew
full_name: Young, Andrew
last_name: Young
citation:
ama: Pickup M, Field D, Rowell D, Young A. Source population characteristics affect
heterosis following genetic rescue of fragmented plant populations. Proceedings
of the Royal Society of London Series B Biological Sciences. 2013;280(1750).
doi:10.1098/rspb.2012.2058
apa: Pickup, M., Field, D., Rowell, D., & Young, A. (2013). Source population
characteristics affect heterosis following genetic rescue of fragmented plant
populations. Proceedings of the Royal Society of London Series B Biological
Sciences. Royal Society. https://doi.org/10.1098/rspb.2012.2058
chicago: Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Source Population
Characteristics Affect Heterosis Following Genetic Rescue of Fragmented Plant
Populations.” Proceedings of the Royal Society of London Series B Biological
Sciences. Royal Society, 2013. https://doi.org/10.1098/rspb.2012.2058.
ieee: M. Pickup, D. Field, D. Rowell, and A. Young, “Source population characteristics
affect heterosis following genetic rescue of fragmented plant populations,” Proceedings
of the Royal Society of London Series B Biological Sciences, vol. 280, no.
1750. Royal Society, 2013.
ista: Pickup M, Field D, Rowell D, Young A. 2013. Source population characteristics
affect heterosis following genetic rescue of fragmented plant populations. Proceedings
of the Royal Society of London Series B Biological Sciences. 280(1750), 2058.
mla: Pickup, Melinda, et al. “Source Population Characteristics Affect Heterosis
Following Genetic Rescue of Fragmented Plant Populations.” Proceedings of the
Royal Society of London Series B Biological Sciences, vol. 280, no. 1750,
2058, Royal Society, 2013, doi:10.1098/rspb.2012.2058.
short: M. Pickup, D. Field, D. Rowell, A. Young, Proceedings of the Royal Society
of London Series B Biological Sciences 280 (2013).
corr_author: '1'
date_created: 2018-12-11T11:46:32Z
date_published: 2013-01-07T00:00:00Z
date_updated: 2026-08-12T06:25:53Z
day: '07'
department:
- _id: NiBa
doi: 10.1098/rspb.2012.2058
external_id:
isi:
- '000311943100012'
pmid:
- '23173202'
fulldoi: https://doi.org/10.1098/rspb.2012.2058
intvolume: ' 280'
isi: 1
issue: '1750'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3574427/
month: '01'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Proceedings of the Royal Society of London Series B Biological Sciences
publication_status: published
publisher: Royal Society
publist_id: '7372'
quality_controlled: '1'
status: public
title: Source population characteristics affect heterosis following genetic rescue
of fragmented plant populations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 280
year: '2013'
...
---
_id: '2811'
abstract:
- lang: eng
text: 'In pipe, channel, and boundary layer flows turbulence first occurs intermittently
in space and time: at moderate Reynolds numbers domains of disordered turbulent
motion are separated by quiescent laminar regions. Based on direct numerical simulations
of pipe flow we argue here that the spatial intermittency has its origin in a
nearest neighbor interaction between turbulent regions. We further show that in
this regime turbulent flows are intrinsically intermittent with a well-defined
equilibrium turbulent fraction but without ever assuming a steady pattern. This
transition scenario is analogous to that found in simple models such as coupled
map lattices. The scaling observed implies that laminar intermissions of the turbulent
flow will persist to arbitrarily large Reynolds numbers.'
article_number: '063012'
article_processing_charge: No
arxiv: 1
author:
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- 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: Avila M, Hof B. Nature of laminar-turbulence intermittency in shear flows.
Physical Review E. 2013;87(6). doi:10.1103/PhysRevE.87.063012
apa: Avila, M., & Hof, B. (2013). Nature of laminar-turbulence intermittency
in shear flows. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.87.063012
chicago: Avila, Marc, and Björn Hof. “Nature of Laminar-Turbulence Intermittency
in Shear Flows.” Physical Review E. American Physical Society, 2013. https://doi.org/10.1103/PhysRevE.87.063012.
ieee: M. Avila and B. Hof, “Nature of laminar-turbulence intermittency in shear
flows,” Physical Review E, vol. 87, no. 6. American Physical Society, 2013.
ista: Avila M, Hof B. 2013. Nature of laminar-turbulence intermittency in shear
flows. Physical Review E. 87(6), 063012.
mla: Avila, Marc, and Björn Hof. “Nature of Laminar-Turbulence Intermittency in
Shear Flows.” Physical Review E, vol. 87, no. 6, 063012, American Physical
Society, 2013, doi:10.1103/PhysRevE.87.063012.
short: M. Avila, B. Hof, Physical Review E 87 (2013).
date_created: 2018-12-11T11:59:43Z
date_published: 2013-06-18T00:00:00Z
date_updated: 2026-08-12T14:29:19Z
day: '18'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.87.063012
ec_funded: 1
external_id:
arxiv:
- '1306.5890'
isi:
- '000320645700009'
fulldoi: https://doi.org/10.1103/PhysRevE.87.063012
intvolume: ' 87'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1306.5890
month: '06'
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: Physical Review E
publication_status: published
publisher: American Physical Society
publist_id: '4074'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nature of laminar-turbulence intermittency in shear flows
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 87
year: '2013'
...
---
_id: '10896'
abstract:
- lang: eng
text: Under physiological conditions the brain, via the purine salvage pathway,
reuses the preformed purine bases hypoxanthine, derived from ATP degradation,
and adenine (Ade), derived from polyamine synthesis, to restore its ATP pool.
However, the massive degradation of ATP during ischemia, although providing valuable
neuroprotective adenosine, results in the accumulation and loss of diffusible
purine metabolites and thereby leads to a protracted reduction in the post-ischemic
ATP pool size. In vivo, this may both limit the ability to deploy ATP-dependent
reparative mechanisms and reduce the subsequent availability of adenosine, whilst
in brain slices results in tissue with substantially lower levels of ATP than
in vivo. In the present review, we describe the mechanisms by which brain tissue
replenishes its ATP, how this can be improved with the clinically tolerated chemicals
D-ribose and adenine, and the functional, and potential therapeutic, implications
of doing so.
acknowledgement: We are grateful to Research into Ageing/Ageing UK and The Dunhill
Trust for funding SzN’s graduate studies, and to Prof Nicholas Dale for his valuable
input.
article_processing_charge: No
author:
- first_name: Stephanie
full_name: zur Nedden, Stephanie
id: 3C77F464-F248-11E8-B48F-1D18A9856A87
last_name: zur Nedden
- first_name: Alexander S.
full_name: Doney, Alexander S.
last_name: Doney
- first_name: Bruno G.
full_name: Frenguelli, Bruno G.
last_name: Frenguelli
citation:
ama: 'zur Nedden S, Doney AS, Frenguelli BG. The double-edged sword: Gaining Adenosine
at the expense of ATP. How to balance the books. In: Masino S, Boison D, eds.
Adenosine. 1st ed. New York: Springer; 2012:109-129. doi:10.1007/978-1-4614-3903-5_6'
apa: 'zur Nedden, S., Doney, A. S., & Frenguelli, B. G. (2012). The double-edged
sword: Gaining Adenosine at the expense of ATP. How to balance the books. In S.
Masino & D. Boison (Eds.), Adenosine (1st ed., pp. 109–129). New York:
Springer. https://doi.org/10.1007/978-1-4614-3903-5_6'
chicago: 'Nedden, Stephanie zur, Alexander S. Doney, and Bruno G. Frenguelli. “The
Double-Edged Sword: Gaining Adenosine at the Expense of ATP. How to Balance the
Books.” In Adenosine, edited by Susan Masino and Detlev Boison, 1st ed.,
109–29. New York: Springer, 2012. https://doi.org/10.1007/978-1-4614-3903-5_6.'
ieee: 'S. zur Nedden, A. S. Doney, and B. G. Frenguelli, “The double-edged sword:
Gaining Adenosine at the expense of ATP. How to balance the books,” in Adenosine,
1st ed., S. Masino and D. Boison, Eds. New York: Springer, 2012, pp. 109–129.'
ista: 'zur Nedden S, Doney AS, Frenguelli BG. 2012.The double-edged sword: Gaining
Adenosine at the expense of ATP. How to balance the books. In: Adenosine. , 109–129.'
mla: 'zur Nedden, Stephanie, et al. “The Double-Edged Sword: Gaining Adenosine at
the Expense of ATP. How to Balance the Books.” Adenosine, edited by Susan
Masino and Detlev Boison, 1st ed., Springer, 2012, pp. 109–29, doi:10.1007/978-1-4614-3903-5_6.'
short: S. zur Nedden, A.S. Doney, B.G. Frenguelli, in:, S. Masino, D. Boison (Eds.),
Adenosine, 1st ed., Springer, New York, 2012, pp. 109–129.
date_created: 2022-03-21T07:16:12Z
date_published: 2012-07-23T00:00:00Z
date_updated: 2022-06-21T11:51:58Z
day: '23'
department:
- _id: HaJa
doi: 10.1007/978-1-4614-3903-5_6
edition: '1'
editor:
- first_name: Susan
full_name: Masino, Susan
last_name: Masino
- first_name: Detlev
full_name: Boison, Detlev
last_name: Boison
fulldoi: https://doi.org/10.1007/978-1-4614-3903-5_6
language:
- iso: eng
month: '07'
oa_version: None
page: 109-129
place: New York
publication: Adenosine
publication_identifier:
eisbn:
- '9781461439035'
isbn:
- '9781461439028'
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The double-edged sword: Gaining Adenosine at the expense of ATP. How to balance
the books'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '10903'
abstract:
- lang: eng
text: We propose a logic-based framework for automated reasoning about sequential
programs manipulating singly-linked lists and arrays with unbounded data. We introduce
the logic SLAD, which allows combining shape constraints, written in a fragment
of Separation Logic, with data and size constraints. We address the problem of
checking the entailment between SLAD formulas, which is crucial in performing
pre-post condition reasoning. Although this problem is undecidable in general
for SLAD, we propose a sound and powerful procedure that is able to solve this
problem for a large class of formulas, beyond the capabilities of existing techniques
and tools. We prove that this procedure is complete, i.e., it is actually a decision
procedure for this problem, for an important fragment of SLAD including known
decidable logics. We implemented this procedure and shown its preciseness and
its efficiency on a significant benchmark of formulas.
acknowledgement: This work has been partially supported by the French ANR project
Veridyc
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ahmed
full_name: Bouajjani, Ahmed
last_name: Bouajjani
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Constantin
full_name: Enea, Constantin
last_name: Enea
- first_name: Mihaela
full_name: Sighireanu, Mihaela
last_name: Sighireanu
citation:
ama: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for
programs manipulating lists and arrays with infinite data. In: Automated Technology
for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer;
2012:167-182. doi:10.1007/978-3-642-33386-6_14'
apa: 'Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Accurate
invariant checking for programs manipulating lists and arrays with infinite data.
In Automated Technology for Verification and Analysis (Vol. 7561, pp. 167–182).
Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-33386-6_14'
chicago: 'Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu.
“Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite
Data.” In Automated Technology for Verification and Analysis, 7561:167–82.
LNCS. Berlin, Heidelberg: Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_14.'
ieee: A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking
for programs manipulating lists and arrays with infinite data,” in Automated
Technology for Verification and Analysis, Thiruvananthapuram, India, 2012,
vol. 7561, pp. 167–182.
ista: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Accurate invariant checking
for programs manipulating lists and arrays with infinite data. Automated Technology
for Verification and Analysis. ATVA: Automated Technology for Verification and
AnalysisLNCS, LNCS, vol. 7561, 167–182.'
mla: Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating
Lists and Arrays with Infinite Data.” Automated Technology for Verification
and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.
short: A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Automated Technology
for Verification and Analysis, Springer, Berlin, Heidelberg, 2012, pp. 167–182.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, India
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2012-10-03
corr_author: '1'
date_created: 2022-03-21T07:58:39Z
date_published: 2012-10-15T00:00:00Z
date_updated: 2024-10-09T21:02:34Z
day: '15'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33386-6_14
fulldoi: https://doi.org/10.1007/978-3-642-33386-6_14
intvolume: ' 7561'
language:
- iso: eng
month: '10'
oa_version: None
page: 167-182
place: Berlin, Heidelberg
publication: Automated Technology for Verification and Analysis
publication_identifier:
eisbn:
- '9783642333866'
eissn:
- 1611-3349
isbn:
- '9783642333859'
issn:
- 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: Accurate invariant checking for programs manipulating lists and arrays with
infinite data
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 7561
year: '2012'
...
---
_id: '11092'
abstract:
- lang: eng
text: To combat the functional decline of the proteome, cells use the process of
protein turnover to replace potentially impaired polypeptides with new functional
copies. We found that extremely long-lived proteins (ELLPs) did not turn over
in postmitotic cells of the rat central nervous system. These ELLPs were associated
with chromatin and the nuclear pore complex, the central transport channels that
mediate all molecular trafficking in and out of the nucleus. The longevity of
these proteins would be expected to expose them to potentially harmful metabolites,
putting them at risk of accumulating damage over extended periods of time. Thus,
it is possible that failure to maintain proper levels and functional integrity
of ELLPs in nonproliferative cells might contribute to age-related deterioration
in cell and tissue function.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Jeffrey N.
full_name: Savas, Jeffrey N.
last_name: Savas
- first_name: Brandon H.
full_name: Toyama, Brandon H.
last_name: Toyama
- first_name: Tao
full_name: Xu, Tao
last_name: Xu
- first_name: John R.
full_name: Yates, John R.
last_name: Yates
- first_name: Martin W
full_name: HETZER, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: HETZER
orcid: 0000-0002-2111-992X
citation:
ama: Savas JN, Toyama BH, Xu T, Yates JR, Hetzer M. Extremely long-lived nuclear
pore proteins in the rat brain. Science. 2012;335(6071):942-942. doi:10.1126/science.1217421
apa: Savas, J. N., Toyama, B. H., Xu, T., Yates, J. R., & Hetzer, M. (2012).
Extremely long-lived nuclear pore proteins in the rat brain. Science. American
Association for the Advancement of Science. https://doi.org/10.1126/science.1217421
chicago: Savas, Jeffrey N., Brandon H. Toyama, Tao Xu, John R. Yates, and Martin
Hetzer. “Extremely Long-Lived Nuclear Pore Proteins in the Rat Brain.” Science.
American Association for the Advancement of Science, 2012. https://doi.org/10.1126/science.1217421.
ieee: J. N. Savas, B. H. Toyama, T. Xu, J. R. Yates, and M. Hetzer, “Extremely long-lived
nuclear pore proteins in the rat brain,” Science, vol. 335, no. 6071. American
Association for the Advancement of Science, pp. 942–942, 2012.
ista: Savas JN, Toyama BH, Xu T, Yates JR, Hetzer M. 2012. Extremely long-lived
nuclear pore proteins in the rat brain. Science. 335(6071), 942–942.
mla: Savas, Jeffrey N., et al. “Extremely Long-Lived Nuclear Pore Proteins in the
Rat Brain.” Science, vol. 335, no. 6071, American Association for the Advancement
of Science, 2012, pp. 942–942, doi:10.1126/science.1217421.
short: J.N. Savas, B.H. Toyama, T. Xu, J.R. Yates, M. Hetzer, Science 335 (2012)
942–942.
date_created: 2022-04-07T07:52:01Z
date_published: 2012-02-02T00:00:00Z
date_updated: 2025-12-15T10:03:06Z
day: '02'
department:
- _id: MaHe
doi: 10.1126/science.1217421
extern: '1'
external_id:
pmid:
- '22300851'
fulldoi: https://doi.org/10.1126/science.1217421
intvolume: ' 335'
issue: '6071'
language:
- iso: eng
month: '02'
oa_version: None
page: 942-942
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extremely long-lived nuclear pore proteins in the rat brain
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 335
year: '2012'
...
---
_id: '2302'
abstract:
- lang: eng
text: 'We introduce propagation models (PMs), a formalism able to express several
kinds of equations that describe the behavior of biochemical reaction networks.
Furthermore, we introduce the propagation abstract data type (PADT), which separates
concerns regarding different numerical algorithms for the transient analysis of
biochemical reaction networks from concerns regarding their implementation, thus
allowing for portable and efficient solutions. The state of a propagation abstract
data type is given by a vector that assigns mass values to a set of nodes, and
its (next) operator propagates mass values through this set of nodes. We propose
an approximate implementation of the (next) operator, based on threshold abstraction,
which propagates only "significant" mass values and thus achieves a
compromise between efficiency and accuracy. Finally, we give three use cases for
propagation models: the chemical master equation (CME), the reaction rate equation
(RRE), and a hybrid method that combines these two equations. These three applications
use propagation models in order to propagate probabilities and/or expected values
and variances of the model''s variables.'
article_processing_charge: No
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: Maria
full_name: Mateescu, Maria
id: 3B43276C-F248-11E8-B48F-1D18A9856A87
last_name: Mateescu
citation:
ama: Henzinger TA, Mateescu M. The propagation approach for computing biochemical
reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics.
2012;10(2):310-322. doi:10.1109/TCBB.2012.91
apa: Henzinger, T. A., & Mateescu, M. (2012). The propagation approach for computing
biochemical reaction networks. IEEE ACM Transactions on Computational Biology
and Bioinformatics. IEEE. https://doi.org/10.1109/TCBB.2012.91
chicago: Henzinger, Thomas A, and Maria Mateescu. “The Propagation Approach for
Computing Biochemical Reaction Networks.” IEEE ACM Transactions on Computational
Biology and Bioinformatics. IEEE, 2012. https://doi.org/10.1109/TCBB.2012.91.
ieee: T. A. Henzinger and M. Mateescu, “The propagation approach for computing biochemical
reaction networks,” IEEE ACM Transactions on Computational Biology and Bioinformatics,
vol. 10, no. 2. IEEE, pp. 310–322, 2012.
ista: Henzinger TA, Mateescu M. 2012. The propagation approach for computing biochemical
reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics.
10(2), 310–322.
mla: Henzinger, Thomas A., and Maria Mateescu. “The Propagation Approach for Computing
Biochemical Reaction Networks.” IEEE ACM Transactions on Computational Biology
and Bioinformatics, vol. 10, no. 2, IEEE, 2012, pp. 310–22, doi:10.1109/TCBB.2012.91.
short: T.A. Henzinger, M. Mateescu, IEEE ACM Transactions on Computational Biology
and Bioinformatics 10 (2012) 310–322.
corr_author: '1'
date_created: 2018-12-11T11:56:52Z
date_published: 2012-07-03T00:00:00Z
date_updated: 2025-09-29T14:17:43Z
day: '03'
department:
- _id: ToHe
- _id: CaGu
doi: 10.1109/TCBB.2012.91
ec_funded: 1
external_id:
isi:
- '000323504100006'
pmid:
- '22778152'
fulldoi: https://doi.org/10.1109/TCBB.2012.91
intvolume: ' 10'
isi: 1
issue: '2'
language:
- iso: eng
month: '07'
oa_version: None
page: 310 - 322
pmid: 1
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: IEEE ACM Transactions on Computational Biology and Bioinformatics
publication_status: published
publisher: IEEE
publist_id: '4625'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The propagation approach for computing biochemical reaction networks
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 10
year: '2012'
...
---
_id: '2411'
abstract:
- lang: eng
text: The kingdom of fungi provides model organisms for biotechnology, cell biology,
genetics, and life sciences in general. Only when their phylogenetic relationships
are stably resolved, can individual results from fungal research be integrated
into a holistic picture of biology. However, and despite recent progress, many
deep relationships within the fungi remain unclear. Here, we present the first
phylogenomic study of an entire eukaryotic kingdom that uses a consistency criterion
to strengthen phylogenetic conclusions. We reason that branches (splits) recovered
with independent data and different tree reconstruction methods are likely to
reflect true evolutionary relationships. Two complementary phylogenomic data sets
based on 99 fungal genomes and 109 fungal expressed sequence tag (EST) sets analyzed
with four different tree reconstruction methods shed light from different angles
on the fungal tree of life. Eleven additional data sets address specifically the
phylogenetic position of Blastocladiomycota, Ustilaginomycotina, and Dothideomycetes,
respectively. The combined evidence from the resulting trees supports the deep-level
stability of the fungal groups toward a comprehensive natural system of the fungi.
In addition, our analysis reveals methodologically interesting aspects. Enrichment
for EST encoded data-a common practice in phylogenomic analyses-introduces a strong
bias toward slowly evolving and functionally correlated genes. Consequently, the
generalization of phylogenomic data sets as collections of randomly selected genes
cannot be taken for granted. A thorough characterization of the data to assess
possible influences on the tree reconstruction should therefore become a standard
in phylogenomic analyses.
article_processing_charge: No
author:
- first_name: Ingo
full_name: Ebersberger, Ingo
last_name: Ebersberger
- first_name: Ricardo
full_name: De Matos Simoes, Ricardo
last_name: De Matos Simoes
- first_name: Anne
full_name: Kupczok, Anne
id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
last_name: Kupczok
- first_name: Matthias
full_name: Gube, Matthias
last_name: Gube
- first_name: Erika
full_name: Kothe, Erika
last_name: Kothe
- first_name: Kerstin
full_name: Voigt, Kerstin
last_name: Voigt
- first_name: Arndt
full_name: Von Haeseler, Arndt
last_name: Von Haeseler
citation:
ama: Ebersberger I, De Matos Simoes R, Kupczok A, et al. A consistent phylogenetic
backbone for the fungi. Molecular Biology and Evolution. 2012;29(5):1319-1334.
doi:10.1093/molbev/msr285
apa: Ebersberger, I., De Matos Simoes, R., Kupczok, A., Gube, M., Kothe, E., Voigt,
K., & Von Haeseler, A. (2012). A consistent phylogenetic backbone for the
fungi. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msr285
chicago: Ebersberger, Ingo, Ricardo De Matos Simoes, Anne Kupczok, Matthias Gube,
Erika Kothe, Kerstin Voigt, and Arndt Von Haeseler. “A Consistent Phylogenetic
Backbone for the Fungi.” Molecular Biology and Evolution. Oxford University
Press, 2012. https://doi.org/10.1093/molbev/msr285.
ieee: I. Ebersberger et al., “A consistent phylogenetic backbone for the
fungi,” Molecular Biology and Evolution, vol. 29, no. 5. Oxford University
Press, pp. 1319–1334, 2012.
ista: Ebersberger I, De Matos Simoes R, Kupczok A, Gube M, Kothe E, Voigt K, Von
Haeseler A. 2012. A consistent phylogenetic backbone for the fungi. Molecular
Biology and Evolution. 29(5), 1319–1334.
mla: Ebersberger, Ingo, et al. “A Consistent Phylogenetic Backbone for the Fungi.”
Molecular Biology and Evolution, vol. 29, no. 5, Oxford University Press,
2012, pp. 1319–34, doi:10.1093/molbev/msr285.
short: I. Ebersberger, R. De Matos Simoes, A. Kupczok, M. Gube, E. Kothe, K. Voigt,
A. Von Haeseler, Molecular Biology and Evolution 29 (2012) 1319–1334.
date_created: 2018-12-11T11:57:30Z
date_published: 2012-05-01T00:00:00Z
date_updated: 2025-09-30T08:21:34Z
day: '01'
ddc:
- '570'
- '576'
department:
- _id: JoBo
doi: 10.1093/molbev/msr285
external_id:
isi:
- '000303603300004'
file:
- access_level: open_access
checksum: d565dcac27d1736c0c378ea6fcf22d69
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:30Z
date_updated: 2020-07-14T12:45:40Z
file_id: '5013'
file_name: IST-2015-384-v1+1_Mol_Biol_Evol-2012-Ebersberger-1319-34.pdf
file_size: 754922
relation: main_file
file_date_updated: 2020-07-14T12:45:40Z
fulldoi: https://doi.org/10.1093/molbev/msr285
has_accepted_license: '1'
intvolume: ' 29'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1319 - 1334
publication: Molecular Biology and Evolution
publication_status: published
publisher: Oxford University Press
publist_id: '4515'
pubrep_id: '384'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A consistent phylogenetic backbone for the fungi
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 29
year: '2012'
...
---
_id: '2715'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with specifications given as
Büchi (liveness) objectives. We consider the problem of computing the set of almost-sure
winning vertices from where the objective can be ensured with probability 1. We
study for the first time the average case complexity of the classical algorithm
for computing the set of almost-sure winning vertices for MDPs with Büchi objectives.
Our contributions are as follows: First, we show that for MDPs with constant out-degree
the expected number of iterations is at most logarithmic and the average case
running time is linear (as compared to the worst case linear number of iterations
and quadratic time complexity). Second, for the average case analysis over all
MDPs we show that the expected number of iterations is constant and the average
case running time is linear (again as compared to the worst case linear number
of iterations and quadratic time complexity). Finally we also show that given
that all MDPs are equally likely, the probability that the classical algorithm
requires more than constant number of iterations is exponentially small.'
alternative_title:
- LIPIcs
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Manas
full_name: Joglekar, Manas
last_name: Joglekar
- first_name: Nisarg
full_name: Shah, Nisarg
last_name: Shah
citation:
ama: 'Chatterjee K, Joglekar M, Shah N. Average case analysis of the classical algorithm
for Markov decision processes with Büchi objectives. In: Vol 18. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2012:461-473. doi:10.4230/LIPIcs.FSTTCS.2012.461'
apa: 'Chatterjee, K., Joglekar, M., & Shah, N. (2012). Average case analysis
of the classical algorithm for Markov decision processes with Büchi objectives
(Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology
and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461'
chicago: Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case
Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,”
18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461.
ieee: 'K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives,” presented at the
FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad,
India, 2012, vol. 18, pp. 461–473.'
ista: 'Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical
algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 461–473.'
mla: Chatterjee, Krishnendu, et al. Average Case Analysis of the Classical Algorithm
for Markov Decision Processes with Büchi Objectives. Vol. 18, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2012, pp. 461–73, doi:10.4230/LIPIcs.FSTTCS.2012.461.
short: K. Chatterjee, M. Joglekar, N. Shah, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2012, pp. 461–473.
conference:
end_date: 2012-12-17
location: Hyderabad, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2012-12-15
date_created: 2018-12-11T11:59:13Z
date_published: 2012-12-10T00:00:00Z
date_updated: 2025-09-23T08:00:31Z
day: '10'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.FSTTCS.2012.461
ec_funded: 1
file:
- access_level: open_access
checksum: d4d644ed1a885dbfc4fa1ef4c5724dab
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:53Z
date_updated: 2020-07-14T12:45:45Z
file_id: '5040'
file_name: IST-2016-525-v1+1_42_1_.pdf
file_size: 519040
relation: main_file
file_date_updated: 2020-07-14T12:45:45Z
fulldoi: https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461
has_accepted_license: '1'
intvolume: ' 18'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 461 - 473
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_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4180'
pubrep_id: '525'
quality_controlled: '1'
related_material:
record:
- id: '1598'
relation: later_version
status: public
scopus_import: 1
status: public
title: Average case analysis of the classical algorithm for Markov decision processes
with Büchi objectives
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2012'
...
---
_id: '2825'
abstract:
- lang: eng
text: 'We study the problem of maximum marginal prediction (MMP) in probabilistic
graphical models, a task that occurs, for example, as the Bayes optimal decision
rule under a Hamming loss. MMP is typically performed as a two-stage procedure:
one estimates each variable''s marginal probability and then forms a prediction
from the states of maximal probability. In this work we propose a simple yet effective
technique for accelerating MMP when inference is sampling-based: instead of the
above two-stage procedure we directly estimate the posterior probability of each
decision variable. This allows us to identify the point of time when we are sufficiently
certain about any individual decision. Whenever this is the case, we dynamically
prune the variables we are confident about from the underlying factor graph. Consequently,
at any time only samples of variables whose decision is still uncertain need to
be created. Experiments in two prototypical scenarios, multi-label classification
and image inpainting, show that adaptive sampling can drastically accelerate MMP
without sacrificing prediction accuracy.'
article_processing_charge: No
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. Dynamic pruning of factor graphs for maximum marginal prediction.
In: Vol 1. Neural Information Processing Systems Foundation; 2012:82-90.'
apa: 'Lampert, C. (2012). Dynamic pruning of factor graphs for maximum marginal
prediction (Vol. 1, pp. 82–90). Presented at the NIPS: Neural Information Processing
Systems, Lake Tahoe, NV, United States: Neural Information Processing Systems
Foundation.'
chicago: Lampert, Christoph. “Dynamic Pruning of Factor Graphs for Maximum Marginal
Prediction,” 1:82–90. Neural Information Processing Systems Foundation, 2012.
ieee: 'C. Lampert, “Dynamic pruning of factor graphs for maximum marginal prediction,”
presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV,
United States, 2012, vol. 1, pp. 82–90.'
ista: 'Lampert C. 2012. Dynamic pruning of factor graphs for maximum marginal prediction.
NIPS: Neural Information Processing Systems vol. 1, 82–90.'
mla: Lampert, Christoph. Dynamic Pruning of Factor Graphs for Maximum Marginal
Prediction. Vol. 1, Neural Information Processing Systems Foundation, 2012,
pp. 82–90.
short: C. Lampert, in:, Neural Information Processing Systems Foundation, 2012,
pp. 82–90.
conference:
end_date: 2012-12-06
location: Lake Tahoe, NV, United States
name: 'NIPS: Neural Information Processing Systems'
start_date: 2012-12-03
corr_author: '1'
date_created: 2018-12-11T11:59:48Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2025-06-03T11:46:36Z
day: '01'
department:
- _id: ChLa
intvolume: ' 1'
language:
- iso: eng
month: '12'
oa_version: None
page: 82 - 90
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '3975'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic pruning of factor graphs for maximum marginal prediction
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2012'
...
---
_id: '2848'
abstract:
- lang: eng
text: We study evolutionary game theory in a setting where individuals learn from
each other. We extend the traditional approach by assuming that a population contains
individuals with different learning abilities. In particular, we explore the situation
where individuals have different search spaces, when attempting to learn the strategies
of others. The search space of an individual specifies the set of strategies learnable
by that individual. The search space is genetically given and does not change
under social evolutionary dynamics. We introduce a general framework and study
a specific example in the context of direct reciprocity. For this example, we
obtain the counter intuitive result that cooperation can only evolve for intermediate
benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection.
Our paper is a step toward making a connection between computational learning
theory and evolutionary game dynamics.
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 2012;301:161-173.
doi:10.1016/j.jtbi.2012.02.021
apa: Chatterjee, K., Zufferey, D., & Nowak, M. (2012). Evolutionary game dynamics
in populations with different learners. Journal of Theoretical Biology.
Elsevier. https://doi.org/10.1016/j.jtbi.2012.02.021
chicago: Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary
Game Dynamics in Populations with Different Learners.” Journal of Theoretical
Biology. Elsevier, 2012. https://doi.org/10.1016/j.jtbi.2012.02.021.
ieee: K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations
with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier,
pp. 161–173, 2012.
ista: Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations
with different learners. Journal of Theoretical Biology. 301, 161–173.
mla: Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with
Different Learners.” Journal of Theoretical Biology, vol. 301, Elsevier,
2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.
short: K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301
(2012) 161–173.
corr_author: '1'
date_created: 2018-12-11T11:59:55Z
date_published: 2012-05-21T00:00:00Z
date_updated: 2025-09-30T08:20:22Z
day: '21'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.jtbi.2012.02.021
ec_funded: 1
external_id:
isi:
- '000303079500016'
pmid:
- '22394652'
fulldoi: https://doi.org/10.1016/j.jtbi.2012.02.021
intvolume: ' 301'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/
month: '05'
oa: 1
oa_version: Submitted Version
page: 161 - 173
pmid: 1
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _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: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '3946'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolutionary game dynamics in populations with different learners
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 301
year: '2012'
...
---
_id: '2849'
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Nataliya
full_name: Strelkova, Nataliya
last_name: Strelkova
citation:
ama: Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal
trees. Russian Mathematical Surveys. 2012;67(6):1167-1168. doi:10.1070/RM2012v067n06ABEH004820
apa: Edelsbrunner, H., & Strelkova, N. (2012). On the configuration space of
Steiner minimal trees. Russian Mathematical Surveys. IOP Publishing. https://doi.org/10.1070/RM2012v067n06ABEH004820
chicago: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
of Steiner Minimal Trees.” Russian Mathematical Surveys. IOP Publishing,
2012. https://doi.org/10.1070/RM2012v067n06ABEH004820.
ieee: H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal
trees,” Russian Mathematical Surveys, vol. 67, no. 6. IOP Publishing, pp.
1167–1168, 2012.
ista: Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal
trees. Russian Mathematical Surveys. 67(6), 1167–1168.
mla: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
of Steiner Minimal Trees.” Russian Mathematical Surveys, vol. 67, no. 6,
IOP Publishing, 2012, pp. 1167–68, doi:10.1070/RM2012v067n06ABEH004820.
short: H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.
date_created: 2018-12-11T11:59:55Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2025-09-30T08:19:37Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1070/RM2012v067n06ABEH004820
external_id:
isi:
- '000315950100005'
file:
- access_level: open_access
checksum: 44ee8d173487e8ed41a51136816bbeb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:26Z
date_updated: 2020-07-14T12:45:51Z
file_id: '5078'
file_name: IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf
file_size: 392021
relation: main_file
file_date_updated: 2020-07-14T12:45:51Z
fulldoi: https://doi.org/10.1070/RM2012v067n06ABEH004820
has_accepted_license: '1'
intvolume: ' 67'
isi: 1
issue: '6'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 1167 - 1168
publication: Russian Mathematical Surveys
publication_status: published
publisher: IOP Publishing
publist_id: '3943'
pubrep_id: '546'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the configuration space of Steiner minimal trees
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 67
year: '2012'
...
---
OA_type: closed access
_id: '2888'
abstract:
- lang: eng
text: Formal verification aims to improve the quality of hardware and software by
detecting errors before they do harm. At the basis of formal verification lies
the logical notion of correctness, which purports to capture whether or not a
circuit or program behaves as desired. We suggest that the boolean partition into
correct and incorrect systems falls short of the practical need to assess the
behavior of hardware and software in a more nuanced fashion against multiple criteria.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Henzinger TA. Quantitative reactive models. In: 15th International Conference
on Model Driven Engineering Languages and Systems. Vol 7590. Springer; 2012:1-2.
doi:10.1007/978-3-642-33666-9_1'
apa: 'Henzinger, T. A. (2012). Quantitative reactive models. In 15th International
Conference on Model Driven Engineering Languages and Systems (Vol. 7590, pp.
1–2). Innsbruck, Austria: Springer. https://doi.org/10.1007/978-3-642-33666-9_1'
chicago: Henzinger, Thomas A. “Quantitative Reactive Models.” In 15th International
Conference on Model Driven Engineering Languages and Systems, 7590:1–2. Springer,
2012. https://doi.org/10.1007/978-3-642-33666-9_1.
ieee: T. A. Henzinger, “Quantitative reactive models,” in 15th International
Conference on Model Driven Engineering Languages and Systems, Innsbruck, Austria,
2012, vol. 7590, pp. 1–2.
ista: 'Henzinger TA. 2012. Quantitative reactive models. 15th International Conference
on Model Driven Engineering Languages and Systems. MODELS: Model-driven Engineering
Languages and Systems, LNCS, vol. 7590, 1–2.'
mla: Henzinger, Thomas A. “Quantitative Reactive Models.” 15th International
Conference on Model Driven Engineering Languages and Systems, vol. 7590, Springer,
2012, pp. 1–2, doi:10.1007/978-3-642-33666-9_1.
short: T.A. Henzinger, in:, 15th International Conference on Model Driven Engineering
Languages and Systems, Springer, 2012, pp. 1–2.
conference:
end_date: 2012-10-05
location: Innsbruck, Austria
name: 'MODELS: Model-driven Engineering Languages and Systems'
start_date: 2012-09-30
corr_author: '1'
date_created: 2018-12-11T12:00:09Z
date_published: 2012-09-01T00:00:00Z
date_updated: 2025-05-20T07:30:56Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-642-33666-9_1
ec_funded: 1
fulldoi: https://doi.org/10.1007/978-3-642-33666-9_1
intvolume: ' 7590'
language:
- iso: eng
month: '09'
oa_version: None
page: 1 - 2
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: 15th International Conference on Model Driven Engineering Languages and
Systems
publication_identifier:
eisbn:
- '9783642336669'
eissn:
- 1611-3349
publication_status: published
publisher: Springer
publist_id: '3870'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative reactive models
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7590
year: '2012'
...
---
_id: '2890'
abstract:
- lang: eng
text: 'Systems are often specified using multiple requirements on their behavior.
In practice, these requirements can be contradictory. The classical approach to
specification, verification, and synthesis demands more detailed specifications
that resolve any contradictions in the requirements. These detailed specifications
are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative
frameworks allow the formalization of the intuitive idea that what is desired
is an implementation that comes "closest" to satisfying the mutually
incompatible requirements, according to a measure of fit that can be defined by
the requirements engineer. One flexible framework for quantifying how "well"
an implementation satisfies a specification is offered by simulation distances
that are parameterized by an error model. We introduce this framework, study its
properties, and provide an algorithmic solution for the following quantitative
synthesis question: given two (or more) behavioral requirements specified by possibly
incompatible finite-state machines, and an error model, find the finite-state
implementation that minimizes the maximal simulation distance to the given requirements.
Furthermore, we generalize the framework to handle infinite alphabets (for example,
realvalued domains). We also demonstrate how quantitative specifications based
on simulation distances might lead to smaller and easier to modify specifications.
Finally, we illustrate our approach using case studies on error correcting codes
and scheduler synthesis.'
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Sivakanth
full_name: Gopi, Sivakanth
last_name: Gopi
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Nishant
full_name: Totla, Nishant
last_name: Totla
citation:
ama: 'Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible
specifications. In: Proceedings of the Tenth ACM International Conference on
Embedded Software. ACM; 2012:53-62. doi:10.1145/2380356.2380371'
apa: 'Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012).
Synthesis from incompatible specifications. In Proceedings of the tenth ACM
international conference on Embedded software (pp. 53–62). Tampere, Finland:
ACM. https://doi.org/10.1145/2380356.2380371'
chicago: Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and
Nishant Totla. “Synthesis from Incompatible Specifications.” In Proceedings
of the Tenth ACM International Conference on Embedded Software, 53–62. ACM,
2012. https://doi.org/10.1145/2380356.2380371.
ieee: P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis
from incompatible specifications,” in Proceedings of the tenth ACM international
conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.
ista: 'Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from
incompatible specifications. Proceedings of the tenth ACM international conference
on Embedded software. EMSOFT: Embedded Software , 53–62.'
mla: Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” Proceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012,
pp. 53–62, doi:10.1145/2380356.2380371.
short: P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp.
53–62.
conference:
end_date: 2012-10-12
location: Tampere, Finland
name: 'EMSOFT: Embedded Software '
start_date: 2012-10-07
date_created: 2018-12-11T12:00:10Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:00:30Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2380356.2380371
ec_funded: 1
fulldoi: https://doi.org/10.1145/2380356.2380371
language:
- iso: eng
month: '10'
oa_version: None
page: 53 - 62
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: Proceedings of the tenth ACM international conference on Embedded software
publication_status: published
publisher: ACM
publist_id: '3868'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesis from incompatible specifications
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2902'
abstract:
- lang: eng
text: 'We present an algorithm for simplifying linear cartographic objects and results
obtained with a computer program implementing this algorithm. '
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Oleg
full_name: Musin, Oleg
last_name: Musin
- first_name: Alexey
full_name: Ukhalov, Alexey
last_name: Ukhalov
- first_name: Olga
full_name: Yakimova, Olga
last_name: Yakimova
- first_name: Vladislav
full_name: Alexeev, Vladislav
last_name: Alexeev
- first_name: Victoriya
full_name: Bogaevskaya, Victoriya
last_name: Bogaevskaya
- first_name: Andrey
full_name: Gorohov, Andrey
last_name: Gorohov
- first_name: Margarita
full_name: Preobrazhenskaya, Margarita
last_name: Preobrazhenskaya
citation:
ama: Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry
for generalizing cartographic objects. Modeling and Analysis of Information
Systems. 2012;19(6):152-160.
apa: Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya,
V., … Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing
cartographic objects. Modeling and Analysis of Information Systems. Russian
Academy of Sciences.
chicago: Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav
Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya.
“Fractal and computational geometry for generalizing cartographic objects.” Modeling
and Analysis of Information Systems. Russian Academy of Sciences, 2012.
ieee: H. Edelsbrunner et al., “Fractal and computational geometry for generalizing
cartographic objects,” Modeling and Analysis of Information Systems, vol.
19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.
ista: Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V,
Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing
cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.
mla: Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing
cartographic objects.” Modeling and Analysis of Information Systems, vol.
19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60.
short: H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya,
A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems
19 (2012) 152–160.
date_created: 2018-12-11T12:00:15Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2026-06-18T18:37:14Z
day: '01'
ddc:
- '500'
department:
- _id: HeEd
intvolume: ' 19'
issue: '6'
language:
- iso: rus
main_file_link:
- open_access: '1'
url: http://mi.mathnet.ru/eng/mais280
month: '12'
oa: 1
oa_version: Published Version
page: 152 - 160
publication: Modeling and Analysis of Information Systems
publication_status: published
publisher: Russian Academy of Sciences
publist_id: '3845'
quality_controlled: '1'
status: public
title: Fractal and computational geometry for generalizing cartographic objects
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2012'
...
---
_id: '2903'
abstract:
- lang: eng
text: In order to enjoy a digital version of the Jordan Curve Theorem, it is common
to use the closed topology for the foreground and the open topology for the background
of a 2-dimensional binary image. In this paper, we introduce a single topology
that enjoys this theorem for all thresholds decomposing a real-valued image into
foreground and background. This topology is easy to construct and it generalizes
to n-dimensional images.
author:
- 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: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
orcid: 0000-0003-2012-9947
citation:
ama: 'Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In:
IEEE; 2012:41-48. doi:10.1109/ISVD.2012.11'
apa: 'Edelsbrunner, H., & Symonova, O. (2012). The adaptive topology of a digital
image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams
in Science and Engineering, New Brunswick, NJ, USA : IEEE. https://doi.org/10.1109/ISVD.2012.11'
chicago: Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital
Image,” 41–48. IEEE, 2012. https://doi.org/10.1109/ISVD.2012.11.
ieee: 'H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,”
presented at the ISVD: International Symposium on Voronoi Diagrams in Science
and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.'
ista: 'Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image.
ISVD: International Symposium on Voronoi Diagrams in Science and Engineering,
41–48.'
mla: Edelsbrunner, Herbert, and Olga Symonova. The Adaptive Topology of a Digital
Image. IEEE, 2012, pp. 41–48, doi:10.1109/ISVD.2012.11.
short: H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.
conference:
end_date: 2012-06-29
location: 'New Brunswick, NJ, USA '
name: 'ISVD: International Symposium on Voronoi Diagrams in Science and Engineering'
start_date: 2012-06-27
corr_author: '1'
date_created: 2018-12-11T12:00:15Z
date_published: 2012-08-06T00:00:00Z
date_updated: 2024-10-09T20:54:57Z
day: '06'
ddc:
- '000'
department:
- _id: HeEd
- _id: MaJö
doi: 10.1109/ISVD.2012.11
file:
- access_level: open_access
checksum: 444869a4e8abf07834f88b6e5cb5e9c3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:41Z
date_updated: 2020-07-14T12:45:52Z
file_id: '4765'
file_name: IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf
file_size: 760548
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
fulldoi: https://doi.org/10.1109/ISVD.2012.11
has_accepted_license: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 41 - 48
publication_status: published
publisher: IEEE
publist_id: '3844'
pubrep_id: '545'
quality_controlled: '1'
scopus_import: 1
status: public
title: The adaptive topology of a digital image
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2904'
abstract:
- lang: eng
text: Generalized van der Corput sequences are onedimensional, infinite sequences
in the unit interval. They are generated from permutations in integer base b and
are the building blocks of the multi-dimensional Halton sequences. Motivated by
recent progress of Atanassov on the uniform distribution behavior of Halton sequences,
we study, among others, permutations of the form P(i) = ai (mod b) for coprime
integers a and b. We show that multipliers a that either divide b - 1 or b + 1
generate van der Corput sequences with weak distribution properties. We give explicit
lower bounds for the asymptotic distribution behavior of these sequences and relate
them to sequences generated from the identity permutation in smaller bases, which
are, due to Faure, the weakest distributed generalized van der Corput sequences.
- lang: fre
text: Les suites de Van der Corput généralisées sont dessuites unidimensionnelles
et infinies dans l’intervalle de l’unité.Elles sont générées par permutations
des entiers de la basebetsont les éléments constitutifs des suites multi-dimensionnelles
deHalton. Suites aux progrès récents d’Atanassov concernant le com-portement de
distribution uniforme des suites de Halton nous nousintéressons aux permutations
de la formuleP(i) =ai(modb)pour les entiers premiers entre euxaetb. Dans cet
article nousidentifions des multiplicateursagénérant des suites de Van derCorput
ayant une mauvaise distribution. Nous donnons les bornesinférieures explicites
pour cette distribution asymptotique asso-ciée à ces suites et relions ces dernières
aux suites générées parpermutation d’identité, qui sont, selon Faure, les moins
bien dis-tribuées des suites généralisées de Van der Corput dans une basedonnée.
article_processing_charge: No
article_type: original
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
citation:
ama: Pausinger F. Weak multipliers for generalized van der Corput sequences. Journal
de Theorie des Nombres des Bordeaux. 2012;24(3):729-749. doi:10.5802/jtnb.819
apa: Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences.
Journal de Theorie Des Nombres Des Bordeaux. Université de Bordeaux. https://doi.org/10.5802/jtnb.819
chicago: Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.”
Journal de Theorie Des Nombres Des Bordeaux. Université de Bordeaux, 2012.
https://doi.org/10.5802/jtnb.819.
ieee: F. Pausinger, “Weak multipliers for generalized van der Corput sequences,”
Journal de Theorie des Nombres des Bordeaux, vol. 24, no. 3. Université
de Bordeaux, pp. 729–749, 2012.
ista: Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences.
Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749.
mla: Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.”
Journal de Theorie Des Nombres Des Bordeaux, vol. 24, no. 3, Université
de Bordeaux, 2012, pp. 729–49, doi:10.5802/jtnb.819.
short: F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.
date_created: 2018-12-11T12:00:15Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2025-09-30T08:18:15Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.5802/jtnb.819
external_id:
isi:
- '000315243100011'
file:
- access_level: open_access
checksum: 6954bfe9d7f4119fbdda7a11cf0f5c67
content_type: application/pdf
creator: dernst
date_created: 2020-05-11T12:40:39Z
date_updated: 2020-07-14T12:45:52Z
file_id: '7819'
file_name: JTNB_2012__24_3_729_0.pdf
file_size: 819275
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
fulldoi: https://doi.org/10.5802/jtnb.819
has_accepted_license: '1'
intvolume: ' 24'
isi: 1
issue: '3'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 729 - 749
publication: Journal de Theorie des Nombres des Bordeaux
publication_identifier:
eissn:
- 2118-8572
issn:
- 1246-7405
publication_status: published
publisher: Université de Bordeaux
publist_id: '3843'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Weak multipliers for generalized van der Corput sequences
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 24
year: '2012'
...
---
_id: '2912'
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Nataliya
full_name: Strelkova, Nataliya
last_name: Strelkova
citation:
ama: Edelsbrunner H, Strelkova N. On the configuration space for the shortest networks.
Russian Mathematical Surveys. 2012;67(6):1167–1168. doi:10.4213/rm9503
apa: Edelsbrunner, H., & Strelkova, N. (2012). On the configuration space for
the shortest networks. Russian Mathematical Surveys. Russian Academy of
Sciences. https://doi.org/10.4213/rm9503
chicago: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
for the Shortest Networks.” Russian Mathematical Surveys. Russian Academy
of Sciences, 2012. https://doi.org/10.4213/rm9503.
ieee: H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest
networks,” Russian Mathematical Surveys, vol. 67, no. 6. Russian Academy
of Sciences, pp. 1167–1168, 2012.
ista: Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest
networks. Russian Mathematical Surveys. 67(6), 1167–1168.
mla: Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space
for the Shortest Networks.” Russian Mathematical Surveys, vol. 67, no.
6, Russian Academy of Sciences, 2012, pp. 1167–1168, doi:10.4213/rm9503.
short: H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.
date_created: 2018-12-11T12:00:18Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2023-10-17T11:40:39Z
day: '01'
department:
- _id: HeEd
doi: 10.4213/rm9503
fulldoi: https://doi.org/10.4213/rm9503
intvolume: ' 67'
issue: '6'
language:
- iso: eng
month: '10'
oa_version: None
page: 1167–1168
publication: Russian Mathematical Surveys
publication_status: published
publisher: Russian Academy of Sciences
publist_id: '3831'
quality_controlled: '1'
status: public
title: On the configuration space for the shortest networks
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2012'
...
---
_id: '2915'
acknowledgement: "The project receives funding from the European Community’s Seventh
Framework Programme under grant agreement\r\nno. ICT- 248273 GeRT."
article_processing_charge: No
author:
- first_name: Oliver
full_name: Kroemer, Oliver
last_name: Kroemer
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Jan
full_name: Peters, Jan
last_name: Peters
citation:
ama: 'Kroemer O, Lampert C, Peters J. Multi-modal learning for dynamic tactile sensing.
In: Deutsches Zentrum für Luft und Raumfahrt; 2012.'
apa: Kroemer, O., Lampert, C., & Peters, J. (2012). Multi-modal learning for
dynamic tactile sensing. Deutsches Zentrum für Luft und Raumfahrt.
chicago: Kroemer, Oliver, Christoph Lampert, and Jan Peters. “Multi-Modal Learning
for Dynamic Tactile Sensing.” Deutsches Zentrum für Luft und Raumfahrt, 2012.
ieee: O. Kroemer, C. Lampert, and J. Peters, “Multi-modal learning for dynamic tactile
sensing,” 2012.
ista: Kroemer O, Lampert C, Peters J. 2012. Multi-modal learning for dynamic tactile
sensing
mla: Kroemer, Oliver, et al. Multi-Modal Learning for Dynamic Tactile Sensing.
Deutsches Zentrum für Luft und Raumfahrt, 2012.
short: O. Kroemer, C. Lampert, J. Peters, in:, Deutsches Zentrum für Luft und Raumfahrt,
2012.
date_created: 2018-12-11T12:00:19Z
date_published: 2012-10-11T00:00:00Z
date_updated: 2023-10-17T07:58:59Z
day: '11'
department:
- _id: ChLa
language:
- iso: eng
month: '10'
oa_version: None
publication_status: published
publisher: Deutsches Zentrum für Luft und Raumfahrt
publist_id: '3828'
quality_controlled: '1'
status: public
title: Multi-modal learning for dynamic tactile sensing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2916'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a quantitative measure for interfaces, called interface simulation distance. It
makes the alternating refinement preorder quantitative by, intu- itively, tolerating
errors (while counting them) in the alternating simulation game. We show that
the interface simulation distance satisfies the triangle inequality, that the
distance between two interfaces does not increase under parallel composition with
a third interface, and that the distance between two interfaces can be bounded
from above and below by distances between abstractions of the two interfaces.
We illustrate the framework, and the properties of the distances under composition
of interfaces, with two case studies.
arxiv: 1
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances.
In: Electronic Proceedings in Theoretical Computer Science. Vol 96. EPTCS;
2012:29-42. doi:10.4204/EPTCS.96.3'
apa: 'Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface
Simulation Distances. In Electronic Proceedings in Theoretical Computer Science
(Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3'
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” In Electronic Proceedings in Theoretical
Computer Science, 96:29–42. EPTCS, 2012. https://doi.org/10.4204/EPTCS.96.3.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation
Distances,” in Electronic Proceedings in Theoretical Computer Science,
Napoli, Italy, 2012, vol. 96, pp. 29–42.
ista: 'Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation
Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games,
Automata, Logic, and Formal Verification vol. 96, 29–42.'
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Electronic Proceedings
in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings
in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
conference:
end_date: 2012-09-08
location: Napoli, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2012-09-06
date_created: 2018-12-11T12:00:19Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2025-09-29T13:14:24Z
day: '07'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4204/EPTCS.96.3
ec_funded: 1
external_id:
arxiv:
- '1210.2450'
fulldoi: https://doi.org/10.4204/EPTCS.96.3
intvolume: ' 96'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '10'
oa: 1
oa_version: Submitted Version
page: 29 - 42
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: 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: Electronic Proceedings in Theoretical Computer Science
publication_status: published
publisher: EPTCS
publist_id: '3827'
quality_controlled: '1'
related_material:
record:
- id: '1733'
relation: later_version
status: public
scopus_import: 1
status: public
title: Interface Simulation Distances
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...