[{"author":[{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"full_name":"Wainwright, Martin J","last_name":"Wainwright","first_name":"Martin"}],"date_updated":"2021-01-12T07:41:38Z","month":"07","extern":1,"page":"316 - 323","status":"public","publisher":"AUAI Press","citation":{"mla":"Kolmogorov, Vladimir, and Martin Wainwright. <i>On the Optimality of Tree Reweighted Max Product Message Passing</i>. AUAI Press, 2005, pp. 316–23.","short":"V. Kolmogorov, M. Wainwright, in:, AUAI Press, 2005, pp. 316–323.","ieee":"V. Kolmogorov and M. Wainwright, “On the optimality of tree reweighted max product message passing,” presented at the UAI: Uncertainty in Artificial Intelligence, 2005, pp. 316–323.","apa":"Kolmogorov, V., &#38; Wainwright, M. (2005). On the optimality of tree reweighted max product message passing (pp. 316–323). Presented at the UAI: Uncertainty in Artificial Intelligence, AUAI Press.","ama":"Kolmogorov V, Wainwright M. On the optimality of tree reweighted max product message passing. In: AUAI Press; 2005:316-323.","ista":"Kolmogorov V, Wainwright M. 2005. On the optimality of tree reweighted max product message passing. UAI: Uncertainty in Artificial Intelligence, 316–323.","chicago":"Kolmogorov, Vladimir, and Martin Wainwright. “On the Optimality of Tree Reweighted Max Product Message Passing,” 316–23. AUAI Press, 2005."},"day":"01","_id":"3181","abstract":[{"lang":"eng","text":"Tree-reweighted max-product (TRW) message passing [9] is a modified form of the ordinary max-product algorithm for attempting to find minimal energy configurations in Markov random field with cycles. For a TRW fixed point satisfying the strong tree agreement condition, the algorithm outputs a configuration that is provably optimal. In this paper, we focus on the case of binary variables with pairwise couplings, and establish stronger properties of TRW fixed points that satisfy only the milder condition of weak tree agreement (WTA). First, we demonstrate how it is possible to identify part of the optimal solution - i.e., a provably optimal solution for a subset of nodes - without knowing a complete solution. Second, we show that for submodular functions, a WTA fixed point always yields a globally optimal solution. We establish that for binary variables, any WTA fixed point always achieves the global maximum of the linear programming relaxation underlying the TRW method."}],"publication_status":"published","quality_controlled":0,"conference":{"name":"UAI: Uncertainty in Artificial Intelligence"},"type":"conference","publist_id":"3500","title":"On the optimality of tree reweighted max product message passing","date_created":"2018-12-11T12:01:51Z","date_published":"2005-07-01T00:00:00Z","main_file_link":[{"url":"http://research.microsoft.com/pubs/67405/trw_opt_uai05.pdf","open_access":"0"}],"year":"2005"},{"abstract":[{"text":"In the work of the authors (2003), we showed that graph cuts can find hypersurfaces of globally minimal length (or area) under any Riemannian metric. Here we show that graph cuts on directed regular grids can approximate a significantly more general class of continuous non-symmetric metrics. Using submodularity condition (Boros and Hammer, 2002 and Kolmogorov and Zabih, 2004), we obtain a tight characterization of graph-representable metrics. Such &quot;submodular&quot; metrics have an elegant geometric interpretation via hypersurface functionals combining length/area and flux. Practically speaking, we attend 'geo-cuts' algorithm to a wider class of geometrically motivated hypersurface functionals and show how to globally optimize any combination of length/area and flux of a given vector field. The concept of flux was recently introduced into computer vision by Vasilevskiy and Siddiqi (2002) but it was mainly studied within variational framework so far. We are first to show that flux can be integrated into graph cuts as well. Combining geometric concepts of flux and length/area within the global optimization framework of graph cuts allows principled discrete segmentation models and advances the slate of the art for the graph cuts methods in vision. In particular we address the &quot;shrinking&quot; problem of graph cuts, improve segmentation of long thin objects, and introduce useful shape constraints.","lang":"eng"}],"_id":"3182","quality_controlled":0,"conference":{"name":"ICCV: International Conference on Computer Vision"},"publication_status":"published","type":"conference","publist_id":"3501","citation":{"apa":"Kolmogorov, V., &#38; Boykov, Y. (2005). What metrics can be approximated by geo cuts or global optimization of length area and flux (Vol. 1, pp. 564–571). Presented at the ICCV: International Conference on Computer Vision, IEEE. <a href=\"https://doi.org/10.1109/ICCV.2005.252\">https://doi.org/10.1109/ICCV.2005.252</a>","short":"V. Kolmogorov, Y. Boykov, in:, IEEE, 2005, pp. 564–571.","ieee":"V. Kolmogorov and Y. Boykov, “What metrics can be approximated by geo cuts or global optimization of length area and flux,” presented at the ICCV: International Conference on Computer Vision, 2005, vol. 1, pp. 564–571.","mla":"Kolmogorov, Vladimir, and Yuri Boykov. <i>What Metrics Can Be Approximated by Geo Cuts or Global Optimization of Length Area and Flux</i>. Vol. 1, IEEE, 2005, pp. 564–71, doi:<a href=\"https://doi.org/10.1109/ICCV.2005.252\">10.1109/ICCV.2005.252</a>.","chicago":"Kolmogorov, Vladimir, and Yuri Boykov. “What Metrics Can Be Approximated by Geo Cuts or Global Optimization of Length Area and Flux,” 1:564–71. IEEE, 2005. <a href=\"https://doi.org/10.1109/ICCV.2005.252\">https://doi.org/10.1109/ICCV.2005.252</a>.","ista":"Kolmogorov V, Boykov Y. 2005. What metrics can be approximated by geo cuts or global optimization of length area and flux. ICCV: International Conference on Computer Vision vol. 1, 564–571.","ama":"Kolmogorov V, Boykov Y. What metrics can be approximated by geo cuts or global optimization of length area and flux. In: Vol 1. IEEE; 2005:564-571. doi:<a href=\"https://doi.org/10.1109/ICCV.2005.252\">10.1109/ICCV.2005.252</a>"},"day":"05","intvolume":"         1","year":"2005","title":"What metrics can be approximated by geo cuts or global optimization of length area and flux","date_created":"2018-12-11T12:01:52Z","date_published":"2005-12-05T00:00:00Z","doi":"10.1109/ICCV.2005.252","author":[{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Yuri","last_name":"Boykov","full_name":"Boykov, Yuri"}],"volume":1,"date_updated":"2021-01-12T07:41:38Z","month":"12","status":"public","page":"564 - 571","publisher":"IEEE","extern":1},{"publisher":"IEEE","page":"407 - 414","status":"public","extern":1,"doi":"10.1109/CVPR.2005.91","month":"07","date_updated":"2021-01-12T07:41:38Z","volume":2,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov"},{"full_name":"Criminisi, Antonio","last_name":"Criminisi","first_name":"Antonio"},{"first_name":"Andrew","full_name":"Blake, Andrew","last_name":"Blake"},{"first_name":"Geoffrey","full_name":"Cross, Geoffrey","last_name":"Cross"},{"first_name":"Carsten","full_name":"Rother, Carsten","last_name":"Rother"}],"year":"2005","intvolume":"         2","main_file_link":[{"open_access":"0","url":"http://research.microsoft.com/pubs/67281/criminisi_cvpr2005.pdf"}],"date_published":"2005-07-25T00:00:00Z","date_created":"2018-12-11T12:01:52Z","title":"Bi-layer segmentation of binocular stereo video","publist_id":"3502","type":"conference","publication_status":"published","quality_controlled":0,"conference":{"name":"CVPR: Computer Vision and Pattern Recognition"},"_id":"3183","abstract":[{"lang":"eng","text":"This paper describes two algorithms capable of real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contrast or from stereo alone is known to be error-prone. Here, colour, contrast and stereo matching information are fused to infer layers accurately and efficiently. The first algorithm, Layered Dynamic Programming (LDP), solves stereo in an extended 6-state space that represents both foreground/background layers and occluded regions. The stereo-match likelihood is then fused with a contrast-sensitive colour model that is learned on the fly, and stereo disparities are obtained by dynamic programming. The second algorithm, Layered Graph Cut (LGC), does not directly solve stereo. Instead the stereo match likelihood is marginalised over foreground and background hypotheses, and fused with a contrast-sensitive colour model like the one used in LDP. Segmentation is solved efficiently by ternary graph cut. Both algorithms are evaluated with respect to ground truth data and found to have similar perfomance, substantially better than stereo or colour/contrast alone. However, their characteristics with respect to computational efficiency are rather different. The algorithms are demonstrated in the application of background substitution and shown to give good quality composite video output."}],"citation":{"apa":"Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., &#38; Rother, C. (2005). Bi-layer segmentation of binocular stereo video (Vol. 2, pp. 407–414). Presented at the CVPR: Computer Vision and Pattern Recognition, IEEE. <a href=\"https://doi.org/10.1109/CVPR.2005.91\">https://doi.org/10.1109/CVPR.2005.91</a>","mla":"Kolmogorov, Vladimir, et al. <i>Bi-Layer Segmentation of Binocular Stereo Video</i>. Vol. 2, IEEE, 2005, pp. 407–14, doi:<a href=\"https://doi.org/10.1109/CVPR.2005.91\">10.1109/CVPR.2005.91</a>.","ieee":"V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, and C. Rother, “Bi-layer segmentation of binocular stereo video,” presented at the CVPR: Computer Vision and Pattern Recognition, 2005, vol. 2, pp. 407–414.","short":"V. Kolmogorov, A. Criminisi, A. Blake, G. Cross, C. Rother, in:, IEEE, 2005, pp. 407–414.","chicago":"Kolmogorov, Vladimir, Antonio Criminisi, Andrew Blake, Geoffrey Cross, and Carsten Rother. “Bi-Layer Segmentation of Binocular Stereo Video,” 2:407–14. IEEE, 2005. <a href=\"https://doi.org/10.1109/CVPR.2005.91\">https://doi.org/10.1109/CVPR.2005.91</a>.","ama":"Kolmogorov V, Criminisi A, Blake A, Cross G, Rother C. Bi-layer segmentation of binocular stereo video. In: Vol 2. IEEE; 2005:407-414. doi:<a href=\"https://doi.org/10.1109/CVPR.2005.91\">10.1109/CVPR.2005.91</a>","ista":"Kolmogorov V, Criminisi A, Blake A, Cross G, Rother C. 2005. Bi-layer segmentation of binocular stereo video. CVPR: Computer Vision and Pattern Recognition vol. 2, 407–414."},"day":"25"},{"status":"public","page":"527 - 545","publisher":"Springer","extern":1,"doi":"10.1007/11535218_32","acknowledgement":"Pietrzak was supported by the Swiss National Science Foundation, project No. 200020-103847/1.","month":"09","volume":3621,"author":[{"full_name":"Bellare, Mihir","last_name":"Bellare","first_name":"Mihir"},{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Krzysztof Pietrzak","last_name":"Pietrzak"},{"last_name":"Rogaway","full_name":"Rogaway, Phillip","first_name":"Phillip"}],"date_updated":"2021-01-12T07:41:50Z","year":"2005","intvolume":"      3621","title":"Improved security analyses for CBC MACs","alternative_title":["LNCS"],"date_created":"2018-12-11T12:02:02Z","date_published":"2005-09-12T00:00:00Z","quality_controlled":0,"conference":{"name":"CRYPTO: International Cryptology Conference"},"publication_status":"published","type":"conference","publist_id":"3469","_id":"3211","abstract":[{"text":"We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bits. The result assumes that no message queried is a prefix of any other, as is the case when all messages to be MACed have the same length. We go on to give an improved analysis of the encrypted CBC MAC, where there is no restriction on queried messages. Letting m be the block length of the longest query, our bounds are about mq2/2n for the basic CBC MAC and mo(1)q2/2n for the encrypted CBC MAC, improving prior bounds of m2q2/2n. The new bounds translate into improved guarantees on the probability of forging these MACs.","lang":"eng"}],"citation":{"chicago":"Bellare, Mihir, Krzysztof Z Pietrzak, and Phillip Rogaway. “Improved Security Analyses for CBC MACs,” 3621:527–45. Springer, 2005. <a href=\"https://doi.org/10.1007/11535218_32\">https://doi.org/10.1007/11535218_32</a>.","ama":"Bellare M, Pietrzak KZ, Rogaway P. Improved security analyses for CBC MACs. In: Vol 3621. Springer; 2005:527-545. doi:<a href=\"https://doi.org/10.1007/11535218_32\">10.1007/11535218_32</a>","ista":"Bellare M, Pietrzak KZ, Rogaway P. 2005. Improved security analyses for CBC MACs. CRYPTO: International Cryptology Conference, LNCS, vol. 3621, 527–545.","apa":"Bellare, M., Pietrzak, K. Z., &#38; Rogaway, P. (2005). Improved security analyses for CBC MACs (Vol. 3621, pp. 527–545). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/10.1007/11535218_32\">https://doi.org/10.1007/11535218_32</a>","mla":"Bellare, Mihir, et al. <i>Improved Security Analyses for CBC MACs</i>. Vol. 3621, Springer, 2005, pp. 527–45, doi:<a href=\"https://doi.org/10.1007/11535218_32\">10.1007/11535218_32</a>.","ieee":"M. Bellare, K. Z. Pietrzak, and P. Rogaway, “Improved security analyses for CBC MACs,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 527–545.","short":"M. Bellare, K.Z. Pietrzak, P. Rogaway, in:, Springer, 2005, pp. 527–545."},"day":"12"},{"citation":{"ista":"Dodis Y, Oliveira R, Pietrzak KZ. 2005. On the generic insecurity of the full domain hash. CRYPTO: International Cryptology Conference, LNCS, vol. 3621, 449–466.","ama":"Dodis Y, Oliveira R, Pietrzak KZ. On the generic insecurity of the full domain hash. In: Vol 3621. Springer; 2005:449-466. doi:<a href=\"https://doi.org/10.1007/11535218_27\">10.1007/11535218_27</a>","chicago":"Dodis, Yevgeniy, Roberto Oliveira, and Krzysztof Z Pietrzak. “On the Generic Insecurity of the Full Domain Hash,” 3621:449–66. Springer, 2005. <a href=\"https://doi.org/10.1007/11535218_27\">https://doi.org/10.1007/11535218_27</a>.","ieee":"Y. Dodis, R. Oliveira, and K. Z. Pietrzak, “On the generic insecurity of the full domain hash,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 449–466.","short":"Y. Dodis, R. Oliveira, K.Z. Pietrzak, in:, Springer, 2005, pp. 449–466.","mla":"Dodis, Yevgeniy, et al. <i>On the Generic Insecurity of the Full Domain Hash</i>. Vol. 3621, Springer, 2005, pp. 449–66, doi:<a href=\"https://doi.org/10.1007/11535218_27\">10.1007/11535218_27</a>.","apa":"Dodis, Y., Oliveira, R., &#38; Pietrzak, K. Z. (2005). On the generic insecurity of the full domain hash (Vol. 3621, pp. 449–466). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/10.1007/11535218_27\">https://doi.org/10.1007/11535218_27</a>"},"day":"12","abstract":[{"text":"The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m is computed as f−1(h(m)) (here f ∈R F and h is modelled as a random oracle). It is known to be existentially unforgeable for any TDP family F [3], although a much tighter security reduction is known for a restrictive class of TDP’s [10,14] — namely, those induced by a family of claw-free permutations (CFP) pairs. The latter result was shown [11] to match the best possible “black-box” security reduction in the random oracle model, irrespective of the TDP family F (e.g., RSA) one might use.\nIn this work we investigate the question if it is possible to instantiate the random oracle h with a “real” family of hash functions H such that the corresponding schemes can be proven secure in the standard model, under some natural assumption on the family F. Our main result rules out the existence of such instantiations for any assumption on F which (1) is satisfied by a family of random permutations; and (2) does not allow the attacker to invert f ∈R F on an a-priori unbounded number of points. Moreover, this holds even if the choice of H can arbitrarily depend on f. As an immediate corollary, we rule out instantiating FDH based on general claw-free permutations, which shows that in order to prove the security of FDH in the standard model one must utilize significantly more structure on F than what is sufficient for the best proof of security in the random oracle model.","lang":"eng"}],"_id":"3212","type":"conference","publist_id":"3470","publication_status":"published","quality_controlled":0,"conference":{"name":"CRYPTO: International Cryptology Conference"},"date_published":"2005-09-12T00:00:00Z","title":"On the generic insecurity of the full domain hash","date_created":"2018-12-11T12:02:03Z","alternative_title":["LNCS"],"intvolume":"      3621","year":"2005","date_updated":"2021-01-12T07:41:50Z","volume":3621,"author":[{"first_name":"Yevgeniy","last_name":"Dodis","full_name":"Dodis, Yevgeniy"},{"first_name":"Roberto","full_name":"Oliveira, Roberto","last_name":"Oliveira"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak"}],"month":"09","acknowledgement":"Supported by NSF CAREER Award CCR-0133806 and TC Grant No.CCR-0311095. Supported by the Swiss National Science Foundation, project No. 200020-103847/1","doi":"10.1007/11535218_27","extern":1,"publisher":"Springer","page":"449 - 466","status":"public"},{"date_updated":"2021-01-12T07:41:50Z","author":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Krzysztof Pietrzak"}],"volume":3621,"month":"09","acknowledgement":"Supported by the Swiss National Science Foundation, project No. 200020-103847/1.","doi":"10.1007/11535218_4","extern":1,"publisher":"Springer","page":"55 - 65","status":"public","day":"12","citation":{"chicago":"Pietrzak, Krzysztof Z. “Composition Does Not Imply Adaptive Security,” 3621:55–65. Springer, 2005. <a href=\"https://doi.org/10.1007/11535218_4\">https://doi.org/10.1007/11535218_4</a>.","ista":"Pietrzak KZ. 2005. Composition does not imply adaptive security. CRYPTO: International Cryptology Conference, LNCS, vol. 3621, 55–65.","ama":"Pietrzak KZ. Composition does not imply adaptive security. In: Vol 3621. Springer; 2005:55-65. doi:<a href=\"https://doi.org/10.1007/11535218_4\">10.1007/11535218_4</a>","apa":"Pietrzak, K. Z. (2005). Composition does not imply adaptive security (Vol. 3621, pp. 55–65). Presented at the CRYPTO: International Cryptology Conference, Springer. <a href=\"https://doi.org/10.1007/11535218_4\">https://doi.org/10.1007/11535218_4</a>","short":"K.Z. Pietrzak, in:, Springer, 2005, pp. 55–65.","ieee":"K. Z. Pietrzak, “Composition does not imply adaptive security,” presented at the CRYPTO: International Cryptology Conference, 2005, vol. 3621, pp. 55–65.","mla":"Pietrzak, Krzysztof Z. <i>Composition Does Not Imply Adaptive Security</i>. Vol. 3621, Springer, 2005, pp. 55–65, doi:<a href=\"https://doi.org/10.1007/11535218_4\">10.1007/11535218_4</a>."},"abstract":[{"text":"We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure against adaptive distinguishers. The sequential composition of F and G is the function G(F()), the parallel composition is F G where ⋆ is some group operation. It has been shown that composition indeed gives adaptive security in the information theoretic setting, but unfortunately the proof does not translate into the more interesting computational case.\nIn this work we show that in the computational setting composition does not imply adaptive security: If there is a prime order cyclic group where the decisional Diffie-Hellman assumption holds, then there are functions F and G which are indistinguishable by non-adaptive polynomially time-bounded adversaries, but whose parallel composition can be completely broken (i.e. we recover the key) with only three adaptive queries. We give a similar result for sequential composition. Interestingly, we need a standard assumption from the asymmetric (aka. public-key) world to prove a negative result for symmetric (aka. private-key) systems.","lang":"eng"}],"_id":"3213","type":"conference","publist_id":"3468","conference":{"name":"CRYPTO: International Cryptology Conference"},"quality_controlled":0,"publication_status":"published","date_published":"2005-09-12T00:00:00Z","title":"Composition does not imply adaptive security","date_created":"2018-12-11T12:02:03Z","alternative_title":["LNCS"],"intvolume":"      3621","year":"2005"},{"title":"Complex stability of single proteins explored by forced unfolding experiments","date_created":"2018-12-11T12:03:13Z","date_published":"2005-05-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1305525/"}],"intvolume":"        88","year":"2005","day":"01","citation":{"chicago":"Janovjak, Harald L, Tanuj Sapra, and Daniel Mueller. “Complex Stability of Single Proteins Explored by Forced Unfolding Experiments.” <i>Biophysical Journal</i>. Biophysical Society, 2005. <a href=\"https://doi.org/10.1529/biophysj.105.059774\">https://doi.org/10.1529/biophysj.105.059774</a>.","ama":"Janovjak HL, Sapra T, Mueller D. Complex stability of single proteins explored by forced unfolding experiments. <i>Biophysical Journal</i>. 2005;88(5):37-39. doi:<a href=\"https://doi.org/10.1529/biophysj.105.059774\">10.1529/biophysj.105.059774</a>","ista":"Janovjak HL, Sapra T, Mueller D. 2005. Complex stability of single proteins explored by forced unfolding experiments. Biophysical Journal. 88(5), 37–39.","apa":"Janovjak, H. L., Sapra, T., &#38; Mueller, D. (2005). Complex stability of single proteins explored by forced unfolding experiments. <i>Biophysical Journal</i>. Biophysical Society. <a href=\"https://doi.org/10.1529/biophysj.105.059774\">https://doi.org/10.1529/biophysj.105.059774</a>","mla":"Janovjak, Harald L., et al. “Complex Stability of Single Proteins Explored by Forced Unfolding Experiments.” <i>Biophysical Journal</i>, vol. 88, no. 5, Biophysical Society, 2005, pp. 37–39, doi:<a href=\"https://doi.org/10.1529/biophysj.105.059774\">10.1529/biophysj.105.059774</a>.","short":"H.L. Janovjak, T. Sapra, D. Mueller, Biophysical Journal 88 (2005) 37–39.","ieee":"H. L. Janovjak, T. Sapra, and D. Mueller, “Complex stability of single proteins explored by forced unfolding experiments,” <i>Biophysical Journal</i>, vol. 88, no. 5. Biophysical Society, pp. 37–39, 2005."},"abstract":[{"lang":"eng","text":"In the last decade atomic force microscopy has been used to measure the mechanical stability of single proteins. These force spectroscopy experiments have shown that many water-soluble and membrane proteins unfold via one or more intermediates. Recently, Li and co-workers found a linear correlation between the unfolding force of the native state and the intermediate in fibronectin, which they suggested indicated the presence of a molecular memory or multiple unfolding pathways (1). Here, we apply two independent methods in combination with Monte Carlo simulations to analyze the unfolding of α-helices E and D of bacteriorhodopsin (BR). We show that correlation analysis of unfolding forces is very sensitive to errors in force calibration of the instrument. In contrast, a comparison of relative forces provides a robust measure for the stability of unfolding intermediates. The proposed approach detects three energetically different states of α-helices E and D in trimeric BR. These states are not observed for monomeric BR and indicate that substantial information is hidden in forced unfolding experiments of single proteins."}],"_id":"3416","publication_status":"published","quality_controlled":0,"type":"journal_article","publist_id":"2985","extern":1,"issue":"5","status":"public","page":"37 - 39","publisher":"Biophysical Society","volume":88,"author":[{"last_name":"Janovjak","full_name":"Harald Janovjak","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L"},{"last_name":"Sapra","full_name":"Sapra, Tanuj K","first_name":"Tanuj"},{"first_name":"Daniel","last_name":"Mueller","full_name":"Mueller, Daniel J"}],"publication":"Biophysical Journal","date_updated":"2021-01-12T07:43:19Z","month":"05","doi":"10.1529/biophysj.105.059774","oa":1},{"citation":{"mla":"Kuhn, Michael, et al. “Automated Alignment and Pattern Recognition of Single-Molecule Force Spectroscopy Data.” <i>Journal of Microscopy</i>, vol. 218, no. 2, Wiley-Blackwell, 2005, pp. 125–32, doi:<a href=\"https://doi.org/10.1111/j.1365-2818.2005.01478.x\">10.1111/j.1365-2818.2005.01478.x</a>.","ieee":"M. Kuhn, H. L. Janovjak, M. Hubain, and D. Mueller, “Automated alignment and pattern recognition of single-molecule force spectroscopy data,” <i>Journal of Microscopy</i>, vol. 218, no. 2. Wiley-Blackwell, pp. 125–132, 2005.","short":"M. Kuhn, H.L. Janovjak, M. Hubain, D. Mueller, Journal of Microscopy 218 (2005) 125–132.","apa":"Kuhn, M., Janovjak, H. L., Hubain, M., &#38; Mueller, D. (2005). Automated alignment and pattern recognition of single-molecule force spectroscopy data. <i>Journal of Microscopy</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-2818.2005.01478.x\">https://doi.org/10.1111/j.1365-2818.2005.01478.x</a>","ama":"Kuhn M, Janovjak HL, Hubain M, Mueller D. Automated alignment and pattern recognition of single-molecule force spectroscopy data. <i>Journal of Microscopy</i>. 2005;218(2):125-132. doi:<a href=\"https://doi.org/10.1111/j.1365-2818.2005.01478.x\">10.1111/j.1365-2818.2005.01478.x</a>","ista":"Kuhn M, Janovjak HL, Hubain M, Mueller D. 2005. Automated alignment and pattern recognition of single-molecule force spectroscopy data. Journal of Microscopy. 218(2), 125–132.","chicago":"Kuhn, Michael, Harald L Janovjak, Maurice Hubain, and Daniel Mueller. “Automated Alignment and Pattern Recognition of Single-Molecule Force Spectroscopy Data.” <i>Journal of Microscopy</i>. Wiley-Blackwell, 2005. <a href=\"https://doi.org/10.1111/j.1365-2818.2005.01478.x\">https://doi.org/10.1111/j.1365-2818.2005.01478.x</a>."},"day":"01","publication_status":"published","quality_controlled":0,"type":"journal_article","publist_id":"2984","_id":"3417","abstract":[{"text":"Recently, direct measurements of forces stabilizing single proteins or individual receptor–ligand bonds became possible with ultra-sensitive force probe methods like the atomic force microscope (AFM). In force spectroscopy experiments using AFM, a single molecule or receptor–ligand pair is tethered between the tip of a micromachined cantilever and a supporting surface. While the molecule is stretched, forces are measured by the deflection of the cantilever and plotted against extension, yielding a force spectrum characteristic for each biomolecular system. In order to obtain statistically relevant results, several hundred to thousand single-molecule experiments have to be performed, each resulting in a unique force spectrum. We developed software and algorithms to analyse large numbers of force spectra. Our algorithms include the fitting polymer extension models to force peaks as well as the automatic alignment of spectra. The aligned spectra allowed recognition of patterns of peaks across different spectra. We demonstrate the capabilities of our software by analysing force spectra that were recorded by unfolding single transmembrane proteins such as bacteriorhodopsin and NhaA. Different unfolding pathways were detected by classifying peak patterns. Deviant spectra, e.g. those with no attachment or erratic peaks, can be easily identified. The software is based on the programming language C++, the GNU Scientific Library (GSL), the software WaveMetrics IGOR Pro and available open-source at http://bioinformatics.org/fskit/.","lang":"eng"}],"date_created":"2018-12-11T12:03:13Z","title":"Automated alignment and pattern recognition of single-molecule force spectroscopy data","date_published":"2005-05-01T00:00:00Z","year":"2005","intvolume":"       218","month":"05","author":[{"last_name":"Kuhn","full_name":"Kuhn, Michael","first_name":"Michael"},{"last_name":"Janovjak","full_name":"Harald Janovjak","orcid":"0000-0002-8023-9315","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","first_name":"Harald L"},{"full_name":"Hubain, Maurice","last_name":"Hubain","first_name":"Maurice"},{"first_name":"Daniel","full_name":"Mueller, Daniel J","last_name":"Mueller"}],"volume":218,"publication":"Journal of Microscopy","date_updated":"2021-01-12T07:43:20Z","doi":"10.1111/j.1365-2818.2005.01478.x","extern":1,"issue":"2","page":"125 - 132","status":"public","publisher":"Wiley-Blackwell"},{"date_published":"2005-02-01T00:00:00Z","title":"Hydrodynamic effects in fast AFM single molecule force measurements","date_created":"2018-12-11T12:03:14Z","intvolume":"        34","year":"2005","day":"01","citation":{"chicago":"Janovjak, Harald L, Jens Struckmeier, and Daniel Mueller. “Hydrodynamic Effects in Fast AFM Single Molecule Force Measurements.” <i>European Biophysics Journal</i>. Springer, 2005. <a href=\"https://doi.org/10.1007/s00249-004-0430-3\">https://doi.org/10.1007/s00249-004-0430-3</a>.","ama":"Janovjak HL, Struckmeier J, Mueller D. Hydrodynamic effects in fast AFM single molecule force measurements. <i>European Biophysics Journal</i>. 2005;34(1):91-96. doi:<a href=\"https://doi.org/10.1007/s00249-004-0430-3\">10.1007/s00249-004-0430-3</a>","ista":"Janovjak HL, Struckmeier J, Mueller D. 2005. Hydrodynamic effects in fast AFM single molecule force measurements. European Biophysics Journal. 34(1), 91–96.","apa":"Janovjak, H. L., Struckmeier, J., &#38; Mueller, D. (2005). Hydrodynamic effects in fast AFM single molecule force measurements. <i>European Biophysics Journal</i>. Springer. <a href=\"https://doi.org/10.1007/s00249-004-0430-3\">https://doi.org/10.1007/s00249-004-0430-3</a>","mla":"Janovjak, Harald L., et al. “Hydrodynamic Effects in Fast AFM Single Molecule Force Measurements.” <i>European Biophysics Journal</i>, vol. 34, no. 1, Springer, 2005, pp. 91–96, doi:<a href=\"https://doi.org/10.1007/s00249-004-0430-3\">10.1007/s00249-004-0430-3</a>.","ieee":"H. L. Janovjak, J. Struckmeier, and D. Mueller, “Hydrodynamic effects in fast AFM single molecule force measurements,” <i>European Biophysics Journal</i>, vol. 34, no. 1. Springer, pp. 91–96, 2005.","short":"H.L. Janovjak, J. Struckmeier, D. Mueller, European Biophysics Journal 34 (2005) 91–96."},"_id":"3418","abstract":[{"lang":"eng","text":"Atomic force microscopy (AFM) allows the critical forces that unfold single proteins and rupture individual receptor–ligand bonds to be measured. To derive the shape of the energy landscape, the dynamic strength of the system is probed at different force loading rates. This is usually achieved by varying the pulling speed between a few nm/s and a few mgrm/s, although for a more complete investigation of the kinetic properties higher speeds are desirable. Above 10 mgrm/s, the hydrodynamic drag force acting on the AFM cantilever reaches the same order of magnitude as the molecular forces. This has limited the maximum pulling speed in AFM single-molecule force spectroscopy experiments. Here, we present an approach for considering these hydrodynamic effects, thereby allowing a correct evaluation of AFM force measurements recorded over an extended range of pulling speeds (and thus loading rates). To support and illustrate our theoretical considerations, we experimentally evaluated the mechanical unfolding of a multi-domain protein recorded at 30 mgrm/s pulling speed."}],"publist_id":"2983","type":"journal_article","publication_status":"published","quality_controlled":0,"issue":"1","extern":1,"publisher":"Springer","page":"91 - 96","status":"public","date_updated":"2021-01-12T07:43:20Z","publication":"European Biophysics Journal","author":[{"full_name":"Harald Janovjak","last_name":"Janovjak","orcid":"0000-0002-8023-9315","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Struckmeier","full_name":"Struckmeier, Jens","first_name":"Jens"},{"full_name":"Mueller, Daniel J","last_name":"Mueller","first_name":"Daniel"}],"volume":34,"month":"02","doi":"10.1007/s00249-004-0430-3"},{"issue":"11","scopus_import":"1","status":"public","page":"1361-1365","publication":"Advanced Materials","date_updated":"2023-08-08T11:53:16Z","date_published":"2005-06-24T00:00:00Z","intvolume":"        17","year":"2005","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Smoukov, S. K., K. J. M. Bishop, Rafal Klajn, C. J. Campbell, and B. A. Grzybowski. “Cutting into Solids with Micropatterned Gels.” <i>Advanced Materials</i>. Wiley, 2005. <a href=\"https://doi.org/10.1002/adma.200402086\">https://doi.org/10.1002/adma.200402086</a>.","ista":"Smoukov SK, Bishop KJM, Klajn R, Campbell CJ, Grzybowski BA. 2005. Cutting into solids with micropatterned gels. Advanced Materials. 17(11), 1361–1365.","ama":"Smoukov SK, Bishop KJM, Klajn R, Campbell CJ, Grzybowski BA. Cutting into solids with micropatterned gels. <i>Advanced Materials</i>. 2005;17(11):1361-1365. doi:<a href=\"https://doi.org/10.1002/adma.200402086\">10.1002/adma.200402086</a>","apa":"Smoukov, S. K., Bishop, K. J. M., Klajn, R., Campbell, C. J., &#38; Grzybowski, B. A. (2005). Cutting into solids with micropatterned gels. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.200402086\">https://doi.org/10.1002/adma.200402086</a>","short":"S.K. Smoukov, K.J.M. Bishop, R. Klajn, C.J. Campbell, B.A. Grzybowski, Advanced Materials 17 (2005) 1361–1365.","ieee":"S. K. Smoukov, K. J. M. Bishop, R. Klajn, C. J. Campbell, and B. A. Grzybowski, “Cutting into solids with micropatterned gels,” <i>Advanced Materials</i>, vol. 17, no. 11. Wiley, pp. 1361–1365, 2005.","mla":"Smoukov, S. K., et al. “Cutting into Solids with Micropatterned Gels.” <i>Advanced Materials</i>, vol. 17, no. 11, Wiley, 2005, pp. 1361–65, doi:<a href=\"https://doi.org/10.1002/adma.200402086\">10.1002/adma.200402086</a>."},"day":"24","_id":"13431","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Hydrogel stamps can microstructure solid surfaces, i.e., modify the surface topology of metals, glasses, and crystals. It is demonstrated that stamps soaked in an appropriate etchant can remove material with micrometer-scale precision. The Figure shows an array of concentric circles etched in glass using the immersion wet stamping process described (scale bar: 500 μm)."}],"external_id":{"pmid":["34412440"]},"type":"journal_article","quality_controlled":"1","extern":"1","pmid":1,"article_processing_charge":"No","publisher":"Wiley","author":[{"first_name":"S. K.","last_name":"Smoukov","full_name":"Smoukov, S. K."},{"first_name":"K. J. M.","full_name":"Bishop, K. J. M.","last_name":"Bishop"},{"full_name":"Klajn, Rafal","last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal"},{"last_name":"Campbell","full_name":"Campbell, C. J.","first_name":"C. J."},{"first_name":"B. A.","full_name":"Grzybowski, B. A.","last_name":"Grzybowski"}],"volume":17,"article_type":"original","month":"06","doi":"10.1002/adma.200402086","title":"Cutting into solids with micropatterned gels","date_created":"2023-08-01T10:38:01Z","oa_version":"None","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"publication_status":"published"},{"keyword":["Electrochemistry","Spectroscopy","Surfaces and Interfaces","Condensed Matter Physics","General Materials Science"],"publication_identifier":{"eissn":["1520-5827"],"issn":["0743-7463"]},"date_created":"2023-08-01T10:38:29Z","title":"One-step multilevel microfabrication by reaction−diffusion","oa_version":"None","publication_status":"published","article_processing_charge":"No","publisher":"American Chemical Society","extern":"1","pmid":1,"doi":"10.1021/la0487747","author":[{"last_name":"Campbell","full_name":"Campbell, Christopher J.","first_name":"Christopher J."},{"full_name":"Klajn, Rafal","last_name":"Klajn","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"},{"first_name":"Marcin","full_name":"Fialkowski, Marcin","last_name":"Fialkowski"},{"full_name":"Grzybowski, Bartosz A.","last_name":"Grzybowski","first_name":"Bartosz A."}],"volume":21,"month":"01","article_type":"original","intvolume":"        21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2005","date_published":"2005-01-21T00:00:00Z","external_id":{"pmid":["15620333"]},"_id":"13432","abstract":[{"lang":"eng","text":"A new experimental technique is described that uses reaction−diffusion phenomena as a means of one-step microfabrication of complex, multilevel surface reliefs. Thin films of dry gelatin doped with potassium hexacyanoferrate are chemically micropatterned with a solution of silver nitrate delivered from an agarose stamp. Precipitation reaction between the two salts causes the surface to deform. The mechanism of surface deformation is shown to involve a sequence of reactions, diffusion, and gel swelling/contraction. This mechanism is established experimentally and provides a basis of a theoretical lattice-gas model that allows prediction surface topographies emerging from arbitrary geometries of the stamped features. The usefulness of the technique is demonstrated by using it to rapidly prepare two types of mold for passive microfluidic mixers."}],"language":[{"iso":"eng"}],"quality_controlled":"1","type":"journal_article","day":"21","citation":{"apa":"Campbell, C. J., Klajn, R., Fialkowski, M., &#38; Grzybowski, B. A. (2005). One-step multilevel microfabrication by reaction−diffusion. <i>Langmuir</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/la0487747\">https://doi.org/10.1021/la0487747</a>","mla":"Campbell, Christopher J., et al. “One-Step Multilevel Microfabrication by Reaction−diffusion.” <i>Langmuir</i>, vol. 21, no. 1, American Chemical Society, 2005, pp. 418–23, doi:<a href=\"https://doi.org/10.1021/la0487747\">10.1021/la0487747</a>.","short":"C.J. Campbell, R. Klajn, M. Fialkowski, B.A. Grzybowski, Langmuir 21 (2005) 418–423.","ieee":"C. J. Campbell, R. Klajn, M. Fialkowski, and B. A. Grzybowski, “One-step multilevel microfabrication by reaction−diffusion,” <i>Langmuir</i>, vol. 21, no. 1. American Chemical Society, pp. 418–423, 2005.","chicago":"Campbell, Christopher J., Rafal Klajn, Marcin Fialkowski, and Bartosz A. Grzybowski. “One-Step Multilevel Microfabrication by Reaction−diffusion.” <i>Langmuir</i>. American Chemical Society, 2005. <a href=\"https://doi.org/10.1021/la0487747\">https://doi.org/10.1021/la0487747</a>.","ama":"Campbell CJ, Klajn R, Fialkowski M, Grzybowski BA. One-step multilevel microfabrication by reaction−diffusion. <i>Langmuir</i>. 2005;21(1):418-423. doi:<a href=\"https://doi.org/10.1021/la0487747\">10.1021/la0487747</a>","ista":"Campbell CJ, Klajn R, Fialkowski M, Grzybowski BA. 2005. One-step multilevel microfabrication by reaction−diffusion. Langmuir. 21(1), 418–423."},"status":"public","page":"418-423","issue":"1","scopus_import":"1","date_updated":"2023-08-08T12:15:48Z","publication":"Langmuir"},{"extern":"1","article_processing_charge":"No","publisher":"Bentham Science","volume":8,"author":[{"full_name":"Witt, Dariusz","last_name":"Witt","first_name":"Dariusz"},{"last_name":"Klajn","full_name":"Klajn, Rafal","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"},{"full_name":"Barski, Piotr","last_name":"Barski","first_name":"Piotr"},{"first_name":"Bartosz","full_name":"Grzybowski, Bartosz","last_name":"Grzybowski"}],"article_type":"original","month":"12","doi":"10.2174/1385272043369421","date_created":"2023-08-01T10:38:58Z","title":"Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers","oa_version":"None","publication_identifier":{"issn":["1385-2728"],"eissn":["1875-5348"]},"keyword":["Organic Chemistry"],"publication_status":"published","issue":"18","scopus_import":"1","page":"1763-1797","status":"public","publication":"Current Organic Chemistry","date_updated":"2023-08-08T12:39:52Z","date_published":"2005-12-01T00:00:00Z","intvolume":"         8","year":"2005","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","citation":{"short":"D. Witt, R. Klajn, P. Barski, B. Grzybowski, Current Organic Chemistry 8 (2005) 1763–1797.","ieee":"D. Witt, R. Klajn, P. Barski, and B. Grzybowski, “Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers,” <i>Current Organic Chemistry</i>, vol. 8, no. 18. Bentham Science, pp. 1763–1797, 2005.","mla":"Witt, Dariusz, et al. “Applications, Properties and Synthesis of w-Functionalized n-Alkanethiols and Disulfides - the Building Blocks of Self-Assembled Monolayers.” <i>Current Organic Chemistry</i>, vol. 8, no. 18, Bentham Science, 2005, pp. 1763–97, doi:<a href=\"https://doi.org/10.2174/1385272043369421\">10.2174/1385272043369421</a>.","apa":"Witt, D., Klajn, R., Barski, P., &#38; Grzybowski, B. (2005). Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers. <i>Current Organic Chemistry</i>. Bentham Science. <a href=\"https://doi.org/10.2174/1385272043369421\">https://doi.org/10.2174/1385272043369421</a>","ista":"Witt D, Klajn R, Barski P, Grzybowski B. 2005. Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers. Current Organic Chemistry. 8(18), 1763–1797.","ama":"Witt D, Klajn R, Barski P, Grzybowski B. Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers. <i>Current Organic Chemistry</i>. 2005;8(18):1763-1797. doi:<a href=\"https://doi.org/10.2174/1385272043369421\">10.2174/1385272043369421</a>","chicago":"Witt, Dariusz, Rafal Klajn, Piotr Barski, and Bartosz Grzybowski. “Applications, Properties and Synthesis of w-Functionalized n-Alkanethiols and Disulfides - the Building Blocks of Self-Assembled Monolayers.” <i>Current Organic Chemistry</i>. Bentham Science, 2005. <a href=\"https://doi.org/10.2174/1385272043369421\">https://doi.org/10.2174/1385272043369421</a>."},"_id":"13433","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Self-assembled monolayers (SAMs) of alkane thiols on gold and other metals are versatile constructs with which to study interfacial phenomena and reactions at surfaces. Surface properties of SAMs - e.g., wettability, stability in diverse environments, propensity to interact with or to resist adsorption of macromolecules -- depend on and can be controlled flexibly by the properties of the functional (head) groups in the w position of the alkyl chain. SAMs provide a basis for many important scientific and technological applications, ranging from micropatterning methods, through sensing, to biological recognition. Despite their importance, the literature on SAMs and the synthesis of molecules that constitute them remains scattered and often conflicting. The purpose of this Review is (i) to summarize the applications and physical properties of SAMs and (ii) to systematize the strategies of synthesis of ω-functionalized alkane thiols. Generic retrosynthetic scheme is developed that allows efficient synthetic planning. Issues related to the selection of appropriate protecting groups and the ways of introduction of the thiol functionality are discussed in detail, and illustrated with examples of syntheses of several complex alkane thiols."}],"type":"journal_article","quality_controlled":"1"},{"main_file_link":[{"url":"http://arxiv.org/abs/math/0406380","open_access":"1"}],"date_published":"2005-01-01T00:00:00Z","alternative_title":["Progress in Mathematics"],"title":"Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve","date_created":"2018-12-11T11:52:03Z","year":"2005","intvolume":"       235","day":"01","citation":{"ama":"Hausel T. Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve. In: <i>Geometric Methods in Algebra and Number Theory</i>. Vol 235. Springer; 2005:193-217. doi:<a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">10.1007/0-8176-4417-2_9</a>","ista":"Hausel T. 2005.Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve. In: Geometric Methods in Algebra and Number Theory. Progress in Mathematics, vol. 235, 193–217.","chicago":"Hausel, Tamás. “Mirror Symmetry and Langlands Duality in the Non-Abelian Hodge Theory of a Curve.” In <i>Geometric Methods in Algebra and Number Theory</i>, 235:193–217. Springer, 2005. <a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">https://doi.org/10.1007/0-8176-4417-2_9</a>.","mla":"Hausel, Tamás. “Mirror Symmetry and Langlands Duality in the Non-Abelian Hodge Theory of a Curve.” <i>Geometric Methods in Algebra and Number Theory</i>, vol. 235, Springer, 2005, pp. 193–217, doi:<a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">10.1007/0-8176-4417-2_9</a>.","ieee":"T. Hausel, “Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve,” in <i>Geometric Methods in Algebra and Number Theory</i>, vol. 235, Springer, 2005, pp. 193–217.","short":"T. Hausel, in:, Geometric Methods in Algebra and Number Theory, Springer, 2005, pp. 193–217.","apa":"Hausel, T. (2005). Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve. In <i>Geometric Methods in Algebra and Number Theory</i> (Vol. 235, pp. 193–217). Springer. <a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">https://doi.org/10.1007/0-8176-4417-2_9</a>"},"type":"book_chapter","publist_id":"5752","quality_controlled":0,"publication_status":"published","abstract":[{"lang":"eng","text":"The paper surveys the mirror symmetry conjectures of Hausel-Thaddeus and Hausel-Rodriguez-Villegas concerning the equality of certain Hodge numbers of SL(n, ℂ) vs. PGL(n, ℂ) flat connections and character varieties for curves, respectively. Several new results and conjectures and their relations to works of Hitchin, Gothen, Garsia-Haiman and Earl-Kirwan are explained. These use the representation theory of finite groups of Lie-type via the arithmetic of character varieties and lead to an unexpected conjecture for a Hard Lefschetz theorem for their cohomology."}],"_id":"1444","extern":1,"publisher":"Springer","page":"193 - 217","status":"public","month":"01","publication":"Geometric Methods in Algebra and Number Theory","date_updated":"2021-01-12T06:50:47Z","author":[{"full_name":"Tamas Hausel","last_name":"Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"volume":235,"doi":"10.1007/0-8176-4417-2_9","oa":1},{"month":"03","author":[{"last_name":"Hausel","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas"}],"volume":3,"publication":"Open Mathematics","date_updated":"2021-01-12T06:50:49Z","oa":1,"doi":"10.2478/BF02475653","acknowledgement":"Financial support wa s provided by a Miller Research Fellowship at the University of California at Berkeley , and by NSF grants DMS- 0072675 and DMS-0305505.","extern":1,"issue":"1","status":"public","page":"26 - 38","publisher":"Central European Science Journals","citation":{"ieee":"T. Hausel, “Quaternionic geometry of matroids,” <i>Open Mathematics</i>, vol. 3, no. 1. Central European Science Journals, pp. 26–38, 2005.","short":"T. Hausel, Open Mathematics 3 (2005) 26–38.","mla":"Hausel, Tamás. “Quaternionic Geometry of Matroids.” <i>Open Mathematics</i>, vol. 3, no. 1, Central European Science Journals, 2005, pp. 26–38, doi:<a href=\"https://doi.org/10.2478/BF02475653\">10.2478/BF02475653</a>.","apa":"Hausel, T. (2005). Quaternionic geometry of matroids. <i>Open Mathematics</i>. Central European Science Journals. <a href=\"https://doi.org/10.2478/BF02475653\">https://doi.org/10.2478/BF02475653</a>","ista":"Hausel T. 2005. Quaternionic geometry of matroids. Open Mathematics. 3(1), 26–38.","ama":"Hausel T. Quaternionic geometry of matroids. <i>Open Mathematics</i>. 2005;3(1):26-38. doi:<a href=\"https://doi.org/10.2478/BF02475653\">10.2478/BF02475653</a>","chicago":"Hausel, Tamás. “Quaternionic Geometry of Matroids.” <i>Open Mathematics</i>. Central European Science Journals, 2005. <a href=\"https://doi.org/10.2478/BF02475653\">https://doi.org/10.2478/BF02475653</a>."},"day":"01","publication_status":"published","quality_controlled":0,"type":"journal_article","publist_id":"5749","_id":"1447","abstract":[{"text":"Building on a recent paper [8], here we argue that the combinatorics of matroids are intimately related to the geometry and topology of toric hyperkähler varieties. We show that just like toric varieties occupy a central role in Stanley’s proof for the necessity of McMullen’s conjecture (or g-inequalities) about the classification of face vectors of simplicial polytopes, the topology of toric hyperkähler varieties leads to new restrictions on face vectors of matroid complexes. Namely in this paper we will give two proofs that the injectivity part of the Hard Lefschetz theorem survives for toric hyperkähler varieties. We explain how this implies the g-inequalities for rationally representable matroids. We show how the geometrical intuition in the first proof, coupled with results of Chari [3], leads to a proof of the g-inequalities for general matroid complexes, which is a recent result of Swartz [20]. The geometrical idea in the second proof will show that a pure O-sequence should satisfy the g-inequalities, thus showing that our result is in fact a consequence of a long-standing conjecture of Stanley.","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/math/0308146","open_access":"1"}],"title":"Quaternionic geometry of matroids","date_created":"2018-12-11T11:52:05Z","date_published":"2005-03-01T00:00:00Z","year":"2005","intvolume":"         3"},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0310141"}],"date_published":"2005-01-01T00:00:00Z","date_created":"2018-12-11T11:52:10Z","title":"Abelianization for hyperkähler quotients","year":"2005","intvolume":"        44","citation":{"ieee":"T. Hausel and N. Proudfoot, “Abelianization for hyperkähler quotients,” <i>Topology</i>, vol. 44, no. 1. Elsevier, pp. 231–248, 2005.","short":"T. Hausel, N. Proudfoot, Topology 44 (2005) 231–248.","mla":"Hausel, Tamás, and Nicholas Proudfoot. “Abelianization for Hyperkähler Quotients.” <i>Topology</i>, vol. 44, no. 1, Elsevier, 2005, pp. 231–48, doi:<a href=\"https://doi.org/10.1016/j.top.2004.04.002\">10.1016/j.top.2004.04.002</a>.","apa":"Hausel, T., &#38; Proudfoot, N. (2005). Abelianization for hyperkähler quotients. <i>Topology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.top.2004.04.002\">https://doi.org/10.1016/j.top.2004.04.002</a>","ista":"Hausel T, Proudfoot N. 2005. Abelianization for hyperkähler quotients. Topology. 44(1), 231–248.","ama":"Hausel T, Proudfoot N. Abelianization for hyperkähler quotients. <i>Topology</i>. 2005;44(1):231-248. doi:<a href=\"https://doi.org/10.1016/j.top.2004.04.002\">10.1016/j.top.2004.04.002</a>","chicago":"Hausel, Tamás, and Nicholas Proudfoot. “Abelianization for Hyperkähler Quotients.” <i>Topology</i>. Elsevier, 2005. <a href=\"https://doi.org/10.1016/j.top.2004.04.002\">https://doi.org/10.1016/j.top.2004.04.002</a>."},"day":"01","type":"journal_article","publist_id":"5735","quality_controlled":0,"publication_status":"published","abstract":[{"lang":"eng","text":"We study an integration theory in circle equivariant cohomology in order to prove a theorem relating the cohomology ring of a hyperkähler quotient to the cohomology ring of the quotient by a maximal abelian subgroup, analogous to a theorem of Martin for symplectic quotients. We discuss applications of this theorem to quiver varieties, and compute as an example the ordinary and equivariant cohomology rings of a hyperpolygon space."}],"_id":"1463","issue":"1","extern":1,"publisher":"Elsevier","page":"231 - 248","status":"public","month":"01","date_updated":"2021-01-12T06:50:55Z","publication":"Topology","author":[{"first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel","full_name":"Tamas Hausel"},{"full_name":"Proudfoot, Nicholas J","last_name":"Proudfoot","first_name":"Nicholas"}],"volume":44,"acknowledgement":" Financial support was provided in part by NSF Grants DMS-0072675 and DMS-0305505.","oa":1,"doi":"10.1016/j.top.2004.04.002"},{"date_published":"2005-06-30T00:00:00Z","OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.astro-ph/0505390","open_access":"1"}],"intvolume":"        95","article_number":"011302","year":"2005","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Wang, Sheng, Zoltán Haiman, Wayne Hu, Justin Khoury, and Morgan May. “Weighing Neutrinos with Galaxy Cluster Surveys.” <i>Physical Review Letters</i>. American Physical Society, 2005. <a href=\"https://doi.org/10.1103/physrevlett.95.011302\">https://doi.org/10.1103/physrevlett.95.011302</a>.","ista":"Wang S, Haiman Z, Hu W, Khoury J, May M. 2005. Weighing neutrinos with galaxy cluster surveys. Physical Review Letters. 95, 011302.","ama":"Wang S, Haiman Z, Hu W, Khoury J, May M. Weighing neutrinos with galaxy cluster surveys. <i>Physical Review Letters</i>. 2005;95. doi:<a href=\"https://doi.org/10.1103/physrevlett.95.011302\">10.1103/physrevlett.95.011302</a>","apa":"Wang, S., Haiman, Z., Hu, W., Khoury, J., &#38; May, M. (2005). Weighing neutrinos with galaxy cluster surveys. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevlett.95.011302\">https://doi.org/10.1103/physrevlett.95.011302</a>","ieee":"S. Wang, Z. Haiman, W. Hu, J. Khoury, and M. May, “Weighing neutrinos with galaxy cluster surveys,” <i>Physical Review Letters</i>, vol. 95. American Physical Society, 2005.","short":"S. Wang, Z. Haiman, W. Hu, J. Khoury, M. May, Physical Review Letters 95 (2005).","mla":"Wang, Sheng, et al. “Weighing Neutrinos with Galaxy Cluster Surveys.” <i>Physical Review Letters</i>, vol. 95, 011302, American Physical Society, 2005, doi:<a href=\"https://doi.org/10.1103/physrevlett.95.011302\">10.1103/physrevlett.95.011302</a>."},"day":"30","_id":"17810","abstract":[{"text":"Large future galaxy cluster surveys, combined with cosmic microwave background observations, can achieve a high sensitivity to the masses of cosmologically important neutrinos. We show that a weak lensing selected sample of ≳100 000 clusters could tighten the current upper bound on the sum of masses of neutrino species by an order of magnitude, to a level of 0.03 eV. Since this statistical sensitivity is below the best existing lower limit on the mass of at least one neutrino species, a future detection is likely, provided that systematic errors can be controlled to a similar level.","lang":"eng"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["astro-ph/0505390"]},"type":"journal_article","quality_controlled":"1","scopus_import":"1","status":"public","date_updated":"2024-11-12T10:21:28Z","publication":"Physical Review Letters","title":"Weighing neutrinos with galaxy cluster surveys","date_created":"2024-09-06T11:38:41Z","oa_version":"Preprint","OA_type":"green","publication_identifier":{"eissn":["1079-7114"],"issn":["0031-9007"]},"arxiv":1,"publication_status":"published","extern":"1","article_processing_charge":"No","publisher":"American Physical Society","volume":95,"author":[{"first_name":"Sheng","full_name":"Wang, Sheng","last_name":"Wang"},{"orcid":"0000-0003-3633-5403","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","last_name":"Haiman","full_name":"Haiman, Zoltán"},{"first_name":"Wayne","full_name":"Hu, Wayne","last_name":"Hu"},{"first_name":"Justin","full_name":"Khoury, Justin","last_name":"Khoury"},{"first_name":"Morgan","last_name":"May","full_name":"May, Morgan"}],"article_type":"original","month":"06","oa":1,"doi":"10.1103/physrevlett.95.011302"},{"intvolume":"       621","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2005","OA_place":"repository","date_published":"2005-03-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.astro-ph/0403419","open_access":"1"}],"external_id":{"arxiv":["astro-ph/0403419"]},"_id":"17811","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The z = 10 galaxy recently discovered by Pello and coworkers has a strong Lyα emission line that does not appear to have the expected asymmetry with more transmission on the red side. The blue wing of a Lyα line originating at high redshift should be strongly suppressed by resonant hydrogen absorption along the line of sight, an expectation borne out by the observed asymmetric shapes of the existing sample of Lyα-emitting sources at lower redshifts (3 < z < 6.7). The observed line is inconsistent with the galaxy being embedded in a fully neutral intergalactic medium (IGM) and having no receding peculiar velocity relative to the surrounding absorbing gas at the 95.0%-98.8% confidence level. Absorption on the blue side of the line of the Pello et al. source could be reduced if the IGM in the vicinity of the galaxy is highly ionized, but we show that this requires an unrealistically high ionizing emissivity. We suggest instead that the Lyα-emitting gas is receding relative to the surrounding gas with a velocity of ≳35 km s-1, which reduces the inconsistency confidence level to less than 76.0%-94.5%. We find that with this velocity shift, the observed strength and shape of the line is more consistent with the galaxy being surrounded by its own Strömgren sphere embedded in a fully neutral IGM. More generally, we predict that at any given redshift, the bright Lyα emitters with broader lines would exhibit stronger asymmetry than fainter ones. Bright galaxies with symmetric Lyα lines may be signposts for groups and clusters of galaxies, within which they can acquire random velocities comparable to or larger than their line widths."}],"quality_controlled":"1","type":"journal_article","citation":{"apa":"Cen, R., Haiman, Z., &#38; Mesinger, A. (2005). Implications of the Lyα Emission Line from a Candidate z = 10 Galaxy. <i>The Astrophysical Journal</i>. American Astronomical Society. <a href=\"https://doi.org/10.1086/425243\">https://doi.org/10.1086/425243</a>","mla":"Cen, Renyue, et al. “Implications of the Lyα Emission Line from a Candidate z = 10 Galaxy.” <i>The Astrophysical Journal</i>, vol. 621, no. 1, American Astronomical Society, 2005, pp. 89–94, doi:<a href=\"https://doi.org/10.1086/425243\">10.1086/425243</a>.","short":"R. Cen, Z. Haiman, A. Mesinger, The Astrophysical Journal 621 (2005) 89–94.","ieee":"R. Cen, Z. Haiman, and A. Mesinger, “Implications of the Lyα Emission Line from a Candidate z = 10 Galaxy,” <i>The Astrophysical Journal</i>, vol. 621, no. 1. American Astronomical Society, pp. 89–94, 2005.","chicago":"Cen, Renyue, Zoltán Haiman, and Andrei Mesinger. “Implications of the Lyα Emission Line from a Candidate z = 10 Galaxy.” <i>The Astrophysical Journal</i>. American Astronomical Society, 2005. <a href=\"https://doi.org/10.1086/425243\">https://doi.org/10.1086/425243</a>.","ama":"Cen R, Haiman Z, Mesinger A. Implications of the Lyα Emission Line from a Candidate z = 10 Galaxy. <i>The Astrophysical Journal</i>. 2005;621(1):89-94. doi:<a href=\"https://doi.org/10.1086/425243\">10.1086/425243</a>","ista":"Cen R, Haiman Z, Mesinger A. 2005. Implications of the Lyα Emission Line from a Candidate z = 10 Galaxy. The Astrophysical Journal. 621(1), 89–94."},"day":"01","status":"public","page":"89-94","issue":"1","scopus_import":"1","publication":"The Astrophysical Journal","date_updated":"2024-11-12T10:27:32Z","arxiv":1,"publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"date_created":"2024-09-06T11:39:23Z","title":"Implications of the Lyα Emission Line from a Candidate z = 10 Galaxy","OA_type":"green","oa_version":"Preprint","publication_status":"published","article_processing_charge":"No","publisher":"American Astronomical Society","extern":"1","doi":"10.1086/425243","oa":1,"volume":621,"author":[{"last_name":"Cen","full_name":"Cen, Renyue","first_name":"Renyue"},{"last_name":"Haiman","full_name":"Haiman, Zoltán","orcid":"0000-0003-3633-5403","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","first_name":"Zoltán"},{"last_name":"Mesinger","full_name":"Mesinger, Andrei","first_name":"Andrei"}],"month":"03","article_type":"original"},{"month":"09","publication":"AIDS Research and Therapy","date_updated":"2021-01-12T06:53:15Z","author":[{"orcid":"0000-0001-8635-0877","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87","first_name":"Sandra","last_name":"Siegert","full_name":"Sandra Siegert"},{"first_name":"Sonja","last_name":"Thaler","full_name":"Thaler, Sonja"},{"full_name":"Wagner, Ralf","last_name":"Wagner","first_name":"Ralf"},{"first_name":"Barbara","last_name":"Schnierle","full_name":"Schnierle, Barbara S"}],"volume":2,"doi":"10.1186/1742-6405-2-7","issue":"1","extern":1,"publisher":"BioMed Central","status":"public","citation":{"ista":"Siegert S, Thaler S, Wagner R, Schnierle B. 2005. Assessment of HIV-1 entry inhibitors by MLV/HIV-1 pseudotyped vectors. AIDS Research and Therapy. 2(1).","ama":"Siegert S, Thaler S, Wagner R, Schnierle B. Assessment of HIV-1 entry inhibitors by MLV/HIV-1 pseudotyped vectors. <i>AIDS Research and Therapy</i>. 2005;2(1). doi:<a href=\"https://doi.org/10.1186/1742-6405-2-7\">10.1186/1742-6405-2-7</a>","chicago":"Siegert, Sandra, Sonja Thaler, Ralf Wagner, and Barbara Schnierle. “Assessment of HIV-1 Entry Inhibitors by MLV/HIV-1 Pseudotyped Vectors.” <i>AIDS Research and Therapy</i>. BioMed Central, 2005. <a href=\"https://doi.org/10.1186/1742-6405-2-7\">https://doi.org/10.1186/1742-6405-2-7</a>.","ieee":"S. Siegert, S. Thaler, R. Wagner, and B. Schnierle, “Assessment of HIV-1 entry inhibitors by MLV/HIV-1 pseudotyped vectors,” <i>AIDS Research and Therapy</i>, vol. 2, no. 1. BioMed Central, 2005.","short":"S. Siegert, S. Thaler, R. Wagner, B. Schnierle, AIDS Research and Therapy 2 (2005).","mla":"Siegert, Sandra, et al. “Assessment of HIV-1 Entry Inhibitors by MLV/HIV-1 Pseudotyped Vectors.” <i>AIDS Research and Therapy</i>, vol. 2, no. 1, BioMed Central, 2005, doi:<a href=\"https://doi.org/10.1186/1742-6405-2-7\">10.1186/1742-6405-2-7</a>.","apa":"Siegert, S., Thaler, S., Wagner, R., &#38; Schnierle, B. (2005). Assessment of HIV-1 entry inhibitors by MLV/HIV-1 pseudotyped vectors. <i>AIDS Research and Therapy</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1742-6405-2-7\">https://doi.org/10.1186/1742-6405-2-7</a>"},"day":"12","type":"journal_article","publist_id":"5315","quality_controlled":0,"publication_status":"published","abstract":[{"text":"Background: Murine leukemia virus (MLV) vector particles can be pseudotyped with a truncated variant of the human immunodeficiency virus type 1 (HIV-1) envelope protein (Env) and selectively target gene transfer to human cells expressing both CD4 and an appropriate co-receptor. Vector transduction mimics the HIV-1 entry process and is therefore a safe tool to study HIV-1 entry. Results: Using FLY cells, which express the MLV gag and pol genes, we generated stable producer cell lines that express the HIV-1 envelope gene and a retroviral vector genome encoding the green fluorescent protein (GFP). The BH10 or 89.6 P HIV-1 Env was expressed from a bicistronic vector which allowed the rapid selection of stable cell lines. A codon-usage-optimized synthetic env gene permitted high, Rev-independent Env expression. Vectors generated by these producer cells displayed different sensitivity to entry inhibitors. Conclusion: These data illustrate that MLV/HIV-1 vectors are a valuable screening system for entry inhibitors or neutralizing antisera generated by vaccines.","lang":"eng"}],"_id":"1795","date_published":"2005-09-12T00:00:00Z","date_created":"2018-12-11T11:54:03Z","title":"Assessment of HIV-1 entry inhibitors by MLV/HIV-1 pseudotyped vectors","year":"2005","intvolume":"         2"},{"date_published":"2005-01-01T00:00:00Z","title":"Sparse ICA for blind separation of transmitted and reflected images","date_created":"2024-10-15T11:12:06Z","oa_version":"None","intvolume":"        15","publication_identifier":{"issn":["0899-9457"],"eissn":["1098-1098"]},"year":"2005","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bronstein, Alex M., et al. “Sparse ICA for Blind Separation of Transmitted and Reflected Images.” <i>International Journal of Imaging Systems and Technology</i>, vol. 15, no. 1, Wiley, 2005, pp. 84–91, doi:<a href=\"https://doi.org/10.1002/ima.20042\">10.1002/ima.20042</a>.","short":"A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, Y.Y. Zeevi, International Journal of Imaging Systems and Technology 15 (2005) 84–91.","ieee":"A. M. Bronstein, M. M. Bronstein, M. Zibulevsky, and Y. Y. Zeevi, “Sparse ICA for blind separation of transmitted and reflected images,” <i>International Journal of Imaging Systems and Technology</i>, vol. 15, no. 1. Wiley, pp. 84–91, 2005.","apa":"Bronstein, A. M., Bronstein, M. M., Zibulevsky, M., &#38; Zeevi, Y. Y. (2005). Sparse ICA for blind separation of transmitted and reflected images. <i>International Journal of Imaging Systems and Technology</i>. Wiley. <a href=\"https://doi.org/10.1002/ima.20042\">https://doi.org/10.1002/ima.20042</a>","ama":"Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. Sparse ICA for blind separation of transmitted and reflected images. <i>International Journal of Imaging Systems and Technology</i>. 2005;15(1):84-91. doi:<a href=\"https://doi.org/10.1002/ima.20042\">10.1002/ima.20042</a>","ista":"Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. 2005. Sparse ICA for blind separation of transmitted and reflected images. International Journal of Imaging Systems and Technology. 15(1), 84–91.","chicago":"Bronstein, Alex M., Michael M. Bronstein, Michael Zibulevsky, and Yehoshua Y. Zeevi. “Sparse ICA for Blind Separation of Transmitted and Reflected Images.” <i>International Journal of Imaging Systems and Technology</i>. Wiley, 2005. <a href=\"https://doi.org/10.1002/ima.20042\">https://doi.org/10.1002/ima.20042</a>."},"day":"01","_id":"18317","abstract":[{"text":"We address the problem of recovering a scene recorded through a semireflecting medium (i.e. planar lens), with a virtual reflected image being superimposed on the image of the scene transmitted through the semirefelecting lens. Recent studies propose imaging through a linear polarizer at several orientations to estimate the reflected and the transmitted components in the scene. In this study we extend the sparse ICA (SPICA) technique and apply it to the problem of separating the image of the scene without having any a priori knowledge about its structure or statistics. Recent novel advances in the SPICA approach are discussed. Simulation and experimental results demonstrate the efficacy of the proposed methods.","lang":"eng"}],"language":[{"iso":"eng"}],"type":"journal_article","publication_status":"published","quality_controlled":"1","issue":"1","extern":"1","scopus_import":"1","article_processing_charge":"No","publisher":"Wiley","status":"public","page":"84-91","date_updated":"2024-11-12T08:47:25Z","publication":"International Journal of Imaging Systems and Technology","volume":15,"author":[{"last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."},{"last_name":"Zibulevsky","full_name":"Zibulevsky, Michael","first_name":"Michael"},{"full_name":"Zeevi, Yehoshua Y.","last_name":"Zeevi","first_name":"Yehoshua Y."}],"article_type":"original","month":"01","doi":"10.1002/ima.20042"},{"publication":"5th International Conference on Scale-Space Theories in Computer Vision","date_updated":"2024-10-22T06:29:06Z","status":"public","page":"622-631","scopus_import":"1","language":[{"iso":"eng"}],"_id":"18319","abstract":[{"text":"The problem of isometry-invariant representation and comparison of surfaces is of cardinal importance in pattern recognition applications dealing with deformable objects. Particularly, in three-dimensional face recognition treating facial expressions as isometries of the facial surface allows to perform robust recognition insensitive to expressions.\r\nIsometry-invariant representation of surfaces can be constructed by isometrically embedding them into some convenient space, and carrying out the comparison in that space. Presented here is a discussion on isometric embedding into S3, which appears to be superior over the previously used Euclidean space in sense of the representation accuracy.","lang":"eng"}],"quality_controlled":"1","type":"conference","citation":{"apa":"Bronstein, A. M., Bronstein, M. M., &#38; Kimmel, R. (2005). Isometric embedding of facial surfaces into S3. In <i>5th International Conference on Scale-Space Theories in Computer Vision</i> (Vol. 3459, pp. 622–631). Hofgeismar, Germany: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11408031_53\">https://doi.org/10.1007/11408031_53</a>","ieee":"A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Isometric embedding of facial surfaces into S3,” in <i>5th International Conference on Scale-Space Theories in Computer Vision</i>, Hofgeismar, Germany, 2005, vol. 3459, pp. 622–631.","short":"A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 5th International Conference on Scale-Space Theories in Computer Vision, Springer Berlin Heidelberg, 2005, pp. 622–631.","mla":"Bronstein, Alex M., et al. “Isometric Embedding of Facial Surfaces into S3.” <i>5th International Conference on Scale-Space Theories in Computer Vision</i>, vol. 3459, Springer Berlin Heidelberg, 2005, pp. 622–31, doi:<a href=\"https://doi.org/10.1007/11408031_53\">10.1007/11408031_53</a>.","chicago":"Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Isometric Embedding of Facial Surfaces into S3.” In <i>5th International Conference on Scale-Space Theories in Computer Vision</i>, 3459:622–31. Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11408031_53\">https://doi.org/10.1007/11408031_53</a>.","ista":"Bronstein AM, Bronstein MM, Kimmel R. 2005. Isometric embedding of facial surfaces into S3. 5th International Conference on Scale-Space Theories in Computer Vision. Scale Space: Conference on Scale-Space Theories in Computer Vision, LNIP, vol. 3459, 622–631.","ama":"Bronstein AM, Bronstein MM, Kimmel R. Isometric embedding of facial surfaces into S3. In: <i>5th International Conference on Scale-Space Theories in Computer Vision</i>. Vol 3459. Springer Berlin Heidelberg; 2005:622-631. doi:<a href=\"https://doi.org/10.1007/11408031_53\">10.1007/11408031_53</a>"},"day":"31","intvolume":"      3459","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2005","date_published":"2005-03-31T00:00:00Z","doi":"10.1007/11408031_53","volume":3459,"author":[{"orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"first_name":"Michael M.","last_name":"Bronstein","full_name":"Bronstein, Michael M."},{"first_name":"Ron","last_name":"Kimmel","full_name":"Kimmel, Ron"}],"month":"03","article_processing_charge":"No","publisher":"Springer Berlin Heidelberg","extern":"1","conference":{"end_date":"2005-04-09","location":"Hofgeismar, Germany","name":"Scale Space: Conference on Scale-Space Theories in Computer Vision","start_date":"2005-04-07"},"publication_status":"published","publication_identifier":{"eisbn":["9783540320128"],"isbn":["9783540255475"],"issn":["0302-9743"],"eissn":["1611-3349"]},"title":"Isometric embedding of facial surfaces into S3","alternative_title":["LNIP"],"date_created":"2024-10-15T11:12:06Z","OA_type":"closed access","oa_version":"None"}]