Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–49 of 49 results for author: <span class="mathjax">Dubois, D</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/" aria-role="search"> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Dubois, D"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Dubois%2C+D&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Dubois, D"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2409.07444">arXiv:2409.07444</a> <span> [<a href="https://arxiv.org/pdf/2409.07444">pdf</a>, <a href="https://arxiv.org/format/2409.07444">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Human-Computer Interaction">cs.HC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Echoes of Privacy: Uncovering the Profiling Practices of Voice Assistants </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Khezresmaeilzadeh%2C+T">Tina Khezresmaeilzadeh</a>, <a href="/search/?searchtype=author&query=Zhu%2C+E">Elaine Zhu</a>, <a href="/search/?searchtype=author&query=Grieco%2C+K">Kiersten Grieco</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Psounis%2C+K">Konstantinos Psounis</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2409.07444v2-abstract-short" style="display: inline;"> Many companies, including Google, Amazon, and Apple, offer voice assistants as a convenient solution for answering general voice queries and accessing their services. These voice assistants have gained popularity and can be easily accessed through various smart devices such as smartphones, smart speakers, smartwatches, and an increasing array of other devices. However, this convenience comes with… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.07444v2-abstract-full').style.display = 'inline'; document.getElementById('2409.07444v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2409.07444v2-abstract-full" style="display: none;"> Many companies, including Google, Amazon, and Apple, offer voice assistants as a convenient solution for answering general voice queries and accessing their services. These voice assistants have gained popularity and can be easily accessed through various smart devices such as smartphones, smart speakers, smartwatches, and an increasing array of other devices. However, this convenience comes with potential privacy risks. For instance, while companies vaguely mention in their privacy policies that they may use voice interactions for user profiling, it remains unclear to what extent this profiling occurs and whether voice interactions pose greater privacy risks compared to other interaction modalities. In this paper, we conduct 1171 experiments involving a total of 24530 queries with different personas and interaction modalities over the course of 20 months to characterize how the three most popular voice assistants profile their users. We analyze factors such as the labels assigned to users, their accuracy, the time taken to assign these labels, differences between voice and web interactions, and the effectiveness of profiling remediation tools offered by each voice assistant. Our findings reveal that profiling can happen without interaction, can be incorrect and inconsistent at times, may take several days to weeks for changes to occur, and can be influenced by the interaction modality. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.07444v2-abstract-full').style.display = 'none'; document.getElementById('2409.07444v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 11 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.14332">arXiv:2401.14332</a> <span> [<a href="https://arxiv.org/pdf/2401.14332">pdf</a>, <a href="https://arxiv.org/format/2401.14332">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> SunBlock: Cloudless Protection for IoT Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Safronov%2C+V">Vadim Safronov</a>, <a href="/search/?searchtype=author&query=Mandalari%2C+A+M">Anna Maria Mandalari</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a>, <a href="/search/?searchtype=author&query=Haddadi%2C+H">Hamed Haddadi</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.14332v1-abstract-short" style="display: inline;"> With an increasing number of Internet of Things (IoT) devices present in homes, there is a rise in the number of potential information leakage channels and their associated security threats and privacy risks. Despite a long history of attacks on IoT devices in unprotected home networks, the problem of accurate, rapid detection and prevention of such attacks remains open. Many existing IoT protecti… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.14332v1-abstract-full').style.display = 'inline'; document.getElementById('2401.14332v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.14332v1-abstract-full" style="display: none;"> With an increasing number of Internet of Things (IoT) devices present in homes, there is a rise in the number of potential information leakage channels and their associated security threats and privacy risks. Despite a long history of attacks on IoT devices in unprotected home networks, the problem of accurate, rapid detection and prevention of such attacks remains open. Many existing IoT protection solutions are cloud-based, sometimes ineffective, and might share consumer data with unknown third parties. This paper investigates the potential for effective IoT threat detection locally, on a home router, using AI tools combined with classic rule-based traffic-filtering algorithms. Our results show that with a slight rise of router hardware resources caused by machine learning and traffic filtering logic, a typical home router instrumented with our solution is able to effectively detect risks and protect a typical home IoT network, equaling or outperforming existing popular solutions, without any effects on benign IoT functionality, and without relying on cloud services and third parties. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.14332v1-abstract-full').style.display = 'none'; document.getElementById('2401.14332v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">This paper is accepted at Passive and Active Measurement (PAM) conference 2024</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2304.03045">arXiv:2304.03045</a> <span> [<a href="https://arxiv.org/pdf/2304.03045">pdf</a>, <a href="https://arxiv.org/format/2304.03045">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> Protected or Porous: A Comparative Analysis of Threat Detection Capability of IoT Safeguards </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Mandalari%2C+A+M">Anna Maria Mandalari</a>, <a href="/search/?searchtype=author&query=Haddadi%2C+H">Hamed Haddadi</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2304.03045v1-abstract-short" style="display: inline;"> Consumer Internet of Things (IoT) devices are increasingly common, from smart speakers to security cameras, in homes. Along with their benefits come potential privacy and security threats. To limit these threats a number of commercial services have become available (IoT safeguards). The safeguards claim to provide protection against IoT privacy risks and security threats. However, the effectivenes… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2304.03045v1-abstract-full').style.display = 'inline'; document.getElementById('2304.03045v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2304.03045v1-abstract-full" style="display: none;"> Consumer Internet of Things (IoT) devices are increasingly common, from smart speakers to security cameras, in homes. Along with their benefits come potential privacy and security threats. To limit these threats a number of commercial services have become available (IoT safeguards). The safeguards claim to provide protection against IoT privacy risks and security threats. However, the effectiveness and the associated privacy risks of these safeguards remains a key open question. In this paper, we investigate the threat detection capabilities of IoT safeguards for the first time. We develop and release an approach for automated safeguards experimentation to reveal their response to common security threats and privacy risks. We perform thousands of automated experiments using popular commercial IoT safeguards when deployed in a large IoT testbed. Our results indicate not only that these devices may be ineffective in preventing risks, but also their cloud interactions and data collection operations may introduce privacy risks for the households that adopt them. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2304.03045v1-abstract-full').style.display = 'none'; document.getElementById('2304.03045v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 April, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2303.13168">arXiv:2303.13168</a> <span> [<a href="https://arxiv.org/pdf/2303.13168">pdf</a>, <a href="https://arxiv.org/ps/2303.13168">ps</a>, <a href="https://arxiv.org/format/2303.13168">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Logic in Computer Science">cs.LO</span> </div> </div> <p class="title is-5 mathjax"> An elementary belief function logic </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Godo%2C+L">Lluis Godo</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2303.13168v1-abstract-short" style="display: inline;"> Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and plausibility functions as well as between upper and lower probabilities extend the duality between possibility and necessity modalities to the graded environment. It has b… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2303.13168v1-abstract-full').style.display = 'inline'; document.getElementById('2303.13168v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2303.13168v1-abstract-full" style="display: none;"> Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and plausibility functions as well as between upper and lower probabilities extend the duality between possibility and necessity modalities to the graded environment. It has been shown that the all-or-nothing version of possibility theory can be exactly captured by a minimal epistemic logic (MEL) that uses a very small fragment of the KD modal logic, without resorting to relational semantics. Besides, the case of belief functions has been studied independently, and a belief function logic has been obtained by extending the modal logic S5 to graded modalities using 艁ukasiewicz logic, albeit using relational semantics. This paper shows that a simpler belief function logic can be devised by adding 艁ukasiewicz logic on top of MEL. It allows for a more natural semantics in terms of Shafer basic probability assignments. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2303.13168v1-abstract-full').style.display = 'none'; document.getElementById('2303.13168v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 March, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2204.10920">arXiv:2204.10920</a> <span> [<a href="https://arxiv.org/pdf/2204.10920">pdf</a>, <a href="https://arxiv.org/format/2204.10920">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1145/3618257.3624803">10.1145/3618257.3624803 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Tracking, Profiling, and Ad Targeting in the Alexa Echo Smart Speaker Ecosystem </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Iqbal%2C+U">Umar Iqbal</a>, <a href="/search/?searchtype=author&query=Bahrami%2C+P+N">Pouneh Nikkhah Bahrami</a>, <a href="/search/?searchtype=author&query=Trimananda%2C+R">Rahmadi Trimananda</a>, <a href="/search/?searchtype=author&query=Cui%2C+H">Hao Cui</a>, <a href="/search/?searchtype=author&query=Gamero-Garrido%2C+A">Alexander Gamero-Garrido</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Daniel Dubois</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a>, <a href="/search/?searchtype=author&query=Markopoulou%2C+A">Athina Markopoulou</a>, <a href="/search/?searchtype=author&query=Roesner%2C+F">Franziska Roesner</a>, <a href="/search/?searchtype=author&query=Shafiq%2C+Z">Zubair Shafiq</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2204.10920v5-abstract-short" style="display: inline;"> Smart speakers collect voice commands, which can be used to infer sensitive information about users. Given the potential for privacy harms, there is a need for greater transparency and control over the data collected, used, and shared by smart speaker platforms as well as third party skills supported on them. To bridge this gap, we build a framework to measure data collection, usage, and sharing b… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.10920v5-abstract-full').style.display = 'inline'; document.getElementById('2204.10920v5-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2204.10920v5-abstract-full" style="display: none;"> Smart speakers collect voice commands, which can be used to infer sensitive information about users. Given the potential for privacy harms, there is a need for greater transparency and control over the data collected, used, and shared by smart speaker platforms as well as third party skills supported on them. To bridge this gap, we build a framework to measure data collection, usage, and sharing by the smart speaker platforms. We apply our framework to the Amazon smart speaker ecosystem. Our results show that Amazon and third parties, including advertising and tracking services that are unique to the smart speaker ecosystem, collect smart speaker interaction data. We also find that Amazon processes smart speaker interaction data to infer user interests and uses those inferences to serve targeted ads to users. Smart speaker interaction also leads to ad targeting and as much as 30X higher bids in ad auctions, from third party advertisers. Finally, we find that Amazon's and third party skills' data practices are often not clearly disclosed in their policy documents. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.10920v5-abstract-full').style.display = 'none'; document.getElementById('2204.10920v5-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 October, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 April, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Published at the ACM Internet Measurement Conference 2023</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2110.11992">arXiv:2110.11992</a> <span> [<a href="https://arxiv.org/pdf/2110.11992">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Earth and Planetary Astrophysics">astro-ph.EP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1016/j.icarus.2021.114764">10.1016/j.icarus.2021.114764 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Volatile transport modeling on Triton with new observational constraints </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Bertrand%2C+T">T. Bertrand</a>, <a href="/search/?searchtype=author&query=Lellouch%2C+E">E. Lellouch</a>, <a href="/search/?searchtype=author&query=Holler%2C+B+J">B. J. Holler</a>, <a href="/search/?searchtype=author&query=Young%2C+L+A">L. A. Young</a>, <a href="/search/?searchtype=author&query=Schmitt%2C+B">B. Schmitt</a>, <a href="/search/?searchtype=author&query=Oliveira%2C+J+M">J. Marques Oliveira</a>, <a href="/search/?searchtype=author&query=Sicardy%2C+B">B. Sicardy</a>, <a href="/search/?searchtype=author&query=Forget%2C+F">F. Forget</a>, <a href="/search/?searchtype=author&query=Grundy%2C+W+M">W. M. Grundy</a>, <a href="/search/?searchtype=author&query=Merlin%2C+F">F. Merlin</a>, <a href="/search/?searchtype=author&query=Vangvichith%2C+M">M. Vangvichith</a>, <a href="/search/?searchtype=author&query=Millour%2C+E">E. Millour</a>, <a href="/search/?searchtype=author&query=Schenk%2C+P">P. Schenk</a>, <a href="/search/?searchtype=author&query=Hansen%2C+C">C. Hansen</a>, <a href="/search/?searchtype=author&query=White%2C+O">O. White</a>, <a href="/search/?searchtype=author&query=Moore%2C+J">J. Moore</a>, <a href="/search/?searchtype=author&query=Stansberry%2C+J">J. Stansberry</a>, <a href="/search/?searchtype=author&query=Oza%2C+A">A. Oza</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">D. Dubois</a>, <a href="/search/?searchtype=author&query=Quirico%2C+E">E. Quirico</a>, <a href="/search/?searchtype=author&query=Cruikshank%2C+D">D. Cruikshank</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2110.11992v2-abstract-short" style="display: inline;"> Neptune's moon Triton shares many similarities with Pluto, including volatile cycles of N2, CH4 and CO, and represents a benchmark case for the study of surface-atmosphere interactions on volatile-rich KBOs. Within the context of New Horizons observations of Pluto as well as recent Earth-based observations of Triton, we adapt a Plutonian VTM to Triton, and test its ability to simulate its volatile… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.11992v2-abstract-full').style.display = 'inline'; document.getElementById('2110.11992v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2110.11992v2-abstract-full" style="display: none;"> Neptune's moon Triton shares many similarities with Pluto, including volatile cycles of N2, CH4 and CO, and represents a benchmark case for the study of surface-atmosphere interactions on volatile-rich KBOs. Within the context of New Horizons observations of Pluto as well as recent Earth-based observations of Triton, we adapt a Plutonian VTM to Triton, and test its ability to simulate its volatile cycles, thereby aiding our understanding of its climate. We present VTM simulations exploring the volatile cycles on Triton over long-term and seasonal timescales for varying model parameters. We explore what scenarios and model parameters allow for a best match of the available observations. In particular, our set of observational constraints include Voyager 2 observations, ground-based NIR (0.8 to 2.4 渭m) disk-integrated spectra and the evolution of surface pressure as retrieved from stellar occultations. Our results show that Triton's poles act as cold traps for volatile ices and favor the formation of polar caps extending to lower latitudes through glacial flow. As previously evidenced by other VTMs, North-South asymmetries in surface properties can favor the development of one cap over the other. Our best-case simulations are obtained for a global reservoir of N2 ice thicker than 200 m and a bedrock thermal inertia larger than 500 SI. The large N2 ice reservoir implies a permanent N2 southern cap extending to the equator. Our results also suggest that a small permanent polar cap exists in the northern (currently winter) hemisphere if the internal heat flux remains radiogenic (< 3 mW m-2). Finally, we provide predictions for the evolution of ice distribution, surface pressure, CO and CH4 atmospheric mixing ratios in the next decades. We also model the thermal lightcurves of Triton in 2022, which serve as predictions for future JWST observations. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2110.11992v2-abstract-full').style.display = 'none'; document.getElementById('2110.11992v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 October, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 October, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">69 pages, 29 figures, 3 tables. Accepted for publication in Icarus</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2107.10830">arXiv:2107.10830</a> <span> [<a href="https://arxiv.org/pdf/2107.10830">pdf</a>, <a href="https://arxiv.org/format/2107.10830">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> ZLeaks: Passive Inference Attacks on Zigbee based Smart Homes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Shafqat%2C+N">Narmeen Shafqat</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a>, <a href="/search/?searchtype=author&query=Schulman%2C+A">Aaron Schulman</a>, <a href="/search/?searchtype=author&query=Bharadia%2C+D">Dinesh Bharadia</a>, <a href="/search/?searchtype=author&query=Ranganathan%2C+A">Aanjhan Ranganathan</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2107.10830v2-abstract-short" style="display: inline;"> Zigbee is an energy-efficient wireless IoT protocol that is increasingly being deployed in smart home settings. In this work, we analyze the privacy guarantees of Zigbee protocol. Specifically, we present ZLeaks, a tool that passively identifies in-home devices or events from the encrypted Zigbee traffic by 1) inferring a single application layer (APL) command in the event's traffic, and 2) exploi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2107.10830v2-abstract-full').style.display = 'inline'; document.getElementById('2107.10830v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2107.10830v2-abstract-full" style="display: none;"> Zigbee is an energy-efficient wireless IoT protocol that is increasingly being deployed in smart home settings. In this work, we analyze the privacy guarantees of Zigbee protocol. Specifically, we present ZLeaks, a tool that passively identifies in-home devices or events from the encrypted Zigbee traffic by 1) inferring a single application layer (APL) command in the event's traffic, and 2) exploiting the device's periodic reporting pattern and interval. This enables an attacker to infer user's habits or determine if the smart home is vulnerable to unauthorized entry. We evaluated ZLeaks' efficacy on 19 unique Zigbee devices across several categories and 5 popular smart hubs in three different scenarios; controlled RF shield, living smart-home IoT lab, and third-party Zigbee captures. We were able to i) identify unknown events and devices (without a-priori device signatures) using command inference approach with 83.6% accuracy, ii) automatically extract device's reporting signatures, iii) determine known devices using the reporting signatures with 99.8% accuracy, and iv) identify APL commands in a public capture with 91.2% accuracy. In short, we highlight the trade-off between designing a low-power, low-cost wireless network and achieving privacy guarantees. We have also released ZLeaks tool for the benefit of the research community. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2107.10830v2-abstract-full').style.display = 'none'; document.getElementById('2107.10830v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 November, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 July, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">An updated version of the authors' previous submission (arXiv:2107.10830). It has been accepted at the 20th International Conference on Applied Cryptography and Network Security, ACNS 2022</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2105.05162">arXiv:2105.05162</a> <span> [<a href="https://arxiv.org/pdf/2105.05162">pdf</a>, <a href="https://arxiv.org/format/2105.05162">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> Blocking without Breaking: Identification and Mitigation of Non-Essential IoT Traffic </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Mandalari%2C+A+M">Anna Maria Mandalari</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Kolcun%2C+R">Roman Kolcun</a>, <a href="/search/?searchtype=author&query=Paracha%2C+M+T">Muhammad Talha Paracha</a>, <a href="/search/?searchtype=author&query=Haddadi%2C+H">Hamed Haddadi</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2105.05162v1-abstract-short" style="display: inline;"> Despite the prevalence of Internet of Things (IoT) devices, there is little information about the purpose and risks of the Internet traffic these devices generate, and consumers have limited options for controlling those risks. A key open question is whether one can mitigate these risks by automatically blocking some of the Internet connections from IoT devices, without rendering the devices inope… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2105.05162v1-abstract-full').style.display = 'inline'; document.getElementById('2105.05162v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2105.05162v1-abstract-full" style="display: none;"> Despite the prevalence of Internet of Things (IoT) devices, there is little information about the purpose and risks of the Internet traffic these devices generate, and consumers have limited options for controlling those risks. A key open question is whether one can mitigate these risks by automatically blocking some of the Internet connections from IoT devices, without rendering the devices inoperable. In this paper, we address this question by developing a rigorous methodology that relies on automated IoT-device experimentation to reveal which network connections (and the information they expose) are essential, and which are not. We further develop strategies to automatically classify network traffic destinations as either required (i.e., their traffic is essential for devices to work properly) or not, hence allowing firewall rules to block traffic sent to non-required destinations without breaking the functionality of the device. We find that indeed 16 among the 31 devices we tested have at least one blockable non-required destination, with the maximum number of blockable destinations for a device being 11. We further analyze the destination of network traffic and find that all third parties observed in our experiments are blockable, while first and support parties are neither uniformly required or non-required. Finally, we demonstrate the limitations of existing blocklists on IoT traffic, propose a set of guidelines for automatically limiting non-essential IoT traffic, and we develop a prototype system that implements these guidelines. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2105.05162v1-abstract-full').style.display = 'none'; document.getElementById('2105.05162v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 May, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Privacy Enhancing Technologies Symposium (PETS) 2021 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2104.13826">arXiv:2104.13826</a> <span> [<a href="https://arxiv.org/pdf/2104.13826">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Image and Video Processing">eess.IV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computer Vision and Pattern Recognition">cs.CV</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1007/s10278-022-00767-9">10.1007/s10278-022-00767-9 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Deep Learning Body Region Classification of MRI and CT examinations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Raffy%2C+P">Philippe Raffy</a>, <a href="/search/?searchtype=author&query=Pambrun%2C+J">Jean-Fran莽ois Pambrun</a>, <a href="/search/?searchtype=author&query=Kumar%2C+A">Ashish Kumar</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">David Dubois</a>, <a href="/search/?searchtype=author&query=Patti%2C+J+W">Jay Waldron Patti</a>, <a href="/search/?searchtype=author&query=Cairns%2C+R+A">Robyn Alexandra Cairns</a>, <a href="/search/?searchtype=author&query=Young%2C+R">Ryan Young</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2104.13826v2-abstract-short" style="display: inline;"> Standardized body region labelling of individual images provides data that can improve human and computer use of medical images. A CNN-based classifier was developed to identify body regions in CT and MRI. 17 CT (18 MRI) body regions covering the entire human body were defined for the classification task. Three retrospective databases were built for the AI model training, validation, and testing,… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2104.13826v2-abstract-full').style.display = 'inline'; document.getElementById('2104.13826v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2104.13826v2-abstract-full" style="display: none;"> Standardized body region labelling of individual images provides data that can improve human and computer use of medical images. A CNN-based classifier was developed to identify body regions in CT and MRI. 17 CT (18 MRI) body regions covering the entire human body were defined for the classification task. Three retrospective databases were built for the AI model training, validation, and testing, with a balanced distribution of studies per body region. The test databases originated from a different healthcare network. Accuracy, recall and precision of the classifier was evaluated for patient age, patient gender, institution, scanner manufacturer, contrast, slice thickness, MRI sequence, and CT kernel. The data included a retrospective cohort of 2,934 anonymized CT cases (training: 1,804 studies, validation: 602 studies, test: 528 studies) and 3,185 anonymized MRI cases (training: 1,911 studies, validation: 636 studies, test: 638 studies). 27 institutions from primary care hospitals, community hospitals and imaging centers contributed to the test datasets. The data included cases of all genders in equal proportions and subjects aged from a few months old to +90 years old. An image-level prediction accuracy of 91.9% (90.2 - 92.1) for CT, and 94.2% (92.0 - 95.6) for MRI was achieved. The classification results were robust across all body regions and confounding factors. Due to limited data, performance results for subjects under 10 years-old could not be reliably evaluated. We show that deep learning models can classify CT and MRI images by body region including lower and upper extremities with high accuracy. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2104.13826v2-abstract-full').style.display = 'none'; document.getElementById('2104.13826v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 28 April, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">21 pages, 2 figures, 4 tables</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Journal of Digital Imaging (2023) 1-11 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2009.01880">arXiv:2009.01880</a> <span> [<a href="https://arxiv.org/pdf/2009.01880">pdf</a>, <a href="https://arxiv.org/format/2009.01880">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> </div> </div> <p class="title is-5 mathjax"> A Haystack Full of Needles: Scalable Detection of IoT Devices in the Wild </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Saidi%2C+S+J">Said Jawad Saidi</a>, <a href="/search/?searchtype=author&query=Mandalari%2C+A+M">Anna Maria Mandalari</a>, <a href="/search/?searchtype=author&query=Kolcun%2C+R">Roman Kolcun</a>, <a href="/search/?searchtype=author&query=Haddadi%2C+H">Hamed Haddadi</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a>, <a href="/search/?searchtype=author&query=Smaragdakis%2C+G">Georgios Smaragdakis</a>, <a href="/search/?searchtype=author&query=Feldmann%2C+A">Anja Feldmann</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2009.01880v3-abstract-short" style="display: inline;"> Consumer Internet of Things (IoT) devices are extremely popular, providing users with rich and diverse functionalities, from voice assistants to home appliances. These functionalities often come with significant privacy and security risks, with notable recent large scale coordinated global attacks disrupting large service providers. Thus, an important first step to address these risks is to know w… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2009.01880v3-abstract-full').style.display = 'inline'; document.getElementById('2009.01880v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2009.01880v3-abstract-full" style="display: none;"> Consumer Internet of Things (IoT) devices are extremely popular, providing users with rich and diverse functionalities, from voice assistants to home appliances. These functionalities often come with significant privacy and security risks, with notable recent large scale coordinated global attacks disrupting large service providers. Thus, an important first step to address these risks is to know what IoT devices are where in a network. While some limited solutions exist, a key question is whether device discovery can be done by Internet service providers that only see sampled flow statistics. In particular, it is challenging for an ISP to efficiently and effectively track and trace activity from IoT devices deployed by its millions of subscribers --all with sampled network data. In this paper, we develop and evaluate a scalable methodology to accurately detect and monitor IoT devices at subscriber lines with limited, highly sampled data in-the-wild. Our findings indicate that millions of IoT devices are detectable and identifiable within hours, both at a major ISP as well as an IXP, using passive, sparsely sampled network flow headers. Our methodology is able to detect devices from more than 77% of the studied IoT manufacturers, including popular devices such as smart speakers. While our methodology is effective for providing network analytics, it also highlights significant privacy consequences. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2009.01880v3-abstract-full').style.display = 'none'; document.getElementById('2009.01880v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 30 September, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 3 September, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Accepted at the ACM Internet Measurement Conference 2020 (IMC'20)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2003.07133">arXiv:2003.07133</a> <span> [<a href="https://arxiv.org/pdf/2003.07133">pdf</a>, <a href="https://arxiv.org/format/2003.07133">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Networking and Internet Architecture">cs.NI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Cryptography and Security">cs.CR</span> </div> </div> <p class="title is-5 mathjax"> Towards Automatic Identification and Blocking of Non-Critical IoT Traffic Destinations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Mandalari%2C+A+M">Anna Maria Mandalari</a>, <a href="/search/?searchtype=author&query=Kolcun%2C+R">Roman Kolcun</a>, <a href="/search/?searchtype=author&query=Haddadi%2C+H">Hamed Haddadi</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Choffnes%2C+D">David Choffnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2003.07133v1-abstract-short" style="display: inline;"> The consumer Internet of Things (IoT) space has experienced a significant rise in popularity in the recent years. From smart speakers, to baby monitors, and smart kettles and TVs, these devices are increasingly found in households around the world while users may be unaware of the risks associated with owning these devices. Previous work showed that these devices can threaten individuals' privacy… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.07133v1-abstract-full').style.display = 'inline'; document.getElementById('2003.07133v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2003.07133v1-abstract-full" style="display: none;"> The consumer Internet of Things (IoT) space has experienced a significant rise in popularity in the recent years. From smart speakers, to baby monitors, and smart kettles and TVs, these devices are increasingly found in households around the world while users may be unaware of the risks associated with owning these devices. Previous work showed that these devices can threaten individuals' privacy and security by exposing information online to a large number of service providers and third party analytics services. Our analysis shows that many of these Internet connections (and the information they expose) are neither critical, nor even essential to the operation of these devices. However, automatically separating out critical from non-critical network traffic for an IoT device is nontrivial, and requires expert analysis based on manual experimentation in a controlled setting. In this paper, we investigate whether it is possible to automatically classify network traffic destinations as either critical (essential for devices to function properly) or not, hence allowing the home gateway to act as a selective firewall to block undesired, non-critical destinations. Our initial results demonstrate that some IoT devices contact destinations that are not critical to their operation, and there is no impact on device functionality if these destinations are blocked. We take the first steps towards designing and evaluating IoTrimmer, a framework for automated testing and analysis of various destinations contacted by devices, and selectively blocking the ones that do not impact device functionality. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.07133v1-abstract-full').style.display = 'none'; document.getElementById('2003.07133v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 March, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">5 pages, 1 figure, 3 tables</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2003.05472">arXiv:2003.05472</a> <span> [<a href="https://arxiv.org/pdf/2003.05472">pdf</a>, <a href="https://arxiv.org/format/2003.05472">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Instrumentation and Methods for Astrophysics">astro-ph.IM</span> </div> </div> <p class="title is-5 mathjax"> Concerns about ground based astronomical observations: quantifying satellites' constellations damages </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Gallozzi%2C+S">Stefano Gallozzi</a>, <a href="/search/?searchtype=author&query=Paris%2C+D">Diego Paris</a>, <a href="/search/?searchtype=author&query=Scardia%2C+M">Marco Scardia</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">David Dubois</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2003.05472v3-abstract-short" style="display: inline;"> This article is a second analysis step from the descriptive arXiv:2001.10952 preprint. This work is aimed to arise awareness to the scientific astronomical community about the negative impact of satellites' mega-constellations and put in place an approximated estimations about loss of scientific contents expected for ground based astronomical observations when about 50,000 satellites will be displ… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.05472v3-abstract-full').style.display = 'inline'; document.getElementById('2003.05472v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2003.05472v3-abstract-full" style="display: none;"> This article is a second analysis step from the descriptive arXiv:2001.10952 preprint. This work is aimed to arise awareness to the scientific astronomical community about the negative impact of satellites' mega-constellations and put in place an approximated estimations about loss of scientific contents expected for ground based astronomical observations when about 50,000 satellites will be displaced in LEO orbit. The first analysis regards the impact on professional astronomical images in optical windows. Then the study is expanded to other wavelengths and astronomical ground based facilities (radio and higher energies) to better understand which kind of effects are expected. Authors also try to perform a quantitative economic estimation related to the loss of value for public finances committed to the ground based astronomical facilities armed by satellites' constellations. These evaluations are intended for general purposes, can be improved and better estimated, but in this first phase they could be useful as evidentiary material to quantify the damage in subsequent legal actions against further satellites deployments. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2003.05472v3-abstract-full').style.display = 'none'; document.getElementById('2003.05472v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 March, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 11 March, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2020. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">23 pages, 27 figures, 4 tables and 1 algorithm. arXiv admin note: text overlap with arXiv:1904.00502 by other authors</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1912.06612">arXiv:1912.06612</a> <span> [<a href="https://arxiv.org/pdf/1912.06612">pdf</a>, <a href="https://arxiv.org/ps/1912.06612">ps</a>, <a href="https://arxiv.org/format/1912.06612">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> From Shallow to Deep Interactions Between Knowledge Representation, Reasoning and Machine Learning (Kay R. Amel group) </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Bouraoui%2C+Z">Zied Bouraoui</a>, <a href="/search/?searchtype=author&query=Cornu%C3%A9jols%2C+A">Antoine Cornu茅jols</a>, <a href="/search/?searchtype=author&query=Den%C5%93ux%2C+T">Thierry Den艙ux</a>, <a href="/search/?searchtype=author&query=Destercke%2C+S">S茅bastien Destercke</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Guillaume%2C+R">Romain Guillaume</a>, <a href="/search/?searchtype=author&query=Marques-Silva%2C+J">Jo茫o Marques-Silva</a>, <a href="/search/?searchtype=author&query=Mengin%2C+J">J茅r么me Mengin</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a>, <a href="/search/?searchtype=author&query=Schockaert%2C+S">Steven Schockaert</a>, <a href="/search/?searchtype=author&query=Serrurier%2C+M">Mathieu Serrurier</a>, <a href="/search/?searchtype=author&query=Vrain%2C+C">Christel Vrain</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1912.06612v1-abstract-short" style="display: inline;"> This paper proposes a tentative and original survey of meeting points between Knowledge Representation and Reasoning (KRR) and Machine Learning (ML), two areas which have been developing quite separately in the last three decades. Some common concerns are identified and discussed such as the types of used representation, the roles of knowledge and data, the lack or the excess of information, or th… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1912.06612v1-abstract-full').style.display = 'inline'; document.getElementById('1912.06612v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1912.06612v1-abstract-full" style="display: none;"> This paper proposes a tentative and original survey of meeting points between Knowledge Representation and Reasoning (KRR) and Machine Learning (ML), two areas which have been developing quite separately in the last three decades. Some common concerns are identified and discussed such as the types of used representation, the roles of knowledge and data, the lack or the excess of information, or the need for explanations and causal understanding. Then some methodologies combining reasoning and learning are reviewed (such as inductive logic programming, neuro-symbolic reasoning, formal concept analysis, rule-based representations and ML, uncertainty in ML, or case-based reasoning and analogical reasoning), before discussing examples of synergies between KRR and ML (including topics such as belief functions on regression, EM algorithm versus revision, the semantic description of vector representations, the combination of deep learning with high level inference, knowledge graph completion, declarative frameworks for data mining, or preferences and recommendation). This paper is the first step of a work in progress aiming at a better mutual understanding of research in KRR and ML, and how they could cooperate. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1912.06612v1-abstract-full').style.display = 'none'; document.getElementById('1912.06612v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 December, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">53 pages</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1910.01261">arXiv:1910.01261</a> <span> [<a href="https://arxiv.org/pdf/1910.01261">pdf</a>, <a href="https://arxiv.org/format/1910.01261">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Earth and Planetary Astrophysics">astro-ph.EP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1016/j.icarus.2019.113437">10.1016/j.icarus.2019.113437 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Positive Ion Chemistry in an N$_2$-CH$_4$ Plasma Discharge: Key Precursors to the Growth of Titan Tholins </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">David Dubois</a>, <a href="/search/?searchtype=author&query=Carrasco%2C+N">Nathalie Carrasco</a>, <a href="/search/?searchtype=author&query=Jovanovic%2C+L">Lora Jovanovic</a>, <a href="/search/?searchtype=author&query=Vettier%2C+L">Ludovic Vettier</a>, <a href="/search/?searchtype=author&query=Gautier%2C+T">Thomas Gautier</a>, <a href="/search/?searchtype=author&query=Westlake%2C+J">Joseph Westlake</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1910.01261v1-abstract-short" style="display: inline;"> Titan is unique in the solar system as it hosts a dense atmosphere mainly made of N$_2$ and CH$_4$. Cassini-Huygens revealed the presence of an intense atmospheric photochemistry initiated by the photo-dissociation and ionization of N$_2$ and CH$_4$. In the upper atmosphere, Cassini detected signatures compatible with the presence of heavily charged molecules, precursors for the solid core of the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1910.01261v1-abstract-full').style.display = 'inline'; document.getElementById('1910.01261v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1910.01261v1-abstract-full" style="display: none;"> Titan is unique in the solar system as it hosts a dense atmosphere mainly made of N$_2$ and CH$_4$. Cassini-Huygens revealed the presence of an intense atmospheric photochemistry initiated by the photo-dissociation and ionization of N$_2$ and CH$_4$. In the upper atmosphere, Cassini detected signatures compatible with the presence of heavily charged molecules, precursors for the solid core of the aerosols. However, the processes coupling ion chemistry and aerosol formation and growth are still mostly unknown. In this study, we investigated the cation chemistry responsible for an efficient organic growth that we observe in Titan's upper atmosphere, simulated using the PAMPRE plasma reactor. Cation precursors were measured by in situ ion mass spectrometry in a cold plasma and compared with INMS observations taken during the T40 flyby. A series of positive ion measurements were performed in three CH$_4$ mixing ratios (1%, 5% and 10%) showing a variability in ion population. Low CH$_4$ concentrations result in an abundance of amine cations such as NH$_4^+$ whereas aliphatic compounds dominate at higher methane concentrations. In conditions of favored tholin production, the presence of C2 compounds such as HCNH$^+$ and C$_2$H$_5^+$ is found to be consistent with copolymeric growth structures seen in tholin material. The observed abundance of these two ions particularly in conditions with lower CH$_4$ amounts is consistent with modeling work simulating aerosol growth in Titan's ionosphere, which includes mass exchange primarily between HCNH$^+$ and C$_2$H$_5^+$ and negatively charged particles. These results also confirm the prevalent role of C2 cations as precursors to molecular growth and subsequent mass transfer to the charged aerosol particles as the CH$_4$ abundance decreases towards lower altitudes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1910.01261v1-abstract-full').style.display = 'none'; document.getElementById('1910.01261v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 October, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">39 pages, 20 figures, 3 tables, Accepted for publication in Icarus (abstract shortened)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1908.10732">arXiv:1908.10732</a> <span> [<a href="https://arxiv.org/pdf/1908.10732">pdf</a>, <a href="https://arxiv.org/format/1908.10732">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Earth and Planetary Astrophysics">astro-ph.EP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Solar and Stellar Astrophysics">astro-ph.SR</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.3847/1538-4357/ab40cc">10.3847/1538-4357/ab40cc <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Sodium and Potassium Signatures of Volcanic Satellites Orbiting Close-in Gas Giant Exoplanets </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Oza%2C+A+V">Apurva V. Oza</a>, <a href="/search/?searchtype=author&query=Johnson%2C+R+E">Robert E. Johnson</a>, <a href="/search/?searchtype=author&query=Lellouch%2C+E">Emmanuel Lellouch</a>, <a href="/search/?searchtype=author&query=Schmidt%2C+C">Carl Schmidt</a>, <a href="/search/?searchtype=author&query=Schneider%2C+N">Nick Schneider</a>, <a href="/search/?searchtype=author&query=Huang%2C+C">Chenliang Huang</a>, <a href="/search/?searchtype=author&query=Gamborino%2C+D">Diana Gamborino</a>, <a href="/search/?searchtype=author&query=Gebek%2C+A">Andrea Gebek</a>, <a href="/search/?searchtype=author&query=Wyttenbach%2C+A">Aurelien Wyttenbach</a>, <a href="/search/?searchtype=author&query=Demory%2C+B">Brice-Olivier Demory</a>, <a href="/search/?searchtype=author&query=Mordasini%2C+C">Christoph Mordasini</a>, <a href="/search/?searchtype=author&query=Saxena%2C+P">Prabal Saxena</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">David Dubois</a>, <a href="/search/?searchtype=author&query=Moullet%2C+A">Arielle Moullet</a>, <a href="/search/?searchtype=author&query=Thomas%2C+N">Nicolas Thomas</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1908.10732v1-abstract-short" style="display: inline;"> Extrasolar satellites are generally too small to be detected by nominal searches. By analogy to the most active body in the Solar System, Io, we describe how sodium (Na I) and potassium (K I) $\textit{gas}$ could be a signature of the geological activity venting from an otherwise hidden exo-Io. Analyzing $\sim$ a dozen close-in gas giants hosting robust alkaline detections, we show that an Io-size… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.10732v1-abstract-full').style.display = 'inline'; document.getElementById('1908.10732v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1908.10732v1-abstract-full" style="display: none;"> Extrasolar satellites are generally too small to be detected by nominal searches. By analogy to the most active body in the Solar System, Io, we describe how sodium (Na I) and potassium (K I) $\textit{gas}$ could be a signature of the geological activity venting from an otherwise hidden exo-Io. Analyzing $\sim$ a dozen close-in gas giants hosting robust alkaline detections, we show that an Io-sized satellite can be stable against orbital decay below a planetary tidal $\mathcal{Q}_p \lesssim 10^{11}$. This tidal energy is focused into the satellite driving a $\sim 10^{5 \pm 2}$ higher mass loss rate than Io's supply to Jupiter's Na exosphere, based on simple atmospheric loss estimates. The remarkable consequence is that several exo-Io column densities are on average $\textit{more than sufficient}$ to provide the $\sim$ 10$^{10 \pm 1}$ Na cm$^{-2}$ required by the equivalent width of exoplanet transmission spectra. Furthermore, the benchmark observations of both Jupiter's extended ($\sim 1000$ R$_J$) Na exosphere and Jupiter's atmosphere in transmission spectroscopy yield similar Na column densities that are purely exogenic in nature. As a proof of concept, we fit the "high-altitude" Na at WASP 49-b with an ionization-limited cloud similar to the observed Na profile about Io. Moving forward, we strongly encourage time-dependent ingress and egress monitoring along with spectroscopic searches for other volcanic volatiles. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1908.10732v1-abstract-full').style.display = 'none'; document.getElementById('1908.10732v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 August, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">23 pages, 5 figures, accepted to ApJ</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1907.10366">arXiv:1907.10366</a> <span> [<a href="https://arxiv.org/pdf/1907.10366">pdf</a>, <a href="https://arxiv.org/format/1907.10366">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Earth and Planetary Astrophysics">astro-ph.EP</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Solar and Stellar Astrophysics">astro-ph.SR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Chemical Physics">physics.chem-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.3847/1538-4357/ab345e">10.3847/1538-4357/ab345e <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> The Fundamental Vibrational Frequencies and Spectroscopic Constants of the Dicyanoamine Anion, NCNCN$^-$ (C$_2$N$_3^-$): Quantum Chemical Analysis for Astrophysical and Planetary Environments </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">David Dubois</a>, <a href="/search/?searchtype=author&query=Sciamma-O%27Brien%2C+E">Ella Sciamma-O'Brien</a>, <a href="/search/?searchtype=author&query=Fortenberry%2C+R">Ryan Fortenberry</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1907.10366v1-abstract-short" style="display: inline;"> Detecting anions in space has relied on a strong collaboration between theoretical and laboratory analyses to measure rotational spectra and spectroscopic constants to high accuracy. The advent of improved quantum chemical tools operating at higher accuracy and reduced computational cost is a crucial solution for the fundamental characterization of astrophysically-relevant anions and their detecti… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10366v1-abstract-full').style.display = 'inline'; document.getElementById('1907.10366v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1907.10366v1-abstract-full" style="display: none;"> Detecting anions in space has relied on a strong collaboration between theoretical and laboratory analyses to measure rotational spectra and spectroscopic constants to high accuracy. The advent of improved quantum chemical tools operating at higher accuracy and reduced computational cost is a crucial solution for the fundamental characterization of astrophysically-relevant anions and their detection in the interstellar medium and planetary atmospheres. In this context, we have turned towards the quantum chemical analysis of the penta-atomic dicyanoamine anion NCNCN$^-$ (C$_2$N$_3^-$), a structurally bent and polar compound. We have performed high-level coupled cluster theory quartic force field (QFF) computations of C$_2$N$_3^-$ satisfying both computational cost and accuracy conditions. We provide for the first time accurate spectroscopic constants and vibrational frequencies for this ion. In addition to exhibiting various Fermi resonances, C$_2$N$_3^-$ displays a bright $谓$2 (2130.9 cm$^{-1}$) and a less intense $谓$1 (2190.7 cm$^{-1}$) fundamental vibrational frequency, making for strong markers for future infrared observations < 5$渭$m. We have also determined near-IR overtone and combination bands of the bright fundamentals for which the 2$谓$2 at 4312.1 cm$^{-1}$ (2.319 $渭$m) is the best candidate. C$_2$N$_3^-$ could potentially exist and be detected in nitrogen-rich environments of the ISM such as IRC +10216 and other carbon-rich circumstellar envelopes, or in the atmosphere of Saturn's moon Titan, where advanced N-based reactions may lead to its formation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1907.10366v1-abstract-full').style.display = 'none'; document.getElementById('1907.10366v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 July, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">20 pages, 1 figure, 3 tables, Accepted for publication in The Astrophysical Journal</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1902.05585">arXiv:1902.05585</a> <span> [<a href="https://arxiv.org/pdf/1902.05585">pdf</a>, <a href="https://arxiv.org/format/1902.05585">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Earth and Planetary Astrophysics">astro-ph.EP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.3847/2041-8213/ab05e5">10.3847/2041-8213/ab05e5 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Nitrogen-containing Anions and Tholin Growth in Titan's Ionosphere: Implications for Cassini CAPS-ELS Observations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">David Dubois</a>, <a href="/search/?searchtype=author&query=Carrasco%2C+N">Nathalie Carrasco</a>, <a href="/search/?searchtype=author&query=Bourgalais%2C+J">J茅r茅my Bourgalais</a>, <a href="/search/?searchtype=author&query=Vettier%2C+L">Ludovic Vettier</a>, <a href="/search/?searchtype=author&query=Desai%2C+R+T">Ravindra T. Desai</a>, <a href="/search/?searchtype=author&query=Wellbrock%2C+A">Anne Wellbrock</a>, <a href="/search/?searchtype=author&query=Coates%2C+A+J">Andrew J. Coates</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1902.05585v1-abstract-short" style="display: inline;"> The Cassini Plasma Spectrometer (CAPS) Electron Spectrometer (ELS) instrument onboard Cassini revealed an unexpected abundance of negative ions above 950 km in Titan's ionosphere. \textit{In situ} measurements indicated the presence of negatively charged particles with mass-over-charge ratios up to 13,800 \textit{u/q}. At present, only a handful of anions have been characterized by photochemical m… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05585v1-abstract-full').style.display = 'inline'; document.getElementById('1902.05585v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1902.05585v1-abstract-full" style="display: none;"> The Cassini Plasma Spectrometer (CAPS) Electron Spectrometer (ELS) instrument onboard Cassini revealed an unexpected abundance of negative ions above 950 km in Titan's ionosphere. \textit{In situ} measurements indicated the presence of negatively charged particles with mass-over-charge ratios up to 13,800 \textit{u/q}. At present, only a handful of anions have been characterized by photochemical models, consisting mainly of C$_n$H$^-$ carbon chain and C$_{n-1}$N$^-$ cyano compounds ($n=2-6$); their formation occurring essentially through proton abstraction from their parent neutral molecules. However, numerous other species have yet to be detected and identified. Considering the efficient anion growth leading to compounds of thousands of \textit{u/q}, it is necessary to better characterize the first light species. Here, we present new negative ion measurements with masses up to 200 \textit{u/q} obtained in an \ce{N2}:\ce{CH4} dusty plasma discharge reproducing analogous conditions to Titan's ionosphere. We perform a comparison with high altitude CAPS-ELS measurements near the top of Titan's ionosphere from the T18 encounter. The main observed peaks are in agreement with the observations. However, a number of other species (\textit{e.g.} \ce{CNN-}, \ce{CHNN-}) previously not considered suggests an abundance of N-bearing compounds, containing two or three nitrogen atoms, consistent with certain adjacent doubly-bonded nitrogen atoms found in tholins. These results suggest that an N-rich incorporation into tholins may follow mechanisms including anion chemistry, further highlighting the important role of negative ions in Titan's aerosol growth. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1902.05585v1-abstract-full').style.display = 'none'; document.getElementById('1902.05585v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 February, 2019; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2019. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages, 2 figures, accepted for publication in the Astrophysical Journal Letters</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1807.04569">arXiv:1807.04569</a> <span> [<a href="https://arxiv.org/pdf/1807.04569">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Earth and Planetary Astrophysics">astro-ph.EP</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1016/j.icarus.2018.07.006">10.1016/j.icarus.2018.07.006 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> In situ Investigation of Neutrals Involved in the Formation of Titan Tholins </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">David Dubois</a>, <a href="/search/?searchtype=author&query=Carrasco%2C+N">Nathalie Carrasco</a>, <a href="/search/?searchtype=author&query=Petrucciani%2C+M">Marie Petrucciani</a>, <a href="/search/?searchtype=author&query=Vettier%2C+L">Ludovic Vettier</a>, <a href="/search/?searchtype=author&query=Tigrine%2C+S">Sarah Tigrine</a>, <a href="/search/?searchtype=author&query=Pernot%2C+P">Pascal Pernot</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1807.04569v1-abstract-short" style="display: inline;"> The Cassini Mission has greatly improved our understanding of the dynamics and chemical processes occurring in Titan's atmosphere. It has also provided us with more insight into the formation of the aerosols in the upper atmospheric layers. However, the chemical composition and mechanisms leading to their formation were out of reach for the instruments onboard Cassini. In this context, it is deeme… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1807.04569v1-abstract-full').style.display = 'inline'; document.getElementById('1807.04569v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1807.04569v1-abstract-full" style="display: none;"> The Cassini Mission has greatly improved our understanding of the dynamics and chemical processes occurring in Titan's atmosphere. It has also provided us with more insight into the formation of the aerosols in the upper atmospheric layers. However, the chemical composition and mechanisms leading to their formation were out of reach for the instruments onboard Cassini. In this context, it is deemed necessary to apply and exploit laboratory simulations to better understand the chemical reactivity occurring in the gas phase of Titan-like conditions. In the present work, we report gas phase results obtained from a plasma discharge simulating the chemical processes in Titan's ionosphere. We use the PAMPRE cold dusty plasma experiment with an N2-CH4 gaseous mixture under controlled pressure and gas influx. An internal cryogenic trap has been developed to accumulate the gas products during their production and facilitate their detection. The cryogenic trap condenses the gas-phase precursors while they are forming, so that aerosols are no longer observed during the 2h plasma discharge. We focus mainly on neutral products NH3, HCN, C2H2 and C2H4. The latter are identified and quantified by in situ mass spectrometry and infrared spectroscopy. We present here results from this experiment with mixing ratios of 90-10% and 99-1% N2-CH4, covering the range of methane concentrations encountered in Titan's ionosphere. We also detect in situ heavy molecules (C7). In particular, we show the role of ethylene and other volatiles as key solid-phase precursors. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1807.04569v1-abstract-full').style.display = 'none'; document.getElementById('1807.04569v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 July, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2018. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">55 pages, 10 figures, 5 tables, Accepted for publication in Icarus</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1503.05150">arXiv:1503.05150</a> <span> [<a href="https://arxiv.org/pdf/1503.05150">pdf</a>, <a href="https://arxiv.org/format/1503.05150">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Instrumentation and Methods for Astrophysics">astro-ph.IM</span> </div> </div> <p class="title is-5 mathjax"> Monitoring the Sky with the Prototype All-Sky Imager on the LWA1 </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Obenberger%2C+K+S">K. S. Obenberger</a>, <a href="/search/?searchtype=author&query=Taylor%2C+G+B">G. B. Taylor</a>, <a href="/search/?searchtype=author&query=Hartman%2C+J+M">J. M. Hartman</a>, <a href="/search/?searchtype=author&query=Clarke%2C+T+E">T. E. Clarke</a>, <a href="/search/?searchtype=author&query=Dowell%2C+J">J. Dowell</a>, <a href="/search/?searchtype=author&query=Dubois%2C+A">A. Dubois</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">D. Dubois</a>, <a href="/search/?searchtype=author&query=Henning%2C+P+A">P. A. Henning</a>, <a href="/search/?searchtype=author&query=Lazio%2C+J">J. Lazio</a>, <a href="/search/?searchtype=author&query=Michalak%2C+S">S. Michalak</a>, <a href="/search/?searchtype=author&query=Schinzel%2C+F+K">F. K. Schinzel</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1503.05150v1-abstract-short" style="display: inline;"> We present a description of the Prototype All-Sky Imager (PASI), a backend correlator and imager of the first station of the Long Wavelength Array (LWA1). PASI cross-correlates a live stream of 260 dual-polarization dipole antennas of the LWA1, creates all-sky images, and uploads them to the LWA-TV website in near real-time. PASI has recorded over 13,000 hours of all-sky images at frequencies betw… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1503.05150v1-abstract-full').style.display = 'inline'; document.getElementById('1503.05150v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1503.05150v1-abstract-full" style="display: none;"> We present a description of the Prototype All-Sky Imager (PASI), a backend correlator and imager of the first station of the Long Wavelength Array (LWA1). PASI cross-correlates a live stream of 260 dual-polarization dipole antennas of the LWA1, creates all-sky images, and uploads them to the LWA-TV website in near real-time. PASI has recorded over 13,000 hours of all-sky images at frequencies between 10 and 88 MHz creating opportunities for new research and discoveries. We also report rate density and pulse energy density limits on transients at 38, 52, and 74 MHz, for pulse widths of 5 s. We limit transients at those frequencies with pulse energy densities of $>2.7\times 10^{-23}$, $>1.1\times 10^{-23}$, and $>2.8\times 10^{-23}$ J m$^{-2}$ Hz$^{-1}$ to have rate densities $<1.2\times10^{-4}$, $<5.6\times10^{-4}$, and $<7.2\times10^{-4}$ yr$^{-1}$ deg$^{-2}$ <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1503.05150v1-abstract-full').style.display = 'none'; document.getElementById('1503.05150v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 March, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2015. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">27 pages, 10 Figures, 1 Table</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1401.3444">arXiv:1401.3444</a> <span> [<a href="https://arxiv.org/pdf/1401.3444">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1613/jair.2520">10.1613/jair.2520 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> On the Qualitative Comparison of Decisions Having Positive and Negative Features </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Fargier%2C+H">H茅l猫ne Fargier</a>, <a href="/search/?searchtype=author&query=Bonnefon%2C+J">Jean-Fran莽ois Bonnefon</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1401.3444v1-abstract-short" style="display: inline;"> Making a decision is often a matter of listing and comparing positive and negative arguments. In such cases, the evaluation scale for decisions should be considered bipolar, that is, negative and positive values should be explicitly distinguished. That is what is done, for example, in Cumulative Prospect Theory. However, contraryto the latter framework that presupposes genuine numerical assessment… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1401.3444v1-abstract-full').style.display = 'inline'; document.getElementById('1401.3444v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1401.3444v1-abstract-full" style="display: none;"> Making a decision is often a matter of listing and comparing positive and negative arguments. In such cases, the evaluation scale for decisions should be considered bipolar, that is, negative and positive values should be explicitly distinguished. That is what is done, for example, in Cumulative Prospect Theory. However, contraryto the latter framework that presupposes genuine numerical assessments, human agents often decide on the basis of an ordinal ranking of the pros and the cons, and by focusing on the most salient arguments. In other terms, the decision process is qualitative as well as bipolar. In this article, based on a bipolar extension of possibility theory, we define and axiomatically characterize several decision rules tailored for the joint handling of positive and negative arguments in an ordinal setting. The simplest rules can be viewed as extensions of the maximin and maximax criteria to the bipolar case, and consequently suffer from poor decisive power. More decisive rules that refine the former are also proposed. These refinements agree both with principles of efficiency and with the spirit of order-of-magnitude reasoning, that prevails in qualitative decision theory. The most refined decision rule uses leximin rankings of the pros and the cons, and the ideas of counting arguments of equal strength and cancelling pros by cons. It is shown to come down to a special case of Cumulative Prospect Theory, and to subsume the Take the Best heuristic studied by cognitive psychologists. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1401.3444v1-abstract-full').style.display = 'none'; document.getElementById('1401.3444v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 January, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Journal Of Artificial Intelligence Research, Volume 32, pages 385-417, 2008 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1309.6826">arXiv:1309.6826</a> <span> [<a href="https://arxiv.org/pdf/1309.6826">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Qualitative Possibilistic Mixed-Observable MDPs </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Drougard%2C+N">Nicolas Drougard</a>, <a href="/search/?searchtype=author&query=Teichteil-Konigsbuch%2C+F">Florent Teichteil-Konigsbuch</a>, <a href="/search/?searchtype=author&query=Farges%2C+J">Jean-Loup Farges</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1309.6826v1-abstract-short" style="display: inline;"> Possibilistic and qualitative POMDPs (pi-POMDPs) are counterparts of POMDPs used to model situations where the agent's initial belief or observation probabilities are imprecise due to lack of past experiences or insufficient data collection. However, like probabilistic POMDPs, optimally solving pi-POMDPs is intractable: the finite belief state space exponentially grows with the number of system's… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1309.6826v1-abstract-full').style.display = 'inline'; document.getElementById('1309.6826v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1309.6826v1-abstract-full" style="display: none;"> Possibilistic and qualitative POMDPs (pi-POMDPs) are counterparts of POMDPs used to model situations where the agent's initial belief or observation probabilities are imprecise due to lack of past experiences or insufficient data collection. However, like probabilistic POMDPs, optimally solving pi-POMDPs is intractable: the finite belief state space exponentially grows with the number of system's states. In this paper, a possibilistic version of Mixed-Observable MDPs is presented to get around this issue: the complexity of solving pi-POMDPs, some state variables of which are fully observable, can be then dramatically reduced. A value iteration algorithm for this new formulation under infinite horizon is next proposed and the optimality of the returned policy (for a specified criterion) is shown assuming the existence of a "stay" action in some goal states. Experimental work finally shows that this possibilistic model outperforms probabilistic POMDPs commonly used in robotics, for a target recognition problem where the agent's observations are imprecise. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1309.6826v1-abstract-full').style.display = 'none'; document.getElementById('1309.6826v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 September, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI2013)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-2013-PG-192-201 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1304.3852">arXiv:1304.3852</a> <span>  </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence (1992) </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=D%27Ambrosio%2C+B">Bruce D'Ambrosio</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Smets%2C+P">Philippe Smets</a>, <a href="/search/?searchtype=author&query=Wellman%2C+M">Michael Wellman</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1304.3852v1-abstract-short" style="display: inline;"> This is the Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence, which was held in Stanford, CA, July 17-19, 1992 </span> <span class="abstract-full has-text-grey-dark mathjax" id="1304.3852v1-abstract-full" style="display: none;"> This is the Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence, which was held in Stanford, CA, July 17-19, 1992 <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.3852v1-abstract-full').style.display = 'none'; document.getElementById('1304.3852v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 April, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI1992 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1304.2349">arXiv:1304.2349</a> <span> [<a href="https://arxiv.org/pdf/1304.2349">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Modeling uncertain and vague knowledge in possibility and evidence theories </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1304.2349v1-abstract-short" style="display: inline;"> This paper advocates the usefulness of new theories of uncertainty for the purpose of modeling some facets of uncertain knowledge, especially vagueness, in AI. It can be viewed as a partial reply to Cheeseman's (among others) defense of probability. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1304.2349v1-abstract-full" style="display: none;"> This paper advocates the usefulness of new theories of uncertainty for the purpose of modeling some facets of uncertain knowledge, especially vagueness, in AI. It can be viewed as a partial reply to Cheeseman's (among others) defense of probability. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.2349v1-abstract-full').style.display = 'none'; document.getElementById('1304.2349v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Fourth Conference on Uncertainty in Artificial Intelligence (UAI1988)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1988-PG-81-89 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1304.1500">arXiv:1304.1500</a> <span> [<a href="https://arxiv.org/pdf/1304.1500">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision and Variable Certainty Weights </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Lang%2C+J">Jerome Lang</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1304.1500v1-abstract-short" style="display: inline;"> In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure, according to the nature of the uncertainty. Two resolution rules are used for coping with the different situations, and the refutation method can be generalized. Besi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.1500v1-abstract-full').style.display = 'inline'; document.getElementById('1304.1500v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1304.1500v1-abstract-full" style="display: none;"> In this paper an approach to automated deduction under uncertainty,based on possibilistic logic, is proposed ; for that purpose we deal with clauses weighted by a degree which is a lower bound of a necessity or a possibility measure, according to the nature of the uncertainty. Two resolution rules are used for coping with the different situations, and the refutation method can be generalized. Besides the lower bounds are allowed to be functions of variables involved in the clause, which gives hypothetical reasoning capabilities. The relation between our approach and the idea of minimizing abnormality is briefly discussed. In case where only lower bounds of necessity measures are involved, a semantics is proposed, in which the completeness of the extended resolution principle is proved. Moreover deduction from a partially inconsistent knowledge base can be managed in this approach and displays some form of non-monotonicity. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.1500v1-abstract-full').style.display = 'none'; document.getElementById('1304.1500v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Fifth Conference on Uncertainty in Artificial Intelligence (UAI1989)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1989-PG-81-87 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1304.1118">arXiv:1304.1118</a> <span> [<a href="https://arxiv.org/pdf/1304.1118">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Updating with Belief Functions, Ordinal Conditioning Functions and Possibility Measures </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1304.1118v1-abstract-short" style="display: inline;"> This paper discusses how a measure of uncertainty representing a state of knowledge can be updated when a new information, which may be pervaded with uncertainty, becomes available. This problem is considered in various framework, namely: Shafer's evidence theory, Zadeh's possibility theory, Spohn's theory of epistemic states. In the two first cases, analogues of Jeffrey's rule of conditioning a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.1118v1-abstract-full').style.display = 'inline'; document.getElementById('1304.1118v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1304.1118v1-abstract-full" style="display: none;"> This paper discusses how a measure of uncertainty representing a state of knowledge can be updated when a new information, which may be pervaded with uncertainty, becomes available. This problem is considered in various framework, namely: Shafer's evidence theory, Zadeh's possibility theory, Spohn's theory of epistemic states. In the two first cases, analogues of Jeffrey's rule of conditioning are introduced and discussed. The relations between Spohn's model and possibility theory are emphasized and Spohn's updating rule is contrasted with the Jeffrey-like rule of conditioning in possibility theory. Recent results by Shenoy on the combination of ordinal conditional functions are reinterpreted in the language of possibility theory. It is shown that Shenoy's combination rule has a well-known possibilistic counterpart. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.1118v1-abstract-full').style.display = 'none'; document.getElementById('1304.1118v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Sixth Conference on Uncertainty in Artificial Intelligence (UAI1990)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1990-PG-307-316 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1303.5727">arXiv:1303.5727</a> <span> [<a href="https://arxiv.org/pdf/1303.5727">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Logic in Computer Science">cs.LO</span> </div> </div> <p class="title is-5 mathjax"> A Logic of Graded Possibility and Certainty Coping with Partial Inconsistency </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Lang%2C+J">Jerome Lang</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1303.5727v1-abstract-short" style="display: inline;"> A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The proposed semantics is based on fuzzy sets of interpretations. It is tolerant to partial inconsistency. Satisfiability is extended from interpretations to fuzz… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.5727v1-abstract-full').style.display = 'inline'; document.getElementById('1303.5727v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1303.5727v1-abstract-full" style="display: none;"> A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The proposed semantics is based on fuzzy sets of interpretations. It is tolerant to partial inconsistency. Satisfiability is extended from interpretations to fuzzy sets of interpretations, each fuzzy set representing a possibility distribution describing what is known about the state of the world. A possibilistic knowledge base is then viewed as a set of possibility distributions that satisfy it. The refutation method of automated deduction in possibilistic logic, based on previously introduced generalized resolution principle is proved to be sound and complete with respect to the proposed semantics, including the case of partial inconsistency. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.5727v1-abstract-full').style.display = 'none'; document.getElementById('1303.5727v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence (UAI1991)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1991-PG-188-196 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1303.5706">arXiv:1303.5706</a> <span> [<a href="https://arxiv.org/pdf/1303.5706">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Constraint Propagation with Imprecise Conditional Probabilities </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Amarger%2C+S">Stephane Amarger</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1303.5706v1-abstract-short" style="display: inline;"> An approach to reasoning with default rules where the proportion of exceptions, or more generally the probability of encountering an exception, can be at least roughly assessed is presented. It is based on local uncertainty propagation rules which provide the best bracketing of a conditional probability of interest from the knowledge of the bracketing of some other conditional probabilities. A p… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.5706v1-abstract-full').style.display = 'inline'; document.getElementById('1303.5706v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1303.5706v1-abstract-full" style="display: none;"> An approach to reasoning with default rules where the proportion of exceptions, or more generally the probability of encountering an exception, can be at least roughly assessed is presented. It is based on local uncertainty propagation rules which provide the best bracketing of a conditional probability of interest from the knowledge of the bracketing of some other conditional probabilities. A procedure that uses two such propagation rules repeatedly is proposed in order to estimate any simple conditional probability of interest from the available knowledge. The iterative procedure, that does not require independence assumptions, looks promising with respect to the linear programming method. Improved bounds for conditional probabilities are given when independence assumptions hold. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.5706v1-abstract-full').style.display = 'none'; document.getElementById('1303.5706v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Seventh Conference on Uncertainty in Artificial Intelligence (UAI1991)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1991-PG-26-34 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1303.5401">arXiv:1303.5401</a> <span> [<a href="https://arxiv.org/pdf/1303.5401">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> A Symbolic Approach to Reasoning with Linguistic Quantifiers </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a>, <a href="/search/?searchtype=author&query=Godo%2C+L">Lluis Godo</a>, <a href="/search/?searchtype=author&query=de+Mantaras%2C+R+L">Ramon Lopez de Mantaras</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1303.5401v1-abstract-short" style="display: inline;"> This paper investigates the possibility of performing automated reasoning in probabilistic logic when probabilities are expressed by means of linguistic quantifiers. Each linguistic term is expressed as a prescribed interval of proportions. Then instead of propagating numbers, qualitative terms are propagated in accordance with the numerical interpretation of these terms. The quantified syllogi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.5401v1-abstract-full').style.display = 'inline'; document.getElementById('1303.5401v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1303.5401v1-abstract-full" style="display: none;"> This paper investigates the possibility of performing automated reasoning in probabilistic logic when probabilities are expressed by means of linguistic quantifiers. Each linguistic term is expressed as a prescribed interval of proportions. Then instead of propagating numbers, qualitative terms are propagated in accordance with the numerical interpretation of these terms. The quantified syllogism, modelling the chaining of probabilistic rules, is studied in this context. It is shown that a qualitative counterpart of this syllogism makes sense, and is relatively independent of the threshold defining the linguistically meaningful intervals, provided that these threshold values remain in accordance with the intuition. The inference power is less than that of a full-fledged probabilistic con-quaint propagation device but better corresponds to what could be thought of as commonsense probabilistic reasoning. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.5401v1-abstract-full').style.display = 'none'; document.getElementById('1303.5401v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Eighth Conference on Uncertainty in Artificial Intelligence (UAI1992)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1992-PG-74-82 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1303.1503">arXiv:1303.1503</a> <span> [<a href="https://arxiv.org/pdf/1303.1503">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Argumentative inference in uncertain and inconsistent knowledge bases </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Benferhat%2C+S">Salem Benferhat</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1303.1503v1-abstract-short" style="display: inline;"> This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary, is particularly investigated. Flat knowledge bases, i.e. without any priority between their elements, a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.1503v1-abstract-full').style.display = 'inline'; document.getElementById('1303.1503v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1303.1503v1-abstract-full" style="display: none;"> This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the absence of consistent arguments in favor of its contrary, is particularly investigated. Flat knowledge bases, i.e. without any priority between their elements, as well as prioritized ones where some elements are considered as more strongly entrenched than others are studied under different consequence relations. Lastly a paraconsistent-like treatment of prioritized knowledge bases is proposed, where both the level of entrenchment and the level of paraconsistency attached to a formula are propagated. The priority levels are handled in the framework of possibility theory. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.1503v1-abstract-full').style.display = 'none'; document.getElementById('1303.1503v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence (UAI1993)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1993-PG-411-419 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1303.1466">arXiv:1303.1466</a> <span> [<a href="https://arxiv.org/pdf/1303.1466">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> A fuzzy relation-based extension of Reggia's relational model for diagnosis handling uncertain and incomplete information </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1303.1466v1-abstract-short" style="display: inline;"> Relational models for diagnosis are based on a direct description of the association between disorders and manifestations. This type of model has been specially used and developed by Reggia and his co-workers in the late eighties as a basic starting point for approaching diagnosis problems. The paper proposes a new relational model which includes Reggia's model as a particular case and which all… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.1466v1-abstract-full').style.display = 'inline'; document.getElementById('1303.1466v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1303.1466v1-abstract-full" style="display: none;"> Relational models for diagnosis are based on a direct description of the association between disorders and manifestations. This type of model has been specially used and developed by Reggia and his co-workers in the late eighties as a basic starting point for approaching diagnosis problems. The paper proposes a new relational model which includes Reggia's model as a particular case and which allows for a more expressive representation of the observations and of the manifestations associated with disorders. The model distinguishes, i) between manifestations which are certainly absent and those which are not (yet) observed, and ii) between manifestations which cannot be caused by a given disorder and manifestations for which we do not know if they can or cannot be caused by this disorder. This new model, which can handle uncertainty in a non-probabilistic way, is based on possibility theory and so-called twofold fuzzy sets, previously introduced by the authors. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1303.1466v1-abstract-full').style.display = 'none'; document.getElementById('1303.1466v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence (UAI1993)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1993-PG-106-113 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1302.6803">arXiv:1302.6803</a> <span> [<a href="https://arxiv.org/pdf/1302.6803">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> An Ordinal View of Independence with Application to Plausible Reasoning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=del+Cerro%2C+L+F">Luis Farinas del Cerro</a>, <a href="/search/?searchtype=author&query=Herzig%2C+A">Andreas Herzig</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1302.6803v1-abstract-short" style="display: inline;"> An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability theory, and the two others are based on the notion of conditional possibility. These two have enough expressive power to support the whole possibility theory, and… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.6803v1-abstract-full').style.display = 'inline'; document.getElementById('1302.6803v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1302.6803v1-abstract-full" style="display: none;"> An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability theory, and the two others are based on the notion of conditional possibility. These two have enough expressive power to support the whole possibility theory, and a complete axiomatization is provided for the strongest one. Moreover we show that weak independence is well-suited to the problems of belief change and plausible reasoning, especially to address the problem of blocking of property inheritance in exception-tolerant taxonomic reasoning. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.6803v1-abstract-full').style.display = 'none'; document.getElementById('1302.6803v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 February, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI1994)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1994-PG-195-203 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1302.4944">arXiv:1302.4944</a> <span> [<a href="https://arxiv.org/pdf/1302.4944">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Numerical Representations of Acceptance </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1302.4944v1-abstract-short" style="display: inline;"> Accepting a proposition means that our confidence in this proposition is strictly greater than the confidence in its negation. This paper investigates the subclass of uncertainty measures, expressing confidence, that capture the idea of acceptance, what we call acceptance functions. Due to the monotonicity property of confidence measures, the acceptance of a proposition entails the acceptance of… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.4944v1-abstract-full').style.display = 'inline'; document.getElementById('1302.4944v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1302.4944v1-abstract-full" style="display: none;"> Accepting a proposition means that our confidence in this proposition is strictly greater than the confidence in its negation. This paper investigates the subclass of uncertainty measures, expressing confidence, that capture the idea of acceptance, what we call acceptance functions. Due to the monotonicity property of confidence measures, the acceptance of a proposition entails the acceptance of any of its logical consequences. In agreement with the idea that a belief set (in the sense of Gardenfors) must be closed under logical consequence, it is also required that the separate acceptance o two propositions entail the acceptance of their conjunction. Necessity (and possibility) measures agree with this view of acceptance while probability and belief functions generally do not. General properties of acceptance functions are estabilished. The motivation behind this work is the investigation of a setting for belief revision more general than the one proposed by Alchourron, Gardenfors and Makinson, in connection with the notion of conditioning. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.4944v1-abstract-full').style.display = 'none'; document.getElementById('1302.4944v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 February, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI1995)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1995-PG-149-156 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1302.4936">arXiv:1302.4936</a> <span> [<a href="https://arxiv.org/pdf/1302.4936">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Practical Model-Based Diagnosis with Qualitative Possibilistic Uncertainty </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Cayrac%2C+D">Didier Cayrac</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1302.4936v1-abstract-short" style="display: inline;"> An approach to fault isolation that exploits vastly incomplete models is presented. It relies on separate descriptions of each component behavior, together with the links between them, which enables focusing of the reasoning to the relevant part of the system. As normal observations do not need explanation, the behavior of the components is limited to anomaly propagation. Diagnostic solutions are… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.4936v1-abstract-full').style.display = 'inline'; document.getElementById('1302.4936v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1302.4936v1-abstract-full" style="display: none;"> An approach to fault isolation that exploits vastly incomplete models is presented. It relies on separate descriptions of each component behavior, together with the links between them, which enables focusing of the reasoning to the relevant part of the system. As normal observations do not need explanation, the behavior of the components is limited to anomaly propagation. Diagnostic solutions are disorders (fault modes or abnormal signatures) that are consistent with the observations, as well as abductive explanations. An ordinal representation of uncertainty based on possibility theory provides a simple exception-tolerant description of the component behaviors. We can for instance distinguish between effects that are more or less certainly present (or absent) and effects that are more or less certainly present (or absent) when a given anomaly is present. A realistic example illustrates the benefits of this approach. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.4936v1-abstract-full').style.display = 'none'; document.getElementById('1302.4936v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 February, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI1995)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1995-PG-68-76 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1302.3575">arXiv:1302.3575</a> <span> [<a href="https://arxiv.org/pdf/1302.3575">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Belief Revision with Uncertain Inputs in the Possibilistic Setting </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1302.3575v1-abstract-short" style="display: inline;"> This paper discusses belief revision under uncertain inputs in the framework of possibility theory. Revision can be based on two possible definitions of the conditioning operation, one based on min operator which requires a purely ordinal scale only, and another based on product, for which a richer structure is needed, and which is a particular case of Dempster's rule of conditioning. Besides, r… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.3575v1-abstract-full').style.display = 'inline'; document.getElementById('1302.3575v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1302.3575v1-abstract-full" style="display: none;"> This paper discusses belief revision under uncertain inputs in the framework of possibility theory. Revision can be based on two possible definitions of the conditioning operation, one based on min operator which requires a purely ordinal scale only, and another based on product, for which a richer structure is needed, and which is a particular case of Dempster's rule of conditioning. Besides, revision under uncertain inputs can be understood in two different ways depending on whether the input is viewed, or not, as a constraint to enforce. Moreover, it is shown that M.A. Williams' transmutations, originally defined in the setting of Spohn's functions, can be captured in this framework, as well as Boutilier's natural revision. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.3575v1-abstract-full').style.display = 'none'; document.getElementById('1302.3575v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 February, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1996-PG-236-243 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1302.3559">arXiv:1302.3559</a> <span> [<a href="https://arxiv.org/pdf/1302.3559">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Coping with the Limitations of Rational Inference in the Framework of Possibility Theory </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Benferhat%2C+S">Salem Benferhat</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1302.3559v1-abstract-short" style="display: inline;"> Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does not provide expected results either because it cannot produce them, or even provide counter-intuitive conclusions. This state of facts is not due to the princip… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.3559v1-abstract-full').style.display = 'inline'; document.getElementById('1302.3559v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1302.3559v1-abstract-full" style="display: none;"> Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does not provide expected results either because it cannot produce them, or even provide counter-intuitive conclusions. This state of facts is not due to the principle of selecting a unique ordering of interpretations (which can be encoded by one possibility distribution), but rather to the absence of constraints expressing pieces of knowledge we have implicitly in mind. It is advocated in this paper that constraints induced by independence information can help finding the right ordering of interpretations. In particular, independence constraints can be systematically assumed with respect to formulas composed of literals which do not appear in the conditional knowledge base, or for default rules with respect to situations which are "normal" according to the other default rules in the base. The notion of independence which is used can be easily expressed in the qualitative setting of possibility theory. Moreover, when a counter-intuitive plausible conclusion of a set of defaults, is in its rational closure, but not in its preferential closure, it is always possible to repair the set of defaults so as to produce the desired conclusion. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.3559v1-abstract-full').style.display = 'none'; document.getElementById('1302.3559v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 February, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1996-PG-90-97 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1302.1537">arXiv:1302.1537</a> <span> [<a href="https://arxiv.org/pdf/1302.1537">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Decision-making Under Ordinal Preferences and Comparative Uncertainty </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Fargier%2C+H">Helene Fargier</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1302.1537v1-abstract-short" style="display: inline;"> This paper investigates the problem of finding a preference relation on a set of acts from the knowledge of an ordering on events (subsets of states of the world) describing the decision-maker (DM)s uncertainty and an ordering of consequences of acts, describing the DMs preferences. However, contrary to classical approaches to decision theory, we try to do it without resorting to any numerical re… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.1537v1-abstract-full').style.display = 'inline'; document.getElementById('1302.1537v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1302.1537v1-abstract-full" style="display: none;"> This paper investigates the problem of finding a preference relation on a set of acts from the knowledge of an ordering on events (subsets of states of the world) describing the decision-maker (DM)s uncertainty and an ordering of consequences of acts, describing the DMs preferences. However, contrary to classical approaches to decision theory, we try to do it without resorting to any numerical representation of utility nor uncertainty, and without even using any qualitative scale on which both uncertainty and preference could be mapped. It is shown that although many axioms of Savage theory can be preserved and despite the intuitive appeal of the method for constructing a preference over acts, the approach is inconsistent with a probabilistic representation of uncertainty, but leads to the kind of uncertainty theory encountered in non-monotonic reasoning (especially preferential and rational inference), closely related to possibility theory. Moreover the method turns out to be either very little decisive or to lead to very risky decisions, although its basic principles look sound. This paper raises the question of the very possibility of purely symbolic approaches to Savage-like decision-making under uncertainty and obtains preliminary negative results. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1302.1537v1-abstract-full').style.display = 'none'; document.getElementById('1302.1537v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 February, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1997-PG-157-164 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1301.7372">arXiv:1301.7372</a> <span> [<a href="https://arxiv.org/pdf/1301.7372">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Qualitative Decision Theory with Sugeno Integrals </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a>, <a href="/search/?searchtype=author&query=Sabbadin%2C+R">Regis Sabbadin</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1301.7372v1-abstract-short" style="display: inline;"> This paper presents an axiomatic framework for qualitative decision under uncertainty in a finite setting. The corresponding utility is expressed by a sup-min expression, called Sugeno (or fuzzy) integral. Technically speaking, Sugeno integral is a median, which is indeed a qualitative counterpart to the averaging operation underlying expected utility. The axiomatic justification of Sugeno integ… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.7372v1-abstract-full').style.display = 'inline'; document.getElementById('1301.7372v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1301.7372v1-abstract-full" style="display: none;"> This paper presents an axiomatic framework for qualitative decision under uncertainty in a finite setting. The corresponding utility is expressed by a sup-min expression, called Sugeno (or fuzzy) integral. Technically speaking, Sugeno integral is a median, which is indeed a qualitative counterpart to the averaging operation underlying expected utility. The axiomatic justification of Sugeno integral-based utility is expressed in terms of preference between acts as in Savage decision theory. Pessimistic and optimistic qualitative utilities, based on necessity and possibility measures, previously introduced by two of the authors, can be retrieved in this setting by adding appropriate axioms. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.7372v1-abstract-full').style.display = 'none'; document.getElementById('1301.7372v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 30 January, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI1998)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1998-PG-121-128 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1301.7371">arXiv:1301.7371</a> <span> [<a href="https://arxiv.org/pdf/1301.7371">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Comparative Uncertainty, Belief Functions and Accepted Beliefs </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Fargier%2C+H">Helene Fargier</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1301.7371v1-abstract-short" style="display: inline;"> This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical deductive closure and uncertain reasoning covers precisely the nonmonotonic 'preferential' inference system of Kraus, Lehmann and Magidor and nothing else. In terms o… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.7371v1-abstract-full').style.display = 'inline'; document.getElementById('1301.7371v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1301.7371v1-abstract-full" style="display: none;"> This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical deductive closure and uncertain reasoning covers precisely the nonmonotonic 'preferential' inference system of Kraus, Lehmann and Magidor and nothing else. In terms of uncertain reasoning any possibility or necessity measure gives birth to a structure of accepted beliefs. The classes of probability functions and of Shafer's belief functions which yield belief sets prove to be very special ones. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.7371v1-abstract-full').style.display = 'none'; document.getElementById('1301.7371v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 30 January, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI1998)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1998-PG-113-120 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1301.6692">arXiv:1301.6692</a> <span> [<a href="https://arxiv.org/pdf/1301.6692">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Assessing the value of a candidate. Comparing belief function and possibility theories </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Grabisch%2C+M">Michel Grabisch</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a>, <a href="/search/?searchtype=author&query=Smets%2C+P">Philippe Smets</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1301.6692v1-abstract-short" style="display: inline;"> The problem of assessing the value of a candidate is viewed here as a multiple combination problem. On the one hand a candidate can be evaluated according to different criteria, and on the other hand several experts are supposed to assess the value of candidates according to each criterion. Criteria are not equally important, experts are not equally competent or reliable. Moreover levels of satisf… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.6692v1-abstract-full').style.display = 'inline'; document.getElementById('1301.6692v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1301.6692v1-abstract-full" style="display: none;"> The problem of assessing the value of a candidate is viewed here as a multiple combination problem. On the one hand a candidate can be evaluated according to different criteria, and on the other hand several experts are supposed to assess the value of candidates according to each criterion. Criteria are not equally important, experts are not equally competent or reliable. Moreover levels of satisfaction of criteria, or levels of confidence are only assumed to take their values in qualitative scales which are just linearly ordered. The problem is discussed within two frameworks, the transferable belief model and the qualitative possibility theory. They respectively offer a quantitative and a qualitative setting for handling the problem, providing thus a way to compare the nature of the underlying assumptions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.6692v1-abstract-full').style.display = 'none'; document.getElementById('1301.6692v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 January, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI1999)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1999-PG-170-177 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1301.6679">arXiv:1301.6679</a> <span> [<a href="https://arxiv.org/pdf/1301.6679">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Possibilistic logic bases and possibilistic graphs </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Benferhat%2C+S">Salem Benferhat</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Garcia%2C+L">Laurent Garcia</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1301.6679v1-abstract-short" style="display: inline;"> Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. The former stratifies the pieces of knowledge (expressed by logical formulas) according to their level of certainty, while the latter exhibits relationships between variables. The two types of representations are semantically equivalent when they lead to the same possibility dist… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.6679v1-abstract-full').style.display = 'inline'; document.getElementById('1301.6679v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1301.6679v1-abstract-full" style="display: none;"> Possibilistic logic bases and possibilistic graphs are two different frameworks of interest for representing knowledge. The former stratifies the pieces of knowledge (expressed by logical formulas) according to their level of certainty, while the latter exhibits relationships between variables. The two types of representations are semantically equivalent when they lead to the same possibility distribution (which rank-orders the possible interpretations). A possibility distribution can be decomposed using a chain rule which may be based on two different kinds of conditioning which exist in possibility theory (one based on product in a numerical setting, one based on minimum operation in a qualitative setting). These two types of conditioning induce two kinds of possibilistic graphs. In both cases, a translation of these graphs into possibilistic bases is provided. The converse translation from a possibilistic knowledge base into a min-based graph is also described. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.6679v1-abstract-full').style.display = 'none'; document.getElementById('1301.6679v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 January, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI1999)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-1999-PG-57-64 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1301.3835">arXiv:1301.3835</a> <span> [<a href="https://arxiv.org/pdf/1301.3835">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> A Principled Analysis of Merging Operations in Possibilistic Logic </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Benferhat%2C+S">Salem Benferhat</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Kaci%2C+S">Souhila Kaci</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1301.3835v1-abstract-short" style="display: inline;"> Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of merging operators are considered including conjunctive, disjunctive, reinforcement, adaptive and averaging operators. Then we propose to analyse these classes in t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.3835v1-abstract-full').style.display = 'inline'; document.getElementById('1301.3835v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1301.3835v1-abstract-full" style="display: none;"> Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of merging operators are considered including conjunctive, disjunctive, reinforcement, adaptive and averaging operators. Then we propose to analyse these classes in terms of postulates. This is done by first extending the postulate for merging classical bases to the case where priorites are avaialbe. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.3835v1-abstract-full').style.display = 'none'; document.getElementById('1301.3835v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 January, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence (UAI2000)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-2000-PG-24-31 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1301.2255">arXiv:1301.2255</a> <span> [<a href="https://arxiv.org/pdf/1301.2255">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Graphical readings of possibilistic logic bases </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Benferhat%2C+S">Salem Benferhat</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Kaci%2C+S">Souhila Kaci</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1301.2255v1-abstract-short" style="display: inline;"> Possibility theory offers either a qualitive, or a numerical framework for representing uncertainty, in terms of dual measures of possibility and necessity. This leads to the existence of two kinds of possibilistic causal graphs where the conditioning is either based on the minimum, or the product operator. Benferhat et al. (1999) have investigated the connections between min-based graphs and poss… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.2255v1-abstract-full').style.display = 'inline'; document.getElementById('1301.2255v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1301.2255v1-abstract-full" style="display: none;"> Possibility theory offers either a qualitive, or a numerical framework for representing uncertainty, in terms of dual measures of possibility and necessity. This leads to the existence of two kinds of possibilistic causal graphs where the conditioning is either based on the minimum, or the product operator. Benferhat et al. (1999) have investigated the connections between min-based graphs and possibilistic logic bases (made of classical formulas weighted in terms of certainty). This paper deals with a more difficult issue : the product-based graphical representations of possibilistic bases, which provides an easy structural reading of possibilistic bases. Moreover, this paper also provides another reading of possibilistic bases in terms of comparative preferences of the form "in the context p, q is preferred to not q". This enables us to explicit preferences underlying a set of goals with different levels of priority. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.2255v1-abstract-full').style.display = 'none'; document.getElementById('1301.2255v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 January, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI2001)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-2001-PG-24-31 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1301.0555">arXiv:1301.0555</a> <span> [<a href="https://arxiv.org/pdf/1301.0555">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Bipolar Possibilistic Representations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Benferhat%2C+S">Salem Benferhat</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Kaci%2C+S">Souhila Kaci</a>, <a href="/search/?searchtype=author&query=Prade%2C+H">Henri Prade</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1301.0555v1-abstract-short" style="display: inline;"> Recently, it has been emphasized that the possibility theory framework allows us to distinguish between i) what is possible because it is not ruled out by the available knowledge, and ii) what is possible for sure. This distinction may be useful when representing knowledge, for modelling values which are not impossible because they are consistent with the available knowledge on the one hand, and v… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.0555v1-abstract-full').style.display = 'inline'; document.getElementById('1301.0555v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1301.0555v1-abstract-full" style="display: none;"> Recently, it has been emphasized that the possibility theory framework allows us to distinguish between i) what is possible because it is not ruled out by the available knowledge, and ii) what is possible for sure. This distinction may be useful when representing knowledge, for modelling values which are not impossible because they are consistent with the available knowledge on the one hand, and values guaranteed to be possible because reported from observations on the other hand. It is also of interest when expressing preferences, to point out values which are positively desired among those which are not rejected. This distinction can be encoded by two types of constraints expressed in terms of necessity measures and in terms of guaranteed possibility functions, which induce a pair of possibility distributions at the semantic level. A consistency condition should ensure that what is claimed to be guaranteed as possible is indeed not impossible. The present paper investigates the representation of this bipolar view, including the case when it is stated by means of conditional measures, or by means of comparative context-dependent constraints. The interest of this bipolar framework, which has been recently stressed for expressing preferences, is also pointed out in the representation of diagnostic knowledge. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1301.0555v1-abstract-full').style.display = 'none'; document.getElementById('1301.0555v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 December, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2013. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI2002)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-2002-PG-45-52 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1207.4117">arXiv:1207.4117</a> <span> [<a href="https://arxiv.org/pdf/1207.4117">pdf</a>, <a href="https://arxiv.org/ps/1207.4117">ps</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> A Unified framework for order-of-magnitude confidence relations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Fargier%2C+H">Helene Fargier</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1207.4117v2-abstract-short" style="display: inline;"> The aim of this work is to provide a unified framework for ordinal representations of uncertainty lying at the crosswords between possibility and probability theories. Such confidence relations between events are commonly found in monotonic reasoning, inconsistency management, or qualitative decision theory. They start either from probability theory, making it more qualitative, or from possibility… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1207.4117v2-abstract-full').style.display = 'inline'; document.getElementById('1207.4117v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1207.4117v2-abstract-full" style="display: none;"> The aim of this work is to provide a unified framework for ordinal representations of uncertainty lying at the crosswords between possibility and probability theories. Such confidence relations between events are commonly found in monotonic reasoning, inconsistency management, or qualitative decision theory. They start either from probability theory, making it more qualitative, or from possibility theory, making it more expressive. We show these two trends converge to a class of genuine probability theories. We provide characterization results for these useful tools that preserve the qualitative nature of possibility rankings, while enjoying the power of expressivity of additive representations. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1207.4117v2-abstract-full').style.display = 'none'; document.getElementById('1207.4117v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 August, 2012; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 11 July, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Appears in Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (UAI2004)</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UAI-P-2004-PG-138-145 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1202.2509">arXiv:1202.2509</a> <span> [<a href="https://arxiv.org/pdf/1202.2509">pdf</a>, <a href="https://arxiv.org/format/1202.2509">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> </div> </div> <p class="title is-5 mathjax"> DEPAS: A Decentralized Probabilistic Algorithm for Auto-Scaling </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Calcavecchia%2C+N+M">Nicolo M. Calcavecchia</a>, <a href="/search/?searchtype=author&query=Caprarescu%2C+B+A">Bogdan Alexandru Caprarescu</a>, <a href="/search/?searchtype=author&query=Di+Nitto%2C+E">Elisabetta Di Nitto</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+J">Daniel J. Dubois</a>, <a href="/search/?searchtype=author&query=Petcu%2C+D">Dana Petcu</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="1202.2509v1-abstract-short" style="display: inline;"> The dynamic provisioning of virtualized resources offered by cloud computing infrastructures allows applications deployed in a cloud environment to automatically increase and decrease the amount of used resources. This capability is called auto-scaling and its main purpose is to automatically adjust the scale of the system that is running the application to satisfy the varying workload with minimu… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1202.2509v1-abstract-full').style.display = 'inline'; document.getElementById('1202.2509v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1202.2509v1-abstract-full" style="display: none;"> The dynamic provisioning of virtualized resources offered by cloud computing infrastructures allows applications deployed in a cloud environment to automatically increase and decrease the amount of used resources. This capability is called auto-scaling and its main purpose is to automatically adjust the scale of the system that is running the application to satisfy the varying workload with minimum resource utilization. The need for auto-scaling is particularly important during workload peaks, in which applications may need to scale up to extremely large-scale systems. Both the research community and the main cloud providers have already developed auto-scaling solutions. However, most research solutions are centralized and not suitable for managing large-scale systems, moreover cloud providers' solutions are bound to the limitations of a specific provider in terms of resource prices, availability, reliability, and connectivity. In this paper we propose DEPAS, a decentralized probabilistic auto-scaling algorithm integrated into a P2P architecture that is cloud provider independent, thus allowing the auto-scaling of services over multiple cloud infrastructures at the same time. Our simulations, which are based on real service traces, show that our approach is capable of: (i) keeping the overall utilization of all the instantiated cloud resources in a target range, (ii) maintaining service response times close to the ones obtained using optimal centralized auto-scaling approaches. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1202.2509v1-abstract-full').style.display = 'none'; document.getElementById('1202.2509v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 February, 2012; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2012. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Submitted to Springer Computing</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> Technical Report 2012.5, Politecnico di Milano </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0912.1226">arXiv:0912.1226</a> <span> [<a href="https://arxiv.org/pdf/0912.1226">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Physics and Society">physics.soc-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Adaptation and Self-Organizing Systems">nlin.AO</span> </div> </div> <p class="title is-5 mathjax"> Anticipation in Social Systems: the Incursion and Communication of Meaning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Leydesdorff%2C+L">Loet Leydesdorff</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D+M">Daniel M. Dubois</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="0912.1226v1-abstract-short" style="display: inline;"> In social systems, meaning can be communicated in addition to underlying processes of the information exchange. Meaning processing incurs on information processing with hindsight, while information processing recursively follows the time axis. The sole assumption of social relatedness as a variable among groups of agents provides sufficient basis for deriving the logistic map as a first-order ap… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0912.1226v1-abstract-full').style.display = 'inline'; document.getElementById('0912.1226v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0912.1226v1-abstract-full" style="display: none;"> In social systems, meaning can be communicated in addition to underlying processes of the information exchange. Meaning processing incurs on information processing with hindsight, while information processing recursively follows the time axis. The sole assumption of social relatedness as a variable among groups of agents provides sufficient basis for deriving the logistic map as a first-order approximation of the social system. The anticipatory formulation of this equation can be derived for both anticipation in the interaction term and in the aggregation among subgroups. Using this formula in a cellular automaton, an observer is generated as a reflection of the system under observation. The social system of interactions among observations can improve on the representations entertained by each of the observing systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0912.1226v1-abstract-full').style.display = 'none'; document.getElementById('0912.1226v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 December, 2009; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2009. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> International Journal of Computing Anticipatory Systems, 15, 203-216, 2004 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0911.1288">arXiv:0911.1288</a> <span> [<a href="https://arxiv.org/pdf/0911.1288">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Human-Computer Interaction">cs.HC</span> </div> </div> <p class="title is-5 mathjax"> What is instrumentality in new digital msuical devices ? A contribution from cognitive linguistics and psychology </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Cance%2C+C">Caroline Cance</a>, <a href="/search/?searchtype=author&query=Genevois%2C+H">Hugues Genevois</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Dani猫le Dubois</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="0911.1288v1-abstract-short" style="display: inline;"> As far as music is concerned, instruments have always been part of a cultural ?landscape? (on technical, expressive and symbolic levels). The present contribution explores the changes brought about by the shift that occurred during the 20th century, from mechanical to digital instruments (also named ?virtual instruments?). First and foremost, a short recall of some historical steps of the techno… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0911.1288v1-abstract-full').style.display = 'inline'; document.getElementById('0911.1288v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0911.1288v1-abstract-full" style="display: none;"> As far as music is concerned, instruments have always been part of a cultural ?landscape? (on technical, expressive and symbolic levels). The present contribution explores the changes brought about by the shift that occurred during the 20th century, from mechanical to digital instruments (also named ?virtual instruments?). First and foremost, a short recall of some historical steps of the technological developments that have renewed our relationship to sound, music, and instruments will be presented. Second, an analysis of different discourses and terminologies presently used in the domains of musicology and computer music will account for the evolution of the notion of instrumentality. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0911.1288v1-abstract-full').style.display = 'none'; document.getElementById('0911.1288v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 November, 2009; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2009. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">11 pages</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> What is instrumentality in new digital musical devices ? A contribution from cognitive linguistics and psychology, Paris : France (2009) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0808.2779">arXiv:0808.2779</a> <span> [<a href="https://arxiv.org/pdf/0808.2779">pdf</a>, <a href="https://arxiv.org/ps/0808.2779">ps</a>, <a href="https://arxiv.org/format/0808.2779">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Probability">math.PR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Statistics Theory">math.ST</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1016/j.ijar.2008.07.004">10.1016/j.ijar.2008.07.004 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Unifying Practical Uncertainty Representations: II. Clouds </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Destercke%2C+S">Sebastien Destercke</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Chojnacki%2C+E">Eric Chojnacki</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="0808.2779v1-abstract-short" style="display: inline;"> There exist many simple tools for jointly capturing variability and incomplete information by means of uncertainty representations. Among them are random sets, possibility distributions, probability intervals, and the more recent Ferson's p-boxes and Neumaier's clouds, both defined by pairs of possibility distributions. In the companion paper, we have extensively studied a generalized form of p-… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0808.2779v1-abstract-full').style.display = 'inline'; document.getElementById('0808.2779v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0808.2779v1-abstract-full" style="display: none;"> There exist many simple tools for jointly capturing variability and incomplete information by means of uncertainty representations. Among them are random sets, possibility distributions, probability intervals, and the more recent Ferson's p-boxes and Neumaier's clouds, both defined by pairs of possibility distributions. In the companion paper, we have extensively studied a generalized form of p-box and situated it with respect to other models . This paper focuses on the links between clouds and other representations. Generalized p-boxes are shown to be clouds with comonotonic distributions. In general, clouds cannot always be represented by random sets, in fact not even by 2-monotone (convex) capacities. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0808.2779v1-abstract-full').style.display = 'none'; document.getElementById('0808.2779v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 August, 2008; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2008. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">30 pages, 7 figures, Pre-print of journal paper to be published in International Journal of Approximate Reasoning (with expanded section concerning clouds and probability intervals)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0808.2747">arXiv:0808.2747</a> <span> [<a href="https://arxiv.org/pdf/0808.2747">pdf</a>, <a href="https://arxiv.org/ps/0808.2747">ps</a>, <a href="https://arxiv.org/format/0808.2747">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Probability">math.PR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Statistics Theory">math.ST</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1016/j.ijar.2008.07.003">10.1016/j.ijar.2008.07.003 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Unifying Practical Uncertainty Representations: I. Generalized P-Boxes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Destercke%2C+S">Sebastien Destercke</a>, <a href="/search/?searchtype=author&query=Dubois%2C+D">Didier Dubois</a>, <a href="/search/?searchtype=author&query=Chojnacki%2C+E">Eric Chojnacki</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="0808.2747v1-abstract-short" style="display: inline;"> There exist several simple representations of uncertainty that are easier to handle than more general ones. Among them are random sets, possibility distributions, probability intervals, and more recently Ferson's p-boxes and Neumaier's clouds. Both for theoretical and practical considerations, it is very useful to know whether one representation is equivalent to or can be approximated by other o… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0808.2747v1-abstract-full').style.display = 'inline'; document.getElementById('0808.2747v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0808.2747v1-abstract-full" style="display: none;"> There exist several simple representations of uncertainty that are easier to handle than more general ones. Among them are random sets, possibility distributions, probability intervals, and more recently Ferson's p-boxes and Neumaier's clouds. Both for theoretical and practical considerations, it is very useful to know whether one representation is equivalent to or can be approximated by other ones. In this paper, we define a generalized form of usual p-boxes. These generalized p-boxes have interesting connections with other previously known representations. In particular, we show that they are equivalent to pairs of possibility distributions, and that they are special kinds of random sets. They are also the missing link between p-boxes and clouds, which are the topic of the second part of this study. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0808.2747v1-abstract-full').style.display = 'none'; document.getElementById('0808.2747v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 August, 2008; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2008. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">29 pages, 6 figures, pre-print of the final journal paper to be published in International Journal of Approximate Reasoning (IJAR)</span> </p> </li> </ol> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository