[{"date_updated":"2024-11-06T08:13:59Z","author":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"citation":{"mla":"Henzinger, Monika. “Algorithmic Challenges in Web Search Engines.” <i>Internet Mathematics</i>, vol. 1, no. 1, Internet Mathematics, 2004, pp. 115–23, doi:<a href=\"https://doi.org/10.1080/15427951.2004.10129079\">10.1080/15427951.2004.10129079</a>.","ama":"Henzinger M. Algorithmic challenges in web search engines. <i>Internet Mathematics</i>. 2004;1(1):115-123. doi:<a href=\"https://doi.org/10.1080/15427951.2004.10129079\">10.1080/15427951.2004.10129079</a>","apa":"Henzinger, M. (2004). Algorithmic challenges in web search engines. <i>Internet Mathematics</i>. Internet Mathematics. <a href=\"https://doi.org/10.1080/15427951.2004.10129079\">https://doi.org/10.1080/15427951.2004.10129079</a>","short":"M. Henzinger, Internet Mathematics 1 (2004) 115–123.","ista":"Henzinger M. 2004. Algorithmic challenges in web search engines. Internet Mathematics. 1(1), 115–123.","chicago":"Henzinger, Monika. “Algorithmic Challenges in Web Search Engines.” <i>Internet Mathematics</i>. Internet Mathematics, 2004. <a href=\"https://doi.org/10.1080/15427951.2004.10129079\">https://doi.org/10.1080/15427951.2004.10129079</a>.","ieee":"M. Henzinger, “Algorithmic challenges in web search engines,” <i>Internet Mathematics</i>, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004."},"issue":"1","date_published":"2004-01-01T00:00:00Z","month":"01","page":"115-123","article_type":"original","date_created":"2022-08-08T11:55:53Z","language":[{"iso":"eng"}],"extern":"1","publication_identifier":{"eissn":["1944-9488"],"issn":["1542-7951"]},"scopus_import":"1","title":"Algorithmic challenges in web search engines","article_processing_charge":"No","volume":1,"quality_controlled":"1","oa":1,"_id":"11762","publication_status":"published","publication":"Internet Mathematics","doi":"10.1080/15427951.2004.10129079","abstract":[{"lang":"eng","text":"In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1080/15427951.2004.10129079"}],"day":"01","type":"journal_article","year":"2004","publisher":"Internet Mathematics","oa_version":"Published Version","fulldoi":"https://doi.org/10.1080/15427951.2004.10129079","status":"public","intvolume":"         1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"title":"The past, present, and future of web search engines","article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"]},"scopus_import":"1","conference":{"name":"ICALP: International Colloquium on Automata, Languages, and Programming","end_date":"2004-07-16","location":"Turku, Finland","start_date":"2004-07-12"},"extern":"1","date_created":"2022-08-11T12:38:58Z","language":[{"iso":"eng"}],"citation":{"short":"M. Henzinger, in:, 31st International Colloquium on Automata, Languages and Programming, Springer Nature, 2004, p. 3.","ista":"Henzinger M. 2004. The past, present, and future of web search engines. 31st International Colloquium on Automata, Languages and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 3142, 3.","chicago":"Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.” In <i>31st International Colloquium on Automata, Languages and Programming</i>, 3142:3. Springer Nature, 2004. <a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">https://doi.org/10.1007/978-3-540-27836-8_2</a>.","ieee":"M. Henzinger, “The past, present, and future of web search engines,” in <i>31st International Colloquium on Automata, Languages and Programming</i>, Turku, Finland, 2004, vol. 3142, p. 3.","ama":"Henzinger M. The past, present, and future of web search engines. In: <i>31st International Colloquium on Automata, Languages and Programming</i>. Vol 3142. Springer Nature; 2004:3. doi:<a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">10.1007/978-3-540-27836-8_2</a>","mla":"Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.” <i>31st International Colloquium on Automata, Languages and Programming</i>, vol. 3142, Springer Nature, 2004, p. 3, doi:<a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">10.1007/978-3-540-27836-8_2</a>.","apa":"Henzinger, M. (2004). The past, present, and future of web search engines. In <i>31st International Colloquium on Automata, Languages and Programming</i> (Vol. 3142, p. 3). Turku, Finland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-540-27836-8_2\">https://doi.org/10.1007/978-3-540-27836-8_2</a>"},"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"date_updated":"2024-11-06T08:14:51Z","month":"07","page":"3","date_published":"2004-07-01T00:00:00Z","intvolume":"      3142","fulldoi":"https://doi.org/10.1007/978-3-540-27836-8_2","status":"public","year":"2004","type":"conference","publisher":"Springer Nature","oa_version":"None","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","alternative_title":["LNCS"],"volume":3142,"abstract":[{"text":"Web search engines have emerged as one of the central applications on the Internet. In fact, search has become one of the most important activities that people engage in on the the Internet. Even beyond becoming the number one source of information, a growing number of businesses are depending on web search engines for customer acquisition.\r\n\r\nThe first generation of web search engines used text-only retrieval techniques. Google revolutionized the field by deploying the PageRank technology – an eigenvector-based analysis of the hyperlink structure – to analyze the web in order to produce relevant results. Moving forward, our goal is to achieve a better understanding of a page with a view towards producing even more relevant results.","lang":"eng"}],"doi":"10.1007/978-3-540-27836-8_2","publication":"31st International Colloquium on Automata, Languages and Programming","_id":"11800","publication_status":"published"},{"date_updated":"2024-11-06T11:55:33Z","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"citation":{"mla":"Henzinger, Monika. “Algorithmic Aspects of Web Search Engines.” <i>2th Annual European Symposium on Algorithms</i>, vol. 3221, Springer Nature, 2004, p. 3, doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_2\">10.1007/978-3-540-30140-0_2</a>.","ama":"Henzinger M. Algorithmic aspects of web search engines. In: <i>2th Annual European Symposium on Algorithms</i>. Vol 3221. Springer Nature; 2004:3. doi:<a href=\"https://doi.org/10.1007/978-3-540-30140-0_2\">10.1007/978-3-540-30140-0_2</a>","apa":"Henzinger, M. (2004). Algorithmic aspects of web search engines. In <i>2th Annual European Symposium on Algorithms</i> (Vol. 3221, p. 3). Bergen, Norway: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_2\">https://doi.org/10.1007/978-3-540-30140-0_2</a>","short":"M. Henzinger, in:, 2th Annual European Symposium on Algorithms, Springer Nature, 2004, p. 3.","ieee":"M. Henzinger, “Algorithmic aspects of web search engines,” in <i>2th Annual European Symposium on Algorithms</i>, Bergen, Norway, 2004, vol. 3221, p. 3.","ista":"Henzinger M. 2004. Algorithmic aspects of web search engines. 2th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 3221, 3.","chicago":"Henzinger, Monika. “Algorithmic Aspects of Web Search Engines.” In <i>2th Annual European Symposium on Algorithms</i>, 3221:3. Springer Nature, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30140-0_2\">https://doi.org/10.1007/978-3-540-30140-0_2</a>."},"date_published":"2004-09-01T00:00:00Z","page":"3","month":"09","language":[{"iso":"eng"}],"date_created":"2022-08-11T13:18:05Z","extern":"1","conference":{"location":"Bergen, Norway","end_date":"2004-09-17","name":"ESA: European Symposium on Algorithms","start_date":"2004-09-14"},"scopus_import":"1","publication_identifier":{"eissn":["1611-3349"],"isbn":[" 3540230254"],"issn":["0302-9743"]},"article_processing_charge":"No","title":"Algorithmic aspects of web search engines","volume":3221,"alternative_title":["LNCS"],"quality_controlled":"1","publication":"2th Annual European Symposium on Algorithms","publication_status":"published","_id":"11801","abstract":[{"lang":"eng","text":"Web search engines have emerged as one of the central applications on the internet. In fact, search has become one of the most important activities that people engage in on the Internet. Even beyond becoming the number one source of information, a growing number of businesses are depending on web search engines for customer acquisition. In this talk I will brief review the history of web search engines: The first generation of web search engines used text-only retrieval techniques. Google revolutionized the field by deploying the PageRank technology – an eigenvector-based analysis of the hyperlink structure- to analyze the web in order to produce relevant results. Moving forward, our goal is to achieve a better understanding of a page with a view towards producing even more relevant results.\r\n\r\nGoogle is powered by a large number of PCs. Using this infrastructure and striving to be as efficient as possible poses challenging systems problems but also various algorithmic challenges. I will discuss some of them in my talk."}],"doi":"10.1007/978-3-540-30140-0_2","day":"01","publisher":"Springer Nature","oa_version":"None","type":"conference","year":"2004","status":"public","fulldoi":"https://doi.org/10.1007/978-3-540-30140-0_2","intvolume":"      3221","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"date_published":"2004-01-01T00:00:00Z","abstract":[{"text":"In this article we describe the approach taken by the first web search engines, discuss the state of the art, and present some of the challenges for the future.","lang":"eng"}],"doi":"10.1117/12.537534","_id":"11859","publication":"SPIE Proceedings","publication_status":"published","month":"01","page":"23 - 26","quality_controlled":"1","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"volume":5296,"date_updated":"2024-11-06T11:59:44Z","citation":{"apa":"Henzinger, M. (2004). The past, present, and future of web information retrieval. In <i>SPIE Proceedings</i> (Vol. 5296, pp. 23–26). San Jose, CA, United States: Society of Photo-Optical Instrumentation Engineers. <a href=\"https://doi.org/10.1117/12.537534\">https://doi.org/10.1117/12.537534</a>","mla":"Henzinger, Monika. “The Past, Present, and Future of Web Information Retrieval.” <i>SPIE Proceedings</i>, vol. 5296, Society of Photo-Optical Instrumentation Engineers, 2004, pp. 23–26, doi:<a href=\"https://doi.org/10.1117/12.537534\">10.1117/12.537534</a>.","ama":"Henzinger M. The past, present, and future of web information retrieval. In: <i>SPIE Proceedings</i>. Vol 5296. Society of Photo-Optical Instrumentation Engineers; 2004:23-26. doi:<a href=\"https://doi.org/10.1117/12.537534\">10.1117/12.537534</a>","ista":"Henzinger M. 2004. The past, present, and future of web information retrieval. SPIE Proceedings. Document Recognition and Retrieval XI vol. 5296, 23–26.","chicago":"Henzinger, Monika. “The Past, Present, and Future of Web Information Retrieval.” In <i>SPIE Proceedings</i>, 5296:23–26. Society of Photo-Optical Instrumentation Engineers, 2004. <a href=\"https://doi.org/10.1117/12.537534\">https://doi.org/10.1117/12.537534</a>.","ieee":"M. Henzinger, “The past, present, and future of web information retrieval,” in <i>SPIE Proceedings</i>, San Jose, CA, United States, 2004, vol. 5296, pp. 23–26.","short":"M. Henzinger, in:, SPIE Proceedings, Society of Photo-Optical Instrumentation Engineers, 2004, pp. 23–26."},"extern":"1","conference":{"location":"San Jose, CA, United States","end_date":"2004-01-22","name":"Document Recognition and Retrieval XI","start_date":"2004-01-21"},"date_created":"2022-08-16T08:46:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"The past, present, and future of web information retrieval","publication_identifier":{"issn":["0277-786X"]},"scopus_import":"1","type":"conference","year":"2004","publisher":"Society of Photo-Optical Instrumentation Engineers","oa_version":"None","day":"01","intvolume":"      5296","fulldoi":"https://doi.org/10.1117/12.537534","status":"public"},{"_id":"11877","publication_status":"published","publication":"Proceedings of the National Academy of Sciences","doi":"10.1073/pnas.0307528100","abstract":[{"text":"The World Wide Web provides a unprecedented opportunity to automatically analyze a large sample of interests and activity in the world. We discuss methods for extracting knowledge from the web by randomly sampling and analyzing hosts and pages, and by analyzing the link structure of the web and how links accumulate over time. A variety of interesting and valuable information can be extracted, such as the distribution of web pages over domains, the distribution of interest in different areas, communities related to different topics, the nature of competition in different categories of sites, and the degree of communication between different communities or countries.","lang":"eng"}],"volume":101,"oa":1,"quality_controlled":"1","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","fulldoi":"https://doi.org/10.1073/pnas.0307528100","intvolume":"       101","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC387294/","open_access":"1"}],"day":"06","publisher":"Proceedings of the National Academy of Sciences","oa_version":"Published Version","year":"2004","type":"journal_article","page":"5186-5191","month":"04","date_published":"2004-04-06T00:00:00Z","citation":{"ieee":"M. Henzinger and S. Lawrence, “Extracting knowledge from the World Wide Web,” <i>Proceedings of the National Academy of Sciences</i>, vol. 101, no. suppl_1. Proceedings of the National Academy of Sciences, pp. 5186–5191, 2004.","chicago":"Henzinger, Monika, and Steve Lawrence. “Extracting Knowledge from the World Wide Web.” <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences, 2004. <a href=\"https://doi.org/10.1073/pnas.0307528100\">https://doi.org/10.1073/pnas.0307528100</a>.","ista":"Henzinger M, Lawrence S. 2004. Extracting knowledge from the World Wide Web. Proceedings of the National Academy of Sciences. 101(suppl_1), 5186–5191.","short":"M. Henzinger, S. Lawrence, Proceedings of the National Academy of Sciences 101 (2004) 5186–5191.","apa":"Henzinger, M., &#38; Lawrence, S. (2004). Extracting knowledge from the World Wide Web. <i>Proceedings of the National Academy of Sciences</i>. Proceedings of the National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0307528100\">https://doi.org/10.1073/pnas.0307528100</a>","mla":"Henzinger, Monika, and Steve Lawrence. “Extracting Knowledge from the World Wide Web.” <i>Proceedings of the National Academy of Sciences</i>, vol. 101, no. suppl_1, Proceedings of the National Academy of Sciences, 2004, pp. 5186–91, doi:<a href=\"https://doi.org/10.1073/pnas.0307528100\">10.1073/pnas.0307528100</a>.","ama":"Henzinger M, Lawrence S. Extracting knowledge from the World Wide Web. <i>Proceedings of the National Academy of Sciences</i>. 2004;101(suppl_1):5186-5191. doi:<a href=\"https://doi.org/10.1073/pnas.0307528100\">10.1073/pnas.0307528100</a>"},"issue":"suppl_1","date_updated":"2024-11-06T12:00:20Z","author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger"},{"last_name":"Lawrence","first_name":"Steve","full_name":"Lawrence, Steve"}],"scopus_import":"1","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"title":"Extracting knowledge from the World Wide Web","article_processing_charge":"No","language":[{"iso":"eng"}],"date_created":"2022-08-16T13:06:10Z","extern":"1","article_type":"original","external_id":{"pmid":["14745041"]}},{"title":"The Matryoshka dolls of plant polarity","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:57:48Z","intvolume":"       131","status":"public","fulldoi":"https://doi.org/10.1242/dev.01463","oa_version":"None","publisher":"Company of Biologists","year":"2004","type":"review","day":"01","page":"5774 - 5775","month":"12","date_published":"2004-12-01T00:00:00Z","doi":"10.1242/dev.01463","publist_id":"4442","publication_status":"published","_id":"2461","publication":"Development","issue":"23","citation":{"mla":"Sauer, Michael, and Jiří Friml. “The Matryoshka Dolls of Plant Polarity.” <i>Development</i>, vol. 131, no. 23, Company of Biologists, 2004, pp. 5774–75, doi:<a href=\"https://doi.org/10.1242/dev.01463\">10.1242/dev.01463</a>.","ama":"Sauer M, Friml J. The Matryoshka dolls of plant polarity. <i>Development</i>. 2004;131(23):5774-5775. doi:<a href=\"https://doi.org/10.1242/dev.01463\">10.1242/dev.01463</a>","apa":"Sauer, M., &#38; Friml, J. (2004). The Matryoshka dolls of plant polarity. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.01463\">https://doi.org/10.1242/dev.01463</a>","short":"M. Sauer, J. Friml, Development 131 (2004) 5774–5775.","ieee":"M. Sauer and J. Friml, “The Matryoshka dolls of plant polarity,” <i>Development</i>, vol. 131, no. 23. Company of Biologists, pp. 5774–5775, 2004.","ista":"Sauer M, Friml J. 2004. The Matryoshka dolls of plant polarity. Development. 131(23), 5774–5775.","chicago":"Sauer, Michael, and Jiří Friml. “The Matryoshka Dolls of Plant Polarity.” <i>Development</i>. Company of Biologists, 2004. <a href=\"https://doi.org/10.1242/dev.01463\">https://doi.org/10.1242/dev.01463</a>."},"quality_controlled":"1","author":[{"full_name":"Sauer, Michael","first_name":"Michael","last_name":"Sauer"},{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí"}],"volume":131,"date_updated":"2021-01-12T06:57:37Z"},{"volume":49,"date_updated":"2020-07-14T12:45:44Z","quality_controlled":0,"author":[{"last_name":"Momiyama","full_name":"Momiyama, Akiko","first_name":"Akiko"},{"last_name":"Shigemoto","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"}],"citation":{"apa":"Momiyama, A., &#38; Shigemoto, R. (2004). Function and distribution of glutamate receptors in the central synapses. <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>. Kyoritsu Shuppan.","mla":"Momiyama, Akiko, and Ryuichi Shigemoto. “Function and Distribution of Glutamate Receptors in the Central Synapses.” <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>, vol. 49, no. 3 Suppl, Kyoritsu Shuppan, 2004, pp. 287–94.","ama":"Momiyama A, Shigemoto R. Function and distribution of glutamate receptors in the central synapses. <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>. 2004;49(3 Suppl):287-294.","ieee":"A. Momiyama and R. Shigemoto, “Function and distribution of glutamate receptors in the central synapses,” <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>, vol. 49, no. 3 Suppl. Kyoritsu Shuppan, pp. 287–294, 2004.","chicago":"Momiyama, Akiko, and Ryuichi Shigemoto. “Function and Distribution of Glutamate Receptors in the Central Synapses.” <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>. Kyoritsu Shuppan, 2004.","ista":"Momiyama A, Shigemoto R. 2004. Function and distribution of glutamate receptors in the central synapses. Tanpakushitsu kakusan koso Protein nucleic acid enzyme. 49(3 Suppl), 287–294.","short":"A. Momiyama, R. Shigemoto, Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme 49 (2004) 287–294."},"issue":"3 Suppl","publication_status":"published","_id":"2636","publication":"Tanpakushitsu kakusan koso Protein nucleic acid enzyme","publist_id":"4261","date_published":"2004-02-01T00:00:00Z","month":"02","page":"287 - 294","day":"01","type":"review","year":"2004","publisher":"Kyoritsu Shuppan","status":"public","intvolume":"        49","date_created":"2018-12-11T11:58:48Z","extern":1,"title":"Function and distribution of glutamate receptors in the central synapses"},{"fulldoi":"https://doi.org/10.1080/10425170410001667348","status":"public","intvolume":"        15","type":"journal_article","year":"2004","publisher":"Informa UK Limited","oa_version":"None","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":15,"quality_controlled":"1","publication":"DNA Sequence","_id":"12203","publication_status":"published","abstract":[{"lang":"eng","text":"Geranylgeranyl diphosphate synthase (GGPPS, EC: 2.5.1.29) catalyzes the biosynthesis of geranylgeranyl diphosphate (GGPP), which is a key precursor for ginkgolide biosynthesis. Here we reported for the first time the cloning of a new full-length cDNA encoding GGPPS from the living fossil plant Ginkgo biloba. The full-length cDNA encoding G. biloba GGPPS (designated as GbGGPPS) was 1657bp long and contained a 1176bp open reading frame encoding a 391 amino acid protein. Comparative analysis showed that GbGGPPS possessed a 79 amino acid transit peptide at its N-terminal, which directed GbGGPPS to target to the plastids. Bioinformatic analysis revealed that GbGGPPS was a member of polyprenyltransferases with two highly conserved aspartate-rich motifs like other plant GGPPSs. Phylogenetic tree analysis indicated that plant GGPPSs could be classified into two groups, angiosperm and gymnosperm GGPPSs, while GbGGPPS had closer relationship with gymnosperm plant GGPPSs."}],"doi":"10.1080/10425170410001667348","article_type":"original","acknowledgement":"This study was financially supported by China National High-Tech “863” Program. The authors are very thankful to Dr Li Wang (School of Life Sciences, Fudan University, Shanghai, China) for her kind help with constructing the phylogenetic tree.","external_id":{"pmid":["15352294"]},"publication_identifier":{"issn":["1042-5179"]},"scopus_import":"1","department":[{"_id":"XiFe"}],"article_processing_charge":"No","title":"A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates the biosynthesis of the key precursor for ginkgolides","date_created":"2023-01-16T09:24:50Z","language":[{"iso":"eng"}],"keyword":["Endocrinology","Genetics","Molecular Biology","Biochemistry"],"extern":"1","citation":{"ieee":"Z. Liao <i>et al.</i>, “A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates the biosynthesis of the key precursor for ginkgolides,” <i>DNA Sequence</i>, vol. 15, no. 2. Informa UK Limited, pp. 153–158, 2004.","chicago":"Liao, Zhihua, Min Chen, Yifu Gong, Liang Guo, Qiumin Tan, Xiaoqi Feng, Xiaofen Sun, Feng Tan, and Kexuan Tang. “A New Geranylgeranyl Diphosphate Synthase Gene from Ginkgo Biloba, Which Intermediates the Biosynthesis of the Key Precursor for Ginkgolides.” <i>DNA Sequence</i>. Informa UK Limited, 2004. <a href=\"https://doi.org/10.1080/10425170410001667348\">https://doi.org/10.1080/10425170410001667348</a>.","ista":"Liao Z, Chen M, Gong Y, Guo L, Tan Q, Feng X, Sun X, Tan F, Tang K. 2004. A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates the biosynthesis of the key precursor for ginkgolides. DNA Sequence. 15(2), 153–158.","short":"Z. Liao, M. Chen, Y. Gong, L. Guo, Q. Tan, X. Feng, X. Sun, F. Tan, K. Tang, DNA Sequence 15 (2004) 153–158.","apa":"Liao, Z., Chen, M., Gong, Y., Guo, L., Tan, Q., Feng, X., … Tang, K. (2004). A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates the biosynthesis of the key precursor for ginkgolides. <i>DNA Sequence</i>. Informa UK Limited. <a href=\"https://doi.org/10.1080/10425170410001667348\">https://doi.org/10.1080/10425170410001667348</a>","ama":"Liao Z, Chen M, Gong Y, et al. A new geranylgeranyl Diphosphate synthase gene from Ginkgo biloba, which intermediates the biosynthesis of the key precursor for ginkgolides. <i>DNA Sequence</i>. 2004;15(2):153-158. doi:<a href=\"https://doi.org/10.1080/10425170410001667348\">10.1080/10425170410001667348</a>","mla":"Liao, Zhihua, et al. “A New Geranylgeranyl Diphosphate Synthase Gene from Ginkgo Biloba, Which Intermediates the Biosynthesis of the Key Precursor for Ginkgolides.” <i>DNA Sequence</i>, vol. 15, no. 2, Informa UK Limited, 2004, pp. 153–58, doi:<a href=\"https://doi.org/10.1080/10425170410001667348\">10.1080/10425170410001667348</a>."},"issue":"2","date_updated":"2023-05-08T10:58:29Z","author":[{"last_name":"Liao","full_name":"Liao, Zhihua","first_name":"Zhihua"},{"last_name":"Chen","full_name":"Chen, Min","first_name":"Min"},{"first_name":"Yifu","full_name":"Gong, Yifu","last_name":"Gong"},{"last_name":"Guo","full_name":"Guo, Liang","first_name":"Liang"},{"last_name":"Tan","full_name":"Tan, Qiumin","first_name":"Qiumin"},{"last_name":"Feng","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","full_name":"Feng, Xiaoqi"},{"full_name":"Sun, Xiaofen","first_name":"Xiaofen","last_name":"Sun"},{"last_name":"Tan","full_name":"Tan, Feng","first_name":"Feng"},{"last_name":"Tang","first_name":"Kexuan","full_name":"Tang, Kexuan"}],"page":"153-158","date_published":"2004-01-01T00:00:00Z"},{"article_type":"original","extern":"1","keyword":["Paleontology","Space and Planetary Science","Earth and Planetary Sciences (miscellaneous)","Atmospheric Science","Earth-Surface Processes","Geochemistry and Petrology","Soil Science","Water Science and Technology","Ecology","Aquatic Science","Forestry","Oceanography","Geophysics"],"language":[{"iso":"eng"}],"date_created":"2023-02-20T08:18:57Z","title":"Spatial and temporal variability of meteorological variables at Haut Glacier d'Arolla (Switzerland) during the ablation season 2001: Measurements and simulations","article_processing_charge":"No","scopus_import":"1","publication_identifier":{"issn":["0148-0227"]},"author":[{"full_name":"Strasser, Ulrich","first_name":"Ulrich","last_name":"Strasser"},{"full_name":"Corripio, Javier","first_name":"Javier","last_name":"Corripio"},{"last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca","first_name":"Francesca"},{"last_name":"Burlando","full_name":"Burlando, Paolo","first_name":"Paolo"},{"full_name":"Brock, Ben","first_name":"Ben","last_name":"Brock"},{"full_name":"Funk, Martin","first_name":"Martin","last_name":"Funk"}],"date_updated":"2023-02-20T08:40:21Z","issue":"D3","citation":{"short":"U. Strasser, J. Corripio, F. Pellicciotti, P. Burlando, B. Brock, M. Funk, Journal of Geophysical Research: Atmospheres 109 (2004).","ieee":"U. Strasser, J. Corripio, F. Pellicciotti, P. Burlando, B. Brock, and M. Funk, “Spatial and temporal variability of meteorological variables at Haut Glacier d’Arolla (Switzerland) during the ablation season 2001: Measurements and simulations,” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 109, no. D3. American Geophysical Union, 2004.","ista":"Strasser U, Corripio J, Pellicciotti F, Burlando P, Brock B, Funk M. 2004. Spatial and temporal variability of meteorological variables at Haut Glacier d’Arolla (Switzerland) during the ablation season 2001: Measurements and simulations. Journal of Geophysical Research: Atmospheres. 109(D3), D03103.","chicago":"Strasser, Ulrich, Javier Corripio, Francesca Pellicciotti, Paolo Burlando, Ben Brock, and Martin Funk. “Spatial and Temporal Variability of Meteorological Variables at Haut Glacier d’Arolla (Switzerland) during the Ablation Season 2001: Measurements and Simulations.” <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union, 2004. <a href=\"https://doi.org/10.1029/2003jd003973\">https://doi.org/10.1029/2003jd003973</a>.","mla":"Strasser, Ulrich, et al. “Spatial and Temporal Variability of Meteorological Variables at Haut Glacier d’Arolla (Switzerland) during the Ablation Season 2001: Measurements and Simulations.” <i>Journal of Geophysical Research: Atmospheres</i>, vol. 109, no. D3, D03103, American Geophysical Union, 2004, doi:<a href=\"https://doi.org/10.1029/2003jd003973\">10.1029/2003jd003973</a>.","ama":"Strasser U, Corripio J, Pellicciotti F, Burlando P, Brock B, Funk M. Spatial and temporal variability of meteorological variables at Haut Glacier d’Arolla (Switzerland) during the ablation season 2001: Measurements and simulations. <i>Journal of Geophysical Research: Atmospheres</i>. 2004;109(D3). doi:<a href=\"https://doi.org/10.1029/2003jd003973\">10.1029/2003jd003973</a>","apa":"Strasser, U., Corripio, J., Pellicciotti, F., Burlando, P., Brock, B., &#38; Funk, M. (2004). Spatial and temporal variability of meteorological variables at Haut Glacier d’Arolla (Switzerland) during the ablation season 2001: Measurements and simulations. <i>Journal of Geophysical Research: Atmospheres</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2003jd003973\">https://doi.org/10.1029/2003jd003973</a>"},"date_published":"2004-02-16T00:00:00Z","month":"02","oa_version":"None","publisher":"American Geophysical Union","year":"2004","type":"journal_article","day":"16","intvolume":"       109","status":"public","article_number":"D03103","fulldoi":"https://doi.org/10.1029/2003jd003973","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","volume":109,"doi":"10.1029/2003jd003973","abstract":[{"lang":"eng","text":"[1] During the ablation period 2001 a glaciometeorological experiment was carried out on Haut Glacier d'Arolla, Switzerland. Five meteorological stations were installed on the glacier, and one permanent automatic weather station in the glacier foreland. The altitudes of the stations ranged between 2500 and 3000 m a.s.l., and they were in operation from end of May to beginning of September 2001. The spatial arrangement of the stations and temporal duration of the measurements generated a unique data set enabling the analysis of the spatial and temporal variability of the meteorological variables across an alpine glacier. All measurements were taken at a nominal height of 2 m, and hourly averages were derived for the analysis. The wind regime was dominated by the glacier wind (mean value 2.8 m s−1) but due to erosion by the synoptic gradient wind, occasionally the wind would blow up the valley. A slight decrease in mean 2 m air temperatures with altitude was found, however the 2 m air temperature gradient varied greatly and frequently changed its sign. Mean relative humidity was 71% and exhibited limited spatial variation. Mean incoming shortwave radiation and albedo both generally increased with elevation. The different components of shortwave radiation are quantified with a parameterization scheme. Resulting spatial variations are mainly due to horizon obstruction and reflections from surrounding slopes, i.e., topography. The effect of clouds accounts for a loss of 30% of the extraterrestrial flux. Albedos derived from a Landsat TM image of 30 July show remarkably constant values, in the range 0.49 to 0.50, across snow covered parts of the glacier, while albedo is highly spatially variable below the zone of continuous snow cover. These results are verified with ground measurements and compared with parameterized albedo. Mean longwave radiative fluxes decreased with elevation due to lower air temperatures and the effect of upper hemisphere slopes. It is shown through parameterization that this effect would even be more pronounced without the effect of clouds. Results are discussed with respect to a similar study which has been carried out on Pasterze Glacier (Austria). The presented algorithms for interpolating, parameterizing and simulating variables and parameters in alpine regions are integrated in the software package AMUNDSEN which is freely available to be adapted and further developed by the community."}],"_id":"12658","publication":"Journal of Geophysical Research: Atmospheres","publication_status":"published"},{"intvolume":"        16","fulldoi":"https://doi.org/10.1002/adma.200400383","status":"public","type":"journal_article","year":"2004","publisher":"Wiley","oa_version":"None","day":"14","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","volume":16,"abstract":[{"lang":"eng","text":"Thin films of ionically doped gelatin have been color-patterned with submicrometer precision using the wet-stamping technique. Inorganic salts are delivered onto the gelatin surface from an agarose stamp, and diffuse into the gelatine layer, producting deeply colored precipitates. Reaction fronts originating from different features of the stamp cease within < 1 μm of each other, leaving sharp, transparent regions in between."}],"doi":"10.1002/adma.200400383","_id":"13434","publication_status":"published","publication":"Advanced Materials","article_type":"original","article_processing_charge":"No","title":"Color micro- and nanopatterning with counter-propagating reaction-diffusion fronts","publication_identifier":{"issn":["0935-9648"],"eissn":["1521-4095"]},"scopus_import":"1","keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"extern":"1","date_created":"2023-08-01T10:39:09Z","language":[{"iso":"eng"}],"issue":"21","citation":{"mla":"Campbell, C. J., et al. “Color Micro- and Nanopatterning with Counter-Propagating Reaction-Diffusion Fronts.” <i>Advanced Materials</i>, vol. 16, no. 21, Wiley, 2004, pp. 1912–17, doi:<a href=\"https://doi.org/10.1002/adma.200400383\">10.1002/adma.200400383</a>.","ama":"Campbell CJ, Fialkowski M, Klajn R, Bensemann IT, Grzybowski BA. Color micro- and nanopatterning with counter-propagating reaction-diffusion fronts. <i>Advanced Materials</i>. 2004;16(21):1912-1917. doi:<a href=\"https://doi.org/10.1002/adma.200400383\">10.1002/adma.200400383</a>","apa":"Campbell, C. J., Fialkowski, M., Klajn, R., Bensemann, I. T., &#38; Grzybowski, B. A. (2004). Color micro- and nanopatterning with counter-propagating reaction-diffusion fronts. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.200400383\">https://doi.org/10.1002/adma.200400383</a>","short":"C.J. Campbell, M. Fialkowski, R. Klajn, I.T. Bensemann, B.A. Grzybowski, Advanced Materials 16 (2004) 1912–1917.","ista":"Campbell CJ, Fialkowski M, Klajn R, Bensemann IT, Grzybowski BA. 2004. Color micro- and nanopatterning with counter-propagating reaction-diffusion fronts. Advanced Materials. 16(21), 1912–1917.","chicago":"Campbell, C. J., M. Fialkowski, Rafal Klajn, I. T. Bensemann, and B. A. Grzybowski. “Color Micro- and Nanopatterning with Counter-Propagating Reaction-Diffusion Fronts.” <i>Advanced Materials</i>. Wiley, 2004. <a href=\"https://doi.org/10.1002/adma.200400383\">https://doi.org/10.1002/adma.200400383</a>.","ieee":"C. J. Campbell, M. Fialkowski, R. Klajn, I. T. Bensemann, and B. A. Grzybowski, “Color micro- and nanopatterning with counter-propagating reaction-diffusion fronts,” <i>Advanced Materials</i>, vol. 16, no. 21. Wiley, pp. 1912–1917, 2004."},"author":[{"last_name":"Campbell","full_name":"Campbell, C. J.","first_name":"C. J."},{"full_name":"Fialkowski, M.","first_name":"M.","last_name":"Fialkowski"},{"id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal","first_name":"Rafal","last_name":"Klajn"},{"last_name":"Bensemann","full_name":"Bensemann, I. T.","first_name":"I. T."},{"last_name":"Grzybowski","first_name":"B. A.","full_name":"Grzybowski, B. A."}],"date_updated":"2023-08-08T12:41:23Z","month":"11","page":"1912-1917","date_published":"2004-11-14T00:00:00Z"},{"date_created":"2023-08-01T10:39:23Z","language":[{"iso":"eng"}],"keyword":["Mechanical Engineering","Mechanics of Materials","Condensed Matter Physics","General Materials Science","General Chemistry"],"extern":"1","publication_identifier":{"issn":["1476-1122"],"eissn":["1476-4660"]},"scopus_import":"1","title":"Multicolour micropatterning of thin films of dry gels","article_processing_charge":"No","external_id":{"pmid":["15378052"]},"article_type":"original","date_published":"2004-09-19T00:00:00Z","month":"09","page":"729-735","date_updated":"2023-08-08T12:42:51Z","author":[{"last_name":"Klajn","full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal"},{"full_name":"Fialkowski, Marcin","first_name":"Marcin","last_name":"Fialkowski"},{"full_name":"Bensemann, Igor T.","first_name":"Igor T.","last_name":"Bensemann"},{"first_name":"Agnieszka","full_name":"Bitner, Agnieszka","last_name":"Bitner"},{"last_name":"Campbell","first_name":"C. J.","full_name":"Campbell, C. J."},{"first_name":"Kyle","full_name":"Bishop, Kyle","last_name":"Bishop"},{"full_name":"Smoukov, Stoyan","first_name":"Stoyan","last_name":"Smoukov"},{"last_name":"Grzybowski","full_name":"Grzybowski, Bartosz A.","first_name":"Bartosz A."}],"citation":{"short":"R. Klajn, M. Fialkowski, I.T. Bensemann, A. Bitner, C.J. Campbell, K. Bishop, S. Smoukov, B.A. Grzybowski, Nature Materials 3 (2004) 729–735.","chicago":"Klajn, Rafal, Marcin Fialkowski, Igor T. Bensemann, Agnieszka Bitner, C. J. Campbell, Kyle Bishop, Stoyan Smoukov, and Bartosz A. Grzybowski. “Multicolour Micropatterning of Thin Films of Dry Gels.” <i>Nature Materials</i>. Springer Nature, 2004. <a href=\"https://doi.org/10.1038/nmat1231\">https://doi.org/10.1038/nmat1231</a>.","ista":"Klajn R, Fialkowski M, Bensemann IT, Bitner A, Campbell CJ, Bishop K, Smoukov S, Grzybowski BA. 2004. Multicolour micropatterning of thin films of dry gels. Nature Materials. 3, 729–735.","ieee":"R. Klajn <i>et al.</i>, “Multicolour micropatterning of thin films of dry gels,” <i>Nature Materials</i>, vol. 3. Springer Nature, pp. 729–735, 2004.","mla":"Klajn, Rafal, et al. “Multicolour Micropatterning of Thin Films of Dry Gels.” <i>Nature Materials</i>, vol. 3, Springer Nature, 2004, pp. 729–35, doi:<a href=\"https://doi.org/10.1038/nmat1231\">10.1038/nmat1231</a>.","ama":"Klajn R, Fialkowski M, Bensemann IT, et al. Multicolour micropatterning of thin films of dry gels. <i>Nature Materials</i>. 2004;3:729-735. doi:<a href=\"https://doi.org/10.1038/nmat1231\">10.1038/nmat1231</a>","apa":"Klajn, R., Fialkowski, M., Bensemann, I. T., Bitner, A., Campbell, C. J., Bishop, K., … Grzybowski, B. A. (2004). Multicolour micropatterning of thin films of dry gels. <i>Nature Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nmat1231\">https://doi.org/10.1038/nmat1231</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"day":"19","year":"2004","type":"journal_article","oa_version":"None","publisher":"Springer Nature","fulldoi":"https://doi.org/10.1038/nmat1231","status":"public","intvolume":"         3","publication":"Nature Materials","_id":"13435","publication_status":"published","abstract":[{"text":"Micropatterning of surfaces with several chemicals at different spatial locations usually requires multiple stamping and registration steps. Here, we describe an experimental method based on reaction–diffusion phenomena that allows for simultaneous micropatterning of a substrate with several coloured chemicals. In this method, called wet stamping (WETS), aqueous solutions of two or more inorganic salts are delivered onto a film of dry, ionically doped gelatin from an agarose stamp patterned in bas relief. Once in conformal contact, these salts diffuse into the gelatin, where they react to give deeply coloured precipitates. Separation of colours in the plane of the surface is the consequence of the differences in the diffusion coefficients, the solubility products, and the amounts of different salts delivered from the stamp, and is faithfully reproduced by a theoretical model based on a system of reaction–diffusion partial differential equations. The multicolour micropatterns are useful as non-binary optical elements, and could potentially form the basis of new applications in microseparations and in controlled delivery.","lang":"eng"}],"doi":"10.1038/nmat1231","volume":3,"quality_controlled":"1"},{"date_created":"2025-01-03T12:33:47Z","language":[{"iso":"eng"}],"extern":"1","publication_identifier":{"eisbn":["9781402024719"],"issn":["0067-0057"],"isbn":["9789048166626"]},"scopus_import":"1","title":"The Formation and Evolution of the First Massive Black Holes","article_processing_charge":"No","external_id":{"arxiv":["astro-ph/0403225"]},"date_published":"2004-08-03T00:00:00Z","month":"08","page":"147-185","date_updated":"2025-01-07T13:46:38Z","author":[{"id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán","full_name":"Haiman, Zoltán","orcid":"0000-0003-3633-5403","last_name":"Haiman"},{"last_name":"Quataert","full_name":"Quataert, Eliot","first_name":"Eliot"}],"citation":{"apa":"Haiman, Z., &#38; Quataert, E. (2004). The Formation and Evolution of the First Massive Black Holes. In <i>Supermassive Black Holes in the Distant Universe</i> (Vol. 308, pp. 147–185). Springer Nature. <a href=\"https://doi.org/10.1007/978-1-4020-2471-9_5\">https://doi.org/10.1007/978-1-4020-2471-9_5</a>","ama":"Haiman Z, Quataert E. The Formation and Evolution of the First Massive Black Holes. In: <i>Supermassive Black Holes in the Distant Universe</i>. Vol 308. ASSL. Springer Nature; 2004:147-185. doi:<a href=\"https://doi.org/10.1007/978-1-4020-2471-9_5\">10.1007/978-1-4020-2471-9_5</a>","mla":"Haiman, Zoltán, and Eliot Quataert. “The Formation and Evolution of the First Massive Black Holes.” <i>Supermassive Black Holes in the Distant Universe</i>, vol. 308, Springer Nature, 2004, pp. 147–85, doi:<a href=\"https://doi.org/10.1007/978-1-4020-2471-9_5\">10.1007/978-1-4020-2471-9_5</a>.","ieee":"Z. Haiman and E. Quataert, “The Formation and Evolution of the First Massive Black Holes,” in <i>Supermassive Black Holes in the Distant Universe</i>, vol. 308, Springer Nature, 2004, pp. 147–185.","ista":"Haiman Z, Quataert E. 2004.The Formation and Evolution of the First Massive Black Holes. In: Supermassive Black Holes in the Distant Universe. Astrophysics and Space Science Library, vol. 308, 147–185.","chicago":"Haiman, Zoltán, and Eliot Quataert. “The Formation and Evolution of the First Massive Black Holes.” In <i>Supermassive Black Holes in the Distant Universe</i>, 308:147–85. ASSL. Springer Nature, 2004. <a href=\"https://doi.org/10.1007/978-1-4020-2471-9_5\">https://doi.org/10.1007/978-1-4020-2471-9_5</a>.","short":"Z. Haiman, E. Quataert, in:, Supermassive Black Holes in the Distant Universe, Springer Nature, 2004, pp. 147–185."},"OA_place":"repository","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","series_title":"ASSL","day":"03","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/astro-ph/0403225"}],"type":"book_chapter","year":"2004","oa_version":"Preprint","publisher":"Springer Nature","fulldoi":"https://doi.org/10.1007/978-1-4020-2471-9_5","OA_type":"green","status":"public","intvolume":"       308","publication":"Supermassive Black Holes in the Distant Universe","_id":"18739","publication_status":"published","abstract":[{"lang":"eng","text":"The first massive astrophysical black holes likely formed at high redshifts (z≳ 10) at the centers of low mass (~ 106 M⊙) dark matter concentrations. These black holes grow by mergers and gas accretion, evolve into the population of bright quasars observed at lower redshifts, and eventually leave the supermassive black hole remnants that are ubiquitous at the centers of galaxies in the nearby universe. The astrophysical processes responsible for the formation of the earliest seed black holes are poorly understood. The purpose of this review is threefold: (1) to describe theoretical expectations for the formation and growth of the earliest black holes within the general paradigm of hierarchical cold dark matter cosmologies, (2) to summarize several relevant recent observations that have implications for the formation of the earliest black holes, and (3) to look into the future and assess the power of forthcoming observations to probe the physics of the first active galactic nuclei."}],"doi":"10.1007/978-1-4020-2471-9_5","volume":308,"quality_controlled":"1","alternative_title":["Astrophysics and Space Science Library"],"oa":1},{"extern":"1","language":[{"iso":"eng"}],"date_created":"2025-01-03T12:34:57Z","title":"On the dark side of quasar evolution","article_processing_charge":"No","scopus_import":"1","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"external_id":{"arxiv":["astro-ph/0405335"]},"article_type":"original","date_published":"2004-11-01T00:00:00Z","page":"130-134","month":"11","author":[{"last_name":"Menou","full_name":"Menou, Kristen","first_name":"Kristen"},{"last_name":"Haiman","orcid":"0000-0003-3633-5403","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán"}],"date_updated":"2025-01-07T14:02:29Z","arxiv":1,"OA_place":"repository","issue":"1","citation":{"mla":"Menou, Kristen, and Zoltán Haiman. “On the Dark Side of Quasar Evolution.” <i>The Astrophysical Journal</i>, vol. 615, no. 1, American Astronomical Society, 2004, pp. 130–34, doi:<a href=\"https://doi.org/10.1086/423951\">10.1086/423951</a>.","ama":"Menou K, Haiman Z. On the dark side of quasar evolution. <i>The Astrophysical Journal</i>. 2004;615(1):130-134. doi:<a href=\"https://doi.org/10.1086/423951\">10.1086/423951</a>","apa":"Menou, K., &#38; Haiman, Z. (2004). On the dark side of quasar evolution. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.1086/423951\">https://doi.org/10.1086/423951</a>","short":"K. Menou, Z. Haiman, The Astrophysical Journal 615 (2004) 130–134.","chicago":"Menou, Kristen, and Zoltán Haiman. “On the Dark Side of Quasar Evolution.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2004. <a href=\"https://doi.org/10.1086/423951\">https://doi.org/10.1086/423951</a>.","ista":"Menou K, Haiman Z. 2004. On the dark side of quasar evolution. The Astrophysical Journal. 615(1), 130–134.","ieee":"K. Menou and Z. Haiman, “On the dark side of quasar evolution,” <i>The Astrophysical Journal</i>, vol. 615, no. 1. American Astronomical Society, pp. 130–134, 2004."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Astronomical Society","oa_version":"Preprint","year":"2004","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/astro-ph/0405335"}],"day":"01","intvolume":"       615","status":"public","OA_type":"green","fulldoi":"https://doi.org/10.1086/423951","doi":"10.1086/423951","abstract":[{"lang":"eng","text":"Recent improved determinations of the mass density ρBH of supermassive black holes (SMBHs) in the local universe have allowed accurate comparisons of ρBH with the amount of light received from past quasar activity. These comparisons support the notion that local SMBHs are \"dead quasars\" and yield a value epsilon ≳ 0.1 for the average radiative efficiency of cosmic SMBH accretion. BH coalescences may represent an important component of the quasar mass assembly and yet not produce any observable electromagnetic signature. Therefore, ignoring gravitational wave (GW) emission during such coalescences, which reduces the amount of mass locked into remnant BHs, results in an overestimate of epsilon. Here we put constraints on the magnitude of this bias. We calculate the cumulative mass loss to GWs experienced by a representative population of BHs during repeated cosmological mergers, using loss prescriptions based on detailed general relativistic calculations. Despite the possibly large number of mergers in the assembly history of each individual SMBH, we find that near-equal mass mergers are rare; therefore, the cumulative loss is likely to be modest, amounting at most to a 20% increase in the inferred epsilon value. Thus, recent estimates of epsilon ≳ 0.1 appear robust. The space interferometer LISA should provide empirical constraints on the dark side of quasar evolution by measuring the masses and rates of coalescence of massive BHs to cosmological distances."}],"_id":"18742","publication":"The Astrophysical Journal","publication_status":"published","oa":1,"quality_controlled":"1","volume":615},{"title":"Monitoring Temporal Properties of Continuous Signals","article_processing_charge":"No","scopus_import":"1","conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:08:31Z","status":"public","fulldoi":"https://doi.org/10.1007/978-3-540-30206-3_12","publisher":"Springer","oa_version":"None","year":"2004","type":"conference","day":"14","acknowledgement":"This work was partially supported by the EC projects IST-2001-33520 CC (Control and Computation), IST-2001-35302 AMETIST (Advanced Methods for Timed Systems) and IST-2003-507219 PROSYD (Property-Based System Design).","page":"152 - 166","month":"12","doi":"10.1007/978-3-540-30206-3_12","publist_id":"1088","date_published":"2004-12-14T00:00:00Z","_id":"4372","publication_status":"published","citation":{"ama":"Maler O, Nickovic D. Monitoring Temporal Properties of Continuous Signals. In: Springer; 2004:152-166. doi:<a href=\"https://doi.org/10.1007/978-3-540-30206-3_12\">10.1007/978-3-540-30206-3_12</a>","mla":"Maler, Oded, and Dejan Nickovic. <i>Monitoring Temporal Properties of Continuous Signals</i>. Springer, 2004, pp. 152–66, doi:<a href=\"https://doi.org/10.1007/978-3-540-30206-3_12\">10.1007/978-3-540-30206-3_12</a>.","apa":"Maler, O., &#38; Nickovic, D. (2004). Monitoring Temporal Properties of Continuous Signals (pp. 152–166). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. <a href=\"https://doi.org/10.1007/978-3-540-30206-3_12\">https://doi.org/10.1007/978-3-540-30206-3_12</a>","short":"O. Maler, D. Nickovic, in:, Springer, 2004, pp. 152–166.","ieee":"O. Maler and D. Nickovic, “Monitoring Temporal Properties of Continuous Signals,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2004, pp. 152–166.","chicago":"Maler, Oded, and Dejan Nickovic. “Monitoring Temporal Properties of Continuous Signals,” 152–66. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30206-3_12\">https://doi.org/10.1007/978-3-540-30206-3_12</a>.","ista":"Maler O, Nickovic D. 2004. Monitoring Temporal Properties of Continuous Signals. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, , 152–166."},"alternative_title":["LNCS"],"quality_controlled":"1","author":[{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"first_name":"Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic"}],"date_updated":"2025-06-26T09:05:17Z"},{"citation":{"short":"R. Jhala, Program Verification by Lazy Abstraction, University of California, Berkeley, 2004.","chicago":"Jhala, Ranjit. “Program Verification by Lazy Abstraction.” University of California, Berkeley, 2004.","ista":"Jhala R. 2004. Program verification by lazy abstraction. University of California, Berkeley.","ieee":"R. Jhala, “Program verification by lazy abstraction,” University of California, Berkeley, 2004.","ama":"Jhala R. Program verification by lazy abstraction. 2004:1-165.","mla":"Jhala, Ranjit. <i>Program Verification by Lazy Abstraction</i>. University of California, Berkeley, 2004, pp. 1–165.","apa":"Jhala, R. (2004). <i>Program verification by lazy abstraction</i>. University of California, Berkeley."},"author":[{"full_name":"Jhala, Ranjit","first_name":"Ranjit","last_name":"Jhala"}],"date_updated":"2021-01-12T07:56:52Z","page":"1 - 165","month":"12","abstract":[{"lang":"eng","text":"The enormous cost and ubiquity of software errors necessitates the need for techniques and tools that can precisely analyze large systems and prove that they meet given specifications, or if they don't, return counterexample behaviors showing how the system fails. Recent advances in model checking, decision procedures, program analysis and type systems, and a shift of focus to partial specifications common to several systems (e.g., memory safety and race freedom) have resulted in several practical verification methods. However, these methods are either precise or they are scalable, depending on whether they track the values of variables or only a fixed small set of dataflow facts (e.g., types), and are usually insufficient for precisely verifying large programs.\r\n\r\nWe describe a new technique called Lazy Abstraction (LA) which achieves both precision and scalability by localizing the use of precise information. LA automatically builds, explores and refines a single abstract model of the program in a way that different parts of the model exhibit different degrees of precision, namely just enough to verify the desired property. The algorithm automatically mines the information required by partitioning mechanical proofs of unsatisfiability of spurious counterexamples into Craig Interpolants. For multithreaded systems, we give a new technique based on analyzing the behavior of a single thread executing in a context which is an abstraction of the other (arbitrarily many) threads. We define novel context models and show how to automatically infer them and analyze the full system (thread + context) using LA.\r\n\r\nLA is implemented in BLAST. We have run BLAST on Windows and Linux Device Drivers to verify API conformance properties, and have used it to find (or guarantee the absence of) data races in multithreaded Networked Embedded Systems (NESC) applications. BLAST is able to prove the absence of races in several cases where earlier methods, which depend on lock-based synchronization, fail."}],"date_published":"2004-12-01T00:00:00Z","publist_id":"307","publication_status":"published","_id":"4424","status":"public","oa_version":"None","publisher":"University of California, Berkeley","type":"dissertation","year":"2004","day":"01","title":"Program verification by lazy abstraction","article_processing_charge":"No","extern":"1","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:08:47Z"},{"language":[{"iso":"eng"}],"date_created":"2018-12-11T12:08:53Z","conference":{"end_date":"2004-09-29","location":"Pisa, Italy","name":"EMSOFT: Embedded Software ","start_date":"2004-09-27"},"extern":"1","scopus_import":"1","publication_identifier":{"isbn":["9781581138603"]},"article_processing_charge":"No","title":"A typed assembly language for real-time programs","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and by the NSF grants CCR- 0208875 and CCR-0225610.","publist_id":"285","date_published":"2004-09-27T00:00:00Z","page":"104 - 113","month":"09","date_updated":"2026-05-29T09:45:12Z","author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"}],"citation":{"ieee":"T. A. Henzinger and C. Kirsch, “A typed assembly language for real-time programs,” in <i>Proceedings of the 4th ACM international conference on Embedded software</i>, Pisa, Italy, 2004, pp. 104–113.","chicago":"Henzinger, Thomas A, and Christoph Kirsch. “A Typed Assembly Language for Real-Time Programs.” In <i>Proceedings of the 4th ACM International Conference on Embedded Software</i>, 104–13. Association for Computing Machinery, 2004. <a href=\"https://doi.org/10.1145/1017753.1017774\">https://doi.org/10.1145/1017753.1017774</a>.","ista":"Henzinger TA, Kirsch C. 2004. A typed assembly language for real-time programs. Proceedings of the 4th ACM international conference on Embedded software. EMSOFT: Embedded Software , 104–113.","short":"T.A. Henzinger, C. Kirsch, in:, Proceedings of the 4th ACM International Conference on Embedded Software, Association for Computing Machinery, 2004, pp. 104–113.","apa":"Henzinger, T. A., &#38; Kirsch, C. (2004). A typed assembly language for real-time programs. In <i>Proceedings of the 4th ACM international conference on Embedded software</i> (pp. 104–113). Pisa, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1017753.1017774\">https://doi.org/10.1145/1017753.1017774</a>","mla":"Henzinger, Thomas A., and Christoph Kirsch. “A Typed Assembly Language for Real-Time Programs.” <i>Proceedings of the 4th ACM International Conference on Embedded Software</i>, Association for Computing Machinery, 2004, pp. 104–13, doi:<a href=\"https://doi.org/10.1145/1017753.1017774\">10.1145/1017753.1017774</a>.","ama":"Henzinger TA, Kirsch C. A typed assembly language for real-time programs. In: <i>Proceedings of the 4th ACM International Conference on Embedded Software</i>. Association for Computing Machinery; 2004:104-113. doi:<a href=\"https://doi.org/10.1145/1017753.1017774\">10.1145/1017753.1017774</a>"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"27","oa_version":"None","publisher":"Association for Computing Machinery","type":"conference","year":"2004","OA_type":"closed access","status":"public","fulldoi":"https://doi.org/10.1145/1017753.1017774","publication":"Proceedings of the 4th ACM international conference on Embedded software","publication_status":"published","_id":"4445","doi":"10.1145/1017753.1017774","abstract":[{"text":"We present a type system for E code, which is an assembly language that manages the release, interaction, and termination of real-time tasks. E code specifies a deadline for each task, and the type system ensures that the deadlines are path-insensitive. We show that typed E programs allow, for given worst-case execution times of tasks, a simple schedulability analysis. Moreover, the real-time programming language Giotto can be compiled into typed E~code. This shows that typed E~code identifies an easily schedulable yet expressive class of real-time programs. We have extended the Giotto compiler to generate typed E code, and enabled the run-time system for E code to perform a type and schedulability check before executing the code.","lang":"eng"}],"quality_controlled":"1"},{"scopus_import":"1","publication_identifier":{"isbn":["9781581137293"]},"article_processing_charge":"No","title":"Abstractions from proofs","language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2018-12-11T12:08:57Z","conference":{"location":"Venice, Italy","end_date":"2004-01-16","name":"POPL: Principles of Programming Languages","start_date":"2004-01-14"},"extern":"1","status":"public","OA_type":"closed access","fulldoi":"https://doi.org/10.1145/964001.964021","day":"01","oa_version":"None","publisher":"Association for Computing Machinery","year":"2004","type":"conference","page":"232 - 244","month":"04","publication_status":"published","_id":"4458","publication":"Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages","abstract":[{"lang":"eng","text":"The success of model checking for large programs depends crucially on the ability to efficiently construct parsimonious abstractions. A predicate abstraction is parsimonious if at each control location, it specifies only relationships between current values of variables, and only those which are required for proving correctness. Previous methods for automatically refining predicate abstractions until sufficient precision is obtained do not systematically construct parsimonious abstractions: predicates usually contain symbolic variables, and are added heuristically and often uniformly to many or all control locations at once. We use Craig interpolation to efficiently construct, from a given abstract error trace which cannot be concretized, a parsominous abstraction that removes the trace. At each location of the trace, we infer the relevant predicates as an interpolant between the two formulas that define the past and the future segment of the trace. Each interpolant is a relationship between current values of program variables, and is relevant only at that particular program location. It can be found by a linear scan of the proof of infeasibility of the trace.We develop our method for programs with arithmetic and pointer expressions, and call-by-value function calls. For function calls, Craig interpolation offers a systematic way of generating relevant predicates that contain only the local variables of the function and the values of the formal parameters when the function was called. We have extended our model checker Blast with predicate discovery by Craig interpolation, and applied it successfully to C programs with more than 130,000 lines of code, which was not possible with approaches that build less parsimonious abstractions."}],"publist_id":"270","doi":"10.1145/964001.964021","date_published":"2004-04-01T00:00:00Z","citation":{"short":"T.A. Henzinger, R. Jhala, R. Majumdar, K. Mcmillan, in:, Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Association for Computing Machinery, 2004, pp. 232–244.","ista":"Henzinger TA, Jhala R, Majumdar R, Mcmillan K. 2004. Abstractions from proofs. Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. POPL: Principles of Programming Languages, 232–244.","chicago":"Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Kenneth Mcmillan. “Abstractions from Proofs.” In <i>Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, 232–44. Association for Computing Machinery, 2004. <a href=\"https://doi.org/10.1145/964001.964021\">https://doi.org/10.1145/964001.964021</a>.","ieee":"T. A. Henzinger, R. Jhala, R. Majumdar, and K. Mcmillan, “Abstractions from proofs,” in <i>Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages</i>, Venice, Italy, 2004, pp. 232–244.","ama":"Henzinger TA, Jhala R, Majumdar R, Mcmillan K. Abstractions from proofs. In: <i>Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>. Association for Computing Machinery; 2004:232-244. doi:<a href=\"https://doi.org/10.1145/964001.964021\">10.1145/964001.964021</a>","mla":"Henzinger, Thomas A., et al. “Abstractions from Proofs.” <i>Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages</i>, Association for Computing Machinery, 2004, pp. 232–44, doi:<a href=\"https://doi.org/10.1145/964001.964021\">10.1145/964001.964021</a>.","apa":"Henzinger, T. A., Jhala, R., Majumdar, R., &#38; Mcmillan, K. (2004). Abstractions from proofs. In <i>Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages</i> (pp. 232–244). Venice, Italy: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/964001.964021\">https://doi.org/10.1145/964001.964021</a>"},"date_updated":"2026-05-29T09:32:36Z","quality_controlled":"1","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jhala","full_name":"Jhala, Ranjit","first_name":"Ranjit"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"full_name":"Mcmillan, Kenneth","first_name":"Kenneth","last_name":"Mcmillan"}]},{"day":"09","type":"conference","year":"2004","oa_version":"None","publisher":"Association for Computing Machinery","fulldoi":"https://doi.org/10.1145/996841.996844","OA_type":"closed access","status":"public","date_created":"2018-12-11T12:08:57Z","language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","extern":"1","conference":{"start_date":"2004-06-09","location":"Washington, DC, United States","end_date":"2004-06-11","name":"PLDI: Programming Languages Design and Implementation"},"publication_identifier":{"isbn":["1581138075"]},"scopus_import":"1","article_processing_charge":"No","title":"Race checking by context inference","date_updated":"2026-05-29T09:37:45Z","author":[{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Jhala","full_name":"Jhala, Ranjit","first_name":"Ranjit"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"quality_controlled":"1","citation":{"short":"T.A. Henzinger, R. Jhala, R. Majumdar, in:, Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2004, pp. 1–13.","ieee":"T. A. Henzinger, R. Jhala, and R. Majumdar, “Race checking by context inference,” in <i>Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation</i>, Washington, DC, United States, 2004, pp. 1–13.","ista":"Henzinger TA, Jhala R, Majumdar R. 2004. Race checking by context inference. Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation. PLDI: Programming Languages Design and Implementation, 1–13.","chicago":"Henzinger, Thomas A, Ranjit Jhala, and Ritankar Majumdar. “Race Checking by Context Inference.” In <i>Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation</i>, 1–13. Association for Computing Machinery, 2004. <a href=\"https://doi.org/10.1145/996841.996844\">https://doi.org/10.1145/996841.996844</a>.","mla":"Henzinger, Thomas A., et al. “Race Checking by Context Inference.” <i>Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation</i>, Association for Computing Machinery, 2004, pp. 1–13, doi:<a href=\"https://doi.org/10.1145/996841.996844\">10.1145/996841.996844</a>.","ama":"Henzinger TA, Jhala R, Majumdar R. Race checking by context inference. In: <i>Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation</i>. Association for Computing Machinery; 2004:1-13. doi:<a href=\"https://doi.org/10.1145/996841.996844\">10.1145/996841.996844</a>","apa":"Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2004). Race checking by context inference. In <i>Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation</i> (pp. 1–13). Washington, DC, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/996841.996844\">https://doi.org/10.1145/996841.996844</a>"},"publication_status":"published","_id":"4459","publication":"Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation","date_published":"2004-06-09T00:00:00Z","doi":"10.1145/996841.996844","publist_id":"271","abstract":[{"text":"Software model checking has been successful for sequential programs, where predicate abstraction offers suitable models, and counterexample-guided abstraction refinement permits the automatic inference of models. When checking concurrent programs, we need to abstract threads as well as the contexts in which they execute. Stateless context models, such as predicates on global variables, prove insufficient for showing the absence of race conditions in many examples. We therefore use richer context models, which combine (1) predicates for abstracting data state, (2) control flow quotients for abstracting control state, and (3) counters for abstracting an unbounded number of threads. We infer suitable context models automatically by a combination of counterexample-guided abstraction refinement, bisimulation minimization, circular assume-guarantee reasoning, and parametric reasoning about an unbounded number of threads. This algorithm, called CIRC, has been implemented in BLAST and succeeds in checking many examples of NESC code for data races. In particular, BLAST proves the absence of races in several cases where previous race checkers give false positives.","lang":"eng"}],"month":"06","page":"1 - 13"},{"acknowledgement":"This work was supported in part by the NSF grants CCR-9988172, CCR-0085949, and CCR-0234690, the ONR grant N00014-02-1-0671, the DARPA grant F33615-00-C-1693, and the MARCO grant 98-DT-660. ","publication_identifier":{"isbn":["9783540210023"],"eisbn":["9783540399100"]},"title":"Extreme Model Checking","article_processing_charge":"No","date_created":"2018-12-11T12:08:58Z","language":[{"iso":"eng"}],"extern":"1","citation":{"short":"T.A. Henzinger, R. Jhala, R. Majumdar, M. Sanvido, in:, Verification: Theory and Practice, Springer Nature, Berlin, 2004, pp. 332–358.","ieee":"T. A. Henzinger, R. Jhala, R. Majumdar, and M. Sanvido, “Extreme Model Checking,” in <i>Verification: Theory and Practice</i>, vol. 2772, Berlin: Springer Nature, 2004, pp. 332–358.","chicago":"Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Marco Sanvido. “Extreme Model Checking.” In <i>Verification: Theory and Practice</i>, 2772:332–58. Lecture Notes in Computer Science. Berlin: Springer Nature, 2004. <a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">https://doi.org/10.1007/978-3-540-39910-0_16</a>.","ista":"Henzinger TA, Jhala R, Majumdar R, Sanvido M. 2004.Extreme Model Checking. In: Verification: Theory and Practice. Lecture Notes in Computer Science, vol. 2772, 332–358.","mla":"Henzinger, Thomas A., et al. “Extreme Model Checking.” <i>Verification: Theory and Practice</i>, vol. 2772, Springer Nature, 2004, pp. 332–58, doi:<a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">10.1007/978-3-540-39910-0_16</a>.","ama":"Henzinger TA, Jhala R, Majumdar R, Sanvido M. Extreme Model Checking. In: <i>Verification: Theory and Practice</i>. Vol 2772. Lecture Notes in Computer Science. Berlin: Springer Nature; 2004:332-358. doi:<a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">10.1007/978-3-540-39910-0_16</a>","apa":"Henzinger, T. A., Jhala, R., Majumdar, R., &#38; Sanvido, M. (2004). Extreme Model Checking. In <i>Verification: Theory and Practice</i> (Vol. 2772, pp. 332–358). Berlin: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">https://doi.org/10.1007/978-3-540-39910-0_16</a>"},"OA_place":"repository","date_updated":"2026-05-29T09:24:17Z","author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Jhala","first_name":"Ranjit","full_name":"Jhala, Ranjit"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"},{"last_name":"Sanvido","first_name":"Marco","full_name":"Sanvido, Marco"}],"month":"02","page":"332 - 358","publist_id":"269","date_published":"2004-02-24T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-3-540-39910-0_16","OA_type":"green","place":"Berlin","status":"public","intvolume":"      2772","main_file_link":[{"open_access":"1","url":"http://progsys.ucsd.edu/~rjhala/papers/extreme_model_checking.pdf"}],"day":"24","type":"book_chapter","year":"2004","oa_version":"Preprint","publisher":"Springer Nature","series_title":"Lecture Notes in Computer Science","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","volume":2772,"quality_controlled":"1","oa":1,"alternative_title":["Lecture Notes in Computer Science"],"publication":"Verification: Theory and Practice","_id":"4461","publication_status":"published","doi":"10.1007/978-3-540-39910-0_16","abstract":[{"text":"One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checking, it has become possible to supplement this process with automatic checks for behavioral safety properties of programs, such as conformance with locking idioms and other programming protocols and patterns. For efficiency reasons, all checks must be incremental, i.e., they must reuse partial results from previous checks in order to avoid all unnecessary repetition of expensive verification tasks. We show that the lazy-abstraction algorithm, and its implementation in Blast, can be extended to support the fully automatic and incremental checking of temporal safety properties during software development.","lang":"eng"}]},{"author":[{"last_name":"Ghosal","first_name":"Arkadeb","full_name":"Ghosal, Arkadeb"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph"},{"last_name":"Sanvido","full_name":"Sanvido, Marco","first_name":"Marco"}],"date_updated":"2026-05-29T09:15:20Z","OA_place":"repository","citation":{"ieee":"A. Ghosal, T. A. Henzinger, C. Kirsch, and M. Sanvido, “Event-driven programming with logical execution times,” presented at the HSCC: Hybrid Systems - Computation and Control, Philadelphia, PA, United States, 2004, pp. 357–371.","chicago":"Ghosal, Arkadeb, Thomas A Henzinger, Christoph Kirsch, and Marco Sanvido. “Event-Driven Programming with Logical Execution Times,” 357–71. Springer Nature, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">https://doi.org/10.1007/978-3-540-24743-2_24</a>.","ista":"Ghosal A, Henzinger TA, Kirsch C, Sanvido M. 2004. Event-driven programming with logical execution times. HSCC: Hybrid Systems - Computation and Control, Lecture Notes in Computer Science, , 357–371.","short":"A. Ghosal, T.A. Henzinger, C. Kirsch, M. Sanvido, in:, Springer Nature, 2004, pp. 357–371.","apa":"Ghosal, A., Henzinger, T. A., Kirsch, C., &#38; Sanvido, M. (2004). Event-driven programming with logical execution times (pp. 357–371). Presented at the HSCC: Hybrid Systems - Computation and Control, Philadelphia, PA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">https://doi.org/10.1007/978-3-540-24743-2_24</a>","mla":"Ghosal, Arkadeb, et al. <i>Event-Driven Programming with Logical Execution Times</i>. Springer Nature, 2004, pp. 357–71, doi:<a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">10.1007/978-3-540-24743-2_24</a>.","ama":"Ghosal A, Henzinger TA, Kirsch C, Sanvido M. Event-driven programming with logical execution times. In: Springer Nature; 2004:357-371. doi:<a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">10.1007/978-3-540-24743-2_24</a>"},"publist_id":"200","date_published":"2004-03-12T00:00:00Z","page":"357-371","month":"03","acknowledgement":"This research is supported by the AFOSR MURI grant F49620-00-1-0327, the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, and the NSF grants CCR-0208875 and CCR-0225610.","conference":{"location":"Philadelphia, PA, United States","end_date":"2004-03-27","name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2004-03-25"},"extern":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:09:18Z","title":"Event-driven programming with logical execution times","article_processing_charge":"No","publication_identifier":{"isbn":["9783540212591"],"eisbn":["9783540247432"]},"oa":1,"alternative_title":["Lecture Notes in Computer Science"],"quality_controlled":"1","abstract":[{"lang":"eng","text":"We present a new high-level programming language, called xGiotto, for programming applications with hard real-time constraints. Like its predecessor, xGiotto is based on the LET (logical execution time) assumption: the programmer specifies when the outputs of a task become available, and the compiler checks if the specification can be implemented on a given platform. However, while the predecessor language xGiotto was purely time-triggered, xGiotto accommodates also asynchronous events. Indeed, through a mechanism called event scoping, events are the main structuring principle of the new language. The xGiotto compiler and run-time system implement event scoping through a tree-based event filter. The compiler also checks programs for determinism (absence of race conditions)."}],"doi":"10.1007/978-3-540-24743-2_24","publication_status":"published","_id":"4525","publisher":"Springer Nature","oa_version":"Preprint","year":"2004","type":"conference","main_file_link":[{"open_access":"1","url":"https://www.cs.uni-salzburg.at/~ck/content/publications/conferences/HSCC04-EventDrivenProgramming.pdf"}],"day":"12","OA_type":"green","status":"public","fulldoi":"https://doi.org/10.1007/978-3-540-24743-2_24","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"}]