[{"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","doi":"10.1109/TPAMI.2004.60","_id":"3178","intvolume":"        26","issue":"9","year":"2004","date_updated":"2021-01-12T07:41:36Z","publist_id":"3507","title":"An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision","citation":{"apa":"Boykov, Y., &#38; Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2004.60\">https://doi.org/10.1109/TPAMI.2004.60</a>","short":"Y. Boykov, V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 26 (2004) 1124–1137.","ama":"Boykov Y, Kolmogorov V. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2004;26(9):1124-1137. doi:<a href=\"https://doi.org/10.1109/TPAMI.2004.60\">10.1109/TPAMI.2004.60</a>","ieee":"Y. Boykov and V. Kolmogorov, “An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 26, no. 9. IEEE, pp. 1124–1137, 2004.","ista":"Boykov Y, Kolmogorov V. 2004. An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence. 26(9), 1124–1137.","chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2004. <a href=\"https://doi.org/10.1109/TPAMI.2004.60\">https://doi.org/10.1109/TPAMI.2004.60</a>.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 26, no. 9, IEEE, 2004, pp. 1124–37, doi:<a href=\"https://doi.org/10.1109/TPAMI.2004.60\">10.1109/TPAMI.2004.60</a>."},"date_created":"2018-12-11T12:01:51Z","date_published":"2004-09-01T00:00:00Z","status":"public","type":"journal_article","publisher":"IEEE","quality_controlled":0,"volume":26,"page":"1124 - 1137","extern":1,"month":"09","abstract":[{"text":"Minimum cut/maximum flow algorithms on graphs have emerged as an increasingly useful tool for exactor approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style &quot;push -relabel&quot; methods and algorithms based on Ford-Fulkerson style &quot;augmenting paths.&quot; We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes.","lang":"eng"}],"day":"01","publication_status":"published","author":[{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"first_name":"Vladimir","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}]},{"_id":"3179","doi":"10.1145/1015706.1015720","year":"2004","issue":"3","date_updated":"2021-01-12T07:41:36Z","date_created":"2018-12-11T12:01:51Z","title":"&quot;GrabCut&quot; - Interactive foreground extraction using iterated graph cuts ","publist_id":"3505","citation":{"apa":"Rother, C., Kolmogorov, V., &#38; Blake, A. (2004). &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts  (Vol. 23, pp. 309–314). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM. <a href=\"https://doi.org/10.1145/1015706.1015720\">https://doi.org/10.1145/1015706.1015720</a>","chicago":"Rother, Carsten, Vladimir Kolmogorov, and Andrew Blake. “&#38;quot;GrabCut&#38;quot; - Interactive Foreground Extraction Using Iterated Graph Cuts ,” 23:309–14. ACM, 2004. <a href=\"https://doi.org/10.1145/1015706.1015720\">https://doi.org/10.1145/1015706.1015720</a>.","mla":"Rother, Carsten, et al. <i>&#38;quot;GrabCut&#38;quot; - Interactive Foreground Extraction Using Iterated Graph Cuts </i>. Vol. 23, no. 3, ACM, 2004, pp. 309–14, doi:<a href=\"https://doi.org/10.1145/1015706.1015720\">10.1145/1015706.1015720</a>.","ista":"Rother C, Kolmogorov V, Blake A. 2004. &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts . SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 23, 309–314.","ama":"Rother C, Kolmogorov V, Blake A. &#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts . In: Vol 23. ACM; 2004:309-314. doi:<a href=\"https://doi.org/10.1145/1015706.1015720\">10.1145/1015706.1015720</a>","ieee":"C. Rother, V. Kolmogorov, and A. Blake, “&#38;quot;GrabCut&#38;quot; - Interactive foreground extraction using iterated graph cuts ,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 2004, vol. 23, no. 3, pp. 309–314.","short":"C. Rother, V. Kolmogorov, A. Blake, in:, ACM, 2004, pp. 309–314."},"intvolume":"        23","type":"conference","status":"public","date_published":"2004-08-01T00:00:00Z","publisher":"ACM","volume":23,"quality_controlled":0,"extern":1,"page":"309 - 314","publication_status":"published","author":[{"first_name":"Carsten","full_name":"Rother, Carsten","last_name":"Rother"},{"full_name":"Vladimir Kolmogorov","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"}],"month":"08","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"abstract":[{"text":"The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently, an approach based on optimization by graph-cut has been developed which successfully combines both types of information. In this paper we extend the graph-cut approach in three respects. First, we have developed a more powerful, iterative version of the optimisation. Secondly, the power of the iterative algorithm is used to simplify substantially the user interaction needed for a given quality of result. Thirdly, a robust algorithm for &quot;border matting&quot; has been developed to estimate simultaneously the alpha-matte around an object boundary and the colours of foreground pixels. We show that for moderately difficult examples the proposed method outperforms competitive tools.","lang":"eng"}],"main_file_link":[{"url":"http://research.microsoft.com/pubs/67890/siggraph04-grabcut.pdf","open_access":"0"}],"day":"01"},{"_id":"3208","doi":"10.1007/978-3-540-24638-1_23","date_created":"2018-12-11T12:02:01Z","citation":{"short":"U. Maurer, K.Z. Pietrzak, in:, Springer, 2004, pp. 410–427.","ama":"Maurer U, Pietrzak KZ. Composition of random systems: When two weak make one strong. In: Vol 2951. Springer; 2004:410-427. doi:<a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">10.1007/978-3-540-24638-1_23</a>","ieee":"U. Maurer and K. Z. Pietrzak, “Composition of random systems: When two weak make one strong,” presented at the TCC: Theory of Cryptography Conference, 2004, vol. 2951, pp. 410–427.","chicago":"Maurer, Ueli, and Krzysztof Z Pietrzak. “Composition of Random Systems: When Two Weak Make One Strong,” 2951:410–27. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">https://doi.org/10.1007/978-3-540-24638-1_23</a>.","ista":"Maurer U, Pietrzak KZ. 2004. Composition of random systems: When two weak make one strong. TCC: Theory of Cryptography Conference, LNCS, vol. 2951, 410–427.","mla":"Maurer, Ueli, and Krzysztof Z. Pietrzak. <i>Composition of Random Systems: When Two Weak Make One Strong</i>. Vol. 2951, Springer, 2004, pp. 410–27, doi:<a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">10.1007/978-3-540-24638-1_23</a>.","apa":"Maurer, U., &#38; Pietrzak, K. Z. (2004). Composition of random systems: When two weak make one strong (Vol. 2951, pp. 410–427). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-540-24638-1_23\">https://doi.org/10.1007/978-3-540-24638-1_23</a>"},"title":"Composition of random systems: When two weak make one strong","publist_id":"3471","year":"2004","date_updated":"2021-01-12T07:41:48Z","intvolume":"      2951","quality_controlled":0,"volume":2951,"page":"410 - 427","extern":1,"status":"public","type":"conference","date_published":"2004-03-19T00:00:00Z","publisher":"Springer","alternative_title":["LNCS"],"publication_status":"published","author":[{"last_name":"Maurer","full_name":"Maurer, Ueli M","first_name":"Ueli"},{"first_name":"Krzysztof Z","full_name":"Krzysztof Pietrzak","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"A new technique for proving the adaptive indistinguishability of two systems, each composed of some component systems, is presented, using only the fact that corresponding component systems are non-adaptively indistinguishable. The main tool is the definition of a special monotone condition for a random system F, relative to another random system G, whose probability of occurring for a given distinguisher D is closely related to the distinguishing advantage ε of D for F and G, namely it is lower and upper bounded by ε and (1+ln1), respectively.\nA concrete instantiation of this result shows that the cascade of two random permutations (with the second one inverted) is indistinguishable from a uniform random permutation by adaptive distinguishers which may query the system from both sides, assuming the components’ security only against non-adaptive one-sided distinguishers.\nAs applications we provide some results in various fields as almost k-wise independent probability spaces, decorrelation theory and computational indistinguishability (i.e., pseudo-randomness).","lang":"eng"}],"day":"19","month":"03","conference":{"name":"TCC: Theory of Cryptography Conference"}},{"intvolume":"        12","date_created":"2018-12-11T12:03:14Z","citation":{"apa":"Janovjak, H. L., Struckmeier, J., Hubain, M., Kessler, M., Kedrov, A., &#38; Mueller, D. (2004). Probing the energy landscape of the membrane protein bacteriorhodopsin. <i>Structure</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.str.2004.03.016\">https://doi.org/10.1016/j.str.2004.03.016</a>","short":"H.L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, D. Mueller, Structure 12 (2004) 871–879.","ama":"Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. Probing the energy landscape of the membrane protein bacteriorhodopsin. <i>Structure</i>. 2004;12(5):871-879. doi:<a href=\"https://doi.org/10.1016/j.str.2004.03.016\">10.1016/j.str.2004.03.016</a>","ieee":"H. L. Janovjak, J. Struckmeier, M. Hubain, M. Kessler, A. Kedrov, and D. Mueller, “Probing the energy landscape of the membrane protein bacteriorhodopsin,” <i>Structure</i>, vol. 12, no. 5. Cell Press, pp. 871–879, 2004.","chicago":"Janovjak, Harald L, Jens Struckmeier, Maurice Hubain, Max Kessler, Alexej Kedrov, and Daniel Mueller. “Probing the Energy Landscape of the Membrane Protein Bacteriorhodopsin.” <i>Structure</i>. Cell Press, 2004. <a href=\"https://doi.org/10.1016/j.str.2004.03.016\">https://doi.org/10.1016/j.str.2004.03.016</a>.","ista":"Janovjak HL, Struckmeier J, Hubain M, Kessler M, Kedrov A, Mueller D. 2004. Probing the energy landscape of the membrane protein bacteriorhodopsin. Structure. 12(5), 871–879.","mla":"Janovjak, Harald L., et al. “Probing the Energy Landscape of the Membrane Protein Bacteriorhodopsin.” <i>Structure</i>, vol. 12, no. 5, Cell Press, 2004, pp. 871–79, doi:<a href=\"https://doi.org/10.1016/j.str.2004.03.016\">10.1016/j.str.2004.03.016</a>."},"publist_id":"2982","title":"Probing the energy landscape of the membrane protein bacteriorhodopsin","issue":"5","year":"2004","date_updated":"2021-01-12T07:43:20Z","doi":"10.1016/j.str.2004.03.016","publication":"Structure","_id":"3419","abstract":[{"lang":"eng","text":"The folding and stability of transmembrane proteins is a fundamental and unsolved biological problem. Here, single bacteriorhodopsin molecules were mechanically unfolded from native purple membranes using atomic force microscopy and force spectroscopy. The energy landscape of individual transmembrane α helices and polypeptide loops was mapped by monitoring the pulling speed dependence of the unfolding forces and applying Monte Carlo simulations. Single helices formed independently stable units stabilized by a single potential barrier. Mechanical unfolding of the helices was triggered by 3.9–7.7 Å extension, while natural unfolding rates were of the order of 10−3 s−1. Besides acting as individually stable units, helices associated pairwise, establishing a collective potential barrier. The unfolding pathways of individual proteins reflect distinct pulling speed-dependent unfolding routes in their energy landscapes. These observations support the two-stage model of membrane protein folding in which α helices insert into the membrane as stable units and then assemble into the functional protein."}],"day":"01","month":"05","publication_status":"published","author":[{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","orcid":"0000-0002-8023-9315","full_name":"Harald Janovjak","first_name":"Harald L"},{"last_name":"Struckmeier","full_name":"Struckmeier, Jens","first_name":"Jens"},{"last_name":"Hubain","first_name":"Maurice","full_name":"Hubain, Maurice"},{"first_name":"Max","full_name":"Kessler, Max","last_name":"Kessler"},{"full_name":"Kedrov, Alexej","first_name":"Alexej","last_name":"Kedrov"},{"last_name":"Mueller","full_name":"Mueller, Daniel J","first_name":"Daniel"}],"volume":12,"quality_controlled":0,"extern":1,"page":"871 - 879","status":"public","date_published":"2004-05-01T00:00:00Z","type":"journal_article","publisher":"Cell Press"},{"author":[{"last_name":"Kedrov","full_name":"Kedrov, Alexej","first_name":"Alexej"},{"last_name":"Ziegler","full_name":"Ziegler,  Christine","first_name":"Christine"},{"orcid":"0000-0002-8023-9315","last_name":"Janovjak","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Harald Janovjak","first_name":"Harald L"},{"full_name":"Kühlbrandt, Werner","first_name":"Werner","last_name":"Kühlbrandt"},{"full_name":"Mueller, Daniel J","first_name":"Daniel","last_name":"Mueller"}],"publication_status":"published","month":"07","abstract":[{"text":"Single-molecule force-spectroscopy was employed to unfold and refold single sodium-proton antiporters (NhaA) of Escherichia coli from membrane patches. Although transmembrane α-helices and extracellular polypeptide loops exhibited sufficient stability to individually establish potential barriers against unfolding, two helices predominantly unfolded pairwise, thereby acting as one structural unit. Many of the potential barriers were detected unfolding NhaA either from the C-terminal or the N-terminal end. It was found that some molecular interactions stabilizing secondary structural elements were directional, while others were not. Additionally, some interactions appeared to occur between the secondary structural elements. After unfolding ten of the 12 helices, the extracted polypeptide was allowed to refold back into the membrane. After five seconds, the refolded polypeptide established all secondary structure elements of the native protein. One helical pair showed a characteristic spring like “snap in” into its folded conformation, while the refolding process of other helices was not detected in particular. Additionally, individual helices required characteristic periods of time to fold. Correlating these results with the primary structure of NhaA allowed us to obtain the first insights into how potential barriers establish and determine the folding kinetics of the secondary structure elements.","lang":"eng"}],"day":"23","status":"public","date_published":"2004-07-23T00:00:00Z","type":"journal_article","publisher":"Elsevier","volume":340,"quality_controlled":0,"extern":1,"page":"1143 - 1152","issue":"5","year":"2004","date_updated":"2021-01-12T07:43:21Z","publist_id":"2981","citation":{"apa":"Kedrov, A., Ziegler, C., Janovjak, H. L., Kühlbrandt, W., &#38; Mueller, D. (2004). Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">https://doi.org/10.1016/j.jmb.2004.05.026</a>","chicago":"Kedrov, Alexej, Christine Ziegler, Harald L Janovjak, Werner Kühlbrandt, and Daniel Mueller. “Controlled Unfolding and Refolding of a Single Sodium/Proton Antiporter Using Atomic Force Microscopy.” <i>Journal of Molecular Biology</i>. Elsevier, 2004. <a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">https://doi.org/10.1016/j.jmb.2004.05.026</a>.","ista":"Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. 2004. Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy. Journal of Molecular Biology. 340(5), 1143–1152.","mla":"Kedrov, Alexej, et al. “Controlled Unfolding and Refolding of a Single Sodium/Proton Antiporter Using Atomic Force Microscopy.” <i>Journal of Molecular Biology</i>, vol. 340, no. 5, Elsevier, 2004, pp. 1143–52, doi:<a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">10.1016/j.jmb.2004.05.026</a>.","short":"A. Kedrov, C. Ziegler, H.L. Janovjak, W. Kühlbrandt, D. Mueller, Journal of Molecular Biology 340 (2004) 1143–1152.","ieee":"A. Kedrov, C. Ziegler, H. L. Janovjak, W. Kühlbrandt, and D. Mueller, “Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy,” <i>Journal of Molecular Biology</i>, vol. 340, no. 5. Elsevier, pp. 1143–1152, 2004.","ama":"Kedrov A, Ziegler C, Janovjak HL, Kühlbrandt W, Mueller D. Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy. <i>Journal of Molecular Biology</i>. 2004;340(5):1143-1152. doi:<a href=\"https://doi.org/10.1016/j.jmb.2004.05.026\">10.1016/j.jmb.2004.05.026</a>"},"title":"Controlled unfolding and refolding of a single sodium/proton antiporter using atomic force microscopy","date_created":"2018-12-11T12:03:14Z","intvolume":"       340","_id":"3420","publication":"Journal of Molecular Biology","doi":"10.1016/j.jmb.2004.05.026"},{"publication_status":"published","author":[{"full_name":"Herbert Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"}],"month":"04","day":"15","main_file_link":[{"open_access":"0","url":"http://www.cs.duke.edu/~edels/Papers/2004-B-01-BiologicalApplicationsTopology.pdf"}],"publisher":"CRC Press","status":"public","type":"book_chapter","date_published":"2004-04-15T00:00:00Z","page":"1395 - 1412","extern":1,"quality_controlled":0,"date_updated":"2021-01-12T07:44:24Z","year":"2004","publist_id":"2811","title":"Biological applications of computational topology","date_created":"2018-12-11T12:04:02Z","citation":{"apa":"Edelsbrunner, H. (2004). Biological applications of computational topology. In <i>Handbook of Discrete and Computational Geometry</i> (pp. 1395–1412). CRC Press.","ista":"Edelsbrunner H. 2004.Biological applications of computational topology. In: Handbook of Discrete and Computational Geometry. , 1395–1412.","chicago":"Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” In <i>Handbook of Discrete and Computational Geometry</i>, 1395–1412. CRC Press, 2004.","mla":"Edelsbrunner, Herbert. “Biological Applications of Computational Topology.” <i>Handbook of Discrete and Computational Geometry</i>, CRC Press, 2004, pp. 1395–412.","short":"H. Edelsbrunner, in:, Handbook of Discrete and Computational Geometry, CRC Press, 2004, pp. 1395–1412.","ieee":"H. Edelsbrunner, “Biological applications of computational topology,” in <i>Handbook of Discrete and Computational Geometry</i>, CRC Press, 2004, pp. 1395–1412.","ama":"Edelsbrunner H. Biological applications of computational topology. In: <i>Handbook of Discrete and Computational Geometry</i>. CRC Press; 2004:1395-1412."},"_id":"3574","publication":"Handbook of Discrete and Computational Geometry"},{"intvolume":"       312","date_updated":"2021-01-12T07:44:24Z","year":"2004","publist_id":"2810","title":"Jacobi sets of multiple Morse functions","date_created":"2018-12-11T12:04:02Z","citation":{"apa":"Edelsbrunner, H., &#38; Harer, J. (2004). Jacobi sets of multiple Morse functions. In <i>Foundations of Computational Mathematics</i> (Vol. 312, pp. 37–57). Springer. <a href=\"https://doi.org/10.1017/CBO9781139106962.003\">https://doi.org/10.1017/CBO9781139106962.003</a>","ama":"Edelsbrunner H, Harer J. Jacobi sets of multiple Morse functions. In: <i>Foundations of Computational Mathematics</i>. Vol 312. Springer; 2004:37-57. doi:<a href=\"https://doi.org/10.1017/CBO9781139106962.003\">10.1017/CBO9781139106962.003</a>","ieee":"H. Edelsbrunner and J. Harer, “Jacobi sets of multiple Morse functions,” in <i>Foundations of Computational Mathematics</i>, vol. 312, Springer, 2004, pp. 37–57.","short":"H. Edelsbrunner, J. Harer, in:, Foundations of Computational Mathematics, Springer, 2004, pp. 37–57.","mla":"Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.” <i>Foundations of Computational Mathematics</i>, vol. 312, Springer, 2004, pp. 37–57, doi:<a href=\"https://doi.org/10.1017/CBO9781139106962.003\">10.1017/CBO9781139106962.003</a>.","ista":"Edelsbrunner H, Harer J. 2004.Jacobi sets of multiple Morse functions. In: Foundations of Computational Mathematics. London Mathematical Society Lecture Note, vol. 312, 37–57.","chicago":"Edelsbrunner, Herbert, and John Harer. “Jacobi Sets of Multiple Morse Functions.” In <i>Foundations of Computational Mathematics</i>, 312:37–57. Springer, 2004. <a href=\"https://doi.org/10.1017/CBO9781139106962.003\">https://doi.org/10.1017/CBO9781139106962.003</a>."},"publication":"Foundations of Computational Mathematics","doi":"10.1017/CBO9781139106962.003","_id":"3575","month":"01","day":"01","abstract":[{"lang":"eng","text":"The Jacobi set of two Morse functions defined on a common - manifold is the set of critical points of the restrictions of one func- tion to the level sets of the other function. Equivalently, it is the set of points where the gradients of the functions are parallel. For a generic pair of Morse functions, the Jacobi set is a smoothly embed- ded 1-manifold. We give a polynomial-time algorithm that com- putes the piecewise linear analog of the Jacobi set for functions specified at the vertices of a triangulation, and we generalize all results to more than two but at most Morse functions."}],"publication_status":"published","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner","first_name":"Herbert"},{"last_name":"Harer","first_name":"John","full_name":"Harer, John"}],"alternative_title":["London Mathematical Society Lecture Note"],"publisher":"Springer","type":"book_chapter","status":"public","date_published":"2004-01-01T00:00:00Z","extern":1,"page":"37 - 57","quality_controlled":0,"volume":312},{"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","day":"01","author":[{"last_name":"Ulrich","first_name":"Florian","full_name":"Ulrich, Florian"},{"last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J"}],"publication_status":"published","date_published":"2004-11-01T00:00:00Z","type":"book_chapter","status":"public","alternative_title":["Molecular Aspects of Fish and Marine Biology"],"publisher":"World Scientific Publishing","volume":2,"page":"39 - 86","extern":"1","editor":[{"full_name":"Korzh, Vladimir","first_name":"Vladimir","last_name":"Korzh"},{"full_name":"Gong, Zhiyuan","first_name":"Zhiyuan","last_name":"Gong"}],"intvolume":"         2","article_processing_charge":"No","year":"2004","date_updated":"2021-01-12T07:44:29Z","title":"Gastrulation in zebrafish","publist_id":"2796","date_created":"2018-12-11T12:04:06Z","citation":{"short":"F. Ulrich, C.-P.J. Heisenberg, in:, V. Korzh, Z. Gong (Eds.), Fish Development and Genetics : The Zebrafish and Medaka Models, World Scientific Publishing, 2004, pp. 39–86.","ieee":"F. Ulrich and C.-P. J. Heisenberg, “Gastrulation in zebrafish,” in <i>Fish development and genetics : the zebrafish and medaka models</i>, vol. 2, V. Korzh and Z. Gong, Eds. World Scientific Publishing, 2004, pp. 39–86.","ama":"Ulrich F, Heisenberg C-PJ. Gastrulation in zebrafish. In: Korzh V, Gong Z, eds. <i>Fish Development and Genetics : The Zebrafish and Medaka Models</i>. Vol 2. World Scientific Publishing; 2004:39-86.","mla":"Ulrich, Florian, and Carl-Philipp J. Heisenberg. “Gastrulation in Zebrafish.” <i>Fish Development and Genetics : The Zebrafish and Medaka Models</i>, edited by Vladimir Korzh and Zhiyuan Gong, vol. 2, World Scientific Publishing, 2004, pp. 39–86.","ista":"Ulrich F, Heisenberg C-PJ. 2004.Gastrulation in zebrafish. In: Fish development and genetics : the zebrafish and medaka models. Molecular Aspects of Fish and Marine Biology, vol. 2, 39–86.","chicago":"Ulrich, Florian, and Carl-Philipp J Heisenberg. “Gastrulation in Zebrafish.” In <i>Fish Development and Genetics : The Zebrafish and Medaka Models</i>, edited by Vladimir Korzh and Zhiyuan Gong, 2:39–86. World Scientific Publishing, 2004.","apa":"Ulrich, F., &#38; Heisenberg, C.-P. J. (2004). Gastrulation in zebrafish. In V. Korzh &#38; Z. Gong (Eds.), <i>Fish development and genetics : the zebrafish and medaka models</i> (Vol. 2, pp. 39–86). World Scientific Publishing."},"publication":"Fish development and genetics : the zebrafish and medaka models","_id":"3587","language":[{"iso":"eng"}]},{"month":"03","abstract":[{"lang":"eng","text":"Genome sizes vary enormously. This variation in DNA content correlates with effective population size, suggesting that deleterious additions to the genome can accumulate in small populations. On this view, the increased complexity of biological functions associated with large genomes partly reflects evolutionary degeneration."}],"day":"01","publication_status":"published","author":[{"first_name":"Brian","full_name":"Charlesworth, Brian","last_name":"Charlesworth"},{"first_name":"Nicholas H","full_name":"Nicholas Barton","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"date_published":"2004-03-01T00:00:00Z","type":"review","status":"public","publisher":"Cell Press","volume":14,"quality_controlled":0,"page":"R233 - R235","extern":1,"intvolume":"        14","issue":"6","year":"2004","date_updated":"2019-04-26T07:22:31Z","publist_id":"2788","date_created":"2018-12-11T12:04:09Z","title":"Genome size: Does bigger mean worse?","citation":{"apa":"Charlesworth, B., &#38; Barton, N. H. (2004). Genome size: Does bigger mean worse? <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">https://doi.org/10.1016/j.cub.2004.02.054</a>","ama":"Charlesworth B, Barton NH. Genome size: Does bigger mean worse? <i>Current Biology</i>. 2004;14(6):R233-R235. doi:<a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">10.1016/j.cub.2004.02.054</a>","ieee":"B. Charlesworth and N. H. Barton, “Genome size: Does bigger mean worse?,” <i>Current Biology</i>, vol. 14, no. 6. Cell Press, pp. R233–R235, 2004.","short":"B. Charlesworth, N.H. Barton, Current Biology 14 (2004) R233–R235.","chicago":"Charlesworth, Brian, and Nicholas H Barton. “Genome Size: Does Bigger Mean Worse?” <i>Current Biology</i>. Cell Press, 2004. <a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">https://doi.org/10.1016/j.cub.2004.02.054</a>.","mla":"Charlesworth, Brian, and Nicholas H. Barton. “Genome Size: Does Bigger Mean Worse?” <i>Current Biology</i>, vol. 14, no. 6, Cell Press, 2004, pp. R233–35, doi:<a href=\"https://doi.org/10.1016/j.cub.2004.02.054\">10.1016/j.cub.2004.02.054</a>.","ista":"Charlesworth B, Barton NH. 2004. Genome size: Does bigger mean worse? Current Biology. 14(6), R233–R235."},"publication":"Current Biology","doi":"10.1016/j.cub.2004.02.054","_id":"3595"},{"author":[{"full_name":"Nicholas Barton","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"},{"last_name":"Turelli","full_name":"Turelli, Michael","first_name":"Michael"}],"publication_status":"published","month":"10","day":"01","abstract":[{"text":"We analyze the changes in the mean and variance components of a quantitative trait caused by changes in allele frequencies, concentrating on the effects of genetic drift. We use a general representation of epistasis and dominance that allows an arbitrary relation between genotype and phenotype for any number of diallelic loci. We assume initial and final Hardy-Weinberg and linkage equilibrium in our analyses of drift-induced changes. Random drift generates transient linkage disequilibria that cause correlations between allele frequency fluctuations at different loci. However, we show that these have negligible effects, at least for interactions among small numbers of loci. Our analyses are based on diffusion approximations that summarize the effects of drift in terms of F, the inbreeding coefficient, interpreted as the expected proportional decrease in heterozygosity at each locus. For haploids, the variance of the trait mean after a population bottleneck is var(Δ&amp;#x007a;̄) =inline imagewhere n is the number of loci contributing to the trait variance, VA(1)=VA is the additive genetic variance, and VA(k) is the kth-order additive epistatic variance. The expected additive genetic variance after the bottleneck, denoted (V*A), is closely related to var(Δ&amp;#x007a;̄); (V*A) (1 –F)inline imageThus, epistasis inflates the expected additive variance above VA(1 –F), the expectation under additivity. For haploids (and diploids without dominance), the expected value of every variance component is inflated by the existence of higher order interactions (e.g., third-order epistasis inflates (V*AA)). This is not true in general with diploidy, because dominance alone can reduce (V*A) below VA(1 –F) (e.g., when dominant alleles are rare). Without dominance, diploidy produces simple expressions: var(Δ&amp;#x007a;̄)=inline image=1 (2F) kVA(k) and (V*A) = (1 –F)inline imagek(2F)k-1VA(k) With dominance (and even without epistasis), var(Δ&amp;#x007a;̄)and (V*A) no longer depend solely on the variance components in the base population. For small F, the expected additive variance simplifies to (V*A)(1 –F) VA+ 4FVAA+2FVD+2FCAD, where CAD is a sum of two terms describing covariances between additive effects and dominance and additive × dominance interactions. Whether population bottlenecks lead to expected increases in additive variance depends primarily on the ratio of nonadditive to additive genetic variance in the base population, but dominance precludes simple predictions based solely on variance components. We illustrate these results using a model in which genotypic values are drawn at random, allowing extreme and erratic epistatic interactions. Although our analyses clarify the conditions under which drift is expected to increase VA, we question the evolutionary importance of such increases.","lang":"eng"}],"publisher":"Wiley-Blackwell","status":"public","type":"journal_article","date_published":"2004-10-01T00:00:00Z","extern":1,"page":"2111 - 2132","quality_controlled":0,"volume":58,"date_updated":"2021-01-12T07:44:40Z","year":"2004","issue":"10","citation":{"ista":"Barton NH, Turelli M. 2004. Effects of allele frequency changes on variance components under a general model of epistasis. Evolution; International Journal of Organic Evolution. 58(10), 2111–2132.","chicago":"Barton, Nicholas H, and Michael Turelli. “Effects of Allele Frequency Changes on Variance Components under a General Model of Epistasis.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 2004. <a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">https://doi.org/10.1111/j.0014-3820.2004.tb01591.x</a>.","mla":"Barton, Nicholas H., and Michael Turelli. “Effects of Allele Frequency Changes on Variance Components under a General Model of Epistasis.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 58, no. 10, Wiley-Blackwell, 2004, pp. 2111–32, doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">10.1111/j.0014-3820.2004.tb01591.x</a>.","short":"N.H. Barton, M. Turelli, Evolution; International Journal of Organic Evolution 58 (2004) 2111–2132.","ama":"Barton NH, Turelli M. Effects of allele frequency changes on variance components under a general model of epistasis. <i>Evolution; International Journal of Organic Evolution</i>. 2004;58(10):2111-2132. doi:<a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">10.1111/j.0014-3820.2004.tb01591.x</a>","ieee":"N. H. Barton and M. Turelli, “Effects of allele frequency changes on variance components under a general model of epistasis,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 58, no. 10. Wiley-Blackwell, pp. 2111–2132, 2004.","apa":"Barton, N. H., &#38; Turelli, M. (2004). Effects of allele frequency changes on variance components under a general model of epistasis. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.0014-3820.2004.tb01591.x\">https://doi.org/10.1111/j.0014-3820.2004.tb01591.x</a>"},"date_created":"2018-12-11T12:04:15Z","title":"Effects of allele frequency changes on variance components under a general model of epistasis","publist_id":"2769","intvolume":"        58","_id":"3614","publication":"Evolution; International Journal of Organic Evolution","doi":"10.1111/j.0014-3820.2004.tb01591.x"},{"abstract":[{"text":"We investigate three alternative selection-based scenarios proposed to maintain polygenic variation: pleiotropic balancing selection, G x E interactions (with spatial or temporal variation in allelic effects), and sex-dependent allelic effects. Each analysis assumes an additive polygenic trait with n diallelic loci under stabilizing selection. We allow loci to have different effects and consider equilibria at which the population mean departs from the stabilizing-selection optimum. Under weak selection, each model produces essentially identical, approximate allele-frequency dynamics. Variation is maintained under pleiotropic balancing selection only at loci for which the strength of balancing selection exceeds the effective strength of stabilizing selection. In addition, for all models, polymorphism requires that the population mean be close enough to the optimum that directional selection does not overwhelm balancing selection. This balance allows many simultaneously stable equilibria, and we explore their properties numerically. Both spatial and temporal G x E can maintain variation at loci for which the coefficient of variation (across environments) of the effect of a substitution exceeds a critical value greater than one. The critical value depends on the correlation between substitution effects at different loci. For large positive correlations (e.g., ρ2ij &gt; 3/4), even extreme fluctuations in allelic effects cannot maintain variation. Surprisingly, this constraint on correlations implies that sex-dependent allelic effects cannot maintain polygenic variation. We present numerical results that support our analytical approximations and discuss our results in connection to relevant data and alternative variance-maintaining mechanisms.","lang":"eng"}],"day":"01","month":"02","author":[{"full_name":"Turelli, Michael","first_name":"Michael","last_name":"Turelli"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","full_name":"Nicholas Barton","first_name":"Nicholas H"}],"publication_status":"published","volume":166,"quality_controlled":0,"page":"1053 - 1079","extern":1,"type":"journal_article","date_published":"2004-02-01T00:00:00Z","status":"public","publisher":"Genetics Society of America","intvolume":"       166","date_created":"2018-12-11T12:04:15Z","title":"Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions","publist_id":"2768","citation":{"apa":"Turelli, M., &#38; Barton, N. H. (2004). Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.166.2.1053\">https://doi.org/10.1534/genetics.166.2.1053</a>","short":"M. Turelli, N.H. Barton, Genetics 166 (2004) 1053–1079.","ieee":"M. Turelli and N. H. Barton, “Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions,” <i>Genetics</i>, vol. 166, no. 2. Genetics Society of America, pp. 1053–1079, 2004.","ama":"Turelli M, Barton NH. Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions. <i>Genetics</i>. 2004;166(2):1053-1079. doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1053\">10.1534/genetics.166.2.1053</a>","ista":"Turelli M, Barton NH. 2004. Polygenic variation maintained by balancing selection: pleiotropy, sex-dependent allelic effects and GxE interactions. Genetics. 166(2), 1053–1079.","mla":"Turelli, Michael, and Nicholas H. Barton. “Polygenic Variation Maintained by Balancing Selection: Pleiotropy, Sex-Dependent Allelic Effects and GxE Interactions.” <i>Genetics</i>, vol. 166, no. 2, Genetics Society of America, 2004, pp. 1053–79, doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1053\">10.1534/genetics.166.2.1053</a>.","chicago":"Turelli, Michael, and Nicholas H Barton. “Polygenic Variation Maintained by Balancing Selection: Pleiotropy, Sex-Dependent Allelic Effects and GxE Interactions.” <i>Genetics</i>. Genetics Society of America, 2004. <a href=\"https://doi.org/10.1534/genetics.166.2.1053\">https://doi.org/10.1534/genetics.166.2.1053</a>."},"issue":"2","year":"2004","date_updated":"2021-01-12T07:44:41Z","doi":"10.1534/genetics.166.2.1053","publication":"Genetics","_id":"3615"},{"publication":"Current Biology","doi":"10.1016/j.cub.2004.07.037","_id":"3616","intvolume":"        14","year":"2004","issue":"15","date_updated":"2019-04-26T07:22:31Z","date_created":"2018-12-11T12:04:16Z","citation":{"short":"N.H. Barton, Current Biology 14 (2004) R603–R604.","ama":"Barton NH. Speciation: Why, how, where and when? <i>Current Biology</i>. 2004;14(15):R603-R604. doi:<a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">10.1016/j.cub.2004.07.037</a>","ieee":"N. H. Barton, “Speciation: Why, how, where and when?,” <i>Current Biology</i>, vol. 14, no. 15. Cell Press, pp. R603–R604, 2004.","chicago":"Barton, Nicholas H. “Speciation: Why, How, Where and When?” <i>Current Biology</i>. Cell Press, 2004. <a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">https://doi.org/10.1016/j.cub.2004.07.037</a>.","mla":"Barton, Nicholas H. “Speciation: Why, How, Where and When?” <i>Current Biology</i>, vol. 14, no. 15, Cell Press, 2004, pp. R603–04, doi:<a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">10.1016/j.cub.2004.07.037</a>.","ista":"Barton NH. 2004. Speciation: Why, how, where and when? Current Biology. 14(15), R603–R604.","apa":"Barton, N. H. (2004). Speciation: Why, how, where and when? <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2004.07.037\">https://doi.org/10.1016/j.cub.2004.07.037</a>"},"publist_id":"2767","title":"Speciation: Why, how, where and when?","status":"public","type":"review","date_published":"2004-08-10T00:00:00Z","publisher":"Cell Press","volume":14,"quality_controlled":0,"extern":1,"page":"R603 - R604","month":"08","day":"10","publication_status":"published","author":[{"first_name":"Nicholas H","full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"}]},{"date_updated":"2021-01-12T07:44:41Z","issue":"2","year":"2004","publist_id":"2766","title":"The effect of selection on genealogies","date_created":"2018-12-11T12:04:16Z","citation":{"apa":"Barton, N. H., &#38; Etheridge, A. (2004). The effect of selection on genealogies. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.166.2.1115\">https://doi.org/10.1534/genetics.166.2.1115</a>","ama":"Barton NH, Etheridge A. The effect of selection on genealogies. <i>Genetics</i>. 2004;166(2):1115-1131. doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1115\">10.1534/genetics.166.2.1115</a>","ieee":"N. H. Barton and A. Etheridge, “The effect of selection on genealogies,” <i>Genetics</i>, vol. 166, no. 2. Genetics Society of America, pp. 1115–1131, 2004.","short":"N.H. Barton, A. Etheridge, Genetics 166 (2004) 1115–1131.","mla":"Barton, Nicholas H., and Alison Etheridge. “The Effect of Selection on Genealogies.” <i>Genetics</i>, vol. 166, no. 2, Genetics Society of America, 2004, pp. 1115–31, doi:<a href=\"https://doi.org/10.1534/genetics.166.2.1115\">10.1534/genetics.166.2.1115</a>.","ista":"Barton NH, Etheridge A. 2004. The effect of selection on genealogies. Genetics. 166(2), 1115–1131.","chicago":"Barton, Nicholas H, and Alison Etheridge. “The Effect of Selection on Genealogies.” <i>Genetics</i>. Genetics Society of America, 2004. <a href=\"https://doi.org/10.1534/genetics.166.2.1115\">https://doi.org/10.1534/genetics.166.2.1115</a>."},"intvolume":"       166","_id":"3617","publication":"Genetics","doi":"10.1534/genetics.166.2.1115","author":[{"first_name":"Nicholas H","full_name":"Nicholas Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton"},{"last_name":"Etheridge","full_name":"Etheridge, Alison M","first_name":"Alison"}],"publication_status":"published","month":"02","day":"01","abstract":[{"lang":"eng","text":"The coalescent process can describe the effects of selection at linked loci only if selection is so strong that genotype frequencies evolve deterministically. Here, we develop methods proposed by Kaplan, Darden, and Hudson to find the effects of weak selection. We show that the overall effect is given by an extension to Price's equation: the change in properties such as moments of coalescence times is equal to the covariance between those properties and the fitness of the sample of genes. The distribution of coalescence times differs substantially between allelic classes, even in the absence of selection. However, the average coalescence time between randomly chosen genes is insensitive to the current allele frequency and is affected significantly by purifying selection only if deleterious mutations are common and selection is strong (i.e., the product of population size and selection coefficient, Ns &gt; 3). Balancing selection increases mean coalescence times, but the effect becomes large only when mutation rates between allelic classes are low and when selection is extremely strong. Our analysis supports previous simulations that show that selection has surprisingly little effect on genealogies. Moreover, small fluctuations in allele frequency due to random drift can greatly reduce any such effects. This will make it difficult to detect the action of selection from neutral variation alone."}],"publisher":"Genetics Society of America","date_published":"2004-02-01T00:00:00Z","status":"public","type":"journal_article","page":"1115 - 1131","extern":1,"quality_controlled":0,"volume":166},{"quality_controlled":0,"extern":1,"page":"198 - 200","status":"public","type":"conference","date_published":"2004-01-01T00:00:00Z","publisher":"ACM","author":[{"last_name":"Ulges","full_name":"Ulges, Adrian","first_name":"Adrian"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Christoph Lampert"},{"last_name":"Breuel","full_name":"Breuel,Thomas M","first_name":"Thomas"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Capturing images of documents using handheld digital cameras has a variety of applications in academia, research, knowledge management, retail, and office settings. The ultimate goal of such systems is to achieve image quality comparable to that currently achieved with flatbed scanners even for curved, warped, or curled pages. This can be achieved by high-accuracy 3D modeling of the page surface, followed by a &quot;flattening&quot; of the surface. A number of previous systems have either assumed only perspective distortions, or used techniques like structured lighting, shading, or side-imaging for obtaining 3D shape. This paper describes a system for handheld camera-based document capture using general purpose stereo vision methods followed by a new document dewarping technique. Examples of shape modeling and dewarping of book images is shown."}],"day":"01","main_file_link":[{"open_access":"0","url":"http://pub.ist.ac.at/~chl/papers/ulges-doceng2004.pdf"}],"month":"01","conference":{"name":"DocEng: ACM Symposium on Document Engineering"},"_id":"3688","doi":"10.1145/1030397.1030434","publist_id":"2679","title":"Document capture using stereo vision","citation":{"apa":"Ulges, A., Lampert, C., &#38; Breuel, T. (2004). Document capture using stereo vision (pp. 198–200). Presented at the DocEng: ACM Symposium on Document Engineering, ACM. <a href=\"https://doi.org/10.1145/1030397.1030434\">https://doi.org/10.1145/1030397.1030434</a>","short":"A. Ulges, C. Lampert, T. Breuel, in:, ACM, 2004, pp. 198–200.","ieee":"A. Ulges, C. Lampert, and T. Breuel, “Document capture using stereo vision,” presented at the DocEng: ACM Symposium on Document Engineering, 2004, pp. 198–200.","ama":"Ulges A, Lampert C, Breuel T. Document capture using stereo vision. In: ACM; 2004:198-200. doi:<a href=\"https://doi.org/10.1145/1030397.1030434\">10.1145/1030397.1030434</a>","mla":"Ulges, Adrian, et al. <i>Document Capture Using Stereo Vision</i>. ACM, 2004, pp. 198–200, doi:<a href=\"https://doi.org/10.1145/1030397.1030434\">10.1145/1030397.1030434</a>.","ista":"Ulges A, Lampert C, Breuel T. 2004. Document capture using stereo vision. DocEng: ACM Symposium on Document Engineering, 198–200.","chicago":"Ulges, Adrian, Christoph Lampert, and Thomas Breuel. “Document Capture Using Stereo Vision,” 198–200. ACM, 2004. <a href=\"https://doi.org/10.1145/1030397.1030434\">https://doi.org/10.1145/1030397.1030434</a>."},"date_created":"2018-12-11T12:04:38Z","year":"2004","date_updated":"2021-01-12T07:48:58Z"},{"intvolume":"        27","date_updated":"2021-01-12T07:52:19Z","year":"2004","issue":"1","publist_id":"2404","date_created":"2018-12-11T12:05:16Z","title":"Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons","citation":{"ama":"Jonas PM, Bischofberger J, Fricker D, Miles R. Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons. <i>Trends in Neurosciences</i>. 2004;27(1):30-40. doi:<a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">doi:10.1016/j.tins.2003.10.010</a>","ieee":"P. M. Jonas, J. Bischofberger, D. Fricker, and R. Miles, “Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons,” <i>Trends in Neurosciences</i>, vol. 27, no. 1. Elsevier, pp. 30–40, 2004.","short":"P.M. Jonas, J. Bischofberger, D. Fricker, R. Miles, Trends in Neurosciences 27 (2004) 30–40.","ista":"Jonas PM, Bischofberger J, Fricker D, Miles R. 2004. Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons. Trends in Neurosciences. 27(1), 30–40.","chicago":"Jonas, Peter M, Josef Bischofberger, Desdemona Fricker, and Richard Miles. “Interneuron Diversity Series: Fast in, Fast out--Temporal and Spatial Signal Processing in Hippocampal Interneurons.” <i>Trends in Neurosciences</i>. Elsevier, 2004. <a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">https://doi.org/doi:10.1016/j.tins.2003.10.010</a>.","mla":"Jonas, Peter M., et al. “Interneuron Diversity Series: Fast in, Fast out--Temporal and Spatial Signal Processing in Hippocampal Interneurons.” <i>Trends in Neurosciences</i>, vol. 27, no. 1, Elsevier, 2004, pp. 30–40, doi:<a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">doi:10.1016/j.tins.2003.10.010</a>.","apa":"Jonas, P. M., Bischofberger, J., Fricker, D., &#38; Miles, R. (2004). Interneuron Diversity series: Fast in, fast out--temporal and spatial signal processing in hippocampal interneurons. <i>Trends in Neurosciences</i>. Elsevier. <a href=\"https://doi.org/doi:10.1016/j.tins.2003.10.010\">https://doi.org/doi:10.1016/j.tins.2003.10.010</a>"},"publication":"Trends in Neurosciences","doi":"doi:10.1016/j.tins.2003.10.010","_id":"3805","month":"01","day":"01","abstract":[{"lang":"eng","text":"The operation of neuronal networks crucially depends on a fast time course of signaling in inhibitory interneurons. Synapses that excite interneurons generate fast currents, owing to the expression of glutamate receptors of specific subunit composition. Interneurons generate brief action potentials in response to transient synaptic activation and discharge repetitively at very high frequencies during sustained stimulation. The ability to generate short-duration action potentials at high frequencies depends on the expression of specific voltage-gated K+ channels. Factors facilitating fast action potential initiation following synaptic excitation include depolarized interneuron resting potential, subthreshold conductances and active dendrites. Finally, GABA release at interneuron output synapses is rapid and highly synchronized, leading to a faster inhibition in postsynaptic interneurons than in principal cells. Thus, the expression of distinct transmitter receptors and voltage-gated ion channels ensures that interneurons operate with high speed and temporal precision."}],"author":[{"full_name":"Peter Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas"},{"first_name":"Josef","full_name":"Bischofberger, Josef","last_name":"Bischofberger"},{"last_name":"Fricker","first_name":"Desdemona","full_name":"Fricker, Desdemona"},{"last_name":"Miles","full_name":"Miles, Richard","first_name":"Richard"}],"publication_status":"published","publisher":"Elsevier","date_published":"2004-01-01T00:00:00Z","type":"journal_article","status":"public","page":"30 - 40","extern":1,"volume":27,"quality_controlled":0},{"publisher":"Wiley-Blackwell","type":"journal_article","date_published":"2004-01-01T00:00:00Z","status":"public","extern":1,"page":"337 - 45","quality_controlled":0,"volume":556,"publication_status":"published","author":[{"last_name":"Kampa","full_name":"Kampa, Bjorn M","first_name":"Bjorn"},{"last_name":"Clements","first_name":"John","full_name":"Clements, John"},{"orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Peter Jonas"},{"last_name":"Stuart","full_name":"Stuart, Greg J","first_name":"Greg"}],"month":"01","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1664940/"}],"day":"01","abstract":[{"lang":"eng","text":"The time course of Mg(2+) block and unblock of NMDA receptors (NMDARs) determines the extent they are activated by depolarization. Here, we directly measure the rate of NMDAR channel opening in response to depolarizations at different times after brief (1 ms) and sustained (4.6 s) applications of glutamate to nucleated patches from neocortical pyramidal neurons. The kinetics of Mg(2+) unblock were found to be non-instantaneous and complex, consisting of a prominent fast component (time constant approximately 100 micros) and slower components (time constants 4 and approximately 300 ms), the relative amplitudes of which depended on the timing of the depolarizing pulse. Fitting a kinetic model to these data indicated that Mg(2+) not only blocks the NMDAR channel, but reduces both the open probability and affinity for glutamate, while enhancing desensitization. These effects slow the rate of NMDAR channel opening in response to depolarization in a time-dependent manner such that the slower components of Mg(2+) unblock are enhanced during depolarizations at later times after glutamate application. One physiological consequence of this is that brief depolarizations occurring earlier in time after glutamate application are better able to open NMDAR channels. This finding has important implications for spike-timing-dependent synaptic plasticity (STDP), where the precise (millisecond) timing of action potentials relative to synaptic inputs determines the magnitude and sign of changes in synaptic strength. Indeed, we find that STDP timing curves of NMDAR channel activation elicited by realistic dendritic action potential waveforms are narrower than expected assuming instantaneous Mg(2+) unblock, indicating that slow Mg(2+) unblock of NMDAR channels makes the STDP timing window more precise."}],"_id":"3807","publication":"Journal of Physiology","doi":"10.1113/jphysiol.2003.058842 ","date_updated":"2021-01-12T07:52:20Z","oa":1,"year":"2004","issue":"Pt 2","title":"Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity","publist_id":"2403","citation":{"apa":"Kampa, B., Clements, J., Jonas, P. M., &#38; Stuart, G. (2004). Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">https://doi.org/10.1113/jphysiol.2003.058842 </a>","short":"B. Kampa, J. Clements, P.M. Jonas, G. Stuart, Journal of Physiology 556 (2004) 337–45.","ieee":"B. Kampa, J. Clements, P. M. Jonas, and G. Stuart, “Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity,” <i>Journal of Physiology</i>, vol. 556, no. Pt 2. Wiley-Blackwell, pp. 337–45, 2004.","ama":"Kampa B, Clements J, Jonas PM, Stuart G. Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity. <i>Journal of Physiology</i>. 2004;556(Pt 2):337-345. doi:<a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">10.1113/jphysiol.2003.058842 </a>","ista":"Kampa B, Clements J, Jonas PM, Stuart G. 2004. Kinetics of Mg(2+) unblock of NMDA receptors: implications for spike-timing dependent synaptic plasticity. Journal of Physiology. 556(Pt 2), 337–45.","mla":"Kampa, Bjorn, et al. “Kinetics of Mg(2+) Unblock of NMDA Receptors: Implications for Spike-Timing Dependent Synaptic Plasticity.” <i>Journal of Physiology</i>, vol. 556, no. Pt 2, Wiley-Blackwell, 2004, pp. 337–45, doi:<a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">10.1113/jphysiol.2003.058842 </a>.","chicago":"Kampa, Bjorn, John Clements, Peter M Jonas, and Greg Stuart. “Kinetics of Mg(2+) Unblock of NMDA Receptors: Implications for Spike-Timing Dependent Synaptic Plasticity.” <i>Journal of Physiology</i>. Wiley-Blackwell, 2004. <a href=\"https://doi.org/10.1113/jphysiol.2003.058842 \">https://doi.org/10.1113/jphysiol.2003.058842 </a>."},"date_created":"2018-12-11T12:05:17Z","intvolume":"       556"},{"publisher":"Nature Publishing Group","status":"public","type":"journal_article","date_published":"2004-01-01T00:00:00Z","extern":1,"page":"184 - 7","volume":429,"quality_controlled":0,"month":"01","day":"01","abstract":[{"lang":"eng","text":"Neural stem cells in various regions of the vertebrate brain continuously generate neurons throughout life. In the mammalian hippocampus, a region important for spatial and episodic memory, thousands of new granule cells are produced per day, with the exact number depending on environmental conditions and physical exercise. The survival of these neurons is improved by learning and conversely learning may be promoted by neurogenesis. Although it has been suggested that newly generated neurons may have specific properties to facilitate learning, the cellular and synaptic mechanisms of plasticity in these neurons are largely unknown. Here we show that young granule cells in the adult hippocampus differ substantially from mature granule cells in both active and passive membrane properties. In young neurons, T-type Ca2+ channels can generate isolated Ca2+ spikes and boost fast Na+ action potentials, contributing to the induction of synaptic plasticity. Associative long-term potentiation can be induced more easily in young neurons than in mature neurons under identical conditions. Thus, newly generated neurons express unique mechanisms to facilitate synaptic plasticity, which may be important for the formation of new memories."}],"publication_status":"published","author":[{"last_name":"Schmidt Hieber","first_name":"Christoph","full_name":"Schmidt-Hieber, Christoph"},{"first_name":"Peter M","full_name":"Peter Jonas","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas"},{"last_name":"Bischofberger","full_name":"Bischofberger, Josef","first_name":"Josef"}],"publication":"Nature","doi":"10.1038/nature02553","_id":"3809","intvolume":"       429","date_updated":"2021-01-12T07:52:21Z","year":"2004","issue":"6988","title":"Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus","citation":{"mla":"Schmidt Hieber, Christoph, et al. “Enhanced Synaptic Plasticity in Newly Generated Granule Cells of the Adult Hippocampus.” <i>Nature</i>, vol. 429, no. 6988, Nature Publishing Group, 2004, pp. 184–87, doi:<a href=\"https://doi.org/10.1038/nature02553\">10.1038/nature02553</a>.","chicago":"Schmidt Hieber, Christoph, Peter M Jonas, and Josef Bischofberger. “Enhanced Synaptic Plasticity in Newly Generated Granule Cells of the Adult Hippocampus.” <i>Nature</i>. Nature Publishing Group, 2004. <a href=\"https://doi.org/10.1038/nature02553\">https://doi.org/10.1038/nature02553</a>.","ista":"Schmidt Hieber C, Jonas PM, Bischofberger J. 2004. Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus. Nature. 429(6988), 184–7.","ieee":"C. Schmidt Hieber, P. M. Jonas, and J. Bischofberger, “Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus,” <i>Nature</i>, vol. 429, no. 6988. Nature Publishing Group, pp. 184–7, 2004.","ama":"Schmidt Hieber C, Jonas PM, Bischofberger J. Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus. <i>Nature</i>. 2004;429(6988):184-187. doi:<a href=\"https://doi.org/10.1038/nature02553\">10.1038/nature02553</a>","short":"C. Schmidt Hieber, P.M. Jonas, J. Bischofberger, Nature 429 (2004) 184–7.","apa":"Schmidt Hieber, C., Jonas, P. M., &#38; Bischofberger, J. (2004). Enhanced synaptic plasticity in newly generated granule cells of the adult hippocampus. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature02553\">https://doi.org/10.1038/nature02553</a>"},"publist_id":"2401","date_created":"2018-12-11T12:05:17Z"},{"intvolume":"       304","publist_id":"2402","date_created":"2018-12-11T12:05:18Z","title":"Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids","citation":{"apa":"Oliver, D., Lien, C., Soom, M., Baukrowitz, T., Jonas, P. M., &#38; Fakler, B. (2004). Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1094113\">https://doi.org/10.1126/science.1094113</a>","short":"D. Oliver, C. Lien, M. Soom, T. Baukrowitz, P.M. Jonas, B. Fakler, Science 304 (2004) 265–70.","ieee":"D. Oliver, C. Lien, M. Soom, T. Baukrowitz, P. M. Jonas, and B. Fakler, “Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids,” <i>Science</i>, vol. 304, no. 5668. American Association for the Advancement of Science, pp. 265–70, 2004.","ama":"Oliver D, Lien C, Soom M, Baukrowitz T, Jonas PM, Fakler B. Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids. <i>Science</i>. 2004;304(5668):265-270. doi:<a href=\"https://doi.org/10.1126/science.1094113\">10.1126/science.1094113</a>","ista":"Oliver D, Lien C, Soom M, Baukrowitz T, Jonas PM, Fakler B. 2004. Functional conversion between A-type and delayed rectifier K+ channels by membrane lipids. Science. 304(5668), 265–70.","mla":"Oliver, Dominik, et al. “Functional Conversion between A-Type and Delayed Rectifier K+ Channels by Membrane Lipids.” <i>Science</i>, vol. 304, no. 5668, American Association for the Advancement of Science, 2004, pp. 265–70, doi:<a href=\"https://doi.org/10.1126/science.1094113\">10.1126/science.1094113</a>.","chicago":"Oliver, Dominik, Cheng Lien, Malle Soom, Thomas Baukrowitz, Peter M Jonas, and Bernd Fakler. “Functional Conversion between A-Type and Delayed Rectifier K+ Channels by Membrane Lipids.” <i>Science</i>. American Association for the Advancement of Science, 2004. <a href=\"https://doi.org/10.1126/science.1094113\">https://doi.org/10.1126/science.1094113</a>."},"date_updated":"2021-01-12T07:52:22Z","year":"2004","issue":"5668","doi":"10.1126/science.1094113","publication":"Science","_id":"3810","day":"01","abstract":[{"lang":"eng","text":"Voltage-gated potassium (Kv) channels control action potential repolarization, interspike membrane potential, and action potential frequency in excitable cells. It is thought that the combinatorial association between distinct alpha and beta subunits determines whether Kv channels function as non-inactivating delayed rectifiers or as rapidly inactivating A-type channels. We show that membrane lipids can convert A-type channels into delayed rectifiers and vice versa. Phosphoinositides remove N-type inactivation from A-type channels by immobilizing the inactivation domains. Conversely, arachidonic acid and its amide anandamide endow delayed rectifiers with rapid voltage-dependent inactivation. The bidirectional control of Kv channel gating by lipids may provide a mechanism for the dynamic regulation of electrical signaling in the nervous system."}],"month":"01","publication_status":"published","author":[{"last_name":"Oliver","first_name":"Dominik","full_name":"Oliver, Dominik"},{"first_name":"Cheng","full_name":"Lien, Cheng-Chang","last_name":"Lien"},{"last_name":"Soom","first_name":"Malle","full_name":"Soom, Malle"},{"last_name":"Baukrowitz","full_name":"Baukrowitz, Thomas","first_name":"Thomas"},{"full_name":"Peter Jonas","first_name":"Peter M","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas"},{"first_name":"Bernd","full_name":"Fakler, Bernd","last_name":"Fakler"}],"extern":1,"page":"265 - 70","quality_controlled":0,"volume":304,"publisher":"American Association for the Advancement of Science","status":"public","type":"journal_article","date_published":"2004-01-01T00:00:00Z"},{"intvolume":"      3210","year":"2004","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327, ONR grant N00014-02-1-0671, NSF grants CCR-9988172 and CCR-0225610","date_updated":"2021-01-12T07:53:01Z","date_created":"2018-12-11T12:05:45Z","publist_id":"2264","title":"On Nash equilibria in stochastic games","citation":{"apa":"Chatterjee, K., Majumdar, R., &#38; Jurdziński, M. (2004). On Nash equilibria in stochastic games (Vol. 3210, pp. 26–40). Presented at the CSL: Computer Science Logic, Springer. <a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">https://doi.org/10.1007/978-3-540-30124-0_6</a>","mla":"Chatterjee, Krishnendu, et al. <i>On Nash Equilibria in Stochastic Games</i>. Vol. 3210, Springer, 2004, pp. 26–40, doi:<a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">10.1007/978-3-540-30124-0_6</a>.","chicago":"Chatterjee, Krishnendu, Ritankar Majumdar, and Marcin Jurdziński. “On Nash Equilibria in Stochastic Games,” 3210:26–40. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">https://doi.org/10.1007/978-3-540-30124-0_6</a>.","ista":"Chatterjee K, Majumdar R, Jurdziński M. 2004. On Nash equilibria in stochastic games. CSL: Computer Science Logic, LNCS , vol. 3210, 26–40.","short":"K. Chatterjee, R. Majumdar, M. Jurdziński, in:, Springer, 2004, pp. 26–40.","ama":"Chatterjee K, Majumdar R, Jurdziński M. On Nash equilibria in stochastic games. In: Vol 3210. Springer; 2004:26-40. doi:<a href=\"https://doi.org/10.1007/978-3-540-30124-0_6\">10.1007/978-3-540-30124-0_6</a>","ieee":"K. Chatterjee, R. Majumdar, and M. Jurdziński, “On Nash equilibria in stochastic games,” presented at the CSL: Computer Science Logic, 2004, vol. 3210, pp. 26–40."},"doi":"10.1007/978-3-540-30124-0_6","_id":"3894","month":"09","conference":{"name":"CSL: Computer Science Logic"},"abstract":[{"lang":"eng","text":"We study infinite stochastic games played by n-players on a finite graph with goals given by sets of infinite traces. The games are stochastic (each player simultaneously and independently chooses an action at each round, and 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 a reachability objective, that is, if the goal for each player i is to visit some subset R-i of the states, then there exists an epsilon-Nash equilibrium in memoryless strategies, for every epsilon &gt; 0. However, exact Nash equilibria need not exist. We study the complexity of finding such Nash equilibria, and show that the payoff of some epsilon-Nash equilibrium in memoryless strategies can be epsilon-approximated in NP. We study the important subclass of n-player turn-based probabilistic games, where at each state at most one player has a nontrivial choice of moves. For turn-based probabilistic games, we show the existence of epsilon-Nash equilibria in pure strategies for games where the objective of player i is a Borel set B-i of infinite traces. However, exact Nash equilibria may not exist. For the special case of omega-regular objectives, we show exact Nash equilibria exist, and can be computed in NP when the omega-regular objectives are expressed as parity objectives."}],"day":"09","author":[{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"first_name":"Marcin","full_name":"Jurdziński, Marcin","last_name":"Jurdziński"}],"publication_status":"published","type":"conference","date_published":"2004-09-09T00:00:00Z","status":"public","publisher":"Springer","alternative_title":["LNCS "],"volume":3210,"quality_controlled":0,"extern":1,"page":"26 - 40"},{"title":"Games with secure equilibria","publist_id":"2262","citation":{"short":"K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, IEEE, 2004, pp. 160–169.","ieee":"K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Games with secure equilibria,” presented at the LICS: Logic in Computer Science, 2004, pp. 160–169.","ama":"Chatterjee K, Henzinger TA, Jurdziński M. Games with secure equilibria. In: IEEE; 2004:160-169. doi:<a href=\"https://doi.org/10.1109/LICS.2004.1319610\">10.1109/LICS.2004.1319610</a>","mla":"Chatterjee, Krishnendu, et al. <i>Games with Secure Equilibria</i>. IEEE, 2004, pp. 160–69, doi:<a href=\"https://doi.org/10.1109/LICS.2004.1319610\">10.1109/LICS.2004.1319610</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Games with Secure Equilibria,” 160–69. IEEE, 2004. <a href=\"https://doi.org/10.1109/LICS.2004.1319610\">https://doi.org/10.1109/LICS.2004.1319610</a>.","ista":"Chatterjee K, Henzinger TA, Jurdziński M. 2004. Games with secure equilibria. LICS: Logic in Computer Science, 160–169.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Jurdziński, M. (2004). Games with secure equilibria (pp. 160–169). Presented at the LICS: Logic in Computer Science, IEEE. <a href=\"https://doi.org/10.1109/LICS.2004.1319610\">https://doi.org/10.1109/LICS.2004.1319610</a>"},"date_created":"2018-12-11T12:05:45Z","date_updated":"2021-01-12T07:53:01Z","year":"2004","_id":"3895","doi":"10.1109/LICS.2004.1319610","publication_status":"published","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee"},{"full_name":"Thomas Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Jurdziński","full_name":"Jurdziński, Marcin","first_name":"Marcin"}],"day":"09","abstract":[{"lang":"eng","text":"In 2-player non-zero-sum games, Nash equilibria capture the options for rational behavior if each player attempts to maximize her payoff. In contrast to classical game theory, we consider lexicographic objectives: first, each player tries to maximize her own payoff, and then, the player tries to minimize the opponent's payoff. Such objectives arise naturally in the verification of systems with multiple components. There, instead of proving that each component satisfies its specification no matter how the other components behave, it often suffices to prove that each component satisfies its specification provided that the other components satisfy their specifications. We say that a Nash equilibrium is secure if it is an equilibrium with respect to the lexicographic objectives of both players. We prove that in graph games with Borel objectives, which include the games that arise in verification, there may be several Nash equilibria, but there is always a unique maximal payoff profile of secure equilibria. We show how this equilibrium can be computed in the case of omega-regular objectives, and we characterize the memory requirements of strategies that achieve the equilibrium."}],"conference":{"name":"LICS: Logic in Computer Science"},"month":"08","extern":1,"page":"160 - 169","quality_controlled":0,"publisher":"IEEE","type":"conference","date_published":"2004-08-09T00:00:00Z","status":"public"}]