[{"extern":1,"month":"01","_id":"3820","date_created":"2018-12-11T12:05:21Z","abstract":[{"lang":"eng","text":"Synapses are the key elements for signal processing and plasticity in the brain. To determine the structural factors underlying the unique functional properties of the hippocampal mossy fiber synapse, the complete quantitative geometry was investigated, using electron microscopy of serial ultrathin sections followed by computer-assisted three-dimensional reconstruction. In particular, parameters relevant for transmitter release and synaptic plasticity were examined. Two membrane specializations were found: active zones (AZs), transmitter release sites, and puncta adherentia, putative adhesion complexes. Individual boutons had, on average, 25 AZs (range, 7-45) that varied in shape and size (mean, 0.1 microm2; range, 0.07-0.17 microm2). The mean distance between individual AZs was 0.45 microm. Mossy fiber boutons and their target structures were mostly ensheathed by astrocytes, but fine glial processes never reached the active zones. Two structural factors are likely to promote synaptic cross talk: the short distance between AZs and the absence of fine glial processes at AZs. Thus, synaptic cross talk may contribute to the efficacy of hippocampal mossy fiber synapses. On average, a bouton contained 20,400 synaptic vesicles; approximately 900 vesicles were located within 60 nm from the active zone, approximately 4400 between 60 and 200 nm, and the remaining beyond 200 nm, suggesting large readily releasable, recycling, and reserve pools. The organization of the different pools may be a key structural correlate of presynaptic plasticity at this synapse. Thus, the mossy fiber bouton differs fundamentally in structure and function from the calyx of Held and other central synapses."}],"date_published":"2007-01-01T00:00:00Z","page":"10434 - 44","issue":"39","quality_controlled":0,"publication":"Journal of Neuroscience","volume":27,"status":"public","intvolume":"        27","publisher":"Society for Neuroscience","publication_status":"published","publist_id":"2390","day":"01","year":"2007","type":"journal_article","author":[{"last_name":"Rollenhagen","first_name":"Astrid","full_name":"Rollenhagen, Astrid"},{"last_name":"Satzler","full_name":"Satzler, Kurt","first_name":"Kurt"},{"full_name":"Rodriguez, E Patricia","first_name":"E Patricia","last_name":"Rodriguez"},{"last_name":"Jonas","first_name":"Peter M","full_name":"Peter Jonas","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Frotscher","first_name":"Michael","full_name":"Frotscher, Michael"},{"last_name":"Lubke","first_name":"Joachim","full_name":"Lubke, Joachim H"}],"citation":{"short":"A. Rollenhagen, K. Satzler, E.P. Rodriguez, P.M. Jonas, M. Frotscher, J. Lubke, Journal of Neuroscience 27 (2007) 10434–44.","apa":"Rollenhagen, A., Satzler, K., Rodriguez, E. P., Jonas, P. M., Frotscher, M., &#38; Lubke, J. (2007). Structural determinants of transmission at large hippocampal mossy fiber synapses. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1946-07.2007\">https://doi.org/10.1523/JNEUROSCI.1946-07.2007</a>","ama":"Rollenhagen A, Satzler K, Rodriguez EP, Jonas PM, Frotscher M, Lubke J. Structural determinants of transmission at large hippocampal mossy fiber synapses. <i>Journal of Neuroscience</i>. 2007;27(39):10434-10444. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1946-07.2007\">10.1523/JNEUROSCI.1946-07.2007</a>","ista":"Rollenhagen A, Satzler K, Rodriguez EP, Jonas PM, Frotscher M, Lubke J. 2007. Structural determinants of transmission at large hippocampal mossy fiber synapses. Journal of Neuroscience. 27(39), 10434–44.","ieee":"A. Rollenhagen, K. Satzler, E. P. Rodriguez, P. M. Jonas, M. Frotscher, and J. Lubke, “Structural determinants of transmission at large hippocampal mossy fiber synapses,” <i>Journal of Neuroscience</i>, vol. 27, no. 39. Society for Neuroscience, pp. 10434–44, 2007.","chicago":"Rollenhagen, Astrid, Kurt Satzler, E Patricia Rodriguez, Peter M Jonas, Michael Frotscher, and Joachim Lubke. “Structural Determinants of Transmission at Large Hippocampal Mossy Fiber Synapses.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2007. <a href=\"https://doi.org/10.1523/JNEUROSCI.1946-07.2007\">https://doi.org/10.1523/JNEUROSCI.1946-07.2007</a>.","mla":"Rollenhagen, Astrid, et al. “Structural Determinants of Transmission at Large Hippocampal Mossy Fiber Synapses.” <i>Journal of Neuroscience</i>, vol. 27, no. 39, Society for Neuroscience, 2007, pp. 10434–44, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1946-07.2007\">10.1523/JNEUROSCI.1946-07.2007</a>."},"title":"Structural determinants of transmission at large hippocampal mossy fiber synapses","date_updated":"2021-01-12T07:52:26Z","doi":"10.1523/JNEUROSCI.1946-07.2007"},{"day":"01","publist_id":"2391","type":"journal_article","author":[{"last_name":"Schmidt Hieber","full_name":"Schmidt-Hieber, Christoph","first_name":"Christoph"},{"last_name":"Jonas","full_name":"Peter Jonas","first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"full_name":"Bischofberger, Josef","first_name":"Josef","last_name":"Bischofberger"}],"year":"2007","citation":{"short":"C. Schmidt Hieber, P.M. Jonas, J. Bischofberger, Journal of Neuroscience 27 (2007) 8430–8441.","ama":"Schmidt Hieber C, Jonas PM, Bischofberger J. Subthreshold dendritic signal processing and coincidence detection in dentate gyrus granule cells. <i>Journal of Neuroscience</i>. 2007;27(31):8430-8441. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1787-07.2007\">10.1523/JNEUROSCI.1787-07.2007</a>","apa":"Schmidt Hieber, C., Jonas, P. M., &#38; Bischofberger, J. (2007). Subthreshold dendritic signal processing and coincidence detection in dentate gyrus granule cells. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1787-07.2007\">https://doi.org/10.1523/JNEUROSCI.1787-07.2007</a>","chicago":"Schmidt Hieber, Christoph, Peter M Jonas, and Josef Bischofberger. “Subthreshold Dendritic Signal Processing and Coincidence Detection in Dentate Gyrus Granule Cells.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2007. <a href=\"https://doi.org/10.1523/JNEUROSCI.1787-07.2007\">https://doi.org/10.1523/JNEUROSCI.1787-07.2007</a>.","ieee":"C. Schmidt Hieber, P. M. Jonas, and J. Bischofberger, “Subthreshold dendritic signal processing and coincidence detection in dentate gyrus granule cells,” <i>Journal of Neuroscience</i>, vol. 27, no. 31. Society for Neuroscience, pp. 8430–8441, 2007.","ista":"Schmidt Hieber C, Jonas PM, Bischofberger J. 2007. Subthreshold dendritic signal processing and coincidence detection in dentate gyrus granule cells. Journal of Neuroscience. 27(31), 8430–8441.","mla":"Schmidt Hieber, Christoph, et al. “Subthreshold Dendritic Signal Processing and Coincidence Detection in Dentate Gyrus Granule Cells.” <i>Journal of Neuroscience</i>, vol. 27, no. 31, Society for Neuroscience, 2007, pp. 8430–41, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1787-07.2007\">10.1523/JNEUROSCI.1787-07.2007</a>."},"title":"Subthreshold dendritic signal processing and coincidence detection in dentate gyrus granule cells","date_updated":"2021-01-12T07:52:26Z","doi":"10.1523/JNEUROSCI.1787-07.2007","month":"01","extern":1,"date_created":"2018-12-11T12:05:21Z","_id":"3821","date_published":"2007-01-01T00:00:00Z","abstract":[{"text":"Although dendritic signal processing has been extensively investigated in hippocampal pyramidal cells, only little is known about dendritic integration of synaptic potentials in dentate gyrus granule cells, the first stage in the hippocampal trisynaptic circuit. Here we combined dual whole-cell patch-clamp recordings with high-resolution two-photon microscopy to obtain detailed passive cable models of hippocampal granule cells from adult mice. Passive cable properties were determined by direct fitting of the compartmental model to the experimentally measured voltage responses to short and long current pulses. The data are best fit by a cable model with homogenously distributed parameters, including an average specific membrane resistance (R(m)) of 38.0 kohms cm2, a membrane capacitance (C(m)) of 1.0 microF cm(-2), and an intracellular resistivity (R(i)) of 194 ohms cm. Computational analysis shows that signal propagation from somata into dendrites is more efficient in granule cells compared with CA1 pyramidal cells for both steady-state and sinusoidal voltage waveforms up to the gamma frequency range (f50% of 74 Hz). Similarly, distal synaptic inputs from entorhinal fibers can efficiently depolarize the somatic membrane of granule cells. Furthermore, the time course of distal dendritic synaptic potentials is remarkably fast, and temporal summation is restricted to a narrow time window in the range of approximately 10 ms attributable to the rapid dendritic charge redistribution during transient voltage signals. Therefore, the structure of the granule cell dendritic tree may be critically important for precise dendritic signal processing and coincidence detection during hippocampus-dependent memory formation and retrieval.","lang":"eng"}],"page":"8430 - 8441","issue":"31","publication":"Journal of Neuroscience","quality_controlled":0,"intvolume":"        27","status":"public","volume":27,"publisher":"Society for Neuroscience","publication_status":"published"},{"doi":"10.1109/QEST.2007.15","date_updated":"2021-01-12T07:52:55Z","conference":{"name":"QEST: Quantitative Evaluation of Systems"},"title":"Qualitative logics and equivalences for probabilistic systems","citation":{"mla":"De Alfaro, Luca, et al. <i>Qualitative Logics and Equivalences for Probabilistic Systems</i>. IEEE, 2007, pp. 237–48, doi:<a href=\"https://doi.org/10.1109/QEST.2007.15\">10.1109/QEST.2007.15</a>.","chicago":"De Alfaro, Luca, Krishnendu Chatterjee, Marco Faella, and Axel Legay. “Qualitative Logics and Equivalences for Probabilistic Systems,” 237–48. IEEE, 2007. <a href=\"https://doi.org/10.1109/QEST.2007.15\">https://doi.org/10.1109/QEST.2007.15</a>.","ista":"De Alfaro L, Chatterjee K, Faella M, Legay A. 2007. Qualitative logics and equivalences for probabilistic systems. QEST: Quantitative Evaluation of Systems, 237–248.","ieee":"L. De Alfaro, K. Chatterjee, M. Faella, and A. Legay, “Qualitative logics and equivalences for probabilistic systems,” presented at the QEST: Quantitative Evaluation of Systems, 2007, pp. 237–248.","ama":"De Alfaro L, Chatterjee K, Faella M, Legay A. Qualitative logics and equivalences for probabilistic systems. In: IEEE; 2007:237-248. doi:<a href=\"https://doi.org/10.1109/QEST.2007.15\">10.1109/QEST.2007.15</a>","apa":"De Alfaro, L., Chatterjee, K., Faella, M., &#38; Legay, A. (2007). Qualitative logics and equivalences for probabilistic systems (pp. 237–248). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. <a href=\"https://doi.org/10.1109/QEST.2007.15\">https://doi.org/10.1109/QEST.2007.15</a>","short":"L. De Alfaro, K. Chatterjee, M. Faella, A. Legay, in:, IEEE, 2007, pp. 237–248."},"year":"2007","author":[{"full_name":"de Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee"},{"full_name":"Faella, Marco","first_name":"Marco","last_name":"Faella"},{"first_name":"Axel","full_name":"Legay, Axel","last_name":"Legay"}],"type":"conference","day":"08","publist_id":"2289","publication_status":"published","publisher":"IEEE","status":"public","quality_controlled":0,"page":"237 - 248","date_published":"2007-10-08T00:00:00Z","_id":"3881","date_created":"2018-12-11T12:05:40Z","abstract":[{"lang":"eng","text":"We present Qualitative Randomized CTL (QRCTL), a qualitative version of pCTL, for specifying properties of Markov Decision Processes (MDPs). QRCTL formulas can express the fact that certain temporal properties hold with probability 0 or 1, but they do not distinguish other probabilities values. We present a symbolic, polynomial time model-checking algorithm for QRCTL on MDPs. Then, we study the equivalence relation induced by QRCTL, called qualitative equivalence. We show that for finite alternating MDPs, where nondeterministic and probabilistic choice occur in different states, qualitative equivalence coincides with alternating bisimulation, and can thus be computed via efficient partition-refinement algorithms. Surprisingly, the result does not hold for non-alternating MDPs. Indeed, we show that no local partition refinement algorithm can compute qualitative equivalence on non-alternating MDPs. Finally, we consider QRCTL*, that is the “star extension” of QRCTL. We show that QRCTL and QRCTL* induce the same qualitative equivalence on alternating MDPs, while on non-alternating MDPs, the equivalence, arising from QRCTL* can be strictly finer We also provide a full characterization of the relation between qualitative equivalence, bisimulation, and alternating bisimulation, according to whether the MDPs are finite, and to whether their transition relations are finite-branching."}],"extern":1,"month":"10"},{"date_updated":"2021-01-12T07:52:56Z","doi":"10.1016/j.tcs.2007.07.047","acknowledgement":"A preliminary version of the paper appeared in Computer Science Logic (CSL) 2006.","day":"05","publist_id":"2290","type":"journal_article","author":[{"last_name":"Chatterjee","full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"year":"2007","citation":{"mla":"Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” <i>Theoretical Computer Science</i>, vol. 388, no. 1–3, Elsevier, 2007, pp. 181–98, doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">10.1016/j.tcs.2007.07.047</a>.","ieee":"K. Chatterjee, “Concurrent games with tail objectives,” <i>Theoretical Computer Science</i>, vol. 388, no. 1–3. Elsevier, pp. 181–198, 2007.","ista":"Chatterjee K. 2007. Concurrent games with tail objectives. Theoretical Computer Science. 388(1–3), 181–198.","chicago":"Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.” <i>Theoretical Computer Science</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">https://doi.org/10.1016/j.tcs.2007.07.047</a>.","apa":"Chatterjee, K. (2007). Concurrent games with tail objectives. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">https://doi.org/10.1016/j.tcs.2007.07.047</a>","ama":"Chatterjee K. Concurrent games with tail objectives. <i>Theoretical Computer Science</i>. 2007;388(1-3):181-198. doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.047\">10.1016/j.tcs.2007.07.047</a>","short":"K. Chatterjee, Theoretical Computer Science 388 (2007) 181–198."},"title":"Concurrent games with tail objectives","publication":"Theoretical Computer Science","quality_controlled":0,"intvolume":"       388","status":"public","volume":388,"publication_status":"published","publisher":"Elsevier","month":"12","extern":1,"_id":"3882","date_published":"2007-12-05T00:00:00Z","abstract":[{"text":"We study infinite stochastic games played by two players over a finite state space, with objectives specified by sets of infinite traces. The games are concurrent (players make moves simultaneously and independently), stochastic (the next state is determined by a probability distribution that depends on the current state and chosen moves of the players) and infinite (proceed for an infinite number of rounds). The analysis of concurrent stochastic games can be classified into: quantitative analysis, analyzing the optimum value of the game and epsilon-optimal strategies that ensure values within epsilon of the optimum value; and qualitative analysis, analyzing the set of states with optimum value 1 and epsilon-optimal strategies for the states with optimum value 1. We consider concurrent games with tail objectives, i.e., objectives that are independent of the finite-prefix of traces, and show that the class of tail objectives is strictly richer than that of the omega-regular objectives. We develop new proof techniques to extend several properties of concurrent games with omega-regular objectives to concurrent games with tail objectives. We prove the positive limit-one property for tail objectives. The positive limit-one property states that for all concurrent games if the optimum value for a player is positive for a tail objective Phi at some state, then there is a state where the optimum value is 1 for the player for the objective Phi. We also show that the optimum values of zero-sum (strictly conflicting objectives) games with tail objectives can be related to equilibrium values of nonzerosum (not strictly conflicting objectives) games with simpler reachability objectives. A consequence of our analysis presents a polynomial time reduction of the quantitative analysis of tail objectives to the qualitative analysis for the subclass of one-player stochastic games (Markov decision processes). ","lang":"eng"}],"date_created":"2018-12-11T12:05:41Z","page":"181 - 198","issue":"1-3"},{"month":"03","extern":1,"_id":"3883","date_published":"2007-03-09T00:00:00Z","abstract":[{"lang":"eng","text":"We consider games where the winning conditions are disjunctions (or dually, conjunctions) of parity conditions; we call them generalized parity games. These winning conditions, while omega-regular, arise naturally when considering fair simulation between parity automata, secure equilibria for parity conditions, and determinization of Rabin automata. We show that these games retain the computational complexity of Rabin and Streett conditions; i.e., they are NP-complete and co-NP-complete, respectively. The (co-) NP-hardness is proved for the special case of a conjunction/disjunction of two parity conditions, which is the case that arises in fair simulation and secure equilibria. However, considering these games as Rabin or Streett games is not optimal. We give an exposition of Zielonka's algorithm when specialized to this kind of games. The complexity of solving these games for k parity objectives with d priorities, n states, and m edges is O(n(2kd) (.) m) (.) (k(.)d)!/ d!(k), as compared to O(n(2kd .) m) - (k (.) d)! when these games are solved as Rabin/Streett games. We also extend the subexponential algorithm for solving parity games recently introduced by Jurdzinski, Paterson, and Zwick to generalized parity games. The resulting complexity of solving generalized parity games is n(O(root n)) (.) (k(.)d)!/d!(k). As a corollary we obtain an improved ald!k gorithm for Rabin and Streett games with d pairs, with time complexity n(O(root n)) (.) d!."}],"date_created":"2018-12-11T12:05:41Z","page":"153 - 167","quality_controlled":0,"status":"public","intvolume":"      4423","volume":4423,"publisher":"Springer","publication_status":"published","day":"09","publist_id":"2287","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Piterman","first_name":"Nir","full_name":"Piterman, Nir"}],"type":"conference","year":"2007","alternative_title":["LNCS"],"citation":{"short":"K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Springer, 2007, pp. 153–167.","ama":"Chatterjee K, Henzinger TA, Piterman N. Generalized parity games. In: Vol 4423. Springer; 2007:153-167. doi:<a href=\"https://doi.org/10.1007/978-3-540-71389-0_12\">10.1007/978-3-540-71389-0_12</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2007). Generalized parity games (Vol. 4423, pp. 153–167). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. <a href=\"https://doi.org/10.1007/978-3-540-71389-0_12\">https://doi.org/10.1007/978-3-540-71389-0_12</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Generalized Parity Games,” 4423:153–67. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-71389-0_12\">https://doi.org/10.1007/978-3-540-71389-0_12</a>.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2007. Generalized parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 4423, 153–167.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Generalized parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 153–167.","mla":"Chatterjee, Krishnendu, et al. <i>Generalized Parity Games</i>. Vol. 4423, Springer, 2007, pp. 153–67, doi:<a href=\"https://doi.org/10.1007/978-3-540-71389-0_12\">10.1007/978-3-540-71389-0_12</a>."},"title":"Generalized parity games","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"date_updated":"2021-01-12T07:52:56Z","doi":"10.1007/978-3-540-71389-0_12","acknowledgement":"This research was supported in part by the Swiss National Science Foundation, and by the NSF grants CCR-0225610 and CCR-0234690."},{"extern":1,"month":"09","date_published":"2007-09-01T00:00:00Z","_id":"3884","abstract":[{"lang":"eng","text":"We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properties of nonzero-sum games in a simple and natural way. We show that the one-alternation fragment of strategy logic is strong enough to express the existence of Nash equilibria and secure equilibria, and subsumes other logics that were introduced to reason about games, such as ATL, ATL*, and game logic. We show that strategy logic is decidable, by constructing tree automata that recognize sets of strategies. While for the general logic, our decision procedure is nonelementary, for the simple fragment that is used above we show that the complexity is polynomial in the size of the game graph and optimal in the size of the formula (ranging from polynomial to 2EXPTIME depending on the form of the formula)."}],"date_created":"2018-12-11T12:05:41Z","page":"59 - 73","quality_controlled":0,"volume":4703,"intvolume":"      4703","status":"public","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","day":"01","publist_id":"2286","year":"2007","alternative_title":["LNCS"],"type":"conference","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Piterman","full_name":"Piterman, Nir","first_name":"Nir"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Strategy Logic</i>. Vol. 4703, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 59–73, doi:<a href=\"https://doi.org/10.1007/978-3-540-74407-8_5\">10.1007/978-3-540-74407-8_5</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic,” 4703:59–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74407-8_5\">https://doi.org/10.1007/978-3-540-74407-8_5</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and N. Piterman, “Strategy logic,” presented at the CONCUR: Concurrency Theory, 2007, vol. 4703, pp. 59–73.","ista":"Chatterjee K, Henzinger TA, Piterman N. 2007. Strategy logic. CONCUR: Concurrency Theory, LNCS, vol. 4703, 59–73.","ama":"Chatterjee K, Henzinger TA, Piterman N. Strategy logic. In: Vol 4703. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2007:59-73. doi:<a href=\"https://doi.org/10.1007/978-3-540-74407-8_5\">10.1007/978-3-540-74407-8_5</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Piterman, N. (2007). Strategy logic (Vol. 4703, pp. 59–73). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-540-74407-8_5\">https://doi.org/10.1007/978-3-540-74407-8_5</a>","short":"K. Chatterjee, T.A. Henzinger, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 59–73."},"conference":{"name":"CONCUR: Concurrency Theory"},"title":"Strategy logic","date_updated":"2023-02-23T11:45:56Z","doi":"10.1007/978-3-540-74407-8_5","related_material":{"record":[{"status":"public","relation":"later_version","id":"3861"}]}},{"page":"138 - 152","month":"07","extern":1,"abstract":[{"lang":"eng","text":"The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also present improved memory bounds for randomized almost-sure winning and optimal strategies."}],"_id":"3885","date_published":"2007-07-02T00:00:00Z","date_created":"2018-12-11T12:05:42Z","publication_status":"published","publisher":"Springer","quality_controlled":0,"status":"public","intvolume":"      4423","volume":4423,"citation":{"ama":"Chatterjee K. Optimal strategy synthesis in stochastic Müller games. In: Vol 4423. Springer; 2007:138-152. doi:<a href=\"https://doi.org/10.1007/978-3-540-71389-0_11\">10.1007/978-3-540-71389-0_11</a>","apa":"Chatterjee, K. (2007). Optimal strategy synthesis in stochastic Müller games (Vol. 4423, pp. 138–152). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Springer. <a href=\"https://doi.org/10.1007/978-3-540-71389-0_11\">https://doi.org/10.1007/978-3-540-71389-0_11</a>","short":"K. Chatterjee, in:, Springer, 2007, pp. 138–152.","mla":"Chatterjee, Krishnendu. <i>Optimal Strategy Synthesis in Stochastic Müller Games</i>. Vol. 4423, Springer, 2007, pp. 138–52, doi:<a href=\"https://doi.org/10.1007/978-3-540-71389-0_11\">10.1007/978-3-540-71389-0_11</a>.","chicago":"Chatterjee, Krishnendu. “Optimal Strategy Synthesis in Stochastic Müller Games,” 4423:138–52. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-71389-0_11\">https://doi.org/10.1007/978-3-540-71389-0_11</a>.","ista":"Chatterjee K. 2007. Optimal strategy synthesis in stochastic Müller games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS , vol. 4423, 138–152.","ieee":"K. Chatterjee, “Optimal strategy synthesis in stochastic Müller games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, 2007, vol. 4423, pp. 138–152."},"title":"Optimal strategy synthesis in stochastic Müller games","conference":{"name":"FoSSaCS: Foundations of Software Science and Computation Structures"},"day":"02","publist_id":"2284","author":[{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","year":"2007","alternative_title":["LNCS "],"acknowledgement":"This research was supported in part by the the AFOSR MURI grant F49620-00-1- 0327, and the NSF grant CCR-0225610.","date_updated":"2021-01-12T07:52:57Z","doi":"10.1007/978-3-540-71389-0_11"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","volume":4855,"status":"public","intvolume":"      4855","quality_controlled":0,"page":"436 - 448","abstract":[{"lang":"eng","text":"The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We show that both the qualitative and quantitative problem for stochastic Müller games are PSPACE-complete. We also consider two well-known sub-classes of Müller objectives, namely, upward-closed and union-closed objectives, and show that both the qualitative and quantitative problem for these sub-classes are coNP-complete."}],"_id":"3886","date_published":"2007-12-15T00:00:00Z","date_created":"2018-12-11T12:05:42Z","extern":1,"month":"12","acknowledgement":"This research was supported in part by the the AFOSR MURI grant F49620-00-1- 0327, and the NSF grant CCR-0225610.","doi":"10.1007/978-3-540-77050-3_36","date_updated":"2021-01-12T07:52:57Z","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"title":"Stochastic Müller games are PSPACE-complete","citation":{"mla":"Chatterjee, Krishnendu. <i>Stochastic Müller Games Are PSPACE-Complete</i>. Vol. 4855, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 436–48, doi:<a href=\"https://doi.org/10.1007/978-3-540-77050-3_36\">10.1007/978-3-540-77050-3_36</a>.","chicago":"Chatterjee, Krishnendu. “Stochastic Müller Games Are PSPACE-Complete,” 4855:436–48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. <a href=\"https://doi.org/10.1007/978-3-540-77050-3_36\">https://doi.org/10.1007/978-3-540-77050-3_36</a>.","ieee":"K. Chatterjee, “Stochastic Müller games are PSPACE-complete,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2007, vol. 4855, pp. 436–448.","ista":"Chatterjee K. 2007. Stochastic Müller games are PSPACE-complete. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS, vol. 4855, 436–448.","ama":"Chatterjee K. Stochastic Müller games are PSPACE-complete. In: Vol 4855. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2007:436-448. doi:<a href=\"https://doi.org/10.1007/978-3-540-77050-3_36\">10.1007/978-3-540-77050-3_36</a>","apa":"Chatterjee, K. (2007). Stochastic Müller games are PSPACE-complete (Vol. 4855, pp. 436–448). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-540-77050-3_36\">https://doi.org/10.1007/978-3-540-77050-3_36</a>","short":"K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 436–448."},"year":"2007","alternative_title":["LNCS"],"author":[{"first_name":"Krishnendu","full_name":"Krishnendu Chatterjee","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"}],"type":"conference","publist_id":"2282","day":"15"},{"abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple long-run average objectives. Such MDPs occur in design problems where one wishes to simultaneously optimize several criteria, for example, latency and power. The possible trade-offs between the different objectives are characterized by the Pareto curve. We show that every Pareto optimal point can be epsilon-approximated by a memoryless strategy, for all epsilon &gt; 0. In contrast to the single-objective case, the memoryless strategy may require randomization. We show that the Pareto curve can be approximated (a) in polynomial time in the size of the MDP for irreducible MDPs; and (b) in polynomial space in the size of the MDP for all MDPs. Additionally, we study the problem if a given value vector is realizable by any strategy, and show that it can be decided in polynomial time for irreducible MDPs and in NP for all MDPs. These results provide algorithms for design exploration in MDP models with multiple long-run average objectives."}],"_id":"3887","date_published":"2007-11-27T00:00:00Z","date_created":"2018-12-11T12:05:42Z","month":"11","extern":1,"page":"473 - 484","intvolume":"      4855","status":"public","volume":4855,"quality_controlled":0,"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Chatterjee","full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"type":"conference","alternative_title":["LNCS "],"year":"2007","day":"27","publist_id":"2283","title":"Markov decision processes with multiple long-run average objectives","conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},"citation":{"short":"K. Chatterjee, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 473–484.","ama":"Chatterjee K. Markov decision processes with multiple long-run average objectives. In: Vol 4855. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2007:473-484. doi:<a href=\"https://doi.org/10.1007/978-3-540-77050-3_39\">10.1007/978-3-540-77050-3_39</a>","apa":"Chatterjee, K. (2007). Markov decision processes with multiple long-run average objectives (Vol. 4855, pp. 473–484). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-540-77050-3_39\">https://doi.org/10.1007/978-3-540-77050-3_39</a>","chicago":"Chatterjee, Krishnendu. “Markov Decision Processes with Multiple Long-Run Average Objectives,” 4855:473–84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007. <a href=\"https://doi.org/10.1007/978-3-540-77050-3_39\">https://doi.org/10.1007/978-3-540-77050-3_39</a>.","ieee":"K. Chatterjee, “Markov decision processes with multiple long-run average objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 2007, vol. 4855, pp. 473–484.","ista":"Chatterjee K. 2007. Markov decision processes with multiple long-run average objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LNCS , vol. 4855, 473–484.","mla":"Chatterjee, Krishnendu. <i>Markov Decision Processes with Multiple Long-Run Average Objectives</i>. Vol. 4855, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007, pp. 473–84, doi:<a href=\"https://doi.org/10.1007/978-3-540-77050-3_39\">10.1007/978-3-540-77050-3_39</a>."},"doi":"10.1007/978-3-540-77050-3_39","date_updated":"2021-01-12T07:52:58Z","acknowledgement":"This research was supported by the NSF grants CCR-0225610 and CCR-0234690"},{"date_updated":"2021-01-12T07:53:07Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1016/j.cub.2007.06.008","publist_id":"2243","day":"21","author":[{"last_name":"Cremer","full_name":"Cremer, Sylvia","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Armitage","first_name":"Sophie","full_name":"Armitage, Sophie"},{"last_name":"Schmid Hempel","full_name":"Schmid Hempel, Paul","first_name":"Paul"}],"type":"journal_article","oa_version":"None","year":"2007","citation":{"short":"S. Cremer, S. Armitage, P. Schmid Hempel, Current Biology 17 (2007) R693–R702.","ama":"Cremer S, Armitage S, Schmid Hempel P. Social immunity. <i>Current Biology</i>. 2007;17(16):R693-R702. doi:<a href=\"https://doi.org/10.1016/j.cub.2007.06.008\">10.1016/j.cub.2007.06.008</a>","apa":"Cremer, S., Armitage, S., &#38; Schmid Hempel, P. (2007). Social immunity. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2007.06.008\">https://doi.org/10.1016/j.cub.2007.06.008</a>","chicago":"Cremer, Sylvia, Sophie Armitage, and Paul Schmid Hempel. “Social Immunity.” <i>Current Biology</i>. Cell Press, 2007. <a href=\"https://doi.org/10.1016/j.cub.2007.06.008\">https://doi.org/10.1016/j.cub.2007.06.008</a>.","ista":"Cremer S, Armitage S, Schmid Hempel P. 2007. Social immunity. Current Biology. 17(16), R693–R702.","ieee":"S. Cremer, S. Armitage, and P. Schmid Hempel, “Social immunity,” <i>Current Biology</i>, vol. 17, no. 16. Cell Press, pp. R693–R702, 2007.","mla":"Cremer, Sylvia, et al. “Social Immunity.” <i>Current Biology</i>, vol. 17, no. 16, Cell Press, 2007, pp. R693–702, doi:<a href=\"https://doi.org/10.1016/j.cub.2007.06.008\">10.1016/j.cub.2007.06.008</a>."},"title":"Social immunity","publication":"Current Biology","intvolume":"        17","status":"public","volume":17,"publisher":"Cell Press","publication_status":"published","month":"08","extern":"1","_id":"3909","date_published":"2007-08-21T00:00:00Z","abstract":[{"lang":"eng","text":"Social insect colonies have evolved collective immune defences against parasites. These ‘social immune systems’ result from the cooperation of the individual group members to combat the increased risk of disease transmission that arises from sociality and group living. In this review we illustrate the pathways that parasites can take to infect a social insect colony and use these pathways as a framework to predict colony defence mechanisms and present the existing evidence. We find that the collective defences can be both prophylactic and activated on demand and consist of behavioural, physiological and organisational adaptations of the colony that prevent parasite entrance, establishment and spread. We discuss the regulation of collective immunity, which requires complex integration of information about both the parasites and the internal status of the insect colony. Our review concludes with an examination of the evolution of social immunity, which is based on the consequences of selection at both the individual and the colony level."}],"date_created":"2018-12-11T12:05:50Z","page":"R693 - R702","issue":"16"},{"day":"01","publist_id":"2244","year":"2007","oa_version":"None","author":[{"last_name":"Hughes","full_name":"Hughes, David","first_name":"David"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia","full_name":"Cremer, Sylvia"}],"type":"journal_article","citation":{"short":"D. Hughes, S. Cremer, Animal Behaviour 74 (2007) 1593–1599.","apa":"Hughes, D., &#38; Cremer, S. (2007). Plasticity in anti-parasite behaviours and its suggested role in invasion biology. <i>Animal Behaviour</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.anbehav.2006.12.025\">https://doi.org/10.1016/j.anbehav.2006.12.025</a>","ama":"Hughes D, Cremer S. Plasticity in anti-parasite behaviours and its suggested role in invasion biology. <i>Animal Behaviour</i>. 2007;74(5):1593-1599. doi:<a href=\"https://doi.org/10.1016/j.anbehav.2006.12.025\">10.1016/j.anbehav.2006.12.025</a>","ista":"Hughes D, Cremer S. 2007. Plasticity in anti-parasite behaviours and its suggested role in invasion biology. Animal Behaviour. 74(5), 1593–1599.","ieee":"D. Hughes and S. Cremer, “Plasticity in anti-parasite behaviours and its suggested role in invasion biology,” <i>Animal Behaviour</i>, vol. 74, no. 5. Elsevier, pp. 1593–1599, 2007.","chicago":"Hughes, David, and Sylvia Cremer. “Plasticity in Anti-Parasite Behaviours and Its Suggested Role in Invasion Biology.” <i>Animal Behaviour</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.anbehav.2006.12.025\">https://doi.org/10.1016/j.anbehav.2006.12.025</a>.","mla":"Hughes, David, and Sylvia Cremer. “Plasticity in Anti-Parasite Behaviours and Its Suggested Role in Invasion Biology.” <i>Animal Behaviour</i>, vol. 74, no. 5, Elsevier, 2007, pp. 1593–99, doi:<a href=\"https://doi.org/10.1016/j.anbehav.2006.12.025\">10.1016/j.anbehav.2006.12.025</a>."},"title":"Plasticity in anti-parasite behaviours and its suggested role in invasion biology","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:53:08Z","doi":"10.1016/j.anbehav.2006.12.025","extern":"1","month":"11","date_created":"2018-12-11T12:05:50Z","_id":"3910","date_published":"2007-11-01T00:00:00Z","page":"1593 - 1599","issue":"5","publication":"Animal Behaviour","volume":74,"intvolume":"        74","status":"public","publication_status":"published","publisher":"Elsevier"},{"author":[{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","last_name":"Ugelvig","full_name":"Ugelvig, Line V","first_name":"Line V"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","full_name":"Cremer, Sylvia","first_name":"Sylvia"}],"type":"journal_article","year":"2007","oa_version":"None","publist_id":"2245","day":"20","title":"Social prophylaxis: group interaction promotes collective immunity in ant colonies","citation":{"short":"L.V. Ugelvig, S. Cremer, Current Biology 17 (2007) 1967–1971.","ama":"Ugelvig LV, Cremer S. Social prophylaxis: group interaction promotes collective immunity in ant colonies. <i>Current Biology</i>. 2007;17(22):1967-1971. doi:<a href=\"https://doi.org/10.1016/j.cub.2007.10.029\">10.1016/j.cub.2007.10.029</a>","apa":"Ugelvig, L. V., &#38; Cremer, S. (2007). Social prophylaxis: group interaction promotes collective immunity in ant colonies. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2007.10.029\">https://doi.org/10.1016/j.cub.2007.10.029</a>","chicago":"Ugelvig, Line V, and Sylvia Cremer. “Social Prophylaxis: Group Interaction Promotes Collective Immunity in Ant Colonies.” <i>Current Biology</i>. Cell Press, 2007. <a href=\"https://doi.org/10.1016/j.cub.2007.10.029\">https://doi.org/10.1016/j.cub.2007.10.029</a>.","ieee":"L. V. Ugelvig and S. Cremer, “Social prophylaxis: group interaction promotes collective immunity in ant colonies,” <i>Current Biology</i>, vol. 17, no. 22. Cell Press, pp. 1967–1971, 2007.","ista":"Ugelvig LV, Cremer S. 2007. Social prophylaxis: group interaction promotes collective immunity in ant colonies. Current Biology. 17(22), 1967–1971.","mla":"Ugelvig, Line V., and Sylvia Cremer. “Social Prophylaxis: Group Interaction Promotes Collective Immunity in Ant Colonies.” <i>Current Biology</i>, vol. 17, no. 22, Cell Press, 2007, pp. 1967–71, doi:<a href=\"https://doi.org/10.1016/j.cub.2007.10.029\">10.1016/j.cub.2007.10.029</a>."},"doi":"10.1016/j.cub.2007.10.029","date_updated":"2021-01-12T07:53:08Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"3911","abstract":[{"lang":"eng","text":"Life in a social group increases the risk of disease transmission. To counteract this threat, social insects have evolved manifold antiparasite defenses, ranging from social exclusion of infected group members to intensive care. It is generally assumed that individuals performing hygienic behaviors risk infecting themselves, suggesting a high direct cost of helping. Our work instead indicates the opposite for garden ants. Social contact with individual workers, which were experimentally exposed to a fungal parasite, provided a clear survival benefit to nontreated, naive group members upon later challenge with the same parasite. This first demonstration of contact immunity in Social Hymenoptera and complementary results from other animal groups and plants suggest its general importance in both antiparasite and antiherbivore defense. In addition to this physiological prophylaxis of adult ants, infection of the brood was prevented in our experiment by behavioral changes of treated and naive workers. Parasite-treated ants stayed away from the brood chamber, whereas their naive nestmates increased brood-care activities. Our findings reveal a direct benefit for individuals to perform hygienic behaviors toward others, and this might explain the widely observed maintenance of social cohesion under parasite attack in insect societies."}],"date_published":"2007-11-20T00:00:00Z","date_created":"2018-12-11T12:05:51Z","month":"11","extern":"1","issue":"22","page":"1967 - 1971","intvolume":"        17","status":"public","volume":17,"publication":"Current Biology","publisher":"Cell Press","publication_status":"published"},{"date_updated":"2021-01-12T07:53:19Z","doi":"10.1038/ni1499","citation":{"chicago":"Woolf, Eilon, Irina Grigorova, Adi Sagiv, Valentin Grabovsky, Sara Feigelson, Ziv Shulman, Tanja Hartmann, Michael K Sixt, Jason Cyster, and Ronen Alon. “Lymph Node Chemokines Promote Sustained T Lymphocyte Motility without Triggering Stable Integrin Adhesiveness in the Absence of Shear Forces.” <i>Nature Immunology</i>. Nature Publishing Group, 2007. <a href=\"https://doi.org/10.1038/ni1499\">https://doi.org/10.1038/ni1499</a>.","ieee":"E. Woolf <i>et al.</i>, “Lymph node chemokines promote sustained T lymphocyte motility without triggering stable integrin adhesiveness in the absence of shear forces,” <i>Nature Immunology</i>, vol. 8, no. 10. Nature Publishing Group, pp. 1076–1085, 2007.","ista":"Woolf E, Grigorova I, Sagiv A, Grabovsky V, Feigelson S, Shulman Z, Hartmann T, Sixt MK, Cyster J, Alon R. 2007. Lymph node chemokines promote sustained T lymphocyte motility without triggering stable integrin adhesiveness in the absence of shear forces. Nature Immunology. 8(10), 1076–1085.","mla":"Woolf, Eilon, et al. “Lymph Node Chemokines Promote Sustained T Lymphocyte Motility without Triggering Stable Integrin Adhesiveness in the Absence of Shear Forces.” <i>Nature Immunology</i>, vol. 8, no. 10, Nature Publishing Group, 2007, pp. 1076–85, doi:<a href=\"https://doi.org/10.1038/ni1499\">10.1038/ni1499</a>.","short":"E. Woolf, I. Grigorova, A. Sagiv, V. Grabovsky, S. Feigelson, Z. Shulman, T. Hartmann, M.K. Sixt, J. Cyster, R. Alon, Nature Immunology 8 (2007) 1076–1085.","ama":"Woolf E, Grigorova I, Sagiv A, et al. Lymph node chemokines promote sustained T lymphocyte motility without triggering stable integrin adhesiveness in the absence of shear forces. <i>Nature Immunology</i>. 2007;8(10):1076-1085. doi:<a href=\"https://doi.org/10.1038/ni1499\">10.1038/ni1499</a>","apa":"Woolf, E., Grigorova, I., Sagiv, A., Grabovsky, V., Feigelson, S., Shulman, Z., … Alon, R. (2007). Lymph node chemokines promote sustained T lymphocyte motility without triggering stable integrin adhesiveness in the absence of shear forces. <i>Nature Immunology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ni1499\">https://doi.org/10.1038/ni1499</a>"},"title":"Lymph node chemokines promote sustained T lymphocyte motility without triggering stable integrin adhesiveness in the absence of shear forces","day":"26","publist_id":"2189","type":"journal_article","author":[{"full_name":"Woolf, Eilon","first_name":"Eilon","last_name":"Woolf"},{"last_name":"Grigorova","first_name":"Irina","full_name":"Grigorova, Irina"},{"first_name":"Adi","full_name":"Sagiv, Adi","last_name":"Sagiv"},{"last_name":"Grabovsky","full_name":"Grabovsky, Valentin","first_name":"Valentin"},{"full_name":"Feigelson, Sara W","first_name":"Sara","last_name":"Feigelson"},{"last_name":"Shulman","full_name":"Shulman, Ziv","first_name":"Ziv"},{"last_name":"Hartmann","first_name":"Tanja","full_name":"Hartmann, Tanja"},{"last_name":"Sixt","first_name":"Michael K","full_name":"Michael Sixt","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jason","full_name":"Cyster, Jason G","last_name":"Cyster"},{"first_name":"Ronen","full_name":"Alon, Ronen","last_name":"Alon"}],"year":"2007","publisher":"Nature Publishing Group","publication_status":"published","publication":"Nature Immunology","quality_controlled":0,"status":"public","intvolume":"         8","volume":8,"page":"1076 - 1085","issue":"10","month":"08","extern":1,"_id":"3937","date_published":"2007-08-26T00:00:00Z","date_created":"2018-12-11T12:05:59Z","abstract":[{"lang":"eng","text":"Lymphocyte motility in lymph nodes is regulated by chemokines, but the contribution of integrins to this motility remains obscure. Here we examined lymphocyte migration over CCR7-binding chemokines that 'decorate' lymph node stroma. In a shear-free environment, surface-bound lymph node chemokines but not their soluble counterparts promoted robust and sustained T lymphocyte motility. The chemokine CCL21 induced compartmentalized clustering of the integrins LFA-1 and VLA-4 in motile lymphocytes, but both integrins remained nonadhesive to ligands on lymphocytes, dendritic cells and stroma. The application of shear stress to lymphocytes interacting with CCL21 and integrin ligands promoted robust integrin-mediated adhesion. Thus, lymph node chemokines that promote motility and strongly activate lymphocyte integrins under shear forces fail to stimulate stable integrin adhesiveness in extravascular shear-free environments."}]},{"page":"2346 - 2355","issue":"6","month":"03","extern":1,"date_created":"2018-12-11T12:05:59Z","_id":"3938","abstract":[{"text":"RhoH is a small GTPase expressed only in the hematopoietic system. With the use of mice with targeted disruption of the RhoH gene, we demonstrated that RhoH is crucial for thymocyte maturation during DN3 to DN4 transition and during positive selection. Furthermore, the differentiation and expansion of DN3 and DN4 thymocytes in vitro were severely impaired. These defects corresponded to defective TCR signaling. Although RhoH is not required for TCR-induced activation of ZAP70 and ZAP70-mediated activation of p38, it is crucial for the tyrosine phosphorylation of LAT, PLCgamma1, and Vav1 and for the activation of Erk and calcium influx. These data suggest that RhoH is important for pre-TCR and TCR signaling because it allows the efficient interaction of ZAP70 with the LAT signalosome, thus regulating thymocyte development.","lang":"eng"}],"date_published":"2007-03-15T00:00:00Z","publication_status":"published","publisher":"American Society of Hematology","publication":"Blood","quality_controlled":0,"status":"public","intvolume":"       109","volume":109,"citation":{"ama":"Dorn T, Kuhn U, Bungartz G, et al. RhoH is important for positive thymocyte selection and T-cell receptor signaling. <i>Blood</i>. 2007;109(6):2346-2355. doi:<a href=\"https://doi.org/10.1182/blood-2006-04-019034\">10.1182/blood-2006-04-019034</a>","apa":"Dorn, T., Kuhn, U., Bungartz, G., Stiller, S., Bauer, M., Ellwart, J., … Brakebusch, C. (2007). RhoH is important for positive thymocyte selection and T-cell receptor signaling. <i>Blood</i>. American Society of Hematology. <a href=\"https://doi.org/10.1182/blood-2006-04-019034\">https://doi.org/10.1182/blood-2006-04-019034</a>","short":"T. Dorn, U. Kuhn, G. Bungartz, S. Stiller, M. Bauer, J. Ellwart, T. Peters, K. Scharffetter Kochanek, M. Semmrich, M. Laschinger, B. Holzmann, W. Klinkert, P. Straten, T. Køllgaard, M.K. Sixt, C. Brakebusch, Blood 109 (2007) 2346–2355.","mla":"Dorn, Tatjana, et al. “RhoH Is Important for Positive Thymocyte Selection and T-Cell Receptor Signaling.” <i>Blood</i>, vol. 109, no. 6, American Society of Hematology, 2007, pp. 2346–55, doi:<a href=\"https://doi.org/10.1182/blood-2006-04-019034\">10.1182/blood-2006-04-019034</a>.","chicago":"Dorn, Tatjana, Ursula Kuhn, Gerd Bungartz, Sebastian Stiller, Martina Bauer, Joachim Ellwart, Thorsten Peters, et al. “RhoH Is Important for Positive Thymocyte Selection and T-Cell Receptor Signaling.” <i>Blood</i>. American Society of Hematology, 2007. <a href=\"https://doi.org/10.1182/blood-2006-04-019034\">https://doi.org/10.1182/blood-2006-04-019034</a>.","ieee":"T. Dorn <i>et al.</i>, “RhoH is important for positive thymocyte selection and T-cell receptor signaling,” <i>Blood</i>, vol. 109, no. 6. American Society of Hematology, pp. 2346–2355, 2007.","ista":"Dorn T, Kuhn U, Bungartz G, Stiller S, Bauer M, Ellwart J, Peters T, Scharffetter Kochanek K, Semmrich M, Laschinger M, Holzmann B, Klinkert W, Straten P, Køllgaard T, Sixt MK, Brakebusch C. 2007. RhoH is important for positive thymocyte selection and T-cell receptor signaling. Blood. 109(6), 2346–2355."},"title":"RhoH is important for positive thymocyte selection and T-cell receptor signaling","publist_id":"2190","day":"15","author":[{"first_name":"Tatjana","full_name":"Dorn, Tatjana","last_name":"Dorn"},{"last_name":"Kuhn","full_name":"Kuhn, Ursula","first_name":"Ursula"},{"full_name":"Bungartz, Gerd","first_name":"Gerd","last_name":"Bungartz"},{"full_name":"Stiller, Sebastian","first_name":"Sebastian","last_name":"Stiller"},{"last_name":"Bauer","first_name":"Martina","full_name":"Bauer, Martina"},{"last_name":"Ellwart","first_name":"Joachim","full_name":"Ellwart, Joachim"},{"last_name":"Peters","full_name":"Peters, Thorsten","first_name":"Thorsten"},{"last_name":"Scharffetter Kochanek","first_name":"Karin","full_name":"Scharffetter-Kochanek, Karin"},{"last_name":"Semmrich","first_name":"Monika","full_name":"Semmrich, Monika"},{"full_name":"Laschinger, Melanie","first_name":"Melanie","last_name":"Laschinger"},{"last_name":"Holzmann","full_name":"Holzmann, Bernhard","first_name":"Bernhard"},{"full_name":"Klinkert, Wolfgang E","first_name":"Wolfgang","last_name":"Klinkert"},{"last_name":"Straten","first_name":"Per","full_name":"Straten, Per Thor"},{"full_name":"Køllgaard, Tania","first_name":"Tania","last_name":"Køllgaard"},{"first_name":"Michael K","full_name":"Michael Sixt","last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"},{"full_name":"Brakebusch, Cord","first_name":"Cord","last_name":"Brakebusch"}],"type":"journal_article","year":"2007","date_updated":"2021-01-12T07:53:19Z","doi":"10.1182/blood-2006-04-019034"},{"page":"103 - 120","issue":"1","month":"01","extern":1,"_id":"3972","date_created":"2018-12-11T12:06:12Z","abstract":[{"text":"The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram is stable: small changes in the function imply only small changes in the diagram. We apply this result to estimating the homology of sets in a metric space and to comparing and classifying geometric shapes.","lang":"eng"}],"date_published":"2007-01-01T00:00:00Z","publisher":"Springer","publication_status":"published","publication":"Discrete & Computational Geometry","quality_controlled":0,"intvolume":"        37","status":"public","volume":37,"citation":{"ama":"Cohen Steiner D, Edelsbrunner H, Harer J. Stability of persistence diagrams. <i>Discrete &#38; Computational Geometry</i>. 2007;37(1):103-120. doi:<a href=\"https://doi.org/10.1007/s00454-006-1276-5\">10.1007/s00454-006-1276-5</a>","apa":"Cohen Steiner, D., Edelsbrunner, H., &#38; Harer, J. (2007). Stability of persistence diagrams. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-006-1276-5\">https://doi.org/10.1007/s00454-006-1276-5</a>","short":"D. Cohen Steiner, H. Edelsbrunner, J. Harer, Discrete &#38; Computational Geometry 37 (2007) 103–120.","mla":"Cohen Steiner, David, et al. “Stability of Persistence Diagrams.” <i>Discrete &#38; Computational Geometry</i>, vol. 37, no. 1, Springer, 2007, pp. 103–20, doi:<a href=\"https://doi.org/10.1007/s00454-006-1276-5\">10.1007/s00454-006-1276-5</a>.","chicago":"Cohen Steiner, David, Herbert Edelsbrunner, and John Harer. “Stability of Persistence Diagrams.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2007. <a href=\"https://doi.org/10.1007/s00454-006-1276-5\">https://doi.org/10.1007/s00454-006-1276-5</a>.","ieee":"D. Cohen Steiner, H. Edelsbrunner, and J. Harer, “Stability of persistence diagrams,” <i>Discrete &#38; Computational Geometry</i>, vol. 37, no. 1. Springer, pp. 103–120, 2007.","ista":"Cohen Steiner D, Edelsbrunner H, Harer J. 2007. Stability of persistence diagrams. Discrete &#38; Computational Geometry. 37(1), 103–120."},"title":"Stability of persistence diagrams","publist_id":"2153","day":"01","author":[{"last_name":"Cohen Steiner","full_name":"Cohen-Steiner, David","first_name":"David"},{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"last_name":"Harer","first_name":"John","full_name":"Harer, John"}],"type":"journal_article","year":"2007","date_updated":"2021-01-12T07:53:34Z","doi":"10.1007/s00454-006-1276-5"},{"citation":{"ama":"Cohen Steiner D, Edelsbrunner H. Inequalities for the curvature of curves and surfaces. <i>Foundations of Computational Mathematics</i>. 2007;7(4):391-404. doi:<a href=\"https://doi.org/10.1007/s10208-005-0200-3\">10.1007/s10208-005-0200-3</a>","apa":"Cohen Steiner, D., &#38; Edelsbrunner, H. (2007). Inequalities for the curvature of curves and surfaces. <i>Foundations of Computational Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s10208-005-0200-3\">https://doi.org/10.1007/s10208-005-0200-3</a>","short":"D. Cohen Steiner, H. Edelsbrunner, Foundations of Computational Mathematics 7 (2007) 391–404.","mla":"Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature of Curves and Surfaces.” <i>Foundations of Computational Mathematics</i>, vol. 7, no. 4, Springer, 2007, pp. 391–404, doi:<a href=\"https://doi.org/10.1007/s10208-005-0200-3\">10.1007/s10208-005-0200-3</a>.","chicago":"Cohen Steiner, David, and Herbert Edelsbrunner. “Inequalities for the Curvature of Curves and Surfaces.” <i>Foundations of Computational Mathematics</i>. Springer, 2007. <a href=\"https://doi.org/10.1007/s10208-005-0200-3\">https://doi.org/10.1007/s10208-005-0200-3</a>.","ista":"Cohen Steiner D, Edelsbrunner H. 2007. Inequalities for the curvature of curves and surfaces. Foundations of Computational Mathematics. 7(4), 391–404.","ieee":"D. Cohen Steiner and H. Edelsbrunner, “Inequalities for the curvature of curves and surfaces,” <i>Foundations of Computational Mathematics</i>, vol. 7, no. 4. Springer, pp. 391–404, 2007."},"title":"Inequalities for the curvature of curves and surfaces","day":"01","publist_id":"2154","year":"2007","author":[{"first_name":"David","full_name":"Cohen-Steiner, David","last_name":"Cohen Steiner"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Herbert Edelsbrunner","first_name":"Herbert"}],"type":"journal_article","date_updated":"2021-01-12T07:53:34Z","doi":"10.1007/s10208-005-0200-3","page":"391 - 404","issue":"4","extern":1,"month":"11","_id":"3973","abstract":[{"text":"In this paper we bound the difference between the total mean curvatures of two closed surfaces in R-3 in terms of their total absolute curvatures and the Frechet distance between the volumes they enclose. The proof relies on a combination of methods from algebraic topology and integral geometry. We also bound the difference between the lengths of two curves using the same methods.","lang":"eng"}],"date_created":"2018-12-11T12:06:12Z","date_published":"2007-11-01T00:00:00Z","publisher":"Springer","publication_status":"published","quality_controlled":0,"publication":"Foundations of Computational Mathematics","volume":7,"status":"public","intvolume":"         7"},{"conference":{"name":"FOCS: Foundations of Computer Science"},"title":"Inferring local homology from sampled stratified spaces","citation":{"chicago":"Bendich, Paul, David Cohen Steiner, Herbert Edelsbrunner, John Harer, and Dmitriy Morozov. “Inferring Local Homology from Sampled Stratified Spaces,” 536–46. IEEE, 2007. <a href=\"https://doi.org/10.1109/FOCS.2007.33\">https://doi.org/10.1109/FOCS.2007.33</a>.","ista":"Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. 2007. Inferring local homology from sampled stratified spaces. FOCS: Foundations of Computer Science, 536–546.","ieee":"P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, and D. Morozov, “Inferring local homology from sampled stratified spaces,” presented at the FOCS: Foundations of Computer Science, 2007, pp. 536–546.","mla":"Bendich, Paul, et al. <i>Inferring Local Homology from Sampled Stratified Spaces</i>. IEEE, 2007, pp. 536–46, doi:<a href=\"https://doi.org/10.1109/FOCS.2007.33\">10.1109/FOCS.2007.33</a>.","short":"P. Bendich, D. Cohen Steiner, H. Edelsbrunner, J. Harer, D. Morozov, in:, IEEE, 2007, pp. 536–546.","ama":"Bendich P, Cohen Steiner D, Edelsbrunner H, Harer J, Morozov D. Inferring local homology from sampled stratified spaces. In: IEEE; 2007:536-546. doi:<a href=\"https://doi.org/10.1109/FOCS.2007.33\">10.1109/FOCS.2007.33</a>","apa":"Bendich, P., Cohen Steiner, D., Edelsbrunner, H., Harer, J., &#38; Morozov, D. (2007). Inferring local homology from sampled stratified spaces (pp. 536–546). Presented at the FOCS: Foundations of Computer Science, IEEE. <a href=\"https://doi.org/10.1109/FOCS.2007.33\">https://doi.org/10.1109/FOCS.2007.33</a>"},"year":"2007","type":"conference","author":[{"id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","last_name":"Bendich","full_name":"Paul Bendich","first_name":"Paul"},{"last_name":"Cohen Steiner","first_name":"David","full_name":"Cohen-Steiner, David"},{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Herbert Edelsbrunner","first_name":"Herbert"},{"full_name":"Harer, John","first_name":"John","last_name":"Harer"},{"first_name":"Dmitriy","full_name":"Morozov, Dmitriy","last_name":"Morozov"}],"publist_id":"2150","day":"01","doi":"10.1109/FOCS.2007.33","date_updated":"2021-01-12T07:53:35Z","page":"536 - 546","date_created":"2018-12-11T12:06:13Z","_id":"3975","abstract":[{"text":"We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a I-parameter family of neighborhoods of a point to assess the local homology of the stratified space at that point. We prove the correctness of this assessment under the assumption of a sufficiently dense sample. We also give an algorithm that constructs the vineyard and makes the local assessment in time at most cubic in the size of the Delaunay triangulation of the point sample.","lang":"eng"}],"date_published":"2007-01-01T00:00:00Z","extern":1,"month":"01","publication_status":"published","publisher":"IEEE","status":"public","quality_controlled":0},{"quality_controlled":0,"publication":"Journal of Proteome Research","volume":6,"intvolume":"         6","status":"public","publication_status":"published","publisher":"American Chemical Society","extern":1,"month":"06","abstract":[{"lang":"eng","text":"Herein, we study the interfaces of a set of 146 transient protein-protein interfaces in order to better understand the principles of their interactions. We define and generate the protein interface using tools from computational geometry and topology and then apply statistical analysis to its residue composition. In addition to counting individual occurrences, we evaluate pairing preferences, both across and as neighbors on one side of an interface. Likelihood correction emphasizes novel and unexpected pairs, such as the His-Cys pair found in most complexes of serine proteases with their diverse inhibitors and the Met-Met neighbor pair found in unrelated protein interfaces. We also present a visualization of the protein interface that allows for facile identification of residue-residue contacts and other biochemical properties."}],"_id":"3976","date_created":"2018-12-11T12:06:13Z","date_published":"2007-06-02T00:00:00Z","page":"2576 - 2586","issue":"7","date_updated":"2021-01-12T07:53:36Z","doi":"10.1021/pr070018+","day":"02","publist_id":"2151","year":"2007","author":[{"last_name":"Headd","first_name":"Jeffrey","full_name":"Headd, Jeffrey J"},{"full_name":"Ban, Y E Andrew","first_name":"Y E Andrew","last_name":"Ban"},{"last_name":"Brown","first_name":"Paul","full_name":"Brown, Paul"},{"full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Vaidya, Madhuwanti","first_name":"Madhuwanti","last_name":"Vaidya"},{"last_name":"Rudolph","full_name":"Rudolph, Johannes","first_name":"Johannes"}],"type":"journal_article","citation":{"short":"J. Headd, Y.E.A. Ban, P. Brown, H. Edelsbrunner, M. Vaidya, J. Rudolph, Journal of Proteome Research 6 (2007) 2576–2586.","apa":"Headd, J., Ban, Y. E. A., Brown, P., Edelsbrunner, H., Vaidya, M., &#38; Rudolph, J. (2007). Protein-protein interfaces: Properties, preferences, and projections. <i>Journal of Proteome Research</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/pr070018+\">https://doi.org/10.1021/pr070018+</a>","ama":"Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. Protein-protein interfaces: Properties, preferences, and projections. <i>Journal of Proteome Research</i>. 2007;6(7):2576-2586. doi:<a href=\"https://doi.org/10.1021/pr070018+\">10.1021/pr070018+</a>","ieee":"J. Headd, Y. E. A. Ban, P. Brown, H. Edelsbrunner, M. Vaidya, and J. Rudolph, “Protein-protein interfaces: Properties, preferences, and projections,” <i>Journal of Proteome Research</i>, vol. 6, no. 7. American Chemical Society, pp. 2576–2586, 2007.","ista":"Headd J, Ban YEA, Brown P, Edelsbrunner H, Vaidya M, Rudolph J. 2007. Protein-protein interfaces: Properties, preferences, and projections. Journal of Proteome Research. 6(7), 2576–2586.","chicago":"Headd, Jeffrey, Y E Andrew Ban, Paul Brown, Herbert Edelsbrunner, Madhuwanti Vaidya, and Johannes Rudolph. “Protein-Protein Interfaces: Properties, Preferences, and Projections.” <i>Journal of Proteome Research</i>. American Chemical Society, 2007. <a href=\"https://doi.org/10.1021/pr070018+\">https://doi.org/10.1021/pr070018+</a>.","mla":"Headd, Jeffrey, et al. “Protein-Protein Interfaces: Properties, Preferences, and Projections.” <i>Journal of Proteome Research</i>, vol. 6, no. 7, American Chemical Society, 2007, pp. 2576–86, doi:<a href=\"https://doi.org/10.1021/pr070018+\">10.1021/pr070018+</a>."},"title":"Protein-protein interfaces: Properties, preferences, and projections"},{"type":"journal_article","author":[{"full_name":"Attali, Dominique","first_name":"Dominique","last_name":"Attali"},{"first_name":"Herbert","full_name":"Herbert Edelsbrunner","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"year":"2007","day":"01","publist_id":"2152","title":"Inclusion-exclusion formulas from independent complexes","citation":{"short":"D. Attali, H. Edelsbrunner, Discrete &#38; Computational Geometry 37 (2007) 59–77.","apa":"Attali, D., &#38; Edelsbrunner, H. (2007). Inclusion-exclusion formulas from independent complexes. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-006-1274-7\">https://doi.org/10.1007/s00454-006-1274-7</a>","ama":"Attali D, Edelsbrunner H. Inclusion-exclusion formulas from independent complexes. <i>Discrete &#38; Computational Geometry</i>. 2007;37(1):59-77. doi:<a href=\"https://doi.org/10.1007/s00454-006-1274-7\">10.1007/s00454-006-1274-7</a>","ieee":"D. Attali and H. Edelsbrunner, “Inclusion-exclusion formulas from independent complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 37, no. 1. Springer, pp. 59–77, 2007.","ista":"Attali D, Edelsbrunner H. 2007. Inclusion-exclusion formulas from independent complexes. Discrete &#38; Computational Geometry. 37(1), 59–77.","chicago":"Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas from Independent Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2007. <a href=\"https://doi.org/10.1007/s00454-006-1274-7\">https://doi.org/10.1007/s00454-006-1274-7</a>.","mla":"Attali, Dominique, and Herbert Edelsbrunner. “Inclusion-Exclusion Formulas from Independent Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol. 37, no. 1, Springer, 2007, pp. 59–77, doi:<a href=\"https://doi.org/10.1007/s00454-006-1274-7\">10.1007/s00454-006-1274-7</a>."},"doi":"10.1007/s00454-006-1274-7","date_updated":"2021-01-12T07:53:36Z","abstract":[{"lang":"eng","text":"Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We exhibit abstract simplicial complexes that correspond to minimal inclusion-exclusion formulas. They include the dual complex, as defined in [3], and are characterized by the independence of their simplices and by geometric realizations with the same underlying space as the dual complex."}],"_id":"3977","date_published":"2007-01-01T00:00:00Z","date_created":"2018-12-11T12:06:14Z","month":"01","extern":1,"issue":"1","page":"59 - 77","intvolume":"        37","status":"public","volume":37,"publication":"Discrete & Computational Geometry","quality_controlled":0,"publisher":"Springer","publication_status":"published"},{"page":"386 - 397","extern":1,"month":"08","abstract":[{"lang":"eng","text":"Building on the work of Martinetz, Schulten and de Silva, Carlsson, we introduce a 2-parameter family of witness complexes and algorithms for constructing them. This family can be used to determine the gross topology of point cloud data in R-d or other metric spaces. The 2-parameter family is sensitive to differences in sampling density and thus amenable to detecting patterns within the data set. It also lends itself to theoretical analysis. For example, we can prove that in the limit, when the witnesses cover the entire domain, witness complexes in the family that share the first, scale parameter have the same homotopy type."}],"_id":"3981","date_created":"2018-12-11T12:06:15Z","date_published":"2007-08-21T00:00:00Z","publication_status":"published","publisher":"Springer","quality_controlled":0,"volume":4619,"intvolume":"      4619","status":"public","citation":{"mla":"Attali, Dominique, et al. <i>Alpha-Beta Witness Complexes</i>. Vol. 4619, Springer, 2007, pp. 386–97, doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_34\">10.1007/978-3-540-73951-7_34</a>.","ieee":"D. Attali, H. Edelsbrunner, J. Harer, and Y. Mileyko, “Alpha-beta witness complexes,” presented at the WADS: International Workshop on Algrithms and Data Structures, 2007, vol. 4619, pp. 386–397.","ista":"Attali D, Edelsbrunner H, Harer J, Mileyko Y. 2007. Alpha-beta witness complexes. WADS: International Workshop on Algrithms and Data Structures, LNCS, vol. 4619, 386–397.","chicago":"Attali, Dominique, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko. “Alpha-Beta Witness Complexes,” 4619:386–97. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_34\">https://doi.org/10.1007/978-3-540-73951-7_34</a>.","apa":"Attali, D., Edelsbrunner, H., Harer, J., &#38; Mileyko, Y. (2007). Alpha-beta witness complexes (Vol. 4619, pp. 386–397). Presented at the WADS: International Workshop on Algrithms and Data Structures, Springer. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_34\">https://doi.org/10.1007/978-3-540-73951-7_34</a>","ama":"Attali D, Edelsbrunner H, Harer J, Mileyko Y. Alpha-beta witness complexes. In: Vol 4619. Springer; 2007:386-397. doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_34\">10.1007/978-3-540-73951-7_34</a>","short":"D. Attali, H. Edelsbrunner, J. Harer, Y. Mileyko, in:, Springer, 2007, pp. 386–397."},"conference":{"name":"WADS: International Workshop on Algrithms and Data Structures"},"title":"Alpha-beta witness complexes","publist_id":"2149","day":"21","year":"2007","alternative_title":["LNCS"],"author":[{"first_name":"Dominique","full_name":"Attali, Dominique","last_name":"Attali"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Herbert Edelsbrunner"},{"first_name":"John","full_name":"Harer, John","last_name":"Harer"},{"last_name":"Mileyko","first_name":"Yuriy","full_name":"Mileyko, Yuriy"}],"type":"conference","acknowledgement":"Research by the authors is partially supported by DARPA under grant HR0011-05-1-0007, by CNRS under grant PICS-3416 and by IST Program of the EU under Contract IST-2002-506766.","date_updated":"2021-01-12T07:53:38Z","doi":"10.1007/978-3-540-73951-7_34"}]