[{"date_published":"2011-08-09T00:00:00Z","title":"Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions","month":"08","date_updated":"2021-01-12T07:41:47Z","publisher":"Springer","page":"400 - 411","publication_status":"published","abstract":[{"text":"We introduce a new class of functions that can be minimized in polynomial time in the value oracle model. These are functions f satisfying f(x) + f(y) ≥ f(x ∏ y) + f(x ∐ y) where the domain of each variable x i corresponds to nodes of a rooted binary tree, and operations ∏,∐ are defined with respect to this tree. Special cases include previously studied L-convex and bisubmodular functions, which can be obtained with particular choices of trees. We present a polynomial-time algorithm for minimizing functions in the new class. It combines Murota's steepest descent algorithm for L-convex functions with bisubmodular minimization algorithms. ","lang":"eng"}],"publist_id":"3478","_id":"3204","intvolume":"      6907","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"extern":1,"volume":6907,"type":"conference","main_file_link":[{"open_access":"0","url":"http://arxiv.org/pdf/1007.1229v3"}],"conference":{"name":"MFCS: Mathematical Foundations of Computer Science"},"citation":{"mla":"Kolmogorov, Vladimir. <i>Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions</i>. Vol. 6907, Springer, 2011, pp. 400–11, doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">10.1007/978-3-642-22993-0_37</a>.","apa":"Kolmogorov, V. (2011). Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions (Vol. 6907, pp. 400–411). Presented at the MFCS: Mathematical Foundations of Computer Science, Springer. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">https://doi.org/10.1007/978-3-642-22993-0_37</a>","chicago":"Kolmogorov, Vladimir. “Submodularity on a Tree: Unifying Submodularity on a Tree: Unifying L-Convex and Bisubmodular Functions Convex and Bisubmodular Functions,” 6907:400–411. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">https://doi.org/10.1007/978-3-642-22993-0_37</a>.","ama":"Kolmogorov V. Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions. In: Vol 6907. Springer; 2011:400-411. doi:<a href=\"https://doi.org/10.1007/978-3-642-22993-0_37\">10.1007/978-3-642-22993-0_37</a>","ista":"Kolmogorov V. 2011. Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 400–411.","short":"V. Kolmogorov, in:, Springer, 2011, pp. 400–411.","ieee":"V. Kolmogorov, “Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions,” presented at the MFCS: Mathematical Foundations of Computer Science, 2011, vol. 6907, pp. 400–411."},"quality_controlled":0,"doi":"10.1007/978-3-642-22993-0_37","alternative_title":["LNCS"],"day":"09","status":"public","date_created":"2018-12-11T12:02:00Z","year":"2011"},{"author":[{"full_name":"Tarlow, Daniel","first_name":"Daniel","last_name":"Tarlow"},{"full_name":"Batra, Druv","first_name":"Druv","last_name":"Batra"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"}],"extern":1,"type":"conference","publist_id":"3475","_id":"3205","page":"113 - 120","publication_status":"published","abstract":[{"text":"This paper proposes a novel Linear Programming (LP) based algorithm, called Dynamic Tree-Block Coordinate Ascent (DT-BCA), for performing maximum a posteriori (MAP) inference in probabilistic graphical models. Unlike traditional message passing algorithms, which operate uniformly on the whole factor graph, our method dynamically chooses regions of the factor graph on which to focus message-passing efforts. We propose two criteria for selecting regions, including an efficiently computable upper-bound on the increase in the objective possible by passing messages in any particular region. This bound is derived from the theory of primal-dual methods from combinatorial optimization, and the forest that maximizes the bounds can be chosen efficiently using a maximum-spanning-tree-like algorithm. Experimental results show that our dynamic schedules significantly speed up state-of-the-art LP-based message-passing algorithms on a wide variety of real-world problems.","lang":"eng"}],"date_published":"2011-01-01T00:00:00Z","title":"Dynamic tree block coordinate ascent","month":"01","date_updated":"2021-01-12T07:41:47Z","publisher":"Omnipress","date_created":"2018-12-11T12:02:00Z","year":"2011","day":"01","status":"public","citation":{"chicago":"Tarlow, Daniel, Druv Batra, Pushmeet Kohli, and Vladimir Kolmogorov. “Dynamic Tree Block Coordinate Ascent,” 113–20. Omnipress, 2011.","apa":"Tarlow, D., Batra, D., Kohli, P., &#38; Kolmogorov, V. (2011). Dynamic tree block coordinate ascent (pp. 113–120). Presented at the ICML: International Conference on Machine Learning, Omnipress.","mla":"Tarlow, Daniel, et al. <i>Dynamic Tree Block Coordinate Ascent</i>. Omnipress, 2011, pp. 113–20.","ieee":"D. Tarlow, D. Batra, P. Kohli, and V. Kolmogorov, “Dynamic tree block coordinate ascent,” presented at the ICML: International Conference on Machine Learning, 2011, pp. 113–120.","short":"D. Tarlow, D. Batra, P. Kohli, V. Kolmogorov, in:, Omnipress, 2011, pp. 113–120.","ama":"Tarlow D, Batra D, Kohli P, Kolmogorov V. Dynamic tree block coordinate ascent. In: Omnipress; 2011:113-120.","ista":"Tarlow D, Batra D, Kohli P, Kolmogorov V. 2011. Dynamic tree block coordinate ascent. ICML: International Conference on Machine Learning, 113–120."},"quality_controlled":0,"main_file_link":[{"open_access":"0","url":"http://ttic.uchicago.edu/~dbatra/publications/assets/tbkk_icml11.pdf"}],"conference":{"name":"ICML: International Conference on Machine Learning"}},{"quality_controlled":0,"citation":{"mla":"Osokin, Anton, et al. <i>Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints</i>. IEEE, 2011, pp. 1889–96, doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">10.1109/CVPR.2011.5995361</a>.","apa":"Osokin, A., Vetrov, D., &#38; Kolmogorov, V. (2011). Submodular decomposition framework for inference in associative Markov networks with global constraints (pp. 1889–1896). Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">https://doi.org/10.1109/CVPR.2011.5995361</a>","chicago":"Osokin, Anton, Dmitry Vetrov, and Vladimir Kolmogorov. “Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints,” 1889–96. IEEE, 2011. <a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">https://doi.org/10.1109/CVPR.2011.5995361</a>.","ista":"Osokin A, Vetrov D, Kolmogorov V. 2011. Submodular decomposition framework for inference in associative Markov networks with global constraints. CVPR: Computer Vision and Pattern Recognition, 1889–1896.","ama":"Osokin A, Vetrov D, Kolmogorov V. Submodular decomposition framework for inference in associative Markov networks with global constraints. In: IEEE; 2011:1889-1896. doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995361\">10.1109/CVPR.2011.5995361</a>","ieee":"A. Osokin, D. Vetrov, and V. Kolmogorov, “Submodular decomposition framework for inference in associative Markov networks with global constraints,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 1889–1896.","short":"A. Osokin, D. Vetrov, V. Kolmogorov, in:, IEEE, 2011, pp. 1889–1896."},"conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"main_file_link":[{"open_access":"0","url":"http://arxiv.org/pdf/1103.1077v1"}],"year":"2011","date_created":"2018-12-11T12:02:00Z","day":"22","status":"public","doi":"10.1109/CVPR.2011.5995361","abstract":[{"lang":"eng","text":"In this paper we address the problem of finding the most probable state of discrete Markov random field (MRF) with associative pairwise terms. Although of practical importance, this problem is known to be NP-hard in general. We propose a new type of MRF decomposition, submod-ular decomposition (SMD). Unlike existing decomposition approaches SMD decomposes the initial problem into sub-problems corresponding to a specific class label while preserving the graph structure of each subproblem. Such decomposition enables us to take into account several types of global constraints in an efficient manner. We study theoretical properties of the proposed approach and demonstrate its applicability on a number of problems."}],"publication_status":"published","page":"1889 - 1896","publisher":"IEEE","date_updated":"2021-01-12T07:41:47Z","title":"Submodular decomposition framework for inference in associative Markov networks with global constraints","month":"08","date_published":"2011-08-22T00:00:00Z","type":"conference","extern":1,"author":[{"full_name":"Osokin, Anton","last_name":"Osokin","first_name":"Anton"},{"first_name":"Dmitry","last_name":"Vetrov","full_name":"Vetrov, Dmitry"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","first_name":"Vladimir"}],"_id":"3206","publist_id":"3476"},{"doi":"10.1109/CVPR.2011.5995530","day":"22","status":"public","date_created":"2018-12-11T12:02:01Z","year":"2011","conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"citation":{"mla":"Vicente, Sara, et al. <i>Object Cosegmentation</i>. IEEE, 2011, pp. 2217–24, doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">10.1109/CVPR.2011.5995530</a>.","apa":"Vicente, S., Rother, C., &#38; Kolmogorov, V. (2011). Object cosegmentation (pp. 2217–2224). Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">https://doi.org/10.1109/CVPR.2011.5995530</a>","chicago":"Vicente, Sara, Carsten Rother, and Vladimir Kolmogorov. “Object Cosegmentation,” 2217–24. IEEE, 2011. <a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">https://doi.org/10.1109/CVPR.2011.5995530</a>.","ama":"Vicente S, Rother C, Kolmogorov V. Object cosegmentation. In: IEEE; 2011:2217-2224. doi:<a href=\"https://doi.org/10.1109/CVPR.2011.5995530\">10.1109/CVPR.2011.5995530</a>","ista":"Vicente S, Rother C, Kolmogorov V. 2011. Object cosegmentation. CVPR: Computer Vision and Pattern Recognition, 2217–2224.","ieee":"S. Vicente, C. Rother, and V. Kolmogorov, “Object cosegmentation,” presented at the CVPR: Computer Vision and Pattern Recognition, 2011, pp. 2217–2224.","short":"S. Vicente, C. Rother, V. Kolmogorov, in:, IEEE, 2011, pp. 2217–2224."},"quality_controlled":0,"publist_id":"3477","_id":"3207","author":[{"full_name":"Vicente, Sara","last_name":"Vicente","first_name":"Sara"},{"first_name":"Carsten","last_name":"Rother","full_name":"Rother, Carsten"},{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"}],"extern":1,"type":"conference","date_published":"2011-08-22T00:00:00Z","title":"Object cosegmentation","month":"08","date_updated":"2021-01-12T07:41:48Z","publisher":"IEEE","page":"2217 - 2224","publication_status":"published","abstract":[{"text":"Cosegmentation is typically defined as the task of jointly segmenting something similar in a given set of images. Existing methods are too generic and so far have not demonstrated competitive results for any specific task. In this paper we overcome this limitation by adding two new aspects to cosegmentation: (1) the &quot;something&quot; has to be an object, and (2) the &quot;similarity&quot; measure is learned. In this way, we are able to achieve excellent results on the recently introduced iCoseg dataset, which contains small sets of images of either the same object instance or similar objects of the same class. The challenge of this dataset lies in the extreme changes in viewpoint, lighting, and object deformations within each set. We are able to considerably outperform several competitors. To achieve this performance, we borrow recent ideas from object recognition: the use of powerful features extracted from a pool of candidate object-like segmentations. We believe that our work will be beneficial to several application areas, such as image retrieval.","lang":"eng"}]},{"title":"Parallel repetition for leakage resilience amplification revisited","month":"01","date_published":"2011-01-01T00:00:00Z","publisher":"Springer","date_updated":"2021-01-12T07:42:00Z","page":"58 - 69","abstract":[{"text":"If a cryptographic primitive remains secure even if ℓ bits about the secret key are leaked to the adversary, one would expect that at least one of n independent instantiations of the scheme remains secure given n·ℓ bits of leakage. This intuition has been proven true for schemes satisfying some special information-theoretic properties by Alwen et al. [Eurocrypt'10]. On the negative side, Lewko and Waters [FOCS'10] construct a CPA secure public-key encryption scheme for which this intuition fails. The counterexample of Lewko and Waters leaves open the interesting possibility that for any scheme there exists a constant c&gt;0, such that n fold repetition remains secure against c·n·ℓ bits of leakage. Furthermore, their counterexample requires the n copies of the encryption scheme to share a common reference parameter, leaving open the possibility that the intuition is true for all schemes without common setup. In this work we give a stronger counterexample ruling out these possibilities. We construct a signature scheme such that: 1. a single instantiation remains secure given ℓ = log(k) bits of leakage where k is a security parameter. 2. any polynomial number of independent instantiations can be broken (in the strongest sense of key-recovery) given ℓ′ = poly(k) bits of leakage. Note that ℓ does not depend on the number of instances. The computational assumption underlying our counterexample is that non-interactive computationally sound proofs exist. Moreover, under a stronger (non-standard) assumption about such proofs, our counterexample does not require a common reference parameter. The underlying idea of our counterexample is rather generic and can be applied to other primitives like encryption schemes. © 2011 International Association for Cryptologic Research.","lang":"eng"}],"publication_status":"published","publist_id":"3443","_id":"3236","extern":1,"author":[{"first_name":"Abhishek","last_name":"Jain","full_name":"Jain, Abhishek"},{"full_name":"Krzysztof Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"volume":"6597 ","type":"conference","conference":{"name":"TCC: Theory of Cryptography Conference"},"citation":{"ieee":"A. Jain and K. Z. Pietrzak, “Parallel repetition for leakage resilience amplification revisited,” presented at the TCC: Theory of Cryptography Conference, 2011, vol. 6597, pp. 58–69.","short":"A. Jain, K.Z. Pietrzak, in:, Springer, 2011, pp. 58–69.","ista":"Jain A, Pietrzak KZ. 2011. Parallel repetition for leakage resilience amplification revisited. TCC: Theory of Cryptography Conference, LNCS, vol. 6597, 58–69.","ama":"Jain A, Pietrzak KZ. Parallel repetition for leakage resilience amplification revisited. In: Vol 6597. Springer; 2011:58-69. doi:<a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">10.1007/978-3-642-19571-6_5</a>","chicago":"Jain, Abhishek, and Krzysztof Z Pietrzak. “Parallel Repetition for Leakage Resilience Amplification Revisited,” 6597:58–69. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">https://doi.org/10.1007/978-3-642-19571-6_5</a>.","apa":"Jain, A., &#38; Pietrzak, K. Z. (2011). Parallel repetition for leakage resilience amplification revisited (Vol. 6597, pp. 58–69). Presented at the TCC: Theory of Cryptography Conference, Springer. <a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">https://doi.org/10.1007/978-3-642-19571-6_5</a>","mla":"Jain, Abhishek, and Krzysztof Z. Pietrzak. <i>Parallel Repetition for Leakage Resilience Amplification Revisited</i>. Vol. 6597, Springer, 2011, pp. 58–69, doi:<a href=\"https://doi.org/10.1007/978-3-642-19571-6_5\">10.1007/978-3-642-19571-6_5</a>."},"quality_controlled":0,"alternative_title":["LNCS"],"doi":"10.1007/978-3-642-19571-6_5","status":"public","day":"01","year":"2011","date_created":"2018-12-11T12:02:11Z"},{"alternative_title":["LNCS"],"doi":"10.1007/978-3-642-20465-4_3","status":"public","day":"01","year":"2011","date_created":"2018-12-11T12:02:11Z","conference":{"start_date":"2011-05-15","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2011-05-19","location":"Tallinn, Estonia"},"citation":{"ieee":"E. Kiltz, K. Z. Pietrzak, D. Cash, A. Jain, and D. Venturi, “Efficient authentication from hard learning problems,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 2011, vol. 6632, pp. 7–26.","short":"E. Kiltz, K.Z. Pietrzak, D. Cash, A. Jain, D. Venturi, in:, Springer, 2011, pp. 7–26.","ista":"Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. 2011. Efficient authentication from hard learning problems. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 6632, 7–26.","ama":"Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. Efficient authentication from hard learning problems. In: Vol 6632. Springer; 2011:7-26. doi:<a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">10.1007/978-3-642-20465-4_3</a>","apa":"Kiltz, E., Pietrzak, K. Z., Cash, D., Jain, A., &#38; Venturi, D. (2011). Efficient authentication from hard learning problems (Vol. 6632, pp. 7–26). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">https://doi.org/10.1007/978-3-642-20465-4_3</a>","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, David Cash, Abhishek Jain, and Daniele Venturi. “Efficient Authentication from Hard Learning Problems,” 6632:7–26. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">https://doi.org/10.1007/978-3-642-20465-4_3</a>.","mla":"Kiltz, Eike, et al. <i>Efficient Authentication from Hard Learning Problems</i>. Vol. 6632, Springer, 2011, pp. 7–26, doi:<a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">10.1007/978-3-642-20465-4_3</a>."},"quality_controlled":"1","publist_id":"3442","related_material":{"record":[{"id":"1187","relation":"later_version","status":"public"}]},"_id":"3238","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"      6632","author":[{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak"},{"first_name":"David","last_name":"Cash","full_name":"Cash, David"},{"full_name":"Jain, Abhishek","last_name":"Jain","first_name":"Abhishek"},{"first_name":"Daniele","last_name":"Venturi","full_name":"Venturi, Daniele"}],"oa_version":"None","volume":6632,"acknowledgement":"The European Regional Development Fund (ERDF),Guardtime,Qualcomm,Swedbank","type":"conference","title":"Efficient authentication from hard learning problems","language":[{"iso":"eng"}],"month":"05","date_published":"2011-05-01T00:00:00Z","publisher":"Springer","date_updated":"2025-04-15T08:32:11Z","page":"7 - 26","abstract":[{"text":"We construct efficient authentication protocols and message-authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work - starting with the HB protocol of Hopper and Blum in 2001 - until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle (MIM) attacks. A MAC implies such a (two-round) protocol. © 2011 International Association for Cryptologic Research","lang":"eng"}],"publication_status":"published"},{"author":[{"first_name":"Sebastian","last_name":"Faust","full_name":"Faust, Sebastian"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Venturi","first_name":"Daniele","full_name":"Venturi, Daniele"}],"extern":1,"volume":"6755 ","type":"conference","publist_id":"3441","_id":"3239","page":"391 - 402","publication_status":"published","abstract":[{"lang":"eng","text":"Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that the tampered device will reveal secret information. Inspired by the work of Ishai et al. [Eurocrypt'06], we propose a compiler that transforms any circuit into a new circuit with the same functionality, but which is resilient against a well-defined and powerful tampering adversary. More concretely, our transformed circuits remain secure even if the adversary can adaptively tamper with every wire in the circuit as long as the tampering fails with some probability δ&gt;0. This additional requirement is motivated by practical tampering attacks, where it is often difficult to guarantee the success of a specific attack. Formally, we show that a q-query tampering attack against the transformed circuit can be &quot;simulated&quot; with only black-box access to the original circuit and log(q) bits of additional auxiliary information. Thus, if the implemented cryptographic scheme is secure against log(q) bits of leakage, then our implementation is tamper-proof in the above sense. Surprisingly, allowing for this small amount of information leakage allows for much more efficient compilers, which moreover do not require randomness during evaluation. Similar to earlier works our compiler requires small, stateless and computation-independent tamper-proof gadgets. Thus, our result can be interpreted as reducing the problem of shielding arbitrary complex computation to protecting simple components. © 2011 Springer-Verlag."}],"date_published":"2011-01-01T00:00:00Z","month":"01","title":"Tamper proof circuits How to trade leakage for tamper resilience","date_updated":"2021-01-12T07:42:02Z","publisher":"Springer","date_created":"2018-12-11T12:02:12Z","year":"2011","doi":"10.1007/978-3-642-22006-7_33","issue":"Part 1","alternative_title":["LNCS"],"day":"01","status":"public","citation":{"ama":"Faust S, Pietrzak KZ, Venturi D. Tamper proof circuits How to trade leakage for tamper resilience. In: Vol 6755. Springer; 2011:391-402. doi:<a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">10.1007/978-3-642-22006-7_33</a>","ista":"Faust S, Pietrzak KZ, Venturi D. 2011. Tamper proof circuits How to trade leakage for tamper resilience. ICALP: Automata, Languages and Programming, LNCS, vol. 6755, 391–402.","short":"S. Faust, K.Z. Pietrzak, D. Venturi, in:, Springer, 2011, pp. 391–402.","ieee":"S. Faust, K. Z. Pietrzak, and D. Venturi, “Tamper proof circuits How to trade leakage for tamper resilience,” presented at the ICALP: Automata, Languages and Programming, 2011, vol. 6755, no. Part 1, pp. 391–402.","mla":"Faust, Sebastian, et al. <i>Tamper Proof Circuits How to Trade Leakage for Tamper Resilience</i>. Vol. 6755, no. Part 1, Springer, 2011, pp. 391–402, doi:<a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">10.1007/978-3-642-22006-7_33</a>.","apa":"Faust, S., Pietrzak, K. Z., &#38; Venturi, D. (2011). Tamper proof circuits How to trade leakage for tamper resilience (Vol. 6755, pp. 391–402). Presented at the ICALP: Automata, Languages and Programming, Springer. <a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">https://doi.org/10.1007/978-3-642-22006-7_33</a>","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Daniele Venturi. “Tamper Proof Circuits How to Trade Leakage for Tamper Resilience,” 6755:391–402. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22006-7_33\">https://doi.org/10.1007/978-3-642-22006-7_33</a>."},"quality_controlled":0,"conference":{"name":"ICALP: Automata, Languages and Programming"}},{"extern":1,"intvolume":"      6841","author":[{"full_name":"Barak,  Boaz","first_name":"Boaz","last_name":"Barak"},{"full_name":"Dodis, Yevgeniy","last_name":"Dodis","first_name":"Yevgeniy"},{"full_name":"Krawczyk, Hugo","last_name":"Krawczyk","first_name":"Hugo"},{"first_name":"Olivier","last_name":"Pereira","full_name":"Pereira, Olivier"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak"},{"first_name":"François","last_name":"Standaert","full_name":"Standaert, François-Xavier"},{"full_name":"Yu, Yu","first_name":"Yu","last_name":"Yu"}],"type":"conference","volume":6841,"publist_id":"3440","_id":"3240","page":"1 - 20","abstract":[{"lang":"eng","text":"The famous Leftover Hash Lemma (LHL) states that (almost) universal hash functions are good randomness extractors. Despite its numerous applications, LHL-based extractors suffer from the following two limitations: - Large Entropy Loss: to extract v bits from distribution X of min-entropy m which are ε-close to uniform, one must set v ≤ m - 2log(1/ε), meaning that the entropy loss L = def m - v ≥ 2 log(1/ε). For many applications, such entropy loss is too large. - Large Seed Length: the seed length n of (almost) universal hash function required by the LHL must be at least n ≥ min (u - v, v + 2log(1/ε)) - O(1), where u is the length of the source, and must grow with the number of extracted bits. Quite surprisingly, we show that both limitations of the LHL - large entropy loss and large seed - can be overcome (or, at least, mitigated) in various important scenarios. First, we show that entropy loss could be reduced to L = log(1/ε) for the setting of deriving secret keys for a wide range of cryptographic applications. Specifically, the security of these schemes with an LHL-derived key gracefully degrades from ε to at most ε + √ε2-L. (Notice that, unlike standard LHL, this bound is meaningful even when one extracts more bits than the min-entropy we have!) Based on these results we build a general computational extractor that enjoys low entropy loss and can be used to instantiate a generic key derivation function for any cryptographic application. Second, we study the soundness of the natural expand-then-extract approach, where one uses a pseudorandom generator (PRG) to expand a short &quot;input seed&quot; S into a longer &quot;output seed&quot; S′, and then use the resulting S′ as the seed required by the LHL (or, more generally, by any randomness extractor). We show that, in general, the expand-then-extract approach is not sound if the Decisional Diffie-Hellman assumption is true. Despite that, we show that it is sound either: (1) when extracting a &quot;small&quot; (logarithmic in the security of the PRG) number of bits; or (2) in minicrypt. Implication (2) suggests that the expand-then-extract approach is likely secure when used with &quot;practical&quot; PRGs, despite lacking a reductionist proof of security! © 2011 International Association for Cryptologic Research."}],"publication_status":"published","month":"01","title":"Leftover hash lemma revisited","date_published":"2011-01-01T00:00:00Z","publisher":"Springer","date_updated":"2021-01-12T07:42:03Z","year":"2011","date_created":"2018-12-11T12:02:12Z","alternative_title":["LNCS"],"doi":" 10.1007/978-3-642-22792-9_1","status":"public","day":"01","citation":{"ieee":"B. Barak <i>et al.</i>, “Leftover hash lemma revisited,” presented at the CRYPTO: International Cryptology Conference, 2011, vol. 6841, pp. 1–20.","short":"B. Barak, Y. Dodis, H. Krawczyk, O. Pereira, K.Z. Pietrzak, F. Standaert, Y. Yu, in:, Springer, 2011, pp. 1–20.","ista":"Barak B, Dodis Y, Krawczyk H, Pereira O, Pietrzak KZ, Standaert F, Yu Y. 2011. Leftover hash lemma revisited. CRYPTO: International Cryptology Conference, LNCS, vol. 6841, 1–20.","ama":"Barak B, Dodis Y, Krawczyk H, et al. Leftover hash lemma revisited. In: Vol 6841. Springer; 2011:1-20. doi:<a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\"> 10.1007/978-3-642-22792-9_1</a>","apa":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K. Z., Standaert, F., &#38; Yu, Y. (2011). Leftover hash lemma revisited (Vol. 6841, pp. 1–20). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\">https://doi.org/ 10.1007/978-3-642-22792-9_1</a>","chicago":"Barak, Boaz, Yevgeniy Dodis, Hugo Krawczyk, Olivier Pereira, Krzysztof Z Pietrzak, François Standaert, and Yu Yu. “Leftover Hash Lemma Revisited,” 6841:1–20. Springer, 2011. <a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\">https://doi.org/ 10.1007/978-3-642-22792-9_1</a>.","mla":"Barak, Boaz, et al. <i>Leftover Hash Lemma Revisited</i>. Vol. 6841, Springer, 2011, pp. 1–20, doi:<a href=\"https://doi.org/ 10.1007/978-3-642-22792-9_1\"> 10.1007/978-3-642-22792-9_1</a>."},"quality_controlled":0,"conference":{"name":"CRYPTO: International Cryptology Conference"}},{"quality_controlled":"1","conference":{"start_date":"2011-12-05","name":"APLAS: Asian Symposium on Programming Languages and Systems","location":"Kenting, Taiwan","end_date":"2011-12-07"},"year":"2011","date_created":"2018-12-11T12:02:20Z","doi":"10.1007/978-3-642-25318-8_16","abstract":[{"text":"Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively au- tomated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexam- ples can be automated by a series of interpolation queries, or, alterna- tively, as a constraint solving query expressed by a set of recursion free Horn clauses. (A set of interpolation queries can be formulated as a single constraint over Horn clauses with linear dependency structure between the unknown relations.) In this paper we present an algorithm for solving recursion free Horn clauses over a combined theory of linear real/rational arithmetic and uninterpreted functions. Our algorithm performs resolu- tion to deal with the clausal structure and relies on partial solutions to deal with (non-local) instances of functionality axioms.","lang":"eng"}],"publication_status":"published","page":"188 - 203","title":"Solving recursion-free Horn clauses over LI+UIF","volume":7078,"editor":[{"last_name":"Yang","first_name":"Hongseok","full_name":"Yang, Hongseok"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"last_name":"Popeea","first_name":"Corneliu","full_name":"Popeea, Corneliu"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"citation":{"ama":"Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>","ista":"Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.","mla":"Gupta, Ashutosh, et al. <i>Solving Recursion-Free Horn Clauses over LI+UIF</i>. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>.","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>"},"ec_funded":1,"day":"05","status":"public","alternative_title":["LNCS"],"department":[{"_id":"ToHe"}],"publisher":"Springer","date_updated":"2024-10-21T06:03:01Z","language":[{"iso":"eng"}],"month":"12","date_published":"2011-12-05T00:00:00Z","type":"conference","oa_version":"None","intvolume":"      7078","_id":"3264","scopus_import":"1","publist_id":"3383"},{"type":"conference","volume":24,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Ion, Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87","last_name":"Ion","first_name":"Adrian"},{"full_name":"Carreira, Joao","first_name":"Joao","last_name":"Carreira"},{"full_name":"Sminchisescu, Cristian","first_name":"Cristian","last_name":"Sminchisescu"}],"intvolume":"        24","oa_version":"None","scopus_import":1,"_id":"3266","publist_id":"3381","publication_status":"published","abstract":[{"lang":"eng","text":"We present a joint image segmentation and labeling model (JSL) which, given a bag of figure-ground segment hypotheses extracted at multiple image locations and scales, constructs a joint probability distribution over both the compatible image interpretations (tilings or image segmentations) composed from those segments, and over their labeling into categories. The process of drawing samples from the joint distribution can be interpreted as first sampling tilings, modeled as maximal cliques, from a graph connecting spatially non-overlapping segments in the bag [1], followed by sampling labels for those segments, conditioned on the choice of a particular tiling. We learn the segmentation and labeling parameters jointly, based on Maximum Likelihood with a novel Incremental Saddle Point estimation procedure. The partition function over tilings and labelings is increasingly more accurately approximated by including incorrect configurations that a not-yet-competent model rates probable during learning. We show that the proposed methodologymatches the current state of the art in the Stanford dataset [2], as well as in VOC2010, where 41.7% accuracy on the test set is achieved."}],"page":"1827 - 1835","date_updated":"2021-01-12T07:42:15Z","publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"HeEd"}],"date_published":"2011-12-01T00:00:00Z","month":"12","title":"Probabilistic joint image segmentation and labeling","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:02:21Z","year":"2011","day":"01","status":"public","publication":"NIPS Proceedings","quality_controlled":"1","citation":{"chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Probabilistic Joint Image Segmentation and Labeling.” In <i>NIPS Proceedings</i>, 24:1827–35. Neural Information Processing Systems Foundation, 2011.","apa":"Ion, A., Carreira, J., &#38; Sminchisescu, C. (2011). Probabilistic joint image segmentation and labeling. In <i>NIPS Proceedings</i> (Vol. 24, pp. 1827–1835). Granada, Spain: Neural Information Processing Systems Foundation.","mla":"Ion, Adrian, et al. “Probabilistic Joint Image Segmentation and Labeling.” <i>NIPS Proceedings</i>, vol. 24, Neural Information Processing Systems Foundation, 2011, pp. 1827–35.","ieee":"A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in <i>NIPS Proceedings</i>, Granada, Spain, 2011, vol. 24, pp. 1827–1835.","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, NIPS Proceedings, Neural Information Processing Systems Foundation, 2011, pp. 1827–1835.","ama":"Ion A, Carreira J, Sminchisescu C. Probabilistic joint image segmentation and labeling. In: <i>NIPS Proceedings</i>. Vol 24. Neural Information Processing Systems Foundation; 2011:1827-1835.","ista":"Ion A, Carreira J, Sminchisescu C. 2011. Probabilistic joint image segmentation and labeling. NIPS Proceedings. NIPS: Neural Information Processing Systems vol. 24, 1827–1835."},"conference":{"location":"Granada, Spain","end_date":"2011-12-14","start_date":"2011-12-12","name":"NIPS: Neural Information Processing Systems"}},{"publist_id":"3379","_id":"3267","scopus_import":"1","oa_version":"None","intvolume":"        45","type":"journal_article","month":"01","language":[{"iso":"eng"}],"date_published":"2011-01-14T00:00:00Z","department":[{"_id":"HeEd"}],"publisher":"Springer","date_updated":"2025-09-30T09:22:32Z","isi":1,"day":"14","status":"public","citation":{"ieee":"C. Chen and D. Freedman, “Hardness results for homology localization,” <i>Discrete &#38; Computational Geometry</i>, vol. 45, no. 3. Springer, pp. 425–448, 2011.","short":"C. Chen, D. Freedman, Discrete &#38; Computational Geometry 45 (2011) 425–448.","ista":"Chen C, Freedman D. 2011. Hardness results for homology localization. Discrete &#38; Computational Geometry. 45(3), 425–448.","ama":"Chen C, Freedman D. Hardness results for homology localization. <i>Discrete &#38; Computational Geometry</i>. 2011;45(3):425-448. doi:<a href=\"https://doi.org/10.1007/s00454-010-9322-8\">10.1007/s00454-010-9322-8</a>","chicago":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s00454-010-9322-8\">https://doi.org/10.1007/s00454-010-9322-8</a>.","apa":"Chen, C., &#38; Freedman, D. (2011). Hardness results for homology localization. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-010-9322-8\">https://doi.org/10.1007/s00454-010-9322-8</a>","mla":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” <i>Discrete &#38; Computational Geometry</i>, vol. 45, no. 3, Springer, 2011, pp. 425–48, doi:<a href=\"https://doi.org/10.1007/s00454-010-9322-8\">10.1007/s00454-010-9322-8</a>."},"related_material":{"record":[{"id":"10909","relation":"earlier_version","status":"public"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"full_name":"Freedman, Daniel","first_name":"Daniel","last_name":"Freedman"}],"volume":45,"title":"Hardness results for homology localization","page":"425 - 448","article_processing_charge":"No","abstract":[{"text":"We address the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure. We study the problem with different measures: volume, diameter and radius. For volume, that is, the 1-norm of a cycle, two main results are presented. First, we prove that the problem is NP-hard to approximate within any constant factor. Second, we prove that for homology of dimension two or higher, the problem is NP-hard to approximate even when the Betti number is O(1). The latter result leads to the inapproximability of the problem of computing the nonbounding cycle with the smallest volume and computing cycles representing a homology basis with the minimal total volume. As for the other two measures defined by pairwise geodesic distance, diameter and radius, we show that the localization problem is NP-hard for diameter but is polynomial for radius. Our work is restricted to homology over the ℤ2 field.","lang":"eng"}],"external_id":{"isi":["000287146600005"]},"publication_status":"published","issue":"3","doi":"10.1007/s00454-010-9322-8","publication":"Discrete & Computational Geometry","year":"2011","date_created":"2018-12-11T12:02:21Z","corr_author":"1","quality_controlled":"1"},{"_id":"3268","publist_id":"3378","type":"book_chapter","extern":"1","oa_version":"None","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Freedman, Daniel","last_name":"Freedman","first_name":"Daniel"},{"first_name":"Chao","last_name":"Chen","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"}],"publisher":"Nova Science Publishers","date_updated":"2021-01-12T07:42:16Z","month":"11","language":[{"iso":"eng"}],"title":"Algebraic topology for computer vision","date_published":"2011-11-30T00:00:00Z","abstract":[{"text":"Algebraic topology is generally considered one of the purest subfield of mathematics. However, over the last decade two interesting new lines of research have emerged, one focusing on algorithms for algebraic topology, and the other on applications of algebraic topology in engineering and science. Amongst the new areas in which the techniques have been applied are computer vision and image processing. In this paper, we survey the results of these endeavours. Because algebraic topology is an area of mathematics with which most computer vision practitioners have no experience, we review the machinery behind the theories of homology and persistent homology; our review emphasizes intuitive explanations. In terms of applications to computer vision, we focus on four illustrative problems: shape signatures, natural image statistics, image denoising, and segmentation. Our hope is that this review will stimulate interest on the part of computer vision researchers to both use and extend the tools of this new field. ","lang":"eng"}],"publication_status":"published","page":"239 - 268","day":"30","status":"public","publication":"Computer Vision","alternative_title":["Computer Science, Technology and Applications"],"year":"2011","date_created":"2018-12-11T12:02:22Z","main_file_link":[{"url":"http://www.hpl.hp.com/techreports/2009/HPL-2009-375.pdf"}],"quality_controlled":"1","citation":{"short":"D. Freedman, C. Chen, in:, Computer Vision, Nova Science Publishers, 2011, pp. 239–268.","ieee":"D. Freedman and C. Chen, “Algebraic topology for computer vision,” in <i>Computer Vision</i>, Nova Science Publishers, 2011, pp. 239–268.","ista":"Freedman D, Chen C. 2011.Algebraic topology for computer vision. In: Computer Vision. Computer Science, Technology and Applications, , 239–268.","ama":"Freedman D, Chen C. Algebraic topology for computer vision. In: <i>Computer Vision</i>. Nova Science Publishers; 2011:239-268.","chicago":"Freedman, Daniel, and Chao Chen. “Algebraic Topology for Computer Vision.” In <i>Computer Vision</i>, 239–68. Nova Science Publishers, 2011.","apa":"Freedman, D., &#38; Chen, C. (2011). Algebraic topology for computer vision. In <i>Computer Vision</i> (pp. 239–268). Nova Science Publishers.","mla":"Freedman, Daniel, and Chao Chen. “Algebraic Topology for Computer Vision.” <i>Computer Vision</i>, Nova Science Publishers, 2011, pp. 239–68."}},{"isi":1,"oa":1,"date_published":"2011-07-19T00:00:00Z","month":"07","language":[{"iso":"eng"}],"date_updated":"2026-06-18T18:42:21Z","department":[{"_id":"HeEd"}],"publisher":"Wiley-Blackwell","intvolume":"        30","oa_version":"Published Version","article_type":"original","type":"journal_article","publist_id":"3377","scopus_import":"1","_id":"3269","citation":{"chicago":"Sheng, Yu, Barbara Cutler, Chao Chen, and Joshua Nasman. “Perceptual Global Illumination Cancellation in Complex Projection Environments.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">https://doi.org/10.1111/j.1467-8659.2011.01985.x</a>.","apa":"Sheng, Y., Cutler, B., Chen, C., &#38; Nasman, J. (2011). Perceptual global illumination cancellation in complex projection environments. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">https://doi.org/10.1111/j.1467-8659.2011.01985.x</a>","mla":"Sheng, Yu, et al. “Perceptual Global Illumination Cancellation in Complex Projection Environments.” <i>Computer Graphics Forum</i>, vol. 30, no. 4, Wiley-Blackwell, 2011, pp. 1261–68, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">10.1111/j.1467-8659.2011.01985.x</a>.","short":"Y. Sheng, B. Cutler, C. Chen, J. Nasman, Computer Graphics Forum 30 (2011) 1261–1268.","ieee":"Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination cancellation in complex projection environments,” <i>Computer Graphics Forum</i>, vol. 30, no. 4. Wiley-Blackwell, pp. 1261–1268, 2011.","ama":"Sheng Y, Cutler B, Chen C, Nasman J. Perceptual global illumination cancellation in complex projection environments. <i>Computer Graphics Forum</i>. 2011;30(4):1261-1268. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">10.1111/j.1467-8659.2011.01985.x</a>","ista":"Sheng Y, Cutler B, Chen C, Nasman J. 2011. Perceptual global illumination cancellation in complex projection environments. Computer Graphics Forum. 30(4), 1261–1268."},"status":"public","day":"19","article_processing_charge":"No","page":"1261 - 1268","external_id":{"isi":["000292884700011"]},"publication_status":"published","abstract":[{"text":"The unintentional scattering of light between neighboring surfaces in complex projection environments increases the brightness and decreases the contrast, disrupting the appearance of the desired imagery. To achieve satisfactory projection results, the inverse problem of global illumination must be solved to cancel this secondary scattering. In this paper, we propose a global illumination cancellation method that minimizes the perceptual difference between the desired imagery and the actual total illumination in the resulting physical environment. Using Gauss-Newton and active set methods, we design a fast solver for the bound constrained nonlinear least squares problem raised by the perceptual error metrics. Our solver is further accelerated with a CUDA implementation and multi-resolution method to achieve 1–2 fps for problems with approximately 3000 variables. We demonstrate the global illumination cancellation algorithm with our multi-projector system. Results show that our method preserves the color fidelity of the desired imagery significantly better than previous methods.","lang":"eng"}],"title":"Perceptual global illumination cancellation in complex projection environments","author":[{"full_name":"Sheng, Yu","first_name":"Yu","last_name":"Sheng"},{"first_name":"Barbara","last_name":"Cutler","full_name":"Cutler, Barbara"},{"last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"full_name":"Nasman, Joshua","first_name":"Joshua","last_name":"Nasman"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":30,"quality_controlled":"1","main_file_link":[{"url":"http://www.cs.cmu.edu/%7Eshengyu/download/egsr2011_paper.pdf","open_access":"1"}],"ddc":["500"],"date_created":"2018-12-11T12:02:22Z","year":"2011","doi":"10.1111/j.1467-8659.2011.01985.x","issue":"4","publication":"Computer Graphics Forum"},{"publist_id":"3376","_id":"3270","oa_version":"None","author":[{"last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael","orcid":"0000-0002-8030-9299","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"conference","title":"Persistent homology computation with a twist","month":"01","language":[{"iso":"eng"}],"date_published":"2011-01-01T00:00:00Z","department":[{"_id":"HeEd"}],"publisher":"TU Dortmund","date_updated":"2024-10-09T20:54:35Z","page":"197 - 200","abstract":[{"text":"The persistence diagram of a filtered simplicial com- plex is usually computed by reducing the boundary matrix of the complex. We introduce a simple op- timization technique: by processing the simplices of the complex in decreasing dimension, we can “kill” columns (i.e., set them to zero) without reducing them. This technique completely avoids reduction on roughly half of the columns. We demonstrate that this idea significantly improves the running time of the reduction algorithm in practice. We also give an output-sensitive complexity analysis for the new al- gorithm which yields to sub-cubic asymptotic bounds under certain assumptions.","lang":"eng"}],"publication_status":"published","status":"public","day":"01","year":"2011","date_created":"2018-12-11T12:02:22Z","conference":{"end_date":"2011-03-30","location":"Morschach, Switzerland","name":"EuroCG: European Workshop on Computational Geometry","start_date":"2011-03-28"},"corr_author":"1","citation":{"ista":"Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.","ama":"Chen C, Kerber M. Persistent homology computation with a twist. In: TU Dortmund; 2011:197-200.","ieee":"C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.","short":"C. Chen, M. Kerber, in:, TU Dortmund, 2011, pp. 197–200.","mla":"Chen, Chao, and Michael Kerber. <i>Persistent Homology Computation with a Twist</i>. TU Dortmund, 2011, pp. 197–200.","apa":"Chen, C., &#38; Kerber, M. (2011). Persistent homology computation with a twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland: TU Dortmund.","chicago":"Chen, Chao, and Michael Kerber. “Persistent Homology Computation with a Twist,” 197–200. TU Dortmund, 2011."},"quality_controlled":"1"},{"quality_controlled":"1","citation":{"chicago":"Wagner, Hubert, Chao Chen, and Erald Vuçini. “Efficient Computation of Persistent Homology for Cubical Data.” In <i>Topological Methods in Data Analysis and Visualization II</i>, edited by Ronald Peikert, Helwig Hauser, Hamish Carr, and Raphael Fuchs, 91–106. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">https://doi.org/10.1007/978-3-642-23175-9_7</a>.","apa":"Wagner, H., Chen, C., &#38; Vuçini, E. (2011). Efficient computation of persistent homology for cubical data. In R. Peikert, H. Hauser, H. Carr, &#38; R. Fuchs (Eds.), <i>Topological Methods in Data Analysis and Visualization II</i> (pp. 91–106). Springer. <a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">https://doi.org/10.1007/978-3-642-23175-9_7</a>","mla":"Wagner, Hubert, et al. “Efficient Computation of Persistent Homology for Cubical Data.” <i>Topological Methods in Data Analysis and Visualization II</i>, edited by Ronald Peikert et al., Springer, 2011, pp. 91–106, doi:<a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">10.1007/978-3-642-23175-9_7</a>.","ieee":"H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in <i>Topological Methods in Data Analysis and Visualization II</i>, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.","short":"H. Wagner, C. Chen, E. Vuçini, in:, R. Peikert, H. Hauser, H. Carr, R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II, Springer, 2011, pp. 91–106.","ama":"Wagner H, Chen C, Vuçini E. Efficient computation of persistent homology for cubical data. In: Peikert R, Hauser H, Carr H, Fuchs R, eds. <i>Topological Methods in Data Analysis and Visualization II</i>. Springer; 2011:91-106. doi:<a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">10.1007/978-3-642-23175-9_7</a>","ista":"Wagner H, Chen C, Vuçini E. 2011.Efficient computation of persistent homology for cubical data. In: Topological Methods in Data Analysis and Visualization II. Theory, Algorithms, and Applications, , 91–106."},"status":"public","day":"14","publication":"Topological Methods in Data Analysis and Visualization II","doi":"10.1007/978-3-642-23175-9_7","alternative_title":["Theory, Algorithms, and Applications"],"date_created":"2018-12-11T12:02:23Z","year":"2011","date_updated":"2021-01-12T07:42:18Z","department":[{"_id":"HeEd"}],"publisher":"Springer","date_published":"2011-11-14T00:00:00Z","title":"Efficient computation of persistent homology for cubical data","language":[{"iso":"eng"}],"month":"11","publication_status":"published","abstract":[{"lang":"eng","text":"In this paper we present an efficient framework for computation of persis- tent homology of cubical data in arbitrary dimensions. An existing algorithm using simplicial complexes is adapted to the setting of cubical complexes. The proposed approach enables efficient application of persistent homology in domains where the data is naturally given in a cubical form. By avoiding triangulation of the data, we significantly reduce the size of the complex. We also present a data-structure de- signed to compactly store and quickly manipulate cubical complexes. By means of numerical experiments, we show high speed and memory efficiency of our ap- proach. We compare our framework to other available implementations, showing its superiority. Finally, we report performance on selected 3D and 4D data-sets."}],"page":"91 - 106","scopus_import":1,"_id":"3271","publist_id":"3375","editor":[{"first_name":"Ronald","last_name":"Peikert","full_name":"Peikert, Ronald"},{"full_name":"Hauser, Helwig","last_name":"Hauser","first_name":"Helwig"},{"full_name":"Carr, Hamish","last_name":"Carr","first_name":"Hamish"},{"first_name":"Raphael","last_name":"Fuchs","full_name":"Fuchs, Raphael"}],"type":"book_chapter","author":[{"full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner"},{"last_name":"Chen","first_name":"Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"full_name":"Vuçini, Erald","last_name":"Vuçini","first_name":"Erald"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","oa_version":"None"},{"oa_version":"None","author":[{"id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3688-1474","full_name":"Maître, Jean-Léon","first_name":"Jean-Léon","last_name":"Maître"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","type":"dissertation","OA_place":"publisher","publist_id":"3373","_id":"3273","article_processing_charge":"No","publication_status":"published","month":"12","degree_awarded":"PhD","language":[{"iso":"eng"}],"title":"Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors","supervisor":[{"last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J"}],"date_published":"2011-12-12T00:00:00Z","department":[{"_id":"CaHe"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-04-09T14:36:45Z","year":"2011","date_created":"2018-12-11T12:02:23Z","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"day":"12","status":"public","corr_author":"1","citation":{"ama":"Maître J-L. Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors. 2011.","ista":"Maître J-L. 2011. Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors. Institute of Science and Technology Austria.","ieee":"J.-L. Maître, “Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors,” Institute of Science and Technology Austria, 2011.","short":"J.-L. Maître, Mechanics of Adhesion and De‐adhesion in Zebrafish Germ Layer Progenitors, Institute of Science and Technology Austria, 2011.","mla":"Maître, Jean-Léon. <i>Mechanics of Adhesion and De‐adhesion in Zebrafish Germ Layer Progenitors</i>. Institute of Science and Technology Austria, 2011.","chicago":"Maître, Jean-Léon. “Mechanics of Adhesion and De‐adhesion in Zebrafish Germ Layer Progenitors.” Institute of Science and Technology Austria, 2011.","apa":"Maître, J.-L. (2011). <i>Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors</i>. Institute of Science and Technology Austria."}},{"publication_identifier":{"issn":["2663-337X"]},"year":"2011","date_created":"2018-12-11T12:02:24Z","ddc":["570","579"],"has_accepted_license":"1","file":[{"access_level":"closed","checksum":"e69eee6252660f0b694a2ea8923ddc72","relation":"main_file","file_size":4487708,"date_updated":"2020-07-14T12:46:06Z","file_id":"6177","creator":"dernst","date_created":"2019-03-26T08:12:21Z","file_name":"2011_Thesis_Kathrin_Schumann.pdf","content_type":"application/pdf"},{"file_id":"9175","relation":"main_file","checksum":"71727d63f424b5b446f68f4b87ecadc0","access_level":"open_access","date_updated":"2021-02-22T11:24:30Z","file_size":4313127,"date_created":"2021-02-22T11:24:30Z","content_type":"application/pdf","file_name":"2011_Thesis_Schumann_noS.pdf","creator":"dernst","success":1}],"corr_author":"1","OA_place":"publisher","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"id":"F44D762E-4F9D-11E9-B64C-9EB26CEFFB5F","full_name":"Schumann, Kathrin","last_name":"Schumann","first_name":"Kathrin"}],"degree_awarded":"PhD","title":"The role of chemotactic gradients in dendritic cell migration","supervisor":[{"last_name":"Sixt","first_name":"Michael K","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179"}],"abstract":[{"lang":"eng","text":"Chemokines organize immune cell trafficking by inducing either directed (tactic) or random (kinetic) migration and by activating integrins in order to support surface adhesion (haptic). Beyond that the same chemokines can establish clearly defined functional areas in secondary lymphoid organs. Until now it is unclear how chemokines can fulfill such diverse functions. One decisive prerequisite to explain these capacities is to know how chemokines are presented in tissue. In theory chemokines could occur either soluble or immobilized, and could be distributed either homogenously or as a concentration gradient. To dissect if and how the presenting mode of chemokines influences immune cells, I tested the response of dendritic cells (DCs) to differentially displayed chemokines. DCs are antigen presenting cells that reside in the periphery and migrate into draining lymph nodes (LNs) once exposed to inflammatory stimuli to activate naïve T cells. DCs are guided to and within the LN by the chemokine receptor CCR7, which has two ligands, the chemokines CCL19 and CCL21. Both CCR7 ligands are expressed by fibroblastic reticular cells in the LN, but differ in their ability to bind to heparan sulfate residues. CCL21 has a highly charged C-terminal extension, which mediates binding to anionic surfaces, whereas CCL19 is lacking such residues and likely distributes as a soluble molecule. This study shows that surface-bound CCL21 causes random, haptokinetic DC motility, which is confined to the chemokine coated area by insideout activation of β2 integrins that mediate cell binding to the surface. CCL19 on the other hand forms concentration gradients which trigger directional, chemotactic movement, but no surface adhesion. In addition DCs can actively manipulate this system by recruiting and activating serine proteases on their surfaces, which create - by proteolytically removing the adhesive C-terminus - a solubilized variant of CCL21 that functionally resembles CCL19. By generating a CCL21 concentration gradient DCs establish a positive feedback loop to recruit further DCs from the periphery to the CCL21 coated region. In addition DCs can sense chemotactic gradients as well as immobilized haptokinetic fields at the same time and integrate these signals. The result is chemotactically biased haptokinesis - directional migration confined to a chemokine coated track or area - which could explain the dynamic but spatially tightly controlled swarming leukocyte locomotion patterns that have been observed in lymphatic organs by intravital microscopists. The finding that DCs can approach soluble cues in a non-adhesive manner while they attach to surfaces coated with immobilized cues raises the question how these cells transmit intracellular forces to the environment, especially in the non-adherent migration mode. In order to migrate, cells have to generate and transmit force to the extracellular substrate. Force transmission is the prerequisite to procure an expansion of the leading edge and a forward motion of the whole cell body. In the current conceptions actin polymerization at the leading edge is coupled to extracellular ligands via the integrin family of transmembrane receptors, which allows the transmission of intracellular force. Against the paradigm of force transmission during migration, leukocytes, like DCs, are able to migrate in threedimensional environments without using integrin transmembrane receptors (Lämmermann et al., 2008). This reflects the biological function of leukocytes, as they can invade almost all tissues, whereby their migration has to be independent from the extracellular environment. How the cells can achieve this is unclear. For this study I examined DC migration in a defined threedimensional environment and highlighted actin-dynamics with the probe Lifeact-GFP. The result was that chemotactic DCs can switch between integrin-dependent and integrin- independent locomotion and can thereby adapt to the adhesive properties of their environment. If the cells are able to couple their actin cytoskeleton to the substrate, actin polymerization is entirely converted into protrusion. Without coupling the actin cortex undergoes slippage and retrograde actin flow can be observed. But retrograde actin flow can be completely compensated by higher actin polymerization rate keeping the migration velocity and the shape of the cells unaltered. Mesenchymal cells like fibroblast cannot balance the loss of adhesive interaction, cannot protrude into open space and, therefore, strictly depend on integrinmediated force coupling. This leukocyte specific phenomenon of “adaptive force transmission” endows these cells with the unique ability to transit and invade almost every type of tissue. "}],"publication_status":"published","page":"141","article_processing_charge":"No","pubrep_id":"11","status":"public","day":"01","alternative_title":["ISTA Thesis"],"citation":{"short":"K. Schumann, The Role of Chemotactic Gradients in Dendritic Cell Migration, Institute of Science and Technology Austria, 2011.","ieee":"K. Schumann, “The role of chemotactic gradients in dendritic cell migration,” Institute of Science and Technology Austria, 2011.","ama":"Schumann K. The role of chemotactic gradients in dendritic cell migration. 2011.","ista":"Schumann K. 2011. The role of chemotactic gradients in dendritic cell migration. Institute of Science and Technology Austria.","apa":"Schumann, K. (2011). <i>The role of chemotactic gradients in dendritic cell migration</i>. Institute of Science and Technology Austria.","chicago":"Schumann, Kathrin. “The Role of Chemotactic Gradients in Dendritic Cell Migration.” Institute of Science and Technology Austria, 2011.","mla":"Schumann, Kathrin. <i>The Role of Chemotactic Gradients in Dendritic Cell Migration</i>. Institute of Science and Technology Austria, 2011."},"_id":"3275","publist_id":"3371","type":"dissertation","acknowledgement":"I would like to express my sincere gratitude to the following people who made with their continuous support and encouragement this thesis possible: First, I want to thank Prof. Dr. Michael Sixt for his excellent supervision and mentoring, especially for the nice, relaxed working atmosphere, a lot of brilliant ideas and the freedom to work in my own way.\r\n\r\nProf. Dr. Reinhard Fässler for his constant support of the Sixt lab and for providing excellent working conditions. \r\n\r\nProf. Dr. Sanjiv Luther and Prof. Dr. Tobias Bollenbach for agreeing to be member of my thesis committee and to evaluate my work.\r\n\r\nDr. Walther Göhring, Carmen Schmitz, the Recombinant Protein Production core facility and the animal care takers for providing the “infrastructure” for this thesis. \r\n\r\nProf. Dr. Daniel Legler, Markus Bruckner and Dr. Julien Polleux for very fruitful collaborations and discussions.\r\n\r\nMy labmates for their help, a lot of discussions and to make the Sixt lab to a convenient place to work : Karin Hirsch, Tim Lämmeramnn, Holger Pflicke, Jörg Renkawitz, Michele Weber and Alexander Eichner All members of the Department of Molecular Medicine for their help. Especially I want to thank Sarah Schmidt, Karin Hirsch and Raphael Ruppert for their friendship, nice chats and their uncensored point of view. ","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","department":[{"_id":"MiSi"}],"date_updated":"2026-04-09T14:36:24Z","language":[{"iso":"eng"}],"month":"03","date_published":"2011-03-01T00:00:00Z","oa":1,"file_date_updated":"2021-02-22T11:24:30Z"},{"_id":"3276","publist_id":"3370","type":"journal_article","volume":6,"acknowledgement":"This work was supported by National Science Foundation (NSF) grants IBN-0344678, EF-0928048, National Institutes of Health (NIH) grant RO1 EY08124, NIH training grant T32-07035, and NIH training grant 5T90DA022763-04.\n\nMichael Berry and Olivier Marre have developed an algorithm similar to, but different from, ours (manuscript in preparation). We thank them for discussions of their work, and specifically thank Olivier Marre for suggesting to us that the most complete subtraction of a spike can be obtained by refitting the spike without a prior.\n\n","extern":1,"intvolume":"         6","author":[{"full_name":"Prentice, Jason S","last_name":"Prentice","first_name":"Jason"},{"full_name":"Homann, Jan","first_name":"Jan","last_name":"Homann"},{"full_name":"Simmons, Kristina D","last_name":"Simmons","first_name":"Kristina"},{"first_name":"Gasper","last_name":"Tkacik","full_name":"Gasper Tkacik","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Balasubramanian, Vijay","last_name":"Balasubramanian","first_name":"Vijay"},{"first_name":"Philip","last_name":"Nelson","full_name":"Nelson, Philip C"}],"publisher":"Public Library of Science","date_updated":"2021-01-12T07:42:19Z","month":"07","title":"Fast, scalable, Bayesian spike identification for multi-electrode arrays","date_published":"2011-07-20T00:00:00Z","abstract":[{"text":"We present an algorithm to identify individual neural spikes observed on high-density multi-electrode arrays (MEAs). Our method can distinguish large numbers of distinct neural units, even when spikes overlap, and accounts for intrinsic variability of spikes from each unit. As MEAs grow larger, it is important to find spike-identification methods that are scalable, that is, the computational cost of spike fitting should scale well with the number of units observed. Our algorithm accomplishes this goal, and is fast, because it exploits the spatial locality of each unit and the basic biophysics of extracellular signal propagation. Human interaction plays a key role in our method; but effort is minimized and streamlined via a graphical interface. We illustrate our method on data from guinea pig retinal ganglion cells and document its performance on simulated data consisting of spikes added to experimentally measured background noise. We present several tests demonstrating that the algorithm is highly accurate: it exhibits low error rates on fits to synthetic data, low refractory violation rates, good receptive field coverage, and consistency across users.","lang":"eng"}],"oa":1,"publication_status":"published","file_date_updated":"2020-07-14T12:46:06Z","pubrep_id":"381","status":"public","publication":"PLoS One","day":"20","issue":"7","doi":"10.1371/journal.pone.0019884","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"year":"2011","date_created":"2018-12-11T12:02:24Z","quality_controlled":0,"file":[{"creator":"system","content_type":"application/pdf","file_name":"IST-2015-381-v1+1_journal.pone.0019884.pdf","date_created":"2018-12-12T10:11:38Z","date_updated":"2020-07-14T12:46:06Z","file_size":885464,"relation":"main_file","checksum":"654464e99683b55a699734213d5356f1","access_level":"open_access","file_id":"4894"}],"citation":{"ista":"Prentice J, Homann J, Simmons K, Tkačik G, Balasubramanian V, Nelson P. 2011. Fast, scalable, Bayesian spike identification for multi-electrode arrays. PLoS One. 6(7).","ama":"Prentice J, Homann J, Simmons K, Tkačik G, Balasubramanian V, Nelson P. Fast, scalable, Bayesian spike identification for multi-electrode arrays. <i>PLoS One</i>. 2011;6(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0019884\">10.1371/journal.pone.0019884</a>","ieee":"J. Prentice, J. Homann, K. Simmons, G. Tkačik, V. Balasubramanian, and P. Nelson, “Fast, scalable, Bayesian spike identification for multi-electrode arrays,” <i>PLoS One</i>, vol. 6, no. 7. Public Library of Science, 2011.","short":"J. Prentice, J. Homann, K. Simmons, G. Tkačik, V. Balasubramanian, P. Nelson, PLoS One 6 (2011).","mla":"Prentice, Jason, et al. “Fast, Scalable, Bayesian Spike Identification for Multi-Electrode Arrays.” <i>PLoS One</i>, vol. 6, no. 7, Public Library of Science, 2011, doi:<a href=\"https://doi.org/10.1371/journal.pone.0019884\">10.1371/journal.pone.0019884</a>.","chicago":"Prentice, Jason, Jan Homann, Kristina Simmons, Gašper Tkačik, Vijay Balasubramanian, and Philip Nelson. “Fast, Scalable, Bayesian Spike Identification for Multi-Electrode Arrays.” <i>PLoS One</i>. Public Library of Science, 2011. <a href=\"https://doi.org/10.1371/journal.pone.0019884\">https://doi.org/10.1371/journal.pone.0019884</a>.","apa":"Prentice, J., Homann, J., Simmons, K., Tkačik, G., Balasubramanian, V., &#38; Nelson, P. (2011). Fast, scalable, Bayesian spike identification for multi-electrode arrays. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0019884\">https://doi.org/10.1371/journal.pone.0019884</a>"}},{"publist_id":"3368","_id":"3278","author":[{"full_name":"Vila, Roger","first_name":"Roger","last_name":"Vila"},{"first_name":"Naomi","last_name":"Pierce","full_name":"Pierce, Naomi E"},{"full_name":"Nash, David R","first_name":"David","last_name":"Nash"},{"full_name":"Line Ugelvig","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","first_name":"Line V","last_name":"Ugelvig"}],"intvolume":"        61","extern":1,"volume":61,"type":"journal_article","date_published":"2011-10-01T00:00:00Z","month":"10","title":"A phylogenetic revision of the Glaucopsyche section (Lepidoptera: Lycaenidae), with special focus on the Phengaris-Maculinea clade","date_updated":"2021-01-12T07:42:20Z","publisher":"Elsevier","page":"237 - 243","publication_status":"published","abstract":[{"text":"Despite much research on the socially parasitic large blue butterflies (genus Maculinea) in the past 40 years, their relationship to their closest relatives, Phengaris, is controversial and the relationships among the remaining genera in the Glaucopsyche section are largely unresolved. The evolutionary history of this butterfly section is particularly important to understand the evolution of life history diversity con- nected to food-plant and host-ant associations in the larval stage. In the present study, we use a combi- nation of four nuclear and two mitochondrial genes to reconstruct the phylogeny of the Glaucopsyche section, and in particular, to study the relationships among and within the Phengaris–Maculinea species.\nWe find a clear pattern between the clades recovered in the Glaucopsyche section phylogeny and their food-plant associations, with only the Phengaris–Maculinea clade utilising more than one plant family. Maculinea is, for the first time, recovered with strong support as a monophyletic group nested within Phengaris, with the closest relative being the rare genus Caerulea. The genus Glaucopsyche is polyphyletic, including the genera Sinia and Iolana. Interestingly, we find evidence for additional potential cryptic spe- cies within the highly endangered Maculinea, which has long been suspected from morphological, ecolog- ical and molecular studies.","lang":"eng"}],"doi":"10.1016/j.ympev.2011.05.016","issue":"1","status":"public","publication":"Molecular Phylogenetics and Evolution","day":"01","date_created":"2018-12-11T12:02:25Z","year":"2011","citation":{"ista":"Vila R, Pierce N, Nash D, Ugelvig LV. 2011. A phylogenetic revision of the Glaucopsyche section (Lepidoptera: Lycaenidae), with special focus on the Phengaris-Maculinea clade. Molecular Phylogenetics and Evolution. 61(1), 237–243.","ama":"Vila R, Pierce N, Nash D, Ugelvig LV. A phylogenetic revision of the Glaucopsyche section (Lepidoptera: Lycaenidae), with special focus on the Phengaris-Maculinea clade. <i>Molecular Phylogenetics and Evolution</i>. 2011;61(1):237-243. doi:<a href=\"https://doi.org/10.1016/j.ympev.2011.05.016\">10.1016/j.ympev.2011.05.016</a>","short":"R. Vila, N. Pierce, D. Nash, L.V. Ugelvig, Molecular Phylogenetics and Evolution 61 (2011) 237–243.","ieee":"R. Vila, N. Pierce, D. Nash, and L. V. Ugelvig, “A phylogenetic revision of the Glaucopsyche section (Lepidoptera: Lycaenidae), with special focus on the Phengaris-Maculinea clade,” <i>Molecular Phylogenetics and Evolution</i>, vol. 61, no. 1. Elsevier, pp. 237–243, 2011.","mla":"Vila, Roger, et al. “A Phylogenetic Revision of the Glaucopsyche Section (Lepidoptera: Lycaenidae), with Special Focus on the Phengaris-Maculinea Clade.” <i>Molecular Phylogenetics and Evolution</i>, vol. 61, no. 1, Elsevier, 2011, pp. 237–43, doi:<a href=\"https://doi.org/10.1016/j.ympev.2011.05.016\">10.1016/j.ympev.2011.05.016</a>.","apa":"Vila, R., Pierce, N., Nash, D., &#38; Ugelvig, L. V. (2011). A phylogenetic revision of the Glaucopsyche section (Lepidoptera: Lycaenidae), with special focus on the Phengaris-Maculinea clade. <i>Molecular Phylogenetics and Evolution</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ympev.2011.05.016\">https://doi.org/10.1016/j.ympev.2011.05.016</a>","chicago":"Vila, Roger, Naomi Pierce, David Nash, and Line V Ugelvig. “A Phylogenetic Revision of the Glaucopsyche Section (Lepidoptera: Lycaenidae), with Special Focus on the Phengaris-Maculinea Clade.” <i>Molecular Phylogenetics and Evolution</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ympev.2011.05.016\">https://doi.org/10.1016/j.ympev.2011.05.016</a>."},"quality_controlled":0},{"citation":{"ista":"Ruprecht V, Wieser S, Marguet D, Schuetz G. 2011. Spot variation fluorescence correlation spectroscopy allows for superresolution chronoscopy of confinement times in membranes. Biophysical Journal. 100(11), 2839–2845.","ama":"Ruprecht V, Wieser S, Marguet D, Schuetz G. Spot variation fluorescence correlation spectroscopy allows for superresolution chronoscopy of confinement times in membranes. <i>Biophysical Journal</i>. 2011;100(11):2839-2845. doi:<a href=\"https://doi.org/10.1016/j.bpj.2011.04.035\">10.1016/j.bpj.2011.04.035</a>","ieee":"V. Ruprecht, S. Wieser, D. Marguet, and G. Schuetz, “Spot variation fluorescence correlation spectroscopy allows for superresolution chronoscopy of confinement times in membranes,” <i>Biophysical Journal</i>, vol. 100, no. 11. Biophysical Society, pp. 2839–2845, 2011.","short":"V. Ruprecht, S. Wieser, D. Marguet, G. Schuetz, Biophysical Journal 100 (2011) 2839–2845.","mla":"Ruprecht, Verena, et al. “Spot Variation Fluorescence Correlation Spectroscopy Allows for Superresolution Chronoscopy of Confinement Times in Membranes.” <i>Biophysical Journal</i>, vol. 100, no. 11, Biophysical Society, 2011, pp. 2839–45, doi:<a href=\"https://doi.org/10.1016/j.bpj.2011.04.035\">10.1016/j.bpj.2011.04.035</a>.","apa":"Ruprecht, V., Wieser, S., Marguet, D., &#38; Schuetz, G. (2011). Spot variation fluorescence correlation spectroscopy allows for superresolution chronoscopy of confinement times in membranes. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1016/j.bpj.2011.04.035\">https://doi.org/10.1016/j.bpj.2011.04.035</a>","chicago":"Ruprecht, Verena, Stefan Wieser, Didier Marguet, and Gerhard Schuetz. “Spot Variation Fluorescence Correlation Spectroscopy Allows for Superresolution Chronoscopy of Confinement Times in Membranes.” <i>Biophysical Journal</i>. Biophysical Society, 2011. <a href=\"https://doi.org/10.1016/j.bpj.2011.04.035\">https://doi.org/10.1016/j.bpj.2011.04.035</a>."},"date_created":"2018-12-11T12:02:27Z","year":"2011","doi":"10.1016/j.bpj.2011.04.035","issue":"11","status":"public","publication":"Biophysical Journal","day":"08","page":"2839 - 2845","publication_status":"published","abstract":[{"text":"Resolving the dynamical interplay of proteins and lipids in the live-cell plasma membrane represents a central goal in current cell biology. Superresolution concepts have introduced a means of capturing spatial heterogeneity at a nanoscopic length scale. Similar concepts for detecting dynamical transitions (superresolution chronoscopy) are still lacking. Here, we show that recently introduced spot-variation fluorescence correlation spectroscopy allows for sensing transient confinement times of membrane constituents at dramatically improved resolution. Using standard diffraction-limited optics, spot-variation fluorescence correlation spectroscopy captures signatures of single retardation events far below the transit time of the tracer through the focal spot. We provide an analytical description of special cases of transient binding of a tracer to pointlike traps, or association of a tracer with nanodomains. The influence of trap mobility and the underlying binding kinetics are quantified. Experimental approaches are suggested that allow for gaining quantitative mechanistic insights into the interaction processes of membrane constituents.","lang":"eng"}],"date_published":"2011-06-08T00:00:00Z","title":"Spot variation fluorescence correlation spectroscopy allows for superresolution chronoscopy of confinement times in membranes","language":[{"iso":"eng"}],"month":"06","date_updated":"2021-01-12T07:42:23Z","publisher":"Biophysical Society","author":[{"full_name":"Ruprecht, Verena","id":"4D71A03A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4088-8633","first_name":"Verena","last_name":"Ruprecht"},{"last_name":"Wieser","first_name":"Stefan","full_name":"Wieser, Stefan","id":"355AA5A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2670-2217"},{"full_name":"Marguet, Didier","first_name":"Didier","last_name":"Marguet"},{"full_name":"Schuetz, Gerhard","last_name":"Schuetz","first_name":"Gerhard"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":"       100","oa_version":"None","extern":"1","acknowledgement":"Y 250-B03/Austrian Science Fund FWF/Austria","volume":100,"type":"journal_article","publist_id":"3360","_id":"3285"}]