[{"article_type":"original","oa_version":"None","type":"journal_article","date_published":"2000-01-01T00:00:00Z","volume":100,"quality_controlled":"1","extern":"1","month":"01","publisher":"Springer","doi":"10.1023/A:1018667323830","date_updated":"2023-05-03T09:02:11Z","publication":"Journal of Statistical Physics","article_processing_charge":"No","day":"01","publist_id":"4160","publication_status":"published","date_created":"2018-12-11T11:59:18Z","page":"543 - 601","author":[{"first_name":"François","full_name":"Castella, François","last_name":"Castella"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"last_name":"Frommlet","first_name":"Florian","full_name":"Frommlet, Florian"},{"full_name":"Markowich, Peter","first_name":"Peter","last_name":"Markowich"}],"year":"2000","language":[{"iso":"eng"}],"citation":{"ama":"Castella F, Erdös L, Frommlet F, Markowich P. Fokker-Planck equations as scaling limits of reversible quantum systems. <i>Journal of Statistical Physics</i>. 2000;100(3-4):543-601. doi:<a href=\"https://doi.org/10.1023/A:1018667323830\">10.1023/A:1018667323830</a>","mla":"Castella, François, et al. “Fokker-Planck Equations as Scaling Limits of Reversible Quantum Systems.” <i>Journal of Statistical Physics</i>, vol. 100, no. 3–4, Springer, 2000, pp. 543–601, doi:<a href=\"https://doi.org/10.1023/A:1018667323830\">10.1023/A:1018667323830</a>.","chicago":"Castella, François, László Erdös, Florian Frommlet, and Peter Markowich. “Fokker-Planck Equations as Scaling Limits of Reversible Quantum Systems.” <i>Journal of Statistical Physics</i>. Springer, 2000. <a href=\"https://doi.org/10.1023/A:1018667323830\">https://doi.org/10.1023/A:1018667323830</a>.","ista":"Castella F, Erdös L, Frommlet F, Markowich P. 2000. Fokker-Planck equations as scaling limits of reversible quantum systems. Journal of Statistical Physics. 100(3–4), 543–601.","apa":"Castella, F., Erdös, L., Frommlet, F., &#38; Markowich, P. (2000). Fokker-Planck equations as scaling limits of reversible quantum systems. <i>Journal of Statistical Physics</i>. Springer. <a href=\"https://doi.org/10.1023/A:1018667323830\">https://doi.org/10.1023/A:1018667323830</a>","short":"F. Castella, L. Erdös, F. Frommlet, P. Markowich, Journal of Statistical Physics 100 (2000) 543–601.","ieee":"F. Castella, L. Erdös, F. Frommlet, and P. Markowich, “Fokker-Planck equations as scaling limits of reversible quantum systems,” <i>Journal of Statistical Physics</i>, vol. 100, no. 3–4. Springer, pp. 543–601, 2000."},"intvolume":"       100","status":"public","acknowledgement":"The authors are indebted to H. Spohn for discussions. F.C. and L.E. were partially supported by the Erwin Schrödinger Institute in Vienna (Austria) during their visit, and they thank this institution for its hospitality. This work was supported by the TMR-Network ``Asymptotic Methods in Kinetic Theory'' number ERB FMBX CT97 0157 (F.C., F.F., and P.A.M.) and by NSF Grant DMS-9970323 (L.E.).","title":"Fokker-Planck equations as scaling limits of reversible quantum systems","_id":"2732","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"We consider a quantum particle moving in a harmonic exterior potential and linearly coupled to a heat bath of quantum oscillators. Caldeira and Leggett derived the Fokker Planck equation with friction for the Wigner distribution of the particle in the large-temperature limit: however, their (nonrigorous) derivation was not free of criticism, especially since the limiting equation is not of Lindblad form. In this paper we recover the correct form of their result in a rigorous way. We also point out that the source of the diffusion is physically restrictive under this scaling. We investigate the model at a fixed temperature and in the large-time limit, where the origin of the diffusion is a cumulative effect of many resonant collisions. We obtain a heat equation with a friction term for the radial process in phase space and we prove the Einstein relation in this case.","lang":"eng"}],"publication_identifier":{"issn":["0022-4715"]},"issue":"3-4","scopus_import":"1"},{"status":"public","intvolume":"        50","citation":{"short":"L. Erdös, M. Loss, V. Vougalter, Annales de l’Institut Fourier 50 (2000) 891–907.","ieee":"L. Erdös, M. Loss, and V. Vougalter, “Diamagnetic behavior of sums Dirichlet eigenvalues,” <i>Annales de l’Institut Fourier</i>, vol. 50, no. 3. Association des Annales de l’Institut Fourier, pp. 891–907, 2000.","apa":"Erdös, L., Loss, M., &#38; Vougalter, V. (2000). Diamagnetic behavior of sums Dirichlet eigenvalues. <i>Annales de l’Institut Fourier</i>. Association des Annales de l’Institut Fourier. <a href=\"https://doi.org/10.5802/aif.1777\">https://doi.org/10.5802/aif.1777</a>","ista":"Erdös L, Loss M, Vougalter V. 2000. Diamagnetic behavior of sums Dirichlet eigenvalues. Annales de l’Institut Fourier. 50(3), 891–907.","chicago":"Erdös, László, Michael Loss, and Vitali Vougalter. “Diamagnetic Behavior of Sums Dirichlet Eigenvalues.” <i>Annales de l’Institut Fourier</i>. Association des Annales de l’Institut Fourier, 2000. <a href=\"https://doi.org/10.5802/aif.1777\">https://doi.org/10.5802/aif.1777</a>.","mla":"Erdös, László, et al. “Diamagnetic Behavior of Sums Dirichlet Eigenvalues.” <i>Annales de l’Institut Fourier</i>, vol. 50, no. 3, Association des Annales de l’Institut Fourier, 2000, pp. 891–907, doi:<a href=\"https://doi.org/10.5802/aif.1777\">10.5802/aif.1777</a>.","ama":"Erdös L, Loss M, Vougalter V. Diamagnetic behavior of sums Dirichlet eigenvalues. <i>Annales de l’Institut Fourier</i>. 2000;50(3):891-907. doi:<a href=\"https://doi.org/10.5802/aif.1777\">10.5802/aif.1777</a>"},"title":"Diamagnetic behavior of sums Dirichlet eigenvalues","_id":"2733","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"The Li-Yau semiclassical lower bound for the sum of the first N eigenvalues of the Dirichlet–Laplacian is extended to Dirichlet–Laplacians with constant magnetic fields. Our method involves a new diamagnetic inequality for constant magnetic fields.","lang":"eng"}],"issue":"3","publication_identifier":{"issn":["0373-0956"]},"scopus_import":"1","type":"journal_article","date_published":"2000-01-01T00:00:00Z","volume":50,"oa_version":"None","article_type":"original","date_updated":"2023-05-03T08:56:17Z","doi":"10.5802/aif.1777","publisher":"Association des Annales de l'Institut Fourier","publication":"Annales de l'Institut Fourier","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"01","page":"891 - 907","author":[{"last_name":"Erdös","orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László"},{"last_name":"Loss","full_name":"Loss, Michael","first_name":"Michael"},{"full_name":"Vougalter, Vitali","first_name":"Vitali","last_name":"Vougalter"}],"day":"01","publication_status":"published","publist_id":"4159","date_created":"2018-12-11T11:59:19Z","year":"2000","language":[{"iso":"eng"}]},{"date_published":"2000-06-09T00:00:00Z","type":"journal_article","volume":275,"article_type":"original","external_id":{"pmid":["10749852"]},"oa_version":"Published Version","article_processing_charge":"No","publisher":"American Society for Biochemistry and Molecular Biology","date_updated":"2023-05-03T08:47:13Z","doi":"10.1074/jbc.M000032200 ","publication":"Journal of Biological Chemistry","month":"06","quality_controlled":"1","oa":1,"extern":"1","author":[{"last_name":"Hwang","full_name":"Hwang, Jae","first_name":"Jae"},{"full_name":"Siekhaus, Daria E","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","last_name":"Siekhaus","orcid":"0000-0001-8323-8353"},{"last_name":"Fuller","first_name":"Robert","full_name":"Fuller, Robert"},{"first_name":"Paul","full_name":"Taghert, Paul","last_name":"Taghert"},{"last_name":"Lindberg","full_name":"Lindberg, Iris","first_name":"Iris"}],"page":"17886 - 17893","date_created":"2018-12-11T12:01:40Z","day":"09","publist_id":"3546","publication_status":"published","year":"2000","language":[{"iso":"eng"}],"status":"public","citation":{"chicago":"Hwang, Jae, Daria E Siekhaus, Robert Fuller, Paul Taghert, and Iris Lindberg. “Interaction of Drosophila Melanogaster Prohormone Convertase 2 and 7B2: Insect Cell Specific Processing and Secretion.” <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology, 2000. <a href=\"https://doi.org/10.1074/jbc.M000032200 \">https://doi.org/10.1074/jbc.M000032200 </a>.","ama":"Hwang J, Siekhaus DE, Fuller R, Taghert P, Lindberg I. Interaction of Drosophila melanogaster prohormone convertase 2 and 7B2: Insect cell specific processing and secretion. <i>Journal of Biological Chemistry</i>. 2000;275(23):17886-17893. doi:<a href=\"https://doi.org/10.1074/jbc.M000032200 \">10.1074/jbc.M000032200 </a>","mla":"Hwang, Jae, et al. “Interaction of Drosophila Melanogaster Prohormone Convertase 2 and 7B2: Insect Cell Specific Processing and Secretion.” <i>Journal of Biological Chemistry</i>, vol. 275, no. 23, American Society for Biochemistry and Molecular Biology, 2000, pp. 17886–93, doi:<a href=\"https://doi.org/10.1074/jbc.M000032200 \">10.1074/jbc.M000032200 </a>.","ieee":"J. Hwang, D. E. Siekhaus, R. Fuller, P. Taghert, and I. Lindberg, “Interaction of Drosophila melanogaster prohormone convertase 2 and 7B2: Insect cell specific processing and secretion,” <i>Journal of Biological Chemistry</i>, vol. 275, no. 23. American Society for Biochemistry and Molecular Biology, pp. 17886–17893, 2000.","short":"J. Hwang, D.E. Siekhaus, R. Fuller, P. Taghert, I. Lindberg, Journal of Biological Chemistry 275 (2000) 17886–17893.","ista":"Hwang J, Siekhaus DE, Fuller R, Taghert P, Lindberg I. 2000. Interaction of Drosophila melanogaster prohormone convertase 2 and 7B2: Insect cell specific processing and secretion. Journal of Biological Chemistry. 275(23), 17886–17893.","apa":"Hwang, J., Siekhaus, D. E., Fuller, R., Taghert, P., &#38; Lindberg, I. (2000). Interaction of Drosophila melanogaster prohormone convertase 2 and 7B2: Insect cell specific processing and secretion. <i>Journal of Biological Chemistry</i>. American Society for Biochemistry and Molecular Biology. <a href=\"https://doi.org/10.1074/jbc.M000032200 \">https://doi.org/10.1074/jbc.M000032200 </a>"},"intvolume":"       275","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0021925819833215?via%3Dihub"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"The prohormone convertases (PCs) are an evolutionarily ancient group of proteases required for the maturation of neuropeptide and peptide hormone precursors. In Drosophila melanogaster, the homolog of prohormone convertase 2, dPC2 (amontillado), is required for normal hatching behavior, and immunoblotting data indicate that flies express 80- and 75-kDa forms of this protein. Because mouse PC2 (mPC2) requires 7B2, a helper protein for productive maturation, we searched the fly data base for the 7B2 signature motif PPNPCP and identified an expressed sequence tag clone encoding the entire open reading frame for this protein. dPC2 and d7B2 cDNAs were subcloned into expression vectors for transfection into HEK-293 cells; mPC2 and rat 7B2 were used as controls. Although active mPC2 was detected in medium in the presence of either d7B2 or r7B2, dPC2 showed no proteolytic activity upon coexpression of either d7B2 or r7B2. Labeling experiments showed that dPC2 was synthesized but not secreted from HEK-293 cells. However, when dPC2 and either d7B2 or r7B2 were coexpressed in Drosophila S2 cells, abundant immunoreactive dPC2 was secreted into the medium, coincident with the appearance of PC2 activity. Expression and secretion of dPC2 enzyme activity thus appears to require insect cell-specific posttranslational processing events. The significant differences in the cell biology of the insect and mammalian enzymes, with 7B2 absolutely required for secretion of dPC2 and zymogen conversion occurring intracellularly in the case of dPC2 but not mPC2, support the idea that the Drosophila enzyme has specific requirements for maturation and secretion that can be met only in insect cells.","lang":"eng"}],"title":"Interaction of Drosophila melanogaster prohormone convertase 2 and 7B2: Insect cell specific processing and secretion","_id":"3149","pmid":1,"acknowledgement":"This work was supported by National Institutes of Health Grants DK49703 (to I. L.), NS21749 (to P. H. T.), and GM39697 (to R. S. F.). The costs of publication of this article were defrayed in part by the payment of page charges. This article must therefore be hereby marked “advertisement” in accordance with 18 U.S.C. Section 1734 solely to indicate this fact. 10749852. We thank members of the Lindberg laboratory and Laurent Muller for helpful comments, Bin Tu for construction of the C. elegans PC2 expression vector, and Joelle Finley for assistance with cell culture.","issue":"23","publication_identifier":{"issn":["0021-9258"]},"scopus_import":"1"},{"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-07-18T08:58:29Z","publisher":"Rockefeller University Press","doi":"10.1083/jcb.148.2.293","publication":"Journal of Cell Biology","article_type":"original","external_id":{"pmid":["10648562"]},"oa_version":"None","date_published":"2000-01-24T00:00:00Z","type":"journal_article","volume":148,"language":[{"iso":"eng"}],"year":"2000","date_created":"2022-04-07T07:57:49Z","day":"24","publication_status":"published","author":[{"full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","first_name":"Martin W","orcid":"0000-0002-2111-992X","last_name":"HETZER"},{"first_name":"Iain W.","full_name":"Mattaj, Iain W.","last_name":"Mattaj"}],"keyword":["Cell Biology"],"page":"293-304","pmid":1,"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","abstract":[{"lang":"eng","text":"Nuclear import of the two uracil-rich small nuclear ribonucleoprotein (U snRNP) components U1A and U2B′′ is mediated by unusually long and complex nuclear localization signals (NLSs). Here we investigate nuclear import of U1A and U2B′′ in vitro and demonstrate that it occurs by an active, saturable process. Several lines of evidence suggest that import of the two proteins occurs by an import mechanism different to those characterized previously. No cross competition is seen with a variety of previously studied NLSs. In contrast to import mediated by members of the importin-β family of nucleocytoplasmic transport receptors, U1A/U2B′′ import is not inhibited by either nonhydrolyzable guanosine triphosphate (GTP) analogues or by a mutant of the GTPase Ran that is incapable of GTP hydrolysis. Adenosine triphosphate is capable of supporting U1A and U2B′′ import, whereas neither nonhydrolyzable adenosine triphosphate analogues nor GTP can do so. U1A and U2B′′ import in vitro does not require the addition of soluble cytosolic proteins, but a factor or factors required for U1A and U2B′′ import remains tightly associated with the nuclear fraction of conventionally permeabilized cells. This activity can be solubilized in the presence of elevated MgCl2. These data suggest that U1A and U2B′′ import into the nucleus occurs by a hitherto uncharacterized mechanism."}],"title":"An Atp-dependent, Ran-independent mechanism for nuclear import of the U1a and U2b′′ spliceosome proteins","_id":"11126","intvolume":"       148","citation":{"mla":"Hetzer, Martin, and Iain W. Mattaj. “An Atp-Dependent, Ran-Independent Mechanism for Nuclear Import of the U1a and U2b′′ Spliceosome Proteins.” <i>Journal of Cell Biology</i>, vol. 148, no. 2, Rockefeller University Press, 2000, pp. 293–304, doi:<a href=\"https://doi.org/10.1083/jcb.148.2.293\">10.1083/jcb.148.2.293</a>.","ama":"Hetzer M, Mattaj IW. An Atp-dependent, Ran-independent mechanism for nuclear import of the U1a and U2b′′ spliceosome proteins. <i>Journal of Cell Biology</i>. 2000;148(2):293-304. doi:<a href=\"https://doi.org/10.1083/jcb.148.2.293\">10.1083/jcb.148.2.293</a>","chicago":"Hetzer, Martin, and Iain W. Mattaj. “An Atp-Dependent, Ran-Independent Mechanism for Nuclear Import of the U1a and U2b′′ Spliceosome Proteins.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2000. <a href=\"https://doi.org/10.1083/jcb.148.2.293\">https://doi.org/10.1083/jcb.148.2.293</a>.","apa":"Hetzer, M., &#38; Mattaj, I. W. (2000). An Atp-dependent, Ran-independent mechanism for nuclear import of the U1a and U2b′′ spliceosome proteins. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.148.2.293\">https://doi.org/10.1083/jcb.148.2.293</a>","ista":"Hetzer M, Mattaj IW. 2000. An Atp-dependent, Ran-independent mechanism for nuclear import of the U1a and U2b′′ spliceosome proteins. Journal of Cell Biology. 148(2), 293–304.","ieee":"M. Hetzer and I. W. Mattaj, “An Atp-dependent, Ran-independent mechanism for nuclear import of the U1a and U2b′′ spliceosome proteins,” <i>Journal of Cell Biology</i>, vol. 148, no. 2. Rockefeller University Press, pp. 293–304, 2000.","short":"M. Hetzer, I.W. Mattaj, Journal of Cell Biology 148 (2000) 293–304."},"status":"public","scopus_import":"1","publication_identifier":{"eissn":["1540-8140"],"issn":["0021-9525"]},"issue":"2"},{"scopus_import":"1","publication_identifier":{"issn":["1097-2765"]},"issue":"6","pmid":1,"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","abstract":[{"text":"Nuclear formation in Xenopus egg extracts requires cytosol and is inhibited by GTPγS, indicating a requirement for GTPase activity. Nuclear envelope (NE) vesicle fusion is extensively inhibited by GTPγS and two mutant forms of the Ran GTPase, Q69L and T24N. Depletion of either Ran or RCC1, the exchange factor for Ran, from the assembly reaction also inhibits this step of NE formation. Ran depletion can be complemented by the addition of Ran loaded with either GTP or GDP but not with GTPγS. RCC1 depletion is only complemented by RCC1 itself or by RanGTP. Thus, generation of RanGTP by RCC1 and GTP hydrolysis by Ran are both required for the extensive membrane fusion events that lead to NE formation.","lang":"eng"}],"title":"GTP hydrolysis by Ran is required for nuclear envelope assembly","_id":"11127","intvolume":"         5","citation":{"chicago":"Hetzer, Martin, Daniel Bilbao-Cortés, Tobias C Walther, Oliver J Gruss, and Iain W Mattaj. “GTP Hydrolysis by Ran Is Required for Nuclear Envelope Assembly.” <i>Molecular Cell</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1016/s1097-2765(00)80266-x\">https://doi.org/10.1016/s1097-2765(00)80266-x</a>.","ama":"Hetzer M, Bilbao-Cortés D, Walther TC, Gruss OJ, Mattaj IW. GTP hydrolysis by Ran is required for nuclear envelope assembly. <i>Molecular Cell</i>. 2000;5(6):1013-1024. doi:<a href=\"https://doi.org/10.1016/s1097-2765(00)80266-x\">10.1016/s1097-2765(00)80266-x</a>","mla":"Hetzer, Martin, et al. “GTP Hydrolysis by Ran Is Required for Nuclear Envelope Assembly.” <i>Molecular Cell</i>, vol. 5, no. 6, Elsevier, 2000, pp. 1013–24, doi:<a href=\"https://doi.org/10.1016/s1097-2765(00)80266-x\">10.1016/s1097-2765(00)80266-x</a>.","short":"M. Hetzer, D. Bilbao-Cortés, T.C. Walther, O.J. Gruss, I.W. Mattaj, Molecular Cell 5 (2000) 1013–1024.","ieee":"M. Hetzer, D. Bilbao-Cortés, T. C. Walther, O. J. Gruss, and I. W. Mattaj, “GTP hydrolysis by Ran is required for nuclear envelope assembly,” <i>Molecular Cell</i>, vol. 5, no. 6. Elsevier, pp. 1013–1024, 2000.","ista":"Hetzer M, Bilbao-Cortés D, Walther TC, Gruss OJ, Mattaj IW. 2000. GTP hydrolysis by Ran is required for nuclear envelope assembly. Molecular Cell. 5(6), 1013–1024.","apa":"Hetzer, M., Bilbao-Cortés, D., Walther, T. C., Gruss, O. J., &#38; Mattaj, I. W. (2000). GTP hydrolysis by Ran is required for nuclear envelope assembly. <i>Molecular Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/s1097-2765(00)80266-x\">https://doi.org/10.1016/s1097-2765(00)80266-x</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/S1097-2765(00)80266-X"}],"status":"public","language":[{"iso":"eng"}],"year":"2000","date_created":"2022-04-07T07:57:59Z","day":"01","publication_status":"published","author":[{"orcid":"0000-0002-2111-992X","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","first_name":"Martin W","full_name":"HETZER, Martin W"},{"last_name":"Bilbao-Cortés","full_name":"Bilbao-Cortés, Daniel","first_name":"Daniel"},{"first_name":"Tobias C","full_name":"Walther, Tobias C","last_name":"Walther"},{"last_name":"Gruss","full_name":"Gruss, Oliver J","first_name":"Oliver J"},{"last_name":"Mattaj","first_name":"Iain W","full_name":"Mattaj, Iain W"}],"keyword":["Cell Biology","Molecular Biology"],"page":"1013-1024","month":"06","oa":1,"quality_controlled":"1","extern":"1","article_processing_charge":"No","doi":"10.1016/s1097-2765(00)80266-x","date_updated":"2022-07-18T08:58:31Z","publisher":"Elsevier","publication":"Molecular Cell","external_id":{"pmid":["10911995"]},"oa_version":"Published Version","article_type":"original","date_published":"2000-06-01T00:00:00Z","type":"journal_article","volume":5},{"language":[{"iso":"eng"}],"year":"2000","day":"01","publication_status":"published","date_created":"2022-07-28T08:56:10Z","page":"222-250","keyword":["Computational Theory and Mathematics","Computational Mathematics","Control and Optimization"],"author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"first_name":"Satish","full_name":"Rao, Satish","last_name":"Rao"},{"last_name":"Gabow","first_name":"Harold N.","full_name":"Gabow, Harold N."}],"quality_controlled":"1","extern":"1","month":"02","date_updated":"2022-09-12T09:06:48Z","publisher":"Elsevier","doi":"10.1006/jagm.1999.1055","publication":"Journal of Algorithms","article_processing_charge":"No","oa_version":"None","article_type":"original","date_published":"2000-02-01T00:00:00Z","type":"journal_article","volume":34,"scopus_import":"1","publication_identifier":{"issn":["0196-6774"]},"issue":"2","title":"Computing vertex connectivity: New bounds from old techniques","_id":"11683","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The vertex connectivity κ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time for a digraph having n vertices and m edges is O(min{κ3 + n, κn}m); for an undirected graph the term m can be replaced by κn. A randomized algorithm finds κ with error probability 1/2 in time O(nm). If the vertices have nonnegative weights the weighted vertex connectivity is found in time O(κ1nmlog(n2/m)) where κ1 ≤ m/n is the unweighted vertex connectivity or in expected time O(nmlog(n2/m)) with error probability 1/2. The main algorithm combines two previous vertex connectivity algorithms and a generalization of the preflow-push algorithm of Hao and Orlin (1994, J. Algorithms17, 424–446) that computes edge connectivity."}],"citation":{"ama":"Henzinger MH, Rao S, Gabow HN. Computing vertex connectivity: New bounds from old techniques. <i>Journal of Algorithms</i>. 2000;34(2):222-250. doi:<a href=\"https://doi.org/10.1006/jagm.1999.1055\">10.1006/jagm.1999.1055</a>","mla":"Henzinger, Monika H., et al. “Computing Vertex Connectivity: New Bounds from Old Techniques.” <i>Journal of Algorithms</i>, vol. 34, no. 2, Elsevier, 2000, pp. 222–50, doi:<a href=\"https://doi.org/10.1006/jagm.1999.1055\">10.1006/jagm.1999.1055</a>.","chicago":"Henzinger, Monika H, Satish Rao, and Harold N. Gabow. “Computing Vertex Connectivity: New Bounds from Old Techniques.” <i>Journal of Algorithms</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1006/jagm.1999.1055\">https://doi.org/10.1006/jagm.1999.1055</a>.","ista":"Henzinger MH, Rao S, Gabow HN. 2000. Computing vertex connectivity: New bounds from old techniques. Journal of Algorithms. 34(2), 222–250.","apa":"Henzinger, M. H., Rao, S., &#38; Gabow, H. N. (2000). Computing vertex connectivity: New bounds from old techniques. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1006/jagm.1999.1055\">https://doi.org/10.1006/jagm.1999.1055</a>","short":"M.H. Henzinger, S. Rao, H.N. Gabow, Journal of Algorithms 34 (2000) 222–250.","ieee":"M. H. Henzinger, S. Rao, and H. N. Gabow, “Computing vertex connectivity: New bounds from old techniques,” <i>Journal of Algorithms</i>, vol. 34, no. 2. Elsevier, pp. 222–250, 2000."},"intvolume":"        34","status":"public"},{"quality_controlled":"1","extern":"1","month":"06","doi":"10.1016/s1389-1286(00)00055-4","publisher":"Elsevier","date_updated":"2022-09-12T09:09:13Z","publication":"Computer Networks","article_processing_charge":"No","article_type":"original","oa_version":"None","date_published":"2000-06-01T00:00:00Z","type":"journal_article","volume":33,"year":"2000","language":[{"iso":"eng"}],"day":"01","publication_status":"published","date_created":"2022-07-28T15:11:53Z","page":"295-308","author":[{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Allan","full_name":"Heydon, Allan","last_name":"Heydon"},{"last_name":"Mitzenmacher","first_name":"Michael","full_name":"Mitzenmacher, Michael"},{"last_name":"Najork","full_name":"Najork, Marc","first_name":"Marc"}],"keyword":["URL sampling","Random walks","Internet domain distribution","Search engine size"],"title":"On near-uniform URL sampling","_id":"11685","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the fraction of pages in various Internet domains or written in various languages. Moreover, uniform URL sampling can be used to determine the sizes of various search engines relative to the entire Web. In this paper, we consider sampling approaches based on random walks of the Web graph. In particular, we suggest ways of improving sampling based on random walks to make the samples closer to uniform. We suggest a natural test bed based on random graphs for testing the effectiveness of our procedures. We then use our sampling approach to estimate the distribution of pages over various Internet domains and to estimate the coverage of various search engine indexes."}],"intvolume":"        33","citation":{"apa":"Henzinger, M. H., Heydon, A., Mitzenmacher, M., &#38; Najork, M. (2000). On near-uniform URL sampling. <i>Computer Networks</i>. Elsevier. <a href=\"https://doi.org/10.1016/s1389-1286(00)00055-4\">https://doi.org/10.1016/s1389-1286(00)00055-4</a>","ista":"Henzinger MH, Heydon A, Mitzenmacher M, Najork M. 2000. On near-uniform URL sampling. Computer Networks. 33(1–6), 295–308.","short":"M.H. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks 33 (2000) 295–308.","ieee":"M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “On near-uniform URL sampling,” <i>Computer Networks</i>, vol. 33, no. 1–6. Elsevier, pp. 295–308, 2000.","mla":"Henzinger, Monika H., et al. “On Near-Uniform URL Sampling.” <i>Computer Networks</i>, vol. 33, no. 1–6, Elsevier, 2000, pp. 295–308, doi:<a href=\"https://doi.org/10.1016/s1389-1286(00)00055-4\">10.1016/s1389-1286(00)00055-4</a>.","ama":"Henzinger MH, Heydon A, Mitzenmacher M, Najork M. On near-uniform URL sampling. <i>Computer Networks</i>. 2000;33(1-6):295-308. doi:<a href=\"https://doi.org/10.1016/s1389-1286(00)00055-4\">10.1016/s1389-1286(00)00055-4</a>","chicago":"Henzinger, Monika H, Allan Heydon, Michael Mitzenmacher, and Marc Najork. “On Near-Uniform URL Sampling.” <i>Computer Networks</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1016/s1389-1286(00)00055-4\">https://doi.org/10.1016/s1389-1286(00)00055-4</a>."},"status":"public","scopus_import":"1","publication_identifier":{"issn":["1389-1286"]},"issue":"1-6"},{"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"issue":"4","scopus_import":"1","intvolume":"        29","citation":{"ieee":"S. Albers and M. H. Henzinger, “Exploring unknown environments,” <i>SIAM Journal on Computing</i>, vol. 29, no. 4. Society for Industrial and Applied Mathematics, pp. 1164–1188, 2000.","short":"S. Albers, M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1164–1188.","ista":"Albers S, Henzinger MH. 2000. Exploring unknown environments. SIAM Journal on Computing. 29(4), 1164–1188.","apa":"Albers, S., &#38; Henzinger, M. H. (2000). Exploring unknown environments. <i>SIAM Journal on Computing</i>. El Paso, TX, United States: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/s009753979732428x\">https://doi.org/10.1137/s009753979732428x</a>","chicago":"Albers, Susanne, and Monika H Henzinger. “Exploring Unknown Environments.” <i>SIAM Journal on Computing</i>. Society for Industrial and Applied Mathematics, 2000. <a href=\"https://doi.org/10.1137/s009753979732428x\">https://doi.org/10.1137/s009753979732428x</a>.","ama":"Albers S, Henzinger MH. Exploring unknown environments. <i>SIAM Journal on Computing</i>. 2000;29(4):1164-1188. doi:<a href=\"https://doi.org/10.1137/s009753979732428x\">10.1137/s009753979732428x</a>","mla":"Albers, Susanne, and Monika H. Henzinger. “Exploring Unknown Environments.” <i>SIAM Journal on Computing</i>, vol. 29, no. 4, Society for Industrial and Applied Mathematics, 2000, pp. 1164–88, doi:<a href=\"https://doi.org/10.1137/s009753979732428x\">10.1137/s009753979732428x</a>."},"status":"public","acknowledgement":"We thank Prabhakar Raghavan for bringing to our attention the literature on the s-t connectivity  problem. We also thank  an anonymous referee for many helpful comments which improved the presentation of the paper.","title":"Exploring unknown environments","_id":"11694","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connected graph. The robot's task is to visit all nodes and edges of the graph using the minimum number R of edge traversals. Deng and Papadimitriou [Proceedings of the 31st Symposium on the Foundations of Computer Science, 1990, pp. 356-361] showed an upper bound for R ofd O(d)m and Koutsoupias (reported by Deng and Papadimitriou) gave a lower bound of Ω≠(d2m), where m is the number of edges in the graph and d is the minimum number of edges that have to be added to make the graph Eulerian.  We give the 1rst subexponential algorithm for this exploration problem, which achieves an upper bound of dO(logd)m.  We also show a matching lower bound of d≠(logd)m for our algorithm. Additionally, we give lower bounds of 2≠(d)m, respectively, d≠(logd)m for various other natural exploration algorithms.","lang":"eng"}],"day":"01","publication_status":"published","date_created":"2022-07-29T09:04:36Z","conference":{"location":"El Paso, TX, United States","end_date":"1997-05-06","start_date":"1997-05-04","name":"STOC97: 29th Annual Symposium on Theory of Computing"},"page":"1164-1188","keyword":["directed graph","exploration algorithm"],"author":[{"full_name":"Albers, Susanne","first_name":"Susanne","last_name":"Albers"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"}],"language":[{"iso":"eng"}],"year":"2000","oa_version":"None","article_type":"original","date_published":"2000-07-01T00:00:00Z","type":"journal_article","volume":29,"quality_controlled":"1","extern":"1","month":"07","publisher":"Society for Industrial and Applied Mathematics","doi":"10.1137/s009753979732428x","date_updated":"2023-02-17T14:41:36Z","publication":"SIAM Journal on Computing","article_processing_charge":"No"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We compare several algorithms for identifying mirrored hosts on the World Wide Web. The algorithms operate on the basis of URL strings and linkage data: the type of information about Web pages easily available from Web proxies and crawlers. Identification of mirrored hosts can improve Web-based information retrieval in several ways: first, by identifying mirrored hosts, search engines can avoid storing and returning duplicate documents. Second, several new information retrieval techniques for the Web make inferences based on the explicit links among hypertext documents—mirroring perturbs their graph model and degrades performance. Third, mirroring information can be used to redirect users to alternate mirror sites to compensate for various failures, and can thus improve the performance of Web browsers and proxies. We evaluated four classes of “top-down” algorithms for detecting mirrored host pairs (that is, algorithms that are based on page attributes such as URL, IP address, and hyperlinks between pages, and not on the page content) on a collection of 140 million URLs (on 230,000 hosts) and their associated connectivity information. Our best approach is one which combines five algorithms and achieved a precision of 0.57 for a recall of 0.86 considering 100,000 ranked host pairs.","lang":"eng"}],"title":"A comparison of techniques to find mirrored hosts on the WWW","_id":"11770","intvolume":"        51","citation":{"short":"K. Bharat, A. Broder, J. Dean, M.H. Henzinger, Journal of the American Society for Information Science 51 (2000) 1114–1122.","ieee":"K. Bharat, A. Broder, J. Dean, and M. H. Henzinger, “A comparison of techniques to find mirrored hosts on the WWW,” <i>Journal of the American Society for Information Science</i>, vol. 51, no. 12. Wiley, pp. 1114–1122, 2000.","apa":"Bharat, K., Broder, A., Dean, J., &#38; Henzinger, M. H. (2000). A comparison of techniques to find mirrored hosts on the WWW. <i>Journal of the American Society for Information Science</i>. Wiley. <a href=\"https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0\">https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0</a>","ista":"Bharat K, Broder A, Dean J, Henzinger MH. 2000. A comparison of techniques to find mirrored hosts on the WWW. Journal of the American Society for Information Science. 51(12), 1114–1122.","chicago":"Bharat, Krishna, Andrei Broder, Jeffrey Dean, and Monika H Henzinger. “A Comparison of Techniques to Find Mirrored Hosts on the WWW.” <i>Journal of the American Society for Information Science</i>. Wiley, 2000. <a href=\"https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0\">https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0</a>.","mla":"Bharat, Krishna, et al. “A Comparison of Techniques to Find Mirrored Hosts on the WWW.” <i>Journal of the American Society for Information Science</i>, vol. 51, no. 12, Wiley, 2000, pp. 1114–22, doi:<a href=\"https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0\">10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0</a>.","ama":"Bharat K, Broder A, Dean J, Henzinger MH. A comparison of techniques to find mirrored hosts on the WWW. <i>Journal of the American Society for Information Science</i>. 2000;51(12):1114-1122. doi:<a href=\"https://doi.org/10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0\">10.1002/1097-4571(2000)9999:9999&#60;::aid-asi1025&#62;3.0.co;2-0</a>"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0"}],"status":"public","scopus_import":"1","publication_identifier":{"issn":["0002-8231","1097-4571"]},"issue":"12","month":"10","oa":1,"quality_controlled":"1","extern":"1","article_processing_charge":"No","doi":"10.1002/1097-4571(2000)9999:9999<::aid-asi1025>3.0.co;2-0","publisher":"Wiley","date_updated":"2023-02-10T08:27:19Z","publication":"Journal of the American Society for Information Science","article_type":"original","oa_version":"Published Version","type":"journal_article","date_published":"2000-10-01T00:00:00Z","volume":51,"language":[{"iso":"eng"}],"year":"2000","date_created":"2022-08-08T12:57:37Z","day":"01","publication_status":"published","author":[{"first_name":"Krishna","full_name":"Bharat, Krishna","last_name":"Bharat"},{"full_name":"Broder, Andrei","first_name":"Andrei","last_name":"Broder"},{"last_name":"Dean","first_name":"Jeffrey","full_name":"Dean, Jeffrey"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"}],"page":"1114-1122"},{"volume":1879,"type":"conference","date_published":"2000-09-01T00:00:00Z","status":"public","oa_version":"None","intvolume":"      1879","citation":{"apa":"Henzinger, M. H. (2000). Web information retrieval - an algorithmic perspective. In <i>8th Annual European Symposium on Algorithms</i> (Vol. 1879, pp. 1–8). Saarbrücken, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-45253-2_1\">https://doi.org/10.1007/3-540-45253-2_1</a>","ista":"Henzinger MH. 2000. Web information retrieval - an algorithmic perspective. 8th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 1879, 1–8.","short":"M.H. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer Nature, 2000, pp. 1–8.","ieee":"M. H. Henzinger, “Web information retrieval - an algorithmic perspective,” in <i>8th Annual European Symposium on Algorithms</i>, Saarbrücken, Germany, 2000, vol. 1879, pp. 1–8.","mla":"Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.” <i>8th Annual European Symposium on Algorithms</i>, vol. 1879, Springer Nature, 2000, pp. 1–8, doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_1\">10.1007/3-540-45253-2_1</a>.","ama":"Henzinger MH. Web information retrieval - an algorithmic perspective. In: <i>8th Annual European Symposium on Algorithms</i>. Vol 1879. Springer Nature; 2000:1–8. doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_1\">10.1007/3-540-45253-2_1</a>","chicago":"Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.” In <i>8th Annual European Symposium on Algorithms</i>, 1879:1–8. Springer Nature, 2000. <a href=\"https://doi.org/10.1007/3-540-45253-2_1\">https://doi.org/10.1007/3-540-45253-2_1</a>."},"abstract":[{"text":"In this paper we survey algorithmic aspects of Web information retrieval. As an example, we discuss ranking of search engine results using connectivity analysis.","lang":"eng"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"8th Annual European Symposium on Algorithms","_id":"11802","doi":"10.1007/3-540-45253-2_1","title":"Web information retrieval - an algorithmic perspective","publisher":"Springer Nature","date_updated":"2023-02-13T12:08:21Z","month":"09","extern":"1","quality_controlled":"1","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"page":"1–8","alternative_title":["LNCS"],"conference":{"end_date":"2000-09-08","location":"Saarbrücken, Germany","name":"ESA: European Symposium on Algorithms","start_date":"2000-09-05"},"date_created":"2022-08-11T13:25:07Z","publication_identifier":{"isbn":["9783540410041"],"eisbn":["9783540452539"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publication_status":"published","day":"01","scopus_import":"1","language":[{"iso":"eng"}],"year":"2000"},{"publisher":"Society for Industrial & Applied Mathematics","title":"Improved data structures for fully dynamic biconnectivity","doi":"10.1137/s0097539794263907","date_updated":"2023-02-17T14:39:47Z","publication":"SIAM Journal on Computing","_id":"11893","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","abstract":[{"text":"We present fully dynamic algorithms for maintaining the biconnected components in general and plane graphs.\r\n\r\nA fully dynamic algorithm maintains a graph during a sequence of insertions and deletions of edges or isolated vertices. Let m be the number of edges and n be the number of vertices in a graph. The time per operation of the best deterministic algorithms is 𝑂(𝑛√) in general graphs and O(log n) in plane graphs for fully dynamic connectivity and O(min m2/3 ,n}) in general graphs and 𝑂(𝑛√) in plane graphs for fully dynamic biconnectivity. We improve the later running times to 𝑂(𝑚log𝑛‾‾‾‾‾‾‾√) in general graphs and O(log 2n ) in plane graphs. Our algorithm for general graphscan also find the biconnected components of all vertices in time O(n).","lang":"eng"}],"quality_controlled":"1","extern":"1","month":"11","status":"public","type":"journal_article","date_published":"2000-11-01T00:00:00Z","volume":29,"intvolume":"        29","citation":{"ista":"Henzinger MH. 2000. Improved data structures for fully dynamic biconnectivity. SIAM Journal on Computing. 29(6), 1761–1815.","apa":"Henzinger, M. H. (2000). Improved data structures for fully dynamic biconnectivity. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/s0097539794263907\">https://doi.org/10.1137/s0097539794263907</a>","ieee":"M. H. Henzinger, “Improved data structures for fully dynamic biconnectivity,” <i>SIAM Journal on Computing</i>, vol. 29, no. 6. Society for Industrial &#38; Applied Mathematics, pp. 1761–1815, 2000.","short":"M.H. Henzinger, SIAM Journal on Computing 29 (2000) 1761–1815.","ama":"Henzinger MH. Improved data structures for fully dynamic biconnectivity. <i>SIAM Journal on Computing</i>. 2000;29(6):1761-1815. doi:<a href=\"https://doi.org/10.1137/s0097539794263907\">10.1137/s0097539794263907</a>","mla":"Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.” <i>SIAM Journal on Computing</i>, vol. 29, no. 6, Society for Industrial &#38; Applied Mathematics, 2000, pp. 1761–815, doi:<a href=\"https://doi.org/10.1137/s0097539794263907\">10.1137/s0097539794263907</a>.","chicago":"Henzinger, Monika H. “Improved Data Structures for Fully Dynamic Biconnectivity.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2000. <a href=\"https://doi.org/10.1137/s0097539794263907\">https://doi.org/10.1137/s0097539794263907</a>."},"article_type":"original","oa_version":"None","language":[{"iso":"eng"}],"year":"2000","scopus_import":"1","page":"1761-1815","author":[{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"}],"issue":"6","day":"01","publication_status":"published","date_created":"2022-08-17T08:45:41Z","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]}},{"year":"1999","language":[{"iso":"eng"}],"date_created":"2020-09-18T10:50:28Z","publication_identifier":{"issn":["0003-486X"]},"publication_status":"published","day":"01","author":[{"orcid":"0000-0002-6051-2628","last_name":"Kaloshin","full_name":"Kaloshin, Vadim","first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425"}],"keyword":["Statistics","Probability and Uncertainty","Statistics and Probability"],"issue":"2","page":"729-741","month":"09","extern":"1","quality_controlled":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"8526","publication":"The Annals of Mathematics","publisher":"JSTOR","doi":"10.2307/121093","date_updated":"2021-01-12T08:19:53Z","title":"An extension of the Artin-Mazur theorem","article_type":"original","oa_version":"None","intvolume":"       150","citation":{"mla":"Kaloshin, Vadim. “An Extension of the Artin-Mazur Theorem.” <i>The Annals of Mathematics</i>, vol. 150, no. 2, JSTOR, 1999, pp. 729–41, doi:<a href=\"https://doi.org/10.2307/121093\">10.2307/121093</a>.","ama":"Kaloshin V. An extension of the Artin-Mazur theorem. <i>The Annals of Mathematics</i>. 1999;150(2):729-741. doi:<a href=\"https://doi.org/10.2307/121093\">10.2307/121093</a>","chicago":"Kaloshin, Vadim. “An Extension of the Artin-Mazur Theorem.” <i>The Annals of Mathematics</i>. JSTOR, 1999. <a href=\"https://doi.org/10.2307/121093\">https://doi.org/10.2307/121093</a>.","apa":"Kaloshin, V. (1999). An extension of the Artin-Mazur theorem. <i>The Annals of Mathematics</i>. JSTOR. <a href=\"https://doi.org/10.2307/121093\">https://doi.org/10.2307/121093</a>","ista":"Kaloshin V. 1999. An extension of the Artin-Mazur theorem. The Annals of Mathematics. 150(2), 729–741.","ieee":"V. Kaloshin, “An extension of the Artin-Mazur theorem,” <i>The Annals of Mathematics</i>, vol. 150, no. 2. JSTOR, pp. 729–741, 1999.","short":"V. Kaloshin, The Annals of Mathematics 150 (1999) 729–741."},"volume":150,"date_published":"1999-09-01T00:00:00Z","type":"journal_article","status":"public"},{"type":"journal_article","date_published":"1999-07-01T00:00:00Z","volume":400,"oa_version":"None","article_type":"original","external_id":{"pmid":["10432111"]},"publisher":"Nature Publishing Group","date_updated":"2023-04-13T10:33:44Z","doi":"10.1038/22514","publication":"Nature","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"07","page":"351 - 354","author":[{"first_name":"Alexey","full_name":"Kondrashov, Alexey","last_name":"Kondrashov"},{"orcid":"0000-0001-8243-4694","last_name":"Kondrashov","first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor"}],"day":"01","publist_id":"6761","publication_status":"published","date_created":"2018-12-11T11:49:00Z","year":"1999","language":[{"iso":"eng"}],"status":"public","citation":{"ista":"Kondrashov A, Kondrashov F. 1999. Interactions among quantitative traits in the course of sympatric speciation. Nature. 400(6742), 351–354.","apa":"Kondrashov, A., &#38; Kondrashov, F. (1999). Interactions among quantitative traits in the course of sympatric speciation. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/22514\">https://doi.org/10.1038/22514</a>","short":"A. Kondrashov, F. Kondrashov, Nature 400 (1999) 351–354.","ieee":"A. Kondrashov and F. Kondrashov, “Interactions among quantitative traits in the course of sympatric speciation,” <i>Nature</i>, vol. 400, no. 6742. Nature Publishing Group, pp. 351–354, 1999.","ama":"Kondrashov A, Kondrashov F. Interactions among quantitative traits in the course of sympatric speciation. <i>Nature</i>. 1999;400(6742):351-354. doi:<a href=\"https://doi.org/10.1038/22514\">10.1038/22514</a>","mla":"Kondrashov, Alexey, and Fyodor Kondrashov. “Interactions among Quantitative Traits in the Course of Sympatric Speciation.” <i>Nature</i>, vol. 400, no. 6742, Nature Publishing Group, 1999, pp. 351–54, doi:<a href=\"https://doi.org/10.1038/22514\">10.1038/22514</a>.","chicago":"Kondrashov, Alexey, and Fyodor Kondrashov. “Interactions among Quantitative Traits in the Course of Sympatric Speciation.” <i>Nature</i>. Nature Publishing Group, 1999. <a href=\"https://doi.org/10.1038/22514\">https://doi.org/10.1038/22514</a>."},"intvolume":"       400","title":"Interactions among quantitative traits in the course of sympatric speciation","_id":"883","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Sympatric speciation, the origin of two or more species from a single local population, has almost certainly been involved in formation of several species flocks, and may be fairly common in nature. The most straightforward scenario for sympatric speciation requires disruptive selection favouring two substantially different phenotypes, and consists of the evolution of reproductive isolation between them followed by the elimination of all intermediate phenotypes. Here we use the hypergeometric phenotypic model to show that sympatric speciation is possible even when fitness and mate choice depend on different quantitative traits, so that speciation must involve formation of covariance between these traits. The increase in the number of variable loci affecting fitness facilitates sympatric speciation, whereas the increase in the number of variable loci affecting mate choice has the opposite effect. These predictions may enable more cases of sympatric speciation to be identified."}],"acknowledgement":"This study was supported by a grant from the NSF.","pmid":1,"issue":"6742","publication_identifier":{"issn":["0028-0836"]},"scopus_import":"1"},{"scopus_import":"1","issue":"16","publication_identifier":{"issn":["0270-6474"]},"_id":"3444","title":"Fast  network  oscillations  in the  hippocampal  CA1 region of the behaving rat","abstract":[{"lang":"eng","text":"This study examined intermittent, high-frequency (100-200 Hz) oscillatory patterns in the CA1 region of the hippocampus in the absence of theta activity, i.e., during and in between sharp wave (SPW) bursts. Pyramidal and interneuronal activity was phase-locked not only to large amplitude (&gt;7 SD from baseline) oscillatory events, which are present mainly during SPWs, but to smaller amplitude (&lt;4 SD) patterns, as well. Large-amplitude events were in the 140-200 Hz, &quot;ripple&quot; frequency range. Lower-amplitude events, however, contained slower, 100-130 Hz (&quot;slow&quot;) oscillatory patterns. Fast ripple waves reversed just below the CA1 pyramidal layer, whereas slow oscillatory potentials reversed in the stratum radiatum and/or in the stratum oriens. Parallel CA1-CA3 recordings revealed correlated CA3 field and unit activity to the slow CA1 waves but not to fast ripple waves. These findings suggest that fast ripples emerge in the CA1 region, whereas slow (100-130 Hz) oscillatory patterns are generated in the CA3 region and transferred to the CA1 field."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","pmid":1,"status":"public","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782850/","open_access":"1"}],"intvolume":"        19","citation":{"apa":"Csicsvari, J. L., Hirase, H., Czurkó, A., Mamiya, A., &#38; Buzsáki, G. (1999). Fast  network  oscillations  in the  hippocampal  CA1 region of the behaving rat. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999\">https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999</a>","ista":"Csicsvari JL, Hirase H, Czurkó A, Mamiya A, Buzsáki G. 1999. Fast  network  oscillations  in the  hippocampal  CA1 region of the behaving rat. Journal of Neuroscience. 19(16).","short":"J.L. Csicsvari, H. Hirase, A. Czurkó, A. Mamiya, G. Buzsáki, Journal of Neuroscience 19 (1999).","ieee":"J. L. Csicsvari, H. Hirase, A. Czurkó, A. Mamiya, and G. Buzsáki, “Fast  network  oscillations  in the  hippocampal  CA1 region of the behaving rat,” <i>Journal of Neuroscience</i>, vol. 19, no. 16. Society for Neuroscience, 1999.","mla":"Csicsvari, Jozsef L., et al. “Fast  Network  Oscillations  in the  Hippocampal  CA1 Region of the Behaving Rat.” <i>Journal of Neuroscience</i>, vol. 19, no. 16, Society for Neuroscience, 1999, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999\">10.1523/JNEUROSCI.19-16-j0001.1999</a>.","ama":"Csicsvari JL, Hirase H, Czurkó A, Mamiya A, Buzsáki G. Fast  network  oscillations  in the  hippocampal  CA1 region of the behaving rat. <i>Journal of Neuroscience</i>. 1999;19(16). doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999\">10.1523/JNEUROSCI.19-16-j0001.1999</a>","chicago":"Csicsvari, Jozsef L, Hajima Hirase, András Czurkó, Akira Mamiya, and György Buzsáki. “Fast  Network  Oscillations  in the  Hippocampal  CA1 Region of the Behaving Rat.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1999. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999\">https://doi.org/10.1523/JNEUROSCI.19-16-j0001.1999</a>."},"year":"1999","language":[{"iso":"eng"}],"author":[{"orcid":"0000-0002-5193-4036","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L"},{"last_name":"Hirase","first_name":"Hajima","full_name":"Hirase, Hajima"},{"last_name":"Czurkó","full_name":"Czurkó, András","first_name":"András"},{"first_name":"Akira","full_name":"Mamiya, Akira","last_name":"Mamiya"},{"full_name":"Buzsáki, György","first_name":"György","last_name":"Buzsáki"}],"publication_status":"published","publist_id":"2943","day":"15","date_created":"2018-12-11T12:03:22Z","publication":"Journal of Neuroscience","doi":"10.1523/JNEUROSCI.19-16-j0001.1999","date_updated":"2022-09-07T13:41:18Z","publisher":"Society for Neuroscience","article_processing_charge":"No","extern":"1","oa":1,"quality_controlled":"1","month":"08","volume":19,"date_published":"1999-08-15T00:00:00Z","type":"journal_article","article_type":"original","oa_version":"Published Version","external_id":{"pmid":["10436076"]}},{"issue":"14","publication_identifier":{"issn":["0270-6474"]},"scopus_import":"1","status":"public","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6783073/","open_access":"1"}],"intvolume":"        19","citation":{"short":"G. Dragoi, D. Carpi, M. Recce, J.L. Csicsvari, G. Buzsáki, Journal of Neuroscience 19 (1999) 6191–6199.","ieee":"G. Dragoi, D. Carpi, M. Recce, J. L. Csicsvari, and G. Buzsáki, “Interactions between hippocampus and medial septum during sharp waves and theta oscillation in the behaving rat,” <i>Journal of Neuroscience</i>, vol. 19, no. 14. Society for Neuroscience, pp. 6191–6199, 1999.","apa":"Dragoi, G., Carpi, D., Recce, M., Csicsvari, J. L., &#38; Buzsáki, G. (1999). Interactions between hippocampus and medial septum during sharp waves and theta oscillation in the behaving rat. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999\">https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999</a>","ista":"Dragoi G, Carpi D, Recce M, Csicsvari JL, Buzsáki G. 1999. Interactions between hippocampus and medial septum during sharp waves and theta oscillation in the behaving rat. Journal of Neuroscience. 19(14), 6191–6199.","chicago":"Dragoi, George, Daniel Carpi, Michael Recce, Jozsef L Csicsvari, and György Buzsáki. “Interactions between Hippocampus and Medial Septum during Sharp Waves and Theta Oscillation in the Behaving Rat.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1999. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999\">https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999</a>.","mla":"Dragoi, George, et al. “Interactions between Hippocampus and Medial Septum during Sharp Waves and Theta Oscillation in the Behaving Rat.” <i>Journal of Neuroscience</i>, vol. 19, no. 14, Society for Neuroscience, 1999, pp. 6191–99, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999\">10.1523/JNEUROSCI.19-14-06191.1999</a>.","ama":"Dragoi G, Carpi D, Recce M, Csicsvari JL, Buzsáki G. Interactions between hippocampus and medial septum during sharp waves and theta oscillation in the behaving rat. <i>Journal of Neuroscience</i>. 1999;19(14):6191-6199. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-14-06191.1999\">10.1523/JNEUROSCI.19-14-06191.1999</a>"},"_id":"3445","title":"Interactions between hippocampus and medial septum during sharp waves and theta oscillation in the behaving rat","abstract":[{"text":"The medial septal region and the hippocampus are connected reciprocally via GABAergic neurons, but the physiological role of this loop is still not well understood. In an attempt to reveal the physiological effects of the hippocamposeptal GABAergic projection, we cross-correlated hippocampal sharp wave (SPW) ripples or theta activity and extracellular units recorded in the medial septum and diagonal band of Broca (MSDB) in freely moving rats. The majority of single MSDB cells (60%) were significantly suppressed during SPWs. Most cells inhibited during SPW (80%) fired rhythmically and phase-locked to the negative peak of the CA1 pyramidal layer theta waves. Because both SPW and the negative peak of local theta waves correspond to the maximum discharge probability of CA1 pyramidal cells and interneuron classes, the findings indicate that the activity of medial septal neurons can be negatively (during SPW) or positively (during theta waves) correlated with the activity of hippocampal interneurons. We hypothesize that the functional coupling between medial septal neurons and hippocampal interneurons varies in a state-dependent manner.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"This work was supported by National Institutes of Health Grants NS34994 and MH54671. We thank Z. Borhegyi, H. Hirase, C. King, and Z. Nadásdy for help and support and T. F. Freund for his comments on this manuscript.","pmid":1,"page":"6191 - 6199","author":[{"last_name":"Dragoi","full_name":"Dragoi, George","first_name":"George"},{"first_name":"Daniel","full_name":"Carpi, Daniel","last_name":"Carpi"},{"first_name":"Michael","full_name":"Recce, Michael","last_name":"Recce"},{"last_name":"Csicsvari","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","full_name":"Csicsvari, Jozsef L"},{"first_name":"György","full_name":"Buzsáki, György","last_name":"Buzsáki"}],"publist_id":"2942","publication_status":"published","day":"15","date_created":"2018-12-11T12:03:22Z","language":[{"iso":"eng"}],"year":"1999","volume":19,"date_published":"1999-07-15T00:00:00Z","type":"journal_article","oa_version":"Published Version","external_id":{"pmid":["10407055"]},"article_type":"original","publication":"Journal of Neuroscience","date_updated":"2022-09-07T13:37:41Z","publisher":"Society for Neuroscience","doi":"10.1523/JNEUROSCI.19-14-06191.1999","article_processing_charge":"No","extern":"1","quality_controlled":"1","oa":1,"month":"07"},{"quality_controlled":"1","extern":"1","month":"01","publisher":"Springer","doi":"10.1007/978-3-662-08022-1_9","date_updated":"2022-09-07T13:30:23Z","publication":"Ionotropic Glutamate Receptors in the CNS","article_processing_charge":"No","oa_version":"None","date_published":"1999-01-01T00:00:00Z","type":"book_chapter","volume":141,"year":"1999","language":[{"iso":"eng"}],"day":"01","publication_status":"published","publist_id":"2931","date_created":"2018-12-11T12:03:25Z","page":"309 - 339","alternative_title":["Handbook of experimental pharmacology"],"author":[{"last_name":"Monyer","full_name":"Monyer, Hannah","first_name":"Hannah"},{"full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas"},{"full_name":"Rossier, Jean","first_name":"Jean","last_name":"Rossier"}],"title":"Molecular determinants controlling functional properties of AMPARs and NMDARs in the mammalian CNS","_id":"3456","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"L-a-amino-3-hydroxy-5-methyl-4-isoxazolepropionate receptors (AMPARs) and N-methyl-D-aspartate receptors (NMDARs) are the two major types of postsynaptic glutamate receptors (GluRs) that mediate excitatory synaptic transmission in the mammalian central nervous system (CNS). Both AMPARs and NMDARs are multimeric proteins, probably tetramers, formed by a variety of molecularly distinct subunits. AMPARs can be assembled from four types of subunits, termed GIuR-A, -B, -C, and -D (or, in an alternative nomenclature, G1uR1, G1uR2, GluR3, and G1uR4). Additional molecular diversity of AMPARs is generated by alternative splicing of the flip-flop module and RNA editing at the Q/R and R/G site. NMDARs are heteromers primarily assembled from NR1 subunits and NR2A, B, C, or D subunits. Various splice variants have been identified for the NR1 subunit, and a new NR3 subunit has been discovered recently. Considering all combinatorial possibilities, the molecular diversity of glutamate-receptor channels is considerable (HOLLMANN, this volume)."}],"citation":{"ieee":"H. Monyer, P. M. Jonas, and J. Rossier, “Molecular determinants controlling functional properties of AMPARs and NMDARs in the mammalian CNS,” in <i>Ionotropic Glutamate Receptors in the CNS</i>, vol. 141, P. M. Jonas and H. Monyer, Eds. Springer, 1999, pp. 309–339.","short":"H. Monyer, P.M. Jonas, J. Rossier, in:, P.M. Jonas, H. Monyer (Eds.), Ionotropic Glutamate Receptors in the CNS, Springer, 1999, pp. 309–339.","apa":"Monyer, H., Jonas, P. M., &#38; Rossier, J. (1999). Molecular determinants controlling functional properties of AMPARs and NMDARs in the mammalian CNS. In P. M. Jonas &#38; H. Monyer (Eds.), <i>Ionotropic Glutamate Receptors in the CNS</i> (Vol. 141, pp. 309–339). Springer. <a href=\"https://doi.org/10.1007/978-3-662-08022-1_9\">https://doi.org/10.1007/978-3-662-08022-1_9</a>","ista":"Monyer H, Jonas PM, Rossier J. 1999.Molecular determinants controlling functional properties of AMPARs and NMDARs in the mammalian CNS. In: Ionotropic Glutamate Receptors in the CNS. Handbook of experimental pharmacology, vol. 141, 309–339.","chicago":"Monyer, Hannah, Peter M Jonas, and Jean Rossier. “Molecular Determinants Controlling Functional Properties of AMPARs and NMDARs in the Mammalian CNS.” In <i>Ionotropic Glutamate Receptors in the CNS</i>, edited by Peter M Jonas and Hannah Monyer, 141:309–39. Springer, 1999. <a href=\"https://doi.org/10.1007/978-3-662-08022-1_9\">https://doi.org/10.1007/978-3-662-08022-1_9</a>.","mla":"Monyer, Hannah, et al. “Molecular Determinants Controlling Functional Properties of AMPARs and NMDARs in the Mammalian CNS.” <i>Ionotropic Glutamate Receptors in the CNS</i>, edited by Peter M Jonas and Hannah Monyer, vol. 141, Springer, 1999, pp. 309–39, doi:<a href=\"https://doi.org/10.1007/978-3-662-08022-1_9\">10.1007/978-3-662-08022-1_9</a>.","ama":"Monyer H, Jonas PM, Rossier J. Molecular determinants controlling functional properties of AMPARs and NMDARs in the mammalian CNS. In: Jonas PM, Monyer H, eds. <i>Ionotropic Glutamate Receptors in the CNS</i>. Vol 141. Springer; 1999:309-339. doi:<a href=\"https://doi.org/10.1007/978-3-662-08022-1_9\">10.1007/978-3-662-08022-1_9</a>"},"intvolume":"       141","editor":[{"full_name":"Jonas, Peter M","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas"},{"full_name":"Monyer, Hannah","first_name":"Hannah","last_name":"Monyer"}],"status":"public","scopus_import":"1","publication_identifier":{"isbn":["9783642085390"]}},{"publisher":"Springer","title":"Glutamate-mediated synaptic excitation of cortical interneurons","doi":"10.1007/978-3-662-08022-1_11","date_updated":"2022-09-07T13:25:46Z","_id":"3457","publication":"Ionotropic Glutamate Receptors in the CNS","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","abstract":[{"text":"Principal neurons and interneurons are the two main classes of cells in cortical neuronal networks. Principal neurons (granule cells or pyramidal neurons) have transregional axonal projections and release glutamate onto their postsynaptic target cells. In contrast, interneurons have local, but often extensive, axonal arborizations and use γ-aminobutyric acid (GABA) as a transmitter. Although interneurons represent only approximately 10% of the neuronal population, they control the electrical activity of the entire network (FREUND and BUZSÁKI 1996). Interneurons forming inhibitory synapses on the somata or axon initial segments of their postsynaptic target cells are thought to set the threshold of action potential initiation (MILES et al. 1996) and can synchronize the collective activities of large principal neuron ensembles (COBB et al. 1995). In contrast, interneurons establishing inhibitory synapses mainly on dendrites could suppress dendritic Na+ or Ca2+ spikes (BUZSÁKI et al. 1996; MILES et al. 1996) and, thus, regulate plasticity at glutamatergic synapses in the cortex (DAVIES et al.1991).","lang":"eng"}],"quality_controlled":"1","extern":"1","month":"01","status":"public","type":"book_chapter","date_published":"1999-01-01T00:00:00Z","volume":141,"intvolume":"       141","citation":{"chicago":"Geiger, Jörg, Arnd Roth, Birol Taskin, and Peter M Jonas. “Glutamate-Mediated Synaptic Excitation of Cortical Interneurons.” In <i>Ionotropic Glutamate Receptors in the CNS</i>, edited by Hannah Monyer and Peter M Jonas, 141:363–98. Springer, 1999. <a href=\"https://doi.org/10.1007/978-3-662-08022-1_11\">https://doi.org/10.1007/978-3-662-08022-1_11</a>.","mla":"Geiger, Jörg, et al. “Glutamate-Mediated Synaptic Excitation of Cortical Interneurons.” <i>Ionotropic Glutamate Receptors in the CNS</i>, edited by Hannah Monyer and Peter M Jonas, vol. 141, Springer, 1999, pp. 363–98, doi:<a href=\"https://doi.org/10.1007/978-3-662-08022-1_11\">10.1007/978-3-662-08022-1_11</a>.","ama":"Geiger J, Roth A, Taskin B, Jonas PM. Glutamate-mediated synaptic excitation of cortical interneurons. In: Monyer H, Jonas PM, eds. <i>Ionotropic Glutamate Receptors in the CNS</i>. Vol 141. Springer; 1999:363-398. doi:<a href=\"https://doi.org/10.1007/978-3-662-08022-1_11\">10.1007/978-3-662-08022-1_11</a>","ieee":"J. Geiger, A. Roth, B. Taskin, and P. M. Jonas, “Glutamate-mediated synaptic excitation of cortical interneurons,” in <i>Ionotropic Glutamate Receptors in the CNS</i>, vol. 141, H. Monyer and P. M. Jonas, Eds. Springer, 1999, pp. 363–398.","short":"J. Geiger, A. Roth, B. Taskin, P.M. Jonas, in:, H. Monyer, P.M. Jonas (Eds.), Ionotropic Glutamate Receptors in the CNS, Springer, 1999, pp. 363–398.","apa":"Geiger, J., Roth, A., Taskin, B., &#38; Jonas, P. M. (1999). Glutamate-mediated synaptic excitation of cortical interneurons. In H. Monyer &#38; P. M. Jonas (Eds.), <i>Ionotropic Glutamate Receptors in the CNS</i> (Vol. 141, pp. 363–398). Springer. <a href=\"https://doi.org/10.1007/978-3-662-08022-1_11\">https://doi.org/10.1007/978-3-662-08022-1_11</a>","ista":"Geiger J, Roth A, Taskin B, Jonas PM. 1999.Glutamate-mediated synaptic excitation of cortical interneurons. In: Ionotropic Glutamate Receptors in the CNS. Handbook of experimental pharmacology, vol. 141, 363–398."},"editor":[{"last_name":"Monyer","full_name":"Monyer, Hannah","first_name":"Hannah"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"}],"oa_version":"None","language":[{"iso":"eng"}],"year":"1999","page":"363 - 398","alternative_title":["Handbook of experimental pharmacology"],"author":[{"last_name":"Geiger","full_name":"Geiger, Jörg","first_name":"Jörg"},{"last_name":"Roth","full_name":"Roth, Arnd","first_name":"Arnd"},{"first_name":"Birol","full_name":"Taskin, Birol","last_name":"Taskin"},{"orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M"}],"day":"01","publist_id":"2930","publication_status":"published","publication_identifier":{"isbn":["9783642085390"]},"date_created":"2018-12-11T12:03:26Z"},{"scopus_import":"1","issue":"3","publication_identifier":{"issn":["0306-4522"]},"title":"Ultra-slow oscillation (0.025 Hz) triggers hippocampal afterdischarges in Wistar rats","_id":"3515","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Oscillations in neuronal networks are assumed to serve various physiological functions, from coordination of motor patterns to perceptual binding of sensory information. Here, we describe an ultra-slow oscillation (0.025 Hz) in the hippocampus. Extracellular and intracellular activity was recorded from the CA1 and subicular regions in rats of the Wistar and Sprague-Dawley strains. anesthetized with urethane. in a subgroup of Wistar rats (23%), spontaneous afterdischarges (4.7 +/- 1.6 s) occurred regularly at 40.8 +/- 15.7 s. The afterdischarge was initiated by a fast increase of population synchrony (100-250 Hz oscillation; “tonic” phase), followed by large-amplitude rhythmic waves and associated action potentials at gamma and beta frequency (15-50 Hz; “clonic” phase). The afterdischarges were bilaterally synchronous and terminated relatively abruptly without post-ictal depression. Single-pulse stimulation of the commissural input could trigger afterdischarges, but only at times when they were about to occur. Commissural stimulation evoked inhibitory postsynaptic potentials in pyramidal cells. However, when the stimulus triggered an afterdischarge, the inhibitory postsynaptic potential was absent and the cells remained depolarized during most of the afterdischarge. Afterdischarges were not observed in the Sprague-Dawley rats. Long-term analysis of interneuronal activity in intact, drug-free rats also revealed periodic excitability changes in the hippocampal network at 0.025 Hz. These findings indicate the presence of an ultra-slow oscillation in the hippocampal formation. The ultra-slow clock induced afterdischarges in susceptible animals. We hypothesize that a transient failure of GABAergic inhibition in a subset of Wistar rats is responsible for the emergence of epileptiform patterns. (C) 1999 IBRO. Published by Elsevier Science Ltd."}],"acknowledgement":"This work was supported by the Academy of Finland (32391) and the NIH (NS34994, MH54671).","pmid":1,"status":"public","intvolume":"        94","citation":{"ama":"Penttonen M, Nurminen N, Miettinen R, et al. Ultra-slow oscillation (0.025 Hz) triggers hippocampal afterdischarges in Wistar rats. <i>Neuroscience</i>. 1999;94(3):735-743. doi:<a href=\"https://doi.org/10.1016/S0306-4522(99)00367-X\">10.1016/S0306-4522(99)00367-X</a>","mla":"Penttonen, Markku, et al. “Ultra-Slow Oscillation (0.025 Hz) Triggers Hippocampal Afterdischarges in Wistar Rats.” <i>Neuroscience</i>, vol. 94, no. 3, Elsevier, 1999, pp. 735–43, doi:<a href=\"https://doi.org/10.1016/S0306-4522(99)00367-X\">10.1016/S0306-4522(99)00367-X</a>.","chicago":"Penttonen, Markku, Nina Nurminen, Riitta Miettinen, Jouni Sirviö, Darrell Henze, Jozsef L Csicsvari, and György Buzsáki. “Ultra-Slow Oscillation (0.025 Hz) Triggers Hippocampal Afterdischarges in Wistar Rats.” <i>Neuroscience</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/S0306-4522(99)00367-X\">https://doi.org/10.1016/S0306-4522(99)00367-X</a>.","ista":"Penttonen M, Nurminen N, Miettinen R, Sirviö J, Henze D, Csicsvari JL, Buzsáki G. 1999. Ultra-slow oscillation (0.025 Hz) triggers hippocampal afterdischarges in Wistar rats. Neuroscience. 94(3), 735–743.","apa":"Penttonen, M., Nurminen, N., Miettinen, R., Sirviö, J., Henze, D., Csicsvari, J. L., &#38; Buzsáki, G. (1999). Ultra-slow oscillation (0.025 Hz) triggers hippocampal afterdischarges in Wistar rats. <i>Neuroscience</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0306-4522(99)00367-X\">https://doi.org/10.1016/S0306-4522(99)00367-X</a>","short":"M. Penttonen, N. Nurminen, R. Miettinen, J. Sirviö, D. Henze, J.L. Csicsvari, G. Buzsáki, Neuroscience 94 (1999) 735–743.","ieee":"M. Penttonen <i>et al.</i>, “Ultra-slow oscillation (0.025 Hz) triggers hippocampal afterdischarges in Wistar rats,” <i>Neuroscience</i>, vol. 94, no. 3. Elsevier, pp. 735–743, 1999."},"language":[{"iso":"eng"}],"year":"1999","page":"735 - 743","author":[{"last_name":"Penttonen","full_name":"Penttonen, Markku","first_name":"Markku"},{"first_name":"Nina","full_name":"Nurminen, Nina","last_name":"Nurminen"},{"last_name":"Miettinen","first_name":"Riitta","full_name":"Miettinen, Riitta"},{"last_name":"Sirviö","first_name":"Jouni","full_name":"Sirviö, Jouni"},{"first_name":"Darrell","full_name":"Henze, Darrell","last_name":"Henze"},{"full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","last_name":"Csicsvari"},{"first_name":"György","full_name":"Buzsáki, György","last_name":"Buzsáki"}],"day":"01","publication_status":"published","publist_id":"2870","date_created":"2018-12-11T12:03:44Z","doi":"10.1016/S0306-4522(99)00367-X","date_updated":"2022-09-07T13:16:01Z","publisher":"Elsevier","publication":"Neuroscience","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"10","date_published":"1999-10-01T00:00:00Z","type":"journal_article","volume":94,"oa_version":"None","external_id":{"pmid":["10579564"]},"article_type":"original"},{"year":"1999","language":[{"iso":"eng"}],"day":"01","publist_id":"2866","publication_status":"published","date_created":"2018-12-11T12:03:45Z","page":"9497 - 9507","author":[{"last_name":"Nádasdy","full_name":"Nádasdy, Zoltán","first_name":"Zoltán"},{"full_name":"Hirase, Hajima","first_name":"Hajima","last_name":"Hirase"},{"first_name":"András","full_name":"Czurkó, András","last_name":"Czurkó"},{"orcid":"0000-0002-5193-4036","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Buzsáki","full_name":"Buzsáki, György","first_name":"György"}],"quality_controlled":"1","oa":1,"extern":"1","month":"11","date_updated":"2022-09-07T12:48:08Z","doi":"10.1523/JNEUROSCI.19-21-09497.1999","publisher":"Society for Neuroscience","publication":"Journal of Neuroscience","article_processing_charge":"No","article_type":"original","external_id":{"pmid":["10531452"]},"oa_version":"Published Version","date_published":"1999-11-01T00:00:00Z","type":"journal_article","volume":19,"scopus_import":"1","publication_identifier":{"issn":["0270-6474"]},"issue":"21","acknowledgement":"This work was supported by National Institutes of Health Grants NS34994 and MH54671 and by the Human Science Frontier Program. We thank Moshe Abeles, Michale Fee, Stuart Geman, Stephen Hanson, Darrell Henze, Günther Palm, Michael Recce, and Matthew Wilson for their suggestions with data analysis and comments on this manuscript.","pmid":1,"title":"Replay and time compression of recurring spike sequences in the hippocampus","_id":"3518","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Information in neuronal networks may be represented by the spatiotemporal patterns of spikes. Here we examined the temporal coordination of pyramidal cell spikes in the rat hippocampus during slow-wave sleep. In addition, rats were trained to run in a defined position in space (running wheel) to activate a selected group of pyramidal cells. A template-matching method and a joint probability map method were used for sequence search. Repeating spike sequences in excess of chance occurrence were examined by comparing the number of repeating sequences in the original spike trains and in surrogate trains after Monte Carlo shuffling of the spikes. Four different shuffling procedures were used to control for the population dynamics of hippocampal neurons. Repeating spike sequences in the recorded cell assemblies were present in both the awake and sleeping animal in excess of what might be predicted by random variations. Spike sequences observed during wheel running were “replayed” at a faster timescale during single sharp-wave bursts of slow-wave sleep. We hypothesize that the endogenously expressed spike sequences during sleep reflect reactivation of the circuitry modified by previous experience. Reactivation of acquired sequences may serve to consolidate information."}],"citation":{"mla":"Nádasdy, Zoltán, et al. “Replay and Time Compression of Recurring Spike Sequences in the Hippocampus.” <i>Journal of Neuroscience</i>, vol. 19, no. 21, Society for Neuroscience, 1999, pp. 9497–507, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-21-09497.1999\">10.1523/JNEUROSCI.19-21-09497.1999</a>.","ama":"Nádasdy Z, Hirase H, Czurkó A, Csicsvari JL, Buzsáki G. Replay and time compression of recurring spike sequences in the hippocampus. <i>Journal of Neuroscience</i>. 1999;19(21):9497-9507. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.19-21-09497.1999\">10.1523/JNEUROSCI.19-21-09497.1999</a>","chicago":"Nádasdy, Zoltán, Hajima Hirase, András Czurkó, Jozsef L Csicsvari, and György Buzsáki. “Replay and Time Compression of Recurring Spike Sequences in the Hippocampus.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 1999. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-21-09497.1999\">https://doi.org/10.1523/JNEUROSCI.19-21-09497.1999</a>.","apa":"Nádasdy, Z., Hirase, H., Czurkó, A., Csicsvari, J. L., &#38; Buzsáki, G. (1999). Replay and time compression of recurring spike sequences in the hippocampus. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.19-21-09497.1999\">https://doi.org/10.1523/JNEUROSCI.19-21-09497.1999</a>","ista":"Nádasdy Z, Hirase H, Czurkó A, Csicsvari JL, Buzsáki G. 1999. Replay and time compression of recurring spike sequences in the hippocampus. Journal of Neuroscience. 19(21), 9497–9507.","short":"Z. Nádasdy, H. Hirase, A. Czurkó, J.L. Csicsvari, G. Buzsáki, Journal of Neuroscience 19 (1999) 9497–9507.","ieee":"Z. Nádasdy, H. Hirase, A. Czurkó, J. L. Csicsvari, and G. Buzsáki, “Replay and time compression of recurring spike sequences in the hippocampus,” <i>Journal of Neuroscience</i>, vol. 19, no. 21. Society for Neuroscience, pp. 9497–9507, 1999."},"intvolume":"        19","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6782894/"}],"status":"public"},{"day":"01","publist_id":"2867","publication_status":"published","date_created":"2018-12-11T12:03:45Z","page":"344 - 352","author":[{"last_name":"Czurkó","full_name":"Czurkó, András","first_name":"András"},{"first_name":"Hajima","full_name":"Hirase, Hajima","last_name":"Hirase"},{"orcid":"0000-0002-5193-4036","last_name":"Csicsvari","full_name":"Csicsvari, Jozsef L","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Buzsáki","first_name":"György","full_name":"Buzsáki, György"}],"year":"1999","language":[{"iso":"eng"}],"article_type":"original","external_id":{"pmid":["9987037"]},"oa_version":"None","type":"journal_article","date_published":"1999-01-01T00:00:00Z","volume":11,"quality_controlled":"1","extern":"1","month":"01","doi":"10.1046/j.1460-9568.1999.00446.x","date_updated":"2022-09-07T13:09:08Z","publisher":"Wiley-Blackwell","publication":"European Journal of Neuroscience","article_processing_charge":"No","publication_identifier":{"issn":["0953-816X"]},"issue":"1","scopus_import":"1","citation":{"chicago":"Czurkó, András, Hajima Hirase, Jozsef L Csicsvari, and György Buzsáki. “Sustained Activation of Hippocampal Pyramidal Cells by ‘space Clamping’’ in a Running Wheel.’” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 1999. <a href=\"https://doi.org/10.1046/j.1460-9568.1999.00446.x\">https://doi.org/10.1046/j.1460-9568.1999.00446.x</a>.","ama":"Czurkó A, Hirase H, Csicsvari JL, Buzsáki G. Sustained activation of hippocampal pyramidal cells by ‘space clamping’’ in a running wheel.’ <i>European Journal of Neuroscience</i>. 1999;11(1):344-352. doi:<a href=\"https://doi.org/10.1046/j.1460-9568.1999.00446.x\">10.1046/j.1460-9568.1999.00446.x</a>","mla":"Czurkó, András, et al. “Sustained Activation of Hippocampal Pyramidal Cells by ‘space Clamping’’ in a Running Wheel.’” <i>European Journal of Neuroscience</i>, vol. 11, no. 1, Wiley-Blackwell, 1999, pp. 344–52, doi:<a href=\"https://doi.org/10.1046/j.1460-9568.1999.00446.x\">10.1046/j.1460-9568.1999.00446.x</a>.","ieee":"A. Czurkó, H. Hirase, J. L. Csicsvari, and G. Buzsáki, “Sustained activation of hippocampal pyramidal cells by ‘space clamping’’ in a running wheel,’” <i>European Journal of Neuroscience</i>, vol. 11, no. 1. Wiley-Blackwell, pp. 344–352, 1999.","short":"A. Czurkó, H. Hirase, J.L. Csicsvari, G. Buzsáki, European Journal of Neuroscience 11 (1999) 344–352.","ista":"Czurkó A, Hirase H, Csicsvari JL, Buzsáki G. 1999. Sustained activation of hippocampal pyramidal cells by ‘space clamping’’ in a running wheel’. European Journal of Neuroscience. 11(1), 344–352.","apa":"Czurkó, A., Hirase, H., Csicsvari, J. L., &#38; Buzsáki, G. (1999). Sustained activation of hippocampal pyramidal cells by ‘space clamping’’ in a running wheel.’ <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1460-9568.1999.00446.x\">https://doi.org/10.1046/j.1460-9568.1999.00446.x</a>"},"intvolume":"        11","status":"public","acknowledgement":"We thank M. Recce for continuous support, A. Berthoz for advice, K. Moorefor  his  participation  in  the  early  stages  of  the  experiments,  J.  Lee  for  helpand C.  King for his comments  on the manuscript. This  work was supportedby NIH (NS34994, MH54671), the Human Frontier Science Program (H.H.),the Hungarian Eo ̈tvo ̈s State Fellowship (A.C.) and the Soros Foundation (A.C.)","pmid":1,"title":"Sustained activation of hippocampal pyramidal cells by ‘space clamping' in a running wheel","_id":"3519","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"In contrast to sensory cortical areas of the brain, the relevant physiological inputs to the hippocampus, leading to selective activation of pyramidal cells, are largely unknown. Pyramidal cells are thought to be phasically activated by spatial cues and a variety of sensory and motor stimuli. Here, we used a behavioural `space clamp' method, which involved the confinement of the actively running animal in a defined position in space (running wheel) and kept sensory inputs constant. Twelve percent of the recorded CA1 pyramidal cells were selectively active while the rat was running in the wheel. Cell firing was specific to the direction of running and disappeared after rotating the recording apparatus. The discharge frequency of pyramidal cells and interneurons was sustained as long as the rat ran continuously in the wheel. Furthermore, the discharge frequency of pyramidal cells and interneurons increased with increasing running velocity, even though the frequency of hippocampal theta waves remained constant. The discharge frequency of some `wheel-related' pyramidal cells could increase more than 10-fold between 10 and 100 cm/s, whereas the firing rate of `non-wheel' cells remained constantly low. We hypothesize that: (i) a necessary condition for place-specific discharge of hippocampal pyramidal cells is the presence of theta oscillation; and (ii) relevant stimuli can tonically and selectively activate hippocampal pyramidal cells as long as theta activity is present."}]}]
