---
_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: 2023-02-23T10:06:04Z
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
has_accepted_license: '1'
intvolume: ' 18'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
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: '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.
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.
date_created: 2018-12-11T11:59:55Z
date_published: 2012-05-21T00:00:00Z
date_updated: 2021-01-12T07:00:12Z
day: '21'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.jtbi.2012.02.021
ec_funded: 1
external_id:
pmid:
- '22394652'
intvolume: ' 301'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 301
year: '2012'
...
---
_id: '2849'
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 Ltd.
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
Ltd., 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 Ltd.,
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 Ltd., 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: 2021-01-12T07:00:13Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1070/RM2012v067n06ABEH004820
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
has_accepted_license: '1'
intvolume: ' 67'
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 Ltd.
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2012'
...
---
_id: '2875'
abstract:
- lang: eng
text: Phytohormones are important plant growth regulators that control many developmental
processes, such as cell division, cell differentiation, organogenesis and morphogenesis.
They regulate a multitude of apparently unrelated physiological processes, often
with overlapping roles, and they mutually modulate their effects. These features
imply important synergistic and antagonistic interactions between the various
plant hormones. Auxin and cytokinin are central hormones involved in the regulation
of plant growth and development, including processes determining root architecture,
such as root pole establishment during early embryogenesis, root meristem maintenance
and lateral root organogenesis. Thus, to control root development both pathways
put special demands on the mechanisms that balance their activities and mediate
their interactions. Here, we summarize recent knowledge on the role of auxin and
cytokinin in the regulation of root architecture with special focus on lateral
root organogenesis, discuss the latest findings on the molecular mechanisms of
their interactions, and present forward genetic screen as a tool to identify novel
molecular components of the auxin and cytokinin crosstalk.
author:
- first_name: Agnieszka
full_name: Bielach, Agnieszka
last_name: Bielach
- first_name: Jérôme
full_name: Duclercq, Jérôme
last_name: Duclercq
- first_name: Peter
full_name: Peter Marhavy
id: 3F45B078-F248-11E8-B48F-1D18A9856A87
last_name: Marhavy
orcid: 0000-0001-5227-5741
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Bielach A, Duclercq J, Marhavý P, Benková E. Genetic approach towards the identification
of auxin - cytokinin crosstalk components involved in root development. Philosophical
Transactions of the Royal Society of London Series B, Biological Sciences.
2012;367(1595):1469-1478. doi:10.1098/rstb.2011.0233
apa: Bielach, A., Duclercq, J., Marhavý, P., & Benková, E. (2012). Genetic approach
towards the identification of auxin - cytokinin crosstalk components involved
in root development. Philosophical Transactions of the Royal Society of London.
Series B, Biological Sciences. Royal Society, The. https://doi.org/10.1098/rstb.2011.0233
chicago: Bielach, Agnieszka, Jérôme Duclercq, Peter Marhavý, and Eva Benková. “Genetic
Approach towards the Identification of Auxin - Cytokinin Crosstalk Components
Involved in Root Development.” Philosophical Transactions of the Royal Society
of London. Series B, Biological Sciences. Royal Society, The, 2012. https://doi.org/10.1098/rstb.2011.0233.
ieee: A. Bielach, J. Duclercq, P. Marhavý, and E. Benková, “Genetic approach towards
the identification of auxin - cytokinin crosstalk components involved in root
development,” Philosophical Transactions of the Royal Society of London. Series
B, Biological Sciences, vol. 367, no. 1595. Royal Society, The, pp. 1469–1478,
2012.
ista: Bielach A, Duclercq J, Marhavý P, Benková E. 2012. Genetic approach towards
the identification of auxin - cytokinin crosstalk components involved in root
development. Philosophical Transactions of the Royal Society of London. Series
B, Biological Sciences. 367(1595), 1469–1478.
mla: Bielach, Agnieszka, et al. “Genetic Approach towards the Identification of
Auxin - Cytokinin Crosstalk Components Involved in Root Development.” Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences,
vol. 367, no. 1595, Royal Society, The, 2012, pp. 1469–78, doi:10.1098/rstb.2011.0233.
short: A. Bielach, J. Duclercq, P. Marhavý, E. Benková, Philosophical Transactions
of the Royal Society of London. Series B, Biological Sciences 367 (2012) 1469–1478.
date_created: 2018-12-11T12:00:05Z
date_published: 2012-06-05T00:00:00Z
date_updated: 2021-01-12T07:00:25Z
day: '05'
doi: 10.1098/rstb.2011.0233
extern: 1
intvolume: ' 367'
issue: '1595'
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3321684/
month: '06'
oa: 1
page: 1469 - 1478
publication: Philosophical Transactions of the Royal Society of London. Series B,
Biological Sciences
publication_status: published
publisher: Royal Society, The
publist_id: '3887'
quality_controlled: 0
status: public
title: Genetic approach towards the identification of auxin - cytokinin crosstalk
components involved in root development
type: journal_article
volume: 367
year: '2012'
...
---
_id: '2891'
abstract:
- lang: eng
text: "Quantitative automata are nondeterministic finite automata with edge weights.
They value a\r\nrun by some function from the sequence of visited weights to the
reals, and value a word by its\r\nminimal/maximal run. They generalize boolean
automata, and have gained much attention in\r\nrecent years. Unfortunately, important
automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata,
cannot be determinized. Yet, the quantitative setting provides the potential\r\nof
approximate determinization. We define approximate determinization with respect
to\r\na distance function, and investigate this potential.\r\nWe show that sum
automata cannot be determinized approximately with respect to any\r\ndistance
function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith
respect to some distance functions.\r\nDiscounted-sum automata allow for approximate
determinization, as the influence of a word’s\r\nsuffix is decaying. However,
the naive approach, of unfolding the automaton computations up\r\nto a sufficient
level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative
construction that is singly exponential in the discount factor, in the precision,
and\r\nin the number of states. We prove matching lower bounds, showing exponential
dependency on\r\neach of these three parameters.\r\nAverage and limit-average
automata are shown to prohibit approximate determinization with\r\nrespect to
any distance function, and this is the case even for two weights, 0 and 1."
acknowledgement: We thank Laurent Doyen for great ideas and valuable help in analyzing
discounted-sum automata.
alternative_title:
- LIPIcs
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- 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: 'Boker U, Henzinger TA. Approximate determinization of quantitative automata.
In: Leibniz International Proceedings in Informatics. Vol 18. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2012:362-373. doi:10.4230/LIPIcs.FSTTCS.2012.362'
apa: 'Boker, U., & Henzinger, T. A. (2012). Approximate determinization of quantitative
automata. In Leibniz International Proceedings in Informatics (Vol. 18,
pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362'
chicago: Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative
Automata.” In Leibniz International Proceedings in Informatics, 18:362–73.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362.
ieee: U. Boker and T. A. Henzinger, “Approximate determinization of quantitative
automata,” in Leibniz International Proceedings in Informatics, Hyderabad,
India, 2012, vol. 18, pp. 362–373.
ista: 'Boker U, Henzinger TA. 2012. Approximate determinization of quantitative
automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations
of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.'
mla: Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative
Automata.” Leibniz International Proceedings in Informatics, vol. 18, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:10.4230/LIPIcs.FSTTCS.2012.362.
short: U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.
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-11T12:00:10Z
date_published: 2012-12-01T00:00:00Z
date_updated: 2021-01-12T07:00:31Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.FSTTCS.2012.362
ec_funded: 1
file:
- access_level: open_access
checksum: 88da18d3e2cb2e5011d7d10ce38a3864
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:37Z
date_updated: 2020-07-14T12:45:52Z
file_id: '4826'
file_name: IST-2017-805-v1+1_34.pdf
file_size: 559069
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
intvolume: ' 18'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 362 - 373
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '3867'
pubrep_id: '805'
quality_controlled: '1'
scopus_import: 1
status: public
title: Approximate determinization of quantitative automata
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: '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: 2023-10-18T07:34:45Z
day: '01'
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
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
date_created: 2018-12-11T12:00:15Z
date_published: 2012-08-06T00:00:00Z
date_updated: 2021-01-12T07:00:35Z
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
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: 2023-10-18T07:53:47Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.5802/jtnb.819
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
has_accepted_license: '1'
intvolume: ' 24'
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 24
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: 2023-02-23T10:12:05Z
day: '07'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4204/EPTCS.96.3
ec_funded: 1
external_id:
arxiv:
- '1210.2450'
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'
...
---
_id: '2928'
abstract:
- lang: eng
text: ' This paper addresses the problem of approximate MAP-MRF inference in
general graphical models. Following [36], we consider a family of linear programming
relaxations of the problem where each relaxation is specified by a set of nested
pairs of factors for which the marginalization constraint needs to be enforced.
We develop a generalization of the TRW-S algorithm [9] for this problem, where
we use a decomposition into junction chains, monotonic w.r.t. some ordering on
the nodes. This generalizes the monotonic chains in [9] in a natural way. We also
show how to deal with nested factors in an efficient way. Experiments show an
improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on
a number of computer vision and natural language processing problems. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Thomas
full_name: Schoenemann, Thomas
last_name: Schoenemann
citation:
ama: Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message
passing. arXiv. 2012.
apa: Kolmogorov, V., & Schoenemann, T. (2012). Generalized sequential tree-reweighted
message passing. arXiv. ArXiv.
chicago: Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted
Message Passing.” ArXiv. ArXiv, 2012.
ieee: V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted
message passing,” arXiv. ArXiv, 2012.
ista: Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted
message passing. arXiv, .
mla: Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted
Message Passing.” ArXiv, ArXiv, 2012.
short: V. Kolmogorov, T. Schoenemann, ArXiv (2012).
date_created: 2018-12-11T12:00:23Z
date_published: 2012-05-29T00:00:00Z
date_updated: 2021-01-12T07:00:45Z
day: '29'
department:
- _id: VlKo
external_id:
arxiv:
- '1205.6352'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1205.6352
month: '05'
oa: 1
oa_version: Preprint
page: '16'
publication: arXiv
publication_status: published
publisher: ArXiv
publist_id: '3809'
status: public
title: Generalized sequential tree-reweighted message passing
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2929'
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Kolmogorov V. The Power of Linear Programming for Valued CSPs: A Constructive
Characterization. Unknown; 2012.'
apa: 'Kolmogorov, V. (2012). The power of linear programming for valued CSPs:
a constructive characterization. Unknown.'
chicago: 'Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs:
A Constructive Characterization. Unknown, 2012.'
ieee: 'V. Kolmogorov, The power of linear programming for valued CSPs: a constructive
characterization. Unknown, 2012.'
ista: 'Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive
characterization, Unknown,p.'
mla: 'Kolmogorov, Vladimir. The Power of Linear Programming for Valued CSPs:
A Constructive Characterization. Unknown, 2012.'
short: 'V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive
Characterization, Unknown, 2012.'
date_created: 2018-12-11T12:00:24Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2019-04-26T07:22:21Z
day: '01'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1207.7213
month: '01'
oa: 1
publication_status: published
publisher: Unknown
publist_id: '3807'
quality_controlled: 0
status: public
title: 'The power of linear programming for valued CSPs: a constructive characterization'
type: report
year: '2012'
...
---
_id: '2930'
abstract:
- lang: eng
text: "In this paper we investigate k-submodular functions. This natural family
of discrete functions includes submodular and bisubmodular functions as the special
cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known
Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts
that the minimum of the (bi)submodular function can be found by solving a maximization
problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron,
prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm
to construct the vertices of the polyhedron.\r\n"
acknowledgement: "We would like to thank Andrei Krokhin for encourag- ing our cooperation,
for helpful discussions, and for his critical reading of the manuscript.\r\n"
alternative_title:
- LNCS
author:
- first_name: Anna
full_name: Huber, Anna
last_name: Huber
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol
7422. Springer; 2012:451-462. doi:10.1007/978-3-642-32147-4_40'
apa: 'Huber, A., & Kolmogorov, V. (2012). Towards minimizing k-submodular functions
(Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial
Optimization, Athens, Greece: Springer. https://doi.org/10.1007/978-3-642-32147-4_40'
chicago: Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular
Functions,” 7422:451–62. Springer, 2012. https://doi.org/10.1007/978-3-642-32147-4_40.
ieee: 'A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,”
presented at the ISCO: International Symposium on Combinatorial Optimization,
Athens, Greece, 2012, vol. 7422, pp. 451–462.'
ista: 'Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO:
International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.'
mla: Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions.
Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.
short: A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.
conference:
end_date: 2012-04-21
location: Athens, Greece
name: 'ISCO: International Symposium on Combinatorial Optimization'
start_date: 2012-04-19
date_created: 2018-12-11T12:00:24Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2021-01-12T07:00:46Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-642-32147-4_40
intvolume: ' 7422'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5469
month: '04'
oa: 1
oa_version: Preprint
page: 451 - 462
publication_status: published
publisher: Springer
publist_id: '3806'
quality_controlled: '1'
scopus_import: 1
status: public
title: Towards minimizing k-submodular functions
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7422
year: '2012'
...
---
_id: '2936'
abstract:
- lang: eng
text: The notion of delays arises naturally in many computational models, such as,
in the design of circuits, control systems, and dataflow languages. In this work,
we introduce automata with delay blocks (ADBs), extending finite state automata
with variable time delay blocks, for deferring individual transition output symbols,
in a discrete-time setting. We show that the ADB languages strictly subsume the
regular languages, and are incomparable in expressive power to the context-free
languages. We show that ADBs are closed under union, concatenation and Kleene
star, and under intersection with regular languages, but not closed under complementation
and intersection with other ADB languages. We show that the emptiness and the
membership problems are decidable in polynomial time for ADBs, whereas the universality
problem is undecidable. Finally we consider the linear-time model checking problem,
i.e., whether the language of an ADB is contained in a regular language, and show
that the model checking problem is PSPACE-complete. Copyright 2012 ACM.
acknowledgement: 'This work has been financially supported in part by the European
Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract
# 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008
(Modeling and control of Networked vehicle systems in persistent autonomous operations);
by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic
Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start
grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant
QUAREM; and FWF Grant No S11403-N23 (RiSE).'
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: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks.
In: Roceedings of the Tenth ACM International Conference on Embedded Software.
ACM; 2012:43-52. doi:10.1145/2380356.2380370'
apa: 'Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2012). Finite automata
with time delay blocks. In roceedings of the tenth ACM international conference
on Embedded software (pp. 43–52). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380370'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite
Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International
Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.
ieee: K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time
delay blocks,” in roceedings of the tenth ACM international conference on Embedded
software, Tampere, Finland, 2012, pp. 43–52.
ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay
blocks. roceedings of the tenth ACM international conference on Embedded software.
EMSOFT: Embedded Software , 43–52.'
mla: Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” Roceedings
of the Tenth ACM International Conference on Embedded Software, ACM, 2012,
pp. 43–52, doi:10.1145/2380356.2380370.
short: K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM
International Conference on Embedded Software, ACM, 2012, pp. 43–52.
conference:
end_date: 2012-10-12
location: Tampere, Finland
name: 'EMSOFT: Embedded Software '
start_date: 2012-10-07
date_created: 2018-12-11T12:00:26Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/2380356.2380370
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1207.7019
month: '10'
oa: 1
oa_version: Preprint
page: 43 - 52
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _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: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: roceedings of the tenth ACM international conference on Embedded software
publication_status: published
publisher: ACM
publist_id: '3799'
quality_controlled: '1'
scopus_import: 1
status: public
title: Finite automata with time delay blocks
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2937'
abstract:
- lang: eng
text: Developers building cryptography into security-sensitive applications face
a daunting task. Not only must they understand the security guarantees delivered
by the constructions they choose, they must also implement and combine them correctly
and efficiently. Cryptographic compilers free developers from this task by turning
high-level specifications of security goals into efficient implementations. Yet,
trusting such tools is hard as they rely on complex mathematical machinery and
claim security properties that are subtle and difficult to verify. In this paper
we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented
level of assurance without sacrificing practicality for a comprehensive class
of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline
of ZKCrypt integrates purpose-built verified compilers and verifying compilers
producing formal proofs in the CertiCrypt framework. By combining the guarantees
delivered by each stage, ZKCrypt provides assurance that the output implementation
securely realizes the abstract proof goal given as input. We report on the main
characteristics of ZKCrypt, highlight new definitions and concepts at its foundations,
and illustrate its applicability through a representative example of an anonymous
credential system.
acknowledgement: This work was partially funded by National Funds through the FCT
- Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and
Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant
agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT,
Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project
S2009TIC-1465 PROMETIDOS.
author:
- first_name: José
full_name: Almeida, José
last_name: Almeida
- first_name: Manuel
full_name: Barbosa, Manuel
last_name: Barbosa
- first_name: Endre
full_name: Bangerter, Endre
last_name: Bangerter
- first_name: Gilles
full_name: Barthe, Gilles
last_name: Barthe
- first_name: Stephan
full_name: Krenn, Stephan
id: 329FCCF0-F248-11E8-B48F-1D18A9856A87
last_name: Krenn
orcid: 0000-0003-2835-9093
- first_name: Santiago
full_name: Béguelin, Santiago
last_name: Béguelin
citation:
ama: 'Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof
cryptography: Verifiable compilation of efficient zero-knowledge protocols. In:
Proceedings of the 2012 ACM Conference on Computer and Communications Security.
ACM; 2012:488-500. doi:10.1145/2382196.2382249'
apa: 'Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., & Béguelin,
S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge
protocols. In Proceedings of the 2012 ACM conference on Computer and communications
security (pp. 488–500). Raleigh, NC, USA: ACM. https://doi.org/10.1145/2382196.2382249'
chicago: 'Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan
Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation
of Efficient Zero-Knowledge Protocols.” In Proceedings of the 2012 ACM Conference
on Computer and Communications Security, 488–500. ACM, 2012. https://doi.org/10.1145/2382196.2382249.'
ieee: 'J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin,
“Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,”
in Proceedings of the 2012 ACM conference on Computer and communications security,
Raleigh, NC, USA, 2012, pp. 488–500.'
ista: 'Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full
proof cryptography: Verifiable compilation of efficient zero-knowledge protocols.
Proceedings of the 2012 ACM conference on Computer and communications security.
CCS: Computer and Communications Security, 488–500.'
mla: 'Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of
Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference
on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.'
short: J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:,
Proceedings of the 2012 ACM Conference on Computer and Communications Security,
ACM, 2012, pp. 488–500.
conference:
end_date: 2012-10-18
location: Raleigh, NC, USA
name: 'CCS: Computer and Communications Security'
start_date: 2012-10-16
date_created: 2018-12-11T12:00:26Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/2382196.2382249
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2012/258
month: '10'
oa: 1
oa_version: Submitted Version
page: 488 - 500
publication: Proceedings of the 2012 ACM conference on Computer and communications
security
publication_status: published
publisher: ACM
publist_id: '3798'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Full proof cryptography: Verifiable compilation of efficient zero-knowledge
protocols'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '2941'
author:
- first_name: Nikolai
full_name: Dolbilin, Nikolai
last_name: Dolbilin
- 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
citation:
ama: Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over
triangulations of Delaunay sets. Russian Mathematical Surveys. 2012;67(4):781-783.
doi:10.1070/RM2012v067n04ABEH004807
apa: Dolbilin, N., Edelsbrunner, H., & Musin, O. (2012). On the optimality of
functionals over triangulations of Delaunay sets. Russian Mathematical Surveys.
IOP Publishing. https://doi.org/10.1070/RM2012v067n04ABEH004807
chicago: Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality
of Functionals over Triangulations of Delaunay Sets.” Russian Mathematical
Surveys. IOP Publishing, 2012. https://doi.org/10.1070/RM2012v067n04ABEH004807.
ieee: N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals
over triangulations of Delaunay sets,” Russian Mathematical Surveys, vol.
67, no. 4. IOP Publishing, pp. 781–783, 2012.
ista: Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals
over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.
mla: Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations
of Delaunay Sets.” Russian Mathematical Surveys, vol. 67, no. 4, IOP Publishing,
2012, pp. 781–83, doi:10.1070/RM2012v067n04ABEH004807.
short: N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012)
781–783.
date_created: 2018-12-11T12:00:28Z
date_published: 2012-11-01T00:00:00Z
date_updated: 2021-01-12T07:39:55Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1070/RM2012v067n04ABEH004807
file:
- access_level: open_access
checksum: 389a5ae53d6347de36c3468034f2821d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:49Z
date_updated: 2020-07-14T12:45:55Z
file_id: '5239'
file_name: IST-2013-132-v1+1_2012-J-04-Functional-E.pdf
file_size: 253816
relation: main_file
file_date_updated: 2020-07-14T12:45:55Z
has_accepted_license: '1'
intvolume: ' 67'
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 781 - 783
publication: Russian Mathematical Surveys
publication_status: published
publisher: IOP Publishing
publist_id: '3792'
pubrep_id: '132'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the optimality of functionals over triangulations of Delaunay sets
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 67
year: '2012'
...
---
_id: '2943'
abstract:
- lang: eng
text: We examine whether the Escherichia coli chromosome is folded into a self-adherent
nucleoprotein complex, or alternately is a confined but otherwise unconstrained
self-avoiding polymer. We address this through in vivo visualization, using an
inducible GFP fusion to the nucleoid-associated protein Fis to non-specifically
decorate the entire chromosome. For a range of different growth conditions, the
chromosome is a compact structure that does not fill the volume of the cell, and
which moves from the new pole to the cell centre. During rapid growth, chromosome
segregation occurs well before cell division, with daughter chromosomes coupled
by a thin inter-daughter filament before complete segregation, whereas during
slow growth chromosomes stay adjacent until cell division occurs. Image correlation
analysis indicates that sub-nucleoid structure is stable on a 1min timescale,
comparable to the timescale for redistribution time measured for GFP-Fis after
photobleaching. Optical deconvolution and writhe calculation analysis indicate
that the nucleoid has a large-scale coiled organization rather than being an amorphous
mass. Our observations are consistent with the chromosome having a self-adherent
filament organization.
acknowledgement: We thank Professor Philippe Cluzel and Mr Lance Min for providing
advice and materials. Jeannette Chau provided technical support. Work at NU was
supported by NSF Grants DMR-0715099, MCB-1022117, DMR-1206868, DMR-0520513 and DMR-1121262
(NU-MRSEC), by NIH-NCI Grant U54CA143869-01 (NU-PS-OC) and by the Chicago Biomedical
Consortium with support from the Searle Funds at the Chicago Community Trust. Work
at UCLA was supported by NIH Grant GM038509.
author:
- first_name: Nastaran
full_name: Hadizadeh Yazdi, Nastaran
last_name: Hadizadeh Yazdi
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Reid
full_name: Johnson, Reid
last_name: Johnson
- first_name: John
full_name: Marko, John
last_name: Marko
citation:
ama: Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. Variation of the folding and
dynamics of the Escherichia coli chromosome with growth conditions. Molecular
Microbiology. 2012;86(6):1318-1333. doi:10.1111/mmi.12071
apa: Hadizadeh Yazdi, N., Guet, C. C., Johnson, R., & Marko, J. (2012). Variation
of the folding and dynamics of the Escherichia coli chromosome with growth conditions.
Molecular Microbiology. Wiley-Blackwell. https://doi.org/10.1111/mmi.12071
chicago: Hadizadeh Yazdi, Nastaran, Calin C Guet, Reid Johnson, and John Marko.
“Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with
Growth Conditions.” Molecular Microbiology. Wiley-Blackwell, 2012. https://doi.org/10.1111/mmi.12071.
ieee: N. Hadizadeh Yazdi, C. C. Guet, R. Johnson, and J. Marko, “Variation of the
folding and dynamics of the Escherichia coli chromosome with growth conditions,”
Molecular Microbiology, vol. 86, no. 6. Wiley-Blackwell, pp. 1318–1333,
2012.
ista: Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. 2012. Variation of the folding
and dynamics of the Escherichia coli chromosome with growth conditions. Molecular
Microbiology. 86(6), 1318–1333.
mla: Hadizadeh Yazdi, Nastaran, et al. “Variation of the Folding and Dynamics of
the Escherichia Coli Chromosome with Growth Conditions.” Molecular Microbiology,
vol. 86, no. 6, Wiley-Blackwell, 2012, pp. 1318–33, doi:10.1111/mmi.12071.
short: N. Hadizadeh Yazdi, C.C. Guet, R. Johnson, J. Marko, Molecular Microbiology
86 (2012) 1318–1333.
date_created: 2018-12-11T12:00:28Z
date_published: 2012-11-09T00:00:00Z
date_updated: 2021-01-12T07:39:56Z
day: '09'
department:
- _id: CaGu
doi: 10.1111/mmi.12071
intvolume: ' 86'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://europepmc.org/articles/pmc3524407
month: '11'
oa: 1
oa_version: Submitted Version
page: 1318 - 1333
publication: Molecular Microbiology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3790'
quality_controlled: '1'
scopus_import: 1
status: public
title: Variation of the folding and dynamics of the Escherichia coli chromosome with
growth conditions
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 86
year: '2012'
...
---
_id: '2946'
abstract:
- lang: eng
text: MicroRNAs (miRNAs) are small noncoding RNAs that function in literally all
cellular processes. miRNAs interact with Argonaute (Ago) proteins and guide them
to specific target sites located in the 3′-untranslated region (3′-UTR) of target
mRNAs leading to translational repression and deadenylation-induced mRNA degradation.
Most miRNAs are processed from hairpin-structured precursors by the consecutive
action of the RNase III enzymes Drosha and Dicer. However, processing of miR-451
is Dicer independent and cleavage is mediated by the endonuclease Ago2. Here we
have characterized miR-451 sequence and structure requirements for processing
as well as sorting of miRNAs into different Ago proteins. Pre-miR-451 appears
to be optimized for Ago2 cleavage and changes result in reduced processing. In
addition, we show that the mature miR-451 only associates with Ago2 suggesting
that mature miRNAs are not exchanged between different members of the Ago protein
family. Based on cloning and deep sequencing of endogenous miRNAs associated with
Ago1-3, we do not find evidence for miRNA sorting in human cells. However, Ago
identity appears to influence the length of some miRNAs, while others remain unaffected.
acknowledgement: "Deutsche Forschungsgemeinschaft (DFG) (SFB 960 and FOR855); European
Research Council (ERC grant ‘sRNAs’); European Union (FP7 project ‘ONCOMIRs’); German
Bundesministerium für Bildung und Forschung (BMBF, NGFN+, FKZ PIM-01GS0804-5); Bavarian
Genome Research Network (BayGene to G.M.); The Netherlands Organization for Scientific
Research (NWO, VIDI grant to E.B.). Funding for open access charge: DFG via the
open access publishing program. \r\n\r\nWe thank Sigrun Ammon and Corinna Friederich
for technical assistance and Sebastian Petri and Daniel Schraivogel for helpful
discussions."
author:
- first_name: Anne
full_name: Dueck, Anne
last_name: Dueck
- first_name: Christian
full_name: Ziegler, Christian
last_name: Ziegler
- first_name: Alexander
full_name: Eichner, Alexander
id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
last_name: Eichner
- first_name: Eugène
full_name: Berezikov, Eugène
last_name: Berezikov
- first_name: Gunter
full_name: Meister, Gunter
last_name: Meister
citation:
ama: Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. MicroRNAs associated
with the different human Argonaute proteins. Nucleic Acids Research. 2012;40(19):9850-9862.
doi:10.1093/nar/gks705
apa: Dueck, A., Ziegler, C., Eichner, A., Berezikov, E., & Meister, G. (2012).
MicroRNAs associated with the different human Argonaute proteins. Nucleic Acids
Research. Oxford University Press. https://doi.org/10.1093/nar/gks705
chicago: Dueck, Anne, Christian Ziegler, Alexander Eichner, Eugène Berezikov, and
Gunter Meister. “MicroRNAs Associated with the Different Human Argonaute Proteins.”
Nucleic Acids Research. Oxford University Press, 2012. https://doi.org/10.1093/nar/gks705.
ieee: A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, and G. Meister, “MicroRNAs
associated with the different human Argonaute proteins,” Nucleic Acids Research,
vol. 40, no. 19. Oxford University Press, pp. 9850–9862, 2012.
ista: Dueck A, Ziegler C, Eichner A, Berezikov E, Meister G. 2012. MicroRNAs associated
with the different human Argonaute proteins. Nucleic Acids Research. 40(19), 9850–9862.
mla: Dueck, Anne, et al. “MicroRNAs Associated with the Different Human Argonaute
Proteins.” Nucleic Acids Research, vol. 40, no. 19, Oxford University Press,
2012, pp. 9850–62, doi:10.1093/nar/gks705.
short: A. Dueck, C. Ziegler, A. Eichner, E. Berezikov, G. Meister, Nucleic Acids
Research 40 (2012) 9850–9862.
date_created: 2018-12-11T12:00:29Z
date_published: 2012-10-01T00:00:00Z
date_updated: 2021-01-12T07:39:57Z
day: '01'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1093/nar/gks705
file:
- access_level: open_access
checksum: 1bb8d1ff894014b481657a21083c941c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:12Z
date_updated: 2020-07-14T12:45:55Z
file_id: '4993'
file_name: IST-2015-383-v1+1_Nucl._Acids_Res.-2012-Dueck-9850-62.pdf
file_size: 8126936
relation: main_file
file_date_updated: 2020-07-14T12:45:55Z
has_accepted_license: '1'
intvolume: ' 40'
issue: '19'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 9850 - 9862
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '3786'
pubrep_id: '383'
quality_controlled: '1'
scopus_import: 1
status: public
title: MicroRNAs associated with the different human Argonaute proteins
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2012'
...
---
_id: '2947'
abstract:
- lang: eng
text: We introduce games with probabilistic uncertainty, a model for controller
synthesis in which the controller observes the state through imprecise sensors
that provide correct information about the current state with a fixed probability.
That is, in each step, the sensors return an observed state, and given the observed
state, there is a probability distribution (due to the estimation error) over
the actual current state. The controller must base its decision on the observed
state (rather than the actual current state, which it does not know). On the other
hand, we assume that the environment can perfectly observe the current state.
We show that controller synthesis for qualitative ω-regular objectives in our
model can be reduced in polynomial time to standard partial-observation stochastic
games, and vice-versa. As a consequence we establish the precise decidability
frontier for the new class of games, and establish optimal complexity results
for all the decidable problems.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification, FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.'
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Chmelik M, Majumdar R. Equivalence of games with probabilistic
uncertainty and partial observation games. In: Vol 7561. Springer; 2012:385-399.
doi:10.1007/978-3-642-33386-6_30'
apa: 'Chatterjee, K., Chmelik, M., & Majumdar, R. (2012). Equivalence of games
with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399).
Presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram,
India: Springer. https://doi.org/10.1007/978-3-642-33386-6_30'
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence
of Games with Probabilistic Uncertainty and Partial Observation Games,” 7561:385–99.
Springer, 2012. https://doi.org/10.1007/978-3-642-33386-6_30.
ieee: 'K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic
uncertainty and partial observation games,” presented at the ATVA: Automated
Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol.
7561, pp. 385–399.'
ista: 'Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic
uncertainty and partial observation games. ATVA: Automated Technology for Verification
and Analysis, LNCS, vol. 7561, 385–399.'
mla: Chatterjee, Krishnendu, et al. Equivalence of Games with Probabilistic Uncertainty
and Partial Observation Games. Vol. 7561, Springer, 2012, pp. 385–99, doi:10.1007/978-3-642-33386-6_30.
short: K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
conference:
end_date: 2012-10-06
location: Thiruvananthapuram, India
name: ' ATVA: Automated Technology for Verification and Analysis'
start_date: 2012-10-03
date_created: 2018-12-11T12:00:29Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T07:39:58Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-33386-6_30
ec_funded: 1
intvolume: ' 7561'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1202.4140
month: '06'
oa: 1
oa_version: Preprint
page: 385 - 399
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3785'
quality_controlled: '1'
scopus_import: 1
status: public
title: Equivalence of games with probabilistic uncertainty and partial observation
games
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7561
year: '2012'
...
---
_id: '2954'
abstract:
- lang: eng
text: Spontaneous postsynaptic currents (PSCs) provide key information about the
mechanisms of synaptic transmission and the activity modes of neuronal networks.
However, detecting spontaneous PSCs in vitro and in vivo has been challenging,
because of the small amplitude, the variable kinetics, and the undefined time
of generation of these events. Here, we describe a, to our knowledge, new method
for detecting spontaneous synaptic events by deconvolution, using a template that
approximates the average time course of spontaneous PSCs. A recorded PSC trace
is deconvolved from the template, resulting in a series of delta-like functions.
The maxima of these delta-like events are reliably detected, revealing the precise
onset times of the spontaneous PSCs. Among all detection methods, the deconvolution-based
method has a unique temporal resolution, allowing the detection of individual
events in high-frequency bursts. Furthermore, the deconvolution-based method has
a high amplitude resolution, because deconvolution can substantially increase
the signal/noise ratio. When tested against previously published methods using
experimental data, the deconvolution-based method was superior for spontaneous
PSCs recorded in vivo. Using the high-resolution deconvolution-based detection
algorithm, we show that the frequency of spontaneous excitatory postsynaptic currents
in dentate gyrus granule cells is 4.5 times higher in vivo than in vitro.
acknowledgement: "This work was supported by the Deutsche Forschungsgemeinschaft (TR3/B10)
and a European Research Council Advanced grant to P.J.\r\nWe thank H. Hu, S. J.
Guzman, and C. Schmidt-Hieber for critically reading the manuscript, I. Koeva and
F. Marr for technical support, and E. Kramberger for editorial assistance.\r\n"
author:
- first_name: Alejandro
full_name: Pernia-Andrade, Alejandro
id: 36963E98-F248-11E8-B48F-1D18A9856A87
last_name: Pernia-Andrade
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- first_name: Yvonne
full_name: Stickler, Yvonne
id: 63B76600-E9CC-11E9-9B5F-82450873F7A1
last_name: Stickler
- first_name: Ulrich
full_name: Fröbe, Ulrich
last_name: Fröbe
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. A deconvolution
based method with high sensitivity and temporal resolution for detection of spontaneous
synaptic currents in vitro and in vivo. Biophysical Journal. 2012;103(7):1429-1439.
doi:10.1016/j.bpj.2012.08.039
apa: Pernia-Andrade, A., Goswami, S., Stickler, Y., Fröbe, U., Schlögl, A., &
Jonas, P. M. (2012). A deconvolution based method with high sensitivity and temporal
resolution for detection of spontaneous synaptic currents in vitro and in vivo.
Biophysical Journal. Biophysical. https://doi.org/10.1016/j.bpj.2012.08.039
chicago: Pernia-Andrade, Alejandro, Sarit Goswami, Yvonne Stickler, Ulrich Fröbe,
Alois Schlögl, and Peter M Jonas. “A Deconvolution Based Method with High Sensitivity
and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
and in Vivo.” Biophysical Journal. Biophysical, 2012. https://doi.org/10.1016/j.bpj.2012.08.039.
ieee: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, and P. M.
Jonas, “A deconvolution based method with high sensitivity and temporal resolution
for detection of spontaneous synaptic currents in vitro and in vivo,” Biophysical
Journal, vol. 103, no. 7. Biophysical, pp. 1429–1439, 2012.
ista: Pernia-Andrade A, Goswami S, Stickler Y, Fröbe U, Schlögl A, Jonas PM. 2012.
A deconvolution based method with high sensitivity and temporal resolution for
detection of spontaneous synaptic currents in vitro and in vivo. Biophysical Journal.
103(7), 1429–1439.
mla: Pernia-Andrade, Alejandro, et al. “A Deconvolution Based Method with High Sensitivity
and Temporal Resolution for Detection of Spontaneous Synaptic Currents in Vitro
and in Vivo.” Biophysical Journal, vol. 103, no. 7, Biophysical, 2012,
pp. 1429–39, doi:10.1016/j.bpj.2012.08.039.
short: A. Pernia-Andrade, S. Goswami, Y. Stickler, U. Fröbe, A. Schlögl, P.M. Jonas,
Biophysical Journal 103 (2012) 1429–1439.
date_created: 2018-12-11T12:00:32Z
date_published: 2012-10-03T00:00:00Z
date_updated: 2021-01-12T07:40:01Z
day: '03'
department:
- _id: PeJo
- _id: ScienComp
doi: 10.1016/j.bpj.2012.08.039
external_id:
pmid:
- '23062335'
intvolume: ' 103'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3471482/
month: '10'
oa: 1
oa_version: Submitted Version
page: 1429 - 1439
pmid: 1
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Biophysical Journal
publication_status: published
publisher: Biophysical
publist_id: '3774'
quality_controlled: '1'
scopus_import: 1
status: public
title: A deconvolution based method with high sensitivity and temporal resolution
for detection of spontaneous synaptic currents in vitro and in vivo
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 103
year: '2012'
...
---
_id: '2955'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on finite graphs with reachability
objectives where the first player tries to ensure a target state to be visited
almost-surely (i.e., with probability 1), or positively (i.e., with positive probability),
no matter the strategy of the second player. We classify such games according
to the information and the power of randomization available to the players. On
the basis of information, the game can be one-sided with either (a) player 1,
or (b) player 2 having partial observation (and the other player has perfect observation),
or two-sided with (c) both players having partial observation. On the basis of
randomization, the players (a) may not be allowed to use randomization (pure strategies),
or (b) may choose a probability distribution over actions but the actual random
choice is external and not visible to the player (actions invisible), or (c) may
use full randomization. Our main results for pure strategies are as follows. (1)
For one-sided games with player 1 having partial observation we show that (in
contrast to full randomized strategies) belief-based (subset-construction based)
strategies are not sufficient, and we present an exponential upper bound on memory
both for almostsure and positive winning strategies; we show that the problem
of deciding the existence of almost-sure and positive winning strategies for player
1 is EXPTIME-complete. (2) For one-sided games with player 2 having partial observation
we show that non-elementary memory is both necessary and sufficient for both almost-sure
and positive winning strategies. (3) We show that for the general (two-sided)
case finite-memory strategies are sufficient for both positive and almost-sure
winning, and at least non-elementary memory is required. We establish the equivalence
of the almost-sure winning problems for pure strategies and for randomized strategies
with actions invisible. Our equivalence result exhibits serious flaws in previous
results of the literature: we show a non-elementary memory lower bound for almost-sure
winning whereas an exponential upper bound was previously claimed.'
acknowledgement: 'This work was partially supported by FWF Grant No P 23499-N23, FWF
NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award.'
article_number: '6280436'
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-observation stochastic games: How to win when
belief fails. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on
Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.28'
apa: 'Chatterjee, K., & Doyen, L. (2012). Partial-observation stochastic games:
How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE. https://doi.org/10.1109/LICS.2012.28'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” In Proceedings of the 2012 27th Annual
ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012. https://doi.org/10.1109/LICS.2012.28.'
ieee: 'K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to
win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science, Dubrovnik, Croatia, 2012.'
ista: 'Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to
win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium
on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic
Games: How to Win When Belief Fails.” Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.'
short: K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE
Symposium on Logic in Computer Science, IEEE, 2012.
conference:
end_date: 2012-06-28
location: Dubrovnik, Croatia
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T12:00:32Z
date_published: 2012-08-23T00:00:00Z
date_updated: 2023-02-23T12:23:43Z
day: '23'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.28
ec_funded: 1
external_id:
arxiv:
- '1107.2141'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1107.2141
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer
Science
publication_status: published
publisher: IEEE
publist_id: '3771'
quality_controlled: '1'
related_material:
record:
- id: '2211'
relation: later_version
status: public
- id: '5381'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2012'
...