[{"abstract":[{"lang":"eng","text":"In the living cell, proteins are able to organize space much larger than their dimensions. In return, changes of intracellular space can influence biochemical reactions, allowing cells to sense their size and shape. Despite the possibility to reconstitute protein self-organization with only a few purified components, we still lack knowledge of how geometrical boundaries affect spatiotemporal protein patterns. Following a minimal systems approach, we used purified proteins and photolithographically patterned membranes to study the influence of spatial confinement on the self-organization of the Min system, a spatial regulator of bacterial cytokinesis, in vitro. We found that the emerging protein pattern responds even to the lateral, two-dimensional geometry of the membrane such that, as in the three-dimensional cell, Min protein waves travel along the longest axis of the membrane patch. This shows that for spatial sensing the Min system does not need to be enclosed in a three-dimensional compartment. Using a computational model we quantitatively analyzed our experimental findings and identified persistent binding of MinE to the membrane as requirement for the Min system to sense geometry. Our results give insight into the interplay between geometrical confinement and biochemical patterns emerging from a nonlinear reaction-diffusion system.\n"}],"doi":"10.1073/pnas.1206953109","publist_id":"5096","issue":"38","status":"public","_id":"1987","day":"18","citation":{"ama":"Schweizer J, Loose M, Bonny M, Kruse K, Mönch I, Schwille P. Geometry sensing by self-organized protein patterns. <i>PNAS</i>. 2012;109(38):15283-15288. doi:<a href=\"https://doi.org/10.1073/pnas.1206953109\">10.1073/pnas.1206953109</a>","short":"J. Schweizer, M. Loose, M. Bonny, K. Kruse, I. Mönch, P. Schwille, PNAS 109 (2012) 15283–15288.","chicago":"Schweizer, Jakob, Martin Loose, Mike Bonny, Karsten Kruse, Ingolf Mönch, and Petra Schwille. “Geometry Sensing by Self-Organized Protein Patterns.” <i>PNAS</i>. National Academy of Sciences, 2012. <a href=\"https://doi.org/10.1073/pnas.1206953109\">https://doi.org/10.1073/pnas.1206953109</a>.","ieee":"J. Schweizer, M. Loose, M. Bonny, K. Kruse, I. Mönch, and P. Schwille, “Geometry sensing by self-organized protein patterns,” <i>PNAS</i>, vol. 109, no. 38. National Academy of Sciences, pp. 15283–15288, 2012.","ista":"Schweizer J, Loose M, Bonny M, Kruse K, Mönch I, Schwille P. 2012. Geometry sensing by self-organized protein patterns. PNAS. 109(38), 15283–15288.","apa":"Schweizer, J., Loose, M., Bonny, M., Kruse, K., Mönch, I., &#38; Schwille, P. (2012). Geometry sensing by self-organized protein patterns. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1206953109\">https://doi.org/10.1073/pnas.1206953109</a>","mla":"Schweizer, Jakob, et al. “Geometry Sensing by Self-Organized Protein Patterns.” <i>PNAS</i>, vol. 109, no. 38, National Academy of Sciences, 2012, pp. 15283–88, doi:<a href=\"https://doi.org/10.1073/pnas.1206953109\">10.1073/pnas.1206953109</a>."},"author":[{"last_name":"Schweizer","full_name":"Schweizer, Jakob","first_name":"Jakob"},{"orcid":"0000-0001-7309-9724","first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","full_name":"Martin Loose","last_name":"Loose"},{"full_name":"Bonny, Mike ","first_name":"Mike","last_name":"Bonny"},{"full_name":"Kruse, Karsten","first_name":"Karsten","last_name":"Kruse"},{"first_name":"Ingolf","full_name":"Mönch, Ingolf","last_name":"Mönch"},{"first_name":"Petra","full_name":"Schwille, Petra ","last_name":"Schwille"}],"extern":1,"acknowledgement":"This work was supported by the Max-Planck-Society (P.S. and M.L.) and by the German Research Foundation as part of the Research Training Group “Nano- and Biotechnologies for Electronic Device Packaging” (GRK 1401) (J.S.) and by the Leibniz-Award (P.S.). ","publication_status":"published","date_updated":"2021-01-12T06:54:31Z","type":"journal_article","month":"09","quality_controlled":0,"title":"Geometry sensing by self-organized protein patterns","date_published":"2012-09-18T00:00:00Z","publisher":"National Academy of Sciences","publication":"PNAS","volume":109,"year":"2012","page":"15283 - 15288","date_created":"2018-12-11T11:55:04Z","intvolume":"       109"},{"acknowledgement":"Sebastian Faust acknowledges support from the Danish National Research Foundation and The National Science Foundation of China (under the grant 61061130540) for the Sino-Danish Center for the Theory of Interactive Computation, within part of this work was performed; and from the CFEM research center, supported by the Danish Strategic Research Council. \r\nSupported by the European Research Council/ERC Starting Grant 259668-PSPC.\r\n","publication_status":"published","day":"01","ec_funded":1,"alternative_title":["LNCS"],"month":"09","doi":"10.1007/978-3-642-33027-8_13","publist_id":"5003","abstract":[{"text":"Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively.","lang":"eng"}],"status":"public","language":[{"iso":"eng"}],"intvolume":"      7428","page":"213 - 232","publisher":"Springer","date_updated":"2021-01-12T06:54:58Z","oa_version":"Preprint","department":[{"_id":"KrPi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Faust S, Pietrzak KZ, Schipper J. 2012. Practical leakage-resilient symmetric cryptography.  Conference proceedings CHES 2012. CHES: Cryptographic Hardware and Embedded Systems, LNCS, vol. 7428, 213–232.","apa":"Faust, S., Pietrzak, K. Z., &#38; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In <i> Conference proceedings CHES 2012</i> (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>","mla":"Faust, Sebastian, et al. “Practical Leakage-Resilient Symmetric Cryptography.” <i> Conference Proceedings CHES 2012</i>, vol. 7428, Springer, 2012, pp. 213–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>.","ieee":"S. Faust, K. Z. Pietrzak, and J. Schipper, “Practical leakage-resilient symmetric cryptography,” in <i> Conference proceedings CHES 2012</i>, Leuven, Belgium, 2012, vol. 7428, pp. 213–232.","ama":"Faust S, Pietrzak KZ, Schipper J. Practical leakage-resilient symmetric cryptography. In: <i> Conference Proceedings CHES 2012</i>. Vol 7428. Springer; 2012:213-232. doi:<a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">10.1007/978-3-642-33027-8_13</a>","short":"S. Faust, K.Z. Pietrzak, J. Schipper, in:,  Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.","chicago":"Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.” In <i> Conference Proceedings CHES 2012</i>, 7428:213–32. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33027-8_13\">https://doi.org/10.1007/978-3-642-33027-8_13</a>."},"oa":1,"author":[{"last_name":"Faust","full_name":"Faust, Sebastian","first_name":"Sebastian"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"},{"last_name":"Schipper","full_name":"Schipper, Joachim","first_name":"Joachim","id":"7BE863D4-E9CF-11E9-9EDB-90527418172C"}],"type":"conference","scopus_import":1,"_id":"2048","main_file_link":[{"url":"http://www.iacr.org/archive/ches2012/74280211/74280211.pdf","open_access":"1"}],"year":"2012","publication":" Conference proceedings CHES 2012","volume":7428,"date_created":"2018-12-11T11:55:25Z","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_published":"2012-09-01T00:00:00Z","title":"Practical leakage-resilient symmetric cryptography","quality_controlled":"1","conference":{"start_date":"2012-09-09","location":"Leuven, Belgium","end_date":"2012-09-12","name":"CHES: Cryptographic Hardware and Embedded Systems"}},{"quality_controlled":"1","project":[{"grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"title":"Lapin: An efficient authentication protocol based on ring-LPN","date_published":"2012-03-01T00:00:00Z","conference":{"name":"FSE: Fast Software Encryption","location":"Washington, DC, USA","start_date":"2012-03-19","end_date":"2012-03-21"},"publication":" Conference proceedings FSE 2012","volume":7549,"year":"2012","main_file_link":[{"url":"http://www.iacr.org/archive/fse2012/75490350/75490350.pdf","open_access":"1"}],"date_created":"2018-12-11T11:55:25Z","scopus_import":1,"_id":"2049","citation":{"ista":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. 2012. Lapin: An efficient authentication protocol based on ring-LPN.  Conference proceedings FSE 2012. FSE: Fast Software Encryption, LNCS, vol. 7549, 346–365.","mla":"Heyse, Stefan, et al. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” <i> Conference Proceedings FSE 2012</i>, vol. 7549, Springer, 2012, pp. 346–65, doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>.","apa":"Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &#38; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In <i> Conference proceedings FSE 2012</i> (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>","short":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:,  Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.","ama":"Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: <i> Conference Proceedings FSE 2012</i>. Vol 7549. Springer; 2012:346-365. doi:<a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">10.1007/978-3-642-34047-5_20</a>","chicago":"Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In <i> Conference Proceedings FSE 2012</i>, 7549:346–65. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34047-5_20\">https://doi.org/10.1007/978-3-642-34047-5_20</a>.","ieee":"S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in <i> Conference proceedings FSE 2012</i>, Washington, DC, USA, 2012, vol. 7549, pp. 346–365."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"first_name":"Stefan","full_name":"Heyse, Stefan","last_name":"Heyse"},{"last_name":"Kiltz","full_name":"Kiltz, Eike","first_name":"Eike"},{"first_name":"Vadim","full_name":"Lyubashevsky, Vadim","last_name":"Lyubashevsky"},{"last_name":"Paar","full_name":"Paar, Christof","first_name":"Christof"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak"}],"oa_version":"Preprint","date_updated":"2021-01-12T06:54:58Z","department":[{"_id":"KrPi"}],"type":"conference","publisher":"Springer","language":[{"iso":"eng"}],"page":"346 - 365","intvolume":"      7549","abstract":[{"text":"We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.\r\n\r\nPerformance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.\r\n","lang":"eng"}],"publist_id":"5002","doi":"10.1007/978-3-642-34047-5_20","status":"public","day":"01","ec_funded":1,"acknowledgement":"Supported by the European Research Council / ERC Starting Grant (259668- PSPC)\r\nWe would like to thank the anonymous referees of this confer- ence and those of the ECRYPT Workshop on Lightweight Cryptography for very useful comments, and in particular for the suggestion that the scheme is somewhat vulnerable to a man-in-the-middle attack whenever an adversary observes two reader challenges that are the same. We hope that the attack we described in Appendix A corresponds to what the reviewer had in mind. We also thank Tanja Lange for pointing us to the pa- per of [Kir11] and for discussions of some of her recent work. ","publication_status":"published","month":"03","alternative_title":["LNCS"]},{"citation":{"chicago":"Zhou, Qi, Hongmei Zhu, Quanfei Huang, Li Zhao, Guo Zhang, Scott Roy, Beatriz Vicoso, et al. “Deciphering Neo-Sex and B Chromosome Evolution by the Draft Genome of Drosophila Albomicans.” <i>BMC Genomics</i>. BioMed Central, 2012. <a href=\"https://doi.org/10.1186/1471-2164-13-109\">https://doi.org/10.1186/1471-2164-13-109</a>.","short":"Q. Zhou, H. Zhu, Q. Huang, L. Zhao, G. Zhang, S. Roy, B. Vicoso, Z. Xuan, J. Ruan, Y. Zhang, R. Zhao, C. Ye, X. Zhang, J. Wang, W. Wang, D. Bachtrog, BMC Genomics 13 (2012).","ama":"Zhou Q, Zhu H, Huang Q, et al. Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. <i>BMC Genomics</i>. 2012;13(1). doi:<a href=\"https://doi.org/10.1186/1471-2164-13-109\">10.1186/1471-2164-13-109</a>","ieee":"Q. Zhou <i>et al.</i>, “Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans,” <i>BMC Genomics</i>, vol. 13, no. 1. BioMed Central, 2012.","apa":"Zhou, Q., Zhu, H., Huang, Q., Zhao, L., Zhang, G., Roy, S., … Bachtrog, D. (2012). Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. <i>BMC Genomics</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2164-13-109\">https://doi.org/10.1186/1471-2164-13-109</a>","mla":"Zhou, Qi, et al. “Deciphering Neo-Sex and B Chromosome Evolution by the Draft Genome of Drosophila Albomicans.” <i>BMC Genomics</i>, vol. 13, no. 1, BioMed Central, 2012, doi:<a href=\"https://doi.org/10.1186/1471-2164-13-109\">10.1186/1471-2164-13-109</a>.","ista":"Zhou Q, Zhu H, Huang Q, Zhao L, Zhang G, Roy S, Vicoso B, Xuan Z, Ruan J, Zhang Y, Zhao R, Ye C, Zhang X, Wang J, Wang W, Bachtrog D. 2012. Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. BMC Genomics. 13(1)."},"day":"22","author":[{"first_name":"Qi","full_name":"Zhou, Qi","last_name":"Zhou"},{"last_name":"Zhu","full_name":"Zhu, Hongmei","first_name":"Hongmei"},{"first_name":"Quanfei","full_name":"Huang, Quanfei","last_name":"Huang"},{"first_name":"Li","full_name":"Zhao, Li","last_name":"Zhao"},{"first_name":"Guo","full_name":"Zhang, Guo J","last_name":"Zhang"},{"last_name":"Roy","full_name":"Roy, Scott W","first_name":"Scott"},{"last_name":"Vicoso","orcid":"0000-0002-4579-8306","first_name":"Beatriz","full_name":"Beatriz Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Xuan","full_name":"Xuan, Zhaolin","first_name":"Zhaolin"},{"full_name":"Ruan, Jue","first_name":"Jue","last_name":"Ruan"},{"first_name":"Yue","full_name":"Zhang, Yue","last_name":"Zhang"},{"last_name":"Zhao","full_name":"Zhao, Ruoping","first_name":"Ruoping"},{"full_name":"Ye, Chen","first_name":"Chen","last_name":"Ye"},{"full_name":"Zhang, Xiuqing","first_name":"Xiuqing","last_name":"Zhang"},{"last_name":"Wang","full_name":"Wang, Jùn","first_name":"Jùn"},{"first_name":"Wen","full_name":"Wang, Wen","last_name":"Wang"},{"last_name":"Bachtrog","first_name":"Doris","full_name":"Bachtrog, Doris"}],"extern":1,"date_updated":"2021-01-12T06:55:08Z","publication_status":"published","type":"journal_article","month":"03","doi":"10.1186/1471-2164-13-109","abstract":[{"lang":"eng","text":"Background: Drosophila albomicans is a unique model organism for studying both sex chromosome and B chromosome evolution. A pair of its autosomes comprising roughly 40% of the whole genome has fused to the ancient X and Y chromosomes only about 0.12 million years ago, thereby creating the youngest and most gene-rich neo-sex system reported to date. This species also possesses recently derived B chromosomes that show non-Mendelian inheritance and significantly influence fertility.Methods: We sequenced male flies with B chromosomes at 124.5-fold genome coverage using next-generation sequencing. To characterize neo-Y specific changes and B chromosome sequences, we also sequenced inbred female flies derived from the same strain but without B's at 28.5-fold.Results: We assembled a female genome and placed 53% of the sequence and 85% of the annotated proteins into specific chromosomes, by comparison with the 12 Drosophila genomes. Despite its very recent origin, the non-recombining neo-Y chromosome shows various signs of degeneration, including a significant enrichment of non-functional genes compared to the neo-X, and an excess of tandem duplications relative to other chromosomes. We also characterized a B-chromosome linked scaffold that contains an actively transcribed unit and shows sequence similarity to the subcentromeric regions of both the ancient X and the neo-X chromosome.Conclusions: Our results provide novel insights into the very early stages of sex chromosome evolution and B chromosome origination, and suggest an unprecedented connection between the births of these two systems in D. albomicans."}],"publist_id":"4965","issue":"1","status":"public","_id":"2073","publication":"BMC Genomics","volume":13,"year":"2012","intvolume":"        13","date_created":"2018-12-11T11:55:33Z","quality_controlled":0,"date_published":"2012-03-22T00:00:00Z","title":"Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans","publisher":"BioMed Central","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"month":"05","type":"journal_article","author":[{"last_name":"Hildebrand","first_name":"Kristian","full_name":"Hildebrand, Kristian"},{"last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385"},{"last_name":"Alexa","first_name":"Marc","full_name":"Alexa, Marc"}],"extern":1,"day":"01","citation":{"ama":"Hildebrand K, Bickel B, Alexa M. crdbrd: Shape fabrication by sliding planar slices. <i>Computer Graphics Forum</i>. 2012;31(2pt3):583-592. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">10.1111/j.1467-8659.2012.03037.x</a>","short":"K. Hildebrand, B. Bickel, M. Alexa, Computer Graphics Forum 31 (2012) 583–592.","chicago":"Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Crdbrd: Shape Fabrication by Sliding Planar Slices.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">https://doi.org/10.1111/j.1467-8659.2012.03037.x</a>.","ieee":"K. Hildebrand, B. Bickel, and M. Alexa, “crdbrd: Shape fabrication by sliding planar slices,” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3. Wiley-Blackwell, pp. 583–592, 2012.","ista":"Hildebrand K, Bickel B, Alexa M. 2012. crdbrd: Shape fabrication by sliding planar slices. Computer Graphics Forum. 31(2pt3), 583–592.","mla":"Hildebrand, Kristian, et al. “Crdbrd: Shape Fabrication by Sliding Planar Slices.” <i>Computer Graphics Forum</i>, vol. 31, no. 2pt3, Wiley-Blackwell, 2012, pp. 583–92, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">10.1111/j.1467-8659.2012.03037.x</a>.","apa":"Hildebrand, K., Bickel, B., &#38; Alexa, M. (2012). crdbrd: Shape fabrication by sliding planar slices. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03037.x\">https://doi.org/10.1111/j.1467-8659.2012.03037.x</a>"},"date_updated":"2021-01-12T06:55:10Z","publication_status":"published","_id":"2079","status":"public","doi":"10.1111/j.1467-8659.2012.03037.x","abstract":[{"text":"We introduce an algorithm and representation for fabricating 3D shape abstractions using mutually intersecting planar cut-outs. The planes have prefabricated slits at their intersections and are assembled by sliding them together. Often such abstractions are used as a sculptural art form or in architecture and are colloquially called ‘cardboard sculptures’. Based on an analysis of construction rules, we propose an extended binary space partitioning tree as an efficient representation of such cardboard models which allows us to quickly evaluate the feasibility of newly added planar elements. The complexity of insertion order quickly increases with the number of planar elements and manual analysis becomes intractable. We provide tools for generating cardboard sculptures with guaranteed constructibility. In combination with a simple optimization and sampling strategy for new elements, planar shape abstraction models can be designed by iteratively adding elements. As an output, we obtain a fabrication plan that can be printed or sent to a laser cutter. We demonstrate the complete process by designing and fabricating cardboard models of various well-known 3D shapes.","lang":"eng"}],"publist_id":"4959","issue":"2pt3","page":"583 - 592","date_created":"2018-12-11T11:55:35Z","intvolume":"        31","volume":31,"publication":"Computer Graphics Forum","year":"2012","publisher":"Wiley-Blackwell","quality_controlled":0,"title":"crdbrd: Shape fabrication by sliding planar slices","date_published":"2012-05-01T00:00:00Z"},{"quality_controlled":0,"title":"Fabricating articulated characters from skinned meshes","date_published":"2012-01-01T00:00:00Z","publisher":"ACM","publication":"ACM Transactions on Graphics","volume":31,"year":"2012","date_created":"2018-12-11T11:55:43Z","intvolume":"        31","abstract":[{"lang":"eng","text":"Articulated deformable characters are widespread in computer animation. Unfortunately, we lack methods for their automatic fabrication using modern additive manufacturing (AM) technologies. We propose a method that takes a skinned mesh as input, then estimates a fabricatable single-material model that approximates the 3D kinematics of the corresponding virtual articulated character in a piecewise linear manner. We first extract a set of potential joint locations. From this set, together with optional, user-specified range constraints, we then estimate mechanical friction joints that satisfy inter-joint non-penetration and other fabrication constraints. To avoid brittle joint designs, we place joint centers on an approximate medial axis representation of the input geometry, and maximize each joint's minimal cross-sectional area. We provide several demonstrations, manufactured as single, assembled pieces using 3D printers. "}],"doi":"10.1145/2185520.2185543","publist_id":"4933","issue":"4","status":"public","_id":"2101","day":"01","citation":{"ieee":"M. Bac̈Her, B. Bickel, D. James, and H. Pfister, “Fabricating articulated characters from skinned meshes,” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4. ACM, 2012.","short":"M. Bac̈Her, B. Bickel, D. James, H. Pfister, ACM Transactions on Graphics 31 (2012).","ama":"Bac̈Her M, Bickel B, James D, Pfister H. Fabricating articulated characters from skinned meshes. <i>ACM Transactions on Graphics</i>. 2012;31(4). doi:<a href=\"https://doi.org/10.1145/2185520.2185543\">10.1145/2185520.2185543</a>","chicago":"Bac̈Her, Moritz, Bernd Bickel, Doug James, and Hanspeter Pfister. “Fabricating Articulated Characters from Skinned Meshes.” <i>ACM Transactions on Graphics</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2185520.2185543\">https://doi.org/10.1145/2185520.2185543</a>.","ista":"Bac̈Her M, Bickel B, James D, Pfister H. 2012. Fabricating articulated characters from skinned meshes. ACM Transactions on Graphics. 31(4).","apa":"Bac̈Her, M., Bickel, B., James, D., &#38; Pfister, H. (2012). Fabricating articulated characters from skinned meshes. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2185520.2185543\">https://doi.org/10.1145/2185520.2185543</a>","mla":"Bac̈Her, Moritz, et al. “Fabricating Articulated Characters from Skinned Meshes.” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2185520.2185543\">10.1145/2185520.2185543</a>."},"extern":1,"author":[{"last_name":"Bac̈Her","full_name":"Bac̈her, Moritz","first_name":"Moritz"},{"last_name":"Bickel","first_name":"Bernd","full_name":"Bernd Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"},{"last_name":"James","full_name":"James, Doug L","first_name":"Doug"},{"last_name":"Pfister","first_name":"Hanspeter","full_name":"Pfister, Hanspeter"}],"acknowledgement":"This work was partially supported by NSF grant IIS-1116619. Doug James acknowledges support from Pixar and a fellowship from the John Simon Guggenheim Memorial Foundation","date_updated":"2021-01-12T06:55:19Z","publication_status":"published","type":"journal_article","month":"01"},{"quality_controlled":0,"title":"Physical face cloning","date_published":"2012-07-04T00:00:00Z","publisher":"ACM","volume":31,"publication":"ACM Transactions on Graphics","year":"2012","date_created":"2018-12-11T11:55:43Z","intvolume":"        31","abstract":[{"text":"We propose a complete process for designing, simulating, and fabricating synthetic skin for an animatronics character that mimics the face of a given subject and its expressions. The process starts with measuring the elastic properties of a material used to manufacture synthetic soft tissue. Given these measurements we use physicsbased simulation to predict the behavior of a face when it is driven by the underlying robotic actuation. Next, we capture 3D facial expressions for a given target subject. As the key component of our process, we present a novel optimization scheme that determines the shape of the synthetic skin as well as the actuation parameters that provide the best match to the target expressions. We demonstrate this computational skin design by physically cloning a real human face onto an animatronics figure. ","lang":"eng"}],"publist_id":"4931","doi":"10.1145/2185520.2185614","issue":"4","_id":"2102","status":"public","author":[{"last_name":"Bickel","full_name":"Bernd Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"},{"first_name":"Peter","full_name":"Kaufmann, Peter","last_name":"Kaufmann"},{"full_name":"Skouras, Mélina","first_name":"Mélina","last_name":"Skouras"},{"full_name":"Thomaszewski, Bernhard","first_name":"Bernhard","last_name":"Thomaszewski"},{"last_name":"Bradley","full_name":"Bradley, Derek J","first_name":"Derek"},{"last_name":"Beeler","full_name":"Beeler, Thabo","first_name":"Thabo"},{"last_name":"Jackson","first_name":"Philip","full_name":"Jackson, Philip V"},{"full_name":"Marschner, Steve","first_name":"Steve","last_name":"Marschner"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"},{"last_name":"Groß","first_name":"Markus","full_name":"Groß, Markus S"}],"extern":1,"citation":{"ista":"Bickel B, Kaufmann P, Skouras M, Thomaszewski B, Bradley D, Beeler T, Jackson P, Marschner S, Matusik W, Groß M. 2012. Physical face cloning. ACM Transactions on Graphics. 31(4).","apa":"Bickel, B., Kaufmann, P., Skouras, M., Thomaszewski, B., Bradley, D., Beeler, T., … Groß, M. (2012). Physical face cloning. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2185520.2185614\">https://doi.org/10.1145/2185520.2185614</a>","mla":"Bickel, Bernd, et al. “Physical Face Cloning.” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2185520.2185614\">10.1145/2185520.2185614</a>.","ama":"Bickel B, Kaufmann P, Skouras M, et al. Physical face cloning. <i>ACM Transactions on Graphics</i>. 2012;31(4). doi:<a href=\"https://doi.org/10.1145/2185520.2185614\">10.1145/2185520.2185614</a>","short":"B. Bickel, P. Kaufmann, M. Skouras, B. Thomaszewski, D. Bradley, T. Beeler, P. Jackson, S. Marschner, W. Matusik, M. Groß, ACM Transactions on Graphics 31 (2012).","chicago":"Bickel, Bernd, Peter Kaufmann, Mélina Skouras, Bernhard Thomaszewski, Derek Bradley, Thabo Beeler, Philip Jackson, Steve Marschner, Wojciech Matusik, and Markus Groß. “Physical Face Cloning.” <i>ACM Transactions on Graphics</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2185520.2185614\">https://doi.org/10.1145/2185520.2185614</a>.","ieee":"B. Bickel <i>et al.</i>, “Physical face cloning,” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4. ACM, 2012."},"day":"04","acknowledgement":"This work was supported in part by the NCCR Co-Me of the Swiss NSF","publication_status":"published","date_updated":"2021-01-12T06:55:19Z","month":"07","type":"journal_article"},{"publisher":"ACM","quality_controlled":0,"title":"Coupled 3D reconstruction of sparse facial hair and skin","date_published":"2012-01-01T00:00:00Z","intvolume":"        31","date_created":"2018-12-11T11:55:44Z","publication":"ACM Transactions on Graphics","volume":31,"year":"2012","status":"public","_id":"2103","abstract":[{"lang":"eng","text":"Although facial hair plays an important role in individual expression, facial-hair reconstruction is not addressed by current facecapture systems. Our research addresses this limitation with an algorithm that treats hair and skin surface capture together in a coupled fashion so that a high-quality representation of hair fibers as well as the underlying skin surface can be reconstructed. We propose a passive, camera-based system that is robust against arbitrary motion since all data is acquired within the time period of a single exposure. Our reconstruction algorithm detects and traces hairs in the captured images and reconstructs them in 3D using a multiview stereo approach. Our coupled skin-reconstruction algorithm uses information about the detected hairs to deliver a skin surface that lies underneath all hairs irrespective of occlusions. In dense regions like eyebrows, we employ a hair-synthesis method to create hair fibers that plausibly match the image data. We demonstrate our scanning system on a number of individuals and show that it can successfully reconstruct a variety of facial-hair styles together with the underlying skin surface."}],"doi":"10.1145/2185520.2185613","publist_id":"4932","issue":"4","type":"journal_article","month":"01","day":"01","citation":{"ieee":"T. Beeler <i>et al.</i>, “Coupled 3D reconstruction of sparse facial hair and skin,” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4. ACM, 2012.","chicago":"Beeler, Thabo, Bernd Bickel, Gioacchino Noris, Paul Beardsley, Steve Marschner, Robert Sumner, and Markus Groß. “Coupled 3D Reconstruction of Sparse Facial Hair and Skin.” <i>ACM Transactions on Graphics</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2185520.2185613\">https://doi.org/10.1145/2185520.2185613</a>.","ama":"Beeler T, Bickel B, Noris G, et al. Coupled 3D reconstruction of sparse facial hair and skin. <i>ACM Transactions on Graphics</i>. 2012;31(4). doi:<a href=\"https://doi.org/10.1145/2185520.2185613\">10.1145/2185520.2185613</a>","short":"T. Beeler, B. Bickel, G. Noris, P. Beardsley, S. Marschner, R. Sumner, M. Groß, ACM Transactions on Graphics 31 (2012).","mla":"Beeler, Thabo, et al. “Coupled 3D Reconstruction of Sparse Facial Hair and Skin.” <i>ACM Transactions on Graphics</i>, vol. 31, no. 4, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2185520.2185613\">10.1145/2185520.2185613</a>.","apa":"Beeler, T., Bickel, B., Noris, G., Beardsley, P., Marschner, S., Sumner, R., &#38; Groß, M. (2012). Coupled 3D reconstruction of sparse facial hair and skin. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2185520.2185613\">https://doi.org/10.1145/2185520.2185613</a>","ista":"Beeler T, Bickel B, Noris G, Beardsley P, Marschner S, Sumner R, Groß M. 2012. Coupled 3D reconstruction of sparse facial hair and skin. ACM Transactions on Graphics. 31(4)."},"extern":1,"author":[{"last_name":"Beeler","full_name":"Beeler, Thabo","first_name":"Thabo"},{"orcid":"0000-0001-6511-9385","first_name":"Bernd","full_name":"Bernd Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"},{"first_name":"Gioacchino","full_name":"Noris, Gioacchino","last_name":"Noris"},{"first_name":"Paul","full_name":"Beardsley, Paul A","last_name":"Beardsley"},{"full_name":"Marschner, Steve","first_name":"Steve","last_name":"Marschner"},{"full_name":"Sumner, Robert W","first_name":"Robert","last_name":"Sumner"},{"first_name":"Markus","full_name":"Groß, Markus S","last_name":"Groß"}],"date_updated":"2021-01-12T06:55:20Z","publication_status":"published"},{"year":"2012","date_created":"2018-12-11T11:55:44Z","quality_controlled":0,"date_published":"2012-01-01T00:00:00Z","title":"Data-driven simulation methods in computer graphics: Cloth, tissue and faces","publisher":"ACM","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"author":[{"last_name":"Otaduy","full_name":"Otaduy, Miguel A","first_name":"Miguel"},{"last_name":"Bickel","full_name":"Bernd Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"},{"first_name":"Derek","full_name":"Bradley, Derek J","last_name":"Bradley"},{"last_name":"Wang","full_name":"Wang, Huamin","first_name":"Huamin"}],"extern":1,"day":"01","citation":{"ieee":"M. Otaduy, B. Bickel, D. Bradley, and H. Wang, “Data-driven simulation methods in computer graphics: Cloth, tissue and faces,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 2012.","short":"M. Otaduy, B. Bickel, D. Bradley, H. Wang, in:, ACM, 2012.","ama":"Otaduy M, Bickel B, Bradley D, Wang H. Data-driven simulation methods in computer graphics: Cloth, tissue and faces. In: ACM; 2012. doi:<a href=\"https://doi.org/10.1145/2343483.2343495\">10.1145/2343483.2343495</a>","chicago":"Otaduy, Miguel, Bernd Bickel, Derek Bradley, and Huamin Wang. “Data-Driven Simulation Methods in Computer Graphics: Cloth, Tissue and Faces.” ACM, 2012. <a href=\"https://doi.org/10.1145/2343483.2343495\">https://doi.org/10.1145/2343483.2343495</a>.","ista":"Otaduy M, Bickel B, Bradley D, Wang H. 2012. Data-driven simulation methods in computer graphics: Cloth, tissue and faces. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques.","apa":"Otaduy, M., Bickel, B., Bradley, D., &#38; Wang, H. (2012). Data-driven simulation methods in computer graphics: Cloth, tissue and faces. Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM. <a href=\"https://doi.org/10.1145/2343483.2343495\">https://doi.org/10.1145/2343483.2343495</a>","mla":"Otaduy, Miguel, et al. <i>Data-Driven Simulation Methods in Computer Graphics: Cloth, Tissue and Faces</i>. ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2343483.2343495\">10.1145/2343483.2343495</a>."},"publication_status":"published","date_updated":"2021-01-12T06:55:20Z","month":"01","type":"conference","doi":"10.1145/2343483.2343495","publist_id":"4930","abstract":[{"text":"In recent years, various methods have been introduced to exploit pre-recorded data to improve the performance and/or realism of dynamic deformations, but their differences and similarities have not been adequately analyzed or discussed. So far, the proposed methods have been explored mainly in the research context. They have not been adopted by the computer graphics industry. This course bridges the gap between research labs and industry to present a unifying theory and understanding of data-driven methods for dynamic deformations that may inspire development of novel solutions. It focuses on application of data-driven methods to three areas of computer animation: dynamic deformation of faces, soft volumetric tissue, and cloth. And it describes how to approach these challenges in a data-driven manner, classifies the various methods, and demonstrates how data-driven methods can work in other settings. ","lang":"eng"}],"_id":"2104","status":"public"},{"doi":"10.1111/j.1467-8659.2012.03064.x","publist_id":"4928","issue":"2","status":"public","_id":"2105","day":"01","citation":{"mla":"Skouras, Mélina, et al. <i>Computational Design of Rubber Balloons</i>. Vol. 31, no. 2, Wiley-Blackwell, 2012, pp. 835–44, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03064.x\">10.1111/j.1467-8659.2012.03064.x</a>.","apa":"Skouras, M., Thomaszewski, B., Bickel, B., &#38; Groß, M. (2012). Computational design of rubber balloons (Vol. 31, pp. 835–844). Presented at the EUROGRAPHICS: European Association for Computer Graphics, Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03064.x\">https://doi.org/10.1111/j.1467-8659.2012.03064.x</a>","ista":"Skouras M, Thomaszewski B, Bickel B, Groß M. 2012. Computational design of rubber balloons. EUROGRAPHICS: European Association for Computer Graphics vol. 31, 835–844.","chicago":"Skouras, Mélina, Bernhard Thomaszewski, Bernd Bickel, and Markus Groß. “Computational Design of Rubber Balloons,” 31:835–44. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03064.x\">https://doi.org/10.1111/j.1467-8659.2012.03064.x</a>.","short":"M. Skouras, B. Thomaszewski, B. Bickel, M. Groß, in:, Wiley-Blackwell, 2012, pp. 835–844.","ama":"Skouras M, Thomaszewski B, Bickel B, Groß M. Computational design of rubber balloons. In: Vol 31. Wiley-Blackwell; 2012:835-844. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03064.x\">10.1111/j.1467-8659.2012.03064.x</a>","ieee":"M. Skouras, B. Thomaszewski, B. Bickel, and M. Groß, “Computational design of rubber balloons,” presented at the EUROGRAPHICS: European Association for Computer Graphics, 2012, vol. 31, no. 2, pp. 835–844."},"extern":1,"author":[{"full_name":"Skouras, Mélina","first_name":"Mélina","last_name":"Skouras"},{"full_name":"Thomaszewski, Bernhard","first_name":"Bernhard","last_name":"Thomaszewski"},{"last_name":"Bickel","full_name":"Bernd Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"last_name":"Groß","first_name":"Markus","full_name":"Groß, Markus S"}],"publication_status":"published","acknowledgement":"Mélina Skouras was partially supported by the NCCR Co-Me of the Swiss National Science Foundation.","date_updated":"2021-01-12T06:55:20Z","type":"conference","month":"05","quality_controlled":0,"title":"Computational design of rubber balloons","date_published":"2012-05-01T00:00:00Z","publisher":"Wiley-Blackwell","conference":{"name":"EUROGRAPHICS: European Association for Computer Graphics"},"volume":31,"year":"2012","page":"835 - 844","intvolume":"        31","date_created":"2018-12-11T11:55:45Z"},{"conference":{"name":"Computer Graphics Forum"},"publisher":"Wiley-Blackwell","date_published":"2012-05-01T00:00:00Z","title":"Data-driven estimation of cloth simulation models","quality_controlled":0,"date_created":"2018-12-11T11:55:45Z","intvolume":"        31","page":"519 - 528","year":"2012","volume":31,"status":"public","_id":"2106","issue":"2","doi":"10.1111/j.1467-8659.2012.03031.x","abstract":[{"text":"Progress in cloth simulation for computer animation and apparel design has led to a multitude of deformation models, each with its own way of relating geometry, deformation, and forces. As simulators improve, differences between these models become more important, but it is difficult to choose a model and a set of parameters to match a given real material simply by looking at simulation results. This paper provides measurement and fitting methods that allow nonlinear models to be fit to the observed deformation of a particular cloth sample. Unlike standard textile testing, our system measures complex 3D deformations of a sheet of cloth, not just one-dimensional force-displacement curves, so it works under a wider range of deformation conditions. The fitted models are then evaluated by comparison to measured deformations with motions very different from those used for fitting.","lang":"eng"}],"publist_id":"4929","type":"conference","month":"05","acknowledgement":"This work was funded in part by the Spanish Ministry of Science and Innovation, project TIN2009-07942, and by the European Research Council, project ERC-2011-StG-280135 Animetrics.","publication_status":"published","date_updated":"2021-01-12T06:55:21Z","citation":{"ieee":"E. Miguel <i>et al.</i>, “Data-driven estimation of cloth simulation models,” presented at the Computer Graphics Forum, 2012, vol. 31, no. 2, pp. 519–528.","chicago":"Miguel, Eder, Derek Bradley, Bernhard Thomaszewski, Bernd Bickel, Wojciech Matusik, Miguel Otaduy, and Steve Marschner. “Data-Driven Estimation of Cloth Simulation Models,” 31:519–28. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03031.x\">https://doi.org/10.1111/j.1467-8659.2012.03031.x</a>.","short":"E. Miguel, D. Bradley, B. Thomaszewski, B. Bickel, W. Matusik, M. Otaduy, S. Marschner, in:, Wiley-Blackwell, 2012, pp. 519–528.","ama":"Miguel E, Bradley D, Thomaszewski B, et al. Data-driven estimation of cloth simulation models. In: Vol 31. Wiley-Blackwell; 2012:519-528. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03031.x\">10.1111/j.1467-8659.2012.03031.x</a>","apa":"Miguel, E., Bradley, D., Thomaszewski, B., Bickel, B., Matusik, W., Otaduy, M., &#38; Marschner, S. (2012). Data-driven estimation of cloth simulation models (Vol. 31, pp. 519–528). Presented at the Computer Graphics Forum, Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1467-8659.2012.03031.x\">https://doi.org/10.1111/j.1467-8659.2012.03031.x</a>","mla":"Miguel, Eder, et al. <i>Data-Driven Estimation of Cloth Simulation Models</i>. Vol. 31, no. 2, Wiley-Blackwell, 2012, pp. 519–28, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2012.03031.x\">10.1111/j.1467-8659.2012.03031.x</a>.","ista":"Miguel E, Bradley D, Thomaszewski B, Bickel B, Matusik W, Otaduy M, Marschner S. 2012. Data-driven estimation of cloth simulation models. Computer Graphics Forum vol. 31, 519–528."},"day":"01","extern":1,"author":[{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"last_name":"Bradley","first_name":"Derek","full_name":"Bradley, Derek J"},{"last_name":"Thomaszewski","first_name":"Bernhard","full_name":"Thomaszewski, Bernhard"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385"},{"last_name":"Matusik","full_name":"Matusik, Wojciech","first_name":"Wojciech"},{"first_name":"Miguel","full_name":"Otaduy, Miguel A","last_name":"Otaduy"},{"last_name":"Marschner","first_name":"Steve","full_name":"Marschner, Steve"}]},{"publisher":"Institute of Mathematical Statistics","date_published":"2012-07-01T00:00:00Z","title":"A spatial version of the Itô-Stratonovich correction","quality_controlled":0,"intvolume":"        40","date_created":"2018-12-11T11:55:51Z","page":"1675 - 1714","main_file_link":[{"url":"http://arxiv.org/abs/1011.0966","open_access":"1"}],"year":"2012","volume":40,"publication":"Annals of Probability","_id":"2125","status":"public","issue":"4","abstract":[{"text":"We consider a class of stochastic PDEs of Burgers type in spatial dimension 1, driven by space–time white noise. Even though it is well known that these equations are well posed, it turns out that if one performs a spatial discretization of the nonlinearity in the “wrong” way, then the sequence of approximate equations does converge to a limit, but this limit exhibits an additional correction term. This correction term is proportional to the local quadratic cross-variation (in space) of the gradient of the conserved quantity with the solution itself. This can be understood as a consequence of the fact that for any fixed time, the law of the solution is locally equivalent to Wiener measure, where space plays the role of time. In this sense, the correction term is similar to the usual Itô–Stratonovich correction term that arises when one considers different temporal discretizations of stochastic ODEs.","lang":"eng"}],"doi":"10.1214/11-AOP662","publist_id":"4908","month":"07","type":"journal_article","acknowledgement":"Supported by Rubicon Grant 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). Supported by the EPSRC Grants EP/E002269/1 and EP/D071593/1, a Wolfson Research Merit Award of the Royal Society and a Philip Leverhulme prize of the Lev","date_updated":"2021-01-12T06:55:27Z","publication_status":"published","extern":1,"author":[{"first_name":"Martin","full_name":"Hairer, Martin M","last_name":"Hairer"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Jan Maas","orcid":"0000-0002-0845-1338"}],"oa":1,"citation":{"apa":"Hairer, M., &#38; Maas, J. (2012). A spatial version of the Itô-Stratonovich correction. <i>Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/11-AOP662\">https://doi.org/10.1214/11-AOP662</a>","mla":"Hairer, Martin, and Jan Maas. “A Spatial Version of the Itô-Stratonovich Correction.” <i>Annals of Probability</i>, vol. 40, no. 4, Institute of Mathematical Statistics, 2012, pp. 1675–714, doi:<a href=\"https://doi.org/10.1214/11-AOP662\">10.1214/11-AOP662</a>.","ista":"Hairer M, Maas J. 2012. A spatial version of the Itô-Stratonovich correction. Annals of Probability. 40(4), 1675–1714.","chicago":"Hairer, Martin, and Jan Maas. “A Spatial Version of the Itô-Stratonovich Correction.” <i>Annals of Probability</i>. Institute of Mathematical Statistics, 2012. <a href=\"https://doi.org/10.1214/11-AOP662\">https://doi.org/10.1214/11-AOP662</a>.","short":"M. Hairer, J. Maas, Annals of Probability 40 (2012) 1675–1714.","ama":"Hairer M, Maas J. A spatial version of the Itô-Stratonovich correction. <i>Annals of Probability</i>. 2012;40(4):1675-1714. doi:<a href=\"https://doi.org/10.1214/11-AOP662\">10.1214/11-AOP662</a>","ieee":"M. Hairer and J. Maas, “A spatial version of the Itô-Stratonovich correction,” <i>Annals of Probability</i>, vol. 40, no. 4. Institute of Mathematical Statistics, pp. 1675–1714, 2012."},"day":"01"},{"main_file_link":[{"url":"http://arxiv.org/abs/1111.2687","open_access":"1"}],"year":"2012","publication":"Archive for Rational Mechanics and Analysis","volume":206,"intvolume":"       206","date_created":"2018-12-11T11:55:52Z","page":"997 - 1038","date_published":"2012-12-01T00:00:00Z","title":"Ricci curvature of finite Markov chains via convexity of the entropy","quality_controlled":0,"publisher":"Springer","acknowledgement":"Jan Maas is supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","publication_status":"published","date_updated":"2021-01-12T06:55:28Z","day":"01","citation":{"ieee":"M. Erbar and J. Maas, “Ricci curvature of finite Markov chains via convexity of the entropy,” <i>Archive for Rational Mechanics and Analysis</i>, vol. 206, no. 3. Springer, pp. 997–1038, 2012.","ama":"Erbar M, Maas J. Ricci curvature of finite Markov chains via convexity of the entropy. <i>Archive for Rational Mechanics and Analysis</i>. 2012;206(3):997-1038. doi:<a href=\"https://doi.org/10.1007/s00205-012-0554-z\">10.1007/s00205-012-0554-z</a>","short":"M. Erbar, J. Maas, Archive for Rational Mechanics and Analysis 206 (2012) 997–1038.","chicago":"Erbar, Matthias, and Jan Maas. “Ricci Curvature of Finite Markov Chains via Convexity of the Entropy.” <i>Archive for Rational Mechanics and Analysis</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s00205-012-0554-z\">https://doi.org/10.1007/s00205-012-0554-z</a>.","ista":"Erbar M, Maas J. 2012. Ricci curvature of finite Markov chains via convexity of the entropy. Archive for Rational Mechanics and Analysis. 206(3), 997–1038.","apa":"Erbar, M., &#38; Maas, J. (2012). Ricci curvature of finite Markov chains via convexity of the entropy. <i>Archive for Rational Mechanics and Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/s00205-012-0554-z\">https://doi.org/10.1007/s00205-012-0554-z</a>","mla":"Erbar, Matthias, and Jan Maas. “Ricci Curvature of Finite Markov Chains via Convexity of the Entropy.” <i>Archive for Rational Mechanics and Analysis</i>, vol. 206, no. 3, Springer, 2012, pp. 997–1038, doi:<a href=\"https://doi.org/10.1007/s00205-012-0554-z\">10.1007/s00205-012-0554-z</a>."},"extern":1,"author":[{"last_name":"Erbar","first_name":"Matthias","full_name":"Erbar, Matthias"},{"last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Jan Maas","orcid":"0000-0002-0845-1338"}],"oa":1,"type":"journal_article","month":"12","issue":"3","doi":"10.1007/s00205-012-0554-z","abstract":[{"text":"We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott, Sturm, and Villani for geodesic measure spaces. In order to apply to the discrete setting, the role of the Wasserstein metric is taken over by a different metric, having the property that continuous time Markov chains are gradient flows of the entropy. Using this notion of Ricci curvature we prove discrete analogues of fundamental results by Bakry–Émery and Otto–Villani. Further, we show that Ricci curvature bounds are preserved under tensorisation. As a special case we obtain the sharp Ricci curvature lower bound for the discrete hypercube.","lang":"eng"}],"publist_id":"4906","status":"public","_id":"2127"},{"type":"journal_article","month":"10","day":"01","citation":{"ista":"Maas J, Van Neerven J, Portal P. 2012. Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure. Arkiv för Matematik. 50(2), 379–395.","apa":"Maas, J., Van Neerven, J., &#38; Portal, P. (2012). Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure. <i>Arkiv För Matematik</i>. Springer. <a href=\"https://doi.org/10.1007/s11512-010-0143-z\">https://doi.org/10.1007/s11512-010-0143-z</a>","mla":"Maas, Jan, et al. “Whitney Coverings and the Tent Spaces T 1,q (γ) for the Gaussian Measure.” <i>Arkiv För Matematik</i>, vol. 50, no. 2, Springer, 2012, pp. 379–95, doi:<a href=\"https://doi.org/10.1007/s11512-010-0143-z\">10.1007/s11512-010-0143-z</a>.","short":"J. Maas, J. Van Neerven, P. Portal, Arkiv För Matematik 50 (2012) 379–395.","ama":"Maas J, Van Neerven J, Portal P. Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure. <i>Arkiv för Matematik</i>. 2012;50(2):379-395. doi:<a href=\"https://doi.org/10.1007/s11512-010-0143-z\">10.1007/s11512-010-0143-z</a>","chicago":"Maas, Jan, Jan Van Neerven, and Pierre Portal. “Whitney Coverings and the Tent Spaces T 1,q (γ) for the Gaussian Measure.” <i>Arkiv För Matematik</i>. Springer, 2012. <a href=\"https://doi.org/10.1007/s11512-010-0143-z\">https://doi.org/10.1007/s11512-010-0143-z</a>.","ieee":"J. Maas, J. Van Neerven, and P. Portal, “Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure,” <i>Arkiv för Matematik</i>, vol. 50, no. 2. Springer, pp. 379–395, 2012."},"oa":1,"extern":1,"author":[{"last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Jan Maas","first_name":"Jan"},{"first_name":"Jan","full_name":"van Neerven, Jan M","last_name":"Van Neerven"},{"last_name":"Portal","first_name":"Pierre","full_name":"Portal, Pierre"}],"publication_status":"published","date_updated":"2021-01-12T06:55:28Z","acknowledgement":"J. Maas was supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). J. van Neerven was supported by VICI subsidy 639.033.604 of the Netherlands Organisation for Scientific Research (NWO).","status":"public","_id":"2128","publist_id":"4907","abstract":[{"lang":"eng","text":"We introduce a technique for handling Whitney decompositions in Gaussian harmonic analysis and apply it to the study of Gaussian analogues of the classical tent spaces T 1,q of Coifman–Meyer–Stein."}],"doi":"10.1007/s11512-010-0143-z","issue":"2","page":"379 - 395","intvolume":"        50","date_created":"2018-12-11T11:55:52Z","publication":"Arkiv för Matematik","volume":50,"main_file_link":[{"url":"http://arxiv.org/abs/1002.4911","open_access":"1"}],"year":"2012","publisher":"Springer","quality_controlled":0,"title":"Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure","date_published":"2012-10-01T00:00:00Z"},{"publisher":"American Physical Society","title":"Nonadiabatic preparation of spin crystals with ultracold polar molecules","date_published":"2012-07-16T00:00:00Z","intvolume":"       109","date_created":"2018-12-11T11:56:17Z","publication":"Physical Review Letters","volume":109,"language":[{"iso":"eng"}],"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1203.0010"}],"year":"2012","status":"public","_id":"2201","publist_id":"4772","doi":"10.1103/PhysRevLett.109.035301","abstract":[{"text":"We study the growth dynamics of ordered structures of strongly interacting polar molecules in optical lattices. Using a dipole blockade of microwave excitations, we map the system onto an interacting spin-1/2 model possessing ground states with crystalline order, and describe a way to prepare these states by nonadiabatically driving the transitions between molecular rotational levels. The proposed technique bypasses the need to cross a phase transition and allows for the creation of ordered domains of considerably larger size compared to approaches relying on adiabatic preparation.","lang":"eng"}],"issue":"3","type":"journal_article","related_material":{"link":[{"url":"https://doi.org/10.1103/PhysRevLett.109.049901","relation":"erratum"}]},"month":"07","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"16","citation":{"ista":"Lemeshko M, Krems R, Weimer H. 2012. Nonadiabatic preparation of spin crystals with ultracold polar molecules. Physical Review Letters. 109(3).","apa":"Lemeshko, M., Krems, R., &#38; Weimer, H. (2012). Nonadiabatic preparation of spin crystals with ultracold polar molecules. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">https://doi.org/10.1103/PhysRevLett.109.035301</a>","mla":"Lemeshko, Mikhail, et al. “Nonadiabatic Preparation of Spin Crystals with Ultracold Polar Molecules.” <i>Physical Review Letters</i>, vol. 109, no. 3, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">10.1103/PhysRevLett.109.035301</a>.","ieee":"M. Lemeshko, R. Krems, and H. Weimer, “Nonadiabatic preparation of spin crystals with ultracold polar molecules,” <i>Physical Review Letters</i>, vol. 109, no. 3. American Physical Society, 2012.","short":"M. Lemeshko, R. Krems, H. Weimer, Physical Review Letters 109 (2012).","ama":"Lemeshko M, Krems R, Weimer H. Nonadiabatic preparation of spin crystals with ultracold polar molecules. <i>Physical Review Letters</i>. 2012;109(3). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">10.1103/PhysRevLett.109.035301</a>","chicago":"Lemeshko, Mikhail, Roman Krems, and Hendrik Weimer. “Nonadiabatic Preparation of Spin Crystals with Ultracold Polar Molecules.” <i>Physical Review Letters</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevLett.109.035301\">https://doi.org/10.1103/PhysRevLett.109.035301</a>."},"extern":"1","author":[{"last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802"},{"last_name":"Krems","full_name":"Krems, Roman","first_name":"Roman"},{"last_name":"Weimer","first_name":"Hendrik","full_name":"Weimer, Hendrik"}],"oa":1,"oa_version":"None","date_updated":"2021-11-16T08:01:02Z","publication_status":"published"},{"date_published":"2012-07-13T00:00:00Z","title":"Sensitive imaging of electromagnetic fields with paramagnetic polar molecules","quality_controlled":0,"publisher":"American Physical Society","year":"2012","main_file_link":[{"url":"http://arxiv.org/abs/1202.1857","open_access":"1"}],"publication":"Physical Review A - Atomic, Molecular, and Optical Physics","volume":86,"intvolume":"        86","date_created":"2018-12-11T11:56:18Z","issue":"1","doi":"10.1103/PhysRevA.86.013409","publist_id":"4773","abstract":[{"lang":"eng","text":"We propose a method for sensitive parallel detection of low-frequency electromagnetic fields based on the fine structure interactions in paramagnetic polar molecules. Compared to the recently implemented scheme employing ultracold 87Rb atoms by Böhi, the technique based on molecules offers a 100-fold higher sensitivity, the possibility to measure both the electric and magnetic field components, and a probe of a wide range of frequencies from the dc limit to the THz regime."}],"status":"public","_id":"2202","publication_status":"published","date_updated":"2021-01-12T06:55:57Z","citation":{"mla":"Alyabyshev, Sergey, et al. “Sensitive Imaging of Electromagnetic Fields with Paramagnetic Polar Molecules.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 86, no. 1, American Physical Society, 2012, doi:<a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">10.1103/PhysRevA.86.013409</a>.","apa":"Alyabyshev, S., Lemeshko, M., &#38; Krems, R. (2012). Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">https://doi.org/10.1103/PhysRevA.86.013409</a>","ista":"Alyabyshev S, Lemeshko M, Krems R. 2012. Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. Physical Review A - Atomic, Molecular, and Optical Physics. 86(1).","chicago":"Alyabyshev, Sergey, Mikhail Lemeshko, and Roman Krems. “Sensitive Imaging of Electromagnetic Fields with Paramagnetic Polar Molecules.” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society, 2012. <a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">https://doi.org/10.1103/PhysRevA.86.013409</a>.","ama":"Alyabyshev S, Lemeshko M, Krems R. Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>. 2012;86(1). doi:<a href=\"https://doi.org/10.1103/PhysRevA.86.013409\">10.1103/PhysRevA.86.013409</a>","short":"S. Alyabyshev, M. Lemeshko, R. Krems, Physical Review A - Atomic, Molecular, and Optical Physics 86 (2012).","ieee":"S. Alyabyshev, M. Lemeshko, and R. Krems, “Sensitive imaging of electromagnetic fields with paramagnetic polar molecules,” <i>Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 86, no. 1. American Physical Society, 2012."},"day":"13","author":[{"last_name":"Alyabyshev","first_name":"Sergey","full_name":"Alyabyshev, Sergey V"},{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"},{"full_name":"Krems, Roman V","first_name":"Roman","last_name":"Krems"}],"extern":1,"oa":1,"type":"journal_article","month":"07"},{"publication":"Molecular Physics","volume":110,"main_file_link":[{"url":"http://arxiv.org/abs/1108.4583","open_access":"1"}],"year":"2012","page":"1873 - 1881","intvolume":"       110","date_created":"2018-12-11T11:56:18Z","quality_controlled":0,"title":"Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other","date_published":"2012-01-01T00:00:00Z","publisher":"Taylor & Francis","citation":{"mla":"Lemeshko, Mikhail, and Břetislav Friedrich. “Interaction between Polar Molecules Subject to a Far-off-Resonant Optical Field: Entangled Dipoles up- or down-Holding Each Other.” <i>Molecular Physics</i>, vol. 110, no. 15–16, Taylor &#38; Francis, 2012, pp. 1873–81, doi:<a href=\"https://doi.org/10.1080/00268976.2012.689868\">10.1080/00268976.2012.689868</a>.","apa":"Lemeshko, M., &#38; Friedrich, B. (2012). Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other. <i>Molecular Physics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00268976.2012.689868\">https://doi.org/10.1080/00268976.2012.689868</a>","ista":"Lemeshko M, Friedrich B. 2012. Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other. Molecular Physics. 110(15–16), 1873–1881.","ieee":"M. Lemeshko and B. Friedrich, “Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other,” <i>Molecular Physics</i>, vol. 110, no. 15–16. Taylor &#38; Francis, pp. 1873–1881, 2012.","chicago":"Lemeshko, Mikhail, and Břetislav Friedrich. “Interaction between Polar Molecules Subject to a Far-off-Resonant Optical Field: Entangled Dipoles up- or down-Holding Each Other.” <i>Molecular Physics</i>. Taylor &#38; Francis, 2012. <a href=\"https://doi.org/10.1080/00268976.2012.689868\">https://doi.org/10.1080/00268976.2012.689868</a>.","short":"M. Lemeshko, B. Friedrich, Molecular Physics 110 (2012) 1873–1881.","ama":"Lemeshko M, Friedrich B. Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other. <i>Molecular Physics</i>. 2012;110(15-16):1873-1881. doi:<a href=\"https://doi.org/10.1080/00268976.2012.689868\">10.1080/00268976.2012.689868</a>"},"day":"01","extern":1,"author":[{"last_name":"Lemeshko","full_name":"Mikhail Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802"},{"first_name":"Břetislav","full_name":"Friedrich, Břetislav","last_name":"Friedrich"}],"oa":1,"date_updated":"2021-01-12T06:55:58Z","publication_status":"published","type":"journal_article","month":"01","publist_id":"4770","abstract":[{"lang":"eng","text":"We show that the electric dipole-dipole interaction between a pair of polar molecules undergoes an all-out transformation when superimposed by a far-off-resonant optical field. The combined interaction potential becomes tunable by variation of wavelength, polarisation and intensity of the optical field and its dependence on the intermolecular separation exhibits a crossover from an inverse-power to an oscillating behaviour. The ability thereby offered to control molecular interactions opens up avenues toward the creation and manipulation of novel phases of ultracold polar gases among whose characteristics is a long-range entanglement of the dipoles' mutual orientation. We devised an accurate analytic model of such optical-field-dressed dipole-dipole interaction potentials, which enables a straightforward access to the optical-field parameters required for the design of intermolecular interactions in the laboratory."}],"doi":"10.1080/00268976.2012.689868","issue":"15-16","status":"public","_id":"2203"},{"acknowledgement":"This work was supported by a National Institutes of Health grant to LL (R01-NS050835). BT was a Damon Runyon Fellow and was supported by the Damon Runyon Cancer Research Foundation Grant DRG-1819-04. KM was supported by the Japan Society for the Promotion of Science program for Research Abroad and Human Frontier Science Program Organization (LT00300/2007-L). SH was supported by postdoctoral fellowships from the European Molecular Biology Organization (ALTF 851-2005), Human Frontier Science Program Organization (LT00805/2006-L), and Swiss National Science Foundation (PA00P3_124160 and PA00P3_136482). HZ is a Pew Scholar in Biomedical Sciences, supported by The Pew Charitable Trusts. LL is an investigator of the Howard Hughes Medical Institute. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","publication_status":"published","date_updated":"2021-01-12T06:56:22Z","citation":{"ista":"Tasic B, Miyamichi K, Hippenmeyer S, Dani V, Zeng H, Joo W, Zong H, Chen Tsai Y, Luo L. 2012. Extensions of MADM (Mosaic Analysis with Double Markers) in Mice . PLoS One. 7(3).","mla":"Tasic, Bosiljka, et al. “Extensions of MADM (Mosaic Analysis with Double Markers) in Mice .” <i>PLoS One</i>, vol. 7, no. 3, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pone.0033332\">10.1371/journal.pone.0033332</a>.","apa":"Tasic, B., Miyamichi, K., Hippenmeyer, S., Dani, V., Zeng, H., Joo, W., … Luo, L. (2012). Extensions of MADM (Mosaic Analysis with Double Markers) in Mice . <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0033332\">https://doi.org/10.1371/journal.pone.0033332</a>","ama":"Tasic B, Miyamichi K, Hippenmeyer S, et al. Extensions of MADM (Mosaic Analysis with Double Markers) in Mice . <i>PLoS One</i>. 2012;7(3). doi:<a href=\"https://doi.org/10.1371/journal.pone.0033332\">10.1371/journal.pone.0033332</a>","short":"B. Tasic, K. Miyamichi, S. Hippenmeyer, V. Dani, H. Zeng, W. Joo, H. Zong, Y. Chen Tsai, L. Luo, PLoS One 7 (2012).","chicago":"Tasic, Bosiljka, Kazunari Miyamichi, Simon Hippenmeyer, Vardhan Dani, H. Zeng, William Joo, Hui Zong, Yanru Chen Tsai, and Liqun Luo. “Extensions of MADM (Mosaic Analysis with Double Markers) in Mice .” <i>PLoS One</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pone.0033332\">https://doi.org/10.1371/journal.pone.0033332</a>.","ieee":"B. Tasic <i>et al.</i>, “Extensions of MADM (Mosaic Analysis with Double Markers) in Mice ,” <i>PLoS One</i>, vol. 7, no. 3. Public Library of Science, 2012."},"day":"27","extern":1,"author":[{"last_name":"Tasic","first_name":"Bosiljka","full_name":"Tasic, Bosiljka"},{"full_name":"Miyamichi, Kazunari","first_name":"Kazunari","last_name":"Miyamichi"},{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","full_name":"Simon Hippenmeyer","first_name":"Simon","last_name":"Hippenmeyer"},{"full_name":"Dani, Vardhan S.","first_name":"Vardhan","last_name":"Dani"},{"first_name":"H.","full_name":"Zeng, H.","last_name":"Zeng"},{"last_name":"Joo","first_name":"William","full_name":"Joo, William"},{"last_name":"Zong","first_name":"Hui","full_name":"Zong, Hui"},{"last_name":"Chen Tsai","full_name":"Chen-Tsai, Yanru","first_name":"Yanru"},{"full_name":"Luo, Liqun","first_name":"Liqun","last_name":"Luo"}],"type":"journal_article","month":"03","issue":"3","doi":"10.1371/journal.pone.0033332","publist_id":"4683","abstract":[{"lang":"eng","text":"Mosaic Analysis with Double Markers (MADM) is a method for generating genetically mosaic mice, in which sibling mutant and wild-type cells are labeled with different fluorescent markers. It is a powerful tool that enables analysis of gene function at the single cell level in vivo. It requires transgenic cassettes to be located between the centromere and the mutation in the gene of interest on the same chromosome. Here we compare procedures for introduction of MADM cassettes into new loci in the mouse genome, and describe new approaches for expanding the utility of MADM. We show that: 1) Targeted homologous recombination outperforms random transgenesis in generation of reliably expressed MADM cassettes, 2) MADM cassettes in new genomic loci need to be validated for biallelic and ubiquitous expression, 3) Recombination between MADM cassettes on different chromosomes can be used to study reciprocal chromosomal deletions/duplications, and 4) MADM can be modified to permit transgene expression by combining it with a binary expression system. The advances described in this study expand current, and enable new and more versatile applications of MADM."}],"status":"public","_id":"2262","year":"2012","publication":"PLoS One","volume":7,"date_created":"2018-12-11T11:56:38Z","intvolume":"         7","title":"Extensions of MADM (Mosaic Analysis with Double Markers) in Mice ","date_published":"2012-03-27T00:00:00Z","quality_controlled":0,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publisher":"Public Library of Science"},{"volume":1,"publication":"Biology open","year":"2012","date_created":"2018-12-11T11:56:38Z","ddc":["576"],"quality_controlled":"1","title":"A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors","date_published":"2012-12-15T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"oa":1,"author":[{"last_name":"Liang","full_name":"Liang, Huixuan","first_name":"Huixuan"},{"last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061"},{"first_name":"H.","full_name":"Ghashghaei, H.","last_name":"Ghashghaei"}],"citation":{"ieee":"H. Liang, S. Hippenmeyer, and H. Ghashghaei, “A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors,” <i>Biology open</i>, vol. 1, no. 12. The Company of Biologists, pp. 1200–1203, 2012.","short":"H. Liang, S. Hippenmeyer, H. Ghashghaei, Biology Open 1 (2012) 1200–1203.","ama":"Liang H, Hippenmeyer S, Ghashghaei H. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology open</i>. 2012;1(12):1200-1203. doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>","chicago":"Liang, Huixuan, Simon Hippenmeyer, and H. Ghashghaei. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>. The Company of Biologists, 2012. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>.","ista":"Liang H, Hippenmeyer S, Ghashghaei H. 2012. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. Biology open. 1(12), 1200–1203.","mla":"Liang, Huixuan, et al. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” <i>Biology Open</i>, vol. 1, no. 12, The Company of Biologists, 2012, pp. 1200–03, doi:<a href=\"https://doi.org/10.1242/bio.20122287\">10.1242/bio.20122287</a>.","apa":"Liang, H., Hippenmeyer, S., &#38; Ghashghaei, H. (2012). A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. <i>Biology Open</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/bio.20122287\">https://doi.org/10.1242/bio.20122287</a>"},"has_accepted_license":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"SiHi"}],"file":[{"access_level":"open_access","file_id":"4990","date_created":"2018-12-12T10:13:09Z","file_name":"IST-2015-387-v1+1_1200.full.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:35Z","file_size":726695,"checksum":"605a1800b81227848c361fd6ba7d22ba","relation":"main_file","creator":"system"}],"date_updated":"2021-01-12T06:56:23Z","oa_version":"Published Version","type":"journal_article","pubrep_id":"387","scopus_import":1,"file_date_updated":"2020-07-14T12:45:35Z","_id":"2263","language":[{"iso":"eng"}],"page":"1200 - 1203","intvolume":"         1","publisher":"The Company of Biologists","day":"15","publication_status":"published","month":"12","doi":"10.1242/bio.20122287","publist_id":"4682","abstract":[{"lang":"eng","text":"Nestin-cre transgenic mice have been widely used to direct recombination to neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs). Here we report that a readily utilized, and the only commercially available, Nestin-cre line is insufficient for directing recombination in early embryonic NSCs and NPCs. Analysis of recombination efficiency in multiple cre-dependent reporters and a genetic mosaic line revealed consistent temporal and spatial patterns of recombination in NSCs and NPCs. For comparison we utilized a knock-in Emx1cre line and found robust recombination in NSCs and NPCs in ventricular and subventricular zones of the cerebral cortices as early as embryonic day 12.5. In addition we found that the rate of Nestin-cre driven recombination only reaches sufficiently high levels in NSCs and NPCs during late embryonic and early postnatal periods. These findings are important when commercially available cre lines are considered for directing recombination to embryonic NSCs and NPCs."}],"issue":"12","status":"public"},{"_id":"2267","status":"public","doi":"10.2312/EGPGV/EGPGV12/139-148","abstract":[{"lang":"eng","text":"Capturing real-world objects with laser-scanning technology has become an everyday task. Recently, the acquisition of dynamic scenes at interactive frame rates has become feasible. A high-quality visualization of the resulting point cloud stream would require a per-frame reconstruction of object surfaces. Unfortunately, reconstruction computations are still too time-consuming to be applied interactively. In this paper we present a local surface reconstruction and visualization technique that provides interactive feedback for reasonably sized point clouds, while achieving high image quality. Our method is performed entirely on the GPU and in screen pace, exploiting the efficiency of the common rasterization pipeline. The approach is very general, as no assumption is made about point connectivity or sampling density. This naturally allows combining the outputs of multiple scanners in a single visualization, which is useful for many virtual and augmented reality applications. "}],"publist_id":"4677","file_date_updated":"2020-07-14T12:45:35Z","month":"05","type":"conference","pubrep_id":"572","author":[{"last_name":"Preiner","first_name":"Reinhold","full_name":"Preiner, Reinhold"},{"first_name":"Stefan","full_name":"Jeschke, Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke"},{"last_name":"Wimmer","first_name":"Michael","full_name":"Wimmer, Michael"}],"oa":1,"extern":"1","citation":{"ieee":"R. Preiner, S. Jeschke, and M. Wimmer, “Auto splats: Dynamic point cloud visualization on the GPU,” presented at the EGPGV: Eurographics Symposium on Parallel Graphics and Visualization, Calgari, Italy, 2012, pp. 139–148.","short":"R. Preiner, S. Jeschke, M. Wimmer, in:, Eurographics Association, 2012, pp. 139–148.","ama":"Preiner R, Jeschke S, Wimmer M. Auto splats: Dynamic point cloud visualization on the GPU. In: Eurographics Association; 2012:139-148. doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">10.2312/EGPGV/EGPGV12/139-148</a>","chicago":"Preiner, Reinhold, Stefan Jeschke, and Michael Wimmer. “Auto Splats: Dynamic Point Cloud Visualization on the GPU,” 139–48. Eurographics Association, 2012. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">https://doi.org/10.2312/EGPGV/EGPGV12/139-148</a>.","ista":"Preiner R, Jeschke S, Wimmer M. 2012. Auto splats: Dynamic point cloud visualization on the GPU. EGPGV: Eurographics Symposium on Parallel Graphics and Visualization, 139–148.","mla":"Preiner, Reinhold, et al. <i>Auto Splats: Dynamic Point Cloud Visualization on the GPU</i>. Eurographics Association, 2012, pp. 139–48, doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">10.2312/EGPGV/EGPGV12/139-148</a>.","apa":"Preiner, R., Jeschke, S., &#38; Wimmer, M. (2012). Auto splats: Dynamic point cloud visualization on the GPU (pp. 139–148). Presented at the EGPGV: Eurographics Symposium on Parallel Graphics and Visualization, Calgari, Italy: Eurographics Association. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV12/139-148\">https://doi.org/10.2312/EGPGV/EGPGV12/139-148</a>"},"day":"13","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","file":[{"relation":"main_file","checksum":"5495bb6ee8662cd401b34afb04dfb40f","creator":"system","file_name":"IST-2016-572-v1+1_preiner_2012_AS-draft.pdf","file_size":14903860,"date_updated":"2020-07-14T12:45:35Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:11:13Z","file_id":"4866"}],"date_updated":"2021-01-12T06:56:24Z","publication_status":"published","oa_version":"Submitted Version","publisher":"Eurographics Association","conference":{"end_date":"2012-05-14","start_date":"2012-05-13","location":"Calgari, Italy","name":"EGPGV: Eurographics Symposium on Parallel Graphics and Visualization"},"quality_controlled":"1","title":"Auto splats: Dynamic point cloud visualization on the GPU","date_published":"2012-05-13T00:00:00Z","page":"139 - 148","date_created":"2018-12-11T11:56:40Z","ddc":["000"],"language":[{"iso":"eng"}],"year":"2012"}]