---
_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'
...
---
_id: '3406'
abstract:
- lang: eng
text: The impact of structural biology on the design of ligands (agonists, antagonists
and modulators) for ionotropic glutamate receptors is reviewed.
author:
- first_name: Philipp
full_name: Stawski, Philipp
last_name: Stawski
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Dirk
full_name: Trauner, Dirk
last_name: Trauner
citation:
ama: 'Stawski P, Janovjak HL, Trauner D. Pharmacology of ionotropic glutamate receptors:
a structural perspective. Bioorganic and Medicinal Chemistry. 2010;18(22):7759-7772.
doi:10.1016/j.bmc.2010.09.012'
apa: 'Stawski, P., Janovjak, H. L., & Trauner, D. (2010). Pharmacology of ionotropic
glutamate receptors: a structural perspective. Bioorganic and Medicinal Chemistry.
Elsevier. https://doi.org/10.1016/j.bmc.2010.09.012'
chicago: 'Stawski, Philipp, Harald L Janovjak, and Dirk Trauner. “Pharmacology of
Ionotropic Glutamate Receptors: A Structural Perspective.” Bioorganic and Medicinal
Chemistry. Elsevier, 2010. https://doi.org/10.1016/j.bmc.2010.09.012.'
ieee: 'P. Stawski, H. L. Janovjak, and D. Trauner, “Pharmacology of ionotropic glutamate
receptors: a structural perspective,” Bioorganic and Medicinal Chemistry,
vol. 18, no. 22. Elsevier, pp. 7759–7772, 2010.'
ista: 'Stawski P, Janovjak HL, Trauner D. 2010. Pharmacology of ionotropic glutamate
receptors: a structural perspective. Bioorganic and Medicinal Chemistry. 18(22),
7759–7772.'
mla: 'Stawski, Philipp, et al. “Pharmacology of Ionotropic Glutamate Receptors:
A Structural Perspective.” Bioorganic and Medicinal Chemistry, vol. 18,
no. 22, Elsevier, 2010, pp. 7759–72, doi:10.1016/j.bmc.2010.09.012.'
short: P. Stawski, H.L. Janovjak, D. Trauner, Bioorganic and Medicinal Chemistry
18 (2010) 7759–7772.
date_created: 2018-12-11T12:03:10Z
date_published: 2010-11-15T00:00:00Z
date_updated: 2019-04-26T07:22:27Z
day: '15'
doi: 10.1016/j.bmc.2010.09.012
extern: 1
intvolume: ' 18'
issue: '22'
month: '11'
page: 7759 - 7772
publication: Bioorganic and Medicinal Chemistry
publication_status: published
publisher: Elsevier
publist_id: '2996'
quality_controlled: 0
status: public
title: 'Pharmacology of ionotropic glutamate receptors: a structural perspective'
type: review
volume: 18
year: '2010'
...
---
_id: '3407'
abstract:
- lang: eng
text: Genetically targeted light-activated ion channels and pumps make it possible
to determine the role of specific neurons in neuronal circuits, information processing
and behavior. We developed a K+-selective ionotropic glutamate receptor that reversibly
inhibits neuronal activity in response to light in dissociated neurons and brain
slice and also reversibly suppresses behavior in zebrafish. The receptor is a
chimera of the pore region of a K+-selective bacterial glutamate receptor and
the ligand-binding domain of a light-gated mammalian kainate receptor. This hyperpolarizing
light-gated channel, HyLighter, is turned on by a brief light pulse at one wavelength
and turned off by a pulse at a second wavelength. The control is obtained at moderate
intensity. After optical activation, the photocurrent and optical silencing of
activity persists in the dark for extended periods. The low light requirement
and bi-stability of HyLighter represent advantages for the dissection of neural
circuitry.
author:
- first_name: Harald L
full_name: Harald Janovjak
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Stephanie
full_name: Szobota, Stephanie
last_name: Szobota
- first_name: Claire
full_name: Wyart, Claire
last_name: Wyart
- first_name: Dirk
full_name: Trauner, Dirk
last_name: Trauner
- first_name: Ehud
full_name: Isacoff, Ehud Y
last_name: Isacoff
citation:
ama: Janovjak HL, Szobota S, Wyart C, Trauner D, Isacoff E. A light-gated, potassium-selective
glutamate receptor for the optical inhibition of neuronal firing. Nature Neuroscience.
2010;13:1027-1032. doi:10.1038/nn.2589
apa: Janovjak, H. L., Szobota, S., Wyart, C., Trauner, D., & Isacoff, E. (2010).
A light-gated, potassium-selective glutamate receptor for the optical inhibition
of neuronal firing. Nature Neuroscience. Nature Publishing Group. https://doi.org/10.1038/nn.2589
chicago: Janovjak, Harald L, Stephanie Szobota, Claire Wyart, Dirk Trauner, and
Ehud Isacoff. “A Light-Gated, Potassium-Selective Glutamate Receptor for the Optical
Inhibition of Neuronal Firing.” Nature Neuroscience. Nature Publishing
Group, 2010. https://doi.org/10.1038/nn.2589.
ieee: H. L. Janovjak, S. Szobota, C. Wyart, D. Trauner, and E. Isacoff, “A light-gated,
potassium-selective glutamate receptor for the optical inhibition of neuronal
firing,” Nature Neuroscience, vol. 13. Nature Publishing Group, pp. 1027–1032,
2010.
ista: Janovjak HL, Szobota S, Wyart C, Trauner D, Isacoff E. 2010. A light-gated,
potassium-selective glutamate receptor for the optical inhibition of neuronal
firing. Nature Neuroscience. 13, 1027–1032.
mla: Janovjak, Harald L., et al. “A Light-Gated, Potassium-Selective Glutamate Receptor
for the Optical Inhibition of Neuronal Firing.” Nature Neuroscience, vol.
13, Nature Publishing Group, 2010, pp. 1027–32, doi:10.1038/nn.2589.
short: H.L. Janovjak, S. Szobota, C. Wyart, D. Trauner, E. Isacoff, Nature Neuroscience
13 (2010) 1027–1032.
date_created: 2018-12-11T12:03:10Z
date_published: 2010-06-27T00:00:00Z
date_updated: 2021-01-12T07:43:16Z
day: '27'
doi: 10.1038/nn.2589
extern: 1
intvolume: ' 13'
month: '06'
page: 1027 - 1032
publication: Nature Neuroscience
publication_status: published
publisher: Nature Publishing Group
publist_id: '2995'
quality_controlled: 0
status: public
title: A light-gated, potassium-selective glutamate receptor for the optical inhibition
of neuronal firing
type: journal_article
volume: 13
year: '2010'
...
---
_id: '13409'
abstract:
- lang: eng
text: The immobilization of molecular switches onto inorganic supports has recently
become a hot topic as it can give rise to novel hybrid materials in which the
properties of the two components are mutually enhanced. Even more attractive is
the concept of “transferring” the switchable characteristics of single layers
of organic molecules onto the underlying inorganic components, rendering them
responsive to external stimuli as well. Of the various molecular switches studied,
azobenzene (AB) has arguably attracted most attention due to its simple molecular
structure, and because its “trigger” (light) is a noninvasive one, it can be delivered
instantaneously, and into a precise location. In order to fully realize its potential,
however, it is necessary to immobilize AB onto solid supports. It is the goal
of this manuscript to comprehensively yet concisely review such hybrid systems
which comprise AB forming well-defined self-assembled monolayers (SAMs) on planar
and curved (colloidal and nanoporous) inorganic surfaces. I discuss methods to
immobilize AB derivatives onto surfaces, strategies to ensure efficient AB isomerization,
ways to monitor the switching process, properties of these switchable hybrid materials,
and, last but not least, their emerging applications.
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
citation:
ama: Klajn R. Immobilized azobenzenes for the construction of photoresponsive materials.
Pure and Applied Chemistry. 2010;82(12):2247-2279. doi:10.1351/pac-con-10-09-04
apa: Klajn, R. (2010). Immobilized azobenzenes for the construction of photoresponsive
materials. Pure and Applied Chemistry. De Gruyter. https://doi.org/10.1351/pac-con-10-09-04
chicago: Klajn, Rafal. “Immobilized Azobenzenes for the Construction of Photoresponsive
Materials.” Pure and Applied Chemistry. De Gruyter, 2010. https://doi.org/10.1351/pac-con-10-09-04.
ieee: R. Klajn, “Immobilized azobenzenes for the construction of photoresponsive
materials,” Pure and Applied Chemistry, vol. 82, no. 12. De Gruyter, pp.
2247–2279, 2010.
ista: Klajn R. 2010. Immobilized azobenzenes for the construction of photoresponsive
materials. Pure and Applied Chemistry. 82(12), 2247–2279.
mla: Klajn, Rafal. “Immobilized Azobenzenes for the Construction of Photoresponsive
Materials.” Pure and Applied Chemistry, vol. 82, no. 12, De Gruyter, 2010,
pp. 2247–79, doi:10.1351/pac-con-10-09-04.
short: R. Klajn, Pure and Applied Chemistry 82 (2010) 2247–2279.
date_created: 2023-08-01T09:48:11Z
date_published: 2010-10-15T00:00:00Z
date_updated: 2024-10-14T12:21:48Z
day: '15'
doi: 10.1351/pac-con-10-09-04
extern: '1'
intvolume: ' 82'
issue: '12'
keyword:
- General Chemical Engineering
- General Chemistry
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1351/pac-con-10-09-04
month: '10'
oa: 1
oa_version: Published Version
page: 2247-2279
publication: Pure and Applied Chemistry
publication_identifier:
eissn:
- 1365-3075
issn:
- 0033-4545
publication_status: published
publisher: De Gruyter
quality_controlled: '1'
scopus_import: '1'
status: public
title: Immobilized azobenzenes for the construction of photoresponsive materials
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 82
year: '2010'
...
---
_id: '13410'
abstract:
- lang: eng
text: A range (Au, Pt, Pd) of metal nanoparticles (MNPs) has been prepared and functionalized
with (a) redox-active stalks containing tetrathiafulvalene (TTF) units, (b) [2]pseudorotaxanes
formed between these stalks and cyclobis(paraquat-p-phenylene) (CBPQT4+) rings,
and (c) bistable [2]rotaxane molecules where the dumbbell component contains a
1,5-dioxynaphthalene (DNP) unit, as well as a TTF unit, encircled by a CBPQT4+
ring. It transpires that the molecules present in (a) and (c) and the supermolecules
described in (b) retain their switching characteristics, previously observed in
solution, when they are immobilized onto MNPs. Moreover, their oxidation potentials
depend on the fraction, χ, of the molecules or supermolecules on the surface of
the nanoparticles. A variation in χ affects the oxidation potentials of the TTF
units to the extent that switching can be subjected to fine tuning as a result.
Specifically, increasing χ results in positive shifts (i) in the oxidation potentials
of the TTF unit in (a)−(c) and (ii) the reduction potentials of the CBPQT4+ rings
in (c). These shifts can be attributed to an increase in the electrostatic potential
surrounding the MNPs. Both the magnitude and the direction of these shifts are
reproduced by a model, based on the Poisson−Boltzmann equation coupled with charge-regulating
boundary conditions. Furthermore, the kinetics of relaxation from the metastable
state coconformation (MSCC) to the ground-state coconformation (GSCC) of the bistable
[2]rotaxane molecules also depends on χ, as well as on the nanoparticle diameter.
Increasing either of these parameters accelerates the rate of relaxation from
the MSCC to the GSCC. This rate is a function of (i) the activation energy for
the relaxation process associated with the bistable [2]rotaxane molecules in solution
and (ii) the electrostatic potential surrounding the MNPs. The electrostatic potential
depends on (i) the diameter of the MNPs, (ii) the amount of the bistable [2]rotaxane
molecules on the surface of the MNPs, and (iii) the equilibrium distribution of
the CBPQT4+ rings between the DNP and TTF recognition sites in the GSCC. This
electrostatic potential has also been quantified using the Poisson−Boltzmann equation,
leading to faithful estimates of the rate constants.
article_processing_charge: No
article_type: original
author:
- first_name: Ali
full_name: Coskun, Ali
last_name: Coskun
- first_name: Paul J.
full_name: Wesson, Paul J.
last_name: Wesson
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Ali
full_name: Trabolsi, Ali
last_name: Trabolsi
- first_name: Lei
full_name: Fang, Lei
last_name: Fang
- first_name: Mark A.
full_name: Olson, Mark A.
last_name: Olson
- first_name: Sanjeev K.
full_name: Dey, Sanjeev K.
last_name: Dey
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
- first_name: J. Fraser
full_name: Stoddart, J. Fraser
last_name: Stoddart
citation:
ama: 'Coskun A, Wesson PJ, Klajn R, et al. Molecular-mechanical switching at the
nanoparticle−solvent interface: Practice and theory. Journal of the American
Chemical Society. 2010;132(12):4310-4320. doi:10.1021/ja9102327'
apa: 'Coskun, A., Wesson, P. J., Klajn, R., Trabolsi, A., Fang, L., Olson, M. A.,
… Stoddart, J. F. (2010). Molecular-mechanical switching at the nanoparticle−solvent
interface: Practice and theory. Journal of the American Chemical Society.
American Chemical Society. https://doi.org/10.1021/ja9102327'
chicago: 'Coskun, Ali, Paul J. Wesson, Rafal Klajn, Ali Trabolsi, Lei Fang, Mark
A. Olson, Sanjeev K. Dey, Bartosz A. Grzybowski, and J. Fraser Stoddart. “Molecular-Mechanical
Switching at the Nanoparticle−solvent Interface: Practice and Theory.” Journal
of the American Chemical Society. American Chemical Society, 2010. https://doi.org/10.1021/ja9102327.'
ieee: 'A. Coskun et al., “Molecular-mechanical switching at the nanoparticle−solvent
interface: Practice and theory,” Journal of the American Chemical Society,
vol. 132, no. 12. American Chemical Society, pp. 4310–4320, 2010.'
ista: 'Coskun A, Wesson PJ, Klajn R, Trabolsi A, Fang L, Olson MA, Dey SK, Grzybowski
BA, Stoddart JF. 2010. Molecular-mechanical switching at the nanoparticle−solvent
interface: Practice and theory. Journal of the American Chemical Society. 132(12),
4310–4320.'
mla: 'Coskun, Ali, et al. “Molecular-Mechanical Switching at the Nanoparticle−solvent
Interface: Practice and Theory.” Journal of the American Chemical Society,
vol. 132, no. 12, American Chemical Society, 2010, pp. 4310–20, doi:10.1021/ja9102327.'
short: A. Coskun, P.J. Wesson, R. Klajn, A. Trabolsi, L. Fang, M.A. Olson, S.K.
Dey, B.A. Grzybowski, J.F. Stoddart, Journal of the American Chemical Society
132 (2010) 4310–4320.
date_created: 2023-08-01T09:48:27Z
date_published: 2010-03-31T00:00:00Z
date_updated: 2023-08-08T08:00:31Z
day: '31'
doi: 10.1021/ja9102327
extern: '1'
external_id:
pmid:
- '20218598'
intvolume: ' 132'
issue: '12'
keyword:
- Colloid and Surface Chemistry
- Biochemistry
- General Chemistry
- Catalysis
language:
- iso: eng
month: '03'
oa_version: None
page: 4310-4320
pmid: 1
publication: Journal of the American Chemical Society
publication_identifier:
eissn:
- 1520-5126
issn:
- 0002-7863
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Molecular-mechanical switching at the nanoparticle−solvent interface: Practice
and theory'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 132
year: '2010'
...
---
_id: '13411'
abstract:
- lang: eng
text: Photoresponsive gold nanoparticles dispersed in a solid/frozen matrix provide
a basis for sensors that “remember” whether the sample has ever exceeded the melting
temperature of the matrix. The operation of these sensors rests on the ability
to photoinduce metastable electric dipoles on NP surfaces – upon melting, these
dipoles drive NP aggregation, precipitation, and crosslinking. These events are
manifested by a pronounced color change.
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: Kevin P.
full_name: Browne, Kevin P.
last_name: Browne
- first_name: Siowling
full_name: Soh, Siowling
last_name: Soh
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Klajn R, Browne KP, Soh S, Grzybowski BA. Nanoparticles that “remember” temperature.
Small. 2010;6(13):1385-1387. doi:10.1002/smll.200902272
apa: Klajn, R., Browne, K. P., Soh, S., & Grzybowski, B. A. (2010). Nanoparticles
that “remember” temperature. Small. Wiley. https://doi.org/10.1002/smll.200902272
chicago: Klajn, Rafal, Kevin P. Browne, Siowling Soh, and Bartosz A. Grzybowski.
“Nanoparticles That ‘Remember’ Temperature.” Small. Wiley, 2010. https://doi.org/10.1002/smll.200902272.
ieee: R. Klajn, K. P. Browne, S. Soh, and B. A. Grzybowski, “Nanoparticles that
‘remember’ temperature,” Small, vol. 6, no. 13. Wiley, pp. 1385–1387, 2010.
ista: Klajn R, Browne KP, Soh S, Grzybowski BA. 2010. Nanoparticles that “remember”
temperature. Small. 6(13), 1385–1387.
mla: Klajn, Rafal, et al. “Nanoparticles That ‘Remember’ Temperature.” Small,
vol. 6, no. 13, Wiley, 2010, pp. 1385–87, doi:10.1002/smll.200902272.
short: R. Klajn, K.P. Browne, S. Soh, B.A. Grzybowski, Small 6 (2010) 1385–1387.
date_created: 2023-08-01T09:48:38Z
date_published: 2010-07-05T00:00:00Z
date_updated: 2023-08-08T08:15:25Z
day: '05'
doi: 10.1002/smll.200902272
extern: '1'
external_id:
pmid:
- '20521264'
intvolume: ' 6'
issue: '13'
keyword:
- Biomaterials
- Biotechnology
- General Materials Science
- General Chemistry
language:
- iso: eng
month: '07'
oa_version: None
page: 1385-1387
pmid: 1
publication: Small
publication_identifier:
eissn:
- 1613-6829
issn:
- 1613-6810
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nanoparticles that “remember” temperature
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2010'
...
---
_id: '13412'
abstract:
- lang: eng
text: Nanoparticles (NPs) and molecular/supramolecular switches have attracted considerable
interest during the past decade on account of their unique properties and prominent
roles in the fields of organic chemistry and materials science. Materials derived
from the combination of these two components are now emerging in the literature.
This critical review evaluates materials which comprise NPs functionalised with
well-defined self-assembled monolayers of molecular and supramolecular switches.
We draw attention to the fact that immobilisation of switches on NPs does not,
in general, hamper their switching ability, although it can impart new properties
on the supporting particles. This premise leads us to the discussion of systems
in which switching on the surfaces of NPs can be used to modulate reversibly a
range of NP properties—optical, fluorescent, electrical, magnetic—as well as the
controlled release of small molecules. Finally, we discuss examples in which molecular
switches direct reversible self-assembly of NPs (308 references).
article_processing_charge: No
article_type: original
author:
- first_name: Rafal
full_name: Klajn, Rafal
id: 8e84690e-1e48-11ed-a02b-a1e6fb8bb53b
last_name: Klajn
- first_name: J. Fraser
full_name: Stoddart, J. Fraser
last_name: Stoddart
- first_name: Bartosz A.
full_name: Grzybowski, Bartosz A.
last_name: Grzybowski
citation:
ama: Klajn R, Stoddart JF, Grzybowski BA. Nanoparticles functionalised with reversible
molecular and supramolecular switches. Chemical Society Reviews. 2010;39(6):2203-2237.
doi:10.1039/b920377j
apa: Klajn, R., Stoddart, J. F., & Grzybowski, B. A. (2010). Nanoparticles functionalised
with reversible molecular and supramolecular switches. Chemical Society Reviews.
Royal Society of Chemistry. https://doi.org/10.1039/b920377j
chicago: Klajn, Rafal, J. Fraser Stoddart, and Bartosz A. Grzybowski. “Nanoparticles
Functionalised with Reversible Molecular and Supramolecular Switches.” Chemical
Society Reviews. Royal Society of Chemistry, 2010. https://doi.org/10.1039/b920377j.
ieee: R. Klajn, J. F. Stoddart, and B. A. Grzybowski, “Nanoparticles functionalised
with reversible molecular and supramolecular switches,” Chemical Society Reviews,
vol. 39, no. 6. Royal Society of Chemistry, pp. 2203–2237, 2010.
ista: Klajn R, Stoddart JF, Grzybowski BA. 2010. Nanoparticles functionalised with
reversible molecular and supramolecular switches. Chemical Society Reviews. 39(6),
2203–2237.
mla: Klajn, Rafal, et al. “Nanoparticles Functionalised with Reversible Molecular
and Supramolecular Switches.” Chemical Society Reviews, vol. 39, no. 6,
Royal Society of Chemistry, 2010, pp. 2203–37, doi:10.1039/b920377j.
short: R. Klajn, J.F. Stoddart, B.A. Grzybowski, Chemical Society Reviews 39 (2010)
2203–2237.
date_created: 2023-08-01T09:49:07Z
date_published: 2010-04-21T00:00:00Z
date_updated: 2023-08-08T08:19:00Z
day: '21'
doi: 10.1039/b920377j
extern: '1'
external_id:
pmid:
- '20407689'
intvolume: ' 39'
issue: '6'
keyword:
- General Chemistry
language:
- iso: eng
month: '04'
oa_version: None
page: 2203-2237
pmid: 1
publication: Chemical Society Reviews
publication_identifier:
eissn:
- 1460-4744
issn:
- 0306-0012
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nanoparticles functionalised with reversible molecular and supramolecular switches
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2010'
...
---
_id: '1465'
abstract:
- lang: eng
text: We prove a generating function formula for the Betti numbers of Nakajima quiver
varieties. We prove that it is a q-deformation of the Weyl-Kac character formula.
In particular this implies that the constant term of the polynomial counting the
number of absolutely indecomposable representations of a quiver equals the multiplicity
of a certain weight in the corresponding Kac-Moody algebra, which was conjectured
by Kac in 1982.
acknowledgement: This work has been supported by a Royal Society University Research
Fellowship, NSF grants DMS-0305505 and DMS-0604775 and an Alfred Sloan Fellowship
2005-2007.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
citation:
ama: Hausel T. Kac’s conjecture from Nakajima quiver varieties. Inventiones Mathematicae.
2010;181(1):21-37. doi:10.1007/s00222-010-0241-3
apa: Hausel, T. (2010). Kac’s conjecture from Nakajima quiver varieties. Inventiones
Mathematicae. Springer. https://doi.org/10.1007/s00222-010-0241-3
chicago: Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” Inventiones
Mathematicae. Springer, 2010. https://doi.org/10.1007/s00222-010-0241-3.
ieee: T. Hausel, “Kac’s conjecture from Nakajima quiver varieties,” Inventiones
Mathematicae, vol. 181, no. 1. Springer, pp. 21–37, 2010.
ista: Hausel T. 2010. Kac’s conjecture from Nakajima quiver varieties. Inventiones
Mathematicae. 181(1), 21–37.
mla: Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” Inventiones
Mathematicae, vol. 181, no. 1, Springer, 2010, pp. 21–37, doi:10.1007/s00222-010-0241-3.
short: T. Hausel, Inventiones Mathematicae 181 (2010) 21–37.
date_created: 2018-12-11T11:52:11Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2021-01-12T06:50:56Z
day: '01'
doi: 10.1007/s00222-010-0241-3
extern: 1
intvolume: ' 181'
issue: '1'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/0811.1569
month: '07'
oa: 1
page: 21 - 37
publication: Inventiones Mathematicae
publication_status: published
publisher: Springer
publist_id: '5730'
quality_controlled: 0
status: public
title: Kac's conjecture from Nakajima quiver varieties
type: journal_article
volume: 181
year: '2010'
...