[{"year":"2013","doi":"10.1007/978-3-642-40708-6","quality_controlled":"1","conference":{"name":"CMSB: Computational Methods in Systems Biology","end_date":"2013-09-24","start_date":"2013-09-22","location":"Klosterneuburg, Austria"},"day":"01","publication_status":"published","date_created":"2018-12-11T11:56:47Z","status":"public","language":[{"iso":"eng"}],"month":"07","type":"conference_editor","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms."}],"citation":{"short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","apa":"Gupta, A., &#38; Henzinger, T. A. (Eds.). (2013). <i>Computational Methods in Systems Biology</i> (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40708-6\">https://doi.org/10.1007/978-3-642-40708-6</a>","ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. <i>Computational Methods in Systems Biology</i>. Vol. 8130, Springer, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-40708-6\">10.1007/978-3-642-40708-6</a>.","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. <i>Computational Methods in Systems Biology</i>. Vol. 8130. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40708-6\">https://doi.org/10.1007/978-3-642-40708-6</a>.","ieee":"A. Gupta and T. A. Henzinger, Eds., <i>Computational Methods in Systems Biology</i>, vol. 8130. Springer, 2013.","ama":"Gupta A, Henzinger TA, eds. <i>Computational Methods in Systems Biology</i>. Vol 8130. Springer; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-40708-6\">10.1007/978-3-642-40708-6</a>"},"oa_version":"None","date_published":"2013-07-01T00:00:00Z","department":[{"_id":"ToHe"}],"date_updated":"2024-10-09T20:55:17Z","publication_identifier":{"isbn":["978-3-642-40707-9"]},"volume":8130,"_id":"2288","intvolume":"      8130","publisher":"Springer","corr_author":"1","title":"Computational Methods in Systems Biology","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","editor":[{"last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","full_name":"Gupta, Ashutosh"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"publist_id":"4643"},{"volume":28,"pubrep_id":"626","date_published":"2013-10-05T00:00:00Z","department":[{"_id":"ToHe"}],"_id":"2289","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"file_date_updated":"2020-07-14T12:45:37Z","project":[{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"quality_controlled":"1","date_created":"2018-12-11T11:56:47Z","language":[{"iso":"eng"}],"year":"2013","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"4","citation":{"short":"T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.","chicago":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” <i>Computer Science Research and Development</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00450-013-0251-7\">https://doi.org/10.1007/s00450-013-0251-7</a>.","apa":"Henzinger, T. A. (2013). Quantitative reactive modeling and verification. <i>Computer Science Research and Development</i>. Springer. <a href=\"https://doi.org/10.1007/s00450-013-0251-7\">https://doi.org/10.1007/s00450-013-0251-7</a>","mla":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” <i>Computer Science Research and Development</i>, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:<a href=\"https://doi.org/10.1007/s00450-013-0251-7\">10.1007/s00450-013-0251-7</a>.","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344.","ieee":"T. A. Henzinger, “Quantitative reactive modeling and verification,” <i>Computer Science Research and Development</i>, vol. 28, no. 4. Springer, pp. 331–344, 2013.","ama":"Henzinger TA. Quantitative reactive modeling and verification. <i>Computer Science Research and Development</i>. 2013;28(4):331-344. doi:<a href=\"https://doi.org/10.1007/s00450-013-0251-7\">10.1007/s00450-013-0251-7</a>"},"abstract":[{"lang":"eng","text":"Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments."}],"oa_version":"Published Version","file":[{"checksum":"f117a00f9f046165bfa95595681e08a0","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"5308","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf","date_created":"2018-12-12T10:17:51Z","creator":"system","date_updated":"2020-07-14T12:45:37Z","file_size":570361}],"license":"https://creativecommons.org/licenses/by/4.0/","month":"10","ddc":["000"],"date_updated":"2024-10-09T20:55:17Z","corr_author":"1","publisher":"Springer","title":"Quantitative reactive modeling and verification","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4642","intvolume":"        28","status":"public","publication_status":"published","day":"05","doi":"10.1007/s00450-013-0251-7","ec_funded":1,"publication":"Computer Science Research and Development","page":"331 - 344","scopus_import":1,"type":"journal_article","has_accepted_license":"1"},{"author":[{"first_name":"Yohann","full_name":"Boutté, Yohann","last_name":"Boutté"},{"last_name":"Jonsson","full_name":"Jonsson, Kristoffer","first_name":"Kristoffer"},{"last_name":"Mcfarlane","first_name":"Heather","full_name":"Mcfarlane, Heather"},{"full_name":"Johnson, Errin","first_name":"Errin","last_name":"Johnson"},{"first_name":"Delphine","full_name":"Gendre, Delphine","last_name":"Gendre"},{"last_name":"Swarup","first_name":"Ranjan","full_name":"Swarup, Ranjan"},{"full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml","orcid":"0000-0002-8302-7596"},{"first_name":"Lacey","full_name":"Samuels, Lacey","last_name":"Samuels"},{"last_name":"Robert","first_name":"Stéphanie","full_name":"Robert, Stéphanie"},{"last_name":"Bhalerao","full_name":"Bhalerao, Rishikesh","first_name":"Rishikesh"}],"_id":"2290","department":[{"_id":"JiFr"}],"date_published":"2013-10-01T00:00:00Z","volume":110,"external_id":{"pmid":["24043780"],"isi":["000325105500090"]},"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/","open_access":"1"}],"isi":1,"month":"10","oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development."}],"citation":{"apa":"Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R., … Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1309057110\">https://doi.org/10.1073/pnas.1309057110</a>","ista":"Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J, Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.","mla":"Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” <i>PNAS</i>, vol. 110, no. 40, National Academy of Sciences, 2013, pp. 16259–64, doi:<a href=\"https://doi.org/10.1073/pnas.1309057110\">10.1073/pnas.1309057110</a>.","chicago":"Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1309057110\">https://doi.org/10.1073/pnas.1309057110</a>.","short":"Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J. Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264.","ama":"Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. <i>PNAS</i>. 2013;110(40):16259-16264. doi:<a href=\"https://doi.org/10.1073/pnas.1309057110\">10.1073/pnas.1309057110</a>","ieee":"Y. Boutté <i>et al.</i>, “ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation,” <i>PNAS</i>, vol. 110, no. 40. National Academy of Sciences, pp. 16259–16264, 2013."},"issue":"40","oa":1,"year":"2013","date_created":"2018-12-11T11:56:48Z","language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","intvolume":"       110","pmid":1,"publist_id":"4639","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation","publisher":"National Academy of Sciences","date_updated":"2025-09-29T14:22:33Z","type":"journal_article","scopus_import":"1","page":"16259 - 16264","publication":"PNAS","doi":"10.1073/pnas.1309057110","publication_status":"published","day":"01","status":"public"},{"department":[{"_id":"KrPi"}],"date_published":"2013-09-01T00:00:00Z","date_updated":"2025-09-29T14:22:06Z","external_id":{"isi":["000335225600008"]},"_id":"2291","author":[{"last_name":"Ferrara","first_name":"Anna","full_name":"Ferrara, Anna"},{"last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"},{"last_name":"Warinschi","full_name":"Warinschi, Bogdan","first_name":"Bogdan"}],"article_processing_charge":"No","title":"Cryptographically enforced RBAC","publisher":"IEEE","publist_id":"4637","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"year":"2013","doi":"10.1109/CSF.2013.15","quality_controlled":"1","date_created":"2018-12-11T11:56:48Z","language":[{"iso":"eng"}],"status":"public","day":"01","conference":{"name":"CSF: Computer Security Foundations","end_date":"2013-09-28","start_date":"2013-09-26","location":"New Orleans, LA, United States"},"publication_status":"published","scopus_import":"1","month":"09","isi":1,"type":"conference","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2013/492"}],"citation":{"ama":"Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In: IEEE; 2013:115-129. doi:<a href=\"https://doi.org/10.1109/CSF.2013.15\">10.1109/CSF.2013.15</a>","ieee":"A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129.","chicago":"Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,” 115–29. IEEE, 2013. <a href=\"https://doi.org/10.1109/CSF.2013.15\">https://doi.org/10.1109/CSF.2013.15</a>.","ista":"Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC. CSF: Computer Security Foundations, 115–129.","apa":"Ferrara, A., Fuchsbauer, G., &#38; Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE. <a href=\"https://doi.org/10.1109/CSF.2013.15\">https://doi.org/10.1109/CSF.2013.15</a>","mla":"Ferrara, Anna, et al. <i>Cryptographically Enforced RBAC</i>. IEEE, 2013, pp. 115–29, doi:<a href=\"https://doi.org/10.1109/CSF.2013.15\">10.1109/CSF.2013.15</a>.","short":"A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129."},"abstract":[{"lang":"eng","text":"Cryptographic access control promises to offer easily distributed trust and broader applicability, while reducing reliance on low-level online monitors. Traditional implementations of cryptographic access control rely on simple cryptographic primitives whereas recent endeavors employ primitives with richer functionality and security guarantees. Worryingly, few of the existing cryptographic access-control schemes come with precise guarantees, the gap between the policy specification and the implementation being analyzed only informally, if at all. In this paper we begin addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification, we look at the well-established Role-Based Access Control (RBAC) model, as used in a typical file system. In short, we provide a precise syntax for a computational version of RBAC, offer rigorous definitions for cryptographic policy enforcement of a large class of RBAC security policies, and demonstrate that an implementation based on attribute-based encryption meets our security notions. We view our main contribution as being at the conceptual level. Although we work with RBAC for concreteness, our general methodology could guide future research for uses of cryptography in other access-control models. \r\n"}],"oa_version":"Submitted Version","page":"115 - 129"},{"volume":8087,"date_updated":"2020-08-11T10:09:45Z","publication_identifier":{"isbn":["978-3-642-40312-5"]},"series_title":"Lecture Notes in Computer Science","department":[{"_id":"KrCh"}],"date_published":"2013-08-08T00:00:00Z","editor":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Sgall","full_name":"Sgall, Jiri","first_name":"Jiri"}],"publist_id":"4636","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Mathematical Foundations of Computer Science 2013","publisher":"Springer","intvolume":"      8087","_id":"2292","day":"08","status":"public","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:48Z","conference":{"end_date":"2013-08-30","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2013-08-26","location":"Klosterneuburg, Austria"},"publication_status":"published","quality_controlled":"1","doi":"10.1007/978-3-642-40313-2","year":"2013","oa_version":"None","page":"VI - 854","abstract":[{"lang":"eng","text":"This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence."}],"citation":{"short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","chicago":"Chatterjee, Krishnendu, and Jiri Sgall, eds. <i>Mathematical Foundations of Computer Science 2013</i>. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40313-2\">https://doi.org/10.1007/978-3-642-40313-2</a>.","mla":"Chatterjee, Krishnendu, and Jiri Sgall, editors. <i>Mathematical Foundations of Computer Science 2013</i>. Vol. 8087, Springer, 2013, p. VI-854, doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2\">10.1007/978-3-642-40313-2</a>.","ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","apa":"Chatterjee, K., &#38; Sgall, J. (Eds.). (2013). <i>Mathematical Foundations of Computer Science 2013</i> (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40313-2\">https://doi.org/10.1007/978-3-642-40313-2</a>","ieee":"K. Chatterjee and J. Sgall, Eds., <i>Mathematical Foundations of Computer Science 2013</i>, vol. 8087. Springer, 2013, p. VI-854.","ama":"Chatterjee K, Sgall J, eds. <i>Mathematical Foundations of Computer Science 2013</i>. Vol 8087. Springer; 2013:VI-854. doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2\">10.1007/978-3-642-40313-2</a>"},"alternative_title":["LNCS"],"type":"conference_editor","scopus_import":1,"month":"08"},{"date_updated":"2025-09-29T14:20:45Z","title":"Learning to rank using privileged information","publisher":"IEEE","publist_id":"4635","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","day":"01","conference":{"location":"Sydney, Australia","start_date":"2013-12-01","end_date":"2013-12-08","name":"ICCV: International Conference on Computer Vision"},"status":"public","publication_status":"published","doi":"10.1109/ICCV.2013.107","ec_funded":1,"page":"825 - 832","scopus_import":"1","type":"conference","external_id":{"isi":["000351830500103"]},"department":[{"_id":"ChLa"}],"date_published":"2013-12-01T00:00:00Z","_id":"2293","author":[{"first_name":"Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","full_name":"Sharmanska, Viktoriia","last_name":"Sharmanska","orcid":"0000-0003-0192-9308"},{"full_name":"Quadrianto, Novi","first_name":"Novi","last_name":"Quadrianto"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"project":[{"name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"quality_controlled":"1","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:49Z","year":"2013","oa":1,"citation":{"chicago":"Sharmanska, Viktoriia, Novi Quadrianto, and Christoph Lampert. “Learning to Rank Using Privileged Information,” 825–32. IEEE, 2013. <a href=\"https://doi.org/10.1109/ICCV.2013.107\">https://doi.org/10.1109/ICCV.2013.107</a>.","mla":"Sharmanska, Viktoriia, et al. <i>Learning to Rank Using Privileged Information</i>. IEEE, 2013, pp. 825–32, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.107\">10.1109/ICCV.2013.107</a>.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged information. ICCV: International Conference on Computer Vision, 825–832.","apa":"Sharmanska, V., Quadrianto, N., &#38; Lampert, C. (2013). Learning to rank using privileged information (pp. 825–832). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.107\">https://doi.org/10.1109/ICCV.2013.107</a>","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.","ama":"Sharmanska V, Quadrianto N, Lampert C. Learning to rank using privileged information. In: IEEE; 2013:825-832. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.107\">10.1109/ICCV.2013.107</a>","ieee":"V. Sharmanska, N. Quadrianto, and C. Lampert, “Learning to rank using privileged information,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 825–832."},"abstract":[{"lang":"eng","text":"Many computer vision problems have an asymmetric distribution of information between training and test time. In this work, we study the case where we are given additional information about the training data, which however will not be available at test time. This situation is called learning using privileged information (LUPI). We introduce two maximum-margin techniques that are able to make use of this additional source of information, and we show that the framework is applicable to several scenarios that have been studied in computer vision before. Experiments with attributes, bounding boxes, image tags and rationales as additional information in object classification show promising results."}],"oa_version":"Submitted Version","month":"12","main_file_link":[{"url":"www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf","open_access":"1"}],"isi":1},{"author":[{"full_name":"Kazmar, Tomas","first_name":"Tomas","last_name":"Kazmar"},{"last_name":"Kvon","full_name":"Kvon, Evgeny","first_name":"Evgeny"},{"full_name":"Stark, Alexander","first_name":"Alexander","last_name":"Stark"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"_id":"2294","external_id":{"isi":["000351830500136"]},"date_published":"2013-12-01T00:00:00Z","department":[{"_id":"ChLa"}],"citation":{"chicago":"Kazmar, Tomas, Evgeny Kvon, Alexander Stark, and Christoph Lampert. “Drosophila Embryo Stage Annotation Using Label Propagation.” IEEE, 2013. <a href=\"https://doi.org/10.1109/ICCV.2013.139\">https://doi.org/10.1109/ICCV.2013.139</a>.","apa":"Kazmar, T., Kvon, E., Stark, A., &#38; Lampert, C. (2013). Drosophila Embryo Stage Annotation using Label Propagation. Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.139\">https://doi.org/10.1109/ICCV.2013.139</a>","ista":"Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation using Label Propagation. ICCV: International Conference on Computer Vision.","mla":"Kazmar, Tomas, et al. <i>Drosophila Embryo Stage Annotation Using Label Propagation</i>. IEEE, 2013, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.139\">10.1109/ICCV.2013.139</a>.","short":"T. Kazmar, E. Kvon, A. Stark, C. Lampert, in:, IEEE, 2013.","ama":"Kazmar T, Kvon E, Stark A, Lampert C. Drosophila Embryo Stage Annotation using Label Propagation. In: IEEE; 2013. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.139\">10.1109/ICCV.2013.139</a>","ieee":"T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation using Label Propagation,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013."},"abstract":[{"lang":"eng","text":"In this work we propose a system for automatic classification of Drosophila embryos into developmental stages.\r\nWhile the system is designed to solve an actual problem in biological research, we believe that the principle underly-\r\ning it is interesting not only for biologists, but also for researchers in computer vision. The main idea is to combine two orthogonal sources of information:  one is a classifier trained on strongly invariant features,  which makes it applicable to images of very different conditions, but also leads to rather noisy predictions. The other is a label propagation step based on a more powerful similarity measure that however is only consistent within specific subsets of the data at a time.\r\nIn our biological setup, the information sources are the shape and the staining patterns of embryo images. We show\r\nexperimentally  that  while  neither  of  the  methods  can  be used by itself to achieve satisfactory results, their combina-\r\ntion achieves prediction quality comparable to human performance."}],"oa_version":"Submitted Version","month":"12","isi":1,"main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/ICCV2013.py"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","grant_number":"308036"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:49Z","oa":1,"year":"2013","publisher":"IEEE","title":"Drosophila Embryo Stage Annotation using Label Propagation","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4634","article_processing_charge":"No","date_updated":"2025-09-29T14:20:15Z","ec_funded":1,"scopus_import":"1","type":"conference","publication_status":"published","conference":{"end_date":"2013-12-08","name":"ICCV: International Conference on Computer Vision","location":"Sydney, Australia","start_date":"2013-12-01"},"status":"public","day":"01","doi":"10.1109/ICCV.2013.139"},{"ec_funded":1,"page":"165 - 180","scopus_import":1,"has_accepted_license":"1","type":"conference","publication_status":"published","day":"27","conference":{"end_date":"2013-09-05","name":"CSL: Computer Science Logic","location":"Torino, Italy","start_date":"2013-09-02"},"status":"public","doi":"10.4230/LIPIcs.CSL.2013.165","title":"What is decidable about partially observable Markov decision processes with omega-regular objectives","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publist_id":"4633","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        23","ddc":["000"],"date_updated":"2025-09-18T11:38:38Z","series_title":"Leibniz International Proceedings in Informatics","abstract":[{"text":"We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are known to be undecidable even for very special cases of parity objectives, we establish decidability (with optimal EXPTIME-complete complexity) of the qualitative analysis problems for POMDPs with all parity objectives under finite-memory strategies. We also establish asymptotically optimal (exponential) memory bounds.","lang":"eng"}],"alternative_title":["LIPIcs"],"citation":{"ieee":"K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.","ama":"Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with omega-regular objectives. 2013;23:165-180. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">10.4230/LIPIcs.CSL.2013.165</a>","short":"K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.","mla":"Chatterjee, Krishnendu, et al. <i>What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">10.4230/LIPIcs.CSL.2013.165</a>.","apa":"Chatterjee, K., Chmelik, M., &#38; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">https://doi.org/10.4230/LIPIcs.CSL.2013.165</a>","ista":"Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.165\">https://doi.org/10.4230/LIPIcs.CSL.2013.165</a>."},"file":[{"file_name":"IST-2017-756-v1+1_2.pdf","file_id":"4766","content_type":"application/pdf","checksum":"ba2828322955574d9283bea0e17a37a6","relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:45:37Z","file_size":345171,"date_created":"2018-12-12T10:09:42Z","creator":"system"}],"oa_version":"Published Version","month":"08","quality_controlled":"1","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"file_date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-11T11:56:50Z","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2013","oa":1,"related_material":{"record":[{"id":"5400","status":"public","relation":"earlier_version"},{"relation":"later_version","status":"public","id":"1477"}]},"_id":"2295","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"},{"full_name":"Tracol, Mathieu","first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","last_name":"Tracol"}],"volume":23,"department":[{"_id":"KrCh"}],"date_published":"2013-08-27T00:00:00Z","pubrep_id":"756"},{"author":[{"first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521"}],"_id":"2297","external_id":{"arxiv":["0908.3686"],"isi":["000324648700001"]},"volume":8,"date_published":"2013-09-24T00:00:00Z","department":[{"_id":"RoSe"}],"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present an overview of mathematical results on the low temperature properties of dilute quantum gases, which have been obtained in the past few years. The presentation includes a discussion of Bose-Einstein condensation, the excitation spectrum for trapped gases and its relation to superfluidity, as well as the appearance of quantized vortices in rotating systems. All these properties are intensely being studied in current experiments on cold atomic gases. We will give a description of the mathematics involved in understanding these phenomena, starting from the underlying many-body Schrödinger equation."}],"citation":{"short":"R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.","mla":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” <i>Japanese Journal of Mathematics</i>, vol. 8, no. 2, Springer, 2013, pp. 185–232, doi:<a href=\"https://doi.org/10.1007/s11537-013-1264-5\">10.1007/s11537-013-1264-5</a>.","ista":"Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232.","apa":"Seiringer, R. (2013). Hot topics in cold gases: A mathematical physics perspective. <i>Japanese Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11537-013-1264-5\">https://doi.org/10.1007/s11537-013-1264-5</a>","chicago":"Seiringer, Robert. “Hot Topics in Cold Gases: A Mathematical Physics Perspective.” <i>Japanese Journal of Mathematics</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s11537-013-1264-5\">https://doi.org/10.1007/s11537-013-1264-5</a>.","ieee":"R. Seiringer, “Hot topics in cold gases: A mathematical physics perspective,” <i>Japanese Journal of Mathematics</i>, vol. 8, no. 2. Springer, pp. 185–232, 2013.","ama":"Seiringer R. Hot topics in cold gases: A mathematical physics perspective. <i>Japanese Journal of Mathematics</i>. 2013;8(2):185-232. doi:<a href=\"https://doi.org/10.1007/s11537-013-1264-5\">10.1007/s11537-013-1264-5</a>"},"isi":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/0908.3686"}],"month":"09","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:50Z","quality_controlled":"1","issue":"2","oa":1,"year":"2013","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4631","corr_author":"1","publisher":"Springer","title":"Hot topics in cold gases: A mathematical physics perspective","article_processing_charge":"No","intvolume":"         8","arxiv":1,"date_updated":"2025-09-29T14:19:17Z","page":"185 - 232","publication":"Japanese Journal of Mathematics","type":"journal_article","scopus_import":"1","status":"public","day":"24","publication_status":"published","doi":"10.1007/s11537-013-1264-5"},{"date_updated":"2021-01-12T06:56:36Z","ddc":["000","004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4630","publisher":"Springer","title":"Local shape analysis for overlaid data structures","intvolume":"      7935","publication_status":"published","status":"public","day":"01","conference":{"end_date":"2013-06-22","name":"SAS: Static Analysis Symposium","start_date":"2013-06-20","location":"Seattle, WA, United States"},"doi":"10.1007/978-3-642-38856-9_10","page":"150 - 171","ec_funded":1,"type":"conference","has_accepted_license":"1","scopus_import":1,"volume":7935,"pubrep_id":"196","date_published":"2013-01-01T00:00:00Z","department":[{"_id":"ToHe"}],"author":[{"id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","first_name":"Cezara","full_name":"Dragoi, Cezara","last_name":"Dragoi"},{"full_name":"Enea, Constantin","first_name":"Constantin","last_name":"Enea"},{"first_name":"Mihaela","full_name":"Sighireanu, Mihaela","last_name":"Sighireanu"}],"_id":"2298","date_created":"2018-12-11T11:56:50Z","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:37Z","quality_controlled":"1","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"oa":1,"year":"2013","oa_version":"Submitted Version","file":[{"file_size":299004,"date_updated":"2020-07-14T12:45:37Z","creator":"system","date_created":"2018-12-12T10:10:36Z","file_name":"IST-2014-196-v1+1_sas13.pdf","file_id":"4824","checksum":"907edd33a5892e3af093365f1fd57ed7","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"citation":{"short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>.","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.","apa":"Dragoi, C., Enea, C., &#38; Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>","mla":"Dragoi, Cezara, et al. <i>Local Shape Analysis for Overlaid Data Structures</i>. Vol. 7935, Springer, 2013, pp. 150–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>.","ieee":"C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171.","ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>"},"abstract":[{"text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n","lang":"eng"}],"alternative_title":["LNCS"],"month":"01"},{"volume":15,"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_published":"2013-10-01T00:00:00Z","pubrep_id":"87","author":[{"last_name":"Godhal","first_name":"Yashdeep","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5","full_name":"Godhal, Yashdeep"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"}],"_id":"2299","date_created":"2018-12-11T11:56:51Z","language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","file_date_updated":"2020-07-14T12:45:37Z","issue":"5-6","oa":1,"year":"2013","file":[{"date_created":"2018-12-12T10:11:53Z","creator":"system","date_updated":"2020-07-14T12:45:37Z","file_size":277372,"content_type":"application/pdf","relation":"main_file","checksum":"57b06a732dd8d6349190dba6b5b0d33b","access_level":"open_access","file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","file_id":"4910"}],"oa_version":"Submitted Version","citation":{"ista":"Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.","apa":"Godhal, Y., Chatterjee, K., &#38; Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. <i>International Journal on Software Tools for Technology Transfer</i>. Springer. <a href=\"https://doi.org/10.1007/s10009-011-0207-9\">https://doi.org/10.1007/s10009-011-0207-9</a>","mla":"Godhal, Yashdeep, et al. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 15, no. 5–6, Springer, 2013, pp. 585–601, doi:<a href=\"https://doi.org/10.1007/s10009-011-0207-9\">10.1007/s10009-011-0207-9</a>.","chicago":"Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.” <i>International Journal on Software Tools for Technology Transfer</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s10009-011-0207-9\">https://doi.org/10.1007/s10009-011-0207-9</a>.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","ama":"Godhal Y, Chatterjee K, Henzinger TA. Synthesis of AMBA AHB from formal specification: A case study. <i>International Journal on Software Tools for Technology Transfer</i>. 2013;15(5-6):585-601. doi:<a href=\"https://doi.org/10.1007/s10009-011-0207-9\">10.1007/s10009-011-0207-9</a>","ieee":"Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 15, no. 5–6. Springer, pp. 585–601, 2013."},"abstract":[{"lang":"eng","text":"The standard hardware design flow involves: (a) design of an integrated circuit using a hardware description language, (b) extensive functional and formal verification, and (c) logical synthesis. However, the above-mentioned processes consume significant effort and time. An alternative approach is to use a formal specification language as a high-level hardware description language and synthesize hardware from formal specifications. Our work is a case study of the synthesis of the widely and industrially used AMBA AHB protocol from formal specifications. Bloem et al. presented the first formal specifications for the AMBA AHB Arbiter and synthesized the AHB Arbiter circuit. However, in the first formal specification some important assumptions were missing. Our contributions are as follows: (a) We present detailed formal specifications for the AHB Arbiter incorporating the missing details, and obtain significant improvements in the synthesis results (both with respect to the number of gates in the synthesized circuit and with respect to the time taken to synthesize the circuit), and (b) we present formal specifications to generate compact circuits for the remaining two main components of AMBA AHB, namely, AHB Master and AHB Slave. Thus with systematic description we are able to automatically and completely synthesize an important and widely used industrial protocol."}],"month":"10","date_updated":"2024-10-09T20:55:16Z","ddc":["000"],"publist_id":"4629","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Synthesis of AMBA AHB from formal specification: A case study","publisher":"Springer","corr_author":"1","intvolume":"        15","day":"01","publication_status":"published","status":"public","doi":"10.1007/s10009-011-0207-9","page":"585 - 601","publication":"International Journal on Software Tools for Technology Transfer","has_accepted_license":"1","type":"journal_article","scopus_import":1},{"arxiv":1,"date_updated":"2025-09-29T14:18:13Z","publist_id":"4627","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Realization of stripes and slabs in two and three dimensions","publisher":"American Physical Society","article_processing_charge":"No","intvolume":"        88","publication_status":"published","day":"01","status":"public","doi":"10.1103/PhysRevB.88.064401","publication":"Physical Review B","type":"journal_article","scopus_import":"1","article_number":"064401","external_id":{"isi":["000322721000002"],"arxiv":["1305.5323"]},"volume":88,"department":[{"_id":"RoSe"}],"date_published":"2013-08-01T00:00:00Z","author":[{"full_name":"Giuliani, Alessandro","first_name":"Alessandro","last_name":"Giuliani"},{"last_name":"Lieb","full_name":"Lieb, Élliott","first_name":"Élliott"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer"}],"_id":"2300","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:51Z","quality_controlled":"1","issue":"6","year":"2013","oa":1,"oa_version":"Preprint","citation":{"short":"A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).","chicago":"Giuliani, Alessandro, Élliott Lieb, and Robert Seiringer. “Realization of Stripes and Slabs in Two and Three Dimensions.” <i>Physical Review B</i>. American Physical Society, 2013. <a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">https://doi.org/10.1103/PhysRevB.88.064401</a>.","ista":"Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401.","apa":"Giuliani, A., Lieb, É., &#38; Seiringer, R. (2013). Realization of stripes and slabs in two and three dimensions. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">https://doi.org/10.1103/PhysRevB.88.064401</a>","mla":"Giuliani, Alessandro, et al. “Realization of Stripes and Slabs in Two and Three Dimensions.” <i>Physical Review B</i>, vol. 88, no. 6, 064401, American Physical Society, 2013, doi:<a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">10.1103/PhysRevB.88.064401</a>.","ieee":"A. Giuliani, É. Lieb, and R. Seiringer, “Realization of stripes and slabs in two and three dimensions,” <i>Physical Review B</i>, vol. 88, no. 6. American Physical Society, 2013.","ama":"Giuliani A, Lieb É, Seiringer R. Realization of stripes and slabs in two and three dimensions. <i>Physical Review B</i>. 2013;88(6). doi:<a href=\"https://doi.org/10.1103/PhysRevB.88.064401\">10.1103/PhysRevB.88.064401</a>"},"abstract":[{"lang":"eng","text":"We consider Ising models in two and three dimensions with nearest neighbor ferromagnetic interactions and long-range, power law decaying, antiferromagnetic interactions. If the strength of the ferromagnetic coupling J is larger than a critical value Jc, then the ground state is homogeneous and ferromagnetic. As the critical value is approached from smaller values of J, it is believed that the ground state consists of a periodic array of stripes (d=2) or slabs (d=3), all of the same size and alternating magnetization. Here we prove rigorously that the ground state energy per site converges to that of the optimal periodic striped or slabbed state, in the limit that J tends to the ferromagnetic transition point. While this theorem does not prove rigorously that the ground state is precisely striped or slabbed, it does prove that in any suitably large box the ground state is striped or slabbed with high probability."}],"isi":1,"main_file_link":[{"url":"http://arxiv.org/abs/1305.5323","open_access":"1"}],"month":"08"},{"doi":"10.1145/2491956.2462184","year":"2013","status":"public","language":[{"iso":"eng"}],"publication_status":"published","conference":{"start_date":"2013-06-16","location":"Seattle, WA, United States","name":"PLDI: Programming Languages Design and Implementation","end_date":"2013-06-19"},"day":"01","date_created":"2018-12-11T11:56:52Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"quality_controlled":"1","type":"conference","main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"month":"06","scopus_import":1,"oa_version":"None","page":"321 - 331","abstract":[{"lang":"eng","text":"We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to &quot;close&quot; the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhan-dled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P."}],"citation":{"ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>. ACM; 2013:321-331. doi:<a href=\"https://doi.org/10.1145/2491956.2462184\">10.1145/2491956.2462184</a>","ieee":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, and D. Zufferey, “P: Safe asynchronous event-driven programming,” in <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, Seattle, WA, United States, 2013, pp. 321–331.","apa":"Desai, A., Gupta, V., Jackson, E., Qadeer, S., Rajamani, S., &#38; Zufferey, D. (2013). P: Safe asynchronous event-driven programming. In <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i> (pp. 321–331). Seattle, WA, United States: ACM. <a href=\"https://doi.org/10.1145/2491956.2462184\">https://doi.org/10.1145/2491956.2462184</a>","mla":"Desai, Ankush, et al. “P: Safe Asynchronous Event-Driven Programming.” <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, ACM, 2013, pp. 321–31, doi:<a href=\"https://doi.org/10.1145/2491956.2462184\">10.1145/2491956.2462184</a>.","ista":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.","chicago":"Desai, Ankush, Vivek Gupta, Ethan Jackson, Shaz Qadeer, Sriram Rajamani, and Damien Zufferey. “P: Safe Asynchronous Event-Driven Programming.” In <i>Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation</i>, 321–31. ACM, 2013. <a href=\"https://doi.org/10.1145/2491956.2462184\">https://doi.org/10.1145/2491956.2462184</a>.","short":"A. Desai, V. Gupta, E. Jackson, S. Qadeer, S. Rajamani, D. Zufferey, in:, Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM, 2013, pp. 321–331."},"publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","ec_funded":1,"date_updated":"2021-01-12T06:56:38Z","date_published":"2013-06-01T00:00:00Z","department":[{"_id":"ToHe"}],"_id":"2301","author":[{"first_name":"Ankush","full_name":"Desai, Ankush","last_name":"Desai"},{"last_name":"Gupta","full_name":"Gupta, Vivek","first_name":"Vivek"},{"last_name":"Jackson","full_name":"Jackson, Ethan","first_name":"Ethan"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"last_name":"Rajamani","first_name":"Sriram","full_name":"Rajamani, Sriram"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","full_name":"Zufferey, Damien","last_name":"Zufferey","orcid":"0000-0002-3197-8736"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4626","publisher":"ACM","title":"P: Safe asynchronous event-driven programming"},{"intvolume":"         8","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"4624","publisher":"Springer","corr_author":"1","title":"Dissection of gene function at clonal level using mosaic analysis with double markers","article_type":"review","date_updated":"2024-10-09T20:55:16Z","type":"journal_article","scopus_import":1,"page":"557 - 568","publication":"Frontiers in Biology","doi":"10.1007/s11515-013-1279-6","status":"public","day":"03","publication_status":"published","author":[{"last_name":"Hippenmeyer","orcid":"0000-0003-2279-1061","full_name":"Hippenmeyer, Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","first_name":"Simon"}],"_id":"2303","date_published":"2013-09-03T00:00:00Z","department":[{"_id":"SiHi"}],"volume":8,"acknowledgement":"This work was supported by IST Austria institutional funds.","month":"09","oa_version":"None","abstract":[{"text":"MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach in mice to visualize and concomitantly manipulate genetically defined cells at clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent interchromosomal mitotic recombination to reconstitute two split marker genes—green GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in one color and wild-type cells in the other color in an otherwise unlabeled background. At present, major MADM applications include lineage tracing, single cell labeling, conditional knockouts in small populations of cells and induction of uniparental chromosome disomy to assess effects of genomic imprinting. MADM can be applied universally in the mouse with the sole limitation being the specificity of the promoter controlling Cre recombinase expression. Here I review recent developments and extensions of the MADM technique and give an overview of the major discoveries and progresses enabled by the implementation of the novel genetic MADM tools.","lang":"eng"}],"citation":{"short":"S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568.","chicago":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” <i>Frontiers in Biology</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s11515-013-1279-6\">https://doi.org/10.1007/s11515-013-1279-6</a>.","apa":"Hippenmeyer, S. (2013). Dissection of gene function at clonal level using mosaic analysis with double markers. <i>Frontiers in Biology</i>. Springer. <a href=\"https://doi.org/10.1007/s11515-013-1279-6\">https://doi.org/10.1007/s11515-013-1279-6</a>","ista":"Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 8(6), 557–568.","mla":"Hippenmeyer, Simon. “Dissection of Gene Function at Clonal Level Using Mosaic Analysis with Double Markers.” <i>Frontiers in Biology</i>, vol. 8, no. 6, Springer, 2013, pp. 557–68, doi:<a href=\"https://doi.org/10.1007/s11515-013-1279-6\">10.1007/s11515-013-1279-6</a>.","ieee":"S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” <i>Frontiers in Biology</i>, vol. 8, no. 6. Springer, pp. 557–568, 2013.","ama":"Hippenmeyer S. Dissection of gene function at clonal level using mosaic analysis with double markers. <i>Frontiers in Biology</i>. 2013;8(6):557-568. doi:<a href=\"https://doi.org/10.1007/s11515-013-1279-6\">10.1007/s11515-013-1279-6</a>"},"issue":"6","year":"2013","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:56:52Z","quality_controlled":"1"},{"date_published":"2013-09-05T00:00:00Z","department":[{"_id":"HeEd"}],"date_updated":"2024-10-09T20:55:15Z","volume":43,"_id":"2304","author":[{"first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","last_name":"Pausinger"}],"intvolume":"        43","publisher":"Elsevier","corr_author":"1","title":"Van der Corput sequences and linear permutations","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4623","year":"2013","doi":"10.1016/j.endm.2013.07.008","quality_controlled":"1","status":"public","day":"05","publication_status":"published","date_created":"2018-12-11T11:56:53Z","language":[{"iso":"eng"}],"month":"09","acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","scopus_import":1,"type":"journal_article","citation":{"ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” <i>Electronic Notes in Discrete Mathematics</i>, vol. 43. Elsevier, pp. 43–50, 2013.","ama":"Pausinger F. Van der Corput sequences and linear permutations. <i>Electronic Notes in Discrete Mathematics</i>. 2013;43:43-50. doi:<a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">10.1016/j.endm.2013.07.008</a>","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","mla":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” <i>Electronic Notes in Discrete Mathematics</i>, vol. 43, Elsevier, 2013, pp. 43–50, doi:<a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">10.1016/j.endm.2013.07.008</a>.","apa":"Pausinger, F. (2013). Van der Corput sequences and linear permutations. <i>Electronic Notes in Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">https://doi.org/10.1016/j.endm.2013.07.008</a>","chicago":"Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.” <i>Electronic Notes in Discrete Mathematics</i>. Elsevier, 2013. <a href=\"https://doi.org/10.1016/j.endm.2013.07.008\">https://doi.org/10.1016/j.endm.2013.07.008</a>."},"abstract":[{"text":"This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.","lang":"eng"}],"publication":"Electronic Notes in Discrete Mathematics","oa_version":"None","page":"43 - 50"},{"status":"public","publication_status":"published","conference":{"end_date":"2013-06-28","name":"LICS: Logic in Computer Science","location":"New Orleans, LA, United States","start_date":"2013-06-25"},"day":"01","doi":"10.1109/LICS.2013.39","ec_funded":1,"publication":"28th Annual ACM/IEEE Symposium","page":"331 - 340","scopus_import":"1","type":"conference","arxiv":1,"date_updated":"2025-09-29T14:16:57Z","publisher":"IEEE","title":"Trading performance for stability in Markov decision processes","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publist_id":"4622","article_processing_charge":"No","quality_controlled":"1","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"date_created":"2018-12-11T11:56:53Z","language":[{"iso":"eng"}],"year":"2013","oa":1,"abstract":[{"text":"We study the complexity of central controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize both the expected mean-payoff performance of the system and its stability. e argue that the basic theoretical notion of expressing the stability in terms of the variance of the mean-payoff (called global variance in our paper) is not always sufficient, since it ignores possible instabilities on respective runs. For this reason we propose alernative definitions of stability, which we call local and hybrid variance, and which express how rewards on each run deviate from the run's own mean-payoff and from the expected mean-payoff, respectively. We show that a strategy ensuring both the expected mean-payoff and the variance below given bounds requires randomization and memory, under all the above semantics of variance. We then look at the problem of determining whether there is a such a strategy. For the global variance, we show that the problem is in PSPACE, and that the answer can be approximated in pseudo-polynomial time. For the hybrid variance, the analogous decision problem is in NP, and a polynomial-time approximating algorithm also exists. For local variance, we show that the decision problem is in NP. Since the overall performance can be traded for stability (and vice versa), we also present algorithms for approximating the associated Pareto curve in all the three cases. Finally, we study a special case of the decision problems, where we require a given expected mean-payoff together with zero variance. Here we show that the problems can be all solved in polynomial time.","lang":"eng"}],"citation":{"short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–340.","mla":"Brázdil, Tomáš, et al. “Trading Performance for Stability in Markov Decision Processes.” <i>28th Annual ACM/IEEE Symposium</i>, IEEE, 2013, pp. 331–40, doi:<a href=\"https://doi.org/10.1109/LICS.2013.39\">10.1109/LICS.2013.39</a>.","ista":"Brázdil T, Chatterjee K, Forejt V, Kučera A. 2013. Trading performance for stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 331–340.","apa":"Brázdil, T., Chatterjee, K., Forejt, V., &#38; Kučera, A. (2013). Trading performance for stability in Markov decision processes. In <i>28th Annual ACM/IEEE Symposium</i> (pp. 331–340). New Orleans, LA, United States: IEEE. <a href=\"https://doi.org/10.1109/LICS.2013.39\">https://doi.org/10.1109/LICS.2013.39</a>","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Trading Performance for Stability in Markov Decision Processes.” In <i>28th Annual ACM/IEEE Symposium</i>, 331–40. IEEE, 2013. <a href=\"https://doi.org/10.1109/LICS.2013.39\">https://doi.org/10.1109/LICS.2013.39</a>.","ieee":"T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” in <i>28th Annual ACM/IEEE Symposium</i>, New Orleans, LA, United States, 2013, pp. 331–340.","ama":"Brázdil T, Chatterjee K, Forejt V, Kučera A. Trading performance for stability in Markov decision processes. In: <i>28th Annual ACM/IEEE Symposium</i>. IEEE; 2013:331-340. doi:<a href=\"https://doi.org/10.1109/LICS.2013.39\">10.1109/LICS.2013.39</a>"},"oa_version":"Preprint","month":"08","isi":1,"main_file_link":[{"url":"http://arxiv.org/abs/1305.4103","open_access":"1"}],"external_id":{"isi":["000326815000038"],"arxiv":["1305.4103"]},"date_published":"2013-08-01T00:00:00Z","department":[{"_id":"KrCh"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1294"}]},"author":[{"first_name":"Tomáš","full_name":"Brázdil, Tomáš","last_name":"Brázdil"},{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Forejt, Vojtěch","first_name":"Vojtěch","last_name":"Forejt"},{"last_name":"Kučera","first_name":"Antonín","full_name":"Kučera, Antonín"}],"_id":"2305"},{"volume":50,"publication_identifier":{"isbn":[" 978-3-11-027634-3"],"eisbn":["9-783-1102-7873-6"],"issn":["2191-3587"]},"date_published":"2013-09-13T00:00:00Z","pubrep_id":"725","department":[{"_id":"E-Lib"}],"_id":"2306","author":[{"last_name":"Danowski","orcid":"0000-0002-6026-4409","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick","full_name":"Danowski, Patrick"},{"first_name":"Adrian","full_name":"Pohl, Adrian","last_name":"Pohl"}],"date_created":"2018-12-11T11:56:53Z","language":[{"iso":"ger"}],"file_date_updated":"2020-07-14T12:45:38Z","quality_controlled":"1","oa":1,"year":"2013","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","file":[{"file_id":"4774","file_name":"IST-2017-725-v1+1_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Frontmatter.pdf","content_type":"application/pdf","checksum":"807a408bbee519d792702828a32c6e85","relation":"main_file","access_level":"open_access","file_size":67731,"date_updated":"2020-07-14T12:45:38Z","creator":"system","date_created":"2018-12-12T10:09:49Z"},{"file_id":"4775","file_name":"IST-2017-725-v1+2_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Inhalt.pdf","checksum":"587e95c2ba24307a5a5d5bd1579429d9","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_size":43563,"date_updated":"2020-07-14T12:45:38Z","creator":"system","date_created":"2018-12-12T10:09:50Z"},{"date_created":"2018-12-12T10:09:51Z","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":11318599,"checksum":"dbcada36bb32d725d9838615706e700f","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_id":"4776","file_name":"IST-2017-725-v1+3_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_in_der_Bibliothekswelt__Grundlagen_und_Überblick.pdf"},{"file_size":330210,"date_updated":"2020-07-14T12:45:38Z","creator":"system","date_created":"2018-12-12T10:09:52Z","file_id":"4777","file_name":"IST-2017-725-v1+4_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Vokabulare_für_bibliographische_Daten.pdf","content_type":"application/pdf","checksum":"5235712bf0a49ccc8c2cb4f6c2560d43","relation":"main_file","access_level":"open_access"},{"access_level":"open_access","checksum":"d851cc91f705da80617ac7df33c1c0e1","relation":"main_file","content_type":"application/pdf","file_name":"IST-2017-725-v1+5_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_FRBR,_Serials_und_CIDOC_CRM_-_Modellierung_von_fortlaufenden_Sammelwerken_unter_Verwendung_von_FRBRoo.pdf","file_id":"4778","date_created":"2018-12-12T10:09:53Z","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":10652088},{"relation":"main_file","access_level":"open_access","checksum":"4e77b182692c58e50fc5251bf23cc584","content_type":"application/pdf","file_name":"IST-2017-725-v1+6_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Die_Provenienz_von_Linked_Data.pdf","file_id":"4779","date_created":"2018-12-12T10:09:54Z","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":6125273},{"date_updated":"2020-07-14T12:45:38Z","file_size":1893872,"date_created":"2018-12-12T10:09:55Z","creator":"system","file_name":"IST-2017-725-v1+7_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Forschungsdaten.pdf","file_id":"4780","content_type":"application/pdf","relation":"main_file","access_level":"open_access","checksum":"3debae38064d5099d22f855c353a57ec"},{"date_updated":"2020-07-14T12:45:38Z","file_size":1095929,"date_created":"2018-12-12T10:09:56Z","creator":"system","file_name":"IST-2017-725-v1+8_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Datenanreicherung_auf_LOD-Basis.pdf","file_id":"4781","access_level":"open_access","checksum":"e630b330dc0b7522d2cf204587030252","relation":"main_file","content_type":"application/pdf"},{"creator":"system","date_created":"2018-12-12T10:09:57Z","file_size":149699,"date_updated":"2020-07-14T12:45:38Z","content_type":"application/pdf","relation":"main_file","checksum":"17edda91271bfcce8e1b6e77ca1c9d11","access_level":"open_access","file_name":"IST-2017-725-v1+9_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Herausforderung_Wissensvernetzung.pdf","file_id":"4782"},{"creator":"system","date_created":"2018-12-12T10:09:58Z","file_size":8828405,"date_updated":"2020-07-14T12:45:38Z","checksum":"aacef6734b1de58aeb58024fc47c2373","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4783","file_name":"IST-2017-725-v1+10_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Linked_Open_Data_geht_in_die_Fläche__Der_B3Kat_stellt_seine_Daten_frei.pdf"},{"date_created":"2018-12-12T10:09:59Z","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":3191208,"relation":"main_file","checksum":"0619451f7ff3ea641ce0b10c97831f47","access_level":"open_access","content_type":"application/pdf","file_name":"IST-2017-725-v1+11_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Open_Data_und_Linked_Data_in_einem_Informationssystem_für_die_Archäologie.pdf","file_id":"4784"},{"creator":"system","date_created":"2018-12-12T10:10:00Z","file_size":78315,"date_updated":"2020-07-14T12:45:38Z","checksum":"44dc8a9fc003f0edd912968958715a23","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4785","file_name":"IST-2017-725-v1+12_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Definition__Offenes_Wissen.pdf"},{"date_created":"2018-12-12T10:10:01Z","creator":"system","date_updated":"2020-07-14T12:45:38Z","file_size":90532,"checksum":"48133cecebfd839b77f84f557d530c00","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"4786","file_name":"IST-2017-725-v1+13_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Prinzipien_zu_offenen_bibliographischen_Daten.pdf"},{"content_type":"application/pdf","access_level":"open_access","checksum":"a359224ddfdb178fed72b228dcfb699a","relation":"main_file","file_id":"4787","file_name":"IST-2017-725-v1+14_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Empfehlungen_zur_Öffnung_bibliothekarischer_Daten.pdf","creator":"system","date_created":"2018-12-12T10:10:02Z","file_size":90771,"date_updated":"2020-07-14T12:45:38Z"},{"file_name":"IST-2017-725-v1+15_[9783110278736_-__Open__Linked_Data_in_Bibliotheken]_Glossar.pdf","file_id":"4788","access_level":"open_access","relation":"main_file","checksum":"0d2dd31d537c7a495999149d00eaffbf","content_type":"application/pdf","file_size":1830232,"date_updated":"2020-07-14T12:45:38Z","creator":"system","date_created":"2018-12-12T10:10:03Z"}],"citation":{"ama":"Danowski P, Pohl A. <i>(Open) Linked Data in Bibliotheken</i>. Vol 50. De Gruyter; 2013. doi:<a href=\"https://doi.org/10.1515/9783110278736\">10.1515/9783110278736</a>","ieee":"P. Danowski and A. Pohl, <i>(Open) Linked Data in Bibliotheken</i>, vol. 50. De Gruyter, 2013.","apa":"Danowski, P., &#38; Pohl, A. (2013). <i>(Open) Linked Data in Bibliotheken</i> (Vol. 50). De Gruyter. <a href=\"https://doi.org/10.1515/9783110278736\">https://doi.org/10.1515/9783110278736</a>","mla":"Danowski, Patrick, and Adrian Pohl. <i>(Open) Linked Data in Bibliotheken</i>. Vol. 50, De Gruyter, 2013, doi:<a href=\"https://doi.org/10.1515/9783110278736\">10.1515/9783110278736</a>.","ista":"Danowski P, Pohl A. 2013. (Open) Linked Data in Bibliotheken, De Gruyter,p.","chicago":"Danowski, Patrick, and Adrian Pohl. <i>(Open) Linked Data in Bibliotheken</i>. Vol. 50. De Gruyter, 2013. <a href=\"https://doi.org/10.1515/9783110278736\">https://doi.org/10.1515/9783110278736</a>.","short":"P. Danowski, A. Pohl, (Open) Linked Data in Bibliotheken, De Gruyter, 2013."},"alternative_title":["Bibliotheks- und Informationspraxis"],"abstract":[{"lang":"ger","text":"Das Buch ist sowohl eine Einführung in die Themen Linked Data, Open Data und Open Linked Data als es auch den konkreten Bezug auf Bibliotheken behandelt. Hierzu werden konkrete Anwendungsprojekte beschrieben. Der Band wendet sich dabei sowohl an Personen aus der Bibliothekspraxis als auch an Personen aus dem Bibliotheksmanagement, die noch nicht mit dem Thema vertraut sind."}],"month":"09","date_updated":"2021-12-21T12:17:19Z","ddc":["020"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publist_id":"4621","publisher":"De Gruyter","title":"(Open) Linked Data in Bibliotheken","article_processing_charge":"No","intvolume":"        50","day":"13","status":"public","publication_status":"published","doi":"10.1515/9783110278736","type":"book","has_accepted_license":"1"},{"external_id":{"arxiv":["1209.4046"]},"arxiv":1,"date_published":"2013-01-01T00:00:00Z","date_updated":"2021-01-12T06:56:43Z","title":"Disordered Bose-Einstein condensates with interaction","publisher":"World Scientific Publishing","publist_id":"4612","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","full_name":"Seiringer, Robert"},{"last_name":"Yngvason","full_name":"Yngvason, Jakob","first_name":"Jakob"},{"last_name":"Zagrebnov","first_name":"Valentin","full_name":"Zagrebnov, Valentin"}],"_id":"2315","article_processing_charge":"No","extern":"1","date_created":"2018-12-11T11:56:57Z","publication_status":"published","language":[{"iso":"eng"}],"conference":{"name":"ICMP: International Congress on Mathematical Physics"},"status":"public","year":"2013","oa":1,"doi":"10.1142/9789814449243_0063","citation":{"ama":"Seiringer R, Yngvason J, Zagrebnov V. Disordered Bose-Einstein condensates with interaction. In: World Scientific Publishing; 2013:610-619. doi:<a href=\"https://doi.org/10.1142/9789814449243_0063\">10.1142/9789814449243_0063</a>","ieee":"R. Seiringer, J. Yngvason, and V. Zagrebnov, “Disordered Bose-Einstein condensates with interaction,” presented at the ICMP: International Congress on Mathematical Physics, 2013, pp. 610–619.","apa":"Seiringer, R., Yngvason, J., &#38; Zagrebnov, V. (2013). Disordered Bose-Einstein condensates with interaction (pp. 610–619). Presented at the ICMP: International Congress on Mathematical Physics, World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789814449243_0063\">https://doi.org/10.1142/9789814449243_0063</a>","mla":"Seiringer, Robert, et al. <i>Disordered Bose-Einstein Condensates with Interaction</i>. World Scientific Publishing, 2013, pp. 610–19, doi:<a href=\"https://doi.org/10.1142/9789814449243_0063\">10.1142/9789814449243_0063</a>.","ista":"Seiringer R, Yngvason J, Zagrebnov V. 2013. Disordered Bose-Einstein condensates with interaction. ICMP: International Congress on Mathematical Physics, 610–619.","chicago":"Seiringer, Robert, Jakob Yngvason, and Valentin Zagrebnov. “Disordered Bose-Einstein Condensates with Interaction,” 610–19. World Scientific Publishing, 2013. <a href=\"https://doi.org/10.1142/9789814449243_0063\">https://doi.org/10.1142/9789814449243_0063</a>.","short":"R. Seiringer, J. Yngvason, V. Zagrebnov, in:, World Scientific Publishing, 2013, pp. 610–619."},"abstract":[{"lang":"eng","text":"     We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii regime. We prove that Bose Einstein condensation survives even a strong random potential with a high density of scatterers. The character of the wave function of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers or strong interactions the wave function extends over the whole interval. High density of scatterers and weak interaction, on the other hand, leads to localization of the wave function in a fragmented subset of the interval. "}],"oa_version":"None","page":"610-619","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.4046"}],"type":"conference"},{"type":"conference","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1103.1866"}],"month":"01","page":"57 - 88","abstract":[{"text":"In a recent paper [7] we give the first rigorous derivation of the celebrated Ginzburg-Landau (GL)theory, starting from the microscopic Bardeen- Cooper-Schrieffer (BCS)model. Here we present our results in the simplified case of a one-dimensional system of particles interacting via a δ-potential.","lang":"eng"}],"citation":{"ama":"Frank R, Hainzl C, Seiringer R, Solovej J.  Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. In: Springer; 2013:57-88. doi:<a href=\"https://doi.org/10.1007/978-3-0348-0531-5_3\">10.1007/978-3-0348-0531-5_3</a>","ieee":"R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “ Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction,” presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, 2013, pp. 57–88.","ista":"Frank R, Hainzl C, Seiringer R, Solovej J. 2013.  Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction. OTAMP: Operator Theory, Analysis and Mathematical Physics, 57–88.","apa":"Frank, R., Hainzl, C., Seiringer, R., &#38; Solovej, J. (2013).  Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction (pp. 57–88). Presented at the OTAMP: Operator Theory, Analysis and Mathematical Physics, Springer. <a href=\"https://doi.org/10.1007/978-3-0348-0531-5_3\">https://doi.org/10.1007/978-3-0348-0531-5_3</a>","mla":"Frank, Rupert, et al. <i> Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction</i>. Springer, 2013, pp. 57–88, doi:<a href=\"https://doi.org/10.1007/978-3-0348-0531-5_3\">10.1007/978-3-0348-0531-5_3</a>.","chicago":"Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “ Derivation of Ginzburg-Landau Theory for a One-Dimensional System with Contact Interaction,” 57–88. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-0348-0531-5_3\">https://doi.org/10.1007/978-3-0348-0531-5_3</a>.","short":"R. Frank, C. Hainzl, R. Seiringer, J. Solovej, in:, Springer, 2013, pp. 57–88."},"doi":"10.1007/978-3-0348-0531-5_3","oa":1,"year":"2013","extern":1,"conference":{"name":"OTAMP: Operator Theory, Analysis and Mathematical Physics"},"date_created":"2018-12-11T11:56:58Z","publication_status":"published","status":"public","day":"01","quality_controlled":0,"_id":"2319","author":[{"last_name":"Frank","full_name":"Frank, Rupert L","first_name":"Rupert"},{"full_name":"Hainzl, Christian","first_name":"Christian","last_name":"Hainzl"},{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Robert Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"first_name":"Jan","full_name":"Solovej, Jan P","last_name":"Solovej"}],"publist_id":"4608","title":" Derivation of Ginzburg-Landau theory for a one-dimensional system with contact interaction","publisher":"Springer","date_updated":"2021-01-12T06:56:45Z","date_published":"2013-01-01T00:00:00Z"},{"year":"2013","oa":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:57:00Z","file_date_updated":"2020-07-14T12:45:38Z","quality_controlled":"1","month":"08","oa_version":"Submitted Version","file":[{"file_size":378587,"date_updated":"2020-07-14T12:45:38Z","creator":"system","date_created":"2018-12-12T10:17:45Z","file_name":"IST-2013-129-v1+1_concur.pdf","file_id":"5301","relation":"main_file","checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","access_level":"open_access","content_type":"application/pdf"}],"citation":{"ieee":"T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.","ama":"Henzinger TA, Otop J. From model checking to model measuring. 2013;8052:273-287. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>","short":"T.A. Henzinger, J. Otop, 8052 (2013) 273–287.","chicago":"Henzinger, Thomas A, and Jan Otop. “From Model Checking to Model Measuring.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>.","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287.","apa":"Henzinger, T. A., &#38; Otop, J. (2013). From model checking to model measuring. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentina: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">https://doi.org/10.1007/978-3-642-40184-8_20</a>","mla":"Henzinger, Thomas A., and Jan Otop. <i>From Model Checking to Model Measuring</i>. Vol. 8052, Springer, 2013, pp. 273–87, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_20\">10.1007/978-3-642-40184-8_20</a>."},"abstract":[{"lang":"eng","text":"We define the model-measuring problem: given a model M and specification φ, what is the maximal distance ρ such that all models M′ within distance ρ from M satisfy (or violate) φ. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, quantitative model-checking problems that measure the degree of satisfaction of a specification, and robustness problems that measure how much a model can be perturbed without violating the specification. We show that for automatic distance functions, and ω-regular linear-time and branching-time specifications, the model-measuring problem can be solved. We use automata-theoretic model-checking methods for model measuring, replacing the emptiness question for standard word and tree automata by the optimal-weight question for the weighted versions of these automata. We consider weighted automata that accumulate weights by maximizing, summing, discounting, and limit averaging. We give several examples of using the model-measuring problem to compute various notions of robustness and quantitative satisfaction for temporal specifications."}],"alternative_title":["LNCS"],"date_published":"2013-08-01T00:00:00Z","pubrep_id":"129","department":[{"_id":"ToHe"}],"volume":8052,"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan","last_name":"Otop"}],"_id":"2327","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5417"}]},"doi":"10.1007/978-3-642-40184-8_20","status":"public","publication_status":"published","day":"01","conference":{"end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","location":"Buenos Aires, Argentina"},"type":"conference","has_accepted_license":"1","scopus_import":"1","page":"273 - 287","series_title":"Lecture Notes in Computer Science","date_updated":"2024-10-21T06:02:58Z","ddc":["005","000"],"intvolume":"      8052","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4599","publisher":"Springer","corr_author":"1","title":"From model checking to model measuring"}]