---
_id: '533'
abstract:
- lang: eng
text: Any programming error that can be revealed before compiling a program saves
precious time for the programmer. While integrated development environments already
do a good job by detecting, e.g., data-flow abnormalities, current static analysis
tools suffer from false positives ("noise") or require strong user interaction.
We propose to avoid this deficiency by defining a new class of errors. A program
fragment is doomed if its execution will inevitably fail, regardless of which
state it is started in. We use a formal verification method to identify such errors
fully automatically and, most significantly, without producing noise. We report
on experiments with a prototype tool.
article_processing_charge: No
author:
- first_name: Jochen
full_name: Hoenicke, Jochen
last_name: Hoenicke
- first_name: Kari
full_name: Leino, Kari
last_name: Leino
- first_name: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Martin
full_name: Schäf, Martin
last_name: Schäf
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
citation:
ama: Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. Doomed program points. Formal
Methods in System Design. 2010;37(2-3):171-199. doi:10.1007/s10703-010-0102-0
apa: Hoenicke, J., Leino, K., Podelski, A., Schäf, M., & Wies, T. (2010). Doomed
program points. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-010-0102-0
chicago: Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas
Wies. “Doomed Program Points.” Formal Methods in System Design. Springer,
2010. https://doi.org/10.1007/s10703-010-0102-0.
ieee: J. Hoenicke, K. Leino, A. Podelski, M. Schäf, and T. Wies, “Doomed program
points,” Formal Methods in System Design, vol. 37, no. 2–3. Springer, pp.
171–199, 2010.
ista: Hoenicke J, Leino K, Podelski A, Schäf M, Wies T. 2010. Doomed program points.
Formal Methods in System Design. 37(2–3), 171–199.
mla: Hoenicke, Jochen, et al. “Doomed Program Points.” Formal Methods in System
Design, vol. 37, no. 2–3, Springer, 2010, pp. 171–99, doi:10.1007/s10703-010-0102-0.
short: J. Hoenicke, K. Leino, A. Podelski, M. Schäf, T. Wies, Formal Methods in
System Design 37 (2010) 171–199.
corr_author: '1'
date_created: 2018-12-11T11:47:01Z
date_published: 2010-12-01T00:00:00Z
date_updated: 2025-09-30T09:48:58Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/s10703-010-0102-0
external_id:
isi:
- '000286631700004'
intvolume: ' 37'
isi: 1
issue: 2-3
language:
- iso: eng
month: '12'
oa_version: None
page: 171 - 199
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '7284'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Doomed program points
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 37
year: '2010'
...
---
_id: '5388'
abstract:
- lang: eng
text: "We present an algorithmic method for the synthesis of concurrent programs
that are optimal with respect to quantitative performance measures. The input
consists of a sequential sketch, that is, a program that does not contain synchronization
constructs, and of a parametric performance model that assigns costs to actions
such as locking, context switching, and idling. The quantitative synthesis problem
is to automatically introduce synchronization constructs into the sequential sketch
so that both correctness is guaranteed and worst-case (or average-case) performance
is optimized. Correctness is formalized as race freedom or linearizability.\r\n\r\nWe
show that for worst-case performance, the problem can be modeled\r\nas a 2-player
graph game with quantitative (limit-average) objectives, and\r\nfor average-case
performance, as a 2 1/2 -player graph game (with probabilistic transitions). In
both cases, the optimal correct program is derived from an optimal strategy in
the corresponding quantitative game. We prove that the respective game problems
are computationally expensive (NP-complete), and present several techniques that
overcome the theoretical difficulty in cases of concurrent programs of practical
interest.\r\n\r\nWe have implemented a prototype tool and used it for the automatic
syn- thesis of programs that access a concurrent list. For certain parameter val-
ues, our method automatically synthesizes various classical synchronization schemes
for implementing a concurrent list, such as fine-grained locking or a lazy algorithm.
For other parameter values, a new, hybrid synchronization style is synthesized,
which uses both the lazy approach and coarse-grained locks (instead of standard
fine-grained locks). The trade-off occurs because while fine-grained locking tends
to decrease the cost that is due to waiting for locks, it increases cache size
requirements."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. Quantitative
Synthesis for Concurrent Programs. IST Austria; 2010. doi:10.15479/AT:IST-2010-0004
apa: Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh,
R. (2010). Quantitative synthesis for concurrent programs. IST Austria.
https://doi.org/10.15479/AT:IST-2010-0004
chicago: Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna,
and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria,
2010. https://doi.org/10.15479/AT:IST-2010-0004.
ieee: K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative
synthesis for concurrent programs. IST Austria, 2010.
ista: Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative
synthesis for concurrent programs, IST Austria, 17p.
mla: Chatterjee, Krishnendu, et al. Quantitative Synthesis for Concurrent Programs.
IST Austria, 2010, doi:10.15479/AT:IST-2010-0004.
short: K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative
Synthesis for Concurrent Programs, IST Austria, 2010.
date_created: 2018-12-12T11:39:03Z
date_published: 2010-10-07T00:00:00Z
date_updated: 2025-04-15T08:12:00Z
day: '07'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2010-0004
file:
- access_level: open_access
checksum: da38782d2388a6fa32109d10bb9bad67
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:53Z
date_updated: 2020-07-14T12:46:42Z
file_id: '5515'
file_name: IST-2010-0004_IST-2010-0004.pdf
file_size: 429101
relation: main_file
file_date_updated: 2020-07-14T12:46:42Z
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: '17'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '24'
related_material:
record:
- id: '3366'
relation: later_version
status: public
status: public
title: Quantitative synthesis for concurrent programs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '5389'
abstract:
- lang: eng
text: Boolean notions of correctness are formalized by preorders on systems. Quantitative
measures of correctness can be formalized by real-valued distance functions between
systems, where the distance between implementation and specification provides
a measure of “fit” or “desirability.” We extend the simulation preorder to the
quantitative setting, by making each player of a simulation game pay a certain
price for her choices. We use the resulting games with quantitative objectives
to define three different simulation distances. The correctness distance measures
how much the specification must be changed in order to be satisfied by the implementation.
The coverage distance measures how much the im- plementation restricts the degrees
of freedom offered by the specification. The robustness distance measures how
much a system can deviate from the implementation description without violating
the specification. We consider these distances for safety as well as liveness
specifications. The distances can be computed in polynomial time for safety specifications,
and for liveness specifications given by weak fairness constraints. We show that
the distance functions satisfy the triangle inequality, that the distance between
two systems does not increase under parallel composition with a third system,
and that the distance between two systems can be bounded from above and below
by distances between abstractions of the two systems. These properties suggest
that our simulation distances provide an appropriate basis for a quantitative
theory of discrete systems. We also demonstrate how the robustness distance can
be used to measure how many transmission errors are tolerated by error correcting
codes.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: Cerny P, Henzinger TA, Radhakrishna A. Simulation Distances. IST Austria;
2010. doi:10.15479/AT:IST-2010-0003
apa: Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances.
IST Austria. https://doi.org/10.15479/AT:IST-2010-0003
chicago: Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation
Distances. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0003.
ieee: P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances.
IST Austria, 2010.
ista: Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria,
24p.
mla: Cerny, Pavol, et al. Simulation Distances. IST Austria, 2010, doi:10.15479/AT:IST-2010-0003.
short: P. Cerny, T.A. Henzinger, A. Radhakrishna, Simulation Distances, IST Austria,
2010.
date_created: 2018-12-12T11:39:03Z
date_published: 2010-06-04T00:00:00Z
date_updated: 2025-09-30T07:46:05Z
day: '04'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2010-0003
file:
- access_level: open_access
checksum: 284ded99764e32a583a8ea83fcea254b
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:25Z
date_updated: 2020-07-14T12:46:42Z
file_id: '5547'
file_name: IST-2010-0003_IST-2010-0003.pdf
file_size: 367246
relation: main_file
file_date_updated: 2020-07-14T12:46:42Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '24'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '25'
related_material:
record:
- id: '4393'
relation: later_version
status: public
- id: '3249'
relation: later_version
status: public
status: public
title: Simulation distances
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '5390'
abstract:
- lang: eng
text: The class of ω regular languages provide a robust specification language in
verification. Every ω-regular condition can be decomposed into a safety part and
a liveness part. The liveness part ensures that something good happens “eventually.”
Two main strengths of the classical, infinite-limit formulation of liveness are
robustness (independence from the granularity of transitions) and simplicity (abstraction
of complicated time bounds). However, the classical liveness formulation suffers
from the drawback that the time until something good happens may be unbounded.
A stronger formulation of liveness, so-called finitary liveness, overcomes this
drawback, while still retaining robustness and simplicity. Finitary liveness requires
that there exists an unknown, fixed bound b such that something good happens within
b transitions. In this work we consider the finitary parity and Streett (fairness)
conditions. We present the topological, automata-theoretic and logical characterization
of finitary languages defined by finitary parity and Streett conditions. We (a)
show that the finitary parity and Streett languages are Σ2-complete; (b) present
a complete characterization of the expressive power of various classes of automata
with finitary and infinitary conditions (in particular we show that non-deterministic
finitary parity and Streett automata cannot be determinized to deterministic finitary
parity or Streett automata); and (c) show that the languages defined by non-deterministic
finitary parity automata exactly characterize the star-free fragment of ωB-regular
languages.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Nathanaël
full_name: Fijalkow, Nathanaël
last_name: Fijalkow
citation:
ama: Chatterjee K, Fijalkow N. Topological, Automata-Theoretic and Logical Characterization
of Finitary Languages. IST Austria; 2010. doi:10.15479/AT:IST-2010-0002
apa: Chatterjee, K., & Fijalkow, N. (2010). Topological, automata-theoretic
and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic
and Logical Characterization of Finitary Languages. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0002.
ieee: K. Chatterjee and N. Fijalkow, Topological, automata-theoretic and logical
characterization of finitary languages. IST Austria, 2010.
ista: Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical
characterization of finitary languages, IST Austria, 21p.
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic
and Logical Characterization of Finitary Languages. IST Austria, 2010, doi:10.15479/AT:IST-2010-0002.
short: K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization
of Finitary Languages, IST Austria, 2010.
date_created: 2018-12-12T11:39:03Z
date_published: 2010-06-04T00:00:00Z
date_updated: 2020-07-14T23:04:41Z
day: '04'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2010-0002
file:
- access_level: open_access
checksum: 283d3604d76dd4d5161585d4c8625fbe
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:10Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5532'
file_name: IST-2010-0002_IST-2010-0002.pdf
file_size: 395662
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '21'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '26'
status: public
title: Topological, automata-theoretic and logical characterization of finitary languages
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '5391'
abstract:
- lang: eng
text: Concurrent data structures with fine-grained synchronization are notoriously
difficult to implement correctly. The difficulty of reasoning about these implementations
does not stem from the number of variables or the program size, but rather from
the large number of possible interleavings. These implementations are therefore
prime candidates for model checking. We introduce an algorithm for verifying linearizability
of singly-linked heap-based concurrent data structures. We consider a model consisting
of an unbounded heap where each node consists an element from an unbounded data
domain, with a restricted set of operations for testing and updating pointers
and data elements. Our main result is that linearizability is decidable for programs
that invoke a fixed number of methods, possibly in parallel. This decidable fragment
covers many of the common implementation techniques — fine-grained locking, lazy
synchronization, and lock-free synchronization. We also show how the technique
can be used to verify optimistic implementations with the help of programmer annotations.
We developed a verification tool CoLT and evaluated it on a representative sample
of Java implementations of the concurrent set data structure. The tool verified
linearizability of a number of implementations, found a known error in a lock-free
imple- mentation and proved that the corrected version is linearizable.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
- first_name: Swarat
full_name: Chaudhuri, Swarat
last_name: Chaudhuri
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
citation:
ama: Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. Model Checking
of Linearizability of Concurrent List Implementations. IST Austria; 2010.
doi:10.15479/AT:IST-2010-0001
apa: Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010).
Model checking of linearizability of concurrent list implementations. IST
Austria. https://doi.org/10.15479/AT:IST-2010-0001
chicago: Cerny, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and
Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations.
IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0001.
ieee: P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model
checking of linearizability of concurrent list implementations. IST Austria,
2010.
ista: Cerny P, Radhakrishna A, Zufferey D, Chaudhuri S, Alur R. 2010. Model checking
of linearizability of concurrent list implementations, IST Austria, 27p.
mla: Cerny, Pavol, et al. Model Checking of Linearizability of Concurrent List
Implementations. IST Austria, 2010, doi:10.15479/AT:IST-2010-0001.
short: P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, R. Alur, Model Checking
of Linearizability of Concurrent List Implementations, IST Austria, 2010.
date_created: 2018-12-12T11:39:04Z
date_published: 2010-04-19T00:00:00Z
date_updated: 2024-10-21T06:03:05Z
day: '19'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2010-0001
file:
- access_level: open_access
checksum: 986645caad7dd85a6a091488f6c646dc
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:44Z
date_updated: 2020-07-14T12:46:43Z
file_id: '5505'
file_name: IST-2010-0001_IST-2010-0001.pdf
file_size: 372286
relation: main_file
file_date_updated: 2020-07-14T12:46:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '27'
related_material:
record:
- id: '4390'
relation: later_version
status: public
status: public
title: Model checking of linearizability of concurrent list implementations
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '5940'
article_processing_charge: No
author:
- first_name: Gabriel
full_name: Juhás, Gabriel
last_name: Juhás
- first_name: Igor
full_name: Kazlov, Igor
id: 4A997E50-F248-11E8-B48F-1D18A9856A87
last_name: Kazlov
- first_name: Ana
full_name: Juhásová, Ana
last_name: Juhásová
citation:
ama: 'Juhás G, Kazlov I, Juhásová A. Instance Deadlock: A Mystery behind Frozen
Programs. In: Applications and Theory of Petri Nets. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2010:1-17. doi:10.1007/978-3-642-13675-7_1'
apa: 'Juhás, G., Kazlov, I., & Juhásová, A. (2010). Instance Deadlock: A Mystery
behind Frozen Programs. In Applications and Theory of Petri Nets (pp. 1–17).
Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13675-7_1'
chicago: 'Juhás, Gabriel, Igor Kazlov, and Ana Juhásová. “Instance Deadlock: A Mystery
behind Frozen Programs.” In Applications and Theory of Petri Nets, 1–17.
Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13675-7_1.'
ieee: 'G. Juhás, I. Kazlov, and A. Juhásová, “Instance Deadlock: A Mystery behind
Frozen Programs,” in Applications and Theory of Petri Nets, Berlin, Heidelberg:
Springer Berlin Heidelberg, 2010, pp. 1–17.'
ista: 'Juhás G, Kazlov I, Juhásová A. 2010.Instance Deadlock: A Mystery behind Frozen
Programs. In: Applications and Theory of Petri Nets. , 1–17.'
mla: 'Juhás, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.”
Applications and Theory of Petri Nets, Springer Berlin Heidelberg, 2010,
pp. 1–17, doi:10.1007/978-3-642-13675-7_1.'
short: G. Juhás, I. Kazlov, A. Juhásová, in:, Applications and Theory of Petri Nets,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 1–17.
date_created: 2019-02-08T09:33:41Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2022-04-01T13:45:24Z
doi: 10.1007/978-3-642-13675-7_1
extern: '1'
language:
- iso: eng
oa_version: None
page: 1-17
place: Berlin, Heidelberg
publication: Applications and Theory of Petri Nets
publication_identifier:
isbn:
- '9783642136740'
- '9783642136757'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: 'Instance Deadlock: A Mystery behind Frozen Programs'
type: book_chapter
user_id: 4A997E50-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '598'
abstract:
- lang: eng
text: It is not well understood how the human Mediator complex, transcription factor
IIH and RNA polymerase II (Pol II) work together with activators to initiate transcription.
Activator binding alters Mediator structure, yet the functional consequences of
such structural shifts remain unknown. The p53 C terminus and its activation domain
interact with different Mediator subunits, and we find that each interaction differentially
affects Mediator structure; strikingly, distinct p53-Mediator structures differentially
affect Pol II activity. Only the p53 activation domain induces the formation of
a large pocket domain at the Mediator-Pol II interaction site, and this correlates
with activation of stalled Pol II to a productively elongating state. Moreover,
we define a Mediator requirement for TFIIH-dependent Pol II C-terminal domain
phosphorylation and identify substantial differences in Pol II C-terminal domain
processing that correspond to distinct p53-Mediator structural states. Our results
define a fundamental mechanism by which p53 activates transcription and suggest
that Mediator structural shifts trigger activation of stalled Pol II complexes.
article_processing_charge: No
author:
- first_name: Krista
full_name: Meyer, Krista
last_name: Meyer
- first_name: Shih
full_name: Lin, Shih
last_name: Lin
- first_name: Carrie A
full_name: Bernecky, Carrie A
id: 2CB9DFE2-F248-11E8-B48F-1D18A9856A87
last_name: Bernecky
orcid: 0000-0003-0893-7036
- first_name: Yuefeng
full_name: Gao, Yuefeng
last_name: Gao
- first_name: Dylan
full_name: Taatjes, Dylan
last_name: Taatjes
citation:
ama: Meyer K, Lin S, Bernecky C, Gao Y, Taatjes D. P53 activates transcription by
directing structural shifts in Mediator. Nature Structural and Molecular Biology.
2010;17(6):753-760. doi:10.1038/nsmb.1816
apa: Meyer, K., Lin, S., Bernecky, C., Gao, Y., & Taatjes, D. (2010). P53 activates
transcription by directing structural shifts in Mediator. Nature Structural
and Molecular Biology. Nature Publishing Group. https://doi.org/10.1038/nsmb.1816
chicago: Meyer, Krista, Shih Lin, Carrie Bernecky, Yuefeng Gao, and Dylan Taatjes.
“P53 Activates Transcription by Directing Structural Shifts in Mediator.” Nature
Structural and Molecular Biology. Nature Publishing Group, 2010. https://doi.org/10.1038/nsmb.1816.
ieee: K. Meyer, S. Lin, C. Bernecky, Y. Gao, and D. Taatjes, “P53 activates transcription
by directing structural shifts in Mediator,” Nature Structural and Molecular
Biology, vol. 17, no. 6. Nature Publishing Group, pp. 753–760, 2010.
ista: Meyer K, Lin S, Bernecky C, Gao Y, Taatjes D. 2010. P53 activates transcription
by directing structural shifts in Mediator. Nature Structural and Molecular Biology.
17(6), 753–760.
mla: Meyer, Krista, et al. “P53 Activates Transcription by Directing Structural
Shifts in Mediator.” Nature Structural and Molecular Biology, vol. 17,
no. 6, Nature Publishing Group, 2010, pp. 753–60, doi:10.1038/nsmb.1816.
short: K. Meyer, S. Lin, C. Bernecky, Y. Gao, D. Taatjes, Nature Structural and
Molecular Biology 17 (2010) 753–760.
date_created: 2018-12-11T11:47:24Z
date_published: 2010-06-01T00:00:00Z
date_updated: 2021-01-12T08:05:28Z
day: '01'
doi: 10.1038/nsmb.1816
extern: '1'
intvolume: ' 17'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2932482/
month: '06'
oa: 1
oa_version: None
page: 753 - 760
publication: Nature Structural and Molecular Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '7210'
status: public
title: P53 activates transcription by directing structural shifts in Mediator
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2010'
...
---
_id: '6142'
abstract:
- lang: eng
text: Defining the mutational landscape when individuals of a species grow separately
and diverge over many generations can provide insights into trait evolution. A
specific example of this involves studying changes associated with domestication
where different lines of the same wild stock have been cultivated independently
in different standard environments. Whole genome sequence comparison of such lines
permits estimation of mutation rates, inference of genes' ancestral states and
ancestry of existing strains, and correction of sequencing errors in genome databases.
Here we study domestication of the C. elegans Bristol strain as a model, and report
the genome sequence of LSJ1 (Bristol), a sibling of the standard C. elegans reference
wild type N2 (Bristol). The LSJ1 and N2 lines were cultivated separately from
shortly after the Bristol strain was isolated until methods to freeze C. elegans
were developed. We find that during this time the two strains have accumulated
1208 genetic differences. We describe phenotypic variation between N2 and LSJ1
in the rate at which embryos develop, the rate of production of eggs, the maturity
of eggs at laying, and feeding behavior, all the result of post-isolation changes.
We infer the ancestral alleles in the original Bristol isolate and highlight 2038
likely sequencing errors in the original N2 reference genome sequence. Many of
these changes modify genome annotation. Our study provides a starting point to
further investigate genotype-phenotype association and offers insights into the
process of selection as a result of laboratory domestication.
article_number: e13922
author:
- first_name: Katherine P.
full_name: Weber, Katherine P.
last_name: Weber
- first_name: Subhajyoti
full_name: De, Subhajyoti
last_name: De
- first_name: Iwanka
full_name: Kozarewa, Iwanka
last_name: Kozarewa
- first_name: Daniel J.
full_name: Turner, Daniel J.
last_name: Turner
- first_name: M. Madan
full_name: Babu, M. Madan
last_name: Babu
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Weber KP, De S, Kozarewa I, Turner DJ, Babu MM, de Bono M. Whole genome sequencing
highlights genetic changes associated with laboratory domestication of C. elegans.
PLoS ONE. 2010;5(11). doi:10.1371/journal.pone.0013922
apa: Weber, K. P., De, S., Kozarewa, I., Turner, D. J., Babu, M. M., & de Bono,
M. (2010). Whole genome sequencing highlights genetic changes associated with
laboratory domestication of C. elegans. PLoS ONE. Public Library of Science.
https://doi.org/10.1371/journal.pone.0013922
chicago: Weber, Katherine P., Subhajyoti De, Iwanka Kozarewa, Daniel J. Turner,
M. Madan Babu, and Mario de Bono. “Whole Genome Sequencing Highlights Genetic
Changes Associated with Laboratory Domestication of C. Elegans.” PLoS ONE.
Public Library of Science, 2010. https://doi.org/10.1371/journal.pone.0013922.
ieee: K. P. Weber, S. De, I. Kozarewa, D. J. Turner, M. M. Babu, and M. de Bono,
“Whole genome sequencing highlights genetic changes associated with laboratory
domestication of C. elegans,” PLoS ONE, vol. 5, no. 11. Public Library
of Science, 2010.
ista: Weber KP, De S, Kozarewa I, Turner DJ, Babu MM, de Bono M. 2010. Whole genome
sequencing highlights genetic changes associated with laboratory domestication
of C. elegans. PLoS ONE. 5(11), e13922.
mla: Weber, Katherine P., et al. “Whole Genome Sequencing Highlights Genetic Changes
Associated with Laboratory Domestication of C. Elegans.” PLoS ONE, vol.
5, no. 11, e13922, Public Library of Science, 2010, doi:10.1371/journal.pone.0013922.
short: K.P. Weber, S. De, I. Kozarewa, D.J. Turner, M.M. Babu, M. de Bono, PLoS
ONE 5 (2010).
date_created: 2019-03-20T15:20:30Z
date_published: 2010-11-11T00:00:00Z
date_updated: 2021-01-12T08:06:20Z
day: '11'
ddc:
- '570'
doi: 10.1371/journal.pone.0013922
extern: '1'
external_id:
pmid:
- '21085631'
file:
- access_level: open_access
checksum: a01e6bbe15f044c0c79a26d7d881953e
content_type: application/pdf
creator: kschuh
date_created: 2019-03-20T15:22:48Z
date_updated: 2020-07-14T12:47:20Z
file_id: '6143'
file_name: 2010_PLOS_Weber.PDF
file_size: 578059
relation: main_file
file_date_updated: 2020-07-14T12:47:20Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
pmid: 1
publication: PLoS ONE
publication_identifier:
issn:
- 1932-6203
publication_status: published
publisher: Public Library of Science
quality_controlled: '1'
status: public
title: Whole genome sequencing highlights genetic changes associated with laboratory
domestication of C. elegans
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2010'
...
---
_id: '619'
abstract:
- lang: eng
text: Sinclair Ross’s novel As for Me and My House has long since been canonized
as Canadian prairie fiction. Accordingly, it has been the subject of many critical
studies and academic papers. Most commentators have concentrated on such literary
issues as the representation of the western landscape or the reliability of the
female narrator. But so far little consideration has been given to the social
and cultural implications of the novel. Few attempts have been made to analyze
the text from a cultural perspective including such social markers as class, gender
and ethnicity. That is all the more surprising because Sinclair Ross has often
been credited for being a realistic author and As for Me and My House has often
been interpreted as a regional novel characteristic of a particular time and place.
author:
- first_name: Waldemar
full_name: Zacharasiewicz, Waldemar
last_name: Zacharasiewicz
- first_name: Fritz
full_name: Kirsch, Fritz Peter
last_name: Kirsch
citation:
ama: 'Zacharasiewicz W, Kirsch F. “This is a fundamentalist town”: The Prairie Town
as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and My
House. In: Social and Cultural Interaction and Literary Landscapes in the Canadian
West : Impressions of an Exploratory Field Trip and Academic Interaction in the
Canadian West : Rapports Interculturels et Paysages Littéraires Dans l’Ouest Canadien.
Facultas.WUV; 2010:173-179.'
apa: 'Zacharasiewicz, W., & Kirsch, F. (2010). “This is a fundamentalist town”:
The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s
As for Me and My House. In Social and cultural interaction and literary landscapes
in the Canadian West : impressions of an exploratory field trip and academic interaction
in the Canadian West : Rapports interculturels et paysages littéraires dans l’Ouest
canadien (pp. 173–179). Facultas.WUV.'
chicago: 'Zacharasiewicz, Waldemar, and Fritz Kirsch. “‘This Is a Fundamentalist
Town’: The Prairie Town as a Site of Social and Cultural Conflict in Sinclair
Ross’s As for Me and My House.” In Social and Cultural Interaction and Literary
Landscapes in the Canadian West : Impressions of an Exploratory Field Trip and
Academic Interaction in the Canadian West : Rapports Interculturels et Paysages
Littéraires Dans l’Ouest Canadien, 173–79. Facultas.WUV, 2010.'
ieee: 'W. Zacharasiewicz and F. Kirsch, “‘This is a fundamentalist town’: The Prairie
Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and
My House,” in Social and cultural interaction and literary landscapes in the
Canadian West : impressions of an exploratory field trip and academic interaction
in the Canadian West : Rapports interculturels et paysages littéraires dans l’Ouest
canadien, Facultas.WUV, 2010, pp. 173–179.'
ista: 'Zacharasiewicz W, Kirsch F. 2010.“This is a fundamentalist town”: The Prairie
Town as a Site of Social and Cultural Conflict in Sinclair Ross’s As for Me and
My House. In: Social and cultural interaction and literary landscapes in the Canadian
West : impressions of an exploratory field trip and academic interaction in the
Canadian West : Rapports interculturels et paysages littéraires dans l’Ouest canadien.
, 173–179.'
mla: 'Zacharasiewicz, Waldemar, and Fritz Kirsch. “‘This Is a Fundamentalist Town’:
The Prairie Town as a Site of Social and Cultural Conflict in Sinclair Ross’s
As for Me and My House.” Social and Cultural Interaction and Literary Landscapes
in the Canadian West : Impressions of an Exploratory Field Trip and Academic Interaction
in the Canadian West : Rapports Interculturels et Paysages Littéraires Dans l’Ouest
Canadien, Facultas.WUV, 2010, pp. 173–79.'
short: 'W. Zacharasiewicz, F. Kirsch, in:, Social and Cultural Interaction and Literary
Landscapes in the Canadian West : Impressions of an Exploratory Field Trip and
Academic Interaction in the Canadian West : Rapports Interculturels et Paysages
Littéraires Dans l’Ouest Canadien, Facultas.WUV, 2010, pp. 173–179.'
date_created: 2018-12-11T11:47:32Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T08:06:40Z
day: '01'
extern: 1
month: '01'
page: 173 - 179
publication: 'Social and cultural interaction and literary landscapes in the Canadian
West : impressions of an exploratory field trip and academic interaction in the
Canadian West : Rapports interculturels et paysages littéraires dans l''Ouest canadien'
publication_status: published
publisher: Facultas.WUV
publist_id: '7185'
quality_controlled: 0
status: public
title: '“This is a fundamentalist town”: The Prairie Town as a Site of Social and
Cultural Conflict in Sinclair Ross’s As for Me and My House'
type: book_chapter
year: '2010'
...
---
_id: '6198'
abstract:
- lang: eng
text: 'Stroke is a major public health problem leading to high rates of death and
disability in adults. Excessive stimulation of N-methyl-D-aspartate receptors
(NMDARs) and the resulting neuronal nitric oxide synthase (nNOS) activation are
crucial for neuronal injury after stroke insult. However, directly inhibiting
NMDARs or nNOS can cause severe side effects because they have key physiological
functions in the CNS. Here we show that cerebral ischemia induces the interaction
of nNOS with postsynaptic density protein-95 (PSD-95). Disrupting nNOS-PSD-95
interaction via overexpressing the N-terminal amino acid residues 1-133 of nNOS
(nNOS-N(1-133)) prevented glutamate-induced excitotoxicity and cerebral ischemic
damage. Given the mechanism of nNOS-PSD-95 interaction, we developed a series
of compounds and discovered a small-molecular inhibitor of the nNOS-PSD-95 interaction,
ZL006. This drug blocked the ischemia-induced nNOS-PSD-95 association selectively,
had potent neuroprotective activity in vitro and ameliorated focal cerebral ischemic
damage in mice and rats subjected to middle cerebral artery occlusion (MCAO) and
reperfusion. Moreover, it readily crossed the blood-brain barrier, did not inhibit
NMDAR function, catalytic activity of nNOS or spatial memory, and had no effect
on aggressive behaviors. Thus, this new drug may serve as a treatment for stroke,
perhaps without major side effects. '
author:
- first_name: L
full_name: Zhou, L
last_name: Zhou
- first_name: F
full_name: Li, F
last_name: Li
- first_name: Haibing
full_name: Xu, Haibing
id: 310349D0-F248-11E8-B48F-1D18A9856A87
last_name: Xu
- first_name: CX
full_name: Luo, CX
last_name: Luo
- first_name: HY
full_name: Wu, HY
last_name: Wu
- first_name: MM
full_name: Zhu, MM
last_name: Zhu
- first_name: W
full_name: Lu, W
last_name: Lu
- first_name: X
full_name: Ji, X
last_name: Ji
- first_name: QG
full_name: Zhou, QG
last_name: Zhou
- first_name: DY
full_name: Zhu, DY
last_name: Zhu
citation:
ama: Zhou L, Li F, Xu H, et al. Treatment of cerebral ischemia by disrupting ischemia-induced
interaction of nNOS with PSD-95. Nature Medicine. 2010;16(12):1439-1443.
doi:10.1038/nm.2245
apa: Zhou, L., Li, F., Xu, H., Luo, C., Wu, H., Zhu, M., … Zhu, D. (2010). Treatment
of cerebral ischemia by disrupting ischemia-induced interaction of nNOS with PSD-95.
Nature Medicine. Nature Publishing Group. https://doi.org/10.1038/nm.2245
chicago: Zhou, L, F Li, Haibing Xu, CX Luo, HY Wu, MM Zhu, W Lu, X Ji, QG Zhou,
and DY Zhu. “Treatment of Cerebral Ischemia by Disrupting Ischemia-Induced Interaction
of NNOS with PSD-95.” Nature Medicine. Nature Publishing Group, 2010. https://doi.org/10.1038/nm.2245.
ieee: L. Zhou et al., “Treatment of cerebral ischemia by disrupting ischemia-induced
interaction of nNOS with PSD-95,” Nature Medicine, vol. 16, no. 12. Nature
Publishing Group, pp. 1439–1443, 2010.
ista: Zhou L, Li F, Xu H, Luo C, Wu H, Zhu M, Lu W, Ji X, Zhou Q, Zhu D. 2010. Treatment
of cerebral ischemia by disrupting ischemia-induced interaction of nNOS with PSD-95.
Nature Medicine. 16(12), 1439–1443.
mla: Zhou, L., et al. “Treatment of Cerebral Ischemia by Disrupting Ischemia-Induced
Interaction of NNOS with PSD-95.” Nature Medicine, vol. 16, no. 12, Nature
Publishing Group, 2010, pp. 1439–43, doi:10.1038/nm.2245.
short: L. Zhou, F. Li, H. Xu, C. Luo, H. Wu, M. Zhu, W. Lu, X. Ji, Q. Zhou, D. Zhu,
Nature Medicine 16 (2010) 1439–1443.
date_created: 2019-04-04T14:55:32Z
date_published: 2010-11-21T00:00:00Z
date_updated: 2021-01-12T08:06:43Z
day: '21'
doi: 10.1038/nm.2245
extern: '1'
external_id:
pmid:
- '21102461'
intvolume: ' 16'
issue: '12'
language:
- iso: eng
month: '11'
oa_version: None
page: 1439-1443
pmid: 1
publication: Nature Medicine
publication_identifier:
issn:
- 1078-8956
- 1546-170x
publication_status: published
publisher: Nature Publishing Group
quality_controlled: '1'
status: public
title: Treatment of cerebral ischemia by disrupting ischemia-induced interaction of
nNOS with PSD-95
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2010'
...
---
_id: '7078'
abstract:
- lang: eng
text: We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction,
magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy
measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate
that our Bridgman-grown single crystals have a p-type carrier concentration of
3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3.
Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K,
the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature
of 294 K. For each sample type, three-terminal capacitive dilatometry measurements
detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on
SnTe show elastic hardening near the structural transition, pointing to co-elastic
behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening,
pointing to ferroelastic behavior. Effective Debye temperature, θD, values of
SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the
range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In
addition, a precursor softening extending over approximately 100 K anticipates
this collapse at the critical temperature and quantitative analysis over three
decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02,
a value indicating a three-dimensional softening of phonon branches at a temperature
T0∼75 K, considerably below Tc. We suggest that the differences in these two types
of elastic behaviors lie in the absence of elastic domain-wall motion in the one
case and their nucleation in the other.
article_number: '184112'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: E. K. H.
full_name: Salje, E. K. H.
last_name: Salje
- first_name: D. J.
full_name: Safarik, D. J.
last_name: Safarik
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: J. E.
full_name: Gubernatis, J. E.
last_name: Gubernatis
- first_name: J. C.
full_name: Cooley, J. C.
last_name: Cooley
- first_name: R. D.
full_name: Taylor, R. D.
last_name: Taylor
- first_name: B.
full_name: Mihaila, B.
last_name: Mihaila
- first_name: A.
full_name: Saxena, A.
last_name: Saxena
- first_name: T.
full_name: Lookman, T.
last_name: Lookman
- first_name: J. L.
full_name: Smith, J. L.
last_name: Smith
- first_name: R. A.
full_name: Fisher, R. A.
last_name: Fisher
- first_name: M.
full_name: Pasternak, M.
last_name: Pasternak
- first_name: C. P.
full_name: Opeil, C. P.
last_name: Opeil
- first_name: T.
full_name: Siegrist, T.
last_name: Siegrist
- first_name: P. B.
full_name: Littlewood, P. B.
last_name: Littlewood
- first_name: J. C.
full_name: Lashley, J. C.
last_name: Lashley
citation:
ama: 'Salje EKH, Safarik DJ, Modic KA, et al. Tin telluride: A weakly co-elastic
metal. Physical Review B. 2010;82(18). doi:10.1103/physrevb.82.184112'
apa: 'Salje, E. K. H., Safarik, D. J., Modic, K. A., Gubernatis, J. E., Cooley,
J. C., Taylor, R. D., … Lashley, J. C. (2010). Tin telluride: A weakly co-elastic
metal. Physical Review B. APS. https://doi.org/10.1103/physrevb.82.184112'
chicago: 'Salje, E. K. H., D. J. Safarik, Kimberly A Modic, J. E. Gubernatis, J.
C. Cooley, R. D. Taylor, B. Mihaila, et al. “Tin Telluride: A Weakly Co-Elastic
Metal.” Physical Review B. APS, 2010. https://doi.org/10.1103/physrevb.82.184112.'
ieee: 'E. K. H. Salje et al., “Tin telluride: A weakly co-elastic metal,”
Physical Review B, vol. 82, no. 18. APS, 2010.'
ista: 'Salje EKH, Safarik DJ, Modic KA, Gubernatis JE, Cooley JC, Taylor RD, Mihaila
B, Saxena A, Lookman T, Smith JL, Fisher RA, Pasternak M, Opeil CP, Siegrist T,
Littlewood PB, Lashley JC. 2010. Tin telluride: A weakly co-elastic metal. Physical
Review B. 82(18), 184112.'
mla: 'Salje, E. K. H., et al. “Tin Telluride: A Weakly Co-Elastic Metal.” Physical
Review B, vol. 82, no. 18, 184112, APS, 2010, doi:10.1103/physrevb.82.184112.'
short: E.K.H. Salje, D.J. Safarik, K.A. Modic, J.E. Gubernatis, J.C. Cooley, R.D.
Taylor, B. Mihaila, A. Saxena, T. Lookman, J.L. Smith, R.A. Fisher, M. Pasternak,
C.P. Opeil, T. Siegrist, P.B. Littlewood, J.C. Lashley, Physical Review B 82 (2010).
date_created: 2019-11-19T13:46:28Z
date_published: 2010-11-18T00:00:00Z
date_updated: 2021-01-12T08:11:44Z
day: '18'
doi: 10.1103/physrevb.82.184112
extern: '1'
external_id:
arxiv:
- '1011.1445'
intvolume: ' 82'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1011.1445
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
issn:
- 1098-0121
- 1550-235X
publication_status: published
publisher: APS
quality_controlled: '1'
status: public
title: 'Tin telluride: A weakly co-elastic metal'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2010'
...
---
_id: '7079'
abstract:
- lang: eng
text: We have observed that reacting Pb:Te:Ag:Se in a 1:1:1.9:1 molar ratio gives
rise to what appears to be a predominantly single-phase alloy, which crystallizes
in the PbSe cF8 fcc structure. However, further investigation of the structure
using energy dispersive x-ray analysis reveals the presence of two phases, PbSe
and β-Ag2Te, with identical lattice parameters. The total thermal conductivity
of the formed alloy is remarkably low for a crystalline material, κT<0.6W∕mK at
675K, it is reproducible, and in addition, the compound has good mechanical properties.
article_number: '033519'
article_processing_charge: No
article_type: original
author:
- first_name: Fivos R.
full_name: Drymiotis, Fivos R.
last_name: Drymiotis
- first_name: Tyler B.
full_name: Drye, Tyler B.
last_name: Drye
- first_name: Yisha
full_name: Wang, Yisha
last_name: Wang
- first_name: Jian
full_name: He, Jian
last_name: He
- first_name: Daniel
full_name: Rhodes, Daniel
last_name: Rhodes
- first_name: Kimberly A
full_name: Modic, Kimberly A
id: 13C26AC0-EB69-11E9-87C6-5F3BE6697425
last_name: Modic
orcid: 0000-0001-9760-3147
- first_name: Samantha
full_name: Cawthorne, Samantha
last_name: Cawthorne
- first_name: Qiu Run
full_name: Zhang, Qiu Run
last_name: Zhang
citation:
ama: Drymiotis FR, Drye TB, Wang Y, et al. Structure formation and very low thermal
conductivity in Pb:Te:Ag:Se mixtures. Journal of Applied Physics. 2010;107(3).
doi:10.1063/1.3284946
apa: Drymiotis, F. R., Drye, T. B., Wang, Y., He, J., Rhodes, D., Modic, K. A.,
… Zhang, Q. R. (2010). Structure formation and very low thermal conductivity in
Pb:Te:Ag:Se mixtures. Journal of Applied Physics. AIP. https://doi.org/10.1063/1.3284946
chicago: Drymiotis, Fivos R., Tyler B. Drye, Yisha Wang, Jian He, Daniel Rhodes,
Kimberly A Modic, Samantha Cawthorne, and Qiu Run Zhang. “Structure Formation
and Very Low Thermal Conductivity in Pb:Te:Ag:Se Mixtures.” Journal of Applied
Physics. AIP, 2010. https://doi.org/10.1063/1.3284946.
ieee: F. R. Drymiotis et al., “Structure formation and very low thermal conductivity
in Pb:Te:Ag:Se mixtures,” Journal of Applied Physics, vol. 107, no. 3.
AIP, 2010.
ista: Drymiotis FR, Drye TB, Wang Y, He J, Rhodes D, Modic KA, Cawthorne S, Zhang
QR. 2010. Structure formation and very low thermal conductivity in Pb:Te:Ag:Se
mixtures. Journal of Applied Physics. 107(3), 033519.
mla: Drymiotis, Fivos R., et al. “Structure Formation and Very Low Thermal Conductivity
in Pb:Te:Ag:Se Mixtures.” Journal of Applied Physics, vol. 107, no. 3,
033519, AIP, 2010, doi:10.1063/1.3284946.
short: F.R. Drymiotis, T.B. Drye, Y. Wang, J. He, D. Rhodes, K.A. Modic, S. Cawthorne,
Q.R. Zhang, Journal of Applied Physics 107 (2010).
date_created: 2019-11-19T13:47:24Z
date_published: 2010-02-09T00:00:00Z
date_updated: 2021-01-12T08:11:44Z
day: '09'
doi: 10.1063/1.3284946
extern: '1'
intvolume: ' 107'
issue: '3'
language:
- iso: eng
month: '02'
oa_version: None
publication: Journal of Applied Physics
publication_identifier:
issn:
- 0021-8979
- 1089-7550
publication_status: published
publisher: AIP
quality_controlled: '1'
status: public
title: Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 107
year: '2010'
...
---
_id: '7318'
abstract:
- lang: eng
text: The decomposition reaction of H2O2 aqueous solutions (H2O2 - H2O + 1/2O2)
catalyzed by transition metal oxide powders has been compared with the charging
voltage of nonaqueous Li-O2 cells containing the same catalyst. An inverse linear
relationship between Ln k (rate constant for the H2O2 decomposition) and the charging
voltage has been found, despite differences in media and possible mechanistic
differences. The results suggest that the decomposition may be a reliable, useful,
and fast screening tool for materials that promote the charging process of the
Li-O2 battery and may ultimately give insight into the charging mechanism.
article_number: A180
article_processing_charge: No
article_type: letter_note
author:
- first_name: V.
full_name: Giordani, V.
last_name: Giordani
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
- first_name: P. G.
full_name: Bruce, P. G.
last_name: Bruce
- first_name: J.-M.
full_name: Tarascon, J.-M.
last_name: Tarascon
- first_name: D.
full_name: Larcher, D.
last_name: Larcher
citation:
ama: Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. H2O2 decomposition
reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical and
Solid-State Letters. 2010;13(12). doi:10.1149/1.3494045
apa: Giordani, V., Freunberger, S. A., Bruce, P. G., Tarascon, J.-M., & Larcher,
D. (2010). H2O2 decomposition reaction as selecting tool for catalysts in Li–O2
cells. Electrochemical and Solid-State Letters. The Electrochemical Society.
https://doi.org/10.1149/1.3494045
chicago: Giordani, V., Stefan Alexander Freunberger, P. G. Bruce, J.-M. Tarascon,
and D. Larcher. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts in
Li–O2 Cells.” Electrochemical and Solid-State Letters. The Electrochemical
Society, 2010. https://doi.org/10.1149/1.3494045.
ieee: V. Giordani, S. A. Freunberger, P. G. Bruce, J.-M. Tarascon, and D. Larcher,
“H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells,”
Electrochemical and Solid-State Letters, vol. 13, no. 12. The Electrochemical
Society, 2010.
ista: Giordani V, Freunberger SA, Bruce PG, Tarascon J-M, Larcher D. 2010. H2O2
decomposition reaction as selecting tool for catalysts in Li–O2 cells. Electrochemical
and Solid-State Letters. 13(12), A180.
mla: Giordani, V., et al. “H2O2 Decomposition Reaction as Selecting Tool for Catalysts
in Li–O2 Cells.” Electrochemical and Solid-State Letters, vol. 13, no.
12, A180, The Electrochemical Society, 2010, doi:10.1149/1.3494045.
short: V. Giordani, S.A. Freunberger, P.G. Bruce, J.-M. Tarascon, D. Larcher, Electrochemical
and Solid-State Letters 13 (2010).
date_created: 2020-01-15T12:21:06Z
date_published: 2010-10-04T00:00:00Z
date_updated: 2021-01-12T08:13:01Z
day: '04'
doi: 10.1149/1.3494045
extern: '1'
intvolume: ' 13'
issue: '12'
language:
- iso: eng
month: '10'
oa_version: None
publication: Electrochemical and Solid-State Letters
publication_identifier:
issn:
- 1099-0062
publication_status: published
publisher: The Electrochemical Society
quality_controlled: '1'
status: public
title: H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2010'
...
---
_id: '754'
abstract:
- lang: eng
text: 'Most people believe that renaming is easy: simply choose a name at random;
if more than one process selects the same name, then try again. We highlight the
issues that occur when trying to implement such a scheme and shed new light on
the read-write complexity of randomized renaming in an asynchronous environment.
At the heart of our new perspective stands an adaptive implementation of a randomized
test-and-set object, that has poly-logarithmic step complexity per operation,
with high probability. Interestingly, our implementation is anonymous, as it does
not require process identifiers. Based on this implementation, we present two
new randomized renaming algorithms. The first ensures a tight namespace of n names
using O( n log4 n) total steps, with high probability. This significantly improves
on the complexity of the best previously known namespace-optimal algorithms. The
second algorithm achieves a namespace of size k (1 + ε) using O( k log4 k / log2
(1 + ε) ) total steps, both with high probability, where k is the total contention
in the execution. It is the first adaptive randomized renaming algorithm, and
it improves on existing deterministic solutions by providing a smaller namespace,
and by lowering step complexity.'
acknowledgement: The work of Dan Alistarh is supported by the Swiss NCCR MICS project.
The work of Hagit Attiya is supported in part by the Israel Science Foundation (grant
number 953/06).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Hagit
full_name: Attiya, Hagit
last_name: Attiya
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Andrei
full_name: Giurgiu, Andrei
last_name: Giurgiu
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
citation:
ama: 'Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. Fast randomized
test-and-set and renaming. In: Vol 6343 LNCS. Springer; 2010:94-108. doi:10.1007/978-3-642-15763-9_9'
apa: 'Alistarh, D.-A., Attiya, H., Gilbert, S., Giurgiu, A., & Guerraoui, R.
(2010). Fast randomized test-and-set and renaming (Vol. 6343 LNCS, pp. 94–108).
Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-642-15763-9_9'
chicago: Alistarh, Dan-Adrian, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, and Rachid
Guerraoui. “Fast Randomized Test-and-Set and Renaming,” 6343 LNCS:94–108. Springer,
2010. https://doi.org/10.1007/978-3-642-15763-9_9.
ieee: 'D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, and R. Guerraoui, “Fast
randomized test-and-set and renaming,” presented at the DISC: Distributed Computing,
2010, vol. 6343 LNCS, pp. 94–108.'
ista: 'Alistarh D-A, Attiya H, Gilbert S, Giurgiu A, Guerraoui R. 2010. Fast randomized
test-and-set and renaming. DISC: Distributed Computing, LNCS, vol. 6343 LNCS,
94–108.'
mla: Alistarh, Dan-Adrian, et al. Fast Randomized Test-and-Set and Renaming.
Vol. 6343 LNCS, Springer, 2010, pp. 94–108, doi:10.1007/978-3-642-15763-9_9.
short: D.-A. Alistarh, H. Attiya, S. Gilbert, A. Giurgiu, R. Guerraoui, in:, Springer,
2010, pp. 94–108.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:19Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:21Z
day: '01'
doi: 10.1007/978-3-642-15763-9_9
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 94 - 108
publication_status: published
publisher: Springer
publist_id: '6900'
status: public
title: Fast randomized test-and-set and renaming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6343 LNCS
year: '2010'
...
---
_id: '755'
abstract:
- lang: eng
text: 'Gossip, also known as epidemic dissemination, is becoming an increasingly
popular technique in distributed systems. Yet, it has remained a partially open
question: how robust are such protocols? We consider a natural extension of the
random phone-call model (introduced by Karp et al. [1]), and we analyze two different
notions of robustness: the ability to tolerate adaptive failures, and the ability
to tolerate oblivious failures. For adaptive failures, we present a new gossip
protocol, TrickleGossip, which achieves near-optimal O(n log 3 n) message complexity.
To the best of our knowledge, this is the first epidemic-style protocol that can
tolerate adaptive failures. We also show a direct relation between resilience
and message complexity, demonstrating that gossip protocols which tolerate a large
number of adaptive failures need to use a super-linear number of messages with
high probability. For oblivious failures, we present a new gossip protocol, CoordinatedGossip,
that achieves optimal O(n) message complexity. This protocol makes novel use of
the universe reduction technique to limit the message complexity.'
acknowledgement: We would like to thank Prof. Hagit Attiya and the anonymous reviewers
for their useful comments on earlier drafts of this paper.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Morteza
full_name: Zadimoghaddam, Morteza
last_name: Zadimoghaddam
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. How efficient can gossip
be? (On the cost of resilient information exchange). In: Vol 6199 LNCS. Springer;
2010:115-126. doi:10.1007/978-3-642-14162-1_10'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Zadimoghaddam, M. (2010).
How efficient can gossip be? (On the cost of resilient information exchange) (Vol.
6199 LNCS, pp. 115–126). Presented at the ICALP: International Colloquium on Automota,
Languages and Programming, Springer. https://doi.org/10.1007/978-3-642-14162-1_10'
chicago: Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Morteza Zadimoghaddam.
“How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange),”
6199 LNCS:115–26. Springer, 2010. https://doi.org/10.1007/978-3-642-14162-1_10.
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, and M. Zadimoghaddam, “How efficient
can gossip be? (On the cost of resilient information exchange),” presented at
the ICALP: International Colloquium on Automota, Languages and Programming, 2010,
vol. 6199 LNCS, no. PART 2, pp. 115–126.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Zadimoghaddam M. 2010. How efficient
can gossip be? (On the cost of resilient information exchange). ICALP: International
Colloquium on Automota, Languages and Programming, LNCS, vol. 6199 LNCS, 115–126.'
mla: Alistarh, Dan-Adrian, et al. How Efficient Can Gossip Be? (On the Cost of
Resilient Information Exchange). Vol. 6199 LNCS, no. PART 2, Springer, 2010,
pp. 115–26, doi:10.1007/978-3-642-14162-1_10.
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, M. Zadimoghaddam, in:, Springer,
2010, pp. 115–126.
conference:
name: 'ICALP: International Colloquium on Automota, Languages and Programming'
date_created: 2018-12-11T11:48:20Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:40Z
day: '01'
doi: 10.1007/978-3-642-14162-1_10
extern: '1'
issue: PART 2
language:
- iso: eng
month: '01'
oa_version: None
page: 115 - 126
publication_status: published
publisher: Springer
publist_id: '6901'
status: public
title: How efficient can gossip be? (On the cost of resilient information exchange)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6199 LNCS
year: '2010'
...
---
_id: '756'
abstract:
- lang: eng
text: This paper studies non-cryptographic authenticated broadcast in radio networks
subject to malicious failures. We introduce two protocols that address this problem.
The first, NeighborWatchRB, makes use of a novel strategy in which honest devices
monitor their neighbors for malicious behavior. Second, we present a more robust
variant, MultiPathRB, that tolerates the maximum possible density of malicious
devices per region, using an elaborate voting strategy. We also introduce a new
proof technique to show that both protocols ensure asymptotically optimal running
time. We demonstrate the fault tolerance of our protocols through extensive simulation.
Simulations show the practical superiority of the NeighborWatchRB protocol (an
advantage hidden in the constants of the asymptotic complexity). The NeighborWatchRB
protocol even performs relatively well when compared to the simple, fast epidemic
protocols commonly used in the radio setting, protocols that tolerate no malicious
faults. We therefore believe that the overhead for ensuring authenticated broadcast
is reasonable, especially in applications that use authenticated broadcast only
when necessary, such as distributing an authenticated digest.
acknowledgement: "The authors would like to thank Prof. Guevara Noubir for his useful
comments on earlier\r\ndrafts of this paper."
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Žarko
full_name: Milošević, Žarko
last_name: Milošević
- first_name: Calvin
full_name: Newport, Calvin
last_name: Newport
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. Securing every
bit: Authenticated broadcast in radio networks. In: ACM; 2010:50-59. doi:10.1145/1810479.1810489'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., Milošević, Ž., & Newport,
C. (2010). Securing every bit: Authenticated broadcast in radio networks (pp.
50–59). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures,
ACM. https://doi.org/10.1145/1810479.1810489'
chicago: 'Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, Žarko Milošević,
and Calvin Newport. “Securing Every Bit: Authenticated Broadcast in Radio Networks,”
50–59. ACM, 2010. https://doi.org/10.1145/1810479.1810489.'
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, and C. Newport, “Securing
every bit: Authenticated broadcast in radio networks,” presented at the SPAA:
Symposium on Parallelism in Algorithms and Architectures, 2010, pp. 50–59.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Milošević Ž, Newport C. 2010. Securing
every bit: Authenticated broadcast in radio networks. SPAA: Symposium on Parallelism
in Algorithms and Architectures, 50–59.'
mla: 'Alistarh, Dan-Adrian, et al. Securing Every Bit: Authenticated Broadcast
in Radio Networks. ACM, 2010, pp. 50–59, doi:10.1145/1810479.1810489.'
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, Ž. Milošević, C. Newport, in:,
ACM, 2010, pp. 50–59.
conference:
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
date_created: 2018-12-11T11:48:20Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:10:56Z
day: '01'
doi: 10.1145/1810479.1810489
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 50 - 59
publication_status: published
publisher: ACM
publist_id: '6902'
status: public
title: 'Securing every bit: Authenticated broadcast in radio networks'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '758'
abstract:
- lang: eng
text: Set agreement [4] is a fundamental problem in distributed computing, in which
processes collectively choose a small subset of values from a larger set of proposals.
Set agreement has been extensively studied in both synchronous and asynchronous
systems [10,11,3,5,8,9]. Real world distributed systems, however, are neither
purely synchronous nor purely asynchronous. To describe such a system, Dwork et
al. [6] introduced the idea of partial synchrony. They assume for every execution
some (unknown) time GST (global stabilization time), after which the system is
synchronous. In a recent paper [1,2], we study the complexity of set agreement
in the context of partially synchronous systems, determining the minimum-sized
window of synchrony in which set agreement can be solved. We show that at least
⌊t/k⌋ + 2 synchronous rounds are required for k-set agreement, where t < n
is the number of crashes, and k is the agreement parameter of the set agreement
task. We then introduce an algorithm that terminates in any window of synchrony
of size at least ⌊t/k⌋ + 4 rounds. Together, these results tightly bound the inherent
price of tolerating some asynchrony.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Corentin
full_name: Travers, Corentin
last_name: Travers
citation:
ama: 'Alistarh D-A, Gilbert S, Guerraoui R, Travers C. Brief announcement: New bounds
for partially synchronous set agreement. In: Vol 6343 LNCS. Springer; 2010:404-405.
doi:10.1007/978-3-642-15763-9_40'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Travers, C. (2010). Brief
announcement: New bounds for partially synchronous set agreement (Vol. 6343 LNCS,
pp. 404–405). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-642-15763-9_40'
chicago: 'Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers.
“Brief Announcement: New Bounds for Partially Synchronous Set Agreement,” 6343
LNCS:404–5. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_40.'
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Brief announcement:
New bounds for partially synchronous set agreement,” presented at the DISC: Distributed
Computing, 2010, vol. 6343 LNCS, pp. 404–405.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2010. Brief announcement:
New bounds for partially synchronous set agreement. DISC: Distributed Computing,
LNCS, vol. 6343 LNCS, 404–405.'
mla: 'Alistarh, Dan-Adrian, et al. Brief Announcement: New Bounds for Partially
Synchronous Set Agreement. Vol. 6343 LNCS, Springer, 2010, pp. 404–05, doi:10.1007/978-3-642-15763-9_40.'
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2010,
pp. 404–405.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:21Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2023-02-23T13:11:26Z
day: '01'
doi: 10.1007/978-3-642-15763-9_40
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 404 - 405
publication_status: published
publisher: Springer
publist_id: '6899'
status: public
title: 'Brief announcement: New bounds for partially synchronous set agreement'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6343 LNCS
year: '2010'
...
---
_id: '3430'
abstract:
- lang: eng
text: These are notes for a set of 7 two-hour lectures given at the 2010 Summer
School on Quantitative Evolutionary and Comparative Genomics at OIST, Okinawa,
Japan. The emphasis is on understanding how biological systems process information.
We take a physicist's approach of looking for simple phenomenological descriptions
that can address the questions of biological function without necessarily modeling
all (mostly unknown) microscopic details; the example that is developed throughout
the notes is transcriptional regulation in genetic regulatory networks. We present
tools from information theory and statistical physics that can be used to analyze
noisy nonlinear biological networks, and build generative and predictive models
of regulatory processes.
author:
- first_name: Gasper
full_name: Gasper Tkacik
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: 'Tkačik G. Lecture notes for 2010 summer school on Quantitative Evolutionary
and Comparative Genomics. In: Elsevier; 2010.'
apa: Tkačik, G. (2010). Lecture notes for 2010 summer school on Quantitative Evolutionary
and Comparative Genomics. Presented at the Summer School on Quantitative Evolutionary
and Comparative Genomics, Elsevier.
chicago: Tkačik, Gašper. “Lecture Notes for 2010 Summer School on Quantitative Evolutionary
and Comparative Genomics.” Elsevier, 2010.
ieee: G. Tkačik, “Lecture notes for 2010 summer school on Quantitative Evolutionary
and Comparative Genomics,” presented at the Summer School on Quantitative Evolutionary
and Comparative Genomics, 2010.
ista: Tkačik G. 2010. Lecture notes for 2010 summer school on Quantitative Evolutionary
and Comparative Genomics. Summer School on Quantitative Evolutionary and Comparative
Genomics.
mla: Tkačik, Gašper. Lecture Notes for 2010 Summer School on Quantitative Evolutionary
and Comparative Genomics. Elsevier, 2010.
short: G. Tkačik, in:, Elsevier, 2010.
conference:
name: Summer School on Quantitative Evolutionary and Comparative Genomics
date_created: 2018-12-11T12:03:17Z
date_published: 2010-06-22T00:00:00Z
date_updated: 2021-01-12T07:43:25Z
day: '22'
extern: 1
main_file_link:
- open_access: '1'
url: http://arxiv.org/pdf/1006.4291
month: '06'
oa: 1
publication_status: published
publisher: Elsevier
publist_id: '2970'
quality_controlled: 0
status: public
title: Lecture notes for 2010 summer school on Quantitative Evolutionary and Comparative
Genomics
type: conference
year: '2010'
...
---
_id: '3441'
abstract:
- lang: eng
text: The hippocampus is an important brain circuit for spatial memory and the spatially
selective spiking of hippocampal neuronal assemblies is thought to provide a mnemonic
representation of space. We found that remembering newly learnt goal locations
required NMDA receptorĝ€"dependent stabilization and enhanced reactivation
of goal-related hippocampal assemblies. During spatial learning, place-related
firing patterns in the CA1, but not CA3, region of the rat hippocampus were reorganized
to represent new goal locations. Such reorganization did not occur when goals
were marked by visual cues. The stabilization and successful retrieval of these
newly acquired CA1 representations of behaviorally relevant places was NMDAR dependent
and necessary for subsequent memory retention performance. Goal-related assembly
patterns associated with sharp wave/ripple network oscillations, during both learning
and subsequent rest periods, predicted memory performance. Together, these results
suggest that the reorganization and reactivation of assembly firing patterns in
the hippocampus represent the formation and expression of new spatial memory traces.
© 2010 Nature America, Inc. All rights reserved.
acknowledgement: |
Discussed in the News and Views section of the journal by Jeffery and Cacucci
author:
- first_name: David
full_name: Dupret, David
last_name: Dupret
- first_name: Joseph
full_name: Joseph O'Neill
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Barty
full_name: Pleydell-Bouverie, Barty
last_name: Pleydell Bouverie
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: Dupret D, O’Neill J, Pleydell Bouverie B, Csicsvari JL. The reorganization
and reactivation of hippocampal maps predict spatial memory performance. Nature
Neuroscience. 2010;13(8):995-1002. doi:10.1038/nn.2599
apa: Dupret, D., O’Neill, J., Pleydell Bouverie, B., & Csicsvari, J. L. (2010).
The reorganization and reactivation of hippocampal maps predict spatial memory
performance. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.2599
chicago: Dupret, David, Joseph O’Neill, Barty Pleydell Bouverie, and Jozsef L Csicsvari.
“The Reorganization and Reactivation of Hippocampal Maps Predict Spatial Memory
Performance.” Nature Neuroscience. Nature Publishing Group, 2010. https://doi.org/10.1038/nn.2599.
ieee: D. Dupret, J. O’Neill, B. Pleydell Bouverie, and J. L. Csicsvari, “The reorganization
and reactivation of hippocampal maps predict spatial memory performance,” Nature
Neuroscience, vol. 13, no. 8. Nature Publishing Group, pp. 995–1002, 2010.
ista: Dupret D, O’Neill J, Pleydell Bouverie B, Csicsvari JL. 2010. The reorganization
and reactivation of hippocampal maps predict spatial memory performance. Nature
Neuroscience. 13(8), 995–1002.
mla: Dupret, David, et al. “The Reorganization and Reactivation of Hippocampal Maps
Predict Spatial Memory Performance.” Nature Neuroscience, vol. 13, no.
8, Nature Publishing Group, 2010, pp. 995–1002, doi:10.1038/nn.2599.
short: D. Dupret, J. O’Neill, B. Pleydell Bouverie, J.L. Csicsvari, Nature Neuroscience
13 (2010) 995–1002.
date_created: 2018-12-11T12:03:21Z
date_published: 2010-08-01T00:00:00Z
date_updated: 2021-01-12T07:43:29Z
day: '01'
doi: 10.1038/nn.2599
extern: 1
intvolume: ' 13'
issue: '8'
month: '08'
page: 995 - 1002
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '2946'
quality_controlled: 0
status: public
title: The reorganization and reactivation of hippocampal maps predict spatial memory
performance
type: journal_article
volume: 13
year: '2010'
...
---
_id: '3442'
abstract:
- lang: eng
text: Episodic and spatial memories each involve the encoding of complex associations
in hippocampal neuronal circuits. Such memory traces could be stabilised from
short- to long-term forms by consolidation processes involving the 'reactivation'
of the original network firing patterns during sleep and rest. Waking experience
can be replayed in many different brain areas, but an important role for the hippocampus
lies in the organisation of the 'reactivation' process. Emerging evidence suggests
that sharp wave/ripple (SWR) events in the hippocampus could coordinate the reactivation
of memory traces and direct their reinstatement in cortical circuits. Although
the mechanisms remain uncertain, there is a growing consensus that such SWR-directed
reactivation of brain-wide memory traces could underlie memory consolidation.
© 2010 Elsevier Ltd.
author:
- first_name: Joseph
full_name: Joseph O'Neill
id: 426376DC-F248-11E8-B48F-1D18A9856A87
last_name: O'Neill
- first_name: Barty
full_name: Pleydell-Bouverie, Barty
last_name: Pleydell Bouverie
- first_name: David
full_name: Dupret, David
last_name: Dupret
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: 'O’Neill J, Pleydell Bouverie B, Dupret D, Csicsvari JL. Play it again: reactivation
of waking experience and memory. Trends in Neurosciences. 2010;33(5):220-229.
doi:10.1016/j.tins.2010.01.006'
apa: 'O’Neill, J., Pleydell Bouverie, B., Dupret, D., & Csicsvari, J. L. (2010).
Play it again: reactivation of waking experience and memory. Trends in Neurosciences.
Elsevier. https://doi.org/10.1016/j.tins.2010.01.006'
chicago: 'O’Neill, Joseph, Barty Pleydell Bouverie, David Dupret, and Jozsef L Csicsvari.
“Play It Again: Reactivation of Waking Experience and Memory.” Trends in Neurosciences.
Elsevier, 2010. https://doi.org/10.1016/j.tins.2010.01.006.'
ieee: 'J. O’Neill, B. Pleydell Bouverie, D. Dupret, and J. L. Csicsvari, “Play it
again: reactivation of waking experience and memory,” Trends in Neurosciences,
vol. 33, no. 5. Elsevier, pp. 220–229, 2010.'
ista: 'O’Neill J, Pleydell Bouverie B, Dupret D, Csicsvari JL. 2010. Play it again:
reactivation of waking experience and memory. Trends in Neurosciences. 33(5),
220–229.'
mla: 'O’Neill, Joseph, et al. “Play It Again: Reactivation of Waking Experience
and Memory.” Trends in Neurosciences, vol. 33, no. 5, Elsevier, 2010, pp.
220–29, doi:10.1016/j.tins.2010.01.006.'
short: J. O’Neill, B. Pleydell Bouverie, D. Dupret, J.L. Csicsvari, Trends in Neurosciences
33 (2010) 220–229.
date_created: 2018-12-11T12:03:21Z
date_published: 2010-05-01T00:00:00Z
date_updated: 2021-01-12T07:43:29Z
day: '01'
doi: 10.1016/j.tins.2010.01.006
extern: 1
intvolume: ' 33'
issue: '5'
month: '05'
page: 220 - 229
publication: Trends in Neurosciences
publication_status: published
publisher: Elsevier
publist_id: '2945'
quality_controlled: 0
status: public
title: 'Play it again: reactivation of waking experience and memory'
type: journal_article
volume: 33
year: '2010'
...