[{"publisher":"ACM","year":"2003","_id":"2423","author":[{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Uli Wagner","last_name":"Wagner","first_name":"Uli"}],"page":"129 - 135","month":"06","type":"conference","abstract":[{"text":"A finite set N ⊃ Rd is a weak ε-net for an n-point set X ⊃ Rd (with respect to convex sets) if N intersects every convex set K with |K ∩ X| ≥ εn. We give an alternative, and arguably simpler, proof of the fact, first shown by Chazelle et al. [7], that every point set X in Rd admits a weak ε-net of cardinality O(ε-d polylog(1/ε)). Moreover, for a number of special point sets (e.g., for points on the moment curve), our method gives substantially better bounds. The construction yields an algorithm to construct such weak ε-nets in time O(n ln(1/ε)). We also prove, by a different method, a near-linear upper bound for points uniformly distributed on the (d - 1)-dimensional sphere.","lang":"eng"}],"date_updated":"2021-01-12T06:57:24Z","day":"01","title":"New constructions of weak epsilon-nets","date_created":"2018-12-11T11:57:34Z","publist_id":"4502","status":"public","conference":{"name":"SoCG: Symposium on Computational Geometry"},"extern":1,"citation":{"ama":"Matoušek J, Wagner U. New constructions of weak epsilon-nets. In: ACM; 2003:129-135. doi:<a href=\"https://doi.org/10.1145/777792.777813\">10.1145/777792.777813</a>","ista":"Matoušek J, Wagner U. 2003. New constructions of weak epsilon-nets. SoCG: Symposium on Computational Geometry, 129–135.","mla":"Matoušek, Jiří, and Uli Wagner. <i>New Constructions of Weak Epsilon-Nets</i>. ACM, 2003, pp. 129–35, doi:<a href=\"https://doi.org/10.1145/777792.777813\">10.1145/777792.777813</a>.","apa":"Matoušek, J., &#38; Wagner, U. (2003). New constructions of weak epsilon-nets (pp. 129–135). Presented at the SoCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/777792.777813\">https://doi.org/10.1145/777792.777813</a>","ieee":"J. Matoušek and U. Wagner, “New constructions of weak epsilon-nets,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 129–135.","chicago":"Matoušek, Jiří, and Uli Wagner. “New Constructions of Weak Epsilon-Nets,” 129–35. ACM, 2003. <a href=\"https://doi.org/10.1145/777792.777813\">https://doi.org/10.1145/777792.777813</a>.","short":"J. Matoušek, U. Wagner, in:, ACM, 2003, pp. 129–135."},"publication_status":"published","doi":"10.1145/777792.777813","date_published":"2003-06-01T00:00:00Z","quality_controlled":0},{"extern":1,"conference":{"name":"SoCG: Symposium on Computational Geometry"},"citation":{"ama":"Giesen J, Wagner U. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. In: ACM; 2003:329-337. doi:<a href=\"https://doi.org/10.1145/777792.777841\">10.1145/777792.777841</a>","mla":"Giesen, Joachim, and Uli Wagner. <i>Shape Dimension and Intrinsic Metric from Samples of Manifolds with High Co-Dimension</i>. ACM, 2003, pp. 329–37, doi:<a href=\"https://doi.org/10.1145/777792.777841\">10.1145/777792.777841</a>.","ista":"Giesen J, Wagner U. 2003. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. SoCG: Symposium on Computational Geometry, 329–337.","apa":"Giesen, J., &#38; Wagner, U. (2003). Shape dimension and intrinsic metric from samples of manifolds with high co-dimension (pp. 329–337). Presented at the SoCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/777792.777841\">https://doi.org/10.1145/777792.777841</a>","ieee":"J. Giesen and U. Wagner, “Shape dimension and intrinsic metric from samples of manifolds with high co-dimension,” presented at the SoCG: Symposium on Computational Geometry, 2003, pp. 329–337.","chicago":"Giesen, Joachim, and Uli Wagner. “Shape Dimension and Intrinsic Metric from Samples of Manifolds with High Co-Dimension,” 329–37. ACM, 2003. <a href=\"https://doi.org/10.1145/777792.777841\">https://doi.org/10.1145/777792.777841</a>.","short":"J. Giesen, U. Wagner, in:, ACM, 2003, pp. 329–337."},"status":"public","date_published":"2003-06-01T00:00:00Z","doi":"10.1145/777792.777841","quality_controlled":0,"publication_status":"published","_id":"2424","publisher":"ACM","year":"2003","title":"Shape dimension and intrinsic metric from samples of manifolds with high co-dimension","date_created":"2018-12-11T11:57:35Z","publist_id":"4501","page":"329 - 337","author":[{"full_name":"Giesen, Joachim","first_name":"Joachim","last_name":"Giesen"},{"full_name":"Uli Wagner","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner"}],"abstract":[{"text":"We introduce the adaptive neighborhood graph as a data structure for modeling a smooth manifold M embedded in some (potentially very high-dimensional) Euclidean space ℝd. We assume that M is known to us only through a finite sample P ⊂ M, as it is often the case in applications. The adaptive neighborhood graph is a geometric graph on P. Its complexity is at most min{2O(k)(n, n2}, where n = |P| and k = dim M, as opposed to the n⌈d/2⌉ complexity of the Delaunay triangulation, which is often used to model manifolds. We show that we can provably correctly infer the connectivity of M and the dimension of M from the adaptive neighborhood graph provided a certain standard sampling condition is fulfilled. The running time of the dimension detection algorithm is d2O(k7 log k) for each connected component of M. If the dimension is considered constant, this is a constant-time operation, and the adaptive neighborhood graph is of linear size. Moreover, the exponential dependence of the constants is only on the intrinsic dimension k, not on the ambient dimension d. This is of particular interest if the co-dimension is high, i.e., if k is much smaller than d, as is the case in many applications. The adaptive neighborhood graph also allows us to approximate the geodesic distances between the points in P.","lang":"eng"}],"day":"01","date_updated":"2021-01-12T06:57:24Z","month":"06","type":"conference"},{"title":"Resource interfaces","publist_id":"148","author":[{"full_name":"Chakrabarti, Arindam","first_name":"Arindam","last_name":"Chakrabarti"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Stoelinga","first_name":"Mariëlle","full_name":"Stoelinga, Mariëlle"}],"day":"29","publication":"Third International Conference on Embedded Software","scopus_import":"1","article_processing_charge":"No","publisher":"ACM","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1007/978-3-540-45212-6_9","quality_controlled":"1","publication_identifier":{"isbn":["9783540202233"]},"conference":{"start_date":"2003-10-13","name":"EMSOFT: Embedded Software ","location":"Philadelphia, PA, USA","end_date":"2003-10-15"},"language":[{"iso":"eng"}],"volume":2855,"date_created":"2018-12-11T12:09:29Z","page":"117 - 133","date_updated":"2024-01-08T10:48:11Z","abstract":[{"lang":"eng","text":"We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more components, when put together, exceed the available resources. Moreover, the formalism can be used to compute the quantity of resources necessary for satisfying the requirements of a collection of components. The formalism can be instantiated in several ways. For example, several components may draw power from the same source. Then, the formalism supports compatibility checks such as: can two components, when put together, achieve their tasks without ever exceeding the available amount of peak power? or, can they achieve their tasks by using no more than the initially available amount of energy (i.e., power accumulated over time)? The corresponding quantitative questions that our algorithms answer are the following: what is the amount of peak power needed for two components to be put together? what is the corresponding amount of initial energy? To solve these questions, we model interfaces with resource requirements as games with quantitative objectives. The games are played on state spaces where each state is labeled by a number (representing, e.g., power consumption), and a play produces an infinite path of labels. The objective may be, for example, to minimize the largest label that occurs during a play. We illustrate our approach by modeling compatibility questions for the components of robot control software, and of wireless sensor networks."}],"month":"09","type":"conference","oa_version":"None","_id":"4561","acknowledgement":"This research was supported in part by the DARPA grant F33615-00-C-1693, the MARCO grant 98-DT-660, the ONR grant N00014-02-1-0671, and the NSF grants CCR-0085949, CCR-0132780, CCR-0234690, and CCR-9988172.","year":"2003","date_published":"2003-09-29T00:00:00Z","publication_status":"published","intvolume":"      2855","extern":"1","citation":{"ama":"Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. Resource interfaces. In: <i>Third International Conference on Embedded Software</i>. Vol 2855. ACM; 2003:117-133. doi:<a href=\"https://doi.org/10.1007/978-3-540-45212-6_9\">10.1007/978-3-540-45212-6_9</a>","mla":"Chakrabarti, Arindam, et al. “Resource Interfaces.” <i>Third International Conference on Embedded Software</i>, vol. 2855, ACM, 2003, pp. 117–33, doi:<a href=\"https://doi.org/10.1007/978-3-540-45212-6_9\">10.1007/978-3-540-45212-6_9</a>.","ista":"Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. 2003. Resource interfaces. Third International Conference on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2855, 117–133.","apa":"Chakrabarti, A., De Alfaro, L., Henzinger, T. A., &#38; Stoelinga, M. (2003). Resource interfaces. In <i>Third International Conference on Embedded Software</i> (Vol. 2855, pp. 117–133). Philadelphia, PA, USA: ACM. <a href=\"https://doi.org/10.1007/978-3-540-45212-6_9\">https://doi.org/10.1007/978-3-540-45212-6_9</a>","ieee":"A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource interfaces,” in <i>Third International Conference on Embedded Software</i>, Philadelphia, PA, USA, 2003, vol. 2855, pp. 117–133.","chicago":"Chakrabarti, Arindam, Luca De Alfaro, Thomas A Henzinger, and Mariëlle Stoelinga. “Resource Interfaces.” In <i>Third International Conference on Embedded Software</i>, 2855:117–33. ACM, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45212-6_9\">https://doi.org/10.1007/978-3-540-45212-6_9</a>.","short":"A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International Conference on Embedded Software, ACM, 2003, pp. 117–133."},"alternative_title":["LNCS"],"status":"public"},{"conference":{"end_date":"2003-07-04","location":"Eindhoven, The Netherlands","name":"ICALP: Automata, Languages and Programming","start_date":"2003-06-30"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540404934"]},"doi":"10.1007/3-540-45061-0_79","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publisher":"Springer","publication":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming","article_processing_charge":"No","scopus_import":"1","author":[{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"}],"day":"25","title":"Discounting the future in systems theory","publist_id":"77","alternative_title":["LNCS"],"status":"public","extern":"1","intvolume":"      2719","citation":{"ieee":"L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Discounting the future in systems theory,” in <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 1022–1037.","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Discounting the Future in Systems Theory.” In <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>, 2719:1022–37. Springer, 2003. <a href=\"https://doi.org/10.1007/3-540-45061-0_79\">https://doi.org/10.1007/3-540-45061-0_79</a>.","short":"L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 1022–1037.","ama":"De Alfaro L, Henzinger TA, Majumdar R. Discounting the future in systems theory. In: <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>. Vol 2719. Springer; 2003:1022-1037. doi:<a href=\"https://doi.org/10.1007/3-540-45061-0_79\">10.1007/3-540-45061-0_79</a>","ista":"De Alfaro L, Henzinger TA, Majumdar R. 2003. Discounting the future in systems theory. Proceedings of the 30th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719, 1022–1037.","mla":"De Alfaro, Luca, et al. “Discounting the Future in Systems Theory.” <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i>, vol. 2719, Springer, 2003, pp. 1022–37, doi:<a href=\"https://doi.org/10.1007/3-540-45061-0_79\">10.1007/3-540-45061-0_79</a>.","apa":"De Alfaro, L., Henzinger, T. A., &#38; Majumdar, R. (2003). Discounting the future in systems theory. In <i>Proceedings of the 30th International Colloquium on Automata, Languages and Programming</i> (Vol. 2719, pp. 1022–1037). Eindhoven, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/3-540-45061-0_79\">https://doi.org/10.1007/3-540-45061-0_79</a>"},"publication_status":"published","date_published":"2003-06-25T00:00:00Z","acknowledgement":"This research was supported in part by the NSF CAREER award CCR-0132780, the DARPA grant F33615-C-98-3614, the NSF grants CCR-9988172, CCR-0234690 and CCR-0225610, and the ONR grant N00014-02-1-0671.","year":"2003","_id":"4628","page":"1022 - 1037","abstract":[{"lang":"eng","text":"Discounting the future means that the value, today, of a unit payoffis 1 if the payoffo ccurs today, a if it occurs tomorrow, a 2 if it occurs the day after tomorrow, and so on, for some real-valued discount factor 0 &lt; a &lt; 1. Discounting (or inflation) is a key paradigm in economics and has been studied in Markov decision processes as well as game theory. We submit that discounting also has a natural place in systems engineering: for nonterminating systems, a potential bug in the far-away future is less troubling than a potential bug today. We therefore develop a systems theory with discounting. Our theory includes several basic elements: discounted versions of system properties that correspond to the ω-regular properties, fixpoint-based algorithms for checking discounted properties, and a quantitative notion of bisimilarity for capturing the difference between two states with respect to discounted properties. We present the theory in a general form that applies to probabilistic systems as well as multicomponent systems (games), but it readily specializes to classical transition systems. We show that discounting, besides its natural practical appeal, has also several mathematical benefits. First, the resulting theory is robust, in that small perturbations of a system can cause only small changes in the properties of the system. Second, the theory is computational, in that the values of discounted properties, as well as the discounted bisimilarity distance between states, can be computed to any desired degree of precision."}],"date_updated":"2023-07-26T13:07:31Z","type":"conference","oa_version":"None","month":"06","volume":2719,"date_created":"2018-12-11T12:09:50Z"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Proceedings of the 14th International Conference on Concurrency Theory","article_processing_charge":"No","scopus_import":"1","author":[{"full_name":"De Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"last_name":"Faella","first_name":"Marco","full_name":"Faella, Marco"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"},{"first_name":"Mariëlle","last_name":"Stoelinga","full_name":"Stoelinga, Mariëlle"}],"day":"21","title":"The element of surprise in timed games","publist_id":"78","conference":{"end_date":"2003-09-05","name":"CONCUR: Concurrency Theory","location":"Marseille, France","start_date":"2003-09-03"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540407539"]},"doi":"10.1007/978-3-540-45187-7_9","quality_controlled":"1","acknowledgement":"Supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA grant F33615-C-98-3614, the MARCO grant 98-DT-660, -the ONR grant N00014-02-1-0671, the NSF grants CCR-9988172, CCR-0225610, and CCR-0234690, the NSF CAREER award CCR-0132780, and the MIUR grant MEFISTO.","year":"2003","_id":"4630","page":"144 - 158","month":"08","type":"conference","oa_version":"None","date_updated":"2024-01-08T10:05:30Z","abstract":[{"lang":"eng","text":"We consider concurrent two-person games played in real time, in which the players decide both which action to play, and when to play it. Such timed games differ from untimed games in two essential ways. First, players can take each other by surprise, because actions are played with delays that cannot be anticipated by the opponent. Second, a player should not be able to win the game by preventing time from diverging. We present a model of timed games that preserves the element of surprise and accounts for time divergence in a way that treats both players symmetrically and applies to all ω-regular winning conditions. We prove that the ability to take each other by surprise adds extra power to the players. For the case that the games are specified in the style of timed automata, we provide symbolic algorithms for their solution with respect to all ω-regular winning conditions. We also show that for these timed games, memory strategies are more powerful than memoryless strategies already in the case of reachability objectives."}],"volume":2761,"date_created":"2018-12-11T12:09:51Z","alternative_title":["LNCS"],"status":"public","intvolume":"      2761","extern":"1","citation":{"ieee":"L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “The element of surprise in timed games,” in <i>Proceedings of the 14th International Conference on Concurrency Theory</i>, Marseille, France, 2003, vol. 2761, pp. 144–158.","chicago":"De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “The Element of Surprise in Timed Games.” In <i>Proceedings of the 14th International Conference on Concurrency Theory</i>, 2761:144–58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45187-7_9\">https://doi.org/10.1007/978-3-540-45187-7_9</a>.","short":"L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:, Proceedings of the 14th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–158.","ama":"De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. The element of surprise in timed games. In: <i>Proceedings of the 14th International Conference on Concurrency Theory</i>. Vol 2761. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2003:144-158. doi:<a href=\"https://doi.org/10.1007/978-3-540-45187-7_9\">10.1007/978-3-540-45187-7_9</a>","ista":"De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2003. The element of surprise in timed games. Proceedings of the 14th International Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2761, 144–158.","mla":"De Alfaro, Luca, et al. “The Element of Surprise in Timed Games.” <i>Proceedings of the 14th International Conference on Concurrency Theory</i>, vol. 2761, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–58, doi:<a href=\"https://doi.org/10.1007/978-3-540-45187-7_9\">10.1007/978-3-540-45187-7_9</a>.","apa":"De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., &#38; Stoelinga, M. (2003). The element of surprise in timed games. In <i>Proceedings of the 14th International Conference on Concurrency Theory</i> (Vol. 2761, pp. 144–158). Marseille, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-540-45187-7_9\">https://doi.org/10.1007/978-3-540-45187-7_9</a>"},"publication_status":"published","date_published":"2003-08-21T00:00:00Z"},{"publication":"Journal of Physics B: Atomic, Molecular and Optical Physics","_id":"576","year":"2003","publisher":"IOP Publishing Ltd.","publist_id":"7239","date_created":"2018-12-11T11:47:16Z","title":"Free expansion of two-dimensional condensates with a vortex","volume":36,"date_updated":"2021-01-12T08:03:20Z","abstract":[{"lang":"eng","text":"We study the free expansion of a pancake-shaped Bose-condensed gas, which is initially trapped under harmonic confinement and containing a vortex at its centre. In the case of a radial expansion holding the axial confinement fixed we consider various models for the interactions, depending on the thickness of the condensate relative to the value of the scattering length. We are thus able to evaluate different scattering regimes ranging from quasi-three-dimensional (Q3D) to strictly two-dimensional (2D). We find that as the system goes from Q3D to 2D the expansion rate of the condensate increases whereas that of the vortex core decreases. In the Q3D scattering regime we also examine a fully free expansion in 3D and find oscillatory behaviour for the vortex core radius: an initial fast expansion of the vortex core is followed by a slowing down. Such a nonuniform expansion rate of the vortex core implies that the timing of its observation should be chosen appropriately."}],"day":"28","type":"journal_article","month":"06","page":"2455 - 2463","author":[{"full_name":"Onur Hosten","orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","last_name":"Hosten","first_name":"Onur"},{"first_name":"Patrizia","last_name":"Vignolo","full_name":"Vignolo, Patrizia"},{"full_name":"Minguzzi, Anna","last_name":"Minguzzi","first_name":"Anna"},{"full_name":"Tanatar, Bilal","last_name":"Tanatar","first_name":"Bilal"},{"first_name":"Mario","last_name":"Tosi","full_name":"Tosi, Mario P"}],"citation":{"ama":"Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. Free expansion of two-dimensional condensates with a vortex. <i>Journal of Physics B: Atomic, Molecular and Optical Physics</i>. 2003;36(12):2455-2463. doi:<a href=\"https://doi.org/10.1088/0953-4075/36/12/306\">10.1088/0953-4075/36/12/306</a>","mla":"Hosten, Onur, et al. “Free Expansion of Two-Dimensional Condensates with a Vortex.” <i>Journal of Physics B: Atomic, Molecular and Optical Physics</i>, vol. 36, no. 12, IOP Publishing Ltd., 2003, pp. 2455–63, doi:<a href=\"https://doi.org/10.1088/0953-4075/36/12/306\">10.1088/0953-4075/36/12/306</a>.","ista":"Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. 2003. Free expansion of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical Physics. 36(12), 2455–2463.","apa":"Hosten, O., Vignolo, P., Minguzzi, A., Tanatar, B., &#38; Tosi, M. (2003). Free expansion of two-dimensional condensates with a vortex. <i>Journal of Physics B: Atomic, Molecular and Optical Physics</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/0953-4075/36/12/306\">https://doi.org/10.1088/0953-4075/36/12/306</a>","ieee":"O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, and M. Tosi, “Free expansion of two-dimensional condensates with a vortex,” <i>Journal of Physics B: Atomic, Molecular and Optical Physics</i>, vol. 36, no. 12. IOP Publishing Ltd., pp. 2455–2463, 2003.","chicago":"Hosten, Onur, Patrizia Vignolo, Anna Minguzzi, Bilal Tanatar, and Mario Tosi. “Free Expansion of Two-Dimensional Condensates with a Vortex.” <i>Journal of Physics B: Atomic, Molecular and Optical Physics</i>. IOP Publishing Ltd., 2003. <a href=\"https://doi.org/10.1088/0953-4075/36/12/306\">https://doi.org/10.1088/0953-4075/36/12/306</a>.","short":"O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, M. Tosi, Journal of Physics B: Atomic, Molecular and Optical Physics 36 (2003) 2455–2463."},"issue":"12","extern":1,"intvolume":"        36","status":"public","quality_controlled":0,"doi":"10.1088/0953-4075/36/12/306","date_published":"2003-06-28T00:00:00Z","publication_status":"published"},{"extern":"1","intvolume":"         6","language":[{"iso":"eng"}],"citation":{"ama":"Rogers C, Reale V, Kim K, et al. Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1. <i>Nature Neuroscience</i>. 2003;6(11):1178-1185. doi:<a href=\"https://doi.org/10.1038/nn1140\">10.1038/nn1140</a>","mla":"Rogers, Candida, et al. “Inhibition of Caenorhabditis Elegans Social Feeding by FMRFamide-Related Peptide Activation of NPR-1.” <i>Nature Neuroscience</i>, vol. 6, no. 11, Springer Nature, 2003, pp. 1178–85, doi:<a href=\"https://doi.org/10.1038/nn1140\">10.1038/nn1140</a>.","ista":"Rogers C, Reale V, Kim K, Chatwin H, Li C, Evans P, de Bono M. 2003. Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1. Nature Neuroscience. 6(11), 1178–1185.","apa":"Rogers, C., Reale, V., Kim, K., Chatwin, H., Li, C., Evans, P., &#38; de Bono, M. (2003). Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nn1140\">https://doi.org/10.1038/nn1140</a>","ieee":"C. Rogers <i>et al.</i>, “Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1,” <i>Nature Neuroscience</i>, vol. 6, no. 11. Springer Nature, pp. 1178–1185, 2003.","chicago":"Rogers, Candida, Vincenzina Reale, Kyuhyung Kim, Heather Chatwin, Chris Li, Peter Evans, and Mario de Bono. “Inhibition of Caenorhabditis Elegans Social Feeding by FMRFamide-Related Peptide Activation of NPR-1.” <i>Nature Neuroscience</i>. Springer Nature, 2003. <a href=\"https://doi.org/10.1038/nn1140\">https://doi.org/10.1038/nn1140</a>.","short":"C. Rogers, V. Reale, K. Kim, H. Chatwin, C. Li, P. Evans, M. de Bono, Nature Neuroscience 6 (2003) 1178–1185."},"issue":"11","status":"public","external_id":{"pmid":["14555955"]},"date_published":"2003-10-12T00:00:00Z","doi":"10.1038/nn1140","quality_controlled":"1","publication_status":"published","publication_identifier":{"issn":["1097-6256","1546-1726"]},"publication":"Nature Neuroscience","_id":"6156","publisher":"Springer Nature","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","pmid":1,"year":"2003","volume":6,"title":"Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1","date_created":"2019-03-21T09:47:53Z","page":"1178-1185","author":[{"full_name":"Rogers, Candida","last_name":"Rogers","first_name":"Candida"},{"first_name":"Vincenzina","last_name":"Reale","full_name":"Reale, Vincenzina"},{"full_name":"Kim, Kyuhyung","last_name":"Kim","first_name":"Kyuhyung"},{"full_name":"Chatwin, Heather","first_name":"Heather","last_name":"Chatwin"},{"last_name":"Li","first_name":"Chris","full_name":"Li, Chris"},{"full_name":"Evans, Peter","first_name":"Peter","last_name":"Evans"},{"first_name":"Mario","last_name":"de Bono","full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443"}],"date_updated":"2021-01-12T08:06:25Z","day":"12","abstract":[{"lang":"eng","text":"Social and solitary feeding in natural Caenorhabditis elegans isolates are associated with two alleles of the orphan G-protein-coupled receptor (GPCR) NPR-1: social feeders contain NPR-1 215F, whereas solitary feeders contain NPR-1 215V. Here we identify FMRFamide-related neuropeptides (FaRPs) encoded by the flp-18 and flp-21 genes as NPR-1 ligands and show that these peptides can differentially activate the NPR-1 215F and NPR-1 215V receptors. Multicopy overexpression of flp-21 transformed wild social animals into solitary feeders. Conversely, a flp-21 deletion partially phenocopied the npr-1(null) phenotype, which is consistent with NPR-1 activation by FLP-21 in vivo but also implicates other ligands for NPR-1. Phylogenetic studies indicate that the dominant npr-1 215V allele likely arose from an ancestral npr-1 215F gene in C. elegans. Our data suggest a model in which solitary feeding evolved in an ancestral social strain of C. elegans by a gain-of-function mutation that modified the response of NPR-1 to FLP-18 and FLP-21 ligands."}],"month":"10","type":"journal_article","oa_version":"None"},{"quality_controlled":"1","doi":"10.1002/neu.10162","date_published":"2003-01-01T00:00:00Z","publication_identifier":{"issn":["0022-3034","1097-4695"]},"publication_status":"published","issue":"1","language":[{"iso":"eng"}],"citation":{"short":"M. de Bono, Journal of Neurobiology 54 (2003) 78–92.","chicago":"Bono, Mario de. “Molecular Approaches to Aggregation Behavior and Social Attachment.” <i>Journal of Neurobiology</i>. Wiley, 2003. <a href=\"https://doi.org/10.1002/neu.10162\">https://doi.org/10.1002/neu.10162</a>.","ieee":"M. de Bono, “Molecular approaches to aggregation behavior and social attachment,” <i>Journal of Neurobiology</i>, vol. 54, no. 1. Wiley, pp. 78–92, 2003.","apa":"de Bono, M. (2003). Molecular approaches to aggregation behavior and social attachment. <i>Journal of Neurobiology</i>. Wiley. <a href=\"https://doi.org/10.1002/neu.10162\">https://doi.org/10.1002/neu.10162</a>","ista":"de Bono M. 2003. Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. 54(1), 78–92.","mla":"de Bono, Mario. “Molecular Approaches to Aggregation Behavior and Social Attachment.” <i>Journal of Neurobiology</i>, vol. 54, no. 1, Wiley, 2003, pp. 78–92, doi:<a href=\"https://doi.org/10.1002/neu.10162\">10.1002/neu.10162</a>.","ama":"de Bono M. Molecular approaches to aggregation behavior and social attachment. <i>Journal of Neurobiology</i>. 2003;54(1):78-92. doi:<a href=\"https://doi.org/10.1002/neu.10162\">10.1002/neu.10162</a>"},"intvolume":"        54","extern":"1","external_id":{"pmid":["12486699"]},"status":"public","date_created":"2019-03-21T09:52:31Z","title":"Molecular approaches to aggregation behavior and social attachment","volume":54,"oa_version":"None","month":"01","type":"journal_article","date_updated":"2021-01-12T08:06:26Z","day":"01","abstract":[{"text":"In many animal species individuals aggregate to live in groups. A range of experimental approaches in different animals, including studies of social feeding in nematodes, maternal behavior in rats and sheep, and pair-bonding in voles, are providing insights into the neural bases for these behaviors. These studies are delineating multiple neural circuits and gene networks in the brain that interact in ways that are as yet poorly understood to coordinate social behavior.","lang":"eng"}],"page":"78-92","author":[{"orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono"}],"_id":"6157","publication":"Journal of Neurobiology","year":"2003","pmid":1,"publisher":"Wiley","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"publication":"Inventiones Mathematicae","_id":"1457","publisher":"Springer","year":"2003","volume":153,"title":"Mirror symmetry, langlands duality, and the Hitchin system","publist_id":"5738","date_created":"2018-12-11T11:52:08Z","page":"197 - 229","author":[{"first_name":"Tamas","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel"},{"last_name":"Thaddeus","first_name":"Michael","full_name":"Thaddeus, Michael"}],"abstract":[{"text":"Among the major mathematical approaches to mirror symmetry are those of Batyrev-Borisov and Stromdnger-Yau-Zaslow (SYZ). The first is explicit and amenable to computation but is not clearly related to the physical motivation; the second is the opposite. Furthermore, it is far from obvious that mirror partners in one sense will also be mirror partners in the other. This paper concerns a class of examples that can be shown to satisfy the requirements of SYZ, but whose Hodge numbers are also equal. This provides significant evidence in support of SYZ. Moreover, the examples are of great interest in their own right: they are spaces of flat SLr-connections on a smooth curve. The mirror is the corresponding space for the Langlands dual group PGLr. These examples therefore throw a bridge from mirror symmetry to the duality theory of Lie groups and, more broadly, to the geometric Langlands program.","lang":"eng"}],"date_updated":"2021-01-12T06:50:52Z","day":"01","month":"07","type":"journal_article","extern":1,"intvolume":"       153","citation":{"short":"T. Hausel, M. Thaddeus, Inventiones Mathematicae 153 (2003) 197–229.","chicago":"Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality, and the Hitchin System.” <i>Inventiones Mathematicae</i>. Springer, 2003. <a href=\"https://doi.org/10.1007/s00222-003-0286-7\">https://doi.org/10.1007/s00222-003-0286-7</a>.","ieee":"T. Hausel and M. Thaddeus, “Mirror symmetry, langlands duality, and the Hitchin system,” <i>Inventiones Mathematicae</i>, vol. 153, no. 1. Springer, pp. 197–229, 2003.","apa":"Hausel, T., &#38; Thaddeus, M. (2003). Mirror symmetry, langlands duality, and the Hitchin system. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-003-0286-7\">https://doi.org/10.1007/s00222-003-0286-7</a>","ista":"Hausel T, Thaddeus M. 2003. Mirror symmetry, langlands duality, and the Hitchin system. Inventiones Mathematicae. 153(1), 197–229.","mla":"Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality, and the Hitchin System.” <i>Inventiones Mathematicae</i>, vol. 153, no. 1, Springer, 2003, pp. 197–229, doi:<a href=\"https://doi.org/10.1007/s00222-003-0286-7\">10.1007/s00222-003-0286-7</a>.","ama":"Hausel T, Thaddeus M. Mirror symmetry, langlands duality, and the Hitchin system. <i>Inventiones Mathematicae</i>. 2003;153(1):197-229. doi:<a href=\"https://doi.org/10.1007/s00222-003-0286-7\">10.1007/s00222-003-0286-7</a>"},"issue":"1","status":"public","doi":"10.1007/s00222-003-0286-7","date_published":"2003-07-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/math/0205236","open_access":"1"}],"quality_controlled":0,"oa":1,"publication_status":"published"},{"year":"2003","acknowledgement":"The first author was supported by NSF grant DMS-97-29992. The second author was supported by NSF grant DMS-98-08529.","publisher":"American Mathematical Society","_id":"1458","publication":"Journal of the American Mathematical Society","type":"journal_article","month":"04","date_updated":"2021-01-12T06:50:53Z","abstract":[{"text":"The moduli space of stable bundles of rank $2$ and degree $1$ on a Riemann surface has rational cohomology generated by the so-called universal classes. The work of Baranovsky, King-Newstead, Siebert-Tian and Zagier provided a complete set of relations between these classes, expressed in terms of a recursion in the genus. This paper accomplishes the same thing for the noncompact moduli spaces of Higgs bundles, in the sense of Hitchin and Simpson. There are many more independent relations than for stable bundles, but in a sense the answer is simpler, since the formulas are completely explicit, not recursive. The results of Kirwan on equivariant cohomology for holomorphic circle actions are of key importance.","lang":"eng"}],"day":"01","page":"303 - 329","author":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel","first_name":"Tamas","last_name":"Hausel"},{"last_name":"Thaddeus","first_name":"Michael","full_name":"Thaddeus, Michael"}],"publist_id":"5739","date_created":"2018-12-11T11:52:08Z","volume":16,"title":"Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles","status":"public","issue":"2","citation":{"mla":"Hausel, Tamás, and Michael Thaddeus. “Relations in the Cohomology Ring of the Moduli Space of Rank 2 Higgs Bundles.” <i>Journal of the American Mathematical Society</i>, vol. 16, no. 2, American Mathematical Society, 2003, pp. 303–29, doi:<a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">10.1090/S0894-0347-02-00417-4</a>.","ista":"Hausel T, Thaddeus M. 2003. Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles. Journal of the American Mathematical Society. 16(2), 303–329.","apa":"Hausel, T., &#38; Thaddeus, M. (2003). Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles. <i>Journal of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">https://doi.org/10.1090/S0894-0347-02-00417-4</a>","ama":"Hausel T, Thaddeus M. Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles. <i>Journal of the American Mathematical Society</i>. 2003;16(2):303-329. doi:<a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">10.1090/S0894-0347-02-00417-4</a>","short":"T. Hausel, M. Thaddeus, Journal of the American Mathematical Society 16 (2003) 303–329.","ieee":"T. Hausel and M. Thaddeus, “Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles,” <i>Journal of the American Mathematical Society</i>, vol. 16, no. 2. American Mathematical Society, pp. 303–329, 2003.","chicago":"Hausel, Tamás, and Michael Thaddeus. “Relations in the Cohomology Ring of the Moduli Space of Rank 2 Higgs Bundles.” <i>Journal of the American Mathematical Society</i>. American Mathematical Society, 2003. <a href=\"https://doi.org/10.1090/S0894-0347-02-00417-4\">https://doi.org/10.1090/S0894-0347-02-00417-4</a>."},"extern":1,"intvolume":"        16","publication_status":"published","oa":1,"quality_controlled":0,"main_file_link":[{"url":"http://arxiv.org/abs/math/0003094","open_access":"1"}],"doi":"10.1090/S0894-0347-02-00417-4","date_published":"2003-04-01T00:00:00Z"},{"publisher":"Springer","acknowledgement":"We would like to acknowledge the financial support by Prof. P. Major (R ́ enyi Institute, Hungary) from his OTKA grant No. T26176 and of the Miller Institute for Basic Research in Science at UC Berkeley.","year":"2003","publication":"Communications in Mathematical Physics","_id":"1459","page":"275 - 288","author":[{"last_name":"Etesi","first_name":"Gábor","full_name":"Etesi, Gábor"},{"first_name":"Tamas","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel"}],"date_updated":"2021-01-12T06:50:53Z","day":"01","abstract":[{"text":"In this paper we explicitly calculate the analogue of the 't Hooft SU (2) Yang-Mills instantons on Gibbons-Hawking multi-centered gravitational instantons, which come in two parallel families: the multi-Eguchi-Hanson, or Ak ALE gravitational instantons and the multi-Taub-NUT spaces, or Ak ALF gravitational instantons. We calculate their energy and find the reducible ones. Following Kronheimer we also exploit the U(1) invariance of our solutions and study the corresponding explicit singular SU (2) magnetic monopole solutions of the Bogomolny equations on flat ℝ3.","lang":"eng"}],"month":"04","type":"journal_article","title":"On Yang-Mills instantons over multi-centered gravitational instantons","volume":235,"date_created":"2018-12-11T11:52:09Z","publist_id":"5740","status":"public","intvolume":"       235","extern":1,"citation":{"short":"G. Etesi, T. Hausel, Communications in Mathematical Physics 235 (2003) 275–288.","chicago":"Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered Gravitational Instantons.” <i>Communications in Mathematical Physics</i>. Springer, 2003. <a href=\"https://doi.org/10.1007/s00220-003-0806-8\">https://doi.org/10.1007/s00220-003-0806-8</a>.","ieee":"G. Etesi and T. Hausel, “On Yang-Mills instantons over multi-centered gravitational instantons,” <i>Communications in Mathematical Physics</i>, vol. 235, no. 2. Springer, pp. 275–288, 2003.","apa":"Etesi, G., &#38; Hausel, T. (2003). On Yang-Mills instantons over multi-centered gravitational instantons. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-003-0806-8\">https://doi.org/10.1007/s00220-003-0806-8</a>","mla":"Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered Gravitational Instantons.” <i>Communications in Mathematical Physics</i>, vol. 235, no. 2, Springer, 2003, pp. 275–88, doi:<a href=\"https://doi.org/10.1007/s00220-003-0806-8\">10.1007/s00220-003-0806-8</a>.","ista":"Etesi G, Hausel T. 2003. On Yang-Mills instantons over multi-centered gravitational instantons. Communications in Mathematical Physics. 235(2), 275–288.","ama":"Etesi G, Hausel T. On Yang-Mills instantons over multi-centered gravitational instantons. <i>Communications in Mathematical Physics</i>. 2003;235(2):275-288. doi:<a href=\"https://doi.org/10.1007/s00220-003-0806-8\">10.1007/s00220-003-0806-8</a>"},"issue":"2","oa":1,"publication_status":"published","doi":"10.1007/s00220-003-0806-8","date_published":"2003-04-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/hep-th/0207196","open_access":"1"}],"quality_controlled":0},{"publication_identifier":{"issn":["0040-4020"],"eissn":["1464-5416"]},"doi":"10.1016/s0040-4020(03)00682-3","quality_controlled":"1","keyword":["Organic Chemistry","Drug Discovery","Biochemistry"],"language":[{"iso":"eng"}],"issue":"25","author":[{"last_name":"Michrowska","first_name":"Anna","full_name":"Michrowska, Anna"},{"first_name":"Michał","last_name":"Bieniek","full_name":"Bieniek, Michał"},{"full_name":"Kim, Mikhail","last_name":"Kim","first_name":"Mikhail"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","first_name":"Rafal"},{"first_name":"Karol","last_name":"Grela","full_name":"Grela, Karol"}],"day":"16","title":"Cross-metathesis reaction of vinyl sulfones and sulfoxides","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Tetrahedron","article_processing_charge":"No","scopus_import":"1","article_type":"original","publication_status":"published","date_published":"2003-06-16T00:00:00Z","status":"public","extern":"1","intvolume":"        59","citation":{"short":"A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003) 4525–4531.","ieee":"A. Michrowska, M. Bieniek, M. Kim, R. Klajn, and K. Grela, “Cross-metathesis reaction of vinyl sulfones and sulfoxides,” <i>Tetrahedron</i>, vol. 59, no. 25. Elsevier, pp. 4525–4531, 2003.","chicago":"Michrowska, Anna, Michał Bieniek, Mikhail Kim, Rafal Klajn, and Karol Grela. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” <i>Tetrahedron</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">https://doi.org/10.1016/s0040-4020(03)00682-3</a>.","ista":"Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. 2003. Cross-metathesis reaction of vinyl sulfones and sulfoxides. Tetrahedron. 59(25), 4525–4531.","mla":"Michrowska, Anna, et al. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” <i>Tetrahedron</i>, vol. 59, no. 25, Elsevier, 2003, pp. 4525–31, doi:<a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">10.1016/s0040-4020(03)00682-3</a>.","apa":"Michrowska, A., Bieniek, M., Kim, M., Klajn, R., &#38; Grela, K. (2003). Cross-metathesis reaction of vinyl sulfones and sulfoxides. <i>Tetrahedron</i>. Elsevier. <a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">https://doi.org/10.1016/s0040-4020(03)00682-3</a>","ama":"Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. Cross-metathesis reaction of vinyl sulfones and sulfoxides. <i>Tetrahedron</i>. 2003;59(25):4525-4531. doi:<a href=\"https://doi.org/10.1016/s0040-4020(03)00682-3\">10.1016/s0040-4020(03)00682-3</a>"},"page":"4525-4531","date_updated":"2023-08-08T12:44:17Z","abstract":[{"text":"Cross-metathesis reactions of α,β-unsaturated sulfones and sulfoxides in the presence of molybdenum and ruthenium pre-catalysts were tested. A selective metahesis reaction was achieved between functionalized terminal olefins and vinyl sulfones by using the ‘second generation’ ruthenium catalysts 1c–h while the highly active Schrock catalyst 1b was found to be functional group incompatible with vinyl sulfones. The cross-metathesis products were isolated in good yields with an excellent (E)-selectivity. Both the molybdenum and ruthenium-based complexes were, however, incompatible with α,β- and β,γ-unsaturated sulfoxides.","lang":"eng"}],"oa_version":"None","month":"06","type":"journal_article","volume":59,"date_created":"2023-08-01T10:39:34Z","year":"2003","_id":"13436"},{"publication_status":"published","date_published":"2003-01-31T00:00:00Z","status":"public","external_id":{"pmid":["12522258"]},"extern":"1","intvolume":"       299","citation":{"apa":"Zilberman, D., Cao,  Xiaofeng, &#38; Jacobsen, S. E. (2003). ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1079695\">https://doi.org/10.1126/science.1079695</a>","mla":"Zilberman, Daniel, et al. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” <i>Science</i>, vol. 299, no. 5607, American Association for the Advancement of Science, 2003, pp. 716–19, doi:<a href=\"https://doi.org/10.1126/science.1079695\">10.1126/science.1079695</a>.","ista":"Zilberman D, Cao  Xiaofeng, Jacobsen SE. 2003. ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. Science. 299(5607), 716–719.","ama":"Zilberman D, Cao  Xiaofeng, Jacobsen SE. ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. <i>Science</i>. 2003;299(5607):716-719. doi:<a href=\"https://doi.org/10.1126/science.1079695\">10.1126/science.1079695</a>","short":"D. Zilberman,  Xiaofeng Cao, S.E. Jacobsen, Science 299 (2003) 716–719.","chicago":"Zilberman, Daniel,  Xiaofeng Cao, and Steven E. Jacobsen. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” <i>Science</i>. American Association for the Advancement of Science, 2003. <a href=\"https://doi.org/10.1126/science.1079695\">https://doi.org/10.1126/science.1079695</a>.","ieee":"D. Zilberman,  Xiaofeng Cao, and S. E. Jacobsen, “ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation,” <i>Science</i>, vol. 299, no. 5607. American Association for the Advancement of Science, pp. 716–719, 2003."},"page":"716-719","abstract":[{"text":"Proteins of the ARGONAUTE family are important in diverse posttranscriptional RNA-mediated gene-silencing systems as well as in transcriptional gene silencing in Drosophila and fission yeast and in programmed DNA elimination in Tetrahymena. We cloned ARGONAUTE4 (AGO4) from a screen for mutants that suppress silencing of the Arabidopsis SUPERMAN(SUP) gene. The ago4-1 mutant reactivated silentSUP alleles and decreased CpNpG and asymmetric DNA methylation as well as histone H3 lysine-9 methylation. In addition,ago4-1 blocked histone and DNA methylation and the accumulation of 25-nucleotide small interfering RNAs (siRNAs) that correspond to the retroelement AtSN1. These results suggest that AGO4 and long siRNAs direct chromatin modifications, including histone methylation and non-CpG DNA methylation.","lang":"eng"}],"date_updated":"2021-12-14T08:43:30Z","type":"journal_article","month":"01","oa_version":"None","volume":299,"date_created":"2021-06-04T11:26:26Z","year":"2003","_id":"9455","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"doi":"10.1126/science.1079695","quality_controlled":"1","keyword":["Multidisciplinary"],"language":[{"iso":"eng"}],"issue":"5607","author":[{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","last_name":"Zilberman","first_name":"Daniel"},{"full_name":"Cao,  Xiaofeng","first_name":" Xiaofeng","last_name":"Cao"},{"full_name":"Jacobsen, Steven E.","first_name":"Steven E.","last_name":"Jacobsen"}],"day":"31","title":"ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation","publisher":"American Association for the Advancement of Science","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","pmid":1,"department":[{"_id":"DaZi"}],"publication":"Science","article_processing_charge":"No","scopus_import":"1","article_type":"original"},{"quality_controlled":"1","doi":"10.1016/j.cub.2003.11.052","publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"issue":"24","language":[{"iso":"eng"}],"title":"Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation","day":"16","author":[{"first_name":"Xiaofeng","last_name":"Cao","full_name":"Cao, Xiaofeng"},{"full_name":"Aufsatz, Werner","first_name":"Werner","last_name":"Aufsatz"},{"last_name":"Zilberman","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel"},{"full_name":"Mette, M.Florian","first_name":"M.Florian","last_name":"Mette"},{"full_name":"Huang, Michael S.","first_name":"Michael S.","last_name":"Huang"},{"last_name":"Matzke","first_name":"Marjori","full_name":"Matzke, Marjori"},{"full_name":"Jacobsen, Steven E.","first_name":"Steven E.","last_name":"Jacobsen"}],"article_type":"original","article_processing_charge":"No","scopus_import":"1","publication":"Current Biology","department":[{"_id":"DaZi"}],"pmid":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Elsevier","main_file_link":[{"url":"https://doi.org/10.1016/j.cub.2003.11.052","open_access":"1"}],"date_published":"2003-12-16T00:00:00Z","oa":1,"publication_status":"published","citation":{"ieee":"X. Cao <i>et al.</i>, “Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation,” <i>Current Biology</i>, vol. 13, no. 24. Elsevier, pp. 2212–2217, 2003.","chicago":"Cao, Xiaofeng, Werner Aufsatz, Daniel Zilberman, M.Florian Mette, Michael S. Huang, Marjori Matzke, and Steven E. Jacobsen. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed DNA Methylation.” <i>Current Biology</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">https://doi.org/10.1016/j.cub.2003.11.052</a>.","short":"X. Cao, W. Aufsatz, D. Zilberman, M.F. Mette, M.S. Huang, M. Matzke, S.E. Jacobsen, Current Biology 13 (2003) 2212–2217.","ama":"Cao X, Aufsatz W, Zilberman D, et al. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. <i>Current Biology</i>. 2003;13(24):2212-2217. doi:<a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">10.1016/j.cub.2003.11.052</a>","mla":"Cao, Xiaofeng, et al. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed DNA Methylation.” <i>Current Biology</i>, vol. 13, no. 24, Elsevier, 2003, pp. 2212–17, doi:<a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">10.1016/j.cub.2003.11.052</a>.","ista":"Cao X, Aufsatz W, Zilberman D, Mette MF, Huang MS, Matzke M, Jacobsen SE. 2003. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. Current Biology. 13(24), 2212–2217.","apa":"Cao, X., Aufsatz, W., Zilberman, D., Mette, M. F., Huang, M. S., Matzke, M., &#38; Jacobsen, S. E. (2003). Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">https://doi.org/10.1016/j.cub.2003.11.052</a>"},"extern":"1","intvolume":"        13","external_id":{"pmid":["14680640"]},"status":"public","date_created":"2021-06-07T10:43:02Z","volume":13,"month":"12","type":"journal_article","oa_version":"Published Version","date_updated":"2021-12-14T08:41:38Z","abstract":[{"lang":"eng","text":"RNA interference is a conserved process in which double-stranded RNA is processed into 21–25 nucleotide siRNAs that trigger posttranscriptional gene silencing. In addition, plants display a phenomenon termed RNA-directed DNA methylation (RdDM) in which DNA with sequence identity to silenced RNA is de novo methylated at its cytosine residues. This methylation is not only at canonical CpG sites but also at cytosines in CpNpG and asymmetric sequence contexts. In this report, we study the role of the DRM and CMT3 DNA methyltransferase genes in the initiation and maintenance of RdDM. Neither drm nor cmt3 mutants affected the maintenance of preestablished RNA-directed CpG methylation. However, drm mutants showed a nearly complete loss of asymmetric methylation and a partial loss of CpNpG methylation. The remaining asymmetric and CpNpG methylation was dependent on the activity of CMT3, showing that DRM and CMT3 act redundantly to maintain non-CpG methylation. These DNA methyltransferases appear to act downstream of siRNAs, since drm1 drm2 cmt3 triple mutants show a lack of non-CpG methylation but elevated levels of siRNAs. Finally, we demonstrate that DRM activity is required for the initial establishment of RdDM in all sequence contexts including CpG, CpNpG, and asymmetric sites."}],"page":"2212-2217","_id":"9495","year":"2003"},{"status":"public","conference":{"name":"WWW: International Conference on World Wide Web","location":"Budapest, Hungary","start_date":"2003-05-20","end_date":"2003-05-24"},"extern":"1","related_material":{"record":[{"id":"11904","status":"public","relation":"later_version"}]},"citation":{"short":"M.H. Henzinger, B.-W. Chang, B. Milch, S. Brin, in:, Proceedings of the 12th International Conference on World Wide Web, Association for Computing Machinery, 2003.","chicago":"Henzinger, Monika H, Bay-Wei Chang, Brian Milch, and Sergey Brin. “Query-Free News Search.” In <i>Proceedings of the 12th International Conference on World Wide Web</i>. Association for Computing Machinery, 2003. <a href=\"https://doi.org/10.1145/775152.775154\">https://doi.org/10.1145/775152.775154</a>.","ieee":"M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” in <i>Proceedings of the 12th international conference on World Wide Web</i>, Budapest, Hungary, 2003.","apa":"Henzinger, M. H., Chang, B.-W., Milch, B., &#38; Brin, S. (2003). Query-free news search. In <i>Proceedings of the 12th international conference on World Wide Web</i>. Budapest, Hungary: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/775152.775154\">https://doi.org/10.1145/775152.775154</a>","mla":"Henzinger, Monika H., et al. “Query-Free News Search.” <i>Proceedings of the 12th International Conference on World Wide Web</i>, 1–10, Association for Computing Machinery, 2003, doi:<a href=\"https://doi.org/10.1145/775152.775154\">10.1145/775152.775154</a>.","ista":"Henzinger MH, Chang B-W, Milch B, Brin S. 2003. Query-free news search. Proceedings of the 12th international conference on World Wide Web. WWW: International Conference on World Wide Web, 1–10.","ama":"Henzinger MH, Chang B-W, Milch B, Brin S. Query-free news search. In: <i>Proceedings of the 12th International Conference on World Wide Web</i>. Association for Computing Machinery; 2003. doi:<a href=\"https://doi.org/10.1145/775152.775154\">10.1145/775152.775154</a>"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-158113680-7"]},"publication_status":"published","date_published":"2003-05-01T00:00:00Z","doi":"10.1145/775152.775154","quality_controlled":"1","publisher":"Association for Computing Machinery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2003","_id":"11860","publication":"Proceedings of the 12th international conference on World Wide Web","article_processing_charge":"No","scopus_import":"1","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"},{"last_name":"Chang","first_name":"Bay-Wei","full_name":"Chang, Bay-Wei"},{"first_name":"Brian","last_name":"Milch","full_name":"Milch, Brian"},{"full_name":"Brin, Sergey","first_name":"Sergey","last_name":"Brin"}],"month":"05","type":"conference","oa_version":"None","date_updated":"2023-02-21T16:32:40Z","abstract":[{"text":"Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one such stream of text; in this paper we discuss finding news articles on the web that are relevant to news currently being broadcast.We evaluated a variety of algorithms for this problem, looking at the impact of inverse document frequency, stemming, compounds, history, and query length on the relevance and coverage of news articles returned in real time during a broadcast. We also evaluated several postprocessing techniques for improving the precision, including reranking using additional terms, reranking by document similarity, and filtering on document similarity. For the best algorithm, 84%-91% of the articles found were relevant, with at least 64% of the articles being on the exact topic of the broadcast. In addition, a relevant article was found for at least 70% of the topics.","lang":"eng"}],"day":"01","article_number":"1-10","title":"Query-free news search","date_created":"2022-08-16T08:55:05Z"},{"scopus_import":"1","article_processing_charge":"No","publication":"21st annual international ACM SIGIR conference on Research and development in information retrieval","_id":"11897","year":"2003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","date_created":"2022-08-17T08:56:18Z","title":"Improved algorithms for topic distillation in a hyperlinked environment","day":"01","abstract":[{"lang":"eng","text":"This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity analysis has been shown to be useful in identifying high quality pages within a topic specific graph of hyperlinked documents. The essence of our approach is to augment a previous connectivity analysis based algorithm with content analysis. We identify three problems with the existing approach and devise algorithms to tackle them. The results of a user evaluation are reported that show an improvement of precision at 10\r\ndocuments by at least 45% over pure connectivity analysis. "}],"date_updated":"2023-02-17T14:47:44Z","month":"08","oa_version":"None","type":"conference","page":"104–111","author":[{"full_name":"Bharat, Krishna","first_name":"Krishna","last_name":"Bharat"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"}],"citation":{"short":"K. Bharat, M.H. Henzinger, in:, 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, 2003, pp. 104–111.","chicago":"Bharat, Krishna, and Monika H Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” In <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, 104–111. Association for Computing Machinery, 2003. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>.","ieee":"K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment,” in <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i>, Melbourne, Australia, 2003, pp. 104–111.","apa":"Bharat, K., &#38; Henzinger, M. H. (2003). Improved algorithms for topic distillation in a hyperlinked environment. In <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i> (pp. 104–111). Melbourne, Australia: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>","mla":"Bharat, Krishna, and Monika H. Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, Association for Computing Machinery, 2003, pp. 104–111, doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>.","ista":"Bharat K, Henzinger MH. 2003. Improved algorithms for topic distillation in a hyperlinked environment. 21st annual international ACM SIGIR conference on Research and development in information retrieval. SIGIR: International Conference on Research and Development in Information Retrieval, 104–111.","ama":"Bharat K, Henzinger MH. Improved algorithms for topic distillation in a hyperlinked environment. In: <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. Association for Computing Machinery; 2003:104–111. doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>"},"language":[{"iso":"eng"}],"extern":"1","conference":{"end_date":"1998-08-28","name":"SIGIR: International Conference on Research and Development in Information Retrieval","location":"Melbourne, Australia","start_date":"1998-08-24"},"status":"public","quality_controlled":"1","date_published":"2003-08-01T00:00:00Z","doi":"10.1145/290941.290972","publication_status":"published","publication_identifier":{"isbn":["978-1-58113-015-7"],"issn":["01635840"]}},{"year":"2003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Association for Computing Machinery","scopus_import":"1","article_processing_charge":"No","publication":"18th International Joint Conference on Artificial Intelligence","_id":"11909","date_updated":"2023-02-09T12:05:25Z","abstract":[{"text":"This article presents a high-level discussion of some problems that are unique to web search engines. The goal is to raise awareness and stimulate research in these areas.","lang":"eng"}],"day":"01","month":"08","type":"conference","oa_version":"Published Version","author":[{"first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Rajeev","last_name":"Motwani","full_name":"Motwani, Rajeev"},{"full_name":"Silverstein, Craig","first_name":"Craig","last_name":"Silverstein"}],"page":"1573-1579","date_created":"2022-08-18T06:40:02Z","title":"Challenges in web search engines","status":"public","citation":{"mla":"Henzinger, Monika H., et al. “Challenges in Web Search Engines.” <i>18th International Joint Conference on Artificial Intelligence</i>, Association for Computing Machinery, 2003, pp. 1573–79.","ista":"Henzinger MH, Motwani R, Silverstein C. 2003. Challenges in web search engines. 18th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 1573–1579.","apa":"Henzinger, M. H., Motwani, R., &#38; Silverstein, C. (2003). Challenges in web search engines. In <i>18th International Joint Conference on Artificial Intelligence</i> (pp. 1573–1579). Acapulco, Mexico: Association for Computing Machinery.","ama":"Henzinger MH, Motwani R, Silverstein C. Challenges in web search engines. In: <i>18th International Joint Conference on Artificial Intelligence</i>. Association for Computing Machinery; 2003:1573-1579.","short":"M.H. Henzinger, R. Motwani, C. Silverstein, in:, 18th International Joint Conference on Artificial Intelligence, Association for Computing Machinery, 2003, pp. 1573–1579.","ieee":"M. H. Henzinger, R. Motwani, and C. Silverstein, “Challenges in web search engines,” in <i>18th International Joint Conference on Artificial Intelligence</i>, Acapulco, Mexico, 2003, pp. 1573–1579.","chicago":"Henzinger, Monika H, Rajeev Motwani, and Craig Silverstein. “Challenges in Web Search Engines.” In <i>18th International Joint Conference on Artificial Intelligence</i>, 1573–79. Association for Computing Machinery, 2003."},"language":[{"iso":"eng"}],"extern":"1","conference":{"end_date":"2003-08-15","name":"IJCAI: International Joint Conference on Artificial Intelligence","location":"Acapulco, Mexico","start_date":"2003-08-09"},"publication_status":"published","oa":1,"publication_identifier":{"issn":["1045-0823"]},"main_file_link":[{"url":"https://www.ijcai.org/Proceedings/03/Papers/278.pdf","open_access":"1"}],"quality_controlled":"1","date_published":"2003-08-01T00:00:00Z"},{"doi":"10.1007/978-1-4020-2705-5_21","date_published":"2003-01-01T00:00:00Z","publication_status":"published","conference":{"name":"NATO ASI on Structure and Dynamics of Elementary Matter"},"intvolume":"       166","extern":"1","citation":{"apa":"Bollenbach, M. T., Strother, T., &#38; Bauer, W. (2003). 3D supernova collapse calculations (Vol. 166, pp. 277–288). Presented at the NATO ASI on Structure and Dynamics of Elementary Matter, Springer. <a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">https://doi.org/10.1007/978-1-4020-2705-5_21</a>","mla":"Bollenbach, Mark Tobias, et al. <i>3D Supernova Collapse Calculations</i>. Vol. 166, Springer, 2003, pp. 277–88, doi:<a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">10.1007/978-1-4020-2705-5_21</a>.","ista":"Bollenbach MT, Strother T, Bauer W. 2003. 3D supernova collapse calculations. NATO ASI on Structure and Dynamics of Elementary Matter, Nato Science Series II, vol. 166, 277–288.","ama":"Bollenbach MT, Strother T, Bauer W. 3D supernova collapse calculations. In: Vol 166. Springer; 2003:277-288. doi:<a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">10.1007/978-1-4020-2705-5_21</a>","short":"M.T. Bollenbach, T. Strother, W. Bauer, in:, Springer, 2003, pp. 277–288.","chicago":"Bollenbach, Mark Tobias, T. Strother, and Wolfgang Bauer. “3D Supernova Collapse Calculations,” 166:277–88. Springer, 2003. <a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">https://doi.org/10.1007/978-1-4020-2705-5_21</a>.","ieee":"M. T. Bollenbach, T. Strother, and W. Bauer, “3D supernova collapse calculations,” presented at the NATO ASI on Structure and Dynamics of Elementary Matter, 2003, vol. 166, pp. 277–288."},"language":[{"iso":"eng"}],"alternative_title":["Nato Science Series II"],"status":"public","volume":166,"title":"3D supernova collapse calculations","publist_id":"2976","date_created":"2018-12-11T12:03:16Z","author":[{"full_name":"Bollenbach, Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","last_name":"Bollenbach","first_name":"Mark Tobias"},{"full_name":"Strother, T.","last_name":"Strother","first_name":"T."},{"first_name":"Wolfgang","last_name":"Bauer","full_name":"Bauer, Wolfgang"}],"page":"277 - 288","oa_version":"None","type":"conference","month":"01","date_updated":"2021-01-12T07:43:23Z","day":"01","_id":"3425","article_processing_charge":"No","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2003"},{"publication":"Lehrbuch Vorklinik","_id":"3458","year":"2003","publisher":"Deutscher Ärzte Verlag","publist_id":"2929","date_created":"2018-12-11T12:03:26Z","volume":"B","title":"Molekulare und zelluläre Grundlagen des Nervensystems.","day":"01","date_updated":"2021-01-12T07:43:35Z","month":"01","type":"book_chapter","page":"3 - 26","author":[{"first_name":"Peter M","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Peter Jonas"},{"first_name":"Klaus","last_name":"Unsicker","full_name":"Unsicker, Klaus"}],"citation":{"mla":"Jonas, Peter M., and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” <i>Lehrbuch Vorklinik</i>, edited by R. Schmidt, vol. B, Deutscher Ärzte Verlag, 2003, pp. 3–26.","ista":"Jonas PM, Unsicker K. 2003.Molekulare und zelluläre Grundlagen des Nervensystems. In: Lehrbuch Vorklinik. vol. B, 3–26.","apa":"Jonas, P. M., &#38; Unsicker, K. (2003). Molekulare und zelluläre Grundlagen des Nervensystems. In R. Schmidt (Ed.), <i>Lehrbuch Vorklinik</i> (Vol. B, pp. 3–26). Deutscher Ärzte Verlag.","ama":"Jonas PM, Unsicker K. Molekulare und zelluläre Grundlagen des Nervensystems. In: Schmidt R, ed. <i>Lehrbuch Vorklinik</i>. Vol B. Deutscher Ärzte Verlag; 2003:3-26.","short":"P.M. Jonas, K. Unsicker, in:, R. Schmidt (Ed.), Lehrbuch Vorklinik, Deutscher Ärzte Verlag, 2003, pp. 3–26.","ieee":"P. M. Jonas and K. Unsicker, “Molekulare und zelluläre Grundlagen des Nervensystems.,” in <i>Lehrbuch Vorklinik</i>, vol. B, R. Schmidt, Ed. Deutscher Ärzte Verlag, 2003, pp. 3–26.","chicago":"Jonas, Peter M, and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” In <i>Lehrbuch Vorklinik</i>, edited by R. Schmidt, B:3–26. Deutscher Ärzte Verlag, 2003."},"extern":1,"editor":[{"full_name":"Schmidt, R. F.","first_name":"R.","last_name":"Schmidt"}],"status":"public","quality_controlled":0,"date_published":"2003-01-01T00:00:00Z","publication_status":"published"},{"doi":"0.1038/nature01834","date_published":"2003-07-31T00:00:00Z","quality_controlled":0,"publication_status":"published","extern":1,"intvolume":"       424","citation":{"ama":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. Organization of cell assemblies in the hippocampus. <i>Nature</i>. 2003;424(6948):552-556. doi:<a href=\"https://doi.org/0.1038/nature01834\">0.1038/nature01834</a>","mla":"Harris, Kenneth, et al. “Organization of Cell Assemblies in the Hippocampus.” <i>Nature</i>, vol. 424, no. 6948, Nature Publishing Group, 2003, pp. 552–56, doi:<a href=\"https://doi.org/0.1038/nature01834\">0.1038/nature01834</a>.","ista":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. 2003. Organization of cell assemblies in the hippocampus. Nature. 424(6948), 552–556.","apa":"Harris, K., Csicsvari, J. L., Hirase, H., Dragoi, G., &#38; Buzsáki, G. (2003). Organization of cell assemblies in the hippocampus. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/0.1038/nature01834\">https://doi.org/0.1038/nature01834</a>","ieee":"K. Harris, J. L. Csicsvari, H. Hirase, G. Dragoi, and G. Buzsáki, “Organization of cell assemblies in the hippocampus,” <i>Nature</i>, vol. 424, no. 6948. Nature Publishing Group, pp. 552–556, 2003.","chicago":"Harris, Kenneth, Jozsef L Csicsvari, Hajima Hirase, George Dragoi, and György Buzsáki. “Organization of Cell Assemblies in the Hippocampus.” <i>Nature</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/0.1038/nature01834\">https://doi.org/0.1038/nature01834</a>.","short":"K. Harris, J.L. Csicsvari, H. Hirase, G. Dragoi, G. Buzsáki, Nature 424 (2003) 552–556."},"issue":"6948","status":"public","title":"Organization of cell assemblies in the hippocampus","volume":424,"date_created":"2018-12-11T12:03:47Z","publist_id":"2859","author":[{"full_name":"Harris, Kenneth D","last_name":"Harris","first_name":"Kenneth"},{"first_name":"Jozsef L","last_name":"Csicsvari","full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hirase, Hajima","last_name":"Hirase","first_name":"Hajima"},{"last_name":"Dragoi","first_name":"George","full_name":"Dragoi, George"},{"full_name":"Buzsáki, György","first_name":"György","last_name":"Buzsáki"}],"page":"552 - 556","abstract":[{"lang":"eng","text":"Neurons can produce action potentials with high temporal precision(1). A fundamental issue is whether, and how, this capability is used in information processing. According to the `cell assembly' hypothesis, transient synchrony of anatomically distributed groups of neurons underlies processing of both external sensory input and internal cognitive mechanisms(2-4). Accordingly, neuron populations should be arranged into groups whose synchrony exceeds that predicted by common modulation by sensory input. Here we find that the spike times of hippocampal pyramidal cells can be predicted more accurately by using the spike times of simultaneously recorded neurons in addition to the animals location in space. This improvement remained when the spatial prediction was refined with a spatially dependent theta phase modulation(5-8). The time window in which spike times are best predicted from simultaneous peer activity is 10-30 ms, suggesting that cell assemblies are synchronized at this timescale. Because this temporal window matches the membrane time constant of pyramidal neurons(9), the period of the hippocampal gamma oscillation(10) and the time window for synaptic plasticity(11), we propose that cooperative activity at this timescale is optimal for information transmission and storage in cortical circuits."}],"day":"31","date_updated":"2021-01-12T07:44:04Z","type":"journal_article","month":"07","publication":"Nature","_id":"3526","publisher":"Nature Publishing Group","year":"2003"}]