[{"extern":"1","publist_id":"2976","alternative_title":["Nato Science Series II"],"type":"conference","oa_version":"None","volume":166,"date_created":"2018-12-11T12:03:16Z","date_updated":"2021-01-12T07:43:23Z","author":[{"orcid":"0000-0003-4398-476X","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","last_name":"Bollenbach","first_name":"Mark Tobias","full_name":"Bollenbach, Mark Tobias"},{"first_name":"T.","last_name":"Strother","full_name":"Strother, T."},{"full_name":"Bauer, Wolfgang","first_name":"Wolfgang","last_name":"Bauer"}],"intvolume":" 166","publisher":"Springer","title":"3D supernova collapse calculations","status":"public","publication_status":"published","_id":"3425","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2003","article_processing_charge":"No","day":"01","month":"01","language":[{"iso":"eng"}],"date_published":"2003-01-01T00:00:00Z","doi":"10.1007/978-1-4020-2705-5_21","conference":{"name":"NATO ASI on Structure and Dynamics of Elementary Matter"},"page":"277 - 288","citation":{"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.","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","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.","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.","short":"M.T. Bollenbach, T. Strother, W. Bauer, in:, Springer, 2003, pp. 277–288."}},{"type":"book_chapter","extern":1,"publist_id":"2929","publication_status":"published","status":"public","title":"Molekulare und zelluläre Grundlagen des Nervensystems.","publisher":"Deutscher Ärzte Verlag","editor":[{"last_name":"Schmidt","first_name":"R.","full_name":"Schmidt, R. F."}],"_id":"3458","year":"2003","date_created":"2018-12-11T12:03:26Z","date_updated":"2021-01-12T07:43:35Z","volume":"B","author":[{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Peter Jonas"},{"first_name":"Klaus","last_name":"Unsicker","full_name":"Unsicker, Klaus"}],"day":"01","month":"01","quality_controlled":0,"page":"3 - 26","publication":"Lehrbuch Vorklinik","citation":{"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.","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.","ista":"Jonas PM, Unsicker K. 2003.Molekulare und zelluläre Grundlagen des Nervensystems. In: Lehrbuch Vorklinik. vol. B, 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.","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.","short":"P.M. Jonas, K. Unsicker, in:, R. Schmidt (Ed.), Lehrbuch Vorklinik, Deutscher Ärzte Verlag, 2003, pp. 3–26.","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."},"date_published":"2003-01-01T00:00:00Z"},{"type":"journal_article","extern":1,"issue":"1","publist_id":"2849","abstract":[{"lang":"eng","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. "}],"intvolume":" 116","publisher":"Elsevier","publication_status":"published","title":"Hippocampal network patterns of activity in the mouse","status":"public","_id":"3536","year":"2003","volume":116,"date_updated":"2021-01-12T07:44:09Z","date_created":"2018-12-11T12:03:50Z","author":[{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"},{"last_name":"Buhl","first_name":"Derek","full_name":"Buhl, Derek L"},{"full_name":"Harris, Kenneth D","last_name":"Harris","first_name":"Kenneth"},{"orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L","full_name":"Jozsef Csicsvari"},{"first_name":"Boldizsár","last_name":"Czéh","full_name":"Czéh, Boldizsár"},{"full_name":"Morozov, Alexei","last_name":"Morozov","first_name":"Alexei"}],"month":"01","day":"15","page":"201 - 211","quality_controlled":0,"citation":{"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.","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.","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","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","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.","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."},"publication":"Neuroscience","date_published":"2003-01-15T00:00:00Z","doi":"10.1016/S0306-4522(02)00669-3"},{"type":"conference","extern":1,"abstract":[{"lang":"eng","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."}],"publist_id":"2829","status":"public","title":"Morse-Smale complexes for piecewise linear 3-manifolds","publication_status":"published","publisher":"ACM","_id":"3556","year":"2003","date_created":"2018-12-11T12:03:57Z","date_updated":"2021-01-12T07:44:17Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Herbert Edelsbrunner"},{"last_name":"Harer","first_name":"John","full_name":"Harer, John"},{"full_name":"Natarajan, Vijay","last_name":"Natarajan","first_name":"Vijay"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"}],"day":"01","month":"06","quality_controlled":0,"page":"361 - 370","citation":{"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.","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.","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","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","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.","mla":"Edelsbrunner, Herbert, et al. Morse-Smale Complexes for Piecewise Linear 3-Manifolds. ACM, 2003, pp. 361–70, doi:10.1145/777792.777846.","short":"H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, ACM, 2003, pp. 361–370."},"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.9592","open_access":"0"}],"conference":{"name":"SCG: Symposium on Computational Geometry"},"doi":"10.1145/777792.777846","date_published":"2003-06-01T00:00:00Z"},{"publication":"Discrete & Computational Geometry","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.","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.","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","ista":"Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete & Computational Geometry. , 379–404.","ieee":"H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,” in Discrete & Computational Geometry, Springer, 2003, pp. 379–404.","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"},"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633","open_access":"0"}],"quality_controlled":0,"page":"379 - 404","date_published":"2003-06-23T00:00:00Z","doi":"10.1007/978-3-642-55566-4_17","month":"06","day":"23","_id":"3573","year":"2003","publication_status":"published","status":"public","title":"Surface reconstruction by wrapping finite sets in space","publisher":"Springer","author":[{"full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"}],"date_created":"2018-12-11T12:04:02Z","date_updated":"2021-01-12T07:44:24Z","type":"book_chapter","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","extern":1},{"status":"public","title":"Computing linking numbers of a filtration","publication_status":"published","intvolume":" 5","publisher":"International Press","_id":"3584","year":"2003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:04:05Z","date_updated":"2021-01-12T07:44:28Z","oa_version":"None","volume":5,"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Zomorodian, Afra","first_name":"Afra","last_name":"Zomorodian"}],"type":"journal_article","extern":"1","abstract":[{"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.","lang":"eng"}],"publist_id":"2801","issue":"2","quality_controlled":"1","page":"19 - 37","publication":"Homology, Homotopy and Applications","main_file_link":[{"url":"http://projecteuclid.org/euclid.hha/1088453320"}],"citation":{"chicago":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” Homology, Homotopy and Applications. International Press, 2003.","short":"H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003) 19–37.","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.","apa":"Edelsbrunner, H., & Zomorodian, A. (2003). Computing linking numbers of a filtration. Homology, Homotopy and Applications. International Press.","ista":"Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.","ama":"Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 2003;5(2):19-37."},"language":[{"iso":"eng"}],"date_published":"2003-04-22T00:00:00Z","day":"22","month":"04"},{"type":"journal_article","issue":"2","publist_id":"2763","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."}],"extern":1,"year":"2003","_id":"3620","intvolume":" 91","publisher":"Nature Publishing Group","title":"A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae)","status":"public","publication_status":"published","author":[{"last_name":"Nürnberger","first_name":"Beate","full_name":"Nürnberger, Beate"},{"first_name":"Sebastian","last_name":"Hofman","full_name":"Hofman, Sebastian"},{"full_name":"Förg-Brey, Bqruni","first_name":"Bqruni","last_name":"Förg Brey"},{"last_name":"Praetzel","first_name":"Gabriele","full_name":"Praetzel, Gabriele"},{"first_name":"Alan","last_name":"Maclean","full_name":"Maclean, Alan W"},{"first_name":"Jacek","last_name":"Szymura","full_name":"Szymura, Jacek M"},{"full_name":"Abbott, Catherine M","first_name":"Catherine","last_name":"Abbott"},{"full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"}],"volume":91,"date_created":"2018-12-11T12:04:17Z","date_updated":"2021-01-12T07:44:43Z","month":"08","day":"01","citation":{"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.","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.","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","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.","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","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."},"publication":"Heredity","page":"136 - 142","quality_controlled":0,"date_published":"2003-08-01T00:00:00Z","doi":"10.1038/sj.hdy.6800291"},{"month":"12","day":"01","doi":"10.1016/S0040-5809(03)00098-4","date_published":"2003-12-01T00:00:00Z","quality_controlled":0,"page":"451 - 471","publication":"Theoretical Population Biology","citation":{"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","ista":"Baird S, Barton NH, Etheridge A. 2003. The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. 64(4), 451–471.","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","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.","short":"S. Baird, N.H. Barton, A. Etheridge, Theoretical Population Biology 64 (2003) 451–471.","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."},"extern":1,"abstract":[{"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.","lang":"eng"}],"issue":"4","publist_id":"2764","type":"journal_article","date_updated":"2021-01-12T07:44:42Z","date_created":"2018-12-11T12:04:17Z","volume":64,"author":[{"first_name":"Stuart","last_name":"Baird","full_name":"Baird, Stuart J"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Nicholas Barton"},{"full_name":"Etheridge, Alison M","last_name":"Etheridge","first_name":"Alison"}],"status":"public","publication_status":"published","title":"The distribution of surviving blocks of an ancestral genome","intvolume":" 64","publisher":"Academic Press","_id":"3619","year":"2003"},{"year":"2003","_id":"3618","intvolume":" 12","publisher":"Wiley-Blackwell","publication_status":"published","title":"A new approach to detecting mixed families","status":"public","author":[{"last_name":"Vines","first_name":"Timothy","full_name":"Vines, Timothy H"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H","full_name":"Nicholas Barton"}],"volume":12,"date_created":"2018-12-11T12:04:16Z","date_updated":"2021-01-12T07:44:42Z","type":"journal_article","publist_id":"2765","issue":"7","abstract":[{"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.","lang":"eng"}],"extern":1,"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.","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.","short":"T. Vines, N.H. Barton, Molecular Ecology 12 (2003) 1999–2002.","ista":"Vines T, Barton NH. 2003. A new approach to detecting mixed families. Molecular Ecology. 12(7), 1999–2002.","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","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.","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"},"publication":"Molecular Ecology","page":"1999 - 2002","quality_controlled":0,"doi":"10.1046/j.1365-294X.2003.01867.x","date_published":"2003-07-01T00:00:00Z","day":"01","month":"07"},{"quality_controlled":0,"page":"471 - 476","publication":"Journal of Cell Biology","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2172934/?tool=pubmed","open_access":"1"}],"citation":{"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","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.","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.","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","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.","short":"J. Vilar, C.C. Guet, S. Leibler, Journal of Cell Biology 161 (2003) 471–476.","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."},"oa":1,"date_published":"2003-01-12T00:00:00Z","doi":"10.1083/jcb.200301125","month":"01","day":"12","publication_status":"published","title":"Modeling network dynamics: the lac operon, a case study","status":"public","publisher":"Rockefeller University Press","intvolume":" 161","year":"2003","_id":"3752","date_updated":"2021-01-12T07:51:57Z","date_created":"2018-12-11T12:04:58Z","volume":161,"author":[{"full_name":"Vilar,Jose M","last_name":"Vilar","first_name":"Jose"},{"full_name":"Calin Guet","first_name":"Calin C","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052"},{"last_name":"Leibler","first_name":"Stanislas","full_name":"Leibler, Stanislas"}],"type":"journal_article","extern":1,"abstract":[{"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.","lang":"eng"}],"publist_id":"2475","issue":"3"},{"date_published":"2003-01-01T00:00:00Z","language":[{"iso":"eng"}],"citation":{"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.","short":"W. Bauer, M. Kleine Berkenbusch, M.T. Bollenbach, Revista Mexicana De Fisica 49 (2003) 1–6.","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.","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.","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.","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.","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."},"publication":"Revista Mexicana De Fisica","page":"1 - 6","article_processing_charge":"No","day":"01","month":"01","author":[{"last_name":"Bauer","first_name":"Wolfgang","full_name":"Bauer, Wolfgang"},{"first_name":"Marco","last_name":"Kleine Berkenbusch","full_name":"Kleine Berkenbusch, Marco"},{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X","first_name":"Mark Tobias","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias"}],"volume":49,"oa_version":"None","date_updated":"2021-01-12T07:52:16Z","date_created":"2018-12-11T12:05:13Z","_id":"3797","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2003","intvolume":" 49","publisher":"Sociedad Mexicana de Física","publication_status":"published","title":"Breaking atomic nuclei into little pieces: evidence for a phase transition","status":"public","issue":"4","publist_id":"2413","extern":"1","type":"journal_article"},{"volume":2803,"date_created":"2018-12-11T12:05:46Z","date_updated":"2021-01-12T07:53:02Z","author":[{"full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Jurdziński, Marcin","first_name":"Marcin","last_name":"Jurdziński"},{"full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"intvolume":" 2803","publisher":"Springer","publication_status":"published","title":"Simple stochastic parity games","status":"public","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.","_id":"3897","year":"2003","extern":1,"publist_id":"2259","abstract":[{"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.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2003-08-18T00:00:00Z","doi":"10.1007/978-3-540-45220-1_11","conference":{"name":"CSL: Computer Science Logic"},"page":"100 - 113","quality_controlled":0,"citation":{"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.","short":"K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, Springer, 2003, pp. 100–113.","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.","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","ista":"Chatterjee K, Jurdziński M, Henzinger TA. 2003. Simple stochastic parity games. CSL: Computer Science Logic, LNCS, vol. 2803, 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","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."},"month":"08","day":"18"},{"author":[{"full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Ma, Di","first_name":"Di","last_name":"Ma"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar S"},{"last_name":"Zhao","first_name":"Tian","full_name":"Zhao, Tian"},{"full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"last_name":"Palsberg","first_name":"Jens","full_name":"Palsberg, Jens"}],"volume":2694,"date_created":"2018-12-11T12:05:46Z","date_updated":"2021-01-12T07:53:02Z","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.","_id":"3898","year":"2003","intvolume":" 2694","publisher":"Springer","publication_status":"published","title":"Stack size analysis for interrupt-driven programs","status":"public","publist_id":"2260","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."}],"extern":1,"type":"conference","alternative_title":["LNCS"],"doi":"10.1007/3-540-44898-5_7","date_published":"2003-05-28T00:00:00Z","conference":{"name":"SAS: Static Analysis Symposium"},"citation":{"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","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.","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.","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","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.","short":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, in:, Springer, 2003, pp. 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."},"page":"109 - 126","quality_controlled":0,"day":"28","month":"05"},{"day":"01","month":"07","publication":"Discrete & Computational Geometry","citation":{"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.","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.","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","ista":"Edelsbrunner H, Harer J, Zomorodian A. 2003. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete & Computational Geometry. 30(1), 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"},"quality_controlled":0,"page":"87 - 107","doi":"10.1007/s00454-003-2926-5","date_published":"2003-07-01T00:00:00Z","type":"journal_article","abstract":[{"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.","lang":"eng"}],"issue":"1","publist_id":"2134","extern":1,"acknowledgement":"Partially supported by ARO under Grant DAAG55-98-1-0177, NSF under Grants CCR-97-12088, EIA-9972879 and CCR-00-86013.","_id":"3993","year":"2003","publication_status":"published","title":"Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds","status":"public","publisher":"Springer","intvolume":" 30","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Herbert Edelsbrunner"},{"first_name":"John","last_name":"Harer","full_name":"Harer, John"},{"full_name":"Zomorodian, Afra","first_name":"Afra","last_name":"Zomorodian"}],"date_created":"2018-12-11T12:06:19Z","date_updated":"2021-01-12T07:53:43Z","volume":30},{"date_published":"2003-10-01T00:00:00Z","doi":"10.1016/S0925-7721(02)00124-4","page":"173 - 192","quality_controlled":0,"citation":{"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","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.","ista":"Cheng H, Edelsbrunner H. 2003. Area, perimeter and derivatives of a skin curve. Computational Geometry: Theory and Applications. 26(2), 173–192.","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","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.","short":"H. Cheng, H. Edelsbrunner, Computational Geometry: Theory and Applications 26 (2003) 173–192.","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."},"publication":"Computational Geometry: Theory and Applications","day":"01","month":"10","volume":26,"date_updated":"2021-01-12T07:53:43Z","date_created":"2018-12-11T12:06:20Z","author":[{"last_name":"Cheng","first_name":"Ho","full_name":"Cheng, Ho-Lun"},{"full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"publisher":"Elsevier","intvolume":" 26","status":"public","title":"Area, perimeter and derivatives of a skin curve","publication_status":"published","year":"2003","_id":"3994","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.","extern":1,"issue":"2","publist_id":"2135","abstract":[{"lang":"eng","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."}],"type":"journal_article"},{"author":[{"last_name":"Chen","first_name":"Hsiao","full_name":"Chen, Hsiao Huei"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Simon Hippenmeyer"},{"full_name":"Arber, Silvia","last_name":"Arber","first_name":"Silvia"},{"last_name":"Frank","first_name":"Eric","full_name":"Frank, Eric"}],"date_updated":"2019-04-26T07:22:24Z","date_created":"2018-12-11T12:01:37Z","volume":13,"year":"2003","_id":"3139","title":"Development of the monosynaptic stretch reflex circuit","publication_status":"published","status":"public","publisher":"Elsevier","intvolume":" 13","abstract":[{"lang":"eng","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."}],"publist_id":"3557","issue":"1","extern":1,"type":"review","date_published":"2003-02-01T00:00:00Z","doi":"10.1016/S0959-4388(03)00006-0","publication":"Current Opinion in Neurobiology","citation":{"short":"H. Chen, S. Hippenmeyer, S. Arber, E. Frank, Current Opinion in Neurobiology 13 (2003) 96–102.","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.","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.","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","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.","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."},"quality_controlled":0,"page":"96 - 102","day":"01","month":"02"},{"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.","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.","short":"V. Kolmogorov, R. Zabih, S. Gortler, in:, Springer, 2003, pp. 501–516.","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.","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.","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","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"},"quality_controlled":0,"page":"501 - 516","conference":{"name":"EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition"},"date_published":"2003-06-26T00:00:00Z","doi":"10.1007/978-3-540-45063-4_32","month":"06","day":"26","year":"2003","_id":"3171","title":"Generalized multi camera scene reconstruction using graph cuts","status":"public","publication_status":"published","publisher":"Springer","intvolume":" 2683","author":[{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"},{"full_name":"Zabih, Ramin","last_name":"Zabih","first_name":"Ramin"},{"full_name":"Gortler, Steven","last_name":"Gortler","first_name":"Steven"}],"date_created":"2018-12-11T12:01:48Z","date_updated":"2021-01-12T07:41:34Z","volume":2683,"type":"conference","alternative_title":["LNCS"],"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. "}],"publist_id":"3512","extern":1},{"author":[{"last_name":"Kim","first_name":"Junhwan","full_name":"Kim, Junhwan"},{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"},{"full_name":"Zabih, Ramin","last_name":"Zabih","first_name":"Ramin"}],"volume":2,"date_created":"2018-12-11T12:01:49Z","date_updated":"2021-01-12T07:41:35Z","_id":"3174","year":"2003","publisher":"IEEE","intvolume":" 2","status":"public","title":"Visual correspondence using energy minimization and mutual information","publication_status":"published","publist_id":"3510","abstract":[{"lang":"eng","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."}],"extern":1,"type":"conference","date_published":"2003-09-30T00:00:00Z","doi":"10.1109/ICCV.2003.1238463","conference":{"name":"ICCV: International Conference on Computer Vision"},"citation":{"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","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.","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","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.","short":"J. Kim, V. Kolmogorov, R. Zabih, in:, IEEE, 2003, pp. 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.","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."},"page":"1033 - 1040","quality_controlled":0,"month":"09","day":"30"},{"day":"30","month":"09","date_published":"2003-09-30T00:00:00Z","doi":"10.1109/ICCV.2003.1238310","conference":{"name":"ICCV: International Conference on Computer Vision"},"citation":{"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.","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.","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.","ista":"Boykov Y, Kolmogorov V. 2003. Computing geodesics and minimal surfaces via graph cuts. ICCV: International Conference on Computer Vision vol. 1, 26–33."},"page":"26 - 33","quality_controlled":0,"publist_id":"3511","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"}],"extern":1,"type":"conference","author":[{"first_name":"Yuri","last_name":"Boykov","full_name":"Boykov, Yuri"},{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"volume":1,"date_updated":"2021-01-12T07:41:33Z","date_created":"2018-12-11T12:01:48Z","_id":"3170","year":"2003","publisher":"IEEE","intvolume":" 1","title":"Computing geodesics and minimal surfaces via graph cuts","publication_status":"published","status":"public"},{"author":[{"full_name":"Harris, Kenneth D","first_name":"Kenneth","last_name":"Harris"},{"full_name":"Jozsef Csicsvari","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hirase, Hajima","first_name":"Hajima","last_name":"Hirase"},{"full_name":"Dragoi, George","first_name":"George","last_name":"Dragoi"},{"last_name":"Buzsáki","first_name":"György","full_name":"Buzsáki, György"}],"date_updated":"2021-01-12T07:44:04Z","date_created":"2018-12-11T12:03:47Z","volume":424,"year":"2003","_id":"3526","publication_status":"published","title":"Organization of cell assemblies in the hippocampus","status":"public","publisher":"Nature Publishing Group","intvolume":" 424","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."}],"publist_id":"2859","issue":"6948","extern":1,"type":"journal_article","date_published":"2003-07-31T00:00:00Z","doi":"0.1038/nature01834","publication":"Nature","citation":{"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.","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","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.","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.","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."},"quality_controlled":0,"page":"552 - 556","day":"31","month":"07"},{"volume":90,"date_updated":"2021-01-12T07:44:05Z","date_created":"2018-12-11T12:03:48Z","author":[{"full_name":"Jozsef Csicsvari","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"},{"first_name":"Darrell","last_name":"Henze","full_name":"Henze, Darrell A"},{"full_name":"Jamieson, Brian G","last_name":"Jamieson","first_name":"Brian"},{"full_name":"Harris, Kenneth D","last_name":"Harris","first_name":"Kenneth"},{"full_name":"Sirota, Anton M","last_name":"Sirota","first_name":"Anton"},{"full_name":"Bartho, Peter","last_name":"Bartho","first_name":"Peter"},{"last_name":"Wise","first_name":"Kensall","full_name":"Wise, Kensall D"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"publisher":"American Physiological Society","intvolume":" 90","status":"public","title":"Massively parallel recording of unit and local field potentials with silicon-based electrodes","publication_status":"published","year":"2003","_id":"3529","extern":1,"publist_id":"2856","issue":"2","abstract":[{"lang":"eng","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."}],"type":"journal_article","date_published":"2003-08-01T00:00:00Z","doi":"10.1152/jn.00116.2003","page":"1314 - 1323","quality_controlled":0,"citation":{"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.","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.","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.","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","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.","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.","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"},"publication":"Journal of Neurophysiology","month":"08","day":"01"},{"date_created":"2018-12-11T12:03:48Z","date_updated":"2021-01-12T07:44:05Z","volume":37,"author":[{"full_name":"Jozsef Csicsvari","first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"},{"first_name":"Brian","last_name":"Jamieson","full_name":"Jamieson, Brian G"},{"full_name":"Wise, Kensall D","last_name":"Wise","first_name":"Kensall"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"title":"Mechanisms of gamma oscillations in the hippocampus of the behaving rat","publication_status":"published","status":"public","publisher":"Elsevier","intvolume":" 37","year":"2003","_id":"3528","extern":1,"abstract":[{"lang":"eng","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."}],"publist_id":"2857","issue":"2","type":"journal_article","date_published":"2003-01-01T00:00:00Z","doi":"10.1016/S0896-6273(02)01169-8","quality_controlled":0,"page":"311 - 322","publication":"Neuron","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.","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","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.","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","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.","short":"J.L. Csicsvari, B. Jamieson, K. Wise, G. Buzsáki, Neuron 37 (2003) 311–322.","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."},"day":"01","month":"01"},{"abstract":[{"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.","lang":"eng"}],"publist_id":"2841","issue":"4","extern":1,"type":"journal_article","author":[{"full_name":"Sirota, Anton M","first_name":"Anton","last_name":"Sirota"},{"first_name":"Jozsef L","last_name":"Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","full_name":"Jozsef Csicsvari"},{"last_name":"Buhl","first_name":"Derek","full_name":"Buhl, Derek L"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"date_updated":"2021-01-12T07:44:12Z","date_created":"2018-12-11T12:03:53Z","volume":100,"year":"2003","_id":"3543","status":"public","title":"Communication between neocortex and hippocampus during sleep in rodents","publication_status":"published","publisher":"National Academy of Sciences","intvolume":" 100","day":"18","month":"02","date_published":"2003-02-18T00:00:00Z","doi":"10.1073/pnas.0437938100","publication":"PNAS","citation":{"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.","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","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.","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","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.","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.","short":"A. Sirota, J.L. Csicsvari, D. Buhl, G. Buzsáki, PNAS 100 (2003) 2065–2069."},"quality_controlled":0,"page":"2065 - 2069"},{"day":"01","month":"02","page":"205 - 232","quality_controlled":0,"citation":{"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","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.","ista":"Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.","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","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.","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."},"publication":"Journal of Automated Reasoning","date_published":"2003-02-01T00:00:00Z","doi":"10.1023/A:1023217515688","type":"journal_article","extern":1,"publist_id":"2790","issue":"2","abstract":[{"lang":"eng","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."}],"publisher":"Springer","intvolume":" 30","status":"public","publication_status":"published","title":"A branching time temporal framework for quantitative reasoning","year":"2003","_id":"3593","volume":30,"date_created":"2018-12-11T12:04:08Z","date_updated":"2021-01-12T07:44:31Z","author":[{"full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"first_name":"Pallab","last_name":"Dasgupta","full_name":"Dasgupta, Pallab"},{"full_name":"Chakrabarti, Partha P","first_name":"Partha","last_name":"Chakrabarti"}]},{"author":[{"full_name":"Christoph Lampert","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"date_created":"2018-12-11T12:04:34Z","date_updated":"2021-01-12T07:45:05Z","volume":356,"year":"2003","_id":"3678","publication_status":"published","status":"public","title":"The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ","intvolume":" 356","publisher":"Universität Bonn, Fachbibliothek Mathematik","publist_id":"2704","extern":1,"type":"dissertation","date_published":"2003-03-31T00:00:00Z","publication":"Bonner Mathematische Schriften","citation":{"ama":"Lampert C. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Bonner Mathematische Schriften. 2003;356:1-165.","ieee":"C. Lampert, “The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ,” Universität Bonn, Fachbibliothek Mathematik, 2003.","apa":"Lampert, C. (2003). The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Bonner Mathematische Schriften. Universität Bonn, Fachbibliothek Mathematik.","ista":"Lampert C. 2003. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Universität Bonn, Fachbibliothek Mathematik.","short":"C. Lampert, The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric , Universität Bonn, Fachbibliothek Mathematik, 2003.","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.","chicago":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” Bonner Mathematische Schriften. Universität Bonn, Fachbibliothek Mathematik, 2003."},"main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/lampert-phd2003.pdf","open_access":"0"}],"quality_controlled":0,"page":"1 - 165","day":"31","month":"03"},{"volume":22,"date_created":"2018-12-11T12:04:50Z","date_updated":"2021-01-12T07:51:45Z","author":[{"full_name":"Harald Janovjak","last_name":"Janovjak","first_name":"Harald L","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Max","last_name":"Kessler","full_name":"Kessler, Max"},{"first_name":"Dieter","last_name":"Oesterhelt","full_name":"Oesterhelt, Dieter"},{"first_name":"Hermann","last_name":"Gaub","full_name":"Gaub, Hermann"},{"last_name":"Mueller","first_name":"Daniel","full_name":"Mueller, Daniel J"}],"publisher":"Wiley-Blackwell","intvolume":" 22","status":"public","publication_status":"published","title":"Unfolding pathways of native bacteriorhodopsin depend on temperature","year":"2003","_id":"3725","extern":1,"issue":"19","publist_id":"2506","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."}],"type":"journal_article","date_published":"2003-01-01T00:00:00Z","doi":"10.1093/emboj/cdg509","page":"5220 - 5229","quality_controlled":0,"citation":{"short":"H.L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, D. Mueller, EMBO Journal 22 (2003) 5220–5229.","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.","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.","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","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.","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","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."},"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC204492/"}],"oa":1,"publication":"EMBO Journal","day":"01","month":"01"},{"month":"01","day":"01","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.","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.","short":"C. Lien, P.M. Jonas, Journal of Neuroscience 23 (2003) 2058–68.","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.","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.","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.","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."},"publication":"Journal of Neuroscience","page":"2058 - 68","quality_controlled":0,"date_published":"2003-01-01T00:00:00Z","type":"journal_article","publist_id":"2406","issue":"6","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"}],"extern":1,"year":"2003","_id":"3804","intvolume":" 23","publisher":"Society for Neuroscience","title":"Kv3 potassium conductance is necessary and kinetically optimized for high-frequency action potential generation in hippocampal interneurons","publication_status":"published","status":"public","author":[{"last_name":"Lien","first_name":"Cheng","full_name":"Lien, Cheng-Chang"},{"full_name":"Peter Jonas","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"volume":23,"date_updated":"2021-01-12T07:52:19Z","date_created":"2018-12-11T12:05:16Z"},{"publisher":"National Academy of Sciences","intvolume":" 100","title":"A large pool of releasable vesicles in a cortical glutamatergic synapse","publication_status":"published","status":"public","year":"2003","_id":"3806","volume":100,"date_created":"2018-12-11T12:05:16Z","date_updated":"2021-01-12T07:52:20Z","author":[{"full_name":"Hallermann, Stefan","first_name":"Stefan","last_name":"Hallermann"},{"first_name":"Christian","last_name":"Pawlu","full_name":"Pawlu, Christian"},{"full_name":"Peter Jonas","last_name":"Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Manfred","last_name":"Heckmann","full_name":"Heckmann, Manfred"}],"type":"journal_article","extern":1,"publist_id":"2405","issue":"15","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"}],"page":"8975 - 80","quality_controlled":0,"citation":{"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","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.","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.","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.","short":"S. Hallermann, C. Pawlu, P.M. Jonas, M. Heckmann, PNAS 100 (2003) 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."},"publication":"PNAS","date_published":"2003-01-01T00:00:00Z","doi":"10.1073/pnas.1432836100","day":"01","month":"01"},{"issue":"1","publist_id":"2233","abstract":[{"lang":"eng","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."}],"extern":"1","type":"journal_article","author":[{"last_name":"Anderson","first_name":"Carl","full_name":"Anderson, Carl"},{"full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer","first_name":"Sylvia"},{"full_name":"Heinze, Jürgen","last_name":"Heinze","first_name":"Jürgen"}],"oa_version":"None","volume":14,"date_created":"2018-12-11T12:05:54Z","date_updated":"2021-01-12T07:53:13Z","_id":"3921","year":"2003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Oxford University Press","intvolume":" 14","publication_status":"published","title":"Live and let die: Why fighter males of the ant Cardiocondyla kill each other but tolerate their winged rivals","status":"public","day":"01","month":"01","date_published":"2003-01-01T00:00:00Z","doi":"10.1093/beheco/14.1.54","language":[{"iso":"eng"}],"citation":{"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","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.","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","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.","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.","short":"C. Anderson, S. Cremer, J. Heinze, Behavioral Ecology 14 (2003) 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."},"publication":"Behavioral Ecology","page":"54 - 62"},{"_id":"3922","year":"2003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Cell Press","intvolume":" 13","publication_status":"published","title":"Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants","status":"public","author":[{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"}],"oa_version":"None","volume":13,"date_created":"2018-12-11T12:05:54Z","date_updated":"2021-01-12T07:53:13Z","type":"journal_article","publist_id":"2234","issue":"3","abstract":[{"lang":"eng","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."}],"extern":"1","citation":{"ista":"Cremer S, Heinze J. 2003. Stress grows wings: Environmental induction of winged dispersal males in Cardiocondyla ants. Current Biology. 13(3), 219–223.","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.","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","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","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.","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.","short":"S. Cremer, J. Heinze, Current Biology 13 (2003) 219–223."},"publication":"Current Biology","page":"219 - 223","date_published":"2003-02-04T00:00:00Z","doi":"10.1016/S0960-9822(03)00012-5","language":[{"iso":"eng"}],"day":"04","month":"02"},{"abstract":[{"lang":"eng","text":"Male dimorphism is not genetically determined, but is induced by environmental conditions particularly decreasing temperature and density."}],"issue":"15","publist_id":"2235","extern":"1","type":"journal_article","author":[{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","last_name":"Cremer"},{"full_name":"Heinze, Jürgen","first_name":"Jürgen","last_name":"Heinze"}],"date_updated":"2021-01-12T07:53:11Z","date_created":"2018-12-11T12:05:53Z","oa_version":"None","volume":12,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3917","year":"2003","title":"Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen","status":"public","publication_status":"published","publisher":"Schnell und Steiner","intvolume":" 12","day":"01","month":"01","date_published":"2003-01-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"Blick in die Wissenschaft","citation":{"apa":"Cremer, S., & Heinze, J. (2003). Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in Die Wissenschaft. Schnell und Steiner.","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.","ista":"Cremer S, Heinze J. 2003. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 12(15), 32–36.","ama":"Cremer S, Heinze J. Zwischen Hochzeitsflug und Brudermord: reproduktive Taktiken bei Ameisenmännchen. Blick in die Wissenschaft. 2003;12(15):32-36.","chicago":"Cremer, Sylvia, and Jürgen Heinze. “Zwischen Hochzeitsflug Und Brudermord: Reproduktive Taktiken Bei Ameisenmännchen.” Blick in Die Wissenschaft. Schnell und Steiner, 2003.","short":"S. Cremer, J. Heinze, Blick in Die Wissenschaft 12 (2003) 32–36.","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."},"page":"32 - 36"},{"day":"01","month":"12","article_processing_charge":"No","page":"1 - 201","citation":{"chicago":"Majumdar, Ritankar. “Symbolic Algorithms for Verification and Control.” University of California, Berkeley, 2003.","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.","ista":"Majumdar R. 2003. Symbolic algorithms for verification and control. University of California, Berkeley.","apa":"Majumdar, R. (2003). Symbolic algorithms for verification and control. University of California, Berkeley.","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."},"supervisor":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"date_published":"2003-12-01T00:00:00Z","type":"dissertation","extern":"1","abstract":[{"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.","lang":"eng"}],"publist_id":"313","title":"Symbolic algorithms for verification and control","publication_status":"published","status":"public","publisher":"University of California, Berkeley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"4416","year":"2003","date_updated":"2021-01-12T07:56:49Z","date_created":"2018-12-11T12:08:44Z","oa_version":"None","author":[{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}]},{"month":"10","day":"01","article_processing_charge":"No","page":"1 - 237","citation":{"chicago":"Horowitz, Benjamin. “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.","short":"B. Horowitz, Giotto: A Time-Triggered Language for Embedded Programming, University of California, Berkeley, 2003.","ista":"Horowitz B. 2003. Giotto: A time-triggered language for embedded programming. University of California, Berkeley.","apa":"Horowitz, B. (2003). Giotto: A time-triggered language for embedded programming. University of California, Berkeley.","ieee":"B. Horowitz, “Giotto: A time-triggered language for embedded programming,” University of California, Berkeley, 2003.","ama":"Horowitz B. Giotto: A time-triggered language for embedded programming. 2003:1-237."},"supervisor":[{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"language":[{"iso":"eng"}],"date_published":"2003-10-01T00:00:00Z","type":"dissertation","extern":"1","abstract":[{"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.","lang":"eng"}],"publist_id":"305","publication_status":"published","title":"Giotto: A time-triggered language for embedded programming","status":"public","publisher":"University of California, Berkeley","year":"2003","_id":"4425","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:56:53Z","date_created":"2018-12-11T12:08:47Z","oa_version":"None","author":[{"first_name":"Benjamin","last_name":"Horowitz","full_name":"Horowitz, Benjamin"}]},{"day":"28","month":"06","quality_controlled":0,"page":"2455 - 2463","publication":"Journal of Physics B: Atomic, Molecular and Optical Physics","citation":{"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.","short":"O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, M. Tosi, Journal of Physics B: Atomic, Molecular and Optical Physics 36 (2003) 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.","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","ista":"Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. 2003. Free expansion of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical Physics. 36(12), 2455–2463.","apa":"Hosten, O., Vignolo, P., Minguzzi, A., Tanatar, B., & 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","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."},"doi":"10.1088/0953-4075/36/12/306","date_published":"2003-06-28T00:00:00Z","type":"journal_article","extern":1,"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"}],"issue":"12","publist_id":"7239","status":"public","title":"Free expansion of two-dimensional condensates with a vortex","publication_status":"published","intvolume":" 36","publisher":"IOP Publishing Ltd.","year":"2003","_id":"576","date_updated":"2021-01-12T08:03:20Z","date_created":"2018-12-11T11:47:16Z","volume":36,"author":[{"first_name":"Onur","last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","full_name":"Onur Hosten"},{"full_name":"Vignolo, Patrizia","first_name":"Patrizia","last_name":"Vignolo"},{"first_name":"Anna","last_name":"Minguzzi","full_name":"Minguzzi, Anna"},{"last_name":"Tanatar","first_name":"Bilal","full_name":"Tanatar, Bilal"},{"first_name":"Mario","last_name":"Tosi","full_name":"Tosi, Mario P"}]},{"title":"Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation of NPR-1","status":"public","publication_status":"published","publisher":"Springer Nature","intvolume":" 6","_id":"6156","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2003","pmid":1,"date_updated":"2021-01-12T08:06:25Z","date_created":"2019-03-21T09:47:53Z","volume":6,"oa_version":"None","author":[{"full_name":"Rogers, Candida","last_name":"Rogers","first_name":"Candida"},{"full_name":"Reale, Vincenzina","first_name":"Vincenzina","last_name":"Reale"},{"last_name":"Kim","first_name":"Kyuhyung","full_name":"Kim, Kyuhyung"},{"last_name":"Chatwin","first_name":"Heather","full_name":"Chatwin, Heather"},{"last_name":"Li","first_name":"Chris","full_name":"Li, Chris"},{"full_name":"Evans, Peter","last_name":"Evans","first_name":"Peter"},{"full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8347-0443"}],"type":"journal_article","extern":"1","abstract":[{"lang":"eng","text":"Social and solitary feeding in natural Caenorhabditis elegans isolates are associated with two alleles of the orphan G-protein-coupled receptor (GPCR) NPR-1: social feeders contain NPR-1 215F, whereas solitary feeders contain NPR-1 215V. Here we identify FMRFamide-related neuropeptides (FaRPs) encoded by the flp-18 and flp-21 genes as NPR-1 ligands and show that these peptides can differentially activate the NPR-1 215F and NPR-1 215V receptors. Multicopy overexpression of flp-21 transformed wild social animals into solitary feeders. Conversely, a flp-21 deletion partially phenocopied the npr-1(null) phenotype, which is consistent with NPR-1 activation by FLP-21 in vivo but also implicates other ligands for NPR-1. Phylogenetic studies indicate that the dominant npr-1 215V allele likely arose from an ancestral npr-1 215F gene in C. elegans. Our data suggest a model in which solitary feeding evolved in an ancestral social strain of C. elegans by a gain-of-function mutation that modified the response of NPR-1 to FLP-18 and FLP-21 ligands."}],"issue":"11","quality_controlled":"1","page":"1178-1185","publication":"Nature Neuroscience","external_id":{"pmid":["14555955"]},"citation":{"short":"C. Rogers, V. Reale, K. Kim, H. Chatwin, C. Li, P. Evans, M. de Bono, Nature Neuroscience 6 (2003) 1178–1185.","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.","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.","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.","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","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."},"language":[{"iso":"eng"}],"date_published":"2003-10-12T00:00:00Z","doi":"10.1038/nn1140","month":"10","day":"12","publication_identifier":{"issn":["1097-6256","1546-1726"]}},{"publication_identifier":{"issn":["0022-3034","1097-4695"]},"month":"01","day":"01","page":"78-92","quality_controlled":"1","citation":{"chicago":"Bono, Mario de. “Molecular Approaches to Aggregation Behavior and Social Attachment.” Journal of Neurobiology. Wiley, 2003. https://doi.org/10.1002/neu.10162.","short":"M. de Bono, Journal of Neurobiology 54 (2003) 78–92.","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.","apa":"de Bono, M. (2003). Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. Wiley. https://doi.org/10.1002/neu.10162","ieee":"M. de Bono, “Molecular approaches to aggregation behavior and social attachment,” Journal of Neurobiology, vol. 54, no. 1. Wiley, pp. 78–92, 2003.","ista":"de Bono M. 2003. Molecular approaches to aggregation behavior and social attachment. Journal of Neurobiology. 54(1), 78–92.","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"},"external_id":{"pmid":["12486699"]},"publication":"Journal of Neurobiology","language":[{"iso":"eng"}],"date_published":"2003-01-01T00:00:00Z","doi":"10.1002/neu.10162","type":"journal_article","extern":"1","issue":"1","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"}],"publisher":"Wiley","intvolume":" 54","title":"Molecular approaches to aggregation behavior and social attachment","publication_status":"published","status":"public","pmid":1,"_id":"6157","year":"2003","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":54,"date_updated":"2021-01-12T08:06:26Z","date_created":"2019-03-21T09:52:31Z","author":[{"full_name":"de Bono, Mario","orcid":"0000-0001-8347-0443","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono","first_name":"Mario"}]},{"day":"15","month":"12","publication":"Human Molecular Genetics","citation":{"short":"S. Sunyaev, F. Kondrashov, P. Bork, V. Ramensky, Human Molecular Genetics 12 (2003) 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.","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.","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.","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","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."},"quality_controlled":0,"page":"3325 - 3330","date_published":"2003-12-15T00:00:00Z","doi":"10.1093/hmg/ddg359","type":"journal_article","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."}],"publist_id":"6803","issue":"24","extern":1,"_id":"847","year":"2003","acknowledgement":"We are grateful to Alexey Kondrashov and Alison Wellman for the careful reading of the manuscript and providing us with their valuable comments.","status":"public","title":"Impact of selection, mutation rate and genetic drift on human genetic variation","publication_status":"published","intvolume":" 12","publisher":"Oxford University Press","author":[{"first_name":"Shamil","last_name":"Sunyaev","full_name":"Sunyaev, Shamil R"},{"orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","first_name":"Fyodor","full_name":"Fyodor Kondrashov"},{"full_name":"Bork, Peer","last_name":"Bork","first_name":"Peer"},{"full_name":"Ramensky, Vasily","first_name":"Vasily","last_name":"Ramensky"}],"date_created":"2018-12-11T11:48:49Z","date_updated":"2021-01-12T08:19:29Z","volume":12},{"type":"journal_article","extern":1,"publist_id":"6776","issue":"3","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"}],"intvolume":" 19","publisher":"Elsevier","status":"public","publication_status":"published","title":"Evolution of alternative splicing: Deletions, insertions and origin of functional parts of proteins from intron sequences","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.","_id":"876","year":"2003","volume":19,"date_updated":"2021-01-12T08:20:58Z","date_created":"2018-12-11T11:48:58Z","author":[{"full_name":"Fyodor Kondrashov","first_name":"Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8243-4694"},{"full_name":"Koonin, Eugene V","first_name":"Eugene","last_name":"Koonin"}],"day":"01","month":"01","page":"115 - 119","quality_controlled":0,"citation":{"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.","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","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.","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","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.","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.","short":"F. Kondrashov, E. Koonin, Trends in Genetics 19 (2003) 115–119."},"publication":"Trends in Genetics","date_published":"2003-01-01T00:00:00Z","doi":"10.1016/S0168-9525(02)00029-X"},{"date_published":"2003-12-16T00:00:00Z","publication":"Current Biology","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.","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.","short":"X. Cao, W. Aufsatz, D. Zilberman, M.F. Mette, M.S. Huang, M. Matzke, S.E. Jacobsen, Current Biology 13 (2003) 2212–2217.","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.","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.","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","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"},"article_type":"original","page":"2212-2217","day":"16","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"9495","status":"public","title":"Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation","intvolume":" 13","abstract":[{"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.","lang":"eng"}],"issue":"24","type":"journal_article","doi":"10.1016/j.cub.2003.11.052","language":[{"iso":"eng"}],"oa":1,"external_id":{"pmid":["14680640"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cub.2003.11.052"}],"quality_controlled":"1","month":"12","publication_identifier":{"eissn":["1879-0445"],"issn":["0960-9822"]},"author":[{"full_name":"Cao, Xiaofeng","last_name":"Cao","first_name":"Xiaofeng"},{"last_name":"Aufsatz","first_name":"Werner","full_name":"Aufsatz, Werner"},{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman","first_name":"Daniel","full_name":"Zilberman, Daniel"},{"first_name":"M.Florian","last_name":"Mette","full_name":"Mette, M.Florian"},{"first_name":"Michael S.","last_name":"Huang","full_name":"Huang, Michael S."},{"first_name":"Marjori","last_name":"Matzke","full_name":"Matzke, Marjori"},{"last_name":"Jacobsen","first_name":"Steven E.","full_name":"Jacobsen, Steven E."}],"date_created":"2021-06-07T10:43:02Z","date_updated":"2021-12-14T08:41:38Z","volume":13,"year":"2003","pmid":1,"publication_status":"published","publisher":"Elsevier","department":[{"_id":"DaZi"}],"extern":"1"},{"keyword":["General Mathematics"],"publication_identifier":{"issn":["0020-9910","1432-1297"]},"article_processing_charge":"No","month":"03","day":"01","citation":{"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.","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.","short":"V. Kaloshin, Inventiones Mathematicae 151 (2003) 451–512.","ista":"Kaloshin V. 2003. The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles. Inventiones mathematicae. 151(3), 451–512.","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.","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"},"publication":"Inventiones mathematicae","page":"451-512","quality_controlled":"1","article_type":"original","doi":"10.1007/s00222-002-0244-9","date_published":"2003-03-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","issue":"3","extern":"1","_id":"8519","year":"2003","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 151","publisher":"Springer Nature","publication_status":"published","title":"The existential Hilbert 16-th problem and an estimate for cyclicity of elementary polycycles","status":"public","author":[{"last_name":"Kaloshin","first_name":"Vadim","orcid":"0000-0002-6051-2628","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","full_name":"Kaloshin, Vadim"}],"oa_version":"None","volume":151,"date_updated":"2021-01-12T08:19:50Z","date_created":"2020-09-18T10:49:26Z"},{"external_id":{"pmid":["12522258"]},"quality_controlled":"1","doi":"10.1126/science.1079695","language":[{"iso":"eng"}],"month":"01","publication_identifier":{"eissn":["1095-9203"],"issn":["0036-8075"]},"year":"2003","pmid":1,"publication_status":"published","department":[{"_id":"DaZi"}],"publisher":"American Association for the Advancement of Science","author":[{"first_name":"Daniel","last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel"},{"full_name":"Cao, Xiaofeng","last_name":"Cao","first_name":" Xiaofeng"},{"last_name":"Jacobsen","first_name":"Steven E.","full_name":"Jacobsen, Steven E."}],"date_updated":"2021-12-14T08:43:30Z","date_created":"2021-06-04T11:26:26Z","volume":299,"extern":"1","publication":"Science","citation":{"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","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.","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","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.","short":"D. Zilberman, Xiaofeng Cao, S.E. Jacobsen, Science 299 (2003) 716–719.","chicago":"Zilberman, Daniel, Xiaofeng Cao, and Steven E. Jacobsen. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science. American Association for the Advancement of Science, 2003. https://doi.org/10.1126/science.1079695."},"article_type":"original","page":"716-719","date_published":"2003-01-31T00:00:00Z","scopus_import":"1","keyword":["Multidisciplinary"],"day":"31","article_processing_charge":"No","_id":"9455","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","status":"public","title":"ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone methylation","intvolume":" 299","oa_version":"None","type":"journal_article","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"}],"issue":"5607"},{"publication":"Proceedings of the 30th International Colloquium on Automata, Languages and Programming","citation":{"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","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.","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","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.","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.","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.","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."},"page":"1022 - 1037","date_published":"2003-06-25T00:00:00Z","scopus_import":"1","day":"25","article_processing_charge":"No","_id":"4628","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","title":"Discounting the future in systems theory","intvolume":" 2719","oa_version":"None","type":"conference","alternative_title":["LNCS"],"abstract":[{"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.","lang":"eng"}],"quality_controlled":"1","conference":{"end_date":"2003-07-04","start_date":"2003-06-30","location":"Eindhoven, The Netherlands","name":"ICALP: Automata, Languages and Programming"},"doi":"10.1007/3-540-45061-0_79","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"isbn":["9783540404934"]},"acknowledgement":"This research was supported in part by the NSF CAREER award CCR-0132780, the DARPA grant F33615-C-98-3614, the NSF grants CCR-9988172, CCR-0234690 and CCR-0225610, and the ONR grant N00014-02-1-0671.","year":"2003","publication_status":"published","publisher":"Springer","author":[{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"}],"date_updated":"2023-07-26T13:07:31Z","date_created":"2018-12-11T12:09:50Z","volume":2719,"publist_id":"77","extern":"1"},{"month":"06","publication_identifier":{"eissn":["1464-5416"],"issn":["0040-4020"]},"quality_controlled":"1","doi":"10.1016/s0040-4020(03)00682-3","language":[{"iso":"eng"}],"extern":"1","year":"2003","publication_status":"published","publisher":"Elsevier","author":[{"first_name":"Anna","last_name":"Michrowska","full_name":"Michrowska, Anna"},{"last_name":"Bieniek","first_name":"Michał","full_name":"Bieniek, Michał"},{"last_name":"Kim","first_name":"Mikhail","full_name":"Kim, Mikhail"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","first_name":"Rafal"},{"last_name":"Grela","first_name":"Karol","full_name":"Grela, Karol"}],"date_updated":"2023-08-08T12:44:17Z","date_created":"2023-08-01T10:39:34Z","volume":59,"scopus_import":"1","keyword":["Organic Chemistry","Drug Discovery","Biochemistry"],"day":"16","article_processing_charge":"No","publication":"Tetrahedron","citation":{"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","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","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.","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.","short":"A. Michrowska, M. Bieniek, M. Kim, R. Klajn, K. Grela, Tetrahedron 59 (2003) 4525–4531.","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.","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."},"article_type":"original","page":"4525-4531","date_published":"2003-06-16T00:00:00Z","type":"journal_article","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"}],"issue":"25","_id":"13436","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Cross-metathesis reaction of vinyl sulfones and sulfoxides","status":"public","intvolume":" 59","oa_version":"None"},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-540-45212-6_9","conference":{"name":"EMSOFT: Embedded Software ","location":"Philadelphia, PA, USA","start_date":"2003-10-13","end_date":"2003-10-15"},"quality_controlled":"1","publication_identifier":{"isbn":["9783540202233"]},"month":"09","volume":2855,"date_created":"2018-12-11T12:09:29Z","date_updated":"2024-01-08T10:48:11Z","author":[{"full_name":"Chakrabarti, Arindam","first_name":"Arindam","last_name":"Chakrabarti"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Mariëlle","last_name":"Stoelinga","full_name":"Stoelinga, Mariëlle"}],"publisher":"ACM","publication_status":"published","acknowledgement":"This research was supported in part by the DARPA grant F33615-00-C-1693, the MARCO grant 98-DT-660, the ONR grant N00014-02-1-0671, and the NSF grants CCR-0085949, CCR-0132780, CCR-0234690, and CCR-9988172.","year":"2003","extern":"1","publist_id":"148","date_published":"2003-09-29T00:00:00Z","page":"117 - 133","citation":{"ista":"Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. 2003. Resource interfaces. Third International Conference on Embedded Software. EMSOFT: Embedded Software , LNCS, vol. 2855, 117–133.","apa":"Chakrabarti, A., De Alfaro, L., Henzinger, T. A., & 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","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.","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","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.","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.","short":"A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International Conference on Embedded Software, ACM, 2003, pp. 117–133."},"publication":"Third International Conference on Embedded Software","article_processing_charge":"No","day":"29","scopus_import":"1","oa_version":"None","intvolume":" 2855","status":"public","title":"Resource interfaces","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4561","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."}],"alternative_title":["LNCS"],"type":"conference"},{"conference":{"end_date":"2003-09-05","start_date":"2003-09-03","location":"Marseille, France","name":"CONCUR: Concurrency Theory"},"doi":"10.1007/978-3-540-45187-7_9","language":[{"iso":"eng"}],"quality_controlled":"1","month":"08","publication_identifier":{"isbn":["9783540407539"]},"author":[{"full_name":"De Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"last_name":"Faella","first_name":"Marco","full_name":"Faella, Marco"},{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"full_name":"Majumdar, Ritankar","last_name":"Majumdar","first_name":"Ritankar"},{"full_name":"Stoelinga, Mariëlle","last_name":"Stoelinga","first_name":"Mariëlle"}],"date_created":"2018-12-11T12:09:51Z","date_updated":"2024-01-08T10:05:30Z","volume":2761,"year":"2003","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.","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"78","extern":"1","date_published":"2003-08-21T00:00:00Z","publication":"Proceedings of the 14th International Conference on Concurrency Theory","citation":{"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.","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.","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.","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","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.","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","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."},"page":"144 - 158","day":"21","article_processing_charge":"No","scopus_import":"1","oa_version":"None","_id":"4630","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","title":"The element of surprise in timed games","intvolume":" 2761","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."}],"type":"conference","alternative_title":["LNCS"]},{"oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4468","intvolume":" 23","status":"public","title":"From control models to real-time code using Giotto","issue":"1","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"}],"type":"journal_article","date_published":"2003-01-29T00:00:00Z","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","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.","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","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.","short":"T.A. Henzinger, C. Kirsch, M. Sanvido, W. Pree, IEEE Control Systems Magazine 23 (2003) 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."},"publication":"IEEE Control Systems Magazine","page":"50 - 64","article_type":"original","article_processing_charge":"No","day":"29","scopus_import":"1","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph"},{"full_name":"Sanvido, Marco","first_name":"Marco","last_name":"Sanvido"},{"full_name":"Pree, Wolfgang","first_name":"Wolfgang","last_name":"Pree"}],"volume":23,"date_created":"2018-12-11T12:09:00Z","date_updated":"2024-01-08T10:54:53Z","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].","year":"2003","publisher":"IEEE","publication_status":"published","publist_id":"260","extern":"1","doi":"10.1109/MCS.2003.1172829","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"issn":["1066-033X "]},"month":"01"},{"page":"123 - 146","quality_controlled":"1","citation":{"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.","short":"T.A. Henzinger, B. Horowitz, C. Kirsch, in:, Software-Enabled Control: Information Technology for Dynamical Systems, Wiley-Blackwell, 2003, pp. 123–146.","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.","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.","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","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.","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"},"publication":"Software-Enabled Control: Information Technology for Dynamical Systems","language":[{"iso":"eng"}],"doi":"10.1002/047172288X.ch8","date_published":"2003-05-20T00:00:00Z","publication_identifier":{"isbn":["9780471234364 "]},"article_processing_charge":"No","month":"05","day":"20","publisher":"Wiley-Blackwell","publication_status":"published","title":"Embedded control systems development with Giotto","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4465","year":"2003","oa_version":"None","date_created":"2018-12-11T12:08:59Z","date_updated":"2024-01-08T12:24:01Z","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Horowitz, Benjamin","last_name":"Horowitz","first_name":"Benjamin"},{"first_name":"Christoph","last_name":"Kirsch","full_name":"Kirsch, Christoph"}],"type":"book_chapter","extern":"1","publist_id":"262","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."}]},{"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"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","intvolume":" 2619","status":"public","title":"On the universal and existential fragments of the mu-calculus","_id":"4466","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","day":"14","date_published":"2003-03-14T00:00:00Z","page":"49 - 64","citation":{"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.","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.","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","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","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.","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."},"publication":"Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems ","extern":"1","publist_id":"263","volume":2619,"date_updated":"2024-01-08T13:17:35Z","date_created":"2018-12-11T12:08:59Z","author":[{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"}],"publisher":"Springer","publication_status":"published","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.","year":"2003","publication_identifier":{"isbn":["9783540008989"]},"month":"03","language":[{"iso":"eng"}],"doi":"10.1007/3-540-36577-X_5","conference":{"end_date":"2003-04-11","location":"Warsaw, Poland","start_date":"2003-04-07","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"quality_controlled":"1"},{"quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"name":"SPIN: Model Checking Software","end_date":"2003-05-10","location":"Portland, OR, USA","start_date":"2003-05-09"},"doi":"10.1007/3-540-44829-2_17","month":"04","publication_identifier":{"isbn":["9783540401179"]},"publication_status":"published","publisher":"Springer","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.","year":"2003","date_created":"2018-12-11T12:09:00Z","date_updated":"2024-01-08T14:05:29Z","volume":2648,"author":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Jhala, Ranjit","first_name":"Ranjit","last_name":"Jhala"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar"},{"last_name":"Sutre","first_name":"Grégoire","full_name":"Sutre, Grégoire"}],"extern":"1","publist_id":"264","page":"235 - 239","publication":"Proceedings of the 10th International SPIN Workshop ","citation":{"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.","short":"T.A. Henzinger, R. Jhala, R. Majumdar, G. Sutre, in:, Proceedings of the 10th International SPIN Workshop , Springer, 2003, pp. 235–239.","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.","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","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.","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.","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"},"date_published":"2003-04-28T00:00:00Z","scopus_import":"1","day":"28","article_processing_charge":"No","status":"public","title":"Software verification with BLAST","intvolume":" 2648","_id":"4467","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa_version":"None","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","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. "}]},{"abstract":[{"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.","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","status":"public","title":"Thread-modular abstraction refinement","intvolume":" 2725","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4463","day":"27","article_processing_charge":"No","date_published":"2003-06-27T00:00:00Z","page":"262 - 274","publication":"Proceedings of the 15th International Conference on Computer Aided Verification","citation":{"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","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.","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.","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.","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.","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."},"extern":"1","publist_id":"266","date_created":"2018-12-11T12:08:59Z","date_updated":"2024-01-10T11:05:53Z","volume":2725,"author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"first_name":"Ranjit","last_name":"Jhala","full_name":"Jhala, Ranjit"},{"full_name":"Majumdar, Ritankar","first_name":"Ritankar","last_name":"Majumdar"},{"full_name":"Qadeer, Shaz","last_name":"Qadeer","first_name":"Shaz"}],"publication_status":"published","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.","year":"2003","month":"06","publication_identifier":{"isbn":["9783540405245"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2003-07-12","location":"Boulder, CO, USA","start_date":"2003-07-08","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-540-45069-6_27","quality_controlled":"1"}]