[{"page":"82 - 90","day":"01","status":"public","year":"2012","_id":"2825","type":"conference","date_created":"2018-12-11T11:59:48Z","conference":{"location":"Lake Tahoe, NV, United States","name":"NIPS: Neural Information Processing Systems","start_date":"2012-12-03","end_date":"2012-12-06"},"publist_id":"3975","intvolume":"         1","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"None","citation":{"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.","chicago":"Lampert, Christoph. “Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction,” 1:82–90. Neural Information Processing Systems, 2012.","ista":"Lampert C. 2012. Dynamic pruning of factor graphs for maximum marginal prediction. NIPS: Neural Information Processing Systems vol. 1, 82–90.","ama":"Lampert C. Dynamic pruning of factor graphs for maximum marginal prediction. In: Vol 1. Neural Information Processing Systems; 2012: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.","mla":"Lampert, Christoph. <i>Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction</i>. Vol. 1, Neural Information Processing Systems, 2012, pp. 82–90.","short":"C. Lampert, in:, Neural Information Processing Systems, 2012, pp. 82–90."},"quality_controlled":"1","department":[{"_id":"ChLa"}],"date_updated":"2021-01-12T06:59:59Z","title":"Dynamic pruning of factor graphs for maximum marginal prediction","volume":1,"publisher":"Neural Information Processing Systems","date_published":"2012-12-01T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","month":"12","abstract":[{"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.","lang":"eng"}]},{"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","full_name":"Zufferey, Damien"},{"full_name":"Nowak, Martin","first_name":"Martin","last_name":"Nowak"}],"oa_version":"Submitted Version","project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","volume":301,"language":[{"iso":"eng"}],"month":"05","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3322297/","open_access":"1"}],"status":"public","type":"journal_article","_id":"2848","date_created":"2018-12-11T11:59:55Z","ec_funded":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["22394652"]},"citation":{"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>","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>.","ista":"Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 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.","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>.","short":"K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173."},"date_updated":"2021-01-12T07:00:12Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Evolutionary game dynamics in populations with different learners","publisher":"Elsevier","date_published":"2012-05-21T00:00:00Z","pmid":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"}],"publication_status":"published","day":"21","doi":"10.1016/j.jtbi.2012.02.021","page":"161 - 173","year":"2012","oa":1,"publication":"Journal of Theoretical Biology","intvolume":"       301","publist_id":"3946","scopus_import":1},{"scopus_import":1,"publication":"Russian Mathematical Surveys","intvolume":"        67","publist_id":"3943","oa":1,"year":"2012","day":"01","page":"1167 - 1168","doi":"10.1070/RM2012v067n06ABEH004820","ddc":["000"],"publication_status":"published","title":"On the configuration space of Steiner minimal trees","file_date_updated":"2020-07-14T12:45:51Z","publisher":"IOP Publishing Ltd.","date_published":"2012-01-01T00:00:00Z","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>.","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","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>","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>.","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. 67(6), 1167–1168.","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>","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."},"date_updated":"2021-01-12T07:00:13Z","department":[{"_id":"HeEd"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","pubrep_id":"546","type":"journal_article","_id":"2849","date_created":"2018-12-11T11:59:55Z","status":"public","issue":"6","file":[{"date_created":"2018-12-12T10:14:26Z","date_updated":"2020-07-14T12:45:51Z","content_type":"application/pdf","file_name":"IST-2016-546-v1+1_2014-J-05-SteinerMinTrees.pdf","relation":"main_file","access_level":"open_access","file_size":392021,"file_id":"5078","checksum":"44ee8d173487e8ed41a51136816bbeb4","creator":"system"}],"month":"01","has_accepted_license":"1","volume":67,"language":[{"iso":"eng"}],"oa_version":"Submitted Version","quality_controlled":"1","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Strelkova, Nataliya","first_name":"Nataliya","last_name":"Strelkova"}]},{"publication":"Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences","intvolume":"       367","publist_id":"3887","type":"journal_article","_id":"2875","date_created":"2018-12-11T12:00:05Z","oa":1,"page":"1469 - 1478","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3321684/","open_access":"1"}],"status":"public","doi":"10.1098/rstb.2011.0233","year":"2012","day":"05","issue":"1595","abstract":[{"text":"Phytohormones are important plant growth regulators that control many developmental processes, such as cell division, cell differentiation, organogenesis and morphogenesis. They regulate a multitude of apparently unrelated physiological processes, often with overlapping roles, and they mutually modulate their effects. These features imply important synergistic and antagonistic interactions between the various plant hormones. Auxin and cytokinin are central hormones involved in the regulation of plant growth and development, including processes determining root architecture, such as root pole establishment during early embryogenesis, root meristem maintenance and lateral root organogenesis. Thus, to control root development both pathways put special demands on the mechanisms that balance their activities and mediate their interactions. Here, we summarize recent knowledge on the role of auxin and cytokinin in the regulation of root architecture with special focus on lateral root organogenesis, discuss the latest findings on the molecular mechanisms of their interactions, and present forward genetic screen as a tool to identify novel molecular components of the auxin and cytokinin crosstalk.","lang":"eng"}],"month":"06","publication_status":"published","volume":367,"title":"Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development","date_published":"2012-06-05T00:00:00Z","publisher":"Royal Society, The","citation":{"ieee":"A. Bielach, J. Duclercq, P. Marhavý, and E. Benková, “Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development,” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 367, no. 1595. Royal Society, The, pp. 1469–1478, 2012.","chicago":"Bielach, Agnieszka, Jérôme Duclercq, Peter Marhavý, and Eva Benková. “Genetic Approach towards the Identification of Auxin - Cytokinin Crosstalk Components Involved in Root Development.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, The, 2012. <a href=\"https://doi.org/10.1098/rstb.2011.0233\">https://doi.org/10.1098/rstb.2011.0233</a>.","ama":"Bielach A, Duclercq J, Marhavý P, Benková E. Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. <i>Philosophical Transactions of the Royal Society of London Series B, Biological Sciences</i>. 2012;367(1595):1469-1478. doi:<a href=\"https://doi.org/10.1098/rstb.2011.0233\">10.1098/rstb.2011.0233</a>","ista":"Bielach A, Duclercq J, Marhavý P, Benková E. 2012. Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences. 367(1595), 1469–1478.","apa":"Bielach, A., Duclercq, J., Marhavý, P., &#38; Benková, E. (2012). Genetic approach towards the identification of auxin - cytokinin crosstalk components involved in root development. <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>. Royal Society, The. <a href=\"https://doi.org/10.1098/rstb.2011.0233\">https://doi.org/10.1098/rstb.2011.0233</a>","mla":"Bielach, Agnieszka, et al. “Genetic Approach towards the Identification of Auxin - Cytokinin Crosstalk Components Involved in Root Development.” <i>Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences</i>, vol. 367, no. 1595, Royal Society, The, 2012, pp. 1469–78, doi:<a href=\"https://doi.org/10.1098/rstb.2011.0233\">10.1098/rstb.2011.0233</a>.","short":"A. Bielach, J. Duclercq, P. Marhavý, E. Benková, Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 367 (2012) 1469–1478."},"date_updated":"2021-01-12T07:00:25Z","quality_controlled":0,"extern":1,"author":[{"first_name":"Agnieszka","last_name":"Bielach","full_name":"Bielach, Agnieszka"},{"full_name":"Duclercq, Jérôme","last_name":"Duclercq","first_name":"Jérôme"},{"id":"3F45B078-F248-11E8-B48F-1D18A9856A87","full_name":"Peter Marhavy","last_name":"Marhavy","first_name":"Peter","orcid":"0000-0001-5227-5741"},{"full_name":"Eva Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva"}]},{"publist_id":"3886","intvolume":"        79","publication":"Phytochemistry","doi":"10.1016/j.phytochem.2012.03.012","page":"67 - 77","year":"2012","day":"01","status":"public","date_created":"2018-12-11T12:00:05Z","type":"journal_article","_id":"2876","date_published":"2012-07-01T00:00:00Z","publisher":"Elsevier","title":"Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole","volume":79,"month":"07","publication_status":"published","abstract":[{"text":"Cytokinin (CK) activity is regulated by the complex interplay of their metabolism, transport, stability and cellular/tissue localization. O-glucosides of zeatin-type CKs are postulated to be storage and/or transport forms. Active CK levels are determined in part by their differential distribution of CK metabolites across different subcellular compartments. We have previously shown that overexpressing chloroplast-localized Zm-p60.1, a maize β-glucosidase capable of releasing active cytokinins from their O- and N3-glucosides, perturbs CK homeostasis in transgenic tobacco. We obtained tobacco (Nicotiana tabacum L., cv Petit Havana SR1) plants overexpressing a recombinant Zm-p60.1 that is targeted to the vacuole. The protein is correctly processed and localized to the vacuole. When grown on medium containing exogenous zeatin, transgenic seedlings rapidly accumulate fresh weight due to ectopic growths at the base of the hypocotyl. The presence of the enzyme in these ectopic structures is shown by histochemical staining. CK quantification reveals that these transgenic seedlings are unable to accumulate zeatin-O-glucoside to levels similar to those observed in the wild type. When crossed with tobacco overexpressing the zeatin-O-glucosyltransferase gene from Phaseolus, the vacuolar variant shows an almost complete reversion in the root elongation assay. This is the first evidence from intact plants that the vacuole is the storage organelle for CK O-glucosides and that they are available to attack by Zm-p60.1. We propose the use of Zm-p60.1 as a robust molecular tool that exploits the reversibility of O-glucosylation and enables delicate manipulations of active CK content at the cellular level.","lang":"eng"}],"author":[{"full_name":"Kiran, Nagavalli S","last_name":"Kiran","first_name":"Nagavalli"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","last_name":"Benková","first_name":"Eva","orcid":"0000-0002-8510-9739"},{"full_name":"Reková, Alena","last_name":"Reková","first_name":"Alena"},{"last_name":"Dubová","first_name":"Jaroslava","full_name":"Dubová, Jaroslava"},{"full_name":"Malbeck, Jiří","first_name":"Jiří","last_name":"Malbeck"},{"first_name":"Klaus","last_name":"Palme","full_name":"Palme, Klaus"},{"last_name":"Brzobohatý","first_name":"Břetislav","full_name":"Brzobohatý, Břetislav"}],"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T07:00:25Z","citation":{"apa":"Kiran, N., Benková, E., Reková, A., Dubová, J., Malbeck, J., Palme, K., &#38; Brzobohatý, B. (2012). Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole. <i>Phytochemistry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.phytochem.2012.03.012\">https://doi.org/10.1016/j.phytochem.2012.03.012</a>","chicago":"Kiran, Nagavalli, Eva Benková, Alena Reková, Jaroslava Dubová, Jiří Malbeck, Klaus Palme, and Břetislav Brzobohatý. “Retargeting a Maize β-Glucosidase to the Vacuole - Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the Vacuole.” <i>Phytochemistry</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.phytochem.2012.03.012\">https://doi.org/10.1016/j.phytochem.2012.03.012</a>.","ista":"Kiran N, Benková E, Reková A, Dubová J, Malbeck J, Palme K, Brzobohatý B. 2012. Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole. Phytochemistry. 79, 67–77.","ama":"Kiran N, Benková E, Reková A, et al. Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole. <i>Phytochemistry</i>. 2012;79:67-77. doi:<a href=\"https://doi.org/10.1016/j.phytochem.2012.03.012\">10.1016/j.phytochem.2012.03.012</a>","ieee":"N. Kiran <i>et al.</i>, “Retargeting a maize β-glucosidase to the vacuole - Evidence from intact plants that zeatin-O-glucoside is stored in the vacuole,” <i>Phytochemistry</i>, vol. 79. Elsevier, pp. 67–77, 2012.","mla":"Kiran, Nagavalli, et al. “Retargeting a Maize β-Glucosidase to the Vacuole - Evidence from Intact Plants That Zeatin-O-Glucoside Is Stored in the Vacuole.” <i>Phytochemistry</i>, vol. 79, Elsevier, 2012, pp. 67–77, doi:<a href=\"https://doi.org/10.1016/j.phytochem.2012.03.012\">10.1016/j.phytochem.2012.03.012</a>.","short":"N. Kiran, E. Benková, A. Reková, J. Dubová, J. Malbeck, K. Palme, B. Brzobohatý, Phytochemistry 79 (2012) 67–77."}},{"publist_id":"3884","intvolume":"       159","publication":"Plant Physiology","date_created":"2018-12-11T12:00:06Z","type":"journal_article","_id":"2878","day":"01","status":"public","year":"2012","doi":"10.1104/pp.112.200402","page":"1501 - 1510","publication_status":"published","month":"08","abstract":[{"lang":"eng","text":"Phyllotaxis, the regular arrangement of leaves and flowers around the stem, is a key feature of plant architecture. Current models propose that the spatiotemporal regulation of organ initiation is controlled by a positive feedback loop between the plant hormone auxin and its efflux carrier PIN-FORMED1 (PIN1). Consequently, pin1 mutants give rise to naked inflorescence stalks with few or no flowers, indicating that PIN1 plays a crucial role in organ initiation. However, pin1 mutants do produce leaves. In order to understand the regulatory mechanisms controlling leaf initiation in Arabidopsis (Arabidopsis thaliana) rosettes, we have characterized the vegetative pin1 phenotype in detail. We show that although the timing of leaf initiation in vegetative pin1 mutants is variable and divergence angles clearly deviate from the canonical 137° value, leaves are not positioned at random during early developmental stages. Our data further indicate that other PIN proteins are unlikely to explain the persistence of leaf initiation and positioning during pin1 vegetative development. Thus, phyllotaxis appears to be more complex than suggested by current mechanistic models."}],"issue":"4","date_published":"2012-08-01T00:00:00Z","publisher":"American Society of Plant Biologists","volume":159,"title":"Pin1 independent leaf initiation in Arabidopsis","extern":1,"quality_controlled":0,"date_updated":"2021-01-12T07:00:26Z","citation":{"mla":"Guenot, Bernadette, et al. “Pin1 Independent Leaf Initiation in Arabidopsis.” <i>Plant Physiology</i>, vol. 159, no. 4, American Society of Plant Biologists, 2012, pp. 1501–10, doi:<a href=\"https://doi.org/10.1104/pp.112.200402\">10.1104/pp.112.200402</a>.","short":"B. Guenot, E. Bayer, D. Kierzkowski, R. Smith, T. Mandel, P. Žádníková, E. Benková, C. Kuhlemeier, Plant Physiology 159 (2012) 1501–1510.","chicago":"Guenot, Bernadette, Emmanuelle Bayer, Daniel Kierzkowski, Richard Smith, Therese Mandel, Petra Žádníková, Eva Benková, and Cris Kuhlemeier. “Pin1 Independent Leaf Initiation in Arabidopsis.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2012. <a href=\"https://doi.org/10.1104/pp.112.200402\">https://doi.org/10.1104/pp.112.200402</a>.","ista":"Guenot B, Bayer E, Kierzkowski D, Smith R, Mandel T, Žádníková P, Benková E, Kuhlemeier C. 2012. Pin1 independent leaf initiation in Arabidopsis. Plant Physiology. 159(4), 1501–1510.","ama":"Guenot B, Bayer E, Kierzkowski D, et al. Pin1 independent leaf initiation in Arabidopsis. <i>Plant Physiology</i>. 2012;159(4):1501-1510. doi:<a href=\"https://doi.org/10.1104/pp.112.200402\">10.1104/pp.112.200402</a>","apa":"Guenot, B., Bayer, E., Kierzkowski, D., Smith, R., Mandel, T., Žádníková, P., … Kuhlemeier, C. (2012). Pin1 independent leaf initiation in Arabidopsis. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.112.200402\">https://doi.org/10.1104/pp.112.200402</a>","ieee":"B. Guenot <i>et al.</i>, “Pin1 independent leaf initiation in Arabidopsis,” <i>Plant Physiology</i>, vol. 159, no. 4. American Society of Plant Biologists, pp. 1501–1510, 2012."},"author":[{"first_name":"Bernadette","last_name":"Guenot","full_name":"Guenot, Bernadette"},{"first_name":"Emmanuelle","last_name":"Bayer","full_name":"Bayer, Emmanuelle"},{"first_name":"Daniel","last_name":"Kierzkowski","full_name":"Kierzkowski, Daniel"},{"first_name":"Richard","last_name":"Smith","full_name":"Smith, Richard S"},{"full_name":"Mandel, Therese","last_name":"Mandel","first_name":"Therese"},{"full_name":"Žádníková, Petra","last_name":"Žádníková","first_name":"Petra"},{"last_name":"Benková","first_name":"Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková"},{"full_name":"Kuhlemeier, Cris","last_name":"Kuhlemeier","first_name":"Cris"}]},{"status":"public","doi":"10.1105/tpc.112.100164","page":"2886 - 2897","year":"2012","day":"01","date_created":"2018-12-11T12:00:06Z","_id":"2879","type":"journal_article","intvolume":"        24","publist_id":"3885","publication":"Plant Cell","author":[{"full_name":"Bencivenga, Stefano","last_name":"Bencivenga","first_name":"Stefano"},{"full_name":"Simonini, Sara","last_name":"Simonini","first_name":"Sara"},{"first_name":"Eva","last_name":"Benková","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková"},{"last_name":"Colombo","first_name":"Lucia","full_name":"Colombo, Lucia"}],"date_updated":"2021-01-12T07:00:26Z","quality_controlled":0,"extern":1,"citation":{"ieee":"S. Bencivenga, S. Simonini, E. Benková, and L. Colombo, “The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis,” <i>Plant Cell</i>, vol. 24, no. 7. American Society of Plant Biologists, pp. 2886–2897, 2012.","apa":"Bencivenga, S., Simonini, S., Benková, E., &#38; Colombo, L. (2012). The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.112.100164\">https://doi.org/10.1105/tpc.112.100164</a>","chicago":"Bencivenga, Stefano, Sara Simonini, Eva Benková, and Lucia Colombo. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” <i>Plant Cell</i>. American Society of Plant Biologists, 2012. <a href=\"https://doi.org/10.1105/tpc.112.100164\">https://doi.org/10.1105/tpc.112.100164</a>.","ista":"Bencivenga S, Simonini S, Benková E, Colombo L. 2012. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. Plant Cell. 24(7), 2886–2897.","ama":"Bencivenga S, Simonini S, Benková E, Colombo L. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. <i>Plant Cell</i>. 2012;24(7):2886-2897. doi:<a href=\"https://doi.org/10.1105/tpc.112.100164\">10.1105/tpc.112.100164</a>","mla":"Bencivenga, Stefano, et al. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” <i>Plant Cell</i>, vol. 24, no. 7, American Society of Plant Biologists, 2012, pp. 2886–97, doi:<a href=\"https://doi.org/10.1105/tpc.112.100164\">10.1105/tpc.112.100164</a>.","short":"S. Bencivenga, S. Simonini, E. Benková, L. Colombo, Plant Cell 24 (2012) 2886–2897."},"date_published":"2012-07-01T00:00:00Z","publisher":"American Society of Plant Biologists","volume":24,"title":"The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis","abstract":[{"text":"Hormones, such as auxin and cytokinin, are involved in the complex molecular network that regulates the coordinated development of plant organs. Genes controlling ovule patterning have been identified and studied in detail; however, the roles of auxin and cytokinin in ovule development are largely unknown. Here we show that key cytokinin pathway genes, such as isopentenyltransferase and cytokinin receptors, are expressed during ovule development. Also, in a cre1-12 ahk2-2 ahk3-3 triple mutant with severely reduced cytokinin perception, expression of the auxin efflux facilitator PIN-FORMED 1 (PIN1) was severely reduced. In sporocyteless/nozzle (spl/nzz) mutants, which show a similar phenotype to the cre1-12 ahk2-2 ahk3-3 triple mutant, PIN1 expression is also reduced. Treatment with the exogenous cytokinin N6-benzylaminopurine also altered both auxin distribution and patterning of the ovule; this process required the homeodomain transcription factor BELL1 (BEL1). Thus, this article shows that cytokinin regulates ovule development through the regulation of PIN1. Furthermore, the transcription factors BEL1 and SPL/NZZ, previously described as key regulators of ovule development, are needed for the auxin and cytokinin signaling pathways for the correct patterning of the ovule.","lang":"eng"}],"publication_status":"published","month":"07","issue":"7"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"citation":{"short":"T.A. Henzinger, in:, Conference Proceedings MODELS 2012, Springer, 2012, pp. 1–2.","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>.","ieee":"T. A. Henzinger, “Quantitative reactive models,” in <i>Conference proceedings MODELS 2012</i>, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","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>","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>.","ista":"Henzinger TA. 2012. Quantitative reactive models. Conference proceedings MODELS 2012. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 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>"},"date_updated":"2021-01-12T07:00:29Z","department":[{"_id":"ToHe"}],"title":"Quantitative reactive models","publisher":"Springer","date_published":"2012-09-01T00:00:00Z","abstract":[{"lang":"eng","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."}],"publication_status":"published","day":"01","page":"1 - 2","year":"2012","doi":"10.1007/978-3-642-33666-9_1","publication":"Conference proceedings MODELS 2012","intvolume":"      7590","publist_id":"3870","scopus_import":1,"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"oa_version":"None","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"volume":7590,"language":[{"iso":"eng"}],"month":"09","status":"public","_id":"2888","type":"conference","date_created":"2018-12-11T12:00:09Z","ec_funded":1,"conference":{"location":"Innsbruck, Austria","name":"MODELS: Model-driven Engineering Languages and Systems","end_date":"2012-10-05","start_date":"2012-09-30"}},{"author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sivakanth","last_name":"Gopi","full_name":"Gopi, Sivakanth"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Radhakrishna","first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun"},{"first_name":"Nishant","last_name":"Totla","full_name":"Totla, Nishant"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:00:30Z","quality_controlled":"1","department":[{"_id":"ToHe"}],"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"oa_version":"None","citation":{"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>.","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.","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>","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>","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.","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>.","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."},"language":[{"iso":"eng"}],"date_published":"2012-10-01T00:00:00Z","publisher":"ACM","title":"Synthesis from incompatible specifications","abstract":[{"lang":"eng","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."}],"publication_status":"published","month":"10","status":"public","day":"01","year":"2012","doi":"10.1145/2380356.2380371","page":"53 - 62","date_created":"2018-12-11T12:00:10Z","_id":"2890","type":"conference","ec_funded":1,"publist_id":"3868","conference":{"start_date":"2012-10-07","end_date":"2012-10-12","location":"Tampere, Finland","name":"EMSOFT: Embedded Software "},"publication":"Proceedings of the tenth ACM international conference on Embedded software","scopus_import":1},{"volume":18,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_size":559069,"access_level":"open_access","creator":"system","file_id":"4826","checksum":"88da18d3e2cb2e5011d7d10ce38a3864","date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-12T10:10:37Z","content_type":"application/pdf","file_name":"IST-2017-805-v1+1_34.pdf"}],"month":"12","has_accepted_license":"1","author":[{"first_name":"Udi","last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"oa_version":"Published Version","quality_controlled":"1","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"ec_funded":1,"conference":{"location":"Hyderabad, India","name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","end_date":"2012-12-17","start_date":"2012-12-15"},"pubrep_id":"805","status":"public","type":"conference","_id":"2891","date_created":"2018-12-11T12:00:10Z","title":"Approximate determinization of quantitative automata","date_published":"2012-12-01T00:00:00Z","file_date_updated":"2020-07-14T12:45:52Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["004"],"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."}],"publication_status":"published","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"citation":{"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.","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.","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>","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.","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>","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>."},"date_updated":"2021-01-12T07:00:31Z","department":[{"_id":"ToHe"}],"publication":"Leibniz International Proceedings in Informatics","intvolume":"        18","publist_id":"3867","scopus_import":1,"page":"362 - 373","year":"2012","doi":"10.4230/LIPIcs.FSTTCS.2012.362","day":"01","acknowledgement":"We thank Laurent Doyen for great ideas and valuable help in analyzing discounted-sum automata.","oa":1},{"issue":"6","month":"12","publication_status":"published","abstract":[{"lang":"eng","text":"We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. "}],"volume":19,"title":"Fractal and computational geometry for generalizing cartographic objects","article_processing_charge":"No","date_published":"2012-12-01T00:00:00Z","publisher":"Russian Academy of Sciences","language":[{"iso":"rus"}],"oa_version":"Published Version","citation":{"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.","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.","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.","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."},"quality_controlled":"1","department":[{"_id":"HeEd"}],"date_updated":"2023-10-18T07:34:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Musin, Oleg","last_name":"Musin","first_name":"Oleg"},{"full_name":"Ukhalov, Alexey","last_name":"Ukhalov","first_name":"Alexey"},{"full_name":"Yakimova, Olga","last_name":"Yakimova","first_name":"Olga"},{"first_name":"Vladislav","last_name":"Alexeev","full_name":"Alexeev, Vladislav"},{"full_name":"Bogaevskaya, Victoriya","first_name":"Victoriya","last_name":"Bogaevskaya"},{"last_name":"Gorohov","first_name":"Andrey","full_name":"Gorohov, Andrey"},{"full_name":"Preobrazhenskaya, Margarita","last_name":"Preobrazhenskaya","first_name":"Margarita"}],"publication":"Modeling and Analysis of Information Systems","publist_id":"3845","intvolume":"        19","article_type":"original","_id":"2902","type":"journal_article","date_created":"2018-12-11T12:00:15Z","oa":1,"page":"152 - 160","year":"2012","main_file_link":[{"open_access":"1","url":"http://mi.mathnet.ru/eng/mais280"}],"day":"01","status":"public"},{"scopus_import":1,"publist_id":"3844","oa":1,"day":"06","doi":"10.1109/ISVD.2012.11","year":"2012","page":"41 - 48","publication_status":"published","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"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:45:52Z","publisher":"IEEE","date_published":"2012-08-06T00:00:00Z","title":"The adaptive topology of a digital image","department":[{"_id":"HeEd"},{"_id":"MaJö"}],"date_updated":"2021-01-12T07:00:35Z","citation":{"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.","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.","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>","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>","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>.","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."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","pubrep_id":"545","conference":{"name":"ISVD: International Symposium on Voronoi Diagrams in Science and Engineering","location":"New Brunswick, NJ, USA ","start_date":"2012-06-27","end_date":"2012-06-29"},"date_created":"2018-12-11T12:00:15Z","type":"conference","_id":"2903","status":"public","month":"08","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-12T10:09:41Z","content_type":"application/pdf","file_name":"IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf","relation":"main_file","file_size":760548,"access_level":"open_access","creator":"system","checksum":"444869a4e8abf07834f88b6e5cb5e9c3","file_id":"4765"}],"language":[{"iso":"eng"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Olga","last_name":"Symonova","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","full_name":"Symonova, Olga"}]},{"language":[{"iso":"eng"}],"article_processing_charge":"No","volume":24,"month":"01","has_accepted_license":"1","issue":"3","file":[{"relation":"main_file","file_size":819275,"access_level":"open_access","creator":"dernst","checksum":"6954bfe9d7f4119fbdda7a11cf0f5c67","file_id":"7819","date_updated":"2020-07-14T12:45:52Z","date_created":"2020-05-11T12:40:39Z","content_type":"application/pdf","file_name":"JTNB_2012__24_3_729_0.pdf"}],"author":[{"last_name":"Pausinger","first_name":"Florian","orcid":"0000-0002-8379-3768","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian"}],"quality_controlled":"1","oa_version":"Published Version","status":"public","publication_identifier":{"issn":["1246-7405"],"eissn":["2118-8572"]},"date_created":"2018-12-11T12:00:15Z","type":"journal_article","_id":"2904","article_type":"original","file_date_updated":"2020-07-14T12:45:52Z","date_published":"2012-01-01T00:00:00Z","publisher":"Université de Bordeaux","title":"Weak multipliers for generalized van der Corput sequences","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"},{"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.","lang":"fre"}],"publication_status":"published","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-10-18T07:53:47Z","department":[{"_id":"HeEd"}],"citation":{"short":"F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.","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>.","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.","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>.","ista":"Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749.","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>","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>"},"intvolume":"        24","publist_id":"3843","publication":"Journal de Theorie des Nombres des Bordeaux","scopus_import":"1","day":"01","page":"729 - 749","year":"2012","doi":"10.5802/jtnb.819","oa":1},{"day":"01","status":"public","year":"2012","date_created":"2018-12-11T12:00:18Z","_id":"2911","type":"journal_article","publist_id":"3832","publication":"Automatic Control and Computer Sciences","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Ivanov","first_name":"Alexander","full_name":"Ivanov, Alexander"},{"first_name":"Roman","last_name":"Karasev","full_name":"Karasev, Roman"}],"date_updated":"2021-01-12T07:00:38Z","quality_controlled":0,"extern":1,"citation":{"apa":"Edelsbrunner, H., Ivanov, A., &#38; Karasev, R. (2012). Open problems in discrete and computational geometry. <i>Automatic Control and Computer Sciences</i>. Springer.","ama":"Edelsbrunner H, Ivanov A, Karasev R. Open problems in discrete and computational geometry. <i>Automatic Control and Computer Sciences</i>. 2012;in print.","ista":"Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. in print.","chicago":"Edelsbrunner, Herbert, Alexander Ivanov, and Roman Karasev. “Open Problems in Discrete and Computational Geometry.” <i>Automatic Control and Computer Sciences</i>. Springer, 2012.","ieee":"H. Edelsbrunner, A. Ivanov, and R. Karasev, “Open problems in discrete and computational geometry,” <i>Automatic Control and Computer Sciences</i>, vol. in print. Springer, 2012.","short":"H. Edelsbrunner, A. Ivanov, R. Karasev, Automatic Control and Computer Sciences in print (2012).","mla":"Edelsbrunner, Herbert, et al. “Open Problems in Discrete and Computational Geometry.” <i>Automatic Control and Computer Sciences</i>, vol. in print, Springer, 2012."},"publisher":"Springer","date_published":"2012-01-01T00:00:00Z","volume":"in print","title":"Open problems in discrete and computational geometry","abstract":[{"lang":"eng","text":"We have selected problems that may not yet be well known, but have the\npotential to push the research in interesting directions. In particular, we state\nproblems that do not require specific knowledge outside the standard circle of ideas\nin discrete geometry. Despite the relatively simple statements, these problems are\nrelated to current research and their solutions are likely to require new ideas and\napproaches. We have chosen problems from different fields to make this short paper\nattractive to a wide range of specialists."}],"month":"01","publication_status":"published"},{"publication":"Russian Mathematical Surveys","publist_id":"3831","intvolume":"        67","doi":"10.4213/rm9503","year":"2012","page":"1167–1168","status":"public","day":"01","_id":"2912","type":"journal_article","date_created":"2018-12-11T12:00:18Z","volume":67,"title":"On the configuration space for the shortest networks","article_processing_charge":"No","date_published":"2012-10-01T00:00:00Z","publisher":"Russian Academy of Sciences","language":[{"iso":"eng"}],"issue":"6","publication_status":"published","month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Nataliya","last_name":"Strelkova","full_name":"Strelkova, Nataliya"}],"citation":{"short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","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>.","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.","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>","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.","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>."},"oa_version":"None","quality_controlled":"1","department":[{"_id":"HeEd"}],"date_updated":"2023-10-17T11:40:39Z"},{"publisher":"Deutsches Zentrum für Luft und Raumfahrt","language":[{"iso":"eng"}],"date_published":"2012-10-11T00:00:00Z","title":"Multi-modal learning for dynamic tactile sensing","article_processing_charge":"No","month":"10","publication_status":"published","author":[{"full_name":"Kroemer, Oliver","first_name":"Oliver","last_name":"Kroemer"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","last_name":"Peters","full_name":"Peters, Jan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ChLa"}],"quality_controlled":"1","date_updated":"2023-10-17T07:58:59Z","citation":{"ieee":"O. Kroemer, C. Lampert, and J. Peters, “Multi-modal learning for dynamic tactile sensing,” 2012.","ista":"Kroemer O, Lampert C, Peters J. 2012. Multi-modal learning for dynamic tactile sensing","ama":"Kroemer O, Lampert C, Peters J. Multi-modal learning for dynamic tactile sensing. In: Deutsches Zentrum für Luft und Raumfahrt; 2012.","chicago":"Kroemer, Oliver, Christoph Lampert, and Jan Peters. “Multi-Modal Learning for Dynamic Tactile Sensing.” 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.","mla":"Kroemer, Oliver, et al. <i>Multi-Modal Learning for Dynamic Tactile Sensing</i>. Deutsches Zentrum für Luft und Raumfahrt, 2012.","short":"O. Kroemer, C. Lampert, J. Peters, in:, Deutsches Zentrum für Luft und Raumfahrt, 2012."},"oa_version":"None","publist_id":"3828","acknowledgement":"The project receives funding from the European Community’s Seventh Framework Programme under grant agreement\r\nno. ICT- 248273 GeRT.","status":"public","year":"2012","day":"11","date_created":"2018-12-11T12:00:19Z","type":"conference","_id":"2915"},{"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"date_updated":"2023-02-23T10:12:05Z","citation":{"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.","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.","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>","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>","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>.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42."},"external_id":{"arxiv":["1210.2450"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","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"}],"date_published":"2012-10-07T00:00:00Z","publisher":"EPTCS","title":"Interface Simulation Distances","oa":1,"year":"2012","doi":"10.4204/EPTCS.96.3","day":"07","page":"29 - 42","scopus_import":1,"related_material":{"record":[{"status":"public","id":"1733","relation":"later_version"}]},"publist_id":"3827","arxiv":1,"intvolume":"        96","publication":"Electronic Proceedings in Theoretical Computer Science","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","last_name":"Cerny","first_name":"Pavol"},{"last_name":"Chmelik","first_name":"Martin","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","first_name":"Arjun","last_name":"Radhakrishna"}],"month":"10","language":[{"iso":"eng"}],"volume":96,"date_created":"2018-12-11T12:00:19Z","type":"conference","_id":"2916","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"status":"public","conference":{"end_date":"2012-09-08","start_date":"2012-09-06","name":"GandALF: Games, Automata, Logic, and Formal Verification","location":"Napoli, Italy"},"ec_funded":1},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-5985-7653","last_name":"Vladar","first_name":"Harold","full_name":"Vladar, Harold","id":"2A181218-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"None","citation":{"short":"H. de Vladar, International Journal of Astrobiology 12 (2012) 53–62.","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>.","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.","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>.","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>","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>","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."},"date_updated":"2021-01-12T07:00:41Z","quality_controlled":"1","department":[{"_id":"NiBa"}],"volume":12,"title":"The game of active search for extra terrestrial intelligence Breaking the Great Silence ","date_published":"2012-11-06T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Cambridge University Press","issue":"1","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"}],"month":"11","publication_status":"published","status":"public","page":"53 - 62","doi":"10.1017/S1473550412000407","year":"2012","day":"06","type":"journal_article","_id":"2917","date_created":"2018-12-11T12:00:19Z","publication":"International Journal of Astrobiology","intvolume":"        12","publist_id":"3821","scopus_import":1},{"language":[{"iso":"eng"}],"date_published":"2012-05-29T00:00:00Z","publisher":"ArXiv","article_processing_charge":"No","title":"Generalized sequential tree-reweighted message passing","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"}],"month":"05","publication_status":"published","author":[{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"first_name":"Thomas","last_name":"Schoenemann","full_name":"Schoenemann, Thomas"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1205.6352"]},"date_updated":"2021-01-12T07:00:45Z","department":[{"_id":"VlKo"}],"oa_version":"Preprint","citation":{"short":"V. Kolmogorov, T. Schoenemann, ArXiv (2012).","mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, ArXiv, 2012.","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.","ama":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. <i>arXiv</i>. 2012.","ista":"Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted message passing. arXiv, .","chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>. ArXiv, 2012."},"arxiv":1,"publist_id":"3809","publication":"arXiv","page":"16","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.6352"}],"day":"29","status":"public","year":"2012","date_created":"2018-12-11T12:00:23Z","oa":1,"_id":"2928","type":"preprint"},{"publist_id":"3807","_id":"2929","type":"report","oa":1,"date_created":"2018-12-11T12:00:24Z","main_file_link":[{"url":"http://arxiv.org/abs/1207.7213","open_access":"1"}],"year":"2012","day":"01","status":"public","publication_status":"published","month":"01","title":"The power of linear programming for valued CSPs: a constructive characterization","date_published":"2012-01-01T00:00:00Z","publisher":"Unknown","citation":{"mla":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","short":"V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.","ieee":"V. Kolmogorov, <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown, 2012.","chicago":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","ista":"Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive characterization, Unknown,p.","ama":"Kolmogorov V. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown; 2012.","apa":"Kolmogorov, V. (2012). <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown."},"quality_controlled":0,"extern":1,"date_updated":"2019-04-26T07:22:21Z","author":[{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}]}]