[{"date_published":"2006-07-31T00:00:00Z","author":[{"full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Rhada","last_name":"Jagadeesan","full_name":"Jagadeesan, Rhada"},{"first_name":"Corin","full_name":"Pitcher, Corin","last_name":"Pitcher"}],"publication_status":"published","status":"public","date_updated":"2021-01-12T07:43:32Z","_id":"3449","abstract":[{"text":"We argue that games are expressive enough to encompass (history-based) access control, (resource) usage control (e.g., dynamic adaptive access control of reputation systems), accountability based controls (e.g., insurance), controls derived from rationality assumptions on participants (e.g., network mechanisms), and their composition. Building on the extensive research into games, we demonstrate that this expressive power coexists with a formal analysis framework comparable to that available for access control.","lang":"eng"}],"conference":{"name":"CSF: Computer Security Foundations"},"publisher":"IEEE","extern":1,"type":"conference","month":"07","day":"31","page":"70 - 82","year":"2006","date_created":"2018-12-11T12:03:23Z","doi":"10.1109/CSFW.2006.14","quality_controlled":0,"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Games for Controls</i>. IEEE, 2006, pp. 70–82, doi:<a href=\"https://doi.org/10.1109/CSFW.2006.14\">10.1109/CSFW.2006.14</a>.","ieee":"K. Chatterjee, R. Jagadeesan, and C. Pitcher, “Games for controls,” presented at the CSF: Computer Security Foundations, 2006, pp. 70–82.","short":"K. Chatterjee, R. Jagadeesan, C. Pitcher, in:, IEEE, 2006, pp. 70–82.","ama":"Chatterjee K, Jagadeesan R, Pitcher C. Games for controls. In: IEEE; 2006:70-82. doi:<a href=\"https://doi.org/10.1109/CSFW.2006.14\">10.1109/CSFW.2006.14</a>","ista":"Chatterjee K, Jagadeesan R, Pitcher C. 2006. Games for controls. CSF: Computer Security Foundations, 70–82.","apa":"Chatterjee, K., Jagadeesan, R., &#38; Pitcher, C. (2006). Games for controls (pp. 70–82). Presented at the CSF: Computer Security Foundations, IEEE. <a href=\"https://doi.org/10.1109/CSFW.2006.14\">https://doi.org/10.1109/CSFW.2006.14</a>","chicago":"Chatterjee, Krishnendu, Rhada Jagadeesan, and Corin Pitcher. “Games for Controls,” 70–82. IEEE, 2006. <a href=\"https://doi.org/10.1109/CSFW.2006.14\">https://doi.org/10.1109/CSFW.2006.14</a>."},"publist_id":"2938","title":"Games for controls"},{"year":"2006","doi":"10.1007/s00424-006-0093-2","date_created":"2018-12-11T12:03:28Z","quality_controlled":0,"citation":{"ieee":"J. Bischofberger, D. Engel, M. Frotscher, and P. M. Jonas, “Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review),” <i>Pflugers Archiv : European Journal of Physiology</i>, vol. 453, no. 3. Springer, pp. 361–372, 2006.","short":"J. Bischofberger, D. Engel, M. Frotscher, P.M. Jonas, Pflugers Archiv : European Journal of Physiology 453 (2006) 361–372.","mla":"Bischofberger, Joseph, et al. “Timing and Efficacy of Transmitter Release at Mossy Fiber Synapses in the Hippocampal Network. (Review).” <i>Pflugers Archiv : European Journal of Physiology</i>, vol. 453, no. 3, Springer, 2006, pp. 361–72, doi:<a href=\"https://doi.org/10.1007/s00424-006-0093-2\">10.1007/s00424-006-0093-2</a>.","apa":"Bischofberger, J., Engel, D., Frotscher, M., &#38; Jonas, P. M. (2006). Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review). <i>Pflugers Archiv : European Journal of Physiology</i>. Springer. <a href=\"https://doi.org/10.1007/s00424-006-0093-2\">https://doi.org/10.1007/s00424-006-0093-2</a>","chicago":"Bischofberger, Joseph, Dominique Engel, Michael Frotscher, and Peter M Jonas. “Timing and Efficacy of Transmitter Release at Mossy Fiber Synapses in the Hippocampal Network. (Review).” <i>Pflugers Archiv : European Journal of Physiology</i>. Springer, 2006. <a href=\"https://doi.org/10.1007/s00424-006-0093-2\">https://doi.org/10.1007/s00424-006-0093-2</a>.","ama":"Bischofberger J, Engel D, Frotscher M, Jonas PM. Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review). <i>Pflugers Archiv : European Journal of Physiology</i>. 2006;453(3):361-372. doi:<a href=\"https://doi.org/10.1007/s00424-006-0093-2\">10.1007/s00424-006-0093-2</a>","ista":"Bischofberger J, Engel D, Frotscher M, Jonas PM. 2006. Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review). Pflugers Archiv : European Journal of Physiology. 453(3), 361–372."},"publist_id":"2924","title":"Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review)","date_published":"2006-12-01T00:00:00Z","author":[{"last_name":"Bischofberger","full_name":"Bischofberger, Joseph","first_name":"Joseph"},{"first_name":"Dominique","last_name":"Engel","full_name":"Engel, Dominique"},{"full_name":"Frotscher, Michael","last_name":"Frotscher","first_name":"Michael"},{"last_name":"Jonas","full_name":"Peter Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","orcid":"0000-0001-5001-4804"}],"publication_status":"published","date_updated":"2019-04-26T07:22:28Z","status":"public","_id":"3463","intvolume":"       453","abstract":[{"lang":"eng","text":"It is widely accepted that the hippocampus plays a major role in learning and memory. The mossy fiber synapse between granule cells in the dentate gyrus and pyramidal neurons in the CA3 region is a key component of the hippocampal trisynaptic circuit. Recent work, partially based on direct presynaptic patch-clamp recordings from hippocampal mossy fiber boutons, sheds light on the mechanisms of synaptic transmission and plasticity at mossy fiber synapses. A high Na(+) channel density in mossy fiber boutons leads to a large amplitude of the presynaptic action potential. Together with the fast gating of presynaptic Ca(2+) channels, this generates a large and brief presynaptic Ca(2+) influx, which can trigger transmitter release with high efficiency and temporal precision. The large number of release sites, the large size of the releasable pool of vesicles, and the huge extent of presynaptic plasticity confer unique strength to this synapse, suggesting a large impact onto the CA3 pyramidal cell network under specific behavioral conditions. The characteristic properties of the hippocampal mossy fiber synapse may be important for pattern separation and information storage in the dentate gyrus-CA3 cell network."}],"publisher":"Springer","issue":"3","publication":"Pflugers Archiv : European Journal of Physiology","extern":1,"type":"review","month":"12","day":"01","page":"361 - 372","volume":453},{"acknowledgement":"This research was supported in part by the NSF grants CCR-0225610 and CCR- 0234690, and by the SNSF under the Indo-Swiss Joint Research Programme.","citation":{"short":"K. Chatterjee, in:, Springer, 2006, pp. 271–286.","mla":"Chatterjee, Krishnendu. <i>Nash Equilibrium for Upward-Closed Objectives</i>. Vol. 4207, Springer, 2006, pp. 271–86, doi:<a href=\"https://doi.org/10.1007/11874683_18\">10.1007/11874683_18</a>.","ieee":"K. Chatterjee, “Nash equilibrium for upward-closed objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 271–286.","ama":"Chatterjee K. Nash equilibrium for upward-closed objectives. In: Vol 4207. Springer; 2006:271-286. doi:<a href=\"https://doi.org/10.1007/11874683_18\">10.1007/11874683_18</a>","ista":"Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 271–286.","apa":"Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives (Vol. 4207, pp. 271–286). Presented at the CSL: Computer Science Logic, Springer. <a href=\"https://doi.org/10.1007/11874683_18\">https://doi.org/10.1007/11874683_18</a>","chicago":"Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives,” 4207:271–86. Springer, 2006. <a href=\"https://doi.org/10.1007/11874683_18\">https://doi.org/10.1007/11874683_18</a>."},"quality_controlled":0,"year":"2006","date_created":"2018-12-11T12:03:39Z","doi":"10.1007/11874683_18","title":"Nash equilibrium for upward-closed objectives","publist_id":"2888","status":"public","date_updated":"2021-01-12T07:43:52Z","abstract":[{"lang":"eng","text":"We study infinite stochastic games played by n-players on a finite graph with goals specified by sets of infinite traces. The games are concurrent (each player simultaneously and independently chooses an action at each round), stochastic (the next state is determined by a probability distribution depending on the current state and the chosen actions), infinite (the game continues for an infinite number of rounds), nonzero-sum (the players’ goals are not necessarily conflicting), and undiscounted. We show that if each player has an upward-closed objective, then there exists an ε-Nash equilibrium in memoryless strategies, for every ε&gt;0; and exact Nash equilibria need not exist. Upward-closure of an objective means that if a set Z of infinitely repeating states is winning, then all supersets of Z of infinitely repeating states are also winning. Memoryless strategies are strategies that are independent of history of plays and depend only on the current state. We also study the complexity of finding values (payoff profile) of an ε-Nash equilibrium. We show that the values of an ε-Nash equilibrium in nonzero-sum concurrent games with upward-closed objectives for all players can be computed by computing ε-Nash equilibrium values of nonzero-sum concurrent games with reachability objectives for all players and a polynomial procedure. As a consequence we establish that values of an ε-Nash equilibrium can be computed in TFNP (total functional NP), and hence in EXPTIME. "}],"_id":"3499","intvolume":"      4207","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"}],"publication_status":"published","alternative_title":["LNCS "],"date_published":"2006-09-28T00:00:00Z","day":"28","page":"271 - 286","volume":4207,"type":"conference","month":"09","publisher":"Springer","conference":{"name":"CSL: Computer Science Logic"},"extern":1},{"title":"Algorithms for Büchi Games","publist_id":"2887","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and the NSF ITR grant CCR-0225610 and the SNSF under the Indo-Swiss Joint Research Programme.","citation":{"ista":"Chatterjee K, Henzinger TA, Piterman N. 2006. Algorithms for Büchi Games. GDV: Games in Design and Verification.","ama":"Chatterjee K, Henzinger TA, Piterman N. Algorithms for Büchi Games. In: ACM; 2006.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Algorithms for Büchi Games.” ACM, 2006.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2006). Algorithms for Büchi Games. Presented at the GDV: Games in Design and Verification, ACM.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Algorithms for Büchi Games,” presented at the GDV: Games in Design and Verification, 2006.","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, in:, ACM, 2006.","mla":"Chatterjee, Krishnendu, et al. <i>Algorithms for Büchi Games</i>. ACM, 2006."},"quality_controlled":0,"year":"2006","date_created":"2018-12-11T12:03:39Z","day":"21","type":"conference","month":"08","publisher":"ACM","conference":{"name":"GDV: Games in Design and Verification"},"extern":1,"main_file_link":[{"url":"http://www.cs.le.ac.uk/people/np183/publications/2006/CHP06.pdf","open_access":"0"}],"date_updated":"2021-01-12T07:43:53Z","status":"public","_id":"3500","abstract":[{"lang":"eng","text":"The classical algorithm for solving Bu ̈chi games requires time O(n · m) for game graphs with n states and m edges. For game graphs with constant outdegree, the best known algorithm has running time O(n2/logn). We present two new algorithms for Bu ̈chi games. First, we give an algorithm that performs at most O(m) more work than the classical algorithm, but runs in time O(n) on infinitely many graphs of constant outdegree on which the classical algorithm requires time O(n2). Second, we give an algorithm with running time O(n · m · log δ(n)/ log n), where 1 ≤ δ(n) ≤ n is the outdegree of the game graph. Note that this algorithm performs asymptotically better than the classical algorithm if δ(n) = O(log n)."}],"author":[{"last_name":"Chatterjee","full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Nir","full_name":"Piterman, Nir","last_name":"Piterman"}],"publication_status":"published","date_published":"2006-08-21T00:00:00Z"},{"author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Ping","last_name":"Fu","full_name":"Fu, Ping"},{"first_name":"Dmitry","full_name":"Nekhayev, Dmitry","last_name":"Nekhayev"},{"first_name":"Michael","last_name":"Facello","full_name":"Facello, Michael"},{"full_name":"Williams, Steven","last_name":"Williams","first_name":"Steven"}],"date_published":"2006-02-07T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://patents.google.com/patent/US6996505"}],"date_updated":"2022-01-05T12:58:26Z","status":"public","ipc":"G06F 7/60 ; G06F 17/10 ; G06F 101/00","abstract":[{"text":"Embodiments automatically generate an accurate network of watertight NURBS patches from polygonal models of objects while automatically detecting and preserving character lines thereon. These embodiments generate from an initial triangulation of the surface, a hierarchy of progressively coarser triangulations of the surface by performing a sequence of edge contractions using a greedy algorithm that selects edge contractions by their numerical properties. Operations are also performed to connect the triangulations in the hierarchy using homeomorphisms that preserve the topology of the initial triangulation in the coarsest triangulation. A desired quadrangulation of the surface can then be generated by homeomorphically mapping edges of a coarsest triangulation in the hierarchy back to the initial triangulation. This quadrangulation is topologically consistent with the initial triangulation and is defined by a plurality of quadrangular patches. These quadrangular patches are linked together by a (U, V) mesh that is guaranteed to be continuous at patch boundaries. A grid is then preferably fit to each of the quadrangles in the resulting quadrangulation by decomposing each of the quadrangles into k.sup.2 smaller quadrangles. A watertight NURBS model may be generated from the resulting quadrangulation.","lang":"eng"}],"_id":"3510","article_processing_charge":"No","extern":"1","publication_date":"2006-02-07","ipn":"US6996505B1","day":"07","applicant":["Raindrop Geomagic, Inc."],"oa_version":"Published Version","type":"patent","month":"02","year":"2006","date_created":"2018-12-11T12:03:42Z","citation":{"ieee":"H. Edelsbrunner, P. Fu, D. Nekhayev, M. Facello, and S. Williams, “Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism.” 2006.","short":"H. Edelsbrunner, P. Fu, D. Nekhayev, M. Facello, S. Williams, (2006).","mla":"Edelsbrunner, Herbert, et al. <i>Method, Apparatus and Computer Program Products for Automatically Generating NURBS Models of Triangulated Surfaces Using Homeomorphism</i>. 2006.","chicago":"Edelsbrunner, Herbert, Ping Fu, Dmitry Nekhayev, Michael Facello, and Steven Williams. “Method, Apparatus and Computer Program Products for Automatically Generating NURBS Models of Triangulated Surfaces Using Homeomorphism,” 2006.","apa":"Edelsbrunner, H., Fu, P., Nekhayev, D., Facello, M., &#38; Williams, S. (2006). Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism.","ista":"Edelsbrunner H, Fu P, Nekhayev D, Facello M, Williams S. 2006. Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism.","ama":"Edelsbrunner H, Fu P, Nekhayev D, Facello M, Williams S. Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism. 2006."},"oa":1,"publist_id":"2877","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism"},{"oa_version":"Published Version","applicant":["Phonak AG"],"day":"23","month":"05","type":"patent","article_processing_charge":"No","extern":"1","ipn":"US7050876B1","publication_date":"2006-05-23","main_file_link":[{"open_access":"1","url":"https://patents.google.com/patent/US7050876B1"}],"abstract":[{"text":"Methods, apparatus and computer program products provide efficient techniques for designing and printing shells of hearing-aid devices with a high degree of quality assurance and reliability and with a reduced number of manual and time consuming production steps and operations. These techniques also preferably provide hearing-aid shells having internal volumes that can approach a maximum allowable ratio of internal volume relative to external volume. These high internal volumes facilitate the inclusion of hearing-aid electrical components having higher degrees of functionality and/or the use of smaller and less conspicuous hearing-aid shells. A preferred method includes operations to generate a watertight digital model of a hearing-aid shell by thickening a three-dimensional digital model of a shell surface in a manner that eliminates self-intersections and results in a thickened model having an internal volume that is a high percentage of an external volume of the model. ","lang":"eng"}],"_id":"3511","date_updated":"2022-01-05T13:03:56Z","status":"public","ipc":"G06F 9/00","author":[{"first_name":"Ping","full_name":"Fu, Ping","last_name":"Fu"},{"first_name":"Dmitry","last_name":"Nekhayev","full_name":"Nekhayev, Dmitry"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"}],"date_published":"2006-05-23T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Manufacturing methods and systems for rapid production of hearing-aid shells","publist_id":"2876","citation":{"short":"P. Fu, D. Nekhayev, H. Edelsbrunner, (2006).","ieee":"P. Fu, D. Nekhayev, and H. Edelsbrunner, “Manufacturing methods and systems for rapid production of hearing-aid shells.” 2006.","mla":"Fu, Ping, et al. <i>Manufacturing Methods and Systems for Rapid Production of Hearing-Aid Shells</i>. 2006.","ama":"Fu P, Nekhayev D, Edelsbrunner H. Manufacturing methods and systems for rapid production of hearing-aid shells. 2006.","ista":"Fu P, Nekhayev D, Edelsbrunner H. 2006. Manufacturing methods and systems for rapid production of hearing-aid shells.","apa":"Fu, P., Nekhayev, D., &#38; Edelsbrunner, H. (2006). Manufacturing methods and systems for rapid production of hearing-aid shells.","chicago":"Fu, Ping, Dmitry Nekhayev, and Herbert Edelsbrunner. “Manufacturing Methods and Systems for Rapid Production of Hearing-Aid Shells,” 2006."},"acknowledgement":"sold to Siemens and Phonak","oa":1,"date_created":"2018-12-11T12:03:43Z","year":"2006"},{"main_file_link":[{"open_access":"1","url":"https://patents.google.com/patent/US7023432B2"}],"abstract":[{"text":"Methods, apparatus and computer program products provide efficient techniques for reconstructing surfaces from data point sets. These techniques include reconstructing surfaces from sets of scanned data points that have preferably undergone preprocessing operations to improve their quality by, for example, reducing noise and removing outliers. These techniques include reconstructing a dense and locally two-dimensionally distributed 3D point set (e.g., point cloud) by merging stars in two-dimensional weighted Delaunay triangulations within estimated tangent planes. The techniques include determining a plurality of stars from a plurality of points p.sub.i in a 3D point set S that at least partially describes the 3D surface, by projecting the plurality of points p.sub.i onto planes T.sub.i that are each estimated to be tangent about a respective one of the plurality of points p.sub.i. The plurality of stars are then merged into a digital model of the 3D surface.","lang":"eng"}],"_id":"3512","ipc":" G06T17/20 ; B33Y50/00","status":"public","date_updated":"2022-01-05T14:00:00Z","author":[{"first_name":"Yates","last_name":"Fletcher","full_name":"Fletcher, Yates"},{"last_name":"Gloth","full_name":"Gloth, Tobias","first_name":"Tobias"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Ping","full_name":"Fu, Ping","last_name":"Fu"}],"date_published":"2006-04-04T00:00:00Z","oa_version":"Published Version","applicant":["Geomagic Inc."],"day":"04","month":"04","type":"patent","article_processing_charge":"No","publication_date":"2006-04-04","ipn":"US7023432B2","extern":"1","citation":{"ista":"Fletcher Y, Gloth T, Edelsbrunner H, Fu P. 2006. Method, apparatus and computer products that reconstruct surfaces from data points.","ama":"Fletcher Y, Gloth T, Edelsbrunner H, Fu P. Method, apparatus and computer products that reconstruct surfaces from data points. 2006.","chicago":"Fletcher, Yates, Tobias Gloth, Herbert Edelsbrunner, and Ping Fu. “Method, Apparatus and Computer Products That Reconstruct Surfaces from Data Points,” 2006.","apa":"Fletcher, Y., Gloth, T., Edelsbrunner, H., &#38; Fu, P. (2006). Method, apparatus and computer products that reconstruct surfaces from data points.","ieee":"Y. Fletcher, T. Gloth, H. Edelsbrunner, and P. Fu, “Method, apparatus and computer products that reconstruct surfaces from data points.” 2006.","short":"Y. Fletcher, T. Gloth, H. Edelsbrunner, P. Fu, (2006).","mla":"Fletcher, Yates, et al. <i>Method, Apparatus and Computer Products That Reconstruct Surfaces from Data Points</i>. 2006."},"oa":1,"date_created":"2018-12-11T12:03:43Z","year":"2006","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Method, apparatus and computer products that reconstruct surfaces from data points","publist_id":"2875"},{"type":"journal_article","month":"01","page":"143 - 155","day":"05","volume":49,"publisher":"Elsevier","publication":"Neuron","issue":"1","extern":1,"date_updated":"2021-01-12T07:44:03Z","status":"public","_id":"3522","intvolume":"        49","abstract":[{"text":"We observed sharp wave/ripples (SWR) during exploration within brief (&lt; 2.4 s) interruptions of or during theta oscillations. CA1 network responses of SWRs occurring during exploration (eSWR) and SWRs detected in waking immobility or sleep were similar. However, neuronal activity during eSWR was location dependent, and eSWR-related firing was stronger inside the place field than outside. The eSPW-related firing increase was stronger than the baseline increase inside compared to outside, suggesting a “supralinear” summation of eSWR and place-selective inputs. Pairs of cells with similar place fields and/or correlated firing during exploration showed stronger coactivation during eSWRs and subsequent sleep-SWRs. Sequential activation of place cells was not required for the reactivation of waking co-firing patterns; cell pairs with symmetrical cross-correlations still showed reactivated waking co-firing patterns during sleep-SWRs. We suggest that place-selective firing during eSWRs facilitates initial associations between cells with similar place fields that enable place-related ensemble patterns to recur during subsequent sleep-SWRs.","lang":"eng"}],"date_published":"2006-01-05T00:00:00Z","author":[{"id":"426376DC-F248-11E8-B48F-1D18A9856A87","full_name":"Joseph O'Neill","last_name":"O'Neill","first_name":"Joseph"},{"last_name":"Senior","full_name":"Senior,Timothy","first_name":"Timothy"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","full_name":"Jozsef Csicsvari","last_name":"Csicsvari","first_name":"Jozsef L","orcid":"0000-0002-5193-4036"}],"publication_status":"published","title":"Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior","publist_id":"2863","citation":{"ama":"O’Neill J, Senior T, Csicsvari JL. Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior. <i>Neuron</i>. 2006;49(1):143-155. doi:<a href=\"https://doi.org/10.1016/j.neuron.2005.10.037\">10.1016/j.neuron.2005.10.037</a>","ista":"O’Neill J, Senior T, Csicsvari JL. 2006. Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior. Neuron. 49(1), 143–155.","apa":"O’Neill, J., Senior, T., &#38; Csicsvari, J. L. (2006). Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2005.10.037\">https://doi.org/10.1016/j.neuron.2005.10.037</a>","chicago":"O’Neill, Joseph, Timothy Senior, and Jozsef L Csicsvari. “Place-Selective Firing of CA1 Pyramidal Cells during Sharp Wave/Ripple Network Patterns in Exploratory Behavior.” <i>Neuron</i>. Elsevier, 2006. <a href=\"https://doi.org/10.1016/j.neuron.2005.10.037\">https://doi.org/10.1016/j.neuron.2005.10.037</a>.","mla":"O’Neill, Joseph, et al. “Place-Selective Firing of CA1 Pyramidal Cells during Sharp Wave/Ripple Network Patterns in Exploratory Behavior.” <i>Neuron</i>, vol. 49, no. 1, Elsevier, 2006, pp. 143–55, doi:<a href=\"https://doi.org/10.1016/j.neuron.2005.10.037\">10.1016/j.neuron.2005.10.037</a>.","short":"J. O’Neill, T. Senior, J.L. Csicsvari, Neuron 49 (2006) 143–155.","ieee":"J. O’Neill, T. Senior, and J. L. Csicsvari, “Place-selective firing of CA1 pyramidal cells during sharp wave/ripple network patterns in exploratory behavior,” <i>Neuron</i>, vol. 49, no. 1. Elsevier, pp. 143–155, 2006."},"year":"2006","date_created":"2018-12-11T12:03:46Z","doi":"10.1016/j.neuron.2005.10.037","quality_controlled":0},{"publist_id":"2840","title":"Changes in functional connectivity within the rat striatopallidal axis during global brain activation in vivo","year":"2006","doi":"10.1523/​JNEUROSCI.0620-06.2006","date_created":"2018-12-11T12:03:53Z","quality_controlled":0,"citation":{"mla":"Magill, Peter, et al. “Changes in Functional Connectivity within the Rat Striatopallidal Axis during Global Brain Activation in Vivo.” <i>Journal of Neuroscience</i>, vol. 26, no. 23, Society for Neuroscience, 2006, pp. 6318–29, doi:<a href=\"https://doi.org/10.1523/​JNEUROSCI.0620-06.2006\">10.1523/​JNEUROSCI.0620-06.2006</a>.","ieee":"P. Magill, A. Pogosyan, A. Sharott, J. L. Csicsvari, J. Bolam, and P. Brown, “Changes in functional connectivity within the rat striatopallidal axis during global brain activation in vivo,” <i>Journal of Neuroscience</i>, vol. 26, no. 23. Society for Neuroscience, pp. 6318–6329, 2006.","short":"P. Magill, A. Pogosyan, A. Sharott, J.L. Csicsvari, J. Bolam, P. Brown, Journal of Neuroscience 26 (2006) 6318–6329.","apa":"Magill, P., Pogosyan, A., Sharott, A., Csicsvari, J. L., Bolam, J., &#38; Brown, P. (2006). Changes in functional connectivity within the rat striatopallidal axis during global brain activation in vivo. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/​JNEUROSCI.0620-06.2006\">https://doi.org/10.1523/​JNEUROSCI.0620-06.2006</a>","chicago":"Magill, Peter, Alek Pogosyan, Andrew Sharott, Jozsef L Csicsvari, John Bolam, and Peter Brown. “Changes in Functional Connectivity within the Rat Striatopallidal Axis during Global Brain Activation in Vivo.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2006. <a href=\"https://doi.org/10.1523/​JNEUROSCI.0620-06.2006\">https://doi.org/10.1523/​JNEUROSCI.0620-06.2006</a>.","ama":"Magill P, Pogosyan A, Sharott A, Csicsvari JL, Bolam J, Brown P. Changes in functional connectivity within the rat striatopallidal axis during global brain activation in vivo. <i>Journal of Neuroscience</i>. 2006;26(23):6318-6329. doi:<a href=\"https://doi.org/10.1523/​JNEUROSCI.0620-06.2006\">10.1523/​JNEUROSCI.0620-06.2006</a>","ista":"Magill P, Pogosyan A, Sharott A, Csicsvari JL, Bolam J, Brown P. 2006. Changes in functional connectivity within the rat striatopallidal axis during global brain activation in vivo. Journal of Neuroscience. 26(23), 6318–6329."},"publisher":"Society for Neuroscience","publication":"Journal of Neuroscience","issue":"23","extern":1,"type":"journal_article","month":"06","page":"6318 - 6329","day":"07","volume":26,"date_published":"2006-06-07T00:00:00Z","author":[{"first_name":"Peter","full_name":"Magill,Peter J","last_name":"Magill"},{"first_name":"Alek","full_name":"Pogosyan,Alek","last_name":"Pogosyan"},{"first_name":"Andrew","last_name":"Sharott","full_name":"Sharott,Andrew"},{"first_name":"Jozsef L","orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","full_name":"Jozsef Csicsvari"},{"full_name":"Bolam, John Paul","last_name":"Bolam","first_name":"John"},{"first_name":"Peter","last_name":"Brown","full_name":"Brown,Peter"}],"publication_status":"published","status":"public","date_updated":"2021-01-12T07:44:13Z","abstract":[{"text":"The functional organization of the basal ganglia ( BG) is often defined according to one of two opposing schemes. The first proposes multiple, essentially independent channels of information processing. The second posits convergence and lateral integration of striatal channels at the level of the globus pallidus ( GP). We tested the hypothesis that these proposed aspects of functional connectivity within the striatopallidal axis are dynamic and related to brain state. Local field potentials ( LFPs) were simultaneously recorded from multiple sites in striatum and GP in anesthetized rats during slow-wave activity( SWA) and during global activation evoked by sensory stimulation. Functional connectivity was inferred from comparative analyses of the internuclear and intranuclear coherence between bipolar derivations of LFPs. During prominent SWA, as shown in the electrocorticogram and local field potentials in the basal ganglia, intranuclear coherence, and, thus, lateral functional connectivity within striatum or globus pallidus was relatively weak. Furthermore, the temporal coupling of LFPs recorded across these two nuclei involved functional convergence at the level of GP. Global activation, indicated by a loss of SWA, was accompanied by a rapid functional reorganization of the striatopallidal axis. Prominent lateral functional connectivity developed within GP and, to a significantly more constrained spatial extent, striatum. Additionally, functional convergence on GP was no longer apparent, despite increased internuclear coherence. These data demonstrate that functional connectivity within the BG is highly dynamic and suggest that the relative expression of organizational principles, such as parallel, independent processing channels, striatopallidal convergence, and lateral integration within BG nuclei, is dependent on brain state.","lang":"eng"}],"_id":"3545","intvolume":"        26"},{"acknowledgement":"Partially supported by NSF under grant CCR- 00-86013, by DARPA under grant HR0011-05-1-0007, and by the Lawrence Livermore National Laboratory under grant B543154.","citation":{"ieee":"D. Cohen Steiner, H. Edelsbrunner, and D. Morozov, “Vines and vineyards by updating persistence in linear time,” presented at the SCG: Symposium on Computational Geometry, 2006, pp. 119–126.","short":"D. Cohen Steiner, H. Edelsbrunner, D. Morozov, in:, ACM, 2006, pp. 119–126.","mla":"Cohen Steiner, David, et al. <i>Vines and Vineyards by Updating Persistence in Linear Time</i>. ACM, 2006, pp. 119–26, doi:<a href=\"https://doi.org/10.1145/1137856.1137877\">10.1145/1137856.1137877</a>.","apa":"Cohen Steiner, D., Edelsbrunner, H., &#38; Morozov, D. (2006). Vines and vineyards by updating persistence in linear time (pp. 119–126). Presented at the SCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/1137856.1137877\">https://doi.org/10.1145/1137856.1137877</a>","chicago":"Cohen Steiner, David, Herbert Edelsbrunner, and Dmitriy Morozov. “Vines and Vineyards by Updating Persistence in Linear Time,” 119–26. ACM, 2006. <a href=\"https://doi.org/10.1145/1137856.1137877\">https://doi.org/10.1145/1137856.1137877</a>.","ama":"Cohen Steiner D, Edelsbrunner H, Morozov D. Vines and vineyards by updating persistence in linear time. In: ACM; 2006:119-126. doi:<a href=\"https://doi.org/10.1145/1137856.1137877\">10.1145/1137856.1137877</a>","ista":"Cohen Steiner D, Edelsbrunner H, Morozov D. 2006. Vines and vineyards by updating persistence in linear time. SCG: Symposium on Computational Geometry, 119–126."},"year":"2006","date_created":"2018-12-11T12:03:58Z","doi":"10.1145/1137856.1137877","quality_controlled":0,"title":"Vines and vineyards by updating persistence in linear time","publist_id":"2826","date_updated":"2021-01-12T07:44:18Z","status":"public","abstract":[{"lang":"eng","text":"Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its per- tinent information is encapsulated by a pairing of the critical values of a function, visualized by points forming a diagram in the plane. The original algorithm in [10] computes the pairs from an ordering of the simplices in a triangulation and takes worst-case time cubic in the number of simplices. The main result of this paper is an algorithm that maintains the pairing in worst-case linear time per transposition in the ordering. A side-effect of the algorithm’s anal- ysis is an elementary proof of the stability of persistence diagrams [7] in the special case of piecewise-linear functions. We use the algorithm to compute 1-parameter families of diagrams which we apply to the study of protein folding trajectories."}],"_id":"3559","date_published":"2006-06-01T00:00:00Z","author":[{"last_name":"Cohen Steiner","full_name":"Cohen-Steiner, David","first_name":"David"},{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dmitriy","full_name":"Morozov, Dmitriy","last_name":"Morozov"}],"publication_status":"published","type":"conference","month":"06","day":"01","page":"119 - 126","publisher":"ACM","conference":{"name":"SCG: Symposium on Computational Geometry"},"extern":1},{"citation":{"ieee":"H. Edelsbrunner, D. Morozov, and V. Pascucci, “Persistence-sensitive simplification of functions on 2-manifolds,” presented at the SCG: Symposium on Computational Geometry, 2006, pp. 127–134.","mla":"Edelsbrunner, Herbert, et al. <i>Persistence-Sensitive Simplification of Functions on 2-Manifolds</i>. ACM, 2006, pp. 127–34, doi:<a href=\"https://doi.org/10.1145/1137856.1137878\">10.1145/1137856.1137878</a>.","short":"H. Edelsbrunner, D. Morozov, V. Pascucci, in:, ACM, 2006, pp. 127–134.","apa":"Edelsbrunner, H., Morozov, D., &#38; Pascucci, V. (2006). Persistence-sensitive simplification of functions on 2-manifolds (pp. 127–134). Presented at the SCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/1137856.1137878\">https://doi.org/10.1145/1137856.1137878</a>","chicago":"Edelsbrunner, Herbert, Dmitriy Morozov, and Valerio Pascucci. “Persistence-Sensitive Simplification of Functions on 2-Manifolds,” 127–34. ACM, 2006. <a href=\"https://doi.org/10.1145/1137856.1137878\">https://doi.org/10.1145/1137856.1137878</a>.","ama":"Edelsbrunner H, Morozov D, Pascucci V. Persistence-sensitive simplification of functions on 2-manifolds. In: ACM; 2006:127-134. doi:<a href=\"https://doi.org/10.1145/1137856.1137878\">10.1145/1137856.1137878</a>","ista":"Edelsbrunner H, Morozov D, Pascucci V. 2006. Persistence-sensitive simplification of functions on 2-manifolds. SCG: Symposium on Computational Geometry, 127–134."},"acknowledgement":"Partially supported by NSF under grant CCR-00-86013, by DARPA under grant HR0011-05-1-0007, and by the Lawrence Livermore National Laboratory under grant B543154.","doi":"10.1145/1137856.1137878","date_created":"2018-12-11T12:03:58Z","year":"2006","quality_controlled":0,"title":"Persistence-sensitive simplification of functions on 2-manifolds","publist_id":"2825","abstract":[{"text":"We continue the study of topological persistence [5] by investigat- ing the problem of simplifying a function f in a way that removes topological noise as determined by its persistence diagram [2]. To state our results, we call a function g an ε-simplification of another function f if ∥f − g∥∞ ≤ ε, and the persistence diagrams of g are the same as those of f except all points within L1-distance at most ε from the diagonal have been removed. We prove that for func- tions f on a 2-manifold such ε-simplification exists, and we give an algorithm to construct them in the piecewise linear case.","lang":"eng"}],"_id":"3560","date_updated":"2021-01-12T07:44:19Z","status":"public","main_file_link":[{"open_access":"0","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.4465"}],"date_published":"2006-06-01T00:00:00Z","publication_status":"published","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dmitriy","full_name":"Morozov, Dmitriy","last_name":"Morozov"},{"full_name":"Pascucci, Valerio","last_name":"Pascucci","first_name":"Valerio"}],"month":"06","type":"conference","day":"01","page":"127 - 134","extern":1,"publisher":"ACM","conference":{"name":"SCG: Symposium on Computational Geometry"}},{"publisher":"BDS ","publication":"Deer","extern":1,"issue":"9","type":"review","month":"01","page":"22 - 26","day":"01","volume":13,"date_published":"2006-01-01T00:00:00Z","author":[{"first_name":"Josephine","full_name":"Pemberton, Josephine M","last_name":"Pemberton"},{"last_name":"Swanson","full_name":"Swanson, Graeme M","first_name":"Graeme"},{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Nicholas Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Suzanne","last_name":"Livingstone","full_name":"Livingstone, Suzanne R"},{"first_name":"Helen","last_name":"Senn","full_name":"Senn, Helen V"}],"publication_status":"published","date_updated":"2019-04-26T07:22:31Z","status":"public","_id":"3594","intvolume":"        13","publist_id":"2789","title":"Hybridisation between red and sika deer in Scotland","year":"2006","date_created":"2018-12-11T12:04:08Z","quality_controlled":0,"citation":{"mla":"Pemberton, Josephine, et al. “Hybridisation between Red and Sika Deer in Scotland.” <i>Deer</i>, vol. 13, no. 9, BDS , 2006, pp. 22–26.","short":"J. Pemberton, G. Swanson, N.H. Barton, S. Livingstone, H. Senn, Deer 13 (2006) 22–26.","ieee":"J. Pemberton, G. Swanson, N. H. Barton, S. Livingstone, and H. Senn, “Hybridisation between red and sika deer in Scotland,” <i>Deer</i>, vol. 13, no. 9. BDS , pp. 22–26, 2006.","apa":"Pemberton, J., Swanson, G., Barton, N. H., Livingstone, S., &#38; Senn, H. (2006). Hybridisation between red and sika deer in Scotland. <i>Deer</i>. BDS .","chicago":"Pemberton, Josephine, Graeme Swanson, Nicholas H Barton, Suzanne Livingstone, and Helen Senn. “Hybridisation between Red and Sika Deer in Scotland.” <i>Deer</i>. BDS , 2006.","ama":"Pemberton J, Swanson G, Barton NH, Livingstone S, Senn H. Hybridisation between red and sika deer in Scotland. <i>Deer</i>. 2006;13(9):22-26.","ista":"Pemberton J, Swanson G, Barton NH, Livingstone S, Senn H. 2006. Hybridisation between red and sika deer in Scotland. Deer. 13(9), 22–26."}},{"publist_id":"2776","title":"Will population bottlenecks and multilocus epistasis increase additive genetic variance?","year":"2006","date_created":"2018-12-11T12:04:13Z","doi":"10.1111/j.0014-3820.2006.tb00521.x","quality_controlled":0,"citation":{"short":"M. Turelli, N.H. Barton, Evolution; International Journal of Organic Evolution 60 (2006) 1763–1776.","ieee":"M. Turelli and N. H. Barton, “Will population bottlenecks and multilocus epistasis increase additive genetic variance?,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 60, no. 9. Wiley-Blackwell, pp. 1763–1776, 2006.","mla":"Turelli, Michael, and Nicholas H. Barton. “Will Population Bottlenecks and Multilocus Epistasis Increase Additive Genetic Variance?” <i>Evolution; International Journal of Organic Evolution</i>, vol. 60, no. 9, Wiley-Blackwell, 2006, pp. 1763–76, doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb00521.x\">10.1111/j.0014-3820.2006.tb00521.x</a>.","ama":"Turelli M, Barton NH. Will population bottlenecks and multilocus epistasis increase additive genetic variance? <i>Evolution; International Journal of Organic Evolution</i>. 2006;60(9):1763-1776. doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb00521.x\">10.1111/j.0014-3820.2006.tb00521.x</a>","ista":"Turelli M, Barton NH. 2006. Will population bottlenecks and multilocus epistasis increase additive genetic variance? Evolution; International Journal of Organic Evolution. 60(9), 1763–1776.","apa":"Turelli, M., &#38; Barton, N. H. (2006). Will population bottlenecks and multilocus epistasis increase additive genetic variance? <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb00521.x\">https://doi.org/10.1111/j.0014-3820.2006.tb00521.x</a>","chicago":"Turelli, Michael, and Nicholas H Barton. “Will Population Bottlenecks and Multilocus Epistasis Increase Additive Genetic Variance?” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 2006. <a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb00521.x\">https://doi.org/10.1111/j.0014-3820.2006.tb00521.x</a>."},"publisher":"Wiley-Blackwell","publication":"Evolution; International Journal of Organic Evolution","issue":"9","extern":1,"type":"journal_article","month":"09","day":"01","page":"1763 - 1776","volume":60,"date_published":"2006-09-01T00:00:00Z","author":[{"first_name":"Michael","last_name":"Turelli","full_name":"Turelli, Michael"},{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Nicholas Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","date_updated":"2021-01-12T07:44:37Z","status":"public","_id":"3607","abstract":[{"text":"We apply new analytical methods to understand the consequences of population bottlenecks for expected additive genetic variance. We analyze essentially all models for multilocus epistasis that have been numerically simulated to demonstrate increased additive variance. We conclude that for biologically plausible models, large increases in expected additive variance–attributable to epistasis rather than dominance–are unlikely. Naciri-Graven and Goudet (2003) found that as the number of epistatically interacting loci increases, additive variance tends to be inflated more after a bottleneck. We argue that this result reflects biologically unrealistic aspects of their models. Specifically, as the number of loci increases, higher-order epistatic interactions become increasingly important in these models, with an increasing fraction of the genetic variance becoming nonadditive, contrary to empirical observations. As shown by Barton and Turelli (2004), without dominance, conversion of nonadditive to additive variance depends only on the variance components and not on the number of loci per se. Numerical results indicating that more inbreeding is needed to produce maximal release of additive variance with more loci follow directly from our analytical results, which show that high levels of inbreeding (F &gt; 0.5) are needed for significant conversion of higher-order components. We discuss alternative approaches to modeling multilocus epistasis and understanding its consequences.","lang":"eng"}],"intvolume":"        60"},{"publication_status":"published","author":[{"last_name":"Kirkpatrick","full_name":"Kirkpatrick, Mark","first_name":"Mark"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Nicholas Barton","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"date_published":"2006-05-01T00:00:00Z","_id":"3608","intvolume":"       173","abstract":[{"lang":"eng","text":"We study the evolution of inversions that capture locally adapted alleles when two populations are exchanging migrants or hybridizing. By suppressing recombination between the loci, a new inversion can spread. Neither drift nor coadaptation between the alleles (epistasis) is needed, so this local adaptation mechanism may apply to a broader range of genetic and demographic situations than alternative hypotheses that have been widely discussed. The mechanism can explain many features observed in inversion systems. It will drive an inversion to high frequency if there is no countervailing force, which could explain fixed differences observed between populations and species. An inversion can be stabilized at an intermediate frequency if it also happens to capture one or more deleterious recessive mutations, which could explain polymorphisms that are common in some species. This polymorphism can cycle in frequency with the changing selective advantage of the locally favored alleles. The mechanism can establish underdominant inversions that decrease heterokaryotype fitness by several percent if the cause of fitness loss is structural, while if the cause is genic there is no limit to the strength of underdominance that can result. The mechanism is expected to cause loci responsible for adaptive species-specific differences to map to inversions, as seen in recent QTL studies. We discuss data that support the hypothesis, review other mechanisms for inversion evolution, and suggest possible tests. "}],"status":"public","date_updated":"2021-01-12T07:44:37Z","extern":1,"publication":"Genetics","issue":"1","publisher":"Genetics Society of America","volume":173,"page":"419 - 434","day":"01","month":"05","type":"journal_article","quality_controlled":0,"doi":"10.1534/genetics.105.047985","date_created":"2018-12-11T12:04:13Z","year":"2006","citation":{"ama":"Kirkpatrick M, Barton NH. Chromosome inversions, local adaptation, and speciation. <i>Genetics</i>. 2006;173(1):419-434. doi:<a href=\"https://doi.org/10.1534/genetics.105.047985\">10.1534/genetics.105.047985</a>","ista":"Kirkpatrick M, Barton NH. 2006. Chromosome inversions, local adaptation, and speciation. Genetics. 173(1), 419–434.","apa":"Kirkpatrick, M., &#38; Barton, N. H. (2006). Chromosome inversions, local adaptation, and speciation. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.105.047985\">https://doi.org/10.1534/genetics.105.047985</a>","chicago":"Kirkpatrick, Mark, and Nicholas H Barton. “Chromosome Inversions, Local Adaptation, and Speciation.” <i>Genetics</i>. Genetics Society of America, 2006. <a href=\"https://doi.org/10.1534/genetics.105.047985\">https://doi.org/10.1534/genetics.105.047985</a>.","ieee":"M. Kirkpatrick and N. H. Barton, “Chromosome inversions, local adaptation, and speciation,” <i>Genetics</i>, vol. 173, no. 1. Genetics Society of America, pp. 419–434, 2006.","short":"M. Kirkpatrick, N.H. Barton, Genetics 173 (2006) 419–434.","mla":"Kirkpatrick, Mark, and Nicholas H. Barton. “Chromosome Inversions, Local Adaptation, and Speciation.” <i>Genetics</i>, vol. 173, no. 1, Genetics Society of America, 2006, pp. 419–34, doi:<a href=\"https://doi.org/10.1534/genetics.105.047985\">10.1534/genetics.105.047985</a>."},"publist_id":"2775","title":"Chromosome inversions, local adaptation, and speciation"},{"quality_controlled":0,"year":"2006","doi":"10.1111/j.0014-3820.2006.tb01139.x","date_created":"2018-12-11T12:04:13Z","citation":{"mla":"Yanchukov, Alexey, et al. “Hybridization of Bombina Bombina and B. Variegata (Anura, Discoglossidae) at a Sharp Ecotone in Western Ukraine: Comparisons across Transects and over Time.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 60, no. 3, Wiley-Blackwell, 2006, pp. 583–600, doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb01139.x\">10.1111/j.0014-3820.2006.tb01139.x</a>.","ieee":"A. Yanchukov <i>et al.</i>, “Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 60, no. 3. Wiley-Blackwell, pp. 583–600, 2006.","short":"A. Yanchukov, S. Hofman, J. Szymura, S. Mezhzherin, S. Morozov Leonov, N.H. Barton, B. Nürnberger, Evolution; International Journal of Organic Evolution 60 (2006) 583–600.","apa":"Yanchukov, A., Hofman, S., Szymura, J., Mezhzherin, S., Morozov Leonov, S., Barton, N. H., &#38; Nürnberger, B. (2006). Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb01139.x\">https://doi.org/10.1111/j.0014-3820.2006.tb01139.x</a>","chicago":"Yanchukov, Alexey, Sebastian Hofman, Jacek Szymura, Sergey Mezhzherin, Sviatoslav Morozov Leonov, Nicholas H Barton, and Beate Nürnberger. “Hybridization of Bombina Bombina and B. Variegata (Anura, Discoglossidae) at a Sharp Ecotone in Western Ukraine: Comparisons across Transects and over Time.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 2006. <a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb01139.x\">https://doi.org/10.1111/j.0014-3820.2006.tb01139.x</a>.","ama":"Yanchukov A, Hofman S, Szymura J, et al. Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time. <i>Evolution; International Journal of Organic Evolution</i>. 2006;60(3):583-600. doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2006.tb01139.x\">10.1111/j.0014-3820.2006.tb01139.x</a>","ista":"Yanchukov A, Hofman S, Szymura J, Mezhzherin S, Morozov Leonov S, Barton NH, Nürnberger B. 2006. Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time. Evolution; International Journal of Organic Evolution. 60(3), 583–600."},"publist_id":"2774","title":"Hybridization of Bombina bombina and B. variegata (Anura, Discoglossidae) at a sharp ecotone in western Ukraine: comparisons across transects and over time","author":[{"first_name":"Alexey","last_name":"Yanchukov","full_name":"Yanchukov, Alexey"},{"first_name":"Sebastian","full_name":"Hofman, Sebastian","last_name":"Hofman"},{"first_name":"Jacek","full_name":"Szymura, Jacek M","last_name":"Szymura"},{"last_name":"Mezhzherin","full_name":"Mezhzherin, Sergey V","first_name":"Sergey"},{"last_name":"Morozov Leonov","full_name":"Morozov-Leonov, Sviatoslav","first_name":"Sviatoslav"},{"full_name":"Nicholas Barton","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"},{"first_name":"Beate","full_name":"Nürnberger, Beate","last_name":"Nürnberger"}],"publication_status":"published","date_published":"2006-03-01T00:00:00Z","date_updated":"2021-01-12T07:44:38Z","status":"public","_id":"3609","intvolume":"        60","abstract":[{"text":"Bombina bombina and B. variegata are two anciently diverged toad taxa that have adapted to different breeding habitats yet hybridize freely in zones of overlap where their parapatric distributions meet. Here, we report on a joint genetic and ecological analysis of a hybrid zone in the vicinity of Stryi in western Ukraine. We used five unlinked allozyme loci, two nuclear single nucleotide polymorphisms and a mitochondrial DNA haplotype as genetic markers. Parallel allele frequency clines with a sharp central step occur across a sharp ecotone, where transitions in aquatic habitat, elevation, and terrestrial vegetation coincide. The width of the hybrid zone, estimated as the inverse of the maximum gradient in allele frequency, is 2.3 km. This is the smallest of four estimates derived from different clinal transects across Europe. We argue that the narrow cline near Stryi is mainly due to a combination of habitat distribution and habitat preference. Adult toads show a preference for either ponds (B. bombina) or puddles (B. variegata), which is known to affect the distribution of genotypes within the hybrid zones. At Stryi, it should cause a reduction of the dispersal rate across the ecotone and thus narrow the cline. A detailed comparison of all five intensively studied Bombina transects lends support to the hypothesis that habitat distribution plus habitat preference can jointly affect the structure of hybrid zones and, ultimately, the resulting barriers to gene flow between differentiated gene pools. This study also represents a resampling of an area that was last studied more than 70 years ago. Our allele-frequency clines largely coincide with those that were described then on the basis of morphological variation. However, we found asymmetrical introgression of B. variegata genes into B. bombina territory along the bank of a river.","lang":"eng"}],"publisher":"Wiley-Blackwell","publication":"Evolution; International Journal of Organic Evolution","issue":"3","extern":1,"day":"01","page":"583 - 600","volume":60,"type":"journal_article","month":"03"},{"issue":"1","extern":1,"publication":"Theoretical Population Biology","publisher":"Academic Press","month":"08","type":"journal_article","volume":70,"page":"56 - 62","day":"01","date_published":"2006-08-01T00:00:00Z","publication_status":"published","author":[{"first_name":"William","full_name":"Hill, William G","last_name":"Hill"},{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Nicholas Barton"},{"full_name":"Turelli, Michael","last_name":"Turelli","first_name":"Michael"}],"_id":"3610","intvolume":"        70","abstract":[{"text":"For a model of diallelic loci with arbitrary epistasis, Barton and Turelli [2004. Effects of genetic drift on variance components under a general model of epistasis. Evolution 58, 2111–2132] gave results for variances among and within replicate lines obtained by inbreeding without selection. Here, we discuss the relation between their population genetic methods and classical quantitative genetic arguments. In particular, we consider the case of no dominance using classical identity by descent arguments, which generalizes their results from two alleles to multiple alleles. To clarify the connections between the alternative methods, we obtain the same results using an intermediate method, which explicitly identifies the statistical effects of sets of loci. We also discuss the effects of population bottlenecks on covariances among relatives.","lang":"eng"}],"status":"public","date_updated":"2021-01-12T07:44:39Z","publist_id":"2773","title":"Prediction of effects of genetic drift on variance components under a general model of epistasis","date_created":"2018-12-11T12:04:14Z","doi":"10.1016/j.tpb.2005.10.001","year":"2006","quality_controlled":0,"citation":{"short":"W. Hill, N.H. Barton, M. Turelli, Theoretical Population Biology 70 (2006) 56–62.","ieee":"W. Hill, N. H. Barton, and M. Turelli, “Prediction of effects of genetic drift on variance components under a general model of epistasis,” <i>Theoretical Population Biology</i>, vol. 70, no. 1. Academic Press, pp. 56–62, 2006.","mla":"Hill, William, et al. “Prediction of Effects of Genetic Drift on Variance Components under a General Model of Epistasis.” <i>Theoretical Population Biology</i>, vol. 70, no. 1, Academic Press, 2006, pp. 56–62, doi:<a href=\"https://doi.org/10.1016/j.tpb.2005.10.001\">10.1016/j.tpb.2005.10.001</a>.","ama":"Hill W, Barton NH, Turelli M. Prediction of effects of genetic drift on variance components under a general model of epistasis. <i>Theoretical Population Biology</i>. 2006;70(1):56-62. doi:<a href=\"https://doi.org/10.1016/j.tpb.2005.10.001\">10.1016/j.tpb.2005.10.001</a>","ista":"Hill W, Barton NH, Turelli M. 2006. Prediction of effects of genetic drift on variance components under a general model of epistasis. Theoretical Population Biology. 70(1), 56–62.","apa":"Hill, W., Barton, N. H., &#38; Turelli, M. (2006). Prediction of effects of genetic drift on variance components under a general model of epistasis. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.tpb.2005.10.001\">https://doi.org/10.1016/j.tpb.2005.10.001</a>","chicago":"Hill, William, Nicholas H Barton, and Michael Turelli. “Prediction of Effects of Genetic Drift on Variance Components under a General Model of Epistasis.” <i>Theoretical Population Biology</i>. Academic Press, 2006. <a href=\"https://doi.org/10.1016/j.tpb.2005.10.001\">https://doi.org/10.1016/j.tpb.2005.10.001</a>."}},{"quality_controlled":0,"date_created":"2018-12-11T12:04:34Z","year":"2006","citation":{"ieee":"A. Ulges, C. Lampert, and D. Keysers, “Spatiogram-based shot distances for video retrieval,” presented at the TRECVID Workshop, 2006, pp. 1–10.","mla":"Ulges, Adrian, et al. <i>Spatiogram-Based Shot Distances for Video Retrieval</i>. NIST (National Institute of Standards and Technology, US Department of Commerce), 2006, pp. 1–10.","short":"A. Ulges, C. Lampert, D. Keysers, in:, NIST (National Institute of Standards and Technology, US Department of Commerce), 2006, pp. 1–10.","apa":"Ulges, A., Lampert, C., &#38; Keysers, D. (2006). Spatiogram-based shot distances for video retrieval (pp. 1–10). Presented at the TRECVID Workshop, NIST (National Institute of Standards and Technology, US Department of Commerce).","chicago":"Ulges, Adrian, Christoph Lampert, and Daniel Keysers. “Spatiogram-Based Shot Distances for Video Retrieval,” 1–10. NIST (National Institute of Standards and Technology, US Department of Commerce), 2006.","ama":"Ulges A, Lampert C, Keysers D. Spatiogram-based shot distances for video retrieval. In: NIST (National Institute of Standards and Technology, US Department of Commerce); 2006:1-10.","ista":"Ulges A, Lampert C, Keysers D. 2006. Spatiogram-based shot distances for video retrieval. TRECVID Workshop, TRECVID Notebook Papers and Slides, , 1–10."},"publist_id":"2702","title":"Spatiogram-based shot distances for video retrieval","publication_status":"published","author":[{"first_name":"Adrian","full_name":"Ulges, Adrian","last_name":"Ulges"},{"last_name":"Lampert","full_name":"Christoph Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887"},{"first_name":"Daniel","last_name":"Keysers","full_name":"Keysers,Daniel"}],"date_published":"2006-11-14T00:00:00Z","alternative_title":["TRECVID Notebook Papers and Slides"],"main_file_link":[{"url":"http://www-nlpir.nist.gov/projects/tvpubs/tv6.papers/dfki.pdf","open_access":"0"}],"abstract":[{"text":"We propose a video retrieval framework based on a novel combination of spatiograms and the Jensen-Shannon divergence, and validate its performance in two quantitative experiments on TRECVID BBC Rushes data. In the first experiment, color-based methods are tested by grouping redundant shots in an unsupervised clustering. Results of the second experiment show that motion-based spatiograms make a promising fast, compressed-domain descriptor for the detection of interview scenes.","lang":"eng"}],"_id":"3677","date_updated":"2021-01-12T07:45:04Z","status":"public","extern":1,"conference":{"name":"TRECVID Workshop"},"publisher":"NIST (National Institute of Standards and Technology, US Department of Commerce)","page":"1 - 10","day":"14","month":"11","type":"conference"},{"citation":{"short":"H. Ali, C. Lampert, T. Breuel, in:, Springer, 2006, pp. 892–901.","ieee":"H. Ali, C. Lampert, and T. Breuel, “Satellite tracks removal in astronomical images,” presented at the CIARP: Iberoamerican Congress in Pattern Recognition, 2006, vol. 4225, pp. 892–901.","mla":"Ali, Haider, et al. <i>Satellite Tracks Removal in Astronomical Images</i>. Vol. 4225, Springer, 2006, pp. 892–901, doi:<a href=\"https://doi.org/10.1007/11892755_92\">10.1007/11892755_92</a>.","chicago":"Ali, Haider, Christoph Lampert, and Thomas Breuel. “Satellite Tracks Removal in Astronomical Images,” 4225:892–901. Springer, 2006. <a href=\"https://doi.org/10.1007/11892755_92\">https://doi.org/10.1007/11892755_92</a>.","apa":"Ali, H., Lampert, C., &#38; Breuel, T. (2006). Satellite tracks removal in astronomical images (Vol. 4225, pp. 892–901). Presented at the CIARP: Iberoamerican Congress in Pattern Recognition, Springer. <a href=\"https://doi.org/10.1007/11892755_92\">https://doi.org/10.1007/11892755_92</a>","ista":"Ali H, Lampert C, Breuel T. 2006. Satellite tracks removal in astronomical images. CIARP: Iberoamerican Congress in Pattern Recognition, LNCS, vol. 4225, 892–901.","ama":"Ali H, Lampert C, Breuel T. Satellite tracks removal in astronomical images. In: Vol 4225. Springer; 2006:892-901. doi:<a href=\"https://doi.org/10.1007/11892755_92\">10.1007/11892755_92</a>"},"date_created":"2018-12-11T12:04:35Z","doi":"10.1007/11892755_92","year":"2006","quality_controlled":0,"title":"Satellite tracks removal in astronomical images","publist_id":"2700","_id":"3679","intvolume":"      4225","abstract":[{"lang":"eng","text":"This paper describes a new system for &quot;Finding Satellite Tracks” in astronomical images based on the modern geometric approach. There is an increasing need of using methods with solid mathematical and statistical foundation in astronomical image processing. Where the computational methods are serving in all disciplines of science, they are becoming popular in the field of astronomy as well. Currently different computational systems are required to be numerically optimized before to get applied on astronomical images. So at present there is no single system which solves the problems of astronomers using computational methods based on modern approaches. The system &quot;Finding Satellite Tracks” is based on geometric matching method &quot;Recognition by Adaptive Subdivision of Transformation Space (RAST)&quot;."}],"status":"public","date_updated":"2021-01-12T07:45:05Z","main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/~chl/papers/ali-ciarp2006.pdf"}],"date_published":"2006-10-31T00:00:00Z","alternative_title":["LNCS"],"publication_status":"published","author":[{"first_name":"Haider","full_name":"Ali,Haider","last_name":"Ali"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Christoph Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"},{"last_name":"Breuel","full_name":"Breuel,Thomas M","first_name":"Thomas"}],"month":"10","type":"conference","volume":4225,"page":"892 - 901","day":"31","extern":1,"publisher":"Springer","conference":{"name":"CIARP: Iberoamerican Congress in Pattern Recognition"}},{"citation":{"short":"C. Lampert, L. Mei, T. Breuel, in:, IEEE, 2006, pp. 639–634.","ieee":"C. Lampert, L. Mei, and T. Breuel, “Printing technique classification for document counterfeit detection,” presented at the CIS: Computational Intelligence and Security, 2006, vol. 1, pp. 639–634.","mla":"Lampert, Christoph, et al. <i>Printing Technique Classification for Document Counterfeit Detection</i>. Vol. 1, IEEE, 2006, pp. 639–634, doi:<a href=\"https://doi.org/10.1109/ICCIAS.2006.294214\">10.1109/ICCIAS.2006.294214</a>.","apa":"Lampert, C., Mei, L., &#38; Breuel, T. (2006). Printing technique classification for document counterfeit detection (Vol. 1, pp. 639–634). Presented at the CIS: Computational Intelligence and Security, IEEE. <a href=\"https://doi.org/10.1109/ICCIAS.2006.294214\">https://doi.org/10.1109/ICCIAS.2006.294214</a>","chicago":"Lampert, Christoph, Lin Mei, and Thomas Breuel. “Printing Technique Classification for Document Counterfeit Detection,” 1:639–634. IEEE, 2006. <a href=\"https://doi.org/10.1109/ICCIAS.2006.294214\">https://doi.org/10.1109/ICCIAS.2006.294214</a>.","ama":"Lampert C, Mei L, Breuel T. Printing technique classification for document counterfeit detection. In: Vol 1. IEEE; 2006:639-634. doi:<a href=\"https://doi.org/10.1109/ICCIAS.2006.294214\">10.1109/ICCIAS.2006.294214</a>","ista":"Lampert C, Mei L, Breuel T. 2006. Printing technique classification for document counterfeit detection. CIS: Computational Intelligence and Security vol. 1, 639–634."},"quality_controlled":0,"year":"2006","doi":"10.1109/ICCIAS.2006.294214","date_created":"2018-12-11T12:04:35Z","title":"Printing technique classification for document counterfeit detection","publist_id":"2698","main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/lampert-cis2006.pdf","open_access":"0"}],"status":"public","date_updated":"2021-01-12T07:45:06Z","_id":"3680","intvolume":"         1","abstract":[{"lang":"eng","text":"The detection of counterfeit in printed documents is currently based mainly on built-in security features or on human expertise. We propose a classification system that supports non-expert users to distinguish original documents from PC-made forgeries by analyzing the printing technique used. Each letter in a document is classified using a support vector machine that has been trained to distinguish laser from inkjet printouts. A color-coded visualization helps the user to interpret the per-letter classification results"}],"author":[{"last_name":"Lampert","full_name":"Christoph Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph"},{"last_name":"Mei","full_name":"Mei,Lin","first_name":"Lin"},{"first_name":"Thomas","full_name":"Breuel,Thomas M","last_name":"Breuel"}],"publication_status":"published","date_published":"2006-11-03T00:00:00Z","day":"03","page":"639 - 634","volume":1,"type":"conference","month":"11","publisher":"IEEE","conference":{"name":"CIS: Computational Intelligence and Security"},"extern":1},{"title":"Objective quality measurement for geometric document image restoration","publist_id":"2692","citation":{"short":"C. Lampert, T. Breuel, in:, Springer, 2006.","mla":"Lampert, Christoph, and Thomas Breuel. <i>Objective Quality Measurement for Geometric Document Image Restoration</i>. Springer, 2006.","ieee":"C. Lampert and T. Breuel, “Objective quality measurement for geometric document image restoration,” presented at the DAS: Document Analysis Systems, 2006.","apa":"Lampert, C., &#38; Breuel, T. (2006). Objective quality measurement for geometric document image restoration. Presented at the DAS: Document Analysis Systems, Springer.","chicago":"Lampert, Christoph, and Thomas Breuel. “Objective Quality Measurement for Geometric Document Image Restoration.” Springer, 2006.","ama":"Lampert C, Breuel T. Objective quality measurement for geometric document image restoration. In: Springer; 2006.","ista":"Lampert C, Breuel T. 2006. Objective quality measurement for geometric document image restoration. DAS: Document Analysis Systems."},"quality_controlled":0,"date_created":"2018-12-11T12:04:36Z","year":"2006","day":"16","month":"03","type":"conference","extern":1,"conference":{"name":"DAS: Document Analysis Systems"},"publisher":"Springer","main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/lampert-das2006.pdf","open_access":"0"}],"_id":"3683","abstract":[{"text":"Many algorithms to remove distortion from document images have be proposed in recent years, but so far there is no reliable method for comparing their performance. In this paper we propose a collection of methods to measure the quality of such restoration algorithms for document image which show a non-linear distortion due to perspective or page curl. For the result from these measurement to be meaningful, a common data set of ground truth is required. We therefore started with the buildup of a document image database that is meant to serve as a common data basis for all kinds of restoration from images of 3D-shaped document. The long term goal would be to establish this database and following extensions in the area of document image dewarping as an as fruitful and indispensable tool as e.g. the NIST database is for OCR, or the Caltech database is for object and face recognition.","lang":"eng"}],"status":"public","date_updated":"2021-01-12T07:45:07Z","publication_status":"published","author":[{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Christoph Lampert","orcid":"0000-0001-8622-7887","first_name":"Christoph"},{"full_name":"Breuel,Thomas M","last_name":"Breuel","first_name":"Thomas"}],"date_published":"2006-03-16T00:00:00Z"}]