[{"date_published":"2013-07-01T00:00:00Z","citation":{"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>.","short":"M. Papas, C. Regg, W. Jarosz, B. Bickel, P. Jackson, W. Matusik, S. Marschner, M. Groß, ACM Transactions on Graphics 32 (2013).","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)."},"fulldoi":"https://doi.org/10.1145/2461912.2461974","date_updated":"2021-01-12T06:55:22Z","_id":"2110","title":"Fabricating translucent materials using continuous pigment mixtures","status":"public","date_created":"2018-12-11T11:55:46Z","author":[{"full_name":"Papas, Marios","first_name":"Marios","last_name":"Papas"},{"full_name":"Regg, Christian","last_name":"Regg","first_name":"Christian"},{"full_name":"Jarosz, Wojciech","first_name":"Wojciech","last_name":"Jarosz"},{"last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"first_name":"Philip","last_name":"Jackson","full_name":"Jackson, Philip V"},{"full_name":"Matusik, Wojciech","first_name":"Wojciech","last_name":"Matusik"},{"full_name":"Marschner, Steve","last_name":"Marschner","first_name":"Steve"},{"full_name":"Groß, Markus S","first_name":"Markus","last_name":"Groß"}],"year":"2013","quality_controlled":0,"publication_status":"published","type":"journal_article","intvolume":"        32","abstract":[{"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. ","lang":"eng"}],"extern":1,"publist_id":"4925","volume":32,"doi":"10.1145/2461912.2461974","day":"01","publication":"ACM Transactions on Graphics","issue":"4","month":"07","publisher":"ACM"},{"intvolume":"        32","extern":1,"abstract":[{"lang":"eng","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."}],"publication_status":"published","type":"journal_article","year":"2013","quality_controlled":0,"date_created":"2018-12-11T11:55:47Z","status":"public","author":[{"first_name":"Amit","last_name":"Bermano","full_name":"Bermano, Amit H"},{"last_name":"Bruschweiler","first_name":"Philipp","full_name":"Bruschweiler, Philipp"},{"full_name":"Grundhöfer, Anselm","first_name":"Anselm","last_name":"Grundhöfer"},{"first_name":"Daisuke","last_name":"Iwai","full_name":"Iwai, Daisuke"},{"last_name":"Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"full_name":"Groß, Markus S","last_name":"Groß","first_name":"Markus"}],"title":"Augmenting physical avatars using projector-based illumination","_id":"2111","date_updated":"2021-01-12T06:55:23Z","fulldoi":"https://doi.org/10.1145/2508363.2508416","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>.","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>","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>","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>.","short":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (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).","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."},"date_published":"2013-11-01T00:00:00Z","publisher":"ACM","month":"11","issue":"6","publication":"ACM Transactions on Graphics","day":"01","doi":"10.1145/2508363.2508416","volume":32,"publist_id":"4922"},{"publication_identifier":{"issn":["1744-3091"]},"issue":"3","publication":"Acta Crystallographica Section F Structural Biology Communications","language":[{"iso":"eng"}],"OA_type":"closed access","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."}],"extern":"1","article_type":"original","oa_version":"None","type":"journal_article","status":"public","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","first_name":"Pradeep K","last_name":"Mandal"},{"first_name":"Namasivayam","last_name":"Gautham","full_name":"Gautham, Namasivayam"},{"full_name":"Chadha, Anju","last_name":"Chadha","first_name":"Anju"}],"date_created":"2026-01-29T22:11:18Z","_id":"21110","title":"Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-02-23T08:56:25Z","citation":{"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.","short":"N. Aggarwal, P.K. Mandal, N. Gautham, A. Chadha, Acta Crystallographica Section F Structural Biology Communications 69 (2013) 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.","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>."},"page":"313-315","month":"03","publisher":"International Union of Crystallography","day":"01","doi":"10.1107/s1744309113003667","volume":69,"intvolume":"        69","year":"2013","quality_controlled":"1","publication_status":"published","fulldoi":"https://doi.org/10.1107/s1744309113003667","article_processing_charge":"No","date_published":"2013-03-01T00:00:00Z","has_accepted_license":"1"},{"publist_id":"4923","volume":32,"doi":"10.1145/2508363.2508389 ","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).","month":"11","publisher":"ACM","day":"01","publication":"ACM Transactions on Graphics","issue":"6","fulldoi":"https://doi.org/10.1145/2508363.2508389 ","date_updated":"2021-01-12T06:55:23Z","date_published":"2013-11-01T00:00:00Z","citation":{"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>","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>.","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).","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.","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).","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>","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>."},"year":"2013","quality_controlled":0,"publication_status":"published","type":"journal_article","intvolume":"        32","extern":1,"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"}],"_id":"2112","title":"Modeling and estimation of internal friction in cloth","date_created":"2018-12-11T11:55:47Z","author":[{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"first_name":"Rasmus","last_name":"Tamstorf","full_name":"Tamstorf, Rasmus"},{"first_name":"Derek","last_name":"Bradley","full_name":"Bradley, Derek J"},{"full_name":"Schvartzman, Sara C","first_name":"Sara","last_name":"Schvartzman"},{"first_name":"Bernhard","last_name":"Thomaszewski","full_name":"Thomaszewski, Bernhard"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"},{"last_name":"Marschner","first_name":"Steve","full_name":"Marschner, Steve"},{"full_name":"Otaduy, Miguel A","first_name":"Miguel","last_name":"Otaduy"}],"status":"public"},{"doi":"10.1109/MCG.2013.82 ","volume":33,"publist_id":"4920","publisher":"IEEE","month":"09","issue":"6","publication":"IEEE Computer Graphics and Applications","day":"23","date_updated":"2021-01-12T06:55:23Z","fulldoi":"https://doi.org/10.1109/MCG.2013.82 ","citation":{"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.","short":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 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.","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>.","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>","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>","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>."},"page":"48 - 57","date_published":"2013-09-23T00:00:00Z","abstract":[{"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.","lang":"eng"}],"intvolume":"        33","extern":1,"type":"journal_article","publication_status":"published","year":"2013","quality_controlled":0,"date_created":"2018-12-11T11:55:47Z","author":[{"full_name":"Rouiller, Olivier","first_name":"Olivier","last_name":"Rouiller"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","first_name":"Bernd","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385"},{"full_name":"Kautz, Jan","last_name":"Kautz","first_name":"Jan"},{"full_name":"Matusik, Wojciech","first_name":"Wojciech","last_name":"Matusik"},{"first_name":"Marc","last_name":"Alexa","full_name":"Alexa, Marc"}],"status":"public","title":"3D printing spatially varying BRDFs","_id":"2113"},{"fulldoi":"https://doi.org/10.1109/MCG.2013.89","date_updated":"2021-01-12T06:55:24Z","page":"24 - 25","citation":{"ista":"Bickel B, Alexa M. 2013. Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. 33(6), 24–25.","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.","short":"B. Bickel, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 24–25.","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>.","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>","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>","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>."},"date_published":"2013-12-01T00:00:00Z","intvolume":"        33","extern":1,"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"}],"quality_controlled":0,"year":"2013","type":"journal_article","publication_status":"published","status":"public","author":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","full_name":"Bernd Bickel","orcid":"0000-0001-6511-9385"},{"last_name":"Alexa","first_name":"Marc","full_name":"Alexa, Marc"}],"date_created":"2018-12-11T11:55:48Z","_id":"2114","title":"Computational aspects of fabrication: Modeling, design and 3d printing","doi":"10.1109/MCG.2013.89","publist_id":"4921","volume":33,"month":"12","publisher":"IEEE","issue":"6","publication":"IEEE Computer Graphics and Applications","day":"01"},{"extern":1,"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"}],"intvolume":"        18","quality_controlled":0,"year":"2013","type":"journal_article","publication_status":"published","author":[{"full_name":"Dirksen, Sjoerd","first_name":"Sjoerd","last_name":"Dirksen"},{"full_name":"Jan Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","first_name":"Jan"},{"full_name":"van Neerven, Jan M","last_name":"Van Neerven","first_name":"Jan"}],"date_created":"2018-12-11T11:55:49Z","status":"public","_id":"2117","title":"Poisson stochastic integration in Banach spaces","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.7901 "}],"fulldoi":"https://doi.org/10.1214/EJP.v18-2945 ","date_updated":"2021-01-12T06:55:24Z","citation":{"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>","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>.","short":"S. Dirksen, J. Maas, J. Van Neerven, Electronic Journal of Probability 18 (2013).","ista":"Dirksen S, Maas J, Van Neerven J. 2013. Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. 18.","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.","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>."},"date_published":"2013-11-18T00:00:00Z","month":"11","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","publisher":"Institute of Mathematical Statistics","oa":1,"day":"18","publication":"Electronic Journal of Probability","doi":"10.1214/EJP.v18-2945 ","publist_id":"4917","volume":18},{"publisher":"Society for Industrial and Applied Mathematics ","month":"01","acknowledgement":"JM acknowledges support by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","oa":1,"issue":"2","day":"01","publication":"SIAM Journal on Mathematical Analysis","doi":"10.1137/120886315 ","volume":45,"publist_id":"4904","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"}],"intvolume":"        45","extern":1,"publication_status":"published","type":"journal_article","year":"2013","quality_controlled":0,"date_created":"2018-12-11T11:55:53Z","status":"public","author":[{"first_name":"Nicola","last_name":"Gigli","full_name":"Gigli, Nicola"},{"orcid":"0000-0002-0845-1338","full_name":"Jan Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","last_name":"Maas","first_name":"Jan"}],"title":"Gromov-Hausdorff convergence of discrete transportation metrics","_id":"2129","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.6501"}],"date_updated":"2021-01-12T06:55:29Z","fulldoi":"https://doi.org/10.1137/120886315 ","citation":{"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>","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.","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.","short":"N. Gigli, J. Maas, SIAM Journal on Mathematical Analysis 45 (2013) 879–899.","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>.","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>"},"page":"879 - 899","date_published":"2013-01-01T00:00:00Z"},{"date_published":"2013-10-07T00:00:00Z","citation":{"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>","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>.","ista":"Lemeshko M. 2013. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 1(17).","short":"M. Lemeshko, Frontiers Physics 1 (2013).","ieee":"M. Lemeshko, “Manipulating scattering of ultracold atoms with light-induced dissipation,” <i>Frontiers Physics</i>, vol. 1, no. 17. Frontiers Media, 2013.","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>.","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>"},"fulldoi":"https://doi.org/10.3389/fphy.2013.00017","date_updated":"2021-01-12T06:55:32Z","main_file_link":[{"url":"http://arxiv.org/abs/1307.8129","open_access":"1"}],"_id":"2139","title":"Manipulating scattering of ultracold atoms with light-induced dissipation","date_created":"2018-12-11T11:55:56Z","author":[{"orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko","last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"status":"public","year":"2013","quality_controlled":0,"publication_status":"published","type":"journal_article","abstract":[{"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.","lang":"eng"}],"intvolume":"         1","extern":1,"publist_id":"4885","volume":1,"doi":"10.3389/fphy.2013.00017","day":"07","publication":"Frontiers Physics","issue":"17","oa":1,"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","month":"10","publisher":"Frontiers Media"},{"oa_version":"None","publication_status":"published","type":"conference","year":"2013","quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"title":"Quantitative abstraction refinement","_id":"2182","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:56:11Z","status":"public","date_updated":"2024-10-09T20:55:21Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1145/2429069.2429085","conference":{"location":"Rome, Italy","name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","start_date":"2013-07-23"},"date_published":"2013-01-01T00:00:00Z","page":"115 - 128","citation":{"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>","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>.","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.","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>.","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>"},"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"}],"publisher":"ACM","ec_funded":1,"month":"01","department":[{"_id":"ToHe"}],"day":"01","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","corr_author":"1","scopus_import":1,"language":[{"iso":"eng"}],"publist_id":"4800","doi":"10.1145/2429069.2429085"},{"volume":24,"doi":"10.1055/s-0033-1340087","publisher":"Georg Thieme Verlag","month":"10","day":"22","fulldoi":"https://doi.org/10.1055/s-0033-1340087","date_published":"2013-10-22T00:00:00Z","article_processing_charge":"No","keyword":["Organic Chemistry"],"publication_status":"published","year":"2013","quality_controlled":"1","intvolume":"        24","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0936-5214"],"eissn":["1437-2096"]},"publication":"Synlett","scopus_import":"1","issue":"18","date_updated":"2024-10-14T12:21:03Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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>","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>.","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>","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>."},"page":"2370-2374","type":"journal_article","oa_version":"None","article_type":"original","extern":"1","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."}],"title":"Photocontrol of electrical conductance with a nonsymmetrical azobenzene dithiol","_id":"13405","author":[{"last_name":"Ely","first_name":"Tal","full_name":"Ely, Tal"},{"first_name":"Sanjib","last_name":"Das","full_name":"Das, Sanjib"},{"full_name":"Li, Wenjie","last_name":"Li","first_name":"Wenjie"},{"first_name":"Pintu","last_name":"Kundu","full_name":"Kundu, Pintu"},{"full_name":"Tirosh, Einat","first_name":"Einat","last_name":"Tirosh"},{"first_name":"David","last_name":"Cahen","full_name":"Cahen, David"},{"first_name":"Ayelet","last_name":"Vilan","full_name":"Vilan, Ayelet"},{"full_name":"Klajn, Rafal","first_name":"Rafal","last_name":"Klajn","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"}],"status":"public","date_created":"2023-08-01T09:47:17Z"},{"status":"public","date_created":"2023-08-01T09:47:30Z","author":[{"full_name":"Das, Sanjib","last_name":"Das","first_name":"Sanjib"},{"first_name":"Priyadarshi","last_name":"Ranjan","full_name":"Ranjan, Priyadarshi"},{"full_name":"Maiti, Pradipta Sankar","first_name":"Pradipta Sankar","last_name":"Maiti"},{"full_name":"Singh, Gurvinder","last_name":"Singh","first_name":"Gurvinder"},{"full_name":"Leitus, Gregory","first_name":"Gregory","last_name":"Leitus"},{"id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","first_name":"Rafal","last_name":"Klajn","full_name":"Klajn, Rafal"}],"_id":"13406","title":"Dual-responsive nanoparticles and their self-assembly","extern":"1","abstract":[{"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.","lang":"eng"}],"article_type":"original","oa_version":"None","type":"journal_article","citation":{"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>","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>.","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.","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>.","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>"},"page":"422-426","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-14T12:21:16Z","issue":"3","scopus_import":"1","publication":"Advanced Materials","publication_identifier":{"issn":["0935-9648"]},"language":[{"iso":"eng"}],"intvolume":"        25","pmid":1,"quality_controlled":"1","year":"2013","publication_status":"published","keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"article_processing_charge":"No","date_published":"2013-01-18T00:00:00Z","fulldoi":"https://doi.org/10.1002/adma.201201734","day":"18","month":"01","publisher":"Wiley","external_id":{"pmid":["22933327"]},"doi":"10.1002/adma.201201734","volume":25},{"volume":23,"file":[{"access_level":"open_access","relation":"main_file","creator":"system","checksum":"b7091a3866db573c0db5ec486952255e","date_created":"2018-12-12T10:13:38Z","date_updated":"2020-07-14T12:44:47Z","content_type":"application/pdf","file_name":"IST-2016-624-v1+1_ChKr_Infinite-state_games_2013_17.pdf","file_size":547296,"file_id":"5023"}],"doi":"10.4230/LIPIcs.CSL.2013.181","series_title":"Leibniz International Proceedings in Informatics","department":[{"_id":"KrCh"}],"month":"09","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"01","pubrep_id":"624","oa":1,"corr_author":"1","fulldoi":"https://doi.org/10.4230/LIPIcs.CSL.2013.181","date_published":"2013-09-01T00:00:00Z","alternative_title":["LIPIcs"],"file_date_updated":"2020-07-14T12:44:47Z","conference":{"location":"Torino, Italy","name":"CSL: Computer Science Logic","end_date":"2013-09-05","start_date":"203-09-02"},"has_accepted_license":"1","year":"2013","quality_controlled":"1","publication_status":"published","intvolume":"        23","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["000"],"publist_id":"5837","language":[{"iso":"eng"}],"ec_funded":1,"publication":"22nd EACSL Annual Conference on Computer Science Logic","scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-10-09T20:55:23Z","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"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.","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.","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."},"page":"181 - 196","oa_version":"Published Version","type":"conference","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."}],"_id":"1374","title":"Infinite-state games with finitary conditions","status":"public","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Fijalkow, Nathanaël","last_name":"Fijalkow","first_name":"Nathanaël"}],"date_created":"2018-12-11T11:51:39Z"},{"publication_status":"published","year":"2013","quality_controlled":"1","conference":{"name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20","end_date":"2013-10-23","location":"Portland, OR, United States"},"date_published":"2013-12-11T00:00:00Z","article_processing_charge":"No","fulldoi":"https://doi.org/10.1109/FMCAD.2013.6679386","main_file_link":[{"open_access":"1","url":"https://doi.org/10.15479/AT:IST-2013-130-v1-1"}],"day":"11","corr_author":"1","oa":1,"publisher":"IEEE","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"12","doi":"10.1109/FMCAD.2013.6679386","title":"Distributed synthesis for LTL fragments","_id":"1376","status":"public","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan"},{"last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"}],"date_created":"2018-12-11T11:51:40Z","type":"conference","oa_version":"Preprint","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."}],"related_material":{"record":[{"relation":"earlier_version","id":"5406","status":"public"}]},"page":"18 - 25","citation":{"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>.","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.","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.","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>"},"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"date_updated":"2025-06-26T08:33:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"13th International Conference on Formal Methods in Computer-Aided Design","scopus_import":"1","ec_funded":1,"OA_type":"green","OA_place":"repository","publist_id":"5835","language":[{"iso":"eng"}]},{"related_material":{"record":[{"status":"public","id":"4361","relation":"part_of_dissertation"},{"id":"3251","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"2847","status":"public"}]},"page":"134","citation":{"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>.","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>","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>","ista":"Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.","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."},"project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"date_updated":"2026-04-09T14:35:24Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","title":"Analysis of dynamic message passing programs","_id":"1405","author":[{"last_name":"Zufferey","first_name":"Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736"}],"status":"public","date_created":"2018-12-11T11:51:50Z","type":"dissertation","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"oa_version":"Published Version","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."}],"OA_place":"publisher","publist_id":"5802","language":[{"iso":"eng"}],"ec_funded":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. ","publication_identifier":{"issn":["2663-337X"]},"has_accepted_license":"1","file_date_updated":"2021-11-17T13:47:58Z","date_published":"2013-09-05T00:00:00Z","alternative_title":["ISTA Thesis"],"article_processing_charge":"No","degree_awarded":"PhD","fulldoi":"https://doi.org/10.15479/at:ista:1405","main_file_link":[{"url":"http://dzufferey.github.io/files/2013_thesis.pdf"}],"ddc":["000"],"publication_status":"published","year":"2013","doi":"10.15479/at:ista:1405","file":[{"file_name":"2013_Zufferey_thesis_final.pdf","date_updated":"2021-02-22T11:28:36Z","content_type":"application/pdf","file_size":1514906,"file_id":"9176","access_level":"open_access","creator":"dernst","relation":"main_file","success":1,"date_created":"2021-02-22T11:28:36Z","checksum":"ed2d7b52933d134e8dc69d569baa284e"},{"access_level":"closed","relation":"main_file","creator":"cchlebak","date_created":"2021-11-16T14:42:52Z","checksum":"cecc4c4b14225bee973d32e3dba91a55","date_updated":"2021-11-17T13:47:58Z","content_type":"application/pdf","file_name":"2013_Zufferey_thesis_final_pdfa.pdf","file_size":1378313,"file_id":"10298"}],"day":"05","corr_author":"1","oa":1,"publisher":"Institute of Science and Technology Austria","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"month":"09"},{"doi":"10.4007/annals.2013.177.3.8","publist_id":"5754","volume":177,"month":"01","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.","publisher":"Princeton University Press","issue":"3","oa":1,"publication":"Annals of Mathematics","day":"01","main_file_link":[{"url":"http://arxiv.org/abs/1204.2375","open_access":"1"}],"fulldoi":"https://doi.org/10.4007/annals.2013.177.3.8","date_updated":"2021-01-12T06:50:47Z","page":"1147 - 1168","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>.","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>.","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>","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Annals of Mathematics 177 (2013) 1147–1168.","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.","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."},"date_published":"2013-01-01T00:00:00Z","extern":1,"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."}],"intvolume":"       177","year":"2013","quality_controlled":0,"publication_status":"published","type":"journal_article","author":[{"full_name":"Tamas Hausel","first_name":"Tamas","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Letellier, Emmanuel","last_name":"Letellier","first_name":"Emmanuel"},{"last_name":"Rodríguez Villegas","first_name":"Fernando","full_name":"Rodríguez Villegas, Fernando"}],"status":"public","date_created":"2018-12-11T11:52:02Z","_id":"1442","title":"Positivity for Kac polynomials and DT-invariants of quivers"},{"volume":25,"publist_id":"5753","oa":1,"day":"15","publication":"Handbook of Moduli: Volume II","publisher":"International Press","month":"03","citation":{"ista":"Hausel T. 2013.Global topology of the Hitchin system. In: Handbook of Moduli: Volume II. Advanced Lectures in Mathematics, vol. 25, 29–70.","short":"T. Hausel, in:, Handbook of Moduli: Volume II, International Press, 2013, pp. 29–70.","ieee":"T. Hausel, “Global topology of the Hitchin system,” in <i>Handbook of Moduli: Volume II</i>, vol. 25, International Press, 2013, pp. 29–70.","mla":"Hausel, Tamás. “Global Topology of the Hitchin System.” <i>Handbook of Moduli: Volume II</i>, vol. 25, International Press, 2013, pp. 29–70.","ama":"Hausel T. Global topology of the Hitchin system. In: <i>Handbook of Moduli: Volume II</i>. Vol 25. International Press; 2013:29-70.","apa":"Hausel, T. (2013). Global topology of the Hitchin system. In <i>Handbook of Moduli: Volume II</i> (Vol. 25, pp. 29–70). International Press.","chicago":"Hausel, Tamás. “Global Topology of the Hitchin System.” In <i>Handbook of Moduli: Volume II</i>, 25:29–70. International Press, 2013."},"page":"29 - 70","alternative_title":["Advanced Lectures in Mathematics"],"date_published":"2013-03-15T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1102.1717"}],"date_updated":"2021-01-12T06:50:47Z","date_created":"2018-12-11T11:52:03Z","author":[{"full_name":"Tamas Hausel","first_name":"Tamas","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87"}],"status":"public","title":"Global topology of the Hitchin system","_id":"1443","extern":1,"intvolume":"        25","abstract":[{"text":"Here we survey several results and conjectures on the cohomology of the total space of the Hitchin system: the moduli space of semi-stable rank n and degree d Higgs bundles on a complex algebraic curve C. The picture emerging is a dynamic mixture of ideas originating in theoretical physics such as gauge theory and mirror symmetry, Weil conjectures in arithmetic algebraic geometry, representation theory of finite groups of Lie type and Langlands duality in number theory.","lang":"eng"}],"publication_status":"published","type":"book_chapter","quality_controlled":0,"year":"2013"},{"day":"15","publication":"Advances in Mathematics","publisher":"Academic Press","acknowledgement":"During the preparation of this paper TH was supported by a Royal Society University Research Fellowship at the University of Oxford. EL was supported by ANR-09-JCJC-0102-01. FRV was supported by NSF grant DMS-0200605, an FRA from the University of Texas at Austin, EPSRC grant EP/G027110/1, Visiting Fellowships at All Souls and Wadham Colleges in Oxford and a Research Scholarship from the Clay Mathematical Institute.","month":"02","doi":"10.1016/j.aim.2012.10.009","volume":234,"publist_id":"5724","author":[{"first_name":"Tamas","last_name":"Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel"},{"full_name":"Letellier, Emmanuel","first_name":"Emmanuel","last_name":"Letellier"},{"first_name":"Fernando","last_name":"Rodríguez Villegas","full_name":"Rodríguez Villegas, Fernando"}],"date_created":"2018-12-11T11:52:12Z","status":"public","title":"Arithmetic harmonic analysis on character and quiver varieties II","_id":"1469","intvolume":"       234","abstract":[{"lang":"eng","text":"We study connections between the topology of generic character varieties of fundamental groups of punctured Riemann surfaces, Macdonald polynomials, quiver representations, Hilbert schemes on Cx × Cx, modular forms and multiplicities in tensor products of irreducible characters of finite general linear groups."}],"extern":1,"type":"journal_article","publication_status":"published","year":"2013","quality_controlled":0,"page":"85 - 128","citation":{"ieee":"T. Hausel, E. Letellier, and F. Rodríguez Villegas, “Arithmetic harmonic analysis on character and quiver varieties II,” <i>Advances in Mathematics</i>, vol. 234. Academic Press, pp. 85–128, 2013.","ista":"Hausel T, Letellier E, Rodríguez Villegas F. 2013. Arithmetic harmonic analysis on character and quiver varieties II. Advances in Mathematics. 234, 85–128.","short":"T. Hausel, E. Letellier, F. Rodríguez Villegas, Advances in Mathematics 234 (2013) 85–128.","ama":"Hausel T, Letellier E, Rodríguez Villegas F. Arithmetic harmonic analysis on character and quiver varieties II. <i>Advances in Mathematics</i>. 2013;234:85-128. doi:<a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">10.1016/j.aim.2012.10.009</a>","mla":"Hausel, Tamás, et al. “Arithmetic Harmonic Analysis on Character and Quiver Varieties II.” <i>Advances in Mathematics</i>, vol. 234, Academic Press, 2013, pp. 85–128, doi:<a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">10.1016/j.aim.2012.10.009</a>.","apa":"Hausel, T., Letellier, E., &#38; Rodríguez Villegas, F. (2013). Arithmetic harmonic analysis on character and quiver varieties II. <i>Advances in Mathematics</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">https://doi.org/10.1016/j.aim.2012.10.009</a>","chicago":"Hausel, Tamás, Emmanuel Letellier, and Fernando Rodríguez Villegas. “Arithmetic Harmonic Analysis on Character and Quiver Varieties II.” <i>Advances in Mathematics</i>. Academic Press, 2013. <a href=\"https://doi.org/10.1016/j.aim.2012.10.009\">https://doi.org/10.1016/j.aim.2012.10.009</a>."},"date_published":"2013-02-15T00:00:00Z","date_updated":"2021-01-12T06:50:57Z","fulldoi":"https://doi.org/10.1016/j.aim.2012.10.009"},{"doi":"10.5427/jsing.2013.7c","publist_id":"5725","volume":7,"oa":1,"publication":"Journal of Singularities","day":"01","month":"01","acknowledgement":"Mark Andrea A. de Cataldo was partially supported by N.S.A. and N.S.F. Tamás Hausel was supported by a Royal Society University Research Fellowship. Luca Migliorini was partially supported by PRIN 2007 project \"Spazi di moduli e teoria di Lie\"","publisher":"Worldwide Center of Mathematics","page":"23 - 38","citation":{"mla":"De Cataldo, Mark, et al. “Exchange between Perverse and Weight Filtration for the Hilbert Schemes of Points of Two Surfaces.” <i>Journal of Singularities</i>, vol. 7, Worldwide Center of Mathematics, 2013, pp. 23–38, doi:<a href=\"https://doi.org/10.5427/jsing.2013.7c\">10.5427/jsing.2013.7c</a>.","ama":"De Cataldo M, Hausel T, Migliorini L. Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. <i>Journal of Singularities</i>. 2013;7:23-38. doi:<a href=\"https://doi.org/10.5427/jsing.2013.7c\">10.5427/jsing.2013.7c</a>","ieee":"M. De Cataldo, T. Hausel, and L. Migliorini, “Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces,” <i>Journal of Singularities</i>, vol. 7. Worldwide Center of Mathematics, pp. 23–38, 2013.","short":"M. De Cataldo, T. Hausel, L. Migliorini, Journal of Singularities 7 (2013) 23–38.","ista":"De Cataldo M, Hausel T, Migliorini L. 2013. Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. Journal of Singularities. 7, 23–38.","chicago":"De Cataldo, Mark, Tamás Hausel, and Luca Migliorini. “Exchange between Perverse and Weight Filtration for the Hilbert Schemes of Points of Two Surfaces.” <i>Journal of Singularities</i>. Worldwide Center of Mathematics, 2013. <a href=\"https://doi.org/10.5427/jsing.2013.7c\">https://doi.org/10.5427/jsing.2013.7c</a>.","apa":"De Cataldo, M., Hausel, T., &#38; Migliorini, L. (2013). Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces. <i>Journal of Singularities</i>. Worldwide Center of Mathematics. <a href=\"https://doi.org/10.5427/jsing.2013.7c\">https://doi.org/10.5427/jsing.2013.7c</a>"},"date_published":"2013-01-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1012.2583","open_access":"1"}],"fulldoi":"https://doi.org/10.5427/jsing.2013.7c","date_updated":"2021-01-12T06:50:58Z","author":[{"full_name":"De Cataldo, Mark A","last_name":"De Cataldo","first_name":"Mark"},{"full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas","last_name":"Hausel"},{"first_name":"Luca","last_name":"Migliorini","full_name":"Migliorini, Luca"}],"date_created":"2018-12-11T11:52:12Z","status":"public","_id":"1470","title":"Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces","intvolume":"         7","abstract":[{"text":"We show that a natural isomorphism between the rational cohomology groups of the two zero-dimensional Hilbert schemes of n-points of two surfaces, the affine plane minus the axes and the cotangent bundle of an elliptic curve, exchanges the weight filtration on the first set of cohomology groups with the perverse Leray filtration associated with a natural fibration on the second set of cohomology groups. We discuss some associated hard Lefschetz phenomena.","lang":"eng"}],"extern":1,"year":"2013","quality_controlled":0,"type":"journal_article","publication_status":"published"},{"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1742-2051"],"issn":["1742-206X"]},"issue":"11","scopus_import":"1","publication":"Molecular BioSystems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-03-25T11:45:46Z","citation":{"apa":"Woehrmann, M. H., Bray, W. M., Durbin, J. K., Nisam, S. C., Michael, A. K., Glassey, E., … Lokey, R. S. (2013). Large-scale cytological profiling for functional analysis of bioactive compounds. <i>Molecular BioSystems</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c3mb70245f\">https://doi.org/10.1039/c3mb70245f</a>","chicago":"Woehrmann, Marcos H., Walter M. Bray, James K. Durbin, Sean C. Nisam, Alicia K. Michael, Emerson Glassey, Joshua M. Stuart, and R. Scott Lokey. “Large-Scale Cytological Profiling for Functional Analysis of Bioactive Compounds.” <i>Molecular BioSystems</i>. Royal Society of Chemistry, 2013. <a href=\"https://doi.org/10.1039/c3mb70245f\">https://doi.org/10.1039/c3mb70245f</a>.","ieee":"M. H. Woehrmann <i>et al.</i>, “Large-scale cytological profiling for functional analysis of bioactive compounds,” <i>Molecular BioSystems</i>, vol. 9, no. 11. Royal Society of Chemistry, 2013.","short":"M.H. Woehrmann, W.M. Bray, J.K. Durbin, S.C. Nisam, A.K. Michael, E. Glassey, J.M. Stuart, R.S. Lokey, Molecular BioSystems 9 (2013).","ista":"Woehrmann MH, Bray WM, Durbin JK, Nisam SC, Michael AK, Glassey E, Stuart JM, Lokey RS. 2013. Large-scale cytological profiling for functional analysis of bioactive compounds. Molecular BioSystems. 9(11), 2604.","ama":"Woehrmann MH, Bray WM, Durbin JK, et al. Large-scale cytological profiling for functional analysis of bioactive compounds. <i>Molecular BioSystems</i>. 2013;9(11). doi:<a href=\"https://doi.org/10.1039/c3mb70245f\">10.1039/c3mb70245f</a>","mla":"Woehrmann, Marcos H., et al. “Large-Scale Cytological Profiling for Functional Analysis of Bioactive Compounds.” <i>Molecular BioSystems</i>, vol. 9, no. 11, 2604, Royal Society of Chemistry, 2013, doi:<a href=\"https://doi.org/10.1039/c3mb70245f\">10.1039/c3mb70245f</a>."},"extern":"1","abstract":[{"lang":"eng","text":"Cytological profiling (CP) is an unbiased image-based screening technique that uses automated microscopy and image analysis to profile compounds based on numerous quantifiable phenotypic features. We used CP to evaluate a library of nearly 500 compounds with documented mechanisms of action (MOAs) spanning a wide range of biological pathways. We developed informatics techniques for generating dosage-independent phenotypic “fingerprints” for each compound, and for quantifying the likelihood that a compound's CP fingerprint corresponds to its annotated MOA. We identified groups of features that distinguish classes with closely related phenotypes, such as microtubule poisons vs. HSP90 inhibitors, and DNA synthesis vs. proteasome inhibitors. We tested several cases in which cytological profiles indicated novel mechanisms, including a tyrphostin kinase inhibitor involved in mitochondrial uncoupling, novel microtubule poisons, and a nominal PPAR-gamma ligand that acts as a proteasome inhibitor, using independent biochemical assays to confirm the MOAs predicted by the CP signatures. We also applied maximal-information statistics to identify correlations between cytological features and kinase inhibitory activities by combining the CP fingerprints of 24 kinase inhibitors with published data on their specificities against a diverse panel of kinases. The resulting analysis suggests a strategy for probing the biological functions of specific kinases by compiling cytological data from inhibitors of varying specificities."}],"article_type":"original","oa_version":"None","type":"journal_article","date_created":"2024-03-21T07:58:57Z","status":"public","author":[{"first_name":"Marcos H.","last_name":"Woehrmann","full_name":"Woehrmann, Marcos H."},{"last_name":"Bray","first_name":"Walter M.","full_name":"Bray, Walter M."},{"full_name":"Durbin, James K.","first_name":"James K.","last_name":"Durbin"},{"first_name":"Sean C.","last_name":"Nisam","full_name":"Nisam, Sean C."},{"last_name":"Michael","first_name":"Alicia Kathleen","id":"6437c950-2a03-11ee-914d-d6476dd7b75c","full_name":"Michael, Alicia Kathleen"},{"first_name":"Emerson","last_name":"Glassey","full_name":"Glassey, Emerson"},{"last_name":"Stuart","first_name":"Joshua M.","full_name":"Stuart, Joshua M."},{"last_name":"Lokey","first_name":"R. Scott","full_name":"Lokey, R. Scott"}],"_id":"15162","title":"Large-scale cytological profiling for functional analysis of bioactive compounds","doi":"10.1039/c3mb70245f","volume":9,"article_number":"2604","month":"08","publisher":"Royal Society of Chemistry","day":"20","fulldoi":"https://doi.org/10.1039/c3mb70245f","keyword":["Molecular Biology","Biotechnology"],"article_processing_charge":"No","date_published":"2013-08-20T00:00:00Z","intvolume":"         9","quality_controlled":"1","year":"2013","publication_status":"published"}]