[{"abstract":[{"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 &quot;reward&quot; 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.","lang":"eng"}],"publisher":"Springer","alternative_title":["LNCS"],"quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.6803df"}],"date_published":"2010-08-30T00:00:00Z","day":"30","type":"conference","title":"Cosegmentation revisited: Models and optimization","author":[{"first_name":"Sara","last_name":"Vicente","full_name":"Vicente, Sara"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"}],"citation":{"chicago":"Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Cosegmentation Revisited: Models and Optimization,” 6312:465–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">https://doi.org/10.1007/978-3-642-15552-9_34</a>.","apa":"Vicente, S., Kolmogorov, V., &#38; Rother, C. (2010). Cosegmentation revisited: Models and optimization (Vol. 6312, pp. 465–479). Presented at the ECCV: European Conference on Computer Vision, Springer. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">https://doi.org/10.1007/978-3-642-15552-9_34</a>","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.","short":"S. Vicente, V. Kolmogorov, C. Rother, in:, Springer, 2010, pp. 465–479.","mla":"Vicente, Sara, et al. <i>Cosegmentation Revisited: Models and Optimization</i>. Vol. 6312, Springer, 2010, pp. 465–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">10.1007/978-3-642-15552-9_34</a>.","ista":"Vicente S, Kolmogorov V, Rother C. 2010. Cosegmentation revisited: Models and optimization. ECCV: European Conference on Computer Vision, LNCS, vol. 6312, 465–479.","ama":"Vicente S, Kolmogorov V, Rother C. Cosegmentation revisited: Models and optimization. In: Vol 6312. Springer; 2010:465-479. doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_34\">10.1007/978-3-642-15552-9_34</a>"},"publist_id":"3479","conference":{"name":"ECCV: European Conference on Computer Vision"},"date_created":"2018-12-11T12:01:59Z","intvolume":"      6312","date_updated":"2021-01-12T07:41:46Z","volume":6312,"_id":"3201","year":"2010","extern":1,"publication_status":"published","doi":"10.1007/978-3-642-15552-9_34","status":"public","page":"465 - 479","month":"08"},{"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."}],"publisher":"Springer","quality_controlled":0,"date_published":"2010-04-01T00:00:00Z","day":"01","type":"journal_article","title":"A faster algorithm for computing the principal sequence of partitions of a graph","author":[{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"}],"citation":{"mla":"Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph.” <i>Algorithmica</i>, vol. 56, no. 4, Springer, 2010, pp. 394–412, doi:<a href=\"https://doi.org/10.1007/s00453-008-9177-z\">10.1007/s00453-008-9177-z</a>.","short":"V. Kolmogorov, Algorithmica 56 (2010) 394–412.","ieee":"V. Kolmogorov, “A faster algorithm for computing the principal sequence of partitions of a graph,” <i>Algorithmica</i>, vol. 56, no. 4. Springer, pp. 394–412, 2010.","apa":"Kolmogorov, V. (2010). A faster algorithm for computing the principal sequence of partitions of a graph. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/s00453-008-9177-z\">https://doi.org/10.1007/s00453-008-9177-z</a>","chicago":"Kolmogorov, Vladimir. “A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph.” <i>Algorithmica</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s00453-008-9177-z\">https://doi.org/10.1007/s00453-008-9177-z</a>.","ama":"Kolmogorov V. A faster algorithm for computing the principal sequence of partitions of a graph. <i>Algorithmica</i>. 2010;56(4):394-412. doi:<a href=\"https://doi.org/10.1007/s00453-008-9177-z\">10.1007/s00453-008-9177-z</a>","ista":"Kolmogorov V. 2010. A faster algorithm for computing the principal sequence of partitions of a graph. Algorithmica. 56(4), 394–412."},"publist_id":"3480","date_created":"2018-12-11T12:01:59Z","intvolume":"        56","date_updated":"2021-01-12T07:41:46Z","volume":56,"extern":1,"_id":"3202","doi":"10.1007/s00453-008-9177-z","publication_status":"published","year":"2010","status":"public","page":"394 - 412","month":"04","publication":"Algorithmica","issue":"4"},{"date_published":"2010-03-26T00:00:00Z","quality_controlled":0,"alternative_title":["LNCS"],"abstract":[{"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.","lang":"eng"}],"publisher":"Springer","conference":{"name":"TCC: Theory of Cryptography Conference"},"citation":{"chicago":"Håstad, Johan, Rafael Pass, Douglas Wikström, and Krzysztof Z Pietrzak. “An Efficient Parallel Repetition Theorem,” 5978:1–18. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">https://doi.org/10.1007/978-3-642-11799-2_1</a>.","apa":"Håstad, J., Pass, R., Wikström, D., &#38; Pietrzak, K. Z. (2010). An efficient parallel repetition theorem (Vol. 5978, pp. 1–18). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">https://doi.org/10.1007/978-3-642-11799-2_1</a>","mla":"Håstad, Johan, et al. <i>An Efficient Parallel Repetition Theorem</i>. Vol. 5978, Springer, 2010, pp. 1–18, doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">10.1007/978-3-642-11799-2_1</a>.","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.","short":"J. Håstad, R. Pass, D. Wikström, K.Z. Pietrzak, in:, Springer, 2010, 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.","ama":"Håstad J, Pass R, Wikström D, Pietrzak KZ. An efficient parallel repetition theorem. In: Vol 5978. Springer; 2010:1-18. doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_1\">10.1007/978-3-642-11799-2_1</a>"},"publist_id":"3446","author":[{"last_name":"Håstad","first_name":"Johan","full_name":"Håstad, Johan"},{"full_name":"Pass, Rafael","last_name":"Pass","first_name":"Rafael"},{"full_name":"Wikström, Douglas","last_name":"Wikström","first_name":"Douglas"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Krzysztof Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"type":"conference","day":"26","title":"An efficient parallel repetition theorem","_id":"3233","doi":"10.1007/978-3-642-11799-2_1","extern":1,"year":"2010","publication_status":"published","status":"public","date_created":"2018-12-11T12:02:10Z","intvolume":"      5978","date_updated":"2021-01-12T07:41:59Z","volume":5978,"month":"03","page":"1 - 18"},{"month":"03","page":"343 - 360","_id":"3234","publication_status":"published","year":"2010","doi":"10.1007/978-3-642-11799-2_21","extern":1,"status":"public","intvolume":"      5978","date_created":"2018-12-11T12:02:10Z","volume":5978,"date_updated":"2021-01-12T07:41:59Z","conference":{"name":"TCC: Theory of Cryptography Conference"},"publist_id":"3447","citation":{"chicago":"Faust, Sebastian, Eike Kiltz, Krzysztof Z Pietrzak, and Guy Rothblum. “Leakage Resilient Signatures,” 5978:343–60. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">https://doi.org/10.1007/978-3-642-11799-2_21</a>.","short":"S. Faust, E. Kiltz, K.Z. Pietrzak, G. Rothblum, in:, Springer, 2010, pp. 343–360.","mla":"Faust, Sebastian, et al. <i>Leakage Resilient Signatures</i>. Vol. 5978, Springer, 2010, pp. 343–60, doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">10.1007/978-3-642-11799-2_21</a>.","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.","apa":"Faust, S., Kiltz, E., Pietrzak, K. Z., &#38; Rothblum, G. (2010). Leakage resilient signatures (Vol. 5978, pp. 343–360). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">https://doi.org/10.1007/978-3-642-11799-2_21</a>","ista":"Faust S, Kiltz E, Pietrzak KZ, Rothblum G. 2010. Leakage resilient signatures. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 343–360.","ama":"Faust S, Kiltz E, Pietrzak KZ, Rothblum G. Leakage resilient signatures. In: Vol 5978. Springer; 2010:343-360. doi:<a href=\"https://doi.org/10.1007/978-3-642-11799-2_21\">10.1007/978-3-642-11799-2_21</a>"},"author":[{"full_name":"Faust, Sebastian","last_name":"Faust","first_name":"Sebastian"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Krzysztof Pietrzak"},{"last_name":"Rothblum","first_name":"Guy","full_name":"Rothblum, Guy N"}],"type":"conference","day":"26","title":"Leakage resilient signatures","date_published":"2010-03-26T00:00:00Z","quality_controlled":0,"alternative_title":["LNCS"],"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 &quot;side-channel attacks&quot; which exploit leakage of information about the secret internal state. In this work we put forward the notion of &quot;leakage-resilient signatures,&quot; 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 &quot;only computation leaks information.&quot; 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. "}],"publisher":"Springer"},{"date_updated":"2021-01-12T07:42:00Z","volume":6223,"intvolume":"      6223","date_created":"2018-12-11T12:02:10Z","status":"public","year":"2010","_id":"3235","doi":"10.1007/978-3-642-14623-7_2","publication_status":"published","extern":1,"page":"21 - 40","month":"09","publisher":"Springer","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 &quot;step&quot; 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"],"quality_controlled":0,"date_published":"2010-09-30T00:00:00Z","title":"Leakage resilient pseudorandom functions and side channel attacks on feistel networks","day":"30","type":"conference","author":[{"first_name":"Yevgeniy","last_name":"Dodis","full_name":"Dodis, Yevgeniy"},{"full_name":"Krzysztof Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"publist_id":"3445","citation":{"mla":"Dodis, Yevgeniy, and Krzysztof Z. Pietrzak. <i>Leakage Resilient Pseudorandom Functions and Side Channel Attacks on Feistel Networks</i>. Vol. 6223, Springer, 2010, pp. 21–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">10.1007/978-3-642-14623-7_2</a>.","short":"Y. Dodis, K.Z. Pietrzak, in:, Springer, 2010, pp. 21–40.","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.","apa":"Dodis, Y., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">https://doi.org/10.1007/978-3-642-14623-7_2</a>","chicago":"Dodis, Yevgeniy, and Krzysztof Z Pietrzak. “Leakage Resilient Pseudorandom Functions and Side Channel Attacks on Feistel Networks,” 6223:21–40. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">https://doi.org/10.1007/978-3-642-14623-7_2</a>.","ama":"Dodis Y, Pietrzak KZ. Leakage resilient pseudorandom functions and side channel attacks on feistel networks. In: Vol 6223. Springer; 2010:21-40. doi:<a href=\"https://doi.org/10.1007/978-3-642-14623-7_2\">10.1007/978-3-642-14623-7_2</a>","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."},"conference":{"name":"CRYPTO: International Cryptology Conference"}},{"publist_id":"3444","citation":{"ista":"Kiltz E, Pietrzak KZ. 2010. Leakage resilient ElGamal encryption. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 6477, 595–612.","ama":"Kiltz E, Pietrzak KZ. Leakage resilient ElGamal encryption. In: Vol 6477. Springer; 2010:595-612. doi:<a href=\"https://doi.org/10.1007/978-3-642-17373-8_34\">10.1007/978-3-642-17373-8_34</a>","chicago":"Kiltz, Eike, and Krzysztof Z Pietrzak. “Leakage Resilient ElGamal Encryption,” 6477:595–612. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17373-8_34\">https://doi.org/10.1007/978-3-642-17373-8_34</a>.","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.","short":"E. Kiltz, K.Z. Pietrzak, in:, Springer, 2010, pp. 595–612.","apa":"Kiltz, E., &#38; 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. <a href=\"https://doi.org/10.1007/978-3-642-17373-8_34\">https://doi.org/10.1007/978-3-642-17373-8_34</a>","mla":"Kiltz, Eike, and Krzysztof Z. Pietrzak. <i>Leakage Resilient ElGamal Encryption</i>. Vol. 6477, Springer, 2010, pp. 595–612, doi:<a href=\"https://doi.org/10.1007/978-3-642-17373-8_34\">10.1007/978-3-642-17373-8_34</a>."},"conference":{"name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"title":"Leakage resilient ElGamal encryption","day":"14","type":"conference","author":[{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"full_name":"Krzysztof Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"quality_controlled":0,"date_published":"2010-01-14T00:00:00Z","publisher":"Springer","abstract":[{"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. ","lang":"eng"}],"alternative_title":["LNCS"],"page":"595 - 612","month":"01","volume":6477,"date_updated":"2021-01-12T07:42:01Z","date_created":"2018-12-11T12:02:11Z","intvolume":"      6477","status":"public","_id":"3237","year":"2010","doi":"10.1007/978-3-642-17373-8_34","publication_status":"published","extern":1},{"date_published":"2010-01-01T00:00:00Z","quality_controlled":0,"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."}],"publisher":"National Academy of Sciences","publist_id":"3347","citation":{"ama":"Iyengar A, Chakraborty Tuhin S, Goswami S, Wu C, Siddiqi O. Post eclosion odor experience modifies olfactory receptor neuron coding in Drosophila. <i>PNAS</i>. 2010;107(21):9855-9860. doi:<a href=\"https://doi.org/10.1073/pnas.1003856107\">10.1073/pnas.1003856107</a>","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.","short":"A. Iyengar, S. Chakraborty Tuhin, S. Goswami, C. Wu, O. Siddiqi, PNAS 107 (2010) 9855–60.","mla":"Iyengar, Atulya, et al. “Post Eclosion Odor Experience Modifies Olfactory Receptor Neuron Coding in Drosophila.” <i>PNAS</i>, vol. 107, no. 21, National Academy of Sciences, 2010, pp. 9855–60, doi:<a href=\"https://doi.org/10.1073/pnas.1003856107\">10.1073/pnas.1003856107</a>.","apa":"Iyengar, A., Chakraborty Tuhin, S., Goswami, S., Wu, C., &#38; Siddiqi, O. (2010). Post eclosion odor experience modifies olfactory receptor neuron coding in Drosophila. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1003856107\">https://doi.org/10.1073/pnas.1003856107</a>","ieee":"A. Iyengar, S. Chakraborty Tuhin, S. Goswami, C. Wu, and O. Siddiqi, “Post eclosion odor experience modifies olfactory receptor neuron coding in Drosophila,” <i>PNAS</i>, vol. 107, no. 21. National Academy of Sciences, pp. 9855–60, 2010.","chicago":"Iyengar, Atulya, Subhra Chakraborty Tuhin, Sarit Goswami, Chun Wu, and Obaid Siddiqi. “Post Eclosion Odor Experience Modifies Olfactory Receptor Neuron Coding in Drosophila.” <i>PNAS</i>. National Academy of Sciences, 2010. <a href=\"https://doi.org/10.1073/pnas.1003856107\">https://doi.org/10.1073/pnas.1003856107</a>."},"author":[{"last_name":"Iyengar","first_name":"Atulya","full_name":"Iyengar, Atulya"},{"full_name":"Chakraborty Tuhin, Subhra","first_name":"Subhra","last_name":"Chakraborty Tuhin"},{"first_name":"Sarit","last_name":"Goswami","full_name":"Sarit Goswami","id":"3A578F32-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wu, Chun Fang","first_name":"Chun","last_name":"Wu"},{"full_name":"Siddiqi, Obaid","last_name":"Siddiqi","first_name":"Obaid"}],"type":"journal_article","day":"01","title":"Post eclosion odor experience modifies olfactory receptor neuron coding in Drosophila","extern":1,"_id":"3294","doi":"10.1073/pnas.1003856107","year":"2010","publication_status":"published","status":"public","date_created":"2018-12-11T12:02:31Z","intvolume":"       107","volume":107,"date_updated":"2021-01-12T07:42:27Z","issue":"21","publication":"PNAS","month":"01","page":"9855 - 60"},{"publist_id":"3345","citation":{"ieee":"C. Wojtan, “Animating physical phenomena with embedded surface meshes,” Georgia Institute of Technology, 2010.","apa":"Wojtan, C. (2010). <i>Animating physical phenomena with embedded surface meshes</i>. Georgia Institute of Technology.","short":"C. Wojtan, Animating Physical Phenomena with Embedded Surface Meshes, Georgia Institute of Technology, 2010.","mla":"Wojtan, Chris. <i>Animating Physical Phenomena with Embedded Surface Meshes</i>. Georgia Institute of Technology, 2010, pp. 1–175.","chicago":"Wojtan, Chris. “Animating Physical Phenomena with Embedded Surface Meshes.” Georgia Institute of Technology, 2010.","ama":"Wojtan C. Animating physical phenomena with embedded surface meshes. 2010:1-175.","ista":"Wojtan C. 2010. Animating physical phenomena with embedded surface meshes. Georgia Institute of Technology."},"title":"Animating physical phenomena with embedded surface meshes","day":"17","type":"dissertation","author":[{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan"}],"date_published":"2010-11-17T00:00:00Z","main_file_link":[{"url":"http://hdl.handle.net/1853/37256"}],"publisher":"Georgia Institute of Technology","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."}],"oa_version":"None","page":"1 - 175","month":"11","article_processing_charge":"No","date_updated":"2023-02-23T11:21:00Z","date_created":"2018-12-11T12:02:31Z","status":"public","_id":"3296","year":"2010","supervisor":[{"full_name":"Essa, Irfan","first_name":"Irfan","last_name":"Essa"},{"full_name":"Liu, Karen","last_name":"Liu","first_name":"Karen"},{"full_name":"Mucha, Peter","last_name":"Mucha","first_name":"Peter"},{"full_name":"Rossignac, Jarek","last_name":"Rossignac","first_name":"Jarek"}],"extern":"1","publication_status":"published","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"12","page":"1389 - 1410","issue":"4","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. ","oa_version":"Submitted Version","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"isi":1,"status":"public","_id":"3303","doi":"10.1534/genetics.110.123240","date_updated":"2025-09-30T09:47:59Z","volume":186,"date_created":"2018-12-11T12:02:33Z","title":"The rate of fitness-valley crossing in sexual populations","type":"journal_article","citation":{"ista":"Weissman D, Feldman M, Fisher D. 2010. The rate of fitness-valley crossing in sexual populations. Genetics. 186(4), 1389–1410.","ama":"Weissman D, Feldman M, Fisher D. The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. 2010;186(4):1389-1410. doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>","chicago":"Weissman, Daniel, Marcus Feldman, and Daniel Fisher. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>. Genetics Society of America, 2010. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>.","short":"D. Weissman, M. Feldman, D. Fisher, Genetics 186 (2010) 1389–1410.","mla":"Weissman, Daniel, et al. “The Rate of Fitness-Valley Crossing in Sexual Populations.” <i>Genetics</i>, vol. 186, no. 4, Genetics Society of America, 2010, pp. 1389–410, doi:<a href=\"https://doi.org/10.1534/genetics.110.123240\">10.1534/genetics.110.123240</a>.","apa":"Weissman, D., Feldman, M., &#38; Fisher, D. (2010). The rate of fitness-valley crossing in sexual populations. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.110.123240\">https://doi.org/10.1534/genetics.110.123240</a>","ieee":"D. Weissman, M. Feldman, and D. Fisher, “The rate of fitness-valley crossing in sexual populations,” <i>Genetics</i>, vol. 186, no. 4. Genetics Society of America, pp. 1389–1410, 2010."},"publisher":"Genetics Society of America","abstract":[{"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. ","lang":"eng"}],"date_published":"2010-12-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2998319/"}],"quality_controlled":"1","department":[{"_id":"NiBa"}],"external_id":{"isi":["000285297000025"]},"article_processing_charge":"No","scopus_import":"1","publication":"Genetics","corr_author":"1","year":"2010","publication_status":"published","intvolume":"       186","author":[{"id":"2D0CE020-F248-11E8-B48F-1D18A9856A87","full_name":"Weissman, Daniel","last_name":"Weissman","first_name":"Daniel"},{"first_name":"Marcus","last_name":"Feldman","full_name":"Feldman, Marcus"},{"last_name":"Fisher","first_name":"Daniel","full_name":"Fisher, Daniel"}],"day":"01","publist_id":"3337","ec_funded":1,"project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425"}]},{"publist_id":"3334","citation":{"ista":"Evans S, Sturmfels B, Uhler C. 2010. Commuting birth and death processes. The Annals of Applied Probability. 20, 238–266.","ama":"Evans S, Sturmfels B, Uhler C. Commuting birth and death processes. <i>The Annals of Applied Probability</i>. 2010;20:238-266. doi:<a href=\"https://doi.org/10.1214/09-AAP615\">10.1214/09-AAP615</a>","chicago":"Evans, Steven, Bernd Sturmfels, and Caroline Uhler. “Commuting Birth and Death Processes.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2010. <a href=\"https://doi.org/10.1214/09-AAP615\">https://doi.org/10.1214/09-AAP615</a>.","ieee":"S. Evans, B. Sturmfels, and C. Uhler, “Commuting birth and death processes,” <i>The Annals of Applied Probability</i>, vol. 20. Institute of Mathematical Statistics, pp. 238–266, 2010.","short":"S. Evans, B. Sturmfels, C. Uhler, The Annals of Applied Probability 20 (2010) 238–266.","apa":"Evans, S., Sturmfels, B., &#38; Uhler, C. (2010). Commuting birth and death processes. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/09-AAP615\">https://doi.org/10.1214/09-AAP615</a>","mla":"Evans, Steven, et al. “Commuting Birth and Death Processes.” <i>The Annals of Applied Probability</i>, vol. 20, Institute of Mathematical Statistics, 2010, pp. 238–66, doi:<a href=\"https://doi.org/10.1214/09-AAP615\">10.1214/09-AAP615</a>."},"title":"Commuting birth and death processes","day":"01","type":"journal_article","author":[{"first_name":"Steven","last_name":"Evans","full_name":"Evans, Steven N"},{"last_name":"Sturmfels","first_name":"Bernd","full_name":"Sturmfels, Bernd"},{"orcid":"0000-0002-7008-0216","last_name":"Uhler","first_name":"Caroline","full_name":"Caroline Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":0,"date_published":"2010-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0812.2724"}],"publisher":"Institute of Mathematical Statistics","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.","publication":"The Annals of Applied Probability","page":"238 - 266","month":"01","date_updated":"2021-01-12T07:42:32Z","volume":20,"intvolume":"        20","date_created":"2018-12-11T12:02:35Z","status":"public","_id":"3306","doi":"10.1214/09-AAP615","extern":1,"year":"2010","publication_status":"published","oa":1},{"page":"603 - 638","month":"08","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.","publication":"Annals of the Institute of Statistical Mathematics","issue":"4","oa":1,"date_updated":"2021-01-12T07:42:33Z","volume":62,"intvolume":"        62","date_created":"2018-12-11T12:02:35Z","status":"public","_id":"3308","extern":1,"year":"2010","publication_status":"published","doi":"10.1007/s10463-010-0295-4","title":"Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry","day":"01","type":"journal_article","author":[{"last_name":"Sturmfels","first_name":"Bernd","full_name":"Sturmfels, Bernd"},{"full_name":"Caroline Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","orcid":"0000-0002-7008-0216","first_name":"Caroline"}],"citation":{"chicago":"Sturmfels, Bernd, and Caroline Uhler. “Multivariate Gaussians, Semidefinite Matrix Completion, and Convex Algebraic Geometry.” <i>Annals of the Institute of Statistical Mathematics</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s10463-010-0295-4\">https://doi.org/10.1007/s10463-010-0295-4</a>.","short":"B. Sturmfels, C. Uhler, Annals of the Institute of Statistical Mathematics 62 (2010) 603–638.","ieee":"B. Sturmfels and C. Uhler, “Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry,” <i>Annals of the Institute of Statistical Mathematics</i>, vol. 62, no. 4. Springer, pp. 603–638, 2010.","apa":"Sturmfels, B., &#38; Uhler, C. (2010). Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry. <i>Annals of the Institute of Statistical Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s10463-010-0295-4\">https://doi.org/10.1007/s10463-010-0295-4</a>","mla":"Sturmfels, Bernd, and Caroline Uhler. “Multivariate Gaussians, Semidefinite Matrix Completion, and Convex Algebraic Geometry.” <i>Annals of the Institute of Statistical Mathematics</i>, vol. 62, no. 4, Springer, 2010, pp. 603–38, doi:<a href=\"https://doi.org/10.1007/s10463-010-0295-4\">10.1007/s10463-010-0295-4</a>.","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.","ama":"Sturmfels B, Uhler C. Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry. <i>Annals of the Institute of Statistical Mathematics</i>. 2010;62(4):603-638. doi:<a href=\"https://doi.org/10.1007/s10463-010-0295-4\">10.1007/s10463-010-0295-4</a>"},"publist_id":"3332","publisher":"Springer","abstract":[{"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.","lang":"eng"}],"quality_controlled":0,"date_published":"2010-08-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/0906.3529","open_access":"1"}]},{"author":[{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vasu Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"}],"type":"journal_article","day":"01","title":"Model checking transactional memories","publist_id":"3000","citation":{"ama":"Guerraoui R, Henzinger TA, Singh V. Model checking transactional memories. <i>Distributed Computing</i>. 2010;22(3):129-145. doi:<a href=\"https://doi.org/10.1007/s00446-009-0092-6\">10.1007/s00446-009-0092-6</a>","ista":"Guerraoui R, Henzinger TA, Singh V. 2010. Model checking transactional memories. Distributed Computing. 22(3), 129–145.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Model checking transactional memories,” <i>Distributed Computing</i>, vol. 22, no. 3. Springer, pp. 129–145, 2010.","apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2010). Model checking transactional memories. <i>Distributed Computing</i>. Springer. <a href=\"https://doi.org/10.1007/s00446-009-0092-6\">https://doi.org/10.1007/s00446-009-0092-6</a>","short":"R. Guerraoui, T.A. Henzinger, V. Singh, Distributed Computing 22 (2010) 129–145.","mla":"Guerraoui, Rachid, et al. “Model Checking Transactional Memories.” <i>Distributed Computing</i>, vol. 22, no. 3, Springer, 2010, pp. 129–45, doi:<a href=\"https://doi.org/10.1007/s00446-009-0092-6\">10.1007/s00446-009-0092-6</a>.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Model Checking Transactional Memories.” <i>Distributed Computing</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s00446-009-0092-6\">https://doi.org/10.1007/s00446-009-0092-6</a>."},"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."}],"publisher":"Springer","main_file_link":[{"url":"http://infoscience.epfl.ch/record/117513/files/PLDI_paper.pdf","open_access":"0"}],"date_published":"2010-03-01T00:00:00Z","quality_controlled":0,"pubrep_id":"74","month":"03","page":"129 - 145","issue":"3","publication":"Distributed Computing","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.","_id":"3402","doi":"10.1007/s00446-009-0092-6","publication_status":"published","year":"2010","extern":1,"status":"public","date_created":"2018-12-11T12:03:08Z","intvolume":"        22","volume":22,"date_updated":"2021-01-12T07:43:14Z"},{"issue":"6","publication":"Neuron","month":"12","page":"1015 - 1016","_id":"3403","doi":"10.1016/j.neuron.2010.12.011","extern":1,"publication_status":"published","year":"2010","status":"public","date_created":"2018-12-11T12:03:08Z","intvolume":"        68","volume":68,"date_updated":"2019-05-10T12:19:51Z","citation":{"ista":"Pleydell Bouverie B, Csicsvari JL. 2010. Rate remapping: When the code goes beyond space (preview). Neuron. 68(6), 1015–1016.","ama":"Pleydell Bouverie B, Csicsvari JL. Rate remapping: When the code goes beyond space (preview). <i>Neuron</i>. 2010;68(6):1015-1016. doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.12.011\">10.1016/j.neuron.2010.12.011</a>","chicago":"Pleydell Bouverie, Barty, and Jozsef L Csicsvari. “Rate Remapping: When the Code Goes beyond Space (Preview).” <i>Neuron</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.neuron.2010.12.011\">https://doi.org/10.1016/j.neuron.2010.12.011</a>.","mla":"Pleydell Bouverie, Barty, and Jozsef L. Csicsvari. “Rate Remapping: When the Code Goes beyond Space (Preview).” <i>Neuron</i>, vol. 68, no. 6, Elsevier, 2010, pp. 1015–16, doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.12.011\">10.1016/j.neuron.2010.12.011</a>.","short":"B. Pleydell Bouverie, J.L. Csicsvari, Neuron 68 (2010) 1015–1016.","ieee":"B. Pleydell Bouverie and J. L. Csicsvari, “Rate remapping: When the code goes beyond space (preview),” <i>Neuron</i>, vol. 68, no. 6. Elsevier, pp. 1015–1016, 2010.","apa":"Pleydell Bouverie, B., &#38; Csicsvari, J. L. (2010). Rate remapping: When the code goes beyond space (preview). <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2010.12.011\">https://doi.org/10.1016/j.neuron.2010.12.011</a>"},"publist_id":"2999","author":[{"last_name":"Pleydell Bouverie","first_name":"Barty","full_name":"Pleydell-Bouverie, Barty"},{"orcid":"0000-0002-5193-4036","last_name":"Csicsvari","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Jozsef Csicsvari"}],"day":"22","type":"review","title":"Rate remapping: When the code goes beyond space (preview)","date_published":"2010-12-22T00:00:00Z","quality_controlled":0,"abstract":[{"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.","lang":"eng"}],"publisher":"Elsevier"},{"_id":"3406","doi":"10.1016/j.bmc.2010.09.012","year":"2010","extern":1,"publication_status":"published","status":"public","date_created":"2018-12-11T12:03:10Z","intvolume":"        18","date_updated":"2019-04-26T07:22:27Z","volume":18,"issue":"22","publication":"Bioorganic and Medicinal Chemistry","month":"11","page":"7759 - 7772","date_published":"2010-11-15T00:00:00Z","quality_controlled":0,"abstract":[{"lang":"eng","text":"The impact of structural biology on the design of ligands (agonists, antagonists and modulators) for ionotropic glutamate receptors is reviewed."}],"publisher":"Elsevier","citation":{"ista":"Stawski P, Janovjak HL, Trauner D. 2010. Pharmacology of ionotropic glutamate receptors: a structural perspective. Bioorganic and Medicinal Chemistry. 18(22), 7759–7772.","ama":"Stawski P, Janovjak HL, Trauner D. Pharmacology of ionotropic glutamate receptors: a structural perspective. <i>Bioorganic and Medicinal Chemistry</i>. 2010;18(22):7759-7772. doi:<a href=\"https://doi.org/10.1016/j.bmc.2010.09.012\">10.1016/j.bmc.2010.09.012</a>","chicago":"Stawski, Philipp, Harald L Janovjak, and Dirk Trauner. “Pharmacology of Ionotropic Glutamate Receptors: A Structural Perspective.” <i>Bioorganic and Medicinal Chemistry</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.bmc.2010.09.012\">https://doi.org/10.1016/j.bmc.2010.09.012</a>.","mla":"Stawski, Philipp, et al. “Pharmacology of Ionotropic Glutamate Receptors: A Structural Perspective.” <i>Bioorganic and Medicinal Chemistry</i>, vol. 18, no. 22, Elsevier, 2010, pp. 7759–72, doi:<a href=\"https://doi.org/10.1016/j.bmc.2010.09.012\">10.1016/j.bmc.2010.09.012</a>.","short":"P. Stawski, H.L. Janovjak, D. Trauner, Bioorganic and Medicinal Chemistry 18 (2010) 7759–7772.","apa":"Stawski, P., Janovjak, H. L., &#38; Trauner, D. (2010). Pharmacology of ionotropic glutamate receptors: a structural perspective. <i>Bioorganic and Medicinal Chemistry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bmc.2010.09.012\">https://doi.org/10.1016/j.bmc.2010.09.012</a>","ieee":"P. Stawski, H. L. Janovjak, and D. Trauner, “Pharmacology of ionotropic glutamate receptors: a structural perspective,” <i>Bioorganic and Medicinal Chemistry</i>, vol. 18, no. 22. Elsevier, pp. 7759–7772, 2010."},"publist_id":"2996","author":[{"full_name":"Stawski, Philipp","first_name":"Philipp","last_name":"Stawski"},{"orcid":"0000-0002-8023-9315","last_name":"Janovjak","first_name":"Harald L","full_name":"Harald Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Trauner, Dirk","last_name":"Trauner","first_name":"Dirk"}],"type":"review","day":"15","title":"Pharmacology of ionotropic glutamate receptors: a structural perspective"},{"date_published":"2010-06-27T00:00:00Z","quality_controlled":0,"publisher":"Nature Publishing Group","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."}],"publist_id":"2995","citation":{"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.","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. <i>Nature Neuroscience</i>. 2010;13:1027-1032. doi:<a href=\"https://doi.org/10.1038/nn.2589\">10.1038/nn.2589</a>","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.” <i>Nature Neuroscience</i>. Nature Publishing Group, 2010. <a href=\"https://doi.org/10.1038/nn.2589\">https://doi.org/10.1038/nn.2589</a>.","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,” <i>Nature Neuroscience</i>, vol. 13. Nature Publishing Group, pp. 1027–1032, 2010.","short":"H.L. Janovjak, S. Szobota, C. Wyart, D. Trauner, E. Isacoff, Nature Neuroscience 13 (2010) 1027–1032.","apa":"Janovjak, H. L., Szobota, S., Wyart, C., Trauner, D., &#38; Isacoff, E. (2010). A light-gated, potassium-selective glutamate receptor for the optical inhibition of neuronal firing. <i>Nature Neuroscience</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nn.2589\">https://doi.org/10.1038/nn.2589</a>","mla":"Janovjak, Harald L., et al. “A Light-Gated, Potassium-Selective Glutamate Receptor for the Optical Inhibition of Neuronal Firing.” <i>Nature Neuroscience</i>, vol. 13, Nature Publishing Group, 2010, pp. 1027–32, doi:<a href=\"https://doi.org/10.1038/nn.2589\">10.1038/nn.2589</a>."},"author":[{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Harald Janovjak","first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315"},{"last_name":"Szobota","first_name":"Stephanie","full_name":"Szobota, Stephanie"},{"last_name":"Wyart","first_name":"Claire","full_name":"Wyart, Claire"},{"full_name":"Trauner, Dirk","last_name":"Trauner","first_name":"Dirk"},{"last_name":"Isacoff","first_name":"Ehud","full_name":"Isacoff, Ehud Y"}],"title":"A light-gated, potassium-selective glutamate receptor for the optical inhibition of neuronal firing","type":"journal_article","day":"27","status":"public","_id":"3407","year":"2010","doi":"10.1038/nn.2589","publication_status":"published","extern":1,"date_updated":"2021-01-12T07:43:16Z","volume":13,"date_created":"2018-12-11T12:03:10Z","intvolume":"        13","publication":"Nature Neuroscience","month":"06","page":"1027 - 1032"},{"publisher":"Springer","abstract":[{"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.","lang":"eng"}],"quality_controlled":0,"date_published":"2010-07-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/0811.1569","open_access":"1"}],"title":"Kac's conjecture from Nakajima quiver varieties","type":"journal_article","day":"01","author":[{"last_name":"Hausel","first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ista":"Hausel T. 2010. Kac’s conjecture from Nakajima quiver varieties. Inventiones Mathematicae. 181(1), 21–37.","ama":"Hausel T. Kac’s conjecture from Nakajima quiver varieties. <i>Inventiones Mathematicae</i>. 2010;181(1):21-37. doi:<a href=\"https://doi.org/10.1007/s00222-010-0241-3\">10.1007/s00222-010-0241-3</a>","chicago":"Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” <i>Inventiones Mathematicae</i>. Springer, 2010. <a href=\"https://doi.org/10.1007/s00222-010-0241-3\">https://doi.org/10.1007/s00222-010-0241-3</a>.","apa":"Hausel, T. (2010). Kac’s conjecture from Nakajima quiver varieties. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-010-0241-3\">https://doi.org/10.1007/s00222-010-0241-3</a>","mla":"Hausel, Tamás. “Kac’s Conjecture from Nakajima Quiver Varieties.” <i>Inventiones Mathematicae</i>, vol. 181, no. 1, Springer, 2010, pp. 21–37, doi:<a href=\"https://doi.org/10.1007/s00222-010-0241-3\">10.1007/s00222-010-0241-3</a>.","ieee":"T. Hausel, “Kac’s conjecture from Nakajima quiver varieties,” <i>Inventiones Mathematicae</i>, vol. 181, no. 1. Springer, pp. 21–37, 2010.","short":"T. Hausel, Inventiones Mathematicae 181 (2010) 21–37."},"publist_id":"5730","oa":1,"volume":181,"date_updated":"2021-01-12T06:50:56Z","date_created":"2018-12-11T11:52:11Z","intvolume":"       181","status":"public","_id":"1465","extern":1,"year":"2010","publication_status":"published","doi":"10.1007/s00222-010-0241-3","page":"21 - 37","month":"07","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.","publication":"Inventiones Mathematicae","issue":"1"},{"publisher":"Elsevier","abstract":[{"lang":"eng","text":"In Hausel et al. (2008) [10] we presented a conjecture generalizing the Cauchy formula for Macdonald polynomial. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a punctured Riemann surface of genus g. We proved several results which support this conjecture. Here we announce new results which are consequences of those in Hausel et al. (2008) [10]."}],"date_published":"2010-02-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/0905.3491","open_access":"1"}],"quality_controlled":0,"author":[{"last_name":"Hausel","first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Emmanuel","last_name":"Letellier","full_name":"Letellier, Emmanuel"},{"full_name":"Rodríguez Villegas, Fernando","first_name":"Fernando","last_name":"Rodríguez Villegas"}],"title":"Topology of character varieties and representations of quivers","type":"journal_article","day":"01","publist_id":"5731","citation":{"chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Topology of Character Varieties and Representations of Quivers.” <i>Comptes Rendus Mathematique</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">https://doi.org/10.1016/j.crma.2010.01.025</a>.","apa":"Hausel, T., Letellier, E., &#38; Rodríguez Villegas, F. (2010). Topology of character varieties and representations of quivers. <i>Comptes Rendus Mathematique</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">https://doi.org/10.1016/j.crma.2010.01.025</a>","ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Topology of character varieties and representations of quivers,” <i>Comptes Rendus Mathematique</i>, vol. 348, no. 3–4. Elsevier, pp. 131–135, 2010.","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Comptes Rendus Mathematique 348 (2010) 131–135.","mla":"Hausel, Tamás, et al. “Topology of Character Varieties and Representations of Quivers.” <i>Comptes Rendus Mathematique</i>, vol. 348, no. 3–4, Elsevier, 2010, pp. 131–35, doi:<a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">10.1016/j.crma.2010.01.025</a>.","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2010. Topology of character varieties and representations of quivers. Comptes Rendus Mathematique. 348(3–4), 131–135.","ama":"Hausel T, Letellier E, Rodríguez Villegas F. Topology of character varieties and representations of quivers. <i>Comptes Rendus Mathematique</i>. 2010;348(3-4):131-135. doi:<a href=\"https://doi.org/10.1016/j.crma.2010.01.025\">10.1016/j.crma.2010.01.025</a>"},"oa":1,"status":"public","_id":"1466","year":"2010","publication_status":"published","doi":"10.1016/j.crma.2010.01.025","extern":1,"date_updated":"2021-01-12T06:50:56Z","volume":348,"intvolume":"       348","date_created":"2018-12-11T11:52:11Z","month":"02","page":"131 - 135","issue":"3-4","publication":"Comptes Rendus Mathematique"},{"publication":"The Many Facets of Geometry: A Tribute to Nigel Hitchin","month":"09","status":"public","_id":"1468","doi":"10.1093/acprof:oso/9780199534920.003.0016","year":"2010","publication_status":"published","extern":1,"date_updated":"2021-01-12T06:50:57Z","date_created":"2018-12-11T11:52:12Z","oa":1,"publist_id":"5729","citation":{"chicago":"Hausel, Tamás. “S-Duality in HyperkäHler Hodge Theory.” In <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>. Oxford University Press, 2010. <a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">https://doi.org/10.1093/acprof:oso/9780199534920.003.0016</a>.","apa":"Hausel, T. (2010). S-Duality in HyperkäHler Hodge Theory. In <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">https://doi.org/10.1093/acprof:oso/9780199534920.003.0016</a>","ieee":"T. Hausel, “S-Duality in HyperkäHler Hodge Theory,” in <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>, Oxford University Press, 2010.","short":"T. Hausel, in:, The Many Facets of Geometry: A Tribute to Nigel Hitchin, Oxford University Press, 2010.","mla":"Hausel, Tamás. “S-Duality in HyperkäHler Hodge Theory.” <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>, Oxford University Press, 2010, doi:<a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">10.1093/acprof:oso/9780199534920.003.0016</a>.","ista":"Hausel T. 2010.S-Duality in HyperkäHler Hodge Theory. In: The Many Facets of Geometry: A Tribute to Nigel Hitchin. .","ama":"Hausel T. S-Duality in HyperkäHler Hodge Theory. In: <i>The Many Facets of Geometry: A Tribute to Nigel Hitchin</i>. Oxford University Press; 2010. doi:<a href=\"https://doi.org/10.1093/acprof:oso/9780199534920.003.0016\">10.1093/acprof:oso/9780199534920.003.0016</a>"},"author":[{"last_name":"Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel"}],"title":"S-Duality in HyperkäHler Hodge Theory","day":"01","type":"book_chapter","date_published":"2010-09-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0709.0504"}],"quality_controlled":0,"publisher":"Oxford University Press","abstract":[{"lang":"eng","text":"This chapter surveys the motivations, related results, and progress made towards the following problem, raised by Hitchin in 1995: What is the space of L2 harmonic forms on the moduli space of Higgs bundles on a Riemann surface?"}]},{"month":"07","page":"413 - 417","issue":"5990","publication":"Science","acknowledgement":"This study was supported by Friedrich Miescher Institute funds; a U.S. Office of Naval Research Naval International Cooperative Opportunities in Science and Technology Program grant; a Marie Curie Excellence grant and a European Union (EU) HEALTH-F2-223156 grant to B.R.; a grant from the EU (RETICIRC) to B.R. and S.P.; grants from the Agence nationale de la recherche (MEDINAS, RETINE) to S.P.; a Center Grant from Foundation Fighting Blindness (U.S.) to S.M.-S. and J.A.S.; grants from the Swiss National Science Foundation and the EU to D.T.; a grant from the EU (TREATRUSH) to J.A.S., S.P., and B.R.; a Marie Curie Postdoctoral Fellowship to D.B.; and a National Centers of Competence in Research Frontiers in Genetics fellowship to V.B. and A.C.G. The Ocular Genetics Unit at Trinity College Dublin is supported by Science Foundation Ireland","extern":1,"_id":"1800","year":"2010","doi":"10.1126/science.1190897","publication_status":"published","status":"public","intvolume":"       329","date_created":"2018-12-11T11:54:05Z","date_updated":"2021-01-12T06:53:17Z","volume":329,"author":[{"last_name":"Busskamp","first_name":"Volker","full_name":"Busskamp, Volker"},{"full_name":"Duebel, Jens","first_name":"Jens","last_name":"Duebel"},{"full_name":"Bálya, Dávid","last_name":"Bálya","first_name":"Dávid"},{"full_name":"Fradot, Mathias","last_name":"Fradot","first_name":"Mathias"},{"full_name":"Viney, Tim J","first_name":"Tim","last_name":"Viney"},{"id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","full_name":"Sandra Siegert","orcid":"0000-0001-8635-0877","last_name":"Siegert","first_name":"Sandra"},{"full_name":"Groner, Anna C","first_name":"Anna","last_name":"Groner"},{"last_name":"Cabuy","first_name":"Erik","full_name":"Cabuy, Erik"},{"full_name":"Forster, Valérie","last_name":"Forster","first_name":"Valérie"},{"full_name":"Seeliger, Mathias W","first_name":"Mathias","last_name":"Seeliger"},{"full_name":"Biel, Martin","last_name":"Biel","first_name":"Martin"},{"first_name":"Peter","last_name":"Humphries","full_name":"Humphries, Peter"},{"first_name":"Michel","last_name":"Pâques","full_name":"Pâques, Michel"},{"full_name":"Mohand-Saïd, Saddek","last_name":"Mohand Saïd","first_name":"Saddek"},{"full_name":"Trono, Didier","first_name":"Didier","last_name":"Trono"},{"last_name":"Deisseroth","first_name":"Karl","full_name":"Deisseroth, Karl A"},{"last_name":"Sähel","first_name":"José","full_name":"Sähel, José A"},{"full_name":"Picaud, Serge A","last_name":"Picaud","first_name":"Serge"},{"last_name":"Roska","first_name":"Botond","full_name":"Roska, Botond M"}],"type":"journal_article","day":"23","title":"Genetic reactivation of cone photoreceptors restores visual responses in retinitis pigmentosa","publist_id":"5310","citation":{"ama":"Busskamp V, Duebel J, Bálya D, et al. Genetic reactivation of cone photoreceptors restores visual responses in retinitis pigmentosa. <i>Science</i>. 2010;329(5990):413-417. doi:<a href=\"https://doi.org/10.1126/science.1190897\">10.1126/science.1190897</a>","ista":"Busskamp V, Duebel J, Bálya D, Fradot M, Viney T, Siegert S, Groner A, Cabuy E, Forster V, Seeliger M, Biel M, Humphries P, Pâques M, Mohand Saïd S, Trono D, Deisseroth K, Sähel J, Picaud S, Roska B. 2010. Genetic reactivation of cone photoreceptors restores visual responses in retinitis pigmentosa. Science. 329(5990), 413–417.","short":"V. Busskamp, J. Duebel, D. Bálya, M. Fradot, T. Viney, S. Siegert, A. Groner, E. Cabuy, V. Forster, M. Seeliger, M. Biel, P. Humphries, M. Pâques, S. Mohand Saïd, D. Trono, K. Deisseroth, J. Sähel, S. Picaud, B. Roska, Science 329 (2010) 413–417.","mla":"Busskamp, Volker, et al. “Genetic Reactivation of Cone Photoreceptors Restores Visual Responses in Retinitis Pigmentosa.” <i>Science</i>, vol. 329, no. 5990, American Association for the Advancement of Science, 2010, pp. 413–17, doi:<a href=\"https://doi.org/10.1126/science.1190897\">10.1126/science.1190897</a>.","ieee":"V. Busskamp <i>et al.</i>, “Genetic reactivation of cone photoreceptors restores visual responses in retinitis pigmentosa,” <i>Science</i>, vol. 329, no. 5990. American Association for the Advancement of Science, pp. 413–417, 2010.","apa":"Busskamp, V., Duebel, J., Bálya, D., Fradot, M., Viney, T., Siegert, S., … Roska, B. (2010). Genetic reactivation of cone photoreceptors restores visual responses in retinitis pigmentosa. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1190897\">https://doi.org/10.1126/science.1190897</a>","chicago":"Busskamp, Volker, Jens Duebel, Dávid Bálya, Mathias Fradot, Tim Viney, Sandra Siegert, Anna Groner, et al. “Genetic Reactivation of Cone Photoreceptors Restores Visual Responses in Retinitis Pigmentosa.” <i>Science</i>. American Association for the Advancement of Science, 2010. <a href=\"https://doi.org/10.1126/science.1190897\">https://doi.org/10.1126/science.1190897</a>."},"abstract":[{"text":"Retinitis pigmentosa refers to a diverse group of hereditary diseases that lead to incurable blindness, affecting two million people worldwide. As a common pathology, rod photoreceptors die early, whereas light-insensitive, morphologically altered cone photoreceptors persist longer. It is unknown if these cones are accessible for therapeutic intervention. Here, we show that expression of archaebacterial halorhodopsin in light-insensitive cones can substitute for the native phototransduction cascade and restore light sensitivity in mouse models of retinitis pigmentosa. Resensitized photoreceptors activate all retinal cone pathways, drive sophisticated retinal circuit functions (including directional selectivity), activate cortical circuits, and mediate visually guided behaviors. Using human ex vivo retinas, we show that halorhodopsin can reactivate light-insensitive human photoreceptors. Finally, we identified blind patients with persisting, light-insensitive cones for potential halorhodopsin-based therapy.","lang":"eng"}],"publisher":"American Association for the Advancement of Science","date_published":"2010-07-23T00:00:00Z","quality_controlled":0},{"issue":"7321","publication":"Nature","month":"11","page":"300 - 304","status":"public","_id":"1300","extern":1,"year":"2010","publication_status":"published","doi":"10.1038/nature09545","date_updated":"2021-01-12T06:49:44Z","volume":468,"date_created":"2018-12-11T11:51:14Z","intvolume":"       468","citation":{"ista":"Jösch MA, Schnell B, Raghu S, Reiff D, Borst A. 2010. ON and off pathways in Drosophila motion vision. Nature. 468(7321), 300–304.","ama":"Jösch MA, Schnell B, Raghu S, Reiff D, Borst A. ON and off pathways in Drosophila motion vision. <i>Nature</i>. 2010;468(7321):300-304. doi:<a href=\"https://doi.org/10.1038/nature09545\">10.1038/nature09545</a>","chicago":"Jösch, Maximilian A, Bettina Schnell, Shamprasad Raghu, Dierk Reiff, and Alexander Borst. “ON and off Pathways in Drosophila Motion Vision.” <i>Nature</i>. Nature Publishing Group, 2010. <a href=\"https://doi.org/10.1038/nature09545\">https://doi.org/10.1038/nature09545</a>.","apa":"Jösch, M. A., Schnell, B., Raghu, S., Reiff, D., &#38; Borst, A. (2010). ON and off pathways in Drosophila motion vision. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature09545\">https://doi.org/10.1038/nature09545</a>","ieee":"M. A. Jösch, B. Schnell, S. Raghu, D. Reiff, and A. Borst, “ON and off pathways in Drosophila motion vision,” <i>Nature</i>, vol. 468, no. 7321. Nature Publishing Group, pp. 300–304, 2010.","short":"M.A. Jösch, B. Schnell, S. Raghu, D. Reiff, A. Borst, Nature 468 (2010) 300–304.","mla":"Jösch, Maximilian A., et al. “ON and off Pathways in Drosophila Motion Vision.” <i>Nature</i>, vol. 468, no. 7321, Nature Publishing Group, 2010, pp. 300–04, doi:<a href=\"https://doi.org/10.1038/nature09545\">10.1038/nature09545</a>."},"publist_id":"5970","author":[{"full_name":"Maximilian Jösch","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3937-1330","last_name":"Jösch","first_name":"Maximilian A"},{"last_name":"Schnell","first_name":"Bettina","full_name":"Schnell, Bettina"},{"full_name":"Raghu, Shamprasad V","first_name":"Shamprasad","last_name":"Raghu"},{"full_name":"Reiff, Dierk F","last_name":"Reiff","first_name":"Dierk"},{"full_name":"Borst, Alexander","last_name":"Borst","first_name":"Alexander"}],"title":"ON and off pathways in Drosophila motion vision","type":"journal_article","day":"11","date_published":"2010-11-11T00:00:00Z","quality_controlled":0,"publisher":"Nature Publishing Group","abstract":[{"text":"Motion vision is a major function of all visual systems, yet the underlying neural mechanisms and circuits are still elusive. In the lamina, the first optic neuropile of Drosophila melanogaster, photoreceptor signals split into five parallel pathways, L1-L5. Here we examine how these pathways contribute to visual motion detection by combining genetic block and reconstitution of neural activity in different lamina cell types with whole-cell recordings from downstream motion-sensitive neurons. We find reduced responses to moving gratings if L1 or L2 is blocked; however, reconstitution of photoreceptor input to only L1 or L2 results in wild-type responses. Thus, the first experiment indicates the necessity of both pathways, whereas the second indicates sufficiency of each single pathway. This contradiction can be explained by electrical coupling between L1 and L2, allowing for activation of both pathways even when only one of them receives photoreceptor input. A fundamental difference between the L1 pathway and the L2 pathway is uncovered when blocking L1 or L2 output while presenting moving edges of positive (ON) or negative (OFF) contrast polarity: blocking L1 eliminates the response to moving ON edges, whereas blocking L2 eliminates the response to moving OFF edges. Thus, similar to the segregation of photoreceptor signals in ON and OFF bipolar cell pathways in the vertebrate retina, photoreceptor signals segregate into ON-L1 and OFF-L2 channels in the lamina of Drosophila.","lang":"eng"}]}]