--- _id: '2049' abstract: - lang: eng 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" 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. " alternative_title: - LNCS author: - first_name: Stefan full_name: Heyse, Stefan last_name: Heyse - first_name: Eike full_name: Kiltz, Eike last_name: Kiltz - first_name: Vadim full_name: Lyubashevsky, Vadim last_name: Lyubashevsky - first_name: Christof full_name: Paar, Christof last_name: Paar - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 citation: ama: 'Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: Conference Proceedings FSE 2012. Vol 7549. Springer; 2012:346-365. doi:10.1007/978-3-642-34047-5_20' apa: 'Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., & Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In Conference proceedings FSE 2012 (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer. https://doi.org/10.1007/978-3-642-34047-5_20' chicago: 'Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.” In Conference Proceedings FSE 2012, 7549:346–65. Springer, 2012. https://doi.org/10.1007/978-3-642-34047-5_20.' ieee: 'S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, and K. Z. Pietrzak, “Lapin: An efficient authentication protocol based on ring-LPN,” in Conference proceedings FSE 2012, Washington, DC, USA, 2012, vol. 7549, pp. 346–365.' 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.” Conference Proceedings FSE 2012, vol. 7549, Springer, 2012, pp. 346–65, doi:10.1007/978-3-642-34047-5_20.' short: S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:, Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365. conference: end_date: 2012-03-21 location: Washington, DC, USA name: 'FSE: Fast Software Encryption' start_date: 2012-03-19 date_created: 2018-12-11T11:55:25Z date_published: 2012-03-01T00:00:00Z date_updated: 2021-01-12T06:54:58Z day: '01' department: - _id: KrPi doi: 10.1007/978-3-642-34047-5_20 ec_funded: 1 intvolume: ' 7549' language: - iso: eng main_file_link: - open_access: '1' url: http://www.iacr.org/archive/fse2012/75490350/75490350.pdf month: '03' oa: 1 oa_version: Preprint page: 346 - 365 project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography publication: ' Conference proceedings FSE 2012' publication_status: published publisher: Springer publist_id: '5002' quality_controlled: '1' scopus_import: 1 status: public title: 'Lapin: An efficient authentication protocol based on ring-LPN' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 7549 year: '2012' ... --- _id: '2073' 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.' author: - first_name: Qi full_name: Zhou, Qi last_name: Zhou - first_name: Hongmei full_name: Zhu, Hongmei last_name: Zhu - 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 - first_name: Scott full_name: Roy, Scott W last_name: Roy - first_name: Beatriz full_name: Beatriz Vicoso id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87 last_name: Vicoso orcid: 0000-0002-4579-8306 - first_name: Zhaolin full_name: Xuan, Zhaolin last_name: Xuan - first_name: Jue full_name: Ruan, Jue last_name: Ruan - first_name: Yue full_name: Zhang, Yue last_name: Zhang - first_name: Ruoping full_name: Zhao, Ruoping last_name: Zhao - first_name: Chen full_name: Ye, Chen last_name: Ye - first_name: Xiuqing full_name: Zhang, Xiuqing last_name: Zhang - first_name: Jùn full_name: Wang, Jùn last_name: Wang - first_name: Wen full_name: Wang, Wen last_name: Wang - first_name: Doris full_name: Bachtrog, Doris last_name: Bachtrog citation: ama: Zhou Q, Zhu H, Huang Q, et al. Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans. BMC Genomics. 2012;13(1). doi:10.1186/1471-2164-13-109 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. BMC Genomics. BioMed Central. https://doi.org/10.1186/1471-2164-13-109 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.” BMC Genomics. BioMed Central, 2012. https://doi.org/10.1186/1471-2164-13-109. ieee: Q. Zhou et al., “Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans,” BMC Genomics, vol. 13, no. 1. BioMed Central, 2012. 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). mla: Zhou, Qi, et al. “Deciphering Neo-Sex and B Chromosome Evolution by the Draft Genome of Drosophila Albomicans.” BMC Genomics, vol. 13, no. 1, BioMed Central, 2012, doi:10.1186/1471-2164-13-109. 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). date_created: 2018-12-11T11:55:33Z date_published: 2012-03-22T00:00:00Z date_updated: 2021-01-12T06:55:08Z day: '22' doi: 10.1186/1471-2164-13-109 extern: 1 intvolume: ' 13' issue: '1' month: '03' publication: BMC Genomics publication_status: published publisher: BioMed Central publist_id: '4965' quality_controlled: 0 status: public title: Deciphering neo-sex and B chromosome evolution by the draft genome of Drosophila albomicans tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article volume: 13 year: '2012' ... --- _id: '2079' abstract: - lang: eng 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. author: - first_name: Kristian full_name: Hildebrand, Kristian last_name: Hildebrand - first_name: Bernd full_name: Bernd Bickel id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Marc full_name: Alexa, Marc last_name: Alexa citation: ama: 'Hildebrand K, Bickel B, Alexa M. crdbrd: Shape fabrication by sliding planar slices. Computer Graphics Forum. 2012;31(2pt3):583-592. doi:10.1111/j.1467-8659.2012.03037.x' apa: 'Hildebrand, K., Bickel, B., & Alexa, M. (2012). crdbrd: Shape fabrication by sliding planar slices. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/10.1111/j.1467-8659.2012.03037.x' chicago: 'Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Crdbrd: Shape Fabrication by Sliding Planar Slices.” Computer Graphics Forum. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1467-8659.2012.03037.x.' ieee: 'K. Hildebrand, B. Bickel, and M. Alexa, “crdbrd: Shape fabrication by sliding planar slices,” Computer Graphics Forum, 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.” Computer Graphics Forum, vol. 31, no. 2pt3, Wiley-Blackwell, 2012, pp. 583–92, doi:10.1111/j.1467-8659.2012.03037.x.' short: K. Hildebrand, B. Bickel, M. Alexa, Computer Graphics Forum 31 (2012) 583–592. date_created: 2018-12-11T11:55:35Z date_published: 2012-05-01T00:00:00Z date_updated: 2021-01-12T06:55:10Z day: '01' doi: 10.1111/j.1467-8659.2012.03037.x extern: 1 intvolume: ' 31' issue: 2pt3 month: '05' page: 583 - 592 publication: Computer Graphics Forum publication_status: published publisher: Wiley-Blackwell publist_id: '4959' quality_controlled: 0 status: public title: 'crdbrd: Shape fabrication by sliding planar slices' type: journal_article volume: 31 year: '2012' ... --- _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. author: - first_name: Thabo full_name: Beeler, Thabo last_name: Beeler - first_name: Bernd full_name: Bernd Bickel id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Gioacchino full_name: Noris, Gioacchino last_name: Noris - first_name: Paul full_name: Beardsley, Paul A last_name: Beardsley - first_name: Steve full_name: Marschner, Steve last_name: Marschner - first_name: Robert full_name: Sumner, Robert W last_name: Sumner - first_name: Markus full_name: Groß, Markus S last_name: Groß citation: ama: Beeler T, Bickel B, Noris G, et al. Coupled 3D reconstruction of sparse facial hair and skin. ACM Transactions on Graphics. 2012;31(4). doi:10.1145/2185520.2185613 apa: 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. ACM. https://doi.org/10.1145/2185520.2185613 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.” ACM Transactions on Graphics. ACM, 2012. https://doi.org/10.1145/2185520.2185613. ieee: T. Beeler et al., “Coupled 3D reconstruction of sparse facial hair and skin,” ACM Transactions on Graphics, vol. 31, no. 4. ACM, 2012. 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). mla: Beeler, Thabo, et al. “Coupled 3D Reconstruction of Sparse Facial Hair and Skin.” ACM Transactions on Graphics, vol. 31, no. 4, ACM, 2012, doi:10.1145/2185520.2185613. short: T. Beeler, B. Bickel, G. Noris, P. Beardsley, S. Marschner, R. Sumner, M. Groß, ACM Transactions on Graphics 31 (2012). date_created: 2018-12-11T11:55:44Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T06:55:20Z day: '01' doi: 10.1145/2185520.2185613 extern: 1 intvolume: ' 31' issue: '4' month: '01' publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '4932' quality_controlled: 0 status: public title: Coupled 3D reconstruction of sparse facial hair and skin type: journal_article volume: 31 year: '2012' ... --- _id: '2101' 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. ' 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 author: - first_name: Moritz full_name: Bac̈her, Moritz last_name: Bac̈Her - first_name: Bernd full_name: Bernd Bickel id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Doug full_name: James, Doug L last_name: James - first_name: Hanspeter full_name: Pfister, Hanspeter last_name: Pfister citation: ama: Bac̈Her M, Bickel B, James D, Pfister H. Fabricating articulated characters from skinned meshes. ACM Transactions on Graphics. 2012;31(4). doi:10.1145/2185520.2185543 apa: Bac̈Her, M., Bickel, B., James, D., & Pfister, H. (2012). Fabricating articulated characters from skinned meshes. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2185520.2185543 chicago: Bac̈Her, Moritz, Bernd Bickel, Doug James, and Hanspeter Pfister. “Fabricating Articulated Characters from Skinned Meshes.” ACM Transactions on Graphics. ACM, 2012. https://doi.org/10.1145/2185520.2185543. ieee: M. Bac̈Her, B. Bickel, D. James, and H. Pfister, “Fabricating articulated characters from skinned meshes,” ACM Transactions on Graphics, vol. 31, no. 4. ACM, 2012. ista: Bac̈Her M, Bickel B, James D, Pfister H. 2012. Fabricating articulated characters from skinned meshes. ACM Transactions on Graphics. 31(4). mla: Bac̈Her, Moritz, et al. “Fabricating Articulated Characters from Skinned Meshes.” ACM Transactions on Graphics, vol. 31, no. 4, ACM, 2012, doi:10.1145/2185520.2185543. short: M. Bac̈Her, B. Bickel, D. James, H. Pfister, ACM Transactions on Graphics 31 (2012). date_created: 2018-12-11T11:55:43Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T06:55:19Z day: '01' doi: 10.1145/2185520.2185543 extern: 1 intvolume: ' 31' issue: '4' month: '01' publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '4933' quality_controlled: 0 status: public title: Fabricating articulated characters from skinned meshes type: journal_article volume: 31 year: '2012' ... --- _id: '2102' abstract: - lang: eng 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. ' acknowledgement: This work was supported in part by the NCCR Co-Me of the Swiss NSF author: - first_name: Bernd full_name: Bernd Bickel id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Peter full_name: Kaufmann, Peter last_name: Kaufmann - first_name: Mélina full_name: Skouras, Mélina last_name: Skouras - first_name: Bernhard full_name: Thomaszewski, Bernhard last_name: Thomaszewski - first_name: Derek full_name: Bradley, Derek J last_name: Bradley - first_name: Thabo full_name: Beeler, Thabo last_name: Beeler - first_name: Philip full_name: Jackson, Philip V last_name: Jackson - first_name: Steve full_name: Marschner, Steve last_name: Marschner - first_name: Wojciech full_name: Matusik, Wojciech last_name: Matusik - first_name: Markus full_name: Groß, Markus S last_name: Groß citation: ama: Bickel B, Kaufmann P, Skouras M, et al. Physical face cloning. ACM Transactions on Graphics. 2012;31(4). doi:10.1145/2185520.2185614 apa: Bickel, B., Kaufmann, P., Skouras, M., Thomaszewski, B., Bradley, D., Beeler, T., … Groß, M. (2012). Physical face cloning. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2185520.2185614 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.” ACM Transactions on Graphics. ACM, 2012. https://doi.org/10.1145/2185520.2185614. ieee: B. Bickel et al., “Physical face cloning,” ACM Transactions on Graphics, vol. 31, no. 4. ACM, 2012. 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). mla: Bickel, Bernd, et al. “Physical Face Cloning.” ACM Transactions on Graphics, vol. 31, no. 4, ACM, 2012, doi:10.1145/2185520.2185614. 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). date_created: 2018-12-11T11:55:43Z date_published: 2012-07-04T00:00:00Z date_updated: 2021-01-12T06:55:19Z day: '04' doi: 10.1145/2185520.2185614 extern: 1 intvolume: ' 31' issue: '4' month: '07' publication: ACM Transactions on Graphics publication_status: published publisher: ACM publist_id: '4931' quality_controlled: 0 status: public title: Physical face cloning type: journal_article volume: 31 year: '2012' ... --- _id: '2106' abstract: - lang: eng 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. 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. author: - first_name: Eder full_name: Miguel, Eder last_name: Miguel - first_name: Derek full_name: Bradley, Derek J last_name: Bradley - first_name: Bernhard full_name: Thomaszewski, Bernhard last_name: Thomaszewski - first_name: Bernd full_name: Bernd Bickel id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Wojciech full_name: Matusik, Wojciech last_name: Matusik - first_name: Miguel full_name: Otaduy, Miguel A last_name: Otaduy - first_name: Steve full_name: Marschner, Steve last_name: Marschner citation: 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:10.1111/j.1467-8659.2012.03031.x' apa: Miguel, E., Bradley, D., Thomaszewski, B., Bickel, B., Matusik, W., Otaduy, M., & Marschner, S. (2012). Data-driven estimation of cloth simulation models (Vol. 31, pp. 519–528). Presented at the Computer Graphics Forum, Wiley-Blackwell. https://doi.org/10.1111/j.1467-8659.2012.03031.x 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. https://doi.org/10.1111/j.1467-8659.2012.03031.x. ieee: E. Miguel et al., “Data-driven estimation of cloth simulation models,” presented at the Computer Graphics Forum, 2012, vol. 31, no. 2, pp. 519–528. 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. mla: Miguel, Eder, et al. Data-Driven Estimation of Cloth Simulation Models. Vol. 31, no. 2, Wiley-Blackwell, 2012, pp. 519–28, doi:10.1111/j.1467-8659.2012.03031.x. short: E. Miguel, D. Bradley, B. Thomaszewski, B. Bickel, W. Matusik, M. Otaduy, S. Marschner, in:, Wiley-Blackwell, 2012, pp. 519–528. conference: name: Computer Graphics Forum date_created: 2018-12-11T11:55:45Z date_published: 2012-05-01T00:00:00Z date_updated: 2021-01-12T06:55:21Z day: '01' doi: 10.1111/j.1467-8659.2012.03031.x extern: 1 intvolume: ' 31' issue: '2' month: '05' page: 519 - 528 publication_status: published publisher: Wiley-Blackwell publist_id: '4929' quality_controlled: 0 status: public title: Data-driven estimation of cloth simulation models type: conference volume: 31 year: '2012' ... --- _id: '2104' abstract: - lang: eng 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. ' author: - first_name: Miguel full_name: Otaduy, Miguel A last_name: Otaduy - first_name: Bernd full_name: Bernd Bickel id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Derek full_name: Bradley, Derek J last_name: Bradley - first_name: Huamin full_name: Wang, Huamin last_name: Wang citation: ama: 'Otaduy M, Bickel B, Bradley D, Wang H. Data-driven simulation methods in computer graphics: Cloth, tissue and faces. In: ACM; 2012. doi:10.1145/2343483.2343495' apa: 'Otaduy, M., Bickel, B., Bradley, D., & 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. https://doi.org/10.1145/2343483.2343495' chicago: 'Otaduy, Miguel, Bernd Bickel, Derek Bradley, and Huamin Wang. “Data-Driven Simulation Methods in Computer Graphics: Cloth, Tissue and Faces.” ACM, 2012. https://doi.org/10.1145/2343483.2343495.' 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.' 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.' mla: 'Otaduy, Miguel, et al. Data-Driven Simulation Methods in Computer Graphics: Cloth, Tissue and Faces. ACM, 2012, doi:10.1145/2343483.2343495.' short: M. Otaduy, B. Bickel, D. Bradley, H. Wang, in:, ACM, 2012. conference: name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques' date_created: 2018-12-11T11:55:44Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T06:55:20Z day: '01' doi: 10.1145/2343483.2343495 extern: 1 month: '01' publication_status: published publisher: ACM publist_id: '4930' quality_controlled: 0 status: public title: 'Data-driven simulation methods in computer graphics: Cloth, tissue and faces' type: conference year: '2012' ... --- _id: '2105' acknowledgement: Mélina Skouras was partially supported by the NCCR Co-Me of the Swiss National Science Foundation. author: - first_name: Mélina full_name: Skouras, Mélina last_name: Skouras - first_name: Bernhard full_name: Thomaszewski, Bernhard last_name: Thomaszewski - first_name: Bernd full_name: Bernd Bickel id: 49876194-F248-11E8-B48F-1D18A9856A87 last_name: Bickel orcid: 0000-0001-6511-9385 - first_name: Markus full_name: Groß, Markus S last_name: Groß citation: ama: 'Skouras M, Thomaszewski B, Bickel B, Groß M. Computational design of rubber balloons. In: Vol 31. Wiley-Blackwell; 2012:835-844. doi:10.1111/j.1467-8659.2012.03064.x' apa: 'Skouras, M., Thomaszewski, B., Bickel, B., & Groß, M. (2012). Computational design of rubber balloons (Vol. 31, pp. 835–844). Presented at the EUROGRAPHICS: European Association for Computer Graphics, Wiley-Blackwell. https://doi.org/10.1111/j.1467-8659.2012.03064.x' chicago: Skouras, Mélina, Bernhard Thomaszewski, Bernd Bickel, and Markus Groß. “Computational Design of Rubber Balloons,” 31:835–44. Wiley-Blackwell, 2012. https://doi.org/10.1111/j.1467-8659.2012.03064.x. 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.' 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.' mla: Skouras, Mélina, et al. Computational Design of Rubber Balloons. Vol. 31, no. 2, Wiley-Blackwell, 2012, pp. 835–44, doi:10.1111/j.1467-8659.2012.03064.x. short: M. Skouras, B. Thomaszewski, B. Bickel, M. Groß, in:, Wiley-Blackwell, 2012, pp. 835–844. conference: name: 'EUROGRAPHICS: European Association for Computer Graphics' date_created: 2018-12-11T11:55:45Z date_published: 2012-05-01T00:00:00Z date_updated: 2021-01-12T06:55:20Z day: '01' doi: 10.1111/j.1467-8659.2012.03064.x extern: 1 intvolume: ' 31' issue: '2' month: '05' page: 835 - 844 publication_status: published publisher: Wiley-Blackwell publist_id: '4928' quality_controlled: 0 status: public title: Computational design of rubber balloons type: conference volume: 31 year: '2012' ... --- _id: '2125' abstract: - lang: eng 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. 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 author: - first_name: Martin full_name: Hairer, Martin M last_name: Hairer - first_name: Jan full_name: Jan Maas id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 citation: ama: Hairer M, Maas J. A spatial version of the Itô-Stratonovich correction. Annals of Probability. 2012;40(4):1675-1714. doi:10.1214/11-AOP662 apa: Hairer, M., & Maas, J. (2012). A spatial version of the Itô-Stratonovich correction. Annals of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/11-AOP662 chicago: Hairer, Martin, and Jan Maas. “A Spatial Version of the Itô-Stratonovich Correction.” Annals of Probability. Institute of Mathematical Statistics, 2012. https://doi.org/10.1214/11-AOP662. ieee: M. Hairer and J. Maas, “A spatial version of the Itô-Stratonovich correction,” Annals of Probability, vol. 40, no. 4. Institute of Mathematical Statistics, pp. 1675–1714, 2012. ista: Hairer M, Maas J. 2012. A spatial version of the Itô-Stratonovich correction. Annals of Probability. 40(4), 1675–1714. mla: Hairer, Martin, and Jan Maas. “A Spatial Version of the Itô-Stratonovich Correction.” Annals of Probability, vol. 40, no. 4, Institute of Mathematical Statistics, 2012, pp. 1675–714, doi:10.1214/11-AOP662. short: M. Hairer, J. Maas, Annals of Probability 40 (2012) 1675–1714. date_created: 2018-12-11T11:55:51Z date_published: 2012-07-01T00:00:00Z date_updated: 2021-01-12T06:55:27Z day: '01' doi: 10.1214/11-AOP662 extern: 1 intvolume: ' 40' issue: '4' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1011.0966 month: '07' oa: 1 page: 1675 - 1714 publication: Annals of Probability publication_status: published publisher: Institute of Mathematical Statistics publist_id: '4908' quality_controlled: 0 status: public title: A spatial version of the Itô-Stratonovich correction type: journal_article volume: 40 year: '2012' ... --- _id: '2127' abstract: - lang: eng 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. acknowledgement: Jan Maas is supported by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO). author: - first_name: Matthias full_name: Erbar, Matthias last_name: Erbar - first_name: Jan full_name: Jan Maas id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 citation: ama: Erbar M, Maas J. Ricci curvature of finite Markov chains via convexity of the entropy. Archive for Rational Mechanics and Analysis. 2012;206(3):997-1038. doi:10.1007/s00205-012-0554-z apa: Erbar, M., & Maas, J. (2012). Ricci curvature of finite Markov chains via convexity of the entropy. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-012-0554-z chicago: Erbar, Matthias, and Jan Maas. “Ricci Curvature of Finite Markov Chains via Convexity of the Entropy.” Archive for Rational Mechanics and Analysis. Springer, 2012. https://doi.org/10.1007/s00205-012-0554-z. ieee: M. Erbar and J. Maas, “Ricci curvature of finite Markov chains via convexity of the entropy,” Archive for Rational Mechanics and Analysis, vol. 206, no. 3. Springer, pp. 997–1038, 2012. 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. mla: Erbar, Matthias, and Jan Maas. “Ricci Curvature of Finite Markov Chains via Convexity of the Entropy.” Archive for Rational Mechanics and Analysis, vol. 206, no. 3, Springer, 2012, pp. 997–1038, doi:10.1007/s00205-012-0554-z. short: M. Erbar, J. Maas, Archive for Rational Mechanics and Analysis 206 (2012) 997–1038. date_created: 2018-12-11T11:55:52Z date_published: 2012-12-01T00:00:00Z date_updated: 2021-01-12T06:55:28Z day: '01' doi: 10.1007/s00205-012-0554-z extern: 1 intvolume: ' 206' issue: '3' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1111.2687 month: '12' oa: 1 page: 997 - 1038 publication: Archive for Rational Mechanics and Analysis publication_status: published publisher: Springer publist_id: '4906' quality_controlled: 0 status: public title: Ricci curvature of finite Markov chains via convexity of the entropy type: journal_article volume: 206 year: '2012' ... --- _id: '2128' 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. 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). author: - first_name: Jan full_name: Jan Maas id: 4C5696CE-F248-11E8-B48F-1D18A9856A87 last_name: Maas orcid: 0000-0002-0845-1338 - first_name: Jan full_name: van Neerven, Jan M last_name: Van Neerven - first_name: Pierre full_name: Portal, Pierre last_name: Portal citation: ama: Maas J, Van Neerven J, Portal P. Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure. Arkiv för Matematik. 2012;50(2):379-395. doi:10.1007/s11512-010-0143-z apa: 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. Springer. https://doi.org/10.1007/s11512-010-0143-z chicago: Maas, Jan, Jan Van Neerven, and Pierre Portal. “Whitney Coverings and the Tent Spaces T 1,q (γ) for the Gaussian Measure.” Arkiv För Matematik. Springer, 2012. https://doi.org/10.1007/s11512-010-0143-z. ieee: J. Maas, J. Van Neerven, and P. Portal, “Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure,” Arkiv för Matematik, vol. 50, no. 2. Springer, pp. 379–395, 2012. 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. mla: Maas, Jan, et al. “Whitney Coverings and the Tent Spaces T 1,q (γ) for the Gaussian Measure.” Arkiv För Matematik, vol. 50, no. 2, Springer, 2012, pp. 379–95, doi:10.1007/s11512-010-0143-z. short: J. Maas, J. Van Neerven, P. Portal, Arkiv För Matematik 50 (2012) 379–395. date_created: 2018-12-11T11:55:52Z date_published: 2012-10-01T00:00:00Z date_updated: 2021-01-12T06:55:28Z day: '01' doi: 10.1007/s11512-010-0143-z extern: 1 intvolume: ' 50' issue: '2' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1002.4911 month: '10' oa: 1 page: 379 - 395 publication: Arkiv för Matematik publication_status: published publisher: Springer publist_id: '4907' quality_controlled: 0 status: public title: Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure type: journal_article volume: 50 year: '2012' ... --- _id: '2203' 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. author: - first_name: Mikhail full_name: Mikhail Lemeshko id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Břetislav full_name: Friedrich, Břetislav last_name: Friedrich citation: 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. Molecular Physics. 2012;110(15-16):1873-1881. doi:10.1080/00268976.2012.689868' apa: '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. Taylor & Francis. https://doi.org/10.1080/00268976.2012.689868' 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.” Molecular Physics. Taylor & Francis, 2012. https://doi.org/10.1080/00268976.2012.689868.' 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,” Molecular Physics, vol. 110, no. 15–16. Taylor & Francis, pp. 1873–1881, 2012.' 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.' 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.” Molecular Physics, vol. 110, no. 15–16, Taylor & Francis, 2012, pp. 1873–81, doi:10.1080/00268976.2012.689868.' short: M. Lemeshko, B. Friedrich, Molecular Physics 110 (2012) 1873–1881. date_created: 2018-12-11T11:56:18Z date_published: 2012-01-01T00:00:00Z date_updated: 2021-01-12T06:55:58Z day: '01' doi: 10.1080/00268976.2012.689868 extern: 1 intvolume: ' 110' issue: 15-16 main_file_link: - open_access: '1' url: http://arxiv.org/abs/1108.4583 month: '01' oa: 1 page: 1873 - 1881 publication: Molecular Physics publication_status: published publisher: Taylor & Francis publist_id: '4770' quality_controlled: 0 status: public title: 'Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other' type: journal_article volume: 110 year: '2012' ... --- _id: '2201' abstract: - lang: eng 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. article_processing_charge: No author: - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Roman full_name: Krems, Roman last_name: Krems - first_name: Hendrik full_name: Weimer, Hendrik last_name: Weimer citation: ama: Lemeshko M, Krems R, Weimer H. Nonadiabatic preparation of spin crystals with ultracold polar molecules. Physical Review Letters. 2012;109(3). doi:10.1103/PhysRevLett.109.035301 apa: Lemeshko, M., Krems, R., & Weimer, H. (2012). Nonadiabatic preparation of spin crystals with ultracold polar molecules. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.109.035301 chicago: Lemeshko, Mikhail, Roman Krems, and Hendrik Weimer. “Nonadiabatic Preparation of Spin Crystals with Ultracold Polar Molecules.” Physical Review Letters. American Physical Society, 2012. https://doi.org/10.1103/PhysRevLett.109.035301. ieee: M. Lemeshko, R. Krems, and H. Weimer, “Nonadiabatic preparation of spin crystals with ultracold polar molecules,” Physical Review Letters, vol. 109, no. 3. American Physical Society, 2012. ista: Lemeshko M, Krems R, Weimer H. 2012. Nonadiabatic preparation of spin crystals with ultracold polar molecules. Physical Review Letters. 109(3). mla: Lemeshko, Mikhail, et al. “Nonadiabatic Preparation of Spin Crystals with Ultracold Polar Molecules.” Physical Review Letters, vol. 109, no. 3, American Physical Society, 2012, doi:10.1103/PhysRevLett.109.035301. short: M. Lemeshko, R. Krems, H. Weimer, Physical Review Letters 109 (2012). date_created: 2018-12-11T11:56:17Z date_published: 2012-07-16T00:00:00Z date_updated: 2021-11-16T08:01:02Z day: '16' doi: 10.1103/PhysRevLett.109.035301 extern: '1' intvolume: ' 109' issue: '3' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1203.0010 month: '07' oa: 1 oa_version: None publication: Physical Review Letters publication_status: published publisher: American Physical Society publist_id: '4772' related_material: link: - relation: erratum url: https://doi.org/10.1103/PhysRevLett.109.049901 status: public title: Nonadiabatic preparation of spin crystals with ultracold polar molecules type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 109 year: '2012' ... --- _id: '2202' 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. author: - first_name: Sergey full_name: Alyabyshev, Sergey V last_name: Alyabyshev - first_name: Mikhail full_name: Mikhail Lemeshko id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 - first_name: Roman full_name: Krems, Roman V last_name: Krems citation: ama: Alyabyshev S, Lemeshko M, Krems R. Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. Physical Review A - Atomic, Molecular, and Optical Physics. 2012;86(1). doi:10.1103/PhysRevA.86.013409 apa: Alyabyshev, S., Lemeshko, M., & Krems, R. (2012). Sensitive imaging of electromagnetic fields with paramagnetic polar molecules. Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society. https://doi.org/10.1103/PhysRevA.86.013409 chicago: Alyabyshev, Sergey, Mikhail Lemeshko, and Roman Krems. “Sensitive Imaging of Electromagnetic Fields with Paramagnetic Polar Molecules.” Physical Review A - Atomic, Molecular, and Optical Physics. American Physical Society, 2012. https://doi.org/10.1103/PhysRevA.86.013409. ieee: S. Alyabyshev, M. Lemeshko, and R. Krems, “Sensitive imaging of electromagnetic fields with paramagnetic polar molecules,” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 86, no. 1. American Physical Society, 2012. 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). mla: Alyabyshev, Sergey, et al. “Sensitive Imaging of Electromagnetic Fields with Paramagnetic Polar Molecules.” Physical Review A - Atomic, Molecular, and Optical Physics, vol. 86, no. 1, American Physical Society, 2012, doi:10.1103/PhysRevA.86.013409. short: S. Alyabyshev, M. Lemeshko, R. Krems, Physical Review A - Atomic, Molecular, and Optical Physics 86 (2012). date_created: 2018-12-11T11:56:18Z date_published: 2012-07-13T00:00:00Z date_updated: 2021-01-12T06:55:57Z day: '13' doi: 10.1103/PhysRevA.86.013409 extern: 1 intvolume: ' 86' issue: '1' main_file_link: - open_access: '1' url: http://arxiv.org/abs/1202.1857 month: '07' oa: 1 publication: Physical Review A - Atomic, Molecular, and Optical Physics publication_status: published publisher: American Physical Society publist_id: '4773' quality_controlled: 0 status: public title: Sensitive imaging of electromagnetic fields with paramagnetic polar molecules type: journal_article volume: 86 year: '2012' ... --- _id: '2263' 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. author: - first_name: Huixuan full_name: Liang, Huixuan last_name: Liang - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: H. full_name: Ghashghaei, H. last_name: Ghashghaei citation: ama: Liang H, Hippenmeyer S, Ghashghaei H. A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. Biology open. 2012;1(12):1200-1203. doi:10.1242/bio.20122287 apa: Liang, H., Hippenmeyer, S., & Ghashghaei, H. (2012). A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors. Biology Open. The Company of Biologists. https://doi.org/10.1242/bio.20122287 chicago: Liang, Huixuan, Simon Hippenmeyer, and H. Ghashghaei. “A Nestin-Cre Transgenic Mouse Is Insufficient for Recombination in Early Embryonic Neural Progenitors.” Biology Open. The Company of Biologists, 2012. https://doi.org/10.1242/bio.20122287. ieee: H. Liang, S. Hippenmeyer, and H. Ghashghaei, “A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors,” Biology open, vol. 1, no. 12. The Company of Biologists, pp. 1200–1203, 2012. 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.” Biology Open, vol. 1, no. 12, The Company of Biologists, 2012, pp. 1200–03, doi:10.1242/bio.20122287. short: H. Liang, S. Hippenmeyer, H. Ghashghaei, Biology Open 1 (2012) 1200–1203. date_created: 2018-12-11T11:56:38Z date_published: 2012-12-15T00:00:00Z date_updated: 2021-01-12T06:56:23Z day: '15' ddc: - '576' department: - _id: SiHi doi: 10.1242/bio.20122287 file: - access_level: open_access checksum: 605a1800b81227848c361fd6ba7d22ba content_type: application/pdf creator: system date_created: 2018-12-12T10:13:09Z date_updated: 2020-07-14T12:45:35Z file_id: '4990' file_name: IST-2015-387-v1+1_1200.full.pdf file_size: 726695 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' intvolume: ' 1' issue: '12' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 1200 - 1203 publication: Biology open publication_status: published publisher: The Company of Biologists publist_id: '4682' pubrep_id: '387' quality_controlled: '1' scopus_import: 1 status: public title: A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 1 year: '2012' ... --- _id: '2267' 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. ' author: - first_name: Reinhold full_name: Preiner, Reinhold last_name: Preiner - first_name: Stefan full_name: Jeschke, Stefan id: 44D6411A-F248-11E8-B48F-1D18A9856A87 last_name: Jeschke - first_name: Michael full_name: Wimmer, Michael last_name: Wimmer citation: ama: 'Preiner R, Jeschke S, Wimmer M. Auto splats: Dynamic point cloud visualization on the GPU. In: Eurographics Association; 2012:139-148. doi:10.2312/EGPGV/EGPGV12/139-148' apa: 'Preiner, R., Jeschke, S., & 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. https://doi.org/10.2312/EGPGV/EGPGV12/139-148' chicago: 'Preiner, Reinhold, Stefan Jeschke, and Michael Wimmer. “Auto Splats: Dynamic Point Cloud Visualization on the GPU,” 139–48. Eurographics Association, 2012. https://doi.org/10.2312/EGPGV/EGPGV12/139-148.' 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.' 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. Auto Splats: Dynamic Point Cloud Visualization on the GPU. Eurographics Association, 2012, pp. 139–48, doi:10.2312/EGPGV/EGPGV12/139-148.' short: R. Preiner, S. Jeschke, M. Wimmer, in:, Eurographics Association, 2012, pp. 139–148. conference: end_date: 2012-05-14 location: Calgari, Italy name: 'EGPGV: Eurographics Symposium on Parallel Graphics and Visualization' start_date: 2012-05-13 date_created: 2018-12-11T11:56:40Z date_published: 2012-05-13T00:00:00Z date_updated: 2021-01-12T06:56:24Z day: '13' ddc: - '000' doi: 10.2312/EGPGV/EGPGV12/139-148 extern: '1' file: - access_level: open_access checksum: 5495bb6ee8662cd401b34afb04dfb40f content_type: application/pdf creator: system date_created: 2018-12-12T10:11:13Z date_updated: 2020-07-14T12:45:35Z file_id: '4866' file_name: IST-2016-572-v1+1_preiner_2012_AS-draft.pdf file_size: 14903860 relation: main_file file_date_updated: 2020-07-14T12:45:35Z has_accepted_license: '1' language: - iso: eng month: '05' oa: 1 oa_version: Submitted Version page: 139 - 148 publication_status: published publisher: Eurographics Association publist_id: '4677' pubrep_id: '572' quality_controlled: '1' status: public title: 'Auto splats: Dynamic point cloud visualization on the GPU' type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 year: '2012' ... --- _id: '2262' 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.' 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. author: - first_name: Bosiljka full_name: Tasic, Bosiljka last_name: Tasic - first_name: Kazunari full_name: Miyamichi, Kazunari last_name: Miyamichi - first_name: Simon full_name: Simon Hippenmeyer id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 - first_name: Vardhan full_name: Dani, Vardhan S. last_name: Dani - first_name: H. full_name: Zeng, H. last_name: Zeng - first_name: William full_name: Joo, William last_name: Joo - first_name: Hui full_name: Zong, Hui last_name: Zong - first_name: Yanru full_name: Chen-Tsai, Yanru last_name: Chen Tsai - first_name: Liqun full_name: Luo, Liqun last_name: Luo citation: ama: Tasic B, Miyamichi K, Hippenmeyer S, et al. Extensions of MADM (Mosaic Analysis with Double Markers) in Mice . PLoS One. 2012;7(3). doi:10.1371/journal.pone.0033332 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 . PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0033332 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 .” PLoS One. Public Library of Science, 2012. https://doi.org/10.1371/journal.pone.0033332. ieee: B. Tasic et al., “Extensions of MADM (Mosaic Analysis with Double Markers) in Mice ,” PLoS One, vol. 7, no. 3. Public Library of Science, 2012. 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 .” PLoS One, vol. 7, no. 3, Public Library of Science, 2012, doi:10.1371/journal.pone.0033332. short: B. Tasic, K. Miyamichi, S. Hippenmeyer, V. Dani, H. Zeng, W. Joo, H. Zong, Y. Chen Tsai, L. Luo, PLoS One 7 (2012). date_created: 2018-12-11T11:56:38Z date_published: 2012-03-27T00:00:00Z date_updated: 2021-01-12T06:56:22Z day: '27' doi: 10.1371/journal.pone.0033332 extern: 1 intvolume: ' 7' issue: '3' month: '03' publication: PLoS One publication_status: published publisher: Public Library of Science publist_id: '4683' quality_controlled: 0 status: public title: 'Extensions of MADM (Mosaic Analysis with Double Markers) in Mice ' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article volume: 7 year: '2012' ... --- _id: '2268' abstract: - lang: eng text: 'This paper presents an analytic formulation for anti-aliased sampling of 2D polygons and 3D polyhedra. Our framework allows the exact evaluation of the convolution integral with a linear function defined on the polytopes. The filter is a spherically symmetric polynomial of any order, supporting approximations to refined variants such as the Mitchell-Netravali filter family. This enables high-quality rasterization of triangles and tetrahedra with linearly interpolated vertex values to regular and non-regular grids. A closed form solution of the convolution is presented and an efficient implementation on the GPU using DirectX and CUDA C is described. ' acknowledgement: |- Funding was provided by the FWF grant P20768-N13. We want to thank the reviewers for their insightful and helpful remarks, Hang Si for making available TetGen and Stefan Bruckner for VolumeShop. alternative_title: - Computer Graphics Forum author: - first_name: Thomas full_name: Thomas Auzinger id: 4718F954-F248-11E8-B48F-1D18A9856A87 last_name: Auzinger orcid: 0000-0002-1546-3265 - first_name: Michael full_name: Guthe, Michael last_name: Guthe - first_name: Stefan full_name: Stefan Jeschke id: 44D6411A-F248-11E8-B48F-1D18A9856A87 last_name: Jeschke citation: ama: 'Auzinger T, Guthe M, Jeschke S. Analytic anti-aliasing of linear functions on polytopes. In: Vol 31. Wiley-Blackwell; 2012:335-344. doi:http://dx.doi.org/10.1111/j.1467-8659.2012.03012.x' apa: 'Auzinger, T., Guthe, M., & Jeschke, S. (2012). Analytic anti-aliasing of linear functions on polytopes (Vol. 31, pp. 335–344). Presented at the EUROGRAPHICS: European Association for Computer Graphics, Wiley-Blackwell. http://dx.doi.org/10.1111/j.1467-8659.2012.03012.x' chicago: Auzinger, Thomas, Michael Guthe, and Stefan Jeschke. “Analytic Anti-Aliasing of Linear Functions on Polytopes,” 31:335–44. Wiley-Blackwell, 2012. http://dx.doi.org/10.1111/j.1467-8659.2012.03012.x. ieee: 'T. Auzinger, M. Guthe, and S. Jeschke, “Analytic anti-aliasing of linear functions on polytopes,” presented at the EUROGRAPHICS: European Association for Computer Graphics, 2012, vol. 31, no. 121, pp. 335–344.' ista: 'Auzinger T, Guthe M, Jeschke S. 2012. Analytic anti-aliasing of linear functions on polytopes. EUROGRAPHICS: European Association for Computer Graphics, Computer Graphics Forum, vol. 31, 335–344.' mla: Auzinger, Thomas, et al. Analytic Anti-Aliasing of Linear Functions on Polytopes. Vol. 31, no. 121, Wiley-Blackwell, 2012, pp. 335–44, doi:http://dx.doi.org/10.1111/j.1467-8659.2012.03012.x. short: T. Auzinger, M. Guthe, S. Jeschke, in:, Wiley-Blackwell, 2012, pp. 335–344. conference: name: 'EUROGRAPHICS: European Association for Computer Graphics' date_created: 2018-12-11T11:56:40Z date_published: 2012-05-13T00:00:00Z date_updated: 2021-01-12T06:56:24Z day: '13' doi: http://dx.doi.org/10.1111/j.1467-8659.2012.03012.x extern: 1 intvolume: ' 31' issue: 121 main_file_link: - open_access: '1' url: https://www.cg.tuwien.ac.at/research/publications/2012/Auzinger_2012_AAA/ month: '05' oa: 1 page: 335 - 344 publication_status: published publisher: Wiley-Blackwell publist_id: '4676' quality_controlled: 0 status: public title: Analytic anti-aliasing of linear functions on polytopes type: conference volume: 31 year: '2012' ... --- _id: '2302' abstract: - lang: eng text: 'We introduce propagation models (PMs), a formalism able to express several kinds of equations that describe the behavior of biochemical reaction networks. Furthermore, we introduce the propagation abstract data type (PADT), which separates concerns regarding different numerical algorithms for the transient analysis of biochemical reaction networks from concerns regarding their implementation, thus allowing for portable and efficient solutions. The state of a propagation abstract data type is given by a vector that assigns mass values to a set of nodes, and its (next) operator propagates mass values through this set of nodes. We propose an approximate implementation of the (next) operator, based on threshold abstraction, which propagates only "significant" mass values and thus achieves a compromise between efficiency and accuracy. Finally, we give three use cases for propagation models: the chemical master equation (CME), the reaction rate equation (RRE), and a hybrid method that combines these two equations. These three applications use propagation models in order to propagate probabilities and/or expected values and variances of the model''s variables.' author: - first_name: Thomas A full_name: Henzinger, Thomas A id: 40876CD8-F248-11E8-B48F-1D18A9856A87 last_name: Henzinger orcid: 0000−0002−2985−7724 - first_name: Maria full_name: Mateescu, Maria id: 3B43276C-F248-11E8-B48F-1D18A9856A87 last_name: Mateescu citation: ama: Henzinger TA, Mateescu M. The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. 2012;10(2):310-322. doi:10.1109/TCBB.2012.91 apa: Henzinger, T. A., & Mateescu, M. (2012). The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. IEEE. https://doi.org/10.1109/TCBB.2012.91 chicago: Henzinger, Thomas A, and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.” IEEE ACM Transactions on Computational Biology and Bioinformatics. IEEE, 2012. https://doi.org/10.1109/TCBB.2012.91. ieee: T. A. Henzinger and M. Mateescu, “The propagation approach for computing biochemical reaction networks,” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2. IEEE, pp. 310–322, 2012. ista: Henzinger TA, Mateescu M. 2012. The propagation approach for computing biochemical reaction networks. IEEE ACM Transactions on Computational Biology and Bioinformatics. 10(2), 310–322. mla: Henzinger, Thomas A., and Maria Mateescu. “The Propagation Approach for Computing Biochemical Reaction Networks.” IEEE ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. 2, IEEE, 2012, pp. 310–22, doi:10.1109/TCBB.2012.91. short: T.A. Henzinger, M. Mateescu, IEEE ACM Transactions on Computational Biology and Bioinformatics 10 (2012) 310–322. date_created: 2018-12-11T11:56:52Z date_published: 2012-07-03T00:00:00Z date_updated: 2021-01-12T06:56:38Z day: '03' department: - _id: ToHe - _id: CaGu doi: 10.1109/TCBB.2012.91 ec_funded: 1 external_id: pmid: - '22778152' intvolume: ' 10' issue: '2' language: - iso: eng month: '07' oa_version: None page: 310 - 322 pmid: 1 project: - _id: 25EE3708-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '267989' name: Quantitative Reactive Modeling publication: IEEE ACM Transactions on Computational Biology and Bioinformatics publication_status: published publisher: IEEE publist_id: '4625' quality_controlled: '1' scopus_import: 1 status: public title: The propagation approach for computing biochemical reaction networks type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 10 year: '2012' ...