[{"citation":{"ieee":"J. L. Fischer, “Optimal lower bounds on asymptotic support propagation rates for the thin-film equation,” <i>Journal of Differential Equations</i>, vol. 255, no. 10. Academic Press, pp. 3127–3149, 2013.","ista":"Fischer JL. 2013. Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. Journal of Differential Equations. 255(10), 3127–3149.","short":"J.L. Fischer, Journal of Differential Equations 255 (2013) 3127–3149.","chicago":"Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” <i>Journal of Differential Equations</i>. Academic Press, 2013. <a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">https://doi.org/10.1016/j.jde.2013.07.028</a>.","mla":"Fischer, Julian L. “Optimal Lower Bounds on Asymptotic Support Propagation Rates for the Thin-Film Equation.” <i>Journal of Differential Equations</i>, vol. 255, no. 10, Academic Press, 2013, pp. 3127–49, doi:<a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">10.1016/j.jde.2013.07.028</a>.","ama":"Fischer JL. Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. <i>Journal of Differential Equations</i>. 2013;255(10):3127-3149. doi:<a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">10.1016/j.jde.2013.07.028</a>","apa":"Fischer, J. L. (2013). Optimal lower bounds on asymptotic support propagation rates for the thin-film equation. <i>Journal of Differential Equations</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jde.2013.07.028\">https://doi.org/10.1016/j.jde.2013.07.028</a>"},"quality_controlled":0,"volume":255,"publisher":"Academic Press","doi":"10.1016/j.jde.2013.07.028","extern":1,"publist_id":"5961","date_created":"2018-12-11T11:51:18Z","day":"15","author":[{"full_name":"Julian Fischer","orcid":"0000-0002-0479-558X","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L"}],"year":"2013","abstract":[{"lang":"eng","text":"We derive lower bounds on asymptotic support propagation rates for strong solutions of the Cauchy problem for the thin-film equation. The bounds coincide up to a constant factor with the previously known upper bounds and thus are sharp. Our results hold in case of at most three spatial dimensions and n∈. (1, 2.92). The result is established using weighted backward entropy inequalities with singular weight functions to yield a differential inequality; combined with some entropy production estimates, the optimal rate of propagation is obtained. To the best of our knowledge, these are the first lower bounds on asymptotic support propagation rates for higher-order nonnegativity-preserving parabolic equations."}],"_id":"1310","date_updated":"2021-01-12T06:49:47Z","publication_status":"published","title":"Optimal lower bounds on asymptotic support propagation rates for the thin-film equation","type":"journal_article","issue":"10","status":"public","page":"3127 - 3149","date_published":"2013-11-15T00:00:00Z","intvolume":"       255","month":"11","publication":"Journal of Differential Equations"},{"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/2461912.2461979","publisher":"ACM","publist_id":"4926","extern":"1","volume":32,"article_number":"82","citation":{"mla":"Skouras, Mélina, et al. “Computational Design of Actuated Deformable Characters.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, 82, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2461979\">10.1145/2461912.2461979</a>.","apa":"Skouras, M., Thomaszewski, B., Coros, S., Bickel, B., &#38; Groß, M. (2013). Computational design of actuated deformable characters. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2461979\">https://doi.org/10.1145/2461912.2461979</a>","ama":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. Computational design of actuated deformable characters. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2461979\">10.1145/2461912.2461979</a>","chicago":"Skouras, Mélina, Bernhard Thomaszewski, Stelian Coros, Bernd Bickel, and Markus Groß. “Computational Design of Actuated Deformable Characters.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2461979\">https://doi.org/10.1145/2461912.2461979</a>.","ista":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. 2013. Computational design of actuated deformable characters. ACM Transactions on Graphics. 32(4), 82.","short":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013).","ieee":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, and M. Groß, “Computational design of actuated deformable characters,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013."},"status":"public","publication":"ACM Transactions on Graphics","date_published":"2013-07-01T00:00:00Z","intvolume":"        32","month":"07","title":"Computational design of actuated deformable characters","_id":"2107","publication_status":"published","date_updated":"2025-10-01T08:08:25Z","oa_version":"None","type":"journal_article","issue":"4","acknowledgement":"This work was partly funded by the NCCR Co-Me of the Swiss NSF","abstract":[{"text":"We present a method for fabrication-oriented design of actuated deformable characters that allows a user to automatically create physical replicas of digitally designed characters using rapid manufacturing technologies. Given a deformable character and a set of target poses as input, our method computes a small set of actuators along with their locations on the surface and optimizes the internal material distribution such that the resulting character exhibits the desired deformation behavior. We approach this problem with a dedicated algorithm that combines finite-element analysis, sparse regularization, and constrained optimization. We validate our pipeline on a set of two- and three-dimensional example characters and present results in simulation and physically-fabricated prototypes.","lang":"eng"}],"year":"2013","language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T11:55:45Z","author":[{"last_name":"Skouras","first_name":"Mélina","full_name":"Skouras, Mélina"},{"full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski","first_name":"Bernhard"},{"last_name":"Coros","first_name":"Stelian","full_name":"Coros, Stelian"},{"orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Markus","last_name":"Groß","full_name":"Groß, Markus"}]},{"volume":32,"citation":{"chicago":"Coros, Stelian, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg, Robert Sumner, Wojciech Matusik, and Bernd Bickel. “Computational Design of Mechanical Characters.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2461953\">https://doi.org/10.1145/2461912.2461953</a>.","mla":"Coros, Stelian, et al. “Computational Design of Mechanical Characters.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2461953\">10.1145/2461912.2461953</a>.","ama":"Coros S, Thomaszewski B, Noris G, et al. Computational design of mechanical characters. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2461953\">10.1145/2461912.2461953</a>","apa":"Coros, S., Thomaszewski, B., Noris, G., Sueda, S., Forberg, M., Sumner, R., … Bickel, B. (2013). Computational design of mechanical characters. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2461953\">https://doi.org/10.1145/2461912.2461953</a>","ieee":"S. Coros <i>et al.</i>, “Computational design of mechanical characters,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013.","ista":"Coros S, Thomaszewski B, Noris G, Sueda S, Forberg M, Sumner R, Matusik W, Bickel B. 2013. Computational design of mechanical characters. ACM Transactions on Graphics. 32(4).","short":"S. Coros, B. Thomaszewski, G. Noris, S. Sueda, M. Forberg, R. Sumner, W. Matusik, B. Bickel, ACM Transactions on Graphics 32 (2013)."},"quality_controlled":0,"publisher":"ACM","doi":"10.1145/2461912.2461953","publist_id":"4927","extern":1,"date_created":"2018-12-11T11:55:46Z","day":"01","author":[{"last_name":"Coros","first_name":"Stelian","full_name":"Coros, Stelian"},{"last_name":"Thomaszewski","first_name":"Bernhard","full_name":"Thomaszewski, Bernhard"},{"last_name":"Noris","first_name":"Gioacchino","full_name":"Noris, Gioacchino"},{"full_name":"Sueda, Shinjiro","first_name":"Shinjiro","last_name":"Sueda"},{"last_name":"Forberg","first_name":"Moira","full_name":"Forberg, Moira"},{"first_name":"Robert","last_name":"Sumner","full_name":"Sumner, Robert W"},{"last_name":"Matusik","first_name":"Wojciech","full_name":"Matusik, Wojciech"},{"full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"}],"abstract":[{"lang":"eng","text":"We present an interactive design system that allows non-expert users to create animated mechanical characters. Given an articulated character as input, the user iteratively creates an animation by sketching motion curves indicating how different parts of the character should move. For each motion curve, our framework creates an optimized mechanism that reproduces it as closely as possible. The resulting mechanisms are attached to the character and then connected to each other using gear trains, which are created in a semi-automated fashion. The mechanical assemblies generated with our system can be driven with a single input driver, such as a hand-operated crank or an electric motor, and they can be fabricated using rapid prototyping devices. We demonstrate the versatility of our approach by designing a wide range of mechanical characters, several of which we manufactured using 3D printing. While our pipeline is designed for characters driven by planar mechanisms, significant parts of it extend directly to non-planar mechanisms, allowing us to create characters with compelling 3D motions. "}],"year":"2013","title":"Computational design of mechanical characters","date_updated":"2021-01-12T06:55:21Z","_id":"2108","publication_status":"published","type":"journal_article","issue":"4","status":"public","publication":"ACM Transactions on Graphics","month":"07","intvolume":"        32","date_published":"2013-07-01T00:00:00Z"},{"volume":37,"quality_controlled":0,"citation":{"ieee":"K. Hildebrand, B. Bickel, and M. Alexa, “Orthogonal slicing for additive manufacturing,” <i>Computers and Graphics (Pergamon)</i>, vol. 37, no. 6. Elsevier, pp. 669–675, 2013.","short":"K. Hildebrand, B. Bickel, M. Alexa, Computers and Graphics (Pergamon) 37 (2013) 669–675.","ista":"Hildebrand K, Bickel B, Alexa M. 2013. Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). 37(6), 669–675.","chicago":"Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Orthogonal Slicing for Additive Manufacturing.” <i>Computers and Graphics (Pergamon)</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">https://doi.org/10.1016/j.cag.2013.05.011</a>.","mla":"Hildebrand, Kristian, et al. “Orthogonal Slicing for Additive Manufacturing.” <i>Computers and Graphics (Pergamon)</i>, vol. 37, no. 6, Elsevier, 2013, pp. 669–75, doi:<a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">10.1016/j.cag.2013.05.011</a>.","ama":"Hildebrand K, Bickel B, Alexa M. Orthogonal slicing for additive manufacturing. <i>Computers and Graphics (Pergamon)</i>. 2013;37(6):669-675. doi:<a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">10.1016/j.cag.2013.05.011</a>","apa":"Hildebrand, K., Bickel, B., &#38; Alexa, M. (2013). Orthogonal slicing for additive manufacturing. <i>Computers and Graphics (Pergamon)</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cag.2013.05.011\">https://doi.org/10.1016/j.cag.2013.05.011</a>"},"doi":"10.1016/j.cag.2013.05.011","publisher":"Elsevier","publist_id":"4924","extern":1,"title":"Orthogonal slicing for additive manufacturing","date_updated":"2021-01-12T06:55:22Z","_id":"2109","publication_status":"published","issue":"6","type":"journal_article","page":"669 - 675","status":"public","publication":"Computers and Graphics (Pergamon)","date_published":"2013-10-01T00:00:00Z","intvolume":"        37","month":"10","date_created":"2018-12-11T11:55:46Z","day":"01","author":[{"full_name":"Hildebrand, Kristian","first_name":"Kristian","last_name":"Hildebrand"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"full_name":"Alexa, Marc","last_name":"Alexa","first_name":"Marc"}],"abstract":[{"text":"Most additive manufacturing technologies work by layering, i.e. slicing the shape and then generating each slice independently. This introduces an anisotropy into the process, often as different accuracies in the tangential and normal directions, but also in terms of other parameters such as build speed or tensile strength and strain. We model this as an anisotropic cubic element. Our approach then finds a compromise between modeling each part of the shape individually in the best possible direction and using one direction for the whole shape part. In particular, we compute an orthogonal basis and consider only the three basis vectors as slice normals (i.e. fabrication directions). Then we optimize a decomposition of the shape along this basis so that each part can be consistently sliced along one of the basis vectors. In simulation, we show that this approach is superior to slicing the whole shape in one direction, only. It also has clear benefits if the shape is larger than the build volume of the available equipment.","lang":"eng"}],"year":"2013"},{"citation":{"ieee":"M. Papas <i>et al.</i>, “Fabricating translucent materials using continuous pigment mixtures,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4. ACM, 2013.","ista":"Papas M, Regg C, Jarosz W, Bickel B, Jackson P, Matusik W, Marschner S, Groß M. 2013. Fabricating translucent materials using continuous pigment mixtures. ACM Transactions on Graphics. 32(4).","short":"M. Papas, C. Regg, W. Jarosz, B. Bickel, P. Jackson, W. Matusik, S. Marschner, M. Groß, ACM Transactions on Graphics 32 (2013).","chicago":"Papas, Marios, Christian Regg, Wojciech Jarosz, Bernd Bickel, Philip Jackson, Wojciech Matusik, Steve Marschner, and Markus Groß. “Fabricating Translucent Materials Using Continuous Pigment Mixtures.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2461912.2461974\">https://doi.org/10.1145/2461912.2461974</a>.","apa":"Papas, M., Regg, C., Jarosz, W., Bickel, B., Jackson, P., Matusik, W., … Groß, M. (2013). Fabricating translucent materials using continuous pigment mixtures. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2461912.2461974\">https://doi.org/10.1145/2461912.2461974</a>","ama":"Papas M, Regg C, Jarosz W, et al. Fabricating translucent materials using continuous pigment mixtures. <i>ACM Transactions on Graphics</i>. 2013;32(4). doi:<a href=\"https://doi.org/10.1145/2461912.2461974\">10.1145/2461912.2461974</a>","mla":"Papas, Marios, et al. “Fabricating Translucent Materials Using Continuous Pigment Mixtures.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 4, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2461912.2461974\">10.1145/2461912.2461974</a>."},"quality_controlled":0,"volume":32,"doi":"10.1145/2461912.2461974","publisher":"ACM","publist_id":"4925","extern":1,"_id":"2110","publication_status":"published","date_updated":"2021-01-12T06:55:22Z","title":"Fabricating translucent materials using continuous pigment mixtures","issue":"4","type":"journal_article","status":"public","intvolume":"        32","date_published":"2013-07-01T00:00:00Z","month":"07","publication":"ACM Transactions on Graphics","date_created":"2018-12-11T11:55:46Z","day":"01","author":[{"first_name":"Marios","last_name":"Papas","full_name":"Papas, Marios"},{"last_name":"Regg","first_name":"Christian","full_name":"Regg, Christian"},{"full_name":"Jarosz, Wojciech","first_name":"Wojciech","last_name":"Jarosz"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"last_name":"Jackson","first_name":"Philip","full_name":"Jackson, Philip V"},{"full_name":"Matusik, Wojciech","first_name":"Wojciech","last_name":"Matusik"},{"full_name":"Marschner, Steve","first_name":"Steve","last_name":"Marschner"},{"full_name":"Groß, Markus S","first_name":"Markus","last_name":"Groß"}],"year":"2013","abstract":[{"lang":"eng","text":"We present a method for practical physical reproduction and design of homogeneous materials with desired subsurface scattering. Our process uses a collection of different pigments that can be suspended in a clear base material. Our goal is to determine pigment concentrations that best reproduce the appearance and subsurface scattering of a given target material. In order to achieve this task we first fabricate a collection of material samples composed of known mixtures of the available pigments with the base material. We then acquire their reflectance profiles using a custom-built measurement device. We use the same device to measure the reflectance profile of a target material. Based on the database of mappings from pigment concentrations to reflectance profiles, we use an optimization process to compute the concentration of pigments to best replicate the target material appearance. We demonstrate the practicality of our method by reproducing a variety of different translucent materials. We also present a tool that allows the user to explore the range of achievable appearances for a given set of pigments. "}]},{"extern":1,"publist_id":"4922","publisher":"ACM","doi":"10.1145/2508363.2508416","volume":32,"quality_controlled":0,"citation":{"chicago":"Bermano, Amit, Philipp Bruschweiler, Anselm Grundhöfer, Daisuke Iwai, Bernd Bickel, and Markus Groß. “Augmenting Physical Avatars Using Projector-Based Illumination.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2508363.2508416\">https://doi.org/10.1145/2508363.2508416</a>.","mla":"Bermano, Amit, et al. “Augmenting Physical Avatars Using Projector-Based Illumination.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2508363.2508416\">10.1145/2508363.2508416</a>.","ama":"Bermano A, Bruschweiler P, Grundhöfer A, Iwai D, Bickel B, Groß M. Augmenting physical avatars using projector-based illumination. <i>ACM Transactions on Graphics</i>. 2013;32(6). doi:<a href=\"https://doi.org/10.1145/2508363.2508416\">10.1145/2508363.2508416</a>","apa":"Bermano, A., Bruschweiler, P., Grundhöfer, A., Iwai, D., Bickel, B., &#38; Groß, M. (2013). Augmenting physical avatars using projector-based illumination. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2508363.2508416\">https://doi.org/10.1145/2508363.2508416</a>","ieee":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, and M. Groß, “Augmenting physical avatars using projector-based illumination,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6. ACM, 2013.","ista":"Bermano A, Bruschweiler P, Grundhöfer A, Iwai D, Bickel B, Groß M. 2013. Augmenting physical avatars using projector-based illumination. ACM Transactions on Graphics. 32(6).","short":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013)."},"publication":"ACM Transactions on Graphics","date_published":"2013-11-01T00:00:00Z","intvolume":"        32","month":"11","status":"public","issue":"6","type":"journal_article","title":"Augmenting physical avatars using projector-based illumination","_id":"2111","publication_status":"published","date_updated":"2021-01-12T06:55:23Z","abstract":[{"text":"Animated animatronic figures are a unique way to give physical presence to a character. However, their movement and expressions are often limited due to mechanical constraints. In this paper, we propose a complete process for augmenting physical avatars using projector-based illumination, significantly increasing their expressiveness. Given an input animation, the system decomposes the motion into low-frequency motion that can be physically reproduced by the animatronic head and high-frequency details that are added using projected shading. At the core is a spatio-temporal optimization process that compresses the motion in gradient space, ensuring faithful motion replay while respecting the physical limitations of the system. We also propose a complete multi-camera and projection system, including a novel defocused projection and subsurface scattering compensation scheme. The result of our system is a highly expressive physical avatar that features facial details and motion otherwise unattainable due to physical constraints.","lang":"eng"}],"year":"2013","author":[{"full_name":"Bermano, Amit H","last_name":"Bermano","first_name":"Amit"},{"first_name":"Philipp","last_name":"Bruschweiler","full_name":"Bruschweiler, Philipp"},{"last_name":"Grundhöfer","first_name":"Anselm","full_name":"Grundhöfer, Anselm"},{"last_name":"Iwai","first_name":"Daisuke","full_name":"Iwai, Daisuke"},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385"},{"full_name":"Groß, Markus S","first_name":"Markus","last_name":"Groß"}],"date_created":"2018-12-11T11:55:47Z","day":"01"},{"status":"public","page":"313-315","month":"03","date_published":"2013-03-01T00:00:00Z","publication":"Acta Crystallographica Section F Structural Biology Communications","date_updated":"2026-02-23T08:56:25Z","type":"journal_article","issue":"3","has_accepted_license":"1","article_type":"original","day":"01","date_created":"2026-01-29T22:11:18Z","language":[{"iso":"eng"}],"author":[{"full_name":"Aggarwal, Nidhi","first_name":"Nidhi","last_name":"Aggarwal"},{"full_name":"Mandal, Pradeep K","orcid":"0000-0001-5996-956X","id":"6a3def15-d4b4-11ef-9fa9-a24c1f545ec3","last_name":"Mandal","first_name":"Pradeep K"},{"full_name":"Gautham, Namasivayam","first_name":"Namasivayam","last_name":"Gautham"},{"full_name":"Chadha, Anju","first_name":"Anju","last_name":"Chadha"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1107/s1744309113003667","extern":"1","quality_controlled":"1","citation":{"mla":"Aggarwal, Nidhi, et al. “Expression, Purification, Crystallization and Preliminary X-Ray Diffraction Analysis of Carbonyl Reductase from Candida Parapsilosis ATCC 7330.” <i>Acta Crystallographica Section F Structural Biology Communications</i>, vol. 69, no. 3, International Union of Crystallography, 2013, pp. 313–15, doi:<a href=\"https://doi.org/10.1107/s1744309113003667\">10.1107/s1744309113003667</a>.","ama":"Aggarwal N, Mandal PK, Gautham N, Chadha A. Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330. <i>Acta Crystallographica Section F Structural Biology Communications</i>. 2013;69(3):313-315. doi:<a href=\"https://doi.org/10.1107/s1744309113003667\">10.1107/s1744309113003667</a>","apa":"Aggarwal, N., Mandal, P. K., Gautham, N., &#38; Chadha, A. (2013). Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330. <i>Acta Crystallographica Section F Structural Biology Communications</i>. International Union of Crystallography. <a href=\"https://doi.org/10.1107/s1744309113003667\">https://doi.org/10.1107/s1744309113003667</a>","chicago":"Aggarwal, Nidhi, Pradeep K Mandal, Namasivayam Gautham, and Anju Chadha. “Expression, Purification, Crystallization and Preliminary X-Ray Diffraction Analysis of Carbonyl Reductase from Candida Parapsilosis ATCC 7330.” <i>Acta Crystallographica Section F Structural Biology Communications</i>. International Union of Crystallography, 2013. <a href=\"https://doi.org/10.1107/s1744309113003667\">https://doi.org/10.1107/s1744309113003667</a>.","short":"N. Aggarwal, P.K. Mandal, N. Gautham, A. Chadha, Acta Crystallographica Section F Structural Biology Communications 69 (2013) 313–315.","ista":"Aggarwal N, Mandal PK, Gautham N, Chadha A. 2013. Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330. Acta Crystallographica Section F Structural Biology Communications. 69(3), 313–315.","ieee":"N. Aggarwal, P. K. Mandal, N. Gautham, and A. Chadha, “Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330,” <i>Acta Crystallographica Section F Structural Biology Communications</i>, vol. 69, no. 3. International Union of Crystallography, pp. 313–315, 2013."},"volume":69,"intvolume":"        69","publication_status":"published","_id":"21110","title":"Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330","oa_version":"None","year":"2013","abstract":[{"lang":"eng","text":"The NAD(P)H-dependent carbonyl reductase from Candida parapsilosis ATCC 7330 catalyses the asymmetric reduction of ethyl 4-phenyl-2-oxobutanoate to ethyl (R)-4-phenyl-2-hydroxybutanoate, a precursor of angiotensin-converting enzyme inhibitors such as Cilazapril and Benazepril. The carbonyl reductase was expressed in Escherichia coli and purified by GST-affinity and size-exclusion chromatography. Crystals were obtained by the hanging-drop vapour-diffusion method and diffracted to 1.86 Å resolution. The asymmetric unit contained two molecules of carbonyl reductase, with a solvent content of 48%. The structure was solved by molecular replacement using cinnamyl alcohol dehydrogenase from Saccharomyces cerevisiae as a search model."}],"OA_type":"closed access","publication_identifier":{"issn":["1744-3091"]},"publisher":"International Union of Crystallography"},{"volume":32,"quality_controlled":0,"citation":{"chicago":"Miguel, Eder, Rasmus Tamstorf, Derek Bradley, Sara Schvartzman, Bernhard Thomaszewski, Bernd Bickel, Wojciech Matusik, Steve Marschner, and Miguel Otaduy. “Modeling and Estimation of Internal Friction in Cloth.” <i>ACM Transactions on Graphics</i>. ACM, 2013. <a href=\"https://doi.org/10.1145/2508363.2508389 \">https://doi.org/10.1145/2508363.2508389 </a>.","mla":"Miguel, Eder, et al. “Modeling and Estimation of Internal Friction in Cloth.” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6, ACM, 2013, doi:<a href=\"https://doi.org/10.1145/2508363.2508389 \">10.1145/2508363.2508389 </a>.","ama":"Miguel E, Tamstorf R, Bradley D, et al. Modeling and estimation of internal friction in cloth. <i>ACM Transactions on Graphics</i>. 2013;32(6). doi:<a href=\"https://doi.org/10.1145/2508363.2508389 \">10.1145/2508363.2508389 </a>","apa":"Miguel, E., Tamstorf, R., Bradley, D., Schvartzman, S., Thomaszewski, B., Bickel, B., … Otaduy, M. (2013). Modeling and estimation of internal friction in cloth. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2508363.2508389 \">https://doi.org/10.1145/2508363.2508389 </a>","ieee":"E. Miguel <i>et al.</i>, “Modeling and estimation of internal friction in cloth,” <i>ACM Transactions on Graphics</i>, vol. 32, no. 6. ACM, 2013.","ista":"Miguel E, Tamstorf R, Bradley D, Schvartzman S, Thomaszewski B, Bickel B, Matusik W, Marschner S, Otaduy M. 2013. Modeling and estimation of internal friction in cloth. ACM Transactions on Graphics. 32(6).","short":"E. Miguel, R. Tamstorf, D. Bradley, S. Schvartzman, B. Thomaszewski, B. Bickel, W. Matusik, S. Marschner, M. Otaduy, ACM Transactions on Graphics 32 (2013)."},"publist_id":"4923","extern":1,"publisher":"ACM","doi":"10.1145/2508363.2508389 ","issue":"6","type":"journal_article","title":"Modeling and estimation of internal friction in cloth","_id":"2112","date_updated":"2021-01-12T06:55:23Z","publication_status":"published","publication":"ACM Transactions on Graphics","intvolume":"        32","month":"11","date_published":"2013-11-01T00:00:00Z","status":"public","author":[{"first_name":"Eder","last_name":"Miguel","full_name":"Miguel, Eder"},{"first_name":"Rasmus","last_name":"Tamstorf","full_name":"Tamstorf, Rasmus"},{"full_name":"Bradley, Derek J","last_name":"Bradley","first_name":"Derek"},{"last_name":"Schvartzman","first_name":"Sara","full_name":"Schvartzman, Sara C"},{"last_name":"Thomaszewski","first_name":"Bernhard","full_name":"Thomaszewski, Bernhard"},{"full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"last_name":"Matusik","first_name":"Wojciech","full_name":"Matusik, Wojciech"},{"full_name":"Marschner, Steve","first_name":"Steve","last_name":"Marschner"},{"first_name":"Miguel","last_name":"Otaduy","full_name":"Otaduy, Miguel A"}],"day":"01","date_created":"2018-12-11T11:55:47Z","abstract":[{"text":"Force-deformation measurements of cloth exhibit significant hysteresis, and many researchers have identified internal friction as the source of this effect. However, it has not been incorporated into computer animation models of cloth. In this paper, we propose a model of internal friction based on an augmented reparameterization of Dahl's model, and we show that this model provides a good match to several important features of cloth hysteresis even with a minimal set of parameters. We also propose novel parameter estimation procedures that are based on simple and inexpensive setups and need only sparse data, as opposed to the complex hardware and dense data acquisition of previous methods. Finally, we provide an algorithm for the efficient simulation of internal friction, and we demonstrate it on simulation examples that show disparate behavior with and without internal friction.","lang":"eng"}],"acknowledgement":"This work was supported in part by the European Research Council (ERC-2011-StG-280135 Animetrics) and the Spanish Ministry of Economy (TIN2012-35840).","year":"2013"},{"publisher":"IEEE","doi":"10.1109/MCG.2013.82 ","publist_id":"4920","extern":1,"citation":{"apa":"Rouiller, O., Bickel, B., Kautz, J., Matusik, W., &#38; Alexa, M. (2013). 3D printing spatially varying BRDFs. <i>IEEE Computer Graphics and Applications</i>. IEEE. <a href=\"https://doi.org/10.1109/MCG.2013.82 \">https://doi.org/10.1109/MCG.2013.82 </a>","ama":"Rouiller O, Bickel B, Kautz J, Matusik W, Alexa M. 3D printing spatially varying BRDFs. <i>IEEE Computer Graphics and Applications</i>. 2013;33(6):48-57. doi:<a href=\"https://doi.org/10.1109/MCG.2013.82 \">10.1109/MCG.2013.82 </a>","mla":"Rouiller, Olivier, et al. “3D Printing Spatially Varying BRDFs.” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6, IEEE, 2013, pp. 48–57, doi:<a href=\"https://doi.org/10.1109/MCG.2013.82 \">10.1109/MCG.2013.82 </a>.","chicago":"Rouiller, Olivier, Bernd Bickel, Jan Kautz, Wojciech Matusik, and Marc Alexa. “3D Printing Spatially Varying BRDFs.” <i>IEEE Computer Graphics and Applications</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/MCG.2013.82 \">https://doi.org/10.1109/MCG.2013.82 </a>.","short":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 48–57.","ista":"Rouiller O, Bickel B, Kautz J, Matusik W, Alexa M. 2013. 3D printing spatially varying BRDFs. IEEE Computer Graphics and Applications. 33(6), 48–57.","ieee":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, and M. Alexa, “3D printing spatially varying BRDFs,” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6. IEEE, pp. 48–57, 2013."},"quality_controlled":0,"volume":33,"status":"public","page":"48 - 57","month":"09","date_published":"2013-09-23T00:00:00Z","intvolume":"        33","publication":"IEEE Computer Graphics and Applications","_id":"2113","date_updated":"2021-01-12T06:55:23Z","publication_status":"published","title":"3D printing spatially varying BRDFs","issue":"6","type":"journal_article","year":"2013","abstract":[{"lang":"eng","text":"A new method fabricates custom surface reflectance and spatially varying bidirectional reflectance distribution functions (svBRDFs). Researchers optimize a microgeometry for a range of normal distribution functions and simulate the resulting surface's effective reflectance. Using the simulation's results, they reproduce an input svBRDF's appearance by distributing the microgeometry on the printed material's surface. This method lets people print svBRDFs on planar samples with current 3D printing technology, even with a limited set of printing materials. It extends naturally to printing svBRDFs on arbitrary shapes."}],"day":"23","date_created":"2018-12-11T11:55:47Z","author":[{"full_name":"Rouiller, Olivier","last_name":"Rouiller","first_name":"Olivier"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385"},{"last_name":"Kautz","first_name":"Jan","full_name":"Kautz, Jan"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"},{"full_name":"Alexa, Marc","first_name":"Marc","last_name":"Alexa"}]},{"abstract":[{"text":"3D printing is considered a disruptive technology with a potentially tremendous socioeconomic impact. The three articles in this special issue illustrate how novel computer graphics approaches are advancing such digital fabrication.","lang":"eng"}],"year":"2013","day":"01","date_created":"2018-12-11T11:55:48Z","author":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385"},{"first_name":"Marc","last_name":"Alexa","full_name":"Alexa, Marc"}],"page":"24 - 25","status":"public","publication":"IEEE Computer Graphics and Applications","intvolume":"        33","date_published":"2013-12-01T00:00:00Z","month":"12","title":"Computational aspects of fabrication: Modeling, design and 3d printing","_id":"2114","date_updated":"2021-01-12T06:55:24Z","publication_status":"published","type":"journal_article","issue":"6","doi":"10.1109/MCG.2013.89","publisher":"IEEE","publist_id":"4921","extern":1,"volume":33,"citation":{"ieee":"B. Bickel and M. Alexa, “Computational aspects of fabrication: Modeling, design and 3d printing,” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6. IEEE, pp. 24–25, 2013.","ista":"Bickel B, Alexa M. 2013. Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. 33(6), 24–25.","short":"B. Bickel, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 24–25.","chicago":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” <i>IEEE Computer Graphics and Applications</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/MCG.2013.89\">https://doi.org/10.1109/MCG.2013.89</a>.","apa":"Bickel, B., &#38; Alexa, M. (2013). Computational aspects of fabrication: Modeling, design and 3d printing. <i>IEEE Computer Graphics and Applications</i>. IEEE. <a href=\"https://doi.org/10.1109/MCG.2013.89\">https://doi.org/10.1109/MCG.2013.89</a>","ama":"Bickel B, Alexa M. Computational aspects of fabrication: Modeling, design and 3d printing. <i>IEEE Computer Graphics and Applications</i>. 2013;33(6):24-25. doi:<a href=\"https://doi.org/10.1109/MCG.2013.89\">10.1109/MCG.2013.89</a>","mla":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” <i>IEEE Computer Graphics and Applications</i>, vol. 33, no. 6, IEEE, 2013, pp. 24–25, doi:<a href=\"https://doi.org/10.1109/MCG.2013.89\">10.1109/MCG.2013.89</a>."},"quality_controlled":0},{"main_file_link":[{"url":"http://arxiv.org/abs/1307.7901 ","open_access":"1"}],"year":"2013","abstract":[{"text":"We prove new upper and lower bounds for Banach space-valued stochastic integrals with respect to a compensated Poisson random measure. Our estimates apply to Banach spaces with non-trivial martingale (co)type and extend various results in the literature. We also develop a Malliavin framework to interpret Poisson stochastic integrals as vector-valued Skorohod integrals, and prove a Clark-Ocone representation formula.","lang":"eng"}],"acknowledgement":"The first and third named authors were supported by VICI subsidy 639.033.604 of the Netherlands Organisation for Scientific Research (NWO). The first and second named authors were supported by the German Research Foundation in the Collaborative Research C","author":[{"last_name":"Dirksen","first_name":"Sjoerd","full_name":"Dirksen, Sjoerd"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","orcid":"0000-0002-0845-1338","full_name":"Jan Maas"},{"last_name":"Van Neerven","first_name":"Jan","full_name":"van Neerven, Jan M"}],"day":"18","date_created":"2018-12-11T11:55:49Z","intvolume":"        18","month":"11","date_published":"2013-11-18T00:00:00Z","oa":1,"publication":"Electronic Journal of Probability","status":"public","type":"journal_article","date_updated":"2021-01-12T06:55:24Z","_id":"2117","publication_status":"published","title":"Poisson stochastic integration in Banach spaces","publist_id":"4917","extern":1,"doi":"10.1214/EJP.v18-2945 ","publisher":"Institute of Mathematical Statistics","quality_controlled":0,"citation":{"ista":"Dirksen S, Maas J, Van Neerven J. 2013. Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. 18.","short":"S. Dirksen, J. Maas, J. Van Neerven, Electronic Journal of Probability 18 (2013).","ieee":"S. Dirksen, J. Maas, and J. Van Neerven, “Poisson stochastic integration in Banach spaces,” <i>Electronic Journal of Probability</i>, vol. 18. Institute of Mathematical Statistics, 2013.","apa":"Dirksen, S., Maas, J., &#38; Van Neerven, J. (2013). Poisson stochastic integration in Banach spaces. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/EJP.v18-2945 \">https://doi.org/10.1214/EJP.v18-2945 </a>","ama":"Dirksen S, Maas J, Van Neerven J. Poisson stochastic integration in Banach spaces. <i>Electronic Journal of Probability</i>. 2013;18. doi:<a href=\"https://doi.org/10.1214/EJP.v18-2945 \">10.1214/EJP.v18-2945 </a>","mla":"Dirksen, Sjoerd, et al. “Poisson Stochastic Integration in Banach Spaces.” <i>Electronic Journal of Probability</i>, vol. 18, Institute of Mathematical Statistics, 2013, doi:<a href=\"https://doi.org/10.1214/EJP.v18-2945 \">10.1214/EJP.v18-2945 </a>.","chicago":"Dirksen, Sjoerd, Jan Maas, and Jan Van Neerven. “Poisson Stochastic Integration in Banach Spaces.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2013. <a href=\"https://doi.org/10.1214/EJP.v18-2945 \">https://doi.org/10.1214/EJP.v18-2945 </a>."},"volume":18},{"volume":45,"quality_controlled":0,"citation":{"mla":"Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” <i>SIAM Journal on Mathematical Analysis</i>, vol. 45, no. 2, Society for Industrial and Applied Mathematics , 2013, pp. 879–99, doi:<a href=\"https://doi.org/10.1137/120886315 \">10.1137/120886315 </a>.","apa":"Gigli, N., &#38; Maas, J. (2013). Gromov-Hausdorff convergence of discrete transportation metrics. <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/120886315 \">https://doi.org/10.1137/120886315 </a>","ama":"Gigli N, Maas J. Gromov-Hausdorff convergence of discrete transportation metrics. <i>SIAM Journal on Mathematical Analysis</i>. 2013;45(2):879-899. doi:<a href=\"https://doi.org/10.1137/120886315 \">10.1137/120886315 </a>","chicago":"Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” <i>SIAM Journal on Mathematical Analysis</i>. Society for Industrial and Applied Mathematics , 2013. <a href=\"https://doi.org/10.1137/120886315 \">https://doi.org/10.1137/120886315 </a>.","ista":"Gigli N, Maas J. 2013. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 45(2), 879–899.","short":"N. Gigli, J. Maas, SIAM Journal on Mathematical Analysis 45 (2013) 879–899.","ieee":"N. Gigli and J. Maas, “Gromov-Hausdorff convergence of discrete transportation metrics,” <i>SIAM Journal on Mathematical Analysis</i>, vol. 45, no. 2. Society for Industrial and Applied Mathematics , pp. 879–899, 2013."},"publisher":"Society for Industrial and Applied Mathematics ","doi":"10.1137/120886315 ","extern":1,"publist_id":"4904","day":"01","date_created":"2018-12-11T11:55:53Z","author":[{"last_name":"Gigli","first_name":"Nicola","full_name":"Gigli, Nicola"},{"full_name":"Jan Maas","orcid":"0000-0002-0845-1338","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"abstract":[{"text":"This paper continues the investigation of `Wasserstein-like' transportation distances for probability measures on discrete sets. We prove that the discrete transportation metrics on the d-dimensional discrete torus with mesh size 1/N converge, when N→∞, to the standard 2-Wasserstein distance W_2 on the continuous torus in the sense of Gromov-Hausdorff. This is the first convergence result for the recently developed discrete transportation metrics. The result shows the compatibility between these metrics and the well-established 2-Wasserstein metric. \n\n\n","lang":"eng"}],"acknowledgement":"JM acknowledges support by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","year":"2013","main_file_link":[{"url":"http://arxiv.org/abs/1207.6501","open_access":"1"}],"title":"Gromov-Hausdorff convergence of discrete transportation metrics","publication_status":"published","_id":"2129","date_updated":"2021-01-12T06:55:29Z","type":"journal_article","issue":"2","page":"879 - 899","status":"public","oa":1,"publication":"SIAM Journal on Mathematical Analysis","month":"01","intvolume":"        45","date_published":"2013-01-01T00:00:00Z"},{"doi":"10.3389/fphy.2013.00017","publisher":"Frontiers Media","publist_id":"4885","extern":1,"citation":{"ieee":"M. Lemeshko, “Manipulating scattering of ultracold atoms with light-induced dissipation,” <i>Frontiers Physics</i>, vol. 1, no. 17. Frontiers Media, 2013.","ista":"Lemeshko M. 2013. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 1(17).","short":"M. Lemeshko, Frontiers Physics 1 (2013).","chicago":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” <i>Frontiers Physics</i>. Frontiers Media, 2013. <a href=\"https://doi.org/10.3389/fphy.2013.00017\">https://doi.org/10.3389/fphy.2013.00017</a>.","ama":"Lemeshko M. Manipulating scattering of ultracold atoms with light-induced dissipation. <i>Frontiers Physics</i>. 2013;1(17). doi:<a href=\"https://doi.org/10.3389/fphy.2013.00017\">10.3389/fphy.2013.00017</a>","apa":"Lemeshko, M. (2013). Manipulating scattering of ultracold atoms with light-induced dissipation. <i>Frontiers Physics</i>. Frontiers Media. <a href=\"https://doi.org/10.3389/fphy.2013.00017\">https://doi.org/10.3389/fphy.2013.00017</a>","mla":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” <i>Frontiers Physics</i>, vol. 1, no. 17, Frontiers Media, 2013, doi:<a href=\"https://doi.org/10.3389/fphy.2013.00017\">10.3389/fphy.2013.00017</a>."},"quality_controlled":0,"volume":1,"status":"public","intvolume":"         1","date_published":"2013-10-07T00:00:00Z","month":"10","oa":1,"publication":"Frontiers Physics","_id":"2139","date_updated":"2021-01-12T06:55:32Z","publication_status":"published","title":"Manipulating scattering of ultracold atoms with light-induced dissipation","issue":"17","type":"journal_article","year":"2013","acknowledgement":"The work was supported by the NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory","abstract":[{"lang":"eng","text":"Recently it has been shown that pairs of atoms can form metastable bonds due to non-conservative forces induced by dissipation [Lemeshko&amp;Weimer, Nature Comm. 4, 2230 (2013)]. Here we study the dynamics of interaction-induced coherent population trapping - the process responsible for the formation of dissipatively bound molecules. We derive the effective dissipative potentials induced between ultracold atoms by laser light, and study the time evolution of the scattering states. We demonstrate that binding occurs on short timescales of ~10 microseconds, even if the initial kinetic energy of the atoms significantly exceeds the depth of the dissipative potential. Dissipatively-bound molecules with preordained bond lengths and vibrational wavefunctions can be created and detected in current experiments with ultracold atoms."}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.8129"}],"date_created":"2018-12-11T11:55:56Z","day":"07","author":[{"orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"}]},{"scopus_import":1,"project":[{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"publisher":"ACM","doi":"10.1145/2429069.2429085","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4800","quality_controlled":"1","citation":{"ista":"Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.","short":"P. Cerny, T.A. Henzinger, A. Radhakrishna, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–128.","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 115–128.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:115-128. doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>","apa":"Cerny, P., Henzinger, T. A., &#38; Radhakrishna, A. (2013). Quantitative abstraction refinement. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 115–128). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>","mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 115–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429085\">10.1145/2429069.2429085</a>.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 115–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429085\">https://doi.org/10.1145/2429069.2429085</a>."},"page":"115 - 128","status":"public","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","ec_funded":1,"date_published":"2013-01-01T00:00:00Z","month":"01","title":"Quantitative abstraction refinement","publication_status":"published","_id":"2182","date_updated":"2024-10-09T20:55:21Z","department":[{"_id":"ToHe"}],"oa_version":"None","type":"conference","abstract":[{"lang":"eng","text":"We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time. We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed."}],"corr_author":"1","year":"2013","conference":{"start_date":"2013-07-23","name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","location":"Rome, Italy"},"date_created":"2018-12-11T11:56:11Z","day":"01","language":[{"iso":"eng"}],"author":[{"full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun"}]},{"article_processing_charge":"No","scopus_import":"1","doi":"10.1055/s-0033-1340087","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","quality_controlled":"1","citation":{"chicago":"Ely, Tal, Sanjib Das, Wenjie Li, Pintu Kundu, Einat Tirosh, David Cahen, Ayelet Vilan, and Rafal Klajn. “Photocontrol of Electrical Conductance with a Nonsymmetrical Azobenzene Dithiol.” <i>Synlett</i>. Georg Thieme Verlag, 2013. <a href=\"https://doi.org/10.1055/s-0033-1340087\">https://doi.org/10.1055/s-0033-1340087</a>.","mla":"Ely, Tal, et al. “Photocontrol of Electrical Conductance with a Nonsymmetrical Azobenzene Dithiol.” <i>Synlett</i>, vol. 24, no. 18, Georg Thieme Verlag, 2013, pp. 2370–74, doi:<a href=\"https://doi.org/10.1055/s-0033-1340087\">10.1055/s-0033-1340087</a>.","ama":"Ely T, Das S, Li W, et al. Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. <i>Synlett</i>. 2013;24(18):2370-2374. doi:<a href=\"https://doi.org/10.1055/s-0033-1340087\">10.1055/s-0033-1340087</a>","apa":"Ely, T., Das, S., Li, W., Kundu, P., Tirosh, E., Cahen, D., … Klajn, R. (2013). Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. <i>Synlett</i>. Georg Thieme Verlag. <a href=\"https://doi.org/10.1055/s-0033-1340087\">https://doi.org/10.1055/s-0033-1340087</a>","ieee":"T. Ely <i>et al.</i>, “Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol,” <i>Synlett</i>, vol. 24, no. 18. Georg Thieme Verlag, pp. 2370–2374, 2013.","ista":"Ely T, Das S, Li W, Kundu P, Tirosh E, Cahen D, Vilan A, Klajn R. 2013. Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol. Synlett. 24(18), 2370–2374.","short":"T. Ely, S. Das, W. Li, P. Kundu, E. Tirosh, D. Cahen, A. Vilan, R. Klajn, Synlett 24 (2013) 2370–2374."},"volume":24,"status":"public","page":"2370-2374","month":"10","date_published":"2013-10-22T00:00:00Z","publication":"Synlett","date_updated":"2024-10-14T12:21:03Z","type":"journal_article","issue":"18","article_type":"original","date_created":"2023-08-01T09:47:17Z","language":[{"iso":"eng"}],"day":"22","author":[{"first_name":"Tal","last_name":"Ely","full_name":"Ely, Tal"},{"full_name":"Das, Sanjib","first_name":"Sanjib","last_name":"Das"},{"full_name":"Li, Wenjie","first_name":"Wenjie","last_name":"Li"},{"last_name":"Kundu","first_name":"Pintu","full_name":"Kundu, Pintu"},{"last_name":"Tirosh","first_name":"Einat","full_name":"Tirosh, Einat"},{"full_name":"Cahen, David","last_name":"Cahen","first_name":"David"},{"last_name":"Vilan","first_name":"Ayelet","full_name":"Vilan, Ayelet"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","first_name":"Rafal"}],"publication_identifier":{"eissn":["1437-2096"],"issn":["0936-5214"]},"publisher":"Georg Thieme Verlag","intvolume":"        24","publication_status":"published","_id":"13405","title":"Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol","oa_version":"None","year":"2013","abstract":[{"lang":"eng","text":"We report a method for preparing electrode–molecule–electrode junctions that incorporate nonsymmetrical azobenzene dithiols. Our approach is based on sequential deprotection of thiol moieties originally carrying two different protecting groups. The azobenzene derivatives retained their switching properties within monolayers and permitted the photocontrol of electrical conductance."}],"keyword":["Organic Chemistry"]},{"publisher":"Wiley","publication_identifier":{"issn":["0935-9648"]},"external_id":{"pmid":["22933327"]},"abstract":[{"lang":"eng","text":"Dual-responsive nanoparticles are designed by functionalizing magnetic cores with light-responsive ligands. These materials respond to both light and magnetic fields and can be assembled into various higher-order structures, depending on the relative contributions of these two stimuli."}],"keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"year":"2013","title":"Dual-responsive nanoparticles and their self-assembly","_id":"13406","publication_status":"published","oa_version":"None","pmid":1,"intvolume":"        25","volume":25,"citation":{"ieee":"S. Das, P. Ranjan, P. S. Maiti, G. Singh, G. Leitus, and R. Klajn, “Dual-responsive nanoparticles and their self-assembly,” <i>Advanced Materials</i>, vol. 25, no. 3. Wiley, pp. 422–426, 2013.","short":"S. Das, P. Ranjan, P.S. Maiti, G. Singh, G. Leitus, R. Klajn, Advanced Materials 25 (2013) 422–426.","ista":"Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. 2013. Dual-responsive nanoparticles and their self-assembly. Advanced Materials. 25(3), 422–426.","chicago":"Das, Sanjib, Priyadarshi Ranjan, Pradipta Sankar Maiti, Gurvinder Singh, Gregory Leitus, and Rafal Klajn. “Dual-Responsive Nanoparticles and Their Self-Assembly.” <i>Advanced Materials</i>. Wiley, 2013. <a href=\"https://doi.org/10.1002/adma.201201734\">https://doi.org/10.1002/adma.201201734</a>.","ama":"Das S, Ranjan P, Maiti PS, Singh G, Leitus G, Klajn R. Dual-responsive nanoparticles and their self-assembly. <i>Advanced Materials</i>. 2013;25(3):422-426. doi:<a href=\"https://doi.org/10.1002/adma.201201734\">10.1002/adma.201201734</a>","apa":"Das, S., Ranjan, P., Maiti, P. S., Singh, G., Leitus, G., &#38; Klajn, R. (2013). Dual-responsive nanoparticles and their self-assembly. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.201201734\">https://doi.org/10.1002/adma.201201734</a>","mla":"Das, Sanjib, et al. “Dual-Responsive Nanoparticles and Their Self-Assembly.” <i>Advanced Materials</i>, vol. 25, no. 3, Wiley, 2013, pp. 422–26, doi:<a href=\"https://doi.org/10.1002/adma.201201734\">10.1002/adma.201201734</a>."},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1002/adma.201201734","extern":"1","scopus_import":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"day":"18","date_created":"2023-08-01T09:47:30Z","author":[{"first_name":"Sanjib","last_name":"Das","full_name":"Das, Sanjib"},{"full_name":"Ranjan, Priyadarshi","last_name":"Ranjan","first_name":"Priyadarshi"},{"first_name":"Pradipta Sankar","last_name":"Maiti","full_name":"Maiti, Pradipta Sankar"},{"last_name":"Singh","first_name":"Gurvinder","full_name":"Singh, Gurvinder"},{"first_name":"Gregory","last_name":"Leitus","full_name":"Leitus, Gregory"},{"full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","last_name":"Klajn","first_name":"Rafal"}],"article_type":"original","date_updated":"2024-10-14T12:21:16Z","issue":"3","type":"journal_article","page":"422-426","status":"public","publication":"Advanced Materials","month":"01","date_published":"2013-01-18T00:00:00Z"},{"quality_controlled":"1","citation":{"chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” In <i>22nd EACSL Annual Conference on Computer Science Logic</i>, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>.","apa":"Chatterjee, K., &#38; Fijalkow, N. (2013). Infinite-state games with finitary conditions. In <i>22nd EACSL Annual Conference on Computer Science Logic</i> (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">https://doi.org/10.4230/LIPIcs.CSL.2013.181</a>","ama":"Chatterjee K, Fijalkow N. Infinite-state games with finitary conditions. In: <i>22nd EACSL Annual Conference on Computer Science Logic</i>. Vol 23. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2013:181-196. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.” <i>22nd EACSL Annual Conference on Computer Science Logic</i>, vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–96, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.181\">10.4230/LIPIcs.CSL.2013.181</a>.","ieee":"K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in <i>22nd EACSL Annual Conference on Computer Science Logic</i>, Torino, Italy, 2013, vol. 23, pp. 181–196.","short":"K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.","ista":"Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196."},"volume":23,"doi":"10.4230/LIPIcs.CSL.2013.181","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"5837","scopus_import":1,"file":[{"file_size":547296,"content_type":"application/pdf","file_id":"5023","date_updated":"2020-07-14T12:44:47Z","creator":"system","checksum":"b7091a3866db573c0db5ec486952255e","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","access_level":"open_access","date_created":"2018-12-12T10:13:38Z","relation":"main_file"}],"date_created":"2018-12-11T11:51:39Z","language":[{"iso":"eng"}],"day":"01","file_date_updated":"2020-07-14T12:44:47Z","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël","last_name":"Fijalkow"}],"corr_author":"1","date_updated":"2024-10-09T20:55:23Z","type":"conference","has_accepted_license":"1","department":[{"_id":"KrCh"}],"status":"public","page":"181 - 196","date_published":"2013-09-01T00:00:00Z","ddc":["000"],"month":"09","publication":"22nd EACSL Annual Conference on Computer Science Logic","series_title":"Leibniz International Proceedings in Informatics","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FWF","grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"license":"https://creativecommons.org/licenses/by/4.0/","alternative_title":["LIPIcs"],"conference":{"name":"CSL: Computer Science Logic","end_date":"2013-09-05","location":"Torino, Italy","start_date":"203-09-02"},"year":"2013","abstract":[{"lang":"eng","text":"We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete."}],"pubrep_id":"624","_id":"1374","publication_status":"published","title":"Infinite-state games with finitary conditions","oa_version":"Published Version","intvolume":"        23","oa":1,"ec_funded":1},{"conference":{"location":"Portland, OR, United States","end_date":"2013-10-23","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20"},"year":"2013","abstract":[{"lang":"eng","text":"We consider the distributed synthesis problem for temporal logic specifications. Traditionally, the problem has been studied for LTL, and the previous results show that the problem is decidable iff there is no information fork in the architecture. We consider the problem for fragments of LTL and our main results are as follows: (1) We show that the problem is undecidable for architectures with information forks even for the fragment of LTL with temporal operators restricted to next and eventually. (2) For specifications restricted to globally along with non-nested next operators, we establish decidability (in EXPSPACE) for star architectures where the processes receive disjoint inputs, whereas we establish undecidability for architectures containing an information fork-meet structure. (3) Finally, we consider LTL without the next operator, and establish decidability (NEXPTIME-complete) for all architectures for a fragment that consists of a set of safety assumptions, and a set of guarantees where each guarantee is a safety, reachability, or liveness condition."}],"OA_type":"green","main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2013-130-v1-1","open_access":"1"}],"publication_status":"published","_id":"1376","title":"Distributed synthesis for LTL fragments","oa_version":"Preprint","ec_funded":1,"oa":1,"publisher":"IEEE","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_created":"2018-12-11T11:51:40Z","day":"11","language":[{"iso":"eng"}],"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"},{"first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas"}],"corr_author":"1","OA_place":"repository","related_material":{"record":[{"id":"5406","status":"public","relation":"earlier_version"}]},"date_updated":"2025-06-26T08:33:43Z","type":"conference","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"status":"public","page":"18 - 25","month":"12","date_published":"2013-12-11T00:00:00Z","publication":"13th International Conference on Formal Methods in Computer-Aided Design","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 18–25.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.","ista":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.” In <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, 18–25. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>.","apa":"Chatterjee, K., Henzinger, T. A., Otop, J., &#38; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In <i>13th International Conference on Formal Methods in Computer-Aided Design</i> (pp. 18–25). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">https://doi.org/10.1109/FMCAD.2013.6679386</a>","ama":"Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. Distributed synthesis for LTL fragments. In: <i>13th International Conference on Formal Methods in Computer-Aided Design</i>. IEEE; 2013:18-25. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>","mla":"Chatterjee, Krishnendu, et al. “Distributed Synthesis for LTL Fragments.” <i>13th International Conference on Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 18–25, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679386\">10.1109/FMCAD.2013.6679386</a>."},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1109/FMCAD.2013.6679386","publist_id":"5835","scopus_import":"1","article_processing_charge":"No"},{"ddc":["000"],"date_published":"2013-09-05T00:00:00Z","month":"09","page":"134","status":"public","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"has_accepted_license":"1","type":"dissertation","degree_awarded":"PhD","date_updated":"2026-04-09T14:35:24Z","OA_place":"publisher","related_material":{"record":[{"relation":"part_of_dissertation","id":"4361","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"3251"},{"relation":"part_of_dissertation","id":"2847","status":"public"}]},"corr_author":"1","acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering) and by the ERC Advanced Grant QUAREM (Quantitative Reactve Modeling).\r\nChapter 2, 3, and 4 are joint work with Thomas A. Henzinger and Thomas Wies. Chapter 2 was published in FoSSaCS 2010 as “Forward Analysis of Depth-Bounded Processes” [112]. Chapter 3 was published in VMCAI 2012 as “Ideal Abstractions for Well-Structured Transition Systems” [114]. Chap- ter 5.1 is joint work with Kshitij Bansal, Eric Koskinen, and Thomas Wies. It was published in TACAS 2013 as “Structural Counter Abstraction” [13]. The author’s contribution in this part is mostly related to the implementation. The theory required to understand the method and its implementation is quickly recalled to make the thesis self-contained, but should not be considered as a contribution. For the details of the methods, we refer the reader to the orig- inal publication [13] and the corresponding technical report [14]. Chapter 5.2 is ongoing work with Shahram Esmaeilsabzali, Rupak Majumdar, and Thomas Wies. I also would like to thank the people who supported over the past 4 years. My advisor Thomas A. Henzinger who gave me a lot of freedom to work on projects I was interested in. My collaborators, especially Thomas Wies with whom I worked since the beginning. The members of my thesis committee, Viktor Kun- cak and Rupak Majumdar, who also agreed to advise me. Simon Aeschbacher, Pavol Cerny, Cezara Dragoi, Arjun Radhakrishna, my family, friends and col- leagues who created an enjoyable environment. ","author":[{"orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","first_name":"Damien","last_name":"Zufferey","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"file_date_updated":"2021-11-17T13:47:58Z","day":"05","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:51:50Z","article_processing_charge":"No","file":[{"date_updated":"2021-02-22T11:28:36Z","creator":"dernst","checksum":"ed2d7b52933d134e8dc69d569baa284e","content_type":"application/pdf","file_size":1514906,"file_id":"9176","access_level":"open_access","date_created":"2021-02-22T11:28:36Z","relation":"main_file","success":1,"file_name":"2013_Zufferey_thesis_final.pdf"},{"file_name":"2013_Zufferey_thesis_final_pdfa.pdf","relation":"main_file","date_created":"2021-11-16T14:42:52Z","access_level":"closed","file_size":1378313,"content_type":"application/pdf","file_id":"10298","date_updated":"2021-11-17T13:47:58Z","checksum":"cecc4c4b14225bee973d32e3dba91a55","creator":"cchlebak"}],"publist_id":"5802","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","doi":"10.15479/at:ista:1405","citation":{"ieee":"D. Zufferey, “Analysis of dynamic message passing programs,” Institute of Science and Technology Austria, 2013.","short":"D. Zufferey, Analysis of Dynamic Message Passing Programs, Institute of Science and Technology Austria, 2013.","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","chicago":"Zufferey, Damien. “Analysis of Dynamic Message Passing Programs.” Institute of Science and Technology Austria, 2013. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>.","mla":"Zufferey, Damien. <i>Analysis of Dynamic Message Passing Programs</i>. Institute of Science and Technology Austria, 2013, doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>.","ama":"Zufferey D. Analysis of dynamic message passing programs. 2013. doi:<a href=\"https://doi.org/10.15479/at:ista:1405\">10.15479/at:ista:1405</a>","apa":"Zufferey, D. (2013). <i>Analysis of dynamic message passing programs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:1405\">https://doi.org/10.15479/at:ista:1405</a>"},"ec_funded":1,"oa":1,"oa_version":"Published Version","title":"Analysis of dynamic message passing programs","publication_status":"published","_id":"1405","main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"abstract":[{"lang":"eng","text":"Motivated by the analysis of highly dynamic message-passing systems, i.e. unbounded thread creation, mobility, etc. we present a framework for the analysis of depth-bounded systems. Depth-bounded systems are one of the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. Even though they are infinite state systems depth-bounded systems are well-structured, thus can be analyzed algorithmically. We give an interpretation of depth-bounded systems as graph-rewriting systems. This gives more flexibility and ease of use to apply depth-bounded systems to other type of systems like shared memory concurrency.\r\n\r\nFirst, we develop an adequate domain of limits for depth-bounded systems, a prerequisite for the effective representation of downward-closed sets. Downward-closed sets are needed by forward saturation-based algorithms to represent potentially infinite sets of states. Then, we present an abstract interpretation framework to compute the covering set of well-structured transition systems. Because, in general, the covering set is not computable, our abstraction over-approximates the actual covering set. Our abstraction captures the essence of acceleration based-algorithms while giving up enough precision to ensure convergence. We have implemented the analysis in the PICASSO tool and show that it is accurate in practice. Finally, we build some further analyses like termination using the covering set as starting point."}],"year":"2013","alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"publisher":"Institute of Science and Technology Austria","supervisor":[{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}]},{"volume":177,"quality_controlled":0,"citation":{"chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Positivity for Kac Polynomials and DT-Invariants of Quivers.” <i>Annals of Mathematics</i>. Princeton University Press, 2013. <a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">https://doi.org/10.4007/annals.2013.177.3.8</a>.","ama":"Hausel T, Letellier E, Rodríguez Villegas F. Positivity for Kac polynomials and DT-invariants of quivers. <i>Annals of Mathematics</i>. 2013;177(3):1147-1168. doi:<a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">10.4007/annals.2013.177.3.8</a>","apa":"Hausel, T., Letellier, E., &#38; Rodríguez Villegas, F. (2013). Positivity for Kac polynomials and DT-invariants of quivers. <i>Annals of Mathematics</i>. Princeton University Press. <a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">https://doi.org/10.4007/annals.2013.177.3.8</a>","mla":"Hausel, Tamás, et al. “Positivity for Kac Polynomials and DT-Invariants of Quivers.” <i>Annals of Mathematics</i>, vol. 177, no. 3, Princeton University Press, 2013, pp. 1147–68, doi:<a href=\"https://doi.org/10.4007/annals.2013.177.3.8\">10.4007/annals.2013.177.3.8</a>.","ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Positivity for Kac polynomials and DT-invariants of quivers,” <i>Annals of Mathematics</i>, vol. 177, no. 3. Princeton University Press, pp. 1147–1168, 2013.","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2013. Positivity for Kac polynomials and DT-invariants of quivers. Annals of Mathematics. 177(3), 1147–1168.","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Annals of Mathematics 177 (2013) 1147–1168."},"publist_id":"5754","extern":1,"publisher":"Princeton University Press","doi":"10.4007/annals.2013.177.3.8","issue":"3","type":"journal_article","title":"Positivity for Kac polynomials and DT-invariants of quivers","_id":"1442","publication_status":"published","date_updated":"2021-01-12T06:50:47Z","oa":1,"publication":"Annals of Mathematics","date_published":"2013-01-01T00:00:00Z","month":"01","intvolume":"       177","page":"1147 - 1168","status":"public","author":[{"id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel","first_name":"Tamas","full_name":"Tamas Hausel"},{"full_name":"Letellier, Emmanuel","last_name":"Letellier","first_name":"Emmanuel"},{"full_name":"Rodríguez Villegas, Fernando","last_name":"Rodríguez Villegas","first_name":"Fernando"}],"date_created":"2018-12-11T11:52:02Z","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1204.2375","open_access":"1"}],"acknowledgement":"The first author thanks the Royal Society for funding his research 2005-2012 in the form of a Royal Society University Research Fellowship as well as the Mathematical Institute and Wadham College in Oxford for a very productive environment. The second author is supported by Agence Nationale de la Recherche grant\nANR-09-JCJC-0102-01. The third author is supported by the NSF grant DMS-1101484 and a Research Scholarship from the Clay Mathematical Institute.","abstract":[{"lang":"eng","text":"We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich-Soibelman. Thisis achieved by computing, via an arithmetic Fourier transform, the dimensions of the isotypical components of the cohomology of associated Nakajima quiver varieties under the action of a Weyl group. The generating function of the corresponding Poincare polynomials is an extension of Hua's formula for Kac polynomials of quivers involving Hall-Littlewood symmetric functions. The resulting formulae contain a wide range of information on the geometry of the quiver varieties."}],"year":"2013"}]