---
_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: '3146'
abstract:
- lang: eng
text: 'Coordinated migration of newly born neurons to their prospective target laminae
is a prerequisite for neural circuit assembly in the developing brain. The evolutionarily
conserved LIS1/NDEL1 complex is essential for neuronal migration in the mammalian
cerebral cortex. The cytoplasmic nature of LIS1 and NDEL1 proteins suggest that
they regulate neuronal migration cell autonomously. Here, we extend mosaic analysis
with double markers (MADM) to mouse chromosome 11 where Lis1, Ndel1, and 14-3-3e{open}
(encoding a LIS1/NDEL1 signaling partner) are located. Analyses of sparse and
uniquely labeled mutant cells in mosaic animals reveal distinct cell-autonomous
functions for these three genes. Lis1 regulates neuronal migration efficiency
in a dose-dependent manner, while Ndel1 is essential for a specific, previously
uncharacterized, late step of neuronal migration: entry into the target lamina.
Comparisons with previous genetic perturbations of Lis1 and Ndel1 also suggest
a surprising degree of cell-nonautonomous function for these proteins in regulating
neuronal migration.'
author:
- first_name: Simon
full_name: Simon Hippenmeyer
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Yong
full_name: Youn, Yong H
last_name: Youn
- first_name: Hyang
full_name: Moon, Hyang M
last_name: Moon
- first_name: Kazunari
full_name: Miyamichi, Kazunari
last_name: Miyamichi
- first_name: Hui
full_name: Zong, Hui
last_name: Zong
- first_name: Anthony
full_name: Wynshaw-Boris, Anthony
last_name: Wynshaw Boris
- first_name: Liqun
full_name: Luo, Liqun
last_name: Luo
citation:
ama: Hippenmeyer S, Youn Y, Moon H, et al. Genetic mosaic dissection of Lis1 and
Ndel1 in neuronal migration. Neuron. 2010;68(4):695-709. doi:10.1016/j.neuron.2010.09.027
apa: Hippenmeyer, S., Youn, Y., Moon, H., Miyamichi, K., Zong, H., Wynshaw Boris,
A., & Luo, L. (2010). Genetic mosaic dissection of Lis1 and Ndel1 in neuronal
migration. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2010.09.027
chicago: Hippenmeyer, Simon, Yong Youn, Hyang Moon, Kazunari Miyamichi, Hui Zong,
Anthony Wynshaw Boris, and Liqun Luo. “Genetic Mosaic Dissection of Lis1 and Ndel1
in Neuronal Migration.” Neuron. Elsevier, 2010. https://doi.org/10.1016/j.neuron.2010.09.027.
ieee: S. Hippenmeyer et al., “Genetic mosaic dissection of Lis1 and Ndel1
in neuronal migration,” Neuron, vol. 68, no. 4. Elsevier, pp. 695–709,
2010.
ista: Hippenmeyer S, Youn Y, Moon H, Miyamichi K, Zong H, Wynshaw Boris A, Luo L.
2010. Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration. Neuron.
68(4), 695–709.
mla: Hippenmeyer, Simon, et al. “Genetic Mosaic Dissection of Lis1 and Ndel1 in
Neuronal Migration.” Neuron, vol. 68, no. 4, Elsevier, 2010, pp. 695–709,
doi:10.1016/j.neuron.2010.09.027.
short: S. Hippenmeyer, Y. Youn, H. Moon, K. Miyamichi, H. Zong, A. Wynshaw Boris,
L. Luo, Neuron 68 (2010) 695–709.
date_created: 2018-12-11T12:01:39Z
date_published: 2010-11-18T00:00:00Z
date_updated: 2021-01-12T07:41:22Z
day: '18'
doi: 10.1016/j.neuron.2010.09.027
extern: 1
intvolume: ' 68'
issue: '4'
month: '11'
page: 695 - 709
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '3550'
quality_controlled: 0
status: public
title: Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration
type: journal_article
volume: 68
year: '2010'
...
---
_id: '3153'
abstract:
- lang: eng
text: Human immune cells have to penetrate an endothelial barrier during their beneficial
pursuit of infection and their destructive infiltration of tissues in autoimmune
diseases. This transmigration requires Rap1 GTPase to activate integrin affinity.
We define a new model system for this process by demonstrating, with live imaging
and genetics, that during embryonic development Drosophila melanogaster immune
cells penetrate an epithelial, Drosophila E-cadherin (DE-cadherin)-based tissue
barrier. A mutant in RhoL, a GTPase homologue that is specifically expressed in
haemocytes, blocks this invasive step but not other aspects of guided migration.
RhoL mediates integrin adhesion caused by Drosophila Rap1 overexpression and moves
Rap1 away from a concentration in the cytoplasm to the leading edge during invasive
migration. These findings indicate that a programmed migratory step during Drosophila
development bears striking molecular similarities to vertebrate immune cell transmigration
during inflammation, and identify RhoL as a new regulator of invasion, adhesion
and Rap1 localization. Our work establishes the utility of Drosophila for identifying
novel components of immune cell transmigration and for understanding the in vivo
interplay of immune cells with the barriers they penetrate.
author:
- first_name: Daria E
full_name: Daria Siekhaus
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Martin
full_name: Haesemeyer, Martin
last_name: Haesemeyer
- first_name: Olivia
full_name: Moffitt, Olivia
last_name: Moffitt
- first_name: Ruth
full_name: Lehmann, Ruth
last_name: Lehmann
citation:
ama: Siekhaus DE, Haesemeyer M, Moffitt O, Lehmann R. RhoL controls invasion and
Rap1 localization during immune cell transmigration in Drosophila. Nature Cell
Biology. 2010;12(6):605-610.
apa: Siekhaus, D. E., Haesemeyer, M., Moffitt, O., & Lehmann, R. (2010). RhoL
controls invasion and Rap1 localization during immune cell transmigration in Drosophila.
Nature Cell Biology. Nature Publishing Group.
chicago: Siekhaus, Daria E, Martin Haesemeyer, Olivia Moffitt, and Ruth Lehmann.
“RhoL Controls Invasion and Rap1 Localization during Immune Cell Transmigration
in Drosophila.” Nature Cell Biology. Nature Publishing Group, 2010.
ieee: D. E. Siekhaus, M. Haesemeyer, O. Moffitt, and R. Lehmann, “RhoL controls
invasion and Rap1 localization during immune cell transmigration in Drosophila,”
Nature Cell Biology, vol. 12, no. 6. Nature Publishing Group, pp. 605–610,
2010.
ista: Siekhaus DE, Haesemeyer M, Moffitt O, Lehmann R. 2010. RhoL controls invasion
and Rap1 localization during immune cell transmigration in Drosophila. Nature
Cell Biology. 12(6), 605–610.
mla: Siekhaus, Daria E., et al. “RhoL Controls Invasion and Rap1 Localization during
Immune Cell Transmigration in Drosophila.” Nature Cell Biology, vol. 12,
no. 6, Nature Publishing Group, 2010, pp. 605–10.
short: D.E. Siekhaus, M. Haesemeyer, O. Moffitt, R. Lehmann, Nature Cell Biology
12 (2010) 605–610.
date_created: 2018-12-11T12:01:42Z
date_published: 2010-06-01T00:00:00Z
date_updated: 2021-01-12T07:41:25Z
day: '01'
extern: 1
intvolume: ' 12'
issue: '6'
main_file_link:
- open_access: '0'
url: 10.1038/ncb2063 PubMed
month: '06'
page: 605 - 610
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '3542'
quality_controlled: 0
status: public
title: RhoL controls invasion and Rap1 localization during immune cell transmigration
in Drosophila
type: journal_article
volume: 12
year: '2010'
...
---
_id: '3201'
abstract:
- lang: eng
text: 'The problem of cosegmentation consists of segmenting the same object (or
objects of the same class) in two or more distinct images. Recently a number of
different models have been proposed for this problem. However, no comparison of
such models and corresponding optimization techniques has been done so far. We
analyze three existing models: the L1 norm model of Rother et al. [1], the L2
norm model of Mukherjee et al. [2] and the "reward" model of Hochbaum
and Singh [3]. We also study a new model, which is a straightforward extension
of the Boykov-Jolly model for single image segmentation [4]. In terms of optimization,
we use a Dual Decomposition (DD) technique in addition to optimization methods
in [1,2]. Experiments show a significant improvement of DD over published methods.
Our main conclusion, however, is that the new model is the best overall because
it: (i) has fewest parameters; (ii) is most robust in practice, and (iii) can
be optimized well with an efficient EM-style procedure.'
alternative_title:
- LNCS
author:
- first_name: Sara
full_name: Vicente, Sara
last_name: Vicente
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Vicente S, Kolmogorov V, Rother C. Cosegmentation revisited: Models and optimization.
In: Vol 6312. Springer; 2010:465-479. doi:10.1007/978-3-642-15552-9_34'
apa: 'Vicente, S., Kolmogorov, V., & Rother, C. (2010). Cosegmentation revisited:
Models and optimization (Vol. 6312, pp. 465–479). Presented at the ECCV: European
Conference on Computer Vision, Springer. https://doi.org/10.1007/978-3-642-15552-9_34'
chicago: 'Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Cosegmentation
Revisited: Models and Optimization,” 6312:465–79. Springer, 2010. https://doi.org/10.1007/978-3-642-15552-9_34.'
ieee: 'S. Vicente, V. Kolmogorov, and C. Rother, “Cosegmentation revisited: Models
and optimization,” presented at the ECCV: European Conference on Computer Vision,
2010, vol. 6312, pp. 465–479.'
ista: 'Vicente S, Kolmogorov V, Rother C. 2010. Cosegmentation revisited: Models
and optimization. ECCV: European Conference on Computer Vision, LNCS, vol. 6312,
465–479.'
mla: 'Vicente, Sara, et al. Cosegmentation Revisited: Models and Optimization.
Vol. 6312, Springer, 2010, pp. 465–79, doi:10.1007/978-3-642-15552-9_34.'
short: S. Vicente, V. Kolmogorov, C. Rother, in:, Springer, 2010, pp. 465–479.
conference:
name: 'ECCV: European Conference on Computer Vision'
date_created: 2018-12-11T12:01:59Z
date_published: 2010-08-30T00:00:00Z
date_updated: 2021-01-12T07:41:46Z
day: '30'
doi: 10.1007/978-3-642-15552-9_34
extern: 1
intvolume: ' 6312'
main_file_link:
- open_access: '0'
url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.6803df
month: '08'
page: 465 - 479
publication_status: published
publisher: Springer
publist_id: '3479'
quality_controlled: 0
status: public
title: 'Cosegmentation revisited: Models and optimization'
type: conference
volume: 6312
year: '2010'
...
---
_id: '3202'
abstract:
- lang: eng
text: 'We consider the following problem: given an undirected weighted graph G =
(V,E,c) with nonnegative weights, minimize function c(δ(Π))- λ|Π| for all values
of parameter λ. Here Π is a partition of the set of nodes, the first term is the
cost of edges whose endpoints belong to different components of the partition,
and |Π| is the number of components. The current best known algorithm for this
problem has complexity O(|V| 2) maximum flow computations. We improve it to |V|
parametric maximum flow computations. We observe that the complexity can be improved
further for families of graphs which admit a good separator, e.g. for planar graphs.'
author:
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. A faster algorithm for computing the principal sequence of partitions
of a graph. Algorithmica. 2010;56(4):394-412. doi:10.1007/s00453-008-9177-z
apa: Kolmogorov, V. (2010). A faster algorithm for computing the principal sequence
of partitions of a graph. Algorithmica. Springer. https://doi.org/10.1007/s00453-008-9177-z
chicago: Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence
of Partitions of a Graph.” Algorithmica. Springer, 2010. https://doi.org/10.1007/s00453-008-9177-z.
ieee: V. Kolmogorov, “A faster algorithm for computing the principal sequence of
partitions of a graph,” Algorithmica, vol. 56, no. 4. Springer, pp. 394–412,
2010.
ista: Kolmogorov V. 2010. A faster algorithm for computing the principal sequence
of partitions of a graph. Algorithmica. 56(4), 394–412.
mla: Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence
of Partitions of a Graph.” Algorithmica, vol. 56, no. 4, Springer, 2010,
pp. 394–412, doi:10.1007/s00453-008-9177-z.
short: V. Kolmogorov, Algorithmica 56 (2010) 394–412.
date_created: 2018-12-11T12:01:59Z
date_published: 2010-04-01T00:00:00Z
date_updated: 2021-01-12T07:41:46Z
day: '01'
doi: 10.1007/s00453-008-9177-z
extern: 1
intvolume: ' 56'
issue: '4'
month: '04'
page: 394 - 412
publication: Algorithmica
publication_status: published
publisher: Springer
publist_id: '3480'
quality_controlled: 0
status: public
title: A faster algorithm for computing the principal sequence of partitions of a
graph
type: journal_article
volume: 56
year: '2010'
...
---
_id: '3233'
abstract:
- lang: eng
text: We present a general parallel-repetition theorem with an efficient reduction.
As a corollary of this theorem we establish that parallel repetition reduces the
soundness error at an exponential rate in any public-coin argument, and more generally,
any argument where the verifier's messages, but not necessarily its decision to
accept or reject, can be efficiently simulated with noticeable probability.
alternative_title:
- LNCS
author:
- first_name: Johan
full_name: Håstad, Johan
last_name: Håstad
- first_name: Rafael
full_name: Pass, Rafael
last_name: Pass
- first_name: Douglas
full_name: Wikström, Douglas
last_name: Wikström
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Håstad J, Pass R, Wikström D, Pietrzak KZ. An efficient parallel repetition
theorem. In: Vol 5978. Springer; 2010:1-18. doi:10.1007/978-3-642-11799-2_1'
apa: 'Håstad, J., Pass, R., Wikström, D., & Pietrzak, K. Z. (2010). An efficient
parallel repetition theorem (Vol. 5978, pp. 1–18). Presented at the TCC: Theory
of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-642-11799-2_1'
chicago: Håstad, Johan, Rafael Pass, Douglas Wikström, and Krzysztof Z Pietrzak.
“An Efficient Parallel Repetition Theorem,” 5978:1–18. Springer, 2010. https://doi.org/10.1007/978-3-642-11799-2_1.
ieee: 'J. Håstad, R. Pass, D. Wikström, and K. Z. Pietrzak, “An efficient parallel
repetition theorem,” presented at the TCC: Theory of Cryptography Conference,
2010, vol. 5978, pp. 1–18.'
ista: 'Håstad J, Pass R, Wikström D, Pietrzak KZ. 2010. An efficient parallel repetition
theorem. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 1–18.'
mla: Håstad, Johan, et al. An Efficient Parallel Repetition Theorem. Vol.
5978, Springer, 2010, pp. 1–18, doi:10.1007/978-3-642-11799-2_1.
short: J. Håstad, R. Pass, D. Wikström, K.Z. Pietrzak, in:, Springer, 2010, pp.
1–18.
conference:
name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T12:02:10Z
date_published: 2010-03-26T00:00:00Z
date_updated: 2021-01-12T07:41:59Z
day: '26'
doi: 10.1007/978-3-642-11799-2_1
extern: 1
intvolume: ' 5978'
month: '03'
page: 1 - 18
publication_status: published
publisher: Springer
publist_id: '3446'
quality_controlled: 0
status: public
title: An efficient parallel repetition theorem
type: conference
volume: 5978
year: '2010'
...
---
_id: '3234'
abstract:
- lang: eng
text: 'The strongest standard security notion for digital signature schemes is unforgeability
under chosen message attacks. In practice, however, this notion can be insufficient
due to "side-channel attacks" which exploit leakage of information about
the secret internal state. In this work we put forward the notion of "leakage-resilient
signatures," which strengthens the standard security notion by giving the
adversary the additional power to learn a bounded amount of arbitrary information
about the secret state that was accessed during every signature generation. This
notion naturally implies security against all side-channel attacks as long as
the amount of information leaked on each invocation is bounded and "only
computation leaks information." The main result of this paper is a construction
which gives a (tree-based, stateful) leakage-resilient signature scheme based
on any 3-time signature scheme. The amount of information that our scheme can
safely leak per signature generation is 1/3 of the information the underlying
3-time signature scheme can leak in total. Signature schemes that remain secure
even if a bounded total amount of information is leaked were recently constructed,
hence instantiating our construction with these schemes gives the first constructions
of provably secure leakage-resilient signature schemes. The above construction
assumes that the signing algorithm can sample truly random bits, and thus an implementation
would need some special hardware (randomness gates). Simply generating this randomness
using a leakage-resilient stream-cipher will in general not work. Our second contribution
is a sound general principle to replace uniform random bits in any leakage-resilient
construction with pseudorandom ones: run two leakage-resilient stream-ciphers
(with independent keys) in parallel and then apply a two-source extractor to their
outputs. '
alternative_title:
- LNCS
author:
- first_name: Sebastian
full_name: Faust, Sebastian
last_name: Faust
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Guy
full_name: Rothblum, Guy N
last_name: Rothblum
citation:
ama: 'Faust S, Kiltz E, Pietrzak KZ, Rothblum G. Leakage resilient signatures. In:
Vol 5978. Springer; 2010:343-360. doi:10.1007/978-3-642-11799-2_21'
apa: 'Faust, S., Kiltz, E., Pietrzak, K. Z., & Rothblum, G. (2010). Leakage
resilient signatures (Vol. 5978, pp. 343–360). Presented at the TCC: Theory of
Cryptography Conference, Springer. https://doi.org/10.1007/978-3-642-11799-2_21'
chicago: Faust, Sebastian, Eike Kiltz, Krzysztof Z Pietrzak, and Guy Rothblum. “Leakage
Resilient Signatures,” 5978:343–60. Springer, 2010. https://doi.org/10.1007/978-3-642-11799-2_21.
ieee: 'S. Faust, E. Kiltz, K. Z. Pietrzak, and G. Rothblum, “Leakage resilient signatures,”
presented at the TCC: Theory of Cryptography Conference, 2010, vol. 5978, pp.
343–360.'
ista: 'Faust S, Kiltz E, Pietrzak KZ, Rothblum G. 2010. Leakage resilient signatures.
TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 343–360.'
mla: Faust, Sebastian, et al. Leakage Resilient Signatures. Vol. 5978, Springer,
2010, pp. 343–60, doi:10.1007/978-3-642-11799-2_21.
short: S. Faust, E. Kiltz, K.Z. Pietrzak, G. Rothblum, in:, Springer, 2010, pp.
343–360.
conference:
name: 'TCC: Theory of Cryptography Conference'
date_created: 2018-12-11T12:02:10Z
date_published: 2010-03-26T00:00:00Z
date_updated: 2021-01-12T07:41:59Z
day: '26'
doi: 10.1007/978-3-642-11799-2_21
extern: 1
intvolume: ' 5978'
month: '03'
page: 343 - 360
publication_status: published
publisher: Springer
publist_id: '3447'
quality_controlled: 0
status: public
title: Leakage resilient signatures
type: conference
volume: 5978
year: '2010'
...
---
_id: '3235'
abstract:
- lang: eng
text: 'A cryptographic primitive is leakage-resilient, if it remains secure even
if an adversary can learn a bounded amount of arbitrary information about the
computation with every invocation. As a consequence, the physical implementation
of a leakage-resilient primitive is secure against every side-channel as long
as the amount of information leaked per invocation is bounded. In this paper we
prove positive and negative results about the feasibility of constructing leakage-resilient
pseudorandom functions and permutations (i.e. block-ciphers). Our results are
three fold: 1. We construct (from any standard PRF) a PRF which satisfies a relaxed
notion of leakage-resilience where (1) the leakage function is fixed (and not
adaptively chosen with each query.) and (2) the computation is split into several
steps which leak individually (a "step" will be the invocation of the
underlying PRF.) 2. We prove that a Feistel network with a super-logarithmic number
of rounds, each instantiated with a leakage-resilient PRF, is a leakage resilient
PRP. This reduction also holds for the non-adaptive notion just discussed, we
thus get a block-cipher which is leakage-resilient (against non-adaptive leakage).
3. We propose generic side-channel attacks against Feistel networks. The attacks
are generic in the sense that they work for any round functions (e.g. uniformly
random functions) and only require some simple leakage from the inputs to the
round functions. For example we show how to invert an r round Feistel network
over 2n bits making 4•(n+1) r-2 forward queries, if with each query we are also
given as leakage the Hamming weight of the inputs to the r round functions. This
complements the result from the previous item showing that a super-constant number
of rounds is necessary.'
alternative_title:
- LNCS
author:
- first_name: Yevgeniy
full_name: Dodis, Yevgeniy
last_name: Dodis
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Dodis Y, Pietrzak KZ. Leakage resilient pseudorandom functions and side channel
attacks on feistel networks. In: Vol 6223. Springer; 2010:21-40. doi:10.1007/978-3-642-14623-7_2'
apa: 'Dodis, Y., & Pietrzak, K. Z. (2010). Leakage resilient pseudorandom functions
and side channel attacks on feistel networks (Vol. 6223, pp. 21–40). Presented
at the CRYPTO: International Cryptology Conference, Springer. https://doi.org/10.1007/978-3-642-14623-7_2'
chicago: Dodis, Yevgeniy, and Krzysztof Z Pietrzak. “Leakage Resilient Pseudorandom
Functions and Side Channel Attacks on Feistel Networks,” 6223:21–40. Springer,
2010. https://doi.org/10.1007/978-3-642-14623-7_2.
ieee: 'Y. Dodis and K. Z. Pietrzak, “Leakage resilient pseudorandom functions and
side channel attacks on feistel networks,” presented at the CRYPTO: International
Cryptology Conference, 2010, vol. 6223, pp. 21–40.'
ista: 'Dodis Y, Pietrzak KZ. 2010. Leakage resilient pseudorandom functions and
side channel attacks on feistel networks. CRYPTO: International Cryptology Conference,
LNCS, vol. 6223, 21–40.'
mla: Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. Leakage Resilient Pseudorandom
Functions and Side Channel Attacks on Feistel Networks. Vol. 6223, Springer,
2010, pp. 21–40, doi:10.1007/978-3-642-14623-7_2.
short: Y. Dodis, K.Z. Pietrzak, in:, Springer, 2010, pp. 21–40.
conference:
name: 'CRYPTO: International Cryptology Conference'
date_created: 2018-12-11T12:02:10Z
date_published: 2010-09-30T00:00:00Z
date_updated: 2021-01-12T07:42:00Z
day: '30'
doi: 10.1007/978-3-642-14623-7_2
extern: 1
intvolume: ' 6223'
month: '09'
page: 21 - 40
publication_status: published
publisher: Springer
publist_id: '3445'
quality_controlled: 0
status: public
title: Leakage resilient pseudorandom functions and side channel attacks on feistel
networks
type: conference
volume: 6223
year: '2010'
...
---
_id: '3237'
abstract:
- lang: eng
text: 'Blinding is a popular and well-known countermeasure to protect public-key
cryptosystems against side-channel attacks. The high level idea is to randomize
an exponentiation in order to prevent multiple measurements of the same operation
on different data, as such measurements might allow the adversary to learn the
secret exponent. Several variants of blinding have been proposed in the literature,
using additive or multiplicative secret-sharing to blind either the base or the
exponent. These countermeasures usually aim at preventing particular side-channel
attacks (mostly power analysis) and come without any formal security guarantee.
In this work we investigate to which extend blinding can provide provable security
against a general class of side-channel attacks. Surprisingly, it turns out that
in the context of public-key encryption some blinding techniques are more suited
than others. In particular, we consider a multiplicatively blinded version of
ElGamal public-key encryption where - we prove that the scheme, instantiated over
bilinear groups of prime order p (where p - 1 is not smooth) is leakage resilient
in the generic-group model. Here we consider the model of chosen-ciphertext security
in the presence of continuous leakage, i.e., the scheme remains chosen-ciphertext
secure even if with every decryption query the adversary can learn a bounded amount
(roughly log(p)/2 bits) of arbitrary, adversarially chosen information about the
computation. - we conjecture that the scheme, instantiated over arbitrary groups
of prime order p (where p - 1 is not smooth) is leakage resilient. Previous to
this work no encryption scheme secure against continuous leakage was known. Constructing
a scheme that can be proven secure in the standard model remains an interesting
open problem. '
alternative_title:
- LNCS
author:
- first_name: Eike
full_name: Kiltz, Eike
last_name: Kiltz
- first_name: Krzysztof Z
full_name: Krzysztof Pietrzak
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Kiltz E, Pietrzak KZ. Leakage resilient ElGamal encryption. In: Vol 6477.
Springer; 2010:595-612. doi:10.1007/978-3-642-17373-8_34'
apa: 'Kiltz, E., & Pietrzak, K. Z. (2010). Leakage resilient ElGamal encryption
(Vol. 6477, pp. 595–612). Presented at the ASIACRYPT: Theory and Application of
Cryptology and Information Security, Springer. https://doi.org/10.1007/978-3-642-17373-8_34'
chicago: Kiltz, Eike, and Krzysztof Z Pietrzak. “Leakage Resilient ElGamal Encryption,”
6477:595–612. Springer, 2010. https://doi.org/10.1007/978-3-642-17373-8_34.
ieee: 'E. Kiltz and K. Z. Pietrzak, “Leakage resilient ElGamal encryption,” presented
at the ASIACRYPT: Theory and Application of Cryptology and Information Security,
2010, vol. 6477, pp. 595–612.'
ista: 'Kiltz E, Pietrzak KZ. 2010. Leakage resilient ElGamal encryption. ASIACRYPT:
Theory and Application of Cryptology and Information Security, LNCS, vol. 6477,
595–612.'
mla: Kiltz, Eike, and Krzysztof Z. Pietrzak. Leakage Resilient ElGamal Encryption.
Vol. 6477, Springer, 2010, pp. 595–612, doi:10.1007/978-3-642-17373-8_34.
short: E. Kiltz, K.Z. Pietrzak, in:, Springer, 2010, pp. 595–612.
conference:
name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security'
date_created: 2018-12-11T12:02:11Z
date_published: 2010-01-14T00:00:00Z
date_updated: 2021-01-12T07:42:01Z
day: '14'
doi: 10.1007/978-3-642-17373-8_34
extern: 1
intvolume: ' 6477'
month: '01'
page: 595 - 612
publication_status: published
publisher: Springer
publist_id: '3444'
quality_controlled: 0
status: public
title: Leakage resilient ElGamal encryption
type: conference
volume: 6477
year: '2010'
...
---
_id: '3294'
abstract:
- lang: eng
text: 'Olfactory responses of Drosophila undergo pronounced changes after eclosion.
The flies develop attraction to odors to which they are exposed and aversion to
other odors. Behavioral adaptation is correlated with changes in the firing pattern
of olfactory receptor neurons (ORNs). In this article, we present an information-theoretic
analysis of the firing pattern of ORNs. Flies reared in a synthetic odorless medium
were transferred after eclosion to three different media: (i) a synthetic medium
relatively devoid of odor cues, (ii) synthetic medium infused with a single odorant,
and (iii) complex cornmeal medium rich in odors. Recordings were made from an
identified sensillum (type II), and the Jensen-Shannon divergence (D(JS)) was
used to assess quantitatively the differences between ensemble spike responses
to different odors. Analysis shows that prolonged exposure to ethyl acetate and
several related esters increases sensitivity to these esters but does not improve
the ability of the fly to distinguish between them. Flies exposed to cornmeal
display varied sensitivity to these odorants and at the same time develop greater
capacity to distinguish between odors. Deprivation of odor experience on an odorless
synthetic medium leads to a loss of both sensitivity and acuity. Rich olfactory
experience thus helps to shape the ORNs response and enhances its discriminative
power. The experiments presented here demonstrate an experience-dependent adaptation
at the level of the receptor neuron.'
author:
- first_name: Atulya
full_name: Iyengar, Atulya
last_name: Iyengar
- first_name: Subhra
full_name: Chakraborty Tuhin, Subhra
last_name: Chakraborty Tuhin
- first_name: Sarit
full_name: Sarit Goswami
id: 3A578F32-F248-11E8-B48F-1D18A9856A87
last_name: Goswami
- first_name: Chun
full_name: Wu, Chun Fang
last_name: Wu
- first_name: Obaid
full_name: Siddiqi, Obaid
last_name: Siddiqi
citation:
ama: Iyengar A, Chakraborty Tuhin S, Goswami S, Wu C, Siddiqi O. Post eclosion odor
experience modifies olfactory receptor neuron coding in Drosophila. PNAS.
2010;107(21):9855-9860. doi:10.1073/pnas.1003856107
apa: Iyengar, A., Chakraborty Tuhin, S., Goswami, S., Wu, C., & Siddiqi, O.
(2010). Post eclosion odor experience modifies olfactory receptor neuron coding
in Drosophila. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1003856107
chicago: Iyengar, Atulya, Subhra Chakraborty Tuhin, Sarit Goswami, Chun Wu, and
Obaid Siddiqi. “Post Eclosion Odor Experience Modifies Olfactory Receptor Neuron
Coding in Drosophila.” PNAS. National Academy of Sciences, 2010. https://doi.org/10.1073/pnas.1003856107.
ieee: A. Iyengar, S. Chakraborty Tuhin, S. Goswami, C. Wu, and O. Siddiqi, “Post
eclosion odor experience modifies olfactory receptor neuron coding in Drosophila,”
PNAS, vol. 107, no. 21. National Academy of Sciences, pp. 9855–60, 2010.
ista: Iyengar A, Chakraborty Tuhin S, Goswami S, Wu C, Siddiqi O. 2010. Post eclosion
odor experience modifies olfactory receptor neuron coding in Drosophila. PNAS.
107(21), 9855–60.
mla: Iyengar, Atulya, et al. “Post Eclosion Odor Experience Modifies Olfactory Receptor
Neuron Coding in Drosophila.” PNAS, vol. 107, no. 21, National Academy
of Sciences, 2010, pp. 9855–60, doi:10.1073/pnas.1003856107.
short: A. Iyengar, S. Chakraborty Tuhin, S. Goswami, C. Wu, O. Siddiqi, PNAS 107
(2010) 9855–60.
date_created: 2018-12-11T12:02:31Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:27Z
day: '01'
doi: 10.1073/pnas.1003856107
extern: 1
intvolume: ' 107'
issue: '21'
month: '01'
page: 9855 - 60
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '3347'
quality_controlled: 0
status: public
title: Post eclosion odor experience modifies olfactory receptor neuron coding in
Drosophila
type: journal_article
volume: 107
year: '2010'
...
---
_id: '3296'
abstract:
- lang: eng
text: "Accurate computational representations of highly deformable surfaces are
indispensable in the fields of computer animation, medical simulation, computer
vision, digital modeling, and computational physics. The focus of this dissertation
is on the animation of physics-based phenomena with highly detailed deformable
surfaces represented by triangle meshes.\r\n \r\nWe first present results from
an algorithm that generates continuum mechanics animations with intricate surface
features. This method combines a finite element method with a tetrahedral mesh
generator and a high resolution surface mesh, and it is orders of magnitude more
efficient than previous approaches. Next, we present an efficient solution for
the challenging problem of computing topological changes in detailed dynamic surface
meshes. We then introduce a new physics-inspired surface tracking algorithm that
is capable of preserving arbitrarily thin features and reproducing realistic fine-scale
topological changes like Rayleigh-Plateau instabilities. This physics-inspired
surface tracking technique also opens the door for a unique coupling between surficial
finite element methods and volumetric finite difference methods, in order to simulate
liquid surface tension phenomena more efficiently than any previous method. Due
to its dramatic increase in computational resolution and efficiency, this method
yielded the first computer simulations of a fully developed crown splash with
droplet pinch off."
article_processing_charge: No
author:
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Wojtan C. Animating physical phenomena with embedded surface meshes. 2010:1-175.
apa: Wojtan, C. (2010). Animating physical phenomena with embedded surface meshes.
Georgia Institute of Technology.
chicago: Wojtan, Chris. “Animating Physical Phenomena with Embedded Surface Meshes.”
Georgia Institute of Technology, 2010.
ieee: C. Wojtan, “Animating physical phenomena with embedded surface meshes,” Georgia
Institute of Technology, 2010.
ista: Wojtan C. 2010. Animating physical phenomena with embedded surface meshes.
Georgia Institute of Technology.
mla: Wojtan, Chris. Animating Physical Phenomena with Embedded Surface Meshes.
Georgia Institute of Technology, 2010, pp. 1–175.
short: C. Wojtan, Animating Physical Phenomena with Embedded Surface Meshes, Georgia
Institute of Technology, 2010.
date_created: 2018-12-11T12:02:31Z
date_published: 2010-11-17T00:00:00Z
date_updated: 2023-02-23T11:21:00Z
day: '17'
extern: '1'
language:
- iso: eng
main_file_link:
- url: http://hdl.handle.net/1853/37256
month: '11'
oa_version: None
page: 1 - 175
publication_status: published
publisher: Georgia Institute of Technology
publist_id: '3345'
status: public
supervisor:
- first_name: Irfan
full_name: Essa, Irfan
last_name: Essa
- first_name: Karen
full_name: Liu, Karen
last_name: Liu
- first_name: Peter
full_name: Mucha, Peter
last_name: Mucha
- first_name: Jarek
full_name: Rossignac, Jarek
last_name: Rossignac
title: Animating physical phenomena with embedded surface meshes
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2010'
...
---
_id: '3303'
abstract:
- lang: eng
text: 'Biological traits result in part from interactions between different genetic
loci. This can lead to sign epistasis, in which a beneficial adaptation involves
a combination of individually deleterious or neutral mutations; in this case,
a population must cross a “fitness valley” to adapt. Recombination can assist
this process by combining mutations from different individuals or retard it by
breaking up the adaptive combination. Here, we analyze the simplest fitness valley,
in which an adaptation requires one mutation at each of two loci to provide a
fitness benefit. We present a theoretical analysis of the effect of recombination
on the valley-crossing process across the full spectrum of possible parameter
regimes. We find that low recombination rates can speed up valley crossing relative
to the asexual case, while higher recombination rates slow down valley crossing,
with the transition between the two regimes occurring when the recombination rate
between the loci is approximately equal to the selective advantage provided by
the adaptation. In large populations, if the recombination rate is high and selection
against single mutants is substantial, the time to cross the valley grows exponentially
with population size, effectively meaning that the population cannot acquire the
adaptation. Recombination at the optimal (low) rate can reduce the valley-crossing
time by up to several orders of magnitude relative to that in an asexual population. '
acknowledgement: "This work was supported in part by a Robert N. Noyce Stanford Graduate
Fellowship and European Research Council grant 250152 (to D.B.W.) and by National
Institutes of Health grant GM 28016 (to M.W.F.).\r\nWe thank Michael Desai for many
ideas and discussions and are grateful to Joanna Masel and an anonymous reviewer
for their helpful suggestions. "
article_processing_charge: No
author:
- first_name: Daniel
full_name: Weissman, Daniel
id: 2D0CE020-F248-11E8-B48F-1D18A9856A87
last_name: Weissman
- first_name: Marcus
full_name: Feldman, Marcus
last_name: Feldman
- first_name: Daniel
full_name: Fisher, Daniel
last_name: Fisher
citation:
ama: Weissman D, Feldman M, Fisher D. The rate of fitness-valley crossing in sexual
populations. Genetics. 2010;186(4):1389-1410. doi:10.1534/genetics.110.123240
apa: Weissman, D., Feldman, M., & Fisher, D. (2010). The rate of fitness-valley
crossing in sexual populations. Genetics. Genetics Society of America.
https://doi.org/10.1534/genetics.110.123240
chicago: Weissman, Daniel, Marcus Feldman, and Daniel Fisher. “The Rate of Fitness-Valley
Crossing in Sexual Populations.” Genetics. Genetics Society of America,
2010. https://doi.org/10.1534/genetics.110.123240.
ieee: D. Weissman, M. Feldman, and D. Fisher, “The rate of fitness-valley crossing
in sexual populations,” Genetics, vol. 186, no. 4. Genetics Society of
America, pp. 1389–1410, 2010.
ista: Weissman D, Feldman M, Fisher D. 2010. The rate of fitness-valley crossing
in sexual populations. Genetics. 186(4), 1389–1410.
mla: Weissman, Daniel, et al. “The Rate of Fitness-Valley Crossing in Sexual Populations.”
Genetics, vol. 186, no. 4, Genetics Society of America, 2010, pp. 1389–410,
doi:10.1534/genetics.110.123240.
short: D. Weissman, M. Feldman, D. Fisher, Genetics 186 (2010) 1389–1410.
corr_author: '1'
date_created: 2018-12-11T12:02:33Z
date_published: 2010-12-01T00:00:00Z
date_updated: 2025-09-30T09:47:59Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.110.123240
ec_funded: 1
external_id:
isi:
- '000285297000025'
intvolume: ' 186'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2998319/
month: '12'
oa: 1
oa_version: Submitted Version
page: 1389 - 1410
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '3337'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The rate of fitness-valley crossing in sexual populations
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 186
year: '2010'
...
---
_id: '3306'
abstract:
- lang: eng
text: We use methods from combinatorics and algebraic statistics to study analogues
of birth-and-death processes that have as their state space a finite subset of
the m-dimensional lattice and for which the m matrices that record the transition
probabilities in each of the lattice directions commute pairwise. One reason such
processes are of interest is that the transition matrix is straightforward to
diagonalize, and hence it is easy to compute n step transition probabilities.
The set of commuting birth-and-death processes decomposes as a union of toric
varieties, with the main component being the closure of all processes whose nearest
neighbor transition probabilities are positive. We exhibit an explicit monomial
parametrization for this main component, and we explore the boundary components
using primary decomposition.
acknowledgement: Steven N. Evans was supported in part by NSF Grants DMS-04-05778
and DMS-09-07630. Bernd Sturmfels was supported in part by NSF Grants DMS-04-56960
and DMS-07-57236. Caroline Uhler was supported by an International Fulbright Science
and Technology Fellowship.
author:
- first_name: Steven
full_name: Evans, Steven N
last_name: Evans
- first_name: Bernd
full_name: Sturmfels, Bernd
last_name: Sturmfels
- first_name: Caroline
full_name: Caroline Uhler
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: Evans S, Sturmfels B, Uhler C. Commuting birth and death processes. The
Annals of Applied Probability. 2010;20:238-266. doi:10.1214/09-AAP615
apa: Evans, S., Sturmfels, B., & Uhler, C. (2010). Commuting birth and death
processes. The Annals of Applied Probability. Institute of Mathematical
Statistics. https://doi.org/10.1214/09-AAP615
chicago: Evans, Steven, Bernd Sturmfels, and Caroline Uhler. “Commuting Birth and
Death Processes.” The Annals of Applied Probability. Institute of Mathematical
Statistics, 2010. https://doi.org/10.1214/09-AAP615.
ieee: S. Evans, B. Sturmfels, and C. Uhler, “Commuting birth and death processes,”
The Annals of Applied Probability, vol. 20. Institute of Mathematical Statistics,
pp. 238–266, 2010.
ista: Evans S, Sturmfels B, Uhler C. 2010. Commuting birth and death processes.
The Annals of Applied Probability. 20, 238–266.
mla: Evans, Steven, et al. “Commuting Birth and Death Processes.” The Annals
of Applied Probability, vol. 20, Institute of Mathematical Statistics, 2010,
pp. 238–66, doi:10.1214/09-AAP615.
short: S. Evans, B. Sturmfels, C. Uhler, The Annals of Applied Probability 20 (2010)
238–266.
date_created: 2018-12-11T12:02:35Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:32Z
day: '01'
doi: 10.1214/09-AAP615
extern: 1
intvolume: ' 20'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0812.2724
month: '01'
oa: 1
page: 238 - 266
publication: The Annals of Applied Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '3334'
quality_controlled: 0
status: public
title: Commuting birth and death processes
type: journal_article
volume: 20
year: '2010'
...
---
_id: '3308'
abstract:
- lang: eng
text: We study multivariate normal models that are described by linear constraints
on the inverse of the covariance matrix. Maximum likelihood estimation for such
models leads to the problem of maximizing the determinant function over a spectrahedron,
and to the problem of characterizing the image of the positive definite cone under
an arbitrary linear projection. These problems at the interface of statistics
and optimization are here examined from the perspective of convex algebraic geometry.
acknowledgement: B. Sturmfels is supported in part by NSF grants DMS-0456960 and DMS-0757236.
C. Uhler is supported by an International Fulbright Science and Technology Fellowship.
author:
- first_name: Bernd
full_name: Sturmfels, Bernd
last_name: Sturmfels
- first_name: Caroline
full_name: Caroline Uhler
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
citation:
ama: Sturmfels B, Uhler C. Multivariate Gaussians, semidefinite matrix completion,
and convex algebraic geometry. Annals of the Institute of Statistical Mathematics.
2010;62(4):603-638. doi:10.1007/s10463-010-0295-4
apa: Sturmfels, B., & Uhler, C. (2010). Multivariate Gaussians, semidefinite
matrix completion, and convex algebraic geometry. Annals of the Institute of
Statistical Mathematics. Springer. https://doi.org/10.1007/s10463-010-0295-4
chicago: Sturmfels, Bernd, and Caroline Uhler. “Multivariate Gaussians, Semidefinite
Matrix Completion, and Convex Algebraic Geometry.” Annals of the Institute
of Statistical Mathematics. Springer, 2010. https://doi.org/10.1007/s10463-010-0295-4.
ieee: B. Sturmfels and C. Uhler, “Multivariate Gaussians, semidefinite matrix completion,
and convex algebraic geometry,” Annals of the Institute of Statistical Mathematics,
vol. 62, no. 4. Springer, pp. 603–638, 2010.
ista: Sturmfels B, Uhler C. 2010. Multivariate Gaussians, semidefinite matrix completion,
and convex algebraic geometry. Annals of the Institute of Statistical Mathematics.
62(4), 603–638.
mla: Sturmfels, Bernd, and Caroline Uhler. “Multivariate Gaussians, Semidefinite
Matrix Completion, and Convex Algebraic Geometry.” Annals of the Institute
of Statistical Mathematics, vol. 62, no. 4, Springer, 2010, pp. 603–38, doi:10.1007/s10463-010-0295-4.
short: B. Sturmfels, C. Uhler, Annals of the Institute of Statistical Mathematics
62 (2010) 603–638.
date_created: 2018-12-11T12:02:35Z
date_published: 2010-08-01T00:00:00Z
date_updated: 2021-01-12T07:42:33Z
day: '01'
doi: 10.1007/s10463-010-0295-4
extern: 1
intvolume: ' 62'
issue: '4'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0906.3529
month: '08'
oa: 1
page: 603 - 638
publication: Annals of the Institute of Statistical Mathematics
publication_status: published
publisher: Springer
publist_id: '3332'
quality_controlled: 0
status: public
title: Multivariate Gaussians, semidefinite matrix completion, and convex algebraic
geometry
type: journal_article
volume: 62
year: '2010'
...
---
_id: '3402'
abstract:
- lang: eng
text: Model checking transactional memories (TMs) is difficult because of the unbounded
number, length, and delay of concurrent transactions, as well as the unbounded
size of the memory. We show that, under certain conditions satisfied by most TMs
we know of, the model checking problem can be reduced to a finite-state problem,
and we illustrate the use of the method by proving the correctness of several
TMs, including two-phase locking, DSTM, and TL2. The safety properties we consider
include strict serializability and opacity; the liveness properties include obstruction
freedom, livelock freedom, and wait freedom. Our main contribution lies in the
structure of the proofs, which are largely automated and not restricted to the
TMs mentioned above. In a first step we show that every TM that enjoys certain
structural properties either violates a requirement on some program with two threads
and two shared variables, or satisfies the requirement on all programs. In the
second step, we use a model checker to prove the requirement for the TM applied
to a most general program with two threads and two variables. In the safety case,
the model checker checks language inclusion between two finite-state transition
systems, a nondeterministic transition system representing the given TM applied
to a most general program, and a deterministic transition system representing
a most liberal safe TM applied to the same program. The given TM transition system
is nondeterministic because a TM can be used with different contention managers,
which resolve conflicts differently. In the liveness case, the model checker analyzes
fairness conditions on the given TM transition system.
acknowledgement: This research was supported by the Swiss National Science Foundation.
This paper is an extended and revised version of our previous work on model checking
transactional memories.
author:
- first_name: Rachid
full_name: Guerraoui, Rachid
last_name: Guerraoui
- first_name: Thomas A
full_name: Thomas Henzinger
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Vasu
full_name: Vasu Singh
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: Guerraoui R, Henzinger TA, Singh V. Model checking transactional memories.
Distributed Computing. 2010;22(3):129-145. doi:10.1007/s00446-009-0092-6
apa: Guerraoui, R., Henzinger, T. A., & Singh, V. (2010). Model checking transactional
memories. Distributed Computing. Springer. https://doi.org/10.1007/s00446-009-0092-6
chicago: Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Model Checking
Transactional Memories.” Distributed Computing. Springer, 2010. https://doi.org/10.1007/s00446-009-0092-6.
ieee: R. Guerraoui, T. A. Henzinger, and V. Singh, “Model checking transactional
memories,” Distributed Computing, vol. 22, no. 3. Springer, pp. 129–145,
2010.
ista: Guerraoui R, Henzinger TA, Singh V. 2010. Model checking transactional memories.
Distributed Computing. 22(3), 129–145.
mla: Guerraoui, Rachid, et al. “Model Checking Transactional Memories.” Distributed
Computing, vol. 22, no. 3, Springer, 2010, pp. 129–45, doi:10.1007/s00446-009-0092-6.
short: R. Guerraoui, T.A. Henzinger, V. Singh, Distributed Computing 22 (2010) 129–145.
date_created: 2018-12-11T12:03:08Z
date_published: 2010-03-01T00:00:00Z
date_updated: 2021-01-12T07:43:14Z
day: '01'
doi: 10.1007/s00446-009-0092-6
extern: 1
intvolume: ' 22'
issue: '3'
main_file_link:
- open_access: '0'
url: http://infoscience.epfl.ch/record/117513/files/PLDI_paper.pdf
month: '03'
page: 129 - 145
publication: Distributed Computing
publication_status: published
publisher: Springer
publist_id: '3000'
pubrep_id: '74'
quality_controlled: 0
status: public
title: Model checking transactional memories
type: journal_article
volume: 22
year: '2010'
...
---
_id: '3403'
abstract:
- lang: eng
text: Rate remapping is a conjunctive code that potentially enables hippocampal
place cells to jointly represent spatial and nonspatial information. In this issue
of Neuron, Rennó-Costa et al. introduce a theoretical model wherein the convergence
of the medial and lateral entorhinal excitatory inputs, combined with local inhibition,
explains hippocampal rate remapping. © 2010 Elsevier Inc.
author:
- 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: 'Pleydell Bouverie B, Csicsvari JL. Rate remapping: When the code goes beyond
space (preview). Neuron. 2010;68(6):1015-1016. doi:10.1016/j.neuron.2010.12.011'
apa: 'Pleydell Bouverie, B., & Csicsvari, J. L. (2010). Rate remapping: When
the code goes beyond space (preview). Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2010.12.011'
chicago: 'Pleydell Bouverie, Barty, and Jozsef L Csicsvari. “Rate Remapping: When
the Code Goes beyond Space (Preview).” Neuron. Elsevier, 2010. https://doi.org/10.1016/j.neuron.2010.12.011.'
ieee: 'B. Pleydell Bouverie and J. L. Csicsvari, “Rate remapping: When the code
goes beyond space (preview),” Neuron, vol. 68, no. 6. Elsevier, pp. 1015–1016,
2010.'
ista: 'Pleydell Bouverie B, Csicsvari JL. 2010. Rate remapping: When the code goes
beyond space (preview). Neuron. 68(6), 1015–1016.'
mla: 'Pleydell Bouverie, Barty, and Jozsef L. Csicsvari. “Rate Remapping: When the
Code Goes beyond Space (Preview).” Neuron, vol. 68, no. 6, Elsevier, 2010,
pp. 1015–16, doi:10.1016/j.neuron.2010.12.011.'
short: B. Pleydell Bouverie, J.L. Csicsvari, Neuron 68 (2010) 1015–1016.
date_created: 2018-12-11T12:03:08Z
date_published: 2010-12-22T00:00:00Z
date_updated: 2019-05-10T12:19:51Z
day: '22'
doi: 10.1016/j.neuron.2010.12.011
extern: 1
intvolume: ' 68'
issue: '6'
month: '12'
page: 1015 - 1016
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '2999'
quality_controlled: 0
status: public
title: 'Rate remapping: When the code goes beyond space (preview)'
type: review
volume: 68
year: '2010'
...