[{"date_published":"2012-12-01T00:00:00Z","scopus_import":1,"abstract":[{"lang":"eng","text":"We study the problem of maximum marginal prediction (MMP) in probabilistic graphical models, a task that occurs, for example, as the Bayes optimal decision rule under a Hamming loss. MMP is typically performed as a two-stage procedure: one estimates each variable's marginal probability and then forms a prediction from the states of maximal probability. In this work we propose a simple yet effective technique for accelerating MMP when inference is sampling-based: instead of the above two-stage procedure we directly estimate the posterior probability of each decision variable. This allows us to identify the point of time when we are sufficiently certain about any individual decision. Whenever this is the case, we dynamically prune the variables we are confident about from the underlying factor graph. Consequently, at any time only samples of variables whose decision is still uncertain need to be created. Experiments in two prototypical scenarios, multi-label classification and image inpainting, show that adaptive sampling can drastically accelerate MMP without sacrificing prediction accuracy."}],"intvolume":"         1","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:59:59Z","volume":1,"day":"01","author":[{"last_name":"Lampert","full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"status":"public","conference":{"end_date":"2012-12-06","location":"Lake Tahoe, NV, United States","name":"NIPS: Neural Information Processing Systems","start_date":"2012-12-03"},"_id":"2825","publication_status":"published","quality_controlled":"1","date_created":"2018-12-11T11:59:48Z","citation":{"chicago":"Lampert, Christoph. “Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction,” 1:82–90. Neural Information Processing Systems, 2012.","apa":"Lampert, C. (2012). Dynamic pruning of factor graphs for maximum marginal prediction (Vol. 1, pp. 82–90). Presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV, United States: Neural Information Processing Systems.","mla":"Lampert, Christoph. <i>Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction</i>. Vol. 1, Neural Information Processing Systems, 2012, pp. 82–90.","ista":"Lampert C. 2012. Dynamic pruning of factor graphs for maximum marginal prediction. NIPS: Neural Information Processing Systems vol. 1, 82–90.","ieee":"C. Lampert, “Dynamic pruning of factor graphs for maximum marginal prediction,” presented at the NIPS: Neural Information Processing Systems, Lake Tahoe, NV, United States, 2012, vol. 1, pp. 82–90.","short":"C. Lampert, in:, Neural Information Processing Systems, 2012, pp. 82–90.","ama":"Lampert C. Dynamic pruning of factor graphs for maximum marginal prediction. In: Vol 1. Neural Information Processing Systems; 2012:82-90."},"oa_version":"None","type":"conference","publisher":"Neural Information Processing Systems","title":"Dynamic pruning of factor graphs for maximum marginal prediction","department":[{"_id":"ChLa"}],"month":"12","year":"2012","page":"82 - 90","publist_id":"3975"},{"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"id":"4397AC76-F248-11E8-B48F-1D18A9856A87","first_name":"Damien","orcid":"0000-0002-3197-8736","full_name":"Zufferey, Damien","last_name":"Zufferey"},{"last_name":"Nowak","full_name":"Nowak, Martin","first_name":"Martin"}],"status":"public","scopus_import":1,"abstract":[{"text":"We study evolutionary game theory in a setting where individuals learn from each other. We extend the traditional approach by assuming that a population contains individuals with different learning abilities. In particular, we explore the situation where individuals have different search spaces, when attempting to learn the strategies of others. The search space of an individual specifies the set of strategies learnable by that individual. The search space is genetically given and does not change under social evolutionary dynamics. We introduce a general framework and study a specific example in the context of direct reciprocity. For this example, we obtain the counter intuitive result that cooperation can only evolve for intermediate benefit-to-cost ratios, while small and large benefit-to-cost ratios favor defection. Our paper is a step toward making a connection between computational learning theory and evolutionary game dynamics.","lang":"eng"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/","open_access":"1"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:00:12Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"month":"05","year":"2012","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"_id":"2848","publication_status":"published","external_id":{"pmid":["22394652"]},"oa_version":"Submitted Version","type":"journal_article","publisher":"Elsevier","ec_funded":1,"doi":"10.1016/j.jtbi.2012.02.021","date_published":"2012-05-21T00:00:00Z","intvolume":"       301","pmid":1,"volume":301,"day":"21","publication":"Journal of Theoretical Biology","title":"Evolutionary game dynamics in populations with different learners","page":"161 - 173","publist_id":"3946","quality_controlled":"1","date_created":"2018-12-11T11:59:55Z","citation":{"ista":"Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.","short":"K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.","ieee":"K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” <i>Journal of Theoretical Biology</i>, vol. 301. Elsevier, pp. 161–173, 2012.","ama":"Chatterjee K, Zufferey D, Nowak M. Evolutionary game dynamics in populations with different learners. <i>Journal of Theoretical Biology</i>. 2012;301:161-173. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">10.1016/j.jtbi.2012.02.021</a>","chicago":"Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.” <i>Journal of Theoretical Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">https://doi.org/10.1016/j.jtbi.2012.02.021</a>.","apa":"Chatterjee, K., Zufferey, D., &#38; Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">https://doi.org/10.1016/j.jtbi.2012.02.021</a>","mla":"Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.” <i>Journal of Theoretical Biology</i>, vol. 301, Elsevier, 2012, pp. 161–73, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2012.02.021\">10.1016/j.jtbi.2012.02.021</a>."},"oa":1},{"day":"01","publication":"Russian Mathematical Surveys","volume":67,"date_published":"2012-01-01T00:00:00Z","intvolume":"        67","has_accepted_license":"1","file_date_updated":"2020-07-14T12:45:51Z","doi":"10.1070/RM2012v067n06ABEH004820","oa":1,"quality_controlled":"1","citation":{"mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, IOP Publishing Ltd., 2012, pp. 1167–68, doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>.","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.” <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd., 2012. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>.","apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">https://doi.org/10.1070/RM2012v067n06ABEH004820</a>","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. IOP Publishing Ltd., pp. 1167–1168, 2012.","ama":"Edelsbrunner H, Strelkova N. On the configuration space of Steiner minimal trees. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167-1168. doi:<a href=\"https://doi.org/10.1070/RM2012v067n06ABEH004820\">10.1070/RM2012v067n06ABEH004820</a>"},"date_created":"2018-12-11T11:59:55Z","page":"1167 - 1168","publist_id":"3943","title":"On the configuration space of Steiner minimal trees","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:00:13Z","scopus_import":1,"status":"public","author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nataliya","last_name":"Strelkova","full_name":"Strelkova, Nataliya"}],"publisher":"IOP Publishing Ltd.","pubrep_id":"546","publication_status":"published","_id":"2849","issue":"6","oa_version":"Submitted Version","type":"journal_article","ddc":["000"],"file":[{"file_name":"IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf","file_id":"5078","creator":"system","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:51Z","checksum":"44ee8d173487e8ed41a51136816bbeb4","file_size":392021,"date_created":"2018-12-12T10:14:26Z"}],"year":"2012","month":"01","department":[{"_id":"HeEd"}]},{"status":"public","author":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"text":"Formal verification aims to improve the quality of hardware and software by detecting errors before they do harm. At the basis of formal verification lies the logical notion of correctness, which purports to capture whether or not a circuit or program behaves as desired. We suggest that the boolean partition into correct and incorrect systems falls short of the practical need to assess the behavior of hardware and software in a more nuanced fashion against multiple criteria.","lang":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T07:00:29Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"year":"2012","month":"09","oa_version":"None","type":"conference","publication_status":"published","alternative_title":["LNCS"],"_id":"2888","publisher":"Springer","ec_funded":1,"doi":"10.1007/978-3-642-33666-9_1","intvolume":"      7590","date_published":"2012-09-01T00:00:00Z","publication":"Conference proceedings MODELS 2012","day":"01","volume":7590,"title":"Quantitative reactive models","page":"1 - 2","publist_id":"3870","citation":{"ama":"Henzinger TA. Quantitative reactive models. In: <i>Conference Proceedings MODELS 2012</i>. Vol 7590. Springer; 2012:1-2. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>","short":"T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.","ista":"Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.","ieee":"T. A. Henzinger, “Quantitative reactive models,” in <i>Conference proceedings MODELS 2012</i>, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","apa":"Henzinger, T. A. (2012). Quantitative reactive models. In <i>Conference proceedings MODELS 2012</i> (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>","chicago":"Henzinger, Thomas A. “Quantitative Reactive Models.” In <i>Conference Proceedings MODELS 2012</i>, 7590:1–2. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>.","mla":"Henzinger, Thomas A. “Quantitative Reactive Models.” <i>Conference Proceedings MODELS 2012</i>, vol. 7590, Springer, 2012, pp. 1–2, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>."},"date_created":"2018-12-11T12:00:09Z","quality_controlled":"1","conference":{"name":"MODELS: Model-driven Engineering Languages and Systems","start_date":"2012-09-30","end_date":"2012-10-05","location":"Innsbruck, Austria"}},{"department":[{"_id":"ToHe"}],"title":"Synthesis from incompatible specifications","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"publist_id":"3868","page":"53 - 62","year":"2012","month":"10","oa_version":"None","type":"conference","citation":{"mla":"Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 53–62, doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>.","apa":"Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., &#38; Totla, N. (2012). Synthesis from incompatible specifications. In <i>Proceedings of the tenth ACM international conference on Embedded software</i> (pp. 53–62). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>","chicago":"Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, 53–62. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>.","ama":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible specifications. In: <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:53-62. doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>","ista":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.","short":"P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62.","ieee":"P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in <i>Proceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 53–62."},"date_created":"2018-12-11T12:00:10Z","quality_controlled":"1","publication_status":"published","_id":"2890","conference":{"start_date":"2012-10-07","name":"EMSOFT: Embedded Software ","location":"Tampere, Finland","end_date":"2012-10-12"},"publisher":"ACM","status":"public","author":[{"full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sivakanth","last_name":"Gopi","full_name":"Gopi, Sivakanth"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nishant","last_name":"Totla","full_name":"Totla, Nishant"}],"ec_funded":1,"doi":"10.1145/2380356.2380371","abstract":[{"text":"Systems are often specified using multiple requirements on their behavior. In practice, these requirements can be contradictory. The classical approach to specification, verification, and synthesis demands more detailed specifications that resolve any contradictions in the requirements. These detailed specifications are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative frameworks allow the formalization of the intuitive idea that what is desired is an implementation that comes &quot;closest&quot; to satisfying the mutually incompatible requirements, according to a measure of fit that can be defined by the requirements engineer. One flexible framework for quantifying how &quot;well&quot; an implementation satisfies a specification is offered by simulation distances that are parameterized by an error model. We introduce this framework, study its properties, and provide an algorithmic solution for the following quantitative synthesis question: given two (or more) behavioral requirements specified by possibly incompatible finite-state machines, and an error model, find the finite-state implementation that minimizes the maximal simulation distance to the given requirements. Furthermore, we generalize the framework to handle infinite alphabets (for example, realvalued domains). We also demonstrate how quantitative specifications based on simulation distances might lead to smaller and easier to modify specifications. Finally, we illustrate our approach using case studies on error correcting codes and scheduler synthesis.","lang":"eng"}],"scopus_import":1,"date_published":"2012-10-01T00:00:00Z","publication":"Proceedings of the tenth ACM international conference on Embedded software","day":"01","date_updated":"2021-01-12T07:00:30Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"year":"2012","month":"12","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"805","publication_status":"published","alternative_title":["LIPIcs"],"_id":"2891","oa_version":"Published Version","ddc":["004"],"type":"conference","file":[{"date_updated":"2020-07-14T12:45:52Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:10:37Z","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","file_size":559069,"file_name":"IST-2017-805-v1+1_34.pdf","relation":"main_file","file_id":"4826","creator":"system"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","status":"public","author":[{"first_name":"Udi","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:00:31Z","scopus_import":1,"abstract":[{"lang":"eng","text":"Quantitative automata are nondeterministic finite automata with edge weights. They value a\r\nrun by some function from the sequence of visited weights to the reals, and value a word by its\r\nminimal/maximal run. They generalize boolean automata, and have gained much attention in\r\nrecent years. Unfortunately, important automaton classes, such as sum, discounted-sum, and\r\nlimit-average automata, cannot be determinized. Yet, the quantitative setting provides the potential\r\nof approximate determinization. We define approximate determinization with respect to\r\na distance function, and investigate this potential.\r\nWe show that sum automata cannot be determinized approximately with respect to any\r\ndistance function. However, restricting to nonnegative weights allows for approximate determinization\r\nwith respect to some distance functions.\r\nDiscounted-sum automata allow for approximate determinization, as the influence of a word’s\r\nsuffix is decaying. However, the naive approach, of unfolding the automaton computations up\r\nto a sufficient level, is shown to be doubly exponential in the discount factor. We provide an\r\nalternative construction that is singly exponential in the discount factor, in the precision, and\r\nin the number of states. We prove matching lower bounds, showing exponential dependency on\r\neach of these three parameters.\r\nAverage and limit-average automata are shown to prohibit approximate determinization with\r\nrespect to any distance function, and this is the case even for two weights, 0 and 1."}],"page":"362 - 373","publist_id":"3867","title":"Approximate determinization of quantitative automata","oa":1,"quality_controlled":"1","conference":{"start_date":"2012-12-15","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2012-12-17","location":"Hyderabad, India"},"citation":{"chicago":"Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In <i>Leibniz International Proceedings in Informatics</i>, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>.","apa":"Boker, U., &#38; Henzinger, T. A. (2012). Approximate determinization of quantitative automata. In <i>Leibniz International Proceedings in Informatics</i> (Vol. 18, pp. 362–373). Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362</a>","mla":"Boker, Udi, and Thomas A. Henzinger. “Approximate Determinization of Quantitative Automata.” <i>Leibniz International Proceedings in Informatics</i>, vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–73, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>.","short":"U. Boker, T.A. Henzinger, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 362–373.","ista":"Boker U, Henzinger TA. 2012. Approximate determinization of quantitative automata. Leibniz International Proceedings in Informatics. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 362–373.","ieee":"U. Boker and T. A. Henzinger, “Approximate determinization of quantitative automata,” in <i>Leibniz International Proceedings in Informatics</i>, Hyderabad, India, 2012, vol. 18, pp. 362–373.","ama":"Boker U, Henzinger TA. Approximate determinization of quantitative automata. In: <i>Leibniz International Proceedings in Informatics</i>. Vol 18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:362-373. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362\">10.4230/LIPIcs.FSTTCS.2012.362</a>"},"date_created":"2018-12-11T12:00:10Z","file_date_updated":"2020-07-14T12:45:52Z","doi":"10.4230/LIPIcs.FSTTCS.2012.362","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"ec_funded":1,"publication":"Leibniz International Proceedings in Informatics","day":"01","acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","volume":18,"date_published":"2012-12-01T00:00:00Z","has_accepted_license":"1","intvolume":"        18"},{"status":"public","article_processing_charge":"No","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Oleg","full_name":"Musin, Oleg","last_name":"Musin"},{"last_name":"Ukhalov","full_name":"Ukhalov, Alexey","first_name":"Alexey"},{"first_name":"Olga","full_name":"Yakimova, Olga","last_name":"Yakimova"},{"last_name":"Alexeev","full_name":"Alexeev, Vladislav","first_name":"Vladislav"},{"first_name":"Victoriya","last_name":"Bogaevskaya","full_name":"Bogaevskaya, Victoriya"},{"full_name":"Gorohov, Andrey","last_name":"Gorohov","first_name":"Andrey"},{"first_name":"Margarita","last_name":"Preobrazhenskaya","full_name":"Preobrazhenskaya, Margarita"}],"date_published":"2012-12-01T00:00:00Z","intvolume":"        19","main_file_link":[{"open_access":"1","url":"http://mi.mathnet.ru/eng/mais280"}],"abstract":[{"lang":"eng","text":"We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. "}],"language":[{"iso":"rus"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Modeling and Analysis of Information Systems","day":"01","volume":19,"date_updated":"2023-10-18T07:34:45Z","article_type":"original","department":[{"_id":"HeEd"}],"title":"Fractal and computational geometry for generalizing cartographic objects","publist_id":"3845","page":"152 - 160","month":"12","year":"2012","publication_status":"published","quality_controlled":"1","_id":"2902","issue":"6","type":"journal_article","oa_version":"Published Version","date_created":"2018-12-11T12:00:15Z","citation":{"short":"H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160.","ieee":"H. Edelsbrunner <i>et al.</i>, “Fractal and computational geometry for generalizing cartographic objects,” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.","ista":"Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160.","ama":"Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. 2012;19(6):152-160.","chicago":"Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences, 2012.","apa":"Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V., … Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences.","mla":"Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60."},"oa":1,"publisher":"Russian Academy of Sciences"},{"publist_id":"3844","page":"41 - 48","title":"The adaptive topology of a digital image","oa":1,"quality_controlled":"1","conference":{"end_date":"2012-06-29","location":"New Brunswick, NJ, USA ","name":"ISVD: International Symposium on Voronoi Diagrams in Science and Engineering","start_date":"2012-06-27"},"date_created":"2018-12-11T12:00:15Z","citation":{"chicago":"Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>.","apa":"Edelsbrunner, H., &#38; Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>","mla":"Edelsbrunner, Herbert, and Olga Symonova. <i>The Adaptive Topology of a Digital Image</i>. IEEE, 2012, pp. 41–48, doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>.","short":"H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.","ista":"Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.","ieee":"H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.","ama":"Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In: IEEE; 2012:41-48. doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>"},"file_date_updated":"2020-07-14T12:45:52Z","doi":"10.1109/ISVD.2012.11","day":"06","date_published":"2012-08-06T00:00:00Z","has_accepted_license":"1","month":"08","year":"2012","department":[{"_id":"HeEd"},{"_id":"MaJö"}],"publisher":"IEEE","pubrep_id":"545","publication_status":"published","_id":"2903","oa_version":"Submitted Version","type":"conference","ddc":["000"],"file":[{"file_name":"IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf","relation":"main_file","creator":"system","file_id":"4765","date_updated":"2020-07-14T12:45:52Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:09:41Z","checksum":"444869a4e8abf07834f88b6e5cb5e9c3","file_size":760548}],"status":"public","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","last_name":"Symonova","full_name":"Symonova, Olga"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:00:35Z","scopus_import":1,"abstract":[{"text":"In order to enjoy a digital version of the Jordan Curve Theorem, it is common to use the closed topology for the foreground and the open topology for the background of a 2-dimensional binary image. In this paper, we introduce a single topology that enjoys this theorem for all thresholds decomposing a real-valued image into foreground and background. This topology is easy to construct and it generalizes to n-dimensional images.","lang":"eng"}]},{"publist_id":"3843","page":"729 - 749","title":"Weak multipliers for generalized van der Corput sequences","oa":1,"date_created":"2018-12-11T12:00:15Z","citation":{"mla":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>.","chicago":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux, 2012. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>.","apa":"Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>","ista":"Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749.","short":"F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.","ieee":"F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” <i>Journal de Theorie des Nombres des Bordeaux</i>, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.","ama":"Pausinger F. Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie des Nombres des Bordeaux</i>. 2012;24(3):729-749. doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>"},"quality_controlled":"1","doi":"10.5802/jtnb.819","file_date_updated":"2020-07-14T12:45:52Z","article_processing_charge":"No","publication":"Journal de Theorie des Nombres des Bordeaux","day":"01","volume":24,"intvolume":"        24","has_accepted_license":"1","date_published":"2012-01-01T00:00:00Z","publication_identifier":{"issn":["1246-7405"],"eissn":["2118-8572"]},"year":"2012","month":"01","department":[{"_id":"HeEd"}],"article_type":"original","publisher":"Université de Bordeaux","type":"journal_article","ddc":["510"],"file":[{"relation":"main_file","file_id":"7819","creator":"dernst","file_name":"JTNB_2012__24_3_729_0.pdf","date_created":"2020-05-11T12:40:39Z","checksum":"6954bfe9d7f4119fbdda7a11cf0f5c67","file_size":819275,"date_updated":"2020-07-14T12:45:52Z","access_level":"open_access","content_type":"application/pdf"}],"oa_version":"Published Version","publication_status":"published","_id":"2904","issue":"3","status":"public","author":[{"id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","first_name":"Florian","last_name":"Pausinger","full_name":"Pausinger, Florian","orcid":"0000-0002-8379-3768"}],"date_updated":"2023-10-18T07:53:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences.","lang":"eng"},{"lang":"fre","text":"Les suites de Van der Corput généralisées sont dessuites unidimensionnelles et infinies dans l’intervalle de l’unité.Elles sont générées par permutations des entiers de la basebetsont les éléments constitutifs des suites multi-dimensionnelles deHalton. Suites aux progrès récents d’Atanassov concernant le com-portement de distribution uniforme des suites de Halton nous nousintéressons aux permutations de la formuleP(i)  =ai(modb)pour les entiers premiers entre euxaetb. Dans cet article nousidentifions des multiplicateursagénérant des suites de Van derCorput ayant une mauvaise distribution. Nous donnons les bornesinférieures explicites pour cette distribution asymptotique asso-ciée à ces suites et relions ces dernières aux suites générées parpermutation d’identité, qui sont, selon Faure, les moins bien dis-tribuées des suites généralisées de Van der Corput dans une basedonnée."}],"scopus_import":"1"},{"doi":"10.4213/rm9503","status":"public","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Nataliya","full_name":"Strelkova, Nataliya","last_name":"Strelkova"}],"article_processing_charge":"No","day":"01","publication":"Russian Mathematical Surveys","volume":67,"date_updated":"2023-10-17T11:40:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"intvolume":"        67","date_published":"2012-10-01T00:00:00Z","publist_id":"3831","page":"1167–1168","month":"10","year":"2012","department":[{"_id":"HeEd"}],"title":"On the configuration space for the shortest networks","publisher":"Russian Academy of Sciences","oa_version":"None","type":"journal_article","date_created":"2018-12-11T12:00:18Z","citation":{"apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences, 2012. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>.","mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, Russian Academy of Sciences, 2012, pp. 1167–1168, doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>.","ama":"Edelsbrunner H, Strelkova N. On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167–1168. doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest networks. Russian Mathematical Surveys. 67(6), 1167–1168.","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012."},"publication_status":"published","quality_controlled":"1","_id":"2912","issue":"6"},{"publisher":"Deutsches Zentrum für Luft und Raumfahrt","oa_version":"None","type":"conference","citation":{"mla":"Kroemer, Oliver, et al. <i>Multi-Modal Learning for Dynamic Tactile Sensing</i>. Deutsches Zentrum für Luft und Raumfahrt, 2012.","apa":"Kroemer, O., Lampert, C., &#38; Peters, J. (2012). Multi-modal learning for dynamic tactile sensing. Deutsches Zentrum für Luft und Raumfahrt.","chicago":"Kroemer, Oliver, Christoph Lampert, and Jan Peters. “Multi-Modal Learning for Dynamic Tactile Sensing.” Deutsches Zentrum für Luft und Raumfahrt, 2012.","ama":"Kroemer O, Lampert C, Peters J. Multi-modal learning for dynamic tactile sensing. In: Deutsches Zentrum für Luft und Raumfahrt; 2012.","ieee":"O. Kroemer, C. Lampert, and J. Peters, “Multi-modal learning for dynamic tactile sensing,” 2012.","short":"O. Kroemer, C. Lampert, J. Peters, in:, Deutsches Zentrum für Luft und Raumfahrt, 2012.","ista":"Kroemer O, Lampert C, Peters J. 2012. Multi-modal learning for dynamic tactile sensing"},"date_created":"2018-12-11T12:00:19Z","quality_controlled":"1","publication_status":"published","_id":"2915","publist_id":"3828","month":"10","year":"2012","department":[{"_id":"ChLa"}],"title":"Multi-modal learning for dynamic tactile sensing","day":"11","acknowledgement":"The project receives funding from the European Community’s Seventh Framework Programme under grant agreement\r\nno. ICT- 248273 GeRT.","date_updated":"2023-10-17T07:58:59Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2012-10-11T00:00:00Z","status":"public","author":[{"last_name":"Kroemer","full_name":"Kroemer, Oliver","first_name":"Oliver"},{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"},{"last_name":"Peters","full_name":"Peters, Jan","first_name":"Jan"}],"article_processing_charge":"No"},{"publist_id":"3827","page":"29 - 42","title":"Interface Simulation Distances","oa":1,"arxiv":1,"quality_controlled":"1","conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","start_date":"2012-09-06","end_date":"2012-09-08","location":"Napoli, Italy"},"date_created":"2018-12-11T12:00:19Z","citation":{"mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 96, EPTCS, 2012, pp. 29–42, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Interface Simulation Distances. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 96:29–42. EPTCS, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 96. EPTCS; 2012:29-42. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Napoli, Italy, 2012, vol. 96, pp. 29–42."},"doi":"10.4204/EPTCS.96.3","ec_funded":1,"publication":"Electronic Proceedings in Theoretical Computer Science","day":"07","volume":96,"date_published":"2012-10-07T00:00:00Z","intvolume":"        96","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"month":"10","year":"2012","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"EPTCS","publication_status":"published","external_id":{"arxiv":["1210.2450"]},"_id":"2916","oa_version":"Submitted Version","type":"conference","status":"public","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","first_name":"Pavol","full_name":"Cerny, Pavol","last_name":"Cerny"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","last_name":"Radhakrishna"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-02-23T10:12:05Z","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1733"}]},"abstract":[{"text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.","lang":"eng"}]},{"publisher":"Cambridge University Press","publication_status":"published","quality_controlled":"1","_id":"2917","issue":"1","type":"journal_article","oa_version":"None","citation":{"ista":"de Vladar H. 2012. The game of active search for extra terrestrial intelligence Breaking the Great Silence . International Journal of Astrobiology. 12(1), 53–62.","ieee":"H. de Vladar, “The game of active search for extra terrestrial intelligence Breaking the Great Silence ,” <i>International Journal of Astrobiology</i>, vol. 12, no. 1. Cambridge University Press, pp. 53–62, 2012.","short":"H. de Vladar, International Journal of Astrobiology 12 (2012) 53–62.","ama":"de Vladar H. The game of active search for extra terrestrial intelligence Breaking the Great Silence . <i>International Journal of Astrobiology</i>. 2012;12(1):53-62. doi:<a href=\"https://doi.org/10.1017/S1473550412000407\">10.1017/S1473550412000407</a>","chicago":"Vladar, Harold de. “The Game of Active Search for Extra Terrestrial Intelligence Breaking the Great Silence .” <i>International Journal of Astrobiology</i>. Cambridge University Press, 2012. <a href=\"https://doi.org/10.1017/S1473550412000407\">https://doi.org/10.1017/S1473550412000407</a>.","apa":"de Vladar, H. (2012). The game of active search for extra terrestrial intelligence Breaking the Great Silence . <i>International Journal of Astrobiology</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S1473550412000407\">https://doi.org/10.1017/S1473550412000407</a>","mla":"de Vladar, Harold. “The Game of Active Search for Extra Terrestrial Intelligence Breaking the Great Silence .” <i>International Journal of Astrobiology</i>, vol. 12, no. 1, Cambridge University Press, 2012, pp. 53–62, doi:<a href=\"https://doi.org/10.1017/S1473550412000407\">10.1017/S1473550412000407</a>."},"date_created":"2018-12-11T12:00:19Z","publist_id":"3821","page":"53 - 62","month":"11","year":"2012","department":[{"_id":"NiBa"}],"title":"The game of active search for extra terrestrial intelligence Breaking the Great Silence ","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"International Journal of Astrobiology","day":"06","date_updated":"2021-01-12T07:00:41Z","volume":12,"date_published":"2012-11-06T00:00:00Z","scopus_import":1,"intvolume":"        12","abstract":[{"text":"The search for extra-terrestrial intelligence (SETI) has been performed principally as a one-way survey, listening of radio frequencies across the Milky Way and other galaxies. However, scientists have engaged in an active messaging only rarely. This suggests the simple rationale that if other civilizations exist and take a similar approach to ours, namely listening but not broadcasting, the result is a silent universe. A simple game theoretical model, the prisoner's dilemma, explains this situation: each player (civilization) can passively search (defect), or actively search and broadcast (cooperate). In order to maximize the payoff (or, equivalently, minimize the risks) the best strategy is not to broadcast. In fact, the active search has been opposed on the basis that it might be dangerous to expose ourselves. However, most of these ideas have not been based on objective arguments, and ignore accounting of the possible gains and losses. Thus, the question stands: should we perform an active search? I develop a game-theoretical framework where civilizations can be of different types, and explicitly apply it to a situation where societies are either interested in establishing a two-way communication or belligerent and in urge to exploit ours. The framework gives a quantitative solution (a mixed-strategy), which is how frequent we should perform the active SETI. This frequency is roughly proportional to the inverse of the risk, and can be extremely small. However, given the immense amount of stars being scanned, it supports active SETI. The model is compared with simulations, and the possible actions are evaluated through the San Marino scale, measuring the risks of messaging.","lang":"eng"}],"doi":"10.1017/S1473550412000407","status":"public","author":[{"orcid":"0000-0002-5985-7653","last_name":"Vladar","full_name":"Vladar, Harold","first_name":"Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87"}]},{"arxiv":1,"external_id":{"arxiv":["1205.6352"]},"publication_status":"published","_id":"2928","type":"preprint","oa_version":"Preprint","citation":{"ama":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. <i>arXiv</i>. 2012.","short":"V. Kolmogorov, T. Schoenemann, ArXiv (2012).","ista":"Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted message passing. arXiv, .","ieee":"V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” <i>arXiv</i>. ArXiv, 2012.","apa":"Kolmogorov, V., &#38; Schoenemann, T. (2012). Generalized sequential tree-reweighted message passing. <i>arXiv</i>. ArXiv.","chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>. ArXiv, 2012.","mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, ArXiv, 2012."},"date_created":"2018-12-11T12:00:23Z","oa":1,"publisher":"ArXiv","department":[{"_id":"VlKo"}],"title":"Generalized sequential tree-reweighted message passing","page":"16","publist_id":"3809","year":"2012","month":"05","date_published":"2012-05-29T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.6352"}],"abstract":[{"text":"     This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. ","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"arXiv","day":"29","date_updated":"2021-01-12T07:00:45Z","status":"public","article_processing_charge":"No","author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"first_name":"Thomas","last_name":"Schoenemann","full_name":"Schoenemann, Thomas"}]},{"publisher":"Springer","alternative_title":["LNCS"],"publication_status":"published","_id":"2930","oa_version":"Preprint","type":"conference","month":"04","year":"2012","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:00:46Z","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1309.5469","open_access":"1"}],"abstract":[{"text":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron, prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm to construct the vertices of the polyhedron.\r\n","lang":"eng"}],"status":"public","author":[{"first_name":"Anna","last_name":"Huber","full_name":"Huber, Anna"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"oa":1,"quality_controlled":"1","conference":{"start_date":"2012-04-19","name":"ISCO: International Symposium on Combinatorial Optimization","location":"Athens, Greece","end_date":"2012-04-21"},"date_created":"2018-12-11T12:00:24Z","citation":{"chicago":"Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,” 7422:451–62. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>.","apa":"Huber, A., &#38; Kolmogorov, V. (2012). Towards minimizing k-submodular functions (Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>","mla":"Huber, Anna, and Vladimir Kolmogorov. <i>Towards Minimizing K-Submodular Functions</i>. Vol. 7422, Springer, 2012, pp. 451–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>.","ista":"Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.","short":"A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.","ieee":"A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.","ama":"Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol 7422. Springer; 2012:451-462. doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>"},"page":"451 - 462","publist_id":"3806","title":"Towards minimizing k-submodular functions","day":"01","acknowledgement":"We would like to thank Andrei Krokhin for encourag- ing our cooperation, for helpful discussions, and for his critical reading of the manuscript.\r\n","volume":7422,"date_published":"2012-04-01T00:00:00Z","intvolume":"      7422","doi":"10.1007/978-3-642-32147-4_40"},{"doi":"10.1109/TPAMI.2012.105","status":"public","author":[{"full_name":"Torresani, Lorenzo","last_name":"Torresani","first_name":"Lorenzo"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"},{"full_name":"Rother, Carsten","last_name":"Rother","first_name":"Carsten"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","day":"08","acknowledgement":"This research was funded in part by Microsoft Research.","volume":35,"date_updated":"2021-01-12T07:00:46Z","scopus_import":1,"date_published":"2012-05-08T00:00:00Z","intvolume":"        35","abstract":[{"text":"In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.\r\n","lang":"eng"}],"page":"259 - 271","project":[{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publist_id":"3805","year":"2012","month":"05","department":[{"_id":"VlKo"}],"title":"A dual decomposition approach to feature correspondence","publisher":"IEEE","publication_status":"published","quality_controlled":"1","issue":"2","_id":"2931","oa_version":"None","type":"journal_article","citation":{"chicago":"Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>.","apa":"Torresani, L., Kolmogorov, V., &#38; Rother, C. (2012). A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>","mla":"Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>.","ieee":"L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2. IEEE, pp. 259–271, 2012.","ista":"Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 35(2), 259–271.","short":"L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.","ama":"Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2012;35(2):259-271. doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>"},"date_created":"2018-12-11T12:00:24Z"},{"month":"10","year":"2012","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":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"ACM","_id":"2936","publication_status":"published","oa_version":"Preprint","type":"conference","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"first_name":"Vinayak","full_name":"Prabhu, Vinayak","last_name":"Prabhu"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T07:39:53Z","scopus_import":1,"abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"page":"43 - 52","publist_id":"3799","title":"Finite automata with time delay blocks","oa":1,"conference":{"location":"Tampere, Finland","end_date":"2012-10-12","name":"EMSOFT: Embedded Software ","start_date":"2012-10-07"},"quality_controlled":"1","citation":{"ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>roceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>roceedings of the tenth ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>."},"date_created":"2018-12-11T12:00:26Z","doi":"10.1145/2380356.2380370","ec_funded":1,"publication":"roceedings of the tenth ACM international conference on Embedded software","day":"01","acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","date_published":"2012-10-01T00:00:00Z"},{"oa_version":"Submitted Version","type":"conference","citation":{"ama":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In: <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>. ACM; 2012:488-500. doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>","short":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.","ista":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. Proceedings of the 2012 ACM conference on Computer and communications security. CCS: Computer and Communications Security, 488–500.","ieee":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in <i>Proceedings of the 2012 ACM conference on Computer and communications security</i>, Raleigh, NC, USA, 2012, pp. 488–500.","apa":"Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., &#38; Béguelin, S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In <i>Proceedings of the 2012 ACM conference on Computer and communications security</i> (pp. 488–500). Raleigh, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>","chicago":"Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, 488–500. ACM, 2012. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>.","mla":"Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, ACM, 2012, pp. 488–500, doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>."},"date_created":"2018-12-11T12:00:26Z","quality_controlled":"1","publication_status":"published","_id":"2937","conference":{"name":"CCS: Computer and Communications Security","start_date":"2012-10-16","end_date":"2012-10-18","location":"Raleigh, NC, USA"},"publisher":"ACM","oa":1,"department":[{"_id":"KrPi"}],"title":"Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols","publist_id":"3798","page":"488 - 500","month":"10","year":"2012","main_file_link":[{"url":"https://eprint.iacr.org/2012/258","open_access":"1"}],"abstract":[{"lang":"eng","text":"Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system."}],"date_published":"2012-10-01T00:00:00Z","scopus_import":1,"publication":"Proceedings of the 2012 ACM conference on Computer and communications security","acknowledgement":"This work was partially funded by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT, Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project S2009TIC-1465 PROMETIDOS.","day":"01","date_updated":"2021-01-12T07:39:53Z","language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"first_name":"José","full_name":"Almeida, José","last_name":"Almeida"},{"full_name":"Barbosa, Manuel","last_name":"Barbosa","first_name":"Manuel"},{"first_name":"Endre","full_name":"Bangerter, Endre","last_name":"Bangerter"},{"first_name":"Gilles","last_name":"Barthe","full_name":"Barthe, Gilles"},{"last_name":"Krenn","full_name":"Krenn, Stephan","orcid":"0000-0003-2835-9093","first_name":"Stephan","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Santiago","full_name":"Béguelin, Santiago","last_name":"Béguelin"}],"doi":"10.1145/2382196.2382249"},{"department":[{"_id":"SyCr"}],"title":"Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies","publist_id":"3797","page":"1300 - 1312","year":"2012","month":"01","quality_controlled":"1","publication_status":"published","issue":"6","_id":"2938","type":"journal_article","oa_version":"None","citation":{"ieee":"L. V. Ugelvig and S. Cremer, “Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies,” <i>Functional Ecology</i>, vol. 26, no. 6. Wiley-Blackwell, pp. 1300–1312, 2012.","ista":"Ugelvig LV, Cremer S. 2012. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. 26(6), 1300–1312.","short":"L.V. Ugelvig, S. Cremer, Functional Ecology 26 (2012) 1300–1312.","ama":"Ugelvig LV, Cremer S. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. <i>Functional Ecology</i>. 2012;26(6):1300-1312. doi:<a href=\"https://doi.org/10.1111/1365-2435.12013\">10.1111/1365-2435.12013</a>","chicago":"Ugelvig, Line V, and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” <i>Functional Ecology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/1365-2435.12013\">https://doi.org/10.1111/1365-2435.12013</a>.","apa":"Ugelvig, L. V., &#38; Cremer, S. (2012). Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. <i>Functional Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/1365-2435.12013\">https://doi.org/10.1111/1365-2435.12013</a>","mla":"Ugelvig, Line V., and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” <i>Functional Ecology</i>, vol. 26, no. 6, Wiley-Blackwell, 2012, pp. 1300–12, doi:<a href=\"https://doi.org/10.1111/1365-2435.12013\">10.1111/1365-2435.12013</a>."},"date_created":"2018-12-11T12:00:27Z","publisher":"Wiley-Blackwell","status":"public","author":[{"orcid":"0000-0003-1832-8883","last_name":"Ugelvig","full_name":"Ugelvig, Line V","first_name":"Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1111/1365-2435.12013","scopus_import":1,"date_published":"2012-01-01T00:00:00Z","intvolume":"        26","abstract":[{"lang":"eng","text":"Social insects have a very high potential to become invasive pest species. Here, we explore how their social lifestyle and their interaction with parasites may contribute to this invasive success. Similar to solitary species, parasite release followed by the evolution of increased competitive ability can promote establishment of introduced social insect hosts in their introduced range. Genetic bottlenecks during introduction of low numbers of founder individuals decrease the genetic diversity at three levels: the population, the colony and the individual, with the colony level being specific to social insects. Reduced genetic diversity can affect both the individual immune system and the collective colony-level disease defences (social immunity). Still, the dual immune system is likely to make social insects more robust to parasite attack. Changes in social structure from small, family-based, territorially aggressive societies in native populations towards huge networks of cooperating nests (unicoloniality) occur in some invasive social insects, for example, most invasive ants and some termites. Unicoloniality is likely to affect disease dynamics in multiple ways. The free exchange of individuals within the population leads to an increased genetic heterogeneity among individuals of a single nest, thereby decreasing disease transmission. However, the multitude of reproductively active queens per colony buffers the effect of individual diseased queens and their offspring, which may result in a higher level of vertical disease transmission in unicolonial societies. Lastly, unicoloniality provides a competitive advantage over native species, allowing them to quickly become the dominant species in the habitat, which in turn selects for parasite adaptation to this common host genotype and thus eventually a high parasite pressure. Overall, invasions by insect societies are characterized by general features applying to all introduced species, as well as idiosyncrasies that emerge from their social lifestyle. It is important to study these effects in concert to be able to develop efficient management and biocontrol strategies. © 2012 British Ecological Society."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"day":"01","acknowledgement":"We thank Mark Brown, Christopher Pull, Meghan L. Vyleta, Miriam Stock, Barbara Casillas-Perez and three anonymous reviewers for valuable comments on the manuscript and Eva Sixt for ant drawings. Funding was obtained from the German Science Foundation (DFG, by an Individual Research Grant to S.C.) and the European Research Council (ERC, by an ERC-Starting Grant to SC and an Individual Marie Curie EIF fellowship to L.desU.). The authors declare no conflict of interests.","publication":"Functional Ecology","volume":26,"date_updated":"2021-01-12T07:39:54Z"},{"author":[{"first_name":"Nikolai","full_name":"Dolbilin, Nikolai","last_name":"Dolbilin"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Oleg","last_name":"Musin","full_name":"Musin, Oleg"}],"status":"public","scopus_import":1,"language":[{"iso":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:39:55Z","department":[{"_id":"HeEd"}],"month":"11","year":"2012","issue":"4","_id":"2941","publication_status":"published","type":"journal_article","ddc":["510"],"file":[{"file_name":"IST-2013-132-v1+1_2012-J-04-Functional-E.pdf","creator":"system","file_id":"5239","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:55Z","file_size":253816,"checksum":"389a5ae53d6347de36c3468034f2821d","date_created":"2018-12-12T10:16:49Z"}],"oa_version":"Submitted Version","pubrep_id":"132","publisher":"IOP Publishing","file_date_updated":"2020-07-14T12:45:55Z","doi":"10.1070/RM2012v067n04ABEH004807","date_published":"2012-11-01T00:00:00Z","intvolume":"        67","has_accepted_license":"1","volume":67,"publication":"Russian Mathematical Surveys","day":"01","title":"On the optimality of functionals over triangulations of Delaunay sets","page":"781 - 783","publist_id":"3792","quality_controlled":"1","date_created":"2018-12-11T12:00:28Z","citation":{"mla":"Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>.","chicago":"Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>. IOP Publishing, 2012. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>.","apa":"Dolbilin, N., Edelsbrunner, H., &#38; Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. IOP Publishing. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>","short":"N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012) 781–783.","ista":"Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.","ieee":"N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.","ama":"Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. 2012;67(4):781-783. doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>"},"oa":1}]