[{"intvolume":"        28","article_type":"original","extern":"1","volume":28,"publication_identifier":{"issn":["0896-6273"]},"language":[{"iso":"eng"}],"status":"public","date_published":"2000-11-01T00:00:00Z","publist_id":"4295","external_id":{"pmid":["11144358"]},"date_updated":"2023-05-03T09:41:55Z","date_created":"2018-12-11T11:58:37Z","author":[{"full_name":"Boudin, Hélène","last_name":"Boudin","first_name":"Hélène"},{"last_name":"Doan","first_name":"Andrew","full_name":"Doan, Andrew"},{"full_name":"Xia, Jun","first_name":"Jun","last_name":"Xia"},{"first_name":"Ryuichi","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Huganir, Richard","first_name":"Richard","last_name":"Huganir"},{"last_name":"Worley","first_name":"Paul","full_name":"Worley, Paul"},{"first_name":"Ann","last_name":"Craig","full_name":"Craig, Ann"}],"publication_status":"published","year":"2000","scopus_import":"1","acknowledgement":"We thank Drs. S. Nakanishi, K. Moriyoshi, V. I. Gelfand, and P. J. Conn for gifts of cDNAs and antibodies, A. S. Serpinskaya and H. Wu for excellent preparation of neuron cultures, and H. J. Chung for help in immunoblots. This work was supported by the Pew Chari-table Trust and National Institutes of Health grants NS33184 and NS39286 (A. M. C.), K02MH01152 and NIDA DA10309 (P. W.), and a fellowship from IPSEN Foundation (H. B.). ","day":"01","_id":"2603","doi":"10.1016/S0896-6273(00)00127-6","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","issue":"2","publication":"Neuron","title":"Presynaptic clustering of mGluR7a requires the PICK1 PDZ domain binding site","abstract":[{"lang":"eng","text":"Aggregation of neurotransmitter receptors at pre- and postsynaptic structures is crucial for efficient neuronal communication. In contrast to the wealth of information about postsynaptic specializations, little is known about the molecular organization of presynaptic membrane proteins. We show here that the metabotropic glutamate receptor mGluR7a, which localizes specifically to presynaptic active zones, interacts in vitro and in vivo with PICK1. Coexpression in heterologous systems induces coclustering dependent upon the extreme C terminus of mGluR7a and the PDZ domain of PICK1. mGluR7a and PICK1 localize to excitatory synapses in hippocampal neurons. Furthermore, whereas transfected mGluR7a clusters at presynaptic sites, mGluR7aΔ3 lacking the PICK1 binding site targets to axons but does not cluster. These results suggest that PICK1 is a component of the presynaptic machinery involved in mGlUR7a aggregation and in modulation of glutamate neurotransmission."}],"type":"journal_article","citation":{"chicago":"Boudin, Hélène, Andrew Doan, Jun Xia, Ryuichi Shigemoto, Richard Huganir, Paul Worley, and Ann Craig. “Presynaptic Clustering of MGluR7a Requires the PICK1 PDZ Domain Binding Site.” <i>Neuron</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1016/S0896-6273(00)00127-6\">https://doi.org/10.1016/S0896-6273(00)00127-6</a>.","short":"H. Boudin, A. Doan, J. Xia, R. Shigemoto, R. Huganir, P. Worley, A. Craig, Neuron 28 (2000) 485–497.","ieee":"H. Boudin <i>et al.</i>, “Presynaptic clustering of mGluR7a requires the PICK1 PDZ domain binding site,” <i>Neuron</i>, vol. 28, no. 2. Elsevier, pp. 485–497, 2000.","ama":"Boudin H, Doan A, Xia J, et al. Presynaptic clustering of mGluR7a requires the PICK1 PDZ domain binding site. <i>Neuron</i>. 2000;28(2):485-497. doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)00127-6\">10.1016/S0896-6273(00)00127-6</a>","apa":"Boudin, H., Doan, A., Xia, J., Shigemoto, R., Huganir, R., Worley, P., &#38; Craig, A. (2000). Presynaptic clustering of mGluR7a requires the PICK1 PDZ domain binding site. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0896-6273(00)00127-6\">https://doi.org/10.1016/S0896-6273(00)00127-6</a>","mla":"Boudin, Hélène, et al. “Presynaptic Clustering of MGluR7a Requires the PICK1 PDZ Domain Binding Site.” <i>Neuron</i>, vol. 28, no. 2, Elsevier, 2000, pp. 485–97, doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)00127-6\">10.1016/S0896-6273(00)00127-6</a>.","ista":"Boudin H, Doan A, Xia J, Shigemoto R, Huganir R, Worley P, Craig A. 2000. Presynaptic clustering of mGluR7a requires the PICK1 PDZ domain binding site. Neuron. 28(2), 485–497."},"oa_version":"None","page":"485 - 497","publisher":"Elsevier","article_processing_charge":"No","month":"11"},{"article_processing_charge":"No","month":"01","publisher":"IEEE","citation":{"chicago":"Katsaros, Georgios, Phil Lane, and Michelle Murphy. “Comparison of the Impact of FWM on Binary, Duobinary and Dicode Modulation in DWDM Systems.” In <i>Proceedings of the 2000 IEEE Annual Meeting Conference </i>, 1:27–28. IEEE, 2000. <a href=\"https://doi.org/10.1109/LEOS.2000.890656\">https://doi.org/10.1109/LEOS.2000.890656</a>.","short":"G. Katsaros, P. Lane, M. Murphy, in:, Proceedings of the 2000 IEEE Annual Meeting Conference , IEEE, 2000, pp. 27–28.","ista":"Katsaros G, Lane P, Murphy M. 2000. Comparison of the impact of FWM on binary, duobinary and dicode modulation in DWDM systems. Proceedings of the 2000 IEEE Annual Meeting Conference . Lasers and Electro Optics Society Annual Meeting, LEOS, vol. 1, 27–28.","ama":"Katsaros G, Lane P, Murphy M. Comparison of the impact of FWM on binary, duobinary and dicode modulation in DWDM systems. In: <i>Proceedings of the 2000 IEEE Annual Meeting Conference </i>. Vol 1. IEEE; 2000:27-28. doi:<a href=\"https://doi.org/10.1109/LEOS.2000.890656\">10.1109/LEOS.2000.890656</a>","ieee":"G. Katsaros, P. Lane, and M. Murphy, “Comparison of the impact of FWM on binary, duobinary and dicode modulation in DWDM systems,” in <i>Proceedings of the 2000 IEEE Annual Meeting Conference </i>, Rio Grande, PR, USA, 2000, vol. 1, pp. 27–28.","apa":"Katsaros, G., Lane, P., &#38; Murphy, M. (2000). Comparison of the impact of FWM on binary, duobinary and dicode modulation in DWDM systems. In <i>Proceedings of the 2000 IEEE Annual Meeting Conference </i> (Vol. 1, pp. 27–28). Rio Grande, PR, USA: IEEE. <a href=\"https://doi.org/10.1109/LEOS.2000.890656\">https://doi.org/10.1109/LEOS.2000.890656</a>","mla":"Katsaros, Georgios, et al. “Comparison of the Impact of FWM on Binary, Duobinary and Dicode Modulation in DWDM Systems.” <i>Proceedings of the 2000 IEEE Annual Meeting Conference </i>, vol. 1, IEEE, 2000, pp. 27–28, doi:<a href=\"https://doi.org/10.1109/LEOS.2000.890656\">10.1109/LEOS.2000.890656</a>."},"page":"27 - 28","oa_version":"None","title":"Comparison of the impact of FWM on binary, duobinary and dicode modulation in DWDM systems","abstract":[{"text":"A coding scheme called diode is compared with duobinary signalling and with normal binary transmission. It is shown that the diode coding suppresses the FWM products of a three channel DWDM system and this reduction against that achieved with duobinary coding is presented. The results presented show how the average level of the FWM products relative to the average levels of the three optical carriers vary over the channel spacing range. The suppression observed is about / dB more than that achieved with duobinary modulation and is greater for narrow channel spacing.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 2000 IEEE Annual Meeting Conference ","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","doi":"10.1109/LEOS.2000.890656","day":"01","_id":"1736","scopus_import":"1","conference":{"location":"Rio Grande, PR, USA","start_date":"2000-11-13","name":"Lasers and Electro Optics Society Annual Meeting","end_date":"2000-11-16"},"date_updated":"2023-05-04T14:46:21Z","author":[{"first_name":"Georgios","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","full_name":"Katsaros, Georgios"},{"last_name":"Lane","first_name":"Phil","full_name":"Lane, Phil"},{"first_name":"Michelle","last_name":"Murphy","full_name":"Murphy, Michelle"}],"date_created":"2018-12-11T11:53:44Z","year":"2000","publication_status":"published","language":[{"iso":"eng"}],"status":"public","date_published":"2000-01-01T00:00:00Z","publist_id":"5388","alternative_title":["LEOS"],"publication_identifier":{"isbn":["078035947X"]},"extern":"1","volume":1,"intvolume":"         1"},{"date_published":"2000-08-01T00:00:00Z","external_id":{"pmid":["10904260 "]},"publist_id":"6806","language":[{"iso":"eng"}],"status":"public","publication_status":"published","year":"2000","date_updated":"2023-05-08T09:22:03Z","date_created":"2018-12-11T11:48:48Z","author":[{"first_name":"Yuri","last_name":"Wolf","full_name":"Wolf, Yuri"},{"full_name":"Kondrashov, Fyodor","orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","last_name":"Kondrashov","first_name":"Fyodor"},{"full_name":"Koonin, Eugene","last_name":"Koonin","first_name":"Eugene"}],"scopus_import":"1","_id":"842","day":"01","intvolume":"        16","article_type":"original","extern":"1","volume":16,"publication_identifier":{"issn":["0168-9479"]},"type":"journal_article","title":"No footprints of primordial introns in a eukaryotic genome","oa_version":"None","page":"333 - 334","citation":{"chicago":"Wolf, Yuri, Fyodor Kondrashov, and Eugene Koonin. “No Footprints of Primordial Introns in a Eukaryotic Genome.” <i>Trends in Genetics</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1016/S0168-9525(00)02059-X\">https://doi.org/10.1016/S0168-9525(00)02059-X</a>.","short":"Y. Wolf, F. Kondrashov, E. Koonin, Trends in Genetics 16 (2000) 333–334.","ista":"Wolf Y, Kondrashov F, Koonin E. 2000. No footprints of primordial introns in a eukaryotic genome. Trends in Genetics. 16(8), 333–334.","ieee":"Y. Wolf, F. Kondrashov, and E. Koonin, “No footprints of primordial introns in a eukaryotic genome,” <i>Trends in Genetics</i>, vol. 16, no. 8. Elsevier, pp. 333–334, 2000.","ama":"Wolf Y, Kondrashov F, Koonin E. No footprints of primordial introns in a eukaryotic genome. <i>Trends in Genetics</i>. 2000;16(8):333-334. doi:<a href=\"https://doi.org/10.1016/S0168-9525(00)02059-X\">10.1016/S0168-9525(00)02059-X</a>","apa":"Wolf, Y., Kondrashov, F., &#38; Koonin, E. (2000). No footprints of primordial introns in a eukaryotic genome. <i>Trends in Genetics</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0168-9525(00)02059-X\">https://doi.org/10.1016/S0168-9525(00)02059-X</a>","mla":"Wolf, Yuri, et al. “No Footprints of Primordial Introns in a Eukaryotic Genome.” <i>Trends in Genetics</i>, vol. 16, no. 8, Elsevier, 2000, pp. 333–34, doi:<a href=\"https://doi.org/10.1016/S0168-9525(00)02059-X\">10.1016/S0168-9525(00)02059-X</a>."},"publisher":"Elsevier","month":"08","article_processing_charge":"No","doi":"10.1016/S0168-9525(00)02059-X","quality_controlled":"1","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","issue":"8","publication":"Trends in Genetics"},{"_id":"8525","month":"04","day":"01","article_processing_charge":"No","publisher":"Springer Nature","publication_status":"published","year":"2000","oa_version":"None","page":"253-271","date_updated":"2021-01-12T08:19:52Z","author":[{"last_name":"Kaloshin","first_name":"Vadim","full_name":"Kaloshin, Vadim","orcid":"0000-0002-6051-2628","id":"FE553552-CDE8-11E9-B324-C0EBE5697425"}],"date_created":"2020-09-18T10:50:20Z","citation":{"chicago":"Kaloshin, Vadim. “Generic Diffeomorphisms with Superexponential Growth of Number of Periodic Orbits.” <i>Communications in Mathematical Physics</i>. Springer Nature, 2000. <a href=\"https://doi.org/10.1007/s002200050811\">https://doi.org/10.1007/s002200050811</a>.","short":"V. Kaloshin, Communications in Mathematical Physics 211 (2000) 253–271.","ista":"Kaloshin V. 2000. Generic diffeomorphisms with superexponential growth of number of periodic orbits. Communications in Mathematical Physics. 211, 253–271.","ieee":"V. Kaloshin, “Generic diffeomorphisms with superexponential growth of number of periodic orbits,” <i>Communications in Mathematical Physics</i>, vol. 211. Springer Nature, pp. 253–271, 2000.","ama":"Kaloshin V. Generic diffeomorphisms with superexponential growth of number of periodic orbits. <i>Communications in Mathematical Physics</i>. 2000;211:253-271. doi:<a href=\"https://doi.org/10.1007/s002200050811\">10.1007/s002200050811</a>","apa":"Kaloshin, V. (2000). Generic diffeomorphisms with superexponential growth of number of periodic orbits. <i>Communications in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s002200050811\">https://doi.org/10.1007/s002200050811</a>","mla":"Kaloshin, Vadim. “Generic Diffeomorphisms with Superexponential Growth of Number of Periodic Orbits.” <i>Communications in Mathematical Physics</i>, vol. 211, Springer Nature, 2000, pp. 253–71, doi:<a href=\"https://doi.org/10.1007/s002200050811\">10.1007/s002200050811</a>."},"date_published":"2000-04-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Let M be a smooth compact manifold of dimension at least 2 and Diffr(M) be the space of C r smooth diffeomorphisms of M. Associate to each diffeomorphism f;isin; Diffr(M) the sequence P n (f) of the number of isolated periodic points for f of period n. In this paper we exhibit an open set N in the space of diffeomorphisms Diffr(M) such for a Baire generic diffeomorphism f∈N the number of periodic points P n f grows with a period n faster than any following sequence of numbers {a n } n ∈ Z + along a subsequence, i.e. P n (f)>a ni for some n i →∞ with i→∞. In the cases of surface diffeomorphisms, i.e. dim M≡2, an open set N with a supergrowth of the number of periodic points is a Newhouse domain. A proof of the man result is based on the Gontchenko–Shilnikov–Turaev Theorem [GST]. A complete proof of that theorem is also presented."}],"title":"Generic diffeomorphisms with superexponential growth of number of periodic orbits","language":[{"iso":"eng"}],"status":"public","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"publication_identifier":{"issn":["0010-3616","1432-0916"]},"publication":"Communications in Mathematical Physics","extern":"1","volume":211,"article_type":"original","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1007/s002200050811","intvolume":"       211"},{"acknowledgement":"The authors would like to thank the reviewers for their detailed comments.","scopus_import":"1","_id":"4598","day":"01","date_published":"2000-07-01T00:00:00Z","publist_id":"107","status":"public","language":[{"iso":"eng"}],"publication_status":"published","year":"2000","author":[{"full_name":"Alur, Rajeev","last_name":"Alur","first_name":"Rajeev"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"full_name":"Lafferriere, Gerardo","last_name":"Lafferriere","first_name":"Gerardo"},{"full_name":"Pappas, George","first_name":"George","last_name":"Pappas"}],"date_created":"2018-12-11T12:09:41Z","date_updated":"2023-04-13T13:32:11Z","extern":"1","volume":88,"publication_identifier":{"issn":["0018-9219"]},"intvolume":"        88","article_type":"original","publisher":"IEEE","article_processing_charge":"No","month":"07","abstract":[{"lang":"eng","text":"A hybrid system is a dynamical system with both discrete and continuous state changes. For analysis purposes, it is often useful to abstract a system in a way that preserves the properties being analyzed while hiding the details that are of no interest. We show that interesting classes of hybrid systems can be abstracted to purely discrete systems while preserving all properties that are definable in temporal logic. The classes that permit discrete abstractions fall into two categories. Either the continuous dynamics must be restricted, as is the case for timed and rectangular hybrid systems, or the discrete dynamics must be restricted, as is the case for o-minimal hybrid systems. In this paper, we survey and unify results from both areas."}],"type":"journal_article","title":"Discrete abstractions of hybrid systems","oa_version":"None","page":"971 - 984","citation":{"short":"R. Alur, T.A. Henzinger, G. Lafferriere, G. Pappas, Proceedings of the IEEE 88 (2000) 971–984.","chicago":"Alur, Rajeev, Thomas A Henzinger, Gerardo Lafferriere, and George Pappas. “Discrete Abstractions of Hybrid Systems.” <i>Proceedings of the IEEE</i>. IEEE, 2000. <a href=\"https://doi.org/10.1109/5.871304 \">https://doi.org/10.1109/5.871304 </a>.","apa":"Alur, R., Henzinger, T. A., Lafferriere, G., &#38; Pappas, G. (2000). Discrete abstractions of hybrid systems. <i>Proceedings of the IEEE</i>. IEEE. <a href=\"https://doi.org/10.1109/5.871304 \">https://doi.org/10.1109/5.871304 </a>","mla":"Alur, Rajeev, et al. “Discrete Abstractions of Hybrid Systems.” <i>Proceedings of the IEEE</i>, vol. 88, no. 7, IEEE, 2000, pp. 971–84, doi:<a href=\"https://doi.org/10.1109/5.871304 \">10.1109/5.871304 </a>.","ieee":"R. Alur, T. A. Henzinger, G. Lafferriere, and G. Pappas, “Discrete abstractions of hybrid systems,” <i>Proceedings of the IEEE</i>, vol. 88, no. 7. IEEE, pp. 971–984, 2000.","ama":"Alur R, Henzinger TA, Lafferriere G, Pappas G. Discrete abstractions of hybrid systems. <i>Proceedings of the IEEE</i>. 2000;88(7):971-984. doi:<a href=\"https://doi.org/10.1109/5.871304 \">10.1109/5.871304 </a>","ista":"Alur R, Henzinger TA, Lafferriere G, Pappas G. 2000. Discrete abstractions of hybrid systems. Proceedings of the IEEE. 88(7), 971–984."},"publication":"Proceedings of the IEEE","issue":"7","doi":"10.1109/5.871304 ","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1109/LICS.2000.855763","publication_identifier":{"isbn":["0769507255"]},"publication":"Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science","extern":"1","publication_status":"published","year":"2000","page":"141 - 154","oa_version":"None","date_updated":"2023-04-13T13:24:29Z","author":[{"full_name":"De Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"date_created":"2018-12-11T12:09:50Z","citation":{"chicago":"De Alfaro, Luca, and Thomas A Henzinger. “Concurrent Omega-Regular Games.” In <i>Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science</i>, 141–54. IEEE, 2000. <a href=\"https://doi.org/10.1109/LICS.2000.855763\">https://doi.org/10.1109/LICS.2000.855763</a>.","short":"L. De Alfaro, T.A. Henzinger, in:, Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, IEEE, 2000, pp. 141–154.","ista":"De Alfaro L, Henzinger TA. 2000. Concurrent omega-regular games. Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 141–154.","ieee":"L. De Alfaro and T. A. Henzinger, “Concurrent omega-regular games,” in <i>Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science</i>, Santa Barbara, CA, USA, 2000, pp. 141–154.","ama":"De Alfaro L, Henzinger TA. Concurrent omega-regular games. In: <i>Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science</i>. IEEE; 2000:141-154. doi:<a href=\"https://doi.org/10.1109/LICS.2000.855763\">10.1109/LICS.2000.855763</a>","apa":"De Alfaro, L., &#38; Henzinger, T. A. (2000). Concurrent omega-regular games. In <i>Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science</i> (pp. 141–154). Santa Barbara, CA, USA: IEEE. <a href=\"https://doi.org/10.1109/LICS.2000.855763\">https://doi.org/10.1109/LICS.2000.855763</a>","mla":"De Alfaro, Luca, and Thomas A. Henzinger. “Concurrent Omega-Regular Games.” <i>Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science</i>, IEEE, 2000, pp. 141–54, doi:<a href=\"https://doi.org/10.1109/LICS.2000.855763\">10.1109/LICS.2000.855763</a>."},"date_published":"2000-01-01T00:00:00Z","publist_id":"82","type":"conference","abstract":[{"text":"We consider two-player games, which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider omega-regular winning conditions on the resulting infinite state sequence. To model the independent choice of moves, both players are allowed to use randomization for selecting their moves. This gives rise to the following qualitative modes of winning, which can be studied without numerical considerations concerning probabilities: sure-win (player 1 can ensure winning with certainty), almost-sure-win (player 1 can ensure winning with probability 1), limit-win (player 1 can ensure winning with probability arbitrarily close to 1), bounded-win (player 1 can ensure winning with probability bounded away from 0), positive-win (player 1 can ensure winning with positive probability), and exist-win (player 1 can ensure that at least one possible outcome of the game satisfies the winning condition).We provide algorithms for computing the sets of winning states for each of these winning modes. In particular, we solve concurrent Rabin-chain games in n0 (m) time, where n is the size of the game structure and m is the number of pairs in the Rabin-chain condition. While this complexity is in line with traditional turn-based games, where in each state only one of the two players has a choice of moves, our algorithms are considerably more involved than those for turn-based games are. This is because concurrent games violate two of the most fundamental properties of turn-based games. First, concurrent games are not determined, but rather exhibit a more general duality property, which involves multiple modes of winning. Second, winning strategies for concurrent games may require infinite memory.","lang":"eng"}],"title":"Concurrent omega-regular games","language":[{"iso":"eng"}],"status":"public","_id":"4627","article_processing_charge":"No","month":"01","day":"01","conference":{"location":"Santa Barbara, CA, USA","start_date":"2000-06-26","name":"LICS: Logic in Computer Science","end_date":"2000-06-28"},"scopus_import":"1","publisher":"IEEE"},{"publication":"Proceedings of the 11th International Conference on Concurrency Theory","doi":"10.1007/3-540-44618-4_33","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","month":"01","article_processing_charge":"No","type":"conference","abstract":[{"text":"In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a well-defined product behavior are ruled out. They can be ruled out semantically, by insisting on the existence of certain fixed points, or syntactically, by equipping processes with types, which make the dependencies between input and output signals transparent. We classify various typing mechanisms and study their effects on the control problem.\r\nA static type enforces fixed, acyclic dependencies between input and output ports. For example, synchronous hardware without combinational loops can be typed statically. A dynamic type may vary the dependencies from state to state, while maintaining acyclicity, as in level-sensitive latches. Then, two dynamically typed processes can be syntactically compatible, if all pairs of possible dependencies are compatible, or semantically compatible, if in each state the combined dependencies remain acyclic. For a given plant process and control objective, there may be a controller of a static type, or only a controller of a syntactically compatible dynamic type, or only a controller of a semantically compatible dynamic type. We show this to be a strict hierarchy of possibilities, and we present algorithms and determine the complexity of the corresponding control problems.\r\nFurthermore, we consider versions of the control problem in which the type of the controller (static or dynamic) is given. We show that the solution of these fixed-type control problems requires the evaluation of partially ordered (Henkin) quantifiers on boolean formulas, and is therefore harder (nondeterministic exponential time) than more traditional control questions","lang":"eng"}],"title":"The control of synchronous systems","page":"458 - 473","oa_version":"None","citation":{"apa":"De Alfaro, L., Henzinger, T. A., &#38; Mang, F. (2000). The control of synchronous systems. In <i>Proceedings of the 11th International Conference on Concurrency Theory</i> (Vol. 1877, pp. 458–473). University Park, PA, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/3-540-44618-4_33\">https://doi.org/10.1007/3-540-44618-4_33</a>","mla":"De Alfaro, Luca, et al. “The Control of Synchronous Systems.” <i>Proceedings of the 11th International Conference on Concurrency Theory</i>, vol. 1877, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2000, pp. 458–73, doi:<a href=\"https://doi.org/10.1007/3-540-44618-4_33\">10.1007/3-540-44618-4_33</a>.","ama":"De Alfaro L, Henzinger TA, Mang F. The control of synchronous systems. In: <i>Proceedings of the 11th International Conference on Concurrency Theory</i>. Vol 1877. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2000:458-473. doi:<a href=\"https://doi.org/10.1007/3-540-44618-4_33\">10.1007/3-540-44618-4_33</a>","ieee":"L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems,” in <i>Proceedings of the 11th International Conference on Concurrency Theory</i>, University Park, PA, USA, 2000, vol. 1877, pp. 458–473.","ista":"De Alfaro L, Henzinger TA, Mang F. 2000. The control of synchronous systems. Proceedings of the 11th International Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1877, 458–473.","short":"L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 11th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2000, pp. 458–473.","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “The Control of Synchronous Systems.” In <i>Proceedings of the 11th International Conference on Concurrency Theory</i>, 1877:458–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2000. <a href=\"https://doi.org/10.1007/3-540-44618-4_33\">https://doi.org/10.1007/3-540-44618-4_33</a>."},"volume":1877,"extern":"1","publication_identifier":{"isbn":["9783540678977"]},"alternative_title":["LNCS"],"intvolume":"      1877","conference":{"name":"CONCUR: Concurrency Theory","end_date":"2000-08-25","location":"University Park, PA, USA","start_date":"2000-08-22"},"acknowledgement":"This research was supported in part by the DARPA grants NAG2-1214 and F33615-C-98-3614, the SRC contract 99-TJ-683.003, the MARCO grant 98-DT-660, and the NSF CAREER award CCR-9501708.","_id":"4637","day":"01","date_published":"2000-01-01T00:00:00Z","publist_id":"69","language":[{"iso":"eng"}],"status":"public","year":"2000","publication_status":"published","date_updated":"2023-04-13T11:00:46Z","date_created":"2018-12-11T12:09:53Z","author":[{"last_name":"De Alfaro","first_name":"Luca","full_name":"De Alfaro, Luca"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Mang, Freddy","last_name":"Mang","first_name":"Freddy"}]},{"publication_identifier":{"isbn":["9783540677703"]},"alternative_title":["LNCS"],"volume":1855,"extern":"1","intvolume":"      1855","_id":"4638","day":"01","conference":{"name":"CAV: Computer-Aided Verification","end_date":"2000-07-19","location":"Chicago, IL, USA","start_date":"2000-07-15"},"acknowledgement":"This research was supported in part by the DARPA (NASA) grant NAG2-1214, the SRC contract 99-TJ-683.003, the MARCO grant 98-DT-660, the DARPA (MARCO) grant MDA972-99-1-0001, and the NSF CAREER award CCR-9501708.","scopus_import":"1","publication_status":"published","year":"2000","author":[{"full_name":"De Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Mang","first_name":"Freddy","full_name":"Mang, Freddy"}],"date_created":"2018-12-11T12:09:53Z","date_updated":"2023-04-13T13:18:06Z","date_published":"2000-01-01T00:00:00Z","publist_id":"70","status":"public","language":[{"iso":"eng"}],"publication":"Proceedings of the 12th International Conference on Computer Aided Verification","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1007/10722167_17","article_processing_charge":"No","month":"01","publisher":"Springer","oa_version":"None","page":"186 - 201","citation":{"short":"L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International Conference on Computer Aided Verification, Springer, 2000, pp. 186–201.","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “Detecting Errors before Reaching Them.” In <i>Proceedings of the 12th International Conference on Computer Aided Verification</i>, 1855:186–201. Springer, 2000. <a href=\"https://doi.org/10.1007/10722167_17\">https://doi.org/10.1007/10722167_17</a>.","apa":"De Alfaro, L., Henzinger, T. A., &#38; Mang, F. (2000). Detecting errors before reaching them. In <i>Proceedings of the 12th International Conference on Computer Aided Verification</i> (Vol. 1855, pp. 186–201). Chicago, IL, USA: Springer. <a href=\"https://doi.org/10.1007/10722167_17\">https://doi.org/10.1007/10722167_17</a>","mla":"De Alfaro, Luca, et al. “Detecting Errors before Reaching Them.” <i>Proceedings of the 12th International Conference on Computer Aided Verification</i>, vol. 1855, Springer, 2000, pp. 186–201, doi:<a href=\"https://doi.org/10.1007/10722167_17\">10.1007/10722167_17</a>.","ama":"De Alfaro L, Henzinger TA, Mang F. Detecting errors before reaching them. In: <i>Proceedings of the 12th International Conference on Computer Aided Verification</i>. Vol 1855. Springer; 2000:186-201. doi:<a href=\"https://doi.org/10.1007/10722167_17\">10.1007/10722167_17</a>","ieee":"L. De Alfaro, T. A. Henzinger, and F. Mang, “Detecting errors before reaching them,” in <i>Proceedings of the 12th International Conference on Computer Aided Verification</i>, Chicago, IL, USA, 2000, vol. 1855, pp. 186–201.","ista":"De Alfaro L, Henzinger TA, Mang F. 2000. Detecting errors before reaching them. Proceedings of the 12th International Conference on Computer Aided Verification. CAV: Computer-Aided Verification, LNCS, vol. 1855, 186–201."},"type":"conference","abstract":[{"lang":"eng","text":"Any formal method or tool is almost certainly more often applied in situations where the outcome is failure (a counterexample) rather than success (a correctness proof). We present a method for symbolic model checking that can lead to significant time and memory savings for model-checking runs that fail, while occurring only a small overhead for model-checking runs that succeed. Our method discovers an error as soon as it cannot be prevented, which can be long before it actually occurs; for example, the violation of an invariant may become unpreventable many transitions before the invariant is violated.\r\nThe key observation is that “unpreventability” is a local property of a single module: an error is unpreventable in a module state if no environment can prevent it. Therefore, unpreventability is inexpensive to compute for each module, yet can save much work in the state exploration of the global, compound system. Based on different degrees of information available about the environment, we define and implement several notions of “unpreventability,” including the standard notion of uncontrollability from discrete-event control. We present experimental results for two examples, a distributed database protocol and a wireless communication protocol."}],"title":"Detecting errors before reaching them"},{"oa_version":"Published Version","page":"5594 - 5607","citation":{"ista":"Kraushaar U, Jonas PM. 2000. Efficacy and stability of quantal GABA release at a hippocampal interneuron-principal neuron synapse. Journal of Neuroscience. 20(15), 5594–5607.","mla":"Kraushaar, Udo, and Peter M. Jonas. “Efficacy and Stability of Quantal GABA Release at a Hippocampal Interneuron-Principal Neuron Synapse.” <i>Journal of Neuroscience</i>, vol. 20, no. 15, Society for Neuroscience, 2000, pp. 5594–607, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.20-15-05594.2000\">10.1523/JNEUROSCI.20-15-05594.2000</a>.","apa":"Kraushaar, U., &#38; Jonas, P. M. (2000). Efficacy and stability of quantal GABA release at a hippocampal interneuron-principal neuron synapse. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.20-15-05594.2000\">https://doi.org/10.1523/JNEUROSCI.20-15-05594.2000</a>","ieee":"U. Kraushaar and P. M. Jonas, “Efficacy and stability of quantal GABA release at a hippocampal interneuron-principal neuron synapse,” <i>Journal of Neuroscience</i>, vol. 20, no. 15. Society for Neuroscience, pp. 5594–5607, 2000.","ama":"Kraushaar U, Jonas PM. Efficacy and stability of quantal GABA release at a hippocampal interneuron-principal neuron synapse. <i>Journal of Neuroscience</i>. 2000;20(15):5594-5607. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.20-15-05594.2000\">10.1523/JNEUROSCI.20-15-05594.2000</a>","short":"U. Kraushaar, P.M. Jonas, Journal of Neuroscience 20 (2000) 5594–5607.","chicago":"Kraushaar, Udo, and Peter M Jonas. “Efficacy and Stability of Quantal GABA Release at a Hippocampal Interneuron-Principal Neuron Synapse.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2000. <a href=\"https://doi.org/10.1523/JNEUROSCI.20-15-05594.2000\">https://doi.org/10.1523/JNEUROSCI.20-15-05594.2000</a>."},"abstract":[{"text":"We have examined factors that determine the strength and dynamics of GABAergic synapses between interneurons [dentate gyrus basket cells (BCs)] and principal neurons [dentate gyrus granule cells (GCs)] using paired recordings in rat hippocampal slices at 34°C. Unitary IPSCs recorded from BC–GC pairs in high intracellular Cl− concentration showed a fast rise and a biexponential decay, with mean time constants of 2 and 9 msec. The mean quantal conductance change, determined directly at reduced extracellular Ca2+/Mg2+concentration ratios, was 1.7 nS. Quantal release at the BC–GC synapse occurred with short delay and was highly synchronized. Analysis of IPSC peak amplitudes and numbers of failures by multiple probability compound binomial analysis indicated that synaptic transmission at the BC–GC synapse involves three to seven release sites, each of which releases transmitter with high probability (∼0.5 in 2 mMCa2+/1 mM Mg2+). Unitary BC–GC IPSCs showed paired-pulse depression (PPD); maximal depression, measured for 10 msec intervals, was 37%, and recovery from depression occurred with a time constant of 2 sec. Paired-pulse depression was mainly presynaptic in origin but appeared to be independent of previous release. Synaptic transmission at the BC–GC synapse showed frequency-dependent depression, with half-maximal decrease at 5 Hz after a series of 1000 presynaptic action potentials. The relative stability of transmission at the BC–GC synapse is consistent with a model in which an activity-dependent gating mechanism reduces release probability and thereby prevents depletion of the releasable pool of synaptic vesicles. Thus several mechanisms converge on the generation of powerful and sustained transmission at interneuron–principal neuron synapses in hippocampal circuits.","lang":"eng"}],"type":"journal_article","title":"Efficacy and stability of quantal GABA release at a hippocampal interneuron-principal neuron synapse","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6772523/","open_access":"1"}],"article_processing_charge":"No","month":"08","publisher":"Society for Neuroscience","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","pmid":1,"doi":"10.1523/JNEUROSCI.20-15-05594.2000","publication":"Journal of Neuroscience","issue":"15","year":"2000","publication_status":"published","author":[{"full_name":"Kraushaar, Udo","first_name":"Udo","last_name":"Kraushaar"},{"full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas"}],"date_created":"2018-12-11T12:03:36Z","date_updated":"2023-05-03T08:18:39Z","publist_id":"2898","external_id":{"pmid":["10908596"]},"date_published":"2000-08-01T00:00:00Z","status":"public","language":[{"iso":"eng"}],"oa":1,"_id":"3489","day":"01","acknowledgement":"This work was supported by grants from the Deutsche Forschungsgemeinschaft (SFB 505/C5) and the Human Frontiers Science Program Organization (RG0017/1998-B) to P.J. Novartis generously provided CGP55845A. We thank Drs. J. Bischofberger, F. A. Edwards, J. R. P. Geiger, M. V. Jones, M. Martina, and A. Roth for critically reading this manuscript. We also thank A. Blomenkamp for technical assistance.","scopus_import":"1","article_type":"original","intvolume":"        20","publication_identifier":{"issn":["0270-6474"]},"extern":"1","volume":20},{"intvolume":"        20","article_type":"original","extern":"1","volume":20,"publication_identifier":{"issn":["0270-6474"]},"language":[{"iso":"eng"}],"status":"public","date_published":"2000-11-15T00:00:00Z","publist_id":"2897","external_id":{"pmid":["11069935"]},"date_updated":"2023-05-03T08:02:52Z","date_created":"2018-12-11T12:03:36Z","author":[{"first_name":"Claus","last_name":"Normann","full_name":"Normann, Claus"},{"full_name":"Peckys, Diana","last_name":"Peckys","first_name":"Diana"},{"first_name":"Christian","last_name":"Schulze","full_name":"Schulze, Christian"},{"last_name":"Walden","first_name":"Jörg","full_name":"Walden, Jörg"},{"last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"last_name":"Bischofberger","first_name":"Joseph","full_name":"Bischofberger, Joseph"}],"year":"2000","publication_status":"published","acknowledgement":"This work was supported by a grant from the Deutsche Forschungsgemeinschaft Bi 642/1–2 and University funds (J.B.) and by the Vada and Theodore Stanley Foundation (J.W.). We thank Drs. M. Bartos, J. R. P. Geiger, and M. Martina for critically reading this manuscript and A. Blomenkamp for technical assistance.","day":"15","_id":"3490","oa":1,"doi":"10.1523/JNEUROSCI.20-22-08290.2000","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","issue":"22","publication":"Journal of Neuroscience","title":"Associative long-term depression in the hippocampus is dependent on postsynaptic N-type Ca(2+) channels","abstract":[{"lang":"eng","text":"Long-term depression (LTD) is a form of synaptic plasticity that can be induced either by low-frequency stimulation of presynaptic fibers or in an associative manner by asynchronous pairing of presynaptic and postsynaptic activity. We investigated the induction mechanisms of associative LTD in CA1 pyramidal neurons of the hippocampus using whole-cell patch-clamp recordings and Ca2+ imaging in acute brain slices. Asynchronous pairing of postsynaptic action potentials with EPSPs evoked with a delay of 20 msec induced a robust, long-lasting depression of the EPSP amplitude to 43%. Unlike LTD induced by low-frequency stimulation, associative LTD was resistant to the application of D-AP-5, indicating that it is independent of NMDA receptors. In contrast, associative LTD was inhibited by (S)-α-methyl-4-carboxyphenyl-glycine, indicating the involvement of metabotropic glutamate receptors. Furthermore, associative LTD is dependent on the activation of voltage-gated Ca2+ channels by postsynaptic action potentials. Both nifedipine, an L-type Ca2+ channel antagonist, and ω-conotoxin GVIA, a selective N-type channel blocker, abolished the induction of associative LTD. 8-hydroxy-2-dipropylaminotetralin (OH-DPAT), a 5-HT(1A) receptor agonist, inhibited postsynaptic Ca2+ influx through N-type Ca2+ channels, without affecting presynaptic transmitter release. OH-DPAT also inhibited the induction of associative LTD, suggesting that the involvement of N-type channels makes synaptic plasticity accessible to modulation by neurotransmitters. Thus, the modulation of N-type Ca2+ channels provides a gain control for synaptic depression in hippocampal pyramidal neurons."}],"type":"journal_article","citation":{"ista":"Normann C, Peckys D, Schulze C, Walden J, Jonas PM, Bischofberger J. 2000. Associative long-term depression in the hippocampus is dependent on postsynaptic N-type Ca(2+) channels. Journal of Neuroscience. 20(22), 8290–8297.","ama":"Normann C, Peckys D, Schulze C, Walden J, Jonas PM, Bischofberger J. Associative long-term depression in the hippocampus is dependent on postsynaptic N-type Ca(2+) channels. <i>Journal of Neuroscience</i>. 2000;20(22):8290-8297. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.20-22-08290.2000\">10.1523/JNEUROSCI.20-22-08290.2000</a>","ieee":"C. Normann, D. Peckys, C. Schulze, J. Walden, P. M. Jonas, and J. Bischofberger, “Associative long-term depression in the hippocampus is dependent on postsynaptic N-type Ca(2+) channels,” <i>Journal of Neuroscience</i>, vol. 20, no. 22. Society for Neuroscience, pp. 8290–8297, 2000.","mla":"Normann, Claus, et al. “Associative Long-Term Depression in the Hippocampus Is Dependent on Postsynaptic N-Type Ca(2+) Channels.” <i>Journal of Neuroscience</i>, vol. 20, no. 22, Society for Neuroscience, 2000, pp. 8290–97, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.20-22-08290.2000\">10.1523/JNEUROSCI.20-22-08290.2000</a>.","apa":"Normann, C., Peckys, D., Schulze, C., Walden, J., Jonas, P. M., &#38; Bischofberger, J. (2000). Associative long-term depression in the hippocampus is dependent on postsynaptic N-type Ca(2+) channels. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.20-22-08290.2000\">https://doi.org/10.1523/JNEUROSCI.20-22-08290.2000</a>","chicago":"Normann, Claus, Diana Peckys, Christian Schulze, Jörg Walden, Peter M Jonas, and Joseph Bischofberger. “Associative Long-Term Depression in the Hippocampus Is Dependent on Postsynaptic N-Type Ca(2+) Channels.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2000. <a href=\"https://doi.org/10.1523/JNEUROSCI.20-22-08290.2000\">https://doi.org/10.1523/JNEUROSCI.20-22-08290.2000</a>.","short":"C. Normann, D. Peckys, C. Schulze, J. Walden, P.M. Jonas, J. Bischofberger, Journal of Neuroscience 20 (2000) 8290–8297."},"page":"8290 - 8297","oa_version":"Published Version","publisher":"Society for Neuroscience","article_processing_charge":"No","month":"11","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6773198/"}]},{"intvolume":"       287","article_type":"original","volume":287,"extern":"1","publication_identifier":{"issn":["0036-8075"]},"date_published":"2000-01-14T00:00:00Z","publist_id":"2896","external_id":{"pmid":["10634782"]},"language":[{"iso":"eng"}],"status":"public","publication_status":"published","year":"2000","date_updated":"2023-05-03T07:55:32Z","author":[{"full_name":"Martina, Marco","first_name":"Marco","last_name":"Martina"},{"first_name":"Imre","last_name":"Vida","full_name":"Vida, Imre"},{"first_name":"Peter M","last_name":"Jonas","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T12:03:36Z","scopus_import":"1","_id":"3491","day":"14","doi":"10.1126/science.287.5451.295","quality_controlled":"1","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","issue":"5451","publication":"Science","type":"journal_article","abstract":[{"lang":"eng","text":"Fast and reliable activation of inhibitory interneurons is critical for the stability of cortical neuronal networks. Active conductances in dendrites may facilitate interneuron activation, but direct experimental evidence was unavailable. Patch-clamp recordings from dendrites of hippocampal oriens- alveus interneurons revealed high densities of voltage-gated sodium and potassium ion channels. Simultaneous recordings from dendrites and somata suggested that action potential initiation occurs preferentially in the axon with long threshold stimuli, but can be shifted to somatodendritic sites when brief stimuli are applied. After initiation, action potentials propagate over the somatodendritic domain with constant amplitude, high velocity, and reliability, even during high-frequency trains."}],"title":"Distal initiation and active propagation of action potentials in interneuron dendrites","oa_version":"None","page":"295 - 300","citation":{"chicago":"Martina, Marco, Imre Vida, and Peter M Jonas. “Distal Initiation and Active Propagation of Action Potentials in Interneuron Dendrites.” <i>Science</i>. American Association for the Advancement of Science, 2000. <a href=\"https://doi.org/10.1126/science.287.5451.295\">https://doi.org/10.1126/science.287.5451.295</a>.","short":"M. Martina, I. Vida, P.M. Jonas, Science 287 (2000) 295–300.","ista":"Martina M, Vida I, Jonas PM. 2000. Distal initiation and active propagation of action potentials in interneuron dendrites. Science. 287(5451), 295–300.","ieee":"M. Martina, I. Vida, and P. M. Jonas, “Distal initiation and active propagation of action potentials in interneuron dendrites,” <i>Science</i>, vol. 287, no. 5451. American Association for the Advancement of Science, pp. 295–300, 2000.","ama":"Martina M, Vida I, Jonas PM. Distal initiation and active propagation of action potentials in interneuron dendrites. <i>Science</i>. 2000;287(5451):295-300. doi:<a href=\"https://doi.org/10.1126/science.287.5451.295\">10.1126/science.287.5451.295</a>","mla":"Martina, Marco, et al. “Distal Initiation and Active Propagation of Action Potentials in Interneuron Dendrites.” <i>Science</i>, vol. 287, no. 5451, American Association for the Advancement of Science, 2000, pp. 295–300, doi:<a href=\"https://doi.org/10.1126/science.287.5451.295\">10.1126/science.287.5451.295</a>.","apa":"Martina, M., Vida, I., &#38; Jonas, P. M. (2000). Distal initiation and active propagation of action potentials in interneuron dendrites. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.287.5451.295\">https://doi.org/10.1126/science.287.5451.295</a>"},"publisher":"American Association for the Advancement of Science","article_processing_charge":"No","month":"01"},{"language":[{"iso":"eng"}],"status":"public","date_published":"2000-12-01T00:00:00Z","publist_id":"2895","external_id":{"pmid":["11163277"]},"date_updated":"2023-05-02T14:34:37Z","date_created":"2018-12-11T12:03:37Z","author":[{"full_name":"Geiger, Jörg","last_name":"Geiger","first_name":"Jörg"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M","last_name":"Jonas"}],"year":"2000","publication_status":"published","day":"01","_id":"3492","intvolume":"        28","article_type":"original","volume":28,"extern":"1","publication_identifier":{"issn":["0896-6273"]},"title":"Dynamic control of presynaptic Ca(2+) inflow by fast-inactivating K+ channels in hippocampal mossy fiber boutons","type":"journal_article","abstract":[{"lang":"eng","text":"Analysis of presynaptic determinants of synaptic strength has been difficult at cortical synapses, mainly due to the lack of direct access to presynaptic elements. Here we report patch-clamp recordings from mossy fiber boutons (MFBs) in rat hippocampal slices. The presynaptic action potential is very short during low-frequency stimulation but is prolonged up to 3-fold during high-frequency stimulation. Voltage-gated K+ channels in MFBs inactivate rapidly but recover from inactivation very slowly, suggesting that cumulative K+ channel inactivation mediates activity-dependent spike broadening. Prolongation of the presynaptic voltage waveform leads to an increase in the number of Ca2+ ions entering the terminal per action potential and to a consecutive potentiation of evoked excitatory postsynaptic currents at MFB-CA3 pyramidal cell synapses. Thus, inactivation of presynaptic K+ channels contributes to the control of efficacy of a glutamatergic synapse in the cortex."}],"citation":{"short":"J. Geiger, P.M. Jonas, Neuron 28 (2000) 927–939.","chicago":"Geiger, Jörg, and Peter M Jonas. “Dynamic Control of Presynaptic Ca(2+) Inflow by Fast-Inactivating K+ Channels in Hippocampal Mossy Fiber Boutons.” <i>Neuron</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1016/S0896-6273(00)00164-1\">https://doi.org/10.1016/S0896-6273(00)00164-1</a>.","apa":"Geiger, J., &#38; Jonas, P. M. (2000). Dynamic control of presynaptic Ca(2+) inflow by fast-inactivating K+ channels in hippocampal mossy fiber boutons. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0896-6273(00)00164-1\">https://doi.org/10.1016/S0896-6273(00)00164-1</a>","mla":"Geiger, Jörg, and Peter M. Jonas. “Dynamic Control of Presynaptic Ca(2+) Inflow by Fast-Inactivating K+ Channels in Hippocampal Mossy Fiber Boutons.” <i>Neuron</i>, vol. 28, no. 3, Elsevier, 2000, pp. 927–39, doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)00164-1\">10.1016/S0896-6273(00)00164-1</a>.","ama":"Geiger J, Jonas PM. Dynamic control of presynaptic Ca(2+) inflow by fast-inactivating K+ channels in hippocampal mossy fiber boutons. <i>Neuron</i>. 2000;28(3):927-939. doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)00164-1\">10.1016/S0896-6273(00)00164-1</a>","ieee":"J. Geiger and P. M. Jonas, “Dynamic control of presynaptic Ca(2+) inflow by fast-inactivating K+ channels in hippocampal mossy fiber boutons,” <i>Neuron</i>, vol. 28, no. 3. Elsevier, pp. 927–939, 2000.","ista":"Geiger J, Jonas PM. 2000. Dynamic control of presynaptic Ca(2+) inflow by fast-inactivating K+ channels in hippocampal mossy fiber boutons. Neuron. 28(3), 927–939."},"page":"927 - 939","oa_version":"None","publisher":"Elsevier","article_processing_charge":"No","month":"12","doi":"10.1016/S0896-6273(00)00164-1","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","issue":"3","publication":"Neuron"},{"issue":"1","publication":"Journal of Neurophysiology","quality_controlled":"1","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1152/jn.2000.84.1.390","month":"07","article_processing_charge":"No","publisher":"American Physiological Society","page":"390 - 400","oa_version":"None","citation":{"chicago":"Henze, Darrell, Zsolt Borhegyi, Jozsef L Csicsvari, Akira Mamiya, Kenneth Harris, and György Buzsáki. “Intracellular Features Predicted by Extracellular Recordings in the Hippocampus in Vivo.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2000. <a href=\"https://doi.org/10.1152/jn.2000.84.1.390\">https://doi.org/10.1152/jn.2000.84.1.390</a>.","short":"D. Henze, Z. Borhegyi, J.L. Csicsvari, A. Mamiya, K. Harris, G. Buzsáki, Journal of Neurophysiology 84 (2000) 390–400.","ista":"Henze D, Borhegyi Z, Csicsvari JL, Mamiya A, Harris K, Buzsáki G. 2000. Intracellular features predicted by extracellular recordings in the hippocampus in vivo. Journal of Neurophysiology. 84(1), 390–400.","ama":"Henze D, Borhegyi Z, Csicsvari JL, Mamiya A, Harris K, Buzsáki G. Intracellular features predicted by extracellular recordings in the hippocampus in vivo. <i>Journal of Neurophysiology</i>. 2000;84(1):390-400. doi:<a href=\"https://doi.org/10.1152/jn.2000.84.1.390\">10.1152/jn.2000.84.1.390</a>","ieee":"D. Henze, Z. Borhegyi, J. L. Csicsvari, A. Mamiya, K. Harris, and G. Buzsáki, “Intracellular features predicted by extracellular recordings in the hippocampus in vivo,” <i>Journal of Neurophysiology</i>, vol. 84, no. 1. American Physiological Society, pp. 390–400, 2000.","mla":"Henze, Darrell, et al. “Intracellular Features Predicted by Extracellular Recordings in the Hippocampus in Vivo.” <i>Journal of Neurophysiology</i>, vol. 84, no. 1, American Physiological Society, 2000, pp. 390–400, doi:<a href=\"https://doi.org/10.1152/jn.2000.84.1.390\">10.1152/jn.2000.84.1.390</a>.","apa":"Henze, D., Borhegyi, Z., Csicsvari, J. L., Mamiya, A., Harris, K., &#38; Buzsáki, G. (2000). Intracellular features predicted by extracellular recordings in the hippocampus in vivo. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.2000.84.1.390\">https://doi.org/10.1152/jn.2000.84.1.390</a>"},"type":"journal_article","abstract":[{"text":"Multichannel tetrode array recording in awake behaving animals provides a powerful method to record the activity of large numbers of neurons. The power of this method could be extended if further information concerning the intracellular state of the neurons could be extracted from the extracellularly recorded signals. Toward this end, we have simultaneously recorded intracellular and extracellular signals from hippocampal CA1 pyramidal cells and interneurons in the anesthetized rat. We found that several intracellular parameters can be deduced from extracellular spike waveforms. The width of the intracellular action potential is defined precisely by distinct points on the extracellular spike. Amplitude changes of the intracellular action potential are reflected by changes in the amplitude of the initial negative phase of the extracellular spike, and these amplitude changes are dependent on the state of the network. In addition, intracellular recordings from dendrites with simultaneous extracellular recordings from the soma indicate that, on average, action potentials are initiated in the perisomatic region and propagate to the dendrites at 1.68 m/s. Finally we determined that a tetrode in hippocampal area CA1 theoretically should be able to record electrical signals from similar to 1,000 neurons. Of these, 60-100 neurons should generate spikes of sufficient amplitude to be detectable from the noise and to allow for their separation using current spatial clustering methods. This theoretical maximum is in contrast to the approximately six units that are usually detected per tetrode. From this, we conclude that a large percentage of hippocampal CA1 pyramidal cells are silent in any given behavioral condition.","lang":"eng"}],"title":"Intracellular features predicted by extracellular recordings in the hippocampus in vivo","publication_identifier":{"issn":["0022-3077"]},"volume":84,"extern":"1","article_type":"original","intvolume":"        84","_id":"3532","day":"01","acknowledgement":"We thank M. Recce for comments on the manuscript and J. Hetke and K.Wise for supplying us with the silicon probes (1P41RR09754).This work was supported by National Institutes of Health Grants NS-34994,MH-54671,  and  MH-12403  (to  D. A. Henze), the Epilepsy Foundation of American (D. A.Henze), and an Eotvos fellowship (Z. Borhegyi).","publication_status":"published","year":"2000","date_updated":"2023-05-02T14:31:13Z","date_created":"2018-12-11T12:03:49Z","author":[{"full_name":"Henze, Darrell","first_name":"Darrell","last_name":"Henze"},{"full_name":"Borhegyi, Zsolt","first_name":"Zsolt","last_name":"Borhegyi"},{"full_name":"Csicsvari, Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L"},{"first_name":"Akira","last_name":"Mamiya","full_name":"Mamiya, Akira"},{"full_name":"Harris, Kenneth","first_name":"Kenneth","last_name":"Harris"},{"full_name":"Buzsáki, György","first_name":"György","last_name":"Buzsáki"}],"external_id":{"pmid":["10899213"]},"date_published":"2000-07-01T00:00:00Z","publist_id":"2854","language":[{"iso":"eng"}],"status":"public"},{"publisher":"Elsevier","month":"11","article_processing_charge":"No","day":"01","_id":"3542","language":[{"iso":"eng"}],"title":"Ensemble patterns of hippocampal CA3-CA1 neurons during sharp wave-associated population events","status":"public","date_published":"2000-11-01T00:00:00Z","publist_id":"2843","type":"journal_article","abstract":[{"text":"Transfer of neuronal patterns from the CA3 to CA1 region was studied by simultaneous recording of neuronal ensembles in the behaving rat. A nonlinear interaction among pyramidal neurons was observed during sharp wave (SPW)-related population bursts, with stronger synchrony associated with more widespread spatial coherence. SPW bursts emerged in the CA3a-b subregions and spread to CA3c before invading the CA1 area. Synchronous discharge of &gt;10% of the CA3 within a 100 ms window was required to exert a detectable influence on CA1 pyramidal cells. Activity of some CA3 pyramidal neurons differentially predicted the ripple-related discharge of circumscribed groups of CA1 pyramidal cells. We suggest that, in SPW behavioral state, the coherent discharge of a small group of CA3 cells is the primary cause of spiking activity in CA1 pyramidal neurons.","lang":"eng"}],"date_updated":"2023-05-02T14:26:07Z","date_created":"2018-12-11T12:03:52Z","citation":{"mla":"Csicsvari, Jozsef L., et al. “Ensemble Patterns of Hippocampal CA3-CA1 Neurons during Sharp Wave-Associated Population Events.” <i>Neuron</i>, vol. 28, no. 2, Elsevier, 2000, pp. 585–94, doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)00135-5\">10.1016/S0896-6273(00)00135-5</a>.","apa":"Csicsvari, J. L., Hirase, H., Mamiya, A., &#38; Buzsáki, G. (2000). Ensemble patterns of hippocampal CA3-CA1 neurons during sharp wave-associated population events. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0896-6273(00)00135-5\">https://doi.org/10.1016/S0896-6273(00)00135-5</a>","ama":"Csicsvari JL, Hirase H, Mamiya A, Buzsáki G. Ensemble patterns of hippocampal CA3-CA1 neurons during sharp wave-associated population events. <i>Neuron</i>. 2000;28(2):585-594. doi:<a href=\"https://doi.org/10.1016/S0896-6273(00)00135-5\">10.1016/S0896-6273(00)00135-5</a>","ieee":"J. L. Csicsvari, H. Hirase, A. Mamiya, and G. Buzsáki, “Ensemble patterns of hippocampal CA3-CA1 neurons during sharp wave-associated population events,” <i>Neuron</i>, vol. 28, no. 2. Elsevier, pp. 585–594, 2000.","ista":"Csicsvari JL, Hirase H, Mamiya A, Buzsáki G. 2000. Ensemble patterns of hippocampal CA3-CA1 neurons during sharp wave-associated population events. Neuron. 28(2), 585–594.","short":"J.L. Csicsvari, H. Hirase, A. Mamiya, G. Buzsáki, Neuron 28 (2000) 585–594.","chicago":"Csicsvari, Jozsef L, Hajima Hirase, Akira Mamiya, and György Buzsáki. “Ensemble Patterns of Hippocampal CA3-CA1 Neurons during Sharp Wave-Associated Population Events.” <i>Neuron</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1016/S0896-6273(00)00135-5\">https://doi.org/10.1016/S0896-6273(00)00135-5</a>."},"author":[{"orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Csicsvari, Jozsef L","last_name":"Csicsvari","first_name":"Jozsef L"},{"last_name":"Hirase","first_name":"Hajima","full_name":"Hirase, Hajima"},{"first_name":"Akira","last_name":"Mamiya","full_name":"Mamiya, Akira"},{"full_name":"Buzsáki, György","first_name":"György","last_name":"Buzsáki"}],"year":"2000","publication_status":"published","page":"585 - 594","oa_version":"None","volume":28,"extern":"1","issue":"2","publication":"Neuron","publication_identifier":{"issn":["0896-6273"]},"intvolume":"        28","doi":"10.1016/S0896-6273(00)00135-5","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_type":"original","quality_controlled":"1"},{"title":"Accuracy of tetrode spike separation as determined by simultaneous intracellular and extracellular measurements","abstract":[{"lang":"eng","text":"Simultaneous recording from large numbers of neurons is a prerequisite for understanding their cooperative behavior. Various recording techniques and spike separation methods are being used toward this goal. However, the error rates involved in spike separation have not yet been quantified. We studied the separation reliability of “tetrode” (4-wire electrode) recorded spikes by monitoring simultaneously from the same cell intracellularly with a glass pipette and extracellularly with a tetrode. With manual spike sorting, we found a trade-off between Type I and Type II errors, with errors typically ranging from 0 to 30% depending on the amplitude and firing pattern of the cell, the similarity of the waveshapes of neighboring neurons, and the experience of the operator. Performance using only a single wire was markedly lower, indicating the advantages of multiple-site monitoring techniques over single-wire recordings. For tetrode recordings, error rates were increased by burst activity and during periods of cellular synchrony. The lowest possible separation error rates were estimated by a search for the best ellipsoidal cluster shape. Human operator performance was significantly below the estimated optimum. Investigation of error distributions indicated that suboptimal performance was caused by inability of the operators to mark cluster boundaries accurately in a high-dimensional feature space. We therefore hypothesized that automatic spike-sorting algorithms have the potential to significantly lower error rates. Implementation of a semi-automatic classification system confirms this suggestion, reducing errors close to the estimated optimum, in the range 0-8%."}],"type":"journal_article","citation":{"ista":"Harris K, Henze D, Csicsvari JL, Hirase H, Buzsáki G. 2000. Accuracy of tetrode spike separation as determined by simultaneous intracellular and extracellular measurements. Journal of Neurophysiology. 84(1), 401–414.","mla":"Harris, Kenneth, et al. “Accuracy of Tetrode Spike Separation as Determined by Simultaneous Intracellular and Extracellular Measurements.” <i>Journal of Neurophysiology</i>, vol. 84, no. 1, American Physiological Society, 2000, pp. 401–14, doi:<a href=\"https://doi.org/10.1152/jn.2000.84.1.401\">10.1152/jn.2000.84.1.401</a>.","apa":"Harris, K., Henze, D., Csicsvari, J. L., Hirase, H., &#38; Buzsáki, G. (2000). Accuracy of tetrode spike separation as determined by simultaneous intracellular and extracellular measurements. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.2000.84.1.401\">https://doi.org/10.1152/jn.2000.84.1.401</a>","ieee":"K. Harris, D. Henze, J. L. Csicsvari, H. Hirase, and G. Buzsáki, “Accuracy of tetrode spike separation as determined by simultaneous intracellular and extracellular measurements,” <i>Journal of Neurophysiology</i>, vol. 84, no. 1. American Physiological Society, pp. 401–414, 2000.","ama":"Harris K, Henze D, Csicsvari JL, Hirase H, Buzsáki G. Accuracy of tetrode spike separation as determined by simultaneous intracellular and extracellular measurements. <i>Journal of Neurophysiology</i>. 2000;84(1):401-414. doi:<a href=\"https://doi.org/10.1152/jn.2000.84.1.401\">10.1152/jn.2000.84.1.401</a>","short":"K. Harris, D. Henze, J.L. Csicsvari, H. Hirase, G. Buzsáki, Journal of Neurophysiology 84 (2000) 401–414.","chicago":"Harris, Kenneth, Darrell Henze, Jozsef L Csicsvari, Hajima Hirase, and György Buzsáki. “Accuracy of Tetrode Spike Separation as Determined by Simultaneous Intracellular and Extracellular Measurements.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2000. <a href=\"https://doi.org/10.1152/jn.2000.84.1.401\">https://doi.org/10.1152/jn.2000.84.1.401</a>."},"page":"401 - 414","oa_version":"None","publisher":"American Physiological Society","article_processing_charge":"No","month":"07","doi":"10.1152/jn.2000.84.1.401","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","issue":"1","publication":"Journal of Neurophysiology","language":[{"iso":"eng"}],"status":"public","external_id":{"pmid":["10899214 "]},"date_published":"2000-07-01T00:00:00Z","publist_id":"2837","date_updated":"2023-05-02T14:16:45Z","date_created":"2018-12-11T12:03:54Z","author":[{"full_name":"Harris, Kenneth","last_name":"Harris","first_name":"Kenneth"},{"last_name":"Henze","first_name":"Darrell","full_name":"Henze, Darrell"},{"full_name":"Csicsvari, Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","first_name":"Jozsef L","last_name":"Csicsvari"},{"full_name":"Hirase, Hajima","last_name":"Hirase","first_name":"Hajima"},{"full_name":"Buzsáki, György","first_name":"György","last_name":"Buzsáki"}],"publication_status":"published","year":"2000","acknowledgement":"The costs of publication of this article were defrayed in part by the payment of page charges. The article must therefore be hereby marked ‘‘advertisement’ ’in accordance with 18 U.S.C. Section 1734 solely to indicate this fact. We thank R. Bruno for performing cluster analysis and drawing our attention to the AutoClass program, M. Recce and P. Mitra for suggestions withdata  analysis and comments on the manuscript, C. King, G. Dragoi, and X.Leinekugel for performing  cluster analysis, and  J. Hetke and K. Wise for supplying silicon probes. The data used in this paper are available on request by e-mail to G. Buzsaki. This work was supported by National Institutes of Health Grants NS-34994,413 MH-54671, and MH-12403 (to D. A. Henze) and by the Epilepsy Foundationof America (to D. A. Henze).","day":"01","_id":"3548","intvolume":"        84","article_type":"original","extern":"1","volume":84,"publication_identifier":{"issn":["0022-3077"]}},{"extern":"1","publication":"Proceedings of the 32nd annual ACM symposium on Theory of computing","publication_identifier":{"isbn":["9781581131840"]},"doi":"10.1145/335305.335338","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","publisher":"ACM","scopus_import":"1","conference":{"name":"STOC: Symposium on the Theory of Computing","end_date":"2000-05-23","location":"Portland, OR, USA","start_date":"2000-05-21"},"month":"06","article_processing_charge":"No","day":"01","_id":"3555","title":"Smoothing and cleaning up slivers","language":[{"iso":"eng"}],"status":"public","publist_id":"2830","date_published":"2000-06-01T00:00:00Z","type":"conference","abstract":[{"text":"A sliver is a tetrahedron whose four vertices lie close to a plane and whose perpendicular projection to that plane is a convex quadrilateral with no short edge. Slivers are both undesirable and ubiquitous in 3-dimensional Delaunay triangulations. Even when the point-set is well-spaced, slivers may result. This paper shows that such a point set permits a small perturbation whose Delaunay triangulation contains no slivers. It also gives deterministic algorithms that compute the perturbation of n points in time O(n log n) with one processor and in time O(log n) with O(n) processors.","lang":"eng"}],"date_updated":"2023-05-02T14:07:00Z","citation":{"chicago":"Edelsbrunner, Herbert, Xiang Li, Gary Miller, Andreas Stathopoulos, Dafna Talmor, Shang Teng, Alper Üngör, and Noel Walkington. “Smoothing and Cleaning up Slivers.” In <i>Proceedings of the 32nd Annual ACM Symposium on Theory of Computing</i>, 273–77. ACM, 2000. <a href=\"https://doi.org/10.1145/335305.335338\">https://doi.org/10.1145/335305.335338</a>.","short":"H. Edelsbrunner, X. Li, G. Miller, A. Stathopoulos, D. Talmor, S. Teng, A. Üngör, N. Walkington, in:, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, 2000, pp. 273–277.","ista":"Edelsbrunner H, Li X, Miller G, Stathopoulos A, Talmor D, Teng S, Üngör A, Walkington N. 2000. Smoothing and cleaning up slivers. Proceedings of the 32nd annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 273–277.","ama":"Edelsbrunner H, Li X, Miller G, et al. Smoothing and cleaning up slivers. In: <i>Proceedings of the 32nd Annual ACM Symposium on Theory of Computing</i>. ACM; 2000:273-277. doi:<a href=\"https://doi.org/10.1145/335305.335338\">10.1145/335305.335338</a>","ieee":"H. Edelsbrunner <i>et al.</i>, “Smoothing and cleaning up slivers,” in <i>Proceedings of the 32nd annual ACM symposium on Theory of computing</i>, Portland, OR, USA, 2000, pp. 273–277.","mla":"Edelsbrunner, Herbert, et al. “Smoothing and Cleaning up Slivers.” <i>Proceedings of the 32nd Annual ACM Symposium on Theory of Computing</i>, ACM, 2000, pp. 273–77, doi:<a href=\"https://doi.org/10.1145/335305.335338\">10.1145/335305.335338</a>.","apa":"Edelsbrunner, H., Li, X., Miller, G., Stathopoulos, A., Talmor, D., Teng, S., … Walkington, N. (2000). Smoothing and cleaning up slivers. In <i>Proceedings of the 32nd annual ACM symposium on Theory of computing</i> (pp. 273–277). Portland, OR, USA: ACM. <a href=\"https://doi.org/10.1145/335305.335338\">https://doi.org/10.1145/335305.335338</a>"},"author":[{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Xiang","last_name":"Li","id":"4B7E523C-F248-11E8-B48F-1D18A9856A87","full_name":"Li, Xiang"},{"full_name":"Miller, Gary","first_name":"Gary","last_name":"Miller"},{"full_name":"Stathopoulos, Andreas","last_name":"Stathopoulos","first_name":"Andreas"},{"full_name":"Talmor, Dafna","last_name":"Talmor","first_name":"Dafna"},{"full_name":"Teng, Shang","last_name":"Teng","first_name":"Shang"},{"last_name":"Üngör","first_name":"Alper","full_name":"Üngör, Alper"},{"first_name":"Noel","last_name":"Walkington","full_name":"Walkington, Noel"}],"date_created":"2018-12-11T12:03:56Z","year":"2000","publication_status":"published","oa_version":"None","page":"273 - 277"},{"abstract":[{"text":"Allzulange wurde die spielhafte Beschäftigung als Gegensatz zu ernsthafter Arbeit gesehen. Dieser Artikel propagiert die spielerische Untersuchung von Kreis- und Kugelmengen. Gleichzeitig belegt er die nutzbare Anwendung\r\nvon elementaren Einsichten in der Molekularbiologie und allgemeiner\r\nin der Beschreibung von Form und Verformung.","lang":"eng"}],"type":"book_chapter","publist_id":"2813","date_published":"2000-01-01T00:00:00Z","status":"public","title":"Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung","language":[{"iso":"eng"}],"page":"153 - 171","oa_version":"None","year":"2000","publication_status":"published","date_created":"2018-12-11T12:04:01Z","citation":{"mla":"Edelsbrunner, Herbert. “Spielereien Mit Kreisen Und Kugeln. Zum Thema Form Und Verformung.” <i>Zur Kunst Des Formalen Denkens</i>, Passagen Verlag, 2000, pp. 153–71.","apa":"Edelsbrunner, H. (2000). Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung. In <i>Zur Kunst des formalen Denkens</i> (pp. 153–171). Passagen Verlag.","ama":"Edelsbrunner H. Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung. In: <i>Zur Kunst Des Formalen Denkens</i>. Passagen Verlag; 2000:153-171.","ieee":"H. Edelsbrunner, “Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung,” in <i>Zur Kunst des formalen Denkens</i>, Passagen Verlag, 2000, pp. 153–171.","ista":"Edelsbrunner H. 2000.Spielereien mit Kreisen und Kugeln. Zum Thema Form und Verformung. In: Zur Kunst des formalen Denkens. , 153–171.","short":"H. Edelsbrunner, in:, Zur Kunst Des Formalen Denkens, Passagen Verlag, 2000, pp. 153–171.","chicago":"Edelsbrunner, Herbert. “Spielereien Mit Kreisen Und Kugeln. Zum Thema Form Und Verformung.” In <i>Zur Kunst Des Formalen Denkens</i>, 153–71. Passagen Verlag, 2000."},"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"}],"date_updated":"2023-05-02T13:07:14Z","publisher":"Passagen Verlag","_id":"3572","day":"01","month":"01","article_processing_charge":"No","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Zur Kunst des formalen Denkens","extern":"1","publication_identifier":{"isbn":["3851653580"]}},{"quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1017/S0962492900001331","intvolume":"         9","publication":"Acta Numerica","volume":9,"extern":"1","oa_version":"None","page":"133 - 213","year":"2000","publication_status":"published","citation":{"chicago":"Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” <i>Acta Numerica</i>. Cambridge University Press, 2000. <a href=\"https://doi.org/10.1017/S0962492900001331\">https://doi.org/10.1017/S0962492900001331</a>.","short":"H. Edelsbrunner, Acta Numerica 9 (2000) 133–213.","ista":"Edelsbrunner H. 2000. Triangulations and meshes in computational geometry. Acta Numerica. 9, 133–213.","ama":"Edelsbrunner H. Triangulations and meshes in computational geometry. <i>Acta Numerica</i>. 2000;9:133-213. doi:<a href=\"https://doi.org/10.1017/S0962492900001331\">10.1017/S0962492900001331</a>","ieee":"H. Edelsbrunner, “Triangulations and meshes in computational geometry,” <i>Acta Numerica</i>, vol. 9. Cambridge University Press, pp. 133–213, 2000.","mla":"Edelsbrunner, Herbert. “Triangulations and Meshes in Computational Geometry.” <i>Acta Numerica</i>, vol. 9, Cambridge University Press, 2000, pp. 133–213, doi:<a href=\"https://doi.org/10.1017/S0962492900001331\">10.1017/S0962492900001331</a>.","apa":"Edelsbrunner, H. (2000). Triangulations and meshes in computational geometry. <i>Acta Numerica</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0962492900001331\">https://doi.org/10.1017/S0962492900001331</a>"},"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"}],"date_created":"2018-12-11T12:04:05Z","date_updated":"2023-05-02T12:20:27Z","abstract":[{"lang":"eng","text":"The Delaunay triangulation of a finite point set is a central theme in computational geometry. It finds its major application in the generation of meshes used in the simulation of physical processes. This paper connects the predominantly combinatorial work in classical computational geometry with the numerical interest in mesh generation. It focuses on the two- and three-dimensional case and covers results obtained during the twentieth century."}],"type":"journal_article","date_published":"2000-03-21T00:00:00Z","publist_id":"2802","status":"public","language":[{"iso":"eng"}],"title":"Triangulations and meshes in computational geometry","_id":"3583","article_processing_charge":"No","day":"21","month":"03","acknowledgement":"Research is partially supported by the Army Research Office under grant DAAG55-98-1-0177 and by the National Science Foundation under grants CCR-96-19542 and CCR-97-12088.","scopus_import":"1","publisher":"Cambridge University Press"},{"doi":"10.1017/S0016672399004346","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","pmid":1,"publication":"Genetical Research","issue":"3","abstract":[{"lang":"eng","text":"We present the theoretical background to a new method for measuring genetic variation for total fitness in Drosophila. The method allows heterozygous effects on total fitness of whole wild-type chromosomes to be measured under normal demography with overlapping generations. The wild-type chromosomes are competed against two balancer chromosomes (B1, B2, say), providing a standard genotype B1/B2 against which variation in the fitness effects of the wild-type chromosomes can be assessed. Fitness can be assessed in two ways: (i) at equilibrium of all three chromosomes under heterozygote advantage, and (ii) during displacement of one balancer by the other. Equilibrium with all three chromosomes present will be achieved only if the wild-type homozygote is not too fit, and if the fitnesses of the three heterozygotes are not too unequal. These conditions were not satisfied for any of a sample of 12 lethal-bearing chromosomes isolated from a random-bred laboratory population of Drosophila. At equilibrium, genotypic frequencies show low sensitivity to changes in genotypic fitness. Furthermore, where all four genotypes are viable and fertile, supplementary information from cages with only two chromosomes present and from direct measurements of pre-adult viability are required to estimate fitnesses from frequencies. The invasion method has the advantages of a greater sensitivity and of not requiring further data to estimate fitnesses if the wild-type homozygote is fertile. However, it requires that multiple samples be taken as the invasion progresses. In a discrete generation model, generation time influences fitness estimates from this method and is difficult to estimate accurately from the data. A full age-structured model can also be applied to the data from both types of experiment. For the invasion method, this gives fitness estimates close to those from the discrete generation model."}],"type":"journal_article","title":"Measuring fitness by means of balancer chromosomes","oa_version":"None","page":"297 - 314","citation":{"short":"N.H. Barton, L. Patridge, Genetical Research 75 (2000) 297–314.","chicago":"Barton, Nicholas H, and Linda Patridge. “Measuring Fitness by Means of Balancer Chromosomes.” <i>Genetical Research</i>. Cambridge University Press, 2000. <a href=\"https://doi.org/10.1017/S0016672399004346\">https://doi.org/10.1017/S0016672399004346</a>.","mla":"Barton, Nicholas H., and Linda Patridge. “Measuring Fitness by Means of Balancer Chromosomes.” <i>Genetical Research</i>, vol. 75, no. 3, Cambridge University Press, 2000, pp. 297–314, doi:<a href=\"https://doi.org/10.1017/S0016672399004346\">10.1017/S0016672399004346</a>.","apa":"Barton, N. H., &#38; Patridge, L. (2000). Measuring fitness by means of balancer chromosomes. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672399004346\">https://doi.org/10.1017/S0016672399004346</a>","ieee":"N. H. Barton and L. Patridge, “Measuring fitness by means of balancer chromosomes,” <i>Genetical Research</i>, vol. 75, no. 3. Cambridge University Press, pp. 297–314, 2000.","ama":"Barton NH, Patridge L. Measuring fitness by means of balancer chromosomes. <i>Genetical Research</i>. 2000;75(3):297-314. doi:<a href=\"https://doi.org/10.1017/S0016672399004346\">10.1017/S0016672399004346</a>","ista":"Barton NH, Patridge L. 2000. Measuring fitness by means of balancer chromosomes. Genetical Research. 75(3), 297–314."},"publisher":"Cambridge University Press","article_processing_charge":"No","month":"06","intvolume":"        75","article_type":"original","extern":"1","volume":75,"publication_identifier":{"issn":["0016-6723"]},"date_published":"2000-06-01T00:00:00Z","publist_id":"2760","external_id":{"pmid":["10893866"]},"status":"public","language":[{"iso":"eng"}],"year":"2000","publication_status":"published","author":[{"first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Patridge, Linda","first_name":"Linda","last_name":"Patridge"}],"date_created":"2018-12-11T12:04:18Z","date_updated":"2023-05-02T12:09:23Z","acknowledgement":"This work was supported by grant GR31/G09821 from the BBSRC, and by fellowships from the Darwin Trust of Edinburgh and the NERC. We are grateful to the referees for their helpful comments on the manuscript.","scopus_import":"1","_id":"3623","day":"01"},{"date_published":"2000-03-01T00:00:00Z","publist_id":"2759","external_id":{"pmid":["10762407"]},"status":"public","language":[{"iso":"eng"}],"year":"2000","publication_status":"published","date_created":"2018-12-11T12:04:18Z","author":[{"first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-05-02T12:04:03Z","acknowledgement":"This work was supported by grant MMI09726 from the BBSRC/EPSRC, and by the Darwin Trust of Edinburgh. I am grateful to W. G. Hill, L. Kruuk and M. Orive, and to the referees, for their helpful comments on the manuscript.","scopus_import":"1","_id":"3624","day":"01","intvolume":"        84","article_type":"original","extern":"1","volume":84,"publication_identifier":{"issn":["0018-067X"]},"type":"journal_article","abstract":[{"lang":"eng","text":"The state of a diploid population segregating for two alleles at each of n loci is described by 22(n) genotype frequencies, or equivalently, by allele frequencies and by multilocus moments or cumulants of various orders. These measures of linkage disequilibrium cannot usually be determined, both because one cannot tell whether a gene came from the maternal or paternal gamete, and because such a large number of parameters cannot be estimated even from large samples. Simplifying assumptions must therefore be made. This paper sets out methods for estimating multilocus genotype frequencies which are appropriate for unlinked neutral loci, and for populations that are ultimately derived by mixing of two source populations. In such a hybrid population, all multilocus associations depend primarily on the number of loci involved that derive from the maternal genome, and the number derived from the paternal genome Allele frequencies may differ across loci, and the contribution of each locus to multilocus associations may be scaled by the difference in allele frequency between source populations for that locus (δp ≤ 1). For example, the cumulant describing the association between genes i, j, k from the maternal genome, and genes i, l from the paternal genome is K(tJ,k,iλ*), = δp(i)/2 δp(J) δp(k) δp(l) κ3,2. The state of the population is described by n allele frequencies; n divergences, δp; and by a symmetric matrix of cumulants, κ(J,K) (J = 0 ,..., n, K = 0 ,..., n). Expressions for these cumulants under short- and long-range migration are given. Two methods for estimating the cumulants are described: a simple method based on multivariate moments, and a maximum likelihood procedure, which uses the Metropolis algorithm. Both methods perform well when tested against simulations with two or four loci."}],"title":"Estimating multilocus linkage disequilibria","oa_version":"None","page":"373 - 389","citation":{"ista":"Barton NH. 2000. Estimating multilocus linkage disequilibria. Heredity. 84(3), 373–389.","ama":"Barton NH. Estimating multilocus linkage disequilibria. <i>Heredity</i>. 2000;84(3):373-389. doi:<a href=\"https://doi.org/10.1046/j.1365-2540.2000.00683.x\">10.1046/j.1365-2540.2000.00683.x</a>","ieee":"N. H. Barton, “Estimating multilocus linkage disequilibria,” <i>Heredity</i>, vol. 84, no. 3. Nature Publishing Group, pp. 373–389, 2000.","mla":"Barton, Nicholas H. “Estimating Multilocus Linkage Disequilibria.” <i>Heredity</i>, vol. 84, no. 3, Nature Publishing Group, 2000, pp. 373–89, doi:<a href=\"https://doi.org/10.1046/j.1365-2540.2000.00683.x\">10.1046/j.1365-2540.2000.00683.x</a>.","apa":"Barton, N. H. (2000). Estimating multilocus linkage disequilibria. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1046/j.1365-2540.2000.00683.x\">https://doi.org/10.1046/j.1365-2540.2000.00683.x</a>","chicago":"Barton, Nicholas H. “Estimating Multilocus Linkage Disequilibria.” <i>Heredity</i>. Nature Publishing Group, 2000. <a href=\"https://doi.org/10.1046/j.1365-2540.2000.00683.x\">https://doi.org/10.1046/j.1365-2540.2000.00683.x</a>.","short":"N.H. Barton, Heredity 84 (2000) 373–389."},"publisher":"Nature Publishing Group","main_file_link":[{"url":"https://www.nature.com/articles/6886830"}],"article_processing_charge":"No","month":"03","doi":"10.1046/j.1365-2540.2000.00683.x","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","pmid":1,"publication":"Heredity","issue":"3"}]