[{"conference":{"location":"New Orleans, LA, United States","end_date":"2013-09-28","name":"CSF: Computer Security Foundations","start_date":"2013-09-26"},"_id":"2291","quality_controlled":"1","publication_status":"published","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.","short":"A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.","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>","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>.","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>."},"date_created":"2018-12-11T11:56:48Z","type":"conference","oa_version":"Submitted Version","oa":1,"publisher":"IEEE","title":"Cryptographically enforced RBAC","department":[{"_id":"KrPi"}],"year":"2013","month":"09","publist_id":"4637","page":"115 - 129","scopus_import":1,"date_published":"2013-09-01T00:00:00Z","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"}],"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2013/492"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:34Z","day":"01","author":[{"last_name":"Ferrara","full_name":"Ferrara, Anna","first_name":"Anna"},{"full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Warinschi","full_name":"Warinschi, Bogdan","first_name":"Bogdan"}],"status":"public","doi":"10.1109/CSF.2013.15"},{"month":"08","year":"2013","page":"VI - 854","publist_id":"4636","publication_identifier":{"isbn":["978-3-642-40312-5"]},"title":"Mathematical Foundations of Computer Science 2013","department":[{"_id":"KrCh"}],"publisher":"Springer","conference":{"end_date":"2013-08-30","location":"Klosterneuburg, Austria","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2013-08-26"},"_id":"2292","quality_controlled":"1","publication_status":"published","alternative_title":["LNCS"],"citation":{"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>.","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>","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>.","ieee":"K. Chatterjee and J. Sgall, Eds., <i>Mathematical Foundations of Computer Science 2013</i>, vol. 8087. Springer, 2013, p. VI-854.","short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","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>"},"date_created":"2018-12-11T11:56:48Z","oa_version":"None","type":"conference_editor","doi":"10.1007/978-3-642-40313-2","status":"public","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":8087,"date_updated":"2020-08-11T10:09:45Z","series_title":"Lecture Notes in Computer Science","day":"08","scopus_import":1,"date_published":"2013-08-08T00:00:00Z","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."}],"intvolume":"      8087","editor":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Jiri","last_name":"Sgall","full_name":"Sgall, Jiri"}]},{"publist_id":"4635","project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425"}],"page":"825 - 832","year":"2013","month":"12","department":[{"_id":"ChLa"}],"title":"Learning to rank using privileged information","publisher":"IEEE","oa":1,"oa_version":"Submitted Version","type":"conference","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>.","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>","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>.","short":"V. Sharmanska, N. Quadrianto, C. Lampert, in:, IEEE, 2013, pp. 825–832.","ista":"Sharmanska V, Quadrianto N, Lampert C. 2013. Learning to rank using privileged information. ICCV: International Conference on Computer Vision, 825–832.","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.","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>"},"date_created":"2018-12-11T11:56:49Z","quality_controlled":"1","publication_status":"published","conference":{"end_date":"2013-12-08","location":"Sydney, Australia","start_date":"2013-12-01","name":"ICCV: International Conference on Computer Vision"},"_id":"2293","doi":"10.1109/ICCV.2013.107","status":"public","author":[{"orcid":"0000-0003-0192-9308","last_name":"Sharmanska","full_name":"Sharmanska, Viktoriia","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87","first_name":"Viktoriia"},{"first_name":"Novi","full_name":"Quadrianto, Novi","last_name":"Quadrianto"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"ec_funded":1,"day":"01","date_updated":"2023-02-23T10:36:41Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"www.cv-foundation.org/openaccess/content_iccv_2013/papers/Sharmanska_Learning_to_Rank_2013_ICCV_paper.pdf"}],"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."}],"scopus_import":1,"date_published":"2013-12-01T00:00:00Z"},{"publisher":"IEEE","oa":1,"type":"conference","oa_version":"Submitted Version","citation":{"ieee":"T. Kazmar, E. Kvon, A. Stark, and C. Lampert, “Drosophila Embryo Stage Annotation using Label Propagation,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013.","ista":"Kazmar T, Kvon E, Stark A, Lampert C. 2013. Drosophila Embryo Stage Annotation using Label Propagation. ICCV: International Conference on Computer Vision.","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>","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>","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>."},"date_created":"2018-12-11T11:56:49Z","publication_status":"published","quality_controlled":"1","conference":{"end_date":"2013-12-08","location":"Sydney, Australia","name":"ICCV: International Conference on Computer Vision","start_date":"2013-12-01"},"_id":"2294","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036"}],"publist_id":"4634","year":"2013","month":"12","department":[{"_id":"ChLa"}],"title":"Drosophila Embryo Stage Annotation using Label Propagation","day":"01","date_updated":"2021-01-12T06:56:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/ICCV2013.py"}],"abstract":[{"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.","lang":"eng"}],"date_published":"2013-12-01T00:00:00Z","scopus_import":1,"doi":"10.1109/ICCV.2013.139","status":"public","author":[{"first_name":"Tomas","full_name":"Kazmar, Tomas","last_name":"Kazmar"},{"first_name":"Evgeny","last_name":"Kvon","full_name":"Kvon, Evgeny"},{"first_name":"Alexander","full_name":"Stark, Alexander","last_name":"Stark"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"}],"ec_funded":1},{"citation":{"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>","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>.","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>.","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>","ista":"Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.","short":"K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.","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."},"date_created":"2018-12-11T11:56:50Z","conference":{"start_date":"2013-09-02","name":"CSL: Computer Science Logic","location":"Torino, Italy","end_date":"2013-09-05"},"quality_controlled":"1","oa":1,"title":"What is decidable about partially observable Markov decision processes with omega-regular objectives","page":"165 - 180","publist_id":"4633","intvolume":"        23","has_accepted_license":"1","date_published":"2013-08-27T00:00:00Z","volume":23,"day":"27","ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.4230/LIPIcs.CSL.2013.165","file_date_updated":"2020-07-14T12:45:37Z","ddc":["000"],"file":[{"relation":"main_file","file_id":"4766","creator":"system","file_name":"IST-2017-756-v1+1_2.pdf","date_created":"2018-12-12T10:09:42Z","checksum":"ba2828322955574d9283bea0e17a37a6","file_size":345171,"date_updated":"2020-07-14T12:45:37Z","access_level":"open_access","content_type":"application/pdf"}],"type":"conference","oa_version":"Published Version","_id":"2295","publication_status":"published","alternative_title":["LIPIcs"],"pubrep_id":"756","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"year":"2013","month":"08","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"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"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1477"},{"status":"public","relation":"earlier_version","id":"5400"}]},"scopus_import":1,"date_updated":"2023-02-23T12:24:38Z","series_title":"Leibniz International Proceedings in Informatics","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin"},{"first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87","last_name":"Tracol","full_name":"Tracol, Mathieu"}],"status":"public"},{"publisher":"Springer","publication_status":"published","external_id":{"arxiv":["0908.3686"]},"issue":"2","_id":"2297","oa_version":"Preprint","type":"journal_article","year":"2013","month":"09","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:56:36Z","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/0908.3686","open_access":"1"}],"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."}],"status":"public","author":[{"last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"arxiv":1,"quality_controlled":"1","citation":{"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>.","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>","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>.","short":"R. Seiringer, Japanese Journal of Mathematics 8 (2013) 185–232.","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.","ista":"Seiringer R. 2013. Hot topics in cold gases: A mathematical physics perspective. Japanese Journal of Mathematics. 8(2), 185–232.","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>"},"date_created":"2018-12-11T11:56:50Z","page":"185 - 232","publist_id":"4631","title":"Hot topics in cold gases: A mathematical physics perspective","publication":"Japanese Journal of Mathematics","day":"24","volume":8,"date_published":"2013-09-24T00:00:00Z","intvolume":"         8","doi":"10.1007/s11537-013-1264-5"},{"day":"01","volume":7935,"date_published":"2013-01-01T00:00:00Z","intvolume":"      7935","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:37Z","doi":"10.1007/978-3-642-38856-9_10","ec_funded":1,"oa":1,"quality_controlled":"1","conference":{"start_date":"2013-06-20","name":"SAS: Static Analysis Symposium","location":"Seattle, WA, United States","end_date":"2013-06-22"},"citation":{"short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","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.","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 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>","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>.","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>.","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>"},"date_created":"2018-12-11T11:56:50Z","publist_id":"4630","page":"150 - 171","title":"Local shape analysis for overlaid data structures","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:56:36Z","scopus_import":1,"abstract":[{"lang":"eng","text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n"}],"status":"public","author":[{"full_name":"Dragoi, Cezara","last_name":"Dragoi","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Constantin","full_name":"Enea, Constantin","last_name":"Enea"},{"first_name":"Mihaela","last_name":"Sighireanu","full_name":"Sighireanu, Mihaela"}],"publisher":"Springer","pubrep_id":"196","alternative_title":["LNCS"],"publication_status":"published","_id":"2298","oa_version":"Submitted Version","type":"conference","ddc":["000","004"],"file":[{"date_created":"2018-12-12T10:10:36Z","checksum":"907edd33a5892e3af093365f1fd57ed7","file_size":299004,"date_updated":"2020-07-14T12:45:37Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"4824","creator":"system","file_name":"IST-2014-196-v1+1_sas13.pdf"}],"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"year":"2013","month":"01","department":[{"_id":"ToHe"}]},{"abstract":[{"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.","lang":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T06:56:37Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Godhal","full_name":"Godhal, Yashdeep","first_name":"Yashdeep","id":"5B547124-EB61-11E9-8887-89D9C04DBDF5"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"status":"public","file":[{"file_name":"IST-2012-87-v1+1_Synthesis_of_AMBA_AHB_from_formal_specifications-_A_case_study.pdf","relation":"main_file","file_id":"4910","creator":"system","date_updated":"2020-07-14T12:45:37Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:11:53Z","file_size":277372,"checksum":"57b06a732dd8d6349190dba6b5b0d33b"}],"type":"journal_article","ddc":["000"],"oa_version":"Submitted Version","issue":"5-6","_id":"2299","publication_status":"published","pubrep_id":"87","publisher":"Springer","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"10","year":"2013","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","intvolume":"        15","date_published":"2013-10-01T00:00:00Z","volume":15,"publication":"International Journal on Software Tools for Technology Transfer","day":"01","doi":"10.1007/s10009-011-0207-9","file_date_updated":"2020-07-14T12:45:37Z","date_created":"2018-12-11T11:56:51Z","citation":{"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.","short":"Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.","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>","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>.","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>."},"quality_controlled":"1","oa":1,"title":"Synthesis of AMBA AHB from formal specification: A case study","publist_id":"4629","page":"585 - 601"},{"title":"Realization of stripes and slabs in two and three dimensions","publist_id":"4627","arxiv":1,"quality_controlled":"1","citation":{"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.","short":"A. Giuliani, É. Lieb, R. Seiringer, Physical Review B 88 (2013).","ista":"Giuliani A, Lieb É, Seiringer R. 2013. Realization of stripes and slabs in two and three dimensions. Physical Review B. 88(6), 064401.","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>","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>.","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>.","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>"},"date_created":"2018-12-11T11:56:51Z","article_number":"064401","oa":1,"doi":"10.1103/PhysRevB.88.064401","date_published":"2013-08-01T00:00:00Z","intvolume":"        88","volume":88,"publication":"Physical Review B","day":"01","department":[{"_id":"RoSe"}],"year":"2013","month":"08","_id":"2300","issue":"6","publication_status":"published","external_id":{"arxiv":["1305.5323"]},"type":"journal_article","oa_version":"Preprint","publisher":"American Physical Society","author":[{"first_name":"Alessandro","full_name":"Giuliani, Alessandro","last_name":"Giuliani"},{"first_name":"Élliott","full_name":"Lieb, Élliott","last_name":"Lieb"},{"full_name":"Seiringer, Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"status":"public","scopus_import":1,"abstract":[{"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.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1305.5323"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:56:38Z"},{"type":"conference","oa_version":"None","date_created":"2018-12-11T11:56:52Z","citation":{"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>.","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>.","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.","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.","ista":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. 2013. P: Safe asynchronous event-driven programming. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. PLDI: Programming Languages Design and Implementation, 321–331.","ama":"Desai A, Gupta V, Jackson E, Qadeer S, Rajamani S, Zufferey D. P: Safe asynchronous event-driven programming. In: <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>"},"publication_status":"published","quality_controlled":"1","_id":"2301","conference":{"end_date":"2013-06-19","location":"Seattle, WA, United States","name":"PLDI: Programming Languages Design and Implementation","start_date":"2013-06-16"},"publisher":"ACM","department":[{"_id":"ToHe"}],"title":"P: Safe asynchronous event-driven programming","publist_id":"4626","page":"321 - 331","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"month":"06","year":"2013","main_file_link":[{"url":"http://research.microsoft.com/pubs/191069/pldi212_desai.pdf"}],"abstract":[{"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.","lang":"eng"}],"date_published":"2013-06-01T00:00:00Z","scopus_import":1,"publication":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","day":"01","date_updated":"2021-01-12T06:56:38Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"status":"public","author":[{"first_name":"Ankush","full_name":"Desai, Ankush","last_name":"Desai"},{"first_name":"Vivek","last_name":"Gupta","full_name":"Gupta, Vivek"},{"first_name":"Ethan","last_name":"Jackson","full_name":"Jackson, Ethan"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"last_name":"Rajamani","full_name":"Rajamani, Sriram","first_name":"Sriram"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey"}],"ec_funded":1,"doi":"10.1145/2491956.2462184"},{"status":"public","author":[{"first_name":"Simon","id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"}],"doi":"10.1007/s11515-013-1279-6","date_published":"2013-09-03T00:00:00Z","scopus_import":1,"intvolume":"         8","abstract":[{"lang":"eng","text":"MADM (Mosaic Analysis with Double Markers) technology offers a genetic approach in mice to visualize and concomitantly manipulate genetically defined cells at clonal level and single cell resolution. MADM employs Cre recombinase/loxP-dependent interchromosomal mitotic recombination to reconstitute two split marker genes—green GFP and red tdTomato—and can label sparse clones of homozygous mutant cells in one color and wild-type cells in the other color in an otherwise unlabeled background. At present, major MADM applications include lineage tracing, single cell labeling, conditional knockouts in small populations of cells and induction of uniparental chromosome disomy to assess effects of genomic imprinting. MADM can be applied universally in the mouse with the sole limitation being the specificity of the promoter controlling Cre recombinase expression. Here I review recent developments and extensions of the MADM technique and give an overview of the major discoveries and progresses enabled by the implementation of the novel genetic MADM tools."}],"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by IST Austria institutional funds.","day":"03","publication":"Frontiers in Biology","date_updated":"2021-01-12T06:56:39Z","volume":8,"article_type":"review","department":[{"_id":"SiHi"}],"title":"Dissection of gene function at clonal level using mosaic analysis with double markers","page":"557 - 568","publist_id":"4624","month":"09","year":"2013","publication_status":"published","quality_controlled":"1","_id":"2303","issue":"6","type":"journal_article","oa_version":"None","citation":{"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>","short":"S. Hippenmeyer, Frontiers in Biology 8 (2013) 557–568.","ista":"Hippenmeyer S. 2013. Dissection of gene function at clonal level using mosaic analysis with double markers. Frontiers in Biology. 8(6), 557–568.","ieee":"S. Hippenmeyer, “Dissection of gene function at clonal level using mosaic analysis with double markers,” <i>Frontiers in Biology</i>, vol. 8, no. 6. Springer, pp. 557–568, 2013.","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>.","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>","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>."},"date_created":"2018-12-11T11:56:52Z","publisher":"Springer"},{"scopus_import":1,"date_published":"2013-09-05T00:00:00Z","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"}],"intvolume":"        43","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":43,"date_updated":"2021-01-12T06:56:39Z","acknowledgement":"This research is supported by the Graduate school of IST Austria (Institute of Science and Technology Austria).","publication":"Electronic Notes in Discrete Mathematics","day":"05","author":[{"last_name":"Pausinger","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian"}],"status":"public","doi":"10.1016/j.endm.2013.07.008","_id":"2304","publication_status":"published","quality_controlled":"1","date_created":"2018-12-11T11:56:53Z","citation":{"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>.","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>","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>.","ista":"Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.","ieee":"F. Pausinger, “Van der Corput sequences and linear permutations,” <i>Electronic Notes in Discrete Mathematics</i>, vol. 43. Elsevier, pp. 43–50, 2013.","short":"F. Pausinger, Electronic Notes in Discrete Mathematics 43 (2013) 43–50.","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>"},"type":"journal_article","oa_version":"None","publisher":"Elsevier","title":"Van der Corput sequences and linear permutations","department":[{"_id":"HeEd"}],"month":"09","year":"2013","page":"43 - 50","publist_id":"4623"},{"date_updated":"2023-09-20T11:15:30Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"1294","status":"public","relation":"later_version"}]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1305.4103"}],"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"}],"scopus_import":1,"status":"public","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Forejt, Vojtěch","last_name":"Forejt","first_name":"Vojtěch"},{"first_name":"Antonín","full_name":"Kučera, Antonín","last_name":"Kučera"}],"publisher":"IEEE","oa_version":"Preprint","type":"conference","external_id":{"arxiv":["1305.4103"]},"publication_status":"published","_id":"2305","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"month":"08","year":"2013","department":[{"_id":"KrCh"}],"publication":"28th Annual ACM/IEEE Symposium","day":"01","date_published":"2013-08-01T00:00:00Z","doi":"10.1109/LICS.2013.39","ec_funded":1,"oa":1,"date_created":"2018-12-11T11:56:53Z","citation":{"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>.","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>.","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>","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.","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.","short":"T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, in:, 28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–340."},"quality_controlled":"1","arxiv":1,"conference":{"name":"LICS: Logic in Computer Science","start_date":"2013-06-25","location":"New Orleans, LA, United States","end_date":"2013-06-28"},"publist_id":"4622","page":"331 - 340","title":"Trading performance for stability in Markov decision processes"},{"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","last_name":"Otop","full_name":"Otop, Jan"}],"status":"public","abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"id":"5417","relation":"earlier_version","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2023-02-23T12:25:26Z","department":[{"_id":"ToHe"}],"year":"2013","month":"08","_id":"2327","alternative_title":["LNCS"],"publication_status":"published","ddc":["005","000"],"file":[{"checksum":"4c04695c4bfdf2119cd4f5d1babc3e8a","file_size":378587,"date_created":"2018-12-12T10:17:45Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:38Z","creator":"system","file_id":"5301","relation":"main_file","file_name":"IST-2013-129-v1+1_concur.pdf"}],"oa_version":"Submitted Version","type":"conference","pubrep_id":"129","publisher":"Springer","file_date_updated":"2020-07-14T12:45:38Z","doi":"10.1007/978-3-642-40184-8_20","date_published":"2013-08-01T00:00:00Z","has_accepted_license":"1","intvolume":"      8052","volume":8052,"day":"01","title":"From model checking to model measuring","publist_id":"4599","page":"273 - 287","conference":{"name":"CONCUR: Concurrency Theory","start_date":"2013-08-27","location":"Buenos Aires, Argentina","end_date":"2013-08-30"},"quality_controlled":"1","date_created":"2018-12-11T11:57:00Z","citation":{"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>","ista":"Henzinger TA, Otop J. 2013. From model checking to model measuring. 8052, 273–287.","ieee":"T. A. Henzinger and J. Otop, “From model checking to model measuring,” vol. 8052. Springer, pp. 273–287, 2013.","short":"T.A. Henzinger, J. Otop, 8052 (2013) 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>","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>.","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>."},"oa":1},{"volume":8052,"day":"01","intvolume":"      8052","has_accepted_license":"1","date_published":"2013-08-01T00:00:00Z","doi":"10.1007/978-3-642-40184-8_18","file_date_updated":"2020-07-14T12:45:39Z","ec_funded":1,"oa":1,"citation":{"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>.","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>","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>.","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>","ieee":"T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.","ista":"Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.","short":"T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256."},"date_created":"2018-12-11T11:57:01Z","conference":{"end_date":"2013-08-30","location":"Buenos Aires, Argentina","start_date":"2013-08-27","name":"CONCUR: Concurrency Theory"},"quality_controlled":"1","publist_id":"4598","page":"242 - 256","title":"Aspect-oriented linearizability proofs","series_title":"Lecture Notes in Computer Science","date_updated":"2023-02-23T10:16:27Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on identifying the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates.\r\nIn response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof."}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"1832"}]},"scopus_import":1,"author":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Sezgin, Ali","last_name":"Sezgin","first_name":"Ali","id":"4C7638DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor","first_name":"Viktor"}],"status":"public","pubrep_id":"197","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Submitted Version","type":"conference","file":[{"relation":"main_file","creator":"system","file_id":"4721","file_name":"IST-2014-197-v1+1_main-queue-verification.pdf","date_created":"2018-12-12T10:08:58Z","file_size":337059,"checksum":"bdbb520de91751fe0136309ad4ef67e4","date_updated":"2020-07-14T12:45:39Z","content_type":"application/pdf","access_level":"open_access"}],"ddc":["000","004"],"_id":"2328","alternative_title":["LNCS"],"publication_status":"published","month":"08","year":"2013","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"}],"department":[{"_id":"ToHe"}]},{"ec_funded":1,"doi":"10.1007/978-3-642-40184-8_35","intvolume":"      8052","date_published":"2013-08-01T00:00:00Z","volume":8052,"day":"01","title":"Hyperplane separation technique for multidimensional mean-payoff games","publist_id":"4597","page":"500 - 515","date_created":"2018-12-11T11:57:01Z","citation":{"short":"K. Chatterjee, Y. Velner, 8052 (2013) 500–515.","ista":"Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional mean-payoff games. 8052, 500–515.","ieee":"K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.","ama":"Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. 2013;8052:500-515. doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">10.1007/978-3-642-40184-8_35</a>","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">https://doi.org/10.1007/978-3-642-40184-8_35</a>.","apa":"Chatterjee, K., &#38; Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">https://doi.org/10.1007/978-3-642-40184-8_35</a>","mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Hyperplane Separation Technique for Multidimensional Mean-Payoff Games</i>. Vol. 8052, Springer, 2013, pp. 500–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-40184-8_35\">10.1007/978-3-642-40184-8_35</a>."},"conference":{"location":"Buenos Aires, Argentinia","end_date":"2013-08-30","name":"CONCUR: Concurrency Theory","start_date":"2013-08-27"},"arxiv":1,"quality_controlled":"1","oa":1,"author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"status":"public","abstract":[{"text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work, we consider both finite-state game graphs, and recursive game graphs (or pushdown game graphs) that model the control flow of sequential programs with recursion. The objectives we study are multidimensional mean-payoff objectives, where the goal of player 1 is to ensure that the mean-payoff is non-negative in all dimensions. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation. Our main contributions are as follows: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of the weights are fixed; whereas if the number of dimensions is arbitrary, then the problem is known to be coNP-complete. (2) We show that pushdown graphs with multidimensional mean-payoff objectives can be solved in polynomial time. For both (1) and (2) our algorithms are based on hyperplane separation technique. (3) For pushdown games under global strategies both one and multidimensional mean-payoff objectives problems are known to be undecidable, and we show that under modular strategies the multidimensional problem is also undecidable; under modular strategies the one-dimensional problem is NP-complete. We show that if the number of modules, the number of exits, and the maximal absolute value of the weights are fixed, then pushdown games under modular strategies with one-dimensional mean-payoff objectives can be solved in polynomial time, and if either the number of exits or the number of modules is unbounded, then the problem is NP-hard. (4) Finally we show that a fixed parameter tractable algorithm for finite-state multidimensional mean-payoff games or pushdown games under modular strategies with one-dimensional mean-payoff objectives would imply the fixed parameter tractability of parity games.","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1210.3141","open_access":"1"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"717"}]},"scopus_import":1,"date_updated":"2023-02-23T13:00:42Z","series_title":"Lecture Notes in Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"month":"08","year":"2013","project":[{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa_version":"Preprint","type":"conference","_id":"2329","publication_status":"published","external_id":{"arxiv":["1210.3141"]},"alternative_title":["LNCS"],"publisher":"Springer"},{"volume":1,"publication":"Genome Announcements","day":"13","date_published":"2013-06-13T00:00:00Z","has_accepted_license":"1","intvolume":"         1","file_date_updated":"2020-07-14T12:45:40Z","doi":"10.1128/genomeA.00216-13","oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:57:30Z","citation":{"mla":"Fernandes Redondo, Rodrigo A., et al. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” <i>Genome Announcements</i>, vol. 1, no. 3, American Society for Microbiology, 2013, doi:<a href=\"https://doi.org/10.1128/genomeA.00216-13\">10.1128/genomeA.00216-13</a>.","apa":"Fernandes Redondo, R. A., Kupczok, A., Stift, G., &#38; Bollback, J. P. (2013). Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. <i>Genome Announcements</i>. American Society for Microbiology. <a href=\"https://doi.org/10.1128/genomeA.00216-13\">https://doi.org/10.1128/genomeA.00216-13</a>","chicago":"Fernandes Redondo, Rodrigo A, Anne Kupczok, Gertraud Stift, and Jonathan P Bollback. “Complete Genome Sequence of the Novel Phage MG-B1 Infecting Bacillus Weihenstephanensis.” <i>Genome Announcements</i>. American Society for Microbiology, 2013. <a href=\"https://doi.org/10.1128/genomeA.00216-13\">https://doi.org/10.1128/genomeA.00216-13</a>.","ama":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. <i>Genome Announcements</i>. 2013;1(3). doi:<a href=\"https://doi.org/10.1128/genomeA.00216-13\">10.1128/genomeA.00216-13</a>","ista":"Fernandes Redondo RA, Kupczok A, Stift G, Bollback JP. 2013. Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis. Genome Announcements. 1(3).","short":"R.A. Fernandes Redondo, A. Kupczok, G. Stift, J.P. Bollback, Genome Announcements 1 (2013).","ieee":"R. A. Fernandes Redondo, A. Kupczok, G. Stift, and J. P. Bollback, “Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis,” <i>Genome Announcements</i>, vol. 1, no. 3. American Society for Microbiology, 2013."},"publist_id":"4516","title":"Complete genome sequence of the novel phage MG-B1 infecting bacillus weihenstephanensis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:57:19Z","scopus_import":1,"abstract":[{"text":"Here, we describe a novel virulent bacteriophage that infects Bacillus weihenstephanensis, isolated from soil in Austria. It is the first phage to be discovered that infects this species. Here, we present the complete genome sequence of this podovirus. ","lang":"eng"}],"author":[{"orcid":"0000-0002-5837-2793","last_name":"Fernandes Redondo","full_name":"Fernandes Redondo, Rodrigo A","id":"409D5C96-F248-11E8-B48F-1D18A9856A87","first_name":"Rodrigo A"},{"first_name":"Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","full_name":"Kupczok, Anne","last_name":"Kupczok"},{"first_name":"Gertraud","id":"2DB195CA-F248-11E8-B48F-1D18A9856A87","last_name":"Stift","full_name":"Stift, Gertraud"},{"orcid":"0000-0002-4624-4612","full_name":"Bollback, Jonathan P","last_name":"Bollback","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","first_name":"Jonathan P"}],"status":"public","pubrep_id":"398","publisher":"American Society for Microbiology","issue":"3","_id":"2410","publication_status":"published","file":[{"date_updated":"2020-07-14T12:45:40Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:17:36Z","checksum":"0751ec74b695567e0cdf02aaf9c26829","file_size":130026,"file_name":"IST-2015-398-v1+1_Genome_Announc.-2013-Redondo-.pdf","relation":"main_file","creator":"system","file_id":"5291"}],"type":"journal_article","ddc":["576"],"oa_version":"Published Version","year":"2013","month":"06","department":[{"_id":"JoBo"},{"_id":"LifeSc"}]},{"oa":1,"date_created":"2018-12-11T11:57:31Z","citation":{"apa":"Kupczok, A., &#38; Bollback, J. P. (2013). Probabilistic models for CRISPR spacer content evolution . <i>BMC Evolutionary Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2148-13-54\">https://doi.org/10.1186/1471-2148-13-54</a>","chicago":"Kupczok, Anne, and Jonathan P Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” <i>BMC Evolutionary Biology</i>. BioMed Central, 2013. <a href=\"https://doi.org/10.1186/1471-2148-13-54\">https://doi.org/10.1186/1471-2148-13-54</a>.","mla":"Kupczok, Anne, and Jonathan P. Bollback. “Probabilistic Models for CRISPR Spacer Content Evolution .” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1, BioMed Central, 2013, pp. 54–54, doi:<a href=\"https://doi.org/10.1186/1471-2148-13-54\">10.1186/1471-2148-13-54</a>.","ama":"Kupczok A, Bollback JP. Probabilistic models for CRISPR spacer content evolution . <i>BMC Evolutionary Biology</i>. 2013;13(1):54-54. doi:<a href=\"https://doi.org/10.1186/1471-2148-13-54\">10.1186/1471-2148-13-54</a>","ieee":"A. Kupczok and J. P. Bollback, “Probabilistic models for CRISPR spacer content evolution ,” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1. BioMed Central, pp. 54–54, 2013.","ista":"Kupczok A, Bollback JP. 2013. Probabilistic models for CRISPR spacer content evolution . BMC Evolutionary Biology. 13(1), 54–54.","short":"A. Kupczok, J.P. Bollback, BMC Evolutionary Biology 13 (2013) 54–54."},"quality_controlled":"1","publist_id":"4514","page":"54 - 54","title":"Probabilistic models for CRISPR spacer content evolution ","day":"26","publication":"BMC Evolutionary Biology","volume":13,"intvolume":"        13","has_accepted_license":"1","date_published":"2013-02-26T00:00:00Z","doi":"10.1186/1471-2148-13-54","file_date_updated":"2020-07-14T12:45:40Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publisher":"BioMed Central","pubrep_id":"397","ddc":["576"],"type":"journal_article","oa_version":"Published Version","file":[{"relation":"main_file","creator":"system","file_id":"5268","file_name":"IST-2015-397-v1+1_1471-2148-13-54.pdf","date_created":"2018-12-12T10:17:15Z","file_size":518729,"checksum":"029c7e0b198c19312b66ecce3cabb22f","date_updated":"2020-07-14T12:45:40Z","content_type":"application/pdf","access_level":"open_access"}],"publication_status":"published","_id":"2412","issue":"1","month":"02","year":"2013","department":[{"_id":"JoBo"}],"date_updated":"2021-01-12T06:57:20Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Background: The CRISPR/Cas system is known to act as an adaptive and heritable immune system in Eubacteria and Archaea. Immunity is encoded in an array of spacer sequences. Each spacer can provide specific immunity to invasive elements that carry the same or a similar sequence. Even in closely related strains, spacer content is very dynamic and evolves quickly. Standard models of nucleotide evolutioncannot be applied to quantify its rate of change since processes other than single nucleotide changes determine its evolution.Methods We present probabilistic models that are specific for spacer content evolution. They account for the different processes of insertion and deletion. Insertions can be constrained to occur on one end only or are allowed to occur throughout the array. One deletion event can affect one spacer or a whole fragment of adjacent spacers. Parameters of the underlying models are estimated for a pair of arrays by maximum likelihood using explicit ancestor enumeration.Results Simulations show that parameters are well estimated on average under the models presented here. There is a bias in the rate estimation when including fragment deletions. The models also estimate times between pairs of strains. But with increasing time, spacer overlap goes to zero, and thus there is an upper bound on the distance that can be estimated. Spacer content similarities are displayed in a distance based phylogeny using the estimated times.We use the presented models to analyze different Yersinia pestis data sets and find that the results among them are largely congruent. The models also capture the variation in diversity of spacers among the data sets. A comparison of spacer-based phylogenies and Cas gene phylogenies shows that they resolve very different time scales for this data set.Conclusions The simulations and data analyses show that the presented models are useful for quantifying spacer content evolution and for displaying spacer content similarities of closely related strains in a phylogeny. This allows for comparisons of different CRISPR arrays or for comparisons between CRISPR arrays and nucleotide substitution rates."}],"scopus_import":1,"status":"public","author":[{"last_name":"Kupczok","full_name":"Kupczok, Anne","id":"2BB22BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Anne"},{"first_name":"Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","last_name":"Bollback","full_name":"Bollback, Jonathan P","orcid":"0000-0002-4624-4612"}]},{"day":"01","publication":"Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain","date_updated":"2021-01-12T06:57:20Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"editor":[{"last_name":"Meyer","full_name":"Meyer, Misha","first_name":"Misha"},{"first_name":"Z.","last_name":"Pesenson","full_name":"Pesenson, Z."}],"abstract":[{"lang":"eng","text":"Progress in understanding the global brain dynamics has remained slow to date in large part because of the highly multiscale nature of brain activity. Indeed, normal brain dynamics is characterized by complex interactions between multiple levels: from the microscopic scale of single neurons to the mesoscopic level of local groups of neurons, and finally to the macroscopic level of the whole brain. Among the most difficult tasks are those of identifying which scales are significant for a given particular function and describing how the scales affect each other. It is important to realize that the scales of time and space are linked together, or even intertwined, and that causal inference is far more ambiguous between than within levels. We approach this problem from the perspective of our recent work on simultaneous recording from micro- and macroelectrodes in the human brain. We propose a physiological description of these multilevel interactions, based on phase–amplitude coupling of neuronal oscillations that operate at multiple frequencies and on different spatial scales. Specifically, the amplitude of the oscillations on a particular spatial scale is modulated by phasic variations in neuronal excitability induced by lower frequency oscillations that emerge on a larger spatial scale. Following this general principle, it is possible to scale up or scale down the multiscale brain dynamics. It is expected that large-scale network oscillations in the low-frequency range, mediating downward effects, may play an important role in attention and consciousness."}],"date_published":"2013-08-01T00:00:00Z","scopus_import":1,"doi":"10.1002/9783527671632.ch08","status":"public","author":[{"last_name":"Valderrama","full_name":"Valderrama, Mario","first_name":"Mario"},{"last_name":"Botella Soler","full_name":"Botella Soler, Vicente","orcid":"0000-0002-8790-1914","first_name":"Vicente","id":"421234E8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Le Van Quyen, Michel","last_name":"Le Van Quyen","first_name":"Michel"}],"publisher":"Wiley-VCH","oa_version":"None","type":"book_chapter","date_created":"2018-12-11T11:57:31Z","citation":{"short":"M. Valderrama, V. Botella Soler, M. Le Van Quyen, in:, M. Meyer, Z. Pesenson (Eds.), Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain, Wiley-VCH, 2013.","ieee":"M. Valderrama, V. Botella Soler, and M. Le Van Quyen, “Neuronal oscillations scale up and scale down the brain dynamics ,” in <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>, M. Meyer and Z. Pesenson, Eds. Wiley-VCH, 2013.","ista":"Valderrama M, Botella Soler V, Le Van Quyen M. 2013.Neuronal oscillations scale up and scale down the brain dynamics . In: Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain. Reviews of Nonlinear Dynamics and Complexity, .","ama":"Valderrama M, Botella Soler V, Le Van Quyen M. Neuronal oscillations scale up and scale down the brain dynamics . In: Meyer M, Pesenson Z, eds. <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>. Wiley-VCH; 2013. doi:<a href=\"https://doi.org/10.1002/9783527671632.ch08\">10.1002/9783527671632.ch08</a>","mla":"Valderrama, Mario, et al. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>, edited by Misha Meyer and Z. Pesenson, Wiley-VCH, 2013, doi:<a href=\"https://doi.org/10.1002/9783527671632.ch08\">10.1002/9783527671632.ch08</a>.","chicago":"Valderrama, Mario, Vicente Botella Soler, and Michel Le Van Quyen. “Neuronal Oscillations Scale up and Scale down the Brain Dynamics .” In <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>, edited by Misha Meyer and Z. Pesenson. Wiley-VCH, 2013. <a href=\"https://doi.org/10.1002/9783527671632.ch08\">https://doi.org/10.1002/9783527671632.ch08</a>.","apa":"Valderrama, M., Botella Soler, V., &#38; Le Van Quyen, M. (2013). Neuronal oscillations scale up and scale down the brain dynamics . In M. Meyer &#38; Z. Pesenson (Eds.), <i>Multiscale Analysis and Nonlinear Dynamics: From Genes to the Brain</i>. Wiley-VCH. <a href=\"https://doi.org/10.1002/9783527671632.ch08\">https://doi.org/10.1002/9783527671632.ch08</a>"},"quality_controlled":"1","publication_status":"published","alternative_title":["Reviews of Nonlinear Dynamics and Complexity"],"_id":"2413","publication_identifier":{"isbn":["9783527411986 "],"eisbn":["9783527671632"]},"publist_id":"4513","month":"08","year":"2013","department":[{"_id":"GaTk"}],"title":"Neuronal oscillations scale up and scale down the brain dynamics "},{"department":[{"_id":"JoCs"}],"year":"2013","month":"12","type":"journal_article","ddc":["571"],"file":[{"file_id":"5128","creator":"system","relation":"main_file","file_name":"IST-2018-953-v1+1_2013_Dickerson_Aberrant_neural.pdf","file_size":530134,"checksum":"cd7183121e56251176100ccac165c95c","date_created":"2018-12-12T10:15:10Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z"}],"oa_version":"Published Version","publication_status":"published","issue":"DEC","_id":"476","publisher":"Frontiers Research Foundation","pubrep_id":"953","status":"public","author":[{"last_name":"Dickerson","full_name":"Dickerson, Desiree","id":"444EB89E-F248-11E8-B48F-1D18A9856A87","first_name":"Desiree"},{"full_name":"Bilkey, David","last_name":"Bilkey","first_name":"David"}],"abstract":[{"lang":"eng","text":"Maternal exposure to infection occurring mid-gestation produces a three-fold increase in the risk of schizophrenia in the offspring. The critical initiating factor appears to be the maternal immune activation (MIA) that follows infection. This process can be induced in rodents by exposure of pregnant dams to the viral mimic Poly I:C, which triggers an immune response that results in structural, functional, behavioral, and electrophysiological phenotypes in the adult offspring that model those seen in schizophrenia. We used this model to explore the role of synchronization in brain neural networks, a process thought to be dysfunctional in schizophrenia and previously associated with positive, negative, and cognitive symptoms of schizophrenia. Exposure of pregnant dams to Poly I:C on GD15 produced an impairment in long-range neural synchrony in adult offspring between two regions implicated in schizophrenia pathology; the hippocampus and the medial prefrontal cortex (mPFC). This reduction in synchrony was ameliorated by acute doses of the antipsychotic clozapine. MIA animals have previously been shown to have impaired pre-pulse inhibition (PPI), a gold-standard measure of schizophrenia-like deficits in animal models. Our data showed that deficits in synchrony were positively correlated with the impairments in PPI. Subsequent analysis of LFP activity during the PPI response also showed that reduced coupling between the mPFC and the hippocampus following processing of the pre-pulse was associated with reduced PPI. The ability of the MIA intervention to model neurodevelopmental aspects of schizophrenia pathology provides a useful platform from which to investigate the ontogeny of aberrant synchronous processes. Further, the way in which the model expresses translatable deficits such as aberrant synchrony and reduced PPI will allow researchers to explore novel intervention strategies targeted to these changes. "}],"date_updated":"2021-01-12T08:00:53Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"Aberrant neural synchrony in the maternal immune activation model: Using translatable measures to explore targeted interventions","publist_id":"7346","date_created":"2018-12-11T11:46:41Z","citation":{"mla":"Dickerson, Desiree, and David Bilkey. “Aberrant Neural Synchrony in the Maternal Immune Activation Model: Using Translatable Measures to Explore Targeted Interventions.” <i>Frontiers in Behavioral Neuroscience</i>, vol. 7, no. DEC, Frontiers Research Foundation, 2013, doi:<a href=\"https://doi.org/10.3389/fnbeh.2013.00217\">10.3389/fnbeh.2013.00217</a>.","chicago":"Dickerson, Desiree, and David Bilkey. “Aberrant Neural Synchrony in the Maternal Immune Activation Model: Using Translatable Measures to Explore Targeted Interventions.” <i>Frontiers in Behavioral Neuroscience</i>. Frontiers Research Foundation, 2013. <a href=\"https://doi.org/10.3389/fnbeh.2013.00217\">https://doi.org/10.3389/fnbeh.2013.00217</a>.","apa":"Dickerson, D., &#38; Bilkey, D. (2013). Aberrant neural synchrony in the maternal immune activation model: Using translatable measures to explore targeted interventions. <i>Frontiers in Behavioral Neuroscience</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fnbeh.2013.00217\">https://doi.org/10.3389/fnbeh.2013.00217</a>","ieee":"D. Dickerson and D. Bilkey, “Aberrant neural synchrony in the maternal immune activation model: Using translatable measures to explore targeted interventions,” <i>Frontiers in Behavioral Neuroscience</i>, vol. 7, no. DEC. Frontiers Research Foundation, 2013.","ista":"Dickerson D, Bilkey D. 2013. Aberrant neural synchrony in the maternal immune activation model: Using translatable measures to explore targeted interventions. Frontiers in Behavioral Neuroscience. 7(DEC).","short":"D. Dickerson, D. Bilkey, Frontiers in Behavioral Neuroscience 7 (2013).","ama":"Dickerson D, Bilkey D. Aberrant neural synchrony in the maternal immune activation model: Using translatable measures to explore targeted interventions. <i>Frontiers in Behavioral Neuroscience</i>. 2013;7(DEC). doi:<a href=\"https://doi.org/10.3389/fnbeh.2013.00217\">10.3389/fnbeh.2013.00217</a>"},"quality_controlled":"1","oa":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.3389/fnbeh.2013.00217","file_date_updated":"2020-07-14T12:46:35Z","has_accepted_license":"1","intvolume":"         7","date_published":"2013-12-27T00:00:00Z","day":"27","publication":"Frontiers in Behavioral Neuroscience","volume":7}]