---
_id: '7316'
abstract:
- lang: eng
text: The nonaqueous rechargeable lithium–O2 battery containing an alkyl carbonate
electrolyte discharges by formation of C3H6(OCO2Li)2, Li2CO3, HCO2Li, CH3CO2Li,
CO2, and H2O at the cathode, due to electrolyte decomposition. Charging involves
oxidation of C3H6(OCO2Li)2, Li2CO3, HCO2Li, CH3CO2Li accompanied by CO2 and H2O
evolution. Mechanisms are proposed for the reactions on discharge and charge.
The different pathways for discharge and charge are consistent with the widely
observed voltage gap in Li–O2 cells. Oxidation of C3H6(OCO2Li)2 involves terminal
carbonate groups leaving behind the OC3H6O moiety that reacts to form a thick
gel on the Li anode. Li2CO3, HCO2Li, CH3CO2Li, and C3H6(OCO2Li)2 accumulate in
the cathode on cycling correlating with capacity fading and cell failure. The
latter is compounded by continuous consumption of the electrolyte on each discharge.
article_processing_charge: No
article_type: original
author:
- 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: Yuhui
full_name: Chen, Yuhui
last_name: Chen
- first_name: Zhangquan
full_name: Peng, Zhangquan
last_name: Peng
- first_name: John M.
full_name: Griffin, John M.
last_name: Griffin
- first_name: Laurence J.
full_name: Hardwick, Laurence J.
last_name: Hardwick
- first_name: Fanny
full_name: Bardé, Fanny
last_name: Bardé
- first_name: Petr
full_name: Novák, Petr
last_name: Novák
- first_name: Peter G.
full_name: Bruce, Peter G.
last_name: Bruce
citation:
ama: Freunberger SA, Chen Y, Peng Z, et al. Reactions in the rechargeable Lithium–O2
battery with alkyl carbonate electrolytes. Journal of the American Chemical
Society. 2011;133(20):8040-8047. doi:10.1021/ja2021747
apa: Freunberger, S. A., Chen, Y., Peng, Z., Griffin, J. M., Hardwick, L. J., Bardé,
F., … Bruce, P. G. (2011). Reactions in the rechargeable Lithium–O2 battery with
alkyl carbonate electrolytes. Journal of the American Chemical Society.
ACS. https://doi.org/10.1021/ja2021747
chicago: Freunberger, Stefan Alexander, Yuhui Chen, Zhangquan Peng, John M. Griffin,
Laurence J. Hardwick, Fanny Bardé, Petr Novák, and Peter G. Bruce. “Reactions
in the Rechargeable Lithium–O2 Battery with Alkyl Carbonate Electrolytes.” Journal
of the American Chemical Society. ACS, 2011. https://doi.org/10.1021/ja2021747.
ieee: S. A. Freunberger et al., “Reactions in the rechargeable Lithium–O2
battery with alkyl carbonate electrolytes,” Journal of the American Chemical
Society, vol. 133, no. 20. ACS, pp. 8040–8047, 2011.
ista: Freunberger SA, Chen Y, Peng Z, Griffin JM, Hardwick LJ, Bardé F, Novák
P, Bruce PG. 2011. Reactions in the rechargeable Lithium–O2 battery with alkyl
carbonate electrolytes. Journal of the American Chemical Society. 133(20), 8040–8047.
mla: Freunberger, Stefan Alexander, et al. “Reactions in the Rechargeable Lithium–O2
Battery with Alkyl Carbonate Electrolytes.” Journal of the American Chemical
Society, vol. 133, no. 20, ACS, 2011, pp. 8040–47, doi:10.1021/ja2021747.
short: S.A. Freunberger, Y. Chen, Z. Peng, J.M. Griffin, L.J. Hardwick, F. Bardé,
P. Novák, P.G. Bruce, Journal of the American Chemical Society 133 (2011) 8040–8047.
date_created: 2020-01-15T12:20:43Z
date_published: 2011-04-27T00:00:00Z
date_updated: 2021-01-12T08:13:00Z
day: '27'
doi: 10.1021/ja2021747
extern: '1'
intvolume: ' 133'
issue: '20'
language:
- iso: eng
month: '04'
oa_version: None
page: 8040-8047
publication: Journal of the American Chemical Society
publication_identifier:
issn:
- 0002-7863
- 1520-5126
publication_status: published
publisher: ACS
quality_controlled: '1'
status: public
title: Reactions in the rechargeable Lithium–O2 battery with alkyl carbonate electrolytes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 133
year: '2011'
...
---
_id: '7317'
abstract:
- lang: eng
text: Lithium-metal oxides with a high formal Li2O content, such as Li5FeO4 (5Li2O•Fe2O3)
and a Li2MnO3•LiFeO2 composite ({Li2O•MnO2}•{Li2O•Fe2O3}) have been explored as
electrocatalysts for primary and rechargeable Li-O2 cells. Activation occurs predominantly
by Li2O removal, either electrochemically or chemically by acid-treatment. Superior
electrochemical behavior is obtained if activation occurs by acid-treatment; Li2MnO3•LiFeO2
catalysts provide 2516 mAh/g (carbon) corresponding to 931 mAh/g (electrocatalyst
+ carbon) during the initial discharge. The reaction is reasonably reversible
during the early cycles. The approach has implications for designing electrocatalysts
that participate through electrochemical Li2O extraction/reformation reactions,
offering exceptionally high capacities.
article_number: A64
article_processing_charge: No
article_type: original
author:
- first_name: L.
full_name: Trahey, L.
last_name: Trahey
- first_name: C. S.
full_name: Johnson, C. S.
last_name: Johnson
- first_name: J. T.
full_name: Vaughey, J. T.
last_name: Vaughey
- first_name: S.-H.
full_name: Kang, S.-H.
last_name: Kang
- first_name: L. J.
full_name: Hardwick, L. J.
last_name: Hardwick
- 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: M. M.
full_name: Thackeray, M. M.
last_name: Thackeray
citation:
ama: Trahey L, Johnson CS, Vaughey JT, et al. Activated Lithium-Metal-Oxides as
catalytic electrodes for Li–O2 cells. Electrochemical and Solid-State Letters.
2011;14(5). doi:10.1149/1.3555366
apa: Trahey, L., Johnson, C. S., Vaughey, J. T., Kang, S.-H., Hardwick, L. J., Freunberger,
S. A., … Thackeray, M. M. (2011). Activated Lithium-Metal-Oxides as catalytic
electrodes for Li–O2 cells. Electrochemical and Solid-State Letters. The
Electrochemical Society. https://doi.org/10.1149/1.3555366
chicago: Trahey, L., C. S. Johnson, J. T. Vaughey, S.-H. Kang, L. J. Hardwick, Stefan
Alexander Freunberger, P. G. Bruce, and M. M. Thackeray. “Activated Lithium-Metal-Oxides
as Catalytic Electrodes for Li–O2 Cells.” Electrochemical and Solid-State Letters.
The Electrochemical Society, 2011. https://doi.org/10.1149/1.3555366.
ieee: L. Trahey et al., “Activated Lithium-Metal-Oxides as catalytic electrodes
for Li–O2 cells,” Electrochemical and Solid-State Letters, vol. 14, no.
5. The Electrochemical Society, 2011.
ista: Trahey L, Johnson CS, Vaughey JT, Kang S-H, Hardwick LJ, Freunberger SA, Bruce
PG, Thackeray MM. 2011. Activated Lithium-Metal-Oxides as catalytic electrodes
for Li–O2 cells. Electrochemical and Solid-State Letters. 14(5), A64.
mla: Trahey, L., et al. “Activated Lithium-Metal-Oxides as Catalytic Electrodes
for Li–O2 Cells.” Electrochemical and Solid-State Letters, vol. 14, no.
5, A64, The Electrochemical Society, 2011, doi:10.1149/1.3555366.
short: L. Trahey, C.S. Johnson, J.T. Vaughey, S.-H. Kang, L.J. Hardwick, S.A. Freunberger,
P.G. Bruce, M.M. Thackeray, Electrochemical and Solid-State Letters 14 (2011).
date_created: 2020-01-15T12:20:54Z
date_published: 2011-03-02T00:00:00Z
date_updated: 2021-01-12T08:13:00Z
day: '02'
doi: 10.1149/1.3555366
extern: '1'
intvolume: ' 14'
issue: '5'
language:
- iso: eng
month: '03'
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: Activated Lithium-Metal-Oxides as catalytic electrodes for Li–O2 cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2011'
...
---
_id: '757'
abstract:
- lang: eng
text: Synchronous distributed algorithms are easier to design and prove correct
than algorithms that tolerate asynchrony. Yet, in the real world, networks experience
asynchrony and other timing anomalies. In this paper, we address the question
of how to efficiently transform an algorithm that relies on synchronization into
an algorithm that tolerates asynchronous executions. We introduce a transformation
technique from synchronous algorithms to indulgent algorithms [1], which induces
only a constant overhead in terms of time complexity in well-behaved executions.
Our technique is based on a new abstraction we call an asynchrony detector, which
the participating processes implement collectively. The resulting transformation
works for a large class of colorless tasks, including consensus and set agreement.
Interestingly, we also show that our technique is relevant for colored tasks,
by applying it to the renaming problem, to obtain the first indulgent renaming
algorithm.
acknowledgement: "The authors would like to thank Prof. Hagit Attiya and Nikola\r\nKneˇ\r\nzevi
́\r\nc for their help on previous drafts of this paper, and the anonymous reviewers\r\nfor
their useful feedback."
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. Generating fast indulgent
algorithms. In: Vol 6522 LNCS. Springer; 2011:41-52. doi:10.1007/978-3-642-17679-1_4'
apa: 'Alistarh, D.-A., Gilbert, S., Guerraoui, R., & Travers, C. (2011). Generating
fast indulgent algorithms (Vol. 6522 LNCS, pp. 41–52). Presented at the ICDCN:
International Conference on Distributed Computing and Networking, Springer. https://doi.org/10.1007/978-3-642-17679-1_4'
chicago: Alistarh, Dan-Adrian, Seth Gilbert, Rachid Guerraoui, and Corentin Travers.
“Generating Fast Indulgent Algorithms,” 6522 LNCS:41–52. Springer, 2011. https://doi.org/10.1007/978-3-642-17679-1_4.
ieee: 'D.-A. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers, “Generating fast
indulgent algorithms,” presented at the ICDCN: International Conference on Distributed
Computing and Networking, 2011, vol. 6522 LNCS, pp. 41–52.'
ista: 'Alistarh D-A, Gilbert S, Guerraoui R, Travers C. 2011. Generating fast indulgent
algorithms. ICDCN: International Conference on Distributed Computing and Networking,
LNCS, vol. 6522 LNCS, 41–52.'
mla: Alistarh, Dan-Adrian, et al. Generating Fast Indulgent Algorithms. Vol.
6522 LNCS, Springer, 2011, pp. 41–52, doi:10.1007/978-3-642-17679-1_4.
short: D.-A. Alistarh, S. Gilbert, R. Guerraoui, C. Travers, in:, Springer, 2011,
pp. 41–52.
conference:
name: 'ICDCN: International Conference on Distributed Computing and Networking'
date_created: 2018-12-11T11:48:20Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2023-02-23T13:11:09Z
day: '01'
doi: 10.1007/978-3-642-17679-1_4
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 41 - 52
publication_status: published
publisher: Springer
publist_id: '6898'
status: public
title: Generating fast indulgent algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6522 LNCS
year: '2011'
...
---
_id: '759'
abstract:
- lang: eng
text: 'We study the complexity of renaming, a fundamental problem in distributed
computing in which a set of processes need to pick distinct names from a given
namespace. We prove an individual lower bound of Ω(k) process steps for deterministic
renaming into any namespace of size sub-exponential in k, where k is the number
of participants. This bound is tight: it draws an exponential separation between
deterministic and randomized solutions, and implies new tight bounds for deterministic
fetch-and-increment registers, queues and stacks. The proof of the bound is interesting
in its own right, for it relies on the first reduction from renaming to another
fundamental problem in distributed computing: mutual exclusion. We complement
our individual bound with a global lower bound of Ω(k log (k/c)) on the total
step complexity of renaming into a namespace of size ck, for any c ≥ 1. This applies
to randomized algorithms against a strong adversary, and helps derive new global
lower bounds for randomized approximate counter and fetch-and-increment implementations,
all tight within logarithmic factors.'
acknowledgement: "The authors would like to thank Hagit Attiya and Keren\r\nCensor-Hillel
\ for discussions and feedback on earlier versions of this paper, and
\ the anonymous reviewers for their\r\nvery useful suggestions."
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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
citation:
ama: 'Alistarh D-A, Aspnes J, Gilbert S, Guerraoui R. The complexity of renaming.
In: IEEE; 2011:718-727. doi:10.1109/FOCS.2011.66'
apa: 'Alistarh, D.-A., Aspnes, J., Gilbert, S., & Guerraoui, R. (2011). The
complexity of renaming (pp. 718–727). Presented at the FOCS: Foundations of Computer
Science, IEEE. https://doi.org/10.1109/FOCS.2011.66'
chicago: Alistarh, Dan-Adrian, James Aspnes, Seth Gilbert, and Rachid Guerraoui.
“The Complexity of Renaming,” 718–27. IEEE, 2011. https://doi.org/10.1109/FOCS.2011.66.
ieee: 'D.-A. Alistarh, J. Aspnes, S. Gilbert, and R. Guerraoui, “The complexity
of renaming,” presented at the FOCS: Foundations of Computer Science, 2011, pp.
718–727.'
ista: 'Alistarh D-A, Aspnes J, Gilbert S, Guerraoui R. 2011. The complexity of renaming.
FOCS: Foundations of Computer Science, 718–727.'
mla: Alistarh, Dan-Adrian, et al. The Complexity of Renaming. IEEE, 2011,
pp. 718–27, doi:10.1109/FOCS.2011.66.
short: D.-A. Alistarh, J. Aspnes, S. Gilbert, R. Guerraoui, in:, IEEE, 2011, pp.
718–727.
conference:
name: 'FOCS: Foundations of Computer Science'
date_created: 2018-12-11T11:48:21Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2023-02-23T13:11:40Z
day: '01'
doi: 10.1109/FOCS.2011.66
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 718 - 727
publication_status: published
publisher: IEEE
publist_id: '6895'
status: public
title: The complexity of renaming
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '760'
abstract:
- lang: eng
text: A randomized implementation is given of a test-and-set register with O(log
log n) individual step complexity and O(n) total step complexity against an oblivious
adversary. The implementation is linearizable and multi-shot, and shows an exponential
complexity improvement over previous solutions designed to work against a strong
adversary.
acknowledgement: The work of Dan Alistarh was supported by the NCCR MICS Project.
The work of James Aspnes was supported in part by NSF grant CCF-0916389.
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: James
full_name: Aspnes, James
last_name: Aspnes
citation:
ama: 'Alistarh D-A, Aspnes J. Sub-logarithmic test-and-set against a weak adversary.
In: Vol 6950 LNCS. Springer; 2011:97-109. doi:10.1007/978-3-642-24100-0_7'
apa: 'Alistarh, D.-A., & Aspnes, J. (2011). Sub-logarithmic test-and-set against
a weak adversary (Vol. 6950 LNCS, pp. 97–109). Presented at the DISC: Distributed
Computing, Springer. https://doi.org/10.1007/978-3-642-24100-0_7'
chicago: Alistarh, Dan-Adrian, and James Aspnes. “Sub-Logarithmic Test-and-Set against
a Weak Adversary,” 6950 LNCS:97–109. Springer, 2011. https://doi.org/10.1007/978-3-642-24100-0_7.
ieee: 'D.-A. Alistarh and J. Aspnes, “Sub-logarithmic test-and-set against a weak
adversary,” presented at the DISC: Distributed Computing, 2011, vol. 6950 LNCS,
pp. 97–109.'
ista: 'Alistarh D-A, Aspnes J. 2011. Sub-logarithmic test-and-set against a weak
adversary. DISC: Distributed Computing, LNCS, vol. 6950 LNCS, 97–109.'
mla: Alistarh, Dan-Adrian, and James Aspnes. Sub-Logarithmic Test-and-Set against
a Weak Adversary. Vol. 6950 LNCS, Springer, 2011, pp. 97–109, doi:10.1007/978-3-642-24100-0_7.
short: D.-A. Alistarh, J. Aspnes, in:, Springer, 2011, pp. 97–109.
conference:
name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:21Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2023-02-23T13:12:01Z
day: '01'
doi: 10.1007/978-3-642-24100-0_7
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 97 - 109
publication_status: published
publisher: Springer
publist_id: '6896'
status: public
title: Sub-logarithmic test-and-set against a weak adversary
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6950 LNCS
year: '2011'
...
---
_id: '761'
abstract:
- lang: eng
text: We give two new randomized algorithms for strong renaming, both of which work
against an adaptive adversary in asynchronous shared memory. The first uses repeated
sampling over a sequence of arrays of decreasing size to assign unique names to
each of n processes with step complexity O(log3 n). The second transforms any
sorting network into a strong adaptive renaming protocol, with an expected cost
equal to the depth of the sorting network. Using an AKS sorting network, this
gives a strong adaptive renaming algorithm with step complexity O(log k), where
k is the contention in the current execution. We show this to be optimal based
on a classic lower bound of Jayanti. We also show that any such strong renaming
protocol can be used to build a monotone-consistent counter with logarithmic step
complexity (at the cost of adding a max register) or a linearizable fetch-and-increment
register (at the cost of increasing the step complexity by a logarithmic factor).
acknowledgement: "We would like to thank Hagit Attiya, Rachid Guerraoui\r\nand Prasad
Jayanti for useful discussions and support. We\r\nwould also like to thank the
anonymous reviewers for many\r\nuseful comments."
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: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Keren
full_name: Censor Hillel, Keren
last_name: Censor Hillel
- first_name: Seth
full_name: Gilbert, Seth
last_name: Gilbert
- first_name: Morteza
full_name: Zadimoghaddam, Morteza
last_name: Zadimoghaddam
citation:
ama: 'Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. Optimal-time
adaptive strong renaming, with applications to counting. In: ACM; 2011:239-248.
doi:10.1145/1993806.1993850'
apa: 'Alistarh, D.-A., Aspnes, J., Censor Hillel, K., Gilbert, S., & Zadimoghaddam,
M. (2011). Optimal-time adaptive strong renaming, with applications to counting
(pp. 239–248). Presented at the PODC: Principles of Distributed Computing, ACM.
https://doi.org/10.1145/1993806.1993850'
chicago: Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert,
and Morteza Zadimoghaddam. “Optimal-Time Adaptive Strong Renaming, with Applications
to Counting,” 239–48. ACM, 2011. https://doi.org/10.1145/1993806.1993850.
ieee: 'D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and M. Zadimoghaddam,
“Optimal-time adaptive strong renaming, with applications to counting,” presented
at the PODC: Principles of Distributed Computing, 2011, pp. 239–248.'
ista: 'Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. 2011.
Optimal-time adaptive strong renaming, with applications to counting. PODC: Principles
of Distributed Computing, 239–248.'
mla: Alistarh, Dan-Adrian, et al. Optimal-Time Adaptive Strong Renaming, with
Applications to Counting. ACM, 2011, pp. 239–48, doi:10.1145/1993806.1993850.
short: D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, M. Zadimoghaddam,
in:, ACM, 2011, pp. 239–248.
conference:
name: 'PODC: Principles of Distributed Computing'
date_created: 2018-12-11T11:48:22Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2023-02-23T13:12:17Z
day: '01'
doi: 10.1145/1993806.1993850
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 239 - 248
publication_status: published
publisher: ACM
publist_id: '6897'
status: public
title: Optimal-time adaptive strong renaming, with applications to counting
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '7701'
abstract:
- lang: eng
text: During assembly of the Drosophila olfactory circuit, projection neuron (PN)
dendrites prepattern the developing antennal lobe before the arrival of axons
from their presynaptic partners, the adult olfactory receptor neurons (ORNs).
We previously found that levels of transmembrane Semaphorin-1a, which acts as
a receptor, instruct PN dendrite targeting along the dorsolateral-ventromedial
axis. Here we show that two secreted semaphorins, Sema-2a and Sema-2b, provide
spatial cues for PN dendrite targeting. Sema-2a and Sema-2b proteins are distributed
in gradients opposing the Sema-1a protein gradient, and Sema-1a binds to Sema-2a-expressing
cells. In Sema-2a and Sema-2b double mutants, PN dendrites that normally target
dorsolaterally in the antennal lobe mistarget ventromedially, phenocopying cell-autonomous
Sema-1a removal from these PNs. Cell ablation, cell-specific knockdown, and rescue
experiments indicate that secreted semaphorins from degenerating larval ORN axons
direct dendrite targeting. Thus, a degenerating brain structure instructs the
wiring of a developing circuit through the repulsive action of secreted semaphorins.
article_processing_charge: No
article_type: original
author:
- first_name: Lora Beatrice Jaeger
full_name: Sweeney, Lora Beatrice Jaeger
id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
last_name: Sweeney
orcid: 0000-0001-9242-5601
- first_name: Ya-Hui
full_name: Chou, Ya-Hui
last_name: Chou
- first_name: Zhuhao
full_name: Wu, Zhuhao
last_name: Wu
- first_name: William
full_name: Joo, William
last_name: Joo
- first_name: Takaki
full_name: Komiyama, Takaki
last_name: Komiyama
- first_name: Christopher J.
full_name: Potter, Christopher J.
last_name: Potter
- first_name: Alex L.
full_name: Kolodkin, Alex L.
last_name: Kolodkin
- first_name: K. Christopher
full_name: Garcia, K. Christopher
last_name: Garcia
- first_name: Liqun
full_name: Luo, Liqun
last_name: Luo
citation:
ama: Sweeney LB, Chou Y-H, Wu Z, et al. Secreted semaphorins from degenerating larval
ORN axons direct adult projection neuron dendrite targeting. Neuron. 2011;72(5):734-747.
doi:10.1016/j.neuron.2011.09.026
apa: Sweeney, L. B., Chou, Y.-H., Wu, Z., Joo, W., Komiyama, T., Potter, C. J.,
… Luo, L. (2011). Secreted semaphorins from degenerating larval ORN axons direct
adult projection neuron dendrite targeting. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2011.09.026
chicago: Sweeney, Lora B., Ya-Hui Chou, Zhuhao Wu, William Joo, Takaki Komiyama,
Christopher J. Potter, Alex L. Kolodkin, K. Christopher Garcia, and Liqun Luo.
“Secreted Semaphorins from Degenerating Larval ORN Axons Direct Adult Projection
Neuron Dendrite Targeting.” Neuron. Elsevier, 2011. https://doi.org/10.1016/j.neuron.2011.09.026.
ieee: L. B. Sweeney et al., “Secreted semaphorins from degenerating larval
ORN axons direct adult projection neuron dendrite targeting,” Neuron, vol.
72, no. 5. Elsevier, pp. 734–747, 2011.
ista: Sweeney LB, Chou Y-H, Wu Z, Joo W, Komiyama T, Potter CJ, Kolodkin AL, Garcia
KC, Luo L. 2011. Secreted semaphorins from degenerating larval ORN axons direct
adult projection neuron dendrite targeting. Neuron. 72(5), 734–747.
mla: Sweeney, Lora B., et al. “Secreted Semaphorins from Degenerating Larval ORN
Axons Direct Adult Projection Neuron Dendrite Targeting.” Neuron, vol.
72, no. 5, Elsevier, 2011, pp. 734–47, doi:10.1016/j.neuron.2011.09.026.
short: L.B. Sweeney, Y.-H. Chou, Z. Wu, W. Joo, T. Komiyama, C.J. Potter, A.L. Kolodkin,
K.C. Garcia, L. Luo, Neuron 72 (2011) 734–747.
date_created: 2020-04-30T10:36:12Z
date_published: 2011-12-08T00:00:00Z
date_updated: 2024-01-31T10:13:39Z
day: '08'
doi: 10.1016/j.neuron.2011.09.026
extern: '1'
intvolume: ' 72'
issue: '5'
language:
- iso: eng
month: '12'
oa_version: None
page: 734-747
publication: Neuron
publication_identifier:
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Secreted semaphorins from degenerating larval ORN axons direct adult projection
neuron dendrite targeting
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 72
year: '2011'
...
---
_id: '7702'
abstract:
- lang: eng
text: Longitudinal axon fascicles within the Drosophila embryonic CNS provide connections
between body segments and are required for coordinated neural signaling along
the anterior-posterior axis. We show here that establishment of select CNS longitudinal
tracts and formation of precise mechanosensory afferent innervation to the same
CNS region are coordinately regulated by the secreted semaphorins Sema-2a and
Sema-2b. Both Sema-2a and Sema-2b utilize the same neuronal receptor, plexin B
(PlexB), but serve distinct guidance functions. Localized Sema-2b attraction promotes
the initial assembly of a subset of CNS longitudinal projections and subsequent
targeting of chordotonal sensory afferent axons to these same longitudinal connectives,
whereas broader Sema-2a repulsion serves to prevent aberrant innervation. In the
absence of Sema-2b or PlexB, chordotonal afferent connectivity within the CNS
is severely disrupted, resulting in specific larval behavioral deficits. These
results reveal that distinct semaphorin-mediated guidance functions converge at
PlexB and are critical for functional neural circuit assembly.
article_processing_charge: No
article_type: original
author:
- first_name: Zhuhao
full_name: Wu, Zhuhao
last_name: Wu
- first_name: Lora Beatrice Jaeger
full_name: Sweeney, Lora Beatrice Jaeger
id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
last_name: Sweeney
orcid: 0000-0001-9242-5601
- first_name: Joseph C.
full_name: Ayoob, Joseph C.
last_name: Ayoob
- first_name: Kayam
full_name: Chak, Kayam
last_name: Chak
- first_name: Benjamin J.
full_name: Andreone, Benjamin J.
last_name: Andreone
- first_name: Tomoko
full_name: Ohyama, Tomoko
last_name: Ohyama
- first_name: Rex
full_name: Kerr, Rex
last_name: Kerr
- first_name: Liqun
full_name: Luo, Liqun
last_name: Luo
- first_name: Marta
full_name: Zlatic, Marta
last_name: Zlatic
- first_name: Alex L.
full_name: Kolodkin, Alex L.
last_name: Kolodkin
citation:
ama: Wu Z, Sweeney LB, Ayoob JC, et al. A combinatorial semaphorin code instructs
the initial steps of sensory circuit assembly in the Drosophila CNS. Neuron.
2011;70(2):281-298. doi:10.1016/j.neuron.2011.02.050
apa: Wu, Z., Sweeney, L. B., Ayoob, J. C., Chak, K., Andreone, B. J., Ohyama, T.,
… Kolodkin, A. L. (2011). A combinatorial semaphorin code instructs the initial
steps of sensory circuit assembly in the Drosophila CNS. Neuron. Elsevier.
https://doi.org/10.1016/j.neuron.2011.02.050
chicago: Wu, Zhuhao, Lora B. Sweeney, Joseph C. Ayoob, Kayam Chak, Benjamin J. Andreone,
Tomoko Ohyama, Rex Kerr, Liqun Luo, Marta Zlatic, and Alex L. Kolodkin. “A Combinatorial
Semaphorin Code Instructs the Initial Steps of Sensory Circuit Assembly in the
Drosophila CNS.” Neuron. Elsevier, 2011. https://doi.org/10.1016/j.neuron.2011.02.050.
ieee: Z. Wu et al., “A combinatorial semaphorin code instructs the initial
steps of sensory circuit assembly in the Drosophila CNS,” Neuron, vol.
70, no. 2. Elsevier, pp. 281–298, 2011.
ista: Wu Z, Sweeney LB, Ayoob JC, Chak K, Andreone BJ, Ohyama T, Kerr R, Luo L,
Zlatic M, Kolodkin AL. 2011. A combinatorial semaphorin code instructs the initial
steps of sensory circuit assembly in the Drosophila CNS. Neuron. 70(2), 281–298.
mla: Wu, Zhuhao, et al. “A Combinatorial Semaphorin Code Instructs the Initial Steps
of Sensory Circuit Assembly in the Drosophila CNS.” Neuron, vol. 70, no.
2, Elsevier, 2011, pp. 281–98, doi:10.1016/j.neuron.2011.02.050.
short: Z. Wu, L.B. Sweeney, J.C. Ayoob, K. Chak, B.J. Andreone, T. Ohyama, R. Kerr,
L. Luo, M. Zlatic, A.L. Kolodkin, Neuron 70 (2011) 281–298.
date_created: 2020-04-30T10:36:30Z
date_published: 2011-04-28T00:00:00Z
date_updated: 2024-01-31T10:14:29Z
day: '28'
doi: 10.1016/j.neuron.2011.02.050
extern: '1'
intvolume: ' 70'
issue: '2'
language:
- iso: eng
month: '04'
oa_version: None
page: 281-298
publication: Neuron
publication_identifier:
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: A combinatorial semaphorin code instructs the initial steps of sensory circuit
assembly in the Drosophila CNS
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 70
year: '2011'
...
---
_id: '7750'
article_processing_charge: No
article_type: original
author:
- first_name: Matthew Richard
full_name: Robinson, Matthew Richard
id: E5D42276-F5DA-11E9-8E24-6303E6697425
last_name: Robinson
orcid: 0000-0001-8982-8813
citation:
ama: Robinson MR. Understanding intrasexual competition and sexual selection requires
an evolutionary ecology framework. Behavioral Ecology. 2011;22(6):1143-1144.
doi:10.1093/beheco/arr110
apa: Robinson, M. R. (2011). Understanding intrasexual competition and sexual selection
requires an evolutionary ecology framework. Behavioral Ecology. Oxford
University Press. https://doi.org/10.1093/beheco/arr110
chicago: Robinson, Matthew Richard. “Understanding Intrasexual Competition and Sexual
Selection Requires an Evolutionary Ecology Framework.” Behavioral Ecology.
Oxford University Press, 2011. https://doi.org/10.1093/beheco/arr110.
ieee: M. R. Robinson, “Understanding intrasexual competition and sexual selection
requires an evolutionary ecology framework,” Behavioral Ecology, vol. 22,
no. 6. Oxford University Press, pp. 1143–1144, 2011.
ista: Robinson MR. 2011. Understanding intrasexual competition and sexual selection
requires an evolutionary ecology framework. Behavioral Ecology. 22(6), 1143–1144.
mla: Robinson, Matthew Richard. “Understanding Intrasexual Competition and Sexual
Selection Requires an Evolutionary Ecology Framework.” Behavioral Ecology,
vol. 22, no. 6, Oxford University Press, 2011, pp. 1143–44, doi:10.1093/beheco/arr110.
short: M.R. Robinson, Behavioral Ecology 22 (2011) 1143–1144.
date_created: 2020-04-30T11:01:43Z
date_published: 2011-11-01T00:00:00Z
date_updated: 2021-01-12T08:15:16Z
day: '01'
doi: 10.1093/beheco/arr110
extern: '1'
intvolume: ' 22'
issue: '6'
language:
- iso: eng
month: '11'
oa_version: None
page: 1143-1144
publication: Behavioral Ecology
publication_identifier:
issn:
- 1465-7279
- 1045-2249
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
status: public
title: Understanding intrasexual competition and sexual selection requires an evolutionary
ecology framework
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2011'
...
---
_id: '469'
abstract:
- lang: eng
text: 'Spontaneous release of glutamate is important for maintaining synaptic strength
and controlling spike timing in the brain. Mechanisms regulating spontaneous exocytosis
remain poorly understood. Extracellular calcium concentration ([Ca2+]o) regulates
Ca2+ entry through voltage-activated calcium channels (VACCs) and consequently
is a pivotal determinant of action potential-evoked vesicle fusion. Extracellular
Ca 2+ also enhances spontaneous release, but via unknown mechanisms. Here we report
that external Ca2+ triggers spontaneous glutamate release more weakly than evoked
release in mouse neocortical neurons. Blockade of VACCs has no effect on the spontaneous
release rate or its dependence on [Ca2+]o. Intracellular [Ca2+] slowly increases
in a minority of neurons following increases in [Ca2+]o. Furthermore, the enhancement
of spontaneous release by extracellular calcium is insensitive to chelation of
intracellular calcium by BAPTA. Activation of the calcium-sensing receptor (CaSR),
a G-protein-coupled receptor present in nerve terminals, by several specific agonists
increased spontaneous glutamate release. The frequency of spontaneous synaptic
transmission was decreased in CaSR mutant neurons. The concentration-effect relationship
for extracellular calcium regulation of spontaneous release was well described
by a combination of CaSR-dependent and CaSR-independent mechanisms. Overall these
results indicate that extracellular Ca2+ does not trigger spontaneous glutamate
release by simply increasing calcium influx but stimulates CaSR and thereby promotes
resting spontaneous glutamate release. '
author:
- first_name: Nicholas
full_name: Vyleta, Nicholas
id: 36C4978E-F248-11E8-B48F-1D18A9856A87
last_name: Vyleta
- first_name: Stephen
full_name: Smith, Stephen
last_name: Smith
citation:
ama: Vyleta N, Smith S. Spontaneous glutamate release is independent of calcium
influx and tonically activated by the calcium-sensing receptor. European Journal
of Neuroscience. 2011;31(12):4593-4606. doi:10.1523/JNEUROSCI.6398-10.2011
apa: Vyleta, N., & Smith, S. (2011). Spontaneous glutamate release is independent
of calcium influx and tonically activated by the calcium-sensing receptor. European
Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1523/JNEUROSCI.6398-10.2011
chicago: Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is
Independent of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.”
European Journal of Neuroscience. Wiley-Blackwell, 2011. https://doi.org/10.1523/JNEUROSCI.6398-10.2011.
ieee: N. Vyleta and S. Smith, “Spontaneous glutamate release is independent of calcium
influx and tonically activated by the calcium-sensing receptor,” European Journal
of Neuroscience, vol. 31, no. 12. Wiley-Blackwell, pp. 4593–4606, 2011.
ista: Vyleta N, Smith S. 2011. Spontaneous glutamate release is independent of calcium
influx and tonically activated by the calcium-sensing receptor. European Journal
of Neuroscience. 31(12), 4593–4606.
mla: Vyleta, Nicholas, and Stephen Smith. “Spontaneous Glutamate Release Is Independent
of Calcium Influx and Tonically Activated by the Calcium-Sensing Receptor.” European
Journal of Neuroscience, vol. 31, no. 12, Wiley-Blackwell, 2011, pp. 4593–606,
doi:10.1523/JNEUROSCI.6398-10.2011.
short: N. Vyleta, S. Smith, European Journal of Neuroscience 31 (2011) 4593–4606.
date_created: 2018-12-11T11:46:39Z
date_published: 2011-03-23T00:00:00Z
date_updated: 2021-01-12T08:00:49Z
day: '23'
department:
- _id: PeJo
doi: 10.1523/JNEUROSCI.6398-10.2011
intvolume: ' 31'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3097128/
month: '03'
oa: 1
oa_version: Submitted Version
page: 4593 - 4606
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7353'
quality_controlled: '1'
scopus_import: 1
status: public
title: Spontaneous glutamate release is independent of calcium influx and tonically
activated by the calcium-sensing receptor
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2011'
...
---
_id: '490'
abstract:
- lang: eng
text: 'BioSig is an open source software library for biomedical signal processing.
The aim of the BioSig project is to foster research in biomedical signal processing
by providing free and open source software tools for many different application
areas. Some of the areas where BioSig can be employed are neuroinformatics, brain-computer
interfaces, neurophysiology, psychology, cardiovascular systems, and sleep research.
Moreover, the analysis of biosignals such as the electroencephalogram (EEG), electrocorticogram
(ECoG), electrocardiogram (ECG), electrooculogram (EOG), electromyogram (EMG),
or respiration signals is a very relevant element of the BioSig project. Specifically,
BioSig provides solutions for data acquisition, artifact processing, quality control,
feature extraction, classification, modeling, and data visualization, to name
a few. In this paper, we highlight several methods to help students and researchers
to work more efficiently with biomedical signals. '
article_number: '935364'
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- first_name: Carmen
full_name: Vidaurre, Carmen
last_name: Vidaurre
- first_name: Tilmann
full_name: Sander, Tilmann
last_name: Sander
citation:
ama: 'Schlögl A, Vidaurre C, Sander T. BioSig: The free and open source software
library for biomedical signal processing. Computational Intelligence and Neuroscience.
2011;2011. doi:10.1155/2011/935364'
apa: 'Schlögl, A., Vidaurre, C., & Sander, T. (2011). BioSig: The free and open
source software library for biomedical signal processing. Computational Intelligence
and Neuroscience. Hindawi Publishing Corporation. https://doi.org/10.1155/2011/935364'
chicago: 'Schlögl, Alois, Carmen Vidaurre, and Tilmann Sander. “BioSig: The Free
and Open Source Software Library for Biomedical Signal Processing.” Computational
Intelligence and Neuroscience. Hindawi Publishing Corporation, 2011. https://doi.org/10.1155/2011/935364.'
ieee: 'A. Schlögl, C. Vidaurre, and T. Sander, “BioSig: The free and open source
software library for biomedical signal processing,” Computational Intelligence
and Neuroscience, vol. 2011. Hindawi Publishing Corporation, 2011.'
ista: 'Schlögl A, Vidaurre C, Sander T. 2011. BioSig: The free and open source software
library for biomedical signal processing. Computational Intelligence and Neuroscience.
2011, 935364.'
mla: 'Schlögl, Alois, et al. “BioSig: The Free and Open Source Software Library
for Biomedical Signal Processing.” Computational Intelligence and Neuroscience,
vol. 2011, 935364, Hindawi Publishing Corporation, 2011, doi:10.1155/2011/935364.'
short: A. Schlögl, C. Vidaurre, T. Sander, Computational Intelligence and Neuroscience
2011 (2011).
date_created: 2018-12-11T11:46:45Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T08:01:02Z
day: '01'
ddc:
- '005'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.1155/2011/935364
file:
- access_level: open_access
checksum: 8263bbf255171f2054f43f3db5f53b6e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:44Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4642'
file_name: IST-2018-947-v1+1_2011_Schloegl_BioSig.pdf
file_size: 2863551
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 2011'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
oa: 1
oa_version: Published Version
publication: Computational Intelligence and Neuroscience
publication_status: published
publisher: Hindawi Publishing Corporation
publist_id: '7330'
pubrep_id: '947'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'BioSig: The free and open source software library for biomedical signal processing'
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 2011
year: '2011'
...
---
_id: '491'
abstract:
- lang: eng
text: In their search for antigens, lymphocytes continuously shuttle among blood
vessels, lymph vessels, and lymphatic tissues. Chemokines mediate entry of lymphocytes
into lymphatic tissues, and sphingosine 1-phosphate (S1P) promotes localization
of lymphocytes to the vasculature. Both signals are sensed through G protein-coupled
receptors (GPCRs). Most GPCRs undergo ligand-dependent homologous receptor desensitization,
a process that decreases their signaling output after previous exposure to high
ligand concentration. Such desensitization can explain why lymphocytes do not
take an intermediate position between two signals but rather oscillate between
them. The desensitization of S1P receptor 1 (S1PR1) is mediated by GPCR kinase
2 (GRK2). Deletion of GRK2 in lymphocytes compromises desensitization by high
vascular S1P concentrations, thereby reducing responsiveness to the chemokine
signal and trapping the cells in the vascular compartment. The desensitization
kinetics of S1PR1 allows lymphocytes to dynamically shuttle between vasculature
and lymphatic tissue, although the positional information in both compartments
is static.
article_number: pe43
author:
- first_name: Alexander
full_name: Eichner, Alexander
id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
last_name: Eichner
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Eichner A, Sixt MK. Setting the clock for recirculating lymphocytes. Science
Signaling. 2011;4(198). doi:10.1126/scisignal.2002617
apa: Eichner, A., & Sixt, M. K. (2011). Setting the clock for recirculating
lymphocytes. Science Signaling. American Association for the Advancement
of Science. https://doi.org/10.1126/scisignal.2002617
chicago: Eichner, Alexander, and Michael K Sixt. “Setting the Clock for Recirculating
Lymphocytes.” Science Signaling. American Association for the Advancement
of Science, 2011. https://doi.org/10.1126/scisignal.2002617.
ieee: A. Eichner and M. K. Sixt, “Setting the clock for recirculating lymphocytes,”
Science Signaling, vol. 4, no. 198. American Association for the Advancement
of Science, 2011.
ista: Eichner A, Sixt MK. 2011. Setting the clock for recirculating lymphocytes.
Science Signaling. 4(198), pe43.
mla: Eichner, Alexander, and Michael K. Sixt. “Setting the Clock for Recirculating
Lymphocytes.” Science Signaling, vol. 4, no. 198, pe43, American Association
for the Advancement of Science, 2011, doi:10.1126/scisignal.2002617.
short: A. Eichner, M.K. Sixt, Science Signaling 4 (2011).
date_created: 2018-12-11T11:46:46Z
date_published: 2011-11-08T00:00:00Z
date_updated: 2021-01-12T08:01:02Z
day: '08'
department:
- _id: MiSi
doi: 10.1126/scisignal.2002617
intvolume: ' 4'
issue: '198'
language:
- iso: eng
month: '11'
oa_version: None
publication: Science Signaling
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7329'
quality_controlled: '1'
scopus_import: 1
status: public
title: Setting the clock for recirculating lymphocytes
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2011'
...
---
_id: '518'
abstract:
- lang: eng
text: Cancer stem cells or cancer initiating cells are believed to contribute to
cancer recurrence after therapy. MicroRNAs (miRNAs) are short RNA molecules with
fundamental roles in gene regulation. The role of miRNAs in cancer stem cells
is only poorly understood. Here, we report miRNA expression profiles of glioblastoma
stem cell-containing CD133 + cell populations. We find that miR-9, miR-9 * (referred
to as miR-9/9 *), miR-17 and miR-106b are highly abundant in CD133 + cells. Furthermore,
inhibition of miR-9/9 * or miR-17 leads to reduced neurosphere formation and stimulates
cell differentiation. Calmodulin-binding transcription activator 1 (CAMTA1) is
a putative transcription factor, which induces the expression of the anti-proliferative
cardiac hormone natriuretic peptide A (NPPA). We identify CAMTA1 as an miR-9/9
* and miR-17 target. CAMTA1 expression leads to reduced neurosphere formation
and tumour growth in nude mice, suggesting that CAMTA1 can function as tumour
suppressor. Consistently, CAMTA1 and NPPA expression correlate with patient survival.
Our findings could provide a basis for novel strategies of glioblastoma therapy.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Schraivogel, Daniel
last_name: Schraivogel
- first_name: Lasse
full_name: Weinmann, Lasse
last_name: Weinmann
- first_name: Dagmar
full_name: Beier, Dagmar
last_name: Beier
- first_name: Ghazaleh
full_name: Tabatabai, Ghazaleh
last_name: Tabatabai
- first_name: Alexander
full_name: Eichner, Alexander
id: 4DFA52AE-F248-11E8-B48F-1D18A9856A87
last_name: Eichner
- first_name: Jia
full_name: Zhu, Jia
last_name: Zhu
- first_name: Martina
full_name: Anton, Martina
last_name: Anton
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Michael
full_name: Weller, Michael
last_name: Weller
- first_name: Christoph
full_name: Beier, Christoph
last_name: Beier
- first_name: Gunter
full_name: Meister, Gunter
last_name: Meister
citation:
ama: Schraivogel D, Weinmann L, Beier D, et al. CAMTA1 is a novel tumour suppressor
regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 2011;30(20):4309-4322.
doi:10.1038/emboj.2011.301
apa: Schraivogel, D., Weinmann, L., Beier, D., Tabatabai, G., Eichner, A., Zhu,
J., … Meister, G. (2011). CAMTA1 is a novel tumour suppressor regulated by miR-9/9
* in glioblastoma stem cells. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2011.301
chicago: Schraivogel, Daniel, Lasse Weinmann, Dagmar Beier, Ghazaleh Tabatabai,
Alexander Eichner, Jia Zhu, Martina Anton, et al. “CAMTA1 Is a Novel Tumour Suppressor
Regulated by MiR-9/9 * in Glioblastoma Stem Cells.” EMBO Journal. Wiley-Blackwell,
2011. https://doi.org/10.1038/emboj.2011.301.
ieee: D. Schraivogel et al., “CAMTA1 is a novel tumour suppressor regulated
by miR-9/9 * in glioblastoma stem cells,” EMBO Journal, vol. 30, no. 20.
Wiley-Blackwell, pp. 4309–4322, 2011.
ista: Schraivogel D, Weinmann L, Beier D, Tabatabai G, Eichner A, Zhu J, Anton M,
Sixt MK, Weller M, Beier C, Meister G. 2011. CAMTA1 is a novel tumour suppressor
regulated by miR-9/9 * in glioblastoma stem cells. EMBO Journal. 30(20), 4309–4322.
mla: Schraivogel, Daniel, et al. “CAMTA1 Is a Novel Tumour Suppressor Regulated
by MiR-9/9 * in Glioblastoma Stem Cells.” EMBO Journal, vol. 30, no. 20,
Wiley-Blackwell, 2011, pp. 4309–22, doi:10.1038/emboj.2011.301.
short: D. Schraivogel, L. Weinmann, D. Beier, G. Tabatabai, A. Eichner, J. Zhu,
M. Anton, M.K. Sixt, M. Weller, C. Beier, G. Meister, EMBO Journal 30 (2011) 4309–4322.
date_created: 2018-12-11T11:46:55Z
date_published: 2011-10-19T00:00:00Z
date_updated: 2021-01-12T08:01:19Z
day: '19'
department:
- _id: MiSi
doi: 10.1038/emboj.2011.301
external_id:
pmid:
- '21857646'
intvolume: ' 30'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3199389/
month: '10'
oa: 1
oa_version: Submitted Version
page: 4309 - 4322
pmid: 1
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '7301'
quality_controlled: '1'
scopus_import: 1
status: public
title: CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma
stem cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2011'
...
---
_id: '531'
abstract:
- lang: eng
text: Software transactional memories (STM) are described in the literature with
assumptions of sequentially consistent program execution and atomicity of high
level operations like read, write, and abort. However, in a realistic setting,
processors use relaxed memory models to optimize hardware performance. Moreover,
the atomicity of operations depends on the underlying hardware. This paper presents
the first approach to verify STMs under relaxed memory models with atomicity of
32 bit loads and stores, and read-modify-write operations. We describe RML, a
simple language for expressing concurrent programs. We develop a semantics of
RML parametrized by a relaxed memory model. We then present our tool, FOIL, which
takes as input the RML description of an STM algorithm restricted to two threads
and two variables, and the description of a memory model, and automatically determines
the locations of fences, which if inserted, ensure the correctness of the restricted
STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and
McRT STM under the memory models of sequential consistency, total store order,
partial store order, and relaxed memory order for two threads and two variables.
Finally, we extend the verification results for DSTM and TL2 to an arbitrary number
of threads and variables by manually proving that the structural properties of
STMs are satisfied at the hardware level of atomicity under the considered relaxed
memory models.
article_processing_charge: No
article_type: original
author:
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- 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: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: Guerraoui R, Henzinger TA, Singh V. Verification of STM on relaxed memory models.
Formal Methods in System Design. 2011;39(3):297-331. doi:10.1007/s10703-011-0131-3
apa: Guerraoui, R., Henzinger, T. A., & Singh, V. (2011). Verification of STM
on relaxed memory models. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-011-0131-3
chicago: Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of
STM on Relaxed Memory Models.” Formal Methods in System Design. Springer,
2011. https://doi.org/10.1007/s10703-011-0131-3.
ieee: R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed
memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer,
pp. 297–331, 2011.
ista: Guerraoui R, Henzinger TA, Singh V. 2011. Verification of STM on relaxed memory
models. Formal Methods in System Design. 39(3), 297–331.
mla: Guerraoui, Rachid, et al. “Verification of STM on Relaxed Memory Models.” Formal
Methods in System Design, vol. 39, no. 3, Springer, 2011, pp. 297–331, doi:10.1007/s10703-011-0131-3.
short: R. Guerraoui, T.A. Henzinger, V. Singh, Formal Methods in System Design 39
(2011) 297–331.
date_created: 2018-12-11T11:47:00Z
date_published: 2011-12-01T00:00:00Z
date_updated: 2021-01-12T08:01:27Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s10703-011-0131-3
intvolume: ' 39'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://infoscience.epfl.ch/record/178042/files/art3A10.10072Fs10703-011-0131-3.pdf
month: '12'
oa: 1
oa_version: Published Version
page: 297 - 331
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '7288'
quality_controlled: '1'
scopus_import: 1
status: public
title: Verification of STM on relaxed memory models
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2011'
...
---
_id: '5379'
abstract:
- lang: eng
text: Computing the winning set for Büchi objectives in alternating games on graphs
is a central problem in computer aided verification with a large number of applications.
The long standing best known upper bound for solving the problem is ̃O(n·m), where
n is the number of vertices and m is the number of edges in the graph. We are
the first to break the ̃O(n·m) boundary by presenting a new technique that reduces
the running time to O(n2). This bound also leads to O(n2) time algorithms for
computing the set of almost-sure winning vertices for Büchi objectives (1) in
alternating games with probabilistic transitions (improving an earlier bound of
O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier
bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3
an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique
can be used to compute the maximal end-component decomposition of a graph in time
O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show
how to maintain the winning set for Büchi objectives in alternating games under
a sequence of edge insertions or a sequence of edge deletions in O(n) amortized
time per operation. This is the first dynamic algorithm for this problem.
alternative_title:
- IST Austria Technical Report
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: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Chatterjee K, Henzinger MH. An O(N2) Time Algorithm for Alternating Büchi
Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0009
apa: Chatterjee, K., & Henzinger, M. H. (2011). An O(n2) time algorithm for
alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009
chicago: Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm
for Alternating Büchi Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0009.
ieee: K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating
Büchi games. IST Austria, 2011.
ista: Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating
Büchi games, IST Austria, 20p.
mla: Chatterjee, Krishnendu, and Monika H. Henzinger. An O(N2) Time Algorithm
for Alternating Büchi Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0009.
short: K. Chatterjee, M.H. Henzinger, An O(N2) Time Algorithm for Alternating Büchi
Games, IST Austria, 2011.
date_created: 2018-12-12T11:38:59Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2023-02-23T11:15:12Z
day: '11'
ddc:
- '000'
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0009
file:
- access_level: open_access
checksum: 0b354264229045d982332fd2cb5b9a26
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:43Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5504'
file_name: IST-2011-0009_IST-2011-0009.pdf
file_size: 388665
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '15'
related_material:
record:
- id: '3165'
relation: later_version
status: public
status: public
title: An O(n2) time algorithm for alternating Büchi games
type: technical_report
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2011'
...
---
_id: '5380'
abstract:
- lang: eng
text: 'We consider 2-player games played on a finite state space for an infinite
number of rounds. The games are concurrent: in each round, the two players (player
1 and player 2) choose their moves independently and simultaneously; the current
state and the two moves determine the successor state. We study concurrent games
with ω-regular winning conditions specified as parity objectives. We consider
the qualitative analysis problems: the computation of the almost-sure and limit-sure
winning set of states, where player 1 can ensure to win with probability 1 and
with probability arbitrarily close to 1, respectively. In general the almost-sure
and limit-sure winning strategies require both infinite-memory as well as infinite-precision
(to describe probabilities). We study the bounded-rationality problem for qualitative
analysis of concurrent parity games, where the strategy set for player 1 is restricted
to bounded-resource strategies. In terms of precision, strategies can be deterministic,
uniform, finite-precision or infinite-precision; and in terms of memory, strategies
can be memoryless, finite-memory or infinite-memory. We present a precise and
complete characterization of the qualitative winning sets for all combinations
of classes of strategies. In particular, we show that uniform memoryless strategies
are as powerful as finite-precision infinite-memory strategies, and infinite-precision
memoryless strategies are as powerful as infinite-precision finite-memory strategies. We
show that the winning sets can be computed in O(n2d+3) time, where n is the size
of the game structure and 2d is the number of priorities (or colors), and our
algorithms are symbolic. The membership problem of whether a state belongs to
a winning set can be decided in NP ∩ coNP. While this complexity is the same as
for the simpler class of turn-based parity games, where in each state only one
of the two players has a choice of moves, our algorithms,that are obtained by
characterization of the winning sets as μ-calculus formulas, are considerably
more involved than those for turn-based games.'
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
citation:
ama: Chatterjee K. Bounded Rationality in Concurrent Parity Games. IST Austria;
2011. doi:10.15479/AT:IST-2011-0008
apa: Chatterjee, K. (2011). Bounded rationality in concurrent parity games.
IST Austria. https://doi.org/10.15479/AT:IST-2011-0008
chicago: Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games.
IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0008.
ieee: K. Chatterjee, Bounded rationality in concurrent parity games. IST
Austria, 2011.
ista: Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria,
53p.
mla: Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games.
IST Austria, 2011, doi:10.15479/AT:IST-2011-0008.
short: K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria,
2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-11T00:00:00Z
date_updated: 2023-02-23T11:22:53Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0008
file:
- access_level: open_access
checksum: 0fd38186409be819a911c4990fa79d1f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:22Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5544'
file_name: IST-2011-0008_IST-2011-0008.pdf
file_size: 500399
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '53'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '16'
related_material:
record:
- id: '3338'
relation: later_version
status: public
status: public
title: Bounded rationality in concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5381'
abstract:
- lang: eng
text: "In two-player finite-state stochastic games of partial obser- vation on graphs,
in every state of the graph, the players simultaneously choose an action, and
their joint actions determine a probability distri- bution over the successor
states. The game is played for infinitely many rounds and thus the players construct
an infinite path in the graph. We consider reachability objectives where the first
player tries to ensure a target state to be visited almost-surely (i.e., with
probability 1) or pos- itively (i.e., with positive probability), no matter the
strategy of the second player.\r\n\r\nWe classify such games according to the
information and to the power of randomization available to the players. On the
basis of information, the game can be one-sided with either (a) player 1, or (b)
player 2 having partial observation (and the other player has perfect observation),
or two- sided with (c) both players having partial observation. On the basis of
randomization, (a) the players may not be allowed to use randomization (pure strategies),
or (b) they may choose a probability distribution over actions but the actual
random choice is external and not visible to the player (actions invisible), or
(c) they may use full randomization.\r\n\r\nOur main results for pure strategies
are as follows: (1) For one-sided games with player 2 perfect observation we show
that (in contrast to full randomized strategies) belief-based (subset-construction
based) strate- gies are not sufficient, and present an exponential upper bound
on mem- ory both for almost-sure and positive winning strategies; we show that
the problem of deciding the existence of almost-sure and positive winning strategies
for player 1 is EXPTIME-complete and present symbolic algo- rithms that avoid
the explicit exponential construction. (2) For one-sided games with player 1 perfect
observation we show that non-elementary memory is both necessary and sufficient
for both almost-sure and posi- tive winning strategies. (3) We show that for the
general (two-sided) case finite-memory strategies are sufficient for both positive
and almost-sure winning, and at least non-elementary memory is required. We establish
the equivalence of the almost-sure winning problems for pure strategies and for
randomized strategies with actions invisible. Our equivalence re- sult exhibit
serious flaws in previous results in the literature: we show a non-elementary
memory lower bound for almost-sure winning whereas an exponential upper bound
was previously claimed."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win
When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007'
apa: 'Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic
games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007'
chicago: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0007.'
ieee: 'K. Chatterjee and L. Doyen, Partial-observation stochastic games: How
to win when belief fails. IST Austria, 2011.'
ista: 'Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to
win when belief fails, IST Austria, 43p.'
mla: 'Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic
Games: How to Win When Belief Fails. IST Austria, 2011, doi:10.15479/AT:IST-2011-0007.'
short: 'K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win
When Belief Fails, IST Austria, 2011.'
date_created: 2018-12-12T11:39:00Z
date_published: 2011-07-05T00:00:00Z
date_updated: 2023-02-23T11:05:48Z
day: '05'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0007
file:
- access_level: open_access
checksum: 06bf6dfc97f6006e3fd0e9a3f31bc961
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:27Z
date_updated: 2020-07-14T12:46:39Z
file_id: '5488'
file_name: IST-2011-0007_IST-2011-0007.pdf
file_size: 574055
relation: main_file
file_date_updated: 2020-07-14T12:46:39Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '43'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '17'
related_material:
record:
- id: '1903'
relation: later_version
status: public
- id: '2211'
relation: later_version
status: public
- id: '2955'
relation: later_version
status: public
status: public
title: 'Partial-observation stochastic games: How to win when belief fails'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5382'
abstract:
- lang: eng
text: 'We consider two-player stochastic games played on a finite state space for
an infinite num- ber of rounds. The games are concurrent: in each round, the two
players (player 1 and player 2) choose their moves independently and simultaneously;
the current state and the two moves determine a probability distribution over
the successor states. We also consider the important special case of turn-based
stochastic games where players make moves in turns, rather than concurrently.
We study concurrent games with ω-regular winning conditions specified as parity
objectives. The value for player 1 for a parity objective is the maximal probability
with which the player can guarantee the satisfaction of the objective against
all strategies of the opponent. We study the problem of continuity and robustness
of the value function in concurrent and turn-based stochastic parity games with
respect to imprecision in the transition probabilities. We present quantitative
bounds on the difference of the value function (in terms of the imprecision of
the transition probabilities) and show the value continuity for structurally equivalent
concurrent games (two games are structurally equivalent if the support of the
transition func- tion is same and the probabilities differ). We also show robustness
of optimal strategies for structurally equivalent turn-based stochastic parity
games. Finally we show that the value continuity property breaks without the structurally
equivalent assumption (even for Markov chains) and show that our quantitative
bound is asymptotically optimal. Hence our results are tight (the assumption is
both necessary and sufficient) and optimal (our quantitative bound is asymptotically
optimal).'
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
citation:
ama: Chatterjee K. Robustness of Structurally Equivalent Concurrent Parity Games.
IST Austria; 2011. doi:10.15479/AT:IST-2011-0006
apa: Chatterjee, K. (2011). Robustness of structurally equivalent concurrent
parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
chicago: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0006.
ieee: K. Chatterjee, Robustness of structurally equivalent concurrent parity
games. IST Austria, 2011.
ista: Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity
games, IST Austria, 18p.
mla: Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent
Parity Games. IST Austria, 2011, doi:10.15479/AT:IST-2011-0006.
short: K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games,
IST Austria, 2011.
date_created: 2018-12-12T11:39:00Z
date_published: 2011-06-27T00:00:00Z
date_updated: 2023-02-23T11:23:01Z
day: '27'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0006
file:
- access_level: open_access
checksum: 1322b652d6ab07eb5248298a3f91c1cf
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:24Z
date_updated: 2020-07-14T12:46:40Z
file_id: '5546'
file_name: IST-2011-0006_IST-2011-0006.pdf
file_size: 335997
relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '18'
related_material:
record:
- id: '3341'
relation: later_version
status: public
status: public
title: Robustness of structurally equivalent concurrent parity games
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5383'
abstract:
- lang: eng
text: We present a new decidable logic called TREX for expressing constraints about
imperative tree data structures. In particular, TREX supports a transitive closure
operator that can express reachability constraints, which often appear in data
structure invariants. We show that our logic is closed under weakest precondition
computation, which enables its use for automated software verification. We further
show that satisfiability of formulas in TREX is decidable in NP. The low complexity
makes it an attractive alternative to more expensive logics such as monadic second-order
logic (MSOL) over trees, which have been traditionally used for reasoning about
tree data structures.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Marco
full_name: Muñiz, Marco
last_name: Muñiz
- first_name: Viktor
full_name: Kuncak, Viktor
last_name: Kuncak
citation:
ama: Wies T, Muñiz M, Kuncak V. On an Efficient Decision Procedure for Imperative
Tree Data Structures. IST Austria; 2011. doi:10.15479/AT:IST-2011-0005
apa: Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure
for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005
chicago: Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision
Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.
ieee: T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for
imperative tree data structures. IST Austria, 2011.
ista: Wies T, Muñiz M, Kuncak V. 2011. On an efficient decision procedure for imperative
tree data structures, IST Austria, 25p.
mla: Wies, Thomas, et al. On an Efficient Decision Procedure for Imperative Tree
Data Structures. IST Austria, 2011, doi:10.15479/AT:IST-2011-0005.
short: T. Wies, M. Muñiz, V. Kuncak, On an Efficient Decision Procedure for Imperative
Tree Data Structures, IST Austria, 2011.
date_created: 2018-12-12T11:39:01Z
date_published: 2011-04-26T00:00:00Z
date_updated: 2023-02-23T11:22:16Z
day: '26'
ddc:
- '000'
- '006'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2011-0005
file:
- access_level: open_access
checksum: b20029184c4a819c5f4466a4a3d238b5
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:01Z
date_updated: 2020-07-14T12:46:40Z
file_id: '5462'
file_name: IST-2011-0005_IST-2011-0005.pdf
file_size: 619053
relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '19'
related_material:
record:
- id: '3323'
relation: later_version
status: public
status: public
title: On an efficient decision procedure for imperative tree data structures
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '5384'
abstract:
- lang: eng
text: 'We consider probabilistic automata on infinite words with acceptance defined
by parity conditions. We consider three qualitative decision problems: (i) the
positive decision problem asks whether there is a word that is accepted with positive
probability; (ii) the almost decision problem asks whether there is a word that
is accepted with probability 1; and (iii) the limit decision problem asks whether
for every ε > 0 there is a word that is accepted with probability at least 1 −
ε. We unify and generalize several decidability results for probabilistic automata
over infinite words, and identify a robust (closed under union and intersection)
subclass of probabilistic automata for which all the qualitative decision problems
are decidable for parity conditions. We also show that if the input words are
restricted to lasso shape words, then the positive and almost problems are decidable
for all probabilistic automata with parity conditions.'
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: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Tracol M. Decidable Problems for Probabilistic Automata on
Infinite Words. IST Austria; 2011. doi:10.15479/AT:IST-2011-0004
apa: Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic
automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
chicago: Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic
Automata on Infinite Words. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0004.
ieee: K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata
on infinite words. IST Austria, 2011.
ista: Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata
on infinite words, IST Austria, 30p.
mla: Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic
Automata on Infinite Words. IST Austria, 2011, doi:10.15479/AT:IST-2011-0004.
short: K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on
Infinite Words, IST Austria, 2011.
date_created: 2018-12-12T11:39:01Z
date_published: 2011-04-11T00:00:00Z
date_updated: 2023-02-23T11:05:53Z
day: '11'
ddc:
- '000'
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2011-0004
file:
- access_level: open_access
checksum: f5a0f664fadc335990f5fcf138df19f1
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:23Z
date_updated: 2020-07-14T12:46:40Z
file_id: '5545'
file_name: IST-2011-004_IST-2011-0004.pdf
file_size: 570827
relation: main_file
file_date_updated: 2020-07-14T12:46:40Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '30'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '20'
related_material:
record:
- id: '2957'
relation: later_version
status: public
status: public
title: Decidable problems for probabilistic automata on infinite words
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...