CINXE.COM

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"/> <!-- new favicon config and versions by realfavicongenerator.net --> <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"> <!-- end favicon config --> <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> <!-- contains Cornell logo and sponsor statement --> <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> <!-- contains arXiv identity and search bar --> <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> <!-- closes identity --> <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&ndash;18 of 18 results for author: <span class="mathjax">Jan, S</span> </h1> </div> <div class="level-right is-hidden-mobile"> <!-- feedback for mobile is moved to footer --> <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>&nbsp;&nbsp;</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="Jan, S"> </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=Jan%2C+S&amp;terms-0-field=author&amp;size=50&amp;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="Jan, S"> <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/2402.01199">arXiv:2402.01199</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/2402.01199">pdf</a>, <a href="https://arxiv.org/ps/2402.01199">ps</a>, <a href="https://arxiv.org/format/2402.01199">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Optimization and Control">math.OC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">stat.ML</span> </div> </div> <p class="title is-5 mathjax"> MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Sbihi%2C+M">Mohammed Sbihi</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Sophie Jan</a>, <a href="/search/?searchtype=author&amp;query=Couellan%2C+N">Nicolas Couellan</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="2402.01199v1-abstract-short" style="display: inline;"> It is well established that to ensure or certify the robustness of a neural network, its Lipschitz constant plays a prominent role. However, its calculation is NP-hard. In this note, by taking into account activation regions at each layer as new constraints, we propose new quadratically constrained MIP formulations for the neural network Lipschitz estimation problem. The solutions of these problem&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2402.01199v1-abstract-full').style.display = 'inline'; document.getElementById('2402.01199v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2402.01199v1-abstract-full" style="display: none;"> It is well established that to ensure or certify the robustness of a neural network, its Lipschitz constant plays a prominent role. However, its calculation is NP-hard. In this note, by taking into account activation regions at each layer as new constraints, we propose new quadratically constrained MIP formulations for the neural network Lipschitz estimation problem. The solutions of these problems give lower bounds and upper bounds of the Lipschitz constant and we detail conditions when they coincide with the exact Lipschitz constant. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2402.01199v1-abstract-full').style.display = 'none'; document.getElementById('2402.01199v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 2 February, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2310.06572">arXiv:2310.06572</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/2310.06572">pdf</a>, <a href="https://arxiv.org/format/2310.06572">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Instrumentation and Detectors">physics.ins-det</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-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.1016/j.engappai.2024.107876">10.1016/j.engappai.2024.107876 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Deep Learning reconstruction with uncertainty estimation for $纬$ photon interaction in fast scintillator detectors </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Daniel%2C+G">Geoffrey Daniel</a>, <a href="/search/?searchtype=author&amp;query=Yahiaoui%2C+M+B">Mohamed Bahi Yahiaoui</a>, <a href="/search/?searchtype=author&amp;query=Comtat%2C+C">Claude Comtat</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Sebastien Jan</a>, <a href="/search/?searchtype=author&amp;query=Kochebina%2C+O">Olga Kochebina</a>, <a href="/search/?searchtype=author&amp;query=Martinez%2C+J">Jean-Marc Martinez</a>, <a href="/search/?searchtype=author&amp;query=Sergeyeva%2C+V">Viktoriya Sergeyeva</a>, <a href="/search/?searchtype=author&amp;query=Sharyy%2C+V">Viatcheslav Sharyy</a>, <a href="/search/?searchtype=author&amp;query=Sung%2C+C">Chi-Hsun Sung</a>, <a href="/search/?searchtype=author&amp;query=Yvon%2C+D">Dominique Yvon</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="2310.06572v1-abstract-short" style="display: inline;"> This article presents a physics-informed deep learning method for the quantitative estimation of the spatial coordinates of gamma interactions within a monolithic scintillator, with a focus on Positron Emission Tomography (PET) imaging. A Density Neural Network approach is designed to estimate the 2-dimensional gamma photon interaction coordinates in a fast lead tungstate (PbWO4) monolithic scinti&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2310.06572v1-abstract-full').style.display = 'inline'; document.getElementById('2310.06572v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2310.06572v1-abstract-full" style="display: none;"> This article presents a physics-informed deep learning method for the quantitative estimation of the spatial coordinates of gamma interactions within a monolithic scintillator, with a focus on Positron Emission Tomography (PET) imaging. A Density Neural Network approach is designed to estimate the 2-dimensional gamma photon interaction coordinates in a fast lead tungstate (PbWO4) monolithic scintillator detector. We introduce a custom loss function to estimate the inherent uncertainties associated with the reconstruction process and to incorporate the physical constraints of the detector. This unique combination allows for more robust and reliable position estimations and the obtained results demonstrate the effectiveness of the proposed approach and highlights the significant benefits of the uncertainties estimation. We discuss its potential impact on improving PET imaging quality and show how the results can be used to improve the exploitation of the model, to bring benefits to the application and how to evaluate the validity of the given prediction and the associated uncertainties. Importantly, our proposed methodology extends beyond this specific use case, as it can be generalized to other applications beyond PET imaging. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2310.06572v1-abstract-full').style.display = 'none'; document.getElementById('2310.06572v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 October, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2023. </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 Artificial Intelligence</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Engineering Applications of Artificial Intelligence, Volume 131, 2024, 107876 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2112.03006">arXiv:2112.03006</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/2112.03006">pdf</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Robotics">cs.RO</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.32604/cmc.2022.022451">10.32604/cmc.2022.022451 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Takagi-Sugeno Fuzzy Modeling and Control for Effective Robotic Manipulator Motion </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Aldarraji%2C+I">Izzat Aldarraji</a>, <a href="/search/?searchtype=author&amp;query=Kakei%2C+A">Ayad Kakei</a>, <a href="/search/?searchtype=author&amp;query=Ismaeel%2C+A+G">Ayad Ghany Ismaeel</a>, <a href="/search/?searchtype=author&amp;query=Tsaramirsis%2C+G">Georgios Tsaramirsis</a>, <a href="/search/?searchtype=author&amp;query=Khan%2C+F+Q">Fazal Qudus Khan</a>, <a href="/search/?searchtype=author&amp;query=Randhawa%2C+P">Princy Randhawa</a>, <a href="/search/?searchtype=author&amp;query=Alrammal%2C+M">Muath Alrammal</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Sadeeq Jan</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="2112.03006v1-abstract-short" style="display: inline;"> Robotic manipulators are widely used in applications that require fast and precise motion. Such devices, however, are prompt to nonlinear control issues due to the flexibility in joints and the friction in the motors within the dynamics of their rigid part. To address these issues, the Linear Matrix Inequalities (LMIs) and Parallel Distributed Compensation (PDC) approaches are implemented in the T&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2112.03006v1-abstract-full').style.display = 'inline'; document.getElementById('2112.03006v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2112.03006v1-abstract-full" style="display: none;"> Robotic manipulators are widely used in applications that require fast and precise motion. Such devices, however, are prompt to nonlinear control issues due to the flexibility in joints and the friction in the motors within the dynamics of their rigid part. To address these issues, the Linear Matrix Inequalities (LMIs) and Parallel Distributed Compensation (PDC) approaches are implemented in the Takagy-Sugeno Fuzzy Model (T-SFM). We propose the following methodology; initially, the state space equations of the nonlinear manipulator model are derived. Next, a Takagy-Sugeno Fuzzy Model (T-SFM) technique is used for linearizing the state space equations of the nonlinear manipulator. The T-SFM controller is developed using the Parallel Distributed Compensation (PDC) method. The prime concept of the designed controller is to compensate for all the fuzzy rules. Furthermore, the Linear Matrix Inequalities (LMIs) are applied to generate adequate cases to ensure stability and control. Convex programming methods are applied to solve the developed LMIs problems. Simulations developed for the proposed model show that the proposed controller stabilized the system with zero tracking error in less than 1.5 s. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2112.03006v1-abstract-full').style.display = 'none'; document.getElementById('2112.03006v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 November, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 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">3 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2009.13130">arXiv:2009.13130</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/2009.13130">pdf</a>, <a href="https://arxiv.org/ps/2009.13130">ps</a>, <a href="https://arxiv.org/format/2009.13130">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Metric Geometry">math.MG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Combinatorics">math.CO</span> </div> </div> <p class="title is-5 mathjax"> The layer number of grids </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Ambrus%2C+G">Gergely Ambrus</a>, <a href="/search/?searchtype=author&amp;query=Hsu%2C+A">Alexander Hsu</a>, <a href="/search/?searchtype=author&amp;query=Peng%2C+B">Bo Peng</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Shiyu Jan</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.13130v1-abstract-short" style="display: inline;"> The peeling process is defined as follows: starting with a finite point set $X \subset \mathbb{R}^d$, we repeatedly remove the set of vertices of the convex hull of the current set of points. The number of peeling steps needed to completely delete the set $X$ is called the layer number of $X$. In this paper, we study the layer number of the $d$-dimensional integer grid $[n]^d$. We prove that for e&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2009.13130v1-abstract-full').style.display = 'inline'; document.getElementById('2009.13130v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2009.13130v1-abstract-full" style="display: none;"> The peeling process is defined as follows: starting with a finite point set $X \subset \mathbb{R}^d$, we repeatedly remove the set of vertices of the convex hull of the current set of points. The number of peeling steps needed to completely delete the set $X$ is called the layer number of $X$. In this paper, we study the layer number of the $d$-dimensional integer grid $[n]^d$. We prove that for every $d \geq 1$, the layer number of $[n]^d$ is at least $惟\left(n^\frac{2d}{d+1}\right)$. On the other hand, we show that for every $d\geq 3$, it takes at most $O(n^{d - 9/11})$ steps to fully remove $[n]^d$. Our approach is based on an enhancement of the method used by Har-Peled and Lidick媒 for solving the 2-dimensional case. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2009.13130v1-abstract-full').style.display = 'none'; document.getElementById('2009.13130v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 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">7 pages</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> 52C45; 68U05; 52A05 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2004.06809">arXiv:2004.06809</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/2004.06809">pdf</a>, <a href="https://arxiv.org/format/2004.06809">other</a>]&nbsp;</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> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Distributed, Parallel, and Cluster Computing">cs.DC</span> </div> </div> <p class="title is-5 mathjax"> Issues and challenges in Cloud Storage Architecture: A Survey </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Ghani%2C+A">Anwar Ghani</a>, <a href="/search/?searchtype=author&amp;query=Badshah%2C+A">Afzal Badshah</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Saeedullah Jan</a>, <a href="/search/?searchtype=author&amp;query=Alshdadi%2C+A+A">Abdulrahman A. Alshdadi</a>, <a href="/search/?searchtype=author&amp;query=Daud%2C+A">Ali Daud</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="2004.06809v2-abstract-short" style="display: inline;"> From home appliances to industrial enterprises, the Information and Communication Technology (ICT) industry is revolutionizing the world. We are witnessing the emergence of new technologies (e.g, Cloud computing, Fog computing, Internet of Things (IoT), Artificial Intelligence (AI) and Block-chain) which proves the growing use of ICT (e,g. business, education, health, and home appliances), resulti&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2004.06809v2-abstract-full').style.display = 'inline'; document.getElementById('2004.06809v2-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2004.06809v2-abstract-full" style="display: none;"> From home appliances to industrial enterprises, the Information and Communication Technology (ICT) industry is revolutionizing the world. We are witnessing the emergence of new technologies (e.g, Cloud computing, Fog computing, Internet of Things (IoT), Artificial Intelligence (AI) and Block-chain) which proves the growing use of ICT (e,g. business, education, health, and home appliances), resulting in massive data generation. It is expected that more than 175 ZB data will be processed annually by 75 billion devices by 2025. The 5G technology (i.e. mobile communication technology) dramatically increases network speed, enabling users to upload ultra high definition videos in real-time, which will generate a massive stream of big data. Furthermore, smart devices, having artificial intelligence, will act like a human being (e.g, a self-driving vehicle, etc) on the network, will also generate big data. This sudden shift and massive data generation created serious challenges in storing and managing heterogeneous data at such a large scale. This article presents a state-of-the-art review of the issues and challenges involved in storing heterogeneous big data, their countermeasures (i.e, from security and management perspectives), and future opportunities of cloud storage. These challenges are reviewed in detail and new dynamics for researchers in the field of cloud storage are discovered. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2004.06809v2-abstract-full').style.display = 'none'; document.getElementById('2004.06809v2-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 July, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 14 April, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 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">12 pages, 5 figures, The article may appear in a future issue of Researchpedia.info Journal of Computing Surveys</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Researchpedia Journal of Computing, Researchpedia.info, 2020, 1(1): 50-64 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2001.07537">arXiv:2001.07537</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/2001.07537">pdf</a>, <a href="https://arxiv.org/format/2001.07537">other</a>]&nbsp;</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"> AI Trust in business processes: The need for process-aware explanations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Jan%2C+S+T+K">Steve T. K. Jan</a>, <a href="/search/?searchtype=author&amp;query=Ishakian%2C+V">Vatche Ishakian</a>, <a href="/search/?searchtype=author&amp;query=Muthusamy%2C+V">Vinod Muthusamy</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="2001.07537v1-abstract-short" style="display: inline;"> Business processes underpin a large number of enterprise operations including processing loan applications, managing invoices, and insurance claims. There is a large opportunity for infusing AI to reduce cost or provide better customer experience, and the business process management (BPM) literature is rich in machine learning solutions including unsupervised learning to gain insights on clusters&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2001.07537v1-abstract-full').style.display = 'inline'; document.getElementById('2001.07537v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2001.07537v1-abstract-full" style="display: none;"> Business processes underpin a large number of enterprise operations including processing loan applications, managing invoices, and insurance claims. There is a large opportunity for infusing AI to reduce cost or provide better customer experience, and the business process management (BPM) literature is rich in machine learning solutions including unsupervised learning to gain insights on clusters of process traces, classification models to predict the outcomes, duration, or paths of partial process traces, extracting business process from documents, and models to recommend how to optimize a business process or navigate decision points. More recently, deep learning models including those from the NLP domain have been applied to process predictions. Unfortunately, very little of these innovations have been applied and adopted by enterprise companies. We assert that a large reason for the lack of adoption of AI models in BPM is that business users are risk-averse and do not implicitly trust AI models. There has, unfortunately, been little attention paid to explaining model predictions to business users with process context. We challenge the BPM community to build on the AI interpretability literature, and the AI Trust community to understand <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2001.07537v1-abstract-full').style.display = 'none'; document.getElementById('2001.07537v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 January, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1910.04470">arXiv:1910.04470</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1910.04470">pdf</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Atmospheric and Oceanic Physics">physics.ao-ph</span> </div> </div> <p class="title is-5 mathjax"> Deep sea floor observations of typhoon driven enhanced ocean turbulence </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=van+Haren%2C+H">Hans van Haren</a>, <a href="/search/?searchtype=author&amp;query=Chi%2C+W">Wu-Cheng Chi</a>, <a href="/search/?searchtype=author&amp;query=Yang%2C+C">Chu-Fang Yang</a>, <a href="/search/?searchtype=author&amp;query=Yang%2C+Y">Yiing-Jang Yang</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Sen Jan</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.04470v2-abstract-short" style="display: inline;"> The impact of large atmospheric disturbances on deep benthic communities is not well known quantitatively. Observations are scarce but may reveal specific processes leading to turbulent disturbances. Here, we present high-resolution deep-ocean observations to study potential turbulent mixing by large atmospheric disturbances. We deployed an array of 100-Hz sampling-rate geophysical broadband Ocean&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1910.04470v2-abstract-full').style.display = 'inline'; document.getElementById('1910.04470v2-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1910.04470v2-abstract-full" style="display: none;"> The impact of large atmospheric disturbances on deep benthic communities is not well known quantitatively. Observations are scarce but may reveal specific processes leading to turbulent disturbances. Here, we present high-resolution deep-ocean observations to study potential turbulent mixing by large atmospheric disturbances. We deployed an array of 100-Hz sampling-rate geophysical broadband Ocean Bottom Seismometers (OBSs) on the seafloor. Within the footprint of this array we also deployed an oceanographic 1-Hz sampling-rate vertical temperature sensor string covering the water phase between 7 and 207 m above the seafloor at about 3000 m depth off eastern Taiwan between June 2017 and April 2018. All instruments registered Category 4 cyclone Typhoon Talims passage northeast of the array one day ahead of the cyclones closest approach when the cyclones eye was more than 1,000 km away. For 10 days, a group of near-inertial motions appeared most clearly in temperature. The registration reflects the importance of barotropic response to cyclones and the propagation of inertio-gravity waves in weak density stratification. In addition to internal tides, these waves drove turbulent overturns larger than 200 m that were concurrently registered by OBSs. The turbulent signals were neither due to seismic activity nor to ocean-surface wave action. Cyclones can generate not only microseisms and earth hums, as well as turbulence in the water column, producing additional ground motions. Quantified turbulence processes may help constrain models on sediment resuspension and its effect on deep-sea benthic life. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1910.04470v2-abstract-full').style.display = 'none'; document.getElementById('1910.04470v2-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 April, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 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, 11 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Progress in Oceanography, 2020, 184, 102315 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1801.06411">arXiv:1801.06411</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1801.06411">pdf</a>, <a href="https://arxiv.org/format/1801.06411">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Instrumentation and Detectors">physics.ins-det</span> </div> </div> <p class="title is-5 mathjax"> Simulations and Image Reconstruction for the High Resolution CaLIPSO PET Scanner for Brain and Preclinical Studies </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Kochebina%2C+O">Olga Kochebina</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">S茅bastien Jan</a>, <a href="/search/?searchtype=author&amp;query=Stute%2C+S">Simon Stute</a>, <a href="/search/?searchtype=author&amp;query=Sharyy%2C+V">Viatcheslav Sharyy</a>, <a href="/search/?searchtype=author&amp;query=Verrecchia%2C+P">Patrice Verrecchia</a>, <a href="/search/?searchtype=author&amp;query=Mancardi%2C+X">Xavier Mancardi</a>, <a href="/search/?searchtype=author&amp;query=Yvon%2C+D">Dominique Yvon</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="1801.06411v1-abstract-short" style="display: inline;"> The foreseen CaLIPSO Positron Emission Tomography (PET) scanner is expected to yield simultaneously a fine image resolution, about 1 mm$^3$, and a high contrast. In this paper we present results of simulations for the full CaLIPSO PET scanner with a &#34;cube&#34; geometry. We quantify by simulations the expected image resolution and Noise Equivalent Count Rates and compare them to the performance of the&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.06411v1-abstract-full').style.display = 'inline'; document.getElementById('1801.06411v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1801.06411v1-abstract-full" style="display: none;"> The foreseen CaLIPSO Positron Emission Tomography (PET) scanner is expected to yield simultaneously a fine image resolution, about 1 mm$^3$, and a high contrast. In this paper we present results of simulations for the full CaLIPSO PET scanner with a &#34;cube&#34; geometry. We quantify by simulations the expected image resolution and Noise Equivalent Count Rates and compare them to the performance of the most efficient clinically used PET scanner, the High-Resolution Research Tomograph by Siemens. We bring up the issues of the image reconstruction for a scanner with high spatial resolution. We also present simulated brain images for [$^{18}$F]-FDG and [$^{11}$C]-PE2I tracer distributions. Results demonstrate the high potential of the CaLIPSO PET scanner for small animal and brain imaging where combination of high spatial resolution and efficiency is essential. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.06411v1-abstract-full').style.display = 'none'; document.getElementById('1801.06411v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 19 January, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 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">Submitted to IEEE TRPMS journal, 8 pages, 10 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1801.00001">arXiv:1801.00001</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1801.00001">pdf</a>, <a href="https://arxiv.org/format/1801.00001">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Popular Physics">physics.pop-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.1088/1361-6552/aac7b9">10.1088/1361-6552/aac7b9 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Einstein ring: Weighing a star with light </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Pinochet%2C+J">Jorge Pinochet</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+M+V+S">Michael Van Sint Jan</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="1801.00001v1-abstract-short" style="display: inline;"> In 1936, Albert Einstein wrote a brief article where he suggested the possibility that a massive object acted as a lens, amplifying the brightness of a star. As time went by, this phenomenon, known as gravitational lensing, has become a powerful research tool in astrophysics. The simplest and symmetrical expression of a gravitational lens is known as Einstein ring. This model has recently allowed&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.00001v1-abstract-full').style.display = 'inline'; document.getElementById('1801.00001v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1801.00001v1-abstract-full" style="display: none;"> In 1936, Albert Einstein wrote a brief article where he suggested the possibility that a massive object acted as a lens, amplifying the brightness of a star. As time went by, this phenomenon, known as gravitational lensing, has become a powerful research tool in astrophysics. The simplest and symmetrical expression of a gravitational lens is known as Einstein ring. This model has recently allowed the measurement of the mass of a star, the white dwarf Stein 2051 B. The purpose of this work is to show an accessible and uptodate introduction to the effect of gravitational lensing, focused on the Einstein ring and the measurement of the mass of Stein 2051 B. The intended audience of this article are non-graduate students of physics and similar fields of study, and requires only basic knowledge of classical physics, modern physics, algebra and trigonometry. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.00001v1-abstract-full').style.display = 'none'; document.getElementById('1801.00001v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 December, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 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">10 pages, 5 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1706.09795">arXiv:1706.09795</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1706.09795">pdf</a>, <a href="https://arxiv.org/ps/1706.09795">ps</a>, <a href="https://arxiv.org/format/1706.09795">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">stat.ML</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"> Feature uncertainty bounding schemes for large robust nonlinear SVM classifiers </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Couellan%2C+N">Nicolas Couellan</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Sophie Jan</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="1706.09795v1-abstract-short" style="display: inline;"> We consider the binary classification problem when data are large and subject to unknown but bounded uncertainties. We address the problem by formulating the nonlinear support vector machine training problem with robust optimization. To do so, we analyze and propose two bounding schemes for uncertainties associated to random approximate features in low dimensional spaces. The proposed techniques a&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1706.09795v1-abstract-full').style.display = 'inline'; document.getElementById('1706.09795v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1706.09795v1-abstract-full" style="display: none;"> We consider the binary classification problem when data are large and subject to unknown but bounded uncertainties. We address the problem by formulating the nonlinear support vector machine training problem with robust optimization. To do so, we analyze and propose two bounding schemes for uncertainties associated to random approximate features in low dimensional spaces. The proposed techniques are based on Random Fourier Features and the Nystr枚m methods. The resulting formulations can be solved with efficient stochastic approximation techniques such as stochastic (sub)-gradient, stochastic proximal gradient techniques or their variants. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1706.09795v1-abstract-full').style.display = 'none'; document.getElementById('1706.09795v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 June, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2017. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1706.01939">arXiv:1706.01939</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1706.01939">pdf</a>, <a href="https://arxiv.org/format/1706.01939">other</a>]&nbsp;</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"> Empirical Analysis of Password Reuse and Modification across Online Service </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Wang%2C+C">Chun Wang</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S+T+K">Steve T. K. Jan</a>, <a href="/search/?searchtype=author&amp;query=Hu%2C+H">Hang Hu</a>, <a href="/search/?searchtype=author&amp;query=Wang%2C+G">Gang Wang</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="1706.01939v2-abstract-short" style="display: inline;"> Leaked passwords from data breaches can pose a serious threat to users if the password is reused elsewhere. With more online services getting breached today, there is still a lack of large-scale quantitative understanding of the risks of password reuse across services. In this paper, we analyze a large collection of 28.8 million users and their 61.5 million passwords across 107 services. We find t&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1706.01939v2-abstract-full').style.display = 'inline'; document.getElementById('1706.01939v2-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1706.01939v2-abstract-full" style="display: none;"> Leaked passwords from data breaches can pose a serious threat to users if the password is reused elsewhere. With more online services getting breached today, there is still a lack of large-scale quantitative understanding of the risks of password reuse across services. In this paper, we analyze a large collection of 28.8 million users and their 61.5 million passwords across 107 services. We find that 38% of the users have reused exactly the same password across different sites, while 20% have modified an existing password to create new ones. In addition, we find that the password modification patterns are highly consistent across different user demographics, indicating a high predictability. To quantify the risk, we build a new training-based guessing algorithm, and show that more than 16 million password pairs can be cracked within just 10 attempts (30% of the modified passwords and all the reused passwords). <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1706.01939v2-abstract-full').style.display = 'none'; document.getElementById('1706.01939v2-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 June, 2017; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 6 June, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2017. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1703.01333">arXiv:1703.01333</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1703.01333">pdf</a>, <a href="https://arxiv.org/ps/1703.01333">ps</a>, <a href="https://arxiv.org/format/1703.01333">other</a>]&nbsp;</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="Human-Computer Interaction">cs.HC</span> </div> </div> <p class="title is-5 mathjax"> Towards Monetary Incentives in Social Q&amp;A Services </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Jan%2C+S+T+K">Steve T. K. Jan</a>, <a href="/search/?searchtype=author&amp;query=Wang%2C+C">Chun Wang</a>, <a href="/search/?searchtype=author&amp;query=Zhang%2C+Q">Qing Zhang</a>, <a href="/search/?searchtype=author&amp;query=Wang%2C+G">Gang Wang</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="1703.01333v2-abstract-short" style="display: inline;"> Community-based question answering (CQA) services are facing key challenges to motivate domain experts to provide timely answers. Recently, CQA services are exploring new incentive models to engage experts and celebrities by allowing them to set a price on their answers. In this paper, we perform a data-driven analysis on two emerging payment-based CQA systems: Fenda (China) and Whale (US). By ana&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1703.01333v2-abstract-full').style.display = 'inline'; document.getElementById('1703.01333v2-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1703.01333v2-abstract-full" style="display: none;"> Community-based question answering (CQA) services are facing key challenges to motivate domain experts to provide timely answers. Recently, CQA services are exploring new incentive models to engage experts and celebrities by allowing them to set a price on their answers. In this paper, we perform a data-driven analysis on two emerging payment-based CQA systems: Fenda (China) and Whale (US). By analyzing a large dataset of 220K questions (worth 1 million USD collectively), we examine how monetary incentives affect different players in the system. We find that, while monetary incentive enables quick answers from experts, it also drives certain users to aggressively game the system for profits. In addition, in this supplier-driven marketplace, users need to proactively adjust their price to make profits. Famous people are unwilling to lower their price, which in turn hurts their income and engagement over time. Finally, we discuss the key implications to future CQA design. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1703.01333v2-abstract-full').style.display = 'none'; document.getElementById('1703.01333v2-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 27 April, 2017; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 3 March, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2017. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1702.07745">arXiv:1702.07745</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1702.07745">pdf</a>, <a href="https://arxiv.org/format/1702.07745">other</a>]&nbsp;</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="Human-Computer Interaction">cs.HC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Social and Information Networks">cs.SI</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/3132847.3132866">10.1145/3132847.3132866 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Crowdsourcing Cybersecurity: Cyber Attack Detection using Social Media </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Khandpur%2C+R+P">Rupinder Paul Khandpur</a>, <a href="/search/?searchtype=author&amp;query=Ji%2C+T">Taoran Ji</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">Steve Jan</a>, <a href="/search/?searchtype=author&amp;query=Wang%2C+G">Gang Wang</a>, <a href="/search/?searchtype=author&amp;query=Lu%2C+C">Chang-Tien Lu</a>, <a href="/search/?searchtype=author&amp;query=Ramakrishnan%2C+N">Naren Ramakrishnan</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="1702.07745v1-abstract-short" style="display: inline;"> Social media is often viewed as a sensor into various societal events such as disease outbreaks, protests, and elections. We describe the use of social media as a crowdsourced sensor to gain insight into ongoing cyber-attacks. Our approach detects a broad range of cyber-attacks (e.g., distributed denial of service (DDOS) attacks, data breaches, and account hijacking) in an unsupervised manner usin&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.07745v1-abstract-full').style.display = 'inline'; document.getElementById('1702.07745v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1702.07745v1-abstract-full" style="display: none;"> Social media is often viewed as a sensor into various societal events such as disease outbreaks, protests, and elections. We describe the use of social media as a crowdsourced sensor to gain insight into ongoing cyber-attacks. Our approach detects a broad range of cyber-attacks (e.g., distributed denial of service (DDOS) attacks, data breaches, and account hijacking) in an unsupervised manner using just a limited fixed set of seed event triggers. A new query expansion strategy based on convolutional kernels and dependency parses helps model reporting structure and aids in identifying key event characteristics. Through a large-scale analysis over Twitter, we demonstrate that our approach consistently identifies and encodes events, outperforming existing methods. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.07745v1-abstract-full').style.display = 'none'; document.getElementById('1702.07745v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 February, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2017. </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">13 single column pages, 5 figures, submitted to KDD 2017</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> I.2.7; H.3.3 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1610.07899">arXiv:1610.07899</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/1610.07899">pdf</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Other Computer Science">cs.OH</span> </div> </div> <p class="title is-5 mathjax"> A Survey: Embedded Systems Supporting By Different Operating Systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Jabeen%2C+Q">Qamar Jabeen</a>, <a href="/search/?searchtype=author&amp;query=Khan%2C+F">Fazlullah Khan</a>, <a href="/search/?searchtype=author&amp;query=Hayat%2C+M+N">Muhammad Nouman Hayat</a>, <a href="/search/?searchtype=author&amp;query=Khan%2C+H">Haroon Khan</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S+R">Syed Roohullah Jan</a>, <a href="/search/?searchtype=author&amp;query=Ullah%2C+F">Farman Ullah</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="1610.07899v1-abstract-short" style="display: inline;"> In these days embedded system have an important role in different Fields and applications like Network embedded system , Real-time embedded systems which supports the mission-critical domains, mostly having the time constraints, Stand-alone systems which includes the network router etc. A great deployment in the processors made for completing the demanding needs of the users. There is also a large&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1610.07899v1-abstract-full').style.display = 'inline'; document.getElementById('1610.07899v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1610.07899v1-abstract-full" style="display: none;"> In these days embedded system have an important role in different Fields and applications like Network embedded system , Real-time embedded systems which supports the mission-critical domains, mostly having the time constraints, Stand-alone systems which includes the network router etc. A great deployment in the processors made for completing the demanding needs of the users. There is also a large-scale deployment occurs in sensor networks for providing the advance facilities, for handled such type of embedded systems a specific operating system must provide. This paper presents some software infrastructures that have the ability of supporting such types of embedded systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1610.07899v1-abstract-full').style.display = 'none'; document.getElementById('1610.07899v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 May, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2016. </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">15 pages, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2 Issue 2, pp.664-673, March-April 2016</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/0810.2956">arXiv:0810.2956</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/0810.2956">pdf</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-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.1016/j.nima.2008.11.020">10.1016/j.nima.2008.11.020 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> A liquid Xenon Positron Emission Tomograph for small animal imaging : first experimental results of a prototype cell </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Gallin-Martel%2C+M+L">M. L. Gallin-Martel</a>, <a href="/search/?searchtype=author&amp;query=Gallin-Martel%2C+L">L. Gallin-Martel</a>, <a href="/search/?searchtype=author&amp;query=Grondin%2C+Y">Y. Grondin</a>, <a href="/search/?searchtype=author&amp;query=Rossetto%2C+O">O. Rossetto</a>, <a href="/search/?searchtype=author&amp;query=Collot%2C+J">J. Collot</a>, <a href="/search/?searchtype=author&amp;query=Grondin%2C+D">D. Grondin</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">S. Jan</a>, <a href="/search/?searchtype=author&amp;query=Martin%2C+P">Ph. Martin</a>, <a href="/search/?searchtype=author&amp;query=Mayet%2C+F">F. Mayet</a>, <a href="/search/?searchtype=author&amp;query=Petit%2C+P">P. Petit</a>, <a href="/search/?searchtype=author&amp;query=Vezzu%2C+F">F. Vezzu</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="0810.2956v1-abstract-short" style="display: inline;"> A detector using liquid Xenon (LXe) in the scintillation mode is studied for Positron Emission Tomography (PET) of small animals. Its specific design aims at taking full advantage of the Liquid Xenon scintillation properties. This paper reports on energy, time and spatial resolution capabilities of the first LXe prototype module equipped with a Position Sensitive Photo- Multiplier tube (PSPMT) o&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0810.2956v1-abstract-full').style.display = 'inline'; document.getElementById('0810.2956v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="0810.2956v1-abstract-full" style="display: none;"> A detector using liquid Xenon (LXe) in the scintillation mode is studied for Positron Emission Tomography (PET) of small animals. Its specific design aims at taking full advantage of the Liquid Xenon scintillation properties. This paper reports on energy, time and spatial resolution capabilities of the first LXe prototype module equipped with a Position Sensitive Photo- Multiplier tube (PSPMT) operating in the VUV range (178 nm) and at 165 K. The experimental results show that such a LXe PET configuration might be a promising solution insensitive to any parallax effect. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('0810.2956v1-abstract-full').style.display = 'none'; document.getElementById('0810.2956v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 October, 2008; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 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">34 pages, 18 pages, to appear in NIMA</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Nucl.Instrum.Meth.A599:275-283,2009 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/physics/0511065">arXiv:physics/0511065</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/physics/0511065">pdf</a>, <a href="https://arxiv.org/ps/physics/0511065">ps</a>, <a href="https://arxiv.org/format/physics/0511065">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-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.1016/j.nima.2006.01.086">10.1016/j.nima.2006.01.086 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Experimental study of a liquid Xenon PET prototype module </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Gallin-Martel%2C+M+-">M. -L. Gallin-Martel</a>, <a href="/search/?searchtype=author&amp;query=Martin%2C+P">P. Martin</a>, <a href="/search/?searchtype=author&amp;query=Mayet%2C+F">F. Mayet</a>, <a href="/search/?searchtype=author&amp;query=Ballon%2C+J">J. Ballon</a>, <a href="/search/?searchtype=author&amp;query=Barbier%2C+G">G. Barbier</a>, <a href="/search/?searchtype=author&amp;query=Barnoux%2C+C">C. Barnoux</a>, <a href="/search/?searchtype=author&amp;query=Berger%2C+J">J. Berger</a>, <a href="/search/?searchtype=author&amp;query=Bondoux%2C+D">D. Bondoux</a>, <a href="/search/?searchtype=author&amp;query=Bourrion%2C+O">O. Bourrion</a>, <a href="/search/?searchtype=author&amp;query=Collot%2C+J">J. Collot</a>, <a href="/search/?searchtype=author&amp;query=Dzahini%2C+D">D. Dzahini</a>, <a href="/search/?searchtype=author&amp;query=Foglio%2C+R">R. Foglio</a>, <a href="/search/?searchtype=author&amp;query=Gallin-Martel%2C+L">L. Gallin-Martel</a>, <a href="/search/?searchtype=author&amp;query=Garrigue%2C+A">A. Garrigue</a>, <a href="/search/?searchtype=author&amp;query=Jan%2C+S">S. Jan</a>, <a href="/search/?searchtype=author&amp;query=Petit%2C+P">P. Petit</a>, <a href="/search/?searchtype=author&amp;query=Stassi%2C+P">P. Stassi</a>, <a href="/search/?searchtype=author&amp;query=Vezzu%2C+F">F. Vezzu</a>, <a href="/search/?searchtype=author&amp;query=Tournefier%2C+E">E. Tournefier</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="physics/0511065v2-abstract-short" style="display: inline;"> A detector using liquid Xenon in the scintillation mode is studied for Positron Emission Tomography (PET). The specific design aims at taking full advantage of the liquid Xenon properties. It does feature a promising insensitive to any parallax effect. This work reports on the performances of the first LXe prototype module, equipped with a position sensitive PMT operating in the VUV range (178 n&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('physics/0511065v2-abstract-full').style.display = 'inline'; document.getElementById('physics/0511065v2-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="physics/0511065v2-abstract-full" style="display: none;"> A detector using liquid Xenon in the scintillation mode is studied for Positron Emission Tomography (PET). The specific design aims at taking full advantage of the liquid Xenon properties. It does feature a promising insensitive to any parallax effect. This work reports on the performances of the first LXe prototype module, equipped with a position sensitive PMT operating in the VUV range (178 nm). <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('physics/0511065v2-abstract-full').style.display = 'none'; document.getElementById('physics/0511065v2-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 November, 2005; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 7 November, 2005; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2005. </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">Proc. of the 7th International Workshops on Radiation Imaging Detectors (IWORID-7), Grenoble, France 4-7 July 2005</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Nucl.Instrum.Meth.A563:225-228,2006 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/physics/0408109">arXiv:physics/0408109</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/physics/0408109">pdf</a>, <a href="https://arxiv.org/ps/physics/0408109">ps</a>, <a href="https://arxiv.org/format/physics/0408109">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Biological Physics">physics.bio-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.1088/0031-9155/49/19/007">10.1088/0031-9155/49/19/007 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> GATE : a simulation toolkit for PET and SPECT </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Jan%2C+S">S. Jan</a>, <a href="/search/?searchtype=author&amp;query=Santin%2C+G">G. Santin</a>, <a href="/search/?searchtype=author&amp;query=Strul%2C+D">D. Strul</a>, <a href="/search/?searchtype=author&amp;query=Staelens%2C+S">S. Staelens</a>, <a href="/search/?searchtype=author&amp;query=Assie%2C+K">K. Assie</a>, <a href="/search/?searchtype=author&amp;query=Autret%2C+D">D. Autret</a>, <a href="/search/?searchtype=author&amp;query=Avner%2C+S">S. Avner</a>, <a href="/search/?searchtype=author&amp;query=Barbier%2C+R">R. Barbier</a>, <a href="/search/?searchtype=author&amp;query=Bardies%2C+M">M. Bardies</a>, <a href="/search/?searchtype=author&amp;query=Bloomfield%2C+P+M">P. M. Bloomfield</a>, <a href="/search/?searchtype=author&amp;query=Brasse%2C+D">D. Brasse</a>, <a href="/search/?searchtype=author&amp;query=Breton%2C+V">V. Breton</a>, <a href="/search/?searchtype=author&amp;query=Bruyndonckx%2C+P">P. Bruyndonckx</a>, <a href="/search/?searchtype=author&amp;query=Buvat%2C+I">I. Buvat</a>, <a href="/search/?searchtype=author&amp;query=Chatziioannou%2C+A+F">A. F. Chatziioannou</a>, <a href="/search/?searchtype=author&amp;query=Choi%2C+Y">Y. Choi</a>, <a href="/search/?searchtype=author&amp;query=Chung%2C+Y+H">Y. H. Chung</a>, <a href="/search/?searchtype=author&amp;query=Comtat%2C+C">C. Comtat</a>, <a href="/search/?searchtype=author&amp;query=Donnarieix%2C+D">D. Donnarieix</a>, <a href="/search/?searchtype=author&amp;query=Ferrer%2C+L">L. Ferrer</a>, <a href="/search/?searchtype=author&amp;query=Glick%2C+S+J">S. J. Glick</a>, <a href="/search/?searchtype=author&amp;query=Groiselle%2C+C+J">C. J. Groiselle</a>, <a href="/search/?searchtype=author&amp;query=Guez%2C+D">D. Guez</a>, <a href="/search/?searchtype=author&amp;query=Honore%2C+P+-">P. -F. Honore</a>, <a href="/search/?searchtype=author&amp;query=Kerhoas-Cavata%2C+S">S. Kerhoas-Cavata</a> , et al. (28 additional authors not shown) </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="physics/0408109v1-abstract-short" style="display: inline;"> Monte Carlo simulation is an essential tool in emission tomography that can assist in the design of new medical imaging devices, the optimization of acquisition protocols, and the development or assessment of image reconstruction algorithms and correction techniques. GATE, the Geant4 Application for Tomographic Emission, encapsulates the Geant4 libraries to achieve a modular, versatile, scripted&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('physics/0408109v1-abstract-full').style.display = 'inline'; document.getElementById('physics/0408109v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="physics/0408109v1-abstract-full" style="display: none;"> Monte Carlo simulation is an essential tool in emission tomography that can assist in the design of new medical imaging devices, the optimization of acquisition protocols, and the development or assessment of image reconstruction algorithms and correction techniques. GATE, the Geant4 Application for Tomographic Emission, encapsulates the Geant4 libraries to achieve a modular, versatile, scripted simulation toolkit adapted to the field of nuclear medicine. In particular, GATE allows the description of time-dependent phenomena such as source or detector movement, and source decay kinetics. This feature makes it possible to simulate time curves under realistic acquisition conditions and to test dynamic reconstruction algorithms. A public release of GATE licensed under the GNU Lesser General Public License can be downloaded at the address http://www-lphe.epfl.ch/GATE/. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('physics/0408109v1-abstract-full').style.display = 'none'; document.getElementById('physics/0408109v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 August, 2004; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2004. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys.Med.Biol.49:4543-4561,2004 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/physics/0312019">arXiv:physics/0312019</a> <span>&nbsp;[<a href="https://arxiv.org/pdf/physics/0312019">pdf</a>, <a href="https://arxiv.org/ps/physics/0312019">ps</a>, <a href="https://arxiv.org/format/physics/0312019">other</a>]&nbsp;</span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Medical Physics">physics.med-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.1109/TNS.2004.843161">10.1109/TNS.2004.843161 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> GePEToS : A Geant4 Monte Carlo simulation package for Positron Emission Tomography </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&amp;query=Jan%2C+S">S. Jan</a>, <a href="/search/?searchtype=author&amp;query=Collot%2C+J">J. Collot</a>, <a href="/search/?searchtype=author&amp;query=Gallin-Martel%2C+M+-">M. -L. Gallin-Martel</a>, <a href="/search/?searchtype=author&amp;query=Martin%2C+P">P. Martin</a>, <a href="/search/?searchtype=author&amp;query=Mayet%2C+F">F. Mayet</a>, <a href="/search/?searchtype=author&amp;query=Tournefier%2C+E">E. Tournefier</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="physics/0312019v1-abstract-short" style="display: inline;"> GePEToS is a simulation framework developed over the last few years for assessing the instrumental performance of future PET scanners. It is based on Geant4, written in Object-Oriented C++ and runs on Linux platforms. The validity of GePEToS has been tested on the well-known Siemens ECAT EXACT HR+ camera. The results of two application examples are presented : the design optimization of a liquid&hellip; <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('physics/0312019v1-abstract-full').style.display = 'inline'; document.getElementById('physics/0312019v1-abstract-short').style.display = 'none';">&#9661; More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="physics/0312019v1-abstract-full" style="display: none;"> GePEToS is a simulation framework developed over the last few years for assessing the instrumental performance of future PET scanners. It is based on Geant4, written in Object-Oriented C++ and runs on Linux platforms. The validity of GePEToS has been tested on the well-known Siemens ECAT EXACT HR+ camera. The results of two application examples are presented : the design optimization of a liquid Xe micro-PET camera dedicated to small animal imaging as well as the evaluation of the effect of a strong axial magnetic field on the image resolution of a Concorde P4 micro-PET camera. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('physics/0312019v1-abstract-full').style.display = 'none'; document.getElementById('physics/0312019v1-abstract-short').style.display = 'inline';">&#9651; Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 December, 2003; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2003. </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, 12 figures, submitted to IEEE Transactions on Nuclear Science</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Trans.Nucl.Sci. 52 (2005) 102 </p> </li> </ol> <div class="is-hidden-tablet"> <!-- feedback for mobile only --> <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>&nbsp;&nbsp;</span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary"> <!-- MetaColumn 1 --> <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> <!-- end MetaColumn 1 --> <!-- MetaColumn 2 --> <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> <!-- end MetaColumn 2 --> </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

Pages: 1 2 3 4 5 6 7 8 9 10