---
_id: '3252'
abstract:
- lang: eng
text: 'We study the automatic synthesis of fair non-repudiation protocols, a class
of fair exchange protocols, used for digital contract signing. First, we show
how to specify the objectives of the participating agents, the trusted third party
(TTP) and the protocols as path formulas in Linear Temporal Logic (LTL) and prove
that the satisfaction of the objectives of the agents and the TTP imply satisfaction
of the protocol objectives. We then show that weak (co-operative) co-synthesis
and classical (strictly competitive) co-synthesis fail in synthesizing these protocols,
whereas assume-guarantee synthesis (AGS) succeeds. We demonstrate the success
of assume-guarantee synthesis as follows: (a) any solution of assume-guarantee
synthesis is attack-free; no subset of participants can violate the objectives
of the other participants without violating their own objectives; (b) the Asokan-Shoup-Waidner
(ASW) certified mail protocol that has known vulnerabilities is not a solution
of AGS; and (c) the Kremer-Markowitch (KM) non-repudiation protocol is a solution
of AGS. To our knowledge this is the first application of synthesis to fair non-repudiation
protocols, and our results show how synthesis can generate correct protocols and
automatically discover vulnerabilities. The solution to assume-guarantee synthesis
can be computed efficiently as the secure equilibrium solution of three-player
graph games. © 2012 Springer-Verlag.'
acknowledgement: "The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23 (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.\r\nThe authors would like to thank Avik Chaudhuri for his
invaluable help and feedback."
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: Vishwanath
full_name: Raman, Vishwanath
last_name: Raman
citation:
ama: 'Chatterjee K, Raman V. Synthesizing protocols for digital contract signing.
In: Vol 7148. Springer; 2012:152-168. doi:10.1007/978-3-642-27940-9_11'
apa: 'Chatterjee, K., & Raman, V. (2012). Synthesizing protocols for digital
contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification,
Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_11'
chicago: Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for
Digital Contract Signing,” 7148:152–68. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_11.
ieee: 'K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract
signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.'
ista: 'Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract
signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS,
vol. 7148, 152–168.'
mla: Chatterjee, Krishnendu, and Vishwanath Raman. Synthesizing Protocols for
Digital Contract Signing. Vol. 7148, Springer, 2012, pp. 152–68, doi:10.1007/978-3-642-27940-9_11.
short: K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
conference:
end_date: 2012-01-24
location: Philadelphia, PA, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2012-01-22
date_created: 2018-12-11T12:02:16Z
date_published: 2012-01-20T00:00:00Z
date_updated: 2021-01-12T07:42:08Z
day: '20'
department:
- _id: KrCh
doi: 10.1007/978-3-642-27940-9_11
ec_funded: 1
intvolume: ' 7148'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1004.2697
month: '01'
oa: 1
oa_version: Preprint
page: 152 - 168
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: '3405'
quality_controlled: '1'
scopus_import: 1
status: public
title: Synthesizing protocols for digital contract signing
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7148
year: '2012'
...
---
_id: '3253'
abstract:
- lang: eng
text: We describe a framework for reasoning about programs with lists carrying integer
numerical data. We use abstract domains to describe and manipulate complex constraints
on configurations of these programs mixing constraints on the shape of the heap,
sizes of the lists, on the multisets of data stored in these lists, and on the
data at their different positions. Moreover, we provide powerful techniques for
automatic validation of Hoare-triples and invariant checking, as well as for automatic
synthesis of invariants and procedure summaries using modular inter-procedural
analysis. The approach has been implemented in a tool called Celia and experimented
successfully on a large benchmark of programs.
acknowledgement: This work was partly supported by the French National Research Agency
(ANR) project Veridyc (ANR-09-SEGI-016).
alternative_title:
- LNCS
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. Abstract domains for automated
reasoning about list manipulating programs with infinite data. In: Vol 7148. Springer;
2012:1-22. doi:10.1007/978-3-642-27940-9_1'
apa: 'Bouajjani, A., Dragoi, C., Enea, C., & Sighireanu, M. (2012). Abstract
domains for automated reasoning about list manipulating programs with infinite
data (Vol. 7148, pp. 1–22). Presented at the VMCAI: Verification, Model Checking
and Abstract Interpretation, Philadelphia, PA, USA: Springer. https://doi.org/10.1007/978-3-642-27940-9_1'
chicago: Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu.
“Abstract Domains for Automated Reasoning about List Manipulating Programs with
Infinite Data,” 7148:1–22. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_1.
ieee: 'A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Abstract domains for
automated reasoning about list manipulating programs with infinite data,” presented
at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia,
PA, USA, 2012, vol. 7148, pp. 1–22.'
ista: 'Bouajjani A, Dragoi C, Enea C, Sighireanu M. 2012. Abstract domains for automated
reasoning about list manipulating programs with infinite data. VMCAI: Verification,
Model Checking and Abstract Interpretation, LNCS, vol. 7148, 1–22.'
mla: Bouajjani, Ahmed, et al. Abstract Domains for Automated Reasoning about
List Manipulating Programs with Infinite Data. Vol. 7148, Springer, 2012,
pp. 1–22, doi:10.1007/978-3-642-27940-9_1.
short: A. Bouajjani, C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2012, pp.
1–22.
conference:
end_date: 2012-01-24
location: Philadelphia, PA, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2012-01-22
date_created: 2018-12-11T12:02:17Z
date_published: 2012-02-26T00:00:00Z
date_updated: 2021-01-12T07:42:09Z
day: '26'
department:
- _id: ToHe
doi: 10.1007/978-3-642-27940-9_1
intvolume: ' 7148'
language:
- iso: eng
month: '02'
oa_version: None
page: 1 - 22
publication_status: published
publisher: Springer
publist_id: '3404'
quality_controlled: '1'
status: public
title: Abstract domains for automated reasoning about list manipulating programs with
infinite data
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7148
year: '2012'
...
---
_id: '3254'
abstract:
- lang: eng
text: 'The theory of graph games with ω-regular winning conditions is the foundation
for modeling and synthesizing reactive processes. In the case of stochastic reactive
processes, the corresponding stochastic graph games have three players, two of
them (System and Environment) behaving adversarially, and the third (Uncertainty)
behaving probabilistically. We consider two problems for stochastic graph games:
the qualitative problem asks for the set of states from which a player can win
with probability 1 (almost-sure winning); and the quantitative problem asks for
the maximal probability of winning (optimal winning) from each state. We consider
ω-regular winning conditions formalized as Müller winning conditions. We present
optimal memory bounds for pure (deterministic) almost-sure winning and optimal
winning strategies in stochastic graph games with Müller winning conditions. We
also study the complexity of stochastic Müller games and show that both the qualitative
and quantitative analysis problems are PSPACE-complete. Our results are relevant
in synthesis of stochastic reactive processes.'
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), and Microsoft faculty fellows award.'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Chatterjee K. The complexity of stochastic Müller games. Information and
Computation. 2012;211:29-48. doi:10.1016/j.ic.2011.11.004
apa: Chatterjee, K. (2012). The complexity of stochastic Müller games. Information
and Computation. Elsevier. https://doi.org/10.1016/j.ic.2011.11.004
chicago: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information
and Computation. Elsevier, 2012. https://doi.org/10.1016/j.ic.2011.11.004.
ieee: K. Chatterjee, “The complexity of stochastic Müller games,” Information
and Computation, vol. 211. Elsevier, pp. 29–48, 2012.
ista: Chatterjee K. 2012. The complexity of stochastic Müller games. Information
and Computation. 211, 29–48.
mla: Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information
and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004.
short: K. Chatterjee, Information and Computation 211 (2012) 29–48.
date_created: 2018-12-11T12:02:17Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2021-01-12T07:42:09Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.ic.2011.11.004
ec_funded: 1
intvolume: ' 211'
language:
- iso: eng
main_file_link:
- url: http://arise.or.at/pubpdf/The_complexity_of_stochastic_M___u_ller_games.pdf
month: '02'
oa_version: None
page: 29 - 48
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: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '3403'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of stochastic Müller games
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 211
year: '2012'
...
---
_id: '3255'
abstract:
- lang: eng
text: In this paper we survey results of two-player games on graphs and Markov decision
processes with parity, mean-payoff and energy objectives, and the combination
of mean-payoff and energy objectives with parity objectives. These problems have
applications in verification and synthesis of reactive systems in resource-constrained
environments.
acknowledgement: This work was partially supported by FWF NFN Grant S11407-N23 (RiSE)
and a Microsoft faculty fellowship.
alternative_title:
- LNCS
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Games and Markov decision processes with mean payoff
parity and energy parity objectives. In: Vol 7119. Springer; 2012:37-46. doi:10.1007/978-3-642-25929-6_3'
apa: 'Chatterjee, K., & Doyen, L. (2012). Games and Markov decision processes
with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented
at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice,
Czech Republic: Springer. https://doi.org/10.1007/978-3-642-25929-6_3'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes
with Mean Payoff Parity and Energy Parity Objectives,” 7119:37–46. Springer, 2012.
https://doi.org/10.1007/978-3-642-25929-6_3.
ieee: 'K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean
payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical
and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol.
7119, pp. 37–46.'
ista: 'Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean
payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering
Methods in Computer Science, LNCS, vol. 7119, 37–46.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Games and Markov Decision Processes
with Mean Payoff Parity and Energy Parity Objectives. Vol. 7119, Springer,
2012, pp. 37–46, doi:10.1007/978-3-642-25929-6_3.
short: K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
conference:
end_date: 2011-10-16
location: Lednice, Czech Republic
name: 'MEMICS: Mathematical and Engineering Methods in Computer Science'
start_date: 2011-10-14
date_created: 2018-12-11T12:02:17Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:10Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-642-25929-6_3
file:
- access_level: open_access
checksum: eed2cc1e76b160418c977e76e8899a60
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T12:53:12Z
date_updated: 2020-07-14T12:46:05Z
file_id: '7863'
file_name: 2012_MEMICS_Chatterjee.pdf
file_size: 114060
relation: main_file
file_date_updated: 2020-07-14T12:46:05Z
has_accepted_license: '1'
intvolume: ' 7119'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 37 - 46
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '3400'
quality_controlled: '1'
scopus_import: 1
status: public
title: Games and Markov decision processes with mean payoff parity and energy parity
objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7119
year: '2012'
...
---
_id: '3256'
abstract:
- lang: eng
text: We use a distortion to define the dual complex of a cubical subdivision of
ℝ n as an n-dimensional subcomplex of the nerve of the set of n-cubes. Motivated
by the topological analysis of high-dimensional digital image data, we consider
such subdivisions defined by generalizations of quad- and oct-trees to n dimensions.
Assuming the subdivision is balanced, we show that mapping each vertex to the
center of the corresponding n-cube gives a geometric realization of the dual complex
in ℝ n.
acknowledgement: This research is partially supported by the Defense Advanced Research
Projects Agency (DARPA) under grants HR0011-05-1-0057 and HR0011-09-0065 as well
as the National Science Foundation (NSF) under grant DBI-0820624.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Michael
full_name: Kerber, Michael
id: 36E4574A-F248-11E8-B48F-1D18A9856A87
last_name: Kerber
orcid: 0000-0002-8030-9299
citation:
ama: Edelsbrunner H, Kerber M. Dual complexes of cubical subdivisions of ℝn. Discrete
& Computational Geometry. 2012;47(2):393-414. doi:10.1007/s00454-011-9382-4
apa: Edelsbrunner, H., & Kerber, M. (2012). Dual complexes of cubical subdivisions
of ℝn. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-011-9382-4
chicago: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions
of ℝn.” Discrete & Computational Geometry. Springer, 2012. https://doi.org/10.1007/s00454-011-9382-4.
ieee: H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of
ℝn,” Discrete & Computational Geometry, vol. 47, no. 2. Springer, pp.
393–414, 2012.
ista: Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of
ℝn. Discrete & Computational Geometry. 47(2), 393–414.
mla: Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions
of ℝn.” Discrete & Computational Geometry, vol. 47, no. 2, Springer,
2012, pp. 393–414, doi:10.1007/s00454-011-9382-4.
short: H. Edelsbrunner, M. Kerber, Discrete & Computational Geometry 47 (2012)
393–414.
date_created: 2018-12-11T12:02:17Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2021-01-12T07:42:10Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s00454-011-9382-4
file:
- access_level: open_access
checksum: 76486f3b2c9e7fd81342f3832ca387e7
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:15Z
date_updated: 2020-07-14T12:46:05Z
file_id: '4675'
file_name: IST-2016-543-v1+1_2012-J-08-HierarchyCubeComplex.pdf
file_size: 203636
relation: main_file
file_date_updated: 2020-07-14T12:46:05Z
has_accepted_license: '1'
intvolume: ' 47'
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 393 - 414
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '3398'
pubrep_id: '543'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dual complexes of cubical subdivisions of ℝn
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2012'
...
---
_id: '3257'
abstract:
- lang: eng
text: Consider a convex relaxation f̂ of a pseudo-Boolean function f. We say that
the relaxation is totally half-integral if f̂(x) is a polyhedral function with
half-integral extreme points x, and this property is preserved after adding an
arbitrary combination of constraints of the form x i=x j, x i=1-x j, and x i=γ
where γ∈{0,1,1/2} is a constant. A well-known example is the roof duality relaxation
for quadratic pseudo-Boolean functions f. We argue that total half-integrality
is a natural requirement for generalizations of roof duality to arbitrary pseudo-Boolean
functions. Our contributions are as follows. First, we provide a complete characterization
of totally half-integral relaxations f̂ by establishing a one-to-one correspondence
with bisubmodular functions. Second, we give a new characterization of bisubmodular
functions. Finally, we show some relationships between general totally half-integral
relaxations and relaxations based on the roof duality. On the conceptual level,
our results show that bisubmodular functions provide a natural generalization
of the roof duality approach to higher-order terms. This can be viewed as a non-submodular
analogue of the fact that submodular functions generalize the s-t minimum cut
problem with non-negative weights to higher-order terms.
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Generalized roof duality and bisubmodular functions. Discrete
Applied Mathematics. 2012;160(4-5):416-426. doi:10.1016/j.dam.2011.10.026
apa: Kolmogorov, V. (2012). Generalized roof duality and bisubmodular functions.
Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2011.10.026
chicago: Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.”
Discrete Applied Mathematics. Elsevier, 2012. https://doi.org/10.1016/j.dam.2011.10.026.
ieee: V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete
Applied Mathematics, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012.
ista: Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete
Applied Mathematics. 160(4–5), 416–426.
mla: Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.”
Discrete Applied Mathematics, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26,
doi:10.1016/j.dam.2011.10.026.
short: V. Kolmogorov, Discrete Applied Mathematics 160 (2012) 416–426.
date_created: 2018-12-11T12:02:18Z
date_published: 2012-03-01T00:00:00Z
date_updated: 2023-02-23T11:04:49Z
day: '01'
department:
- _id: VlKo
doi: 10.1016/j.dam.2011.10.026
external_id:
arxiv:
- '1005.2305'
intvolume: ' 160'
issue: 4-5
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1005.2305
month: '03'
oa: 1
oa_version: Preprint
page: 416 - 426
publication: Discrete Applied Mathematics
publication_status: published
publisher: Elsevier
publist_id: '3397'
quality_controlled: '1'
related_material:
record:
- id: '2934'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Generalized roof duality and bisubmodular functions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 160
year: '2012'
...
---
_id: '3258'
abstract:
- lang: eng
text: CA3 pyramidal neurons are important for memory formation and pattern completion
in the hippocampal network. It is generally thought that proximal synapses from
the mossy fibers activate these neurons most efficiently, whereas distal inputs
from the perforant path have a weaker modulatory influence. We used confocally
targeted patch-clamp recording from dendrites and axons to map the activation
of rat CA3 pyramidal neurons at the subcellular level. Our results reveal two
distinct dendritic domains. In the proximal domain, action potentials initiated
in the axon backpropagate actively with large amplitude and fast time course.
In the distal domain, Na+ channel–mediated dendritic spikes are efficiently initiated
by waveforms mimicking synaptic events. CA3 pyramidal neuron dendrites showed
a high Na+-to-K+ conductance density ratio, providing ideal conditions for active
backpropagation and dendritic spike initiation. Dendritic spikes may enhance the
computational power of CA3 pyramidal neurons in the hippocampal network.
acknowledgement: This work was supported by the Deutsche Forschungsgemeinschaft (TR
3/B10) and the European Union (European Research Council Advanced grant to P.J.).
article_processing_charge: No
article_type: original
author:
- first_name: Sooyun
full_name: Kim, Sooyun
id: 394AB1C8-F248-11E8-B48F-1D18A9856A87
last_name: Kim
- first_name: José
full_name: Guzmán, José
id: 30CC5506-F248-11E8-B48F-1D18A9856A87
last_name: Guzmán
orcid: 0000-0003-2209-5242
- first_name: Hua
full_name: Hu, Hua
id: 4AC0145C-F248-11E8-B48F-1D18A9856A87
last_name: Hu
- 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: Kim S, Guzmán J, Hu H, Jonas PM. Active dendrites support efficient initiation
of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience.
2012;15(4):600-606. doi:10.1038/nn.3060
apa: Kim, S., Guzmán, J., Hu, H., & Jonas, P. M. (2012). Active dendrites support
efficient initiation of dendritic spikes in hippocampal CA3 pyramidal neurons.
Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.3060
chicago: Kim, Sooyun, José Guzmán, Hua Hu, and Peter M Jonas. “Active Dendrites
Support Efficient Initiation of Dendritic Spikes in Hippocampal CA3 Pyramidal
Neurons.” Nature Neuroscience. Nature Publishing Group, 2012. https://doi.org/10.1038/nn.3060.
ieee: S. Kim, J. Guzmán, H. Hu, and P. M. Jonas, “Active dendrites support efficient
initiation of dendritic spikes in hippocampal CA3 pyramidal neurons,” Nature
Neuroscience, vol. 15, no. 4. Nature Publishing Group, pp. 600–606, 2012.
ista: Kim S, Guzmán J, Hu H, Jonas PM. 2012. Active dendrites support efficient
initiation of dendritic spikes in hippocampal CA3 pyramidal neurons. Nature Neuroscience.
15(4), 600–606.
mla: Kim, Sooyun, et al. “Active Dendrites Support Efficient Initiation of Dendritic
Spikes in Hippocampal CA3 Pyramidal Neurons.” Nature Neuroscience, vol.
15, no. 4, Nature Publishing Group, 2012, pp. 600–06, doi:10.1038/nn.3060.
short: S. Kim, J. Guzmán, H. Hu, P.M. Jonas, Nature Neuroscience 15 (2012) 600–606.
date_created: 2018-12-11T12:02:18Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2023-09-07T11:43:52Z
day: '01'
department:
- _id: PeJo
doi: 10.1038/nn.3060
external_id:
pmid:
- '22388958'
intvolume: ' 15'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3617474/
month: '04'
oa: 1
oa_version: Published Version
page: 600 - 606
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: Nature Neuroscience
publication_identifier:
issn:
- 1546-1726
publication_status: published
publisher: Nature Publishing Group
publist_id: '3390'
quality_controlled: '1'
related_material:
record:
- id: '2964'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Active dendrites support efficient initiation of dendritic spikes in hippocampal
CA3 pyramidal neurons
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 15
year: '2012'
...
---
_id: '3260'
abstract:
- lang: eng
text: "Many scenarios in the living world, where individual organisms compete for
winning positions (or resources), have properties of auctions. Here we study the
evolution of bids in biological auctions. For each auction, n individuals are
drawn at random from a population of size N. Each individual makes a bid which
entails a cost. The winner obtains a benefit of a certain value. Costs and benefits
are translated into reproductive success (fitness). Therefore, successful bidding
strategies spread in the population. We compare two types of auctions. In “biological
all-pay auctions”, the costs are the bid for every participating individual. In
“biological second price all-pay auctions”, the cost for everyone other than the
winner is the bid, but the cost for the winner is the second highest bid. Second
price all-pay auctions are generalizations of the “war of attrition” introduced
by Maynard Smith. We study evolutionary dynamics in both types of auctions. We
calculate pairwise invasion plots and evolutionarily stable distributions over
the continuous strategy space. We find that the average bid in second price all-pay
auctions is higher than in all-pay auctions, but the average cost for the winner
is similar in both auctions. In both cases, the average bid is a declining function
of the number of participants, n. The more individuals participate in an auction
the smaller is the chance of winning, and thus expensive bids must be avoided.\r\n"
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Reiter J, Nowak M. Evolutionary dynamics of biological auctions.
Theoretical Population Biology. 2012;81(1):69-80. doi:10.1016/j.tpb.2011.11.003
apa: Chatterjee, K., Reiter, J., & Nowak, M. (2012). Evolutionary dynamics of
biological auctions. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2011.11.003
chicago: Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary
Dynamics of Biological Auctions.” Theoretical Population Biology. Academic
Press, 2012. https://doi.org/10.1016/j.tpb.2011.11.003.
ieee: K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological
auctions,” Theoretical Population Biology, vol. 81, no. 1. Academic Press,
pp. 69–80, 2012.
ista: Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological
auctions. Theoretical Population Biology. 81(1), 69–80.
mla: Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.”
Theoretical Population Biology, vol. 81, no. 1, Academic Press, 2012, pp.
69–80, doi:10.1016/j.tpb.2011.11.003.
short: K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012)
69–80.
date_created: 2018-12-11T12:02:19Z
date_published: 2012-02-01T00:00:00Z
date_updated: 2023-09-07T11:40:43Z
day: '01'
department:
- _id: KrCh
doi: 10.1016/j.tpb.2011.11.003
ec_funded: 1
external_id:
pmid:
- '22120126'
intvolume: ' 81'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3279759/ '
month: '02'
oa: 1
oa_version: Submitted Version
page: 69 - 80
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: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '3388'
quality_controlled: '1'
related_material:
record:
- id: '1400'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Evolutionary dynamics of biological auctions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 81
year: '2012'
...
---
_id: '3262'
abstract:
- lang: eng
text: Living cells must control the reading out or "expression" of information
encoded in their genomes, and this regulation often is mediated by transcription
factors--proteins that bind to DNA and either enhance or repress the expression
of nearby genes. But the expression of transcription factor proteins is itself
regulated, and many transcription factors regulate their own expression in addition
to responding to other input signals. Here we analyze the simplest of such self-regulatory
circuits, asking how parameters can be chosen to optimize information transmission
from inputs to outputs in the steady state. Some nonzero level of self-regulation
is almost always optimal, with self-activation dominant when transcription factor
concentrations are low and self-repression dominant when concentrations are high.
In steady state the optimal self-activation is never strong enough to induce bistability,
although there is a limit in which the optimal parameters are very close to the
critical point.
acknowledgement: "We thank T. Gregor, E. F. Wieschaus, and, especially, C. G. Callan
for helpful discussions.\r\nWork at Princeton was supported in part by NSF Grants
No. PHY–0957573 and No. CCF–0939370, by NIH Grant No. R01 GM077599, and by the W.
M. Keck Foundation. For part of this work, G.T. was supported in part by NSF Grant
No. EF–0928048 and by the Vice Provost for Research at the University of Pennsylvania."
article_number: '041903'
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Aleksandra
full_name: Walczak, Aleksandra
last_name: Walczak
- first_name: William
full_name: Bialek, William
last_name: Bialek
citation:
ama: Tkačik G, Walczak A, Bialek W. Optimizing information flow in small genetic
networks. III. A self-interacting gene. Physical Review E statistical nonlinear
and soft matter physics . 2012;85(4). doi:10.1103/PhysRevE.85.041903
apa: Tkačik, G., Walczak, A., & Bialek, W. (2012). Optimizing information flow
in small genetic networks. III. A self-interacting gene. Physical Review E
Statistical Nonlinear and Soft Matter Physics . American Institute of Physics.
https://doi.org/10.1103/PhysRevE.85.041903
chicago: Tkačik, Gašper, Aleksandra Walczak, and William Bialek. “Optimizing Information
Flow in Small Genetic Networks. III. A Self-Interacting Gene.” Physical Review
E Statistical Nonlinear and Soft Matter Physics . American Institute of Physics,
2012. https://doi.org/10.1103/PhysRevE.85.041903.
ieee: G. Tkačik, A. Walczak, and W. Bialek, “Optimizing information flow in small
genetic networks. III. A self-interacting gene,” Physical Review E statistical
nonlinear and soft matter physics , vol. 85, no. 4. American Institute of
Physics, 2012.
ista: Tkačik G, Walczak A, Bialek W. 2012. Optimizing information flow in small
genetic networks. III. A self-interacting gene. Physical Review E statistical
nonlinear and soft matter physics . 85(4), 041903.
mla: Tkačik, Gašper, et al. “Optimizing Information Flow in Small Genetic Networks.
III. A Self-Interacting Gene.” Physical Review E Statistical Nonlinear and
Soft Matter Physics , vol. 85, no. 4, 041903, American Institute of Physics,
2012, doi:10.1103/PhysRevE.85.041903.
short: G. Tkačik, A. Walczak, W. Bialek, Physical Review E Statistical Nonlinear
and Soft Matter Physics 85 (2012).
date_created: 2018-12-11T12:02:20Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2021-01-12T07:42:14Z
day: '01'
department:
- _id: GaTk
doi: 10.1103/PhysRevE.85.041903
intvolume: ' 85'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1112.5026
month: '04'
oa: 1
oa_version: Preprint
publication: ' Physical Review E statistical nonlinear and soft matter physics '
publication_status: published
publisher: American Institute of Physics
publist_id: '3386'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimizing information flow in small genetic networks. III. A self-interacting
gene
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 85
year: '2012'
...
---
_id: '3265'
abstract:
- lang: eng
text: We propose a mid-level statistical model for image segmentation that composes
multiple figure-ground hypotheses (FG) obtained by applying constraints at different
locations and scales, into larger interpretations (tilings) of the entire image.
Inference is cast as optimization over sets of maximal cliques sampled from a
graph connecting all non-overlapping figure-ground segment hypotheses. Potential
functions over cliques combine unary, Gestalt-based figure qualities, and pairwise
compatibilities among spatially neighboring segments, constrained by T-junctions
and the boundary interface statistics of real scenes. Learning the model parameters
is based on maximum likelihood, alternating between sampling image tilings and
optimizing their potential function parameters. State of the art results are reported
on the Berkeley and Stanford segmentation datasets, as well as VOC2009, where
a 28% improvement was achieved.
article_number: '6126486'
author:
- first_name: Adrian
full_name: Ion, Adrian
id: 29F89302-F248-11E8-B48F-1D18A9856A87
last_name: Ion
- first_name: Joao
full_name: Carreira, Joao
last_name: Carreira
- first_name: Cristian
full_name: Sminchisescu, Cristian
last_name: Sminchisescu
citation:
ama: 'Ion A, Carreira J, Sminchisescu C. Image segmentation by figure-ground composition
into maximal cliques. In: IEEE; 2012. doi:10.1109/ICCV.2011.6126486'
apa: 'Ion, A., Carreira, J., & Sminchisescu, C. (2012). Image segmentation by
figure-ground composition into maximal cliques. Presented at the ICCV: International
Conference on Computer Vision, Barcelona, Spain: IEEE. https://doi.org/10.1109/ICCV.2011.6126486'
chicago: Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Image Segmentation
by Figure-Ground Composition into Maximal Cliques.” IEEE, 2012. https://doi.org/10.1109/ICCV.2011.6126486.
ieee: 'A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground
composition into maximal cliques,” presented at the ICCV: International Conference
on Computer Vision, Barcelona, Spain, 2012.'
ista: 'Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground
composition into maximal cliques. ICCV: International Conference on Computer Vision,
6126486.'
mla: Ion, Adrian, et al. Image Segmentation by Figure-Ground Composition into
Maximal Cliques. 6126486, IEEE, 2012, doi:10.1109/ICCV.2011.6126486.
short: A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.
conference:
end_date: 2011-11-13
location: Barcelona, Spain
name: 'ICCV: International Conference on Computer Vision'
start_date: 2011-11-06
date_created: 2018-12-11T12:02:21Z
date_published: 2012-01-12T00:00:00Z
date_updated: 2021-01-12T07:42:15Z
day: '12'
department:
- _id: HeEd
doi: 10.1109/ICCV.2011.6126486
language:
- iso: eng
month: '01'
oa_version: None
publication_status: published
publisher: IEEE
publist_id: '3382'
quality_controlled: '1'
status: public
title: Image segmentation by figure-ground composition into maximal cliques
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2012'
...
---
_id: '3274'
abstract:
- lang: eng
text: A boundary element model of a tunnel running through horizontally layered
soil with anisotropic material properties is presented. Since there is no analytical
fundamental solution for wave propagation inside a layered orthotropic medium
in 3D, the fundamental displacements and stresses have to be calculated numerically.
In our model this is done in the Fourier domain with respect to space and time.
The assumption of a straight tunnel with infinite extension in the x direction
makes it possible to decouple the system for every wave number kx, leading to
a 2.5D-problem, which is suited for parallel computation. The special form of
the fundamental solution, resulting from our Fourier ansatz, and the fact, that
the calculation of the boundary integral equation is performed in the Fourier
domain, enhances the stability and efficiency of the numerical calculations.
acknowledgement: This work was supported by the Austrian Federal Ministry of Transport,
Innovation and Technology under the Grant Bmvit-isb2 and the FFG under the project
Pr. Nr. 809089.
author:
- first_name: Georg
full_name: Rieckh, Georg
id: 34DA8BD6-F248-11E8-B48F-1D18A9856A87
last_name: Rieckh
- first_name: Wolfgang
full_name: Kreuzer, Wolfgang
last_name: Kreuzer
- first_name: Holger
full_name: Waubke, Holger
last_name: Waubke
- first_name: Peter
full_name: Balazs, Peter
last_name: Balazs
citation:
ama: Rieckh G, Kreuzer W, Waubke H, Balazs P. A 2.5D-Fourier-BEM model for vibrations
in a tunnel running through layered anisotropic soil. Engineering Analysis
with Boundary Elements. 2012;36(6):960-967. doi:10.1016/j.enganabound.2011.12.014
apa: Rieckh, G., Kreuzer, W., Waubke, H., & Balazs, P. (2012). A 2.5D-Fourier-BEM
model for vibrations in a tunnel running through layered anisotropic soil.
Engineering Analysis with Boundary Elements. Elsevier. https://doi.org/10.1016/j.enganabound.2011.12.014
chicago: Rieckh, Georg, Wolfgang Kreuzer, Holger Waubke, and Peter Balazs. “A 2.5D-Fourier-BEM
Model for Vibrations in a Tunnel Running through Layered Anisotropic Soil.”
Engineering Analysis with Boundary Elements. Elsevier, 2012. https://doi.org/10.1016/j.enganabound.2011.12.014.
ieee: G. Rieckh, W. Kreuzer, H. Waubke, and P. Balazs, “A 2.5D-Fourier-BEM model
for vibrations in a tunnel running through layered anisotropic soil,” Engineering
Analysis with Boundary Elements, vol. 36, no. 6. Elsevier, pp. 960–967, 2012.
ista: Rieckh G, Kreuzer W, Waubke H, Balazs P. 2012. A 2.5D-Fourier-BEM model for
vibrations in a tunnel running through layered anisotropic soil. Engineering
Analysis with Boundary Elements. 36(6), 960–967.
mla: Rieckh, Georg, et al. “A 2.5D-Fourier-BEM Model for Vibrations in a Tunnel
Running through Layered Anisotropic Soil.” Engineering Analysis with Boundary
Elements, vol. 36, no. 6, Elsevier, 2012, pp. 960–67, doi:10.1016/j.enganabound.2011.12.014.
short: G. Rieckh, W. Kreuzer, H. Waubke, P. Balazs, Engineering Analysis with Boundary
Elements 36 (2012) 960–967.
date_created: 2018-12-11T12:02:24Z
date_published: 2012-06-01T00:00:00Z
date_updated: 2021-01-12T07:42:19Z
day: '01'
department:
- _id: GaTk
doi: 10.1016/j.enganabound.2011.12.014
intvolume: ' 36'
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 960 - 967
publication: ' Engineering Analysis with Boundary Elements'
publication_status: published
publisher: Elsevier
publist_id: '3372'
quality_controlled: '1'
scopus_import: 1
status: public
title: A 2.5D-Fourier-BEM model for vibrations in a tunnel running through layered
anisotropic soil
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2012'
...
---
_id: '3277'
abstract:
- lang: eng
text: The problem of the origin of metazoa is becoming more urgent in the context
of astrobiology. By now it is clear that clues to the understanding of this crucial
transition in the evolution of life can arise in a fourth pathway besides the
three possibilities in the quest for simplicity outlined by Bonner in his classical
book. In other words, solar system exploration seems to be one way in the long-term
to elucidate the simplicity of evolutionary development. We place these ideas
in the context of different inheritance systems, namely the genotypic and phenotypic
replicators with limited or unlimited heredity, and ask which of these can support
multicellular development, and to which degree of complexity. However, the quest
for evidence on the evolution of biotas from planets around other stars does not
seem to be feasible with present technology with direct visualization of living
organisms on exoplanets. But this may be attempted on the Galilean moons of Jupiter
where there is a possibility of detecting reliable biomarkers in the next decade
with the Europa Jupiter System Mission, in view of recent progress by landing
micropenetrators on planetary, or satellite surfaces. Mars is a second possibility
in the inner Solar System, in spite of the multiple difficulties faced by the
fleet of past, present and future missions. We discuss a series of preliminary
ideas for elucidating the origin of metazoan analogues with available instrumentation
in potential payloads of feasible space missions to the Galilean moons.
alternative_title:
- Cellular Origin, Life in Extreme Habitats and Astrobiology
author:
- first_name: Harold
full_name: de Vladar, Harold
id: 2A181218-F248-11E8-B48F-1D18A9856A87
last_name: de Vladar
orcid: 0000-0002-5985-7653
- first_name: Julian
full_name: Chela Flores, Julian
last_name: Chela Flores
citation:
ama: 'de Vladar H, Chela Flores J. Can the evolution of multicellularity be anticipated
in the exploration of the solar system? In: Life on Earth and Other Planetary
Bodies. Vol 24. Springer; 2012:387-405. doi:10.1007/978-94-007-4966-5_22'
apa: de Vladar, H., & Chela Flores, J. (2012). Can the evolution of multicellularity
be anticipated in the exploration of the solar system? In Life on Earth and
other planetary bodies (Vol. 24, pp. 387–405). Springer. https://doi.org/10.1007/978-94-007-4966-5_22
chicago: Vladar, Harold de, and Julian Chela Flores. “Can the Evolution of Multicellularity
Be Anticipated in the Exploration of the Solar System?” In Life on Earth and
Other Planetary Bodies, 24:387–405. Springer, 2012. https://doi.org/10.1007/978-94-007-4966-5_22.
ieee: H. de Vladar and J. Chela Flores, “Can the evolution of multicellularity be
anticipated in the exploration of the solar system?,” in Life on Earth and
other planetary bodies, vol. 24, Springer, 2012, pp. 387–405.
ista: 'de Vladar H, Chela Flores J. 2012.Can the evolution of multicellularity be
anticipated in the exploration of the solar system? In: Life on Earth and other
planetary bodies. Cellular Origin, Life in Extreme Habitats and Astrobiology,
vol. 24, 387–405.'
mla: de Vladar, Harold, and Julian Chela Flores. “Can the Evolution of Multicellularity
Be Anticipated in the Exploration of the Solar System?” Life on Earth and Other
Planetary Bodies, vol. 24, Springer, 2012, pp. 387–405, doi:10.1007/978-94-007-4966-5_22.
short: H. de Vladar, J. Chela Flores, in:, Life on Earth and Other Planetary Bodies,
Springer, 2012, pp. 387–405.
date_created: 2018-12-11T12:02:25Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:20Z
day: '01'
department:
- _id: NiBa
doi: 10.1007/978-94-007-4966-5_22
intvolume: ' 24'
language:
- iso: eng
month: '01'
oa_version: None
page: 387 - 405
publication: Life on Earth and other planetary bodies
publication_status: published
publisher: Springer
publist_id: '3369'
quality_controlled: '1'
status: public
title: Can the evolution of multicellularity be anticipated in the exploration of
the solar system?
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2012'
...
---
_id: '3279'
abstract:
- lang: eng
text: "We show a hardness-preserving construction of a PRF from any length doubling
PRG which improves upon known constructions whenever we can put a non-trivial
upper bound q on the number of queries to the PRF. Our construction requires only
O(logq) invocations to the underlying PRG with each query. In comparison, the
number of invocations by the best previous hardness-preserving construction (GGM
using Levin's trick) is logarithmic in the hardness of the PRG. For example, starting
from an exponentially secure PRG {0,1} n → {0,1} 2n, we get a PRF which is exponentially
secure if queried at most q = exp(√n)times and where each invocation of the PRF
requires Θ(√n) queries to the underlying PRG. This is much less than the Θ(n)
required by known constructions. \r\n"
acknowledgement: Supported by the European Research Council under the European Union’s
Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)
alternative_title:
- LNCS
author:
- first_name: Abhishek
full_name: Jain, Abhishek
last_name: Jain
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Aris
full_name: Tentes, Aris
last_name: Tentes
citation:
ama: 'Jain A, Pietrzak KZ, Tentes A. Hardness preserving constructions of pseudorandom
functions. In: Vol 7194. Springer; 2012:369-382. doi:10.1007/978-3-642-28914-9_21'
apa: 'Jain, A., Pietrzak, K. Z., & Tentes, A. (2012). Hardness preserving constructions
of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory
of Cryptography Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_21'
chicago: Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving
Constructions of Pseudorandom Functions,” 7194:369–82. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_21.
ieee: 'A. Jain, K. Z. Pietrzak, and A. Tentes, “Hardness preserving constructions
of pseudorandom functions,” presented at the TCC: Theory of Cryptography Conference,
Taormina, Sicily, Italy, 2012, vol. 7194, pp. 369–382.'
ista: 'Jain A, Pietrzak KZ, Tentes A. 2012. Hardness preserving constructions of
pseudorandom functions. TCC: Theory of Cryptography Conference, LNCS, vol. 7194,
369–382.'
mla: Jain, Abhishek, et al. Hardness Preserving Constructions of Pseudorandom
Functions. Vol. 7194, Springer, 2012, pp. 369–82, doi:10.1007/978-3-642-28914-9_21.
short: A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.
conference:
end_date: 2012-03-21
location: Taormina, Sicily, Italy
name: 'TCC: Theory of Cryptography Conference'
start_date: 2012-03-19
date_created: 2018-12-11T12:02:25Z
date_published: 2012-05-04T00:00:00Z
date_updated: 2021-01-12T07:42:21Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-642-28914-9_21
ec_funded: 1
intvolume: ' 7194'
language:
- iso: eng
main_file_link:
- url: http://www.iacr.org/archive/tcc2012/tcc2012-index.html
month: '05'
oa_version: None
page: 369 - 382
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '3367'
quality_controlled: '1'
scopus_import: 1
status: public
title: Hardness preserving constructions of pseudorandom functions
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7194
year: '2012'
...
---
_id: '3280'
abstract:
- lang: eng
text: 'The (decisional) learning with errors problem (LWE) asks to distinguish "noisy"
inner products of a secret vector with random vectors from uniform. The learning
parities with noise problem (LPN) is the special case where the elements of the
vectors are bits. In recent years, the LWE and LPN problems have found many applications
in cryptography. In this paper we introduce a (seemingly) much stronger adaptive
assumption, called "subspace LWE" (SLWE), where the adversary can learn
the inner product of the secret and random vectors after they were projected into
an adaptively and adversarially chosen subspace. We prove that, surprisingly,
the SLWE problem mapping into subspaces of dimension d is almost as hard as LWE
using secrets of length d (the other direction is trivial.) This result immediately
implies that several existing cryptosystems whose security is based on the hardness
of the LWE/LPN problems are provably secure in a much stronger sense than anticipated.
As an illustrative example we show that the standard way of using LPN for symmetric
CPA secure encryption is even secure against a very powerful class of related
key attacks. '
acknowledgement: Supported by the European Research Council under the European Union’s
Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC).
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Pietrzak KZ. Subspace LWE. In: Vol 7194. Springer; 2012:548-563. doi:10.1007/978-3-642-28914-9_31'
apa: 'Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at
the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.
https://doi.org/10.1007/978-3-642-28914-9_31'
chicago: Pietrzak, Krzysztof Z. “Subspace LWE,” 7194:548–63. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_31.
ieee: 'K. Z. Pietrzak, “Subspace LWE,” presented at the TCC: Theory of Cryptography
Conference, Taormina, Sicily, Italy, 2012, vol. 7194, pp. 548–563.'
ista: 'Pietrzak KZ. 2012. Subspace LWE. TCC: Theory of Cryptography Conference,
LNCS, vol. 7194, 548–563.'
mla: Pietrzak, Krzysztof Z. Subspace LWE. Vol. 7194, Springer, 2012, pp.
548–63, doi:10.1007/978-3-642-28914-9_31.
short: K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.
conference:
end_date: 2012-03-21
location: Taormina, Sicily, Italy
name: 'TCC: Theory of Cryptography Conference'
start_date: 2012-03-19
date_created: 2018-12-11T12:02:26Z
date_published: 2012-05-04T00:00:00Z
date_updated: 2021-01-12T07:42:21Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-642-28914-9_31
ec_funded: 1
intvolume: ' 7194'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.iacr.org/archive/tcc2012/71940166/71940166.pdf
month: '05'
oa: 1
oa_version: Submitted Version
page: 548 - 563
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '3366'
quality_controlled: '1'
status: public
title: Subspace LWE
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7194
year: '2012'
...
---
_id: '3281'
abstract:
- lang: eng
text: 'We consider the problem of amplifying the "lossiness" of functions.
We say that an oracle circuit C*: {0,1} m → {0,1}* amplifies relative lossiness
from ℓ/n to L/m if for every function f:{0,1} n → {0,1} n it holds that 1 If f
is injective then so is C f. 2 If f has image size of at most 2 n-ℓ, then C f
has image size at most 2 m-L. The question is whether such C* exists for L/m ≫
ℓ/n. This problem arises naturally in the context of cryptographic "lossy
functions," where the relative lossiness is the key parameter. We show that
for every circuit C* that makes at most t queries to f, the relative lossiness
of C f is at most L/m ≤ ℓ/n + O(log t)/n. In particular, no black-box method making
a polynomial t = poly(n) number of queries can amplify relative lossiness by more
than an O(logn)/n additive term. We show that this is tight by giving a simple
construction (cascading with some randomization) that achieves such amplification.'
acknowledgement: "We would like to thank Oded Goldreich and Omer Rein- gold for discussions
at an early stage of this project, and Scott Aaronson for clarifications regarding
the collision problem.\r\n"
alternative_title:
- LNCS
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Alon
full_name: Rosen, Alon
last_name: Rosen
- first_name: Gil
full_name: Segev, Gil
last_name: Segev
citation:
ama: 'Pietrzak KZ, Rosen A, Segev G. Lossy functions do not amplify well. In: Vol
7194. Springer; 2012:458-475. doi:10.1007/978-3-642-28914-9_26'
apa: 'Pietrzak, K. Z., Rosen, A., & Segev, G. (2012). Lossy functions do not
amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography
Conference, Taormina, Sicily, Italy: Springer. https://doi.org/10.1007/978-3-642-28914-9_26'
chicago: Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not
Amplify Well,” 7194:458–75. Springer, 2012. https://doi.org/10.1007/978-3-642-28914-9_26.
ieee: 'K. Z. Pietrzak, A. Rosen, and G. Segev, “Lossy functions do not amplify well,”
presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy,
2012, vol. 7194, pp. 458–475.'
ista: 'Pietrzak KZ, Rosen A, Segev G. 2012. Lossy functions do not amplify well.
TCC: Theory of Cryptography Conference, LNCS, vol. 7194, 458–475.'
mla: Pietrzak, Krzysztof Z., et al. Lossy Functions Do Not Amplify Well.
Vol. 7194, Springer, 2012, pp. 458–75, doi:10.1007/978-3-642-28914-9_26.
short: K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.
conference:
end_date: 2012-03-21
location: Taormina, Sicily, Italy
name: 'TCC: Theory of Cryptography Conference'
start_date: 2012-03-19
date_created: 2018-12-11T12:02:26Z
date_published: 2012-05-04T00:00:00Z
date_updated: 2021-01-12T07:42:22Z
day: '04'
department:
- _id: KrPi
doi: 10.1007/978-3-642-28914-9_26
intvolume: ' 7194'
language:
- iso: eng
main_file_link:
- url: http://www.iacr.org/archive/tcc2012/tcc2012-index.html
month: '05'
oa_version: None
page: 458 - 475
publication_status: published
publisher: Springer
publist_id: '3365'
quality_controlled: '1'
status: public
title: Lossy functions do not amplify well
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7194
year: '2012'
...
---
_id: '3282'
abstract:
- lang: eng
text: 'Traditionally, symmetric-key message authentication codes (MACs) are easily
built from pseudorandom functions (PRFs). In this work we propose a wide variety
of other approaches to building efficient MACs, without going through a PRF first.
In particular, unlike deterministic PRF-based MACs, where each message has a unique
valid tag, we give a number of probabilistic MAC constructions from various other
primitives/assumptions. Our main results are summarized as follows: We show several
new probabilistic MAC constructions from a variety of general assumptions, including
CCA-secure encryption, Hash Proof Systems and key-homomorphic weak PRFs. By instantiating
these frameworks under concrete number theoretic assumptions, we get several schemes
which are more efficient than just using a state-of-the-art PRF instantiation
under the corresponding assumption. For probabilistic MACs, unlike deterministic
ones, unforgeability against a chosen message attack (uf-cma ) alone does not
imply security if the adversary can additionally make verification queries (uf-cmva
). We give an efficient generic transformation from any uf-cma secure MAC which
is "message-hiding" into a uf-cmva secure MAC. This resolves the main
open problem of Kiltz et al. from Eurocrypt''11; By using our transformation on
their constructions, we get the first efficient MACs from the LPN assumption.
While all our new MAC constructions immediately give efficient actively secure,
two-round symmetric-key identification schemes, we also show a very simple, three-round
actively secure identification protocol from any weak PRF. In particular, the
resulting protocol is much more efficient than the trivial approach of building
a regular PRF from a weak PRF. © 2012 International Association for Cryptologic
Research.'
acknowledgement: Supported by the European Research Council under the European Union’s
Seventh Framework Programme (FP7/2007-2013) / ERC Starting Grant (259668-PSPC)
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. Message authentication, revisited.
In: Vol 7237. Springer; 2012:355-374. doi:10.1007/978-3-642-29011-4_22'
apa: 'Dodis, Y., Pietrzak, K. Z., Kiltz, E., & Wichs, D. (2012). Message authentication,
revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications
of Cryptographic Techniques, Cambridge, UK: Springer. https://doi.org/10.1007/978-3-642-29011-4_22'
chicago: Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message
Authentication, Revisited,” 7237:355–74. Springer, 2012. https://doi.org/10.1007/978-3-642-29011-4_22.
ieee: 'Y. Dodis, K. Z. Pietrzak, E. Kiltz, and D. Wichs, “Message authentication,
revisited,” presented at the EUROCRYPT: Theory and Applications of Cryptographic
Techniques, Cambridge, UK, 2012, vol. 7237, pp. 355–374.'
ista: 'Dodis Y, Pietrzak KZ, Kiltz E, Wichs D. 2012. Message authentication, revisited.
EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 7237,
355–374.'
mla: Dodis, Yevgeniy, et al. Message Authentication, Revisited. Vol. 7237,
Springer, 2012, pp. 355–74, doi:10.1007/978-3-642-29011-4_22.
short: Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.
conference:
end_date: 2012-04-19
location: Cambridge, UK
name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques'
start_date: 2012-04-15
date_created: 2018-12-11T12:02:27Z
date_published: 2012-03-10T00:00:00Z
date_updated: 2021-01-12T07:42:22Z
day: '10'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-642-29011-4_22
ec_funded: 1
file:
- access_level: open_access
checksum: 8557c17a8c2586d06ebfe62d934f5c5f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:23Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5074'
file_name: IST-2016-686-v1+1_059.pdf
file_size: 372292
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 7237'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: Submitted Version
page: 355 - 374
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '3364'
pubrep_id: '686'
quality_controlled: '1'
status: public
title: Message authentication, revisited
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7237
year: '2012'
...
---
_id: '3289'
abstract:
- lang: eng
text: "Viral manipulation of transduction pathways associated with key cellular
functions such as survival, response to microbial infection, and cytoskeleton
reorganization can provide the supportive milieu for a productive infection. Here,
we demonstrate that vaccinia virus (VACV) infection leads to activation of the
stress-activated protein kinase (SAPK)/extracellular signal-regulated kinase (ERK)
4/7 (MKK4/7)-c-Jun N-terminal protein kinase 1/2 (JNK1/2) pathway; further, the
stimulation of this pathway requires postpenetration, prereplicative events in
the viral replication cycle. Although the formation of intracellular mature virus
(IMV) was not affected in MKK4/7- or JNK1/2-knockout (KO) cells, we did note an
accentuated deregulation of microtubule and actin network organization in infected
JNK1/2-KO cells. This was followed by deregulated viral trafficking to the periphery
and enhanced enveloped particle release. Furthermore, VACV infection induced alterations
in the cell contractility and morphology, and cell migration was reduced in the
JNK-KO cells. In addition, phosphorylation of proteins implicated with early cell
contractility and cell migration, such as microtubule-associated protein 1B and
paxillin, respectively, was not detected in the VACV-infected KO cells. In sum,
our findings uncover a regulatory role played by the MKK4/7-JNK1/2 pathway in
cytoskeleton reorganization during VACV infection.\r\n"
acknowledgement: "This work was supported by grants from Fundação de Amparo a Pesquisa
do Estado de Minas Gerais (FAPEMIG), the Brazilian Federal Agency for Support and
Evaluation of Graduate Education (CAPES), and the National Council for Scientific
and Technological Development (CNPq). A.C.T.C.P., B.S.A.F.B., F.G.G.L., and J.A.P.S.-M.
were recipients of predoctoral fellowships from CNPq. C.A.B., E.G.K., T.S.-P., P.F.P.P.,
and P.C.P.F. are recipients of research fellowships from CNPq. \r\n\r\n\r\nWe are
grateful to Angela S. Lopes, Ilda M. V. Gama, João R. dos Santos, and Andreza A.
Carvalho for their secretarial/technical assistance and to Fernanda Gambogi for
help with immunofluorescence microscopy. We also thank M. C. Sogayar (Department
of Biochemistry, University of São Paulo, São Paulo, Brazil), who kindly provided
us with the A31 cell line, and R. Davis (Howard Hughes Medical Institute, University
of Massachusetts Medical School, Worcester, MA) for the WT and JNK1/2-, MKK4-, MKK7-,
and MKK4/7-KO cells. VACV WR was from C. Jungwirth (Universität Würzburg, Würzburg,
Germany). The recombinant VACV vF13L-GFP and the rabbit polyclonal antibodies against
viral proteins, B5R, D8L, L1R, and A36R, were from B. Moss (NIAID, Bethesda, MD).
The pcDNA3-Myc-JNK2-MKK7 WT plasmid was from Eugen Kerkhoff (Universität Würzburg,
Würzburg, Germany). We also thank Flávio G. da Fonseca (UFMG, Belo Horizonte, MG,
Brazil) and Kathleen A. Boyle (Medical College of Wisconsin, Milwaukee, WI) for
critically reading the manuscript."
author:
- first_name: Anna
full_name: Pereira, Anna
last_name: Pereira
- first_name: Flávia
full_name: Leite, Flávia
id: 36705F98-F248-11E8-B48F-1D18A9856A87
last_name: Leite
- first_name: Bruno
full_name: Brasil, Bruno
last_name: Brasil
- first_name: Jamaria
full_name: Soares Martins, Jamaria
last_name: Soares Martins
- first_name: Alice
full_name: Torres, Alice
last_name: Torres
- first_name: Paulo
full_name: Pimenta, Paulo
last_name: Pimenta
- first_name: Thais
full_name: Souto Padrón, Thais
last_name: Souto Padrón
- first_name: Paula
full_name: Tranktman, Paula
last_name: Tranktman
- first_name: Paulo
full_name: Ferreira, Paulo
last_name: Ferreira
- first_name: Erna
full_name: Kroon, Erna
last_name: Kroon
- first_name: Cláudio
full_name: Bonjardim, Cláudio
last_name: Bonjardim
citation:
ama: Pereira A, Leite F, Brasil B, et al. A vaccinia virus-driven interplay between
the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal of Virology.
2012;86(1):172-184. doi:10.1128/JVI.05638-11
apa: Pereira, A., Leite, F., Brasil, B., Soares Martins, J., Torres, A., Pimenta,
P., … Bonjardim, C. (2012). A vaccinia virus-driven interplay between the MKK4/7-JNK1/2
pathway and cytoskeleton reorganization. Journal of Virology. ASM. https://doi.org/10.1128/JVI.05638-11
chicago: Pereira, Anna, Flávia Leite, Bruno Brasil, Jamaria Soares Martins, Alice
Torres, Paulo Pimenta, Thais Souto Padrón, et al. “A Vaccinia Virus-Driven Interplay
between the MKK4/7-JNK1/2 Pathway and Cytoskeleton Reorganization.” Journal
of Virology. ASM, 2012. https://doi.org/10.1128/JVI.05638-11.
ieee: A. Pereira et al., “A vaccinia virus-driven interplay between the MKK4/7-JNK1/2
pathway and cytoskeleton reorganization,” Journal of Virology, vol. 86,
no. 1. ASM, pp. 172–184, 2012.
ista: Pereira A, Leite F, Brasil B, Soares Martins J, Torres A, Pimenta P, Souto
Padrón T, Tranktman P, Ferreira P, Kroon E, Bonjardim C. 2012. A vaccinia virus-driven
interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton reorganization. Journal
of Virology. 86(1), 172–184.
mla: Pereira, Anna, et al. “A Vaccinia Virus-Driven Interplay between the MKK4/7-JNK1/2
Pathway and Cytoskeleton Reorganization.” Journal of Virology, vol. 86,
no. 1, ASM, 2012, pp. 172–84, doi:10.1128/JVI.05638-11.
short: A. Pereira, F. Leite, B. Brasil, J. Soares Martins, A. Torres, P. Pimenta,
T. Souto Padrón, P. Tranktman, P. Ferreira, E. Kroon, C. Bonjardim, Journal of
Virology 86 (2012) 172–184.
date_created: 2018-12-11T12:02:29Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:25Z
day: '01'
department:
- _id: JoBo
doi: 10.1128/JVI.05638-11
external_id:
pmid:
- '22031940'
intvolume: ' 86'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3255887/
month: '01'
oa: 1
oa_version: Submitted Version
page: 172 - 184
pmid: 1
publication: Journal of Virology
publication_status: published
publisher: ASM
publist_id: '3356'
quality_controlled: '1'
scopus_import: 1
status: public
title: A vaccinia virus-driven interplay between the MKK4/7-JNK1/2 pathway and cytoskeleton
reorganization
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 86
year: '2012'
...
---
_id: '3310'
abstract:
- lang: eng
text: The theory of persistent homology opens up the possibility to reason about
topological features of a space or a function quantitatively and in combinatorial
terms. We refer to this new angle at a classical subject within algebraic topology
as a point calculus, which we present for the family of interlevel sets of a real-valued
function. Our account of the subject is expository, devoid of proofs, and written
for non-experts in algebraic topology.
acknowledgement: Research by the third author is partially supported by the National
Science Foundation (NSF) under grant DBI-0820624.
author:
- first_name: Paul
full_name: Bendich, Paul
id: 43F6EC54-F248-11E8-B48F-1D18A9856A87
last_name: Bendich
- first_name: Sergio
full_name: Cabello, Sergio
last_name: Cabello
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Bendich P, Cabello S, Edelsbrunner H. A point calculus for interlevel set homology.
Pattern Recognition Letters. 2012;33(11):1436-1444. doi:10.1016/j.patrec.2011.10.007
apa: Bendich, P., Cabello, S., & Edelsbrunner, H. (2012). A point calculus for
interlevel set homology. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2011.10.007
chicago: Bendich, Paul, Sergio Cabello, and Herbert Edelsbrunner. “A Point Calculus
for Interlevel Set Homology.” Pattern Recognition Letters. Elsevier, 2012.
https://doi.org/10.1016/j.patrec.2011.10.007.
ieee: P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel
set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier,
pp. 1436–1444, 2012.
ista: Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel
set homology. Pattern Recognition Letters. 33(11), 1436–1444.
mla: Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.” Pattern
Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:10.1016/j.patrec.2011.10.007.
short: P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012)
1436–1444.
date_created: 2018-12-11T12:02:36Z
date_published: 2012-08-01T00:00:00Z
date_updated: 2021-01-12T07:42:34Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1016/j.patrec.2011.10.007
file:
- access_level: open_access
checksum: d65f79775b51258a604ca5ec741297cc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:00Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5116'
file_name: IST-2016-542-v1+1_2012-J-01-Poinculus.pdf
file_size: 280280
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 33'
issue: '11'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 1436 - 1444
publication: Pattern Recognition Letters
publication_status: published
publisher: Elsevier
publist_id: '3330'
pubrep_id: '542'
quality_controlled: '1'
scopus_import: 1
status: public
title: A point calculus for interlevel set homology
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2012'
...
---
_id: '3314'
abstract:
- lang: eng
text: We introduce two-level discounted and mean-payoff games played by two players
on a perfect-information stochastic game graph. The upper level game is a discounted
or mean-payoff game and the lower level game is a (undiscounted) reachability
game. Two-level games model hierarchical and sequential decision making under
uncertainty across different time scales. For both discounted and mean-payoff
two-level games, we show the existence of pure memoryless optimal strategies for
both players and an ordered field property. We show that if there is only one
player (Markov decision processes), then the values can be computed in polynomial
time. It follows that whether the value of a player is equal to a given rational
constant in two-level discounted or mean-payoff games can be decided in NP ∩ coNP.
We also give an alternate strategy improvement algorithm to compute the value.
© 2012 World Scientific Publishing Company.
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: Chatterjee K, Majumdar R. Discounting and averaging in games across time scales.
International Journal of Foundations of Computer Science. 2012;23(3):609-625.
doi:10.1142/S0129054112400308
apa: Chatterjee, K., & Majumdar, R. (2012). Discounting and averaging in games
across time scales. International Journal of Foundations of Computer Science.
World Scientific Publishing. https://doi.org/10.1142/S0129054112400308
chicago: Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging
in Games across Time Scales.” International Journal of Foundations of Computer
Science. World Scientific Publishing, 2012. https://doi.org/10.1142/S0129054112400308.
ieee: K. Chatterjee and R. Majumdar, “Discounting and averaging in games across
time scales,” International Journal of Foundations of Computer Science,
vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.
ista: Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across
time scales. International Journal of Foundations of Computer Science. 23(3),
609–625.
mla: Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in
Games across Time Scales.” International Journal of Foundations of Computer
Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308.
short: K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer
Science 23 (2012) 609–625.
date_created: 2018-12-11T12:02:37Z
date_published: 2012-04-01T00:00:00Z
date_updated: 2021-01-12T07:42:35Z
day: '01'
department:
- _id: KrCh
doi: 10.1142/S0129054112400308
intvolume: ' 23'
issue: '3'
language:
- iso: eng
month: '04'
oa_version: None
page: 609 - 625
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: International Journal of Foundations of Computer Science
publication_status: published
publisher: World Scientific Publishing
publist_id: '3326'
quality_controlled: '1'
scopus_import: 1
status: public
title: Discounting and averaging in games across time scales
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2012'
...
---
_id: '3317'
abstract:
- lang: eng
text: The physical distance between presynaptic Ca2+ channels and the Ca2+ sensors
that trigger exocytosis of neurotransmitter-containing vesicles is a key determinant
of the signalling properties of synapses in the nervous system. Recent functional
analysis indicates that in some fast central synapses, transmitter release is
triggered by a small number of Ca2+ channels that are coupled to Ca2+ sensors
at the nanometre scale. Molecular analysis suggests that this tight coupling is
generated by protein–protein interactions involving Ca2+ channels, Ca2+ sensors
and various other synaptic proteins. Nanodomain coupling has several functional
advantages, as it increases the efficacy, speed and energy efficiency of synaptic
transmission.
acknowledgement: "Work of the authors was funded by grants of the Deutsche Forschungsgemeinschaft
to P.J. (grants SFB 780/A5, TR 3/B10 and the Leibniz programme), a European Research
Council Advanced grant to P.J. and a Swiss National Foundation fellowship to E.E.\r\nWe
thank D. Tsien and E. Neher for their comments on this Review, J. Guzmán and A.
Pernía-Andrade for reading earlier versions and E. Kramberger for perfect editorial
support. We apologize that owing to space constraints, not all relevant papers could
be cited.\r\n"
author:
- first_name: Emmanuel
full_name: Eggermann, Emmanuel
id: 34DACA34-E9AE-11E9-849C-D35BD8ADC20C
last_name: Eggermann
- first_name: Iancu
full_name: Bucurenciu, Iancu
id: 4BD1D872-E9AE-11E9-9EE9-8BF4597A9E2A
last_name: Bucurenciu
- first_name: Sarit
full_name: Goswami, Sarit
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- 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: Eggermann E, Bucurenciu I, Goswami S, Jonas PM. Nanodomain coupling between
Ca(2+) channels and sensors of exocytosis at fast mammalian synapses. Nature
Reviews Neuroscience. 2012;13(1):7-21. doi:10.1038/nrn3125
apa: Eggermann, E., Bucurenciu, I., Goswami, S., & Jonas, P. M. (2012). Nanodomain
coupling between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses.
Nature Reviews Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nrn3125
chicago: Eggermann, Emmanuel, Iancu Bucurenciu, Sarit Goswami, and Peter M Jonas.
“Nanodomain Coupling between Ca(2+) Channels and Sensors of Exocytosis at Fast
Mammalian Synapses.” Nature Reviews Neuroscience. Nature Publishing Group,
2012. https://doi.org/10.1038/nrn3125.
ieee: E. Eggermann, I. Bucurenciu, S. Goswami, and P. M. Jonas, “Nanodomain coupling
between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses,”
Nature Reviews Neuroscience, vol. 13, no. 1. Nature Publishing Group, pp.
7–21, 2012.
ista: Eggermann E, Bucurenciu I, Goswami S, Jonas PM. 2012. Nanodomain coupling
between Ca(2+) channels and sensors of exocytosis at fast mammalian synapses.
Nature Reviews Neuroscience. 13(1), 7–21.
mla: Eggermann, Emmanuel, et al. “Nanodomain Coupling between Ca(2+) Channels and
Sensors of Exocytosis at Fast Mammalian Synapses.” Nature Reviews Neuroscience,
vol. 13, no. 1, Nature Publishing Group, 2012, pp. 7–21, doi:10.1038/nrn3125.
short: E. Eggermann, I. Bucurenciu, S. Goswami, P.M. Jonas, Nature Reviews Neuroscience
13 (2012) 7–21.
date_created: 2018-12-11T12:02:38Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:36Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1038/nrn3125
file:
- access_level: open_access
checksum: 4c1c86b2f6e4e1562f5bb800b457ea9f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:13Z
date_updated: 2020-07-14T12:46:07Z
file_id: '4931'
file_name: IST-2017-820-v1+1_17463_3_art_file_109404_ltmxbw.pdf
file_size: 314246
relation: main_file
- access_level: open_access
checksum: bceb2efdd49d115f4dde8486bc1be3f2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:14Z
date_updated: 2020-07-14T12:46:07Z
file_id: '4932'
file_name: IST-2017-820-v1+2_17463_3_figure_109402_ltmwlp.pdf
file_size: 1840216
relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: ' 13'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 7 - 21
project:
- _id: 25BC64A8-B435-11E9-9278-68D0E5697425
grant_number: JO_780/A5
name: Synaptic Mechanisms of Neuronal Network Function
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Nature Reviews Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '3322'
pubrep_id: '820'
quality_controlled: '1'
scopus_import: 1
status: public
title: Nanodomain coupling between Ca(2+) channels and sensors of exocytosis at fast
mammalian synapses
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2012'
...