[{"publisher":"Association for Computing Machinery","scopus_import":"1","quality_controlled":"1","month":"08","abstract":[{"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. ","lang":"eng"}],"oa_version":"None","page":"104–111","date_created":"2022-08-17T08:56:18Z","date_published":"2003-08-01T00:00:00Z","doi":"10.1145/290941.290972","publication_status":"published","year":"2003","publication_identifier":{"isbn":["978-1-58113-015-7"],"issn":["01635840"]},"publication":"21st annual international ACM SIGIR conference on Research and development in information retrieval","language":[{"iso":"eng"}],"day":"01","conference":{"start_date":"1998-08-24","location":"Melbourne, Australia","end_date":"1998-08-28","name":"SIGIR: International Conference on Research and Development in Information Retrieval"},"type":"conference","status":"public","_id":"11897","article_processing_charge":"No","author":[{"full_name":"Bharat, Krishna","last_name":"Bharat","first_name":"Krishna"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"title":"Improved algorithms for topic distillation in a hyperlinked environment","citation":{"chicago":"Bharat, Krishna, and Monika H Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” In 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 104–111. Association for Computing Machinery, 2003. https://doi.org/10.1145/290941.290972.","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.","mla":"Bharat, Krishna, and Monika H. Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, 2003, pp. 104–111, doi:10.1145/290941.290972.","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.","ieee":"K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment,” in 21st annual international ACM SIGIR conference on Research and development in information retrieval, Melbourne, Australia, 2003, pp. 104–111.","apa":"Bharat, K., & Henzinger, M. H. (2003). Improved algorithms for topic distillation in a hyperlinked environment. In 21st annual international ACM SIGIR conference on Research and development in information retrieval (pp. 104–111). Melbourne, Australia: Association for Computing Machinery. https://doi.org/10.1145/290941.290972","ama":"Bharat K, Henzinger MH. Improved algorithms for topic distillation in a hyperlinked environment. In: 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Association for Computing Machinery; 2003:104–111. doi:10.1145/290941.290972"},"date_updated":"2023-02-17T14:47:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1"},{"type":"conference","conference":{"start_date":"2003-05-20","end_date":"2003-05-24","location":"Budapest, Hungary","name":"WWW: International Conference on World Wide Web"},"status":"public","_id":"11860","article_number":"1-10","author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Bay-Wei","last_name":"Chang","full_name":"Chang, Bay-Wei"},{"full_name":"Milch, Brian","last_name":"Milch","first_name":"Brian"},{"first_name":"Sergey","last_name":"Brin","full_name":"Brin, Sergey"}],"article_processing_charge":"No","title":"Query-free news search","citation":{"ieee":"M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” in Proceedings of the 12th international conference on World Wide Web, Budapest, Hungary, 2003.","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.","ama":"Henzinger MH, Chang B-W, Milch B, Brin S. Query-free news search. In: Proceedings of the 12th International Conference on World Wide Web. Association for Computing Machinery; 2003. doi:10.1145/775152.775154","apa":"Henzinger, M. H., Chang, B.-W., Milch, B., & Brin, S. (2003). Query-free news search. In Proceedings of the 12th international conference on World Wide Web. Budapest, Hungary: Association for Computing Machinery. https://doi.org/10.1145/775152.775154","mla":"Henzinger, Monika H., et al. “Query-Free News Search.” Proceedings of the 12th International Conference on World Wide Web, 1–10, Association for Computing Machinery, 2003, doi:10.1145/775152.775154.","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.","chicago":"Henzinger, Monika H, Bay-Wei Chang, Brian Milch, and Sergey Brin. “Query-Free News Search.” In Proceedings of the 12th International Conference on World Wide Web. Association for Computing Machinery, 2003. https://doi.org/10.1145/775152.775154."},"date_updated":"2023-02-21T16:32:40Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","quality_controlled":"1","publisher":"Association for Computing Machinery","month":"05","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"}],"oa_version":"None","doi":"10.1145/775152.775154","related_material":{"record":[{"id":"11904","status":"public","relation":"later_version"}]},"date_published":"2003-05-01T00:00:00Z","date_created":"2022-08-16T08:55:05Z","publication_identifier":{"isbn":["978-158113680-7"]},"publication_status":"published","year":"2003","day":"01","publication":"Proceedings of the 12th international conference on World Wide Web","language":[{"iso":"eng"}]},{"_id":"11909","conference":{"start_date":"2003-08-09","location":"Acapulco, Mexico","end_date":"2003-08-15","name":"IJCAI: International Joint Conference on Artificial Intelligence"},"type":"conference","status":"public","citation":{"chicago":"Henzinger, Monika H, Rajeev Motwani, and Craig Silverstein. “Challenges in Web Search Engines.” In 18th International Joint Conference on Artificial Intelligence, 1573–79. Association for Computing Machinery, 2003.","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.","mla":"Henzinger, Monika H., et al. “Challenges in Web Search Engines.” 18th International Joint Conference on Artificial Intelligence, Association for Computing Machinery, 2003, pp. 1573–79.","ieee":"M. H. Henzinger, R. Motwani, and C. Silverstein, “Challenges in web search engines,” in 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 2003, pp. 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.","apa":"Henzinger, M. H., Motwani, R., & Silverstein, C. (2003). Challenges in web search engines. In 18th International Joint Conference on Artificial Intelligence (pp. 1573–1579). Acapulco, Mexico: Association for Computing Machinery.","ama":"Henzinger MH, Motwani R, Silverstein C. Challenges in web search engines. In: 18th International Joint Conference on Artificial Intelligence. Association for Computing Machinery; 2003:1573-1579."},"date_updated":"2023-02-09T12:05:25Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Motwani, Rajeev","last_name":"Motwani","first_name":"Rajeev"},{"last_name":"Silverstein","full_name":"Silverstein, Craig","first_name":"Craig"}],"title":"Challenges in web search engines","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"}],"oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://www.ijcai.org/Proceedings/03/Papers/278.pdf"}],"oa":1,"publisher":"Association for Computing Machinery","quality_controlled":"1","scopus_import":"1","month":"08","year":"2003","publication_status":"published","publication_identifier":{"issn":["1045-0823"]},"publication":"18th International Joint Conference on Artificial Intelligence","language":[{"iso":"eng"}],"day":"01","page":"1573-1579","date_created":"2022-08-18T06:40:02Z","date_published":"2003-08-01T00:00:00Z"},{"extern":1,"citation":{"ista":"Hausel T, Thaddeus M. 2003. Mirror symmetry, langlands duality, and the Hitchin system. Inventiones Mathematicae. 153(1), 197–229.","chicago":"Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality, and the Hitchin System.” Inventiones Mathematicae. Springer, 2003. https://doi.org/10.1007/s00222-003-0286-7.","ama":"Hausel T, Thaddeus M. Mirror symmetry, langlands duality, and the Hitchin system. Inventiones Mathematicae. 2003;153(1):197-229. doi:10.1007/s00222-003-0286-7","apa":"Hausel, T., & Thaddeus, M. (2003). Mirror symmetry, langlands duality, and the Hitchin system. Inventiones Mathematicae. Springer. https://doi.org/10.1007/s00222-003-0286-7","short":"T. Hausel, M. Thaddeus, Inventiones Mathematicae 153 (2003) 197–229.","ieee":"T. Hausel and M. Thaddeus, “Mirror symmetry, langlands duality, and the Hitchin system,” Inventiones Mathematicae, vol. 153, no. 1. Springer, pp. 197–229, 2003.","mla":"Hausel, Tamás, and Michael Thaddeus. “Mirror Symmetry, Langlands Duality, and the Hitchin System.” Inventiones Mathematicae, vol. 153, no. 1, Springer, 2003, pp. 197–229, doi:10.1007/s00222-003-0286-7."},"date_updated":"2021-01-12T06:50:52Z","title":"Mirror symmetry, langlands duality, and the Hitchin system","publist_id":"5738","author":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas","last_name":"Hausel","full_name":"Tamas Hausel"},{"first_name":"Michael","last_name":"Thaddeus","full_name":"Thaddeus, Michael"}],"_id":"1457","status":"public","type":"journal_article","publication":"Inventiones Mathematicae","day":"01","year":"2003","publication_status":"published","date_created":"2018-12-11T11:52:08Z","issue":"1","volume":153,"doi":"10.1007/s00222-003-0286-7","date_published":"2003-07-01T00:00:00Z","page":"197 - 229","abstract":[{"lang":"eng","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."}],"intvolume":" 153","month":"07","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/math/0205236","open_access":"1"}],"quality_controlled":0,"publisher":"Springer"},{"type":"journal_article","status":"public","_id":"1458","publist_id":"5739","author":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas","last_name":"Hausel","full_name":"Tamas Hausel"},{"full_name":"Thaddeus, Michael","last_name":"Thaddeus","first_name":"Michael"}],"title":"Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles","citation":{"ama":"Hausel T, Thaddeus M. Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles. Journal of the American Mathematical Society. 2003;16(2):303-329. doi:10.1090/S0894-0347-02-00417-4","apa":"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. American Mathematical Society. https://doi.org/10.1090/S0894-0347-02-00417-4","ieee":"T. Hausel and M. Thaddeus, “Relations in the cohomology ring of the moduli space of rank 2 Higgs bundles,” Journal of the American Mathematical Society, vol. 16, no. 2. American Mathematical Society, pp. 303–329, 2003.","short":"T. Hausel, M. Thaddeus, Journal of the American Mathematical Society 16 (2003) 303–329.","mla":"Hausel, Tamás, and Michael Thaddeus. “Relations in the Cohomology Ring of the Moduli Space of Rank 2 Higgs Bundles.” Journal of the American Mathematical Society, vol. 16, no. 2, American Mathematical Society, 2003, pp. 303–29, doi:10.1090/S0894-0347-02-00417-4.","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.","chicago":"Hausel, Tamás, and Michael Thaddeus. “Relations in the Cohomology Ring of the Moduli Space of Rank 2 Higgs Bundles.” Journal of the American Mathematical Society. American Mathematical Society, 2003. https://doi.org/10.1090/S0894-0347-02-00417-4."},"date_updated":"2021-01-12T06:50:53Z","extern":1,"quality_controlled":0,"publisher":"American Mathematical Society","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0003094"}],"month":"04","intvolume":" 16","abstract":[{"lang":"eng","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."}],"acknowledgement":"The first author was supported by NSF grant DMS-97-29992. The second author was supported by NSF grant DMS-98-08529.","page":"303 - 329","issue":"2","date_published":"2003-04-01T00:00:00Z","doi":"10.1090/S0894-0347-02-00417-4","volume":16,"date_created":"2018-12-11T11:52:08Z","year":"2003","publication_status":"published","day":"01","publication":"Journal of the American Mathematical Society"},{"publist_id":"5740","author":[{"full_name":"Etesi, Gábor","last_name":"Etesi","first_name":"Gábor"},{"last_name":"Hausel","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas"}],"title":"On Yang-Mills instantons over multi-centered gravitational instantons","citation":{"mla":"Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered Gravitational Instantons.” Communications in Mathematical Physics, vol. 235, no. 2, Springer, 2003, pp. 275–88, doi:10.1007/s00220-003-0806-8.","short":"G. Etesi, T. Hausel, Communications in Mathematical Physics 235 (2003) 275–288.","ieee":"G. Etesi and T. Hausel, “On Yang-Mills instantons over multi-centered gravitational instantons,” Communications in Mathematical Physics, vol. 235, no. 2. Springer, pp. 275–288, 2003.","ama":"Etesi G, Hausel T. On Yang-Mills instantons over multi-centered gravitational instantons. Communications in Mathematical Physics. 2003;235(2):275-288. doi:10.1007/s00220-003-0806-8","apa":"Etesi, G., & Hausel, T. (2003). On Yang-Mills instantons over multi-centered gravitational instantons. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-003-0806-8","chicago":"Etesi, Gábor, and Tamás Hausel. “On Yang-Mills Instantons over Multi-Centered Gravitational Instantons.” Communications in Mathematical Physics. Springer, 2003. https://doi.org/10.1007/s00220-003-0806-8.","ista":"Etesi G, Hausel T. 2003. On Yang-Mills instantons over multi-centered gravitational instantons. Communications in Mathematical Physics. 235(2), 275–288."},"date_updated":"2021-01-12T06:50:53Z","extern":1,"type":"journal_article","status":"public","_id":"1459","page":"275 - 288","issue":"2","volume":235,"date_published":"2003-04-01T00:00:00Z","doi":"10.1007/s00220-003-0806-8","date_created":"2018-12-11T11:52:09Z","publication_status":"published","year":"2003","day":"01","publication":"Communications in Mathematical Physics","publisher":"Springer","quality_controlled":0,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/hep-th/0207196"}],"oa":1,"month":"04","intvolume":" 235","abstract":[{"lang":"eng","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."}],"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."},{"month":"01","intvolume":" 360","alternative_title":["Bonner mathematische Schriften"],"publisher":"Mathematisches Institut der Universität Bonn","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1311.1665"}],"oa_version":"None","abstract":[{"lang":"eng","text":"For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k."}],"date_published":"2003-01-01T00:00:00Z","volume":360,"date_created":"2018-12-11T11:44:58Z","day":"01","publication":"Proceedings of the Bonn session in analytic number theory and diophantine equations","language":[{"iso":"eng"}],"year":"2003","publication_status":"published","status":"public","type":"journal_article","_id":"166","title":"Counting rational points on del Pezzo surfaces of degree 5","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D"},{"first_name":"M","full_name":"Swarbick Jones, M","last_name":"Swarbick Jones"}],"publist_id":"7755","external_id":{"arxiv":["1311.1665"]},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Browning, Timothy D, and M Swarbick Jones. “Counting Rational Points on Del Pezzo Surfaces of Degree 5.” Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations. Mathematisches Institut der Universität Bonn, 2003.","ista":"Browning TD, Swarbick Jones M. 2003. Counting rational points on del Pezzo surfaces of degree 5. Proceedings of the Bonn session in analytic number theory and diophantine equations. 360.","mla":"Browning, Timothy D., and M. Swarbick Jones. “Counting Rational Points on Del Pezzo Surfaces of Degree 5.” Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations, vol. 360, Mathematisches Institut der Universität Bonn, 2003.","ama":"Browning TD, Swarbick Jones M. Counting rational points on del Pezzo surfaces of degree 5. Proceedings of the Bonn session in analytic number theory and diophantine equations. 2003;360.","apa":"Browning, T. D., & Swarbick Jones, M. (2003). Counting rational points on del Pezzo surfaces of degree 5. Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations. Mathematisches Institut der Universität Bonn.","short":"T.D. Browning, M. Swarbick Jones, Proceedings of the Bonn Session in Analytic Number Theory and Diophantine Equations 360 (2003).","ieee":"T. D. Browning and M. Swarbick Jones, “Counting rational points on del Pezzo surfaces of degree 5,” Proceedings of the Bonn session in analytic number theory and diophantine equations, vol. 360. Mathematisches Institut der Universität Bonn, 2003."},"date_updated":"2021-01-12T06:52:20Z"},{"date_updated":"2021-01-12T06:54:21Z","citation":{"ama":"Holt P, Morgan D, Sazanov LA. The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping. Journal of Biological Chemistry. 2003;278(44):43114-43120. doi:10.1074/jbc.M308247200","apa":"Holt, P., Morgan, D., & Sazanov, L. A. (2003). The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping. Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M308247200","short":"P. Holt, D. Morgan, L.A. Sazanov, Journal of Biological Chemistry 278 (2003) 43114–43120.","ieee":"P. Holt, D. Morgan, and L. A. Sazanov, “The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping,” Journal of Biological Chemistry, vol. 278, no. 44. American Society for Biochemistry and Molecular Biology, pp. 43114–43120, 2003.","mla":"Holt, Peter, et al. “The Location of NuoL and NuoM Subunits in the Membrane Domain of the Escherichia Coli Complex I: Implications for the Mechanism of Proton Pumping.” Journal of Biological Chemistry, vol. 278, no. 44, American Society for Biochemistry and Molecular Biology, 2003, pp. 43114–20, doi:10.1074/jbc.M308247200.","ista":"Holt P, Morgan D, Sazanov LA. 2003. The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping. Journal of Biological Chemistry. 278(44), 43114–43120.","chicago":"Holt, Peter, David Morgan, and Leonid A Sazanov. “The Location of NuoL and NuoM Subunits in the Membrane Domain of the Escherichia Coli Complex I: Implications for the Mechanism of Proton Pumping.” Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology, 2003. https://doi.org/10.1074/jbc.M308247200."},"extern":1,"author":[{"last_name":"Holt","full_name":"Holt, Peter J","first_name":"Peter"},{"first_name":"David","full_name":"Morgan, David J","last_name":"Morgan"},{"full_name":"Leonid Sazanov","orcid":"0000-0002-0977-7989","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A"}],"publist_id":"5124","title":"The location of NuoL and NuoM subunits in the membrane domain of the Escherichia coli Complex I: implications for the mechanism of proton pumping","_id":"1959","type":"journal_article","status":"public","publication_status":"published","year":"2003","day":"31","publication":"Journal of Biological Chemistry","page":"43114 - 43120","doi":"10.1074/jbc.M308247200","date_published":"2003-10-31T00:00:00Z","issue":"44","volume":278,"date_created":"2018-12-11T11:54:55Z","abstract":[{"text":"The molecular organization of bacterial NADH: ubiquinone oxidoreductase (complex I or NDH-1) is not established, apart from a rough separation into dehydrogenase, connecting and membrane domains. In this work, complex I was purified from Escherichia coli and fragmented by replacing dodecylmaltoside with other detergents. Exchange into decyl maltoside led to the removal of the hydrophobic subunit NuoL from the otherwise intact complex. Diheptanoyl phosphocholine led to the loss of NuoL and NuoM subunits, whereas other subunits remained in the complex. The presence of N,N-dimethyldodecylamine N-oxide or Triton X-100 led to further disruption of the membrane domain into fragments containing NuoL/M/N, NuoA/K/N, and NuoH/J subunits. Among the hydrophilic subunits, NuoCD was most readily dissociated from the complex, whereas NuoB was partially dissociated from the peripheral arm assembly in N,N-dimethyldodecylamine N-oxide. A model of subunit arrangement in bacterial complex I based on these data is proposed. Subunits NuoL and NuoM, which are homologous to antiporters and are implicated in proton pumping, are located at the distal end of the membrane arm, spatially separated from the redox centers of the peripheral arm. This is consistent with proposals that the mechanism of proton pumping by complex I is likely to involve long range conformational changes.","lang":"eng"}],"acknowledgement":"his work was supported by the Medical Research Council.","quality_controlled":0,"publisher":"American Society for Biochemistry and Molecular Biology","month":"10","intvolume":" 278"},{"day":"23","publication":"Journal of Biological Chemistry","publication_status":"published","year":"2003","volume":278,"date_published":"2003-05-23T00:00:00Z","issue":"21","doi":"10.1074/jbc.M208959200","date_created":"2018-12-11T11:54:55Z","page":"19483 - 19491","abstract":[{"text":"NADH-ubiquinone oxidoreductase (complex I or NDH-1) was purified from the BL21 strain of Escherichia coli using an improved procedure. The complex was effectively stabilized by addition of divalent cations and lipids, making the preparation suitable for structural studies. The ubiquinone reductase activity of the enzyme was fully restored by addition of native E. coli lipids. Two different two-dimensional crystal forms, with p2 and p3 symmetry, were obtained using lipids containing native E. coli extracts. Analysis of the crystals showed that they are formed by fully intact complex I in an L-shaped conformation. Activity assays and single particle analysis indicated that complex I maintains this structure in detergent solution and does not adopt a different conformation in the active state. Thus, we provide the first experimental evidence that complex I from E. coli has an L-shape in a lipid bilayer and confirm that this is also the case for the active enzyme in solution. This suggests strongly that bacterial complex I exists in an L-shaped conformation in vivo. Our results also indicate that native lipids play an important role in the activation, stabilization and, as a consequence, crystallization of purified complex I from E. coli.","lang":"eng"}],"month":"05","intvolume":" 278","quality_controlled":0,"publisher":"American Society for Biochemistry and Molecular Biology","extern":1,"date_updated":"2021-01-12T06:54:21Z","citation":{"chicago":"Sazanov, Leonid A, Joe Carroll, Peter Holt, Laurence Toime, and Ian Fearnley. “A Role for Native Lipids in the Stabilization and Two Dimensional Crystallization of the Escherichia Coli NADH Ubiquinone Oxidoreductase (Complex I).” Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology, 2003. https://doi.org/10.1074/jbc.M208959200.","ista":"Sazanov LA, Carroll J, Holt P, Toime L, Fearnley I. 2003. A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I). Journal of Biological Chemistry. 278(21), 19483–19491.","mla":"Sazanov, Leonid A., et al. “A Role for Native Lipids in the Stabilization and Two Dimensional Crystallization of the Escherichia Coli NADH Ubiquinone Oxidoreductase (Complex I).” Journal of Biological Chemistry, vol. 278, no. 21, American Society for Biochemistry and Molecular Biology, 2003, pp. 19483–91, doi:10.1074/jbc.M208959200.","short":"L.A. Sazanov, J. Carroll, P. Holt, L. Toime, I. Fearnley, Journal of Biological Chemistry 278 (2003) 19483–19491.","ieee":"L. A. Sazanov, J. Carroll, P. Holt, L. Toime, and I. Fearnley, “A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I),” Journal of Biological Chemistry, vol. 278, no. 21. American Society for Biochemistry and Molecular Biology, pp. 19483–19491, 2003.","apa":"Sazanov, L. A., Carroll, J., Holt, P., Toime, L., & Fearnley, I. (2003). A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I). Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M208959200","ama":"Sazanov LA, Carroll J, Holt P, Toime L, Fearnley I. A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I). Journal of Biological Chemistry. 2003;278(21):19483-19491. doi:10.1074/jbc.M208959200"},"title":"A role for native lipids in the stabilization and two dimensional crystallization of the Escherichia coli NADH ubiquinone oxidoreductase (complex I)","author":[{"last_name":"Sazanov","full_name":"Leonid Sazanov","orcid":"0000-0002-0977-7989","first_name":"Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Carroll","full_name":"Carroll, Joe D","first_name":"Joe"},{"first_name":"Peter","last_name":"Holt","full_name":"Holt, Peter J"},{"last_name":"Toime","full_name":"Toime, Laurence J","first_name":"Laurence"},{"first_name":"Ian","full_name":"Fearnley, Ian M","last_name":"Fearnley"}],"publist_id":"5125","_id":"1960","status":"public","type":"journal_article"},{"publisher":"Instytut Matematyczny","quality_controlled":0,"intvolume":" 108","month":"01","page":"275 - 295","date_created":"2018-12-11T11:45:12Z","volume":108,"issue":"3","doi":"10.4064/aa108-3-7","date_published":"2003-01-01T00:00:00Z","year":"2003","publication_status":"published","publication":"Acta Arithmetica","day":"01","type":"journal_article","status":"public","_id":"205","author":[{"full_name":"Timothy Browning","orcid":"0000-0002-8314-0177","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D"}],"publist_id":"7707","title":"Counting rational points on cubic and quartic surfaces","citation":{"ista":"Browning TD. 2003. Counting rational points on cubic and quartic surfaces. Acta Arithmetica. 108(3), 275–295.","chicago":"Browning, Timothy D. “Counting Rational Points on Cubic and Quartic Surfaces.” Acta Arithmetica. Instytut Matematyczny, 2003. https://doi.org/10.4064/aa108-3-7.","ama":"Browning TD. Counting rational points on cubic and quartic surfaces. Acta Arithmetica. 2003;108(3):275-295. doi:10.4064/aa108-3-7","apa":"Browning, T. D. (2003). Counting rational points on cubic and quartic surfaces. Acta Arithmetica. Instytut Matematyczny. https://doi.org/10.4064/aa108-3-7","ieee":"T. D. Browning, “Counting rational points on cubic and quartic surfaces,” Acta Arithmetica, vol. 108, no. 3. Instytut Matematyczny, pp. 275–295, 2003.","short":"T.D. Browning, Acta Arithmetica 108 (2003) 275–295.","mla":"Browning, Timothy D. “Counting Rational Points on Cubic and Quartic Surfaces.” Acta Arithmetica, vol. 108, no. 3, Instytut Matematyczny, 2003, pp. 275–95, doi:10.4064/aa108-3-7."},"date_updated":"2021-01-12T06:54:58Z","extern":1},{"month":"03","intvolume":" 54","quality_controlled":0,"publisher":"Unknown","abstract":[{"lang":"eng","text":"Let T ⊂ ℙ 4 be a non-singular threefold of degree at least four. Then we show that the number of points in T(ℚ), with height at most B, is o(B 3) or B → ∞."}],"issue":"1","doi":"10.1093/qjmath/54.1.33","volume":54,"date_published":"2003-03-01T00:00:00Z","date_created":"2018-12-11T11:45:12Z","page":"33 - 39","day":"01","publication":"Quarterly Journal of Mathematics","publication_status":"published","year":"2003","status":"public","type":"journal_article","_id":"206","title":"A note on the distribution of rational points on threefolds","author":[{"last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Timothy Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7706","extern":1,"citation":{"mla":"Browning, Timothy D. “A Note on the Distribution of Rational Points on Threefolds.” Quarterly Journal of Mathematics, vol. 54, no. 1, Unknown, 2003, pp. 33–39, doi:10.1093/qjmath/54.1.33.","ama":"Browning TD. A note on the distribution of rational points on threefolds. Quarterly Journal of Mathematics. 2003;54(1):33-39. doi:10.1093/qjmath/54.1.33","apa":"Browning, T. D. (2003). A note on the distribution of rational points on threefolds. Quarterly Journal of Mathematics. Unknown. https://doi.org/10.1093/qjmath/54.1.33","ieee":"T. D. Browning, “A note on the distribution of rational points on threefolds,” Quarterly Journal of Mathematics, vol. 54, no. 1. Unknown, pp. 33–39, 2003.","short":"T.D. Browning, Quarterly Journal of Mathematics 54 (2003) 33–39.","chicago":"Browning, Timothy D. “A Note on the Distribution of Rational Points on Threefolds.” Quarterly Journal of Mathematics. Unknown, 2003. https://doi.org/10.1093/qjmath/54.1.33.","ista":"Browning TD. 2003. A note on the distribution of rational points on threefolds. Quarterly Journal of Mathematics. 54(1), 33–39."},"date_updated":"2021-01-12T06:55:02Z"},{"author":[{"id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","last_name":"Browning"}],"publist_id":"7704","title":"Sums of four biquadrates","citation":{"ista":"Browning TD. 2003. Sums of four biquadrates. Mathematical Proceedings of the Cambridge Philosophical Society. 134(3), 385–395.","chicago":"Browning, Timothy D. “Sums of Four Biquadrates.” Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press, 2003. https://doi.org/10.1017/S0305004102006382.","apa":"Browning, T. D. (2003). Sums of four biquadrates. Mathematical Proceedings of the Cambridge Philosophical Society. Cambridge University Press. https://doi.org/10.1017/S0305004102006382","ama":"Browning TD. Sums of four biquadrates. Mathematical Proceedings of the Cambridge Philosophical Society. 2003;134(3):385-395. doi:10.1017/S0305004102006382","ieee":"T. D. Browning, “Sums of four biquadrates,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 134, no. 3. Cambridge University Press, pp. 385–395, 2003.","short":"T.D. Browning, Mathematical Proceedings of the Cambridge Philosophical Society 134 (2003) 385–395.","mla":"Browning, Timothy D. “Sums of Four Biquadrates.” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 134, no. 3, Cambridge University Press, 2003, pp. 385–95, doi:10.1017/S0305004102006382."},"date_updated":"2021-01-12T06:55:07Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"207","page":"385 - 395","issue":"3","date_published":"2003-05-01T00:00:00Z","volume":134,"doi":"10.1017/S0305004102006382","date_created":"2018-12-11T11:45:12Z","publication_status":"published","year":"2003","day":"01","publication":"Mathematical Proceedings of the Cambridge Philosophical Society","language":[{"iso":"eng"}],"publisher":"Cambridge University Press","quality_controlled":"1","month":"05","intvolume":" 134","oa_version":"None"},{"_id":"208","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:55:10Z","citation":{"ista":"Browning TD. 2003. Counting rational points on diagonal quadratic surfaces. Quarterly Journal of Mathematics. 54(1), 11–31.","chicago":"Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.” Quarterly Journal of Mathematics. Oxford University Press, 2003. https://doi.org/10.1093/qjmath/54.1.11.","ama":"Browning TD. Counting rational points on diagonal quadratic surfaces. Quarterly Journal of Mathematics. 2003;54(1):11-31. doi:10.1093/qjmath/54.1.11","apa":"Browning, T. D. (2003). Counting rational points on diagonal quadratic surfaces. Quarterly Journal of Mathematics. Oxford University Press. https://doi.org/10.1093/qjmath/54.1.11","ieee":"T. D. Browning, “Counting rational points on diagonal quadratic surfaces,” Quarterly Journal of Mathematics, vol. 54, no. 1. Oxford University Press, pp. 11–31, 2003.","short":"T.D. Browning, Quarterly Journal of Mathematics 54 (2003) 11–31.","mla":"Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.” Quarterly Journal of Mathematics, vol. 54, no. 1, Oxford University Press, 2003, pp. 11–31, doi:10.1093/qjmath/54.1.11."},"title":"Counting rational points on diagonal quadratic surfaces","publist_id":"7705","author":[{"first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Timothy Browning"}],"abstract":[{"lang":"eng","text":"For any ε > 0 and any diagonal quadratic form Q ∈ ℤ[x 1, x 2, x 3, x 4] with a square-free discriminant of modulus Δ Q ≠ 0, we establish the uniform estimate ≪ε B 3/2+ε + B 2+ε/Δ Q 1/6 for the number of rational points of height at most B lying in the projective surface Q = 0."}],"intvolume":" 54","month":"03","quality_controlled":0,"publisher":"Oxford University Press","publication":"Quarterly Journal of Mathematics","day":"01","year":"2003","publication_status":"published","date_created":"2018-12-11T11:45:13Z","volume":54,"issue":"1","date_published":"2003-03-01T00:00:00Z","doi":"10.1093/qjmath/54.1.11","page":"11 - 31"},{"month":"01","intvolume":" 327","alternative_title":["Contemporary Mathematics"],"quality_controlled":0,"publisher":"American Mathematical Society","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math-ph/0210028"}],"doi":"10.1090/conm/327/05818","date_published":"2003-01-01T00:00:00Z","volume":327,"date_created":"2018-12-11T11:57:04Z","page":"239 - 250","day":"01","year":"2003","publication_status":"published","status":"public","type":"conference","conference":{"name":"Differential Equations and Mathematical Physics"},"_id":"2337","title":"Bose-Einstein condensation of dilute gases in traps ","editor":[{"full_name":"Karpeshina, Yulia","last_name":"Karpeshina","first_name":"Yulia"},{"last_name":"Weikard","full_name":"Weikard, Rudi","first_name":"Rudi"},{"first_name":"Yanni","last_name":"Zeng","full_name":"Zeng, Yanni"}],"publist_id":"4589","author":[{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott H"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"extern":1,"citation":{"chicago":"Lieb, Élliott, and Robert Seiringer. “Bose-Einstein Condensation of Dilute Gases in Traps .” edited by Yulia Karpeshina, Rudi Weikard, and Yanni Zeng, 327:239–50. American Mathematical Society, 2003. https://doi.org/10.1090/conm/327/05818.","ista":"Lieb É, Seiringer R. 2003. Bose-Einstein condensation of dilute gases in traps . Differential Equations and Mathematical Physics, Contemporary Mathematics, vol. 327, 239–250.","mla":"Lieb, Élliott, and Robert Seiringer. Bose-Einstein Condensation of Dilute Gases in Traps . Edited by Yulia Karpeshina et al., vol. 327, American Mathematical Society, 2003, pp. 239–50, doi:10.1090/conm/327/05818.","short":"É. Lieb, R. Seiringer, in:, Y. Karpeshina, R. Weikard, Y. Zeng (Eds.), American Mathematical Society, 2003, pp. 239–250.","ieee":"É. Lieb and R. Seiringer, “Bose-Einstein condensation of dilute gases in traps ,” presented at the Differential Equations and Mathematical Physics, 2003, vol. 327, pp. 239–250.","ama":"Lieb É, Seiringer R. Bose-Einstein condensation of dilute gases in traps . In: Karpeshina Y, Weikard R, Zeng Y, eds. Vol 327. American Mathematical Society; 2003:239-250. doi:10.1090/conm/327/05818","apa":"Lieb, É., & Seiringer, R. (2003). Bose-Einstein condensation of dilute gases in traps . In Y. Karpeshina, R. Weikard, & Y. Zeng (Eds.) (Vol. 327, pp. 239–250). Presented at the Differential Equations and Mathematical Physics, American Mathematical Society. https://doi.org/10.1090/conm/327/05818"},"date_updated":"2021-01-12T06:56:52Z"},{"quality_controlled":0,"publisher":"Princeton University Press","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0205088"}],"oa":1,"month":"11","intvolume":" 158","abstract":[{"text":"The classic Poincaré inequality bounds the L q-norm of a function f in a bounded domain Ω ⊂ ℝ n in terms of some L p-norm of its gradient in Ω. We generalize this in two ways: In the first generalization we remove a set Τ from Ω and concentrate our attention on Λ = Ω \\ Τ. This new domain might not even be connected and hence no Poincaré inequality can generally hold for it, or if it does hold it might have a very bad constant. This is so even if the volume of Τ is arbitrarily small. A Poincaré inequality does hold, however, if one makes the additional assumption that f has a finite L p gradient norm on the whole of Ω, not just on Λ. The important point is that the Poincaré inequality thus obtained bounds the L q-norm of f in terms of the L p gradient norm on Λ (not Ω) plus an additional term that goes to zero as the volume of Τ goes to zero. This error term depends on Τ only through its volume. Apart from this additive error term, the constant in the inequality remains that of the 'nice' domain Ω. In the second generalization we are given a vector field A and replace ∇ by ∇ + iA(x) (geometrically, a connection on a U(1) bundle). Unlike the A = 0 case, the infimum of ∥(∇ + iA)f∥ p over all f with a given ∥f∥ q is in general not zero. This permits an improvement of the inequality by the addition of a term whose sharp value we derive. We describe some open problems that arise from these generalizations.","lang":"eng"}],"page":"1067 - 1080","issue":"3","date_published":"2003-11-01T00:00:00Z","volume":158,"doi":"10.4007/annals.2003.158.1067 ","date_created":"2018-12-11T11:57:11Z","year":"2003","publication_status":"published","day":"01","publication":"Annals of Mathematics","type":"journal_article","status":"public","_id":"2357","author":[{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott H"},{"last_name":"Seiringer","full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jakob","full_name":"Yngvason, Jakob","last_name":"Yngvason"}],"publist_id":"4570","title":"Poincaré inequalities in punctured domains","date_updated":"2021-01-12T06:57:00Z","citation":{"chicago":"Lieb, Élliott, Robert Seiringer, and Jakob Yngvason. “Poincaré Inequalities in Punctured Domains.” Annals of Mathematics. Princeton University Press, 2003. https://doi.org/10.4007/annals.2003.158.1067 .","ista":"Lieb É, Seiringer R, Yngvason J. 2003. Poincaré inequalities in punctured domains. Annals of Mathematics. 158(3), 1067–1080.","mla":"Lieb, Élliott, et al. “Poincaré Inequalities in Punctured Domains.” Annals of Mathematics, vol. 158, no. 3, Princeton University Press, 2003, pp. 1067–80, doi:10.4007/annals.2003.158.1067 .","short":"É. Lieb, R. Seiringer, J. Yngvason, Annals of Mathematics 158 (2003) 1067–1080.","ieee":"É. Lieb, R. Seiringer, and J. Yngvason, “Poincaré inequalities in punctured domains,” Annals of Mathematics, vol. 158, no. 3. Princeton University Press, pp. 1067–1080, 2003.","ama":"Lieb É, Seiringer R, Yngvason J. Poincaré inequalities in punctured domains. Annals of Mathematics. 2003;158(3):1067-1080. doi:10.4007/annals.2003.158.1067 ","apa":"Lieb, É., Seiringer, R., & Yngvason, J. (2003). Poincaré inequalities in punctured domains. Annals of Mathematics. Princeton University Press. https://doi.org/10.4007/annals.2003.158.1067 "},"extern":1},{"month":"09","intvolume":" 36","quality_controlled":0,"publisher":"IOP Publishing Ltd.","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math-ph/0306022"}],"abstract":[{"text":"We investigate the ground state properties of a gas of interacting particles confined in an external potential in three dimensions and subject to rotation around an axis of symmetry. We consider the Gross-Pitaevskii (GP) limit of a dilute gas. Analysing both the absolute and the bosonic ground states of the system, we show, in particular, their different behaviour for a certain range of parameters. This parameter range is determined by the question whether the rotational symmetry in the minimizer of the GP functional is broken or not. For the absolute ground state, we prove that in the GP limit a modified GP functional depending on density matrices correctly describes the energy and reduced density matrices, independent of symmetry breaking. For the bosonic ground state this holds true if and only if the symmetry is unbroken.","lang":"eng"}],"date_published":"2003-09-19T00:00:00Z","doi":"10.1088/0305-4470/36/37/312","volume":36,"issue":"37","date_created":"2018-12-11T11:57:10Z","page":"9755 - 9778","day":"19","publication":"Journal of Physics A: Mathematical and Theoretical","publication_status":"published","year":"2003","status":"public","type":"journal_article","_id":"2354","title":"Ground state asymptotics of a dilute, rotating gas","publist_id":"4572","author":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521"}],"extern":1,"citation":{"mla":"Seiringer, Robert. “Ground State Asymptotics of a Dilute, Rotating Gas.” Journal of Physics A: Mathematical and Theoretical, vol. 36, no. 37, IOP Publishing Ltd., 2003, pp. 9755–78, doi:10.1088/0305-4470/36/37/312.","ieee":"R. Seiringer, “Ground state asymptotics of a dilute, rotating gas,” Journal of Physics A: Mathematical and Theoretical, vol. 36, no. 37. IOP Publishing Ltd., pp. 9755–9778, 2003.","short":"R. Seiringer, Journal of Physics A: Mathematical and Theoretical 36 (2003) 9755–9778.","apa":"Seiringer, R. (2003). Ground state asymptotics of a dilute, rotating gas. Journal of Physics A: Mathematical and Theoretical. IOP Publishing Ltd. https://doi.org/10.1088/0305-4470/36/37/312","ama":"Seiringer R. Ground state asymptotics of a dilute, rotating gas. Journal of Physics A: Mathematical and Theoretical. 2003;36(37):9755-9778. doi:10.1088/0305-4470/36/37/312","chicago":"Seiringer, Robert. “Ground State Asymptotics of a Dilute, Rotating Gas.” Journal of Physics A: Mathematical and Theoretical. IOP Publishing Ltd., 2003. https://doi.org/10.1088/0305-4470/36/37/312.","ista":"Seiringer R. 2003. Ground state asymptotics of a dilute, rotating gas. Journal of Physics A: Mathematical and Theoretical. 36(37), 9755–9778."},"date_updated":"2021-01-12T06:56:59Z"},{"year":"2003","publication_status":"published","day":"10","publication":"Physical Review Letters","page":"1504011 - 1504014","date_published":"2003-10-10T00:00:00Z","doi":"10.1103/PhysRevLett.91.150401","issue":"15","volume":91,"date_created":"2018-12-11T11:57:12Z","abstract":[{"lang":"eng","text":"A study was conducted on the one-dimensional (1D) bosons in three-dimensional (3D) traps. A rigorous analysis was carried out on the parameter regions in which various types of 1D or 3D behavior occurred in the ground state. The four parameter regions include density, transverse, longitudinal dimensions and scattering length."}],"publisher":"American Physical Society","quality_controlled":0,"main_file_link":[{"url":"http://arxiv.org/abs/cond-mat/0304071","open_access":"1"}],"oa":1,"month":"10","intvolume":" 91","citation":{"chicago":"Lieb, Élliott, Robert Seiringer, and Jakob Yngvason. “One-Dimensional Bosons in Three-Dimensional Traps.” Physical Review Letters. American Physical Society, 2003. https://doi.org/10.1103/PhysRevLett.91.150401.","ista":"Lieb É, Seiringer R, Yngvason J. 2003. One-dimensional Bosons in three-dimensional traps. Physical Review Letters. 91(15), 1504011–1504014.","mla":"Lieb, Élliott, et al. “One-Dimensional Bosons in Three-Dimensional Traps.” Physical Review Letters, vol. 91, no. 15, American Physical Society, 2003, pp. 1504011–14, doi:10.1103/PhysRevLett.91.150401.","ama":"Lieb É, Seiringer R, Yngvason J. One-dimensional Bosons in three-dimensional traps. Physical Review Letters. 2003;91(15):1504011-1504014. doi:10.1103/PhysRevLett.91.150401","apa":"Lieb, É., Seiringer, R., & Yngvason, J. (2003). One-dimensional Bosons in three-dimensional traps. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.91.150401","ieee":"É. Lieb, R. Seiringer, and J. Yngvason, “One-dimensional Bosons in three-dimensional traps,” Physical Review Letters, vol. 91, no. 15. American Physical Society, pp. 1504011–1504014, 2003.","short":"É. Lieb, R. Seiringer, J. Yngvason, Physical Review Letters 91 (2003) 1504011–1504014."},"date_updated":"2021-01-12T06:57:00Z","extern":1,"author":[{"last_name":"Lieb","full_name":"Lieb, Élliott H","first_name":"Élliott"},{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521"},{"first_name":"Jakob","last_name":"Yngvason","full_name":"Yngvason, Jakob"}],"publist_id":"4571","title":"One-dimensional Bosons in three-dimensional traps","_id":"2358","type":"journal_article","status":"public"},{"author":[{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Uli Wagner"}],"publist_id":"4511","title":"On k-Sets and Their Applications","citation":{"ista":"Wagner U. 2003. On k-Sets and Their Applications. ETH Zurich.","chicago":"Wagner, Uli. “On K-Sets and Their Applications.” ETH Zurich, 2003. https://doi.org/10.3929/ethz-a-004708408.","short":"U. Wagner, On K-Sets and Their Applications, ETH Zurich, 2003.","ieee":"U. Wagner, “On k-Sets and Their Applications,” ETH Zurich, 2003.","ama":"Wagner U. On k-Sets and Their Applications. 2003. doi:10.3929/ethz-a-004708408","apa":"Wagner, U. (2003). On k-Sets and Their Applications. ETH Zurich. https://doi.org/10.3929/ethz-a-004708408","mla":"Wagner, Uli. On K-Sets and Their Applications. ETH Zurich, 2003, doi:10.3929/ethz-a-004708408."},"date_updated":"2021-01-12T06:57:20Z","extern":1,"type":"dissertation","status":"public","_id":"2414","date_published":"2003-01-01T00:00:00Z","doi":"10.3929/ethz-a-004708408","date_created":"2018-12-11T11:57:31Z","publication_status":"published","year":"2003","day":"01","quality_controlled":0,"publisher":"ETH Zurich","month":"01"},{"day":"01","publication_status":"published","year":"2003","date_created":"2018-12-11T11:57:35Z","date_published":"2003-06-01T00:00:00Z","doi":"10.1145/777792.777841","page":"329 - 337","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"}],"month":"06","quality_controlled":0,"publisher":"ACM","extern":1,"date_updated":"2021-01-12T06:57:24Z","citation":{"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.","chicago":"Giesen, Joachim, and Uli Wagner. “Shape Dimension and Intrinsic Metric from Samples of Manifolds with High Co-Dimension,” 329–37. ACM, 2003. https://doi.org/10.1145/777792.777841.","short":"J. Giesen, U. Wagner, in:, ACM, 2003, pp. 329–337.","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.","ama":"Giesen J, Wagner U. Shape dimension and intrinsic metric from samples of manifolds with high co-dimension. In: ACM; 2003:329-337. doi:10.1145/777792.777841","apa":"Giesen, J., & 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. https://doi.org/10.1145/777792.777841","mla":"Giesen, Joachim, and Uli Wagner. Shape Dimension and Intrinsic Metric from Samples of Manifolds with High Co-Dimension. ACM, 2003, pp. 329–37, doi:10.1145/777792.777841."},"title":"Shape dimension and intrinsic metric from samples of manifolds with high co-dimension","publist_id":"4501","author":[{"first_name":"Joachim","last_name":"Giesen","full_name":"Giesen, Joachim"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Uli Wagner"}],"_id":"2424","status":"public","conference":{"name":"SoCG: Symposium on Computational Geometry"},"type":"conference"},{"_id":"2423","type":"conference","conference":{"name":"SoCG: Symposium on Computational Geometry"},"status":"public","citation":{"ista":"Matoušek J, Wagner U. 2003. New constructions of weak epsilon-nets. SoCG: Symposium on Computational Geometry, 129–135.","chicago":"Matoušek, Jiří, and Uli Wagner. “New Constructions of Weak Epsilon-Nets,” 129–35. ACM, 2003. https://doi.org/10.1145/777792.777813.","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.","short":"J. Matoušek, U. Wagner, in:, ACM, 2003, pp. 129–135.","ama":"Matoušek J, Wagner U. New constructions of weak epsilon-nets. In: ACM; 2003:129-135. doi:10.1145/777792.777813","apa":"Matoušek, J., & Wagner, U. (2003). New constructions of weak epsilon-nets (pp. 129–135). Presented at the SoCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777813","mla":"Matoušek, Jiří, and Uli Wagner. New Constructions of Weak Epsilon-Nets. ACM, 2003, pp. 129–35, doi:10.1145/777792.777813."},"date_updated":"2021-01-12T06:57:24Z","extern":1,"publist_id":"4502","author":[{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Uli Wagner","last_name":"Wagner"}],"title":"New constructions of weak epsilon-nets","abstract":[{"lang":"eng","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."}],"publisher":"ACM","quality_controlled":0,"month":"06","publication_status":"published","year":"2003","day":"01","page":"129 - 135","doi":"10.1145/777792.777813","date_published":"2003-06-01T00:00:00Z","date_created":"2018-12-11T11:57:34Z"},{"extern":1,"citation":{"mla":"Wagner, Uli. On the Rectilinear Crossing Number of Complete Graphs. SIAM, 2003, pp. 583–88.","short":"U. Wagner, in:, SIAM, 2003, pp. 583–588.","ieee":"U. Wagner, “On the rectilinear crossing number of complete graphs,” presented at the SODA: Symposium on Discrete Algorithms, 2003, pp. 583–588.","apa":"Wagner, U. (2003). On the rectilinear crossing number of complete graphs (pp. 583–588). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.","ama":"Wagner U. On the rectilinear crossing number of complete graphs. In: SIAM; 2003:583-588.","chicago":"Wagner, Uli. “On the Rectilinear Crossing Number of Complete Graphs,” 583–88. SIAM, 2003.","ista":"Wagner U. 2003. On the rectilinear crossing number of complete graphs. SODA: Symposium on Discrete Algorithms, 583–588."},"date_updated":"2021-01-12T06:57:24Z","title":"On the rectilinear crossing number of complete graphs","publist_id":"4503","author":[{"first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568","full_name":"Uli Wagner"}],"_id":"2422","status":"public","type":"conference","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"day":"01","year":"2003","publication_status":"published","date_published":"2003-01-01T00:00:00Z","date_created":"2018-12-11T11:57:34Z","page":"583 - 588","abstract":[{"text":"We prove a lower bound of 0.3288(4 n) for the rectilinear crossing number cr̄(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadrilaterals in any set of n points in general position in the Euclidean plane. As we see it, the main contribution of this paper is not so much the concrete numerical improvement over earlier bounds, as the novel method of proof, which is not based on bounding cr̄(Kn) for some small n.","lang":"eng"}],"month":"01","publisher":"SIAM","quality_controlled":0,"main_file_link":[{"url":"http://dl.acm.org/citation.cfm?id=644206","open_access":"0"}]},{"publication_status":"published","year":"2003","publication":"Annals of Neurology","day":"01","page":"325 - 336","date_created":"2018-12-11T11:58:44Z","issue":"3","date_published":"2003-03-01T00:00:00Z","volume":53,"doi":"10.1002/ana.10451","abstract":[{"lang":"eng","text":"Patients with Hodgkin's disease can develop paraneoplastic cerebellar ataxia because of the generation of autoantibodies against mGluR1 (mGluR1-Abs). Yet, the pathophysiological mechanisms underlying their motor coordination deficits remain to be elucidated. Here, we show that application of IgG purified from the patients' serum to cerebellar slices of mice acutely reduces the basal activity of Purkinje cells, whereas application to the flocculus of mice in vivo evokes acute disturbances in the performance of their compensatory eye movements. In addition, the mGluR1-Abs block induction of long-term depression in cultured mouse Purkinje cells, whereas the cerebellar motor learning behavior of the patients is affected in that they show impaired adaptation of their saccadic eye movements. Finally, postmortem analysis of the cerebellum of a paraneoplastic cerebellar ataxia patient showed that the number of Purkinje cells was significantly reduced by approximately two thirds compared with three controls. We conclude that autoantibodies against mGluR1 can cause cerebellar motor coordination deficits caused by a combination of rapid effects on both acute and plastic responses of Purkinje cells and chronic degenerative effects."}],"quality_controlled":0,"publisher":"Wiley-Blackwell","intvolume":" 53","month":"03","citation":{"ista":"Coesmans M, Sillevis Smitt P, Linden D, Shigemoto R, Hirano T, Yamakawa Y, Van Alphen A, Luo C, Van Der Geest J, Kros J, Gaillard C, Frens M, De Zeeuw C. 2003. Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. Annals of Neurology. 53(3), 325–336.","chicago":"Coesmans, Michiel, Peter Sillevis Smitt, David Linden, Ryuichi Shigemoto, Tomoo Hirano, Yoshinori Yamakawa, Adriaan Van Alphen, et al. “Mechanisms Underlying Cerebellar Motor Deficits Due to MGluR1-Autoantibodies.” Annals of Neurology. Wiley-Blackwell, 2003. https://doi.org/10.1002/ana.10451.","apa":"Coesmans, M., Sillevis Smitt, P., Linden, D., Shigemoto, R., Hirano, T., Yamakawa, Y., … De Zeeuw, C. (2003). Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. Annals of Neurology. Wiley-Blackwell. https://doi.org/10.1002/ana.10451","ama":"Coesmans M, Sillevis Smitt P, Linden D, et al. Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. Annals of Neurology. 2003;53(3):325-336. doi:10.1002/ana.10451","short":"M. Coesmans, P. Sillevis Smitt, D. Linden, R. Shigemoto, T. Hirano, Y. Yamakawa, A. Van Alphen, C. Luo, J. Van Der Geest, J. Kros, C. Gaillard, M. Frens, C. De Zeeuw, Annals of Neurology 53 (2003) 325–336.","ieee":"M. Coesmans et al., “Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies,” Annals of Neurology, vol. 53, no. 3. Wiley-Blackwell, pp. 325–336, 2003.","mla":"Coesmans, Michiel, et al. “Mechanisms Underlying Cerebellar Motor Deficits Due to MGluR1-Autoantibodies.” Annals of Neurology, vol. 53, no. 3, Wiley-Blackwell, 2003, pp. 325–36, doi:10.1002/ana.10451."},"date_updated":"2021-01-12T06:58:39Z","extern":1,"author":[{"first_name":"Michiel","last_name":"Coesmans","full_name":"Coesmans, Michiel P"},{"first_name":"Peter","full_name":"Sillevis-Smitt, Peter A","last_name":"Sillevis Smitt"},{"first_name":"David","last_name":"Linden","full_name":"Linden, David J"},{"orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tomoo","last_name":"Hirano","full_name":"Hirano, Tomoo"},{"full_name":"Yamakawa, Yoshinori","last_name":"Yamakawa","first_name":"Yoshinori"},{"first_name":"Adriaan","full_name":"Van Alphen, Adriaan M","last_name":"Van Alphen"},{"full_name":"Luo, Chongde","last_name":"Luo","first_name":"Chongde"},{"first_name":"Jos","full_name":"Van Der Geest, Jos N","last_name":"Van Der Geest"},{"last_name":"Kros","full_name":"Kros, Johan M","first_name":"Johan"},{"full_name":"Gaillard, Carlo A","last_name":"Gaillard","first_name":"Carlo"},{"first_name":"Maarten","full_name":"Frens, Maarten A","last_name":"Frens"},{"first_name":"Chris","last_name":"De Zeeuw","full_name":"De Zeeuw, Chris I"}],"publist_id":"4274","title":"Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies","_id":"2623","type":"journal_article","status":"public"},{"publisher":"Wiley-Blackwell","quality_controlled":0,"intvolume":" 17","month":"03","abstract":[{"lang":"eng","text":"Metabotropic glutamate receptor 1 (mGluR1) plays a crucial role in synaptic plasticity and motor learning in the cerebellum. We have studied activity-dependent changes in mGluR1 function in mouse cultured Purkinje neurons. Depolarizing stimulation potentiated Ca2+ and current responses to an mGluR1 agonist for several hours in the cultured Purkinje neurons. It also blocked internalization of mGluR1 and increased the number of mGluR1s on the cell membrane. We found that depolarization simultaneously increased transcription of Homer1a in Purkinje neurons. Homer1a inhibited internalization and increased cell-surface expression of mGluR1 when coexpressed in human embryonic kidney (HEK)-293 cells. Depolarization-induced Homer1a expression in Purkinje neurons was blocked by a mitogen-activated protein kinase (MAPK) inhibitor. Changes in internalization and mGluR1-mediated Ca2+ response were also blocked by inhibition of MAPK activity, suggesting that localization and activity of mGluR1 were regulated in the same signalling pathway as Homer1a expression. It is thus suggested that depolarization of the Purkinje neuron leads to the increment in mGluR1 responsiveness through MAPK activity and induction of Homer1a expression, which increases active mGluR1 on the cell surface by blocking internalization of mGluR1."}],"page":"1023 - 1032","date_created":"2018-12-11T11:58:44Z","volume":17,"doi":"10.1046/j.1460-9568.2003.02499.x","date_published":"2003-03-01T00:00:00Z","issue":"5","year":"2003","publication_status":"published","publication":"European Journal of Neuroscience","day":"01","type":"journal_article","status":"public","_id":"2625","publist_id":"4273","author":[{"first_name":"Itsunari","last_name":"Minami","full_name":"Minami, Itsunari"},{"first_name":"Mineko","last_name":"Kengaku","full_name":"Kengaku, Mineko"},{"last_name":"Smitt","full_name":"Smitt, Sillevis P","first_name":"Sillevis"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hirano, Tomoo","last_name":"Hirano","first_name":"Tomoo"}],"title":"Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons","date_updated":"2021-01-12T06:58:39Z","citation":{"ista":"Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. 2003. Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. European Journal of Neuroscience. 17(5), 1023–1032.","chicago":"Minami, Itsunari, Mineko Kengaku, Sillevis Smitt, Ryuichi Shigemoto, and Tomoo Hirano. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced Homer1a in Mouse Cerebellar Purkinje Neurons.” European Journal of Neuroscience. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1460-9568.2003.02499.x.","short":"I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, T. Hirano, European Journal of Neuroscience 17 (2003) 1023–1032.","ieee":"I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, and T. Hirano, “Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons,” European Journal of Neuroscience, vol. 17, no. 5. Wiley-Blackwell, pp. 1023–1032, 2003.","ama":"Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. European Journal of Neuroscience. 2003;17(5):1023-1032. doi:10.1046/j.1460-9568.2003.02499.x","apa":"Minami, I., Kengaku, M., Smitt, S., Shigemoto, R., & Hirano, T. (2003). Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1046/j.1460-9568.2003.02499.x","mla":"Minami, Itsunari, et al. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced Homer1a in Mouse Cerebellar Purkinje Neurons.” European Journal of Neuroscience, vol. 17, no. 5, Wiley-Blackwell, 2003, pp. 1023–32, doi:10.1046/j.1460-9568.2003.02499.x."},"extern":1},{"_id":"2626","type":"journal_article","status":"public","citation":{"ista":"Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. 2003. Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. Neuroreport. 14(7), 947–950.","chicago":"Kaneda, Katsuyuki, Michiko Imanishi, Atsushi Nambu, Ryuichi Shigemoto, and Masahiko Takada. “Differential Expression Patterns of MGluR1α in Monkey Nigral Dopamine Neurons.” Neuroreport. Lippincott, Williams & Wilkins, 2003. https://doi.org/10.1097/01.wnr.0000074344.81633.e4.","short":"K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, M. Takada, Neuroreport 14 (2003) 947–950.","ieee":"K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, and M. Takada, “Differential expression patterns of mGluR1α in monkey nigral dopamine neurons,” Neuroreport, vol. 14, no. 7. Lippincott, Williams & Wilkins, pp. 947–950, 2003.","apa":"Kaneda, K., Imanishi, M., Nambu, A., Shigemoto, R., & Takada, M. (2003). Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. Neuroreport. Lippincott, Williams & Wilkins. https://doi.org/10.1097/01.wnr.0000074344.81633.e4","ama":"Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. Neuroreport. 2003;14(7):947-950. doi:10.1097/01.wnr.0000074344.81633.e4","mla":"Kaneda, Katsuyuki, et al. “Differential Expression Patterns of MGluR1α in Monkey Nigral Dopamine Neurons.” Neuroreport, vol. 14, no. 7, Lippincott, Williams & Wilkins, 2003, pp. 947–50, doi:10.1097/01.wnr.0000074344.81633.e4."},"date_updated":"2021-01-12T06:58:40Z","extern":1,"publist_id":"4272","author":[{"first_name":"Katsuyuki","last_name":"Kaneda","full_name":"Kaneda, Katsuyuki"},{"first_name":"Michiko","full_name":"Imanishi, Michiko","last_name":"Imanishi"},{"last_name":"Nambu","full_name":"Nambu, Atsushi","first_name":"Atsushi"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto"},{"full_name":"Takada, Masahiko","last_name":"Takada","first_name":"Masahiko"}],"title":"Differential expression patterns of mGluR1α in monkey nigral dopamine neurons","abstract":[{"text":"The expression pattern of metabotropic glutamate receptor Iα (mGluR1α) was immunohistochemically investigated in substantia nigra dopaminergic neurons of the macaque monkey. In normal monkeys, mGluR1α immunoreactivity was weakly observed in the dorsal tier of the substantia nigra pars compacta (SNc-d) where calbindin-D28k-containing dopaminergic neurons invulnerable to parkinsonian degeneration are specifically located. On the other hand, mGluR1α was strongly expressed in the ventral tier of the substantia nigra pars cornpacta (SNc-v). In monkeys treated with the parkinsonism-inducing drug, I-methyl-4-phenyl-1,2,3,6-tetrahydropyridine (MPTP), mGluR1α expression was decreased in dopaminergic neurons in the SNc-v that were spared its toxic action. These results suggest that mGluR1α expression may be involved at least partly in the vulnerability of dopaminergic neurons to parkinsonian insults.","lang":"eng"}],"publisher":"Lippincott, Williams & Wilkins","quality_controlled":0,"intvolume":" 14","month":"05","year":"2003","publication_status":"published","publication":"Neuroreport","day":"01","page":"947 - 950","date_created":"2018-12-11T11:58:45Z","doi":"10.1097/01.wnr.0000074344.81633.e4","date_published":"2003-05-01T00:00:00Z","issue":"7","volume":14},{"abstract":[{"text":"Despite its implications for higher order functions of the brain, little is currently known about the molecular basis of left-right asymmetry of the brain. Here we report that synaptic distribution of N-methyl-D-aspartate (NMDA) receptor GluRε2 (NR2B) subunits in the adult mouse hippocampus is asymmetrical between the left and right and between the apical and basal dendrites of single neurons. These asymmetrical allocations of ε2 subunits differentiate the properties of NMDA receptors and synaptic plasticity between the left and right hippocampus. These results provide a molecular basis for the structural and functional asymmetry of the mature brain.","lang":"eng"}],"publisher":"American Association for the Advancement of Science","quality_controlled":0,"intvolume":" 300","month":"05","publication_status":"published","year":"2003","publication":"Science","day":"09","page":"990 - 994","date_created":"2018-12-11T11:58:45Z","date_published":"2003-05-09T00:00:00Z","issue":"5621","volume":300,"doi":"10.1126/science.1082609","_id":"2627","type":"journal_article","status":"public","citation":{"chicago":"Kawakami, Ryosuke, Yoshiaki Shinohara, Yuichiro Kato, Hiroyuki Sugiyama, Ryuichi Shigemoto, and Isao Ito. “Asymmetrical Allocation of NMDA Receptor Ε2 Subunits in Hippocampal Circuitry.” Science. American Association for the Advancement of Science, 2003. https://doi.org/10.1126/science.1082609.","ista":"Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. 2003. Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. Science. 300(5621), 990–994.","mla":"Kawakami, Ryosuke, et al. “Asymmetrical Allocation of NMDA Receptor Ε2 Subunits in Hippocampal Circuitry.” Science, vol. 300, no. 5621, American Association for the Advancement of Science, 2003, pp. 990–94, doi:10.1126/science.1082609.","short":"R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, I. Ito, Science 300 (2003) 990–994.","ieee":"R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, and I. Ito, “Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry,” Science, vol. 300, no. 5621. American Association for the Advancement of Science, pp. 990–994, 2003.","ama":"Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. Science. 2003;300(5621):990-994. doi:10.1126/science.1082609","apa":"Kawakami, R., Shinohara, Y., Kato, Y., Sugiyama, H., Shigemoto, R., & Ito, I. (2003). Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1082609"},"date_updated":"2021-01-12T06:58:40Z","extern":1,"publist_id":"4271","author":[{"last_name":"Kawakami","full_name":"Kawakami, Ryosuke","first_name":"Ryosuke"},{"full_name":"Shinohara, Yoshiaki","last_name":"Shinohara","first_name":"Yoshiaki"},{"last_name":"Kato","full_name":"Kato, Yuichiro","first_name":"Yuichiro"},{"first_name":"Hiroyuki","last_name":"Sugiyama","full_name":"Sugiyama, Hiroyuki"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"full_name":"Ito, Isao","last_name":"Ito","first_name":"Isao"}],"title":"Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry"},{"day":"01","publication":"European Journal of Neuroscience","publication_status":"published","year":"2003","volume":17,"issue":"12","doi":"10.1046/j.1460-9568.2003.02697.x","date_published":"2003-06-01T00:00:00Z","date_created":"2018-12-11T11:58:46Z","page":"2503 - 2520","abstract":[{"lang":"eng","text":"The release of neurotransmitters is modulated by presynaptic metabotropic glutamate receptors (mGluRs), which show a highly selective expression and subcellular location in glutamatergic terminals in the hippocampus. Using immunocytochemistry, we investigated whether one of the receptors, mGluR7, whose level of expression is governed by the postsynaptic target, was present in GABAergic terminals and whether such terminals targeted particular cells. A total of 165 interneuron dendritic profiles receiving 466 synapses (82% mGluR7a-positive) were analysed. The presynaptic active zones of most GAD-(77%) or GABA-positive (94%) synaptic boutons on interneurons innervated by mGluR7a-enriched glutamatergic terminals (mGluR7a-decorated) were immunopositive for mGluR7a. GABAergic terminals on pyramidal cells and most other interneurons in str. oriens were mGluR7a-immunonegative. The mGluR7a-decorated cells were mostly somatostatin- and mGluR1α-immunopositive neurons in str. oriens and the alveus. Their GABAergic input mainly originated from VIP-positive terminals, 90% of which expressed high levels of mGluR7a in the presynaptic active zone. Parvalbumin-positive synaptic terminals were rare on mGluR7a-decorated cells, but on these neurons 73% of them were mGluR7a-immunopositive. Some type II synapses innervating interneurons were immunopositive for mGluR7b, as were some type I synapses. Because not all target cells of VIP-positive neurons are known it has not been possible to determine whether mGluR7 is expressed in a target-cell-specific manner in the terminals of single GABAergic cells. The activation of mGluR7 may decrease GABA release to mGluR7-decorated cells at times of high pyramidal cell activity, which elevates extracellular glutamate levels. Alternatively, the presynaptic receptor may be activated by as yet unidentified endogenous ligands released by the GABAergic terminals or the postsynaptic dendrites."}],"month":"06","intvolume":" 17","publisher":"Wiley-Blackwell","quality_controlled":0,"extern":1,"citation":{"ista":"Somogyi P, Dalezios Y, Luján R, Roberts J, Watanabe M, Shigemoto R. 2003. High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus. European Journal of Neuroscience. 17(12), 2503–2520.","chicago":"Somogyi, Péter, Yannis Dalezios, Rafael Luján, John Roberts, Masahiko Watanabe, and Ryuichi Shigemoto. “High Level of MGluR7 in the Presynaptic Active Zones of Select Populations of GABAergic Terminals Innervating Interneurons in the Rat Hippocampus.” European Journal of Neuroscience. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1460-9568.2003.02697.x.","apa":"Somogyi, P., Dalezios, Y., Luján, R., Roberts, J., Watanabe, M., & Shigemoto, R. (2003). High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1046/j.1460-9568.2003.02697.x","ama":"Somogyi P, Dalezios Y, Luján R, Roberts J, Watanabe M, Shigemoto R. High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus. European Journal of Neuroscience. 2003;17(12):2503-2520. doi:10.1046/j.1460-9568.2003.02697.x","ieee":"P. Somogyi, Y. Dalezios, R. Luján, J. Roberts, M. Watanabe, and R. Shigemoto, “High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus,” European Journal of Neuroscience, vol. 17, no. 12. Wiley-Blackwell, pp. 2503–2520, 2003.","short":"P. Somogyi, Y. Dalezios, R. Luján, J. Roberts, M. Watanabe, R. Shigemoto, European Journal of Neuroscience 17 (2003) 2503–2520.","mla":"Somogyi, Péter, et al. “High Level of MGluR7 in the Presynaptic Active Zones of Select Populations of GABAergic Terminals Innervating Interneurons in the Rat Hippocampus.” European Journal of Neuroscience, vol. 17, no. 12, Wiley-Blackwell, 2003, pp. 2503–20, doi:10.1046/j.1460-9568.2003.02697.x."},"date_updated":"2021-01-12T06:58:41Z","title":"High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus","author":[{"full_name":"Somogyi, Péter","last_name":"Somogyi","first_name":"Péter"},{"full_name":"Dalezios, Yannis","last_name":"Dalezios","first_name":"Yannis"},{"first_name":"Rafael","last_name":"Luján","full_name":"Luján, Rafael"},{"first_name":"John","last_name":"Roberts","full_name":"Roberts, John D"},{"full_name":"Watanabe, Masahiko","last_name":"Watanabe","first_name":"Masahiko"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"}],"publist_id":"4269","_id":"2629","status":"public","type":"journal_article"},{"_id":"2628","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:58:40Z","citation":{"ista":"Momiyama A, Silver R, Häusser M, Notomi T, Wu Y, Shigemoto R, Cull Candy S. 2003. The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats. Journal of Physiology. 549(1), 75–92.","chicago":"Momiyama, Akiko, Rachel Silver, Michael Häusser, Takuya Notomi, Yue Wu, Ryuichi Shigemoto, and Stuart Cull Candy. “The Density of AMPA Receptors Activated by a Transmitter Quantum at the Climbing Fibre - Purkinje Cell Synapse in Immature Rats.” Journal of Physiology. Wiley-Blackwell, 2003. https://doi.org/10.1113/jphysiol.2002.033472.","ieee":"A. Momiyama et al., “The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats,” Journal of Physiology, vol. 549, no. 1. Wiley-Blackwell, pp. 75–92, 2003.","short":"A. Momiyama, R. Silver, M. Häusser, T. Notomi, Y. Wu, R. Shigemoto, S. Cull Candy, Journal of Physiology 549 (2003) 75–92.","apa":"Momiyama, A., Silver, R., Häusser, M., Notomi, T., Wu, Y., Shigemoto, R., & Cull Candy, S. (2003). The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats. Journal of Physiology. Wiley-Blackwell. https://doi.org/10.1113/jphysiol.2002.033472","ama":"Momiyama A, Silver R, Häusser M, et al. The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats. Journal of Physiology. 2003;549(1):75-92. doi:10.1113/jphysiol.2002.033472","mla":"Momiyama, Akiko, et al. “The Density of AMPA Receptors Activated by a Transmitter Quantum at the Climbing Fibre - Purkinje Cell Synapse in Immature Rats.” Journal of Physiology, vol. 549, no. 1, Wiley-Blackwell, 2003, pp. 75–92, doi:10.1113/jphysiol.2002.033472."},"title":"The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats","author":[{"last_name":"Momiyama","full_name":"Momiyama, Akiko","first_name":"Akiko"},{"first_name":"Rachel","last_name":"Silver","full_name":"Silver, Rachel A"},{"first_name":"Michael","full_name":"Häusser, Michael A","last_name":"Häusser"},{"first_name":"Takuya","last_name":"Notomi","full_name":"Notomi, Takuya"},{"last_name":"Wu","full_name":"Wu, Yue","first_name":"Yue"},{"orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Stuart","full_name":"Cull-Candy, Stuart G","last_name":"Cull Candy"}],"publist_id":"4270","abstract":[{"text":"We aimed to estimate the number of AMPA receptors (AMPARs) bound by the quantal transmitter packet, their single-channel conductance and their density in the postsynaptic membrane at cerebellar Purkinje cell synapses. The synaptic and extrasynaptic AMPARs were examined in Purkinje cells in 2- to 4-day-old rats, when they receive synaptic inputs solely from climbing fibres (CFs). Evoked CF EPSCs and whole-cell AMPA currents displayed roughly linear current-voltage relationships, consistent with the presence of GluR2 subunits in synaptic and extrasynaptic AMPARs. The mean quantal size, estimated from the miniature EPSCs (MEPSCs), was ∼300 pS. Peak-scaled non-stationary fluctuation analysis of spontaneous EPSCs and MEPSCs gave a weighted-mean synaptic channel conductance of ∼5 pS (∼7 pS when corrected for filtering). By applying non-stationary fluctuation analysis to extrasynaptic currents activated by brief glutamate pulses (5 mM), we also obtained a small single-channel conductance estimate for extrasynaptic AMPARs (∼11 pS). This approach allowed us to obtain a maximum open probability (Po,max) value for the extrasynaptic receptors (Po,max = 0.72). Directly resolved extrasynaptic channel openings in the continued presence of glutamate exhibited clear multiple-conductance levels. The mean area of the postsynaptic density (PSD) of these synapses was 0.074 μm2, measured by reconstructing electron-microscopic (EM) serial sections. Postembedding immunogold labelling by anti-GluR2/3 antibody revealed that AMPARs are localised in PSDs. From these data and by simulating error factors, we estimate that at least 66 AMPARs are bound by a quantal transmitter packet at CF-Purkinje cell synapses, and the receptors are packed at a minimum density of ∼900 μm-2 in the postsynaptic membrane.","lang":"eng"}],"month":"05","intvolume":" 549","quality_controlled":0,"publisher":"Wiley-Blackwell","day":"15","publication":"Journal of Physiology","publication_status":"published","year":"2003","volume":549,"date_published":"2003-05-15T00:00:00Z","doi":"10.1113/jphysiol.2002.033472","issue":"1","date_created":"2018-12-11T11:58:45Z","page":"75 - 92"},{"intvolume":" 85","month":"06","publisher":"Wiley-Blackwell","quality_controlled":0,"abstract":[{"lang":"eng","text":"Cyclic ADP-ribose (cADP-ribose) is a putative second messenger or modulator. However, the role of cADP-ribose in the downstream signals of the metabotropic glutamate receptors (mGluRs) is unclear. Here, we show that glutamate stimulates ADP-ribosyl cyclase activity in rat or mouse crude membranes of retina via group III mGluRs or in superior cervical ganglion via group I mGluRs. The retina of mGluR6-deficient mice showed no increase in the ADP-ribosyl cyclase level in response to glutamate. GTP enhanced the initial rate of basal and glutamate-stimulated cyclase activity. GTP-γ-S also stimulated basal activity. To determine whether the coupling mode of mGluRs to ADP-ribosyl cyclase is a feature common to individual cloned mGluRs, we expressed each mGluR subtype in NG108-15 neuroblastoma x glioma hybrid cells. The glutamate-induced stimulation of the cyclase occurs preferentially in NG108-15 cells over-expressing mGluRs1, 3, 5, and 6. Cells expressing mGluR2 or mGluRs4 and 7 exhibit inhibition or no coupling, respectively. Glutamate-induced activation or inhibition of the cyclase activity was eliminated after pre-treatment with cholera or pertussis toxin, respectively. Thus, the subtype-specific coupling of mGluRs to ADP-ribosyl cyclase via G proteins suggests that some glutamate-evoked neuronal functions are mediated by cADP-ribose."}],"date_created":"2018-12-11T11:58:46Z","date_published":"2003-06-01T00:00:00Z","volume":85,"issue":"5","doi":"10.1046/j.1471-4159.2003.01751.x","page":"1148 - 1158","publication":"Journal of Neurochemistry","day":"01","year":"2003","publication_status":"published","status":"public","type":"journal_article","_id":"2631","title":"Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells","publist_id":"4268","author":[{"first_name":"Haruhiro","last_name":"Higashida","full_name":"Higashida, Haruhiro"},{"first_name":"Jia","full_name":"Zhang, Jia-Sheng","last_name":"Zhang"},{"first_name":"Sumiko","full_name":"Mochida, Sumiko","last_name":"Mochida"},{"last_name":"Chen","full_name":"Chen, Xiao-Liang","first_name":"Xiao"},{"full_name":"Shin, Yeonsook","last_name":"Shin","first_name":"Yeonsook"},{"last_name":"Noda","full_name":"Noda, Mami","first_name":"Mami"},{"first_name":"Kazi","full_name":"Hossain, Kazi Z","last_name":"Hossain"},{"first_name":"Naoto","last_name":"Hoshi","full_name":"Hoshi, Naoto"},{"full_name":"Hashii, Minako","last_name":"Hashii","first_name":"Minako"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"},{"full_name":"Fukuda, Yutaka","last_name":"Fukuda","first_name":"Yutaka"},{"last_name":"Yokoyama","full_name":"Yokoyama, Shigeru","first_name":"Shigeru"}],"extern":1,"date_updated":"2021-01-12T06:58:42Z","citation":{"chicago":"Higashida, Haruhiro, Jia Zhang, Sumiko Mochida, Xiao Chen, Yeonsook Shin, Mami Noda, Kazi Hossain, et al. “Subtype-Specific Coupling with ADP-Ribosyl Cyclase of Metabotropic Glutamate Receptors in Retina, Cervical Superior Ganglion and NG108-15 Cells.” Journal of Neurochemistry. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1471-4159.2003.01751.x.","ista":"Higashida H, Zhang J, Mochida S, Chen X, Shin Y, Noda M, Hossain K, Hoshi N, Hashii M, Shigemoto R, Nakanishi S, Fukuda Y, Yokoyama S. 2003. Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells. Journal of Neurochemistry. 85(5), 1148–1158.","mla":"Higashida, Haruhiro, et al. “Subtype-Specific Coupling with ADP-Ribosyl Cyclase of Metabotropic Glutamate Receptors in Retina, Cervical Superior Ganglion and NG108-15 Cells.” Journal of Neurochemistry, vol. 85, no. 5, Wiley-Blackwell, 2003, pp. 1148–58, doi:10.1046/j.1471-4159.2003.01751.x.","apa":"Higashida, H., Zhang, J., Mochida, S., Chen, X., Shin, Y., Noda, M., … Yokoyama, S. (2003). Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells. Journal of Neurochemistry. Wiley-Blackwell. https://doi.org/10.1046/j.1471-4159.2003.01751.x","ama":"Higashida H, Zhang J, Mochida S, et al. Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells. Journal of Neurochemistry. 2003;85(5):1148-1158. doi:10.1046/j.1471-4159.2003.01751.x","short":"H. Higashida, J. Zhang, S. Mochida, X. Chen, Y. Shin, M. Noda, K. Hossain, N. Hoshi, M. Hashii, R. Shigemoto, S. Nakanishi, Y. Fukuda, S. Yokoyama, Journal of Neurochemistry 85 (2003) 1148–1158.","ieee":"H. Higashida et al., “Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells,” Journal of Neurochemistry, vol. 85, no. 5. Wiley-Blackwell, pp. 1148–1158, 2003."}},{"day":"27","publication":"Journal of Biological Chemistry","publication_status":"published","year":"2003","doi":"10.1074/jbc.M211471200","volume":278,"issue":"26","date_published":"2003-07-27T00:00:00Z","date_created":"2018-12-11T11:58:47Z","page":"23955 - 23962","abstract":[{"text":"The modulation of calcium channels by metabotropic glutamate receptors (mGluRs) is a key event in the fine-tuning of neurotransmitter release. Here we report that, in cerebrocortical nerve terminals of adult rats, the inhibition of glutamate release is mediated by mGluR7. In this preparation, the major component of glutamate release is supported by P/Q-type Ca2+ channels (72.7%). However, mGluR7 selectively reduced the release component that is associated with N-type Ca2+ channels (29.9%). Inhibition of P/Q channels by mGluR7 is not masked by the higher efficiency of these channels in driving glutamate release when compared with N-type channels. Thus, activation of mGluR7 failed to reduce the release associated with P/Q channels when the extracellular calcium concentration, ([Ca2+]o), was reduced from 1.3 to 0.5 mM. Through Ca2+ imaging, we show that Ca2+ channels are distributed in a heterogeneous manner in individual nerve terminals. Indeed, in this preparation, nerve terminals were observed that contain N-type (31.1%; conotoxin GVIA-sensitive) or P/Q-type (64.3%; agatoxin IVA-sensitive) channels or that were insensitive to these two toxins (4.6%). Interestingly, the great majority of the responses to L-AP4 (95.4%) were observed in nerve terminals containing N-type channels. This specific co-localization of mGluR7 and N-type Ca2+-channels could explain the failure of the receptor to inhibit the P/Q channel-associated release component and also reveal the existence of specific targeting mechanisms to localize the two proteins in the same nerve terminal subset.","lang":"eng"}],"month":"07","intvolume":" 278","quality_controlled":0,"publisher":"American Society for Biochemistry and Molecular Biology","extern":1,"citation":{"mla":"Millán, Carmelo, et al. “Co-Expression of Metabotropic Glutamate Receptor 7 and N-Type Ca2+ Channels in Single Cerebrocortical Nerve Terminals of Adult Rats.” Journal of Biological Chemistry, vol. 278, no. 26, American Society for Biochemistry and Molecular Biology, 2003, pp. 23955–62, doi:10.1074/jbc.M211471200.","short":"C. Millán, E. Castro, M. Torres, R. Shigemoto, J. Sánchez Prieto, Journal of Biological Chemistry 278 (2003) 23955–23962.","ieee":"C. Millán, E. Castro, M. Torres, R. Shigemoto, and J. Sánchez Prieto, “Co-expression of metabotropic glutamate receptor 7 and N-type Ca2+ channels in single cerebrocortical nerve terminals of adult rats,” Journal of Biological Chemistry, vol. 278, no. 26. American Society for Biochemistry and Molecular Biology, pp. 23955–23962, 2003.","apa":"Millán, C., Castro, E., Torres, M., Shigemoto, R., & Sánchez Prieto, J. (2003). Co-expression of metabotropic glutamate receptor 7 and N-type Ca2+ channels in single cerebrocortical nerve terminals of adult rats. Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology. https://doi.org/10.1074/jbc.M211471200","ama":"Millán C, Castro E, Torres M, Shigemoto R, Sánchez Prieto J. Co-expression of metabotropic glutamate receptor 7 and N-type Ca2+ channels in single cerebrocortical nerve terminals of adult rats. Journal of Biological Chemistry. 2003;278(26):23955-23962. doi:10.1074/jbc.M211471200","chicago":"Millán, Carmelo, Enrique Castro, Magdalena Torres, Ryuichi Shigemoto, and José Sánchez Prieto. “Co-Expression of Metabotropic Glutamate Receptor 7 and N-Type Ca2+ Channels in Single Cerebrocortical Nerve Terminals of Adult Rats.” Journal of Biological Chemistry. American Society for Biochemistry and Molecular Biology, 2003. https://doi.org/10.1074/jbc.M211471200.","ista":"Millán C, Castro E, Torres M, Shigemoto R, Sánchez Prieto J. 2003. Co-expression of metabotropic glutamate receptor 7 and N-type Ca2+ channels in single cerebrocortical nerve terminals of adult rats. Journal of Biological Chemistry. 278(26), 23955–23962."},"date_updated":"2021-01-12T06:58:42Z","title":"Co-expression of metabotropic glutamate receptor 7 and N-type Ca2+ channels in single cerebrocortical nerve terminals of adult rats","author":[{"first_name":"Carmelo","full_name":"Millán, Carmelo","last_name":"Millán"},{"first_name":"Enrique","full_name":"Castro, Enrique G","last_name":"Castro"},{"first_name":"Magdalena","full_name":"Torres, Magdalena","last_name":"Torres"},{"last_name":"Shigemoto","full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sánchez-Prieto, José","last_name":"Sánchez Prieto","first_name":"José"}],"publist_id":"4265","_id":"2633","status":"public","type":"journal_article"},{"abstract":[{"lang":"eng","text":"In many brain regions, hyperpolarization-activated cationic currents (Ih) are involved in the generation of rhythmic activities, but the role of Ih in olfactory oscillations remains unclear. Knowledge of the cellular and subcellular distributions of hyperpolarization-activated and cyclic nucleotide-gated channel (HCN) subunits is necessary for understanding the role of Ih in olfactory network activities. Using light microscopic immunocytochemistry, we demonstrate strong HCN1 labelling of the glomerular layer and moderate staining of granule cell, internal and external plexiform layers of the rat main olfactory bulb. In the glomerular layer, among many unlabelled neurons, two distinct subpopulations of juxtaglomerular cells are labelled. Approximately 10% of the juxtaglomerular cells strongly express HCN1. These small diameter cells are immunoreactive for GABA and comprise a subpopulation of periglomerular cells. An additional subset of juxtaglomerular cells (≈ 1%) expresses low levels of HCN1. They are large in diameter, GABA immunonegative but immunopositive for vesicular glutamate transporter 2, characterizing them as external tufted cells. Quantitative immunogold localization revealed that the somatic plasma membranes of periglomerular cells contain approximately four times more HCN1 labelling than those of external tufted cells. Unlike in cortical pyramidal cells, immunogold density for HCN1 does not significantly differ in somatic and dendritic plasma membranes of external tufted cells, indicating that post-synaptic potentials arriving at proximal and distal dendrites are modulated by the same density of I h. Our results demonstrate a cell type-dependent expression of HCN1 in the olfactory bulb and predict a differential contribution of distinct juxtaglomerular cell types to network oscillations."}],"month":"07","intvolume":" 18","quality_controlled":0,"publisher":"Wiley-Blackwell","day":"01","publication":"European Journal of Neuroscience","year":"2003","publication_status":"published","date_published":"2003-07-01T00:00:00Z","issue":"2","doi":"10.1046/j.1460-9568.2003.02756.x","volume":18,"date_created":"2018-12-11T11:58:47Z","page":"344 - 354","_id":"2632","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:58:42Z","citation":{"apa":"Holderith, N., Shigemoto, R., & Nusser, Z. (2003). Cell type-dependent expression of HCN1 in the main olfactory bulb. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1046/j.1460-9568.2003.02756.x","ama":"Holderith N, Shigemoto R, Nusser Z. Cell type-dependent expression of HCN1 in the main olfactory bulb. European Journal of Neuroscience. 2003;18(2):344-354. doi:10.1046/j.1460-9568.2003.02756.x","ieee":"N. Holderith, R. Shigemoto, and Z. Nusser, “Cell type-dependent expression of HCN1 in the main olfactory bulb,” European Journal of Neuroscience, vol. 18, no. 2. Wiley-Blackwell, pp. 344–354, 2003.","short":"N. Holderith, R. Shigemoto, Z. Nusser, European Journal of Neuroscience 18 (2003) 344–354.","mla":"Holderith, Noémi, et al. “Cell Type-Dependent Expression of HCN1 in the Main Olfactory Bulb.” European Journal of Neuroscience, vol. 18, no. 2, Wiley-Blackwell, 2003, pp. 344–54, doi:10.1046/j.1460-9568.2003.02756.x.","ista":"Holderith N, Shigemoto R, Nusser Z. 2003. Cell type-dependent expression of HCN1 in the main olfactory bulb. European Journal of Neuroscience. 18(2), 344–354.","chicago":"Holderith, Noémi, Ryuichi Shigemoto, and Zoltán Nusser. “Cell Type-Dependent Expression of HCN1 in the Main Olfactory Bulb.” European Journal of Neuroscience. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1460-9568.2003.02756.x."},"title":"Cell type-dependent expression of HCN1 in the main olfactory bulb","author":[{"first_name":"Noémi","full_name":"Holderith, Noémi B","last_name":"Holderith"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"},{"first_name":"Zoltán","full_name":"Nusser, Zoltán","last_name":"Nusser"}],"publist_id":"4266"},{"intvolume":" 23","month":"12","quality_controlled":0,"publisher":"Society for Neuroscience","abstract":[{"lang":"eng","text":"Metabotropic GABAB receptors mediate slow inhibitory effects presynaptically and postsynaptically. Using preembedding immunohistochemical methods combined with quantitative analysis of GABAB receptor subunit immunoreactivity, this study provides a detailed description of the cellular and subcellular localization of GABAB1a/b and GABA B2 in the rat hippocampus. At the light microscopic level, an overlapping distribution of GABAB1a/b and GABAB2 was revealed in the dendritic layers of the hippocampus. In addition, expression of the GABAB1a/b subunit was found in somata of CA1 pyramidal cells and of a subset of GABAergic interneurons. At the electron microscopic level, immunoreactivity for both subunits was observed on presynaptic and, more abundantly, on postsynaptic elements. Presynaptically, subunits were mainly detected in the extrasynaptic membrane and occasionally over the presynaptic membrane specialization of putative glutamatergic and, to a lesser extent, GABAergic axon terminals. Postsynaptically, the majority of GABAB receptor subunits were localized to the extrasynaptic plasma membrane of spines and dendritic shafts of principal cells and shafts of interneuron dendrites. Quantitative analysis revealed enrichment of GABAB1a/b around putative glutamatergic synapses on spines and an even distribution on dendritic shafts of pyramidal cells contacted by GABAergic boutons. The association of GABAB receptors with glutamatergic synapses at both presynaptic and postsynaptic sides indicates their intimate involvement in the modulation of glutamatergic neurotransmission. The dominant extrasynaptic localization of GABAB receptor subunits suggests that their activation is dependent on spillover of GABA requiring simultaneous activity of populations of GABAergic cells as it occurs during population oscillations or epileptic seizures."}],"date_created":"2018-12-11T11:58:47Z","date_published":"2003-12-03T00:00:00Z","volume":23,"issue":"35","page":"11026 - 11035","publication":"Journal of Neuroscience","day":"03","year":"2003","publication_status":"published","status":"public","type":"journal_article","_id":"2635","title":"Subcellular Localization of Metabotropic GABAB Receptor Subunits GABAB1a/b and GABAB2 in the Rat Hippocampus","author":[{"last_name":"Kulik","full_name":"Kulik, Ákos","first_name":"Ákos"},{"first_name":"Imre","last_name":"Vida","full_name":"Vida, Imre"},{"full_name":"Luján, Rafael","last_name":"Luján","first_name":"Rafael"},{"first_name":"Carola","last_name":"Haas","full_name":"Haas, Carola A"},{"last_name":"López Bendito","full_name":"López-Bendito, Guillermina","first_name":"Guillermina"},{"orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Frotscher","full_name":"Frotscher, Michael","first_name":"Michael"}],"publist_id":"4263","extern":1,"citation":{"ista":"Kulik Á, Vida I, Luján R, Haas C, López Bendito G, Shigemoto R, Frotscher M. 2003. Subcellular Localization of Metabotropic GABAB Receptor Subunits GABAB1a/b and GABAB2 in the Rat Hippocampus. Journal of Neuroscience. 23(35), 11026–11035.","chicago":"Kulik, Ákos, Imre Vida, Rafael Luján, Carola Haas, Guillermina López Bendito, Ryuichi Shigemoto, and Michael Frotscher. “Subcellular Localization of Metabotropic GABAB Receptor Subunits GABAB1a/b and GABAB2 in the Rat Hippocampus.” Journal of Neuroscience. Society for Neuroscience, 2003.","short":"Á. Kulik, I. Vida, R. Luján, C. Haas, G. López Bendito, R. Shigemoto, M. Frotscher, Journal of Neuroscience 23 (2003) 11026–11035.","ieee":"Á. Kulik et al., “Subcellular Localization of Metabotropic GABAB Receptor Subunits GABAB1a/b and GABAB2 in the Rat Hippocampus,” Journal of Neuroscience, vol. 23, no. 35. Society for Neuroscience, pp. 11026–11035, 2003.","apa":"Kulik, Á., Vida, I., Luján, R., Haas, C., López Bendito, G., Shigemoto, R., & Frotscher, M. (2003). Subcellular Localization of Metabotropic GABAB Receptor Subunits GABAB1a/b and GABAB2 in the Rat Hippocampus. Journal of Neuroscience. Society for Neuroscience.","ama":"Kulik Á, Vida I, Luján R, et al. Subcellular Localization of Metabotropic GABAB Receptor Subunits GABAB1a/b and GABAB2 in the Rat Hippocampus. Journal of Neuroscience. 2003;23(35):11026-11035.","mla":"Kulik, Ákos, et al. “Subcellular Localization of Metabotropic GABAB Receptor Subunits GABAB1a/b and GABAB2 in the Rat Hippocampus.” Journal of Neuroscience, vol. 23, no. 35, Society for Neuroscience, 2003, pp. 11026–35."},"date_updated":"2021-01-12T06:58:43Z"},{"intvolume":" 13","month":"09","publisher":"Oxford University Press","quality_controlled":0,"abstract":[{"text":"To better understand the role of neurotransmitter receptors in neuronal differentiation and maturation a detailed knowledge of their identity, location and function in the plasma membrane of specific neuronal populations during development is required. Combining pre-embedding immunocytochemistry with cell tracking in embryonic brain slice cultures we show that virtually all neurons (∼98%) migrating through the lower intermediate zone (LIZ) on their way from the medial ganglionic eminence to the cerebral cortex, express GABA BR1. Blockade of GABABRs with a specific antagonist, CGP52432, resulted in a concentration-dependent accumulation of these tangentially migrating neurons in the ventricular/subventricular zones (VZ/SVZ) of the cortex and fewer cells were observed in the cortical plate/marginal zone (CP/MZ) and LIZ. Moreover, they had significantly shorter leading processes compared with similar migrating cells in control slices. Electrophysiological recording in LIZ and CP cells revealed no direct effect of either CGP52432 or the GABABR agonist, baclofen, on resting membrane properties suggesting that the effect of CGP52432 on migration might be mediated through a metabotropic action or the regulation of release of factors controlling migration. These results suggest that GABABRs have an important modulatory role in the migration of cortical interneurons.","lang":"eng"}],"date_created":"2018-12-11T11:58:47Z","volume":13,"date_published":"2003-09-01T00:00:00Z","doi":"10.1093/cercor/13.9.932","issue":"9","page":"932 - 942","publication":"Cerebral Cortex","day":"01","publication_status":"published","year":"2003","status":"public","type":"journal_article","_id":"2634","title":"Blockade of GABAB receptors alters the tangential migration of cortical neurons","author":[{"first_name":"Guillermina","full_name":"López-Bendito, Guillermina","last_name":"López Bendito"},{"last_name":"Luján","full_name":"Luján, Rafael","first_name":"Rafael"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"last_name":"Ganter","full_name":"Ganter, Paul","first_name":"Paul"},{"first_name":"Ole","full_name":"Paulsen, Ole","last_name":"Paulsen"},{"first_name":"Zoltán","last_name":"Molnár","full_name":"Molnár, Zoltán"}],"publist_id":"4264","extern":1,"citation":{"chicago":"López Bendito, Guillermina, Rafael Luján, Ryuichi Shigemoto, Paul Ganter, Ole Paulsen, and Zoltán Molnár. “Blockade of GABAB Receptors Alters the Tangential Migration of Cortical Neurons.” Cerebral Cortex. Oxford University Press, 2003. https://doi.org/10.1093/cercor/13.9.932.","ista":"López Bendito G, Luján R, Shigemoto R, Ganter P, Paulsen O, Molnár Z. 2003. Blockade of GABAB receptors alters the tangential migration of cortical neurons. Cerebral Cortex. 13(9), 932–942.","mla":"López Bendito, Guillermina, et al. “Blockade of GABAB Receptors Alters the Tangential Migration of Cortical Neurons.” Cerebral Cortex, vol. 13, no. 9, Oxford University Press, 2003, pp. 932–42, doi:10.1093/cercor/13.9.932.","ama":"López Bendito G, Luján R, Shigemoto R, Ganter P, Paulsen O, Molnár Z. Blockade of GABAB receptors alters the tangential migration of cortical neurons. Cerebral Cortex. 2003;13(9):932-942. doi:10.1093/cercor/13.9.932","apa":"López Bendito, G., Luján, R., Shigemoto, R., Ganter, P., Paulsen, O., & Molnár, Z. (2003). Blockade of GABAB receptors alters the tangential migration of cortical neurons. Cerebral Cortex. Oxford University Press. https://doi.org/10.1093/cercor/13.9.932","ieee":"G. López Bendito, R. Luján, R. Shigemoto, P. Ganter, O. Paulsen, and Z. Molnár, “Blockade of GABAB receptors alters the tangential migration of cortical neurons,” Cerebral Cortex, vol. 13, no. 9. Oxford University Press, pp. 932–942, 2003.","short":"G. López Bendito, R. Luján, R. Shigemoto, P. Ganter, O. Paulsen, Z. Molnár, Cerebral Cortex 13 (2003) 932–942."},"date_updated":"2021-01-12T06:58:43Z"},{"abstract":[{"lang":"eng","text":"Taste-metabotropic glutamate receptor 4 (taste-mGluR4) and the heteromers of T1R1 and T1R3 are candidate receptors involved in the sense of umami (monosodium glutamate) taste. Although the expression of group III mGluRs (taste-mGluR4) has been demonstrated in taste tissues, no mention has been made of the expression of group I mGluRs (mGluR1 and mGluR5) in taste tissues. We examined the expression of mGluR1 and mGluR5 in rat gustatory tissues by using reverse transcription-polymerase chain reaction (RT-PCR), in situ hybridization, immunohistochemistry and immunoelectron microscopy. RT-PCR assay showed that mGluR1α and mGluR1β mRNAs were expressed in circumvallate papillae, but mGluR5 mRNA was not expressed. The positive signals of mGluR1 mRNA were detected only in circumvallate taste buds by in situ hybridization analysis. In cryosections of fungiform, foliate and circumvallate papillae, the antibody against mGluRla gave intense labeling on the taste hairs in all taste pores examined. In the developing taste buds, the positive signals of mGluR1α in taste hairs gradually increased with the increase in number of taste bud cells. These results show that, in addition to taste-mGluR4 and the heteromer of T1R1 and T1R3, mGluR1α may function as a receptor for glutamate (umami) taste sensation."}],"month":"07","intvolume":" 313","publisher":"Springer","quality_controlled":0,"day":"01","publication":"Cell and Tissue Research","year":"2003","publication_status":"published","issue":"1","doi":"10.1007/s00441-003-0740-2","volume":313,"date_published":"2003-07-01T00:00:00Z","date_created":"2018-12-11T11:58:46Z","page":"29 - 35","_id":"2630","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:58:41Z","citation":{"chicago":"Toyono, Takashi, Yuji Seta, Shinji Kataoka, Shintaro Kawano, Ryuichi Shigemoto, and Kuniaki Toyoshima. “Expression of Metabotropic Glutamate Receptor Group I in Rat Gustatory Papillae.” Cell and Tissue Research. Springer, 2003. https://doi.org/10.1007/s00441-003-0740-2.","ista":"Toyono T, Seta Y, Kataoka S, Kawano S, Shigemoto R, Toyoshima K. 2003. Expression of metabotropic glutamate receptor group I in rat gustatory papillae. Cell and Tissue Research. 313(1), 29–35.","mla":"Toyono, Takashi, et al. “Expression of Metabotropic Glutamate Receptor Group I in Rat Gustatory Papillae.” Cell and Tissue Research, vol. 313, no. 1, Springer, 2003, pp. 29–35, doi:10.1007/s00441-003-0740-2.","ieee":"T. Toyono, Y. Seta, S. Kataoka, S. Kawano, R. Shigemoto, and K. Toyoshima, “Expression of metabotropic glutamate receptor group I in rat gustatory papillae,” Cell and Tissue Research, vol. 313, no. 1. Springer, pp. 29–35, 2003.","short":"T. Toyono, Y. Seta, S. Kataoka, S. Kawano, R. Shigemoto, K. Toyoshima, Cell and Tissue Research 313 (2003) 29–35.","ama":"Toyono T, Seta Y, Kataoka S, Kawano S, Shigemoto R, Toyoshima K. Expression of metabotropic glutamate receptor group I in rat gustatory papillae. Cell and Tissue Research. 2003;313(1):29-35. doi:10.1007/s00441-003-0740-2","apa":"Toyono, T., Seta, Y., Kataoka, S., Kawano, S., Shigemoto, R., & Toyoshima, K. (2003). Expression of metabotropic glutamate receptor group I in rat gustatory papillae. Cell and Tissue Research. Springer. https://doi.org/10.1007/s00441-003-0740-2"},"title":"Expression of metabotropic glutamate receptor group I in rat gustatory papillae","publist_id":"4267","author":[{"first_name":"Takashi","full_name":"Toyono, Takashi","last_name":"Toyono"},{"first_name":"Yuji","full_name":"Seta, Yuji","last_name":"Seta"},{"last_name":"Kataoka","full_name":"Kataoka, Shinji","first_name":"Shinji"},{"first_name":"Shintaro","full_name":"Kawano, Shintaro","last_name":"Kawano"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","last_name":"Shigemoto"},{"first_name":"Kuniaki","full_name":"Toyoshima, Kuniaki","last_name":"Toyoshima"}]},{"_id":"2637","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T06:58:44Z","citation":{"mla":"Bell, Karen, et al. “Structural Involvement of the Glutamatergic Presynaptic Boutons in a Transgenic Mouse Model Expressing Early Onset Amyloid Pathology.” Neuroscience Letters, vol. 353, no. 2, Elsevier, 2003, pp. 143–47, doi:10.1016/j.neulet.2003.09.027.","short":"K. Bell, G.J. De Kort, S. Steggerda, R. Shigemoto, A. Ribeiro Da Silva, A. Cuello, Neuroscience Letters 353 (2003) 143–147.","ieee":"K. Bell, G. J. De Kort, S. Steggerda, R. Shigemoto, A. Ribeiro Da Silva, and A. Cuello, “Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology,” Neuroscience Letters, vol. 353, no. 2. Elsevier, pp. 143–147, 2003.","apa":"Bell, K., De Kort, G. J., Steggerda, S., Shigemoto, R., Ribeiro Da Silva, A., & Cuello, A. (2003). Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology. Neuroscience Letters. Elsevier. https://doi.org/10.1016/j.neulet.2003.09.027","ama":"Bell K, De Kort GJ, Steggerda S, Shigemoto R, Ribeiro Da Silva A, Cuello A. Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology. Neuroscience Letters. 2003;353(2):143-147. doi:10.1016/j.neulet.2003.09.027","chicago":"Bell, Karen, G J De Kort, S Steggerda, Ryuichi Shigemoto, Alfredo Ribeiro Da Silva, and Augusto Cuello. “Structural Involvement of the Glutamatergic Presynaptic Boutons in a Transgenic Mouse Model Expressing Early Onset Amyloid Pathology.” Neuroscience Letters. Elsevier, 2003. https://doi.org/10.1016/j.neulet.2003.09.027.","ista":"Bell K, De Kort GJ, Steggerda S, Shigemoto R, Ribeiro Da Silva A, Cuello A. 2003. Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology. Neuroscience Letters. 353(2), 143–147."},"title":"Structural involvement of the glutamatergic presynaptic boutons in a transgenic mouse model expressing early onset amyloid pathology","publist_id":"4262","author":[{"last_name":"Bell","full_name":"Bell, Karen F","first_name":"Karen"},{"first_name":"G J","last_name":"De Kort","full_name":"De Kort, G J"},{"first_name":"S","full_name":"Steggerda, S","last_name":"Steggerda"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto"},{"last_name":"Ribeiro Da Silva","full_name":"Ribeiro-da-Silva, Alfredo","first_name":"Alfredo"},{"first_name":"Augusto","full_name":"Cuello, Augusto C","last_name":"Cuello"}],"abstract":[{"lang":"eng","text":"While the cholinergic depletion in Alzheimer's disease (AD) has been known for some time, a definitive involvement of other neurotransmitter systems has been somewhat more elusive. Our study demonstrates a clear involvement of both glutamatergic and, to a lesser extent, GABAergic neurons in an early onset transgenic mouse model of AD-like amyloid pathology. Immunohistochemical staining and subsequent quantification has revealed a statistically significant increased density of glutamatergic and GABAergic presynaptic boutons in both the plaque free and plaque adjacent cortical neuropile areas of transgenic mice as compared to non-transgenic controls. Furthermore, amyloid plaque size was shown to have a statistically significant effect on the relative area occupied by dystrophic glutamatergic neurites in the peri-plaque neuropile. These findings support our hypothesis that the amyloid pathology progresses in a time and neurotransmitter specific manner, first in the cholinergic system which appears to be most vulnerable, followed by the glutamatergic presynaptic boutons and finally the somewhat more resilient GABAergic terminals."}],"intvolume":" 353","month":"12","quality_controlled":0,"publisher":"Elsevier","publication":"Neuroscience Letters","day":"19","publication_status":"published","year":"2003","date_created":"2018-12-11T11:58:48Z","volume":353,"doi":"10.1016/j.neulet.2003.09.027","issue":"2","date_published":"2003-12-19T00:00:00Z","page":"143 - 147"},{"date_created":"2018-12-11T11:59:35Z","volume":482,"doi":"10.1017/S0022112003004014","date_published":"2003-05-13T00:00:00Z","page":"163 - 179","publication":"Journal of Fluid Mechanics","day":"13","publication_status":"published","year":"2003","intvolume":" 482","month":"05","publisher":"Cambridge University Press","quality_controlled":0,"abstract":[{"lang":"eng","text":"We report the results of an experimental study of magnetohydrodynamic damping of sidewall convection in a rectangular enclosure filled with gallium. In particular we investigate the suppression of convection when a steady magnetic field is applied separately in each of the three principal directions of the flow. The strongest damping of the steady flow is found for a vertical magnetic field, which is in agreement with theory. However, we observe that the application of a field transverse to the flow provides greater damping than a longitudinal one, which seems to contradict available theory. We provide a possible resolution of this apparent dichotomy in terms of the length scale of the experiment."}],"title":"Magnetohydrodynamic damping of convective flows in molten gallium","author":[{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","orcid":"0000-0003-2057-2754","full_name":"Björn Hof","last_name":"Hof"},{"first_name":"Anne","last_name":"Juel","full_name":"Juel, Anne"},{"full_name":"Mullin, Tom P","last_name":"Mullin","first_name":"Tom"}],"publist_id":"4105","extern":1,"date_updated":"2021-01-12T06:59:42Z","citation":{"chicago":"Hof, Björn, Anne Juel, and Tom Mullin. “Magnetohydrodynamic Damping of Convective Flows in Molten Gallium.” Journal of Fluid Mechanics. Cambridge University Press, 2003. https://doi.org/10.1017/S0022112003004014.","ista":"Hof B, Juel A, Mullin T. 2003. Magnetohydrodynamic damping of convective flows in molten gallium. Journal of Fluid Mechanics. 482, 163–179.","mla":"Hof, Björn, et al. “Magnetohydrodynamic Damping of Convective Flows in Molten Gallium.” Journal of Fluid Mechanics, vol. 482, Cambridge University Press, 2003, pp. 163–79, doi:10.1017/S0022112003004014.","short":"B. Hof, A. Juel, T. Mullin, Journal of Fluid Mechanics 482 (2003) 163–179.","ieee":"B. Hof, A. Juel, and T. Mullin, “Magnetohydrodynamic damping of convective flows in molten gallium,” Journal of Fluid Mechanics, vol. 482. Cambridge University Press, pp. 163–179, 2003.","apa":"Hof, B., Juel, A., & Mullin, T. (2003). Magnetohydrodynamic damping of convective flows in molten gallium. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/S0022112003004014","ama":"Hof B, Juel A, Mullin T. Magnetohydrodynamic damping of convective flows in molten gallium. Journal of Fluid Mechanics. 2003;482:163-179. doi:10.1017/S0022112003004014"},"status":"public","type":"journal_article","_id":"2784"},{"date_created":"2018-12-11T11:59:35Z","issue":"24","date_published":"2003-12-12T00:00:00Z","volume":91,"doi":"10.1103/PhysRevLett.91.244502","page":"244502/1 - 244502/4","publication":"Physical Review Letters","day":"12","publication_status":"published","year":"2003","intvolume":" 91","month":"12","publisher":"American Physical Society","quality_controlled":0,"abstract":[{"text":"Experimental evidence for the scaling of the finite amplitude of perturbation theory required to promote transition in Poiseuille flow was found. The exponent is -1 and was uncovered using considerable care in the design and execution of the experiment. Interestingly, this exponent was also found in experiments on transition in boundary layers.","lang":"eng"}],"title":"Scaling of the turbulence transition threshold in a pipe","author":[{"orcid":"0000-0003-2057-2754","full_name":"Björn Hof","last_name":"Hof","first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Juel, Anne","last_name":"Juel","first_name":"Anne"},{"last_name":"Mullin","full_name":"Mullin, Tom P","first_name":"Tom"}],"publist_id":"4104","extern":1,"date_updated":"2021-01-12T06:59:42Z","citation":{"chicago":"Hof, Björn, Anne Juel, and Tom Mullin. “Scaling of the Turbulence Transition Threshold in a Pipe.” Physical Review Letters. American Physical Society, 2003. https://doi.org/10.1103/PhysRevLett.91.244502.","ista":"Hof B, Juel A, Mullin T. 2003. Scaling of the turbulence transition threshold in a pipe. Physical Review Letters. 91(24), 244502/1-244502/4.","mla":"Hof, Björn, et al. “Scaling of the Turbulence Transition Threshold in a Pipe.” Physical Review Letters, vol. 91, no. 24, American Physical Society, 2003, p. 244502/1-244502/4, doi:10.1103/PhysRevLett.91.244502.","apa":"Hof, B., Juel, A., & Mullin, T. (2003). Scaling of the turbulence transition threshold in a pipe. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.91.244502","ama":"Hof B, Juel A, Mullin T. Scaling of the turbulence transition threshold in a pipe. Physical Review Letters. 2003;91(24):244502/1-244502/4. doi:10.1103/PhysRevLett.91.244502","short":"B. Hof, A. Juel, T. Mullin, Physical Review Letters 91 (2003) 244502/1-244502/4.","ieee":"B. Hof, A. Juel, and T. Mullin, “Scaling of the turbulence transition threshold in a pipe,” Physical Review Letters, vol. 91, no. 24. American Physical Society, p. 244502/1-244502/4, 2003."},"status":"public","type":"journal_article","_id":"2785"},{"date_created":"2018-12-11T12:00:43Z","doi":"10.1016/S1369526602000031","date_published":"2003-02-01T00:00:00Z","issue":"1","volume":6,"page":"7 - 12","language":[{"iso":"eng"}],"publication":"Current Opinion in Plant Biology","day":"01","year":"2003","publication_status":"published","intvolume":" 6","month":"02","publisher":"Elsevier","quality_controlled":"1","oa_version":"None","abstract":[{"text":"Plant growth is marked by its adaptability to continuous changes in environment. A regulated, differential distribution of auxin underlies many adaptation processes including organogenesis, meristem patterning and tropisms. In executing its multiple roles, auxin displays some characteristics of both a hormone and a morphogen. Studies on auxin transport, as well as tracing the intracellular movement of its molecular components, have suggested a possible scenario to explain how growth plasticity is conferred at the cellular and molecular level. The plant perceives stimuli and changes the subcellular position of auxin-transport components accordingly. These changes modulate auxin fluxes, and the newly established auxin distribution triggers the corresponding developmental response.","lang":"eng"}],"title":"Auxin transport - Shaping the plant","author":[{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","last_name":"Friml"}],"publist_id":"3711","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"ieee":"J. Friml, “Auxin transport - Shaping the plant,” Current Opinion in Plant Biology, vol. 6, no. 1. Elsevier, pp. 7–12, 2003.","short":"J. Friml, Current Opinion in Plant Biology 6 (2003) 7–12.","ama":"Friml J. Auxin transport - Shaping the plant. Current Opinion in Plant Biology. 2003;6(1):7-12. doi:10.1016/S1369526602000031","apa":"Friml, J. (2003). Auxin transport - Shaping the plant. Current Opinion in Plant Biology. Elsevier. https://doi.org/10.1016/S1369526602000031","mla":"Friml, Jiří. “Auxin Transport - Shaping the Plant.” Current Opinion in Plant Biology, vol. 6, no. 1, Elsevier, 2003, pp. 7–12, doi:10.1016/S1369526602000031.","ista":"Friml J. 2003. Auxin transport - Shaping the plant. Current Opinion in Plant Biology. 6(1), 7–12.","chicago":"Friml, Jiří. “Auxin Transport - Shaping the Plant.” Current Opinion in Plant Biology. Elsevier, 2003. https://doi.org/10.1016/S1369526602000031."},"date_updated":"2021-01-12T07:40:17Z","status":"public","type":"journal_article","_id":"2990"},{"publication":"Plant Cell","day":"01","year":"2003","publication_status":"published","date_created":"2018-12-11T12:00:44Z","issue":"3","doi":"10.1105/tpc.008433","volume":15,"date_published":"2003-03-01T00:00:00Z","page":"612 - 625","abstract":[{"lang":"eng","text":"Plants have many polarized cell types, but relatively little is known about the mechanisms that establish polarity. The orc mutant was identified originally by defects in root patterning, and positional cloning revealed that the affected gene encodes STEROL METHYLTRANSFERASE1, which is required for the appropriate synthesis and composition of major membrane sterols. smt1orc mutants displayed several conspicuous cell polarity defects. Columella root cap cells revealed perturbed polar positioning of different organelles, and in the smt1orc root epidermis, polar initiation of root hairs was more randomized. Polar auxin transport and expression of the auxin reporter DR5-β-glucuronidase were aberrant in smt1orc. Patterning defects in smt1orc resembled those observed in mutants of the PIN gene family of putative auxin efflux transporters. Consistently, the membrane localization of the PIN1 and PIN3 proteins was disturbed in smt1orc, whereas polar positioning of the influx carrier AUX1 appeared normal. Our results suggest that balanced sterol composition is a major requirement for cell polarity and auxin efflux in Arabidopsis."}],"intvolume":" 15","month":"03","quality_controlled":0,"publisher":"American Society of Plant Biologists","extern":1,"citation":{"chicago":"Willemsen, Viola, Jiří Friml, Markus Grebe, Albert Van Den Toorn, Klaus Palme, and Ben Scheres. “Cell Polarity and PIN Protein Positioning in Arabidopsis Require STEROL METHYLTRANSFERASE1 Function.” Plant Cell. American Society of Plant Biologists, 2003. https://doi.org/10.1105/tpc.008433.","ista":"Willemsen V, Friml J, Grebe M, Van Den Toorn A, Palme K, Scheres B. 2003. Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. Plant Cell. 15(3), 612–625.","mla":"Willemsen, Viola, et al. “Cell Polarity and PIN Protein Positioning in Arabidopsis Require STEROL METHYLTRANSFERASE1 Function.” Plant Cell, vol. 15, no. 3, American Society of Plant Biologists, 2003, pp. 612–25, doi:10.1105/tpc.008433.","ama":"Willemsen V, Friml J, Grebe M, Van Den Toorn A, Palme K, Scheres B. Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. Plant Cell. 2003;15(3):612-625. doi:10.1105/tpc.008433","apa":"Willemsen, V., Friml, J., Grebe, M., Van Den Toorn, A., Palme, K., & Scheres, B. (2003). Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function. Plant Cell. American Society of Plant Biologists. https://doi.org/10.1105/tpc.008433","short":"V. Willemsen, J. Friml, M. Grebe, A. Van Den Toorn, K. Palme, B. Scheres, Plant Cell 15 (2003) 612–625.","ieee":"V. Willemsen, J. Friml, M. Grebe, A. Van Den Toorn, K. Palme, and B. Scheres, “Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function,” Plant Cell, vol. 15, no. 3. American Society of Plant Biologists, pp. 612–625, 2003."},"date_updated":"2021-01-12T07:40:18Z","title":"Cell polarity and PIN protein positioning in Arabidopsis require STEROL METHYLTRANSFERASE1 function","publist_id":"3710","author":[{"first_name":"Viola","last_name":"Willemsen","full_name":"Willemsen, Viola"},{"full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"first_name":"Markus","last_name":"Grebe","full_name":"Grebe, Markus"},{"full_name":"Van Den Toorn, Albert","last_name":"Van Den Toorn","first_name":"Albert"},{"first_name":"Klaus","last_name":"Palme","full_name":"Palme, Klaus"},{"first_name":"Ben","last_name":"Scheres","full_name":"Scheres, Ben"}],"_id":"2992","status":"public","type":"journal_article"},{"extern":1,"date_updated":"2021-01-12T07:40:19Z","citation":{"ieee":"E. Benková et al., “Local, efflux-dependent auxin gradients as a common module for plant organ formation,” Cell, vol. 115, no. 5. Cell Press, pp. 591–602, 2003.","short":"E. Benková, M. Michniewicz, M. Sauer, T. Teichmann, D. Seifertová, G. Jürgens, J. Friml, Cell 115 (2003) 591–602.","apa":"Benková, E., Michniewicz, M., Sauer, M., Teichmann, T., Seifertová, D., Jürgens, G., & Friml, J. (2003). Local, efflux-dependent auxin gradients as a common module for plant organ formation. Cell. Cell Press. https://doi.org/10.1016/S0092-8674(03)00924-3","ama":"Benková E, Michniewicz M, Sauer M, et al. Local, efflux-dependent auxin gradients as a common module for plant organ formation. Cell. 2003;115(5):591-602. doi:10.1016/S0092-8674(03)00924-3","mla":"Benková, Eva, et al. “Local, Efflux-Dependent Auxin Gradients as a Common Module for Plant Organ Formation.” Cell, vol. 115, no. 5, Cell Press, 2003, pp. 591–602, doi:10.1016/S0092-8674(03)00924-3.","ista":"Benková E, Michniewicz M, Sauer M, Teichmann T, Seifertová D, Jürgens G, Friml J. 2003. Local, efflux-dependent auxin gradients as a common module for plant organ formation. Cell. 115(5), 591–602.","chicago":"Benková, Eva, Marta Michniewicz, Michael Sauer, Thomas Teichmann, Daniela Seifertová, Gerd Jürgens, and Jiří Friml. “Local, Efflux-Dependent Auxin Gradients as a Common Module for Plant Organ Formation.” Cell. Cell Press, 2003. https://doi.org/10.1016/S0092-8674(03)00924-3."},"title":"Local, efflux-dependent auxin gradients as a common module for plant organ formation","publist_id":"3706","author":[{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","orcid":"0000-0002-8510-9739","last_name":"Benková"},{"first_name":"Marta","full_name":"Michniewicz, Marta","last_name":"Michniewicz"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"first_name":"Thomas","last_name":"Teichmann","full_name":"Teichmann, Thomas"},{"last_name":"Seifertová","full_name":"Seifertová, Daniela","first_name":"Daniela"},{"last_name":"Jürgens","full_name":"Jürgens, Gerd","first_name":"Gerd"},{"orcid":"0000-0002-8302-7596","full_name":"Jirí Friml","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"_id":"2996","status":"public","type":"journal_article","publication":"Cell","day":"26","year":"2003","publication_status":"published","date_created":"2018-12-11T12:00:46Z","doi":"10.1016/S0092-8674(03)00924-3","date_published":"2003-11-26T00:00:00Z","volume":115,"issue":"5","page":"591 - 602","abstract":[{"text":"Plants, compared to animals, exhibit an amazing adaptability and plasticity in their development. This is largely dependent on the ability of plants to form new organs, such as lateral roots, leaves, and flowers during postembryonic development. Organ primordia develop from founder cell populations into organs by coordinated cell division and differentiation. Here, we show that organ formation in Arabidopsis involves dynamic gradients of the signaling molecule auxin with maxima at the primordia tips. These gradients are mediated by cellular efflux requiring asymmetrically localized PIN proteins, which represent a functionally redundant network for auxin distribution in both aerial and underground organs. PIN1 polar localization undergoes a dynamic rearrangement, which correlates with establishment of auxin gradients and primordium development. Our results suggest that PIN-dependent, local auxin gradients represent a common module for formation of all plant organs, regardless of their mature morphology or developmental origin.\n","lang":"eng"}],"intvolume":" 115","month":"11","publisher":"Cell Press","quality_controlled":0},{"_id":"2995","status":"public","type":"journal_article","extern":1,"citation":{"ista":"Friml J, Vieten A, Sauer M, Weijers D, Schwarz H, Hamann T, Offringa R, Jürgens G. 2003. Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. Nature. 426(6963), 147–153.","chicago":"Friml, Jiří, Anne Vieten, Michael Sauer, Dolf Weijers, Heinz Schwarz, Thorsten Hamann, Remko Offringa, and Gerd Jürgens. “Efflux Dependent Auxin Gradients Establish the Apical Basal Axis of Arabidopsis.” Nature. Nature Publishing Group, 2003. https://doi.org/10.1038/nature02085.","ieee":"J. Friml et al., “Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis,” Nature, vol. 426, no. 6963. Nature Publishing Group, pp. 147–153, 2003.","short":"J. Friml, A. Vieten, M. Sauer, D. Weijers, H. Schwarz, T. Hamann, R. Offringa, G. Jürgens, Nature 426 (2003) 147–153.","apa":"Friml, J., Vieten, A., Sauer, M., Weijers, D., Schwarz, H., Hamann, T., … Jürgens, G. (2003). Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. Nature. Nature Publishing Group. https://doi.org/10.1038/nature02085","ama":"Friml J, Vieten A, Sauer M, et al. Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis. Nature. 2003;426(6963):147-153. doi:10.1038/nature02085","mla":"Friml, Jiří, et al. “Efflux Dependent Auxin Gradients Establish the Apical Basal Axis of Arabidopsis.” Nature, vol. 426, no. 6963, Nature Publishing Group, 2003, pp. 147–53, doi:10.1038/nature02085."},"date_updated":"2021-01-12T07:40:19Z","title":"Efflux dependent auxin gradients establish the apical basal axis of Arabidopsis","author":[{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","last_name":"Friml"},{"first_name":"Anne","last_name":"Vieten","full_name":"Vieten, Anne"},{"full_name":"Sauer, Michael","last_name":"Sauer","first_name":"Michael"},{"last_name":"Weijers","full_name":"Weijers, Dolf","first_name":"Dolf"},{"last_name":"Schwarz","full_name":"Schwarz, Heinz","first_name":"Heinz"},{"full_name":"Hamann, Thorsten","last_name":"Hamann","first_name":"Thorsten"},{"last_name":"Offringa","full_name":"Offringa, Remko","first_name":"Remko"},{"full_name":"Jürgens, Gerd","last_name":"Jürgens","first_name":"Gerd"}],"publist_id":"3708","abstract":[{"text":"Axis formation occurs in plants, as in animals, during early embryogenesis. However, the underlying mechanism is not known. Here we show that the first manifestation of the apical-basal axis in plants, the asymmetric division of the zygote, produces a basal cell that transports and an apical cell that responds to the signalling molecule auxin. This apical-basal auxin activity gradient triggers the specification of apical embryo structures and is actively maintained by a novel component of auxin efflux, PIN7, which is located apically in the basal cell. Later, the developmentally regulated reversal of PIN7 and onset of PIN1 polar localization reorganize the auxin gradient for specification of the basal root pole. An analysis of pin quadruple mutants identifies PIN-dependent transport as an essential part of the mechanism for embryo axis formation. Our results indicate how the establishment of cell polarity, polar auxin efflux and local auxin response result in apical-basal axis formation of the embryo, and thus determine the axiality of the adult plant.\n","lang":"eng"}],"intvolume":" 426","month":"11","publisher":"Nature Publishing Group","quality_controlled":0,"publication":"Nature","day":"13","publication_status":"published","year":"2003","date_created":"2018-12-11T12:00:45Z","date_published":"2003-11-13T00:00:00Z","volume":426,"doi":"10.1038/nature02085","issue":"6963","page":"147 - 153"},{"abstract":[{"text":"The regular arrangement of leaves around a plant's stem, called phyllotaxis, has for centuries attracted the attention of philosophers, mathematicians and natural scientists; however, to date, studies of phyllotaxis have been largely theoretical. Leaves and flowers are formed from the shoot apical meristem, triggered by the plant hormone auxin. Auxin is transported through plant tissues by specific cellular influx and efflux carrier proteins. Here we show that proteins involved in auxin transport regulate phyllotaxis. Our data indicate that auxin is transported upwards into the meristem through the epidermis and the outermost meristem cell layer. Existing leaf primordia act as sinks, redistributing auxin and creating its heterogeneous distribution in the meristem. Auxin accumulation occurs only at certain minimal distances from existing primordia, defining the position of future primordia. This model for phyllotaxis accounts for its reiterative nature, as well as its regularity and stability.","lang":"eng"}],"month":"11","intvolume":" 426","quality_controlled":0,"publisher":"Nature Publishing Group","day":"20","publication":"Nature","publication_status":"published","year":"2003","issue":"6964","doi":"10.1038/nature02081","date_published":"2003-11-20T00:00:00Z","volume":426,"date_created":"2018-12-11T12:00:45Z","page":"255 - 260","_id":"2994","status":"public","type":"journal_article","extern":1,"date_updated":"2021-01-12T07:40:18Z","citation":{"mla":"Reinhardt, Didier, et al. “Regulation of Phyllotaxis by Polar Auxin Transport.” Nature, vol. 426, no. 6964, Nature Publishing Group, 2003, pp. 255–60, doi:10.1038/nature02081.","apa":"Reinhardt, D., Pesce, E., Stieger, P., Mandel, T., Baltensperger, K., Bennett, M., … Kuhlemeier, C. (2003). Regulation of phyllotaxis by polar auxin transport. Nature. Nature Publishing Group. https://doi.org/10.1038/nature02081","ama":"Reinhardt D, Pesce E, Stieger P, et al. Regulation of phyllotaxis by polar auxin transport. Nature. 2003;426(6964):255-260. doi:10.1038/nature02081","ieee":"D. Reinhardt et al., “Regulation of phyllotaxis by polar auxin transport,” Nature, vol. 426, no. 6964. Nature Publishing Group, pp. 255–260, 2003.","short":"D. Reinhardt, E. Pesce, P. Stieger, T. Mandel, K. Baltensperger, M. Bennett, J. Traas, J. Friml, C. Kuhlemeier, Nature 426 (2003) 255–260.","chicago":"Reinhardt, Didier, Eva Pesce, Pia Stieger, Therese Mandel, Kurt Baltensperger, Malcolm Bennett, Jan Traas, Jiří Friml, and Cris Kuhlemeier. “Regulation of Phyllotaxis by Polar Auxin Transport.” Nature. Nature Publishing Group, 2003. https://doi.org/10.1038/nature02081.","ista":"Reinhardt D, Pesce E, Stieger P, Mandel T, Baltensperger K, Bennett M, Traas J, Friml J, Kuhlemeier C. 2003. Regulation of phyllotaxis by polar auxin transport. Nature. 426(6964), 255–260."},"title":"Regulation of phyllotaxis by polar auxin transport","publist_id":"3707","author":[{"first_name":"Didier","full_name":"Reinhardt, Didier","last_name":"Reinhardt"},{"full_name":"Pesce, Eva-Rachele","last_name":"Pesce","first_name":"Eva"},{"full_name":"Stieger, Pia","last_name":"Stieger","first_name":"Pia"},{"last_name":"Mandel","full_name":"Mandel, Therese","first_name":"Therese"},{"last_name":"Baltensperger","full_name":"Baltensperger, Kurt","first_name":"Kurt"},{"first_name":"Malcolm","full_name":"Bennett, Malcolm","last_name":"Bennett"},{"last_name":"Traas","full_name":"Traas, Jan","first_name":"Jan"},{"first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Jirí Friml"},{"full_name":"Kuhlemeier, Cris","last_name":"Kuhlemeier","first_name":"Cris"}]},{"publisher":"Wiley-Blackwell","quality_controlled":0,"month":"04","intvolume":" 34","abstract":[{"lang":"eng","text":"Plant biology is currently experiencing a growing demand for easy and reliable mRNA and protein localisation techniques. Here, we present novel whole mount in situ hybridisation and immunolocalisation protocols, suitable to localise mRNAs and proteins in Arabidopsis seedlings. We demonstrate that these methods can be used in different organs of Arabidopsis seedlings as well as in other plant species. In order to achieve better reproducibility and higher throughput, we modified these protocols for automation to be performed by a liquid handling robot. In addition, we show that other procedures such as reporter enzyme assays and tissue clearing can be similarly automated. We present examples of application of our protocols including mRNA localisation and proteins and epitope tag (co)localisations which demonstrate that these methods provide reliable and versatile tools for expression, localisation and anatomical studies in plants."}],"page":"115 - 124","volume":34,"date_published":"2003-04-01T00:00:00Z","doi":"10.1046/j.1365-313X.2003.01705.x","issue":"1","date_created":"2018-12-11T12:00:44Z","year":"2003","publication_status":"published","day":"01","publication":"Plant Journal","type":"journal_article","status":"public","_id":"2993","author":[{"full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"},{"orcid":"0000-0002-8510-9739","full_name":"Eva Benková","last_name":"Benková","first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ulrike","full_name":"Mayer, Ulrike","last_name":"Mayer"},{"full_name":"Palme, Klaus","last_name":"Palme","first_name":"Klaus"},{"first_name":"Gerhard","last_name":"Muster","full_name":"Muster, Gerhard"}],"publist_id":"3709","title":"Automated whole mount localisation techniques for plant seedlings","date_updated":"2021-01-12T07:40:18Z","citation":{"mla":"Friml, Jiří, et al. “Automated Whole Mount Localisation Techniques for Plant Seedlings.” Plant Journal, vol. 34, no. 1, Wiley-Blackwell, 2003, pp. 115–24, doi:10.1046/j.1365-313X.2003.01705.x.","ieee":"J. Friml, E. Benková, U. Mayer, K. Palme, and G. Muster, “Automated whole mount localisation techniques for plant seedlings,” Plant Journal, vol. 34, no. 1. Wiley-Blackwell, pp. 115–124, 2003.","short":"J. Friml, E. Benková, U. Mayer, K. Palme, G. Muster, Plant Journal 34 (2003) 115–124.","ama":"Friml J, Benková E, Mayer U, Palme K, Muster G. Automated whole mount localisation techniques for plant seedlings. Plant Journal. 2003;34(1):115-124. doi:10.1046/j.1365-313X.2003.01705.x","apa":"Friml, J., Benková, E., Mayer, U., Palme, K., & Muster, G. (2003). Automated whole mount localisation techniques for plant seedlings. Plant Journal. Wiley-Blackwell. https://doi.org/10.1046/j.1365-313X.2003.01705.x","chicago":"Friml, Jiří, Eva Benková, Ulrike Mayer, Klaus Palme, and Gerhard Muster. “Automated Whole Mount Localisation Techniques for Plant Seedlings.” Plant Journal. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1365-313X.2003.01705.x.","ista":"Friml J, Benková E, Mayer U, Palme K, Muster G. 2003. Automated whole mount localisation techniques for plant seedlings. Plant Journal. 34(1), 115–124."},"extern":1},{"status":"public","type":"journal_article","_id":"3151","title":"Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development","author":[{"last_name":"Rayburn","full_name":"Rayburn, Lowell Y","first_name":"Lowell"},{"first_name":"Holly","full_name":"Gooding, Holly C","last_name":"Gooding"},{"first_name":"Semil","full_name":"Choksi, Semil P","last_name":"Choksi"},{"first_name":"Dhea","full_name":"Maloney, Dhea","last_name":"Maloney"},{"first_name":"Ambrose","full_name":"Kidd, Ambrose R","last_name":"Kidd"},{"first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","orcid":"0000-0001-8323-8353","full_name":"Daria Siekhaus"},{"first_name":"Michael","full_name":"Bender, Michael","last_name":"Bender"}],"publist_id":"3545","extern":1,"citation":{"apa":"Rayburn, L., Gooding, H., Choksi, S., Maloney, D., Kidd, A., Siekhaus, D. E., & Bender, M. (2003). Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. Genetics Society of America.","ama":"Rayburn L, Gooding H, Choksi S, et al. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. 2003;163(1):227-237.","short":"L. Rayburn, H. Gooding, S. Choksi, D. Maloney, A. Kidd, D.E. Siekhaus, M. Bender, Genetics 163 (2003) 227–237.","ieee":"L. Rayburn et al., “Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development,” Genetics, vol. 163, no. 1. Genetics Society of America, pp. 227–237, 2003.","mla":"Rayburn, Lowell, et al. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” Genetics, vol. 163, no. 1, Genetics Society of America, 2003, pp. 227–37.","ista":"Rayburn L, Gooding H, Choksi S, Maloney D, Kidd A, Siekhaus DE, Bender M. 2003. Amontillado, the Drosophila homolog of the prohormone processing protease PC2, is required during embryogenesis and early larval development. Genetics. 163(1), 227–237.","chicago":"Rayburn, Lowell, Holly Gooding, Semil Choksi, Dhea Maloney, Ambrose Kidd, Daria E Siekhaus, and Michael Bender. “Amontillado, the Drosophila Homolog of the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.” Genetics. Genetics Society of America, 2003."},"date_updated":"2021-01-12T07:41:25Z","intvolume":" 163","month":"01","quality_controlled":0,"publisher":"Genetics Society of America","abstract":[{"lang":"eng","text":"Biosynthesis of most peptide hormones and neuropeptides requires proteolytic excision of the active peptide from inactive proprotein precursors, an activity carried out by subtilisin-like proprotein convertases (SPCs) in constitutive or regulated secretory pathways. The Drosophila amontillado (amon) gene encodes a homolog of the mammalian PC2 protein, an SPC that functions in the regulated secretory pathway in neuroendocrine tissues. We have identified amon mutants by isolating ethylmethanesulfonate (EMS)-induced lethal and visible mutations that define two complementation groups in the amon interval at 97D1 of the third chromosome. DNA sequencing identified the amon complementation group and the DNA sequence change for each of the nine amon alleles isolated. amon mutants display partial embryonic lethality, are defective in larval growth, and arrest during the first to second instar larval molt. Mutant larvae can be rescued by heat-shock-induced expression of the amon protein. Rescued larvae arrest at the subsequent larval molt, suggesting that amon is also required for the second to third instar larval molt. Our data indicate that the amon proprotein convertase is required during embryogenesis and larval development in Drosophila and support the hypothesis that AMON acts to proteolytically process peptide hormones that regulate hatching, larval growth, and larval ecdysis."}],"date_created":"2018-12-11T12:01:41Z","date_published":"2003-01-01T00:00:00Z","issue":"1","volume":163,"page":"227 - 237","publication":"Genetics","day":"01","year":"2003","publication_status":"published"},{"abstract":[{"text":"Tripartite G-protein-coupled receptors (GPCRs) represent one of the largest groups of signal transducers, transmitting signals from hormones, neuropeptides, odorants, food and light. Ligand-bound receptors catalyse GDP/GTP exchange on the G-protein α-subunit (Gα), leading to α-GTP separation from the βγ subunits and pathway activation. Activating mutations in the receptors or G proteins underlie many human diseases, including some cancers, dwarfism and premature puberty. Regulators of G-protein signalling (RGS proteins) are known to modulate the level and duration of ligand-induced signalling by accelerating the intrinsic GTPase activity of the Gα subunit, and thus reformation of the inactive GDP-bound Gα. Here we find that even in the absence of receptor, mutation of the RGS family member Sst2 (refs 6-9) permits spontaneous activation of the G-protein-coupled mating pathway in Saccharomyces cerevisiae at levels normally seen only in the presence of ligand. Our work demonstrates the occurence of spontaneous tripartite G-protein signalling in vivo and identifies a requirement for RGS proteins in preventing such receptor-independent activation.","lang":"eng"}],"intvolume":" 5","month":"03","quality_controlled":0,"publisher":"Nature Publishing Group","publication":"Nature Cell Biology","day":"01","year":"2003","publication_status":"published","date_created":"2018-12-11T12:01:41Z","date_published":"2003-03-01T00:00:00Z","issue":"3","volume":5,"doi":"10.1038/ncb941","page":"231 - 235","_id":"3150","status":"public","type":"journal_article","extern":1,"citation":{"ista":"Siekhaus DE, Drubin D. 2003. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. 5(3), 231–235.","chicago":"Siekhaus, Daria E, and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” Nature Cell Biology. Nature Publishing Group, 2003. https://doi.org/10.1038/ncb941.","ieee":"D. E. Siekhaus and D. Drubin, “Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant,” Nature Cell Biology, vol. 5, no. 3. Nature Publishing Group, pp. 231–235, 2003.","short":"D.E. Siekhaus, D. Drubin, Nature Cell Biology 5 (2003) 231–235.","ama":"Siekhaus DE, Drubin D. Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. 2003;5(3):231-235. doi:10.1038/ncb941","apa":"Siekhaus, D. E., & Drubin, D. (2003). Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb941","mla":"Siekhaus, Daria E., and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric G-Protein Signalling in an RGS Mutant.” Nature Cell Biology, vol. 5, no. 3, Nature Publishing Group, 2003, pp. 231–35, doi:10.1038/ncb941."},"date_updated":"2021-01-12T07:41:24Z","title":"Spontaneous receptor-independent heterotrimeric G-protein signalling in an RGS mutant","publist_id":"3544","author":[{"full_name":"Daria Siekhaus","orcid":"0000-0001-8323-8353","last_name":"Siekhaus","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","first_name":"Daria E"},{"full_name":"Drubin, David G","last_name":"Drubin","first_name":"David"}]},{"publication_status":"published","year":"2003","publication":"Journal of Computer and System Sciences","day":"01","page":"757 - 771","date_created":"2018-12-11T12:02:01Z","date_published":"2003-12-01T00:00:00Z","volume":67,"doi":"10.1016/S0022-0000(03)00078-3","issue":"4","abstract":[{"lang":"eng","text":"We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W[1]-hard. Unless W[1]=FPT, this rules out the existence of algorithms with time complexity of O(f(k)nα) for those problems. Here n is the size of the problem instance, α is constant, k is the number of strings and f is any function of k. The fixed alphabet version of the LCS problem is of particular interest considering the importance of sequence comparison (e.g. multiple sequence alignment) in the fixed length alphabet world of DNA and protein sequences."}],"publisher":"Elsevier","quality_controlled":0,"intvolume":" 67","month":"12","citation":{"ama":"Pietrzak KZ. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 2003;67(4):757-771. doi:10.1016/S0022-0000(03)00078-3","apa":"Pietrzak, K. Z. (2003). On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. Elsevier. https://doi.org/10.1016/S0022-0000(03)00078-3","ieee":"K. Z. Pietrzak, “On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems,” Journal of Computer and System Sciences, vol. 67, no. 4. Elsevier, pp. 757–771, 2003.","short":"K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771.","mla":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal of Computer and System Sciences, vol. 67, no. 4, Elsevier, 2003, pp. 757–71, doi:10.1016/S0022-0000(03)00078-3.","ista":"Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. Journal of Computer and System Sciences. 67(4), 757–771.","chicago":"Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal of Computer and System Sciences. Elsevier, 2003. https://doi.org/10.1016/S0022-0000(03)00078-3."},"date_updated":"2021-01-12T07:41:49Z","extern":1,"publist_id":"3472","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak"}],"title":"On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems","_id":"3209","type":"journal_article","status":"public"},{"month":"06","intvolume":" 2656","quality_controlled":0,"alternative_title":["LNCS"],"publisher":"Springer","abstract":[{"text":"Luby and Rackoff showed how to construct a (super-)pseudo-random permutation {0,1}2n→ {0,1}2n from some number r of pseudo-random functions {0,1}n → {0,1}n. Their construction, motivated by DES, consists of a cascade of r Feistel permutations. A Feistel permutation 1for a pseudo-random function f is defined as (L, R) → (R,L ⊕ f (R)), where L and R are the left and right part of the input and ⊕ denotes bitwise XOR or, in this paper, any other group operation on {0,1}n. The only non-trivial step of the security proof consists of proving that the cascade of r Feistel permutations with independent uniform random functions {0,1}n → {0,1}n, denoted Ψ2nr is indistinguishable from a uniform random permutation {0,1}2n → {0,1}2n by any computationally unbounded adaptive distinguisher making at most O(2cn) combined chosen plaintext/ciphertext queries for any c < α, where a is a security parameter. Luby and Rackoff proved α = 1/2 for r = 4. A natural problem, proposed by Pieprzyk is to improve on α for larger r. The best known result, α = 3/4 for r = 6, is due to Patarin. In this paper we prove a = 1 -O(1/r), i.e., the trivial upper bound α = 1 can be approached. The proof uses some new techniques that can be of independent interest. ","lang":"eng"}],"doi":"10.1007/3-540-39200-9_34","date_published":"2003-06-04T00:00:00Z","volume":2656,"date_created":"2018-12-11T12:02:02Z","page":"544 - 561","day":"04","publication_status":"published","year":"2003","status":"public","type":"conference","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"},"_id":"3210","title":"The security of many round Luby Rackoff pseudo random permutations","publist_id":"3473","author":[{"first_name":"Ueli","last_name":"Maurer","full_name":"Maurer, Ueli M"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak"}],"extern":1,"citation":{"ista":"Maurer U, Pietrzak KZ. 2003. The security of many round Luby Rackoff pseudo random permutations. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 2656, 544–561.","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “The Security of Many Round Luby Rackoff Pseudo Random Permutations,” 2656:544–61. Springer, 2003. https://doi.org/10.1007/3-540-39200-9_34.","apa":"Maurer, U., & Pietrzak, K. Z. (2003). The security of many round Luby Rackoff pseudo random permutations (Vol. 2656, pp. 544–561). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Springer. https://doi.org/10.1007/3-540-39200-9_34","ama":"Maurer U, Pietrzak KZ. The security of many round Luby Rackoff pseudo random permutations. In: Vol 2656. Springer; 2003:544-561. doi:10.1007/3-540-39200-9_34","ieee":"U. Maurer and K. Z. Pietrzak, “The security of many round Luby Rackoff pseudo random permutations,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, 2003, vol. 2656, pp. 544–561.","short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2003, pp. 544–561.","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. The Security of Many Round Luby Rackoff Pseudo Random Permutations. Vol. 2656, Springer, 2003, pp. 544–61, doi:10.1007/3-540-39200-9_34."},"date_updated":"2021-01-12T07:41:49Z"},{"_id":"3425","status":"public","conference":{"name":"NATO ASI on Structure and Dynamics of Elementary Matter"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"short":"M.T. Bollenbach, T. Strother, W. Bauer, in:, Springer, 2003, pp. 277–288.","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.","apa":"Bollenbach, M. T., Strother, T., & 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. https://doi.org/10.1007/978-1-4020-2705-5_21","ama":"Bollenbach MT, Strother T, Bauer W. 3D supernova collapse calculations. In: Vol 166. Springer; 2003:277-288. doi:10.1007/978-1-4020-2705-5_21","mla":"Bollenbach, Mark Tobias, et al. 3D Supernova Collapse Calculations. Vol. 166, Springer, 2003, pp. 277–88, doi:10.1007/978-1-4020-2705-5_21.","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.","chicago":"Bollenbach, Mark Tobias, T. Strother, and Wolfgang Bauer. “3D Supernova Collapse Calculations,” 166:277–88. Springer, 2003. https://doi.org/10.1007/978-1-4020-2705-5_21."},"date_updated":"2021-01-12T07:43:23Z","title":"3D supernova collapse calculations","article_processing_charge":"No","author":[{"last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias"},{"full_name":"Strother, T.","last_name":"Strother","first_name":"T."},{"first_name":"Wolfgang","full_name":"Bauer, Wolfgang","last_name":"Bauer"}],"publist_id":"2976","oa_version":"None","intvolume":" 166","month":"01","publisher":"Springer","alternative_title":["Nato Science Series II"],"language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2003","date_created":"2018-12-11T12:03:16Z","volume":166,"date_published":"2003-01-01T00:00:00Z","doi":"10.1007/978-1-4020-2705-5_21","page":"277 - 288"},{"quality_controlled":0,"publisher":"Deutscher Ärzte Verlag","month":"01","page":"3 - 26","volume":"B","date_published":"2003-01-01T00:00:00Z","date_created":"2018-12-11T12:03:26Z","year":"2003","publication_status":"published","day":"01","publication":"Lehrbuch Vorklinik","type":"book_chapter","status":"public","_id":"3458","author":[{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","full_name":"Peter Jonas","orcid":"0000-0001-5001-4804"},{"first_name":"Klaus","last_name":"Unsicker","full_name":"Unsicker, Klaus"}],"publist_id":"2929","editor":[{"last_name":"Schmidt","full_name":"Schmidt, R. F.","first_name":"R."}],"title":"Molekulare und zelluläre Grundlagen des Nervensystems.","citation":{"mla":"Jonas, Peter M., and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” Lehrbuch Vorklinik, edited by R. Schmidt, vol. B, Deutscher Ärzte Verlag, 2003, pp. 3–26.","ieee":"P. M. Jonas and K. Unsicker, “Molekulare und zelluläre Grundlagen des Nervensystems.,” in Lehrbuch Vorklinik, vol. B, R. Schmidt, Ed. Deutscher Ärzte Verlag, 2003, pp. 3–26.","short":"P.M. Jonas, K. Unsicker, in:, R. Schmidt (Ed.), Lehrbuch Vorklinik, Deutscher Ärzte Verlag, 2003, pp. 3–26.","ama":"Jonas PM, Unsicker K. Molekulare und zelluläre Grundlagen des Nervensystems. In: Schmidt R, ed. Lehrbuch Vorklinik. Vol B. Deutscher Ärzte Verlag; 2003:3-26.","apa":"Jonas, P. M., & Unsicker, K. (2003). Molekulare und zelluläre Grundlagen des Nervensystems. In R. Schmidt (Ed.), Lehrbuch Vorklinik (Vol. B, pp. 3–26). Deutscher Ärzte Verlag.","chicago":"Jonas, Peter M, and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” In Lehrbuch Vorklinik, edited by R. Schmidt, B:3–26. Deutscher Ärzte Verlag, 2003.","ista":"Jonas PM, Unsicker K. 2003.Molekulare und zelluläre Grundlagen des Nervensystems. In: Lehrbuch Vorklinik. vol. B, 3–26."},"date_updated":"2021-01-12T07:43:35Z","extern":1},{"_id":"3536","status":"public","type":"journal_article","extern":1,"citation":{"mla":"Buzsáki, György, et al. “Hippocampal Network Patterns of Activity in the Mouse.” Neuroscience, vol. 116, no. 1, Elsevier, 2003, pp. 201–11, doi:10.1016/S0306-4522(02)00669-3.","short":"G. Buzsáki, D. Buhl, K. Harris, J.L. Csicsvari, B. Czéh, A. Morozov, Neuroscience 116 (2003) 201–211.","ieee":"G. Buzsáki, D. Buhl, K. Harris, J. L. Csicsvari, B. Czéh, and A. Morozov, “Hippocampal network patterns of activity in the mouse,” Neuroscience, vol. 116, no. 1. Elsevier, pp. 201–211, 2003.","ama":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. Hippocampal network patterns of activity in the mouse. Neuroscience. 2003;116(1):201-211. doi:10.1016/S0306-4522(02)00669-3","apa":"Buzsáki, G., Buhl, D., Harris, K., Csicsvari, J. L., Czéh, B., & Morozov, A. (2003). Hippocampal network patterns of activity in the mouse. Neuroscience. Elsevier. https://doi.org/10.1016/S0306-4522(02)00669-3","chicago":"Buzsáki, György, Derek Buhl, Kenneth Harris, Jozsef L Csicsvari, Boldizsár Czéh, and Alexei Morozov. “Hippocampal Network Patterns of Activity in the Mouse.” Neuroscience. Elsevier, 2003. https://doi.org/10.1016/S0306-4522(02)00669-3.","ista":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. 2003. Hippocampal network patterns of activity in the mouse. Neuroscience. 116(1), 201–211."},"date_updated":"2021-01-12T07:44:09Z","title":"Hippocampal network patterns of activity in the mouse","author":[{"first_name":"György","full_name":"Buzsáki, György","last_name":"Buzsáki"},{"last_name":"Buhl","full_name":"Buhl, Derek L","first_name":"Derek"},{"first_name":"Kenneth","last_name":"Harris","full_name":"Harris, Kenneth D"},{"last_name":"Csicsvari","orcid":"0000-0002-5193-4036","full_name":"Jozsef Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L"},{"last_name":"Czéh","full_name":"Czéh, Boldizsár","first_name":"Boldizsár"},{"last_name":"Morozov","full_name":"Morozov, Alexei","first_name":"Alexei"}],"publist_id":"2849","abstract":[{"text":"Genetic engineering of the mouse brain allows investigators to address novel hypotheses in vivo. Because of the paucity of information on the network patterns of the mouse hippocampus, we investigated the electrical patterns in the behaving animal using multisite silicon probes and wire tetrodes. Theta (6-9 Hz) and gamma (40-100 Hz) oscillations were present during exploration and rapid eye movement sleep. Gamma power and theta power were comodulated and gamma power varied as a function of the theta cycle. Pyramidal cells and putative interneurons were phase-locked to theta oscillations. During immobility, consummatory behaviors and slow-wave sleep, sharp waves were present in cornu ammonis region CA1 of the hippocampus stratum radiatum associated with 140-200-Hz “ripples” in the pyramidal cell layer and population burst of CA1 neurons. In the hilus, large-amplitude “dentate spikes” occurred in association with increased discharge of hilar neurons. The amplitude of field patterns was larger in the mouse than in the rat, likely reflecting the higher neuron density in a smaller brain. We suggest that the main hippocampal network patterns are mediated by similar pathways and mechanisms in mouse and rat. ","lang":"eng"}],"month":"01","intvolume":" 116","quality_controlled":0,"publisher":"Elsevier","day":"15","publication":"Neuroscience","year":"2003","publication_status":"published","doi":"10.1016/S0306-4522(02)00669-3","date_published":"2003-01-15T00:00:00Z","issue":"1","volume":116,"date_created":"2018-12-11T12:03:50Z","page":"201 - 211"},{"publist_id":"2829","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Herbert Edelsbrunner","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Harer","full_name":"Harer, John","first_name":"John"},{"first_name":"Vijay","full_name":"Natarajan, Vijay","last_name":"Natarajan"},{"first_name":"Valerio","full_name":"Pascucci, Valerio","last_name":"Pascucci"}],"title":"Morse-Smale complexes for piecewise linear 3-manifolds","citation":{"short":"H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, ACM, 2003, pp. 361–370.","ieee":"H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Morse-Smale complexes for piecewise linear 3-manifolds,” presented at the SCG: Symposium on Computational Geometry, 2003, pp. 361–370.","ama":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Morse-Smale complexes for piecewise linear 3-manifolds. In: ACM; 2003:361-370. doi:10.1145/777792.777846","apa":"Edelsbrunner, H., Harer, J., Natarajan, V., & Pascucci, V. (2003). Morse-Smale complexes for piecewise linear 3-manifolds (pp. 361–370). Presented at the SCG: Symposium on Computational Geometry, ACM. https://doi.org/10.1145/777792.777846","mla":"Edelsbrunner, Herbert, et al. Morse-Smale Complexes for Piecewise Linear 3-Manifolds. ACM, 2003, pp. 361–70, doi:10.1145/777792.777846.","ista":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.","chicago":"Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” 361–70. ACM, 2003. https://doi.org/10.1145/777792.777846."},"date_updated":"2021-01-12T07:44:17Z","extern":1,"type":"conference","conference":{"name":"SCG: Symposium on Computational Geometry"},"status":"public","_id":"3556","page":"361 - 370","date_published":"2003-06-01T00:00:00Z","doi":"10.1145/777792.777846","date_created":"2018-12-11T12:03:57Z","publication_status":"published","year":"2003","day":"01","quality_controlled":0,"publisher":"ACM","main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.9592","open_access":"0"}],"month":"06","abstract":[{"text":"We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and as- cending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are sepa- rated by quadrangular faces. In this paper, we give a combi- natorial algorithm for constructing such complexes for piece- wise linear data.","lang":"eng"}]},{"page":"379 - 404","doi":"10.1007/978-3-642-55566-4_17","date_published":"2003-06-23T00:00:00Z","date_created":"2018-12-11T12:04:02Z","year":"2003","publication_status":"published","day":"23","publication":"Discrete & Computational Geometry","publisher":"Springer","quality_controlled":0,"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633","open_access":"0"}],"month":"06","abstract":[{"lang":"eng","text":"Given a finite point set in R, the surface reconstruction problem asks for a surface that passes through many but not necessarily all points. We describe an unambigu- ous definition of such a surface in geometric and topological terms, and sketch a fast algorithm for constructing it. Our solution overcomes past limitations to special point distributions and heuristic design decisions."}],"publist_id":"2812","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner","last_name":"Edelsbrunner"}],"title":"Surface reconstruction by wrapping finite sets in space","citation":{"mla":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” Discrete & Computational Geometry, Springer, 2003, pp. 379–404, doi:10.1007/978-3-642-55566-4_17.","short":"H. Edelsbrunner, in:, Discrete & Computational Geometry, Springer, 2003, pp. 379–404.","ieee":"H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,” in Discrete & Computational Geometry, Springer, 2003, pp. 379–404.","ama":"Edelsbrunner H. Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. Springer; 2003:379-404. doi:10.1007/978-3-642-55566-4_17","apa":"Edelsbrunner, H. (2003). Surface reconstruction by wrapping finite sets in space. In Discrete & Computational Geometry (pp. 379–404). Springer. https://doi.org/10.1007/978-3-642-55566-4_17","chicago":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In Discrete & Computational Geometry, 379–404. Springer, 2003. https://doi.org/10.1007/978-3-642-55566-4_17.","ista":"Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. , 379–404."},"date_updated":"2021-01-12T07:44:24Z","extern":1,"type":"book_chapter","status":"public","_id":"3573"},{"day":"22","publication":"Homology, Homotopy and Applications","language":[{"iso":"eng"}],"publication_status":"published","year":"2003","issue":"2","date_published":"2003-04-22T00:00:00Z","volume":5,"date_created":"2018-12-11T12:04:05Z","page":"19 - 37","oa_version":"None","abstract":[{"lang":"eng","text":"We develop fast algorithms for computing the linking number of a simplicial complex within a filtration.We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes."}],"month":"04","intvolume":" 5","quality_controlled":"1","publisher":"International Press","main_file_link":[{"url":"http://projecteuclid.org/euclid.hha/1088453320"}],"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications, vol. 5, no. 2, International Press, 2003, pp. 19–37.","ieee":"H. Edelsbrunner and A. Zomorodian, “Computing linking numbers of a filtration,” Homology, Homotopy and Applications, vol. 5, no. 2. International Press, pp. 19–37, 2003.","short":"H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003) 19–37.","ama":"Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 2003;5(2):19-37.","apa":"Edelsbrunner, H., & Zomorodian, A. (2003). Computing linking numbers of a filtration. Homology, Homotopy and Applications. International Press.","chicago":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications. International Press, 2003.","ista":"Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37."},"date_updated":"2021-01-12T07:44:28Z","title":"Computing linking numbers of a filtration","publist_id":"2801","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"full_name":"Zomorodian, Afra","last_name":"Zomorodian","first_name":"Afra"}],"_id":"3584","status":"public","type":"journal_article"},{"date_created":"2018-12-11T12:04:17Z","issue":"2","volume":91,"doi":"10.1038/sj.hdy.6800291","date_published":"2003-08-01T00:00:00Z","page":"136 - 142","publication":"Heredity","day":"01","year":"2003","publication_status":"published","intvolume":" 91","month":"08","quality_controlled":0,"publisher":"Nature Publishing Group","abstract":[{"lang":"eng","text":"Stable hybrid zones in which ecologically divergent taxa give rise to a range of recombinants are natural laboratories in which the genetic basis of adaptation and reproductive isolation can be unraveled. One such hybrid zone is formed by the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae). Adaptations to permanent and ephemeral breeding habitats, respectively, have shaped numerous phenotypic differences between the taxa. All of these are, in principle, candidates for a genetic dissection via QTL mapping. We present here a linkage map of 28 codominant and 10 dominant markers in the Bombina genome. In an F2 cross, markers that were mainly microsatellites, SSCPs or allozymes were mapped to 20 linkage groups. Among the 40 isolated CA microsatellites, we noted a preponderance of compound and frequently interleaved CA-TA repeats as well as a striking polarity at the 5′ end of the repeats."}],"title":"A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae)","author":[{"last_name":"Nürnberger","full_name":"Nürnberger, Beate","first_name":"Beate"},{"first_name":"Sebastian","last_name":"Hofman","full_name":"Hofman, Sebastian"},{"first_name":"Bqruni","last_name":"Förg Brey","full_name":"Förg-Brey, Bqruni"},{"last_name":"Praetzel","full_name":"Praetzel, Gabriele","first_name":"Gabriele"},{"first_name":"Alan","last_name":"Maclean","full_name":"Maclean, Alan W"},{"last_name":"Szymura","full_name":"Szymura, Jacek M","first_name":"Jacek"},{"first_name":"Catherine","last_name":"Abbott","full_name":"Abbott, Catherine M"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240"}],"publist_id":"2763","extern":1,"date_updated":"2021-01-12T07:44:43Z","citation":{"chicago":"Nürnberger, Beate, Sebastian Hofman, Bqruni Förg Brey, Gabriele Praetzel, Alan Maclean, Jacek Szymura, Catherine Abbott, and Nicholas H Barton. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” Heredity. Nature Publishing Group, 2003. https://doi.org/10.1038/sj.hdy.6800291.","ista":"Nürnberger B, Hofman S, Förg Brey B, Praetzel G, Maclean A, Szymura J, Abbott C, Barton NH. 2003. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. 91(2), 136–142.","mla":"Nürnberger, Beate, et al. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” Heredity, vol. 91, no. 2, Nature Publishing Group, 2003, pp. 136–42, doi:10.1038/sj.hdy.6800291.","short":"B. Nürnberger, S. Hofman, B. Förg Brey, G. Praetzel, A. Maclean, J. Szymura, C. Abbott, N.H. Barton, Heredity 91 (2003) 136–142.","ieee":"B. Nürnberger et al., “A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae),” Heredity, vol. 91, no. 2. Nature Publishing Group, pp. 136–142, 2003.","ama":"Nürnberger B, Hofman S, Förg Brey B, et al. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. 2003;91(2):136-142. doi:10.1038/sj.hdy.6800291","apa":"Nürnberger, B., Hofman, S., Förg Brey, B., Praetzel, G., Maclean, A., Szymura, J., … Barton, N. H. (2003). A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. Nature Publishing Group. https://doi.org/10.1038/sj.hdy.6800291"},"status":"public","type":"journal_article","_id":"3620"},{"type":"journal_article","status":"public","_id":"3619","publist_id":"2764","author":[{"first_name":"Stuart","last_name":"Baird","full_name":"Baird, Stuart J"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240"},{"last_name":"Etheridge","full_name":"Etheridge, Alison M","first_name":"Alison"}],"title":"The distribution of surviving blocks of an ancestral genome","date_updated":"2021-01-12T07:44:42Z","citation":{"short":"S. Baird, N.H. Barton, A. Etheridge, Theoretical Population Biology 64 (2003) 451–471.","ieee":"S. Baird, N. H. Barton, and A. Etheridge, “The distribution of surviving blocks of an ancestral genome,” Theoretical Population Biology, vol. 64, no. 4. Academic Press, pp. 451–471, 2003.","apa":"Baird, S., Barton, N. H., & Etheridge, A. (2003). The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/S0040-5809(03)00098-4","ama":"Baird S, Barton NH, Etheridge A. The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. 2003;64(4):451-471. doi:10.1016/S0040-5809(03)00098-4","mla":"Baird, Stuart, et al. “The Distribution of Surviving Blocks of an Ancestral Genome.” Theoretical Population Biology, vol. 64, no. 4, Academic Press, 2003, pp. 451–71, doi:10.1016/S0040-5809(03)00098-4.","ista":"Baird S, Barton NH, Etheridge A. 2003. The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. 64(4), 451–471.","chicago":"Baird, Stuart, Nicholas H Barton, and Alison Etheridge. “The Distribution of Surviving Blocks of an Ancestral Genome.” Theoretical Population Biology. Academic Press, 2003. https://doi.org/10.1016/S0040-5809(03)00098-4."},"extern":1,"publisher":"Academic Press","quality_controlled":0,"month":"12","intvolume":" 64","abstract":[{"lang":"eng","text":"What is the chance that some part of a stretch of genome will survive? In a population of constant size, and with no selection, the probability of survival of some part of a stretch of map length y<1 approaches View the MathML source for View the MathML source. Thus, the whole genome is certain to be lost, but the rate of loss is extremely slow. This solution extends to give the whole distribution of surviving block sizes as a function of time. We show that the expected number of blocks at time t is 1+yt and give expressions for the moments of the number of blocks and the total amount of genome that survives for a given time. The solution is based on a branching process and assumes complete interference between crossovers, so that each descendant carries only a single block of ancestral material. We consider cases where most individuals carry multiple blocks, either because there are multiple crossovers in a long genetic map, or because enough time has passed that most individuals in the population are related to each other. For species such as ours, which have a long genetic map, the genome of any individual which leaves descendants (∼80% of the population for a Poisson offspring number with mean two) is likely to persist for an extremely long time, in the form of a few short blocks of genome."}],"page":"451 - 471","volume":64,"issue":"4","date_published":"2003-12-01T00:00:00Z","doi":"10.1016/S0040-5809(03)00098-4","date_created":"2018-12-11T12:04:17Z","year":"2003","publication_status":"published","day":"01","publication":"Theoretical Population Biology"},{"extern":1,"date_updated":"2021-01-12T07:44:42Z","citation":{"chicago":"Vines, Timothy, and Nicholas H Barton. “A New Approach to Detecting Mixed Families.” Molecular Ecology. Wiley-Blackwell, 2003. https://doi.org/10.1046/j.1365-294X.2003.01867.x.","ista":"Vines T, Barton NH. 2003. A new approach to detecting mixed families. Molecular Ecology. 12(7), 1999–2002.","mla":"Vines, Timothy, and Nicholas H. Barton. “A New Approach to Detecting Mixed Families.” Molecular Ecology, vol. 12, no. 7, Wiley-Blackwell, 2003, pp. 1999–2002, doi:10.1046/j.1365-294X.2003.01867.x.","ieee":"T. Vines and N. H. Barton, “A new approach to detecting mixed families,” Molecular Ecology, vol. 12, no. 7. Wiley-Blackwell, pp. 1999–2002, 2003.","short":"T. Vines, N.H. Barton, Molecular Ecology 12 (2003) 1999–2002.","ama":"Vines T, Barton NH. A new approach to detecting mixed families. Molecular Ecology. 2003;12(7):1999-2002. doi:10.1046/j.1365-294X.2003.01867.x","apa":"Vines, T., & Barton, N. H. (2003). A new approach to detecting mixed families. Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1046/j.1365-294X.2003.01867.x"},"title":"A new approach to detecting mixed families","publist_id":"2765","author":[{"last_name":"Vines","full_name":"Vines, Timothy H","first_name":"Timothy"},{"full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"}],"_id":"3618","status":"public","type":"journal_article","publication":"Molecular Ecology","day":"01","year":"2003","publication_status":"published","date_created":"2018-12-11T12:04:16Z","doi":"10.1046/j.1365-294X.2003.01867.x","issue":"7","date_published":"2003-07-01T00:00:00Z","volume":12,"page":"1999 - 2002","abstract":[{"lang":"eng","text":"There are several analyses in evolutionary ecology which assume that a family of offspring has come from only two parents. Here, we present a simple test for detecting when a batch involves two or more subfamilies. It is based on the fact that the mixing of families generates associations amongst unlinked marker loci. We also present simulations illustrating the power of our method for varying numbers of loci, alleles per locus and genotyped individuals."}],"intvolume":" 12","month":"07","publisher":"Wiley-Blackwell","quality_controlled":0},{"status":"public","type":"journal_article","_id":"3752","title":"Modeling network dynamics: the lac operon, a case study","author":[{"full_name":"Vilar,Jose M","last_name":"Vilar","first_name":"Jose"},{"last_name":"Guet","orcid":"0000-0001-6220-2052","full_name":"Calin Guet","first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Leibler","full_name":"Leibler, Stanislas","first_name":"Stanislas"}],"publist_id":"2475","extern":1,"citation":{"mla":"Vilar, Jose, et al. “Modeling Network Dynamics: The Lac Operon, a Case Study.” Journal of Cell Biology, vol. 161, no. 3, Rockefeller University Press, 2003, pp. 471–76, doi:10.1083/jcb.200301125.","ieee":"J. Vilar, C. C. Guet, and S. Leibler, “Modeling network dynamics: the lac operon, a case study,” Journal of Cell Biology, vol. 161, no. 3. Rockefeller University Press, pp. 471–476, 2003.","short":"J. Vilar, C.C. Guet, S. Leibler, Journal of Cell Biology 161 (2003) 471–476.","ama":"Vilar J, Guet CC, Leibler S. Modeling network dynamics: the lac operon, a case study. Journal of Cell Biology. 2003;161(3):471-476. doi:10.1083/jcb.200301125","apa":"Vilar, J., Guet, C. C., & Leibler, S. (2003). Modeling network dynamics: the lac operon, a case study. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.200301125","chicago":"Vilar, Jose, Calin C Guet, and Stanislas Leibler. “Modeling Network Dynamics: The Lac Operon, a Case Study.” Journal of Cell Biology. Rockefeller University Press, 2003. https://doi.org/10.1083/jcb.200301125.","ista":"Vilar J, Guet CC, Leibler S. 2003. Modeling network dynamics: the lac operon, a case study. Journal of Cell Biology. 161(3), 471–476."},"date_updated":"2021-01-12T07:51:57Z","month":"01","intvolume":" 161","quality_controlled":0,"publisher":"Rockefeller University Press","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2172934/?tool=pubmed"}],"oa":1,"abstract":[{"lang":"eng","text":"We use the lac operon in Escherichia coli as a prototype system to illustrate the current state, applicability, and limitations of modeling the dynamics of cellular networks. We integrate three different levels of description (molecular, cellular, and that of cell population) into a single model, which seems to capture many experimental aspects of the system."}],"issue":"3","volume":161,"doi":"10.1083/jcb.200301125","date_published":"2003-01-12T00:00:00Z","date_created":"2018-12-11T12:04:58Z","page":"471 - 476","day":"12","publication":"Journal of Cell Biology","publication_status":"published","year":"2003"},{"day":"01","publication":"Revista Mexicana De Fisica","language":[{"iso":"eng"}],"publication_status":"published","year":"2003","date_published":"2003-01-01T00:00:00Z","issue":"4","volume":49,"date_created":"2018-12-11T12:05:13Z","page":"1 - 6","oa_version":"None","month":"01","intvolume":" 49","publisher":"Sociedad Mexicana de Física","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:52:16Z","citation":{"mla":"Bauer, Wolfgang, et al. “Breaking Atomic Nuclei into Little Pieces: Evidence for a Phase Transition.” Revista Mexicana De Fisica, vol. 49, no. 4, Sociedad Mexicana de Física, 2003, pp. 1–6.","ama":"Bauer W, Kleine Berkenbusch M, Bollenbach MT. Breaking atomic nuclei into little pieces: evidence for a phase transition. Revista Mexicana De Fisica. 2003;49(4):1-6.","apa":"Bauer, W., Kleine Berkenbusch, M., & Bollenbach, M. T. (2003). Breaking atomic nuclei into little pieces: evidence for a phase transition. Revista Mexicana De Fisica. Sociedad Mexicana de Física.","ieee":"W. Bauer, M. Kleine Berkenbusch, and M. T. Bollenbach, “Breaking atomic nuclei into little pieces: evidence for a phase transition,” Revista Mexicana De Fisica, vol. 49, no. 4. Sociedad Mexicana de Física, pp. 1–6, 2003.","short":"W. Bauer, M. Kleine Berkenbusch, M.T. Bollenbach, Revista Mexicana De Fisica 49 (2003) 1–6.","chicago":"Bauer, Wolfgang, Marco Kleine Berkenbusch, and Mark Tobias Bollenbach. “Breaking Atomic Nuclei into Little Pieces: Evidence for a Phase Transition.” Revista Mexicana De Fisica. Sociedad Mexicana de Física, 2003.","ista":"Bauer W, Kleine Berkenbusch M, Bollenbach MT. 2003. Breaking atomic nuclei into little pieces: evidence for a phase transition. Revista Mexicana De Fisica. 49(4), 1–6."},"title":"Breaking atomic nuclei into little pieces: evidence for a phase transition","author":[{"last_name":"Bauer","full_name":"Bauer, Wolfgang","first_name":"Wolfgang"},{"first_name":"Marco","full_name":"Kleine Berkenbusch, Marco","last_name":"Kleine Berkenbusch"},{"first_name":"Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X","last_name":"Bollenbach"}],"publist_id":"2413","article_processing_charge":"No","_id":"3797","status":"public","type":"journal_article"},{"citation":{"chicago":"Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Simple Stochastic Parity Games,” 2803:100–113. Springer, 2003. https://doi.org/10.1007/978-3-540-45220-1_11.","ista":"Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity games. CSL: Computer Science Logic, LNCS, vol. 2803, 100–113.","mla":"Chatterjee, Krishnendu, et al. Simple Stochastic Parity Games. Vol. 2803, Springer, 2003, pp. 100–13, doi:10.1007/978-3-540-45220-1_11.","ieee":"K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Simple stochastic parity games,” presented at the CSL: Computer Science Logic, 2003, vol. 2803, pp. 100–113.","short":"K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.","apa":"Chatterjee, K., Jurdziński, M., & Henzinger, T. A. (2003). Simple stochastic parity games (Vol. 2803, pp. 100–113). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/978-3-540-45220-1_11","ama":"Chatterjee K, Jurdziński M, Henzinger TA. Simple stochastic parity games. In: Vol 2803. Springer; 2003:100-113. doi:10.1007/978-3-540-45220-1_11"},"date_updated":"2021-01-12T07:53:02Z","extern":1,"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Marcin","last_name":"Jurdziński","full_name":"Jurdziński, Marcin"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724"}],"publist_id":"2259","title":"Simple stochastic parity games","_id":"3897","conference":{"name":"CSL: Computer Science Logic"},"type":"conference","status":"public","publication_status":"published","year":"2003","day":"18","page":"100 - 113","date_created":"2018-12-11T12:05:46Z","date_published":"2003-08-18T00:00:00Z","doi":"10.1007/978-3-540-45220-1_11","volume":2803,"abstract":[{"lang":"eng","text":"Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in the graph. The focus here is on simple stochastic parity games, that is, two-player games with turn-based probabilistic transitions and omega-regular objectives formalized as parity (Rabin chain) winning conditions. An efficient translation from simple stochastic parity games to nonstochastic parity games is given. As many algorithms are known for solving the latter, the translation yields efficient algorithms for computing the states of a simple stochastic parity game from which a player can win with probability 1. An important special case of simple stochastic parity games are the Markov decision processes with Buchi objectives. For this special case a first provably subquadratic algorithm is given for computing the states from which the single player has a strategy to achieve a Buchi objective with probability 1. For game graphs with m edges the algorithm works in time O(mrootm). Interestingly, a similar technique sheds light on the question of the computational complexity of solving simple Buchi games and yields the first provably subquadratic algorithm, with a running time of O(n(2)/log n) for game graphs with n vertices and O(n) edges."}],"acknowledgement":"This research was supported in part by the DARPA grant F33615-C-98-3614, the ONR grant N00014-02-1-0671, the NSF grants CCR-9988172 and CCR-0225610, and the Polish KBN grant 7-T11C-027-20.","quality_controlled":0,"alternative_title":["LNCS"],"publisher":"Springer","intvolume":" 2803","month":"08"},{"date_updated":"2021-01-12T07:53:02Z","citation":{"chicago":"Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,” 2694:109–26. Springer, 2003. https://doi.org/10.1007/3-540-44898-5_7.","ista":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2003. Stack size analysis for interrupt-driven programs. SAS: Static Analysis Symposium, LNCS, vol. 2694, 109–126.","mla":"Chatterjee, Krishnendu, et al. Stack Size Analysis for Interrupt-Driven Programs. Vol. 2694, Springer, 2003, pp. 109–26, doi:10.1007/3-540-44898-5_7.","ieee":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” presented at the SAS: Static Analysis Symposium, 2003, vol. 2694, pp. 109–126.","short":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, in:, Springer, 2003, pp. 109–126.","ama":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size analysis for interrupt-driven programs. In: Vol 2694. Springer; 2003:109-126. doi:10.1007/3-540-44898-5_7","apa":"Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., & Palsberg, J. (2003). Stack size analysis for interrupt-driven programs (Vol. 2694, pp. 109–126). Presented at the SAS: Static Analysis Symposium, Springer. https://doi.org/10.1007/3-540-44898-5_7"},"extern":1,"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ma, Di","last_name":"Ma","first_name":"Di"},{"full_name":"Majumdar, Ritankar S","last_name":"Majumdar","first_name":"Ritankar"},{"full_name":"Zhao, Tian","last_name":"Zhao","first_name":"Tian"},{"last_name":"Henzinger","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Palsberg, Jens","last_name":"Palsberg","first_name":"Jens"}],"publist_id":"2260","title":"Stack size analysis for interrupt-driven programs","_id":"3898","conference":{"name":"SAS: Static Analysis Symposium"},"type":"conference","status":"public","year":"2003","publication_status":"published","day":"28","page":"109 - 126","date_created":"2018-12-11T12:05:46Z","date_published":"2003-05-28T00:00:00Z","doi":"10.1007/3-540-44898-5_7","volume":2694,"abstract":[{"lang":"eng","text":"We study the problem of determining stack boundedness and the exact maximum stack size for three classes of interrupt-driven programs. Interrupt-driven programs axe used in many real-time applications that require responsive interrupt handling. In order to ensure responsiveness, programmers often enable interrupt processing in the body of lower-priority interrupt handlers. In such programs a programming error can allow interrupt handlers to be interrupted in cyclic fashion to lead to an unbounded stack, causing the system to crash. For a restricted class of interrupt-driven programs, we show that there is a polynomial-time procedure to check stack boundedness, while determining the exact maximum stack size is PSPACE-complete. For a larger class of programs, the two problems are both PSPACE-complete, and for the largest class of programs we consider, the two problems are PSPACE-hard and can be solved in exponential time."}],"acknowledgement":"Jens Palsberg, Di Ma, and Tian Zhao were supported by the NSF ITR award 0112628. Thomas A. Henzinger, Krishnendu Chatterjee, and Rupak Majumdar were supported by the AFOSR grant F49620-00-1-0327, the DARPA grants F33615-C-98-3614 and F33615-00-C-1693, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875 and CCR-0085949.","quality_controlled":0,"alternative_title":["LNCS"],"publisher":"Springer","intvolume":" 2694","month":"05"},{"acknowledgement":"Partially supported by ARO under Grant DAAG55-98-1-0177, NSF under Grants CCR-97-12088, EIA-9972879 and CCR-00-86013.","abstract":[{"lang":"eng","text":"We present algorithms for constructing a hierarchy of increasingly coarse Morse-Smale complexes that decompose a piecewise linear 2-manifold. While these complexes are defined only in the smooth category, we extend the construction to the piecewise linearcategory by ensuring structural integrity and simulating differentiability. We then simplify Morse-Smale complexes by canceling pairs of critical points in order of increasing persistence."}],"intvolume":" 30","month":"07","quality_controlled":0,"publisher":"Springer","publication":"Discrete & Computational Geometry","day":"01","year":"2003","publication_status":"published","date_created":"2018-12-11T12:06:19Z","volume":30,"issue":"1","doi":"10.1007/s00454-003-2926-5","date_published":"2003-07-01T00:00:00Z","page":"87 - 107","_id":"3993","status":"public","type":"journal_article","extern":1,"citation":{"chicago":"Edelsbrunner, Herbert, John Harer, and Afra Zomorodian. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry. Springer, 2003. https://doi.org/10.1007/s00454-003-2926-5.","ista":"Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. 30(1), 87–107.","mla":"Edelsbrunner, Herbert, et al. “Hierarchical Morse-Smale Complexes for Piecewise Linear 2-Manifolds.” Discrete & Computational Geometry, vol. 30, no. 1, Springer, 2003, pp. 87–107, doi:10.1007/s00454-003-2926-5.","short":"H. Edelsbrunner, J. Harer, A. Zomorodian, Discrete & Computational Geometry 30 (2003) 87–107.","ieee":"H. Edelsbrunner, J. Harer, and A. Zomorodian, “Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds,” Discrete & Computational Geometry, vol. 30, no. 1. Springer, pp. 87–107, 2003.","apa":"Edelsbrunner, H., Harer, J., & Zomorodian, A. (2003). Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-003-2926-5","ama":"Edelsbrunner H, Harer J, Zomorodian A. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. 2003;30(1):87-107. doi:10.1007/s00454-003-2926-5"},"date_updated":"2021-01-12T07:53:43Z","title":"Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"full_name":"Zomorodian, Afra","last_name":"Zomorodian","first_name":"Afra"}],"publist_id":"2134"},{"intvolume":" 26","month":"10","quality_controlled":0,"publisher":"Elsevier","acknowledgement":"NSF under grant DMS-98-73945, ARO under grant DAAG55-98-1-0177 and by NSF under grants CCR- 97-12088, EIA-9972879, and CCR-00-86013.","abstract":[{"text":"The body defined by a finite collection of disks is a subset of the plane bounded by a tangent continuous curve, which we call the skin. We give analytic formulas for the area, the perimeter, the area derivative, and the perimeter derivative of the body. Given the filtrations of the Delaunay triangulation and the Voronoi diagram of the disks, all formulas can be evaluated in time proportional to the number of disks.","lang":"eng"}],"date_created":"2018-12-11T12:06:20Z","date_published":"2003-10-01T00:00:00Z","doi":"10.1016/S0925-7721(02)00124-4","issue":"2","volume":26,"page":"173 - 192","publication":"Computational Geometry: Theory and Applications","day":"01","publication_status":"published","year":"2003","status":"public","type":"journal_article","_id":"3994","title":"Area, perimeter and derivatives of a skin curve","publist_id":"2135","author":[{"first_name":"Ho","full_name":"Cheng, Ho-Lun","last_name":"Cheng"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"}],"extern":1,"date_updated":"2021-01-12T07:53:43Z","citation":{"ista":"Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 26(2), 173–192.","chicago":"Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a Skin Curve.” Computational Geometry: Theory and Applications. Elsevier, 2003. https://doi.org/10.1016/S0925-7721(02)00124-4.","ama":"Cheng H, Edelsbrunner H. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 2003;26(2):173-192. doi:10.1016/S0925-7721(02)00124-4","apa":"Cheng, H., & Edelsbrunner, H. (2003). Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. Elsevier. https://doi.org/10.1016/S0925-7721(02)00124-4","short":"H. Cheng, H. Edelsbrunner, Computational Geometry: Theory and Applications 26 (2003) 173–192.","ieee":"H. Cheng and H. Edelsbrunner, “Area, perimeter and derivatives of a skin curve,” Computational Geometry: Theory and Applications, vol. 26, no. 2. Elsevier, pp. 173–192, 2003.","mla":"Cheng, Ho, and Herbert Edelsbrunner. “Area, Perimeter and Derivatives of a Skin Curve.” Computational Geometry: Theory and Applications, vol. 26, no. 2, Elsevier, 2003, pp. 173–92, doi:10.1016/S0925-7721(02)00124-4."}},{"volume":13,"issue":"1","doi":"10.1016/S0959-4388(03)00006-0","date_published":"2003-02-01T00:00:00Z","date_created":"2018-12-11T12:01:37Z","page":"96 - 102","day":"01","publication":"Current Opinion in Neurobiology","year":"2003","publication_status":"published","month":"02","intvolume":" 13","quality_controlled":0,"publisher":"Elsevier","abstract":[{"text":"Significant advances have been made during the past few years in our understanding of how the spinal monosynaptic reflex develops. Transcription factors in the Neurogenin, Runt, ETS, and LIM families control sequential steps of the specification of various subtypes of dorsal root ganglia sensory neurons. The initiation of muscle spindle differentiation requires neuregulin 1, derived from Ia afferent sensory neurons, and signaling through ErbB receptors in intrafusal muscle fibers. Several retrograde signals from the periphery are important for the establishment of late connectivity in the reflex circuit. Finally, neurotrophin 3 released from muscle spindles regulates the strength of sensory-motor connections within the spinal cord postnatally.","lang":"eng"}],"title":"Development of the monosynaptic stretch reflex circuit","author":[{"first_name":"Hsiao","full_name":"Chen, Hsiao Huei","last_name":"Chen"},{"last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Simon Hippenmeyer","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"},{"last_name":"Arber","full_name":"Arber, Silvia","first_name":"Silvia"},{"first_name":"Eric","full_name":"Frank, Eric","last_name":"Frank"}],"publist_id":"3557","extern":1,"date_updated":"2019-04-26T07:22:24Z","citation":{"ieee":"H. Chen, S. Hippenmeyer, S. Arber, and E. Frank, “Development of the monosynaptic stretch reflex circuit,” Current Opinion in Neurobiology, vol. 13, no. 1. Elsevier, pp. 96–102, 2003.","short":"H. Chen, S. Hippenmeyer, S. Arber, E. Frank, Current Opinion in Neurobiology 13 (2003) 96–102.","ama":"Chen H, Hippenmeyer S, Arber S, Frank E. Development of the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology. 2003;13(1):96-102. doi:10.1016/S0959-4388(03)00006-0","apa":"Chen, H., Hippenmeyer, S., Arber, S., & Frank, E. (2003). Development of the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology. Elsevier. https://doi.org/10.1016/S0959-4388(03)00006-0","mla":"Chen, Hsiao, et al. “Development of the Monosynaptic Stretch Reflex Circuit.” Current Opinion in Neurobiology, vol. 13, no. 1, Elsevier, 2003, pp. 96–102, doi:10.1016/S0959-4388(03)00006-0.","ista":"Chen H, Hippenmeyer S, Arber S, Frank E. 2003. Development of the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology. 13(1), 96–102.","chicago":"Chen, Hsiao, Simon Hippenmeyer, Silvia Arber, and Eric Frank. “Development of the Monosynaptic Stretch Reflex Circuit.” Current Opinion in Neurobiology. Elsevier, 2003. https://doi.org/10.1016/S0959-4388(03)00006-0."},"status":"public","type":"review","_id":"3139"},{"_id":"3171","status":"public","conference":{"name":"EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition"},"type":"conference","extern":1,"citation":{"chicago":"Kolmogorov, Vladimir, Ramin Zabih, and Steven Gortler. “Generalized Multi Camera Scene Reconstruction Using Graph Cuts,” 2683:501–16. Springer, 2003. https://doi.org/10.1007/978-3-540-45063-4_32.","ista":"Kolmogorov V, Zabih R, Gortler S. 2003. Generalized multi camera scene reconstruction using graph cuts. EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, LNCS, vol. 2683, 501–516.","mla":"Kolmogorov, Vladimir, et al. Generalized Multi Camera Scene Reconstruction Using Graph Cuts. Vol. 2683, Springer, 2003, pp. 501–16, doi:10.1007/978-3-540-45063-4_32.","ama":"Kolmogorov V, Zabih R, Gortler S. Generalized multi camera scene reconstruction using graph cuts. In: Vol 2683. Springer; 2003:501-516. doi:10.1007/978-3-540-45063-4_32","apa":"Kolmogorov, V., Zabih, R., & Gortler, S. (2003). Generalized multi camera scene reconstruction using graph cuts (Vol. 2683, pp. 501–516). Presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, Springer. https://doi.org/10.1007/978-3-540-45063-4_32","ieee":"V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction using graph cuts,” presented at the EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003, vol. 2683, pp. 501–516.","short":"V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516."},"date_updated":"2021-01-12T07:41:34Z","title":"Generalized multi camera scene reconstruction using graph cuts","publist_id":"3512","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov"},{"last_name":"Zabih","full_name":"Zabih, Ramin","first_name":"Ramin"},{"full_name":"Gortler, Steven","last_name":"Gortler","first_name":"Steven"}],"abstract":[{"lang":"eng","text":"Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are visible from all cameras. In the last few years, two promising approaches have been developed 11,12 that formulate the scene reconstruction problem in terms of energy minimization, and minimize the energy using graph cuts. These energy minimization approaches treat the input images symmetrically, handle visibility constraints correctly, and allow spatial smoothness to be enforced. However, these algorithm propose different problem formulations, and handle a limited class of smoothness terms. One algorithm 11 uses a problem formulation that is restricted to two-camera stereo, and imposes smoothness between a pair of cameras. The other algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness only with respect to a single camera. In this paper we give a more general energy minimization formulation for the problem, which allows a larger class of spatial smoothness constraints. We show that our formulation includes both of the previous approaches as special cases, as well as permitting new energy functions. Experimental results on real data with ground truth are also included. "}],"intvolume":" 2683","month":"06","publisher":"Springer","alternative_title":["LNCS"],"quality_controlled":0,"day":"26","year":"2003","publication_status":"published","date_created":"2018-12-11T12:01:48Z","doi":"10.1007/978-3-540-45063-4_32","volume":2683,"date_published":"2003-06-26T00:00:00Z","page":"501 - 516"},{"day":"30","year":"2003","publication_status":"published","date_published":"2003-09-30T00:00:00Z","doi":"10.1109/ICCV.2003.1238463","volume":2,"date_created":"2018-12-11T12:01:49Z","page":"1033 - 1040","abstract":[{"text":"We address visual correspondence problems without assuming that scene points have similar intensities in different views. This situation is common, usually due to non-lambertian scenes or to differences between cameras. We use maximization of mutual information, a powerful technique for registering images that requires no a priori model of the relationship between scene intensities in different views. However, it has proven difficult to use mutual information to compute dense visual correspondence. Comparing fixed-size windows via mutual information suffers from the well-known problems of fixed windows, namely poor performance at discontinuities and in low-texture regions. In this paper, we show how to compute visual correspondence using mutual information without suffering from these problems. Using 'a simple approximation, mutual information can be incorporated into the standard energy minimization framework used in early vision. The energy can then be efficiently minimized using graph cuts, which preserve discontinuities and handle low-texture regions. The resulting algorithm combines the accurate disparity maps that come from graph cuts with the tolerance for intensity changes that comes from mutual information.","lang":"eng"}],"month":"09","intvolume":" 2","publisher":"IEEE","quality_controlled":0,"extern":1,"date_updated":"2021-01-12T07:41:35Z","citation":{"chicago":"Kim, Junhwan, Vladimir Kolmogorov, and Ramin Zabih. “Visual Correspondence Using Energy Minimization and Mutual Information,” 2:1033–40. IEEE, 2003. https://doi.org/10.1109/ICCV.2003.1238463.","ista":"Kim J, Kolmogorov V, Zabih R. 2003. Visual correspondence using energy minimization and mutual information. ICCV: International Conference on Computer Vision vol. 2, 1033–1040.","mla":"Kim, Junhwan, et al. Visual Correspondence Using Energy Minimization and Mutual Information. Vol. 2, IEEE, 2003, pp. 1033–40, doi:10.1109/ICCV.2003.1238463.","apa":"Kim, J., Kolmogorov, V., & Zabih, R. (2003). Visual correspondence using energy minimization and mutual information (Vol. 2, pp. 1033–1040). Presented at the ICCV: International Conference on Computer Vision, IEEE. https://doi.org/10.1109/ICCV.2003.1238463","ama":"Kim J, Kolmogorov V, Zabih R. Visual correspondence using energy minimization and mutual information. In: Vol 2. IEEE; 2003:1033-1040. doi:10.1109/ICCV.2003.1238463","short":"J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 1033–1040.","ieee":"J. Kim, V. Kolmogorov, and R. Zabih, “Visual correspondence using energy minimization and mutual information,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 2, pp. 1033–1040."},"title":"Visual correspondence using energy minimization and mutual information","author":[{"first_name":"Junhwan","full_name":"Kim, Junhwan","last_name":"Kim"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov"},{"first_name":"Ramin","last_name":"Zabih","full_name":"Zabih, Ramin"}],"publist_id":"3510","_id":"3174","status":"public","type":"conference","conference":{"name":"ICCV: International Conference on Computer Vision"}},{"_id":"3170","conference":{"name":"ICCV: International Conference on Computer Vision"},"type":"conference","status":"public","date_updated":"2021-01-12T07:41:33Z","citation":{"ama":"Boykov Y, Kolmogorov V. Computing geodesics and minimal surfaces via graph cuts. In: Vol 1. IEEE; 2003:26-33. doi:10.1109/ICCV.2003.1238310","apa":"Boykov, Y., & Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts (Vol. 1, pp. 26–33). Presented at the ICCV: International Conference on Computer Vision, IEEE. https://doi.org/10.1109/ICCV.2003.1238310","ieee":"Y. Boykov and V. Kolmogorov, “Computing geodesics and minimal surfaces via graph cuts,” presented at the ICCV: International Conference on Computer Vision, 2003, vol. 1, pp. 26–33.","short":"Y. Boykov, V. Kolmogorov, in:, IEEE, 2003, pp. 26–33.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. Computing Geodesics and Minimal Surfaces via Graph Cuts. Vol. 1, IEEE, 2003, pp. 26–33, doi:10.1109/ICCV.2003.1238310.","ista":"Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33.","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Computing Geodesics and Minimal Surfaces via Graph Cuts,” 1:26–33. IEEE, 2003. https://doi.org/10.1109/ICCV.2003.1238310."},"extern":1,"author":[{"last_name":"Boykov","full_name":"Boykov, Yuri","first_name":"Yuri"},{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"3511","title":"Computing geodesics and minimal surfaces via graph cuts","abstract":[{"text":"Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D). We show how to build a grid graph and set its edge weights so that the cost of cuts is arbitrarily close to the length (area) of the corresponding contours (surfaces) for any anisotropic Riemannian metric. There are two interesting consequences of this technical result. First, graph cut algorithms can be used to find globally minimum geodesic contours (minimal surfaces in 3D) under arbitrary Riemannian metric for a given set of boundary conditions. Second, we show how to minimize metrication artifacts in existing graph-cut based methods in vision. Theoretically speaking, our work provides an interesting link between several branches of mathematics -differential geometry, integral geometry, and combinatorial optimization. The main technical problem is solved using Cauchy-Crofton formula from integral geometry.","lang":"eng"}],"publisher":"IEEE","quality_controlled":0,"intvolume":" 1","month":"09","year":"2003","publication_status":"published","day":"30","page":"26 - 33","date_created":"2018-12-11T12:01:48Z","doi":"10.1109/ICCV.2003.1238310","date_published":"2003-09-30T00:00:00Z","volume":1},{"title":"Organization of cell assemblies in the hippocampus","publist_id":"2859","author":[{"last_name":"Harris","full_name":"Harris, Kenneth D","first_name":"Kenneth"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036"},{"full_name":"Hirase, Hajima","last_name":"Hirase","first_name":"Hajima"},{"first_name":"George","full_name":"Dragoi, George","last_name":"Dragoi"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"extern":1,"date_updated":"2021-01-12T07:44:04Z","citation":{"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.","chicago":"Harris, Kenneth, Jozsef L Csicsvari, Hajima Hirase, George Dragoi, and György Buzsáki. “Organization of Cell Assemblies in the Hippocampus.” Nature. Nature Publishing Group, 2003. https://doi.org/0.1038/nature01834.","apa":"Harris, K., Csicsvari, J. L., Hirase, H., Dragoi, G., & Buzsáki, G. (2003). Organization of cell assemblies in the hippocampus. Nature. Nature Publishing Group. https://doi.org/0.1038/nature01834","ama":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. Organization of cell assemblies in the hippocampus. Nature. 2003;424(6948):552-556. doi:0.1038/nature01834","ieee":"K. Harris, J. L. Csicsvari, H. Hirase, G. Dragoi, and G. Buzsáki, “Organization of cell assemblies in the hippocampus,” Nature, vol. 424, no. 6948. Nature Publishing Group, pp. 552–556, 2003.","short":"K. Harris, J.L. Csicsvari, H. Hirase, G. Dragoi, G. Buzsáki, Nature 424 (2003) 552–556.","mla":"Harris, Kenneth, et al. “Organization of Cell Assemblies in the Hippocampus.” Nature, vol. 424, no. 6948, Nature Publishing Group, 2003, pp. 552–56, doi:0.1038/nature01834."},"status":"public","type":"journal_article","_id":"3526","volume":424,"issue":"6948","date_published":"2003-07-31T00:00:00Z","doi":"0.1038/nature01834","date_created":"2018-12-11T12:03:47Z","page":"552 - 556","day":"31","publication":"Nature","year":"2003","publication_status":"published","month":"07","intvolume":" 424","quality_controlled":0,"publisher":"Nature Publishing Group","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."}]},{"_id":"3529","type":"journal_article","status":"public","date_updated":"2021-01-12T07:44:05Z","citation":{"apa":"Csicsvari, J. L., Henze, D., Jamieson, B., Harris, K., Sirota, A., Bartho, P., … Buzsáki, G. (2003). Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. American Physiological Society. https://doi.org/10.1152/jn.00116.2003","ama":"Csicsvari JL, Henze D, Jamieson B, et al. Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. 2003;90(2):1314-1323. doi:10.1152/jn.00116.2003","short":"J.L. Csicsvari, D. Henze, B. Jamieson, K. Harris, A. Sirota, P. Bartho, K. Wise, G. Buzsáki, Journal of Neurophysiology 90 (2003) 1314–1323.","ieee":"J. L. Csicsvari et al., “Massively parallel recording of unit and local field potentials with silicon-based electrodes,” Journal of Neurophysiology, vol. 90, no. 2. American Physiological Society, pp. 1314–1323, 2003.","mla":"Csicsvari, Jozsef L., et al. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” Journal of Neurophysiology, vol. 90, no. 2, American Physiological Society, 2003, pp. 1314–23, doi:10.1152/jn.00116.2003.","ista":"Csicsvari JL, Henze D, Jamieson B, Harris K, Sirota A, Bartho P, Wise K, Buzsáki G. 2003. Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. 90(2), 1314–1323.","chicago":"Csicsvari, Jozsef L, Darrell Henze, Brian Jamieson, Kenneth Harris, Anton Sirota, Peter Bartho, Kensall Wise, and György Buzsáki. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” Journal of Neurophysiology. American Physiological Society, 2003. https://doi.org/10.1152/jn.00116.2003."},"extern":1,"publist_id":"2856","author":[{"first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"},{"first_name":"Darrell","last_name":"Henze","full_name":"Henze, Darrell A"},{"first_name":"Brian","last_name":"Jamieson","full_name":"Jamieson, Brian G"},{"first_name":"Kenneth","full_name":"Harris, Kenneth D","last_name":"Harris"},{"first_name":"Anton","full_name":"Sirota, Anton M","last_name":"Sirota"},{"full_name":"Bartho, Peter","last_name":"Bartho","first_name":"Peter"},{"full_name":"Wise, Kensall D","last_name":"Wise","first_name":"Kensall"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"title":"Massively parallel recording of unit and local field potentials with silicon-based electrodes","abstract":[{"text":"Parallel recording of neuronal activity in the behaving animal is a prerequisite for our understanding of neuronal representation and storage of information. Here we describe the development of micro-machined silicon microelectrode arrays for unit and local field recordings. The two-dimensional probes with 96 or 64 recording sites provided high-density recording of unit and field activity with minimal tissue displacement or damage. The on-chip active circuit eliminated movement and other artifacts and greatly reduced the weight of the headgear. The precise geometry of the recording tips allowed for the estimation of the spatial location of the recorded neurons and for high-resolution estimation of extracellular current source density. Action potentials could be simultaneously recorded from the soma and dendrites of the same neurons. Silicon technology is a promising approach for high-density, high-resolution sampling of neuronal activity in both basic research and prosthetic devices.","lang":"eng"}],"publisher":"American Physiological Society","quality_controlled":0,"intvolume":" 90","month":"08","year":"2003","publication_status":"published","publication":"Journal of Neurophysiology","day":"01","page":"1314 - 1323","date_created":"2018-12-11T12:03:48Z","volume":90,"doi":"10.1152/jn.00116.2003","date_published":"2003-08-01T00:00:00Z","issue":"2"},{"citation":{"ieee":"J. L. Csicsvari, B. Jamieson, K. Wise, and G. Buzsáki, “Mechanisms of gamma oscillations in the hippocampus of the behaving rat,” Neuron, vol. 37, no. 2. Elsevier, pp. 311–322, 2003.","short":"J.L. Csicsvari, B. Jamieson, K. Wise, G. Buzsáki, Neuron 37 (2003) 311–322.","ama":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. 2003;37(2):311-322. doi:10.1016/S0896-6273(02)01169-8","apa":"Csicsvari, J. L., Jamieson, B., Wise, K., & Buzsáki, G. (2003). Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. Elsevier. https://doi.org/10.1016/S0896-6273(02)01169-8","mla":"Csicsvari, Jozsef L., et al. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” Neuron, vol. 37, no. 2, Elsevier, 2003, pp. 311–22, doi:10.1016/S0896-6273(02)01169-8.","ista":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. 2003. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. 37(2), 311–322.","chicago":"Csicsvari, Jozsef L, Brian Jamieson, Kensall Wise, and György Buzsáki. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” Neuron. Elsevier, 2003. https://doi.org/10.1016/S0896-6273(02)01169-8."},"date_updated":"2021-01-12T07:44:05Z","extern":1,"author":[{"first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","full_name":"Jozsef Csicsvari","last_name":"Csicsvari"},{"first_name":"Brian","last_name":"Jamieson","full_name":"Jamieson, Brian G"},{"first_name":"Kensall","full_name":"Wise, Kensall D","last_name":"Wise"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"publist_id":"2857","title":"Mechanisms of gamma oscillations in the hippocampus of the behaving rat","_id":"3528","type":"journal_article","status":"public","year":"2003","publication_status":"published","publication":"Neuron","day":"01","page":"311 - 322","date_created":"2018-12-11T12:03:48Z","issue":"2","date_published":"2003-01-01T00:00:00Z","doi":"10.1016/S0896-6273(02)01169-8","volume":37,"abstract":[{"text":"Gamma frequency oscillations (30-100 Hz) have been suggested to underlie various cognitive and motor functions. Here, we examine the generation of gamma oscillation currents in the hippocampus, using two-dimensional, 96-site silicon probes. Two gamma generators were identified, one in the dentate gyrus and another in the CA3-CA1 regions. The coupling strength between the two oscillators varied during both theta and nontheta states. Both pyramidal cells and interneurons were phase-locked to gamma waves. Anatomical connectivity, rather than physical distance, determined the coupling strength of the oscillating neurons. CA3 pyramidal neurons discharged CA3 and CA1 interneurons at latencies indicative of monosynaptic connections. Intrahippocampal gamma oscillation emerges in the CA3 recurrent system, which entrains the CA1 region via its interneurons.","lang":"eng"}],"publisher":"Elsevier","quality_controlled":0,"intvolume":" 37","month":"01"},{"date_created":"2018-12-11T12:03:53Z","volume":100,"date_published":"2003-02-18T00:00:00Z","issue":"4","doi":"10.1073/pnas.0437938100","page":"2065 - 2069","publication":"PNAS","day":"18","publication_status":"published","year":"2003","intvolume":" 100","month":"02","publisher":"National Academy of Sciences","quality_controlled":0,"abstract":[{"lang":"eng","text":"Both neocortical and hippocampal networks organize the firing patterns of their neurons by prominent oscillations during sleep, but the functional role of these rhythms is not well understood. Here, we show a robust correlation of neuronal discharges between the somatosensory cortex and hippocampus on both slow and fine time scales in the mouse and rat. Neuronal bursts in deep cortical layers, associated with sleep spindles and delta waves/slow rhythm, effectively triggered hippocampal discharges related to fast (ripple) oscillations. We hypothesize that oscillation-mediated temporal links coordinate specific information transfer between neocortical and hippocampal cell assemblies. Such a neocortical-hippocampal interplay may be important for memory consolidation."}],"title":"Communication between neocortex and hippocampus during sleep in rodents","publist_id":"2841","author":[{"full_name":"Sirota, Anton M","last_name":"Sirota","first_name":"Anton"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"},{"last_name":"Buhl","full_name":"Buhl, Derek L","first_name":"Derek"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"extern":1,"citation":{"mla":"Sirota, Anton, et al. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” PNAS, vol. 100, no. 4, National Academy of Sciences, 2003, pp. 2065–69, doi:10.1073/pnas.0437938100.","ama":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. Communication between neocortex and hippocampus during sleep in rodents. PNAS. 2003;100(4):2065-2069. doi:10.1073/pnas.0437938100","apa":"Sirota, A., Csicsvari, J. L., Buhl, D., & Buzsáki, G. (2003). Communication between neocortex and hippocampus during sleep in rodents. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.0437938100","short":"A. Sirota, J.L. Csicsvari, D. Buhl, G. Buzsáki, PNAS 100 (2003) 2065–2069.","ieee":"A. Sirota, J. L. Csicsvari, D. Buhl, and G. Buzsáki, “Communication between neocortex and hippocampus during sleep in rodents,” PNAS, vol. 100, no. 4. National Academy of Sciences, pp. 2065–2069, 2003.","chicago":"Sirota, Anton, Jozsef L Csicsvari, Derek Buhl, and György Buzsáki. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” PNAS. National Academy of Sciences, 2003. https://doi.org/10.1073/pnas.0437938100.","ista":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. 2003. Communication between neocortex and hippocampus during sleep in rodents. PNAS. 100(4), 2065–2069."},"date_updated":"2021-01-12T07:44:12Z","status":"public","type":"journal_article","_id":"3543"},{"date_created":"2018-12-11T12:04:08Z","issue":"2","doi":"10.1023/A:1023217515688","date_published":"2003-02-01T00:00:00Z","volume":30,"page":"205 - 232","publication":"Journal of Automated Reasoning","day":"01","publication_status":"published","year":"2003","intvolume":" 30","month":"02","publisher":"Springer","quality_controlled":0,"abstract":[{"text":"Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier.","lang":"eng"}],"title":"A branching time temporal framework for quantitative reasoning","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee"},{"full_name":"Dasgupta, Pallab","last_name":"Dasgupta","first_name":"Pallab"},{"first_name":"Partha","last_name":"Chakrabarti","full_name":"Chakrabarti, Partha P"}],"publist_id":"2790","extern":1,"citation":{"ista":"Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.","chicago":"Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.” Journal of Automated Reasoning. Springer, 2003. https://doi.org/10.1023/A:1023217515688.","short":"K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning 30 (2003) 205–232.","ieee":"K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal framework for quantitative reasoning,” Journal of Automated Reasoning, vol. 30, no. 2. Springer, pp. 205–232, 2003.","apa":"Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2003). A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. Springer. https://doi.org/10.1023/A:1023217515688","ama":"Chatterjee K, Dasgupta P, Chakrabarti P. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 2003;30(2):205-232. doi:10.1023/A:1023217515688","mla":"Chatterjee, Krishnendu, et al. “A Branching Time Temporal Framework for Quantitative Reasoning.” Journal of Automated Reasoning, vol. 30, no. 2, Springer, 2003, pp. 205–32, doi:10.1023/A:1023217515688."},"date_updated":"2021-01-12T07:44:31Z","status":"public","type":"journal_article","_id":"3593"},{"month":"03","intvolume":" 356","publisher":"Universität Bonn, Fachbibliothek Mathematik","quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/~chl/papers/lampert-phd2003.pdf"}],"day":"31","publication":"Bonner Mathematische Schriften","publication_status":"published","year":"2003","date_published":"2003-03-31T00:00:00Z","volume":356,"date_created":"2018-12-11T12:04:34Z","page":"1 - 165","_id":"3678","status":"public","type":"dissertation","extern":1,"date_updated":"2021-01-12T07:45:05Z","citation":{"ieee":"C. Lampert, “The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ,” Universität Bonn, Fachbibliothek Mathematik, 2003.","short":"C. Lampert, The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric , Universität Bonn, Fachbibliothek Mathematik, 2003.","ama":"Lampert C. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Bonner Mathematische Schriften. 2003;356:1-165.","apa":"Lampert, C. (2003). The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Bonner Mathematische Schriften. Universität Bonn, Fachbibliothek Mathematik.","mla":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” Bonner Mathematische Schriften, vol. 356, Universität Bonn, Fachbibliothek Mathematik, 2003, pp. 1–165.","ista":"Lampert C. 2003. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Universität Bonn, Fachbibliothek Mathematik.","chicago":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” Bonner Mathematische Schriften. Universität Bonn, Fachbibliothek Mathematik, 2003."},"title":"The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ","author":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","full_name":"Christoph Lampert","orcid":"0000-0001-8622-7887"}],"publist_id":"2704"},{"_id":"3725","status":"public","type":"journal_article","extern":1,"citation":{"mla":"Janovjak, Harald L., et al. “Unfolding Pathways of Native Bacteriorhodopsin Depend on Temperature.” EMBO Journal, vol. 22, no. 19, Wiley-Blackwell, 2003, pp. 5220–29, doi:10.1093/emboj/cdg509.","apa":"Janovjak, H. L., Kessler, M., Oesterhelt, D., Gaub, H., & Mueller, D. (2003). Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1093/emboj/cdg509","ama":"Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO Journal. 2003;22(19):5220-5229. doi:10.1093/emboj/cdg509","short":"H.L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, D. Mueller, EMBO Journal 22 (2003) 5220–5229.","ieee":"H. L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, and D. Mueller, “Unfolding pathways of native bacteriorhodopsin depend on temperature,” EMBO Journal, vol. 22, no. 19. Wiley-Blackwell, pp. 5220–5229, 2003.","chicago":"Janovjak, Harald L, Max Kessler, Dieter Oesterhelt, Hermann Gaub, and Daniel Mueller. “Unfolding Pathways of Native Bacteriorhodopsin Depend on Temperature.” EMBO Journal. Wiley-Blackwell, 2003. https://doi.org/10.1093/emboj/cdg509.","ista":"Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. 2003. Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO Journal. 22(19), 5220–5229."},"date_updated":"2021-01-12T07:51:45Z","title":"Unfolding pathways of native bacteriorhodopsin depend on temperature","publist_id":"2506","author":[{"first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","full_name":"Harald Janovjak","orcid":"0000-0002-8023-9315"},{"first_name":"Max","full_name":"Kessler, Max","last_name":"Kessler"},{"first_name":"Dieter","last_name":"Oesterhelt","full_name":"Oesterhelt, Dieter"},{"full_name":"Gaub, Hermann","last_name":"Gaub","first_name":"Hermann"},{"last_name":"Mueller","full_name":"Mueller, Daniel J","first_name":"Daniel"}],"abstract":[{"lang":"eng","text":"The combination of high-resolution atomic force microscopy (AFM) imaging and single-molecule force-spectroscopy was employed to unfold single bacteriorhodopsins (BR) from native purple membrane patches at various physiologically relevant temperatures. The unfolding spectra reveal detailed insight into the stability of individual structural elements of BR against mechanical unfolding. Intermittent states in the unfolding process are associated with the stepwise unfolding of alpha-helices, whereas other states are associated with the unfolding of polypeptide loops connecting the alpha-helices. It was found that the unfolding forces of the secondary structures considerably decreased upon increasing the temperature from 8 to 52°C. Associated with this effect, the probability of individual unfolding pathways of BR was significantly influenced by the temperature. At lower temperatures, transmembrane alpha-helices and extracellular polypeptide loops exhibited sufficient stability to individually establish potential barriers against unfolding, whereas they predominantly unfolded collectively at elevated temperatures. This suggests that increasing the temperature decreases the mechanical stability of secondary structural elements and changes molecular interactions between secondary structures, thereby forcing them to act as grouped structures."}],"month":"01","intvolume":" 22","quality_controlled":0,"publisher":"Wiley-Blackwell","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC204492/"}],"oa":1,"day":"01","publication":"EMBO Journal","year":"2003","publication_status":"published","doi":"10.1093/emboj/cdg509","date_published":"2003-01-01T00:00:00Z","issue":"19","volume":22,"date_created":"2018-12-11T12:04:50Z","page":"5220 - 5229"},{"type":"journal_article","status":"public","_id":"3804","author":[{"full_name":"Lien, Cheng-Chang","last_name":"Lien","first_name":"Cheng"},{"last_name":"Jonas","full_name":"Peter Jonas","orcid":"0000-0001-5001-4804","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"2406","title":"Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons","citation":{"chicago":"Lien, Cheng, and Peter M Jonas. “Kv3 Potassium Conductance Is Necessary and Kinetically Optimized for High-Frequency Action Potential Generation in Hippocampal Interneurons.” Journal of Neuroscience. Society for Neuroscience, 2003.","ista":"Lien C, Jonas PM. 2003. Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons. Journal of Neuroscience. 23(6), 2058–68.","mla":"Lien, Cheng, and Peter M. Jonas. “Kv3 Potassium Conductance Is Necessary and Kinetically Optimized for High-Frequency Action Potential Generation in Hippocampal Interneurons.” Journal of Neuroscience, vol. 23, no. 6, Society for Neuroscience, 2003, pp. 2058–68.","ama":"Lien C, Jonas PM. Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons. Journal of Neuroscience. 2003;23(6):2058-2068.","apa":"Lien, C., & Jonas, P. M. (2003). Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons. Journal of Neuroscience. Society for Neuroscience.","ieee":"C. Lien and P. M. Jonas, “Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons,” Journal of Neuroscience, vol. 23, no. 6. Society for Neuroscience, pp. 2058–68, 2003.","short":"C. Lien, P.M. Jonas, Journal of Neuroscience 23 (2003) 2058–68."},"date_updated":"2021-01-12T07:52:19Z","extern":1,"publisher":"Society for Neuroscience","quality_controlled":0,"intvolume":" 23","month":"01","abstract":[{"text":"Kv3 channels are thought to be essential for the fast-spiking (FS) phenotype in GABAergic interneurons, but how these channels confer the ability to generate action potentials (APs) at high frequency is unknown. To address this question, we developed a fast dynamic-clamp system (approximately 50 kHz) that allowed us to add a Kv3 model conductance to CA1 oriens alveus (OA) interneurons in hippocampal slices. Selective pharmacological block of Kv3 channels by 0.3 mm 4-aminopyridine or 1 mm tetraethylammonium ions led to a marked broadening of APs during trains of short stimuli and a reduction in AP frequency during 1 sec stimuli. The addition of artificial Kv3 conductance restored the original AP pattern. Subtraction of Kv3 conductance by dynamic clamp mimicked the effects of the blockers. Application of artificial Kv3 conductance also led to FS in OA interneurons after complete K+ channel block and even induced FS in hippocampal pyramidal neurons in the absence of blockers. Adding artificial Kv3 conductance with altered deactivation kinetics revealed a nonmonotonic relationship between mean AP frequency and deactivation rate, with a maximum slightly above the original value. Insertion of artificial Kv3 conductance with either lowered activation threshold or inactivation also led to a reduction in the mean AP frequency. However, the mechanisms were distinct. Shifting the activation threshold induced adaptation, whereas adding inactivation caused frequency-dependent AP broadening. In conclusion, Kv3 channels are necessary for the FS phenotype of OA interneurons, and several of their gating properties appear to be optimized for high-frequency repetitive activity.","lang":"eng"}],"page":"2058 - 68","date_created":"2018-12-11T12:05:16Z","issue":"6","date_published":"2003-01-01T00:00:00Z","volume":23,"publication_status":"published","year":"2003","publication":"Journal of Neuroscience","day":"01"},{"year":"2003","publication_status":"published","day":"01","publication":"PNAS","page":"8975 - 80","volume":100,"doi":"10.1073/pnas.1432836100","date_published":"2003-01-01T00:00:00Z","issue":"15","date_created":"2018-12-11T12:05:16Z","abstract":[{"text":"To probe exocytosis at a cortical glutamatergic synapse, we made capacitance measurements in whole-cell recorded hippocampal mossy fiber terminals. Evaluation of different methods by using a morphology-based equivalent electrical model revealed that quantitative capacitance measurements are possible in this presynaptic structure. Voltage pulses leading to presynaptic Ca2+ inflow evoked large capacitance signals that showed saturation with increasing pulse duration. The mean peak capacitance increase was 100 fF, corresponding to a pool of approximately 1,400 releasable vesicles. Thus hippocampal mossy fiber synapses have a vesicular "maxipool." Large pool size and rapid vesicle recycling may underlie the uniquely large extent of activity-dependent plasticity in this synapse.","lang":"eng"}],"publisher":"National Academy of Sciences","quality_controlled":0,"month":"01","intvolume":" 100","citation":{"ista":"Hallermann S, Pawlu C, Jonas PM, Heckmann M. 2003. A large pool of releasable vesicles in a cortical glutamatergic synapse. PNAS. 100(15), 8975–80.","chicago":"Hallermann, Stefan, Christian Pawlu, Peter M Jonas, and Manfred Heckmann. “A Large Pool of Releasable Vesicles in a Cortical Glutamatergic Synapse.” PNAS. National Academy of Sciences, 2003. https://doi.org/10.1073/pnas.1432836100.","ama":"Hallermann S, Pawlu C, Jonas PM, Heckmann M. A large pool of releasable vesicles in a cortical glutamatergic synapse. PNAS. 2003;100(15):8975-8980. doi:10.1073/pnas.1432836100","apa":"Hallermann, S., Pawlu, C., Jonas, P. M., & Heckmann, M. (2003). A large pool of releasable vesicles in a cortical glutamatergic synapse. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1432836100","ieee":"S. Hallermann, C. Pawlu, P. M. Jonas, and M. Heckmann, “A large pool of releasable vesicles in a cortical glutamatergic synapse,” PNAS, vol. 100, no. 15. National Academy of Sciences, pp. 8975–80, 2003.","short":"S. Hallermann, C. Pawlu, P.M. Jonas, M. Heckmann, PNAS 100 (2003) 8975–80.","mla":"Hallermann, Stefan, et al. “A Large Pool of Releasable Vesicles in a Cortical Glutamatergic Synapse.” PNAS, vol. 100, no. 15, National Academy of Sciences, 2003, pp. 8975–80, doi:10.1073/pnas.1432836100."},"date_updated":"2021-01-12T07:52:20Z","extern":1,"publist_id":"2405","author":[{"first_name":"Stefan","last_name":"Hallermann","full_name":"Hallermann, Stefan"},{"last_name":"Pawlu","full_name":"Pawlu, Christian","first_name":"Christian"},{"orcid":"0000-0001-5001-4804","full_name":"Peter Jonas","last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M"},{"first_name":"Manfred","full_name":"Heckmann, Manfred","last_name":"Heckmann"}],"title":"A large pool of releasable vesicles in a cortical glutamatergic synapse","_id":"3806","type":"journal_article","status":"public"},{"abstract":[{"text":"Unlike most social insects, many Cardiocondyla ant species have two male morphs: wingless (ergatoid) males, who remain in the natal nest, and winged males who disperse but, strangely, before leaving may also mate within the nest. Whereas ergatoid males are highly intolerant of each other and fight among themselves, they tend to tolerate their winged counterparts. This is despite the fact that these winged males, like ergatoid males, represent mating competition. Why should ergatoid males tolerate their winged rivals? We developed a mathematical model to address this question. Our model focuses on a number of factors likely toinfluence whether ergatoid males are tolerant of winged males: ergatoid male–winged male relatedness, number of virgin queens, number of winged males, and the number of ejaculates a winged male has (winged males are sperm limited, whereas ergatoid males have lifelong spermatogenesis). Surprisingly, we found that increasing the number of virgin queens favors a kill strategy, whereas an increase in the other factors favors a let-live strategy; these predictions appear true for C. obscurior and for a number of other Cardiocondyla species. Two further aspects, unequal insemination success and multiple mating in queens, were also incorporated into the model and predictions made about their effects on toleration of winged males. The model is applicable more generally in species that have dimorphic males, such as some other ants, bees, and fig wasps.","lang":"eng"}],"oa_version":"None","publisher":"Oxford University Press","month":"01","intvolume":" 14","publication_status":"published","year":"2003","day":"01","publication":"Behavioral Ecology","language":[{"iso":"eng"}],"page":"54 - 62","volume":14,"issue":"1","doi":"10.1093/beheco/14.1.54","date_published":"2003-01-01T00:00:00Z","date_created":"2018-12-11T12:05:54Z","_id":"3921","type":"journal_article","status":"public","citation":{"ista":"Anderson C, Cremer S, Heinze J. 2003. Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals. Behavioral Ecology. 14(1), 54–62.","chicago":"Anderson, Carl, Sylvia Cremer, and Jürgen Heinze. “Live and Let Die: Why Fighter Males of the Ant Cardiocondyla Kill Each Other but Tolerate Their Winged Rivals.” Behavioral Ecology. Oxford University Press, 2003. https://doi.org/10.1093/beheco/14.1.54.","ieee":"C. Anderson, S. Cremer, and J. Heinze, “Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals,” Behavioral Ecology, vol. 14, no. 1. Oxford University Press, pp. 54–62, 2003.","short":"C. Anderson, S. Cremer, J. Heinze, Behavioral Ecology 14 (2003) 54–62.","ama":"Anderson C, Cremer S, Heinze J. Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals. Behavioral Ecology. 2003;14(1):54-62. doi:10.1093/beheco/14.1.54","apa":"Anderson, C., Cremer, S., & Heinze, J. (2003). Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals. Behavioral Ecology. Oxford University Press. https://doi.org/10.1093/beheco/14.1.54","mla":"Anderson, Carl, et al. “Live and Let Die: Why Fighter Males of the Ant Cardiocondyla Kill Each Other but Tolerate Their Winged Rivals.” Behavioral Ecology, vol. 14, no. 1, Oxford University Press, 2003, pp. 54–62, doi:10.1093/beheco/14.1.54."},"date_updated":"2021-01-12T07:53:13Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Anderson, Carl","last_name":"Anderson","first_name":"Carl"},{"last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia"},{"last_name":"Heinze","full_name":"Heinze, Jürgen","first_name":"Jürgen"}],"publist_id":"2233","title":"Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"ama":"Cremer S, Heinze J. Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants. Current Biology. 2003;13(3):219-223. doi:10.1016/S0960-9822(03)00012-5","apa":"Cremer, S., & Heinze, J. (2003). Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants. Current Biology. Cell Press. https://doi.org/10.1016/S0960-9822(03)00012-5","ieee":"S. Cremer and J. Heinze, “Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants,” Current Biology, vol. 13, no. 3. Cell Press, pp. 219–223, 2003.","short":"S. Cremer, J. Heinze, Current Biology 13 (2003) 219–223.","mla":"Cremer, Sylvia, and Jürgen Heinze. “Stress Grows Wings: Environmental Induction of Winged Dispersal Males in Cardiocondyla Ants.” Current Biology, vol. 13, no. 3, Cell Press, 2003, pp. 219–23, doi:10.1016/S0960-9822(03)00012-5.","ista":"Cremer S, Heinze J. 2003. Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants. Current Biology. 13(3), 219–223.","chicago":"Cremer, Sylvia, and Jürgen Heinze. “Stress Grows Wings: Environmental Induction of Winged Dispersal Males in Cardiocondyla Ants.” Current Biology. Cell Press, 2003. https://doi.org/10.1016/S0960-9822(03)00012-5."},"date_updated":"2021-01-12T07:53:13Z","title":"Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants","author":[{"last_name":"Cremer","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"}],"publist_id":"2234","_id":"3922","status":"public","type":"journal_article","publication":"Current Biology","language":[{"iso":"eng"}],"day":"04","year":"2003","publication_status":"published","date_created":"2018-12-11T12:05:54Z","date_published":"2003-02-04T00:00:00Z","doi":"10.1016/S0960-9822(03)00012-5","volume":13,"issue":"3","page":"219 - 223","oa_version":"None","abstract":[{"text":"Dispersal is advantageous, but, at the same time, it implies high costs and risks. Due to these counteracting selection pressures, many species evolved dispersal polymorphisms, which, in ants, are typically restricted to the female sex (queens). Male polymorphism is presently only known from a few genera, such as Cardiocondyla, in which winged dispersing males coexist with wingless fighter males that mate exclusively inside their maternal nests. We studied the developmental mechanisms underlying these alternative male morphs and found that, first, male dimorphism is not genetically determined, but is induced by environmental conditions (decreasing temperature and density). Second, male morph is not yet fixed at the egg stage, but it differentiates during larval development. This flexible developmental pattern of male morphs allows Cardiocondyla ant colonies to react quickly to changes in their environment. Under good conditions, they invest exclusively in philopatric wingless males. But, when environmental conditions turn bad, colonies start to produce winged dispersal males, even though these males require a many times higher investment by the colony than their much smaller wingless counterparts. Cardiocondyla ants share this potential of optimal resource allocation with other colonial animals and some seed dimorphic plants.","lang":"eng"}],"intvolume":" 13","month":"02","publisher":"Cell Press"},{"language":[{"iso":"eng"}],"publication":"Blick in die Wissenschaft","day":"01","year":"2003","publication_status":"published","date_created":"2018-12-11T12:05:53Z","volume":12,"issue":"15","date_published":"2003-01-01T00:00:00Z","page":"32 - 36","oa_version":"None","abstract":[{"lang":"eng","text":"Male dimorphism is not genetically determined, but is induced by environmental conditions particularly decreasing temperature and density."}],"intvolume":" 12","month":"01","publisher":"Schnell und Steiner","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","citation":{"mla":"Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord: Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft, vol. 12, no. 15, Schnell und Steiner, 2003, pp. 32–36.","short":"S. Cremer, J. Heinze, Blick in Die Wissenschaft 12 (2003) 32–36.","ieee":"S. Cremer and J. Heinze, “Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen,” Blick in die Wissenschaft, vol. 12, no. 15. Schnell und Steiner, pp. 32–36, 2003.","ama":"Cremer S, Heinze J. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 2003;12(15):32-36.","apa":"Cremer, S., & Heinze, J. (2003). Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in Die Wissenschaft. Schnell und Steiner.","chicago":"Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord: Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft. Schnell und Steiner, 2003.","ista":"Cremer S, Heinze J. 2003. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 12(15), 32–36."},"date_updated":"2021-01-12T07:53:11Z","title":"Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen","publist_id":"2235","author":[{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","last_name":"Cremer"},{"first_name":"Jürgen","full_name":"Heinze, Jürgen","last_name":"Heinze"}],"_id":"3917","status":"public","type":"journal_article"},{"date_created":"2018-12-11T12:08:44Z","date_published":"2003-12-01T00:00:00Z","page":"1 - 201","language":[{"iso":"eng"}],"day":"01","publication_status":"published","year":"2003","month":"12","publisher":"University of California, Berkeley","oa_version":"None","abstract":[{"lang":"eng","text":"Methods for the formal specification and verification of systems are indispensible for the development of complex yet correct systems. In formal verification, the designer describes the system in a modeling language with a well-defined semantics, and this system description is analyzed against a set of correctness requirements. Model checking is an algorithmic technique to check that a system description indeed satisfies correctness requirements given as logical specifications. While successful in hardware verification, the potential for model checking for software and embedded systems has not yet been realized. This is because traditional model checking focuses on systems modeled as finite state-transition graphs. While a natural model for hardware (especially synchronous hardware), state-transition graphs often do not capture software and embedded systems at an appropriate level of granularity. This dissertation considers two orthogonal extensions to finite state-transition graphs making model checking techniques applicable to both a wider class of systems and a wider class of properties.\r\n\r\nThe first direction is an extension to infinite-state structures finitely represented using constraints and operations on constraints. Infinite state arises when we wish to model variables with unbounded range (e.g., integers), or data structures, or real time. We provide a uniform framework of symbolic region algebras to study model checking of infinite-state systems. We also provide sufficient language-independent termination conditions for symbolic model checking algorithms on infinite state systems.\r\n\r\nThe second direction supplements verification with game theoretic reasoning. Games are natural models for interactions between components. We study game theoretic behavior with winning conditions given by temporal logic objectives both in the deterministic and in the probabilistic context. For deterministic games, we provide an extremal model characterization of fixpoint algorithms that link solutions of verification problems to solutions for games. For probabilistic games we study fixpoint characterization of winning probabilities for games with omega-regular winning objectives, and construct (epsilon-)optimal winning strategies."}],"title":"Symbolic algorithms for verification and control","article_processing_charge":"No","publist_id":"313","author":[{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","date_updated":"2021-01-12T07:56:49Z","citation":{"chicago":"Majumdar, Ritankar. “Symbolic Algorithms for Verification and Control.” University of California, Berkeley, 2003.","ista":"Majumdar R. 2003. Symbolic algorithms for verification and control. University of California, Berkeley.","mla":"Majumdar, Ritankar. Symbolic Algorithms for Verification and Control. University of California, Berkeley, 2003, pp. 1–201.","short":"R. Majumdar, Symbolic Algorithms for Verification and Control, University of California, Berkeley, 2003.","ieee":"R. Majumdar, “Symbolic algorithms for verification and control,” University of California, Berkeley, 2003.","ama":"Majumdar R. Symbolic algorithms for verification and control. 2003:1-201.","apa":"Majumdar, R. (2003). Symbolic algorithms for verification and control. University of California, Berkeley."},"supervisor":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"status":"public","type":"dissertation","_id":"4416"},{"type":"dissertation","status":"public","_id":"4425","publist_id":"305","author":[{"last_name":"Horowitz","full_name":"Horowitz, Benjamin","first_name":"Benjamin"}],"article_processing_charge":"No","title":"Giotto: A time-triggered language for embedded programming","supervisor":[{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2021-01-12T07:56:53Z","citation":{"ista":"Horowitz B. 2003. Giotto: A time-triggered language for embedded programming. University of California, Berkeley.","chicago":"Horowitz, Benjamin. “Giotto: A Time-Triggered Language for Embedded Programming.” University of California, Berkeley, 2003.","apa":"Horowitz, B. (2003). Giotto: A time-triggered language for embedded programming. University of California, Berkeley.","ama":"Horowitz B. Giotto: A time-triggered language for embedded programming. 2003:1-237.","ieee":"B. Horowitz, “Giotto: A time-triggered language for embedded programming,” University of California, Berkeley, 2003.","short":"B. Horowitz, Giotto: A Time-Triggered Language for Embedded Programming, University of California, Berkeley, 2003.","mla":"Horowitz, Benjamin. Giotto: A Time-Triggered Language for Embedded Programming. University of California, Berkeley, 2003, pp. 1–237."},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"University of California, Berkeley","month":"10","abstract":[{"lang":"eng","text":"Giotto provides a time-triggered programmer’s model for the implementation of embedded control systems with hard real-time constraints. Giotto’s precise semantics and predictabil- ity make it suitable for safety-critical applications.\r\nGiotto is based around the idea that time-triggered task invocation together with time-triggered mode switching can form a useful programming model for real-time systems. To substantiate this claim, we describe the use of Giotto to refactor the software of a small, autonomous helicopter. The ease with which Giotto expresses the existing software provides evidence that Giotto is an appropriate programming language for control systems.\r\nSince Giotto is a real-time programming language, ensuring that Giotto programs meet their deadlines is crucial. To study precedence-constrained Giotto scheduling, we first examine single-mode, single-processor scheduling. We extend to an infinite, periodic setting the classical problem of meeting deadlines for a set of tasks with release times, deadlines, precedence constraints, and preemption. We then develop an algorithm for scheduling Giotto programs on a single processor by representing Giotto programs as instances of the extended scheduling problem.\r\nNext, we study multi-mode, single-processor Giotto scheduling. This problem is different from classical scheduling problems, since in our precedence-constrained approach, the deadlines of tasks may vary depending on the mode switching behavior of the program. We present conditional scheduling models which capture this varying-deadline behavior. We develop polynomial-time algorithms for some conditional scheduling models, and prove oth- ers to be computationally hard. We show how to represent multi-mode Giotto programs as instances of the model, resulting in an algorithm for scheduling multi-mode Giotto programs on a single processor.\r\nFinally, we show that the problem of scheduling Giotto programs for multiple net- worked processors is strongly NP-hard."}],"oa_version":"None","page":"1 - 237","date_published":"2003-10-01T00:00:00Z","date_created":"2018-12-11T12:08:47Z","year":"2003","publication_status":"published","day":"01","language":[{"iso":"eng"}]},{"month":"06","intvolume":" 36","quality_controlled":0,"publisher":"IOP Publishing Ltd.","abstract":[{"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.","lang":"eng"}],"volume":36,"doi":"10.1088/0953-4075/36/12/306","issue":"12","date_published":"2003-06-28T00:00:00Z","date_created":"2018-12-11T11:47:16Z","page":"2455 - 2463","day":"28","publication":"Journal of Physics B: Atomic, Molecular and Optical Physics","publication_status":"published","year":"2003","status":"public","type":"journal_article","_id":"576","title":"Free expansion of two-dimensional condensates with a vortex","author":[{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","last_name":"Hosten","full_name":"Onur Hosten","orcid":"0000-0002-2031-204X"},{"first_name":"Patrizia","full_name":"Vignolo, Patrizia","last_name":"Vignolo"},{"first_name":"Anna","full_name":"Minguzzi, Anna","last_name":"Minguzzi"},{"last_name":"Tanatar","full_name":"Tanatar, Bilal","first_name":"Bilal"},{"first_name":"Mario","last_name":"Tosi","full_name":"Tosi, Mario P"}],"publist_id":"7239","extern":1,"citation":{"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.","chicago":"Hosten, Onur, Patrizia Vignolo, Anna Minguzzi, Bilal Tanatar, and Mario Tosi. “Free Expansion of Two-Dimensional Condensates with a Vortex.” Journal of Physics B: Atomic, Molecular and Optical Physics. IOP Publishing Ltd., 2003. https://doi.org/10.1088/0953-4075/36/12/306.","short":"O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, M. Tosi, Journal of Physics B: Atomic, Molecular and Optical Physics 36 (2003) 2455–2463.","ieee":"O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, and M. Tosi, “Free expansion of two-dimensional condensates with a vortex,” Journal of Physics B: Atomic, Molecular and Optical Physics, vol. 36, no. 12. IOP Publishing Ltd., pp. 2455–2463, 2003.","apa":"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. IOP Publishing Ltd. https://doi.org/10.1088/0953-4075/36/12/306","ama":"Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. Free expansion of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical Physics. 2003;36(12):2455-2463. doi:10.1088/0953-4075/36/12/306","mla":"Hosten, Onur, et al. “Free Expansion of Two-Dimensional Condensates with a Vortex.” Journal of Physics B: Atomic, Molecular and Optical Physics, vol. 36, no. 12, IOP Publishing Ltd., 2003, pp. 2455–63, doi:10.1088/0953-4075/36/12/306."},"date_updated":"2021-01-12T08:03:20Z"},{"_id":"6156","type":"journal_article","status":"public","citation":{"mla":"Rogers, Candida, et al. “Inhibition of Caenorhabditis Elegans Social Feeding by FMRFamide-Related Peptide Activation of NPR-1.” Nature Neuroscience, vol. 6, no. 11, Springer Nature, 2003, pp. 1178–85, doi:10.1038/nn1140.","apa":"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. Springer Nature. https://doi.org/10.1038/nn1140","ama":"Rogers C, Reale V, Kim K, et al. Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1. Nature Neuroscience. 2003;6(11):1178-1185. doi:10.1038/nn1140","ieee":"C. Rogers et al., “Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1,” Nature Neuroscience, vol. 6, no. 11. Springer Nature, pp. 1178–1185, 2003.","short":"C. Rogers, V. Reale, K. Kim, H. Chatwin, C. Li, P. Evans, M. de Bono, Nature Neuroscience 6 (2003) 1178–1185.","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.” Nature Neuroscience. Springer Nature, 2003. https://doi.org/10.1038/nn1140.","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."},"date_updated":"2021-01-12T08:06:25Z","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Rogers, Candida","last_name":"Rogers","first_name":"Candida"},{"first_name":"Vincenzina","last_name":"Reale","full_name":"Reale, Vincenzina"},{"last_name":"Kim","full_name":"Kim, Kyuhyung","first_name":"Kyuhyung"},{"first_name":"Heather","last_name":"Chatwin","full_name":"Chatwin, Heather"},{"last_name":"Li","full_name":"Li, Chris","first_name":"Chris"},{"full_name":"Evans, Peter","last_name":"Evans","first_name":"Peter"},{"first_name":"Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","last_name":"de Bono"}],"external_id":{"pmid":["14555955"]},"title":"Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1","abstract":[{"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.","lang":"eng"}],"oa_version":"None","pmid":1,"publisher":"Springer Nature","quality_controlled":"1","month":"10","intvolume":" 6","publication_identifier":{"issn":["1097-6256","1546-1726"]},"publication_status":"published","year":"2003","day":"12","publication":"Nature Neuroscience","language":[{"iso":"eng"}],"page":"1178-1185","date_published":"2003-10-12T00:00:00Z","issue":"11","volume":6,"doi":"10.1038/nn1140","date_created":"2019-03-21T09:47:53Z"},{"volume":54,"doi":"10.1002/neu.10162","date_published":"2003-01-01T00:00:00Z","issue":"1","date_created":"2019-03-21T09:52:31Z","page":"78-92","day":"01","publication":"Journal of Neurobiology","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0022-3034","1097-4695"]},"year":"2003","publication_status":"published","month":"01","intvolume":" 54","quality_controlled":"1","publisher":"Wiley","pmid":1,"oa_version":"None","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"}],"title":"Molecular approaches to aggregation behavior and social attachment","author":[{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","first_name":"Mario","full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","last_name":"de Bono"}],"external_id":{"pmid":["12486699"]},"extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T08:06:26Z","citation":{"ista":"de Bono M. 2003. Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. 54(1), 78–92.","chicago":"Bono, Mario de. “Molecular Approaches to Aggregation Behavior and Social Attachment.” Journal of Neurobiology. Wiley, 2003. https://doi.org/10.1002/neu.10162.","apa":"de Bono, M. (2003). Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. Wiley. https://doi.org/10.1002/neu.10162","ama":"de Bono M. Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. 2003;54(1):78-92. doi:10.1002/neu.10162","short":"M. de Bono, Journal of Neurobiology 54 (2003) 78–92.","ieee":"M. de Bono, “Molecular approaches to aggregation behavior and social attachment,” Journal of Neurobiology, vol. 54, no. 1. Wiley, pp. 78–92, 2003.","mla":"de Bono, Mario. “Molecular Approaches to Aggregation Behavior and Social Attachment.” Journal of Neurobiology, vol. 54, no. 1, Wiley, 2003, pp. 78–92, doi:10.1002/neu.10162."},"status":"public","type":"journal_article","_id":"6157"},{"publist_id":"6803","author":[{"full_name":"Sunyaev, Shamil R","last_name":"Sunyaev","first_name":"Shamil"},{"first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Fyodor Kondrashov","orcid":"0000-0001-8243-4694","last_name":"Kondrashov"},{"full_name":"Bork, Peer","last_name":"Bork","first_name":"Peer"},{"last_name":"Ramensky","full_name":"Ramensky, Vasily","first_name":"Vasily"}],"title":"Impact of selection, mutation rate and genetic drift on human genetic variation","date_updated":"2021-01-12T08:19:29Z","citation":{"chicago":"Sunyaev, Shamil, Fyodor Kondrashov, Peer Bork, and Vasily Ramensky. “Impact of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” Human Molecular Genetics. Oxford University Press, 2003. https://doi.org/10.1093/hmg/ddg359.","ista":"Sunyaev S, Kondrashov F, Bork P, Ramensky V. 2003. Impact of selection, mutation rate and genetic drift on human genetic variation. Human Molecular Genetics. 12(24), 3325–3330.","mla":"Sunyaev, Shamil, et al. “Impact of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” Human Molecular Genetics, vol. 12, no. 24, Oxford University Press, 2003, pp. 3325–30, doi:10.1093/hmg/ddg359.","apa":"Sunyaev, S., Kondrashov, F., Bork, P., & Ramensky, V. (2003). Impact of selection, mutation rate and genetic drift on human genetic variation. Human Molecular Genetics. Oxford University Press. https://doi.org/10.1093/hmg/ddg359","ama":"Sunyaev S, Kondrashov F, Bork P, Ramensky V. Impact of selection, mutation rate and genetic drift on human genetic variation. Human Molecular Genetics. 2003;12(24):3325-3330. doi:10.1093/hmg/ddg359","ieee":"S. Sunyaev, F. Kondrashov, P. Bork, and V. Ramensky, “Impact of selection, mutation rate and genetic drift on human genetic variation,” Human Molecular Genetics, vol. 12, no. 24. Oxford University Press, pp. 3325–3330, 2003.","short":"S. Sunyaev, F. Kondrashov, P. Bork, V. Ramensky, Human Molecular Genetics 12 (2003) 3325–3330."},"extern":1,"type":"journal_article","status":"public","_id":"847","page":"3325 - 3330","volume":12,"issue":"24","date_published":"2003-12-15T00:00:00Z","doi":"10.1093/hmg/ddg359","date_created":"2018-12-11T11:48:49Z","year":"2003","publication_status":"published","day":"15","publication":"Human Molecular Genetics","quality_controlled":0,"publisher":"Oxford University Press","month":"12","intvolume":" 12","abstract":[{"lang":"eng","text":"The accumulation of genome-wide information on single nucleotide polymorphisms in humans provides an unprecedented opportunity to detect the evolutionary forces responsible for heterogeneity of the level of genetic variability across loci. Previous studies have shown that history of recombination events has produced long haplotype blocks in the human genome, which contribute to this heterogeneity. Other factors, however, such as natural selection or the heterogeneity of mutation rates across loci, may also lead to heterogeneity of genetic variability. We compared synonymous and non-synonymous variability within human genes with their divergence from murine orthologs. We separately analyzed the non-synonymous variants predicted to damage protein structure or function and the variants predicted to be functionally benign. The predictions were based on comparative sequence analysis and, in some cases, on the analysis of protein structure. A strong correlation between non-synonymous, benign variability and non-synonymous human-mouse divergence suggests that selection played an important role in shaping the pattern of variability in coding regions of human genes. However, the lack of correlation between deleterious variability and evolutionary divergence shows that a substantial proportion of the observed non-synonymous single-nucleotide polymorphisms reduces fitness and never reaches fixation. Evolutionary and medical implications of the impact of selection on human polymorphisms are discussed."}],"acknowledgement":"We are grateful to Alexey Kondrashov and Alison Wellman for the careful reading of the manuscript and providing us with their valuable comments."},{"quality_controlled":0,"publisher":"Elsevier","intvolume":" 19","month":"01","abstract":[{"text":"Alternative splicing is thought to be a major source of functional diversity in animal proteins. We analyzed the evolutionary conservation of proteins encoded by alternatively spliced genes and predicted the ancestral state for 73 cases of alternative splicing (25 insertions and 48 deletions). The amino acid sequences of most of the inserts in proteins produced by alternative splicing are as conserved as the surrounding sequences. Thus, alternative splicing often creates novel isoforms by the insertion of new, functional protein sequences that probably originated from noncoding sequences of introns.","lang":"eng"}],"acknowledgement":"We thank Peer Bork, Mikhail Gelfand, Alexey Kondrashov, David Lipman and Shamil Sunyaev for critical reading of the manuscript and useful suggestions and the Koonin group members for helpful discussions.","page":"115 - 119","date_created":"2018-12-11T11:48:58Z","volume":19,"issue":"3","doi":"10.1016/S0168-9525(02)00029-X","date_published":"2003-01-01T00:00:00Z","year":"2003","publication_status":"published","publication":"Trends in Genetics","day":"01","type":"journal_article","status":"public","_id":"876","publist_id":"6776","author":[{"orcid":"0000-0001-8243-4694","full_name":"Fyodor Kondrashov","last_name":"Kondrashov","first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Koonin","full_name":"Koonin, Eugene V","first_name":"Eugene"}],"title":"Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences","citation":{"ieee":"F. Kondrashov and E. Koonin, “Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences,” Trends in Genetics, vol. 19, no. 3. Elsevier, pp. 115–119, 2003.","short":"F. Kondrashov, E. Koonin, Trends in Genetics 19 (2003) 115–119.","ama":"Kondrashov F, Koonin E. Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. Trends in Genetics. 2003;19(3):115-119. doi:10.1016/S0168-9525(02)00029-X","apa":"Kondrashov, F., & Koonin, E. (2003). Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. Trends in Genetics. Elsevier. https://doi.org/10.1016/S0168-9525(02)00029-X","mla":"Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing: Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.” Trends in Genetics, vol. 19, no. 3, Elsevier, 2003, pp. 115–19, doi:10.1016/S0168-9525(02)00029-X.","ista":"Kondrashov F, Koonin E. 2003. Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences. Trends in Genetics. 19(3), 115–119.","chicago":"Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing: Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.” Trends in Genetics. Elsevier, 2003. https://doi.org/10.1016/S0168-9525(02)00029-X."},"date_updated":"2021-01-12T08:20:58Z","extern":1},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"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.” Current Biology. Elsevier, 2003. https://doi.org/10.1016/j.cub.2003.11.052.","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.","mla":"Cao, Xiaofeng, et al. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed DNA Methylation.” Current Biology, vol. 13, no. 24, Elsevier, 2003, pp. 2212–17, doi:10.1016/j.cub.2003.11.052.","ama":"Cao X, Aufsatz W, Zilberman D, et al. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. Current Biology. 2003;13(24):2212-2217. doi:10.1016/j.cub.2003.11.052","apa":"Cao, X., Aufsatz, W., Zilberman, D., Mette, M. F., Huang, M. S., Matzke, M., & Jacobsen, S. E. (2003). Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2003.11.052","short":"X. Cao, W. Aufsatz, D. Zilberman, M.F. Mette, M.S. Huang, M. Matzke, S.E. Jacobsen, Current Biology 13 (2003) 2212–2217.","ieee":"X. Cao et al., “Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation,” Current Biology, vol. 13, no. 24. Elsevier, pp. 2212–2217, 2003."},"title":"Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation","author":[{"full_name":"Cao, Xiaofeng","last_name":"Cao","first_name":"Xiaofeng"},{"full_name":"Aufsatz, Werner","last_name":"Aufsatz","first_name":"Werner"},{"last_name":"Zilberman","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"},{"last_name":"Mette","full_name":"Mette, M.Florian","first_name":"M.Florian"},{"full_name":"Huang, Michael S.","last_name":"Huang","first_name":"Michael S."},{"first_name":"Marjori","last_name":"Matzke","full_name":"Matzke, Marjori"},{"last_name":"Jacobsen","full_name":"Jacobsen, Steven E.","first_name":"Steven E."}],"external_id":{"pmid":["14680640"]},"article_processing_charge":"No","publisher":"Elsevier","quality_controlled":"1","oa":1,"day":"16","publication":"Current Biology","year":"2003","date_published":"2003-12-16T00:00:00Z","doi":"10.1016/j.cub.2003.11.052","date_created":"2021-06-07T10:43:02Z","page":"2212-2217","_id":"9495","status":"public","type":"journal_article","article_type":"original","extern":"1","date_updated":"2021-12-14T08:41:38Z","department":[{"_id":"DaZi"}],"oa_version":"Published Version","pmid":1,"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."}],"month":"12","intvolume":" 13","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1016/j.cub.2003.11.052","open_access":"1"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"publication_status":"published","volume":13,"issue":"24"},{"date_updated":"2021-01-12T08:19:50Z","citation":{"mla":"Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for Cyclicity of Elementary Polycycles.” Inventiones Mathematicae, vol. 151, no. 3, Springer Nature, 2003, pp. 451–512, doi:10.1007/s00222-002-0244-9.","ama":"Kaloshin V. The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones mathematicae. 2003;151(3):451-512. doi:10.1007/s00222-002-0244-9","apa":"Kaloshin, V. (2003). The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-002-0244-9","ieee":"V. Kaloshin, “The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles,” Inventiones mathematicae, vol. 151, no. 3. Springer Nature, pp. 451–512, 2003.","short":"V. Kaloshin, Inventiones Mathematicae 151 (2003) 451–512.","chicago":"Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for Cyclicity of Elementary Polycycles.” Inventiones Mathematicae. Springer Nature, 2003. https://doi.org/10.1007/s00222-002-0244-9.","ista":"Kaloshin V. 2003. The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones mathematicae. 151(3), 451–512."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","article_processing_charge":"No","author":[{"full_name":"Kaloshin, Vadim","orcid":"0000-0002-6051-2628","last_name":"Kaloshin","first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425"}],"title":"The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles","_id":"8519","article_type":"original","type":"journal_article","keyword":["General Mathematics"],"status":"public","publication_status":"published","year":"2003","publication_identifier":{"issn":["0020-9910","1432-1297"]},"publication":"Inventiones mathematicae","language":[{"iso":"eng"}],"day":"01","page":"451-512","date_created":"2020-09-18T10:49:26Z","issue":"3","volume":151,"doi":"10.1007/s00222-002-0244-9","date_published":"2003-03-01T00:00:00Z","oa_version":"None","quality_controlled":"1","publisher":"Springer Nature","intvolume":" 151","month":"03"},{"citation":{"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.","chicago":"Zilberman, Daniel, Xiaofeng Cao, and Steven E. Jacobsen. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science. American Association for the Advancement of Science, 2003. https://doi.org/10.1126/science.1079695.","ama":"Zilberman D, Cao Xiaofeng, Jacobsen SE. ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. Science. 2003;299(5607):716-719. doi:10.1126/science.1079695","apa":"Zilberman, D., Cao, Xiaofeng, & Jacobsen, S. E. (2003). ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1079695","short":"D. Zilberman, Xiaofeng Cao, S.E. Jacobsen, Science 299 (2003) 716–719.","ieee":"D. Zilberman, Xiaofeng Cao, and S. E. Jacobsen, “ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation,” Science, vol. 299, no. 5607. American Association for the Advancement of Science, pp. 716–719, 2003.","mla":"Zilberman, Daniel, et al. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science, vol. 299, no. 5607, American Association for the Advancement of Science, 2003, pp. 716–19, doi:10.1126/science.1079695."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["12522258"]},"article_processing_charge":"No","author":[{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","first_name":"Daniel","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","last_name":"Zilberman"},{"first_name":" Xiaofeng","full_name":"Cao, Xiaofeng","last_name":"Cao"},{"first_name":"Steven E.","last_name":"Jacobsen","full_name":"Jacobsen, Steven E."}],"title":"ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation","year":"2003","publication":"Science","day":"31","page":"716-719","date_created":"2021-06-04T11:26:26Z","date_published":"2003-01-31T00:00:00Z","doi":"10.1126/science.1079695","quality_controlled":"1","publisher":"American Association for the Advancement of Science","date_updated":"2021-12-14T08:43:30Z","extern":"1","department":[{"_id":"DaZi"}],"_id":"9455","type":"journal_article","article_type":"original","keyword":["Multidisciplinary"],"status":"public","publication_status":"published","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"language":[{"iso":"eng"}],"volume":299,"issue":"5607","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"}],"pmid":1,"oa_version":"None","scopus_import":"1","intvolume":" 299","month":"01"},{"type":"conference","conference":{"start_date":"2003-06-30","location":"Eindhoven, The Netherlands","end_date":"2003-07-04","name":"ICALP: Automata, Languages and Programming"},"status":"public","_id":"4628","date_updated":"2023-07-26T13:07:31Z","extern":"1","scopus_import":"1","alternative_title":["LNCS"],"month":"06","intvolume":" 2719","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 < a < 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."}],"oa_version":"None","volume":2719,"publication_identifier":{"isbn":["9783540404934"]},"publication_status":"published","language":[{"iso":"eng"}],"author":[{"last_name":"De Alfaro","full_name":"De Alfaro, Luca","first_name":"Luca"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"publist_id":"77","article_processing_charge":"No","title":"Discounting the future in systems theory","citation":{"ieee":"L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Discounting the future in systems theory,” in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 1022–1037.","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.","apa":"De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2003). Discounting the future in systems theory. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (Vol. 2719, pp. 1022–1037). Eindhoven, The Netherlands: Springer. https://doi.org/10.1007/3-540-45061-0_79","ama":"De Alfaro L, Henzinger TA, Majumdar R. Discounting the future in systems theory. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming. Vol 2719. Springer; 2003:1022-1037. doi:10.1007/3-540-45061-0_79","mla":"De Alfaro, Luca, et al. “Discounting the Future in Systems Theory.” Proceedings of the 30th International Colloquium on Automata, Languages and Programming, vol. 2719, Springer, 2003, pp. 1022–37, doi:10.1007/3-540-45061-0_79.","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.","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Discounting the Future in Systems Theory.” In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, 2719:1022–37. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_79."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publisher":"Springer","quality_controlled":"1","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.","page":"1022 - 1037","date_published":"2003-06-25T00:00:00Z","doi":"10.1007/3-540-45061-0_79","date_created":"2018-12-11T12:09:50Z","year":"2003","day":"25","publication":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming"},{"citation":{"mla":"Michrowska, Anna, et al. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” Tetrahedron, vol. 59, no. 25, Elsevier, 2003, pp. 4525–31, doi:10.1016/s0040-4020(03)00682-3.","ieee":"A. Michrowska, M. Bieniek, M. Kim, R. Klajn, and K. Grela, “Cross-metathesis reaction of vinyl sulfones and sulfoxides,” Tetrahedron, vol. 59, no. 25. Elsevier, pp. 4525–4531, 2003.","short":"A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003) 4525–4531.","apa":"Michrowska, A., Bieniek, M., Kim, M., Klajn, R., & Grela, K. (2003). Cross-metathesis reaction of vinyl sulfones and sulfoxides. Tetrahedron. Elsevier. https://doi.org/10.1016/s0040-4020(03)00682-3","ama":"Michrowska A, Bieniek M, Kim M, Klajn R, Grela K. Cross-metathesis reaction of vinyl sulfones and sulfoxides. Tetrahedron. 2003;59(25):4525-4531. doi:10.1016/s0040-4020(03)00682-3","chicago":"Michrowska, Anna, Michał Bieniek, Mikhail Kim, Rafal Klajn, and Karol Grela. “Cross-Metathesis Reaction of Vinyl Sulfones and Sulfoxides.” Tetrahedron. Elsevier, 2003. https://doi.org/10.1016/s0040-4020(03)00682-3.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"full_name":"Michrowska, Anna","last_name":"Michrowska","first_name":"Anna"},{"last_name":"Bieniek","full_name":"Bieniek, Michał","first_name":"Michał"},{"first_name":"Mikhail","last_name":"Kim","full_name":"Kim, Mikhail"},{"first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","full_name":"Klajn, Rafal"},{"full_name":"Grela, Karol","last_name":"Grela","first_name":"Karol"}],"title":"Cross-metathesis reaction of vinyl sulfones and sulfoxides","publisher":"Elsevier","quality_controlled":"1","year":"2003","publication":"Tetrahedron","day":"16","page":"4525-4531","date_created":"2023-08-01T10:39:34Z","doi":"10.1016/s0040-4020(03)00682-3","date_published":"2003-06-16T00:00:00Z","_id":"13436","type":"journal_article","article_type":"original","keyword":["Organic Chemistry","Drug Discovery","Biochemistry"],"status":"public","date_updated":"2023-08-08T12:44:17Z","extern":"1","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","scopus_import":"1","intvolume":" 59","month":"06","publication_status":"published","publication_identifier":{"eissn":["1464-5416"],"issn":["0040-4020"]},"language":[{"iso":"eng"}],"issue":"25","volume":59},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"mla":"Chakrabarti, Arindam, et al. “Resource Interfaces.” Third International Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 117–33, doi:10.1007/978-3-540-45212-6_9.","apa":"Chakrabarti, A., De Alfaro, L., Henzinger, T. A., & Stoelinga, M. (2003). Resource interfaces. In Third International Conference on Embedded Software (Vol. 2855, pp. 117–133). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_9","ama":"Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. Resource interfaces. In: Third International Conference on Embedded Software. Vol 2855. ACM; 2003:117-133. doi:10.1007/978-3-540-45212-6_9","ieee":"A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource interfaces,” in Third International Conference on Embedded Software, Philadelphia, PA, USA, 2003, vol. 2855, pp. 117–133.","short":"A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International Conference on Embedded Software, ACM, 2003, pp. 117–133.","chicago":"Chakrabarti, Arindam, Luca De Alfaro, Thomas A Henzinger, and Mariëlle Stoelinga. “Resource Interfaces.” In Third International Conference on Embedded Software, 2855:117–33. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_9.","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."},"title":"Resource interfaces","article_processing_charge":"No","publist_id":"148","author":[{"first_name":"Arindam","last_name":"Chakrabarti","full_name":"Chakrabarti, Arindam"},{"first_name":"Luca","full_name":"De Alfaro, Luca","last_name":"De Alfaro"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Stoelinga","full_name":"Stoelinga, Mariëlle","first_name":"Mariëlle"}],"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.","publisher":"ACM","quality_controlled":"1","publication":"Third International Conference on Embedded Software","day":"29","year":"2003","date_created":"2018-12-11T12:09:29Z","doi":"10.1007/978-3-540-45212-6_9","date_published":"2003-09-29T00:00:00Z","page":"117 - 133","_id":"4561","status":"public","conference":{"name":"EMSOFT: Embedded Software ","start_date":"2003-10-13","end_date":"2003-10-15","location":"Philadelphia, PA, USA"},"type":"conference","extern":"1","date_updated":"2024-01-08T10:48:11Z","oa_version":"None","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."}],"intvolume":" 2855","month":"09","alternative_title":["LNCS"],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783540202233"]},"volume":2855},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"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.","chicago":"De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “The Element of Surprise in Timed Games.” In Proceedings of the 14th International Conference on Concurrency Theory, 2761:144–58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003. https://doi.org/10.1007/978-3-540-45187-7_9.","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.","ieee":"L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “The element of surprise in timed games,” in Proceedings of the 14th International Conference on Concurrency Theory, Marseille, France, 2003, vol. 2761, pp. 144–158.","apa":"De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga, M. (2003). The element of surprise in timed games. In Proceedings of the 14th International Conference on Concurrency Theory (Vol. 2761, pp. 144–158). Marseille, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-45187-7_9","ama":"De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. The element of surprise in timed games. In: Proceedings of the 14th International Conference on Concurrency Theory. Vol 2761. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2003:144-158. doi:10.1007/978-3-540-45187-7_9","mla":"De Alfaro, Luca, et al. “The Element of Surprise in Timed Games.” Proceedings of the 14th International Conference on Concurrency Theory, vol. 2761, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–58, doi:10.1007/978-3-540-45187-7_9."},"title":"The element of surprise in timed games","publist_id":"78","author":[{"last_name":"De Alfaro","full_name":"De Alfaro, Luca","first_name":"Luca"},{"full_name":"Faella, Marco","last_name":"Faella","first_name":"Marco"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"},{"full_name":"Stoelinga, Mariëlle","last_name":"Stoelinga","first_name":"Mariëlle"}],"article_processing_charge":"No","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.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","day":"21","publication":"Proceedings of the 14th International Conference on Concurrency Theory","year":"2003","date_published":"2003-08-21T00:00:00Z","doi":"10.1007/978-3-540-45187-7_9","date_created":"2018-12-11T12:09:51Z","page":"144 - 158","_id":"4630","status":"public","type":"conference","conference":{"start_date":"2003-09-03","location":"Marseille, France","end_date":"2003-09-05","name":"CONCUR: Concurrency Theory"},"extern":"1","date_updated":"2024-01-08T10:05:30Z","oa_version":"None","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."}],"month":"08","intvolume":" 2761","scopus_import":"1","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540407539"]},"publication_status":"published","volume":2761},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"ama":"Henzinger TA, Kirsch C, Sanvido M, Pree W. From control models to real-time code using Giotto. IEEE Control Systems Magazine. 2003;23(1):50-64. doi:10.1109/MCS.2003.1172829","apa":"Henzinger, T. A., Kirsch, C., Sanvido, M., & Pree, W. (2003). From control models to real-time code using Giotto. IEEE Control Systems Magazine. IEEE. https://doi.org/10.1109/MCS.2003.1172829","short":"T.A. Henzinger, C. Kirsch, M. Sanvido, W. Pree, IEEE Control Systems Magazine 23 (2003) 50–64.","ieee":"T. A. Henzinger, C. Kirsch, M. Sanvido, and W. Pree, “From control models to real-time code using Giotto,” IEEE Control Systems Magazine, vol. 23, no. 1. IEEE, pp. 50–64, 2003.","mla":"Henzinger, Thomas A., et al. “From Control Models to Real-Time Code Using Giotto.” IEEE Control Systems Magazine, vol. 23, no. 1, IEEE, 2003, pp. 50–64, doi:10.1109/MCS.2003.1172829.","ista":"Henzinger TA, Kirsch C, Sanvido M, Pree W. 2003. From control models to real-time code using Giotto. IEEE Control Systems Magazine. 23(1), 50–64.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Marco Sanvido, and Wolfgang Pree. “From Control Models to Real-Time Code Using Giotto.” IEEE Control Systems Magazine. IEEE, 2003. https://doi.org/10.1109/MCS.2003.1172829."},"title":"From control models to real-time code using Giotto","article_processing_charge":"No","publist_id":"260","author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Christoph","full_name":"Kirsch, Christoph","last_name":"Kirsch"},{"first_name":"Marco","last_name":"Sanvido","full_name":"Sanvido, Marco"},{"first_name":"Wolfgang","full_name":"Pree, Wolfgang","last_name":"Pree"}],"acknowledgement":"We thank Niklaus Wirth and Walter Schaufelberger for their advice and support of the reengineering effort of the ETH Zurich helicopter control system using Giotto. This research was supported in part by DARPA SEC grant F33615-C-98–3614, MARCO GSRC grant 98-DT-660, and AFOSR MURI grant F49620–00-1–0327. A preliminary version of this article appeared as [1].","publisher":"IEEE","quality_controlled":"1","publication":"IEEE Control Systems Magazine","day":"29","year":"2003","date_created":"2018-12-11T12:09:00Z","date_published":"2003-01-29T00:00:00Z","doi":"10.1109/MCS.2003.1172829","page":"50 - 64","_id":"4468","status":"public","type":"journal_article","article_type":"original","extern":"1","date_updated":"2024-01-08T10:54:53Z","oa_version":"None","abstract":[{"text":"Giotto is a high-level programming language for time-triggered control applications. The authors begin with a conceptual overview of its methodology, discuss the Giotto helicopter project, and summarize available Giotto implementations.","lang":"eng"}],"intvolume":" 23","month":"01","scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1066-033X "]},"volume":23,"issue":"1"},{"_id":"4465","type":"book_chapter","status":"public","citation":{"ieee":"T. A. Henzinger, B. Horowitz, and C. Kirsch, “Embedded control systems development with Giotto,” in Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.","short":"T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.","ama":"Henzinger TA, Horowitz B, Kirsch C. Embedded control systems development with Giotto. In: Software-Enabled Control: Information Technology for Dynamical Systems. Wiley-Blackwell; 2003:123-146. doi:10.1002/047172288X.ch8","apa":"Henzinger, T. A., Horowitz, B., & Kirsch, C. (2003). Embedded control systems development with Giotto. In Software-Enabled Control: Information Technology for Dynamical Systems (pp. 123–146). Wiley-Blackwell. https://doi.org/10.1002/047172288X.ch8","mla":"Henzinger, Thomas A., et al. “Embedded Control Systems Development with Giotto.” Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–46, doi:10.1002/047172288X.ch8.","ista":"Henzinger TA, Horowitz B, Kirsch C. 2003.Embedded control systems development with Giotto. In: Software-Enabled Control: Information Technology for Dynamical Systems. , 123–146.","chicago":"Henzinger, Thomas A, Benjamin Horowitz, and Christoph Kirsch. “Embedded Control Systems Development with Giotto.” In Software-Enabled Control: Information Technology for Dynamical Systems, 123–46. Wiley-Blackwell, 2003. https://doi.org/10.1002/047172288X.ch8."},"date_updated":"2024-01-08T12:24:01Z","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","article_processing_charge":"No","publist_id":"262","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"first_name":"Benjamin","last_name":"Horowitz","full_name":"Horowitz, Benjamin"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"}],"title":"Embedded control systems development with Giotto","abstract":[{"lang":"eng","text":"Giotto is a principled, tool-supported design methodology for implementing embedded control systems on platforms of possibly distributed sensors, actuators, CPUs, and networks. Giotto is based on the principle that time-triggered task invocations plus time-triggered mode switches can form the abstract essence of programming real-time control systems. Giotto consists of a programming language with a formal semantics, and a retargetable compiler and runtime library. Giotto supports the automation of control system design by strictly separating platform-independent functionality and timing concerns from platform-dependent scheduling and communication issues. The time-triggered predictability of Giotto makes it particularly suitable for safety-critical applications with hard real-time constraints. We illustrate the platform independence and time-triggered execution of Giotto by coordinating a heterogeneous flock of Intel x86 robots and Lego Mindstorms robots."}],"oa_version":"None","quality_controlled":"1","publisher":"Wiley-Blackwell","month":"05","publication_status":"published","year":"2003","publication_identifier":{"isbn":["9780471234364 "]},"publication":"Software-Enabled Control: Information Technology for Dynamical Systems","language":[{"iso":"eng"}],"day":"20","page":"123 - 146","date_created":"2018-12-11T12:08:59Z","date_published":"2003-05-20T00:00:00Z","doi":"10.1002/047172288X.ch8"},{"citation":{"chicago":"Henzinger, Thomas A, Orna Kupferman, and Ritankar Majumdar. “On the Universal and Existential Fragments of the Mu-Calculus.” In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , 2619:49–64. Springer, 2003. https://doi.org/10.1007/3-540-36577-X_5.","ista":"Henzinger TA, Kupferman O, Majumdar R. 2003. On the universal and existential fragments of the mu-calculus. Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems . TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 2619, 49–64.","mla":"Henzinger, Thomas A., et al. “On the Universal and Existential Fragments of the Mu-Calculus.” Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , vol. 2619, Springer, 2003, pp. 49–64, doi:10.1007/3-540-36577-X_5.","short":"T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Springer, 2003, pp. 49–64.","ieee":"T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential fragments of the mu-calculus,” in Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems , Warsaw, Poland, 2003, vol. 2619, pp. 49–64.","ama":"Henzinger TA, Kupferman O, Majumdar R. On the universal and existential fragments of the mu-calculus. In: Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems . Vol 2619. Springer; 2003:49-64. doi:10.1007/3-540-36577-X_5","apa":"Henzinger, T. A., Kupferman, O., & Majumdar, R. (2003). On the universal and existential fragments of the mu-calculus. In Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 2619, pp. 49–64). Warsaw, Poland: Springer. https://doi.org/10.1007/3-540-36577-X_5"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Orna","full_name":"Kupferman, Orna","last_name":"Kupferman"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"}],"publist_id":"263","title":"On the universal and existential fragments of the mu-calculus","acknowledgement":"This work was supported in part by NSF grant CCR-9988172, the AFOSR MURI grant F49620-00-1-0327, and a Microsoft Research Fellowship.","publisher":"Springer","quality_controlled":"1","year":"2003","publication":"Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems ","day":"14","page":"49 - 64","date_created":"2018-12-11T12:08:59Z","date_published":"2003-03-14T00:00:00Z","doi":"10.1007/3-540-36577-X_5","_id":"4466","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2003-04-11","location":"Warsaw, Poland","start_date":"2003-04-07"},"type":"conference","status":"public","date_updated":"2024-01-08T13:17:35Z","extern":"1","abstract":[{"text":"One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich enough to express most specifications of interest, and therefore improved algorithms are of practical importance. We show that while the satisfiability and validity problems become indeed simpler for the existential and universal fragments, this is, unfortunately, not the case for model checking and implication. We also show the corresponding results for the alternationfree fragment of the μ-calculus, where no alternations between least and greatest fixed points are allowed. Our results imply that efforts to find a polynomial-time model-checking algorithm for the μ-calculus can be replaced by efforts to find such an algorithm for the universal or existential fragment.","lang":"eng"}],"oa_version":"None","alternative_title":["LNCS"],"intvolume":" 2619","month":"03","publication_status":"published","publication_identifier":{"isbn":["9783540008989"]},"language":[{"iso":"eng"}],"volume":2619},{"oa_version":"None","abstract":[{"text":"BLAST (the Berkeley Lazy Abstraction Software verification Tool) is a verification system for checking safety properties of C programs using automatic property-driven construction and model checking of software abstractions. Blast implements an abstract-model check-refine loop to check for reachability of a specified label in the program. The abstract model is built on the fly using predicate abstraction. This model is then checked for reachability. If there is no (abstract) path to the specified error label, Blast reports that the system is safe and produces a succinct proof. Otherwise, it checks if the path is feasible using symbolic execution of the program. If the path is feasible, Blast outputs the path as an error trace, otherwise, it uses the infeasibility of the path to refine the abstract model. Blast short-circuits the loop from abstraction to verification to refinement, integrating the three steps tightly through “lazy abstraction” [5]. This integration can offer significant advantages in performance by avoiding the repetition of work from one iteration of the loop to the next. ","lang":"eng"}],"intvolume":" 2648","month":"04","alternative_title":["LNCS"],"scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783540401179"]},"volume":2648,"_id":"4467","status":"public","conference":{"start_date":"2003-05-09","location":"Portland, OR, USA","end_date":"2003-05-10","name":"SPIN: Model Checking Software"},"type":"conference","extern":"1","date_updated":"2024-01-08T14:05:29Z","acknowledgement":"This work was supported in part by the NSF grants CCR-0085949 and CCR-9988172, the DARPA PCES grant F33615-00-C-1693, the MARCO GSRC grant 98-DT-660, and a Microsoft Research Fellowship.","quality_controlled":"1","publisher":"Springer","publication":"Proceedings of the 10th International SPIN Workshop ","day":"28","year":"2003","date_created":"2018-12-11T12:09:00Z","date_published":"2003-04-28T00:00:00Z","doi":"10.1007/3-540-44829-2_17","page":"235 - 239","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"chicago":"Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Grégoire Sutre. “Software Verification with BLAST.” In Proceedings of the 10th International SPIN Workshop , 2648:235–39. Springer, 2003. https://doi.org/10.1007/3-540-44829-2_17.","ista":"Henzinger TA, Jhala R, Majumdar R, Sutre G. 2003. Software verification with BLAST. Proceedings of the 10th International SPIN Workshop . SPIN: Model Checking Software, LNCS, vol. 2648, 235–239.","mla":"Henzinger, Thomas A., et al. “Software Verification with BLAST.” Proceedings of the 10th International SPIN Workshop , vol. 2648, Springer, 2003, pp. 235–39, doi:10.1007/3-540-44829-2_17.","ama":"Henzinger TA, Jhala R, Majumdar R, Sutre G. Software verification with BLAST. In: Proceedings of the 10th International SPIN Workshop . Vol 2648. Springer; 2003:235-239. doi:10.1007/3-540-44829-2_17","apa":"Henzinger, T. A., Jhala, R., Majumdar, R., & Sutre, G. (2003). Software verification with BLAST. In Proceedings of the 10th International SPIN Workshop (Vol. 2648, pp. 235–239). Portland, OR, USA: Springer. https://doi.org/10.1007/3-540-44829-2_17","ieee":"T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, “Software verification with BLAST,” in Proceedings of the 10th International SPIN Workshop , Portland, OR, USA, 2003, vol. 2648, pp. 235–239.","short":"T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the 10th International SPIN Workshop , Springer, 2003, pp. 235–239."},"title":"Software verification with BLAST","article_processing_charge":"No","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Jhala","full_name":"Jhala, Ranjit","first_name":"Ranjit"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"},{"first_name":"Grégoire","full_name":"Sutre, Grégoire","last_name":"Sutre"}],"publist_id":"264"},{"type":"conference","conference":{"start_date":"2003-07-08","end_date":"2003-07-12","location":"Boulder, CO, USA","name":"CAV: Computer Aided Verification"},"status":"public","_id":"4463","date_updated":"2024-01-10T11:05:53Z","extern":"1","alternative_title":["LNCS"],"month":"06","intvolume":" 2725","abstract":[{"lang":"eng","text":"We present an algorithm called TAR (“Thread-modular Abstraction Refinement”) for model checking safety properties of concurrent software. The TAR algorithm uses thread-modular assume-guarantee reasoning to overcome the exponential complexity in the control state of multithreaded programs. Thread modularity means that TAR explores the state space of one thread at a time, making assumptions about how the environment can interfere. The TAR algorithm uses counterexample-guided predicate-abstraction refinement to overcome the usually infinite complexity in the data state of C programs. A successive approximation scheme automatically infers the necessary precision on data variables as well as suitable environment assumptions. The scheme is novel in that transition relations are approximated from above, while at the same time environment assumptions are approximated from below. In our software verification tool BLAST we have implemented a fully automatic race checker for multithreaded C programs which is based on the TAR algorithm. This tool has verified a wide variety of commonly used locking idioms, including locking schemes that are not amenable to existing dynamic and static race checkers such as ERASER or WARLOCK."}],"oa_version":"None","volume":2725,"publication_identifier":{"isbn":["9783540405245"]},"publication_status":"published","language":[{"iso":"eng"}],"publist_id":"266","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Ranjit","full_name":"Jhala, Ranjit","last_name":"Jhala"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"article_processing_charge":"No","title":"Thread-modular abstraction refinement","citation":{"ista":"Henzinger TA, Jhala R, Majumdar R, Qadeer S. 2003. Thread-modular abstraction refinement. Proceedings of the 15th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 2725, 262–274.","chicago":"Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Shaz Qadeer. “Thread-Modular Abstraction Refinement.” In Proceedings of the 15th International Conference on Computer Aided Verification, 2725:262–74. Springer, 2003. https://doi.org/10.1007/978-3-540-45069-6_27.","ama":"Henzinger TA, Jhala R, Majumdar R, Qadeer S. Thread-modular abstraction refinement. In: Proceedings of the 15th International Conference on Computer Aided Verification. Vol 2725. Springer; 2003:262-274. doi:10.1007/978-3-540-45069-6_27","apa":"Henzinger, T. A., Jhala, R., Majumdar, R., & Qadeer, S. (2003). Thread-modular abstraction refinement. In Proceedings of the 15th International Conference on Computer Aided Verification (Vol. 2725, pp. 262–274). Boulder, CO, USA: Springer. https://doi.org/10.1007/978-3-540-45069-6_27","ieee":"T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer, “Thread-modular abstraction refinement,” in Proceedings of the 15th International Conference on Computer Aided Verification, Boulder, CO, USA, 2003, vol. 2725, pp. 262–274.","short":"T.A. Henzinger, R. Jhala, R. Majumdar, S. Qadeer, in:, Proceedings of the 15th International Conference on Computer Aided Verification, Springer, 2003, pp. 262–274.","mla":"Henzinger, Thomas A., et al. “Thread-Modular Abstraction Refinement.” Proceedings of the 15th International Conference on Computer Aided Verification, vol. 2725, Springer, 2003, pp. 262–74, doi:10.1007/978-3-540-45069-6_27."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","publisher":"Springer","acknowledgement":"This work was supported in part by the NSF grants CCR-0085949 and CCR-0234690, the DARPA grant F33615-00-C-1693, and the MARCO grant 98-DT-660.","page":"262 - 274","date_published":"2003-06-27T00:00:00Z","doi":"10.1007/978-3-540-45069-6_27","date_created":"2018-12-11T12:08:59Z","year":"2003","day":"27","publication":"Proceedings of the 15th International Conference on Computer Aided Verification"},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"apa":"Henzinger, T. A., Jhala, R., & Majumdar, R. (2003). Counterexample-guided control. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (Vol. 2719, pp. 886–902). Eindhoven, The Netherlands: Springer. https://doi.org/10.1007/3-540-45061-0_69","ama":"Henzinger TA, Jhala R, Majumdar R. Counterexample-guided control. In: Proceedings of the 30th International Colloquium on Automata, Languages and Programming. Vol 2719. Springer; 2003:886-902. doi:10.1007/3-540-45061-0_69","short":"T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 886–902.","ieee":"T. A. Henzinger, R. Jhala, and R. Majumdar, “Counterexample-guided control,” in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp. 886–902.","mla":"Henzinger, Thomas A., et al. “Counterexample-Guided Control.” Proceedings of the 30th International Colloquium on Automata, Languages and Programming, vol. 2719, Springer, 2003, pp. 886–902, doi:10.1007/3-540-45061-0_69.","ista":"Henzinger TA, Jhala R, Majumdar R. 2003. Counterexample-guided control. Proceedings of the 30th International Colloquium on Automata, Languages and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719, 886–902.","chicago":"Henzinger, Thomas A, Ranjit Jhala, and Ritankar Majumdar. “Counterexample-Guided Control.” In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, 2719:886–902. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_69."},"title":"Counterexample-guided control","publist_id":"265","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jhala, Ranjit","last_name":"Jhala","first_name":"Ranjit"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"article_processing_charge":"No","day":"25","publication":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming","year":"2003","date_published":"2003-06-25T00:00:00Z","doi":"10.1007/3-540-45061-0_69","date_created":"2018-12-11T12:08:58Z","page":"886 - 902","acknowledgement":"This research was supported in part by the DARPA SEC grant F33615-C-98-3614, the ONR grant N00014-02-1-0671, and the NSF grants CCR-9988172, CCR-0085949, and CCR-0225610.","publisher":"Springer","quality_controlled":"1","extern":"1","date_updated":"2024-01-10T11:19:41Z","_id":"4462","status":"public","type":"conference","conference":{"end_date":"2003-07-04","location":"Eindhoven, The Netherlands","start_date":"2003-06-30","name":"ICALP: Automata, Languages and Programming"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540404934"]},"publication_status":"published","volume":2719,"oa_version":"None","abstract":[{"lang":"eng","text":"A major hurdle in the algorithmic verification and control of systems is the need to find suitable abstract models, which omit enough details to overcome the state-explosion problem, but retain enough details to exhibit satisfaction or controllability with respect to the specification. The paradigm of counterexample-guided abstraction refinement suggests a fully automatic way of finding suitable abstract models: one starts with a coarse abstraction, attempts to verify or control the abstract model, and if this attempt fails and the abstract counterexample does not correspond to a concrete counterexample, then one uses the spurious counterexample to guide the refinement of the abstract model. We present a counterexample-guided refinement algorithm for solving ω-regular control objectives. The main difficulty is that in control, unlike in verification, counterexamples are strategies in a game between system and controller. In the case that the controller has no choices, our scheme subsumes known counterexample-guided refinement algorithms for the verification of ω-regular specifications. Our algorithm is useful in all situations where ω-regular games need to be solved, such as supervisory control, sequential and program synthesis, and modular verification. The algorithm is fully symbolic, and therefore applicable also to infinite-state systems."}],"month":"06","intvolume":" 2719","scopus_import":"1","alternative_title":["LNCS"]},{"article_processing_charge":"No","publist_id":"267","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"},{"first_name":"Slobodan","full_name":"Matic, Slobodan","last_name":"Matic"}],"title":"Schedule-carrying code","citation":{"ista":"Henzinger TA, Kirsch C, Matic S. 2003. Schedule-carrying code. Proceedings of the 3rd International Conference on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2855, 241–256.","chicago":"Henzinger, Thomas A, Christoph Kirsch, and Slobodan Matic. “Schedule-Carrying Code.” In Proceedings of the 3rd International Conference on Embedded Software, 2855:241–56. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_16.","ama":"Henzinger TA, Kirsch C, Matic S. Schedule-carrying code. In: Proceedings of the 3rd International Conference on Embedded Software. Vol 2855. ACM; 2003:241-256. doi:10.1007/978-3-540-45212-6_16","apa":"Henzinger, T. A., Kirsch, C., & Matic, S. (2003). Schedule-carrying code. In Proceedings of the 3rd International Conference on Embedded Software (Vol. 2855, pp. 241–256). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_16","short":"T.A. Henzinger, C. Kirsch, S. Matic, in:, Proceedings of the 3rd International Conference on Embedded Software, ACM, 2003, pp. 241–256.","ieee":"T. A. Henzinger, C. Kirsch, and S. Matic, “Schedule-carrying code,” in Proceedings of the 3rd International Conference on Embedded Software, Philadelphia, PA, USA, 2003, vol. 2855, pp. 241–256.","mla":"Henzinger, Thomas A., et al. “Schedule-Carrying Code.” Proceedings of the 3rd International Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 241–56, doi:10.1007/978-3-540-45212-6_16."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"241 - 256","date_created":"2018-12-11T12:08:59Z","doi":"10.1007/978-3-540-45212-6_16","date_published":"2003-09-29T00:00:00Z","year":"2003","publication":"Proceedings of the 3rd International Conference on Embedded Software","day":"29","publisher":"ACM","quality_controlled":"1","acknowledgement":"This work was supported by the AFOSR MURI grant F49620-00-1-0327, the California MICRO grant 01-037, the DARPA grant F33615-C-98-3614, the MARCO grant 98-DT-660, and the NSF grants CCR-0208875, CCR-0085949, and CCR-0225610.","date_updated":"2024-01-10T11:33:57Z","extern":"1","conference":{"location":"Philadelphia, PA, USA","end_date":"2003-10-15","start_date":"2003-10-13","name":"EMSOFT: Embedded Software "},"type":"conference","status":"public","_id":"4464","volume":2855,"publication_status":"published","publication_identifier":{"isbn":["9783540202233"]},"language":[{"iso":"eng"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 2855","month":"09","abstract":[{"lang":"eng","text":"We introduce the paradigm of schedule-carrying code (SCC). A hard real-time program can be executed on a given platform only if there exists a feasible schedule for the real-time tasks of the program. Traditionally, a scheduler determines the existence of a feasible schedule according to some scheduling strategy. With SCC, a compiler proves the existence of a feasible schedule by generating executable code that is attached to the program and represents its schedule. An SCC executable is a real-time program that carries its schedule as code, which is produced once and can be revalidated and executed with each use. We evaluate SCC both in theory and practice. In theory, we give two scenarios, of nonpreemptive and distributed scheduling for Giotto programs, where the generation of a feasible schedule is hard, while the validation of scheduling instructions that are attached to the programs is easy. In practice, we implement SCC and show that explicit scheduling instructions can reduce the scheduling overhead up to 35% and can provide an efficient, flexible, and verifiable means for compiling Giotto programs on complex architectures, such as the TTA."}],"oa_version":"None"},{"oa_version":"None","abstract":[{"lang":"eng","text":"Symbolic model checking, which enables the automatic verification of large systems, proceeds by calculating expressions that represent state sets. Traditionally, symbolic model-checking tools are based on back- ward state traversal; their basic operation is the function pre, which, given a set of states, returns the set of all predecessor states. This is because specifiers usually employ formalisms with future-time modalities, which are naturally evaluated by iterating applications of pre. It has been shown experimentally that symbolic model checking can perform significantly better if it is based, instead, on forward state traversal; in this case, the basic operation is the function post, which, given a set of states, returns the set of all successor states. This is because forward state traversal can ensure that only parts of the state space that are reachable from an initial state and relevant for the satisfaction or violation of the specification are explored; that is, errors can be detected as soon as possible.\r\nIn this paper, we investigate which specifications can be checked by symbolic forward state traversal. We formulate the problems of symbolic backward and forward model checking by means of two μ-calculi. The pre-μ calculus is based on the pre operation, and the post-μ calculus is based on the post operation. These two μ-calculi induce query logics, which augment fixpoint expressions with a boolean emptiness query. Using query logics, we are able to relate and compare the symbolic backward and forward approaches. In particular, we prove that all ω-regular (linear-time) specifications can be expressed as post-μ queries, and therefore checked using symbolic forward state traversal. On the other hand, we show that there are simple branching-time specifications that cannot be checked in this way."}],"month":"06","intvolume":" 23","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0925-9856"]},"publication_status":"published","volume":23,"issue":"3","_id":"4460","status":"public","article_type":"original","type":"journal_article","extern":"1","date_updated":"2024-01-10T11:50:31Z","acknowledgement":"This research was supported in part by the SRC contract 99-TJ-683.003 and the NSF grant CCR-9988172.","publisher":"Springer","quality_controlled":"1","day":"20","publication":"Formal Methods in System Design","year":"2003","doi":"10.1023/A:1026228213080","date_published":"2003-06-20T00:00:00Z","date_created":"2018-12-11T12:08:58Z","page":"303 - 327","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"mla":"Henzinger, Thomas A., et al. “From Pre-Historic to Post-Modern Symbolic Model Checking.” Formal Methods in System Design, vol. 23, no. 3, Springer, 2003, pp. 303–27, doi:10.1023/A:1026228213080.","short":"T.A. Henzinger, O. Kupferman, S. Qadeer, Formal Methods in System Design 23 (2003) 303–327.","ieee":"T. A. Henzinger, O. Kupferman, and S. Qadeer, “From pre-historic to post-modern symbolic model checking,” Formal Methods in System Design, vol. 23, no. 3. Springer, pp. 303–327, 2003.","ama":"Henzinger TA, Kupferman O, Qadeer S. From pre-historic to post-modern symbolic model checking. Formal Methods in System Design. 2003;23(3):303-327. doi:10.1023/A:1026228213080","apa":"Henzinger, T. A., Kupferman, O., & Qadeer, S. (2003). From pre-historic to post-modern symbolic model checking. Formal Methods in System Design. Springer. https://doi.org/10.1023/A:1026228213080","chicago":"Henzinger, Thomas A, Orna Kupferman, and Shaz Qadeer. “From Pre-Historic to Post-Modern Symbolic Model Checking.” Formal Methods in System Design. Springer, 2003. https://doi.org/10.1023/A:1026228213080.","ista":"Henzinger TA, Kupferman O, Qadeer S. 2003. From pre-historic to post-modern symbolic model checking. Formal Methods in System Design. 23(3), 303–327."},"title":"From pre-historic to post-modern symbolic model checking","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"}],"publist_id":"268","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0018-9219 "]},"publication_status":"published","issue":"1","volume":91,"oa_version":"None","abstract":[{"lang":"eng","text":"Giotto provides an abstract programmer's model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic software tasks together with a mode-switching logic for enabling and disabling tasks. Giotto specifies time-triggered sensor readings, task invocations, actuator updates, and mode switches independent of any implementation platform. Giotto can be annotated with platform constraints such as task-to-host mappings, and task and communication schedules. The annotations are directives for the Giotto compiler, but they do not alter the functionality and timing of a Giotto program. By separating the platform-independent from the platform-dependent concerns, Giotto enables a great deal of flexibility in choosing control platforms as well as a great deal of automation in the validation and synthesis of control software. The time-triggered nature of Giotto achieves timing predictability, which makes Giotto particularly suitable for safety-critical applications."}],"month":"01","intvolume":" 91","scopus_import":"1","extern":"1","date_updated":"2024-01-10T11:55:18Z","_id":"4469","status":"public","article_type":"original","type":"journal_article","day":"29","publication":"Proceedings of the IEEE","year":"2003","doi":"10.1109/JPROC.2002.805825","date_published":"2003-01-29T00:00:00Z","date_created":"2018-12-11T12:09:00Z","page":"84 - 99","acknowledgement":"The authors would like to thank R. Majumdar for implementing a prototype Giotto compiler for Lego Mindstorms robots. They would like to thank D. Derevyanko and W. Williams for building the Intel x86 robots; and E. Lee and X. Liu for help with implementing Giotto as a “model of computation” in Ptolemy II [26]. Finally, they would also like to thank M. Sanvido for his suggestions on the design of the Giotto drivers; and P. Griffiths for implementing the functionality code of the electronic throttle controller.","quality_controlled":"1","publisher":"IEEE","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"chicago":"Henzinger, Thomas A, Benjamin Horowitz, and Christoph Kirsch. “Giotto: A Time-Triggered Language for Embedded Programming.” Proceedings of the IEEE. IEEE, 2003. https://doi.org/10.1109/JPROC.2002.805825.","ista":"Henzinger TA, Horowitz B, Kirsch C. 2003. Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE. 91(1), 84–99.","mla":"Henzinger, Thomas A., et al. “Giotto: A Time-Triggered Language for Embedded Programming.” Proceedings of the IEEE, vol. 91, no. 1, IEEE, 2003, pp. 84–99, doi:10.1109/JPROC.2002.805825.","apa":"Henzinger, T. A., Horowitz, B., & Kirsch, C. (2003). Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE. IEEE. https://doi.org/10.1109/JPROC.2002.805825","ama":"Henzinger TA, Horowitz B, Kirsch C. Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE. 2003;91(1):84-99. doi:10.1109/JPROC.2002.805825","short":"T.A. Henzinger, B. Horowitz, C. Kirsch, Proceedings of the IEEE 91 (2003) 84–99.","ieee":"T. A. Henzinger, B. Horowitz, and C. Kirsch, “Giotto: A time-triggered language for embedded programming,” Proceedings of the IEEE, vol. 91, no. 1. IEEE, pp. 84–99, 2003."},"title":"Giotto: A time-triggered language for embedded programming","publist_id":"261","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Horowitz, Benjamin","last_name":"Horowitz","first_name":"Benjamin"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"}],"article_processing_charge":"No"}]