--- _id: '3463' 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. author: - first_name: Joseph full_name: Bischofberger, Joseph last_name: Bischofberger - first_name: Dominique full_name: Engel, Dominique last_name: Engel - first_name: Michael full_name: Frotscher, Michael last_name: Frotscher - first_name: Peter M full_name: Peter Jonas id: 353C1B58-F248-11E8-B48F-1D18A9856A87 last_name: Jonas orcid: 0000-0001-5001-4804 citation: ama: 'Bischofberger J, Engel D, Frotscher M, Jonas PM. Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review). Pflugers Archiv : European Journal of Physiology. 2006;453(3):361-372. doi:10.1007/s00424-006-0093-2' apa: 'Bischofberger, J., Engel, D., Frotscher, M., & Jonas, P. M. (2006). Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review). Pflugers Archiv : European Journal of Physiology. Springer. https://doi.org/10.1007/s00424-006-0093-2' 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).” Pflugers Archiv : European Journal of Physiology. Springer, 2006. https://doi.org/10.1007/s00424-006-0093-2.' 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),” Pflugers Archiv : European Journal of Physiology, vol. 453, no. 3. Springer, pp. 361–372, 2006.' 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.' mla: 'Bischofberger, Joseph, et al. “Timing and Efficacy of Transmitter Release at Mossy Fiber Synapses in the Hippocampal Network. (Review).” Pflugers Archiv : European Journal of Physiology, vol. 453, no. 3, Springer, 2006, pp. 361–72, doi:10.1007/s00424-006-0093-2.' short: 'J. Bischofberger, D. Engel, M. Frotscher, P.M. Jonas, Pflugers Archiv : European Journal of Physiology 453 (2006) 361–372.' date_created: 2018-12-11T12:03:28Z date_published: 2006-12-01T00:00:00Z date_updated: 2019-04-26T07:22:28Z day: '01' doi: 10.1007/s00424-006-0093-2 extern: 1 intvolume: ' 453' issue: '3' month: '12' page: 361 - 372 publication: 'Pflugers Archiv : European Journal of Physiology' publication_status: published publisher: Springer publist_id: '2924' quality_controlled: 0 status: public title: Timing and efficacy of transmitter release at mossy fiber synapses in the hippocampal network. (Review) type: review volume: 453 year: '2006' ... --- _id: '3499' 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 ε>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. ' 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. alternative_title: - 'LNCS ' author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: 'Chatterjee K. Nash equilibrium for upward-closed objectives. In: Vol 4207. Springer; 2006:271-286. doi:10.1007/11874683_18' apa: 'Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives (Vol. 4207, pp. 271–286). Presented at the CSL: Computer Science Logic, Springer. https://doi.org/10.1007/11874683_18' chicago: Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives,” 4207:271–86. Springer, 2006. https://doi.org/10.1007/11874683_18. ieee: 'K. Chatterjee, “Nash equilibrium for upward-closed objectives,” presented at the CSL: Computer Science Logic, 2006, vol. 4207, pp. 271–286.' ista: 'Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. CSL: Computer Science Logic, LNCS , vol. 4207, 271–286.' mla: Chatterjee, Krishnendu. Nash Equilibrium for Upward-Closed Objectives. Vol. 4207, Springer, 2006, pp. 271–86, doi:10.1007/11874683_18. short: K. Chatterjee, in:, Springer, 2006, pp. 271–286. conference: name: 'CSL: Computer Science Logic' date_created: 2018-12-11T12:03:39Z date_published: 2006-09-28T00:00:00Z date_updated: 2021-01-12T07:43:52Z day: '28' doi: 10.1007/11874683_18 extern: 1 intvolume: ' 4207' month: '09' page: 271 - 286 publication_status: published publisher: Springer publist_id: '2888' quality_controlled: 0 status: public title: Nash equilibrium for upward-closed objectives type: conference volume: 4207 year: '2006' ... --- _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). 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. author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Thomas A full_name: Thomas Henzinger id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Nir full_name: Piterman, Nir last_name: Piterman citation: ama: 'Chatterjee K, Henzinger TA, Piterman N. Algorithms for Büchi Games. In: ACM; 2006.' apa: 'Chatterjee, K., Henzinger, T. A., & Piterman, N. (2006). Algorithms for Büchi Games. Presented at the GDV: Games in Design and Verification, ACM.' chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Algorithms for Büchi Games.” ACM, 2006. ieee: 'K. Chatterjee, T. A. Henzinger, and N. Piterman, “Algorithms for Büchi Games,” presented at the GDV: Games in Design and Verification, 2006.' ista: 'Chatterjee K, Henzinger TA, Piterman N. 2006. Algorithms for Büchi Games. GDV: Games in Design and Verification.' mla: Chatterjee, Krishnendu, et al. Algorithms for Büchi Games. ACM, 2006. short: K. Chatterjee, T.A. Henzinger, N. Piterman, in:, ACM, 2006. conference: name: 'GDV: Games in Design and Verification' date_created: 2018-12-11T12:03:39Z date_published: 2006-08-21T00:00:00Z date_updated: 2021-01-12T07:43:53Z day: '21' extern: 1 main_file_link: - open_access: '0' url: http://www.cs.le.ac.uk/people/np183/publications/2006/CHP06.pdf month: '08' publication_status: published publisher: ACM publist_id: '2887' quality_controlled: 0 status: public title: Algorithms for Büchi Games type: conference year: '2006' ... --- _id: '3510' abstract: - lang: eng 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. applicant: - Raindrop Geomagic, Inc. article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Ping full_name: Fu, Ping last_name: Fu - first_name: Dmitry full_name: Nekhayev, Dmitry last_name: Nekhayev - first_name: Michael full_name: Facello, Michael last_name: Facello - first_name: Steven full_name: Williams, Steven last_name: Williams citation: 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. apa: 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. 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. 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. 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. mla: Edelsbrunner, Herbert, et al. 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). date_created: 2018-12-11T12:03:42Z date_published: 2006-02-07T00:00:00Z date_updated: 2022-01-05T12:58:26Z day: '07' extern: '1' ipc: G06F 7/60 ; G06F 17/10 ; G06F 101/00 ipn: US6996505B1 main_file_link: - open_access: '1' url: https://patents.google.com/patent/US6996505 month: '02' oa: 1 oa_version: Published Version publication_date: 2006-02-07 publist_id: '2877' status: public title: Method, apparatus and computer program products for automatically generating NURBS models of triangulated surfaces using homeomorphism type: patent user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2006' ... --- _id: '3511' abstract: - lang: eng 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. ' acknowledgement: sold to Siemens and Phonak applicant: - Phonak AG article_processing_charge: No author: - first_name: Ping full_name: Fu, Ping last_name: Fu - first_name: Dmitry full_name: Nekhayev, Dmitry last_name: Nekhayev - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: Fu P, Nekhayev D, Edelsbrunner H. Manufacturing methods and systems for rapid production of hearing-aid shells. 2006. apa: Fu, P., Nekhayev, D., & 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. ieee: P. Fu, D. Nekhayev, and H. Edelsbrunner, “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. mla: Fu, Ping, et al. Manufacturing Methods and Systems for Rapid Production of Hearing-Aid Shells. 2006. short: P. Fu, D. Nekhayev, H. Edelsbrunner, (2006). date_created: 2018-12-11T12:03:43Z date_published: 2006-05-23T00:00:00Z date_updated: 2022-01-05T13:03:56Z day: '23' extern: '1' ipc: G06F 9/00 ipn: US7050876B1 main_file_link: - open_access: '1' url: https://patents.google.com/patent/US7050876B1 month: '05' oa: 1 oa_version: Published Version publication_date: 2006-05-23 publist_id: '2876' status: public title: Manufacturing methods and systems for rapid production of hearing-aid shells type: patent user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2006' ...