[{"day":"01","oa":1,"title":"Sparse modeling of intrinsic correspondences","date_updated":"2024-12-19T09:57:17Z","publisher":"Wiley","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"scopus_import":"1","arxiv":1,"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1209.6560"}],"type":"journal_article","month":"05","volume":32,"extern":"1","date_created":"2024-10-15T11:20:55Z","page":"459-468","publication":"Computer Graphics Forum","citation":{"ama":"Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. Sparse modeling of intrinsic correspondences. <i>Computer Graphics Forum</i>. 2013;32(2pt4):459-468. doi:<a href=\"https://doi.org/10.1111/cgf.12066\">10.1111/cgf.12066</a>","short":"J. Pokrass, A.M. Bronstein, M.M. Bronstein, P. Sprechmann, G. Sapiro, Computer Graphics Forum 32 (2013) 459–468.","mla":"Pokrass, J., et al. “Sparse Modeling of Intrinsic Correspondences.” <i>Computer Graphics Forum</i>, vol. 32, no. 2pt4, Wiley, 2013, pp. 459–68, doi:<a href=\"https://doi.org/10.1111/cgf.12066\">10.1111/cgf.12066</a>.","chicago":"Pokrass, J., Alex M. Bronstein, M. M. Bronstein, P. Sprechmann, and G. Sapiro. “Sparse Modeling of Intrinsic Correspondences.” <i>Computer Graphics Forum</i>. Wiley, 2013. <a href=\"https://doi.org/10.1111/cgf.12066\">https://doi.org/10.1111/cgf.12066</a>.","ieee":"J. Pokrass, A. M. Bronstein, M. M. Bronstein, P. Sprechmann, and G. Sapiro, “Sparse modeling of intrinsic correspondences,” <i>Computer Graphics Forum</i>, vol. 32, no. 2pt4. Wiley, pp. 459–468, 2013.","ista":"Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. 2013. Sparse modeling of intrinsic correspondences. Computer Graphics Forum. 32(2pt4), 459–468.","apa":"Pokrass, J., Bronstein, A. M., Bronstein, M. M., Sprechmann, P., &#38; Sapiro, G. (2013). Sparse modeling of intrinsic correspondences. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12066\">https://doi.org/10.1111/cgf.12066</a>"},"external_id":{"arxiv":["1209.6560"]},"article_processing_charge":"No","status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"18422","year":"2013","doi":"10.1111/cgf.12066","quality_controlled":"1","publication_status":"published","issue":"2pt4","author":[{"full_name":"Pokrass, J.","last_name":"Pokrass","first_name":"J."},{"first_name":"Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"first_name":"M. M.","full_name":"Bronstein, M. M.","last_name":"Bronstein"},{"first_name":"P.","full_name":"Sprechmann, P.","last_name":"Sprechmann"},{"last_name":"Sapiro","full_name":"Sapiro, G.","first_name":"G."}],"abstract":[{"lang":"eng","text":"We present a novel sparse modeling approach to non-rigid shape matching using only the ability to detect repeatable regions. As the input to our algorithm, we are given only two sets of regions in two shapes; no descriptors are provided so the correspondence between the regions is not know, nor we know how many regions correspond in the two shapes. We show that even with such scarce information, it is possible to establish very accurate correspondence between the shapes by using methods from the field of sparse modeling, being this, the first non-trivial use of sparse models in shape correspondence. We formulate the problem of permuted sparse coding, in which we solve simultaneously for an unknown permutation ordering the regions on two shapes and for an unknown correspondence in functional representation. We also propose a robust variant capable of handling incomplete matches. Numerically, the problem is solved efficiently by alternating the solution of a linear assignment and a sparse coding problem. The proposed methods are evaluated qualitatively and quantitatively on standard benchmarks containing both synthetic and scanned objects."}],"intvolume":"        32","fulldoi":"https://doi.org/10.1111/cgf.12066","date_published":"2013-05-01T00:00:00Z","oa_version":"Preprint"},{"day":"01","oa":1,"DOAJ_listed":"1","title":"A genetic screen for high copy number suppressors of the synthetic lethality between elg1Δ and srs2Δ in yeast","date_updated":"2024-12-18T15:30:20Z","publisher":"Oxford University Press","publication_identifier":{"eissn":["2160-1836"]},"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1534/g3.113.005561"}],"language":[{"iso":"eng"}],"month":"05","type":"journal_article","extern":"1","date_created":"2024-10-15T11:20:55Z","page":"917-926","volume":3,"publication":" G3: Genes, Genomes, Genetics","citation":{"short":"I. Gazy, B. Liefshitz, A.M. Bronstein, O. Parnas, N. Atias, R. Sharan, M. Kupiec,  G3: Genes, Genomes, Genetics 3 (2013) 917–926.","chicago":"Gazy, Inbal, Batia Liefshitz, Alex M. Bronstein, Oren Parnas, Nir Atias, Roded Sharan, and Martin Kupiec. “A Genetic Screen for High Copy Number Suppressors of the Synthetic Lethality between Elg1Δ and Srs2Δ in Yeast.” <i> G3: Genes, Genomes, Genetics</i>. Oxford University Press, 2013. <a href=\"https://doi.org/10.1534/g3.113.005561\">https://doi.org/10.1534/g3.113.005561</a>.","mla":"Gazy, Inbal, et al. “A Genetic Screen for High Copy Number Suppressors of the Synthetic Lethality between Elg1Δ and Srs2Δ in Yeast.” <i> G3: Genes, Genomes, Genetics</i>, vol. 3, no. 5, Oxford University Press, 2013, pp. 917–26, doi:<a href=\"https://doi.org/10.1534/g3.113.005561\">10.1534/g3.113.005561</a>.","ista":"Gazy I, Liefshitz B, Bronstein AM, Parnas O, Atias N, Sharan R, Kupiec M. 2013. A genetic screen for high copy number suppressors of the synthetic lethality between elg1Δ and srs2Δ in yeast.  G3: Genes, Genomes, Genetics. 3(5), 917–926.","ieee":"I. Gazy <i>et al.</i>, “A genetic screen for high copy number suppressors of the synthetic lethality between elg1Δ and srs2Δ in yeast,” <i> G3: Genes, Genomes, Genetics</i>, vol. 3, no. 5. Oxford University Press, pp. 917–926, 2013.","apa":"Gazy, I., Liefshitz, B., Bronstein, A. M., Parnas, O., Atias, N., Sharan, R., &#38; Kupiec, M. (2013). A genetic screen for high copy number suppressors of the synthetic lethality between elg1Δ and srs2Δ in yeast. <i> G3: Genes, Genomes, Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1534/g3.113.005561\">https://doi.org/10.1534/g3.113.005561</a>","ama":"Gazy I, Liefshitz B, Bronstein AM, et al. A genetic screen for high copy number suppressors of the synthetic lethality between elg1Δ and srs2Δ in yeast. <i> G3: Genes, Genomes, Genetics</i>. 2013;3(5):917-926. doi:<a href=\"https://doi.org/10.1534/g3.113.005561\">10.1534/g3.113.005561</a>"},"article_processing_charge":"No","_id":"18437","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","year":"2013","quality_controlled":"1","doi":"10.1534/g3.113.005561","author":[{"first_name":"Inbal","last_name":"Gazy","full_name":"Gazy, Inbal"},{"full_name":"Liefshitz, Batia","last_name":"Liefshitz","first_name":"Batia"},{"first_name":"Alexander","orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"full_name":"Parnas, Oren","last_name":"Parnas","first_name":"Oren"},{"first_name":"Nir","last_name":"Atias","full_name":"Atias, Nir"},{"first_name":"Roded","full_name":"Sharan, Roded","last_name":"Sharan"},{"full_name":"Kupiec, Martin","last_name":"Kupiec","first_name":"Martin"}],"issue":"5","publication_status":"published","abstract":[{"text":"\r\n\r\nElg1 and Srs2 are two proteins involved in maintaining genome stability in yeast. After DNA damage, the homotrimeric clamp PCNA, which provides stability and processivity to DNA polymerases and serves as a docking platform for DNA repair enzymes, undergoes modification by the ubiquitin-like molecule SUMO. PCNA SUMOylation helps recruit Srs2 and Elg1 to the replication fork. In the absence of Elg1, both SUMOylated PCNA and Srs2 accumulate at the chromatin fraction, indicating that Elg1 is required for removing SUMOylated PCNA and Srs2 from DNA. Despite this interaction, which suggests that the two proteins work together, double mutants elg1Δ srs2Δ have severely impaired growth as haploids and exhibit synergistic sensitivity to DNA damage and a synergistic increase in gene conversion. In addition, diploid elg1Δ srs2Δ double mutants are dead, which implies that an essential function in the cell requires at least one of the two gene products for survival. To gain information about this essential function, we have carried out a high copy number suppressor screen to search for genes that, when overexpressed, suppress the synthetic lethality between elg1Δ and srs2Δ. We report the identification of 36 such genes, which are enriched for functions related to DNA- and chromatin-binding, chromatin packaging and modification, and mRNA export from the nucleus.","lang":"eng"}],"intvolume":"         3","fulldoi":"https://doi.org/10.1534/g3.113.005561","oa_version":"Published Version","date_published":"2013-05-01T00:00:00Z"},{"date_updated":"2024-12-19T15:09:21Z","year":"2013","title":"Geometric and photometric data fusion in non-rigid shape analysis","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"18440","citation":{"short":"A.M. Bronstein, A. Kovnatsky, D. Raviv, M.M. Bronstein, R. Kimmel, Numerical Mathematics: Theory, Methods and Applications 6 (2013) 199–222.","mla":"Bronstein, Alex M., et al. “Geometric and Photometric Data Fusion in Non-Rigid Shape Analysis.” <i>Numerical Mathematics: Theory, Methods and Applications</i>, vol. 6, no. 1, Global Science Press, 2013, pp. 199–222, doi:<a href=\"https://doi.org/10.4208/nmtma.2013.mssvm11\">10.4208/nmtma.2013.mssvm11</a>.","chicago":"Bronstein, Alex M., Artiom Kovnatsky, Dan Raviv, Michael M. Bronstein, and Ron Kimmel. “Geometric and Photometric Data Fusion in Non-Rigid Shape Analysis.” <i>Numerical Mathematics: Theory, Methods and Applications</i>. Global Science Press, 2013. <a href=\"https://doi.org/10.4208/nmtma.2013.mssvm11\">https://doi.org/10.4208/nmtma.2013.mssvm11</a>.","ieee":"A. M. Bronstein, A. Kovnatsky, D. Raviv, M. M. Bronstein, and R. Kimmel, “Geometric and photometric data fusion in non-rigid shape analysis,” <i>Numerical Mathematics: Theory, Methods and Applications</i>, vol. 6, no. 1. Global Science Press, pp. 199–222, 2013.","apa":"Bronstein, A. M., Kovnatsky, A., Raviv, D., Bronstein, M. M., &#38; Kimmel, R. (2013). Geometric and photometric data fusion in non-rigid shape analysis. <i>Numerical Mathematics: Theory, Methods and Applications</i>. Global Science Press. <a href=\"https://doi.org/10.4208/nmtma.2013.mssvm11\">https://doi.org/10.4208/nmtma.2013.mssvm11</a>","ista":"Bronstein AM, Kovnatsky A, Raviv D, Bronstein MM, Kimmel R. 2013. Geometric and photometric data fusion in non-rigid shape analysis. Numerical Mathematics: Theory, Methods and Applications. 6(1), 199–222.","ama":"Bronstein AM, Kovnatsky A, Raviv D, Bronstein MM, Kimmel R. Geometric and photometric data fusion in non-rigid shape analysis. <i>Numerical Mathematics: Theory, Methods and Applications</i>. 2013;6(1):199-222. doi:<a href=\"https://doi.org/10.4208/nmtma.2013.mssvm11\">10.4208/nmtma.2013.mssvm11</a>"},"article_processing_charge":"No","publication":"Numerical Mathematics: Theory, Methods and Applications","day":"01","date_published":"2013-02-01T00:00:00Z","fulldoi":"https://doi.org/10.4208/nmtma.2013.mssvm11","oa_version":"None","month":"02","type":"journal_article","volume":6,"extern":"1","date_created":"2024-10-15T11:20:55Z","page":"199-222","language":[{"iso":"eng"}],"publication_status":"published","author":[{"orcid":"0000-0001-9699-8730","first_name":"Alexander","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein"},{"last_name":"Kovnatsky","full_name":"Kovnatsky, Artiom","first_name":"Artiom"},{"full_name":"Raviv, Dan","last_name":"Raviv","first_name":"Dan"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Ron","last_name":"Kimmel","full_name":"Kimmel, Ron"}],"issue":"1","intvolume":"         6","abstract":[{"lang":"eng","text":"In this paper, we explore the use of the diffusion geometry framework for the fusion of geometric and photometric information in local and global shape descriptors. Our construction is based on the definition of a diffusion process on the shape manifold embedded into a high-dimensional space where the embedding coordinates represent the photometric information. Experimental results show that such data fusion is useful in coping with different challenges of shape analysis where pure geometric and pure photometric methods fail."}],"scopus_import":"1","publisher":"Global Science Press","publication_identifier":{"eissn":["2079-7338"],"issn":["1004-8979"]},"doi":"10.4208/nmtma.2013.mssvm11","quality_controlled":"1"},{"scopus_import":"1","quality_controlled":"1","publication_identifier":{"issn":["1004-8979"],"eissn":["2079-7338"]},"doi":"10.4208/nmtma.2013.mssvm12","publisher":"Global Science Press","extern":"1","page":"223-244","date_created":"2024-10-15T11:20:55Z","volume":6,"month":"02","type":"journal_article","fulldoi":"https://doi.org/10.4208/nmtma.2013.mssvm12","date_published":"2013-02-01T00:00:00Z","oa_version":"None","abstract":[{"text":"Partial similarity of shapes is a challenging problem arising in many important applications in computer vision, shape analysis, and graphics, e.g. when one has to deal with partial information and acquisition artifacts. The problem is especially hard when the underlying shapes are non-rigid and are given up to a deformation. Partial matching is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise non-bijective correspondence between the two, taking into account possibly different parts. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-rigid deformation. We use region-wise local descriptors and optimize over the integration domains on which the integral descriptors of the two parts match. The problem is regularized using the Mumford-Shah functional. We show an efficient discretization based on the Ambrosio-Tortorelli approximation generalized to triangular point clouds and meshes, and present experiments demonstrating the success of the proposed method.","lang":"eng"}],"intvolume":"         6","publication_status":"published","author":[{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"full_name":"Pokrass, Jonathan ","last_name":"Pokrass","first_name":"Jonathan "},{"full_name":"Bronstein, Michael M.","last_name":"Bronstein","first_name":"Michael M."}],"issue":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","citation":{"apa":"Bronstein, A. M., Pokrass, J., &#38; Bronstein, M. M. (2013). Partial shape matching without point-wise correspondence. <i>Numerical Mathematics: Theory, Methods and Applications</i>. Global Science Press. <a href=\"https://doi.org/10.4208/nmtma.2013.mssvm12\">https://doi.org/10.4208/nmtma.2013.mssvm12</a>","ista":"Bronstein AM, Pokrass J, Bronstein MM. 2013. Partial shape matching without point-wise correspondence. Numerical Mathematics: Theory, Methods and Applications. 6(1), 223–244.","ieee":"A. M. Bronstein, J. Pokrass, and M. M. Bronstein, “Partial shape matching without point-wise correspondence,” <i>Numerical Mathematics: Theory, Methods and Applications</i>, vol. 6, no. 1. Global Science Press, pp. 223–244, 2013.","mla":"Bronstein, Alex M., et al. “Partial Shape Matching without Point-Wise Correspondence.” <i>Numerical Mathematics: Theory, Methods and Applications</i>, vol. 6, no. 1, Global Science Press, 2013, pp. 223–44, doi:<a href=\"https://doi.org/10.4208/nmtma.2013.mssvm12\">10.4208/nmtma.2013.mssvm12</a>.","chicago":"Bronstein, Alex M., Jonathan  Pokrass, and Michael M. Bronstein. “Partial Shape Matching without Point-Wise Correspondence.” <i>Numerical Mathematics: Theory, Methods and Applications</i>. Global Science Press, 2013. <a href=\"https://doi.org/10.4208/nmtma.2013.mssvm12\">https://doi.org/10.4208/nmtma.2013.mssvm12</a>.","short":"A.M. Bronstein, J. Pokrass, M.M. Bronstein, Numerical Mathematics: Theory, Methods and Applications 6 (2013) 223–244.","ama":"Bronstein AM, Pokrass J, Bronstein MM. Partial shape matching without point-wise correspondence. <i>Numerical Mathematics: Theory, Methods and Applications</i>. 2013;6(1):223-244. doi:<a href=\"https://doi.org/10.4208/nmtma.2013.mssvm12\">10.4208/nmtma.2013.mssvm12</a>"},"publication":"Numerical Mathematics: Theory, Methods and Applications","day":"01","year":"2013","date_updated":"2024-12-19T14:44:37Z","_id":"18441","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Partial shape matching without point-wise correspondence"},{"language":[{"iso":"eng"}],"arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1112.1354","open_access":"1"}],"volume":19,"article_type":"original","extern":"1","page":"969-986","date_created":"2026-06-19T07:54:49Z","type":"journal_article","month":"03","publication_identifier":{"issn":["1073-2780"],"eissn":["1945-001X"]},"publisher":"International Press of Boston","OA_place":"repository","scopus_import":"1","das_tickbox":"1","title":"Global well-posedness of the Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger equations with non-vanishing boundary conditions","date_updated":"2026-06-25T08:33:18Z","day":"15","oa":1,"abstract":[{"text":"We consider the Gross–Pitaevskii equation on R^4 and the cubic-quintic nonlinear Schrödinger equation (NLS) on R^3 with non-vanishing boundary conditions at spatial infinity. By viewing these equations as perturbations to the energy-critical NLS, we prove that they are globally well-posed in their energy spaces. In particular, we prove unconditional uniqueness in the energy spaces for these equations.","lang":"eng"}],"intvolume":"        19","issue":"5","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"full_name":"Oh, Tadahiro","last_name":"Oh","first_name":"Tadahiro"},{"first_name":"Oana","full_name":"Pocovnicu, Oana","last_name":"Pocovnicu"},{"first_name":"Monica","last_name":"Visan","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}],"publication_status":"published","oa_version":"Preprint","fulldoi":"https://doi.org/10.4310/mrl.2012.v19.n5.a1","date_published":"2013-03-15T00:00:00Z","doi":"10.4310/mrl.2012.v19.n5.a1","quality_controlled":"1","mathsc":["35Q55"],"OA_type":"green","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"22053","year":"2013","keyword":["NLS","Gross–Pitaevskii equation","non-vanishing boundary condition"],"publication":"Mathematical Research Letters","external_id":{"arxiv":["1112.1354"]},"article_processing_charge":"No","citation":{"mla":"Killip, Rowan, et al. “Global Well-Posedness of the Gross–Pitaevskii and Cubic-Quintic Nonlinear Schrödinger Equations with Non-Vanishing Boundary Conditions.” <i>Mathematical Research Letters</i>, vol. 19, no. 5, International Press of Boston, 2013, pp. 969–86, doi:<a href=\"https://doi.org/10.4310/mrl.2012.v19.n5.a1\">10.4310/mrl.2012.v19.n5.a1</a>.","chicago":"Killip, Rowan, Tadahiro Oh, Oana Pocovnicu, and Monica Vişan. “Global Well-Posedness of the Gross–Pitaevskii and Cubic-Quintic Nonlinear Schrödinger Equations with Non-Vanishing Boundary Conditions.” <i>Mathematical Research Letters</i>. International Press of Boston, 2013. <a href=\"https://doi.org/10.4310/mrl.2012.v19.n5.a1\">https://doi.org/10.4310/mrl.2012.v19.n5.a1</a>.","short":"R. Killip, T. Oh, O. Pocovnicu, M. Vişan, Mathematical Research Letters 19 (2013) 969–986.","apa":"Killip, R., Oh, T., Pocovnicu, O., &#38; Vişan, M. (2013). Global well-posedness of the Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger equations with non-vanishing boundary conditions. <i>Mathematical Research Letters</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/mrl.2012.v19.n5.a1\">https://doi.org/10.4310/mrl.2012.v19.n5.a1</a>","ista":"Killip R, Oh T, Pocovnicu O, Vişan M. 2013. Global well-posedness of the Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger equations with non-vanishing boundary conditions. Mathematical Research Letters. 19(5), 969–986.","ieee":"R. Killip, T. Oh, O. Pocovnicu, and M. Vişan, “Global well-posedness of the Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger equations with non-vanishing boundary conditions,” <i>Mathematical Research Letters</i>, vol. 19, no. 5. International Press of Boston, pp. 969–986, 2013.","ama":"Killip R, Oh T, Pocovnicu O, Vişan M. Global well-posedness of the Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger equations with non-vanishing boundary conditions. <i>Mathematical Research Letters</i>. 2013;19(5):969-986. doi:<a href=\"https://doi.org/10.4310/mrl.2012.v19.n5.a1\">10.4310/mrl.2012.v19.n5.a1</a>"}},{"year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"2698","citation":{"short":"L. Erdös, S. Fournais, J. Solovej, Journal of the European Mathematical Society 15 (2013) 2093–2113.","mla":"Erdös, László, et al. “Stability and Semiclassics in Self-Generated Fields.” <i>Journal of the European Mathematical Society</i>, vol. 15, no. 6, EMS Press, 2013, pp. 2093–113, doi:<a href=\"https://doi.org/10.4171/JEMS/416\">10.4171/JEMS/416</a>.","chicago":"Erdös, László, Søren Fournais, and Jan Solovej. “Stability and Semiclassics in Self-Generated Fields.” <i>Journal of the European Mathematical Society</i>. EMS Press, 2013. <a href=\"https://doi.org/10.4171/JEMS/416\">https://doi.org/10.4171/JEMS/416</a>.","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,” <i>Journal of the European Mathematical Society</i>, vol. 15, no. 6. EMS Press, pp. 2093–2113, 2013.","apa":"Erdös, L., Fournais, S., &#38; Solovej, J. (2013). Stability and semiclassics in self-generated fields. <i>Journal of the European Mathematical Society</i>. EMS Press. <a href=\"https://doi.org/10.4171/JEMS/416\">https://doi.org/10.4171/JEMS/416</a>","ama":"Erdös L, Fournais S, Solovej J. Stability and semiclassics in self-generated fields. <i>Journal of the European Mathematical Society</i>. 2013;15(6):2093-2113. doi:<a href=\"https://doi.org/10.4171/JEMS/416\">10.4171/JEMS/416</a>"},"external_id":{"isi":["000326323400006"],"arxiv":["1105.0506"]},"article_processing_charge":"No","publication":"Journal of the European Mathematical Society","publist_id":"4198","fulldoi":"https://doi.org/10.4171/JEMS/416","date_published":"2013-10-16T00:00:00Z","oa_version":"Preprint","isi":1,"author":[{"last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","orcid":"0000-0001-5366-9603"},{"first_name":"Søren","last_name":"Fournais","full_name":"Fournais, Søren"},{"first_name":"Jan","full_name":"Solovej, Jan","last_name":"Solovej"}],"issue":"6","publication_status":"published","intvolume":"        15","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."}],"doi":"10.4171/JEMS/416","quality_controlled":"1","date_updated":"2026-07-06T11:56:35Z","title":"Stability and semiclassics in self-generated fields","oa":1,"day":"16","type":"journal_article","month":"10","volume":15,"page":"2093 - 2113","date_created":"2018-12-11T11:59:07Z","language":[{"iso":"eng"}],"arxiv":1,"department":[{"_id":"LaEr"}],"main_file_link":[{"url":"http://arxiv.org/abs/1105.0506","open_access":"1"}],"publisher":"EMS Press"},{"ddc":["000","004"],"type":"conference","month":"08","page":"242 - 256","date_created":"2018-12-11T11:57:01Z","volume":8052,"pubrep_id":"197","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_id":"4721","file_size":337059,"checksum":"bdbb520de91751fe0136309ad4ef67e4","date_updated":"2020-07-14T12:45:39Z","date_created":"2018-12-12T10:08:58Z","access_level":"open_access","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","creator":"system"}],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:39Z","alternative_title":["LNCS"],"has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ec_funded":1,"date_updated":"2026-07-06T13:24:04Z","title":"Aspect-oriented linearizability proofs","oa":1,"day":"01","related_material":{"record":[{"status":"public","relation":"later_version","id":"1832"}]},"fulldoi":"https://doi.org/10.1007/978-3-642-40184-8_18","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Submitted Version","date_published":"2013-08-01T00:00:00Z","publication_status":"published","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A"},{"first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali","last_name":"Sezgin"},{"last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor","first_name":"Viktor"}],"intvolume":"      8052","abstract":[{"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.","lang":"eng"}],"quality_controlled":"1","conference":{"end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","location":"Buenos Aires, Argentina"},"doi":"10.1007/978-3-642-40184-8_18","year":"2013","_id":"2328","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","series_title":"Lecture Notes in Computer Science","citation":{"short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.","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. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>.","mla":"Henzinger, Thomas A., et al. <i>Aspect-Oriented Linearizability Proofs</i>. Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>.","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.","apa":"Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2013). Aspect-oriented linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">https://doi.org/10.1007/978-3-642-40184-8_18</a>","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","ama":"Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. 2013;8052:242-256. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_18\">10.1007/978-3-642-40184-8_18</a>"},"publist_id":"4598"},{"date_updated":"2026-07-06T13:43:58Z","title":"Computing the M most probable modes of a graphical model","das_tickbox":"1","oa":1,"day":"01","month":"01","type":"conference","volume":31,"date_created":"2018-12-11T12:00:14Z","page":"161 - 169","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://jmlr.org/proceedings/papers/v31/chen13a.html"}],"department":[{"_id":"HeEd"},{"_id":"VlKo"},{"_id":"ChLa"}],"scopus_import":"1","alternative_title":["PMLR"],"publisher":"Journal of Machine Learning Research","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"2901","citation":{"ama":"Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. Computing the M most probable modes of a graphical model. In: <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>. Vol 31. Journal of Machine Learning Research; 2013:161-169.","short":"C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, Proceedings of the 16th International Conference on Artificial Intelligence and Statistics, Journal of Machine Learning Research, 2013, pp. 161–169.","chicago":"Chen, Chao, Vladimir Kolmogorov, Zhu Yan, Dimitris Metaxas, and Christoph Lampert. “Computing the M Most Probable Modes of a Graphical Model.” In <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>, 31:161–69. Journal of Machine Learning Research, 2013.","mla":"Chen, Chao, et al. “Computing the M Most Probable Modes of a Graphical Model.” <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>, vol. 31, Journal of Machine Learning Research, 2013, pp. 161–69.","apa":"Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., &#38; Lampert, C. (2013). Computing the M most probable modes of a graphical model. In <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i> (Vol. 31, pp. 161–169). Scottsdale, AZ, United States: Journal of Machine Learning Research.","ista":"Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. 2013. Computing the M most probable modes of a graphical model. Proceedings of the 16th International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Uncertainty in Artificial Intelligence, PMLR, vol. 31, 161–169.","ieee":"C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” in <i>Proceedings of the 16th International Conference on Artificial Intelligence and Statistics</i>, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169."},"article_processing_charge":"No","publication":"Proceedings of the 16th International Conference on Artificial Intelligence and Statistics","publist_id":"3846","oa_version":"None","date_published":"2013-01-01T00:00:00Z","author":[{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","last_name":"Chen","first_name":"Chao"},{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"},{"full_name":"Yan, Zhu","last_name":"Yan","first_name":"Zhu"},{"full_name":"Metaxas, Dimitris","last_name":"Metaxas","first_name":"Dimitris"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"published","abstract":[{"lang":"eng","text":" We introduce the M-modes problem for graphical models: predicting the M label configurations of highest probability that are at the same time local maxima of the probability landscape. M-modes have multiple possible applications: because they are intrinsically diverse, they provide a principled alternative to non-maximum suppression techniques for structured prediction, they can act as codebook vectors for quantizing the configuration space, or they can form component centers for mixture model approximation. We present two algorithms for solving the M-modes problem. The first algorithm solves the problem in polynomial time when the underlying graphical model is a simple chain. The second algorithm solves the problem for junction chains. In synthetic and real dataset, we demonstrate how M-modes can improve the performance of prediction. We also use the generated modes as a tool to understand the topography of the probability distribution of configurations, for example with relation to the training set size and amount of noise in the data. "}],"intvolume":"        31","conference":{"end_date":"2013-05-01","location":"Scottsdale, AZ, United States","start_date":"2013-04-29","name":"AISTATS: Conference on Uncertainty in Artificial Intelligence"},"quality_controlled":"1"},{"scopus_import":"1","publisher":"MIT Press","month":"07","type":"journal_article","volume":25,"page":"1661 - 1692","date_created":"2018-12-11T11:59:45Z","language":[{"iso":"eng"}],"arxiv":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.0121"}],"department":[{"_id":"GaTk"}],"oa":1,"day":"01","date_updated":"2026-07-06T13:45:52Z","title":"Learning quadratic receptive fields from neural responses to natural stimuli","das_tickbox":"1","doi":"10.1162/NECO_a_00463","quality_controlled":"1","fulldoi":"https://doi.org/10.1162/NECO_a_00463","oa_version":"Preprint","date_published":"2013-07-01T00:00:00Z","isi":1,"publication_status":"published","issue":"7","author":[{"last_name":"Rajan","full_name":"Rajan, Kanaka","first_name":"Kanaka"},{"last_name":"Marre","full_name":"Marre, Olivier","first_name":"Olivier"},{"first_name":"Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper"}],"abstract":[{"text":"Models of neural responses to stimuli with complex spatiotemporal correlation structure often assume that neurons are selective for only a small number of linear projections of a potentially high-dimensional input. In this review, we explore recent modeling approaches where the neural response depends on the quadratic form of the input rather than on its linear projection, that is, the neuron is sensitive to the local covariance structure of the signal preceding the spike. To infer this quadratic dependence in the presence of arbitrary (e.g., naturalistic) stimulus distribution, we review several inference methods, focusing in particular on two information theory–based approaches (maximization of stimulus energy and of noise entropy) and two likelihood-based approaches (Bayesian spike-triggered covariance and extensions of generalized linear models). We analyze the formal relationship between the likelihood-based and information-based approaches to demonstrate how they lead to consistent inference. We demonstrate the practical feasibility of these procedures by using model neurons responding to a flickering variance stimulus.","lang":"eng"}],"intvolume":"        25","citation":{"ama":"Rajan K, Marre O, Tkačik G. Learning quadratic receptive fields from neural responses to natural stimuli. <i>Neural Computation</i>. 2013;25(7):1661-1692. doi:<a href=\"https://doi.org/10.1162/NECO_a_00463\">10.1162/NECO_a_00463</a>","chicago":"Rajan, Kanaka, Olivier Marre, and Gašper Tkačik. “Learning Quadratic Receptive Fields from Neural Responses to Natural Stimuli.” <i>Neural Computation</i>. MIT Press, 2013. <a href=\"https://doi.org/10.1162/NECO_a_00463\">https://doi.org/10.1162/NECO_a_00463</a>.","mla":"Rajan, Kanaka, et al. “Learning Quadratic Receptive Fields from Neural Responses to Natural Stimuli.” <i>Neural Computation</i>, vol. 25, no. 7, MIT Press, 2013, pp. 1661–92, doi:<a href=\"https://doi.org/10.1162/NECO_a_00463\">10.1162/NECO_a_00463</a>.","short":"K. Rajan, O. Marre, G. Tkačik, Neural Computation 25 (2013) 1661–1692.","ista":"Rajan K, Marre O, Tkačik G. 2013. Learning quadratic receptive fields from neural responses to natural stimuli. Neural Computation. 25(7), 1661–1692.","ieee":"K. Rajan, O. Marre, and G. Tkačik, “Learning quadratic receptive fields from neural responses to natural stimuli,” <i>Neural Computation</i>, vol. 25, no. 7. MIT Press, pp. 1661–1692, 2013.","apa":"Rajan, K., Marre, O., &#38; Tkačik, G. (2013). Learning quadratic receptive fields from neural responses to natural stimuli. <i>Neural Computation</i>. MIT Press. <a href=\"https://doi.org/10.1162/NECO_a_00463\">https://doi.org/10.1162/NECO_a_00463</a>"},"external_id":{"isi":["000319903700001"],"arxiv":["1209.0121"]},"article_processing_charge":"No","publication":"Neural Computation","publist_id":"3983","year":"2013","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2818"},{"oa":1,"day":"01","date_updated":"2026-07-06T13:38:59Z","title":"Homology and robustness of level and interlevel sets","das_tickbox":"1","scopus_import":"1","publisher":"International Press of Boston","month":"05","type":"journal_article","page":"51 - 72","date_created":"2018-12-11T11:59:58Z","volume":15,"main_file_link":[{"url":"https://arxiv.org/abs/1102.3389v1","open_access":"1"}],"department":[{"_id":"HeEd"}],"arxiv":1,"language":[{"iso":"eng"}],"citation":{"ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. Homology and robustness of level and interlevel sets. <i>Homology, Homotopy and Applications</i>. 2013;15(1):51-72. doi:<a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">10.4310/HHA.2013.v15.n1.a3</a>","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “Homology and robustness of level and interlevel sets,” <i>Homology, Homotopy and Applications</i>, vol. 15, no. 1. International Press of Boston, pp. 51–72, 2013.","ista":"Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., &#38; Patel, A. (2013). Homology and robustness of level and interlevel sets. <i>Homology, Homotopy and Applications</i>. International Press of Boston. <a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">https://doi.org/10.4310/HHA.2013.v15.n1.a3</a>","chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “Homology and Robustness of Level and Interlevel Sets.” <i>Homology, Homotopy and Applications</i>. International Press of Boston, 2013. <a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">https://doi.org/10.4310/HHA.2013.v15.n1.a3</a>.","mla":"Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.” <i>Homology, Homotopy and Applications</i>, vol. 15, no. 1, International Press of Boston, 2013, pp. 51–72, doi:<a href=\"https://doi.org/10.4310/HHA.2013.v15.n1.a3\">10.4310/HHA.2013.v15.n1.a3</a>.","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, Homology, Homotopy and Applications 15 (2013) 51–72."},"article_processing_charge":"No","external_id":{"isi":["000322423600003"],"arxiv":["1102.3389"]},"publication":"Homology, Homotopy and Applications","publist_id":"3930","year":"2013","_id":"2859","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","doi":"10.4310/HHA.2013.v15.n1.a3","fulldoi":"https://doi.org/10.4310/HHA.2013.v15.n1.a3","oa_version":"Preprint","isi":1,"date_published":"2013-05-01T00:00:00Z","author":[{"first_name":"Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","full_name":"Bendich, Paul","last_name":"Bendich"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"first_name":"Dmitriy","full_name":"Morozov, Dmitriy","last_name":"Morozov"},{"last_name":"Patel","full_name":"Patel, Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87","first_name":"Amit"}],"issue":"1","publication_status":"published","intvolume":"        15","abstract":[{"lang":"eng","text":"Given a continuous function f:X-R on a topological space, we consider the preimages of intervals and their homology groups and show how to read the ranks of these groups from the extended persistence diagram of f. In addition, we quantify the robustness of the homology classes under perturbations of f using well groups, and we show how to read the ranks of these groups from the same extended persistence diagram. The special case X=R3 has ramifications in the fields of medical imaging and scientific visualization."}]},{"year":"2013","_id":"2280","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","article_processing_charge":"No","external_id":{"isi":["000327502800002"],"arxiv":["1204.0235"]},"citation":{"mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>, vol. 55, no. 4, Society for Industrial and Applied Mathematics, 2013, pp. 671–706, doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>.","chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>. Society for Industrial and Applied Mathematics, 2013. <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>.","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.","apa":"Uhler, C., &#38; Wright, S. (2013). Packing ellipsoids with overlap. <i>SIAM Review</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>","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,” <i>SIAM Review</i>, vol. 55, no. 4. Society for Industrial and Applied Mathematics, pp. 671–706, 2013.","ama":"Uhler C, Wright S. Packing ellipsoids with overlap. <i>SIAM Review</i>. 2013;55(4):671-706. doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>"},"publist_id":"4655","publication":"SIAM Review","isi":1,"fulldoi":"https://doi.org/10.1137/120872309","oa_version":"Preprint","date_published":"2013-11-07T00:00:00Z","intvolume":"        55","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."}],"issue":"4","author":[{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Uhler, Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216","first_name":"Caroline"},{"full_name":"Wright, Stephen","last_name":"Wright","first_name":"Stephen"}],"publication_status":"published","quality_controlled":"1","doi":"10.1137/120872309","date_updated":"2026-07-06T13:58:55Z","das_tickbox":"1","title":"Packing ellipsoids with overlap","oa":1,"day":"07","page":"671 - 706","date_created":"2018-12-11T11:56:44Z","volume":55,"month":"11","type":"journal_article","department":[{"_id":"CaUh"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1204.0235"}],"arxiv":1,"language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Society for Industrial and Applied Mathematics"},{"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:35Z","file":[{"date_created":"2018-12-12T10:08:09Z","access_level":"open_access","date_updated":"2020-07-14T12:45:35Z","creator":"system","file_name":"IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf","relation":"main_file","content_type":"application/pdf","checksum":"ae57ffcee3720adcc27b0f2767a1e04b","file_size":881545,"file_id":"4669"}],"language":[{"iso":"eng"}],"department":[{"_id":"E-Lib"}],"volume":66,"pubrep_id":"719","date_created":"2018-12-11T11:56:36Z","license":"https://creativecommons.org/licenses/by/4.0/","page":"559 - 587","month":"12","type":"journal_article","ddc":["020"],"day":"01","oa":1,"das_tickbox":"1","title":"Linked (Open) Data - Bibliographische Daten im Semantic Web","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-07-07T06:12:03Z","abstract":[{"lang":"eng","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":"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."}],"intvolume":"        66","issue":"3/4","author":[{"first_name":"Patrick","orcid":"0000-0002-6026-4409","last_name":"Danowski","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Goldfarb, Doron","last_name":"Goldfarb","first_name":"Doron"},{"full_name":"Schaffner, Verena","last_name":"Schaffner","first_name":"Verena"},{"first_name":"Wolfram","last_name":"Seidler","full_name":"Seidler, Wolfram"}],"publication_status":"published","date_published":"2013-12-01T00:00:00Z","popular_science":"1","oa_version":"Published Version","publist_id":"4690","publication":"VÖB Mitteilungen","article_processing_charge":"No","citation":{"short":"P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013) 559–587.","mla":"Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.","chicago":"Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler. “Linked (Open) Data - Bibliographische Daten Im Semantic Web.” <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2013.","apa":"Danowski, P., Goldfarb, D., Schaffner, V., &#38; Seidler, W. (2013). Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare.","ieee":"P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data - Bibliographische Daten im Semantic Web,” <i>VÖB Mitteilungen</i>, vol. 66, no. 3/4. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587, 2013.","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.","ama":"Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische Daten im Semantic Web. <i>VÖB Mitteilungen</i>. 2013;66(3/4):559-587."},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2256","year":"2013"},{"pubrep_id":"402","volume":13,"acknowledgement":"The study was funded by the European Research Council (Marie Curie ERG 036569) and Marie Curie IEF 302204 to LVU\r\nCC BY 2.0\r\n","date_created":"2018-12-11T11:56:46Z","type":"journal_article","ddc":["570"],"month":"10","file":[{"date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-12T10:13:41Z","access_level":"open_access","file_name":"IST-2016-402-v1+1_1471-2148-13-225.pdf","creator":"system","content_type":"application/pdf","relation":"main_file","file_id":"5026","file_size":281736,"checksum":"c16ef36f2a10786a7885e19c4528d707"}],"language":[{"iso":"eng"}],"department":[{"_id":"SyCr"}],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:37Z","scopus_import":"1","corr_author":"1","ec_funded":1,"publisher":"BioMed Central","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-07-28T09:35:11Z","das_tickbox":"1","title":"Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies","oa":1,"related_material":{"record":[{"id":"9753","relation":"research_data","status":"public"}]},"day":"14","isi":1,"fulldoi":"https://doi.org/10.1186/1471-2148-13-225","project":[{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"243071","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects"},{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","grant_number":"CR-118/3-1","name":"Host-Parasite Coevolution"},{"call_identifier":"FP7","_id":"25DDF0F0-B435-11E9-9278-68D0E5697425","grant_number":"302004","name":"Collective disease defence and pathogen detection abilities in ant societies: a chemo-neuro-immunological approach"}],"oa_version":"Published Version","date_published":"2013-10-14T00:00:00Z","abstract":[{"lang":"eng","text":"Background: The brood of ants and other social insects is highly susceptible to pathogens, particularly those that penetrate the soft larval and pupal cuticle. We here test whether the presence of a pupal cocoon, which occurs in some ant species but not in others, affects the sanitary brood care and fungal infection patterns after exposure to the entomopathogenic fungus Metarhizium brunneum. We use a) a comparative approach analysing four species with either naked or cocooned pupae and b) a within-species analysis of a single ant species, in which both pupal types co-exist in the same colony. Results: We found that the presence of a cocoon did not compromise fungal pathogen detection by the ants and that species with cocooned pupae increased brood grooming after pathogen exposure. All tested ant species further removed brood from their nests, which was predominantly expressed towards larvae and naked pupae treated with the live fungal pathogen. In contrast, cocooned pupae exposed to live fungus were not removed at higher rates than cocooned pupae exposed to dead fungus or a sham control. Consistent with this, exposure to the live fungus caused high numbers of infections and fungal outgrowth in larvae and naked pupae, but not in cocooned pupae. Moreover, the ants consistently removed the brood prior to fungal outgrowth, ensuring a clean brood chamber. Conclusion: Our study suggests that the pupal cocoon has a protective effect against fungal infection, causing an adaptive change in sanitary behaviours by the ants. It further demonstrates that brood removal-originally described for honeybees as &quot;hygienic behaviour&quot;-is a widespread sanitary behaviour in ants, which likely has important implications on disease dynamics in social insect colonies."}],"intvolume":"        13","author":[{"full_name":"Tragust, Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","first_name":"Simon"},{"first_name":"Line V","orcid":"0000-0003-1832-8883","last_name":"Ugelvig","full_name":"Ugelvig, Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chapuisat, Michel","last_name":"Chapuisat","first_name":"Michel"},{"full_name":"Heinze, Jürgen","last_name":"Heinze","first_name":"Jürgen"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868","first_name":"Sylvia"}],"issue":"1","publication_status":"published","doi":"10.1186/1471-2148-13-225","quality_controlled":"1","year":"2013","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"2284","external_id":{"isi":["000326620500001"]},"article_processing_charge":"No","citation":{"mla":"Tragust, Simon, et al. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1, 225, BioMed Central, 2013, doi:<a href=\"https://doi.org/10.1186/1471-2148-13-225\">10.1186/1471-2148-13-225</a>.","chicago":"Tragust, Simon, Line V Ugelvig, Michel Chapuisat, Jürgen Heinze, and Sylvia Cremer. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” <i>BMC Evolutionary Biology</i>. BioMed Central, 2013. <a href=\"https://doi.org/10.1186/1471-2148-13-225\">https://doi.org/10.1186/1471-2148-13-225</a>.","short":"S. Tragust, L.V. Ugelvig, M. Chapuisat, J. Heinze, S. Cremer, BMC Evolutionary Biology 13 (2013).","ieee":"S. Tragust, L. V. Ugelvig, M. Chapuisat, J. Heinze, and S. Cremer, “Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies,” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1. BioMed Central, 2013.","apa":"Tragust, S., Ugelvig, L. V., Chapuisat, M., Heinze, J., &#38; Cremer, S. (2013). Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. <i>BMC Evolutionary Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2148-13-225\">https://doi.org/10.1186/1471-2148-13-225</a>","ista":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. 2013. Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. BMC Evolutionary Biology. 13(1), 225.","ama":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. <i>BMC Evolutionary Biology</i>. 2013;13(1). doi:<a href=\"https://doi.org/10.1186/1471-2148-13-225\">10.1186/1471-2148-13-225</a>"},"article_number":"225","publist_id":"4647","publication":"BMC Evolutionary Biology"},{"doi":"10.1007/978-3-642-39212-2_11","conference":{"location":"Riga, Latvia","name":"ICALP: Automata, Languages and Programming","start_date":"2013-07-08","end_date":"2013-07-12"},"quality_controlled":"1","issue":"PART 2","author":[{"first_name":"Udi","full_name":"Boker, Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker"},{"first_name":"Denis","full_name":"Kuperberg, Denis","last_name":"Kuperberg"},{"last_name":"Kupferman","full_name":"Kupferman, Orna","first_name":"Orna"},{"full_name":"Skrzypczak, Michał","last_name":"Skrzypczak","first_name":"Michał"}],"publication_status":"published","intvolume":"      7966","abstract":[{"text":"Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata.","lang":"eng"}],"oa_version":"Submitted Version","fulldoi":"https://doi.org/10.1007/978-3-642-39212-2_11","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"date_published":"2013-07-01T00:00:00Z","publist_id":"5823","citation":{"mla":"Boker, Udi, et al. <i>Nondeterminism in the Presence of a Diverse or Unknown Future</i>. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>.","chicago":"Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>.","short":"U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.","ista":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the presence of a diverse or unknown future. 7966(PART 2), 89–100.","apa":"Boker, U., Kuperberg, D., Kupferman, O., &#38; Skrzypczak, M. (2013). Nondeterminism in the presence of a diverse or unknown future. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">https://doi.org/10.1007/978-3-642-39212-2_11</a>","ieee":"U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer, pp. 89–100, 2013.","ama":"Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_11\">10.1007/978-3-642-39212-2_11</a>"},"series_title":"Lecture Notes in Computer Science","article_processing_charge":"No","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1387","year":"2013","publisher":"Springer","ec_funded":1,"scopus_import":"1","file_date_updated":"2020-07-14T12:44:48Z","has_accepted_license":"1","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"file":[{"file_id":"7857","file_size":276982,"checksum":"98bc02e3793072e279ec8d364b381ff3","content_type":"application/pdf","relation":"main_file","file_name":"2013_ICALP_Boker.pdf","creator":"dernst","date_updated":"2020-07-14T12:44:48Z","date_created":"2020-05-15T11:05:50Z","access_level":"open_access"}],"type":"conference","month":"07","ddc":["000"],"acknowledgement":"This work was supported in part by the Polish Ministry of Science grant no. N206 567840, Poland’s NCN grant no. DEC-2012/05/N/ST6/03254, Austrian Science Fund NFN RiSE (Rigorous Systems Engineering), ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), and ERC Grant QUALITY. The full version is available at the authors’ URLs.","volume":7966,"date_created":"2018-12-11T11:51:44Z","page":"89 - 100","day":"01","oa":1,"title":"Nondeterminism in the presence of a diverse or unknown future","das_tickbox":"1","date_updated":"2026-07-28T09:26:19Z"},{"ec_funded":1,"publisher":"Springer","alternative_title":["LNCS"],"has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:42Z","scopus_import":"1","file":[{"checksum":"85afbf6c18a2c7e377c52c9410e2d824","file_size":363031,"file_id":"7860","relation":"main_file","content_type":"application/pdf","creator":"dernst","file_name":"2013_ICALP_Almagor.pdf","access_level":"open_access","date_created":"2020-05-15T11:16:12Z","date_updated":"2020-07-14T12:45:42Z"}],"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"acknowledgement":"This work was supported in part by the Austrian Science Fund NFN RiSE (Rigorous Systems Engineering), by the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling), and the ERC Grant QUALITY. The full version is available at the authors’ URLs.","volume":7966,"date_created":"2018-12-11T11:58:08Z","page":"15 - 27","type":"conference","ddc":["000"],"month":"07","day":"01","oa":1,"das_tickbox":"1","title":"Formalizing and reasoning about quality","date_updated":"2026-07-28T09:28:40Z","conference":{"location":"Riga, Latvia","name":"ICALP: Automata, Languages and Programming","start_date":"2013-07-08","end_date":"2013-07-12"},"doi":"10.1007/978-3-642-39212-2_3","quality_controlled":"1","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"}],"intvolume":"      7966","publication_status":"published","author":[{"first_name":"Shaull","last_name":"Almagor","full_name":"Almagor, Shaull"},{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"issue":"Part 2","fulldoi":"https://doi.org/10.1007/978-3-642-39212-2_3","date_published":"2013-07-01T00:00:00Z","oa_version":"Submitted Version","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"publist_id":"4384","article_processing_charge":"No","citation":{"mla":"Almagor, Shaull, et al. <i>Formalizing and Reasoning about Quality</i>. Vol. 7966, no. Part 2, Springer, 2013, pp. 15–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>.","chicago":"Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning about Quality.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>.","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.","apa":"Almagor, S., Boker, U., &#38; Kupferman, O. (2013). Formalizing and reasoning about quality. Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">https://doi.org/10.1007/978-3-642-39212-2_3</a>","ieee":"S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,” vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.","ama":"Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part 2):15-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_3\">10.1007/978-3-642-39212-2_3</a>"},"series_title":"Lecture Notes in Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","_id":"2517","year":"2013"},{"publisher":"Wiley","ec_funded":1,"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1111/nph.12437"}],"department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"type":"journal_article","month":"12","ddc":["580"],"date_created":"2018-12-11T11:57:41Z","page":"1034 - 1048","article_type":"original","volume":200,"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.).","day":"01","oa":1,"title":"Defining the selectivity of processes along the auxin response chain: A study using auxin analogues","das_tickbox":"1","date_updated":"2026-07-28T09:29:45Z","quality_controlled":"1","doi":"10.1111/nph.12437","author":[{"first_name":"Sibu","orcid":"0000-0002-1998-6741","last_name":"Simon","id":"4542EF9A-F248-11E8-B48F-1D18A9856A87","full_name":"Simon, Sibu"},{"first_name":"Martin","full_name":"Kubeš, Martin","last_name":"Kubeš"},{"last_name":"Baster","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","full_name":"Baster, Pawel","first_name":"Pawel"},{"first_name":"Stéphanie","last_name":"Robert","full_name":"Robert, Stéphanie"},{"first_name":"Petre","full_name":"Dobrev, Petre","last_name":"Dobrev"},{"orcid":"0000-0002-8302-7596","first_name":"Jirí","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"},{"first_name":"Jan","full_name":"Petrášek, Jan","last_name":"Petrášek"},{"first_name":"Eva","full_name":"Zažímalová, Eva","last_name":"Zažímalová"}],"issue":"4","publication_status":"published","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"}],"intvolume":"       200","isi":1,"fulldoi":"https://doi.org/10.1111/nph.12437","date_published":"2013-12-01T00:00:00Z","project":[{"call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","name":"Polarity and subcellular dynamics in plants"}],"oa_version":"Published Version","publication":"New Phytologist","publist_id":"4460","citation":{"ieee":"S. Simon <i>et al.</i>, “Defining the selectivity of processes along the auxin response chain: A study using auxin analogues,” <i>New Phytologist</i>, vol. 200, no. 4. Wiley, pp. 1034–1048, 2013.","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.","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. <i>New Phytologist</i>. Wiley. <a href=\"https://doi.org/10.1111/nph.12437\">https://doi.org/10.1111/nph.12437</a>","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.","mla":"Simon, Sibu, et al. “Defining the Selectivity of Processes along the Auxin Response Chain: A Study Using Auxin Analogues.” <i>New Phytologist</i>, vol. 200, no. 4, Wiley, 2013, pp. 1034–48, doi:<a href=\"https://doi.org/10.1111/nph.12437\">10.1111/nph.12437</a>.","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.” <i>New Phytologist</i>. Wiley, 2013. <a href=\"https://doi.org/10.1111/nph.12437\">https://doi.org/10.1111/nph.12437</a>.","ama":"Simon S, Kubeš M, Baster P, et al. Defining the selectivity of processes along the auxin response chain: A study using auxin analogues. <i>New Phytologist</i>. 2013;200(4):1034-1048. doi:<a href=\"https://doi.org/10.1111/nph.12437\">10.1111/nph.12437</a>"},"article_processing_charge":"No","external_id":{"isi":["000330955300012"]},"_id":"2443","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"free access","year":"2013"},{"month":"01","type":"conference","ddc":["000","004"],"page":"317 - 328","date_created":"2018-12-11T11:56:11Z","pubrep_id":"198","acknowledgement":"This work has been supported by the European Research Council\r\nadvanced grant QUAREM, the National Research Network RiSE\r\non Rigorous Systems Engineering (Austrian Science Fund S11404-\r\nN23), and an Elise Richter Fellowship (Austrian Science Fund\r\nV00125). We thank the anonymous referees for their constructive\r\nand inspiring comments and suggestions. Ana Sokolova wishes to\r\nthank Dexter Kozen and in particular Joel Ouaknine: had they not\r\nsaved her life, she would have missed a lot of the fun involved in\r\nworking on this paper and seeing it finished.","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"file":[{"file_id":"5086","file_size":294689,"checksum":"adf465e70948f4e80e48057524516456","content_type":"application/pdf","relation":"main_file","file_name":"IST-2014-198-v1+1_popl128-henzinger-clean.pdf","creator":"system","date_updated":"2020-07-14T12:45:31Z","date_created":"2018-12-12T10:14:33Z","access_level":"open_access"}],"corr_author":"1","file_date_updated":"2020-07-14T12:45:31Z","scopus_import":"1","has_accepted_license":"1","publisher":"ACM","ec_funded":1,"publication_identifier":{"isbn":["978-1-4503-1832-7"]},"date_updated":"2026-07-28T11:18:47Z","title":"Quantitative relaxation of concurrent data structures","oa":1,"day":"01","related_material":{"record":[{"status":"deleted","relation":"later_version","id":"10901"}]},"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"fulldoi":"https://doi.org/10.1145/2429069.2429109","oa_version":"Submitted Version","date_published":"2013-01-01T00:00:00Z","publication_status":"published","author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"last_name":"Kirsch","full_name":"Kirsch, Christoph","first_name":"Christoph"},{"first_name":"Hannes","last_name":"Payer","full_name":"Payer, Hannes"},{"first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87","full_name":"Sezgin, Ali","last_name":"Sezgin"},{"last_name":"Sokolova","full_name":"Sokolova, Ana","first_name":"Ana"}],"abstract":[{"text":"There is a trade-off between performance and correctness in implementing concurrent data structures. Better performance may be achieved at the expense of relaxing correctness, by redefining the semantics of data structures. We address such a redefinition of data structure semantics and present a systematic and formal framework for obtaining new data structures by quantitatively relaxing existing ones. We view a data structure as a sequential specification S containing all &quot;legal&quot; sequences over an alphabet of method calls. Relaxing the data structure corresponds to defining a distance from any sequence over the alphabet to the sequential specification: the k-relaxed sequential specification contains all sequences over the alphabet within distance k from the original specification. In contrast to other existing work, our relaxations are semantic (distance in terms of data structure states). As an instantiation of our framework, we present two simple yet generic relaxation schemes, called out-of-order and stuttering relaxation, along with several ways of computing distances. We show that the out-of-order relaxation, when further instantiated to stacks, queues, and priority queues, amounts to tolerating bounded out-of-order behavior, which cannot be captured by a purely syntactic relaxation (distance in terms of sequence manipulation, e.g. edit distance). We give concurrent implementations of relaxed data structures and demonstrate that bounded relaxations provide the means for trading correctness for performance in a controlled way. The relaxations are monotonic which further highlights the trade-off: increasing k increases the number of permitted sequences, which as we demonstrate can lead to better performance. Finally, since a relaxed stack or queue also implements a pool, we actually have new concurrent pool implementations that outperform the state-of-the-art ones.","lang":"eng"}],"quality_controlled":"1","doi":"10.1145/2429069.2429109","conference":{"end_date":"2013-01-25","name":"POPL: Principles of Programming Languages","start_date":"2013-01-23","location":"Rome, Italy"},"year":"2013","_id":"2181","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. Quantitative relaxation of concurrent data structures. In: <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>. ACM; 2013:317-328. doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>","apa":"Henzinger, T. A., Kirsch, C., Payer, H., Sezgin, A., &#38; Sokolova, A. (2013). Quantitative relaxation of concurrent data structures. In <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i> (pp. 317–328). Rome, Italy: ACM. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>","ista":"Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.","ieee":"T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in <i>Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language</i>, Rome, Italy, 2013, pp. 317–328.","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.","chicago":"Henzinger, Thomas A, Christoph Kirsch, Hannes Payer, Ali Sezgin, and Ana Sokolova. “Quantitative Relaxation of Concurrent Data Structures.” In <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, 317–28. ACM, 2013. <a href=\"https://doi.org/10.1145/2429069.2429109\">https://doi.org/10.1145/2429069.2429109</a>.","mla":"Henzinger, Thomas A., et al. “Quantitative Relaxation of Concurrent Data Structures.” <i>Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language</i>, ACM, 2013, pp. 317–28, doi:<a href=\"https://doi.org/10.1145/2429069.2429109\">10.1145/2429069.2429109</a>."},"article_processing_charge":"No","publication":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language","publist_id":"4801"},{"arxiv":1,"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1308.4767"}],"department":[{"_id":"ToHe"}],"month":"12","type":"conference","acknowledgement":"This research was supported by the European Commission through project\r\nDIAMOND (FP7-2009-IST-4-248613), the Austrian Science Fund (FWF)\r\nthrough projects RiSE (S11406-N23) and QUAINT (I774-N23), and ERC\r\nAdvanced Grant QUAREM (Quantitative Reactive Modeling)","page":"77 - 84","date_created":"2018-12-11T11:51:43Z","publisher":"IEEE","ec_funded":1,"scopus_import":"1","OA_place":"repository","title":"Synthesizing multiple boolean functions using interpolation on a single proof","das_tickbox":"1","date_updated":"2026-07-28T11:20:30Z","day":"11","oa":1,"author":[{"full_name":"Hofferek, Georg","last_name":"Hofferek","first_name":"Georg"},{"first_name":"Ashutosh","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta"},{"full_name":"Könighofer, Bettina","last_name":"Könighofer","first_name":"Bettina"},{"last_name":"Jiang","full_name":"Jiang, Jie","first_name":"Jie"},{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"}],"publication_status":"published","abstract":[{"text":"It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results.","lang":"eng"}],"oa_version":"Preprint","fulldoi":"https://doi.org/10.1109/FMCAD.2013.6679394","date_published":"2013-12-11T00:00:00Z","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"conference":{"end_date":"2013-10-23","name":"FMCAD: Formal Methods in Computer-Aided Design","start_date":"2013-10-20","location":"Portland, OR, United States"},"doi":"10.1109/FMCAD.2013.6679394","quality_controlled":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1385","OA_type":"green","year":"2013","publication":"2013 Formal Methods in Computer-Aided Design","publist_id":"5825","citation":{"apa":"Hofferek, G., Gupta, A., Könighofer, B., Jiang, J., &#38; Bloem, R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof. In <i>2013 Formal Methods in Computer-Aided Design</i> (pp. 77–84). Portland, OR, United States: IEEE. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>","ista":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. 2013. Synthesizing multiple boolean functions using interpolation on a single proof. 2013 Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 77–84.","ieee":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, and R. Bloem, “Synthesizing multiple boolean functions using interpolation on a single proof,” in <i>2013 Formal Methods in Computer-Aided Design</i>, Portland, OR, United States, 2013, pp. 77–84.","short":"G. Hofferek, A. Gupta, B. Könighofer, J. Jiang, R. Bloem, in:, 2013 Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 77–84.","mla":"Hofferek, Georg, et al. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” <i>2013 Formal Methods in Computer-Aided Design</i>, IEEE, 2013, pp. 77–84, doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>.","chicago":"Hofferek, Georg, Ashutosh Gupta, Bettina Könighofer, Jie Jiang, and Roderick Bloem. “Synthesizing Multiple Boolean Functions Using Interpolation on a Single Proof.” In <i>2013 Formal Methods in Computer-Aided Design</i>, 77–84. IEEE, 2013. <a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">https://doi.org/10.1109/FMCAD.2013.6679394</a>.","ama":"Hofferek G, Gupta A, Könighofer B, Jiang J, Bloem R. Synthesizing multiple boolean functions using interpolation on a single proof. In: <i>2013 Formal Methods in Computer-Aided Design</i>. IEEE; 2013:77-84. doi:<a href=\"https://doi.org/10.1109/FMCAD.2013.6679394\">10.1109/FMCAD.2013.6679394</a>"},"external_id":{"arxiv":["1308.4767"]},"article_processing_charge":"No"},{"date_updated":"2026-07-28T10:15:26Z","title":"Identification of long-lived proteins reveals exceptional stability of essential cellular structures","das_tickbox":"1","oa":1,"day":"29","month":"08","type":"journal_article","pmid":1,"page":"971-982","extern":"1","date_created":"2022-04-07T07:51:08Z","article_type":"original","volume":154,"department":[{"_id":"MaHe"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.cell.2013.07.037"}],"language":[{"iso":"eng"}],"OA_place":"publisher","scopus_import":"1","publisher":"Elsevier","publication_identifier":{"issn":["0092-8674"]},"keyword":["General Biochemistry","Genetics and Molecular Biology"],"year":"2013","_id":"11087","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"free access","citation":{"ama":"Toyama BH, Savas JN, Park SK, et al. Identification of long-lived proteins reveals exceptional stability of essential cellular structures. <i>Cell</i>. 2013;154(5):971-982. doi:<a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">10.1016/j.cell.2013.07.037</a>","short":"B.H. Toyama, J.N. Savas, S.K. Park, M.S. Harris, N.T. Ingolia, J.R. Yates, M. Hetzer, Cell 154 (2013) 971–982.","mla":"Toyama, Brandon H., et al. “Identification of Long-Lived Proteins Reveals Exceptional Stability of Essential Cellular Structures.” <i>Cell</i>, vol. 154, no. 5, Elsevier, 2013, pp. 971–82, doi:<a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">10.1016/j.cell.2013.07.037</a>.","chicago":"Toyama, Brandon H., Jeffrey N. Savas, Sung Kyu Park, Michael S. Harris, Nicholas T. Ingolia, John R. Yates, and Martin Hetzer. “Identification of Long-Lived Proteins Reveals Exceptional Stability of Essential Cellular Structures.” <i>Cell</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">https://doi.org/10.1016/j.cell.2013.07.037</a>.","apa":"Toyama, B. H., Savas, J. N., Park, S. K., Harris, M. S., Ingolia, N. T., Yates, J. R., &#38; Hetzer, M. (2013). Identification of long-lived proteins reveals exceptional stability of essential cellular structures. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2013.07.037\">https://doi.org/10.1016/j.cell.2013.07.037</a>","ieee":"B. H. Toyama <i>et al.</i>, “Identification of long-lived proteins reveals exceptional stability of essential cellular structures,” <i>Cell</i>, vol. 154, no. 5. Elsevier, pp. 971–982, 2013.","ista":"Toyama BH, Savas JN, Park SK, Harris MS, Ingolia NT, Yates JR, Hetzer M. 2013. Identification of long-lived proteins reveals exceptional stability of essential cellular structures. Cell. 154(5), 971–982."},"article_processing_charge":"No","external_id":{"pmid":["23993091"]},"publication":"Cell","date_published":"2013-08-29T00:00:00Z","fulldoi":"https://doi.org/10.1016/j.cell.2013.07.037","oa_version":"Published Version","author":[{"first_name":"Brandon H.","full_name":"Toyama, Brandon H.","last_name":"Toyama"},{"first_name":"Jeffrey N.","full_name":"Savas, Jeffrey N.","last_name":"Savas"},{"full_name":"Park, Sung Kyu","last_name":"Park","first_name":"Sung Kyu"},{"first_name":"Michael S.","last_name":"Harris","full_name":"Harris, Michael S."},{"full_name":"Ingolia, Nicholas T.","last_name":"Ingolia","first_name":"Nicholas T."},{"first_name":"John R.","full_name":"Yates, John R.","last_name":"Yates"},{"first_name":"Martin W","orcid":"0000-0002-2111-992X","last_name":"HETZER","full_name":"HETZER, Martin W","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed"}],"issue":"5","publication_status":"published","intvolume":"       154","abstract":[{"lang":"eng","text":"Intracellular proteins with long lifespans have recently been linked to age-dependent defects, ranging from decreased fertility to the functional decline of neurons. Why long-lived proteins exist in metabolically active cellular environments and how they are maintained over time remains poorly understood. Here, we provide a system-wide identification of proteins with exceptional lifespans in the rat brain. These proteins are inefficiently replenished despite being translated robustly throughout adulthood. Using nucleoporins as a paradigm for long-term protein persistence, we found that nuclear pore complexes (NPCs) are maintained over a cell’s life through slow but finite exchange of even its most stable subcomplexes. This maintenance is limited, however, as some nucleoporin levels decrease during aging, providing a rationale for the previously observed age-dependent deterioration of NPC function. Our identification of a long-lived proteome reveals cellular components that are at increased risk for damage accumulation, linking long-term protein persistence to the cellular aging process."}],"quality_controlled":"1","doi":"10.1016/j.cell.2013.07.037"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2237","year":"2013","publist_id":"4724","article_processing_charge":"No","citation":{"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., &#38; Kragl, B. (2013). Tree interpolation in Vampire. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>","chicago":"Blanc, Régis, Ashutosh Gupta, Laura Kovács, and Bernhard Kragl. “Tree Interpolation in Vampire.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">https://doi.org/10.1007/978-3-642-45221-5_13</a>.","mla":"Blanc, Régis, et al. <i>Tree Interpolation in Vampire</i>. Vol. 8312, Springer, 2013, pp. 173–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>.","short":"R. Blanc, A. Gupta, L. Kovács, B. Kragl, 8312 (2013) 173–181.","ama":"Blanc R, Gupta A, Kovács L, Kragl B. Tree interpolation in Vampire. 2013;8312:173-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-45221-5_13\">10.1007/978-3-642-45221-5_13</a>"},"series_title":"Lecture Notes in Computer Science","intvolume":"      8312","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."}],"author":[{"full_name":"Blanc, Régis","last_name":"Blanc","first_name":"Régis"},{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","full_name":"Gupta, Ashutosh","last_name":"Gupta","first_name":"Ashutosh"},{"last_name":"Kovács","full_name":"Kovács, Laura","first_name":"Laura"},{"last_name":"Kragl","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard","first_name":"Bernhard","orcid":"0000-0001-7745-9117"}],"publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-642-45221-5_13","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"date_published":"2013-01-14T00:00:00Z","oa_version":"Submitted Version","doi":"10.1007/978-3-642-45221-5_13","conference":{"end_date":"2013-12-19","location":"Stellenbosch, South Africa","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","start_date":"2013-12-14"},"quality_controlled":"1","das_tickbox":"1","title":"Tree interpolation in Vampire","date_updated":"2026-07-28T10:10:38Z","day":"14","oa":1,"file":[{"content_type":"application/pdf","relation":"main_file","file_id":"7858","file_size":279206,"checksum":"9cebaafca032e6769d273f393305c705","date_updated":"2020-07-14T12:45:34Z","access_level":"open_access","date_created":"2020-05-15T11:10:40Z","file_name":"2013_LPAR_Blanc.pdf","creator":"dernst"}],"language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"acknowledgement":"This research was partly supported by the Austrian National Research Network RiSE (FWF grants S11402-N23 and S11410-N23) and the WWTF PROSEED grant (ICT C-050).","volume":8312,"date_created":"2018-12-11T11:56:29Z","page":"173 - 181","ddc":["000"],"type":"conference","month":"01","publisher":"Springer","has_accepted_license":"1","alternative_title":["LNCS"],"file_date_updated":"2020-07-14T12:45:34Z","scopus_import":"1"}]