@article{920, abstract = {Most eukaryotic cells sense and respond to the mechanical properties of their surroundings. This can strongly influence their collective behavior in embryonic development, tissue function, and wound healing. We use a deformable substrate to measure collective behavior in cell motion due to substrate mediated cell-cell interactions. We quantify spatial and temporal correlations in migration velocity and substrate deformation, and show that cooperative cell-driven patterns of substrate deformation mediate long-distance mechanical coupling between cells and control collective cell migration.}, author = {Angelini, Thomas and Hannezo, Edouard B and Trepat, Xavier and Fredberg, Jeffrey and Weitz, David}, journal = {Physical Review Letters}, number = {16}, publisher = {American Physical Society}, title = {{Cell migration driven by cooperative substrate deformation patterns}}, doi = {10.1103/PhysRevLett.104.168104}, volume = {104}, year = {2010}, } @article{9452, abstract = {Eukaryotic cytosine methylation represses transcription but also occurs in the bodies of active genes, and the extent of methylation biology conservation is unclear. We quantified DNA methylation in 17 eukaryotic genomes and found that gene body methylation is conserved between plants and animals, whereas selective methylation of transposons is not. We show that methylation of plant transposons in the CHG context extends to green algae and that exclusion of histone H2A.Z from methylated DNA is conserved between plants and animals, and we present evidence for RNA-directed DNA methylation of fungal genes. Our data demonstrate that extant DNA methylation systems are mosaics of conserved and derived features, and indicate that gene body methylation is an ancient property of eukaryotic genomes.}, author = {Zemach, Assaf and McDaniel, Ivy E. and Silva, Pedro and Zilberman, Daniel}, issn = {1095-9203}, journal = {Science}, keywords = {Multidisciplinary}, number = {5980}, pages = {916--919}, publisher = {American Association for the Advancement of Science}, title = {{Genome-wide evolutionary analysis of eukaryotic DNA methylation}}, doi = {10.1126/science.1186366}, volume = {328}, year = {2010}, } @article{9485, abstract = {Cytosine methylation silences transposable elements in plants, vertebrates, and fungi but also regulates gene expression. Plant methylation is catalyzed by three families of enzymes, each with a preferred sequence context: CG, CHG (H = A, C, or T), and CHH, with CHH methylation targeted by the RNAi pathway. Arabidopsis thaliana endosperm, a placenta-like tissue that nourishes the embryo, is globally hypomethylated in the CG context while retaining high non-CG methylation. Global methylation dynamics in seeds of cereal crops that provide the bulk of human nutrition remain unknown. Here, we show that rice endosperm DNA is hypomethylated in all sequence contexts. Non-CG methylation is reduced evenly across the genome, whereas CG hypomethylation is localized. CHH methylation of small transposable elements is increased in embryos, suggesting that endosperm demethylation enhances transposon silencing. Genes preferentially expressed in endosperm, including those coding for major storage proteins and starch synthesizing enzymes, are frequently hypomethylated in endosperm, indicating that DNA methylation is a crucial regulator of rice endosperm biogenesis. Our data show that genome-wide reshaping of seed DNA methylation is conserved among angiosperms and has a profound effect on gene expression in cereal crops.}, author = {Zemach, Assaf and Kim, M. Yvonne and Silva, Pedro and Rodrigues, Jessica A. and Dotson, Bradley and Brooks, Matthew D. and Zilberman, Daniel}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences}, number = {43}, pages = {18729--18734}, publisher = {National Academy of Sciences}, title = {{Local DNA hypomethylation activates genes in rice endosperm}}, doi = {10.1073/pnas.1009695107}, volume = {107}, year = {2010}, } @article{9489, abstract = {Cytosine methylation is an ancient process with conserved enzymology but diverse biological functions that include defense against transposable elements and regulation of gene expression. Here we will discuss the evolution and biological significance of eukaryotic DNA methylation, the likely drivers of that evolution, and major remaining mysteries.}, author = {Zemach, Assaf and Zilberman, Daniel}, issn = {1879-0445}, journal = {Current Biology}, number = {17}, pages = {R780--R785}, publisher = {Elsevier}, title = {{Evolution of eukaryotic DNA methylation and the pursuit of safer sex}}, doi = {10.1016/j.cub.2010.07.007}, volume = {20}, year = {2010}, } @misc{9764, author = {Rosas, Ulises and Barton, Nicholas H and Copsey, Lucy and Barbier De Reuille, Pierre and Coen, Enrico}, publisher = {Public Library of Science}, title = {{Heterosis and the drift load}}, doi = {10.1371/journal.pbio.1000429.s003}, year = {2010}, } @article{7078, abstract = {We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction, magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate that our Bridgman-grown single crystals have a p-type carrier concentration of 3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3. Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K, the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature of 294 K. For each sample type, three-terminal capacitive dilatometry measurements detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on SnTe show elastic hardening near the structural transition, pointing to co-elastic behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening, pointing to ferroelastic behavior. Effective Debye temperature, θD, values of SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In addition, a precursor softening extending over approximately 100 K anticipates this collapse at the critical temperature and quantitative analysis over three decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02, a value indicating a three-dimensional softening of phonon branches at a temperature T0∼75 K, considerably below Tc. We suggest that the differences in these two types of elastic behaviors lie in the absence of elastic domain-wall motion in the one case and their nucleation in the other.}, author = {Salje, E. K. H. and Safarik, D. J. and Modic, Kimberly A and Gubernatis, J. E. and Cooley, J. C. and Taylor, R. D. and Mihaila, B. and Saxena, A. and Lookman, T. and Smith, J. L. and Fisher, R. A. and Pasternak, M. and Opeil, C. P. and Siegrist, T. and Littlewood, P. B. and Lashley, J. C.}, issn = {1098-0121}, journal = {Physical Review B}, number = {18}, publisher = {APS}, title = {{Tin telluride: A weakly co-elastic metal}}, doi = {10.1103/physrevb.82.184112}, volume = {82}, year = {2010}, } @article{7079, abstract = {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.}, author = {Drymiotis, Fivos R. and Drye, Tyler B. and Wang, Yisha and He, Jian and Rhodes, Daniel and Modic, Kimberly A and Cawthorne, Samantha and Zhang, Qiu Run}, issn = {0021-8979}, journal = {Journal of Applied Physics}, number = {3}, publisher = {AIP}, title = {{Structure formation and very low thermal conductivity in Pb:Te:Ag:Se mixtures}}, doi = {10.1063/1.3284946}, volume = {107}, year = {2010}, } @article{7318, abstract = {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.}, author = {Giordani, V. and Freunberger, Stefan Alexander and Bruce, P. G. and Tarascon, J.-M. and Larcher, D.}, issn = {1099-0062}, journal = {Electrochemical and Solid-State Letters}, number = {12}, publisher = {The Electrochemical Society}, title = {{H2O2 decomposition reaction as selecting tool for catalysts in Li–O2 cells}}, doi = {10.1149/1.3494045}, volume = {13}, year = {2010}, } @inproceedings{754, abstract = {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.}, author = {Alistarh, Dan-Adrian and Attiya, Hagit and Gilbert, Seth and Giurgiu, Andrei and Guerraoui, Rachid}, pages = {94 -- 108}, publisher = {Springer}, title = {{Fast randomized test-and-set and renaming}}, doi = {10.1007/978-3-642-15763-9_9}, volume = {6343 LNCS}, year = {2010}, } @inproceedings{755, abstract = {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.}, author = {Alistarh, Dan-Adrian and Gilbert, Seth and Guerraoui, Rachid and Zadimoghaddam, Morteza}, number = {PART 2}, pages = {115 -- 126}, publisher = {Springer}, title = {{How efficient can gossip be? (On the cost of resilient information exchange)}}, doi = {10.1007/978-3-642-14162-1_10}, volume = {6199 LNCS}, year = {2010}, } @inproceedings{756, abstract = {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.}, author = {Alistarh, Dan-Adrian and Gilbert, Seth and Guerraoui, Rachid and Milošević, Žarko and Newport, Calvin}, pages = {50 -- 59}, publisher = {ACM}, title = {{Securing every bit: Authenticated broadcast in radio networks}}, doi = {10.1145/1810479.1810489}, year = {2010}, } @article{3146, abstract = {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 = {Simon Hippenmeyer and Youn, Yong H and Moon, Hyang M and Miyamichi, Kazunari and Zong, Hui and Wynshaw-Boris, Anthony and Luo, Liqun}, journal = {Neuron}, number = {4}, pages = {695 -- 709}, publisher = {Elsevier}, title = {{Genetic mosaic dissection of Lis1 and Ndel1 in neuronal migration}}, doi = {10.1016/j.neuron.2010.09.027}, volume = {68}, year = {2010}, } @article{3153, abstract = {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 = {Daria Siekhaus and Haesemeyer, Martin and Moffitt, Olivia and Lehmann, Ruth}, journal = {Nature Cell Biology}, number = {6}, pages = {605 -- 610}, publisher = {Nature Publishing Group}, title = {{RhoL controls invasion and Rap1 localization during immune cell transmigration in Drosophila}}, volume = {12}, year = {2010}, } @inproceedings{3201, abstract = {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.}, author = {Vicente, Sara and Vladimir Kolmogorov and Rother, Carsten}, pages = {465 -- 479}, publisher = {Springer}, title = {{Cosegmentation revisited: Models and optimization}}, doi = {10.1007/978-3-642-15552-9_34}, volume = {6312}, year = {2010}, } @article{3202, abstract = {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 = {Vladimir Kolmogorov}, journal = {Algorithmica}, number = {4}, pages = {394 -- 412}, publisher = {Springer}, title = {{A faster algorithm for computing the principal sequence of partitions of a graph}}, doi = {10.1007/s00453-008-9177-z}, volume = {56}, year = {2010}, } @inproceedings{3233, abstract = {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.}, author = {Håstad, Johan and Pass, Rafael and Wikström, Douglas and Krzysztof Pietrzak}, pages = {1 -- 18}, publisher = {Springer}, title = {{An efficient parallel repetition theorem}}, doi = {10.1007/978-3-642-11799-2_1}, volume = {5978}, year = {2010}, } @inproceedings{3234, abstract = {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. }, author = {Faust, Sebastian and Kiltz, Eike and Krzysztof Pietrzak and Rothblum, Guy N}, pages = {343 -- 360}, publisher = {Springer}, title = {{Leakage resilient signatures}}, doi = {10.1007/978-3-642-11799-2_21}, volume = {5978}, year = {2010}, } @inproceedings{3235, abstract = {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.}, author = {Dodis, Yevgeniy and Krzysztof Pietrzak}, pages = {21 -- 40}, publisher = {Springer}, title = {{Leakage resilient pseudorandom functions and side channel attacks on feistel networks}}, doi = {10.1007/978-3-642-14623-7_2}, volume = {6223}, year = {2010}, } @inproceedings{3237, abstract = {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. }, author = {Kiltz, Eike and Krzysztof Pietrzak}, pages = {595 -- 612}, publisher = {Springer}, title = {{Leakage resilient ElGamal encryption}}, doi = {10.1007/978-3-642-17373-8_34}, volume = {6477}, year = {2010}, } @article{3294, abstract = {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 = {Iyengar, Atulya and Chakraborty Tuhin, Subhra and Sarit Goswami and Wu, Chun Fang and Siddiqi, Obaid}, journal = {PNAS}, number = {21}, pages = {9855 -- 60}, publisher = {National Academy of Sciences}, title = {{Post eclosion odor experience modifies olfactory receptor neuron coding in Drosophila}}, doi = {10.1073/pnas.1003856107}, volume = {107}, year = {2010}, }