[{"author":[{"full_name":"Papas, Marios","first_name":"Marios","last_name":"Papas"},{"first_name":"Christian","last_name":"Regg","full_name":"Regg, Christian"},{"full_name":"Jarosz, Wojciech","last_name":"Jarosz","first_name":"Wojciech"},{"full_name":"Bernd Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"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","last_name":"Marschner","first_name":"Steve"},{"first_name":"Markus","last_name":"Groß","full_name":"Groß, Markus S"}],"quality_controlled":0,"publisher":"ACM","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"}],"volume":32,"date_created":"2018-12-11T11:55:46Z","issue":"4","doi":"10.1145/2461912.2461974","month":"07","date_updated":"2021-01-12T06:55:22Z","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>.","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.","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>","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).","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>.","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>"},"extern":1,"status":"public","publication":"ACM Transactions on Graphics","type":"journal_article","date_published":"2013-07-01T00:00:00Z","year":"2013","_id":"2110","intvolume":"        32","publist_id":"4925","publication_status":"published","title":"Fabricating translucent materials using continuous pigment mixtures","day":"01"},{"publication_status":"published","title":"Augmenting physical avatars using projector-based illumination","day":"01","publist_id":"4922","intvolume":"        32","_id":"2111","year":"2013","type":"journal_article","publication":"ACM Transactions on Graphics","date_published":"2013-11-01T00:00:00Z","extern":1,"status":"public","citation":{"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>","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).","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>.","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>.","short":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013).","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>"},"month":"11","date_updated":"2021-01-12T06:55:23Z","doi":"10.1145/2508363.2508416","date_created":"2018-12-11T11:55:47Z","issue":"6","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."}],"volume":32,"publisher":"ACM","author":[{"last_name":"Bermano","first_name":"Amit","full_name":"Bermano, Amit H"},{"first_name":"Philipp","last_name":"Bruschweiler","full_name":"Bruschweiler, Philipp"},{"full_name":"Grundhöfer, Anselm","first_name":"Anselm","last_name":"Grundhöfer"},{"full_name":"Iwai, Daisuke","last_name":"Iwai","first_name":"Daisuke"},{"full_name":"Bernd Bickel","last_name":"Bickel","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd"},{"full_name":"Groß, Markus S","first_name":"Markus","last_name":"Groß"}],"quality_controlled":0},{"day":"01","title":"Expression, purification, crystallization and preliminary X-ray diffraction analysis of carbonyl reductase from Candida parapsilosis ATCC 7330","intvolume":"        69","publication_identifier":{"issn":["1744-3091"]},"_id":"21110","date_published":"2013-03-01T00:00:00Z","type":"journal_article","status":"public","extern":"1","article_processing_charge":"No","has_accepted_license":"1","oa_version":"None","doi":"10.1107/s1744309113003667","abstract":[{"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.","lang":"eng"}],"publisher":"International Union of Crystallography","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","OA_type":"closed access","language":[{"iso":"eng"}],"year":"2013","publication":"Acta Crystallographica Section F Structural Biology Communications","citation":{"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.","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.","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.","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>","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>."},"date_updated":"2026-02-23T08:56:25Z","month":"03","issue":"3","date_created":"2026-01-29T22:11:18Z","volume":69,"page":"313-315","article_type":"original","author":[{"last_name":"Aggarwal","first_name":"Nidhi","full_name":"Aggarwal, Nidhi"},{"orcid":"0000-0001-5996-956X","id":"6a3def15-d4b4-11ef-9fa9-a24c1f545ec3","first_name":"Pradeep K","last_name":"Mandal","full_name":"Mandal, Pradeep K"},{"full_name":"Gautham, Namasivayam","first_name":"Namasivayam","last_name":"Gautham"},{"first_name":"Anju","last_name":"Chadha","full_name":"Chadha, Anju"}]},{"author":[{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"first_name":"Rasmus","last_name":"Tamstorf","full_name":"Tamstorf, Rasmus"},{"full_name":"Bradley, Derek J","last_name":"Bradley","first_name":"Derek"},{"full_name":"Schvartzman, Sara C","first_name":"Sara","last_name":"Schvartzman"},{"last_name":"Thomaszewski","first_name":"Bernhard","full_name":"Thomaszewski, Bernhard"},{"full_name":"Bernd Bickel","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"last_name":"Matusik","first_name":"Wojciech","full_name":"Matusik, Wojciech"},{"full_name":"Marschner, Steve","last_name":"Marschner","first_name":"Steve"},{"first_name":"Miguel","last_name":"Otaduy","full_name":"Otaduy, Miguel A"}],"quality_controlled":0,"publisher":"ACM","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"}],"volume":32,"date_created":"2018-12-11T11:55:47Z","issue":"6","doi":"10.1145/2508363.2508389 ","month":"11","date_updated":"2021-01-12T06:55:23Z","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>","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>","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.","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>.","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)."},"extern":1,"status":"public","type":"journal_article","publication":"ACM Transactions on Graphics","date_published":"2013-11-01T00:00:00Z","year":"2013","_id":"2112","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).","intvolume":"        32","publist_id":"4923","publication_status":"published","title":"Modeling and estimation of internal friction in cloth","day":"01"},{"doi":"10.1109/MCG.2013.82 ","date_updated":"2021-01-12T06:55:23Z","month":"09","page":"48 - 57","publisher":"IEEE","quality_controlled":0,"author":[{"full_name":"Rouiller, Olivier","last_name":"Rouiller","first_name":"Olivier"},{"full_name":"Bernd Bickel","last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kautz, Jan","first_name":"Jan","last_name":"Kautz"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"},{"first_name":"Marc","last_name":"Alexa","full_name":"Alexa, Marc"}],"issue":"6","date_created":"2018-12-11T11:55:47Z","volume":33,"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."}],"_id":"2113","day":"23","publication_status":"published","title":"3D printing spatially varying BRDFs","publist_id":"4920","intvolume":"        33","status":"public","extern":1,"citation":{"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>","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.","short":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 48–57.","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>.","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>"},"year":"2013","date_published":"2013-09-23T00:00:00Z","publication":"IEEE Computer Graphics and Applications","type":"journal_article"},{"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"}],"volume":33,"date_created":"2018-12-11T11:55:48Z","issue":"6","author":[{"full_name":"Bernd Bickel","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"full_name":"Alexa, Marc","last_name":"Alexa","first_name":"Marc"}],"quality_controlled":0,"page":"24 - 25","publisher":"IEEE","month":"12","date_updated":"2021-01-12T06:55:24Z","doi":"10.1109/MCG.2013.89","publication":"IEEE Computer Graphics and Applications","type":"journal_article","date_published":"2013-12-01T00:00:00Z","year":"2013","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.","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>.","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>"},"extern":1,"status":"public","intvolume":"        33","publist_id":"4921","publication_status":"published","title":"Computational aspects of fabrication: Modeling, design and 3d printing","day":"01","_id":"2114"},{"date_published":"2013-11-18T00:00:00Z","type":"journal_article","publication":"Electronic Journal of Probability","year":"2013","citation":{"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>.","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>","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).","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>"},"status":"public","extern":1,"publist_id":"4917","intvolume":"        18","day":"18","title":"Poisson stochastic integration in Banach spaces","publication_status":"published","_id":"2117","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","volume":18,"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"}],"date_created":"2018-12-11T11:55:49Z","quality_controlled":0,"author":[{"full_name":"Dirksen, Sjoerd","first_name":"Sjoerd","last_name":"Dirksen"},{"first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","last_name":"Maas","full_name":"Jan Maas"},{"full_name":"van Neerven, Jan M","first_name":"Jan","last_name":"Van Neerven"}],"publisher":"Institute of Mathematical Statistics","date_updated":"2021-01-12T06:55:24Z","month":"11","oa":1,"doi":"10.1214/EJP.v18-2945 ","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.7901 "}]},{"date_created":"2018-12-11T11:55:53Z","issue":"2","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"}],"volume":45,"page":"879 - 899","publisher":"Society for Industrial and Applied Mathematics ","author":[{"first_name":"Nicola","last_name":"Gigli","full_name":"Gigli, Nicola"},{"full_name":"Jan Maas","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan"}],"quality_controlled":0,"oa":1,"month":"01","date_updated":"2021-01-12T06:55:29Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.6501"}],"doi":"10.1137/120886315 ","year":"2013","type":"journal_article","publication":"SIAM Journal on Mathematical Analysis","date_published":"2013-01-01T00:00:00Z","extern":1,"status":"public","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>","short":"N. Gigli, J. Maas, SIAM Journal on Mathematical Analysis 45 (2013) 879–899.","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>.","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>.","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.","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>","ista":"Gigli N, Maas J. 2013. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 45(2), 879–899."},"title":"Gromov-Hausdorff convergence of discrete transportation metrics","publication_status":"published","day":"01","intvolume":"        45","publist_id":"4904","acknowledgement":"JM acknowledges support by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","_id":"2129"},{"publisher":"Frontiers Media","author":[{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Mikhail Lemeshko"}],"quality_controlled":0,"date_created":"2018-12-11T11:55:56Z","issue":"17","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"}],"volume":1,"main_file_link":[{"url":"http://arxiv.org/abs/1307.8129","open_access":"1"}],"doi":"10.3389/fphy.2013.00017","month":"10","oa":1,"date_updated":"2021-01-12T06:55:32Z","extern":1,"status":"public","citation":{"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>.","short":"M. Lemeshko, Frontiers Physics 1 (2013).","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>","ista":"Lemeshko M. 2013. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 1(17).","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>.","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>"},"year":"2013","publication":"Frontiers Physics","type":"journal_article","date_published":"2013-10-07T00:00:00Z","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","_id":"2139","publication_status":"published","title":"Manipulating scattering of ultracold atoms with light-induced dissipation","day":"07","publist_id":"4885","intvolume":"         1"},{"date_created":"2018-12-11T11:56:11Z","file":[{"relation":"main_file","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","checksum":"adf465e70948f4e80e48057524516456","access_level":"open_access","date_created":"2018-12-12T10:14:33Z","file_id":"5086","content_type":"application/pdf","file_size":294689,"date_updated":"2020-07-14T12:45:31Z","creator":"system"}],"project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"name":"Moderne Concurrency Paradigms","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23"}],"scopus_import":1,"author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Kirsch, Christoph","last_name":"Kirsch","first_name":"Christoph"},{"first_name":"Hannes","last_name":"Payer","full_name":"Payer, Hannes"},{"last_name":"Sezgin","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","first_name":"Ali","full_name":"Sezgin, Ali"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"page":"317 - 328","file_date_updated":"2020-07-14T12:45:31Z","month":"01","date_updated":"2023-02-21T16:06:49Z","conference":{"end_date":"2013-01-25","start_date":"2013-01-23","location":"Rome, Italy","name":"POPL: Principles of Programming Languages"},"related_material":{"record":[{"relation":"later_version","id":"10901","status":"deleted"}]},"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","year":"2013","citation":{"apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>","ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>.","short":"T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328."},"publist_id":"4801","publication_status":"published","language":[{"iso":"eng"}],"abstract":[{"text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.","lang":"eng"}],"pubrep_id":"198","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"ACM","oa":1,"doi":"10.1145/2429069.2429109","has_accepted_license":"1","oa_version":"Submitted Version","type":"conference","date_published":"2013-01-01T00:00:00Z","status":"public","ec_funded":1,"title":"Quantitative relaxation of concurrent data structures","day":"01","department":[{"_id":"ToHe"}],"ddc":["000","004"],"_id":"2181","acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","publication_identifier":{"isbn":["978-1-4503-1832-7"]}},{"conference":{"name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","start_date":"2013-07-23","location":"Rome, Italy"},"month":"01","date_updated":"2024-10-09T20:55:21Z","oa_version":"None","doi":"10.1145/2429069.2429085","date_created":"2018-12-11T11:56:11Z","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"scopus_import":1,"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."}],"publisher":"ACM","corr_author":"1","page":"115 - 128","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","title":"Quantitative abstraction refinement","publication_status":"published","day":"01","ec_funded":1,"publist_id":"4800","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"_id":"2182","year":"2013","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","type":"conference","date_published":"2013-01-01T00:00:00Z","status":"public","citation":{"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>.","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.","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.","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>","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>.","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>"}},{"year":"2013","date_published":"2013-04-08T00:00:00Z","publication":"Physical Review Letters","type":"journal_article","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1103/PhysRevLett.111.239901"}]},"status":"public","extern":"1","article_processing_charge":"No","citation":{"apa":"Bhongale, S., Mathey, L., Zhao, E., Yelin, S., &#38; Lemeshko, M. (2013). Quantum phases of quadrupolar fermi gases in optical lattices. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.110.155301\">https://doi.org/10.1103/PhysRevLett.110.155301</a>","chicago":"Bhongale, Satyan, Ludwig Mathey, Erhai Zhao, Susanne Yelin, and Mikhail Lemeshko. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” <i>Physical Review Letters</i>. American Physical Society, 2013. <a href=\"https://doi.org/10.1103/PhysRevLett.110.155301\">https://doi.org/10.1103/PhysRevLett.110.155301</a>.","short":"S. Bhongale, L. Mathey, E. Zhao, S. Yelin, M. Lemeshko, Physical Review Letters 110 (2013).","ieee":"S. Bhongale, L. Mathey, E. Zhao, S. Yelin, and M. Lemeshko, “Quantum phases of quadrupolar fermi gases in optical lattices,” <i>Physical Review Letters</i>, vol. 110, no. 15. American Physical Society, 2013.","ama":"Bhongale S, Mathey L, Zhao E, Yelin S, Lemeshko M. Quantum phases of quadrupolar fermi gases in optical lattices. <i>Physical Review Letters</i>. 2013;110(15). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.155301\">10.1103/PhysRevLett.110.155301</a>","ista":"Bhongale S, Mathey L, Zhao E, Yelin S, Lemeshko M. 2013. Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. 110(15).","mla":"Bhongale, Satyan, et al. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” <i>Physical Review Letters</i>, vol. 110, no. 15, American Physical Society, 2013, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.110.155301\">10.1103/PhysRevLett.110.155301</a>."},"day":"08","title":"Quantum phases of quadrupolar fermi gases in optical lattices","publication_status":"published","intvolume":"       110","publist_id":"4769","language":[{"iso":"eng"}],"_id":"2204","issue":"15","date_created":"2018-12-11T11:56:18Z","volume":110,"abstract":[{"lang":"eng","text":"We introduce a new platform for quantum simulation of many-body systems based on nonspherical atoms or molecules with zero dipole moments but possessing a significant value of electric quadrupole moments. We consider a quadrupolar Fermi gas trapped in a 2D square optical lattice, and show that the peculiar symmetry and broad tunability of the quadrupole-quadrupole interaction results in a rich phase diagram encompassing unconventional BCS and charge density wave phases, and opens up a perspective to create a topological superfluid. Quadrupolar species, such as metastable alkaline-earth atoms and homonuclear molecules, are stable against chemical reactions and collapse and are readily available in experiment at high densities."}],"publisher":"American Physical Society","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"first_name":"Satyan","last_name":"Bhongale","full_name":"Bhongale, Satyan"},{"full_name":"Mathey, Ludwig","first_name":"Ludwig","last_name":"Mathey"},{"last_name":"Zhao","first_name":"Erhai","full_name":"Zhao, Erhai"},{"first_name":"Susanne","last_name":"Yelin","full_name":"Yelin, Susanne"},{"full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"date_updated":"2021-11-16T08:04:06Z","oa":1,"month":"04","oa_version":"None","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1211.3317"}],"doi":"10.1103/PhysRevLett.110.155301"},{"acknowledgement":"National Science Foundation; Natural Sciences and Engineering Research Council of Canada","_id":"2205","publication_status":"published","title":"Manipulation of molecules with electromagnetic fields","day":"01","intvolume":"       111","publist_id":"4768","extern":1,"status":"public","citation":{"short":"M. Lemeshko, R. Krems, J. Doyle, S. Kais, Molecular Physics 111 (2013) 1648–1682.","chicago":"Lemeshko, Mikhail, Roman Krems, John Doyle, and Sabre Kais. “Manipulation of Molecules with Electromagnetic Fields.” <i>Molecular Physics</i>. Taylor &#38; Francis, 2013. <a href=\"https://doi.org/10.1080/00268976.2013.813595\">https://doi.org/10.1080/00268976.2013.813595</a>.","ista":"Lemeshko M, Krems R, Doyle J, Kais S. 2013. Manipulation of molecules with electromagnetic fields. Molecular Physics. 111(12–13), 1648–1682.","ama":"Lemeshko M, Krems R, Doyle J, Kais S. Manipulation of molecules with electromagnetic fields. <i>Molecular Physics</i>. 2013;111(12-13):1648-1682. doi:<a href=\"https://doi.org/10.1080/00268976.2013.813595\">10.1080/00268976.2013.813595</a>","ieee":"M. Lemeshko, R. Krems, J. Doyle, and S. Kais, “Manipulation of molecules with electromagnetic fields,” <i>Molecular Physics</i>, vol. 111, no. 12–13. Taylor &#38; Francis, pp. 1648–1682, 2013.","mla":"Lemeshko, Mikhail, et al. “Manipulation of Molecules with Electromagnetic Fields.” <i>Molecular Physics</i>, vol. 111, no. 12–13, Taylor &#38; Francis, 2013, pp. 1648–82, doi:<a href=\"https://doi.org/10.1080/00268976.2013.813595\">10.1080/00268976.2013.813595</a>.","apa":"Lemeshko, M., Krems, R., Doyle, J., &#38; Kais, S. (2013). Manipulation of molecules with electromagnetic fields. <i>Molecular Physics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00268976.2013.813595\">https://doi.org/10.1080/00268976.2013.813595</a>"},"year":"2013","publication":"Molecular Physics","type":"review","date_published":"2013-07-01T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1306.0912","open_access":"1"}],"doi":"10.1080/00268976.2013.813595","oa":1,"month":"07","date_updated":"2020-07-14T12:45:32Z","page":"1648 - 1682","publisher":"Taylor & Francis","author":[{"full_name":"Mikhail Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"},{"last_name":"Krems","first_name":"Roman","full_name":"Krems, Roman V"},{"full_name":"Doyle, John M","last_name":"Doyle","first_name":"John"},{"full_name":"Kais, Sabre","last_name":"Kais","first_name":"Sabre"}],"quality_controlled":0,"date_created":"2018-12-11T11:56:19Z","issue":"12-13","abstract":[{"lang":"eng","text":"The goal of the present article is to review the major developments that have led to the current understanding of molecule-field interactions and experimental methods for manipulating molecules with electromagnetic fields. Molecule-field interactions are at the core of several, seemingly distinct areas of molecular physics. This is reflected in the organisation of this article, which includes sections on field control of molecular beams, external field traps for cold molecules, control of molecular orientation and molecular alignment, manipulation of molecules by non-conservative forces, ultracold molecules and ultracold chemistry, controlled many-body phenomena, entanglement of molecules and dipole arrays, and stability of molecular systems in high-frequency super-intense laser fields. The article contains 852 references."}],"volume":111},{"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.1130"}],"doi":"10.1103/PhysRevB.88.014426","date_updated":"2021-01-12T06:55:59Z","month":"07","oa":1,"publisher":"American Physical Society","quality_controlled":0,"author":[{"full_name":"Mikhail Lemeshko","last_name":"Lemeshko","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"last_name":"Yao","first_name":"Norman","full_name":"Yao, Norman Y"},{"first_name":"Alexey","last_name":"Gorshkov","full_name":"Gorshkov, Alexey V"},{"full_name":"Weimer, Hendrik","first_name":"Hendrik","last_name":"Weimer"},{"last_name":"Bennett","first_name":"Steven","full_name":"Bennett, Steven D"},{"last_name":"Momose","first_name":"Takamasa","full_name":"Momose, Takamasa"},{"first_name":"Sarang","last_name":"Gopalakrishnan","full_name":"Gopalakrishnan, Sarang"}],"issue":"1","date_created":"2018-12-11T11:56:19Z","volume":88,"abstract":[{"lang":"eng","text":"Magnetic impurities embedded in inert solids can exhibit long coherence times and interact with one another via their intrinsic anisotropic dipolar interaction. We argue that, as a consequence of these properties, disordered ensembles of magnetic impurities provide an effective platform for realizing a controllable, tunable version of the dipolar quantum spin glass seen in LiHoxY1-xF4. Specifically, we propose and analyze a system composed of dysprosium atoms embedded in solid helium. We describe the phase diagram of the system and discuss the realizability and detectability of the quantum spin glass and antiglass phases."}],"_id":"2206","day":"24","title":"Controllable quantum spin glasses with magnetic impurities embedded in quantum solids","publication_status":"published","publist_id":"4767","intvolume":"        88","status":"public","extern":1,"citation":{"chicago":"Lemeshko, Mikhail, Norman Yao, Alexey Gorshkov, Hendrik Weimer, Steven Bennett, Takamasa Momose, and Sarang Gopalakrishnan. “Controllable Quantum Spin Glasses with Magnetic Impurities Embedded in Quantum Solids.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society, 2013. <a href=\"https://doi.org/10.1103/PhysRevB.88.014426\">https://doi.org/10.1103/PhysRevB.88.014426</a>.","short":"M. Lemeshko, N. Yao, A. Gorshkov, H. Weimer, S. Bennett, T. Momose, S. Gopalakrishnan, Physical Review B - Condensed Matter and Materials Physics 88 (2013).","mla":"Lemeshko, Mikhail, et al. “Controllable Quantum Spin Glasses with Magnetic Impurities Embedded in Quantum Solids.” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 88, no. 1, American Physical Society, 2013, doi:<a href=\"https://doi.org/10.1103/PhysRevB.88.014426\">10.1103/PhysRevB.88.014426</a>.","ista":"Lemeshko M, Yao N, Gorshkov A, Weimer H, Bennett S, Momose T, Gopalakrishnan S. 2013. Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. 88(1).","ieee":"M. Lemeshko <i>et al.</i>, “Controllable quantum spin glasses with magnetic impurities embedded in quantum solids,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol. 88, no. 1. American Physical Society, 2013.","ama":"Lemeshko M, Yao N, Gorshkov A, et al. Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2013;88(1). doi:<a href=\"https://doi.org/10.1103/PhysRevB.88.014426\">10.1103/PhysRevB.88.014426</a>","apa":"Lemeshko, M., Yao, N., Gorshkov, A., Weimer, H., Bennett, S., Momose, T., &#38; Gopalakrishnan, S. (2013). Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. <i>Physical Review B - Condensed Matter and Materials Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.88.014426\">https://doi.org/10.1103/PhysRevB.88.014426</a>"},"year":"2013","date_published":"2013-07-24T00:00:00Z","type":"journal_article","publication":"Physical Review B - Condensed Matter and Materials Physics"},{"citation":{"short":"M. Lemeshko, H. Weimer, Nature Communications 4 (2013).","chicago":"Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” <i>Nature Communications</i>. Nature Publishing Group, 2013. <a href=\"https://doi.org/10.1038/ncomms3230\">https://doi.org/10.1038/ncomms3230</a>.","ista":"Lemeshko M, Weimer H. 2013. Dissipative binding of atoms by non-conservative forces. Nature Communications. 4.","ama":"Lemeshko M, Weimer H. Dissipative binding of atoms by non-conservative forces. <i>Nature Communications</i>. 2013;4. doi:<a href=\"https://doi.org/10.1038/ncomms3230\">10.1038/ncomms3230</a>","ieee":"M. Lemeshko and H. Weimer, “Dissipative binding of atoms by non-conservative forces,” <i>Nature Communications</i>, vol. 4. Nature Publishing Group, 2013.","mla":"Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” <i>Nature Communications</i>, vol. 4, Nature Publishing Group, 2013, doi:<a href=\"https://doi.org/10.1038/ncomms3230\">10.1038/ncomms3230</a>.","apa":"Lemeshko, M., &#38; Weimer, H. (2013). Dissipative binding of atoms by non-conservative forces. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms3230\">https://doi.org/10.1038/ncomms3230</a>"},"extern":1,"status":"public","publication":"Nature Communications","type":"journal_article","date_published":"2013-07-30T00:00:00Z","year":"2013","_id":"2207","intvolume":"         4","publist_id":"4766","title":"Dissipative binding of atoms by non-conservative forces","publication_status":"published","day":"30","author":[{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","full_name":"Mikhail Lemeshko"},{"last_name":"Weimer","first_name":"Hendrik","full_name":"Weimer, Hendrik"}],"quality_controlled":0,"publisher":"Nature Publishing Group","abstract":[{"lang":"eng","text":"The formation of molecules and supramolecular structures results from bonding by conservative forces acting among electrons and nuclei and giving rise to equilibrium configurations defined by minima of the interaction potential. Here we show that bonding can also occur by the non-conservative forces responsible for interaction-induced coherent population trapping. The bound state arises in a dissipative process and manifests itself as a stationary state at a preordained interatomic distance. Remarkably, such a dissipative bonding is present even when the interactions among the atoms are purely repulsive. The dissipative bound states can be created and studied spectroscopically in present-day experiments with ultracold atoms or molecules and can potentially serve for cooling strongly interacting quantum gases."}],"volume":4,"date_created":"2018-12-11T11:56:20Z","doi":"10.1038/ncomms3230","main_file_link":[{"url":"http://arxiv.org/abs/1211.4035","open_access":"1"}],"oa":1,"month":"07","date_updated":"2021-01-12T06:55:59Z"},{"citation":{"apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Recognizing straight skeletons and Voronoi diagrams and reconstructing their input (pp. 37–46). Presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia: IEEE. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>","ista":"Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46.","ama":"Biedl T, Held M, Huber S. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. In: IEEE; 2013:37-46. doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>","ieee":"T. Biedl, M. Held, and S. Huber, “Recognizing straight skeletons and Voronoi diagrams and reconstructing their input,” presented at the ISVD: Voronoi Diagrams in Science and Engineering, St. Petersburg, Russia, 2013, pp. 37–46.","mla":"Biedl, Therese, et al. <i>Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input</i>. IEEE, 2013, pp. 37–46, doi:<a href=\"https://doi.org/10.1109/ISVD.2013.11\">10.1109/ISVD.2013.11</a>.","chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. <a href=\"https://doi.org/10.1109/ISVD.2013.11\">https://doi.org/10.1109/ISVD.2013.11</a>.","short":"T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46."},"article_processing_charge":"No","status":"public","alternative_title":["2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) "],"date_published":"2013-12-01T00:00:00Z","type":"conference","year":"2013","_id":"2209","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["978-0-7695-5037-4 "]},"external_id":{"isi":["000430602800007"]},"publist_id":"4763","day":"01","publication_status":"published","title":"Recognizing straight skeletons and Voronoi diagrams and reconstructing their input","quality_controlled":"1","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"full_name":"Huber, Stefan","last_name":"Huber","orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"IEEE","page":"37 - 46","abstract":[{"lang":"eng","text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon or planar straight-line graph. In this paper, we ask the reverse question: Given the straight skeleton (in form of a planar straight-line graph, with some rays to infinity), can we reconstruct a planar straight-line graph for which this was the straight skeleton? We show how to reduce this problem to the problem of finding a line that intersects a set of convex polygons. We can find these convex polygons and all such lines in $O(nlog n)$ time in the Real RAM computer model, where $n$ denotes the number of edges of the input graph. We also explain how our approach can be used for recognizing Voronoi diagrams of points, thereby completing a partial solution provided by Ash and Bolker in 1985.\r\n"}],"scopus_import":"1","date_created":"2018-12-11T11:56:20Z","doi":"10.1109/ISVD.2013.11","oa_version":"None","date_updated":"2025-09-29T14:30:56Z","isi":1,"month":"12","conference":{"location":"St. Petersburg, Russia","end_date":"2013-07-10","start_date":"2013-07-08","name":"ISVD: Voronoi Diagrams in Science and Engineering"}},{"date_published":"2013-03-01T00:00:00Z","publication":"29th European Workshop on Computational Geometry","type":"conference","year":"2013","citation":{"chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In <i>29th European Workshop on Computational Geometry</i>, 95–98. TU Braunschweig, 2013.","short":"T. Biedl, M. Held, S. Huber, in:, 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","mla":"Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” <i>29th European Workshop on Computational Geometry</i>, TU Braunschweig, 2013, pp. 95–98.","ista":"Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.","ama":"Biedl T, Held M, Huber S. Reconstructing polygons from embedded straight skeletons. In: <i>29th European Workshop on Computational Geometry</i>. TU Braunschweig; 2013:95-98.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in <i>29th European Workshop on Computational Geometry</i>, Braunschweig, Germany, 2013, pp. 95–98.","apa":"Biedl, T., Held, M., &#38; Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In <i>29th European Workshop on Computational Geometry</i> (pp. 95–98). Braunschweig, Germany: TU Braunschweig."},"status":"public","publist_id":"4762","day":"01","title":"Reconstructing polygons from embedded straight skeletons","publication_status":"published","_id":"2210","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"abstract":[{"text":"A straight skeleton is a well-known geometric structure, and several algorithms exist to construct the straight skeleton for a given polygon. In this paper, we ask the reverse question: Given the straight skeleton (in form of a tree with a drawing in the plane, but with the exact position of the leaves unspecified), can we reconstruct the polygon? We show that in most cases there exists at most one polygon; in the remaining case there is an infinite number of polygons determined by one angle that can range in an interval. We can find this (set of) polygon(s) in linear time in the Real RAM computer model.","lang":"eng"}],"date_created":"2018-12-11T11:56:21Z","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"full_name":"Held, Martin","last_name":"Held","first_name":"Martin"},{"full_name":"Huber, Stefan","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814","first_name":"Stefan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"TU Braunschweig","page":"95 - 98","date_updated":"2021-01-12T06:56:00Z","month":"03","oa":1,"conference":{"name":"EuroCG: European Workshop on Computational Geometry","start_date":"2013-03-17","end_date":"2013-03-20","location":"Braunschweig, Germany"},"oa_version":"Submitted Version","main_file_link":[{"open_access":"1","url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf"}]},{"language":[{"iso":"eng"}],"publist_id":"4724","publication_status":"published","citation":{"chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>.","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","mla":"Blanc, Régis, et al. <i>Tree Interpolation in Vampire</i>. Vol. 8312, Springer, 2013, pp. 173–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>.","ista":"Blanc R, Gupta A, Kovács L, Kragl B. 2013. Tree interpolation in Vampire. 8312, 173–181.","ieee":"R. Blanc, A. Gupta, L. Kovács, and B. Kragl, “Tree interpolation in Vampire,” vol. 8312. Springer, pp. 173–181, 2013.","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>","apa":"Blanc, R., Gupta, A., Kovács, L., &#38; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>"},"series_title":"Lecture Notes in Computer Science","year":"2013","month":"01","date_updated":"2020-08-11T10:09:42Z","conference":{"location":"Stellenbosch, South Africa","start_date":"2013-12-14","end_date":"2013-12-19","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"author":[{"last_name":"Blanc","first_name":"Régis","full_name":"Blanc, Régis"},{"first_name":"Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"},{"orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl","full_name":"Kragl, Bernhard"}],"page":"173 - 181","file_date_updated":"2020-07-14T12:45:34Z","volume":8312,"date_created":"2018-12-11T11:56:29Z","file":[{"file_id":"7858","content_type":"application/pdf","date_created":"2020-05-15T11:10:40Z","access_level":"open_access","checksum":"9cebaafca032e6769d273f393305c705","file_name":"2013_LPAR_Blanc.pdf","relation":"main_file","creator":"dernst","date_updated":"2020-07-14T12:45:34Z","file_size":279206}],"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"}],"scopus_import":1,"department":[{"_id":"ToHe"}],"_id":"2237","ddc":["000"],"intvolume":"      8312","title":"Tree interpolation in Vampire","day":"14","article_processing_charge":"No","status":"public","type":"conference","date_published":"2013-01-14T00:00:00Z","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-45221-5_13","oa_version":"Submitted Version","has_accepted_license":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publisher":"Springer","abstract":[{"text":"We describe new extensions of the Vampire theorem prover for computing tree interpolants. These extensions generalize Craig interpolation in Vampire, and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.","lang":"eng"}]},{"status":"public","date_published":"2013-12-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","_id":"2238","department":[{"_id":"KrCh"}],"intvolume":"      8312","ec_funded":1,"day":"01","title":"Multi-objective discounted reward verification in graphs and MDPs","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","abstract":[{"lang":"eng","text":"We study the problem of achieving a given value in Markov decision processes (MDPs) with several independent discounted reward objectives. We consider a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at different and variable rates.\r\n\r\nWe establish results for two prominent subclasses of the problem, namely state-discount models where the discount factors are only dependent on the state of the MDP (and independent of the objective), and reward-discount models where they are only dependent on the objective (but not on the state of the MDP). For the state-discount models we use a straightforward reduction to expected total reward and show that the problem whether a value is achievable can be solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way.\r\n\r\nFor the general case, we show that when restricted to graphs (i.e. MDPs with no randomisation), pure strategies and discount factors of the form 1/n where n is an integer, the problem is in PSPACE and finite memory suffices for achieving a given value. We also show that when the discount factors are not of the form 1/n, the memory required by a strategy can be infinite.\r\n"}],"doi":"10.1007/978-3-642-45221-5_17","oa_version":"None","citation":{"short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","chicago":"Chatterjee, Krishnendu, Vojtěch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>.","ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>","ieee":"K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.","ista":"Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.","mla":"Chatterjee, Krishnendu, et al. <i>Multi-Objective Discounted Reward Verification in Graphs and MDPs</i>. Vol. 8312, Springer, 2013, pp. 228–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">10.1007/978-3-642-45221-5_17</a>.","apa":"Chatterjee, K., Forejt, V., &#38; Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_17\">https://doi.org/10.1007/978-3-642-45221-5_17</a>"},"series_title":"Lecture Notes in Computer Science","year":"2013","language":[{"iso":"eng"}],"publist_id":"4723","publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"last_name":"Forejt","first_name":"Vojtěch","full_name":"Forejt, Vojtěch"},{"last_name":"Wojtczak","first_name":"Dominik","full_name":"Wojtczak, Dominik"}],"page":"228 - 242","volume":8312,"scopus_import":1,"project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_created":"2018-12-11T11:56:30Z","date_updated":"2020-08-11T10:09:42Z","month":"12","conference":{"name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Stellenbosch, South Africa","start_date":"2013-12-14","end_date":"2013-12-19"}},{"date_published":"2013-09-01T00:00:00Z","alternative_title":["LIPIcs"],"type":"conference","status":"public","day":"01","title":"Elementary modal logics over transitive structures","ec_funded":1,"intvolume":"        23","ddc":["000","004"],"_id":"2243","department":[{"_id":"ToHe"}],"pubrep_id":"136","abstract":[{"lang":"eng","text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME."}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"oa_version":"Published Version","has_accepted_license":"1","doi":"10.4230/LIPIcs.CSL.2013.563","year":"2013","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"},"series_title":"Leibniz International Proceedings in Informatics","citation":{"chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>.","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>.","ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>"},"publication_status":"published","publist_id":"4708","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"}],"scopus_import":1,"file":[{"date_updated":"2020-07-14T12:45:34Z","creator":"system","file_size":454915,"checksum":"e0732e73a8b1e39483df7717d53e3e35","access_level":"open_access","date_created":"2018-12-12T10:12:11Z","file_id":"4929","content_type":"application/pdf","relation":"main_file","file_name":"IST-2016-136-v1+2_39.pdf"}],"date_created":"2018-12-11T11:56:32Z","volume":23,"page":"563 - 577","file_date_updated":"2020-07-14T12:45:34Z","author":[{"first_name":"Jakub","last_name":"Michaliszyn","full_name":"Michaliszyn, Jakub"},{"full_name":"Otop, Jan","first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop"}],"conference":{"end_date":"2013-09-05","start_date":"2013-09-02","location":"Torino, Italy","name":"CSL: Computer Science Logic"},"date_updated":"2020-08-11T10:09:42Z","month":"09"}]