[{"day":"27","month":"08","date_published":"2013-08-27T00:00:00Z","doi":"10.1371/journal.pbio.1001643","quality_controlled":0,"publication":"PLoS Biology","citation":{"short":"B. Vicoso, J. Emerson, Y. Zektser, S. Mahajan, D. Bachtrog, PLoS Biology 11 (2013).","mla":"Vicoso, Beatriz, et al. “Comparative Sex Chromosome Genomics in Snakes: Differentiation Evolutionary Strata and Lack of Global Dosage Compensation.” PLoS Biology, vol. 11, no. 8, Public Library of Science, 2013, doi:10.1371/journal.pbio.1001643.","chicago":"Vicoso, Beatriz, Jr Emerson, Yulia Zektser, Shivani Mahajan, and Doris Bachtrog. “Comparative Sex Chromosome Genomics in Snakes: Differentiation Evolutionary Strata and Lack of Global Dosage Compensation.” PLoS Biology. Public Library of Science, 2013. https://doi.org/10.1371/journal.pbio.1001643.","ama":"Vicoso B, Emerson J, Zektser Y, Mahajan S, Bachtrog D. Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation. PLoS Biology. 2013;11(8). doi:10.1371/journal.pbio.1001643","ieee":"B. Vicoso, J. Emerson, Y. Zektser, S. Mahajan, and D. Bachtrog, “Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation,” PLoS Biology, vol. 11, no. 8. Public Library of Science, 2013.","apa":"Vicoso, B., Emerson, J., Zektser, Y., Mahajan, S., & Bachtrog, D. (2013). Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation. PLoS Biology. Public Library of Science. https://doi.org/10.1371/journal.pbio.1001643","ista":"Vicoso B, Emerson J, Zektser Y, Mahajan S, Bachtrog D. 2013. Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation. PLoS Biology. 11(8)."},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"extern":1,"abstract":[{"lang":"eng","text":"Snakes exhibit genetic sex determination, with female heterogametic sex chromosomes (ZZ males, ZW females). Extensive cytogenetic work has suggested that the level of sex chromosome heteromorphism varies among species, with Boidae having entirely homomorphic sex chromosomes, Viperidae having completely heteromorphic sex chromosomes, and Colubridae showing partial differentiation. Here, we take a genomic approach to compare sex chromosome differentiation in these three snake families. We identify homomorphic sex chromosomes in boas (Boidae), but completely heteromorphic sex chromosomes in both garter snakes (Colubridae) and pygmy rattlesnake (Viperidae). Detection of W-linked gametologs enables us to establish the presence of evolutionary strata on garter and pygmy rattlesnake sex chromosomes where recombination was abolished at different time points. Sequence analysis shows that all strata are shared between pygmy rattlesnake and garter snake, i.e., recombination was abolished between the sex chromosomes before the two lineages diverged. The sex-biased transmission of the Z and its hemizygosity in females can impact patterns of molecular evolution, and we show that rates of evolution for Z-linked genes are increased relative to their pseudoautosomal homologs, both at synonymous and amino acid sites (even after controlling for mutational biases). This demonstrates that mutation rates are male-biased in snakes (male-driven evolution), but also supports faster-Z evolution due to differential selective effects on the Z. Finally, we perform a transcriptome analysis in boa and pygmy rattlesnake to establish baseline levels of sex-biased expression in homomorphic sex chromosomes, and show that heteromorphic ZW chromosomes in rattlesnakes lack chromosome-wide dosage compensation. Our study provides the first full scale overview of the evolution of snake sex chromosomes at the genomic level, thus greatly expanding our knowledge of reptilian and vertebrate sex chromosomes evolution.\n"}],"issue":"8","publist_id":"4962","type":"journal_article","date_created":"2018-12-11T11:55:34Z","date_updated":"2021-01-12T06:55:09Z","volume":11,"author":[{"last_name":"Vicoso","first_name":"Beatriz","orcid":"0000-0002-4579-8306","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Beatriz Vicoso"},{"full_name":"Emerson, Jr J.","first_name":"Jr","last_name":"Emerson"},{"last_name":"Zektser","first_name":"Yulia","full_name":"Zektser, Yulia"},{"full_name":"Mahajan, Shivani","last_name":"Mahajan","first_name":"Shivani"},{"last_name":"Bachtrog","first_name":"Doris","full_name":"Bachtrog, Doris"}],"title":"Comparative sex chromosome genomics in snakes: Differentiation evolutionary strata and lack of global dosage compensation","status":"public","publication_status":"published","intvolume":" 11","publisher":"Public Library of Science","_id":"2076","acknowledgement":"Funded by NIH grants (R01GM076007 and R01GM093182) and a Packard Fellowship to DB.","year":"2013"},{"issue":"4","publist_id":"4927","abstract":[{"lang":"eng","text":"We present an interactive design system that allows non-expert users to create animated mechanical characters. Given an articulated character as input, the user iteratively creates an animation by sketching motion curves indicating how different parts of the character should move. For each motion curve, our framework creates an optimized mechanism that reproduces it as closely as possible. The resulting mechanisms are attached to the character and then connected to each other using gear trains, which are created in a semi-automated fashion. The mechanical assemblies generated with our system can be driven with a single input driver, such as a hand-operated crank or an electric motor, and they can be fabricated using rapid prototyping devices. We demonstrate the versatility of our approach by designing a wide range of mechanical characters, several of which we manufactured using 3D printing. While our pipeline is designed for characters driven by planar mechanisms, significant parts of it extend directly to non-planar mechanisms, allowing us to create characters with compelling 3D motions. "}],"extern":1,"type":"journal_article","author":[{"last_name":"Coros","first_name":"Stelian","full_name":"Coros, Stelian"},{"full_name":"Thomaszewski, Bernhard","first_name":"Bernhard","last_name":"Thomaszewski"},{"first_name":"Gioacchino","last_name":"Noris","full_name":"Noris, Gioacchino"},{"last_name":"Sueda","first_name":"Shinjiro","full_name":"Sueda, Shinjiro"},{"full_name":"Forberg, Moira","last_name":"Forberg","first_name":"Moira"},{"full_name":"Sumner, Robert W","last_name":"Sumner","first_name":"Robert"},{"full_name":"Matusik, Wojciech","first_name":"Wojciech","last_name":"Matusik"},{"full_name":"Bernd Bickel","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"}],"volume":32,"date_created":"2018-12-11T11:55:46Z","date_updated":"2021-01-12T06:55:21Z","year":"2013","_id":"2108","publisher":"ACM","intvolume":" 32","status":"public","title":"Computational design of mechanical characters","publication_status":"published","day":"01","month":"07","date_published":"2013-07-01T00:00:00Z","doi":"10.1145/2461912.2461953","citation":{"ama":"Coros S, Thomaszewski B, Noris G, et al. Computational design of mechanical characters. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461953","apa":"Coros, S., Thomaszewski, B., Noris, G., Sueda, S., Forberg, M., Sumner, R., … Bickel, B. (2013). Computational design of mechanical characters. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461953","ieee":"S. Coros et al., “Computational design of mechanical characters,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.","ista":"Coros S, Thomaszewski B, Noris G, Sueda S, Forberg M, Sumner R, Matusik W, Bickel B. 2013. Computational design of mechanical characters. ACM Transactions on Graphics. 32(4).","short":"S. Coros, B. Thomaszewski, G. Noris, S. Sueda, M. Forberg, R. Sumner, W. Matusik, B. Bickel, ACM Transactions on Graphics 32 (2013).","mla":"Coros, Stelian, et al. “Computational Design of Mechanical Characters.” ACM Transactions on Graphics, vol. 32, no. 4, ACM, 2013, doi:10.1145/2461912.2461953.","chicago":"Coros, Stelian, Bernhard Thomaszewski, Gioacchino Noris, Shinjiro Sueda, Moira Forberg, Robert Sumner, Wojciech Matusik, and Bernd Bickel. “Computational Design of Mechanical Characters.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461953."},"publication":"ACM Transactions on Graphics","quality_controlled":0},{"day":"01","month":"07","citation":{"short":"M. Papas, C. Regg, W. Jarosz, B. Bickel, P. Jackson, W. Matusik, S. Marschner, M. Groß, ACM Transactions on Graphics 32 (2013).","mla":"Papas, Marios, et al. “Fabricating Translucent Materials Using Continuous Pigment Mixtures.” ACM Transactions on Graphics, vol. 32, no. 4, ACM, 2013, doi:10.1145/2461912.2461974.","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.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461974.","ama":"Papas M, Regg C, Jarosz W, et al. Fabricating translucent materials using continuous pigment mixtures. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461974","apa":"Papas, M., Regg, C., Jarosz, W., Bickel, B., Jackson, P., Matusik, W., … Groß, M. (2013). Fabricating translucent materials using continuous pigment mixtures. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461974","ieee":"M. Papas et al., “Fabricating translucent materials using continuous pigment mixtures,” ACM Transactions on Graphics, 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)."},"publication":"ACM Transactions on Graphics","quality_controlled":0,"date_published":"2013-07-01T00:00:00Z","doi":"10.1145/2461912.2461974","type":"journal_article","publist_id":"4925","issue":"4","abstract":[{"lang":"eng","text":"We present a method for practical physical reproduction and design of homogeneous materials with desired subsurface scattering. Our process uses a collection of different pigments that can be suspended in a clear base material. Our goal is to determine pigment concentrations that best reproduce the appearance and subsurface scattering of a given target material. In order to achieve this task we first fabricate a collection of material samples composed of known mixtures of the available pigments with the base material. We then acquire their reflectance profiles using a custom-built measurement device. We use the same device to measure the reflectance profile of a target material. Based on the database of mappings from pigment concentrations to reflectance profiles, we use an optimization process to compute the concentration of pigments to best replicate the target material appearance. We demonstrate the practicality of our method by reproducing a variety of different translucent materials. We also present a tool that allows the user to explore the range of achievable appearances for a given set of pigments. "}],"extern":1,"year":"2013","_id":"2110","intvolume":" 32","publisher":"ACM","publication_status":"published","status":"public","title":"Fabricating translucent materials using continuous pigment mixtures","author":[{"full_name":"Papas, Marios","first_name":"Marios","last_name":"Papas"},{"full_name":"Regg, Christian","first_name":"Christian","last_name":"Regg"},{"last_name":"Jarosz","first_name":"Wojciech","full_name":"Jarosz, Wojciech"},{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel"},{"full_name":"Jackson, Philip V","first_name":"Philip","last_name":"Jackson"},{"last_name":"Matusik","first_name":"Wojciech","full_name":"Matusik, Wojciech"},{"full_name":"Marschner, Steve","last_name":"Marschner","first_name":"Steve"},{"first_name":"Markus","last_name":"Groß","full_name":"Groß, Markus S"}],"volume":32,"date_created":"2018-12-11T11:55:46Z","date_updated":"2021-01-12T06:55:22Z"},{"author":[{"full_name":"Bermano, Amit H","last_name":"Bermano","first_name":"Amit"},{"full_name":"Bruschweiler, Philipp","last_name":"Bruschweiler","first_name":"Philipp"},{"full_name":"Grundhöfer, Anselm","first_name":"Anselm","last_name":"Grundhöfer"},{"last_name":"Iwai","first_name":"Daisuke","full_name":"Iwai, Daisuke"},{"full_name":"Bernd Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel"},{"first_name":"Markus","last_name":"Groß","full_name":"Groß, Markus S"}],"volume":32,"date_updated":"2021-01-12T06:55:23Z","date_created":"2018-12-11T11:55:47Z","year":"2013","_id":"2111","publisher":"ACM","intvolume":" 32","publication_status":"published","status":"public","title":"Augmenting physical avatars using projector-based illumination","issue":"6","publist_id":"4922","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."}],"extern":1,"type":"journal_article","date_published":"2013-11-01T00:00:00Z","doi":"10.1145/2508363.2508416","citation":{"mla":"Bermano, Amit, et al. “Augmenting Physical Avatars Using Projector-Based Illumination.” ACM Transactions on Graphics, vol. 32, no. 6, ACM, 2013, doi:10.1145/2508363.2508416.","short":"A. Bermano, P. Bruschweiler, A. Grundhöfer, D. Iwai, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013).","chicago":"Bermano, Amit, Philipp Bruschweiler, Anselm Grundhöfer, Daisuke Iwai, Bernd Bickel, and Markus Groß. “Augmenting Physical Avatars Using Projector-Based Illumination.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2508363.2508416.","ama":"Bermano A, Bruschweiler P, Grundhöfer A, Iwai D, Bickel B, Groß M. Augmenting physical avatars using projector-based illumination. ACM Transactions on Graphics. 2013;32(6). doi:10.1145/2508363.2508416","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,” ACM Transactions on Graphics, vol. 32, no. 6. ACM, 2013.","apa":"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. ACM. https://doi.org/10.1145/2508363.2508416"},"publication":"ACM Transactions on Graphics","quality_controlled":0,"month":"11","day":"01"},{"date_published":"2013-10-01T00:00:00Z","doi":"10.1016/j.cag.2013.05.011","citation":{"ama":"Hildebrand K, Bickel B, Alexa M. Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). 2013;37(6):669-675. doi:10.1016/j.cag.2013.05.011","ieee":"K. Hildebrand, B. Bickel, and M. Alexa, “Orthogonal slicing for additive manufacturing,” Computers and Graphics (Pergamon), vol. 37, no. 6. Elsevier, pp. 669–675, 2013.","apa":"Hildebrand, K., Bickel, B., & Alexa, M. (2013). Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). Elsevier. https://doi.org/10.1016/j.cag.2013.05.011","ista":"Hildebrand K, Bickel B, Alexa M. 2013. Orthogonal slicing for additive manufacturing. Computers and Graphics (Pergamon). 37(6), 669–675.","short":"K. Hildebrand, B. Bickel, M. Alexa, Computers and Graphics (Pergamon) 37 (2013) 669–675.","mla":"Hildebrand, Kristian, et al. “Orthogonal Slicing for Additive Manufacturing.” Computers and Graphics (Pergamon), vol. 37, no. 6, Elsevier, 2013, pp. 669–75, doi:10.1016/j.cag.2013.05.011.","chicago":"Hildebrand, Kristian, Bernd Bickel, and Marc Alexa. “Orthogonal Slicing for Additive Manufacturing.” Computers and Graphics (Pergamon). Elsevier, 2013. https://doi.org/10.1016/j.cag.2013.05.011."},"publication":"Computers and Graphics (Pergamon)","page":"669 - 675","quality_controlled":0,"month":"10","day":"01","author":[{"full_name":"Hildebrand, Kristian","first_name":"Kristian","last_name":"Hildebrand"},{"first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","full_name":"Bernd Bickel"},{"last_name":"Alexa","first_name":"Marc","full_name":"Alexa, Marc"}],"volume":37,"date_created":"2018-12-11T11:55:46Z","date_updated":"2021-01-12T06:55:22Z","year":"2013","_id":"2109","publisher":"Elsevier","intvolume":" 37","title":"Orthogonal slicing for additive manufacturing","status":"public","publication_status":"published","issue":"6","publist_id":"4924","abstract":[{"lang":"eng","text":"Most additive manufacturing technologies work by layering, i.e. slicing the shape and then generating each slice independently. This introduces an anisotropy into the process, often as different accuracies in the tangential and normal directions, but also in terms of other parameters such as build speed or tensile strength and strain. We model this as an anisotropic cubic element. Our approach then finds a compromise between modeling each part of the shape individually in the best possible direction and using one direction for the whole shape part. In particular, we compute an orthogonal basis and consider only the three basis vectors as slice normals (i.e. fabrication directions). Then we optimize a decomposition of the shape along this basis so that each part can be consistently sliced along one of the basis vectors. In simulation, we show that this approach is superior to slicing the whole shape in one direction, only. It also has clear benefits if the shape is larger than the build volume of the available equipment."}],"extern":1,"type":"journal_article"},{"extern":1,"abstract":[{"text":"We present a method for fabrication-oriented design of actuated deformable characters that allows a user to automatically create physical replicas of digitally designed characters using rapid manufacturing technologies. Given a deformable character and a set of target poses as input, our method computes a small set of actuators along with their locations on the surface and optimizes the internal material distribution such that the resulting character exhibits the desired deformation behavior. We approach this problem with a dedicated algorithm that combines finite-element analysis, sparse regularization, and constrained optimization. We validate our pipeline on a set of two- and three-dimensional example characters and present results in simulation and physically-fabricated prototypes.","lang":"eng"}],"issue":"4","publist_id":"4926","type":"journal_article","date_created":"2018-12-11T11:55:45Z","date_updated":"2021-01-12T06:55:21Z","volume":32,"author":[{"full_name":"Skouras, Mélina","first_name":"Mélina","last_name":"Skouras"},{"full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski","first_name":"Bernhard"},{"full_name":"Coros, Stelian","last_name":"Coros","first_name":"Stelian"},{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel"},{"last_name":"Groß","first_name":"Markus","full_name":"Groß, Markus S"}],"title":"Computational design of actuated deformable characters","status":"public","publication_status":"published","intvolume":" 32","publisher":"ACM","year":"2013","_id":"2107","acknowledgement":"This work was partly funded by the NCCR Co-Me of the Swiss NSF","day":"01","month":"07","doi":"10.1145/2461912.2461979","date_published":"2013-07-01T00:00:00Z","quality_controlled":0,"publication":"ACM Transactions on Graphics","citation":{"ieee":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, and M. Groß, “Computational design of actuated deformable characters,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.","apa":"Skouras, M., Thomaszewski, B., Coros, S., Bickel, B., & Groß, M. (2013). Computational design of actuated deformable characters. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461979","ista":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. 2013. Computational design of actuated deformable characters. ACM Transactions on Graphics. 32(4).","ama":"Skouras M, Thomaszewski B, Coros S, Bickel B, Groß M. Computational design of actuated deformable characters. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461979","chicago":"Skouras, Mélina, Bernhard Thomaszewski, Stelian Coros, Bernd Bickel, and Markus Groß. “Computational Design of Actuated Deformable Characters.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461979.","short":"M. Skouras, B. Thomaszewski, S. Coros, B. Bickel, M. Groß, ACM Transactions on Graphics 32 (2013).","mla":"Skouras, Mélina, et al. “Computational Design of Actuated Deformable Characters.” ACM Transactions on Graphics, vol. 32, no. 4, ACM, 2013, doi:10.1145/2461912.2461979."}},{"author":[{"full_name":"Miguel, Eder","first_name":"Eder","last_name":"Miguel"},{"last_name":"Tamstorf","first_name":"Rasmus","full_name":"Tamstorf, Rasmus"},{"full_name":"Bradley, Derek J","first_name":"Derek","last_name":"Bradley"},{"full_name":"Schvartzman, Sara C","last_name":"Schvartzman","first_name":"Sara"},{"full_name":"Thomaszewski, Bernhard","last_name":"Thomaszewski","first_name":"Bernhard"},{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel"},{"first_name":"Wojciech","last_name":"Matusik","full_name":"Matusik, Wojciech"},{"first_name":"Steve","last_name":"Marschner","full_name":"Marschner, Steve"},{"full_name":"Otaduy, Miguel A","last_name":"Otaduy","first_name":"Miguel"}],"volume":32,"date_updated":"2021-01-12T06:55:23Z","date_created":"2018-12-11T11:55:47Z","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).","_id":"2112","year":"2013","publisher":"ACM","intvolume":" 32","publication_status":"published","title":"Modeling and estimation of internal friction in cloth","status":"public","publist_id":"4923","issue":"6","abstract":[{"lang":"eng","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."}],"extern":1,"type":"journal_article","doi":"10.1145/2508363.2508389 ","date_published":"2013-11-01T00:00:00Z","citation":{"chicago":"Miguel, Eder, Rasmus Tamstorf, Derek Bradley, Sara Schvartzman, Bernhard Thomaszewski, Bernd Bickel, Wojciech Matusik, Steve Marschner, and Miguel Otaduy. “Modeling and Estimation of Internal Friction in Cloth.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2508363.2508389 .","mla":"Miguel, Eder, et al. “Modeling and Estimation of Internal Friction in Cloth.” ACM Transactions on Graphics, vol. 32, no. 6, ACM, 2013, doi:10.1145/2508363.2508389 .","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).","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 et al., “Modeling and estimation of internal friction in cloth,” ACM Transactions on Graphics, vol. 32, no. 6. ACM, 2013.","apa":"Miguel, E., Tamstorf, R., Bradley, D., Schvartzman, S., Thomaszewski, B., Bickel, B., … Otaduy, M. (2013). Modeling and estimation of internal friction in cloth. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2508363.2508389 ","ama":"Miguel E, Tamstorf R, Bradley D, et al. Modeling and estimation of internal friction in cloth. ACM Transactions on Graphics. 2013;32(6). doi:10.1145/2508363.2508389 "},"publication":"ACM Transactions on Graphics","quality_controlled":0,"month":"11","day":"01"},{"type":"journal_article","extern":1,"publist_id":"4917","abstract":[{"lang":"eng","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."}],"intvolume":" 18","publisher":"Institute of Mathematical Statistics","publication_status":"published","status":"public","title":"Poisson stochastic integration in Banach spaces","_id":"2117","year":"2013","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,"date_created":"2018-12-11T11:55:49Z","date_updated":"2021-01-12T06:55:24Z","author":[{"full_name":"Dirksen, Sjoerd","last_name":"Dirksen","first_name":"Sjoerd"},{"first_name":"Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","full_name":"Jan Maas"},{"last_name":"Van Neerven","first_name":"Jan","full_name":"van Neerven, Jan M"}],"month":"11","day":"18","quality_controlled":0,"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.7901 "}],"citation":{"short":"S. Dirksen, J. Maas, J. Van Neerven, Electronic Journal of Probability 18 (2013).","mla":"Dirksen, Sjoerd, et al. “Poisson Stochastic Integration in Banach Spaces.” Electronic Journal of Probability, vol. 18, Institute of Mathematical Statistics, 2013, doi:10.1214/EJP.v18-2945 .","chicago":"Dirksen, Sjoerd, Jan Maas, and Jan Van Neerven. “Poisson Stochastic Integration in Banach Spaces.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2013. https://doi.org/10.1214/EJP.v18-2945 .","ama":"Dirksen S, Maas J, Van Neerven J. Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. 2013;18. doi:10.1214/EJP.v18-2945 ","ieee":"S. Dirksen, J. Maas, and J. Van Neerven, “Poisson stochastic integration in Banach spaces,” Electronic Journal of Probability, vol. 18. Institute of Mathematical Statistics, 2013.","apa":"Dirksen, S., Maas, J., & Van Neerven, J. (2013). Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/EJP.v18-2945 ","ista":"Dirksen S, Maas J, Van Neerven J. 2013. Poisson stochastic integration in Banach spaces. Electronic Journal of Probability. 18."},"publication":"Electronic Journal of Probability","doi":"10.1214/EJP.v18-2945 ","date_published":"2013-11-18T00:00:00Z"},{"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.","ieee":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, and M. Alexa, “3D printing spatially varying BRDFs,” IEEE Computer Graphics and Applications, vol. 33, no. 6. IEEE, pp. 48–57, 2013.","apa":"Rouiller, O., Bickel, B., Kautz, J., Matusik, W., & Alexa, M. (2013). 3D printing spatially varying BRDFs. IEEE Computer Graphics and Applications. IEEE. https://doi.org/10.1109/MCG.2013.82 ","ama":"Rouiller O, Bickel B, Kautz J, Matusik W, Alexa M. 3D printing spatially varying BRDFs. IEEE Computer Graphics and Applications. 2013;33(6):48-57. doi:10.1109/MCG.2013.82 ","chicago":"Rouiller, Olivier, Bernd Bickel, Jan Kautz, Wojciech Matusik, and Marc Alexa. “3D Printing Spatially Varying BRDFs.” IEEE Computer Graphics and Applications. IEEE, 2013. https://doi.org/10.1109/MCG.2013.82 .","mla":"Rouiller, Olivier, et al. “3D Printing Spatially Varying BRDFs.” IEEE Computer Graphics and Applications, vol. 33, no. 6, IEEE, 2013, pp. 48–57, doi:10.1109/MCG.2013.82 .","short":"O. Rouiller, B. Bickel, J. Kautz, W. Matusik, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 48–57."},"publication":"IEEE Computer Graphics and Applications","page":"48 - 57","quality_controlled":0,"date_published":"2013-09-23T00:00:00Z","doi":"10.1109/MCG.2013.82 ","day":"23","month":"09","year":"2013","_id":"2113","publisher":"IEEE","intvolume":" 33","title":"3D printing spatially varying BRDFs","publication_status":"published","status":"public","author":[{"full_name":"Rouiller, Olivier","last_name":"Rouiller","first_name":"Olivier"},{"last_name":"Bickel","first_name":"Bernd","orcid":"0000-0001-6511-9385","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bernd Bickel"},{"full_name":"Kautz, Jan","first_name":"Jan","last_name":"Kautz"},{"last_name":"Matusik","first_name":"Wojciech","full_name":"Matusik, Wojciech"},{"full_name":"Alexa, Marc","last_name":"Alexa","first_name":"Marc"}],"volume":33,"date_created":"2018-12-11T11:55:47Z","date_updated":"2021-01-12T06:55:23Z","type":"journal_article","issue":"6","publist_id":"4920","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."}],"extern":1},{"type":"journal_article","publist_id":"4921","issue":"6","abstract":[{"lang":"eng","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."}],"extern":1,"year":"2013","_id":"2114","intvolume":" 33","publisher":"IEEE","title":"Computational aspects of fabrication: Modeling, design and 3d printing","publication_status":"published","status":"public","author":[{"full_name":"Bernd Bickel","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385"},{"full_name":"Alexa, Marc","first_name":"Marc","last_name":"Alexa"}],"volume":33,"date_updated":"2021-01-12T06:55:24Z","date_created":"2018-12-11T11:55:48Z","day":"01","month":"12","citation":{"ama":"Bickel B, Alexa M. Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. 2013;33(6):24-25. doi:10.1109/MCG.2013.89","ieee":"B. Bickel and M. Alexa, “Computational aspects of fabrication: Modeling, design and 3d printing,” IEEE Computer Graphics and Applications, vol. 33, no. 6. IEEE, pp. 24–25, 2013.","apa":"Bickel, B., & Alexa, M. (2013). Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. IEEE. https://doi.org/10.1109/MCG.2013.89","ista":"Bickel B, Alexa M. 2013. Computational aspects of fabrication: Modeling, design and 3d printing. IEEE Computer Graphics and Applications. 33(6), 24–25.","short":"B. Bickel, M. Alexa, IEEE Computer Graphics and Applications 33 (2013) 24–25.","mla":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” IEEE Computer Graphics and Applications, vol. 33, no. 6, IEEE, 2013, pp. 24–25, doi:10.1109/MCG.2013.89.","chicago":"Bickel, Bernd, and Marc Alexa. “Computational Aspects of Fabrication: Modeling, Design and 3d Printing.” IEEE Computer Graphics and Applications. IEEE, 2013. https://doi.org/10.1109/MCG.2013.89."},"publication":"IEEE Computer Graphics and Applications","page":"24 - 25","quality_controlled":0,"date_published":"2013-12-01T00:00:00Z","doi":"10.1109/MCG.2013.89"},{"doi":"10.1137/120886315 ","date_published":"2013-01-01T00:00:00Z","quality_controlled":0,"page":"879 - 899","publication":"SIAM Journal on Mathematical Analysis","main_file_link":[{"url":"http://arxiv.org/abs/1207.6501","open_access":"1"}],"citation":{"apa":"Gigli, N., & Maas, J. (2013). Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120886315 ","ieee":"N. Gigli and J. Maas, “Gromov-Hausdorff convergence of discrete transportation metrics,” SIAM Journal on Mathematical Analysis, vol. 45, no. 2. Society for Industrial and Applied Mathematics , pp. 879–899, 2013.","ista":"Gigli N, Maas J. 2013. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 45(2), 879–899.","ama":"Gigli N, Maas J. Gromov-Hausdorff convergence of discrete transportation metrics. SIAM Journal on Mathematical Analysis. 2013;45(2):879-899. doi:10.1137/120886315 ","chicago":"Gigli, Nicola, and Jan Maas. “Gromov-Hausdorff Convergence of Discrete Transportation Metrics.” SIAM Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120886315 .","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.” SIAM Journal on Mathematical Analysis, vol. 45, no. 2, Society for Industrial and Applied Mathematics , 2013, pp. 879–99, doi:10.1137/120886315 ."},"oa":1,"day":"01","month":"01","date_updated":"2021-01-12T06:55:29Z","date_created":"2018-12-11T11:55:53Z","volume":45,"author":[{"first_name":"Nicola","last_name":"Gigli","full_name":"Gigli, Nicola"},{"full_name":"Jan Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas"}],"title":"Gromov-Hausdorff convergence of discrete transportation metrics","publication_status":"published","status":"public","intvolume":" 45","publisher":"Society for Industrial and Applied Mathematics ","year":"2013","_id":"2129","acknowledgement":"JM acknowledges support by Rubicon subsidy 680-50-0901 of the Netherlands Organisation for Scientific Research (NWO).","extern":1,"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"}],"issue":"2","publist_id":"4904","type":"journal_article"},{"date_created":"2018-12-11T11:55:56Z","date_updated":"2021-01-12T06:55:32Z","volume":1,"author":[{"full_name":"Mikhail Lemeshko","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"title":"Manipulating scattering of ultracold atoms with light-induced dissipation","publication_status":"published","status":"public","publisher":"Frontiers Media","intvolume":" 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","_id":"2139","year":"2013","extern":1,"abstract":[{"lang":"eng","text":"Recently it has been shown that pairs of atoms can form metastable bonds due to non-conservative forces induced by dissipation [Lemeshko&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."}],"issue":"17","publist_id":"4885","type":"journal_article","date_published":"2013-10-07T00:00:00Z","doi":"10.3389/fphy.2013.00017","quality_controlled":0,"publication":"Frontiers Physics","oa":1,"citation":{"apa":"Lemeshko, M. (2013). Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. Frontiers Media. https://doi.org/10.3389/fphy.2013.00017","ieee":"M. Lemeshko, “Manipulating scattering of ultracold atoms with light-induced dissipation,” Frontiers Physics, vol. 1, no. 17. Frontiers Media, 2013.","ista":"Lemeshko M. 2013. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 1(17).","ama":"Lemeshko M. Manipulating scattering of ultracold atoms with light-induced dissipation. Frontiers Physics. 2013;1(17). doi:10.3389/fphy.2013.00017","chicago":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” Frontiers Physics. Frontiers Media, 2013. https://doi.org/10.3389/fphy.2013.00017.","short":"M. Lemeshko, Frontiers Physics 1 (2013).","mla":"Lemeshko, Mikhail. “Manipulating Scattering of Ultracold Atoms with Light-Induced Dissipation.” Frontiers Physics, vol. 1, no. 17, Frontiers Media, 2013, doi:10.3389/fphy.2013.00017."},"main_file_link":[{"url":"http://arxiv.org/abs/1307.8129","open_access":"1"}],"month":"10","day":"07"},{"publication_identifier":{"isbn":["978-1-4503-1832-7"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1145/2429069.2429109","conference":{"name":"POPL: Principles of Programming Languages","location":"Rome, Italy","start_date":"2013-01-23","end_date":"2013-01-25"},"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"quality_controlled":"1","oa":1,"ec_funded":1,"publist_id":"4801","file_date_updated":"2020-07-14T12:45:31Z","date_updated":"2023-02-21T16:06:49Z","date_created":"2018-12-11T11:56:11Z","related_material":{"record":[{"status":"deleted","relation":"later_version","id":"10901"}]},"author":[{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph"},{"last_name":"Payer","first_name":"Hannes","full_name":"Payer, Hannes"},{"full_name":"Sezgin, Ali","last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sokolova, Ana","last_name":"Sokolova","first_name":"Ana"}],"department":[{"_id":"ToHe"}],"publisher":"ACM","publication_status":"published","year":"2013","acknowledgement":" and an Elise Richter Fellowship (Austrian Science Fund V00125). ","has_accepted_license":"1","day":"01","scopus_import":1,"date_published":"2013-01-01T00:00:00Z","page":"317 - 328","citation":{"chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 317–28. ACM, 2013. https://doi.org/10.1145/2429069.2429109.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–28, doi:10.1145/2429069.2429109.","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.","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.","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., & Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 317–328). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429109","ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:317-328. doi:10.1145/2429069.2429109"},"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","abstract":[{"lang":"eng","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 "legal" 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."}],"type":"conference","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:14:33Z","date_updated":"2020-07-14T12:45:31Z","checksum":"adf465e70948f4e80e48057524516456","relation":"main_file","file_id":"5086","content_type":"application/pdf","file_size":294689,"creator":"system","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","access_level":"open_access"}],"pubrep_id":"198","ddc":["000","004"],"status":"public","title":"Quantitative relaxation of concurrent data structures","_id":"2181","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"scopus_import":1,"month":"01","day":"01","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"}],"page":"115 - 128","quality_controlled":"1","citation":{"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.","mla":"Cerny, Pavol, et al. “Quantitative Abstraction Refinement.” Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 115–28, doi:10.1145/2429069.2429085.","chicago":"Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.","ama":"Cerny P, Henzinger TA, Radhakrishna A. Quantitative abstraction refinement. In: Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language. ACM; 2013:115-128. doi:10.1145/2429069.2429085","ieee":"P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 115–128.","apa":"Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085","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."},"publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","language":[{"iso":"eng"}],"date_published":"2013-01-01T00:00:00Z","doi":"10.1145/2429069.2429085","conference":{"name":"POPL: Principles of Programming Languages","end_date":"2013-01-25","start_date":"2013-07-23","location":"Rome, Italy"},"type":"conference","ec_funded":1,"publist_id":"4800","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."}],"department":[{"_id":"ToHe"}],"publisher":"ACM","status":"public","publication_status":"published","title":"Quantitative abstraction refinement","_id":"2182","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","oa_version":"None","date_created":"2018-12-11T11:56:11Z","date_updated":"2021-01-12T06:55:50Z","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"}]},{"alternative_title":["2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) "],"type":"conference","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"}],"publist_id":"4763","publication_status":"published","status":"public","title":"Recognizing straight skeletons and Voronoi diagrams and reconstructing their input","publisher":"IEEE","department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2209","year":"2013","date_updated":"2021-01-12T06:56:00Z","date_created":"2018-12-11T11:56:20Z","oa_version":"None","author":[{"full_name":"Biedl, Therese","last_name":"Biedl","first_name":"Therese"},{"full_name":"Held, Martin","first_name":"Martin","last_name":"Held"},{"orcid":"0000-0002-8871-5814","id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","first_name":"Stefan","full_name":"Huber, Stefan"}],"scopus_import":1,"month":"12","day":"01","publication_identifier":{"eisbn":["978-0-7695-5037-4 "]},"quality_controlled":"1","page":"37 - 46","citation":{"chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input,” 37–46. IEEE, 2013. https://doi.org/10.1109/ISVD.2013.11.","short":"T. Biedl, M. Held, S. Huber, in:, IEEE, 2013, pp. 37–46.","mla":"Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11.","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.","apa":"Biedl, T., Held, M., & 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. https://doi.org/10.1109/ISVD.2013.11","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:10.1109/ISVD.2013.11"},"language":[{"iso":"eng"}],"conference":{"name":"ISVD: Voronoi Diagrams in Science and Engineering","start_date":"2013-07-08","location":"St. Petersburg, Russia","end_date":"2013-07-10"},"date_published":"2013-12-01T00:00:00Z","doi":"10.1109/ISVD.2013.11"},{"article_processing_charge":"No","day":"08","month":"04","doi":"10.1103/PhysRevLett.110.155301","date_published":"2013-04-08T00:00:00Z","language":[{"iso":"eng"}],"oa":1,"citation":{"apa":"Bhongale, S., Mathey, L., Zhao, E., Yelin, S., & Lemeshko, M. (2013). Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.110.155301","ieee":"S. Bhongale, L. Mathey, E. Zhao, S. Yelin, and M. Lemeshko, “Quantum phases of quadrupolar fermi gases in optical lattices,” Physical Review Letters, vol. 110, no. 15. American Physical Society, 2013.","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).","ama":"Bhongale S, Mathey L, Zhao E, Yelin S, Lemeshko M. Quantum phases of quadrupolar fermi gases in optical lattices. Physical Review Letters. 2013;110(15). doi:10.1103/PhysRevLett.110.155301","chicago":"Bhongale, Satyan, Ludwig Mathey, Erhai Zhao, Susanne Yelin, and Mikhail Lemeshko. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” Physical Review Letters. American Physical Society, 2013. https://doi.org/10.1103/PhysRevLett.110.155301.","short":"S. Bhongale, L. Mathey, E. Zhao, S. Yelin, M. Lemeshko, Physical Review Letters 110 (2013).","mla":"Bhongale, Satyan, et al. “Quantum Phases of Quadrupolar Fermi Gases in Optical Lattices.” Physical Review Letters, vol. 110, no. 15, American Physical Society, 2013, doi:10.1103/PhysRevLett.110.155301."},"main_file_link":[{"url":"http://arxiv.org/abs/1211.3317","open_access":"1"}],"publication":"Physical Review Letters","issue":"15","publist_id":"4769","abstract":[{"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.","lang":"eng"}],"extern":"1","type":"journal_article","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1103/PhysRevLett.111.239901"}]},"author":[{"last_name":"Bhongale","first_name":"Satyan","full_name":"Bhongale, Satyan"},{"full_name":"Mathey, Ludwig","last_name":"Mathey","first_name":"Ludwig"},{"full_name":"Zhao, Erhai","last_name":"Zhao","first_name":"Erhai"},{"full_name":"Yelin, Susanne","last_name":"Yelin","first_name":"Susanne"},{"last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail"}],"oa_version":"None","volume":110,"date_updated":"2021-11-16T08:04:06Z","date_created":"2018-12-11T11:56:18Z","year":"2013","_id":"2204","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 110","publisher":"American Physical Society","status":"public","title":"Quantum phases of quadrupolar fermi gases in optical lattices","publication_status":"published"},{"_id":"2206","year":"2013","status":"public","title":"Controllable quantum spin glasses with magnetic impurities embedded in quantum solids","publication_status":"published","intvolume":" 88","publisher":"American Physical Society","author":[{"full_name":"Mikhail Lemeshko","first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802"},{"first_name":"Norman","last_name":"Yao","full_name":"Yao, Norman Y"},{"last_name":"Gorshkov","first_name":"Alexey","full_name":"Gorshkov, Alexey V"},{"last_name":"Weimer","first_name":"Hendrik","full_name":"Weimer, Hendrik"},{"full_name":"Bennett, Steven D","last_name":"Bennett","first_name":"Steven"},{"last_name":"Momose","first_name":"Takamasa","full_name":"Momose, Takamasa"},{"last_name":"Gopalakrishnan","first_name":"Sarang","full_name":"Gopalakrishnan, Sarang"}],"date_updated":"2021-01-12T06:55:59Z","date_created":"2018-12-11T11:56:19Z","volume":88,"type":"journal_article","abstract":[{"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.","lang":"eng"}],"publist_id":"4767","issue":"1","extern":1,"publication":"Physical Review B - Condensed Matter and Materials Physics","citation":{"ama":"Lemeshko M, Yao N, Gorshkov A, et al. Controllable quantum spin glasses with magnetic impurities embedded in quantum solids. Physical Review B - Condensed Matter and Materials Physics. 2013;88(1). doi:10.1103/PhysRevB.88.014426","ieee":"M. Lemeshko et al., “Controllable quantum spin glasses with magnetic impurities embedded in quantum solids,” Physical Review B - Condensed Matter and Materials Physics, vol. 88, no. 1. American Physical Society, 2013.","apa":"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. American Physical Society. https://doi.org/10.1103/PhysRevB.88.014426","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).","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.” Physical Review B - Condensed Matter and Materials Physics, vol. 88, no. 1, American Physical Society, 2013, doi:10.1103/PhysRevB.88.014426.","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.” Physical Review B - Condensed Matter and Materials Physics. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.014426."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.1130"}],"oa":1,"quality_controlled":0,"doi":"10.1103/PhysRevB.88.014426","date_published":"2013-07-24T00:00:00Z","month":"07","day":"24"},{"date_published":"2013-07-01T00:00:00Z","doi":"10.1080/00268976.2013.813595","citation":{"chicago":"Lemeshko, Mikhail, Roman Krems, John Doyle, and Sabre Kais. “Manipulation of Molecules with Electromagnetic Fields.” Molecular Physics. Taylor & Francis, 2013. https://doi.org/10.1080/00268976.2013.813595.","mla":"Lemeshko, Mikhail, et al. “Manipulation of Molecules with Electromagnetic Fields.” Molecular Physics, vol. 111, no. 12–13, Taylor & Francis, 2013, pp. 1648–82, doi:10.1080/00268976.2013.813595.","short":"M. Lemeshko, R. Krems, J. Doyle, S. Kais, Molecular Physics 111 (2013) 1648–1682.","ista":"Lemeshko M, Krems R, Doyle J, Kais S. 2013. Manipulation of molecules with electromagnetic fields. Molecular Physics. 111(12–13), 1648–1682.","ieee":"M. Lemeshko, R. Krems, J. Doyle, and S. Kais, “Manipulation of molecules with electromagnetic fields,” Molecular Physics, vol. 111, no. 12–13. Taylor & Francis, pp. 1648–1682, 2013.","apa":"Lemeshko, M., Krems, R., Doyle, J., & Kais, S. (2013). Manipulation of molecules with electromagnetic fields. Molecular Physics. Taylor & Francis. https://doi.org/10.1080/00268976.2013.813595","ama":"Lemeshko M, Krems R, Doyle J, Kais S. Manipulation of molecules with electromagnetic fields. Molecular Physics. 2013;111(12-13):1648-1682. doi:10.1080/00268976.2013.813595"},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1306.0912"}],"oa":1,"publication":"Molecular Physics","page":"1648 - 1682","quality_controlled":0,"month":"07","day":"01","author":[{"first_name":"Mikhail","last_name":"Lemeshko","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Mikhail Lemeshko"},{"last_name":"Krems","first_name":"Roman","full_name":"Krems, Roman V"},{"full_name":"Doyle, John M","last_name":"Doyle","first_name":"John"},{"first_name":"Sabre","last_name":"Kais","full_name":"Kais, Sabre"}],"volume":111,"date_created":"2018-12-11T11:56:19Z","date_updated":"2020-07-14T12:45:32Z","acknowledgement":"National Science Foundation; Natural Sciences and Engineering Research Council of Canada","_id":"2205","year":"2013","publisher":"Taylor & Francis","intvolume":" 111","status":"public","title":"Manipulation of molecules with electromagnetic fields","publication_status":"published","publist_id":"4768","issue":"12-13","abstract":[{"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.","lang":"eng"}],"extern":1,"type":"review"},{"publist_id":"4766","abstract":[{"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.","lang":"eng"}],"extern":1,"type":"journal_article","author":[{"full_name":"Mikhail Lemeshko","last_name":"Lemeshko","first_name":"Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Weimer, Hendrik","last_name":"Weimer","first_name":"Hendrik"}],"volume":4,"date_created":"2018-12-11T11:56:20Z","date_updated":"2021-01-12T06:55:59Z","_id":"2207","year":"2013","intvolume":" 4","publisher":"Nature Publishing Group","publication_status":"published","status":"public","title":"Dissipative binding of atoms by non-conservative forces","day":"30","month":"07","doi":"10.1038/ncomms3230","date_published":"2013-07-30T00:00:00Z","main_file_link":[{"url":"http://arxiv.org/abs/1211.4035","open_access":"1"}],"oa":1,"citation":{"mla":"Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” Nature Communications, vol. 4, Nature Publishing Group, 2013, doi:10.1038/ncomms3230.","short":"M. Lemeshko, H. Weimer, Nature Communications 4 (2013).","chicago":"Lemeshko, Mikhail, and Hendrik Weimer. “Dissipative Binding of Atoms by Non-Conservative Forces.” Nature Communications. Nature Publishing Group, 2013. https://doi.org/10.1038/ncomms3230.","ama":"Lemeshko M, Weimer H. Dissipative binding of atoms by non-conservative forces. Nature Communications. 2013;4. doi:10.1038/ncomms3230","ista":"Lemeshko M, Weimer H. 2013. Dissipative binding of atoms by non-conservative forces. Nature Communications. 4.","ieee":"M. Lemeshko and H. Weimer, “Dissipative binding of atoms by non-conservative forces,” Nature Communications, vol. 4. Nature Publishing Group, 2013.","apa":"Lemeshko, M., & Weimer, H. (2013). Dissipative binding of atoms by non-conservative forces. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms3230"},"publication":"Nature Communications","quality_controlled":0},{"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. 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."}],"publist_id":"4762","type":"conference","date_updated":"2021-01-12T06:56:00Z","date_created":"2018-12-11T11:56:21Z","oa_version":"Submitted Version","author":[{"last_name":"Biedl","first_name":"Therese","full_name":"Biedl, Therese"},{"last_name":"Held","first_name":"Martin","full_name":"Held, Martin"},{"first_name":"Stefan","last_name":"Huber","id":"4700A070-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8871-5814","full_name":"Huber, Stefan"}],"title":"Reconstructing polygons from embedded straight skeletons","publication_status":"published","status":"public","department":[{"_id":"HeEd"}],"publisher":"TU Braunschweig","_id":"2210","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","month":"03","day":"01","language":[{"iso":"eng"}],"conference":{"name":"EuroCG: European Workshop on Computational Geometry","end_date":"2013-03-20","start_date":"2013-03-17","location":"Braunschweig, Germany"},"date_published":"2013-03-01T00:00:00Z","page":"95 - 98","publication":"29th European Workshop on Computational Geometry","citation":{"chicago":"Biedl, Therese, Martin Held, and Stefan Huber. “Reconstructing Polygons from Embedded Straight Skeletons.” In 29th European Workshop on Computational Geometry, 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.” 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.","ieee":"T. Biedl, M. Held, and S. Huber, “Reconstructing polygons from embedded straight skeletons,” in 29th European Workshop on Computational Geometry, Braunschweig, Germany, 2013, pp. 95–98.","apa":"Biedl, T., Held, M., & Huber, S. (2013). Reconstructing polygons from embedded straight skeletons. In 29th European Workshop on Computational Geometry (pp. 95–98). Braunschweig, Germany: TU Braunschweig.","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: 29th European Workshop on Computational Geometry. TU Braunschweig; 2013:95-98."},"main_file_link":[{"url":"http://www.ibr.cs.tu-bs.de/alg/eurocg13/booklet_eurocg13.pdf","open_access":"1"}],"oa":1},{"abstract":[{"lang":"eng","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."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Submitted Version","file":[{"file_id":"7858","relation":"main_file","checksum":"9cebaafca032e6769d273f393305c705","date_created":"2020-05-15T11:10:40Z","date_updated":"2020-07-14T12:45:34Z","access_level":"open_access","file_name":"2013_LPAR_Blanc.pdf","creator":"dernst","file_size":279206,"content_type":"application/pdf"}],"_id":"2237","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Tree interpolation in Vampire","ddc":["000"],"status":"public","intvolume":" 8312","day":"14","article_processing_charge":"No","has_accepted_license":"1","scopus_import":1,"series_title":"Lecture Notes in Computer Science","date_published":"2013-01-14T00:00:00Z","citation":{"chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-45221-5_13.","mla":"Blanc, Régis, et al. Tree Interpolation in Vampire. Vol. 8312, Springer, 2013, pp. 173–81, doi:10.1007/978-3-642-45221-5_13.","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","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.","apa":"Blanc, R., Gupta, A., Kovács, L., & Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. https://doi.org/10.1007/978-3-642-45221-5_13","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:10.1007/978-3-642-45221-5_13"},"page":"173 - 181","file_date_updated":"2020-07-14T12:45:34Z","publist_id":"4724","author":[{"last_name":"Blanc","first_name":"Régis","full_name":"Blanc, Régis"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"full_name":"Kragl, Bernhard","first_name":"Bernhard","last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7745-9117"}],"date_created":"2018-12-11T11:56:29Z","date_updated":"2020-08-11T10:09:42Z","volume":8312,"year":"2013","publication_status":"published","publisher":"Springer","department":[{"_id":"ToHe"}],"month":"01","conference":{"start_date":"2013-12-14","location":"Stellenbosch, South Africa","end_date":"2013-12-19","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"},"doi":"10.1007/978-3-642-45221-5_13","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}]},{"alternative_title":["LNCS"],"type":"conference","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"}],"intvolume":" 8312","status":"public","title":"Multi-objective discounted reward verification in graphs and MDPs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2238","oa_version":"None","series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"01","page":"228 - 242","citation":{"short":"K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.","mla":"Chatterjee, Krishnendu, et al. Multi-Objective Discounted Reward Verification in Graphs and MDPs. Vol. 8312, Springer, 2013, pp. 228–42, doi:10.1007/978-3-642-45221-5_17.","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. https://doi.org/10.1007/978-3-642-45221-5_17.","ama":"Chatterjee K, Forejt V, Wojtczak D. Multi-objective discounted reward verification in graphs and MDPs. 2013;8312:228-242. doi:10.1007/978-3-642-45221-5_17","apa":"Chatterjee, K., Forejt, V., & 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. https://doi.org/10.1007/978-3-642-45221-5_17","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."},"date_published":"2013-12-01T00:00:00Z","publist_id":"4723","ec_funded":1,"department":[{"_id":"KrCh"}],"publisher":"Springer","publication_status":"published","year":"2013","volume":8312,"date_updated":"2020-08-11T10:09:42Z","date_created":"2018-12-11T11:56:30Z","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Forejt","first_name":"Vojtěch","full_name":"Forejt, Vojtěch"},{"full_name":"Wojtczak, Dominik","last_name":"Wojtczak","first_name":"Dominik"}],"month":"12","project":[{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-45221-5_17","conference":{"end_date":"2013-12-19","start_date":"2013-12-14","location":"Stellenbosch, South Africa","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning"}},{"oa_version":"Published Version","file":[{"relation":"main_file","file_id":"4929","date_created":"2018-12-12T10:12:11Z","date_updated":"2020-07-14T12:45:34Z","checksum":"e0732e73a8b1e39483df7717d53e3e35","file_name":"IST-2016-136-v1+2_39.pdf","access_level":"open_access","file_size":454915,"content_type":"application/pdf","creator":"system"}],"pubrep_id":"136","ddc":["000","004"],"status":"public","title":"Elementary modal logics over transitive structures","intvolume":" 23","_id":"2243","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"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.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2013-09-01T00:00:00Z","page":"563 - 577","citation":{"ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","apa":"Michaliszyn, J., & 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. https://doi.org/10.4230/LIPIcs.CSL.2013.563","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.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:10.4230/LIPIcs.CSL.2013.563","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. https://doi.org/10.4230/LIPIcs.CSL.2013.563.","mla":"Michaliszyn, Jakub, and Jan Otop. Elementary Modal Logics over Transitive Structures. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:10.4230/LIPIcs.CSL.2013.563.","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577."},"day":"01","has_accepted_license":"1","series_title":"Leibniz International Proceedings in Informatics","scopus_import":1,"date_created":"2018-12-11T11:56:32Z","date_updated":"2020-08-11T10:09:42Z","volume":23,"author":[{"last_name":"Michaliszyn","first_name":"Jakub","full_name":"Michaliszyn, Jakub"},{"full_name":"Otop, Jan","first_name":"Jan","last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2013","file_date_updated":"2020-07-14T12:45:34Z","publist_id":"4708","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"name":"CSL: Computer Science Logic","location":"Torino, Italy","start_date":"2013-09-02","end_date":"2013-09-05"},"doi":"10.4230/LIPIcs.CSL.2013.563","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"09"},{"abstract":[{"lang":"eng","text":"We consider two systems (α1,...,αm) and (β1,...,βn) of curves drawn on a compact two-dimensional surface ℳ with boundary. Each αi and each βj is either an arc meeting the boundary of ℳ at its two endpoints, or a closed curve. The αi are pairwise disjoint except for possibly sharing endpoints, and similarly for the βj. We want to "untangle" the βj from the αi by a self-homeomorphism of ℳ; more precisely, we seek an homeomorphism φ: ℳ → ℳ fixing the boundary of ℳ pointwise such that the total number of crossings of the αi with the φ(βj) is as small as possible. This problem is motivated by an application in the algorithmic theory of embeddings and 3-manifolds. We prove that if ℳ is planar, i.e., a sphere with h ≥ 0 boundary components ("holes"), then O(mn) crossings can be achieved (independently of h), which is asymptotically tight, as an easy lower bound shows. In general, for an arbitrary (orientable or nonorientable) surface ℳ with h holes and of (orientable or nonorientable) genus g ≥ 0, we obtain an O((m + n)4) upper bound, again independent of h and g. "}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","intvolume":" 8242","title":"Untangling two systems of noncrossing curves","status":"public","_id":"2244","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","series_title":"Lecture Notes in Computer Science","scopus_import":1,"date_published":"2013-09-01T00:00:00Z","page":"472 - 483","citation":{"ama":"Matoušek J, Sedgwick E, Tancer M, Wagner U. Untangling two systems of noncrossing curves. 2013;8242:472-483. doi:10.1007/978-3-319-03841-4_41","ieee":"J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Untangling two systems of noncrossing curves,” vol. 8242. Springer, pp. 472–483, 2013.","apa":"Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2013). Untangling two systems of noncrossing curves. Presented at the GD: Graph Drawing and Network Visualization, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-319-03841-4_41","ista":"Matoušek J, Sedgwick E, Tancer M, Wagner U. 2013. Untangling two systems of noncrossing curves. 8242, 472–483.","short":"J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.","mla":"Matoušek, Jiří, et al. Untangling Two Systems of Noncrossing Curves. Vol. 8242, Springer, 2013, pp. 472–83, doi:10.1007/978-3-319-03841-4_41.","chicago":"Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Untangling Two Systems of Noncrossing Curves.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-319-03841-4_41."},"publist_id":"4707","volume":8242,"date_updated":"2023-02-21T17:03:07Z","date_created":"2018-12-11T11:56:32Z","related_material":{"record":[{"id":"1411","status":"public","relation":"later_version"}]},"author":[{"full_name":"Matoušek, Jiří","first_name":"Jiří","last_name":"Matoušek"},{"last_name":"Sedgwick","first_name":"Eric","full_name":"Sedgwick, Eric"},{"full_name":"Tancer, Martin","last_name":"Tancer","first_name":"Martin","orcid":"0000-0002-1191-6714","id":"38AC689C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli"}],"department":[{"_id":"UlWa"}],"publisher":"Springer","publication_status":"published","acknowledgement":"We would like to thank the authors of [GHR13] for mak- ing a draft of their paper available to us, and, in particular, T. Huynh for an e-mail correspondence.","year":"2013","month":"09","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-03841-4_41","conference":{"end_date":"2013-09-25","start_date":"2013-09-23","location":"Bordeaux, France","name":"GD: Graph Drawing and Network Visualization"},"project":[{"name":"Embeddings in Higher Dimensions: Algorithms and Combinatorics","_id":"25FA3206-B435-11E9-9278-68D0E5697425","grant_number":"PP00P2_138948"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["1302.6475"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.6475"}]},{"date_updated":"2021-01-12T06:56:21Z","date_created":"2018-12-11T11:56:37Z","volume":8042,"author":[{"full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","first_name":"Joel F"},{"last_name":"Krenn","first_name":"Stephan","orcid":"0000-0003-2835-9093","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","full_name":"Krenn, Stephan"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Wichs","first_name":"Daniel","full_name":"Wichs, Daniel"}],"publication_status":"published","department":[{"_id":"KrPi"}],"publisher":"Springer","year":"2013","file_date_updated":"2020-07-14T12:45:35Z","publist_id":"4687","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2013-08-22","start_date":"2013-08-18","location":"Santa Barbara, CA, United States","name":"CRYPTO: International Cryptology Conference"},"doi":"10.1007/978-3-642-40041-4_4","quality_controlled":"1","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"oa":1,"month":"01","file":[{"access_level":"open_access","file_name":"IST-2016-684-v1+1_098.pdf","creator":"system","content_type":"application/pdf","file_size":587898,"file_id":"4912","relation":"main_file","checksum":"16d428408a806b8e49eecc607deab115","date_created":"2018-12-12T10:11:55Z","date_updated":"2020-07-14T12:45:35Z"}],"oa_version":"Published Version","pubrep_id":"684","title":"Learning with rounding, revisited: New reduction properties and applications","ddc":["000","004"],"status":"public","intvolume":" 8042","_id":"2259","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The learning with rounding (LWR) problem, introduced by Banerjee, Peikert and Rosen at EUROCRYPT ’12, is a variant of learning with errors (LWE), where one replaces random errors with deterministic rounding. The LWR problem was shown to be as hard as LWE for a setting of parameters where the modulus and modulus-to-error ratio are super-polynomial. In this work we resolve the main open problem and give a new reduction that works for a larger range of parameters, allowing for a polynomial modulus and modulus-to-error ratio. In particular, a smaller modulus gives us greater efficiency, and a smaller modulus-to-error ratio gives us greater security, which now follows from the worst-case hardness of GapSVP with polynomial (rather than super-polynomial) approximation factors.\r\n\r\nAs a tool in the reduction, we show that there is a “lossy mode” for the LWR problem, in which LWR samples only reveal partial information about the secret. This property gives us several interesting new applications, including a proof that LWR remains secure with weakly random secrets of sufficient min-entropy, and very simple constructions of deterministic encryption, lossy trapdoor functions and reusable extractors.\r\n\r\nOur approach is inspired by a technique of Goldwasser et al. from ICS ’10, which implicitly showed the existence of a “lossy mode” for LWE. By refining this technique, we also improve on the parameters of that work to only requiring a polynomial (instead of super-polynomial) modulus and modulus-to-error ratio.\r\n"}],"issue":"1","alternative_title":["LNCS"],"type":"conference","date_published":"2013-01-01T00:00:00Z","page":"57 - 74","citation":{"ieee":"J. F. Alwen, S. Krenn, K. Z. Pietrzak, and D. Wichs, “Learning with rounding, revisited: New reduction properties and applications,” vol. 8042, no. 1. Springer, pp. 57–74, 2013.","apa":"Alwen, J. F., Krenn, S., Pietrzak, K. Z., & Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_4","ista":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.","ama":"Alwen JF, Krenn S, Pietrzak KZ, Wichs D. Learning with rounding, revisited: New reduction properties and applications. 2013;8042(1):57-74. doi:10.1007/978-3-642-40041-4_4","chicago":"Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.","short":"J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.","mla":"Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4."},"day":"01","has_accepted_license":"1","series_title":"Lecture Notes in Computer Science","scopus_import":1},{"date_published":"2013-01-01T00:00:00Z","page":"571 - 588","citation":{"ama":"Kiltz E, Pietrzak KZ, Szegedy M. Digital signatures with minimal overhead from indifferentiable random invertible functions. 2013;8042:571-588. doi:10.1007/978-3-642-40041-4_31","ista":"Kiltz E, Pietrzak KZ, Szegedy M. 2013. Digital signatures with minimal overhead from indifferentiable random invertible functions. 8042, 571–588.","apa":"Kiltz, E., Pietrzak, K. Z., & Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-642-40041-4_31","ieee":"E. Kiltz, K. Z. Pietrzak, and M. Szegedy, “Digital signatures with minimal overhead from indifferentiable random invertible functions,” vol. 8042. Springer, pp. 571–588, 2013.","mla":"Kiltz, Eike, et al. Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. Vol. 8042, Springer, 2013, pp. 571–88, doi:10.1007/978-3-642-40041-4_31.","short":"E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_31."},"has_accepted_license":"1","day":"01","series_title":"Lecture Notes in Computer Science","scopus_import":1,"file":[{"access_level":"open_access","file_name":"IST-2016-685-v1+1_658.pdf","creator":"system","content_type":"application/pdf","file_size":493175,"file_id":"4744","relation":"main_file","checksum":"18a3f602cb41de184dc0e16a0e907633","date_created":"2018-12-12T10:09:20Z","date_updated":"2020-07-14T12:45:35Z"}],"oa_version":"Submitted Version","pubrep_id":"685","intvolume":" 8042","ddc":["000","004"],"status":"public","title":"Digital signatures with minimal overhead from indifferentiable random invertible functions","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2258","abstract":[{"lang":"eng","text":"In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ| − |m|. A simple argument shows that for any scheme with “n bits security” |τ| − |m| ≥ n, i.e., the overhead is lower bounded by the security parameter n. Currently, the best known constructions in the random oracle model are far from this lower bound requiring an overhead of n + logq h , where q h is the number of queries to the random oracle. In this paper we give a construction which basically matches the n bit lower bound. We propose a simple digital signature scheme with n + o(logq h ) bits overhead, where q h denotes the number of random oracle queries.\r\n\r\nOur construction works in two steps. First, we propose a signature scheme with message recovery having optimal overhead in a new ideal model, the random invertible function model. Second, we show that a four-round Feistel network with random oracles as round functions is tightly “public-indifferentiable” from a random invertible function. At the core of our indifferentiability proof is an almost tight upper bound for the expected number of edges of the densest “small” subgraph of a random Cayley graph, which may be of independent interest.\r\n"}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-40041-4_31","conference":{"start_date":"2013-08-18","location":"Santa Barbara, CA, United States","end_date":"2013-08-22","name":"CRYPTO: International Cryptology Conference"},"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","oa":1,"month":"01","volume":8042,"date_updated":"2021-01-12T06:56:21Z","date_created":"2018-12-11T11:56:37Z","author":[{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654"},{"full_name":"Szegedy, Mario","last_name":"Szegedy","first_name":"Mario"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2013","publist_id":"4688","ec_funded":1,"file_date_updated":"2020-07-14T12:45:35Z"},{"day":"01","has_accepted_license":"1","date_published":"2013-12-01T00:00:00Z","page":"559 - 587","publication":"VÖB Mitteilungen","citation":{"mla":"Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen, vol. 66, no. 3/4, Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.","short":"P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587.","chicago":"Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare, 2013.","ama":"Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 2013;66(3/4):559-587.","ista":"Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587.","apa":"Danowski, P., Goldfarb, D., Schaffner, V., & Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen. Verein Österreichischer Bibliothekarinnen und Bibliothekare.","ieee":"P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” VÖB Mitteilungen, vol. 66, no. 3/4. Verein Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013."},"abstract":[{"text":"Linked (Open) Data - bibliographic data on the Semantic Web. Report of the Working Group on Linked Data to the plenary assembly of the Austrian Library Network (translation of the title). Linked Data stands for a certain approach to publishing data on the Web. The underlying idea is to harmonise heterogeneous data sources of different origin in order to improve their accessibility and interoperability, effectively making them queryable as a big distributed database. This report summarises relevant developments in Europe as well as the Linked Data Working Group‘s strategic and technical considerations regarding the publishing of the Austrian Library Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement that the implementation of Linked Data principles within the OBV can only be taken into consideration accompanied by a discussion about the provision of the datasets under a free license.","lang":"eng"},{"lang":"ger","text":"Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz, die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst \r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes (OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht werden sollte."}],"issue":"3/4","type":"journal_article","oa_version":"Published Version","file":[{"file_id":"4669","relation":"main_file","date_created":"2018-12-12T10:08:09Z","date_updated":"2020-07-14T12:45:35Z","checksum":"ae57ffcee3720adcc27b0f2767a1e04b","file_name":"IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":881545}],"popular_science":"1","pubrep_id":"719","title":"Linked (Open) Data - Bibliographische Daten im Semantic Web","ddc":["020"],"status":"public","intvolume":" 66","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2256","month":"12","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2020-07-14T12:45:35Z","publist_id":"4690","date_created":"2018-12-11T11:56:36Z","date_updated":"2021-01-12T06:56:20Z","volume":66,"author":[{"orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","last_name":"Danowski","first_name":"Patrick","full_name":"Danowski, Patrick"},{"full_name":"Goldfarb, Doron","first_name":"Doron","last_name":"Goldfarb"},{"full_name":"Schaffner, Verena","last_name":"Schaffner","first_name":"Verena"},{"last_name":"Seidler","first_name":"Wolfram","full_name":"Seidler, Wolfram"}],"publication_status":"published","publisher":"Verein Österreichischer Bibliothekarinnen und Bibliothekare","department":[{"_id":"E-Lib"}],"year":"2013"},{"date_published":"2013-06-01T00:00:00Z","page":"518 - 533","citation":{"ista":"Bernhard D, Fuchsbauer G, Ghadafi E. 2013. Efficient signatures of knowledge and DAA in the standard model. 7954, 518–533.","ieee":"D. Bernhard, G. Fuchsbauer, and E. Ghadafi, “Efficient signatures of knowledge and DAA in the standard model,” vol. 7954. Springer, pp. 518–533, 2013.","apa":"Bernhard, D., Fuchsbauer, G., & Ghadafi, E. (2013). Efficient signatures of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography and Network Security, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-642-38980-1_33","ama":"Bernhard D, Fuchsbauer G, Ghadafi E. Efficient signatures of knowledge and DAA in the standard model. 2013;7954:518-533. doi:10.1007/978-3-642-38980-1_33","chicago":"Bernhard, David, Georg Fuchsbauer, and Essam Ghadafi. “Efficient Signatures of Knowledge and DAA in the Standard Model.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-38980-1_33.","mla":"Bernhard, David, et al. Efficient Signatures of Knowledge and DAA in the Standard Model. Vol. 7954, Springer, 2013, pp. 518–33, doi:10.1007/978-3-642-38980-1_33.","short":"D. Bernhard, G. Fuchsbauer, E. Ghadafi, 7954 (2013) 518–533."},"day":"01","series_title":"Lecture Notes in Computer Science","scopus_import":1,"oa_version":"Submitted Version","intvolume":" 7954","status":"public","title":"Efficient signatures of knowledge and DAA in the standard model","_id":"2260","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Direct Anonymous Attestation (DAA) is one of the most complex cryptographic protocols deployed in practice. It allows an embedded secure processor known as a Trusted Platform Module (TPM) to attest to the configuration of its host computer without violating the owner’s privacy. DAA has been standardized by the Trusted Computing Group and ISO/IEC.\r\n\r\nThe security of the DAA standard and all existing schemes is analyzed in the random-oracle model. We provide the first constructions of DAA in the standard model, that is, without relying on random oracles. Our constructions use new building blocks, including the first efficient signatures of knowledge in the standard model, which have many applications beyond DAA.\r\n"}],"alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-38980-1_33","conference":{"name":"ACNS: Applied Cryptography and Network Security","end_date":"2013-06-28","start_date":"2013-06-25","location":"Banff, AB, Canada"},"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2012/475"}],"month":"06","volume":7954,"date_created":"2018-12-11T11:56:37Z","date_updated":"2020-08-11T10:09:44Z","author":[{"full_name":"Bernhard, David","last_name":"Bernhard","first_name":"David"},{"last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"full_name":"Ghadafi, Essam","first_name":"Essam","last_name":"Ghadafi"}],"publisher":"Springer","department":[{"_id":"KrPi"}],"publication_status":"published","year":"2013","publist_id":"4686"},{"month":"02","doi":"10.1242/dev.085621","language":[{"iso":"eng"}],"external_id":{"pmid":["23293287"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3561788/","open_access":"1"}],"oa":1,"quality_controlled":"1","publist_id":"4681","author":[{"last_name":"Liang","first_name":"Huixuan","full_name":"Liang, Huixuan"},{"full_name":"Xiao, Guanxi","last_name":"Xiao","first_name":"Guanxi"},{"first_name":"Haifeng","last_name":"Yin","full_name":"Yin, Haifeng"},{"orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87","last_name":"Hippenmeyer","first_name":"Simon","full_name":"Hippenmeyer, Simon"},{"first_name":"Jonathan","last_name":"Horowitz","full_name":"Horowitz, Jonathan"},{"full_name":"Ghashghaei, Troy","first_name":"Troy","last_name":"Ghashghaei"}],"volume":140,"date_created":"2018-12-11T11:56:39Z","date_updated":"2021-01-12T06:56:23Z","pmid":1,"year":"2013","publisher":"Company of Biologists","department":[{"_id":"SiHi"}],"publication_status":"published","article_processing_charge":"No","day":"01","scopus_import":1,"date_published":"2013-02-01T00:00:00Z","citation":{"ama":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 2013;140(3):552-561. doi:10.1242/dev.085621","ista":"Liang H, Xiao G, Yin H, Hippenmeyer S, Horowitz J, Ghashghaei T. 2013. Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. 140(3), 552–561.","apa":"Liang, H., Xiao, G., Yin, H., Hippenmeyer, S., Horowitz, J., & Ghashghaei, T. (2013). Neural development is dependent on the function of specificity protein 2 in cell cycle progression. Development. Company of Biologists. https://doi.org/10.1242/dev.085621","ieee":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, and T. Ghashghaei, “Neural development is dependent on the function of specificity protein 2 in cell cycle progression,” Development, vol. 140, no. 3. Company of Biologists, pp. 552–561, 2013.","mla":"Liang, Huixuan, et al. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development, vol. 140, no. 3, Company of Biologists, 2013, pp. 552–61, doi:10.1242/dev.085621.","short":"H. Liang, G. Xiao, H. Yin, S. Hippenmeyer, J. Horowitz, T. Ghashghaei, Development 140 (2013) 552–561.","chicago":"Liang, Huixuan, Guanxi Xiao, Haifeng Yin, Simon Hippenmeyer, Jonathan Horowitz, and Troy Ghashghaei. “Neural Development Is Dependent on the Function of Specificity Protein 2 in Cell Cycle Progression.” Development. Company of Biologists, 2013. https://doi.org/10.1242/dev.085621."},"publication":"Development","page":"552 - 561","issue":"3","abstract":[{"lang":"eng","text":"Faithful progression through the cell cycle is crucial to the maintenance and developmental potential of stem cells. Here, we demonstrate that neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs) employ a zinc-finger transcription factor specificity protein 2 (Sp2) as a cell cycle regulator in two temporally and spatially distinct progenitor domains. Differential conditional deletion of Sp2 in early embryonic cerebral cortical progenitors, and perinatal olfactory bulb progenitors disrupted transitions through G1, G2 and M phases, whereas DNA synthesis appeared intact. Cell-autonomous function of Sp2 was identified by deletion of Sp2 using mosaic analysis with double markers, which clearly established that conditional Sp2-null NSCs and NPCs are M phase arrested in vivo. Importantly, conditional deletion of Sp2 led to a decline in the generation of NPCs and neurons in the developing and postnatal brains. Our findings implicate Sp2-dependent mechanisms as novel regulators of cell cycle progression, the absence of which disrupts neurogenesis in the embryonic and postnatal brain."}],"type":"journal_article","oa_version":"Submitted Version","_id":"2264","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","intvolume":" 140","title":"Neural development is dependent on the function of specificity protein 2 in cell cycle progression","status":"public"},{"doi":"DOI: 10.1111/cgf.12061","date_published":"2013-05-06T00:00:00Z","citation":{"chicago":"Auzinger, Thomas, Michael Wimmer, and Stefan Jeschke. “Analytic Visibility on the GPU.” Computer Graphics Forum. Wiley-Blackwell, 2013. https://doi.org/DOI: 10.1111/cgf.12061.","short":"T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 32 (2013) 409–418.","mla":"Auzinger, Thomas, et al. “Analytic Visibility on the GPU.” Computer Graphics Forum, vol. 32, no. 124, Wiley-Blackwell, 2013, pp. 409–18, doi:DOI: 10.1111/cgf.12061.","ieee":"T. Auzinger, M. Wimmer, and S. Jeschke, “Analytic Visibility on the GPU,” Computer Graphics Forum, vol. 32, no. 124. Wiley-Blackwell, pp. 409–418, 2013.","apa":"Auzinger, T., Wimmer, M., & Jeschke, S. (2013). Analytic Visibility on the GPU. Computer Graphics Forum. Wiley-Blackwell. https://doi.org/DOI: 10.1111/cgf.12061","ista":"Auzinger T, Wimmer M, Jeschke S. 2013. Analytic Visibility on the GPU. Computer Graphics Forum. 32(124), 409–418.","ama":"Auzinger T, Wimmer M, Jeschke S. Analytic Visibility on the GPU. Computer Graphics Forum. 2013;32(124):409-418. doi:DOI: 10.1111/cgf.12061"},"publication":"Computer Graphics Forum","page":"409 - 418","quality_controlled":0,"day":"06","month":"05","author":[{"full_name":"Thomas Auzinger","orcid":"0000-0002-1546-3265","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","first_name":"Thomas"},{"first_name":"Michael","last_name":"Wimmer","full_name":"Wimmer, Michael"},{"full_name":"Stefan Jeschke","first_name":"Stefan","last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"}],"volume":32,"date_updated":"2021-01-12T06:56:25Z","date_created":"2018-12-11T11:56:40Z","_id":"2269","year":"2013","acknowledgement":"Funding was provided by the FWF grant P20768-N13.\nWe want to thank the reviewers for their insightful and helpful remarks and Gernot Ziegler for providing help with CUDA. ","intvolume":" 32","publisher":"Wiley-Blackwell","status":"public","publication_status":"published","title":"Analytic Visibility on the GPU","publist_id":"4675","issue":124,"abstract":[{"lang":"eng","text":"This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods."}],"extern":1,"type":"journal_article"},{"date_published":"2013-12-31T00:00:00Z","conference":{"start_date":"2013-07-14","location":"Bellevue, WA, United States","end_date":"2013-07-18","name":"AAAI: Conference on Artificial Intelligence"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1108.5248"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1108.5248"}],"oa":1,"citation":{"ista":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence, 81–87.","apa":"Bachrach, Y., Kohli, P., Kolmogorov, V., & Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.","ieee":"Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.","ama":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures in Cooperative Graph Games. In: AAAI Press; 2013:81-87.","chicago":"Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013.","mla":"Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87.","short":"Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87."},"page":"81-87","quality_controlled":"1","month":"12","day":"31","author":[{"full_name":"Bachrach, Yoram","first_name":"Yoram","last_name":"Bachrach"},{"full_name":"Kohli, Pushmeet","last_name":"Kohli","first_name":"Pushmeet"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"},{"first_name":"Morteza","last_name":"Zadimoghaddam","full_name":"Zadimoghaddam, Morteza"}],"oa_version":"None","date_created":"2018-12-11T11:56:41Z","date_updated":"2021-01-12T06:56:25Z","_id":"2270","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","department":[{"_id":"VlKo"}],"publisher":"AAAI Press","publication_status":"published","status":"public","title":"Optimal Coalition Structures in Cooperative Graph Games","publist_id":"4674","abstract":[{"text":"Representation languages for coalitional games are a key research area in algorithmic game theory. There is an inher-\r\nent tradeoff between how general a language is, allowing it to capture more elaborate games, and how hard it is computationally to optimize and solve such games. One prominent such language is the simple yet expressive\r\nWeighted Graph Games (WGGs) representation (Deng and Papadimitriou 1994), which maintains knowledge about synergies between agents in the form of an edge weighted graph. We consider the problem of finding the optimal coalition structure in WGGs. The agents in such games are vertices in a graph, and the value of a coalition is the sum of the weights of the edges present between coalition members. The optimal coalition structure is a partition of the agents to coalitions, that maximizes the sum of utilities obtained by the coalitions. We show that finding the optimal coalition structure is not only hard for general graphs, but is also intractable for restricted families such as planar graphs which are amenable for many other combinatorial problems. We then provide algorithms with constant factor approximations for planar, minorfree and bounded degree graphs.","lang":"eng"}],"type":"conference"},{"day":"22","month":"09","date_published":"2013-09-22T00:00:00Z","quality_controlled":0,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5655"}],"oa":1,"citation":{"chicago":"Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.","short":"V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.","mla":"Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.","ieee":"V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.","apa":"Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.","ista":"Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.","ama":"Kolmogorov V. Reweighted Message Passing Revisited. IST Austria; 2013."},"extern":0,"publist_id":"4671","abstract":[{"text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results.","lang":"eng"}],"type":"report","date_created":"2018-12-11T11:56:42Z","date_updated":"2019-01-24T13:07:32Z","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov"}],"department":[{"_id":"VlKo"}],"publisher":"IST Austria","publication_status":"published","status":"public","title":"Reweighted message passing revisited","year":"2013","_id":"2273"},{"day":"01","month":"11","scopus_import":1,"language":[{"iso":"eng"}],"date_published":"2013-11-01T00:00:00Z","doi":"10.1242/jcs.125617","quality_controlled":"1","page":"4873 - 4884","publication":"Journal of Cell Science","citation":{"ieee":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, and A. Carmena, “A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development,” Journal of Cell Science, vol. 126, no. 21. Company of Biologists, pp. 4873–4884, 2013.","apa":"Pérez Gómez, R., Slovakova, J., Rives Quinto, N., Krejčí, A., & Carmena, A. (2013). A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. Company of Biologists. https://doi.org/10.1242/jcs.125617","ista":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. 2013. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 126(21), 4873–4884.","ama":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 2013;126(21):4873-4884. doi:10.1242/jcs.125617","chicago":"Pérez Gómez, Raquel, Jana Slovakova, Noemí Rives Quinto, Alena Krejčí, and Ana Carmena. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science. Company of Biologists, 2013. https://doi.org/10.1242/jcs.125617.","short":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, A. Carmena, Journal of Cell Science 126 (2013) 4873–4884.","mla":"Pérez Gómez, Raquel, et al. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” Journal of Cell Science, vol. 126, no. 21, Company of Biologists, 2013, pp. 4873–84, doi:10.1242/jcs.125617."},"abstract":[{"lang":"eng","text":"It is firmly established that interactions between neurons and glia are fundamental across species for the correct establishment of a functional brain. Here, we found that the glia of the Drosophila larval brain display an essential non-autonomous role during the development of the optic lobe. The optic lobe develops from neuroepithelial cells that proliferate by dividing symmetrically until they switch to asymmetric/differentiative divisions that generate neuroblasts. The proneural gene lethal of scute (l9sc) is transiently activated by the epidermal growth factor receptor (EGFR)-Ras signal transduction pathway at the leading edge of a proneural wave that sweeps from medial to lateral neuroepithelium, promoting this switch. This process is tightly regulated by the tissue-autonomous function within the neuroepithelium of multiple signaling pathways, including EGFR-Ras and Notch. This study shows that the Notch ligand Serrate (Ser) is expressed in the glia and it forms a complex in vivo with Notch and Canoe, which colocalize at the adherens junctions of neuroepithelial cells. This complex is crucial for interactions between glia and neuroepithelial cells during optic lobe development. Ser is tissue-autonomously required in the glia where it activates Notch to regulate its proliferation, and non-autonomously in the neuroepithelium where Ser induces Notch signaling to avoid the premature activation of the EGFR-Ras pathway and hence of L9sc. Interestingly, different Notch activity reporters showed very different expression patterns in the glia and in the neuroepithelium, suggesting the existence of tissue-specific factors that promote the expression of particular Notch target genes or/and a reporter response dependent on different thresholds of Notch signaling."}],"publist_id":"4658","issue":"21","type":"journal_article","date_created":"2018-12-11T11:56:43Z","date_updated":"2021-01-12T06:56:29Z","volume":126,"oa_version":"None","author":[{"full_name":"Pérez Gómez, Raquel","first_name":"Raquel","last_name":"Pérez Gómez"},{"full_name":"Slovakova, Jana","first_name":"Jana","last_name":"Slovakova","id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Noemí","last_name":"Rives Quinto","full_name":"Rives Quinto, Noemí"},{"full_name":"Krejčí, Alena","last_name":"Krejčí","first_name":"Alena"},{"first_name":"Ana","last_name":"Carmena","full_name":"Carmena, Ana"}],"title":"A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development","status":"public","publication_status":"published","publisher":"Company of Biologists","intvolume":" 126","department":[{"_id":"CaHe"}],"_id":"2278","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"conference","publist_id":"4668","abstract":[{"lang":"eng","text":"The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19, 20]. It identifies a part of an optimal solution by running k maxflow computations, where k is the number of labels. The number of “labeled” pixels can be significant in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce the runtime to O (log k) maxflow computations (or one parametric maxflow computation). Furthermore, the output of our algorithm allows to speed-up the subsequent alpha expansion for the unlabeled part, or can be used as it is for time-critical applications. To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7] for Tree Metrics . We also show a connection to k-submodular functions from combinatorial optimization, and discuss k-submodular relaxations for general energy functions."}],"department":[{"_id":"JoCs"},{"_id":"VlKo"}],"publisher":"IEEE","status":"public","publication_status":"published","title":"Potts model, parametric maxflow and k-submodular functions","_id":"2276","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","date_updated":"2021-01-12T06:56:28Z","date_created":"2018-12-11T11:56:43Z","author":[{"full_name":"Gridchyn, Igor","first_name":"Igor","last_name":"Gridchyn","id":"4B60654C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"month":"12","day":"01","page":"2320 - 2327","quality_controlled":"1","citation":{"ama":"Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular functions. In: IEEE; 2013:2320-2327. doi:10.1109/ICCV.2013.288","ista":"Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision, 2320–2327.","ieee":"I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.","apa":"Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.288","mla":"Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.","short":"I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.","chicago":"Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,” 2320–27. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.288."},"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.1771"}],"external_id":{"arxiv":["1310.1771"]},"language":[{"iso":"eng"}],"doi":"10.1109/ICCV.2013.288","date_published":"2013-12-01T00:00:00Z","conference":{"name":"ICCV: International Conference on Computer Vision","start_date":"2013-12-01","location":"Sydney, Australia","end_date":"2013-12-08"}},{"_id":"2280","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 55","title":"Packing ellipsoids with overlap","status":"public","oa_version":"Preprint","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented."}],"citation":{"ama":"Uhler C, Wright S. Packing ellipsoids with overlap. SIAM Review. 2013;55(4):671-706. doi:10.1137/120872309","ista":"Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706.","ieee":"C. Uhler and S. Wright, “Packing ellipsoids with overlap,” SIAM Review, vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706, 2013.","apa":"Uhler, C., & Wright, S. (2013). Packing ellipsoids with overlap. SIAM Review. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/120872309","mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013, pp. 671–706, doi:10.1137/120872309.","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.","chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM Review. Society for Industrial and Applied Mathematics , 2013. https://doi.org/10.1137/120872309."},"publication":"SIAM Review","page":"671 - 706","date_published":"2013-11-07T00:00:00Z","scopus_import":1,"day":"07","year":"2013","department":[{"_id":"CaUh"}],"publisher":"Society for Industrial and Applied Mathematics ","publication_status":"published","author":[{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7008-0216","first_name":"Caroline","last_name":"Uhler","full_name":"Uhler, Caroline"},{"full_name":"Wright, Stephen","first_name":"Stephen","last_name":"Wright"}],"volume":55,"date_updated":"2021-01-12T06:56:30Z","date_created":"2018-12-11T11:56:44Z","publist_id":"4655","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1204.0235","open_access":"1"}],"external_id":{"arxiv":["1204.0235"]},"quality_controlled":"1","doi":"10.1137/120872309","language":[{"iso":"eng"}],"month":"11"},{"_id":"2287","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 3","title":"The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant","status":"public","ddc":["576"],"pubrep_id":"416","file":[{"creator":"system","content_type":"application/pdf","file_size":626949,"file_name":"IST-2016-416-v1+1_Pickup_et_al-2013-Ecology_and_Evolution.pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:17:35Z","checksum":"b5531bab4c0dec396bf5c8497fe178bf","file_id":"5290","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Negative frequency-dependent selection should result in equal sex ratios in large populations of dioecious flowering plants, but deviations from equality are commonly reported. A variety of ecological and genetic factors can explain biased sex ratios, although the mechanisms involved are not well understood. Most dioecious species are long-lived and/or clonal complicating efforts to identify stages during the life cycle when biases develop. We investigated the demographic correlates of sex-ratio variation in two chromosome races of Rumex hastatulus, an annual, wind-pollinated colonizer of open habitats from the southern USA. We examined sex ratios in 46 populations and evaluated the hypothesis that the proximity of males in the local mating environment, through its influence on gametophytic selection, is the primary cause of female-biased sex ratios. Female-biased sex ratios characterized most populations of R. hastatulus (mean sex ratio = 0.62), with significant female bias in 89% of populations. Large, high-density populations had the highest proportion of females, whereas smaller, low-density populations had sex ratios closer to equality. Progeny sex ratios were more female biased when males were in closer proximity to females, a result consistent with the gametophytic selection hypothesis. Our results suggest that interactions between demographic and genetic factors are probably the main cause of female-biased sex ratios in R. hastatulus. The annual life cycle of this species may limit the scope for selection against males and may account for the weaker degree of bias in comparison with perennial Rumex species."}],"citation":{"short":"M. Pickup, S. Barrett, Ecology and Evolution 3 (2013) 629–639.","mla":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution, vol. 3, no. 3, Wiley-Blackwell, 2013, pp. 629–39, doi:10.1002/ece3.465.","chicago":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” Ecology and Evolution. Wiley-Blackwell, 2013. https://doi.org/10.1002/ece3.465.","ama":"Pickup M, Barrett S. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 2013;3(3):629-639. doi:10.1002/ece3.465","apa":"Pickup, M., & Barrett, S. (2013). The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. Wiley-Blackwell. https://doi.org/10.1002/ece3.465","ieee":"M. Pickup and S. Barrett, “The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant,” Ecology and Evolution, vol. 3, no. 3. Wiley-Blackwell, pp. 629–639, 2013.","ista":"Pickup M, Barrett S. 2013. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 3(3), 629–639."},"publication":"Ecology and Evolution","page":"629 - 639","date_published":"2013-03-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","year":"2013","publisher":"Wiley-Blackwell","department":[{"_id":"NiBa"}],"publication_status":"published","author":[{"full_name":"Pickup, Melinda","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","last_name":"Pickup","first_name":"Melinda"},{"full_name":"Barrett, Spencer","last_name":"Barrett","first_name":"Spencer"}],"volume":3,"date_updated":"2021-01-12T06:56:32Z","date_created":"2018-12-11T11:56:47Z","publist_id":"4644","file_date_updated":"2020-07-14T12:45:37Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","doi":"10.1002/ece3.465","language":[{"iso":"eng"}],"month":"03"},{"publication_status":"published","publisher":"Nature Publishing Group","department":[{"_id":"CaHe"}],"year":"2013","acknowledgement":"This work was supported by the IST Austria and MPI-CBG ","date_updated":"2023-02-21T17:02:44Z","date_created":"2018-12-11T11:56:45Z","volume":15,"author":[{"full_name":"Campinho, Pedro","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8526-5416","first_name":"Pedro","last_name":"Campinho"},{"first_name":"Martin","last_name":"Behrndt","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","full_name":"Behrndt, Martin"},{"full_name":"Ranft, Jonas","first_name":"Jonas","last_name":"Ranft"},{"full_name":"Risler, Thomas","first_name":"Thomas","last_name":"Risler"},{"last_name":"Minc","first_name":"Nicolas","full_name":"Minc, Nicolas"},{"full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566"}],"related_material":{"record":[{"id":"1403","status":"public","relation":"dissertation_contains"}]},"publist_id":"4652","quality_controlled":"1","project":[{"name":"Control of Epithelial Cell Layer Spreading in Zebrafish","call_identifier":"FWF","grant_number":"I 930-B20","_id":"252ABD0A-B435-11E9-9278-68D0E5697425"}],"oa":1,"main_file_link":[{"url":"http://hal.upmc.fr/hal-00983313/","open_access":"1"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"}],"language":[{"iso":"eng"}],"doi":"10.1038/ncb2869","month":"11","title":"Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly","status":"public","intvolume":" 15","_id":"2282","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","type":"journal_article","abstract":[{"lang":"eng","text":"Epithelial spreading is a common and fundamental aspect of various developmental and disease-related processes such as epithelial closure and wound healing. A key challenge for epithelial tissues undergoing spreading is to increase their surface area without disrupting epithelial integrity. Here we show that orienting cell divisions by tension constitutes an efficient mechanism by which the enveloping cell layer (EVL) releases anisotropic tension while undergoing spreading during zebrafish epiboly. The control of EVL cell-division orientation by tension involves cell elongation and requires myosin II activity to align the mitotic spindle with the main tension axis. We also found that in the absence of tension-oriented cell divisions and in the presence of increased tissue tension, EVL cells undergo ectopic fusions, suggesting that the reduction of tension anisotropy by oriented cell divisions is required to prevent EVL cells from fusing. We conclude that cell-division orientation by tension constitutes a key mechanism for limiting tension anisotropy and thus promoting tissue spreading during EVL epiboly."}],"page":"1405 - 1414","publication":"Nature Cell Biology","citation":{"chicago":"Campinho, Pedro, Martin Behrndt, Jonas Ranft, Thomas Risler, Nicolas Minc, and Carl-Philipp J Heisenberg. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology. Nature Publishing Group, 2013. https://doi.org/10.1038/ncb2869.","mla":"Campinho, Pedro, et al. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” Nature Cell Biology, vol. 15, Nature Publishing Group, 2013, pp. 1405–14, doi:10.1038/ncb2869.","short":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, C.-P.J. Heisenberg, Nature Cell Biology 15 (2013) 1405–1414.","ista":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. 2013. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 15, 1405–1414.","ieee":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, and C.-P. J. Heisenberg, “Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly,” Nature Cell Biology, vol. 15. Nature Publishing Group, pp. 1405–1414, 2013.","apa":"Campinho, P., Behrndt, M., Ranft, J., Risler, T., Minc, N., & Heisenberg, C.-P. J. (2013). Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. Nature Publishing Group. https://doi.org/10.1038/ncb2869","ama":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 2013;15:1405-1414. doi:10.1038/ncb2869"},"date_published":"2013-11-10T00:00:00Z","scopus_import":1,"day":"10"},{"date_published":"2013-11-14T00:00:00Z","doi":"10.1007/s00114-013-1115-5","language":[{"iso":"eng"}],"citation":{"ieee":"C. Pull, W. Hughes, and M. Brown, “Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ,” Naturwissenschaften, vol. 100, no. 12. Springer, pp. 1125–1136, 2013.","apa":"Pull, C., Hughes, W., & Brown, M. (2013). Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. Springer. https://doi.org/10.1007/s00114-013-1115-5","ista":"Pull C, Hughes W, Brown M. 2013. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 100(12), 1125–1136.","ama":"Pull C, Hughes W, Brown M. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 2013;100(12):1125-1136. doi:10.1007/s00114-013-1115-5","chicago":"Pull, Christopher, William Hughes, and Markus Brown. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften. Springer, 2013. https://doi.org/10.1007/s00114-013-1115-5.","short":"C. Pull, W. Hughes, M. Brown, Naturwissenschaften 100 (2013) 1125–1136.","mla":"Pull, Christopher, et al. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” Naturwissenschaften, vol. 100, no. 12, Springer, 2013, pp. 1125–36, doi:10.1007/s00114-013-1115-5."},"publication":"Naturwissenschaften","page":"1125 - 1136","quality_controlled":"1","day":"14","month":"11","scopus_import":1,"author":[{"full_name":"Pull, Christopher","first_name":"Christopher","last_name":"Pull","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1122-3982"},{"full_name":"Hughes, William","first_name":"William","last_name":"Hughes"},{"full_name":"Brown, Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","last_name":"Brown","first_name":"Markus"}],"volume":100,"oa_version":"None","date_updated":"2021-01-12T06:56:31Z","date_created":"2018-12-11T11:56:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2283","year":"2013","publisher":"Springer","intvolume":" 100","department":[{"_id":"SyCr"}],"title":"Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ","status":"public","publication_status":"published","issue":"12","publist_id":"4649","abstract":[{"text":"Pathogens exert a strong selection pressure on organisms to evolve effective immune defences. In addition to individual immunity, social organisms can act cooperatively to produce collective defences. In many ant species, queens have the option to found a colony alone or in groups with other, often unrelated, conspecifics. These associations are transient, usually lasting only as long as each queen benefits from the presence of others. In fact, once the first workers emerge, queens fight to the death for dominance. One potential advantage of co-founding may be that queens benefit from collective disease defences, such as mutual grooming, that act against common soil pathogens. We test this hypothesis by exposing single and co-founding queens to a fungal parasite, in order to assess whether queens in co-founding associations have improved survival. Surprisingly, co-foundresses exposed to the entomopathogenic fungus Metarhizium did not engage in cooperative disease defences, and consequently, we find no direct benefit of multiple queens on survival. However, an indirect benefit was observed, with parasite-exposed queens producing more brood when they co-founded, than when they were alone. We suggest this is due to a trade-off between reproduction and immunity. Additionally, we report an extraordinary ability of the queens to tolerate an infection for long periods after parasite exposure. Our study suggests that there are no social immunity benefits for co-founding ant queens, but that in parasite-rich environments, the presence of additional queens may nevertheless improve the chances of colony founding success.","lang":"eng"}],"type":"journal_article"},{"month":"10","quality_controlled":"1","external_id":{"pmid":["24097062"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3817470/","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1038/emboj.2013.225","publist_id":"4645","department":[{"_id":"CaHe"}],"publisher":"Wiley-Blackwell","publication_status":"published","pmid":1,"year":"2013","volume":32,"date_created":"2018-12-11T11:56:46Z","date_updated":"2021-01-12T06:56:32Z","author":[{"orcid":"0000-0002-8526-5416","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","last_name":"Campinho","first_name":"Pedro","full_name":"Campinho, Pedro"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"scopus_import":1,"day":"04","page":"2783 - 2784","citation":{"apa":"Campinho, P., & Heisenberg, C.-P. J. (2013). The force and effect of cell proliferation. EMBO Journal. Wiley-Blackwell. https://doi.org/10.1038/emboj.2013.225","ieee":"P. Campinho and C.-P. J. Heisenberg, “The force and effect of cell proliferation,” EMBO Journal, vol. 32, no. 21. Wiley-Blackwell, pp. 2783–2784, 2013.","ista":"Campinho P, Heisenberg C-PJ. 2013. The force and effect of cell proliferation. EMBO Journal. 32(21), 2783–2784.","ama":"Campinho P, Heisenberg C-PJ. The force and effect of cell proliferation. EMBO Journal. 2013;32(21):2783-2784. doi:10.1038/emboj.2013.225","chicago":"Campinho, Pedro, and Carl-Philipp J Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal. Wiley-Blackwell, 2013. https://doi.org/10.1038/emboj.2013.225.","short":"P. Campinho, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 2783–2784.","mla":"Campinho, Pedro, and Carl-Philipp J. Heisenberg. “The Force and Effect of Cell Proliferation.” EMBO Journal, vol. 32, no. 21, Wiley-Blackwell, 2013, pp. 2783–84, doi:10.1038/emboj.2013.225."},"publication":"EMBO Journal","date_published":"2013-10-04T00:00:00Z","type":"journal_article","issue":"21","abstract":[{"lang":"eng","text":"The spatiotemporal control of cell divisions is a key factor in epithelial morphogenesis and patterning. Mao et al (2013) now describe how differential rates of proliferation within the Drosophila wing disc epithelium give rise to anisotropic tissue tension in peripheral/proximal regions of the disc. Such global tissue tension anisotropy in turn determines the orientation of cell divisions by controlling epithelial cell elongation."}],"intvolume":" 32","title":"The force and effect of cell proliferation","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2286","oa_version":"Submitted Version"},{"file_date_updated":"2020-07-14T12:45:37Z","publist_id":"4642","ec_funded":1,"author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"date_updated":"2021-01-12T06:56:33Z","date_created":"2018-12-11T11:56:47Z","volume":28,"year":"2013","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","month":"10","doi":"10.1007/s00450-013-0251-7","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"abstract":[{"text":"Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments.","lang":"eng"}],"issue":"4","type":"journal_article","pubrep_id":"626","file":[{"checksum":"f117a00f9f046165bfa95595681e08a0","date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:17:51Z","relation":"main_file","file_id":"5308","content_type":"application/pdf","file_size":570361,"creator":"system","access_level":"open_access","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf"}],"oa_version":"Published Version","_id":"2289","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Quantitative reactive modeling and verification","status":"public","ddc":["000"],"intvolume":" 28","day":"05","has_accepted_license":"1","scopus_import":1,"date_published":"2013-10-05T00:00:00Z","publication":"Computer Science Research and Development","citation":{"short":"T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.","mla":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:10.1007/s00450-013-0251-7.","chicago":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” Computer Science Research and Development. Springer, 2013. https://doi.org/10.1007/s00450-013-0251-7.","ama":"Henzinger TA. Quantitative reactive modeling and verification. Computer Science Research and Development. 2013;28(4):331-344. doi:10.1007/s00450-013-0251-7","apa":"Henzinger, T. A. (2013). Quantitative reactive modeling and verification. Computer Science Research and Development. Springer. https://doi.org/10.1007/s00450-013-0251-7","ieee":"T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013.","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344."},"page":"331 - 344"},{"page":"16259 - 16264","citation":{"ista":"Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J, Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.","apa":"Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R., … Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1309057110","ieee":"Y. Boutté et al., “ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation,” PNAS, vol. 110, no. 40. National Academy of Sciences, pp. 16259–16264, 2013.","ama":"Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 2013;110(40):16259-16264. doi:10.1073/pnas.1309057110","chicago":"Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1309057110.","mla":"Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” PNAS, vol. 110, no. 40, National Academy of Sciences, 2013, pp. 16259–64, doi:10.1073/pnas.1309057110.","short":"Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J. Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264."},"publication":"PNAS","date_published":"2013-10-01T00:00:00Z","scopus_import":1,"day":"01","intvolume":" 110","status":"public","title":"ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2290","oa_version":"Submitted Version","type":"journal_article","issue":"40","abstract":[{"text":"The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development.","lang":"eng"}],"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/"}],"external_id":{"pmid":["24043780"]},"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1309057110","month":"10","publisher":"National Academy of Sciences","department":[{"_id":"JiFr"}],"publication_status":"published","pmid":1,"year":"2013","volume":110,"date_updated":"2021-01-12T06:56:33Z","date_created":"2018-12-11T11:56:48Z","author":[{"last_name":"Boutté","first_name":"Yohann","full_name":"Boutté, Yohann"},{"full_name":"Jonsson, Kristoffer","last_name":"Jonsson","first_name":"Kristoffer"},{"full_name":"Mcfarlane, Heather","first_name":"Heather","last_name":"Mcfarlane"},{"last_name":"Johnson","first_name":"Errin","full_name":"Johnson, Errin"},{"last_name":"Gendre","first_name":"Delphine","full_name":"Gendre, Delphine"},{"full_name":"Swarup, Ranjan","last_name":"Swarup","first_name":"Ranjan"},{"last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí"},{"last_name":"Samuels","first_name":"Lacey","full_name":"Samuels, Lacey"},{"full_name":"Robert, Stéphanie","last_name":"Robert","first_name":"Stéphanie"},{"first_name":"Rishikesh","last_name":"Bhalerao","full_name":"Bhalerao, Rishikesh"}],"publist_id":"4639"},{"ec_funded":1,"publist_id":"4634","abstract":[{"lang":"eng","text":"In this work we propose a system for automatic classification of Drosophila embryos into developmental stages.\r\nWhile the system is designed to solve an actual problem in biological research, we believe that the principle underly-\r\ning it is interesting not only for biologists, but also for researchers in computer vision. The main idea is to combine two orthogonal sources of information: one is a classifier trained on strongly invariant features, which makes it applicable to images of very different conditions, but also leads to rather noisy predictions. The other is a label propagation step based on a more powerful similarity measure that however is only consistent within specific subsets of the data at a time.\r\nIn our biological setup, the information sources are the shape and the staining patterns of embryo images. We show\r\nexperimentally that while neither of the methods can be used by itself to achieve satisfactory results, their combina-\r\ntion achieves prediction quality comparable to human performance."}],"type":"conference","author":[{"last_name":"Kazmar","first_name":"Tomas","full_name":"Kazmar, Tomas"},{"first_name":"Evgeny","last_name":"Kvon","full_name":"Kvon, Evgeny"},{"full_name":"Stark, Alexander","first_name":"Alexander","last_name":"Stark"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"oa_version":"Submitted Version","date_updated":"2021-01-12T06:56:35Z","date_created":"2018-12-11T11:56:49Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2294","year":"2013","publisher":"IEEE","department":[{"_id":"ChLa"}],"publication_status":"published","title":"Drosophila Embryo Stage Annotation using Label Propagation","status":"public","month":"12","day":"01","scopus_import":1,"doi":"10.1109/ICCV.2013.139","date_published":"2013-12-01T00:00:00Z","conference":{"end_date":"2013-12-08","location":"Sydney, Australia","start_date":"2013-12-01","name":"ICCV: International Conference on Computer Vision"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/ICCV2013.py"}],"citation":{"ieee":"T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation using Label Propagation,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013.","apa":"Kazmar, T., Kvon, E., Stark, A., & Lampert, C. (2013). Drosophila Embryo Stage Annotation using Label Propagation. Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.139","ista":"Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation using Label Propagation. ICCV: International Conference on Computer Vision.","ama":"Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using Label Propagation. In: IEEE; 2013. doi:10.1109/ICCV.2013.139","chicago":"Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. https://doi.org/10.1109/ICCV.2013.139.","short":"T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013.","mla":"Kazmar, Tomas, et al. Drosophila Embryo Stage Annotation Using Label Propagation. IEEE, 2013, doi:10.1109/ICCV.2013.139."},"project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1"},{"alternative_title":["LNCS"],"type":"conference_editor","publist_id":"4636","abstract":[{"text":"This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.","lang":"eng"}],"department":[{"_id":"KrCh"}],"publisher":"Springer","editor":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Sgall","first_name":"Jiri","full_name":"Sgall, Jiri"}],"intvolume":" 8087","publication_status":"published","status":"public","title":"Mathematical Foundations of Computer Science 2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2292","year":"2013","oa_version":"None","volume":8087,"date_created":"2018-12-11T11:56:48Z","date_updated":"2020-08-11T10:09:45Z","series_title":"Lecture Notes in Computer Science","scopus_import":1,"publication_identifier":{"isbn":["978-3-642-40312-5"]},"day":"08","month":"08","page":"VI - 854","quality_controlled":"1","citation":{"mla":"Chatterjee, Krishnendu, and Jiri Sgall, editors. Mathematical Foundations of Computer Science 2013. Vol. 8087, Springer, 2013, p. VI-854, doi:10.1007/978-3-642-40313-2.","short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","chicago":"Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40313-2.","ama":"Chatterjee K, Sgall J, eds. Mathematical Foundations of Computer Science 2013. Vol 8087. Springer; 2013:VI-854. doi:10.1007/978-3-642-40313-2","ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","apa":"Chatterjee, K., & Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40313-2","ieee":"K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854."},"language":[{"iso":"eng"}],"date_published":"2013-08-08T00:00:00Z","doi":"10.1007/978-3-642-40313-2","conference":{"location":"Klosterneuburg, Austria","start_date":"2013-08-26","end_date":"2013-08-30","name":"MFCS: Mathematical Foundations of Computer Science"}},{"date_updated":"2023-02-23T10:36:41Z","date_created":"2018-12-11T11:56:49Z","oa_version":"Submitted Version","author":[{"full_name":"Sharmanska, Viktoriia","orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","last_name":"Sharmanska","first_name":"Viktoriia"},{"last_name":"Quadrianto","first_name":"Novi","full_name":"Quadrianto, Novi"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"title":"Learning to rank using privileged information","publication_status":"published","status":"public","department":[{"_id":"ChLa"}],"publisher":"IEEE","year":"2013","_id":"2293","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Many computer vision problems have an asymmetric distribution of information between training and test time. In this work, we study the case where we are given additional information about the training data, which however will not be available at test time. This situation is called learning using privileged information (LUPI). We introduce two maximum-margin techniques that are able to make use of this additional source of information, and we show that the framework is applicable to several scenarios that have been studied in computer vision before. Experiments with attributes, bounding boxes, image tags and rationales as additional information in object classification show promising results."}],"publist_id":"4635","ec_funded":1,"type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2013-12-08","start_date":"2013-12-01","location":"Sydney, Australia","name":"ICCV: International Conference on Computer Vision"},"doi":"10.1109/ICCV.2013.107","date_published":"2013-12-01T00:00:00Z","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"page":"825 - 832","main_file_link":[{"open_access":"1","url":"www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf"}],"oa":1,"citation":{"chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning to Rank Using Privileged Information,” 825–32. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.107.","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.","mla":"Sharmanska, Viktoriia, et al. Learning to Rank Using Privileged Information. IEEE, 2013, pp. 825–32, doi:10.1109/ICCV.2013.107.","apa":"Sharmanska, V., Quadrianto, N., & Lampert, C. (2013). Learning to rank using privileged information (pp. 825–832). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.107","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged information,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 825–832.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged information. ICCV: International Conference on Computer Vision, 825–832.","ama":"Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information. In: IEEE; 2013:825-832. doi:10.1109/ICCV.2013.107"},"day":"01","month":"12","scopus_import":1},{"month":"09","day":"01","scopus_import":1,"conference":{"location":"New Orleans, LA, United States","start_date":"2013-09-26","end_date":"2013-09-28","name":"CSF: Computer Security Foundations"},"date_published":"2013-09-01T00:00:00Z","doi":"10.1109/CSF.2013.15","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2013/492"}],"citation":{"ista":"Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC. CSF: Computer Security Foundations, 115–129.","ieee":"A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129.","apa":"Ferrara, A., Fuchsbauer, G., & Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE. https://doi.org/10.1109/CSF.2013.15","ama":"Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In: IEEE; 2013:115-129. doi:10.1109/CSF.2013.15","chicago":"Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,” 115–29. IEEE, 2013. https://doi.org/10.1109/CSF.2013.15.","mla":"Ferrara, Anna, et al. Cryptographically Enforced RBAC. IEEE, 2013, pp. 115–29, doi:10.1109/CSF.2013.15.","short":"A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129."},"quality_controlled":"1","page":"115 - 129","abstract":[{"text":"Cryptographic access control promises to offer easily distributed trust and broader applicability, while reducing reliance on low-level online monitors. Traditional implementations of cryptographic access control rely on simple cryptographic primitives whereas recent endeavors employ primitives with richer functionality and security guarantees. Worryingly, few of the existing cryptographic access-control schemes come with precise guarantees, the gap between the policy specification and the implementation being analyzed only informally, if at all. In this paper we begin addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification, we look at the well-established Role-Based Access Control (RBAC) model, as used in a typical file system. In short, we provide a precise syntax for a computational version of RBAC, offer rigorous definitions for cryptographic policy enforcement of a large class of RBAC security policies, and demonstrate that an implementation based on attribute-based encryption meets our security notions. We view our main contribution as being at the conceptual level. Although we work with RBAC for concreteness, our general methodology could guide future research for uses of cryptography in other access-control models. \r\n","lang":"eng"}],"publist_id":"4637","type":"conference","author":[{"first_name":"Anna","last_name":"Ferrara","full_name":"Ferrara, Anna"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg"},{"last_name":"Warinschi","first_name":"Bogdan","full_name":"Warinschi, Bogdan"}],"date_updated":"2021-01-12T06:56:34Z","date_created":"2018-12-11T11:56:48Z","oa_version":"Submitted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2291","year":"2013","title":"Cryptographically enforced RBAC","publication_status":"published","status":"public","publisher":"IEEE","department":[{"_id":"KrPi"}]},{"citation":{"ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.","apa":"Gupta, A., & Henzinger, T. A. (Eds.). (2013). Computational Methods in Systems Biology (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. https://doi.org/10.1007/978-3-642-40708-6","ieee":"A. Gupta and T. A. Henzinger, Eds., Computational Methods in Systems Biology, vol. 8130. Springer, 2013.","ama":"Gupta A, Henzinger TA, eds. Computational Methods in Systems Biology. Vol 8130. Springer; 2013. doi:10.1007/978-3-642-40708-6","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. Computational Methods in Systems Biology. Vol. 8130. Springer, 2013. https://doi.org/10.1007/978-3-642-40708-6.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. Computational Methods in Systems Biology. Vol. 8130, Springer, 2013, doi:10.1007/978-3-642-40708-6.","short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013."},"quality_controlled":"1","conference":{"location":"Klosterneuburg, Austria","start_date":"2013-09-22","end_date":"2013-09-24","name":"CMSB: Computational Methods in Systems Biology"},"date_published":"2013-07-01T00:00:00Z","doi":"10.1007/978-3-642-40708-6","language":[{"iso":"eng"}],"month":"07","day":"01","publication_identifier":{"isbn":["978-3-642-40707-9"]},"year":"2013","_id":"2288","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Computational Methods in Systems Biology","status":"public","intvolume":" 8130","publisher":"Springer","department":[{"_id":"ToHe"}],"editor":[{"first_name":"Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:56:47Z","date_updated":"2019-08-02T12:37:44Z","volume":8130,"oa_version":"None","type":"conference_editor","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms."}],"publist_id":"4643"},{"month":"01","conference":{"name":"SAS: Static Analysis Symposium","end_date":"2013-06-22","start_date":"2013-06-20","location":"Seattle, WA, United States"},"doi":"10.1007/978-3-642-38856-9_10","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"file_date_updated":"2020-07-14T12:45:37Z","publist_id":"4630","ec_funded":1,"author":[{"full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi","first_name":"Cezara"},{"first_name":"Constantin","last_name":"Enea","full_name":"Enea, Constantin"},{"full_name":"Sighireanu, Mihaela","last_name":"Sighireanu","first_name":"Mihaela"}],"date_updated":"2021-01-12T06:56:36Z","date_created":"2018-12-11T11:56:50Z","volume":7935,"year":"2013","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","day":"01","has_accepted_license":"1","scopus_import":1,"date_published":"2013-01-01T00:00:00Z","citation":{"short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","mla":"Dragoi, Cezara, et al. Local Shape Analysis for Overlaid Data Structures. Vol. 7935, Springer, 2013, pp. 150–71, doi:10.1007/978-3-642-38856-9_10.","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. https://doi.org/10.1007/978-3-642-38856-9_10.","ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:10.1007/978-3-642-38856-9_10","ieee":"C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171.","apa":"Dragoi, C., Enea, C., & Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. https://doi.org/10.1007/978-3-642-38856-9_10","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171."},"page":"150 - 171","abstract":[{"lang":"eng","text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n"}],"type":"conference","alternative_title":["LNCS"],"pubrep_id":"196","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"IST-2014-196-v1+1_sas13.pdf","content_type":"application/pdf","file_size":299004,"creator":"system","relation":"main_file","file_id":"4824","checksum":"907edd33a5892e3af093365f1fd57ed7","date_created":"2018-12-12T10:10:36Z","date_updated":"2020-07-14T12:45:37Z"}],"_id":"2298","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","004"],"title":"Local shape analysis for overlaid data structures","status":"public","intvolume":" 7935"},{"scopus_import":1,"day":"01","has_accepted_license":"1","page":"585 - 601","publication":"International Journal on Software Tools for Technology Transfer","citation":{"mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:10.1007/s10009-011-0207-9.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” International Journal on Software Tools for Technology Transfer. Springer, 2013. https://doi.org/10.1007/s10009-011-0207-9.","ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 2013;15(5-6):585-601. doi:10.1007/s10009-011-0207-9","ista":"Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.","apa":"Godhal, Y., Chatterjee, K., & Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-011-0207-9","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013."},"date_published":"2013-10-01T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol."}],"issue":"5-6","title":"Synthesis of AMBA AHB from formal specification: A case study","ddc":["000"],"status":"public","intvolume":" 15","_id":"2299","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:11:53Z","date_updated":"2020-07-14T12:45:37Z","checksum":"57b06a732dd8d6349190dba6b5b0d33b","file_id":"4910","relation":"main_file","creator":"system","file_size":277372,"content_type":"application/pdf","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","access_level":"open_access"}],"pubrep_id":"87","month":"10","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s10009-011-0207-9","file_date_updated":"2020-07-14T12:45:37Z","publist_id":"4629","publication_status":"published","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"Springer","year":"2013","date_updated":"2021-01-12T06:56:37Z","date_created":"2018-12-11T11:56:51Z","volume":15,"author":[{"full_name":"Godhal, Yashdeep","first_name":"Yashdeep","last_name":"Godhal","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}]},{"abstract":[{"lang":"eng","text":"We present an overview of mathematical results on the low temperature properties of dilute quantum gases, which have been obtained in the past few years. The presentation includes a discussion of Bose-Einstein condensation, the excitation spectrum for trapped gases and its relation to superfluidity, as well as the appearance of quantized vortices in rotating systems. All these properties are intensely being studied in current experiments on cold atomic gases. We will give a description of the mathematics involved in understanding these phenomena, starting from the underlying many-body Schrödinger equation."}],"issue":"2","type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2297","status":"public","title":"Hot topics in cold gases: A mathematical physics perspective","intvolume":" 8","day":"24","scopus_import":1,"date_published":"2013-09-24T00:00:00Z","publication":"Japanese Journal of Mathematics","citation":{"short":"R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.","mla":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics, vol. 8, no. 2, Springer, 2013, pp. 185–232, doi:10.1007/s11537-013-1264-5.","chicago":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” Japanese Journal of Mathematics. Springer, 2013. https://doi.org/10.1007/s11537-013-1264-5.","ama":"Seiringer R. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 2013;8(2):185-232. doi:10.1007/s11537-013-1264-5","ieee":"R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,” Japanese Journal of Mathematics, vol. 8, no. 2. Springer, pp. 185–232, 2013.","apa":"Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. Springer. https://doi.org/10.1007/s11537-013-1264-5","ista":"Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232."},"page":"185 - 232","publist_id":"4631","author":[{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"date_updated":"2021-01-12T06:56:36Z","date_created":"2018-12-11T11:56:50Z","volume":8,"year":"2013","publication_status":"published","department":[{"_id":"RoSe"}],"publisher":"Springer","month":"09","doi":"10.1007/s11537-013-1264-5","language":[{"iso":"eng"}],"external_id":{"arxiv":["0908.3686"]},"main_file_link":[{"url":"http://arxiv.org/abs/0908.3686","open_access":"1"}],"oa":1,"quality_controlled":"1"},{"author":[{"full_name":"Danowski, Patrick","last_name":"Danowski","first_name":"Patrick","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Pohl","first_name":"Adrian","full_name":"Pohl, Adrian"}],"volume":50,"date_updated":"2021-12-21T12:17:19Z","date_created":"2018-12-11T11:56:53Z","year":"2013","publisher":"De Gruyter","department":[{"_id":"E-Lib"}],"publication_status":"published","publist_id":"4621","file_date_updated":"2020-07-14T12:45:38Z","doi":"10.1515/9783110278736","language":[{"iso":"ger"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","publication_identifier":{"isbn":[" 978-3-11-027634-3"],"issn":["2191-3587"],"eisbn":["9-783-1102-7873-6"]},"month":"09","pubrep_id":"725","file":[{"file_id":"4774","relation":"main_file","checksum":"807a408bbee519d792702828a32c6e85","date_created":"2018-12-12T10:09:49Z","date_updated":"2020-07-14T12:45:38Z","access_level":"open_access","file_name":"IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf","creator":"system","file_size":67731,"content_type":"application/pdf"},{"date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:50Z","checksum":"587e95c2ba24307a5a5d5bd1579429d9","relation":"main_file","file_id":"4775","content_type":"application/pdf","file_size":43563,"creator":"system","file_name":"IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf","access_level":"open_access"},{"creator":"system","file_size":11318599,"content_type":"application/pdf","access_level":"open_access","file_name":"IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf","checksum":"dbcada36bb32d725d9838615706e700f","date_created":"2018-12-12T10:09:51Z","date_updated":"2020-07-14T12:45:38Z","file_id":"4776","relation":"main_file"},{"file_size":330210,"content_type":"application/pdf","creator":"system","file_name":"IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf","access_level":"open_access","date_created":"2018-12-12T10:09:52Z","date_updated":"2020-07-14T12:45:38Z","checksum":"5235712bf0a49ccc8c2cb4f6c2560d43","relation":"main_file","file_id":"4777"},{"access_level":"open_access","file_name":"IST-2017-725-v1+5_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_FRBR,_Serials_und_CIDOC_CRM_-_Modellierung_von_fortlaufenden_Sammelwerken_unter_Verwendung_von_FRBRoo.pdf","creator":"system","content_type":"application/pdf","file_size":10652088,"file_id":"4778","relation":"main_file","checksum":"d851cc91f705da80617ac7df33c1c0e1","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:53Z"},{"access_level":"open_access","file_name":"IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf","creator":"system","file_size":6125273,"content_type":"application/pdf","file_id":"4779","relation":"main_file","checksum":"4e77b182692c58e50fc5251bf23cc584","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:54Z"},{"file_name":"IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf","access_level":"open_access","file_size":1893872,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4780","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:55Z","checksum":"3debae38064d5099d22f855c353a57ec"},{"access_level":"open_access","file_name":"IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf","creator":"system","content_type":"application/pdf","file_size":1095929,"file_id":"4781","relation":"main_file","checksum":"e630b330dc0b7522d2cf204587030252","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:09:56Z"},{"file_id":"4782","relation":"main_file","date_created":"2018-12-12T10:09:57Z","date_updated":"2020-07-14T12:45:38Z","checksum":"17edda91271bfcce8e1b6e77ca1c9d11","file_name":"IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf","access_level":"open_access","creator":"system","file_size":149699,"content_type":"application/pdf"},{"file_name":"IST-2017-725-v1+10_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_geht_in_die_Fläche__Der_B3Kat_stellt_seine_Daten_frei.pdf","access_level":"open_access","file_size":8828405,"content_type":"application/pdf","creator":"system","relation":"main_file","file_id":"4783","date_created":"2018-12-12T10:09:58Z","date_updated":"2020-07-14T12:45:38Z","checksum":"aacef6734b1de58aeb58024fc47c2373"},{"file_id":"4784","relation":"main_file","checksum":"0619451f7ff3ea641ce0b10c97831f47","date_created":"2018-12-12T10:09:59Z","date_updated":"2020-07-14T12:45:38Z","access_level":"open_access","file_name":"IST-2017-725-v1+11_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Open_Data_und_Linked_Data_in_einem_Informationssystem_für_die_Archäologie.pdf","creator":"system","content_type":"application/pdf","file_size":3191208},{"date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:00Z","checksum":"44dc8a9fc003f0edd912968958715a23","file_id":"4785","relation":"main_file","creator":"system","file_size":78315,"content_type":"application/pdf","file_name":"IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf","access_level":"open_access"},{"date_created":"2018-12-12T10:10:01Z","date_updated":"2020-07-14T12:45:38Z","checksum":"48133cecebfd839b77f84f557d530c00","file_id":"4786","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":90532,"file_name":"IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf","access_level":"open_access"},{"file_name":"IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf","access_level":"open_access","content_type":"application/pdf","file_size":90771,"creator":"system","relation":"main_file","file_id":"4787","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:02Z","checksum":"a359224ddfdb178fed72b228dcfb699a"},{"file_name":"IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf","access_level":"open_access","creator":"system","content_type":"application/pdf","file_size":1830232,"file_id":"4788","relation":"main_file","date_updated":"2020-07-14T12:45:38Z","date_created":"2018-12-12T10:10:03Z","checksum":"0d2dd31d537c7a495999149d00eaffbf"}],"oa_version":"Published Version","_id":"2306","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 50","status":"public","title":"(Open) Linked Data in Bibliotheken","ddc":["020"],"abstract":[{"text":"Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement, die noch nicht mit dem Thema vertraut sind.","lang":"ger"}],"type":"book","alternative_title":["Bibliotheks- und Informationspraxis"],"date_published":"2013-09-13T00:00:00Z","citation":{"chicago":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50. De Gruyter, 2013. https://doi.org/10.1515/9783110278736.","mla":"Danowski, Patrick, and Adrian Pohl. (Open) Linked Data in Bibliotheken. Vol. 50, De Gruyter, 2013, doi:10.1515/9783110278736.","short":"P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013.","ista":"Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p.","ieee":"P. Danowski and A. Pohl, (Open) Linked Data in Bibliotheken, vol. 50. De Gruyter, 2013.","apa":"Danowski, P., & Pohl, A. (2013). (Open) Linked Data in Bibliotheken (Vol. 50). De Gruyter. https://doi.org/10.1515/9783110278736","ama":"Danowski P, Pohl A. (Open) Linked Data in Bibliotheken. Vol 50. De Gruyter; 2013. doi:10.1515/9783110278736"},"article_processing_charge":"No","has_accepted_license":"1","day":"13"},{"type":"conference","publist_id":"4626","ec_funded":1,"abstract":[{"lang":"eng","text":"We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to "close" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhan-dled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2301","year":"2013","department":[{"_id":"ToHe"}],"publisher":"ACM","status":"public","publication_status":"published","title":"P: Safe asynchronous event-driven programming","author":[{"first_name":"Ankush","last_name":"Desai","full_name":"Desai, Ankush"},{"full_name":"Gupta, Vivek","last_name":"Gupta","first_name":"Vivek"},{"full_name":"Jackson, Ethan","last_name":"Jackson","first_name":"Ethan"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"},{"first_name":"Sriram","last_name":"Rajamani","full_name":"Rajamani, Sriram"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","first_name":"Damien","last_name":"Zufferey","full_name":"Zufferey, Damien"}],"oa_version":"None","date_updated":"2021-01-12T06:56:38Z","date_created":"2018-12-11T11:56:52Z","scopus_import":1,"day":"01","month":"06","citation":{"chicago":"Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, 321–31. ACM, 2013. https://doi.org/10.1145/2491956.2462184.","short":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331.","mla":"Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–31, doi:10.1145/2491956.2462184.","apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., & Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (pp. 321–331). Seattle, WA, United States: ACM. https://doi.org/10.1145/2491956.2462184","ieee":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, Seattle, WA, United States, 2013, pp. 321–331.","ista":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.","ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM; 2013:321-331. doi:10.1145/2491956.2462184"},"main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","page":"321 - 331","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"quality_controlled":"1","date_published":"2013-06-01T00:00:00Z","doi":"10.1145/2491956.2462184","conference":{"start_date":"2013-06-16","location":"Seattle, WA, United States","end_date":"2013-06-19","name":"PLDI: Programming Languages Design and Implementation"},"language":[{"iso":"eng"}]},{"external_id":{"arxiv":["1305.5323"]},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1305.5323","open_access":"1"}],"quality_controlled":"1","doi":"10.1103/PhysRevB.88.064401","language":[{"iso":"eng"}],"month":"08","year":"2013","publisher":"American Physical Society","department":[{"_id":"RoSe"}],"publication_status":"published","author":[{"first_name":"Alessandro","last_name":"Giuliani","full_name":"Giuliani, Alessandro"},{"full_name":"Lieb, Élliott","first_name":"Élliott","last_name":"Lieb"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"volume":88,"date_created":"2018-12-11T11:56:51Z","date_updated":"2021-01-12T06:56:38Z","article_number":"064401","publist_id":"4627","citation":{"short":"A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).","mla":"Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B, vol. 88, no. 6, 064401, American Physical Society, 2013, doi:10.1103/PhysRevB.88.064401.","chicago":"Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization of Stripes and Slabs in Two and Three Dimensions.” Physical Review B. American Physical Society, 2013. https://doi.org/10.1103/PhysRevB.88.064401.","ama":"Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and three dimensions. Physical Review B. 2013;88(6). doi:10.1103/PhysRevB.88.064401","ieee":"A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs in two and three dimensions,” Physical Review B, vol. 88, no. 6. American Physical Society, 2013.","apa":"Giuliani, A., Lieb, É., & Seiringer, R. (2013). Realization of stripes and slabs in two and three dimensions. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.88.064401","ista":"Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401."},"publication":"Physical Review B","date_published":"2013-08-01T00:00:00Z","scopus_import":1,"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2300","intvolume":" 88","title":"Realization of stripes and slabs in two and three dimensions","status":"public","oa_version":"Preprint","type":"journal_article","issue":"6","abstract":[{"lang":"eng","text":"We consider Ising models in two and three dimensions with nearest neighbor ferromagnetic interactions and long-range, power law decaying, antiferromagnetic interactions. If the strength of the ferromagnetic coupling J is larger than a critical value Jc, then the ground state is homogeneous and ferromagnetic. As the critical value is approached from smaller values of J, it is believed that the ground state consists of a periodic array of stripes (d=2) or slabs (d=3), all of the same size and alternating magnetization. Here we prove rigorously that the ground state energy per site converges to that of the optimal periodic striped or slabbed state, in the limit that J tends to the ferromagnetic transition point. While this theorem does not prove rigorously that the ground state is precisely striped or slabbed, it does prove that in any suitably large box the ground state is striped or slabbed with high probability."}]},{"oa_version":"None","volume":8,"date_updated":"2021-01-12T06:56:39Z","date_created":"2018-12-11T11:56:52Z","author":[{"full_name":"Hippenmeyer, Simon","last_name":"Hippenmeyer","first_name":"Simon","orcid":"0000-0003-2279-1061","id":"37B36620-F248-11E8-B48F-1D18A9856A87"}],"intvolume":" 8","publisher":"Springer","department":[{"_id":"SiHi"}],"title":"Dissection of gene function at clonal level using mosaic analysis with double markers","publication_status":"published","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2303","year":"2013","acknowledgement":"This work was supported by IST Austria institutional funds.","publist_id":"4624","issue":"6","abstract":[{"lang":"eng","text":"MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach in mice to visualize and concomitantly manipulate genetically defined cells at clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent interchromosomal mitotic recombination to reconstitute two split marker genes—green GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in one color and wild-type cells in the other color in an otherwise unlabeled background. At present, major MADM applications include lineage tracing, single cell labeling, conditional knockouts in small populations of cells and induction of uniparental chromosome disomy to assess effects of genomic imprinting. MADM can be applied universally in the mouse with the sole limitation being the specificity of the promoter controlling Cre recombinase expression. Here I review recent developments and extensions of the MADM technique and give an overview of the major discoveries and progresses enabled by the implementation of the novel genetic MADM tools."}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1007/s11515-013-1279-6","date_published":"2013-09-03T00:00:00Z","page":"557 - 568","article_type":"review","quality_controlled":"1","citation":{"ista":"Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 8(6), 557–568.","ieee":"S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” Frontiers in Biology, vol. 8, no. 6. Springer, pp. 557–568, 2013.","apa":"Hippenmeyer, S. (2013). Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. Springer. https://doi.org/10.1007/s11515-013-1279-6","ama":"Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 2013;8(6):557-568. doi:10.1007/s11515-013-1279-6","chicago":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology. Springer, 2013. https://doi.org/10.1007/s11515-013-1279-6.","mla":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” Frontiers in Biology, vol. 8, no. 6, Springer, 2013, pp. 557–68, doi:10.1007/s11515-013-1279-6.","short":"S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568."},"publication":"Frontiers in Biology","month":"09","day":"03","scopus_import":1},{"page":"43 - 50","quality_controlled":"1","citation":{"chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics. Elsevier, 2013. https://doi.org/10.1016/j.endm.2013.07.008.","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” Electronic Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.","apa":"Pausinger, F. (2013). Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.endm.2013.07.008","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","ama":"Pausinger F. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 2013;43:43-50. doi:10.1016/j.endm.2013.07.008"},"publication":"Electronic Notes in Discrete Mathematics","language":[{"iso":"eng"}],"date_published":"2013-09-05T00:00:00Z","doi":"10.1016/j.endm.2013.07.008","scopus_import":1,"month":"09","day":"05","publisher":"Elsevier","intvolume":" 43","department":[{"_id":"HeEd"}],"publication_status":"published","status":"public","title":"Van der Corput sequences and linear permutations","acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","_id":"2304","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","volume":43,"oa_version":"None","date_updated":"2021-01-12T06:56:39Z","date_created":"2018-12-11T11:56:53Z","author":[{"last_name":"Pausinger","first_name":"Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian"}],"type":"journal_article","publist_id":"4623","abstract":[{"text":"This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.","lang":"eng"}]},{"type":"conference","publist_id":"4612","abstract":[{"text":" We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii regime. We prove that Bose Einstein condensation survives even a strong random potential with a high density of scatterers. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the interval. ","lang":"eng"}],"extern":"1","year":"2013","_id":"2315","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"World Scientific Publishing","title":"Disordered Bose-Einstein condensates with interaction","publication_status":"published","status":"public","author":[{"full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Yngvason, Jakob","first_name":"Jakob","last_name":"Yngvason"},{"last_name":"Zagrebnov","first_name":"Valentin","full_name":"Zagrebnov, Valentin"}],"oa_version":"None","date_created":"2018-12-11T11:56:57Z","date_updated":"2021-01-12T06:56:43Z","article_processing_charge":"No","oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.4046"}],"citation":{"chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered Bose-Einstein Condensates with Interaction,” 610–19. World Scientific Publishing, 2013. https://doi.org/10.1142/9789814449243_0063.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, in:, World Scientific Publishing, 2013, pp. 610–619.","mla":"Seiringer, Robert, et al. Disordered Bose-Einstein Condensates with Interaction. World Scientific Publishing, 2013, pp. 610–19, doi:10.1142/9789814449243_0063.","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates with interaction,” presented at the ICMP: International Congress on Mathematical Physics, 2013, pp. 610–619.","apa":"Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Disordered Bose-Einstein condensates with interaction (pp. 610–619). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. https://doi.org/10.1142/9789814449243_0063","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Disordered Bose-Einstein condensates with interaction. ICMP: International Congress on Mathematical Physics, 610–619.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates with interaction. In: World Scientific Publishing; 2013:610-619. doi:10.1142/9789814449243_0063"},"external_id":{"arxiv":["1209.4046"]},"page":"610-619","doi":"10.1142/9789814449243_0063","date_published":"2013-01-01T00:00:00Z","conference":{"name":"ICMP: International Congress on Mathematical Physics"},"language":[{"iso":"eng"}]},{"day":"01","month":"01","doi":"10.1007/978-3-0348-0531-5_3","date_published":"2013-01-01T00:00:00Z","conference":{"name":"OTAMP: Operator Theory, Analysis and Mathematical Physics"},"page":"57 - 88","quality_controlled":0,"citation":{"ama":"Frank R, Hainzl C, Seiringer R, Solovej J. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. In: Springer; 2013:57-88. doi:10.1007/978-3-0348-0531-5_3","ieee":"R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “ Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction,” presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2013, pp. 57–88.","apa":"Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2013). Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction (pp. 57–88). Presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, Springer. https://doi.org/10.1007/978-3-0348-0531-5_3","ista":"Frank R, Hainzl C, Seiringer R, Solovej J. 2013. Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. OTAMP: Operator Theory, Analysis and Mathematical Physics, 57–88.","short":"R. Frank, C. Hainzl, R. Seiringer, J. Solovej, in:, Springer, 2013, pp. 57–88.","mla":"Frank, Rupert, et al. Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction. Springer, 2013, pp. 57–88, doi:10.1007/978-3-0348-0531-5_3.","chicago":"Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “ Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction,” 57–88. Springer, 2013. https://doi.org/10.1007/978-3-0348-0531-5_3."},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1103.1866","open_access":"1"}],"extern":1,"publist_id":"4608","abstract":[{"text":"In a recent paper [7] we give the first rigorous derivation of the celebrated Ginzburg-Landau (GL)theory, starting from the microscopic Bardeen- Cooper-Schrieffer (BCS)model. Here we present our results in the simplified case of a one-dimensional system of particles interacting via a δ-potential.","lang":"eng"}],"type":"conference","date_created":"2018-12-11T11:56:58Z","date_updated":"2021-01-12T06:56:45Z","author":[{"full_name":"Frank, Rupert L","first_name":"Rupert","last_name":"Frank"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert","full_name":"Robert Seiringer"},{"last_name":"Solovej","first_name":"Jan","full_name":"Solovej, Jan P"}],"publisher":"Springer","status":"public","publication_status":"published","title":" Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction","_id":"2319","year":"2013"},{"scopus_import":1,"series_title":"Lecture Notes in Computer Science","day":"01","has_accepted_license":"1","citation":{"ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:10.1007/978-3-642-40184-8_18","apa":"Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18","ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","mla":"Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:10.1007/978-3-642-40184-8_18.","chicago":"Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.1007/978-3-642-40184-8_18."},"page":"242 - 256","date_published":"2013-08-01T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof."}],"_id":"2328","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","004"],"title":"Aspect-oriented linearizability proofs","status":"public","intvolume":" 8052","pubrep_id":"197","file":[{"date_updated":"2020-07-14T12:45:39Z","date_created":"2018-12-12T10:08:58Z","checksum":"bdbb520de91751fe0136309ad4ef67e4","relation":"main_file","file_id":"4721","content_type":"application/pdf","file_size":337059,"creator":"system","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","month":"08","oa":1,"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"conference":{"start_date":"2013-08-27","location":"Buenos Aires, Argentina","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory"},"doi":"10.1007/978-3-642-40184-8_18","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:39Z","publist_id":"4598","ec_funded":1,"year":"2013","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Sezgin, Ali","last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Viktor","last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1832"}]},"date_updated":"2023-02-23T10:16:27Z","date_created":"2018-12-11T11:57:01Z","volume":8052},{"date_updated":"2021-01-12T06:57:17Z","date_created":"2018-12-11T11:57:28Z","volume":162,"author":[{"full_name":"Frank, Rupert L","last_name":"Frank","first_name":"Rupert"},{"full_name":"Lewin, Mathieu","last_name":"Lewin","first_name":"Mathieu"},{"first_name":"Élliott","last_name":"Lieb","full_name":"Lieb, Élliott H"},{"full_name":"Robert Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"}],"status":"public","title":"A positive density analogue of the Lieb-Thirring inequality","publication_status":"published","publisher":"Duke University Press","intvolume":" 162","_id":"2404","year":"2013","extern":1,"abstract":[{"lang":"eng","text":"The Lieb-Thirring inequalities give a bound on the negative eigenvalues of a Schrödinger operator in terms of an Lp-norm of the potential. These are dual to bounds on the H1-norms of a system of orthonormal functions. Here we extend these bounds to analogous inequalities for perturbations of the Fermi sea of noninteracting particles (i.e., for perturbations of the continuous spectrum of the Laplacian by local potentials)."}],"publist_id":"4521","issue":"3","type":"journal_article","doi":"10.1215/00127094-2019477","date_published":"2013-02-01T00:00:00Z","quality_controlled":0,"page":"435 - 495","publication":"Duke Mathematical Journal","citation":{"mla":"Frank, Rupert, et al. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal, vol. 162, no. 3, Duke University Press, 2013, pp. 435–95, doi:10.1215/00127094-2019477.","short":"R. Frank, M. Lewin, É. Lieb, R. Seiringer, Duke Mathematical Journal 162 (2013) 435–495.","chicago":"Frank, Rupert, Mathieu Lewin, Élliott Lieb, and Robert Seiringer. “A Positive Density Analogue of the Lieb-Thirring Inequality.” Duke Mathematical Journal. Duke University Press, 2013. https://doi.org/10.1215/00127094-2019477.","ama":"Frank R, Lewin M, Lieb É, Seiringer R. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 2013;162(3):435-495. doi:10.1215/00127094-2019477","ista":"Frank R, Lewin M, Lieb É, Seiringer R. 2013. A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. 162(3), 435–495.","apa":"Frank, R., Lewin, M., Lieb, É., & Seiringer, R. (2013). A positive density analogue of the Lieb-Thirring inequality. Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2019477","ieee":"R. Frank, M. Lewin, É. Lieb, and R. Seiringer, “A positive density analogue of the Lieb-Thirring inequality,” Duke Mathematical Journal, vol. 162, no. 3. Duke University Press, pp. 435–495, 2013."},"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1108.4246"}],"month":"02","day":"01"},{"doi":"10.1140/epjst/e2013-01759-5","date_published":"2013-02-01T00:00:00Z","quality_controlled":0,"page":"103 - 107","publication":"European Physical Journal: Special Topics","citation":{"short":"R. Seiringer, J. Yngvason, V. Zagrebnov, European Physical Journal: Special Topics 217 (2013) 103–107.","mla":"Seiringer, Robert, et al. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics, vol. 217, no. 1, Springer, 2013, pp. 103–07, doi:10.1140/epjst/e2013-01759-5.","chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Condensation of Interacting Bosons in a Random Potential.” European Physical Journal: Special Topics. Springer, 2013. https://doi.org/10.1140/epjst/e2013-01759-5.","ama":"Seiringer R, Yngvason J, Zagrebnov V. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 2013;217(1):103-107. doi:10.1140/epjst/e2013-01759-5","apa":"Seiringer, R., Yngvason, J., & Zagrebnov, V. (2013). Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. Springer. https://doi.org/10.1140/epjst/e2013-01759-5","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Condensation of interacting bosons in a random potential,” European Physical Journal: Special Topics, vol. 217, no. 1. Springer, pp. 103–107, 2013.","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Condensation of interacting bosons in a random potential. European Physical Journal: Special Topics. 217(1), 103–107."},"month":"02","day":"01","date_created":"2018-12-11T11:57:29Z","date_updated":"2021-01-12T06:57:17Z","volume":217,"author":[{"full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"},{"last_name":"Yngvason","first_name":"Jakob","full_name":"Yngvason, Jakob"},{"first_name":"Valentin","last_name":"Zagrebnov","full_name":"Zagrebnov, Valentin A"}],"status":"public","title":"Condensation of interacting bosons in a random potential","publication_status":"published","intvolume":" 217","publisher":"Springer","_id":"2406","year":"2013","extern":1,"abstract":[{"text":"We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval. We prove that, in the Gross-Pitaevskii limit, Bose Einstein condensation takes place in the whole parameter range considered. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the unit interval.","lang":"eng"}],"issue":"1","publist_id":"4520","type":"journal_article"},{"month":"04","day":"01","date_published":"2013-04-01T00:00:00Z","doi":"10.1007/s00220-012-1604-y","main_file_link":[{"url":"http://arxiv.org/abs/1201.3954","open_access":"1"}],"oa":1,"citation":{"ama":"Frank R, Lieb É, Seiringer R. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 2013;319(2):557-573. doi:10.1007/s00220-012-1604-y","ieee":"R. Frank, É. Lieb, and R. Seiringer, “Symmetry of bipolaron bound states for small Coulomb repulsion,” Communications in Mathematical Physics, vol. 319, no. 2. Springer, pp. 557–573, 2013.","apa":"Frank, R., Lieb, É., & Seiringer, R. (2013). Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-012-1604-y","ista":"Frank R, Lieb É, Seiringer R. 2013. Symmetry of bipolaron bound states for small Coulomb repulsion. Communications in Mathematical Physics. 319(2), 557–573.","short":"R. Frank, É. Lieb, R. Seiringer, Communications in Mathematical Physics 319 (2013) 557–573.","mla":"Frank, Rupert, et al. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics, vol. 319, no. 2, Springer, 2013, pp. 557–73, doi:10.1007/s00220-012-1604-y.","chicago":"Frank, Rupert, Élliott Lieb, and Robert Seiringer. “Symmetry of Bipolaron Bound States for Small Coulomb Repulsion.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-012-1604-y."},"publication":"Communications in Mathematical Physics","page":"557 - 573","quality_controlled":0,"issue":"2","publist_id":"4522","abstract":[{"text":"We consider the bipolaron in the Pekar-Tomasevich approximation and address the question whether the ground state is spherically symmetric or not. Numerical analysis has, so far, not completely settled the question. Our contribution is to prove rigorously that the ground state remains spherical for small values of the electron-electron Coulomb repulsion.","lang":"eng"}],"extern":1,"type":"journal_article","author":[{"first_name":"Rupert","last_name":"Frank","full_name":"Frank, Rupert L"},{"last_name":"Lieb","first_name":"Élliott","full_name":"Lieb, Élliott H"},{"full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert","last_name":"Seiringer"}],"volume":319,"date_updated":"2021-01-12T06:57:17Z","date_created":"2018-12-11T11:57:28Z","year":"2013","_id":"2405","publisher":"Springer","intvolume":" 319","status":"public","publication_status":"published","title":"Symmetry of bipolaron bound states for small Coulomb repulsion"},{"type":"journal_article","extern":1,"abstract":[{"text":"We investigate the low-energy excitation spectrum of a Bose gas confined in a trap, with weak long-range repulsive interactions. In particular, we prove that the spectrum can be described in terms of the eigenvalues of an effective one-particle operator, as predicted by the Bogoliubov approximation.","lang":"eng"}],"publist_id":"4518","issue":"2","status":"public","title":"The excitation spectrum for weakly interacting Bosons in a trap","publication_status":"published","intvolume":" 322","publisher":"Springer","_id":"2408","year":"2013","date_created":"2018-12-11T11:57:29Z","date_updated":"2021-01-12T06:57:18Z","volume":322,"author":[{"full_name":"Grech, Philip","first_name":"Philip","last_name":"Grech"},{"full_name":"Robert Seiringer","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"month":"09","day":"01","quality_controlled":0,"page":"559 - 591","publication":"Communications in Mathematical Physics","oa":1,"citation":{"short":"P. Grech, R. Seiringer, Communications in Mathematical Physics 322 (2013) 559–591.","mla":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics, vol. 322, no. 2, Springer, 2013, pp. 559–91, doi:10.1007/s00220-013-1736-8.","chicago":"Grech, Philip, and Robert Seiringer. “The Excitation Spectrum for Weakly Interacting Bosons in a Trap.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-013-1736-8.","ama":"Grech P, Seiringer R. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 2013;322(2):559-591. doi:10.1007/s00220-013-1736-8","apa":"Grech, P., & Seiringer, R. (2013). The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-013-1736-8","ieee":"P. Grech and R. Seiringer, “The excitation spectrum for weakly interacting Bosons in a trap,” Communications in Mathematical Physics, vol. 322, no. 2. Springer, pp. 559–591, 2013.","ista":"Grech P, Seiringer R. 2013. The excitation spectrum for weakly interacting Bosons in a trap. Communications in Mathematical Physics. 322(2), 559–591."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.5259"}],"doi":"10.1007/s00220-013-1736-8","date_published":"2013-09-01T00:00:00Z"},{"day":"26","has_accepted_license":"1","scopus_import":1,"date_published":"2013-02-26T00:00:00Z","page":"54 - 54","publication":"BMC Evolutionary Biology","citation":{"apa":"Kupczok, A., & Bollback, J. P. (2013). Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. BioMed Central. https://doi.org/10.1186/1471-2148-13-54","ieee":"A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content evolution ,” BMC Evolutionary Biology, vol. 13, no. 1. BioMed Central, pp. 54–54, 2013.","ista":"Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 13(1), 54–54.","ama":"Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 2013;13(1):54-54. doi:10.1186/1471-2148-13-54","chicago":"Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2148-13-54.","short":"A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54.","mla":"Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” BMC Evolutionary Biology, vol. 13, no. 1, BioMed Central, 2013, pp. 54–54, doi:10.1186/1471-2148-13-54."},"abstract":[{"lang":"eng","text":"Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates."}],"issue":"1","type":"journal_article","oa_version":"Published Version","file":[{"checksum":"029c7e0b198c19312b66ecce3cabb22f","date_updated":"2020-07-14T12:45:40Z","date_created":"2018-12-12T10:17:15Z","file_id":"5268","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":518729,"access_level":"open_access","file_name":"IST-2015-397-v1+1_1471-2148-13-54.pdf"}],"pubrep_id":"397","title":"Probabilistic models for CRISPR spacer content evolution ","ddc":["576"],"status":"public","intvolume":" 13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2412","month":"02","language":[{"iso":"eng"}],"doi":"10.1186/1471-2148-13-54","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"file_date_updated":"2020-07-14T12:45:40Z","publist_id":"4514","date_updated":"2021-01-12T06:57:20Z","date_created":"2018-12-11T11:57:31Z","volume":13,"author":[{"full_name":"Kupczok, Anne","first_name":"Anne","last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jonathan P","last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612","full_name":"Bollback, Jonathan P"}],"publication_status":"published","department":[{"_id":"JoBo"}],"publisher":"BioMed Central","year":"2013"},{"date_published":"2013-08-01T00:00:00Z","doi":"10.1002/9783527671632.ch08","language":[{"iso":"eng"}],"publication":"Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain","citation":{"short":"M. Valderrama, V. Botella Soler, M. Le Van Quyen, in:, M. Meyer, Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, Wiley-VCH, 2013.","mla":"Valderrama, Mario, et al. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson, Wiley-VCH, 2013, doi:10.1002/9783527671632.ch08.","chicago":"Valderrama, Mario, Vicente Botella Soler, and Michel Le Van Quyen. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” In Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, edited by Misha Meyer and Z. Pesenson. Wiley-VCH, 2013. https://doi.org/10.1002/9783527671632.ch08.","ama":"Valderrama M, Botella Soler V, Le Van Quyen M. Neuronal oscillations scale up and scale down the brain dynamics . In: Meyer M, Pesenson Z, eds. Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH; 2013. doi:10.1002/9783527671632.ch08","apa":"Valderrama, M., Botella Soler, V., & Le Van Quyen, M. (2013). Neuronal oscillations scale up and scale down the brain dynamics . In M. Meyer & Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Wiley-VCH. https://doi.org/10.1002/9783527671632.ch08","ieee":"M. Valderrama, V. Botella Soler, and M. Le Van Quyen, “Neuronal oscillations scale up and scale down the brain dynamics ,” in Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, M. Meyer and Z. Pesenson, Eds. Wiley-VCH, 2013.","ista":"Valderrama M, Botella Soler V, Le Van Quyen M. 2013.Neuronal oscillations scale up and scale down the brain dynamics . In: Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Reviews of Nonlinear Dynamics and Complexity, ."},"quality_controlled":"1","day":"01","month":"08","publication_identifier":{"isbn":["9783527411986 "],"eisbn":["9783527671632"]},"scopus_import":1,"author":[{"last_name":"Valderrama","first_name":"Mario","full_name":"Valderrama, Mario"},{"last_name":"Botella Soler","first_name":"Vicente","orcid":"0000-0002-8790-1914","id":"421234E8-F248-11E8-B48F-1D18A9856A87","full_name":"Botella Soler, Vicente"},{"full_name":"Le Van Quyen, Michel","last_name":"Le Van Quyen","first_name":"Michel"}],"date_updated":"2021-01-12T06:57:20Z","date_created":"2018-12-11T11:57:31Z","oa_version":"None","_id":"2413","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2013","status":"public","publication_status":"published","title":"Neuronal oscillations scale up and scale down the brain dynamics ","department":[{"_id":"GaTk"}],"editor":[{"last_name":"Meyer","first_name":"Misha","full_name":"Meyer, Misha"},{"first_name":"Z.","last_name":"Pesenson","full_name":"Pesenson, Z."}],"publisher":"Wiley-VCH","abstract":[{"lang":"eng","text":"Progress in understanding the global brain dynamics has remained slow to date in large part because of the highly multiscale nature of brain activity. Indeed, normal brain dynamics is characterized by complex interactions between multiple levels: from the microscopic scale of single neurons to the mesoscopic level of local groups of neurons, and finally to the macroscopic level of the whole brain. Among the most difficult tasks are those of identifying which scales are significant for a given particular function and describing how the scales affect each other. It is important to realize that the scales of time and space are linked together, or even intertwined, and that causal inference is far more ambiguous between than within levels. We approach this problem from the perspective of our recent work on simultaneous recording from micro- and macroelectrodes in the human brain. We propose a physiological description of these multilevel interactions, based on phase–amplitude coupling of neuronal oscillations that operate at multiple frequencies and on different spatial scales. Specifically, the amplitude of the oscillations on a particular spatial scale is modulated by phasic variations in neuronal excitability induced by lower frequency oscillations that emerge on a larger spatial scale. Following this general principle, it is possible to scale up or scale down the multiscale brain dynamics. It is expected that large-scale network oscillations in the low-frequency range, mediating downward effects, may play an important role in attention and consciousness."}],"publist_id":"4513","type":"book_chapter","alternative_title":["Reviews of Nonlinear Dynamics and Complexity"]},{"date_published":"2013-06-13T00:00:00Z","citation":{"ista":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 1(3).","apa":"Fernandes Redondo, R. A., Kupczok, A., Stift, G., & Bollback, J. P. (2013). Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. American Society for Microbiology. https://doi.org/10.1128/genomeA.00216-13","ieee":"R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,” Genome Announcements, vol. 1, no. 3. American Society for Microbiology, 2013.","ama":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 2013;1(3). doi:10.1128/genomeA.00216-13","chicago":"Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements. American Society for Microbiology, 2013. https://doi.org/10.1128/genomeA.00216-13.","mla":"Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” Genome Announcements, vol. 1, no. 3, American Society for Microbiology, 2013, doi:10.1128/genomeA.00216-13.","short":"R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements 1 (2013)."},"publication":"Genome Announcements","has_accepted_license":"1","day":"13","scopus_import":1,"pubrep_id":"398","oa_version":"Published Version","file":[{"checksum":"0751ec74b695567e0cdf02aaf9c26829","date_updated":"2020-07-14T12:45:40Z","date_created":"2018-12-12T10:17:36Z","file_id":"5291","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":130026,"access_level":"open_access","file_name":"IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf"}],"_id":"2410","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 1","ddc":["576"],"title":"Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis","status":"public","issue":"3","abstract":[{"text":"Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. ","lang":"eng"}],"type":"journal_article","doi":"10.1128/genomeA.00216-13","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","month":"06","author":[{"id":"409D5C96-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5837-2793","first_name":"Rodrigo A","last_name":"Fernandes Redondo","full_name":"Fernandes Redondo, Rodrigo A"},{"first_name":"Anne","last_name":"Kupczok","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne"},{"first_name":"Gertraud","last_name":"Stift","id":"2DB195CA-F248-11E8-B48F-1D18A9856A87","full_name":"Stift, Gertraud"},{"full_name":"Bollback, Jonathan P","last_name":"Bollback","first_name":"Jonathan P","orcid":"0000-0002-4624-4612","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87"}],"volume":1,"date_created":"2018-12-11T11:57:30Z","date_updated":"2021-01-12T06:57:19Z","year":"2013","publisher":"American Society for Microbiology","department":[{"_id":"JoBo"},{"_id":"LifeSc"}],"publication_status":"published","publist_id":"4516","file_date_updated":"2020-07-14T12:45:40Z"},{"series_title":"Lecture Notes in Computer Science","scopus_import":1,"day":"01","article_processing_charge":"No","has_accepted_license":"1","page":"773 - 789","citation":{"chicago":"Piskac, Ruzica, Thomas Wies, and Damien Zufferey. “Automating Separation Logic Using SMT.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_54.","short":"R. Piskac, T. Wies, D. Zufferey, 8044 (2013) 773–789.","mla":"Piskac, Ruzica, et al. Automating Separation Logic Using SMT. Vol. 8044, Springer, 2013, pp. 773–89, doi:10.1007/978-3-642-39799-8_54.","apa":"Piskac, R., Wies, T., & Zufferey, D. (2013). Automating separation logic using SMT. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_54","ieee":"R. Piskac, T. Wies, and D. Zufferey, “Automating separation logic using SMT,” vol. 8044. Springer, pp. 773–789, 2013.","ista":"Piskac R, Wies T, Zufferey D. 2013. Automating separation logic using SMT. 8044, 773–789.","ama":"Piskac R, Wies T, Zufferey D. Automating separation logic using SMT. 2013;8044:773-789. doi:10.1007/978-3-642-39799-8_54"},"date_published":"2013-07-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations. Several specialized provers have been developed for decidable SL fragments. However, these provers cannot be easily extended or combined with solvers for other theories that are important in program verification, e.g., linear arithmetic. In this paper, we present a reduction of decidable SL fragments to a decidable first-order theory that fits well into the satisfiability modulo theories (SMT) framework. We show how to use this reduction to automate satisfiability, entailment, frame inference, and abduction problems for separation logic using SMT solvers. Our approach provides a simple method of integrating separation logic into existing verification tools that provide SMT backends, and an elegant way of combining SL fragments with other decidable first-order theories. We implemented this approach in a verification tool and applied it to heap-manipulating programs whose verification involves reasoning in theory combinations.\r\n","lang":"eng"}],"title":"Automating separation logic using SMT","status":"public","ddc":["000"],"intvolume":" 8044","_id":"2447","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"checksum":"2e866932ab688f47ecd504acb4d5c7d4","date_updated":"2020-07-14T12:45:41Z","date_created":"2020-05-15T11:13:01Z","relation":"main_file","file_id":"7859","file_size":309182,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2013_CAV_Piskac.pdf"}],"month":"07","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"conference":{"end_date":"2013-07-19","location":"St. Petersburg, Russia","start_date":"2013-07-13","name":"CAV: Computer Aided Verification"},"doi":"10.1007/978-3-642-39799-8_54","file_date_updated":"2020-07-14T12:45:41Z","publist_id":"4456","publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","year":"2013","date_updated":"2020-08-11T10:09:47Z","date_created":"2018-12-11T11:57:43Z","volume":8044,"author":[{"first_name":"Ruzica","last_name":"Piskac","full_name":"Piskac, Ruzica"},{"full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Wies"},{"full_name":"Zufferey, Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","last_name":"Zufferey","first_name":"Damien"}]},{"_id":"2443","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Defining the selectivity of processes along the auxin response chain: A study using auxin analogues","status":"public","intvolume":" 200","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"The mode of action of auxin is based on its non-uniform distribution within tissues and organs. Despite the wide use of several auxin analogues in research and agriculture, little is known about the specificity of different auxin-related transport and signalling processes towards these compounds. Using seedlings of Arabidopsis thaliana and suspension-cultured cells of Nicotiana tabacum (BY-2), the physiological activity of several auxin analogues was investigated, together with their capacity to induce auxin-dependent gene expression, to inhibit endocytosis and to be transported across the plasma membrane. This study shows that the specificity criteria for different auxin-related processes vary widely. Notably, the special behaviour of some synthetic auxin analogues suggests that they might be useful tools in investigations of the molecular mechanism of auxin action. Thus, due to their differential stimulatory effects on DR5 expression, indole-3-propionic (IPA) and 2,4,5-trichlorophenoxy acetic (2,4,5-T) acids can serve in studies of TRANSPORT INHIBITOR RESPONSE 1/AUXIN SIGNALLING F-BOX (TIR1/AFB)-mediated auxin signalling, and 5-fluoroindole-3-acetic acid (5-F-IAA) can help to discriminate between transcriptional and non-transcriptional pathways of auxin signalling. The results demonstrate that the major determinants for the auxin-like physiological potential of a particular compound are very complex and involve its chemical and metabolic stability, its ability to distribute in tissues in a polar manner and its activity towards auxin signalling machinery.","lang":"eng"}],"issue":"4","publication":"New Phytologist","citation":{"ama":"Simon S, Kubeš M, Baster P, et al. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 2013;200(4):1034-1048. doi:10.1111/nph.12437","ista":"Simon S, Kubeš M, Baster P, Robert S, Dobrev P, Friml J, Petrášek J, Zažímalová E. 2013. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. 200(4), 1034–1048.","ieee":"S. Simon et al., “Defining the selectivity of processes along the auxin response chain: A study using auxin analogues,” New Phytologist, vol. 200, no. 4. Wiley, pp. 1034–1048, 2013.","apa":"Simon, S., Kubeš, M., Baster, P., Robert, S., Dobrev, P., Friml, J., … Zažímalová, E. (2013). Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. New Phytologist. Wiley. https://doi.org/10.1111/nph.12437","mla":"Simon, Sibu, et al. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist, vol. 200, no. 4, Wiley, 2013, pp. 1034–48, doi:10.1111/nph.12437.","short":"S. Simon, M. Kubeš, P. Baster, S. Robert, P. Dobrev, J. Friml, J. Petrášek, E. Zažímalová, New Phytologist 200 (2013) 1034–1048.","chicago":"Simon, Sibu, Martin Kubeš, Pawel Baster, Stéphanie Robert, Petre Dobrev, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” New Phytologist. Wiley, 2013. https://doi.org/10.1111/nph.12437."},"article_type":"original","page":"1034 - 1048","date_published":"2013-12-01T00:00:00Z","scopus_import":"1","day":"01","article_processing_charge":"No","acknowledgement":"The authors thank Dr Christian Luschnig (University of Natural Resources and Life Sciences (BOKU), Vienna, Austria) for the anti-PIN2 antibody, Professor Mark Estelle (University of California, San Diego, CA, USA) for tir1-1 mutant seeds and, last but not least, to Dr David Morris for critical reading of the manuscript. We also thank Markéta Pařezová and Jana Stýblová for excellent technical assistance. This work was supported by the Grant Agency of the Czech Republic (P305/11/0797 to E.Z. and 13-40637S to J.F.), the Central European Institute of Technology project CZ.1.05/1.1.00/02.0068 from the European Regional Development Fund and by a European Research Council starting independent research grant ERC-2011-StG-20101109-PSDP (to J.F.).","year":"2013","publication_status":"published","department":[{"_id":"JiFr"}],"publisher":"Wiley","author":[{"first_name":"Sibu","last_name":"Simon","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1998-6741","full_name":"Simon, Sibu"},{"full_name":"Kubeš, Martin","last_name":"Kubeš","first_name":"Martin"},{"full_name":"Baster, Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","last_name":"Baster","first_name":"Pawel"},{"first_name":"Stéphanie","last_name":"Robert","full_name":"Robert, Stéphanie"},{"last_name":"Dobrev","first_name":"Petre","full_name":"Dobrev, Petre"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí"},{"full_name":"Petrášek, Jan","first_name":"Jan","last_name":"Petrášek"},{"last_name":"Zažímalová","first_name":"Eva","full_name":"Zažímalová, Eva"}],"date_created":"2018-12-11T11:57:41Z","date_updated":"2022-06-07T08:57:52Z","volume":200,"publist_id":"4460","ec_funded":1,"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/nph.12437"}],"quality_controlled":"1","project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7"}],"doi":"10.1111/nph.12437","language":[{"iso":"eng"}],"month":"12"},{"month":"07","doi":"10.1007/978-3-642-39799-8_37","conference":{"name":"CAV: Computer Aided Verification","end_date":"2013-07-19","start_date":"2013-07-13","location":"St. Petersburg, Russia"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1304.5281"]},"oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1304.5281","open_access":"1"}],"project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","ec_funded":1,"publist_id":"4457","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"full_name":"Gaiser, Andreas","first_name":"Andreas","last_name":"Gaiser"},{"last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"}],"volume":8044,"date_created":"2018-12-11T11:57:42Z","date_updated":"2020-08-11T10:09:47Z","year":"2013","publisher":"Springer","department":[{"_id":"KrCh"}],"publication_status":"published","day":"01","scopus_import":1,"series_title":"Lecture Notes in Computer Science","date_published":"2013-07-01T00:00:00Z","citation":{"ista":"Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.","ieee":"K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.","apa":"Chatterjee, K., Gaiser, A., & Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_37","ama":"Chatterjee K, Gaiser A, Kretinsky J. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 2013;8044:559-575. doi:10.1007/978-3-642-39799-8_37","chicago":"Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_37.","mla":"Chatterjee, Krishnendu, et al. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Vol. 8044, Springer, 2013, pp. 559–75, doi:10.1007/978-3-642-39799-8_37.","short":"K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575."},"page":"559 - 575","abstract":[{"lang":"eng","text":"The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12, GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generalized Rabin pairs (DGRW). The Safraless translation of LTL(F,G) formulas to DGRW results in smaller automata as compared to DRW. We present algorithms for probabilistic model-checking as well as game solving for DGRW conditions. Our new algorithms lead to improvement both in terms of theoretical bounds as well as practical evaluation. We compare PRISM with and without our new translation, and show that the new translation leads to significant improvements."}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2446","intvolume":" 8044","title":"Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis","status":"public"},{"day":"01","series_title":"Lecture Notes in Computer Science","scopus_import":1,"date_published":"2013-07-01T00:00:00Z","page":"543 - 558","citation":{"ieee":"K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.","apa":"Chatterjee, K., & Ła̧Cki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_36","ista":"Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.","ama":"Chatterjee K, Ła̧Cki J. Faster algorithms for Markov decision processes with low treewidth. 2013;8044:543-558. doi:10.1007/978-3-642-39799-8_36","chicago":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_36.","short":"K. Chatterjee, J. Ła̧Cki, 8044 (2013) 543–558.","mla":"Chatterjee, Krishnendu, and Jakub Ła̧Cki. Faster Algorithms for Markov Decision Processes with Low Treewidth. Vol. 8044, Springer, 2013, pp. 543–58, doi:10.1007/978-3-642-39799-8_36."},"abstract":[{"lang":"eng","text":"We consider two core algorithmic problems for probabilistic verification: the maximal end-component decomposition and the almost-sure reachability set computation for Markov decision processes (MDPs). For MDPs with treewidth k, we present two improved static algorithms for both the problems that run in time O(n·k 2.38·2k ) and O(m·logn· k), respectively, where n is the number of states and m is the number of edges, significantly improving the previous known O(n·k·√n· k) bound for low treewidth. We also present decremental algorithms for both problems for MDPs with constant treewidth that run in amortized logarithmic time, which is a huge improvement over the previously known algorithms that require amortized linear time."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","status":"public","title":"Faster algorithms for Markov decision processes with low treewidth","intvolume":" 8044","_id":"2444","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","language":[{"iso":"eng"}],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2013-07-19","location":"St. Petersburg, Russia","start_date":"2013-07-13"},"doi":"10.1007/978-3-642-39799-8_36","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1304.0084"}],"external_id":{"arxiv":["1304.0084"]},"publist_id":"4459","ec_funded":1,"date_created":"2018-12-11T11:57:42Z","date_updated":"2020-08-11T10:09:47Z","volume":8044,"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jakub","last_name":"Ła̧Cki","full_name":"Ła̧Cki, Jakub"}],"publication_status":"published","publisher":"Springer","department":[{"_id":"KrCh"}],"year":"2013"},{"scopus_import":1,"month":"11","day":"01","citation":{"ama":"Nodzyński T, Feraru M, Hirsch S, et al. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 2013;6(6):1849-1862. doi:10.1093/mp/sst044","apa":"Nodzyński, T., Feraru, M., Hirsch, S., De Rycke, R., Nicuales, C., Van Leene, J., … Friml, J. (2013). Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. Cell Press. https://doi.org/10.1093/mp/sst044","ieee":"T. Nodzyński et al., “Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis,” Molecular Plant, vol. 6, no. 6. Cell Press, pp. 1849–1862, 2013.","ista":"Nodzyński T, Feraru M, Hirsch S, De Rycke R, Nicuales C, Van Leene J, De Jaeger G, Vanneste S, Friml J. 2013. Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis. Molecular Plant. 6(6), 1849–1862.","short":"T. Nodzyński, M. Feraru, S. Hirsch, R. De Rycke, C. Nicuales, J. Van Leene, G. De Jaeger, S. Vanneste, J. Friml, Molecular Plant 6 (2013) 1849–1862.","mla":"Nodzyński, Tomasz, et al. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant, vol. 6, no. 6, Cell Press, 2013, pp. 1849–62, doi:10.1093/mp/sst044.","chicago":"Nodzyński, Tomasz, Murguel Feraru, Sibylle Hirsch, Riet De Rycke, Claudiu Nicuales, Jelle Van Leene, Geert De Jaeger, Steffen Vanneste, and Jiří Friml. “Retromer Subunits VPS35A and VPS29 Mediate Prevacuolar Compartment (PVC) Function in Arabidopsis.” Molecular Plant. Cell Press, 2013. https://doi.org/10.1093/mp/sst044."},"publication":"Molecular Plant","page":"1849 - 1862","quality_controlled":"1","doi":"10.1093/mp/sst044","date_published":"2013-11-01T00:00:00Z","language":[{"iso":"eng"}],"type":"journal_article","issue":"6","publist_id":"4454","abstract":[{"text":"Intracellular protein routing is mediated by vesicular transport which is tightly regulated in eukaryotes. The protein and lipid homeostasis depends on coordinated delivery of de novo synthesized or recycled cargoes to the plasma membrane by exocytosis and their subsequent removal by rerouting them for recycling or degradation. Here, we report the characterization of protein affected trafficking 3 (pat3) mutant that we identified by an epifluorescence-based forward genetic screen for mutants defective in subcellular distribution of Arabidopsis auxin transporter PIN1–GFP. While pat3 displays largely normal plant morphology and development in nutrient-rich conditions, it shows strong ectopic intracellular accumulations of different plasma membrane cargoes in structures that resemble prevacuolar compartments (PVC) with an aberrant morphology. Genetic mapping revealed that pat3 is defective in vacuolar protein sorting 35A (VPS35A), a putative subunit of the retromer complex that mediates retrograde trafficking between the PVC and trans-Golgi network. Similarly, a mutant defective in another retromer subunit, vps29, shows comparable subcellular defects in PVC morphology and protein accumulation. Thus, our data provide evidence that the retromer components VPS35A and VPS29 are essential for normal PVC morphology and normal trafficking of plasma membrane proteins in plants. In addition, we show that, out of the three VPS35 retromer subunits present in Arabidopsis thaliana genome, the VPS35 homolog A plays a prevailing role in trafficking to the lytic vacuole, presenting another level of complexity in the retromer-dependent vacuolar sorting. ","lang":"eng"}],"_id":"2449","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013","intvolume":" 6","publisher":"Cell Press","department":[{"_id":"JiFr"}],"title":"Retromer subunits VPS35A and VPS29 mediate prevacuolar compartment (PVC) function in Arabidopsis","publication_status":"published","status":"public","author":[{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"full_name":"Feraru, Murguel","last_name":"Feraru","first_name":"Murguel"},{"full_name":"Hirsch, Sibylle","first_name":"Sibylle","last_name":"Hirsch"},{"full_name":"De Rycke, Riet","first_name":"Riet","last_name":"De Rycke"},{"last_name":"Nicuales","first_name":"Claudiu","full_name":"Nicuales, Claudiu"},{"full_name":"Van Leene, Jelle","last_name":"Van Leene","first_name":"Jelle"},{"full_name":"De Jaeger, Geert","last_name":"De Jaeger","first_name":"Geert"},{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí"}],"volume":6,"oa_version":"None","date_created":"2018-12-11T11:57:44Z","date_updated":"2021-01-12T06:57:33Z"},{"type":"journal_article","abstract":[{"text":"Background: Abundance and distribution of the plant hormone auxin play important roles in plant development. Besides other metabolic processes, various auxin carriers control the cellular level of active auxin and, hence, are major regulators of cellular auxin homeostasis. Despite the developmental importance of auxin transporters, a simple medium-to-high throughput approach to assess carrier activities is still missing. Here we show that carrier driven depletion of cellular auxin correlates with reduced nuclear auxin signaling in tobacco Bright Yellow-2 (BY-2) cell cultures.Results: We developed an easy to use transient single-cell-based system to detect carrier activity. We use the relative changes in signaling output of the auxin responsive promoter element DR5 to indirectly visualize auxin carrier activity. The feasibility of the transient approach was demonstrated by pharmacological and genetic interference with auxin signaling and transport. As a proof of concept, we provide visual evidence that the prominent auxin transport proteins PIN-FORMED (PIN)2 and PIN5 regulate cellular auxin homeostasis at the plasma membrane and endoplasmic reticulum (ER), respectively. Our data suggest that PIN2 and PIN5 have different sensitivities to the auxin transport inhibitor 1-naphthylphthalamic acid (NPA). Also the putative PIN-LIKES (PILS) auxin carrier activity at the ER is insensitive to NPA in our system, indicating that NPA blocks intercellular, but not intracellular auxin transport.Conclusions: This single-cell-based system is a useful tool by which the activity of putative auxin carriers, such as PINs, PILS and WALLS ARE THIN1 (WAT1), can be indirectly visualized in a medium-to-high throughput manner. Moreover, our single cell system might be useful to investigate also other hormonal signaling pathways, such as cytokinin.","lang":"eng"}],"issue":"1","publist_id":"4451","extern":1,"year":"2013","_id":"2452","publication_status":"published","status":"public","title":"Single-cell-based system to monitor carrier driven cellular auxin homeostasis","publisher":"BioMed Central","intvolume":" 13","author":[{"first_name":"Elke","last_name":"Barbez","full_name":"Barbez, Elke"},{"first_name":"Martina","last_name":"Laňková","full_name":"Laňková, Martina"},{"full_name":"Pařezová, Markéta","first_name":"Markéta","last_name":"Pařezová"},{"full_name":"Maizel, Alexis","first_name":"Alexis","last_name":"Maizel"},{"last_name":"Zažímalová","first_name":"Eva","full_name":"Zažímalová, Eva"},{"last_name":"Petrášek","first_name":"Jan","full_name":"Petrášek, Jan"},{"full_name":"Jirí Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jirí"},{"first_name":"Jürgen","last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen"}],"date_updated":"2021-01-12T06:57:34Z","date_created":"2018-12-11T11:57:45Z","volume":13,"month":"02","day":"01","publication":"BMC Plant Biology","citation":{"ama":"Barbez E, Laňková M, Pařezová M, et al. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 2013;13(1). doi:10.1186/1471-2229-13-20","ieee":"E. Barbez et al., “Single-cell-based system to monitor carrier driven cellular auxin homeostasis,” BMC Plant Biology, vol. 13, no. 1. BioMed Central, 2013.","apa":"Barbez, E., Laňková, M., Pařezová, M., Maizel, A., Zažímalová, E., Petrášek, J., … Kleine Vehn, J. (2013). Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. BioMed Central. https://doi.org/10.1186/1471-2229-13-20","ista":"Barbez E, Laňková M, Pařezová M, Maizel A, Zažímalová E, Petrášek J, Friml J, Kleine Vehn J. 2013. Single-cell-based system to monitor carrier driven cellular auxin homeostasis. BMC Plant Biology. 13(1).","short":"E. Barbez, M. Laňková, M. Pařezová, A. Maizel, E. Zažímalová, J. Petrášek, J. Friml, J. Kleine Vehn, BMC Plant Biology 13 (2013).","mla":"Barbez, Elke, et al. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology, vol. 13, no. 1, BioMed Central, 2013, doi:10.1186/1471-2229-13-20.","chicago":"Barbez, Elke, Martina Laňková, Markéta Pařezová, Alexis Maizel, Eva Zažímalová, Jan Petrášek, Jiří Friml, and Jürgen Kleine Vehn. “Single-Cell-Based System to Monitor Carrier Driven Cellular Auxin Homeostasis.” BMC Plant Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2229-13-20."},"quality_controlled":0,"doi":"10.1186/1471-2229-13-20","date_published":"2013-02-01T00:00:00Z"},{"day":"01","month":"04","citation":{"ama":"Liu J, Menhi S, Topping J, Friml J, Lindsey K. Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. Frontiers in Plant Science. 2013;4(75). doi:10.3389/fpls.2013.00075","apa":"Liu, J., Menhi, S., Topping, J., Friml, J., & Lindsey, K. (2013). Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. Frontiers in Plant Science. Frontiers Research Foundation. https://doi.org/10.3389/fpls.2013.00075","ieee":"J. Liu, S. Menhi, J. Topping, J. Friml, and K. Lindsey, “Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development,” Frontiers in Plant Science, vol. 4, no. 75. Frontiers Research Foundation, 2013.","ista":"Liu J, Menhi S, Topping J, Friml J, Lindsey K. 2013. Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development. Frontiers in Plant Science. 4(75).","short":"J. Liu, S. Menhi, J. Topping, J. Friml, K. Lindsey, Frontiers in Plant Science 4 (2013).","mla":"Liu, Junli, et al. “Interaction of PLS and PIN and Hormonal Crosstalk in Arabidopsis Root Development.” Frontiers in Plant Science, vol. 4, no. 75, Frontiers Research Foundation, 2013, doi:10.3389/fpls.2013.00075.","chicago":"Liu, Junli, Saher Menhi, Jennifer Topping, Jiří Friml, and Keith Lindsey. “Interaction of PLS and PIN and Hormonal Crosstalk in Arabidopsis Root Development.” Frontiers in Plant Science. Frontiers Research Foundation, 2013. https://doi.org/10.3389/fpls.2013.00075."},"publication":"Frontiers in Plant Science","quality_controlled":0,"doi":"10.3389/fpls.2013.00075","date_published":"2013-04-01T00:00:00Z","type":"journal_article","issue":"75","publist_id":"4453","abstract":[{"text":"Understanding how hormones and genes interact to coordinate plant growth is a major challenge in developmental biology. The activities of auxin, ethylene, and cytokinin depend on cellular context and exhibit either synergistic or antagonistic interactions. Here we use experimentation and network construction to elucidate the role of the interaction of the POLARIS peptide (PLS) and the auxin efflux carrier PIN proteins in the crosstalk of three hormones (auxin, ethylene, and cytokinin) in Arabidopsis root development. In ethylene hypersignaling mutants such as polaris (pls), we show experimentally that expression of both PIN1 and PIN2 significantly increases. This relationship is analyzed in the context of the crosstalk between auxin, ethylene, and cytokinin: in pls, endogenous auxin, ethylene and cytokinin concentration decreases, approximately remains unchanged and increases, respectively. Experimental data are integrated into a hormonal crosstalk network through combination with information in literature. Network construction reveals that the regulation of both PIN1 and PIN2 is predominantly via ethylene signaling. In addition, it is deduced that the relationship between cytokinin and PIN1 and PIN2 levels implies a regulatory role of cytokinin in addition to its regulation to auxin, ethylene, and PLS levels. We discuss how the network of hormones and genes coordinates plant growth by simultaneously regulating the activities of auxin, ethylene, and cytokinin signaling pathways.hormonal crosstalk, root development, auxin flux, PIN proteins, PLS protein, signaling network","lang":"eng"}],"extern":1,"year":"2013","_id":"2450","intvolume":" 4","publisher":"Frontiers Research Foundation","title":"Interaction of PLS and PIN and hormonal crosstalk in Arabidopsis root development","publication_status":"published","status":"public","author":[{"first_name":"Junli","last_name":"Liu","full_name":"Liu, Junli"},{"full_name":"Menhi, Saher","last_name":"Menhi","first_name":"Saher"},{"first_name":"Jennifer","last_name":"Topping","full_name":"Topping, Jennifer"},{"full_name":"Jirí Friml","last_name":"Friml","first_name":"Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lindsey, Keith","last_name":"Lindsey","first_name":"Keith"}],"volume":4,"date_updated":"2021-01-12T06:57:34Z","date_created":"2018-12-11T11:57:44Z"},{"type":"journal_article","extern":1,"abstract":[{"text":"For given non-zero integers a, b, q we investigate the density of solutions (x; y) ∈ ℤ2 to the binary cubic congruence ax2 + by3 ≡ 0 mod q, and use it to establish the Manin conjecture for a singular del Pezzo surface of degree 2 defined over ℚ.","lang":"eng"}],"publist_id":"7659","issue":"680","title":"Inhomogeneous cubic congruences and rational points on del Pezzo surfaces","status":"public","publication_status":"published","publisher":"Walter de Gruyter","_id":"245","year":"2013","date_created":"2018-12-11T11:45:24Z","date_updated":"2021-01-12T06:57:33Z","author":[{"full_name":"Baier, Stephan","last_name":"Baier","first_name":"Stephan"},{"full_name":"Timothy Browning","last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87"}],"day":"01","month":"07","quality_controlled":0,"page":"69 - 151","publication":"Journal fur die Reine und Angewandte Mathematik","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1011.3434"}],"citation":{"mla":"Baier, Stephan, and Timothy D. Browning. “Inhomogeneous Cubic Congruences and Rational Points on Del Pezzo Surfaces.” Journal Fur Die Reine Und Angewandte Mathematik, no. 680, Walter de Gruyter, 2013, pp. 69–151, doi:10.1515/crelle.2012.039.","short":"S. Baier, T.D. Browning, Journal Fur Die Reine Und Angewandte Mathematik (2013) 69–151.","chicago":"Baier, Stephan, and Timothy D Browning. “Inhomogeneous Cubic Congruences and Rational Points on Del Pezzo Surfaces.” Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter, 2013. https://doi.org/10.1515/crelle.2012.039.","ama":"Baier S, Browning TD. Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. Journal fur die Reine und Angewandte Mathematik. 2013;(680):69-151. doi:10.1515/crelle.2012.039","ista":"Baier S, Browning TD. 2013. Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. Journal fur die Reine und Angewandte Mathematik. (680), 69–151.","apa":"Baier, S., & Browning, T. D. (2013). Inhomogeneous cubic congruences and rational points on del Pezzo surfaces. Journal Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crelle.2012.039","ieee":"S. Baier and T. D. Browning, “Inhomogeneous cubic congruences and rational points on del Pezzo surfaces,” Journal fur die Reine und Angewandte Mathematik, no. 680. Walter de Gruyter, pp. 69–151, 2013."},"oa":1,"doi":"10.1515/crelle.2012.039","date_published":"2013-07-01T00:00:00Z"},{"month":"01","day":"01","language":[{"iso":"eng"}],"date_published":"2013-01-01T00:00:00Z","doi":"10.1016/j.tplants.2012.08.009","page":"5 - 10","quality_controlled":"1","citation":{"chicago":"Viaene, Tom, Charles Delwiche, Stefan Rensing, and Jiří Friml. “Origin and Evolution of PIN Auxin Transporters in the Green Lineage.” Trends in Plant Science. Cell Press, 2013. https://doi.org/10.1016/j.tplants.2012.08.009.","mla":"Viaene, Tom, et al. “Origin and Evolution of PIN Auxin Transporters in the Green Lineage.” Trends in Plant Science, vol. 18, no. 1, Cell Press, 2013, pp. 5–10, doi:10.1016/j.tplants.2012.08.009.","short":"T. Viaene, C. Delwiche, S. Rensing, J. Friml, Trends in Plant Science 18 (2013) 5–10.","ista":"Viaene T, Delwiche C, Rensing S, Friml J. 2013. Origin and evolution of PIN auxin transporters in the green lineage. Trends in Plant Science. 18(1), 5–10.","ieee":"T. Viaene, C. Delwiche, S. Rensing, and J. Friml, “Origin and evolution of PIN auxin transporters in the green lineage,” Trends in Plant Science, vol. 18, no. 1. Cell Press, pp. 5–10, 2013.","apa":"Viaene, T., Delwiche, C., Rensing, S., & Friml, J. (2013). Origin and evolution of PIN auxin transporters in the green lineage. Trends in Plant Science. Cell Press. https://doi.org/10.1016/j.tplants.2012.08.009","ama":"Viaene T, Delwiche C, Rensing S, Friml J. Origin and evolution of PIN auxin transporters in the green lineage. Trends in Plant Science. 2013;18(1):5-10. doi:10.1016/j.tplants.2012.08.009"},"publication":"Trends in Plant Science","extern":"1","publist_id":"4446","issue":"1","type":"journal_article","volume":18,"oa_version":"None","date_created":"2018-12-11T11:57:46Z","date_updated":"2021-01-12T06:57:36Z","author":[{"first_name":"Tom","last_name":"Viaene","full_name":"Viaene, Tom"},{"full_name":"Delwiche, Charles","first_name":"Charles","last_name":"Delwiche"},{"full_name":"Rensing, Stefan","last_name":"Rensing","first_name":"Stefan"},{"full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml"}],"publisher":"Cell Press","intvolume":" 18","title":"Origin and evolution of PIN auxin transporters in the green lineage","status":"public","publication_status":"published","year":"2013","_id":"2457","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"month":"09","day":"01","publication":"Compositio Mathematica","citation":{"chicago":"Browning, Timothy D, and Ritabrata Munshi. “Rational Points on Singular Intersections of Quadrics.” Compositio Mathematica. Cambridge University Press, 2013. https://doi.org/10.1112/S0010437X13007185.","short":"T.D. Browning, R. Munshi, Compositio Mathematica 149 (2013) 1457–1494.","mla":"Browning, Timothy D., and Ritabrata Munshi. “Rational Points on Singular Intersections of Quadrics.” Compositio Mathematica, vol. 149, no. 9, Cambridge University Press, 2013, pp. 1457–94, doi:10.1112/S0010437X13007185.","ieee":"T. D. Browning and R. Munshi, “Rational points on singular intersections of quadrics,” Compositio Mathematica, vol. 149, no. 9. Cambridge University Press, pp. 1457–1494, 2013.","apa":"Browning, T. D., & Munshi, R. (2013). Rational points on singular intersections of quadrics. Compositio Mathematica. Cambridge University Press. https://doi.org/10.1112/S0010437X13007185","ista":"Browning TD, Munshi R. 2013. Rational points on singular intersections of quadrics. Compositio Mathematica. 149(9), 1457–1494.","ama":"Browning TD, Munshi R. Rational points on singular intersections of quadrics. Compositio Mathematica. 2013;149(9):1457-1494. doi:10.1112/S0010437X13007185"},"quality_controlled":0,"page":"1457 - 1494","doi":"10.1112/S0010437X13007185","date_published":"2013-09-01T00:00:00Z","type":"journal_article","abstract":[{"text":"Given an intersection of two quadrics X Pm1, with m > 9, the quantitative arithmetic of the set X(Q) is investigated under the assumption that the singular locus of X consists of a pair of conjugate singular points defined over Q(i).","lang":"eng"}],"publist_id":"7658","issue":"9","extern":1,"year":"2013","_id":"246","acknowledgement":"EP/E053262/1\tEngineering and Physical Sciences Research Council","title":"Rational points on singular intersections of quadrics","status":"public","publication_status":"published","publisher":"Cambridge University Press","intvolume":" 149","author":[{"full_name":"Timothy Browning","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"},{"full_name":"Munshi, Ritabrata","first_name":"Ritabrata","last_name":"Munshi"}],"date_updated":"2021-01-12T06:57:37Z","date_created":"2018-12-11T11:45:25Z","volume":149},{"type":"journal_article","issue":"7","abstract":[{"text":"The impact of disulfide bonds on protein stability goes beyond simple equilibrium thermodynamics effects associated with the conformational entropy of the unfolded state. Indeed, disulfide crosslinks may play a role in the prevention of dysfunctional association and strongly affect the rates of irreversible enzyme inactivation, highly relevant in biotechnological applications. While these kinetic-stability effects remain poorly understood, by analogy with proposed mechanisms for processes of protein aggregation and fibrillogenesis, we propose that they may be determined by the properties of sparsely-populated, partially-unfolded intermediates. Here we report the successful design, on the basis of high temperature molecular-dynamics simulations, of six thermodynamically and kinetically stabilized variants of phytase from Citrobacter braakii (a biotechnologically important enzyme) with one, two or three engineered disulfides. Activity measurements and 3D crystal structure determination demonstrate that the engineered crosslinks do not cause dramatic alterations in the native structure. The inactivation kinetics for all the variants displays a strongly non-Arrhenius temperature dependence, with the time-scale for the irreversible denaturation process reaching a minimum at a given temperature within the range of the denaturation transition. We show this striking feature to be a signature of a key role played by a partially unfolded, intermediate state/ensemble. Energetic and mutational analyses confirm that the intermediate is highly unfolded (akin to a proposed critical intermediate in the misfolding of the prion protein), a result that explains the observed kinetic stabilization. Our results provide a rationale for the kinetic-stability consequences of disulfide-crosslink engineering and an experimental methodology to arrive at energetic/structural descriptions of the sparsely populated and elusive intermediates that play key roles in irreversible protein denaturation.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2471","intvolume":" 8","status":"public","title":"Mechanism of protein kinetic stabilization by engineered disulfide crosslinks","ddc":["570"],"pubrep_id":"414","file":[{"access_level":"open_access","file_name":"IST-2016-414-v1+1_journal.pone.0070013.pdf","creator":"system","content_type":"application/pdf","file_size":1323666,"file_id":"5124","relation":"main_file","checksum":"c0c96cc76ed7ef0d036a31a7e33c9a37","date_updated":"2020-07-14T12:45:41Z","date_created":"2018-12-12T10:15:07Z"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","day":"30","citation":{"chicago":"Sanchez-Romero, Inmaculada, Antonio Ariza, Keith Wilson, Michael Skjøt, Jesper Vind, Leonardo De Maria, Lars Skov, and Jose Sánchez Ruiz. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0070013.","short":"I. Sanchez-Romero, A. Ariza, K. Wilson, M. Skjøt, J. Vind, L. De Maria, L. Skov, J. Sánchez Ruiz, PLoS One 8 (2013).","mla":"Sanchez-Romero, Inmaculada, et al. “Mechanism of Protein Kinetic Stabilization by Engineered Disulfide Crosslinks.” PLoS One, vol. 8, no. 7, e70013, Public Library of Science, 2013, doi:10.1371/journal.pone.0070013.","ieee":"I. Sanchez-Romero et al., “Mechanism of protein kinetic stabilization by engineered disulfide crosslinks,” PLoS One, vol. 8, no. 7. Public Library of Science, 2013.","apa":"Sanchez-Romero, I., Ariza, A., Wilson, K., Skjøt, M., Vind, J., De Maria, L., … Sánchez Ruiz, J. (2013). Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0070013","ista":"Sanchez-Romero I, Ariza A, Wilson K, Skjøt M, Vind J, De Maria L, Skov L, Sánchez Ruiz J. 2013. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. 8(7), e70013.","ama":"Sanchez-Romero I, Ariza A, Wilson K, et al. Mechanism of protein kinetic stabilization by engineered disulfide crosslinks. PLoS One. 2013;8(7). doi:10.1371/journal.pone.0070013"},"publication":"PLoS One","date_published":"2013-07-30T00:00:00Z","article_number":"e70013","publist_id":"4430","file_date_updated":"2020-07-14T12:45:41Z","year":"2013","publisher":"Public Library of Science","department":[{"_id":"HaJa"}],"publication_status":"published","author":[{"last_name":"Sanchez Romero","first_name":"Inmaculada","id":"3D9C5D30-F248-11E8-B48F-1D18A9856A87","full_name":"Sanchez Romero, Inmaculada"},{"first_name":"Antonio","last_name":"Ariza","full_name":"Ariza, Antonio"},{"last_name":"Wilson","first_name":"Keith","full_name":"Wilson, Keith"},{"first_name":"Michael","last_name":"Skjøt","full_name":"Skjøt, Michael"},{"full_name":"Vind, Jesper","first_name":"Jesper","last_name":"Vind"},{"last_name":"De Maria","first_name":"Leonardo","full_name":"De Maria, Leonardo"},{"full_name":"Skov, Lars","first_name":"Lars","last_name":"Skov"},{"first_name":"Jose","last_name":"Sánchez Ruiz","full_name":"Sánchez Ruiz, Jose"}],"volume":8,"date_created":"2018-12-11T11:57:51Z","date_updated":"2021-01-12T06:57:41Z","month":"07","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.1371/journal.pone.0070013","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"doi":"10.1371/journal.pone.0070069","quality_controlled":"1","project":[{"name":"Hormonal cross-talk in plant organogenesis","call_identifier":"FP7","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","grant_number":"207362"},{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"month":"07","date_updated":"2021-01-12T06:57:41Z","date_created":"2018-12-11T11:57:52Z","volume":8,"author":[{"first_name":"Christopher","last_name":"Cazzonelli","full_name":"Cazzonelli, Christopher"},{"first_name":"Marleen","last_name":"Vanstraelen","full_name":"Vanstraelen, Marleen"},{"full_name":"Simon, Sibu","orcid":"0000-0002-1998-6741","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","last_name":"Simon","first_name":"Sibu"},{"full_name":"Yin, Kuide","first_name":"Kuide","last_name":"Yin"},{"full_name":"Carron Arthur, Ashley","first_name":"Ashley","last_name":"Carron Arthur"},{"first_name":"Nazia","last_name":"Nisar","full_name":"Nisar, Nazia"},{"full_name":"Tarle, Gauri","last_name":"Tarle","first_name":"Gauri"},{"full_name":"Cuttriss, Abby","last_name":"Cuttriss","first_name":"Abby"},{"full_name":"Searle, Iain","first_name":"Iain","last_name":"Searle"},{"full_name":"Benková, Eva","first_name":"Eva","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739"},{"full_name":"Mathesius, Ulrike","last_name":"Mathesius","first_name":"Ulrike"},{"full_name":"Masle, Josette","last_name":"Masle","first_name":"Josette"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","first_name":"Jirí","last_name":"Friml","full_name":"Friml, Jirí"},{"last_name":"Pogson","first_name":"Barry","full_name":"Pogson, Barry"}],"publication_status":"published","publisher":"Public Library of Science","department":[{"_id":"JiFr"},{"_id":"EvBe"}],"year":"2013","file_date_updated":"2020-07-14T12:45:41Z","publist_id":"4431","ec_funded":1,"article_number":"e70069","date_published":"2013-07-29T00:00:00Z","publication":"PLoS One","citation":{"short":"C. Cazzonelli, M. Vanstraelen, S. Simon, K. Yin, A. Carron Arthur, N. Nisar, G. Tarle, A. Cuttriss, I. Searle, E. Benková, U. Mathesius, J. Masle, J. Friml, B. Pogson, PLoS One 8 (2013).","mla":"Cazzonelli, Christopher, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” PLoS One, vol. 8, no. 7, e70069, Public Library of Science, 2013, doi:10.1371/journal.pone.0070069.","chicago":"Cazzonelli, Christopher, Marleen Vanstraelen, Sibu Simon, Kuide Yin, Ashley Carron Arthur, Nazia Nisar, Gauri Tarle, et al. “Role of the Arabidopsis PIN6 Auxin Transporter in Auxin Homeostasis and Auxin-Mediated Development.” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0070069.","ama":"Cazzonelli C, Vanstraelen M, Simon S, et al. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. 2013;8(7). doi:10.1371/journal.pone.0070069","ieee":"C. Cazzonelli et al., “Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development,” PLoS One, vol. 8, no. 7. Public Library of Science, 2013.","apa":"Cazzonelli, C., Vanstraelen, M., Simon, S., Yin, K., Carron Arthur, A., Nisar, N., … Pogson, B. (2013). Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0070069","ista":"Cazzonelli C, Vanstraelen M, Simon S, Yin K, Carron Arthur A, Nisar N, Tarle G, Cuttriss A, Searle I, Benková E, Mathesius U, Masle J, Friml J, Pogson B. 2013. Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development. PLoS One. 8(7), e70069."},"day":"29","has_accepted_license":"1","scopus_import":1,"file":[{"file_size":9003465,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2015-393-v1+1_journal.pone.0070069.pdf","checksum":"3be71828b6c2ba9c90eb7056e3f7f57a","date_created":"2018-12-12T10:16:34Z","date_updated":"2020-07-14T12:45:41Z","relation":"main_file","file_id":"5222"}],"oa_version":"Published Version","pubrep_id":"393","status":"public","title":"Role of the Arabidopsis PIN6 auxin transporter in auxin homeostasis and auxin-mediated development","ddc":["580","570"],"intvolume":" 8","_id":"2472","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Plant-specific PIN-formed (PIN) efflux transporters for the plant hormone auxin are required for tissue-specific directional auxin transport and cellular auxin homeostasis. The Arabidopsis PIN protein family has been shown to play important roles in developmental processes such as embryogenesis, organogenesis, vascular tissue differentiation, root meristem patterning and tropic growth. Here we analyzed roles of the less characterised Arabidopsis PIN6 auxin transporter. PIN6 is auxin-inducible and is expressed during multiple auxin-regulated developmental processes. Loss of pin6 function interfered with primary root growth and lateral root development. Misexpression of PIN6 affected auxin transport and interfered with auxin homeostasis in other growth processes such as shoot apical dominance, lateral root primordia development, adventitious root formation, root hair outgrowth and root waving. These changes in auxin-regulated growth correlated with a reduction in total auxin transport as well as with an altered activity of DR5-GUS auxin response reporter. Overall, the data indicate that PIN6 regulates auxin homeostasis during plant development."}],"issue":"7","type":"journal_article"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2470","intvolume":" 8","ddc":["570"],"status":"public","title":"Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells","pubrep_id":"413","oa_version":"Published Version","file":[{"file_size":2294955,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2016-413-v1+1_journal.pone.0070050.pdf","checksum":"2d47ef47616ef4de1d517d146548184e","date_updated":"2020-07-14T12:45:41Z","date_created":"2018-12-12T10:08:21Z","relation":"main_file","file_id":"4681"}],"type":"journal_article","issue":"7","abstract":[{"text":"Background:Auxin binding protein 1 (ABP1) is a putative auxin receptor and its function is indispensable for plant growth and development. ABP1 has been shown to be involved in auxin-dependent regulation of cell division and expansion, in plasma-membrane-related processes such as changes in transmembrane potential, and in the regulation of clathrin-dependent endocytosis. However, the ABP1-regulated downstream pathway remains elusive.Methodology/Principal Findings:Using auxin transport assays and quantitative analysis of cellular morphology we show that ABP1 regulates auxin efflux from tobacco BY-2 cells. The overexpression of ABP1can counterbalance increased auxin efflux and auxin starvation phenotypes caused by the overexpression of PIN auxin efflux carrier. Relevant mechanism involves the ABP1-controlled vesicle trafficking processes, including positive regulation of endocytosis of PIN auxin efflux carriers, as indicated by fluorescence recovery after photobleaching (FRAP) and pharmacological manipulations.Conclusions/Significance:The findings indicate the involvement of ABP1 in control of rate of auxin transport across plasma membrane emphasizing the role of ABP1 in regulation of PIN activity at the plasma membrane, and highlighting the relevance of ABP1 for the formation of developmentally important, PIN-dependent auxin gradients.","lang":"eng"}],"citation":{"chicago":"Čovanová, Milada, Michael Sauer, Jan Rychtář, Jiří Friml, Jan Petrášek, and Eva Zažímalová. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” PLoS One. Public Library of Science, 2013. https://doi.org/10.1371/journal.pone.0070050.","short":"M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, E. Zažímalová, PLoS One 8 (2013).","mla":"Čovanová, Milada, et al. “Overexpression of the Auxin Binding PROTEIN1 Modulates PIN-Dependent Auxin Transport in Tobacco Cells.” PLoS One, vol. 8, no. 7, e70050, Public Library of Science, 2013, doi:10.1371/journal.pone.0070050.","apa":"Čovanová, M., Sauer, M., Rychtář, J., Friml, J., Petrášek, J., & Zažímalová, E. (2013). Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0070050","ieee":"M. Čovanová, M. Sauer, J. Rychtář, J. Friml, J. Petrášek, and E. Zažímalová, “Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells,” PLoS One, vol. 8, no. 7. Public Library of Science, 2013.","ista":"Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. 2013. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. 8(7), e70050.","ama":"Čovanová M, Sauer M, Rychtář J, Friml J, Petrášek J, Zažímalová E. Overexpression of the auxin binding PROTEIN1 modulates PIN-dependent auxin transport in tobacco cells. PLoS One. 2013;8(7). doi:10.1371/journal.pone.0070050"},"publication":"PLoS One","date_published":"2013-07-23T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"23","year":"2013","publisher":"Public Library of Science","department":[{"_id":"JiFr"}],"publication_status":"published","author":[{"full_name":"Čovanová, Milada","last_name":"Čovanová","first_name":"Milada"},{"first_name":"Michael","last_name":"Sauer","full_name":"Sauer, Michael"},{"last_name":"Rychtář","first_name":"Jan","full_name":"Rychtář, Jan"},{"full_name":"Friml, Jirí","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"last_name":"Zažímalová","first_name":"Eva","full_name":"Zažímalová, Eva"}],"volume":8,"date_created":"2018-12-11T11:57:51Z","date_updated":"2021-01-12T06:57:40Z","article_number":"e70050","publist_id":"4432","file_date_updated":"2020-07-14T12:45:41Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","doi":"10.1371/journal.pone.0070050","language":[{"iso":"eng"}],"month":"07"},{"type":"journal_article","abstract":[{"text":"We introduce a new method for efficiently simulating liquid with extreme amounts of spatial adaptivity. Our method combines several key components to drastically speed up the simulation of large-scale fluid phenomena: We leverage an alternative Eulerian tetrahedral mesh discretization to significantly reduce the complexity of the pressure solve while increasing the robustness with respect to element quality and removing the possibility of locking. Next, we enable subtle free-surface phenomena by deriving novel second-order boundary conditions consistent with our discretization. We couple this discretization with a spatially adaptive Fluid-Implicit Particle (FLIP) method, enabling efficient, robust, minimally-dissipative simulations that can undergo sharp changes in spatial resolution while minimizing artifacts. Along the way, we provide a new method for generating a smooth and detailed surface from a set of particles with variable sizes. Finally, we explore several new sizing functions for determining spatially adaptive simulation resolutions, and we show how to couple them to our simulator. We combine each of these elements to produce a simulation algorithm that is capable of creating animations at high maximum resolutions while avoiding common pitfalls like inaccurate boundary conditions and inefficient computation.","lang":"eng"}],"issue":"4","_id":"2466","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Highly adaptive liquid simulations on tetrahedral meshes","status":"public","ddc":["000"],"intvolume":" 32","pubrep_id":"605","oa_version":"Submitted Version","file":[{"checksum":"aeea6b0ff2b27c695aeb8408c7d2fc50","date_created":"2018-12-12T10:17:25Z","date_updated":"2020-07-14T12:45:41Z","file_id":"5279","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":8601561,"access_level":"open_access","file_name":"IST-2016-605-v1+1_tetflip_fixed.pdf"}],"scopus_import":1,"day":"01","has_accepted_license":"1","publication":"ACM Transactions on Graphics","citation":{"mla":"Ando, Ryoichi, et al. “Highly Adaptive Liquid Simulations on Tetrahedral Meshes.” ACM Transactions on Graphics, vol. 32, no. 4, 103, ACM, 2013, doi:10.1145/2461912.2461982.","short":"R. Ando, N. Thuerey, C. Wojtan, ACM Transactions on Graphics 32 (2013).","chicago":"Ando, Ryoichi, Nils Thuerey, and Chris Wojtan. “Highly Adaptive Liquid Simulations on Tetrahedral Meshes.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461982.","ama":"Ando R, Thuerey N, Wojtan C. Highly adaptive liquid simulations on tetrahedral meshes. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461982","ista":"Ando R, Thuerey N, Wojtan C. 2013. Highly adaptive liquid simulations on tetrahedral meshes. ACM Transactions on Graphics. 32(4), 103.","ieee":"R. Ando, N. Thuerey, and C. Wojtan, “Highly adaptive liquid simulations on tetrahedral meshes,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.","apa":"Ando, R., Thuerey, N., & Wojtan, C. (2013). Highly adaptive liquid simulations on tetrahedral meshes. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461982"},"date_published":"2013-07-01T00:00:00Z","article_number":"103","file_date_updated":"2020-07-14T12:45:41Z","publist_id":"4436","year":"2013","publication_status":"published","publisher":"ACM","department":[{"_id":"ChWo"}],"author":[{"last_name":"Ando","first_name":"Ryoichi","full_name":"Ando, Ryoichi"},{"full_name":"Thuerey, Nils","first_name":"Nils","last_name":"Thuerey"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"}],"date_updated":"2023-02-23T10:44:14Z","date_created":"2018-12-11T11:57:50Z","volume":32,"month":"07","oa":1,"quality_controlled":"1","doi":"10.1145/2461912.2461982","language":[{"iso":"eng"}]},{"department":[{"_id":"ChWo"}],"publisher":"ACM","publication_status":"published","year":"2013","volume":32,"date_updated":"2023-02-23T10:44:16Z","date_created":"2018-12-11T11:57:50Z","author":[{"full_name":"Bernstein, Gilbert","first_name":"Gilbert","last_name":"Bernstein"},{"full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan"}],"article_number":"34","publist_id":"4435","file_date_updated":"2020-07-14T12:45:41Z","quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/2461912.2462027","month":"07","intvolume":" 32","status":"public","title":"Putting holes in holey geometry: Topology change for arbitrary surfaces","ddc":["000"],"_id":"2467","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2020-07-14T12:45:41Z","date_created":"2018-12-12T10:09:43Z","checksum":"9c8425d62246996ca632c5a01870515b","relation":"main_file","file_id":"4768","file_size":3514674,"content_type":"application/pdf","creator":"system","file_name":"IST-2016-604-v1+1_toptop2013.pdf","access_level":"open_access"}],"oa_version":"Submitted Version","pubrep_id":"604","type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"This paper presents a method for computing topology changes for triangle meshes in an interactive geometric modeling environment. Most triangle meshes in practice do not exhibit desirable geometric properties, so we develop a solution that is independent of standard assumptions and robust to geometric errors. Specifically, we provide the first method for topology change applicable to arbitrary non-solid, non-manifold, non-closed, self-intersecting surfaces. We prove that this new method for topology change produces the expected conventional results when applied to solid (closed, manifold, non-self-intersecting) surfaces---that is, we prove a backwards-compatibility property relative to prior work. Beyond solid surfaces, we present empirical evidence that our method remains tolerant to a variety of surface aberrations through the incorporation of a novel error correction scheme. Finally, we demonstrate how topology change applied to non-solid objects enables wholly new and useful behaviors."}],"citation":{"ieee":"G. Bernstein and C. Wojtan, “Putting holes in holey geometry: Topology change for arbitrary surfaces,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.","apa":"Bernstein, G., & Wojtan, C. (2013). Putting holes in holey geometry: Topology change for arbitrary surfaces. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2462027","ista":"Bernstein G, Wojtan C. 2013. Putting holes in holey geometry: Topology change for arbitrary surfaces. ACM Transactions on Graphics. 32(4), 34.","ama":"Bernstein G, Wojtan C. Putting holes in holey geometry: Topology change for arbitrary surfaces. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2462027","chicago":"Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry: Topology Change for Arbitrary Surfaces.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2462027.","short":"G. Bernstein, C. Wojtan, ACM Transactions on Graphics 32 (2013).","mla":"Bernstein, Gilbert, and Chris Wojtan. “Putting Holes in Holey Geometry: Topology Change for Arbitrary Surfaces.” ACM Transactions on Graphics, vol. 32, no. 4, 34, ACM, 2013, doi:10.1145/2461912.2462027."},"publication":"ACM Transactions on Graphics","date_published":"2013-07-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01"},{"citation":{"short":"M. Bojsen-Hansen, C. Wojtan, ACM Transactions on Graphics 32 (2013).","mla":"Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with Error Compensation.” ACM Transactions on Graphics, vol. 32, no. 4, 68, ACM, 2013, doi:10.1145/2461912.2461991.","chicago":"Bojsen-Hansen, Morten, and Chris Wojtan. “Liquid Surface Tracking with Error Compensation.” ACM Transactions on Graphics. ACM, 2013. https://doi.org/10.1145/2461912.2461991.","ama":"Bojsen-Hansen M, Wojtan C. Liquid surface tracking with error compensation. ACM Transactions on Graphics. 2013;32(4). doi:10.1145/2461912.2461991","apa":"Bojsen-Hansen, M., & Wojtan, C. (2013). Liquid surface tracking with error compensation. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2461912.2461991","ieee":"M. Bojsen-Hansen and C. Wojtan, “Liquid surface tracking with error compensation,” ACM Transactions on Graphics, vol. 32, no. 4. ACM, 2013.","ista":"Bojsen-Hansen M, Wojtan C. 2013. Liquid surface tracking with error compensation. ACM Transactions on Graphics. 32(4), 68."},"publication":"ACM Transactions on Graphics","date_published":"2013-07-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","_id":"2468","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 32","ddc":["000"],"status":"public","title":"Liquid surface tracking with error compensation","pubrep_id":"603","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:09:37Z","date_updated":"2020-07-14T12:45:41Z","checksum":"53d905e0180e23ef3e813b969ffed4e1","file_id":"4761","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":5813685,"file_name":"IST-2016-603-v1+1_liquidError_web.pdf","access_level":"open_access"}],"type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"Our work concerns the combination of an Eulerian liquid simulation with a high-resolution surface tracker (e.g. the level set method or a Lagrangian triangle mesh). The naive application of a high-resolution surface tracker to a low-resolution velocity field can produce many visually disturbing physical and topological artifacts that limit their use in practice. We address these problems by defining an error function which compares the current state of the surface tracker to the set of physically valid surface states. By reducing this error with a gradient descent technique, we introduce a novel physics-based surface fairing method. Similarly, by treating this error function as a potential energy, we derive a new surface correction force that mimics the vortex sheet equations. We demonstrate our results with both level set and mesh-based surface trackers."}],"oa":1,"quality_controlled":"1","doi":"10.1145/2461912.2461991","language":[{"iso":"eng"}],"month":"07","year":"2013","department":[{"_id":"ChWo"}],"publisher":"ACM","publication_status":"published","author":[{"orcid":"0000-0002-4417-3224","id":"439F0C8C-F248-11E8-B48F-1D18A9856A87","last_name":"Bojsen-Hansen","first_name":"Morten","full_name":"Bojsen-Hansen, Morten"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","first_name":"Christopher J","last_name":"Wojtan","full_name":"Wojtan, Christopher J"}],"volume":32,"date_created":"2018-12-11T11:57:50Z","date_updated":"2023-02-23T10:44:18Z","article_number":"68","publist_id":"4434","file_date_updated":"2020-07-14T12:45:41Z"},{"publist_id":"4433","file_date_updated":"2020-07-14T12:45:41Z","publisher":"Cell Press","department":[{"_id":"CaHe"}],"publication_status":"published","pmid":1,"year":"2013","volume":23,"date_created":"2018-12-11T11:57:51Z","date_updated":"2021-01-12T06:57:40Z","author":[{"orcid":"0000-0002-3688-1474","id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","last_name":"Maître","first_name":"Jean-Léon","full_name":"Maître, Jean-Léon"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"month":"07","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"pmid":["23885883"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1016/j.cub.2013.06.019","type":"journal_article","issue":"14","abstract":[{"lang":"eng","text":"Cadherins are transmembrane proteins that mediate cell–cell adhesion in animals. By regulating contact formation and stability, cadherins play a crucial role in tissue morphogenesis and homeostasis. Here, we review the three major unctions of cadherins in cell–cell contact formation and stability. Two of those functions lead to a decrease in interfacial ension at the forming cell–cell contact, thereby promoting contact expansion — first, by providing adhesion tension that lowers interfacial tension at the cell–cell contact, and second, by signaling to the actomyosin cytoskeleton in order to reduce cortex tension and thus interfacial tension at the contact. The third function of cadherins in cell–cell contact formation is to stabilize the contact by resisting mechanical forces that pull on the contact."}],"intvolume":" 23","status":"public","title":"Three functions of cadherins in cell adhesion","ddc":["570"],"_id":"2469","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_id":"5881","checksum":"6a424b2f007b41d4955a9135793b2162","date_created":"2019-01-24T15:40:22Z","date_updated":"2020-07-14T12:45:41Z","access_level":"open_access","file_name":"2013_CurrentBiology_Maitre.pdf","content_type":"application/pdf","file_size":247320,"creator":"dernst"}],"oa_version":"Published Version","scopus_import":1,"has_accepted_license":"1","day":"22","page":"R626 - R633","citation":{"chicago":"Maître, Jean-Léon, and Carl-Philipp J Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” Current Biology. Cell Press, 2013. https://doi.org/10.1016/j.cub.2013.06.019.","mla":"Maître, Jean-Léon, and Carl-Philipp J. Heisenberg. “Three Functions of Cadherins in Cell Adhesion.” Current Biology, vol. 23, no. 14, Cell Press, 2013, pp. R626–33, doi:10.1016/j.cub.2013.06.019.","short":"J.-L. Maître, C.-P.J. Heisenberg, Current Biology 23 (2013) R626–R633.","ista":"Maître J-L, Heisenberg C-PJ. 2013. Three functions of cadherins in cell adhesion. Current Biology. 23(14), R626–R633.","apa":"Maître, J.-L., & Heisenberg, C.-P. J. (2013). Three functions of cadherins in cell adhesion. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2013.06.019","ieee":"J.-L. Maître and C.-P. J. Heisenberg, “Three functions of cadherins in cell adhesion,” Current Biology, vol. 23, no. 14. Cell Press, pp. R626–R633, 2013.","ama":"Maître J-L, Heisenberg C-PJ. Three functions of cadherins in cell adhesion. Current Biology. 2013;23(14):R626-R633. doi:10.1016/j.cub.2013.06.019"},"publication":"Current Biology","date_published":"2013-07-22T00:00:00Z"},{"date_published":"2013-08-31T00:00:00Z","doi":"10.4153/CMB-2011-177-4","quality_controlled":0,"page":"500 - 502","publication":"Canadian Mathematical Bulletin","citation":{"ama":"Browning TD. The Lang-Weil estimate for cubic hypersurfaces. Canadian Mathematical Bulletin. 2013;56(3):500-502. doi:10.4153/CMB-2011-177-4","ieee":"T. D. Browning, “The Lang-Weil estimate for cubic hypersurfaces,” Canadian Mathematical Bulletin, vol. 56, no. 3. Unknown, pp. 500–502, 2013.","apa":"Browning, T. D. (2013). The Lang-Weil estimate for cubic hypersurfaces. Canadian Mathematical Bulletin. Unknown. https://doi.org/10.4153/CMB-2011-177-4","ista":"Browning TD. 2013. The Lang-Weil estimate for cubic hypersurfaces. Canadian Mathematical Bulletin. 56(3), 500–502.","short":"T.D. Browning, Canadian Mathematical Bulletin 56 (2013) 500–502.","mla":"Browning, Timothy D. “The Lang-Weil Estimate for Cubic Hypersurfaces.” Canadian Mathematical Bulletin, vol. 56, no. 3, Unknown, 2013, pp. 500–02, doi:10.4153/CMB-2011-177-4.","chicago":"Browning, Timothy D. “The Lang-Weil Estimate for Cubic Hypersurfaces.” Canadian Mathematical Bulletin. Unknown, 2013. https://doi.org/10.4153/CMB-2011-177-4."},"month":"08","day":"31","date_created":"2018-12-11T11:45:25Z","date_updated":"2021-01-12T06:57:40Z","volume":56,"author":[{"last_name":"Browning","first_name":"Timothy D","orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","full_name":"Timothy Browning"}],"status":"public","publication_status":"published","title":"The Lang-Weil estimate for cubic hypersurfaces","publisher":"Unknown","intvolume":" 56","_id":"247","acknowledgement":"EP/E053262/1\tEngineering and Physical Sciences Research Council","year":"2013","extern":1,"abstract":[{"lang":"eng","text":"An improved estimate is provided for the number of Fq-rational points on a geometrically irreducible, projective, cubic hypersurface that is not equal to a cone."}],"publist_id":"7657","issue":"3","type":"journal_article"},{"day":"03","has_accepted_license":"1","scopus_import":1,"date_published":"2013-01-03T00:00:00Z","page":"75 - 89","publication":"Theoretical Population Biology","citation":{"ama":"Barton NH, Etheridge A, Kelleher J, Véber A. Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. 2013;87(8):75-89. doi:10.1016/j.tpb.2012.12.001","ista":"Barton NH, Etheridge A, Kelleher J, Véber A. 2013. Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. 87(8), 75–89.","ieee":"N. H. Barton, A. Etheridge, J. Kelleher, and A. Véber, “Genetic hitch-hiking in spatially extended populations,” Theoretical Population Biology, vol. 87, no. 8. Elsevier, pp. 75–89, 2013.","apa":"Barton, N. H., Etheridge, A., Kelleher, J., & Véber, A. (2013). Genetic hitch-hiking in spatially extended populations. Theoretical Population Biology. Elsevier. https://doi.org/10.1016/j.tpb.2012.12.001","mla":"Barton, Nicholas H., et al. “Genetic Hitch-Hiking in Spatially Extended Populations.” Theoretical Population Biology, vol. 87, no. 8, Elsevier, 2013, pp. 75–89, doi:10.1016/j.tpb.2012.12.001.","short":"N.H. Barton, A. Etheridge, J. Kelleher, A. Véber, Theoretical Population Biology 87 (2013) 75–89.","chicago":"Barton, Nicholas H, Alison Etheridge, Jerome Kelleher, and Amandine Véber. “Genetic Hitch-Hiking in Spatially Extended Populations.” Theoretical Population Biology. Elsevier, 2013. https://doi.org/10.1016/j.tpb.2012.12.001."},"abstract":[{"text":"When a mutation with selective advantage s spreads through a panmictic population, it may cause two lineages at a linked locus to coalesce; the probability of coalescence is exp(−2rT), where T∼log(2Ns)/s is the time to fixation, N is the number of haploid individuals, and r is the recombination rate. Population structure delays fixation, and so weakens the effect of a selective sweep. However, favourable alleles spread through a spatially continuous population behind a narrow wavefront; ancestral lineages are confined at the tip of this front, and so coalesce rapidly. In extremely dense populations, coalescence is dominated by rare fluctuations ahead of the front. However, we show that for moderate densities, a simple quasi-deterministic approximation applies: the rate of coalescence within the front is λ∼2g(η)/(ρℓ), where ρ is the population density and is the characteristic scale of the wavefront; g(η) depends only on the strength of random drift, . The net effect of a sweep on coalescence also depends crucially on whether two lineages are ever both within the wavefront at the same time: even in the extreme case when coalescence within the front is instantaneous, the net rate of coalescence may be lower than in a single panmictic population. Sweeps can also have a substantial impact on the rate of gene flow. A single lineage will jump to a new location when it is hit by a sweep, with mean square displacement ; this can be substantial if the species’ range, L, is large, even if the species-wide rate of sweeps per map length, Λ/R, is small. This effect is half as strong in two dimensions. In contrast, the rate of coalescence between lineages, at random locations in space and on the genetic map, is proportional to (c/L)(Λ/R), where c is the wavespeed: thus, on average, one-dimensional structure is likely to reduce coalescence due to sweeps, relative to panmixis. In two dimensions, genes must move along the front before they can coalesce; this process is rapid, being dominated by rare fluctuations. This leads to a dramatically higher rate of coalescence within the wavefront than if lineages simply diffused along the front. Nevertheless, the net rate of coalescence due to a sweep through a two-dimensional population is likely to be lower than it would be with panmixis.","lang":"eng"}],"issue":"8","type":"journal_article","oa_version":"Submitted Version","file":[{"file_id":"5376","relation":"main_file","checksum":"4274ec1f433b838a7d5b941cc9684ca7","date_updated":"2020-07-14T12:45:41Z","date_created":"2018-12-12T10:18:54Z","access_level":"open_access","file_name":"IST-2013-118-v1+1_bartonetalRevision.pdf","creator":"system","content_type":"application/pdf","file_size":1706282}],"pubrep_id":"118","title":"Genetic hitch-hiking in spatially extended populations","ddc":["570"],"status":"public","intvolume":" 87","_id":"2473","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","language":[{"iso":"eng"}],"doi":"10.1016/j.tpb.2012.12.001","quality_controlled":"1","project":[{"grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"oa":1,"file_date_updated":"2020-07-14T12:45:41Z","ec_funded":1,"publist_id":"4428","date_updated":"2021-01-12T06:57:42Z","date_created":"2018-12-11T11:57:52Z","volume":87,"author":[{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison"},{"last_name":"Kelleher","first_name":"Jerome","full_name":"Kelleher, Jerome"},{"full_name":"Véber, Amandine","first_name":"Amandine","last_name":"Véber"}],"publication_status":"published","publisher":"Elsevier","department":[{"_id":"NiBa"}],"year":"2013"},{"date_published":"2013-01-08T00:00:00Z","doi":"10.1073/pnas.1214718110","page":"725 - 730","quality_controlled":0,"citation":{"short":"E. Budreck, O. Kwon, J. Jung, S. Baudouin, A. Thommen, H. Kim, Y. Fukazawa, H. Harada, K. Tabuchi, R. Shigemoto, P. Scheiffele, J. Kim, PNAS 110 (2013) 725–730.","mla":"Budreck, Elaine, et al. “Neuroligin-1 Controls Synaptic Abundance of NMDA-Type Glutamate Receptors through Extracellular Coupling.” PNAS, vol. 110, no. 2, National Academy of Sciences, 2013, pp. 725–30, doi:10.1073/pnas.1214718110.","chicago":"Budreck, Elaine, Oh Kwon, Jung Jung, Stéphane Baudouin, Albert Thommen, Hye Kim, Yugo Fukazawa, et al. “Neuroligin-1 Controls Synaptic Abundance of NMDA-Type Glutamate Receptors through Extracellular Coupling.” PNAS. National Academy of Sciences, 2013. https://doi.org/10.1073/pnas.1214718110.","ama":"Budreck E, Kwon O, Jung J, et al. Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling. PNAS. 2013;110(2):725-730. doi:10.1073/pnas.1214718110","apa":"Budreck, E., Kwon, O., Jung, J., Baudouin, S., Thommen, A., Kim, H., … Kim, J. (2013). Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1214718110","ieee":"E. Budreck et al., “Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling,” PNAS, vol. 110, no. 2. National Academy of Sciences, pp. 725–730, 2013.","ista":"Budreck E, Kwon O, Jung J, Baudouin S, Thommen A, Kim H, Fukazawa Y, Harada H, Tabuchi K, Shigemoto R, Scheiffele P, Kim J. 2013. Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling. PNAS. 110(2), 725–730."},"publication":"PNAS","day":"08","month":"01","volume":110,"date_created":"2018-12-11T11:57:54Z","date_updated":"2021-01-12T06:57:43Z","author":[{"last_name":"Budreck","first_name":"Elaine","full_name":"Budreck, Elaine C"},{"first_name":"Oh","last_name":"Kwon","full_name":"Kwon, Oh-Bin"},{"last_name":"Jung","first_name":"Jung","full_name":"Jung, Jung-Hoon"},{"full_name":"Baudouin, Stéphane J","first_name":"Stéphane","last_name":"Baudouin"},{"full_name":"Thommen, Albert","first_name":"Albert","last_name":"Thommen"},{"first_name":"Hye","last_name":"Kim","full_name":"Kim, Hye-Sun"},{"full_name":"Fukazawa, Yugo","first_name":"Yugo","last_name":"Fukazawa"},{"first_name":"Harumi","last_name":"Harada","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7429-7896","full_name":"Harumi Harada"},{"last_name":"Tabuchi","first_name":"Katsuhiko","full_name":"Tabuchi, Katsuhiko"},{"last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto"},{"last_name":"Scheiffele","first_name":"Peter","full_name":"Scheiffele, Peter"},{"full_name":"Kim, Joung-Hun","first_name":"Joung","last_name":"Kim"}],"publisher":"National Academy of Sciences","intvolume":" 110","title":"Neuroligin-1 controls synaptic abundance of NMDA-type glutamate receptors through extracellular coupling","status":"public","publication_status":"published","_id":"2478","year":"2013","extern":1,"issue":"2","publist_id":"4423","abstract":[{"text":"Despite the pivotal functions of the NMDA receptor (NMDAR) for neural circuit development and synaptic plasticity, the molecular mechanisms underlying the dynamics of NMDAR trafficking are poorly understood. The cell adhesion molecule neuroligin-1 (NL1) modifies NMDAR-dependent synaptic transmission and synaptic plasticity, but it is unclear whether NL1 controls synaptic accumulation or function of the receptors. Here, we provide evidence that NL1 regulates the abundance of NMDARs at postsynaptic sites. This function relies on extracellular, NL1 isoform-specific sequences that facilitate biochemical interactions between NL1 and the NMDAR GluN1 subunit. Our work uncovers NL1 isoform-specific cisinteractions with ionotropic glutamate receptors as a key mechanism for controlling synaptic properties.","lang":"eng"}],"type":"journal_article"},{"status":"public","title":"Density of Châtelet surfaces failing the Hasse principle","publication_status":"published","publisher":"Oxford University Press","intvolume":" 108","acknowledgement":"While working on this paper, the first author was supported by an IUF Junior and ANR while the second author was supported by ERC grant 306457.","_id":"250","year":"2013","date_updated":"2021-01-12T06:57:51Z","date_created":"2018-12-11T11:45:26Z","volume":108,"author":[{"first_name":"Régis","last_name":"De La Bretèche","full_name":"de la Bretèche, Régis"},{"first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","full_name":"Timothy Browning"}],"type":"journal_article","extern":1,"abstract":[{"text":"Châtelet surfaces provide a rich source of geometrically rational surfaces that do not always satisfy the Hasse principle. Restricting attention to a special class of Châtelet surfaces, we investigate the frequency that such counter-examples arise over the rational numbers.","lang":"eng"}],"issue":"4","publist_id":"7652","quality_controlled":0,"page":"1030 - 1078","publication":"Proceedings of the London Mathematical Society","oa":1,"citation":{"ama":"De La Bretèche R, Browning TD. Density of Châtelet surfaces failing the Hasse principle. Proceedings of the London Mathematical Society. 2013;108(4):1030-1078. doi:10.1112/plms/pdt060","apa":"De La Bretèche, R., & Browning, T. D. (2013). Density of Châtelet surfaces failing the Hasse principle. Proceedings of the London Mathematical Society. Oxford University Press. https://doi.org/10.1112/plms/pdt060","ieee":"R. De La Bretèche and T. D. Browning, “Density of Châtelet surfaces failing the Hasse principle,” Proceedings of the London Mathematical Society, vol. 108, no. 4. Oxford University Press, pp. 1030–1078, 2013.","ista":"De La Bretèche R, Browning TD. 2013. Density of Châtelet surfaces failing the Hasse principle. Proceedings of the London Mathematical Society. 108(4), 1030–1078.","short":"R. De La Bretèche, T.D. Browning, Proceedings of the London Mathematical Society 108 (2013) 1030–1078.","mla":"De La Bretèche, Régis, and Timothy D. Browning. “Density of Châtelet Surfaces Failing the Hasse Principle.” Proceedings of the London Mathematical Society, vol. 108, no. 4, Oxford University Press, 2013, pp. 1030–78, doi:10.1112/plms/pdt060.","chicago":"De La Bretèche, Régis, and Timothy D Browning. “Density of Châtelet Surfaces Failing the Hasse Principle.” Proceedings of the London Mathematical Society. Oxford University Press, 2013. https://doi.org/10.1112/plms/pdt060."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1210.4010"}],"date_published":"2013-11-29T00:00:00Z","doi":"10.1112/plms/pdt060","month":"11","day":"29"},{"doi":"10.5802/jtnb.857","date_published":"2013-05-14T00:00:00Z","citation":{"chicago":"De La Bretèche, Régis, and Timothy D Browning. “Counter Examples to the Hasse Principle among Certain Coflasque Tori.” Journal de Theorie Des Nombres de Bordeaux. Universite de Bordeaux I, 2013. https://doi.org/10.5802/jtnb.857.","short":"R. De La Bretèche, T.D. Browning, Journal de Theorie Des Nombres de Bordeaux 26 (2013) 25–44.","mla":"De La Bretèche, Régis, and Timothy D. Browning. “Counter Examples to the Hasse Principle among Certain Coflasque Tori.” Journal de Theorie Des Nombres de Bordeaux, vol. 26, no. 1, Universite de Bordeaux I, 2013, pp. 25–44, doi:10.5802/jtnb.857.","apa":"De La Bretèche, R., & Browning, T. D. (2013). Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie Des Nombres de Bordeaux. Universite de Bordeaux I. https://doi.org/10.5802/jtnb.857","ieee":"R. De La Bretèche and T. D. Browning, “Counter examples to the Hasse principle among certain coflasque tori,” Journal de Theorie des Nombres de Bordeaux, vol. 26, no. 1. Universite de Bordeaux I, pp. 25–44, 2013.","ista":"De La Bretèche R, Browning TD. 2013. Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie des Nombres de Bordeaux. 26(1), 25–44.","ama":"De La Bretèche R, Browning TD. Counter examples to the Hasse principle among certain coflasque tori. Journal de Theorie des Nombres de Bordeaux. 2013;26(1):25-44. doi:10.5802/jtnb.857"},"publication":"Journal de Theorie des Nombres de Bordeaux","page":"25 - 44","quality_controlled":0,"day":"14","month":"05","author":[{"full_name":"de la Bretèche, Régis","last_name":"De La Bretèche","first_name":"Régis"},{"full_name":"Timothy Browning","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"}],"volume":26,"date_updated":"2021-01-12T06:57:55Z","date_created":"2018-12-11T11:45:26Z","year":"2013","_id":"251","intvolume":" 26","publisher":"Universite de Bordeaux I","status":"public","publication_status":"published","title":"Counter examples to the Hasse principle among certain coflasque tori","issue":"1","publist_id":"7651","abstract":[{"text":"We study the density of varieties in a certain family which do not satisfy the Hasse principle. This work relies on results recently obtained by Colliot-Thélène [3].","lang":"eng"}],"extern":1,"type":"journal_article"},{"date_published":"2013-07-01T00:00:00Z","page":"15 - 27","citation":{"chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_3.","mla":"Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3.","short":"S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.","ista":"Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality. 7966(Part 2), 15–27.","ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","apa":"Almagor, S., Boker, U., & Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_3","ama":"Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:10.1007/978-3-642-39212-2_3"},"day":"01","article_processing_charge":"No","has_accepted_license":"1","series_title":"Lecture Notes in Computer Science","scopus_import":1,"oa_version":"Submitted Version","file":[{"file_id":"7860","relation":"main_file","checksum":"85afbf6c18a2c7e377c52c9410e2d824","date_created":"2020-05-15T11:16:12Z","date_updated":"2020-07-14T12:45:42Z","access_level":"open_access","file_name":"2013_ICALP_Almagor.pdf","creator":"dernst","content_type":"application/pdf","file_size":363031}],"ddc":["000"],"title":"Formalizing and reasoning about quality","status":"public","intvolume":" 7966","_id":"2517","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set F of arbitrary functions over the interval [0,1]. For example, F may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[F]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[F] has roughly the same complexity as reasoning about traditional LTL.","lang":"eng"}],"issue":"Part 2","alternative_title":["LNCS"],"type":"conference","language":[{"iso":"eng"}],"conference":{"location":"Riga, Latvia","start_date":"2013-07-08","end_date":"2013-07-12","name":"ICALP: Automata, Languages and Programming"},"doi":"10.1007/978-3-642-39212-2_3","quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"oa":1,"month":"07","date_updated":"2020-08-11T10:09:47Z","date_created":"2018-12-11T11:58:08Z","volume":7966,"author":[{"first_name":"Shaull","last_name":"Almagor","full_name":"Almagor, Shaull"},{"full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","first_name":"Udi","last_name":"Boker"},{"last_name":"Kupferman","first_name":"Orna","full_name":"Kupferman, Orna"}],"publication_status":"published","department":[{"_id":"ToHe"}],"publisher":"Springer","acknowledgement":"ERC Grant QUALITY. ","year":"2013","file_date_updated":"2020-07-14T12:45:42Z","publist_id":"4384","ec_funded":1},{"abstract":[{"lang":"eng","text":"A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Živný showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. More recently, Thapper and Živný [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard."}],"issue":"1","type":"conference","alternative_title":["LNCS"],"oa_version":"Preprint","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2518","status":"public","title":"The power of linear programming for finite-valued CSPs: A constructive characterization","intvolume":" 7965","day":"01","scopus_import":1,"date_published":"2013-07-01T00:00:00Z","citation":{"chicago":"Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization,” 7965:625–36. Springer, 2013. https://doi.org/10.1007/978-3-642-39206-1_53.","short":"V. Kolmogorov, in:, Springer, 2013, pp. 625–636.","mla":"Kolmogorov, Vladimir. The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:10.1007/978-3-642-39206-1_53.","apa":"Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs: A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39206-1_53","ieee":"V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.","ista":"Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs: A constructive characterization. ICALP: Automata, Languages and Programming, LNCS, vol. 7965, 625–636.","ama":"Kolmogorov V. The power of linear programming for finite-valued CSPs: A constructive characterization. In: Vol 7965. Springer; 2013:625-636. doi:10.1007/978-3-642-39206-1_53"},"page":"625 - 636","publist_id":"4383","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"2271"}]},"date_created":"2018-12-11T11:58:08Z","date_updated":"2023-02-23T10:35:42Z","volume":7965,"year":"2013","publication_status":"published","department":[{"_id":"VlKo"}],"publisher":"Springer","month":"07","conference":{"location":"Riga, Latvia","start_date":"2013-07-08","end_date":"2013-07-12","name":"ICALP: Automata, Languages and Programming"},"doi":"10.1007/978-3-642-39206-1_53","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["1207.7213"]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1207.7213"}],"quality_controlled":"1"},{"month":"07","day":"30","scopus_import":1,"doi":"10.1109/TPAMI.2013.140","date_published":"2013-07-30T00:00:00Z","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","citation":{"chicago":"Lampert, Christoph, Hannes Nickisch, and Stefan Harmeling. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2013. https://doi.org/10.1109/TPAMI.2013.140.","mla":"Lampert, Christoph, et al. “Attribute-Based Classification for Zero-Shot Learning of Object Categories.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 3, IEEE, 2013, pp. 453–65, doi:10.1109/TPAMI.2013.140.","short":"C. Lampert, H. Nickisch, S. Harmeling, IEEE Transactions on Pattern Analysis and Machine Intelligence 36 (2013) 453–465.","ista":"Lampert C, Nickisch H, Harmeling S. 2013. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 36(3), 453–465.","apa":"Lampert, C., Nickisch, H., & Harmeling, S. (2013). Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2013.140","ieee":"C. Lampert, H. Nickisch, and S. Harmeling, “Attribute-based classification for zero-shot learning of object categories,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 36, no. 3. IEEE, pp. 453–465, 2013.","ama":"Lampert C, Nickisch H, Harmeling S. Attribute-based classification for zero-shot learning of object categories. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2013;36(3):453-465. doi:10.1109/TPAMI.2013.140"},"quality_controlled":"1","page":"453 - 465","abstract":[{"lang":"eng","text":"We study the problem of object recognition for categories for which we have no training examples, a task also called zero-data or zero-shot learning. This situation has hardly been studied in computer vision research, even though it occurs frequently: the world contains tens of thousands of different object classes and for only few of them image collections have been formed and suitably annotated. To tackle the problem we introduce attribute-based classification: objects are identified based on a high-level description that is phrased in terms of semantic attributes, such as the object's color or shape. Because the identification of each such property transcends the specific learning task at hand, the attribute classifiers can be pre-learned independently, e.g. from existing image datasets unrelated to the current task. Afterwards, new classes can be detected based on their attribute representation, without the need for a new training phase. In this paper we also introduce a new dataset, Animals with Attributes, of over 30,000 images of 50 animal classes, annotated with 85 semantic attributes. Extensive experiments on this and two more datasets show that attribute-based classification indeed is able to categorize images without access to any training images of the target classes."}],"publist_id":"4385","issue":"3","type":"journal_article","author":[{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"},{"full_name":"Nickisch, Hannes","last_name":"Nickisch","first_name":"Hannes"},{"last_name":"Harmeling","first_name":"Stefan","full_name":"Harmeling, Stefan"}],"date_updated":"2021-01-12T06:57:58Z","date_created":"2018-12-11T11:58:08Z","oa_version":"None","volume":36,"year":"2013","_id":"2516","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Attribute-based classification for zero-shot learning of object categories","status":"public","publication_status":"published","intvolume":" 36","publisher":"IEEE","department":[{"_id":"ChLa"}]},{"year":"2013","department":[{"_id":"ChLa"}],"publisher":"AUAI Press","publication_status":"published","author":[{"first_name":"Novi","last_name":"Quadrianto","full_name":"Quadrianto, Novi"},{"full_name":"Sharmanska, Viktoriia","last_name":"Sharmanska","first_name":"Viktoriia","orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"David","last_name":"Knowles","full_name":"Knowles, David"},{"full_name":"Ghahramani, Zoubin","first_name":"Zoubin","last_name":"Ghahramani"}],"date_updated":"2023-02-23T10:46:36Z","date_created":"2018-12-11T11:58:09Z","publist_id":"4381","file_date_updated":"2020-07-14T12:45:42Z","oa":1,"quality_controlled":"1","conference":{"end_date":"2013-07-15","location":"Bellevue, WA, United States","start_date":"2013-07-11","name":"UAI: Uncertainty in Artificial Intelligence"},"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9780974903996"]},"month":"07","_id":"2520","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"The supervised IBP: Neighbourhood preserving infinite latent feature models","status":"public","ddc":["000"],"pubrep_id":"137","oa_version":"Submitted Version","file":[{"date_updated":"2020-07-14T12:45:42Z","date_created":"2018-12-12T10:15:16Z","checksum":"325f20c4b926bd74d39006b97df572bd","relation":"main_file","file_id":"5134","file_size":1117100,"content_type":"application/pdf","creator":"system","file_name":"IST-2013-137-v1+1_QuaShaKnoGha13.pdf","access_level":"open_access"}],"type":"conference","abstract":[{"lang":"eng","text":"We propose a probabilistic model to infer supervised latent variables in\r\nthe Hamming space from observed data. Our model allows simultaneous\r\ninference of the number of binary latent variables, and their values. The\r\nlatent variables preserve neighbourhood structure of the data in a sense\r\nthat objects in the same semantic concept have similar latent values, and\r\nobjects in different concepts have dissimilar latent values. We formulate\r\nthe supervised infinite latent variable problem based on an intuitive\r\nprinciple of pulling objects together if they are of the same type, and\r\npushing them apart if they are not. We then combine this principle with a\r\nflexible Indian Buffet Process prior on the latent variables. We show that\r\nthe inferred supervised latent variables can be directly used to perform a\r\nnearest neighbour search for the purpose of retrieval. We introduce a new\r\napplication of dynamically extending hash codes, and show how to\r\neffectively couple the structure of the hash codes with continuously\r\ngrowing structure of the neighbourhood preserving infinite latent feature\r\nspace."}],"citation":{"ama":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. The supervised IBP: Neighbourhood preserving infinite latent feature models. In: Proceedings of the 29th Conference Uncertainty in Artificial Intelligence. AUAI Press; 2013:527-536.","apa":"Quadrianto, N., Sharmanska, V., Knowles, D., & Ghahramani, Z. (2013). The supervised IBP: Neighbourhood preserving infinite latent feature models. In Proceedings of the 29th conference uncertainty in Artificial Intelligence (pp. 527–536). Bellevue, WA, United States: AUAI Press.","ieee":"N. Quadrianto, V. Sharmanska, D. Knowles, and Z. Ghahramani, “The supervised IBP: Neighbourhood preserving infinite latent feature models,” in Proceedings of the 29th conference uncertainty in Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 527–536.","ista":"Quadrianto N, Sharmanska V, Knowles D, Ghahramani Z. 2013. The supervised IBP: Neighbourhood preserving infinite latent feature models. Proceedings of the 29th conference uncertainty in Artificial Intelligence. UAI: Uncertainty in Artificial Intelligence, 527–536.","short":"N. Quadrianto, V. Sharmanska, D. Knowles, Z. Ghahramani, in:, Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–536.","mla":"Quadrianto, Novi, et al. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, AUAI Press, 2013, pp. 527–36.","chicago":"Quadrianto, Novi, Viktoriia Sharmanska, David Knowles, and Zoubin Ghahramani. “The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models.” In Proceedings of the 29th Conference Uncertainty in Artificial Intelligence, 527–36. AUAI Press, 2013."},"publication":"Proceedings of the 29th conference uncertainty in Artificial Intelligence","page":"527 - 536","date_published":"2013-07-11T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"11"},{"issue":"1","publist_id":"7649","extern":1,"type":"journal_article","author":[{"orcid":"0000-0002-8314-0177","id":"35827D50-F248-11E8-B48F-1D18A9856A87","last_name":"Browning","first_name":"Timothy D","full_name":"Timothy Browning"}],"volume":60,"date_created":"2018-12-11T11:45:27Z","date_updated":"2021-01-12T06:58:03Z","year":"2013","_id":"253","publisher":"Unknown","intvolume":" 60","title":"Counting rational points on cubic hypersurfaces: Corrigendum","status":"public","publication_status":"published","month":"09","day":"06","doi":"10.1112/S0025579313000132","date_published":"2013-09-06T00:00:00Z","citation":{"short":"T.D. Browning, Mathematika 60 (2013) 101–107.","mla":"Browning, Timothy D. “Counting Rational Points on Cubic Hypersurfaces: Corrigendum.” Mathematika, vol. 60, no. 1, Unknown, 2013, pp. 101–07, doi:10.1112/S0025579313000132.","chicago":"Browning, Timothy D. “Counting Rational Points on Cubic Hypersurfaces: Corrigendum.” Mathematika. Unknown, 2013. https://doi.org/10.1112/S0025579313000132.","ama":"Browning TD. Counting rational points on cubic hypersurfaces: Corrigendum. Mathematika. 2013;60(1):101-107. doi:10.1112/S0025579313000132","ieee":"T. D. Browning, “Counting rational points on cubic hypersurfaces: Corrigendum,” Mathematika, vol. 60, no. 1. Unknown, pp. 101–107, 2013.","apa":"Browning, T. D. (2013). Counting rational points on cubic hypersurfaces: Corrigendum. Mathematika. Unknown. https://doi.org/10.1112/S0025579313000132","ista":"Browning TD. 2013. Counting rational points on cubic hypersurfaces: Corrigendum. Mathematika. 60(1), 101–107."},"publication":"Mathematika","page":"101 - 107","quality_controlled":0},{"publication_status":"published","status":"public","title":"Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice","publisher":"Elsevier","intvolume":" 66","year":"2013","_id":"2692","date_updated":"2021-01-12T06:59:05Z","date_created":"2018-12-11T11:59:06Z","volume":66,"author":[{"first_name":"Alice","last_name":"Dobi","full_name":"Dobi, Alice"},{"full_name":"Sartori, Simone B","last_name":"Sartori","first_name":"Simone"},{"first_name":"Daniela","last_name":"Busti","full_name":"Busti, Daniela"},{"full_name":"Van Der Putten, Herman V","first_name":"Herman","last_name":"Van Der Putten"},{"full_name":"Singewald, Nicolas","last_name":"Singewald","first_name":"Nicolas"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi"},{"full_name":"Ferraguti, Francesco","first_name":"Francesco","last_name":"Ferraguti"}],"type":"journal_article","extern":1,"abstract":[{"text":"The group III metabotropic glutamate (mGlu) receptors mGlu7 and mGlu8 are receiving increased attention as potential novel therapeutic targets for anxiety disorders. The effects mediated by these receptors appear to result from a complex interplay of facilitatory and inhibitory actions at different brain sites in the anxiety/fear circuits. To better understand the effect of mGlu7 and mGlu8 receptors on extinction of contextual fear and their critical sites of action in the fear networks, we focused on the amygdala. Direct injection into the basolateral complex of the amygdala of the mGlu7 receptor agonist AMN082 facilitated extinction, whereas the mGlu8 receptor agonist (S)-3,4-DCPG sustained freezing during the extinction acquisition trial. We also determined at the ultrastructural level the synaptic distribution of these receptors in the basal nucleus (BA) and intercalated cell clusters (ITCs) of the amygdala. Both areas are thought to exert key roles in fear extinction. We demonstrate that mGlu7 and mGlu8 receptors are located in different presynaptic terminals forming both asymmetric and symmetric synapses, and that they preferentially target neurons expressing mGlu1α receptors mostly located around ITCs. In addition we show that mGlu7 and mGlu8 receptors were segregated to different inputs to a significant extent. In particular, mGlu7a receptors were primarily onto glutamatergic afferents arising from the BA or midline thalamic nuclei, but not the medial prefrontal cortex (mPFC), as revealed by combined anterograde tracing and pre-embedding electron microscopy. On the other hand, mGlu8a showed a more restricted distribution in the BA and appeared absent from thalamic, mPFC and intrinsic inputs. This segregation of mGlu7 and mGlu8 receptors in different neuronal pathways of the fear circuit might explain the distinct effects on fear extinction training observed with mGlu7 and mGlu8 receptor agonists.","lang":"eng"}],"publist_id":"4205","quality_controlled":0,"page":"274 - 289","publication":"Neuropharmacology","citation":{"ieee":"A. Dobi et al., “Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice,” Neuropharmacology, vol. 66. Elsevier, pp. 274–289, 2013.","apa":"Dobi, A., Sartori, S., Busti, D., Van Der Putten, H., Singewald, N., Shigemoto, R., & Ferraguti, F. (2013). Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice. Neuropharmacology. Elsevier. https://doi.org/10.1016/j.neuropharm.2012.05.025","ista":"Dobi A, Sartori S, Busti D, Van Der Putten H, Singewald N, Shigemoto R, Ferraguti F. 2013. Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice. Neuropharmacology. 66, 274–289.","ama":"Dobi A, Sartori S, Busti D, et al. Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice. Neuropharmacology. 2013;66:274-289. doi:10.1016/j.neuropharm.2012.05.025","chicago":"Dobi, Alice, Simone Sartori, Daniela Busti, Herman Van Der Putten, Nicolas Singewald, Ryuichi Shigemoto, and Francesco Ferraguti. “Neural Substrates for the Distinct Effects of Presynaptic Group III Metabotropic Glutamate Receptors on Extinction of Contextual Fear Conditioning in Mice.” Neuropharmacology. Elsevier, 2013. https://doi.org/10.1016/j.neuropharm.2012.05.025.","short":"A. Dobi, S. Sartori, D. Busti, H. Van Der Putten, N. Singewald, R. Shigemoto, F. Ferraguti, Neuropharmacology 66 (2013) 274–289.","mla":"Dobi, Alice, et al. “Neural Substrates for the Distinct Effects of Presynaptic Group III Metabotropic Glutamate Receptors on Extinction of Contextual Fear Conditioning in Mice.” Neuropharmacology, vol. 66, Elsevier, 2013, pp. 274–89, doi:10.1016/j.neuropharm.2012.05.025."},"date_published":"2013-03-01T00:00:00Z","doi":"10.1016/j.neuropharm.2012.05.025","month":"03","day":"01"},{"type":"journal_article","issue":"8","publist_id":"4206","abstract":[{"lang":"eng","text":"P/Q-type voltage-dependent calcium channels play key roles in transmitter release, integration of dendritic signals, generation of dendritic spikes, and gene expression. High intracellular calcium concentration transient produced by these channels is restricted to tens to hundreds of nanometers from the channels. Therefore, precise localization of these channels along the plasma membrane was long sought to decipher how each neuronal cell function is controlled. Here, we analyzed the distribution of Cav2.1 subunit of the P/Q-type channel using highly sensitive SDS-digested freeze-fracture replica labeling in the rat cerebellar Purkinje cells. The labeling efficiency was such that the number of immunogold particles in each parallel fiber active zone was comparable to that of functional channels calculated from previous reports. Two distinct patterns of Cav2.1 distribution, scattered and clustered, were found in Purkinje cells. The scattered Cav2.1 had a somatodendritic gradient with the density of immunogold particles increasing 2.5-fold from soma to distal dendrites. The other population with 74-fold higher density than the scattered particles was found within clusters of intramembrane particles on the P-face of soma and primary dendrites. Both populations of Cav2.1 were found as early as P3 and increased in the second postnatal week to a mature level. Using double immunogold labeling, we found that virtually all of the Cav2.1 clusters were colocalized with two types of calcium-activated potassium channels, BK and SK2, with the nearest neighbor distance of 40∼nm. Calcium nanodomain created by the opening of Cav2.1 channels likely activates the two channels that limit the extent of depolarization."}],"extern":1,"year":"2013","_id":"2691","publisher":"Society for Neuroscience","intvolume":" 33","status":"public","title":"Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels","publication_status":"published","author":[{"full_name":"Indriati, Dwi Wahyu","last_name":"Indriati","first_name":"Dwi"},{"full_name":"Kamasawa, Naomi","last_name":"Kamasawa","first_name":"Naomi"},{"full_name":"Matsui, Ko","last_name":"Matsui","first_name":"Ko"},{"first_name":"Andrea","last_name":"Meredith","full_name":"Meredith, Andrea L"},{"first_name":"Masahiko","last_name":"Watanabe","full_name":"Watanabe, Masahiko"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto"}],"volume":33,"date_created":"2018-12-11T11:59:05Z","date_updated":"2021-01-12T06:59:05Z","day":"20","month":"02","citation":{"ama":"Indriati D, Kamasawa N, Matsui K, Meredith A, Watanabe M, Shigemoto R. Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels. Journal of Neuroscience. 2013;33(8):3668-3678. doi:10.1523/JNEUROSCI.2921-12.2013","ista":"Indriati D, Kamasawa N, Matsui K, Meredith A, Watanabe M, Shigemoto R. 2013. Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels. Journal of Neuroscience. 33(8), 3668–3678.","apa":"Indriati, D., Kamasawa, N., Matsui, K., Meredith, A., Watanabe, M., & Shigemoto, R. (2013). Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.2921-12.2013","ieee":"D. Indriati, N. Kamasawa, K. Matsui, A. Meredith, M. Watanabe, and R. Shigemoto, “Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels,” Journal of Neuroscience, vol. 33, no. 8. Society for Neuroscience, pp. 3668–3678, 2013.","mla":"Indriati, Dwi, et al. “Quantitative Localization of Cav2.1 (P/Q-Type) Voltage-Dependent Calcium Channels in Purkinje Cells: Somatodendritic Gradient and Distinct Somatic Coclustering with Calcium-Activated Potassium Channels.” Journal of Neuroscience, vol. 33, no. 8, Society for Neuroscience, 2013, pp. 3668–78, doi:10.1523/JNEUROSCI.2921-12.2013.","short":"D. Indriati, N. Kamasawa, K. Matsui, A. Meredith, M. Watanabe, R. Shigemoto, Journal of Neuroscience 33 (2013) 3668–3678.","chicago":"Indriati, Dwi, Naomi Kamasawa, Ko Matsui, Andrea Meredith, Masahiko Watanabe, and Ryuichi Shigemoto. “Quantitative Localization of Cav2.1 (P/Q-Type) Voltage-Dependent Calcium Channels in Purkinje Cells: Somatodendritic Gradient and Distinct Somatic Coclustering with Calcium-Activated Potassium Channels.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.2921-12.2013."},"publication":"Journal of Neuroscience","page":"3668 - 3678","quality_controlled":0,"doi":"10.1523/JNEUROSCI.2921-12.2013","date_published":"2013-02-20T00:00:00Z"},{"day":"01","month":"01","date_published":"2013-01-01T00:00:00Z","doi":"10.1113/jphysiol.2012.241398","publication":"Journal of Physiology","citation":{"ista":"Budisantoso T, Harada H, Kamasawa N, Fukazawa Y, Shigemoto R, Matsui K. 2013. Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held. Journal of Physiology. 591(1), 219–239.","apa":"Budisantoso, T., Harada, H., Kamasawa, N., Fukazawa, Y., Shigemoto, R., & Matsui, K. (2013). Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held. Journal of Physiology. Wiley-Blackwell. https://doi.org/10.1113/jphysiol.2012.241398","ieee":"T. Budisantoso, H. Harada, N. Kamasawa, Y. Fukazawa, R. Shigemoto, and K. Matsui, “Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held,” Journal of Physiology, vol. 591, no. 1. Wiley-Blackwell, pp. 219–239, 2013.","ama":"Budisantoso T, Harada H, Kamasawa N, Fukazawa Y, Shigemoto R, Matsui K. Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held. Journal of Physiology. 2013;591(1):219-239. doi:10.1113/jphysiol.2012.241398","chicago":"Budisantoso, Timotheus, Harumi Harada, Naomi Kamasawa, Yugo Fukazawa, Ryuichi Shigemoto, and Ko Matsui. “Evaluation of Glutamate Concentration Transient in the Synaptic Cleft of the Rat Calyx of Held.” Journal of Physiology. Wiley-Blackwell, 2013. https://doi.org/10.1113/jphysiol.2012.241398.","mla":"Budisantoso, Timotheus, et al. “Evaluation of Glutamate Concentration Transient in the Synaptic Cleft of the Rat Calyx of Held.” Journal of Physiology, vol. 591, no. 1, Wiley-Blackwell, 2013, pp. 219–39, doi:10.1113/jphysiol.2012.241398.","short":"T. Budisantoso, H. Harada, N. Kamasawa, Y. Fukazawa, R. Shigemoto, K. Matsui, Journal of Physiology 591 (2013) 219–239."},"quality_controlled":0,"page":"219 - 239","abstract":[{"text":"Establishing the spatiotemporal concentration profile of neurotransmitter following synaptic vesicular release is essential for our understanding of inter-neuronal communication. Such profile is a determinant of synaptic strength, short-term plasticity and inter-synaptic crosstalk. Synaptically released glutamate has been suggested to reach a few millimolar in concentration and last for <1 ms. The synaptic cleft is often conceived as a single concentration compartment, whereas a huge gradient likely exists. Modelling studies have attempted to describe this gradient, but two key parameters, the number of glutamate in a vesicle (NGlu) and its diffusion coefficient (DGlu) in the extracellular space, remained unresolved. To determine this profile, the rat calyx of Held synapse at postnatal day 12-16 was studied where diffusion of glutamate occurs two-dimensionally and where quantification of AMPA receptor distribution on individual postsynaptic specialization on medial nucleus of the trapezoid body principal cells is possible using SDS-digested freeze-fracture replica labelling. To assess the performance of these receptors as glutamate sensors, a kinetic model of the receptors was constructed from outside-out patch recordings. From here, we simulated synaptic responses and compared them with the EPSC recordings. Combinations of NGlu and DGlu with an optimum of 7000 and 0.3 μm2 ms-1 reproduced the data, suggesting slow diffusion. Further simulations showed that a single vesicle does not saturate the synaptic receptors, and that glutamate spillover does not affect the conductance amplitude at this synapse. Using the estimated profile, we also evaluated how the number of multiple vesicle releases at individual active zones affects the amplitude of postsynaptic signals.","lang":"eng"}],"publist_id":"4207","issue":"1","extern":1,"type":"journal_article","author":[{"last_name":"Budisantoso","first_name":"Timotheus","full_name":"Budisantoso, Timotheus"},{"full_name":"Harumi Harada","orcid":"0000-0001-7429-7896","id":"2E55CDF2-F248-11E8-B48F-1D18A9856A87","last_name":"Harada","first_name":"Harumi"},{"last_name":"Kamasawa","first_name":"Naomi","full_name":"Kamasawa, Naomi"},{"last_name":"Fukazawa","first_name":"Yugo","full_name":"Fukazawa, Yugo"},{"last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto"},{"full_name":"Matsui, Ko","last_name":"Matsui","first_name":"Ko"}],"date_updated":"2021-01-12T06:59:04Z","date_created":"2018-12-11T11:59:05Z","volume":591,"_id":"2690","year":"2013","publication_status":"published","title":"Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held","status":"public","intvolume":" 591","publisher":"Wiley-Blackwell"},{"type":"journal_article","abstract":[{"lang":"eng","text":"Inhibitory parvalbumin-containing interneurons (PVIs) control neuronal discharge and support the generation of theta- and gammafrequency oscillations in cortical networks. Fast GABAergic input onto PVIs is crucial for their synchronization and oscillatory entrainment, but the role of metabotropic GABAB receptors (GABABRs) in mediating slow presynaptic and postsynaptic inhibition remains unknown. In this study, we have combined high-resolution immunoelectron microscopy, whole-cell patch-clamp recording, and computational modeling to investigate the subcellular distribution and effects of GABABRs and their postsynaptic effector Kir3 channels in rat hippocampal PVIs. Pre-embedding immunogold labeling revealed that the receptors and channels localize at high levels to the extrasynaptic membrane of parvalbumin-immunoreactive dendrites. Immunoreactivity forGABABRs was also present at lower levels on PVI axon terminals. Whole-cell recordings further showed that synaptically released GABA in response to extracellular stimulation evokes large GABABR-mediated slow IPSCs in perisomatic-targeting (PT) PVIs, but only small or no currents in dendrite-targeting (DT) PVIs. In contrast, paired recordings demonstrated that GABABR activation results in presynaptic inhibition at the output synapses of both PT and DT PVIs, but more strongly in the latter. Finally, computational analysis indicated that GABAB IPSCs can phasically modulate the discharge of PT interneurons at theta frequencies. In summary, our results show that GABABRs differentially mediate slow presynaptic and postsynaptic inhibition in PVIs and can contribute to the dynamic modulation of their activity during oscillations. Furthermore, these data provide evidence for a compartment-specific molecular divergence of hippocampal PVI subtypes, suggesting that activation of GABABRs may shift the balance between perisomatic and dendritic inhibition."}],"issue":"18","publist_id":"4204","extern":1,"_id":"2693","year":"2013","publication_status":"published","status":"public","title":"Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons","publisher":"Society for Neuroscience","intvolume":" 33","author":[{"last_name":"Booker","first_name":"Sam","full_name":"Booker, Sam A"},{"full_name":"Gross, Anna","last_name":"Gross","first_name":"Anna"},{"last_name":"Althof","first_name":"Daniel","full_name":"Althof, Daniel"},{"full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bernhard","last_name":"Bettler","full_name":"Bettler, Bernhard"},{"first_name":"Michael","last_name":"Frotscher","full_name":"Frotscher, Michael"},{"full_name":"Hearing, Matthew C","last_name":"Hearing","first_name":"Matthew"},{"full_name":"Wickman, Kevin D","last_name":"Wickman","first_name":"Kevin"},{"last_name":"Watanabe","first_name":"Masahiko","full_name":"Watanabe, Masahiko"},{"full_name":"Kulik, Ákos","last_name":"Kulik","first_name":"Ákos"},{"full_name":"Vida, Imre","last_name":"Vida","first_name":"Imre"}],"date_created":"2018-12-11T11:59:06Z","date_updated":"2021-01-12T06:59:05Z","volume":33,"day":"01","month":"05","publication":"Journal of Neuroscience","citation":{"chicago":"Booker, Sam, Anna Gross, Daniel Althof, Ryuichi Shigemoto, Bernhard Bettler, Michael Frotscher, Matthew Hearing, et al. “Differential GABAB-Receptor-Mediated Effects in Perisomatic- and Dendrite-Targeting Parvalbumin Interneurons.” Journal of Neuroscience. Society for Neuroscience, 2013. https://doi.org/10.1523/JNEUROSCI.1186-12.2013.","mla":"Booker, Sam, et al. “Differential GABAB-Receptor-Mediated Effects in Perisomatic- and Dendrite-Targeting Parvalbumin Interneurons.” Journal of Neuroscience, vol. 33, no. 18, Society for Neuroscience, 2013, pp. 7961–74, doi:10.1523/JNEUROSCI.1186-12.2013.","short":"S. Booker, A. Gross, D. Althof, R. Shigemoto, B. Bettler, M. Frotscher, M. Hearing, K. Wickman, M. Watanabe, Á. Kulik, I. Vida, Journal of Neuroscience 33 (2013) 7961–7974.","ista":"Booker S, Gross A, Althof D, Shigemoto R, Bettler B, Frotscher M, Hearing M, Wickman K, Watanabe M, Kulik Á, Vida I. 2013. Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal of Neuroscience. 33(18), 7961–7974.","apa":"Booker, S., Gross, A., Althof, D., Shigemoto, R., Bettler, B., Frotscher, M., … Vida, I. (2013). Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal of Neuroscience. Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.1186-12.2013","ieee":"S. Booker et al., “Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons,” Journal of Neuroscience, vol. 33, no. 18. Society for Neuroscience, pp. 7961–7974, 2013.","ama":"Booker S, Gross A, Althof D, et al. Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons. Journal of Neuroscience. 2013;33(18):7961-7974. doi:10.1523/JNEUROSCI.1186-12.2013"},"quality_controlled":0,"page":"7961 - 7974","date_published":"2013-05-01T00:00:00Z","doi":"10.1523/JNEUROSCI.1186-12.2013"},{"month":"10","day":"16","language":[{"iso":"eng"}],"doi":"10.4171/JEMS/416","date_published":"2013-10-16T00:00:00Z","page":"2093 - 2113","quality_controlled":"1","citation":{"ista":"Erdös L, Fournais S, Solovej J. 2013. Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. 15(6), 2093–2113.","ieee":"L. Erdös, S. Fournais, and J. Solovej, “Stability and semiclassics in self-generated fields,” Journal of the European Mathematical Society, vol. 15, no. 6. European Mathematical Society, pp. 2093–2113, 2013.","apa":"Erdös, L., Fournais, S., & Solovej, J. (2013). Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. European Mathematical Society. https://doi.org/10.4171/JEMS/416","ama":"Erdös L, Fournais S, Solovej J. Stability and semiclassics in self-generated fields. Journal of the European Mathematical Society. 2013;15(6):2093-2113. doi:10.4171/JEMS/416","chicago":"Erdös, László, Søren Fournais, and Jan Solovej. “Stability and Semiclassics in Self-Generated Fields.” Journal of the European Mathematical Society. European Mathematical Society, 2013. https://doi.org/10.4171/JEMS/416.","mla":"Erdös, László, et al. “Stability and Semiclassics in Self-Generated Fields.” Journal of the European Mathematical Society, vol. 15, no. 6, European Mathematical Society, 2013, pp. 2093–113, doi:10.4171/JEMS/416.","short":"L. Erdös, S. Fournais, J. Solovej, Journal of the European Mathematical Society 15 (2013) 2093–2113."},"oa":1,"external_id":{"arxiv":["1105.0506"]},"main_file_link":[{"url":"http://arxiv.org/abs/1105.0506","open_access":"1"}],"publication":"Journal of the European Mathematical Society","issue":"6","publist_id":"4198","abstract":[{"lang":"eng","text":"We consider non-interacting particles subject to a fixed external potential V and a self-generated magnetic field B. The total energy includes the field energy β∫B2 and we minimize over all particle states and magnetic fields. In the case of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system. The parameter β tunes the coupling strength between the field and the particles and it effectively determines the strength of the field. We investigate the stability and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V). The relevant parameter measuring the field strength in the semiclassical limit is κ=βh. We are not able to give the exact leading order semiclassical asymptotics uniformly in κ or even for fixed κ. We do however give upper and lower bounds on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞ we show that the standard non-magnetic Weyl asymptotics holds. The same result also holds for the spinless case, i.e. where the Pauli operator is replaced by the Schrödinger operator."}],"type":"journal_article","volume":15,"oa_version":"Preprint","date_created":"2018-12-11T11:59:07Z","date_updated":"2021-01-12T06:59:07Z","author":[{"full_name":"Erdös, László","last_name":"Erdös","first_name":"László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fournais, Søren","first_name":"Søren","last_name":"Fournais"},{"first_name":"Jan","last_name":"Solovej","full_name":"Solovej, Jan"}],"intvolume":" 15","department":[{"_id":"LaEr"}],"publisher":"European Mathematical Society","publication_status":"published","title":"Stability and semiclassics in self-generated fields","status":"public","_id":"2698","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2013"},{"title":"Delocalization and diffusion profile for random band matrices","publication_status":"published","status":"public","publisher":"Springer","intvolume":" 323","year":"2013","_id":"2697","date_updated":"2021-01-12T06:59:07Z","date_created":"2018-12-11T11:59:07Z","volume":323,"author":[{"full_name":"László Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös"},{"first_name":"Antti","last_name":"Knowles","full_name":"Knowles, Antti"},{"full_name":"Yau, Horng-Tzer","first_name":"Horng","last_name":"Yau"},{"first_name":"Jun","last_name":"Yin","full_name":"Yin, Jun"}],"type":"journal_article","extern":1,"abstract":[{"lang":"eng","text":"We consider Hermitian and symmetric random band matrices H = (h xy ) in d⩾1 d ⩾ 1 dimensions. The matrix entries h xy , indexed by x,y∈(Z/LZ)d x , y ∈ ( Z / L Z ) d , are independent, centred random variables with variances sxy=E|hxy|2 s x y = E | h x y | 2 . We assume that s xy is negligible if |x − y| exceeds the band width W. In one dimension we prove that the eigenvectors of H are delocalized if W≫L4/5 W ≫ L 4 / 5 . We also show that the magnitude of the matrix entries |Gxy|2 | G x y | 2 of the resolvent G=G(z)=(H−z)−1 G = G ( z ) = ( H - z ) - 1 is self-averaging and we compute E|Gxy|2 E | G x y | 2 . We show that, as L→∞ L → ∞ and W≫L4/5 W ≫ L 4 / 5 , the behaviour of E|Gxy|2 E | G x y | 2 is governed by a diffusion operator whose diffusion constant we compute. Similar results are obtained in higher dimensions."}],"publist_id":"4199","issue":"1","quality_controlled":0,"page":"367 - 416","publication":"Communications in Mathematical Physics","main_file_link":[{"url":"http://arxiv.org/abs/1205.5669","open_access":"1"}],"oa":1,"citation":{"ieee":"L. Erdös, A. Knowles, H. Yau, and J. Yin, “Delocalization and diffusion profile for random band matrices,” Communications in Mathematical Physics, vol. 323, no. 1. Springer, pp. 367–416, 2013.","apa":"Erdös, L., Knowles, A., Yau, H., & Yin, J. (2013). Delocalization and diffusion profile for random band matrices. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-013-1773-3","ista":"Erdös L, Knowles A, Yau H, Yin J. 2013. Delocalization and diffusion profile for random band matrices. Communications in Mathematical Physics. 323(1), 367–416.","ama":"Erdös L, Knowles A, Yau H, Yin J. Delocalization and diffusion profile for random band matrices. Communications in Mathematical Physics. 2013;323(1):367-416. doi:10.1007/s00220-013-1773-3","chicago":"Erdös, László, Antti Knowles, Horng Yau, and Jun Yin. “Delocalization and Diffusion Profile for Random Band Matrices.” Communications in Mathematical Physics. Springer, 2013. https://doi.org/10.1007/s00220-013-1773-3.","short":"L. Erdös, A. Knowles, H. Yau, J. Yin, Communications in Mathematical Physics 323 (2013) 367–416.","mla":"Erdös, László, et al. “Delocalization and Diffusion Profile for Random Band Matrices.” Communications in Mathematical Physics, vol. 323, no. 1, Springer, 2013, pp. 367–416, doi:10.1007/s00220-013-1773-3."},"doi":"10.1007/s00220-013-1773-3","date_published":"2013-10-01T00:00:00Z","day":"01","month":"10"},{"scopus_import":1,"has_accepted_license":"1","day":"01","page":"1573 - 1580","citation":{"chicago":"Barton, Nicholas H, and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, 1573–80. ACM, 2013. https://doi.org/10.1145/2463372.2463568.","short":"N.H. Barton, T. Paixao, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–1580.","mla":"Barton, Nicholas H., and Tiago Paixao. “Can Quantitative and Population Genetics Help Us Understand Evolutionary Computation?” Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 1573–80, doi:10.1145/2463372.2463568.","ieee":"N. H. Barton and T. Paixao, “Can quantitative and population genetics help us understand evolutionary computation?,” in Proceedings of the 15th annual conference on Genetic and evolutionary computation, Amsterdam, Netherlands, 2013, pp. 1573–1580.","apa":"Barton, N. H., & Paixao, T. (2013). Can quantitative and population genetics help us understand evolutionary computation? In Proceedings of the 15th annual conference on Genetic and evolutionary computation (pp. 1573–1580). Amsterdam, Netherlands: ACM. https://doi.org/10.1145/2463372.2463568","ista":"Barton NH, Paixao T. 2013. Can quantitative and population genetics help us understand evolutionary computation? Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 1573–1580.","ama":"Barton NH, Paixao T. Can quantitative and population genetics help us understand evolutionary computation? In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation. ACM; 2013:1573-1580. doi:10.1145/2463372.2463568"},"publication":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","date_published":"2013-07-01T00:00:00Z","type":"conference","abstract":[{"lang":"eng","text":"Even though both population and quantitative genetics, and evolutionary computation, deal with the same questions, they have developed largely independently of each other. I review key results from each field, emphasising those that apply independently of the (usually unknown) relation between genotype and phenotype. The infinitesimal model provides a simple framework for predicting the response of complex traits to selection, which in biology has proved remarkably successful. This allows one to choose the schedule of population sizes and selection intensities that will maximise the response to selection, given that the total number of individuals realised, C = ∑t Nt, is constrained. This argument shows that for an additive trait (i.e., determined by the sum of effects of the genes), the optimum population size and the maximum possible response (i.e., the total change in trait mean) are both proportional to √C."}],"status":"public","ddc":["570"],"title":"Can quantitative and population genetics help us understand evolutionary computation?","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2718","oa_version":"Submitted Version","file":[{"file_id":"5159","relation":"main_file","checksum":"9d9be9090ce5c20766e0eb076ace5b98","date_updated":"2020-07-14T12:45:45Z","date_created":"2018-12-12T10:15:38Z","access_level":"open_access","file_name":"IST-2016-564-v1+1_NickGECCO_2013_1_-1.pdf","creator":"system","content_type":"application/pdf","file_size":475844}],"pubrep_id":"564","month":"07","project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1145/2463372.2463568","conference":{"name":"GECCO: Genetic and evolutionary computation conference","start_date":"2013-07-06","location":"Amsterdam, Netherlands","end_date":"2013-07-10"},"publist_id":"4174","ec_funded":1,"file_date_updated":"2020-07-14T12:45:45Z","publisher":"ACM","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"publication_status":"published","year":"2013","date_updated":"2021-01-12T06:59:15Z","date_created":"2018-12-11T11:59:14Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Barton, Nicholas H"},{"full_name":"Paixao, Tiago","orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao","first_name":"Tiago"}]},{"oa_version":"Submitted Version","status":"public","title":"Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila","intvolume":" 195","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"2720","abstract":[{"lang":"eng","text":"Knowledge of the rate and fitness effects of mutations is essential for understanding the process of evolution. Mutations are inherently difficult to study because they are rare and are frequently eliminated by natural selection. In the ciliate Tetrahymena thermophila, mutations can accumulate in the germline genome without being exposed to selection. We have conducted a mutation accumulation (MA) experiment in this species. Assuming that all mutations are deleterious and have the same effect, we estimate that the deleterious mutation rate per haploid germline genome per generation is U = 0.0047 (95% credible interval: 0.0015, 0.0125), and that germline mutations decrease fitness by s = 11% when expressed in a homozygous state (95% CI: 4.4%, 27%). We also estimate that deleterious mutations are partially recessive on average (h = 0.26; 95% CI: –0.022, 0.62) and that the rate of lethal mutations is <10% of the deleterious mutation rate. Comparisons between the observed evolutionary responses in the germline and somatic genomes and the results from individual-based simulations of MA suggest that the two genomes have similar mutational parameters. These are the first estimates of the deleterious mutation rate and fitness effects from the eukaryotic supergroup Chromalveolata and are within the range of those of other eukaryotes."}],"issue":"2","type":"journal_article","date_published":"2013-10-01T00:00:00Z","page":"527-540","publication":"Genetics","citation":{"ama":"Long H, Paixao T, Azevedo R, Zufall R. Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics. 2013;195(2):527-540. doi:10.1534/genetics.113.153536","ista":"Long H, Paixao T, Azevedo R, Zufall R. 2013. Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics. 195(2), 527–540.","ieee":"H. Long, T. Paixao, R. Azevedo, and R. Zufall, “Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila,” Genetics, vol. 195, no. 2. Genetics Society of America, pp. 527–540, 2013.","apa":"Long, H., Paixao, T., Azevedo, R., & Zufall, R. (2013). Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila. Genetics. Genetics Society of America. https://doi.org/10.1534/genetics.113.153536","mla":"Long, Hongan, et al. “Accumulation of Spontaneous Mutations in the Ciliate Tetrahymena Thermophila.” Genetics, vol. 195, no. 2, Genetics Society of America, 2013, pp. 527–40, doi:10.1534/genetics.113.153536.","short":"H. Long, T. Paixao, R. Azevedo, R. Zufall, Genetics 195 (2013) 527–540.","chicago":"Long, Hongan, Tiago Paixao, Ricardo Azevedo, and Rebecca Zufall. “Accumulation of Spontaneous Mutations in the Ciliate Tetrahymena Thermophila.” Genetics. Genetics Society of America, 2013. https://doi.org/10.1534/genetics.113.153536."},"day":"01","article_processing_charge":"No","scopus_import":1,"date_created":"2018-12-11T11:59:15Z","date_updated":"2021-01-12T06:59:16Z","volume":195,"author":[{"full_name":"Long, Hongan","first_name":"Hongan","last_name":"Long"},{"orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao","first_name":"Tiago","full_name":"Paixao, Tiago"},{"full_name":"Azevedo, Ricardo","first_name":"Ricardo","last_name":"Azevedo"},{"full_name":"Zufall, Rebecca","first_name":"Rebecca","last_name":"Zufall"}],"publication_status":"published","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"publisher":"Genetics Society of America","year":"2013","pmid":1,"ec_funded":1,"publist_id":"4172","language":[{"iso":"eng"}],"doi":"10.1534/genetics.113.153536","quality_controlled":"1","project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"external_id":{"pmid":["23934880"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3781978/","open_access":"1"}],"oa":1,"month":"10"},{"publication":"Proceedings of the 15th annual conference on Genetic and evolutionary computation","citation":{"ama":"Paixao T, Barton NH. A variance decomposition approach to the analysis of genetic algorithms. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation. ACM; 2013:845-852. doi:10.1145/2463372.2463470","apa":"Paixao, T., & Barton, N. H. (2013). A variance decomposition approach to the analysis of genetic algorithms. In Proceedings of the 15th annual conference on Genetic and evolutionary computation (pp. 845–852). Amsterdam, Netherlands: ACM. https://doi.org/10.1145/2463372.2463470","ieee":"T. Paixao and N. H. Barton, “A variance decomposition approach to the analysis of genetic algorithms,” in Proceedings of the 15th annual conference on Genetic and evolutionary computation, Amsterdam, Netherlands, 2013, pp. 845–852.","ista":"Paixao T, Barton NH. 2013. A variance decomposition approach to the analysis of genetic algorithms. Proceedings of the 15th annual conference on Genetic and evolutionary computation. GECCO: Genetic and evolutionary computation conference, 845–852.","short":"T. Paixao, N.H. Barton, in:, Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–852.","mla":"Paixao, Tiago, and Nicholas H. Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, ACM, 2013, pp. 845–52, doi:10.1145/2463372.2463470.","chicago":"Paixao, Tiago, and Nicholas H Barton. “A Variance Decomposition Approach to the Analysis of Genetic Algorithms.” In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, 845–52. ACM, 2013. https://doi.org/10.1145/2463372.2463470."},"quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"}],"page":"845 - 852","conference":{"start_date":"2013-07-06","location":"Amsterdam, Netherlands","end_date":"2013-07-10","name":"GECCO: Genetic and evolutionary computation conference"},"date_published":"2013-07-01T00:00:00Z","doi":"10.1145/2463372.2463470","language":[{"iso":"eng"}],"scopus_import":1,"month":"07","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2719","year":"2013","publication_status":"published","title":"A variance decomposition approach to the analysis of genetic algorithms","status":"public","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"publisher":"ACM","author":[{"orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao","first_name":"Tiago","full_name":"Paixao, Tiago"},{"first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H"}],"date_created":"2018-12-11T11:59:15Z","date_updated":"2021-01-12T06:59:15Z","oa_version":"None","type":"conference","abstract":[{"lang":"eng","text":"Prediction of the evolutionary process is a long standing problem both in the theory of evolutionary biology and evolutionary computation (EC). It has long been realized that heritable variation is crucial to both the response to selection and the success of genetic algorithms. However, not all variation contributes in the same way to the response. Quantitative genetics has developed a large body of work trying to estimate and understand how different components of the variance in fitness in the population contribute to the response to selection. We illustrate how to apply some concepts of quantitative genetics to the analysis of genetic algorithms. In particular, we derive estimates for the short term prediction of the response to selection and we use variance decomposition to gain insight on local aspects of the landscape. Finally, we propose a new population based genetic algorithm that uses these methods to improve its operation."}],"ec_funded":1,"publist_id":"4173"}]