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–50 of 50 results for author: <span class="mathjax">Connor, M</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="Connor, M"> </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=Connor%2C+M&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="Connor, M"> <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> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Connor%2C+M&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Connor%2C+M&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Connor%2C+M&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> </ul> </nav> <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/2404.02949">arXiv:2404.02949</a> <span> [<a href="https://arxiv.org/pdf/2404.02949">pdf</a>, <a href="https://arxiv.org/format/2404.02949">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> The SaTML '24 CNN Interpretability Competition: New Innovations for Concept-Level Interpretability </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Casper%2C+S">Stephen Casper</a>, <a href="/search/?searchtype=author&query=Yun%2C+J">Jieun Yun</a>, <a href="/search/?searchtype=author&query=Baek%2C+J">Joonhyuk Baek</a>, <a href="/search/?searchtype=author&query=Jung%2C+Y">Yeseong Jung</a>, <a href="/search/?searchtype=author&query=Kim%2C+M">Minhwan Kim</a>, <a href="/search/?searchtype=author&query=Kwon%2C+K">Kiwan Kwon</a>, <a href="/search/?searchtype=author&query=Park%2C+S">Saerom Park</a>, <a href="/search/?searchtype=author&query=Moore%2C+H">Hayden Moore</a>, <a href="/search/?searchtype=author&query=Shriver%2C+D">David Shriver</a>, <a href="/search/?searchtype=author&query=Connor%2C+M">Marissa Connor</a>, <a href="/search/?searchtype=author&query=Grimes%2C+K">Keltin Grimes</a>, <a href="/search/?searchtype=author&query=Nicolson%2C+A">Angus Nicolson</a>, <a href="/search/?searchtype=author&query=Tagade%2C+A">Arush Tagade</a>, <a href="/search/?searchtype=author&query=Rumbelow%2C+J">Jessica Rumbelow</a>, <a href="/search/?searchtype=author&query=Nguyen%2C+H+M">Hieu Minh Nguyen</a>, <a href="/search/?searchtype=author&query=Hadfield-Menell%2C+D">Dylan Hadfield-Menell</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="2404.02949v1-abstract-short" style="display: inline;"> Interpretability techniques are valuable for helping humans understand and oversee AI systems. The SaTML 2024 CNN Interpretability Competition solicited novel methods for studying convolutional neural networks (CNNs) at the ImageNet scale. The objective of the competition was to help human crowd-workers identify trojans in CNNs. This report showcases the methods and results of four featured compet… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.02949v1-abstract-full').style.display = 'inline'; document.getElementById('2404.02949v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2404.02949v1-abstract-full" style="display: none;"> Interpretability techniques are valuable for helping humans understand and oversee AI systems. The SaTML 2024 CNN Interpretability Competition solicited novel methods for studying convolutional neural networks (CNNs) at the ImageNet scale. The objective of the competition was to help human crowd-workers identify trojans in CNNs. This report showcases the methods and results of four featured competition entries. It remains challenging to help humans reliably diagnose trojans via interpretability tools. However, the competition's entries have contributed new techniques and set a new record on the benchmark from Casper et al., 2023. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.02949v1-abstract-full').style.display = 'none'; document.getElementById('2404.02949v1-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> 3 April, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 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">Competition for SaTML 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/2307.04821">arXiv:2307.04821</a> <span> [<a href="https://arxiv.org/pdf/2307.04821">pdf</a>, <a href="https://arxiv.org/format/2307.04821">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computation and Language">cs.CL</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</span> </div> </div> <p class="title is-5 mathjax"> Amplifying Limitations, Harms and Risks of Large Language Models </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=O%27Neill%2C+M">Michael O'Neill</a>, <a href="/search/?searchtype=author&query=Connor%2C+M">Mark Connor</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="2307.04821v1-abstract-short" style="display: inline;"> We present this article as a small gesture in an attempt to counter what appears to be exponentially growing hype around Artificial Intelligence (AI) and its capabilities, and the distraction provided by the associated talk of science-fiction scenarios that might arise if AI should become sentient and super-intelligent. It may also help those outside of the field to become more informed about some… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.04821v1-abstract-full').style.display = 'inline'; document.getElementById('2307.04821v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2307.04821v1-abstract-full" style="display: none;"> We present this article as a small gesture in an attempt to counter what appears to be exponentially growing hype around Artificial Intelligence (AI) and its capabilities, and the distraction provided by the associated talk of science-fiction scenarios that might arise if AI should become sentient and super-intelligent. It may also help those outside of the field to become more informed about some of the limitations of AI technology. In the current context of popular discourse AI defaults to mean foundation and large language models (LLMs) such as those used to create ChatGPT. This in itself is a misrepresentation of the diversity, depth and volume of research, researchers, and technology that truly represents the field of AI. AI being a field of research that has existed in software artefacts since at least the 1950's. We set out to highlight a number of limitations of LLMs, and in so doing highlight that harms have already arisen and will continue to arise due to these limitations. Along the way we also highlight some of the associated risks for individuals and organisations in using this technology. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.04821v1-abstract-full').style.display = 'none'; document.getElementById('2307.04821v1-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 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2023. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2305.03851">arXiv:2305.03851</a> <span> [<a href="https://arxiv.org/pdf/2305.03851">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computation and Language">cs.CL</span> </div> </div> <p class="title is-5 mathjax"> Large Language Models in Sport Science & Medicine: Opportunities, Risks and Considerations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Mark Connor</a>, <a href="/search/?searchtype=author&query=O%27Neill%2C+M">Michael O'Neill</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="2305.03851v1-abstract-short" style="display: inline;"> This paper explores the potential opportunities, risks, and challenges associated with the use of large language models (LLMs) in sports science and medicine. LLMs are large neural networks with transformer style architectures trained on vast amounts of textual data, and typically refined with human feedback. LLMs can perform a large range of natural language processing tasks. In sports science an… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.03851v1-abstract-full').style.display = 'inline'; document.getElementById('2305.03851v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2305.03851v1-abstract-full" style="display: none;"> This paper explores the potential opportunities, risks, and challenges associated with the use of large language models (LLMs) in sports science and medicine. LLMs are large neural networks with transformer style architectures trained on vast amounts of textual data, and typically refined with human feedback. LLMs can perform a large range of natural language processing tasks. In sports science and medicine, LLMs have the potential to support and augment the knowledge of sports medicine practitioners, make recommendations for personalised training programs, and potentially distribute high-quality information to practitioners in developing countries. However, there are also potential risks associated with the use and development of LLMs, including biases in the dataset used to create the model, the risk of exposing confidential data, the risk of generating harmful output, and the need to align these models with human preferences through feedback. Further research is needed to fully understand the potential applications of LLMs in sports science and medicine and to ensure that their use is ethical and beneficial to athletes, clients, patients, practitioners, and the general public. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2305.03851v1-abstract-full').style.display = 'none'; document.getElementById('2305.03851v1-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> 5 May, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 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">4 Pages, 1 Figure</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">ACM Class:</span> I.2.7 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2303.17776">arXiv:2303.17776</a> <span> [<a href="https://arxiv.org/pdf/2303.17776">pdf</a>, <a href="https://arxiv.org/format/2303.17776">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Neurons and Cognition">q-bio.NC</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> <p class="title is-5 mathjax"> Learning Internal Representations of 3D Transformations from 2D Projected Inputs </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Marissa Connor</a>, <a href="/search/?searchtype=author&query=Olshausen%2C+B">Bruno Olshausen</a>, <a href="/search/?searchtype=author&query=Rozell%2C+C">Christopher Rozell</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.17776v1-abstract-short" style="display: inline;"> When interacting in a three dimensional world, humans must estimate 3D structure from visual inputs projected down to two dimensional retinal images. It has been shown that humans use the persistence of object shape over motion-induced transformations as a cue to resolve depth ambiguity when solving this underconstrained problem. With the aim of understanding how biological vision systems may inte… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2303.17776v1-abstract-full').style.display = 'inline'; document.getElementById('2303.17776v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2303.17776v1-abstract-full" style="display: none;"> When interacting in a three dimensional world, humans must estimate 3D structure from visual inputs projected down to two dimensional retinal images. It has been shown that humans use the persistence of object shape over motion-induced transformations as a cue to resolve depth ambiguity when solving this underconstrained problem. With the aim of understanding how biological vision systems may internally represent 3D transformations, we propose a computational model, based on a generative manifold model, which can be used to infer 3D structure from the motion of 2D points. Our model can also learn representations of the transformations with minimal supervision, providing a proof of concept for how humans may develop internal representations on a developmental or evolutionary time scale. Focused on rotational motion, we show how our model infers depth from moving 2D projected points, learns 3D rotational transformations from 2D training stimuli, and compares to human performance on psychophysical structure-from-motion experiments. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2303.17776v1-abstract-full').style.display = 'none'; document.getElementById('2303.17776v1-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 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/2212.02582">arXiv:2212.02582</a> <span> [<a href="https://arxiv.org/pdf/2212.02582">pdf</a>, <a href="https://arxiv.org/format/2212.02582">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</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"> Rethinking Backdoor Data Poisoning Attacks in the Context of Semi-Supervised Learning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Marissa Connor</a>, <a href="/search/?searchtype=author&query=Emanuele%2C+V">Vincent Emanuele</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="2212.02582v1-abstract-short" style="display: inline;"> Semi-supervised learning methods can train high-accuracy machine learning models with a fraction of the labeled training samples required for traditional supervised learning. Such methods do not typically involve close review of the unlabeled training samples, making them tempting targets for data poisoning attacks. In this paper we investigate the vulnerabilities of semi-supervised learning metho… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.02582v1-abstract-full').style.display = 'inline'; document.getElementById('2212.02582v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2212.02582v1-abstract-full" style="display: none;"> Semi-supervised learning methods can train high-accuracy machine learning models with a fraction of the labeled training samples required for traditional supervised learning. Such methods do not typically involve close review of the unlabeled training samples, making them tempting targets for data poisoning attacks. In this paper we investigate the vulnerabilities of semi-supervised learning methods to backdoor data poisoning attacks on the unlabeled samples. We show that simple poisoning attacks that influence the distribution of the poisoned samples' predicted labels are highly effective - achieving an average attack success rate as high as 96.9%. We introduce a generalized attack framework targeting semi-supervised learning methods to better understand and exploit their limitations and to motivate future defense strategies. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.02582v1-abstract-full').style.display = 'none'; document.getElementById('2212.02582v1-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> 5 December, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 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">18 pages, 14 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/2207.03062">arXiv:2207.03062</a> <span> [<a href="https://arxiv.org/pdf/2207.03062">pdf</a>, <a href="https://arxiv.org/format/2207.03062">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Data Structures and Algorithms">cs.DS</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Geometry">cs.CG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Robotics">cs.RO</span> </div> </div> <p class="title is-5 mathjax"> Centralised Connectivity-Preserving Transformations by Rotation: 3 Musketeers for all Orthogonal Convex Shapes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Matthew Connor</a>, <a href="/search/?searchtype=author&query=Michail%2C+O">Othon Michail</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="2207.03062v1-abstract-short" style="display: inline;"> We study a model of programmable matter systems consisting of $n$ devices lying on a 2-dimensional square grid, which are able to perform the minimal mechanical operation of rotating around each other. The goal is to transform an initial shape A into a target shape B. We are interested in characterising the class of shapes which can be transformed into each other in such a scenario, under the addi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.03062v1-abstract-full').style.display = 'inline'; document.getElementById('2207.03062v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2207.03062v1-abstract-full" style="display: none;"> We study a model of programmable matter systems consisting of $n$ devices lying on a 2-dimensional square grid, which are able to perform the minimal mechanical operation of rotating around each other. The goal is to transform an initial shape A into a target shape B. We are interested in characterising the class of shapes which can be transformed into each other in such a scenario, under the additional constraint of maintaining global connectivity at all times. This was one of the main problems left open by $[$Michail et al., JCSS'19$]$. Note that the considered question is about structural feasibility of transformations, which we exclusively deal with via centralised constructive proofs. Distributed solutions are left for future work and form an interesting research direction. Past work made some progress for the special class of nice shapes. We here consider the class of orthogonal convex shapes, where for any two nodes $u, v$ in a horizontal or vertical line on the grid, there is no empty cell between $u$ and $v$. We develop a generic centralised transformation and prove that, for any pair $A$, $B$ of colour-consistent orthogonal convex shapes, it can transform $A$ into $B$. In light of the existence of blocked shapes in the considered class, we use a minimal 3-node seed to trigger the transformation. The running time of our transformation is an optimal $O(n^2)$ sequential moves, where $n=|A|=|B|$. We leave as an open problem the existence of a universal connectivity-preserving transformation with a small seed. Our belief is that the techniques developed in this paper might prove useful to answer this. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.03062v1-abstract-full').style.display = 'none'; document.getElementById('2207.03062v1-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 July, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 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">61 pages, 41 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/2111.13971">arXiv:2111.13971</a> <span> [<a href="https://arxiv.org/pdf/2111.13971">pdf</a>, <a href="https://arxiv.org/ps/2111.13971">ps</a>, <a href="https://arxiv.org/format/2111.13971">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Dynamical Systems">math.DS</span> </div> </div> <p class="title is-5 mathjax"> Hyperbolic Staircases: Periodic Paths on $2g+1$-gons </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M+R">Mei Rose Connor</a>, <a href="/search/?searchtype=author&query=Davis%2C+D">Diana Davis</a>, <a href="/search/?searchtype=author&query=Helms%2C+P">Paige Helms</a>, <a href="/search/?searchtype=author&query=Kielstra%2C+M">Michael Kielstra</a>, <a href="/search/?searchtype=author&query=Leli%C3%A8vre%2C+S">Samuel Leli猫vre</a>, <a href="/search/?searchtype=author&query=Steinberg%2C+Z">Zachary Steinberg</a>, <a href="/search/?searchtype=author&query=Sun%2C+C">Chenyang Sun</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="2111.13971v2-abstract-short" style="display: inline;"> The study of polygonal billiards, particularly those in the regular pentagon, has been the subject of two recent papers. One of these papers approaches the problem of discovering the periodic trajectories on the pentagon by identifying slopes of periodic directions with points in the Poincar茅 disk generated by hyperbolic isometric transformations. The other approach, coming from the other paper, t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2111.13971v2-abstract-full').style.display = 'inline'; document.getElementById('2111.13971v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2111.13971v2-abstract-full" style="display: none;"> The study of polygonal billiards, particularly those in the regular pentagon, has been the subject of two recent papers. One of these papers approaches the problem of discovering the periodic trajectories on the pentagon by identifying slopes of periodic directions with points in the Poincar茅 disk generated by hyperbolic isometric transformations. The other approach, coming from the other paper, transforms the double pentagon into a rectilinear translation surface called the 'golden L', where periodic directions are generated by a set of matrices associated with this surface in a special way. We connect and unify these two approaches, and use our unification of these results to generalize them to arbitrary $2g+1$-sided regular polygons. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2111.13971v2-abstract-full').style.display = 'none'; document.getElementById('2111.13971v2-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 November, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 27 November, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 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">16 pages, 12 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">MSC Class:</span> 37E35 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2108.09250">arXiv:2108.09250</a> <span> [<a href="https://arxiv.org/pdf/2108.09250">pdf</a>, <a href="https://arxiv.org/format/2108.09250">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"> Centralised Connectivity-Preserving Transformations for Programmable Matter: A Minimal Seed Approach </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Matthew Connor</a>, <a href="/search/?searchtype=author&query=Michail%2C+O">Othon Michail</a>, <a href="/search/?searchtype=author&query=Potapov%2C+I">Igor Potapov</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="2108.09250v1-abstract-short" style="display: inline;"> We study a model of programmable matter systems consisting of $n$ devices lying on a 2-dimensional square grid which are able to perform the minimal mechanical operation of rotating around each other. The goal is to transform an initial shape A into a target shape B. We investigate the class of shapes which can be constructed in such a scenario under the additional constraint of maintaining global… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2108.09250v1-abstract-full').style.display = 'inline'; document.getElementById('2108.09250v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2108.09250v1-abstract-full" style="display: none;"> We study a model of programmable matter systems consisting of $n$ devices lying on a 2-dimensional square grid which are able to perform the minimal mechanical operation of rotating around each other. The goal is to transform an initial shape A into a target shape B. We investigate the class of shapes which can be constructed in such a scenario under the additional constraint of maintaining global connectivity at all times. We focus on the scenario of transforming nice shapes, a class of shapes consisting of a central line $L$ where for all nodes $u$ in $S$ either $u \in L$ or $u$ is connected to $L$ by a line of nodes perpendicular to $L$. We prove that by introducing a minimal 3-node seed it is possible for the canonical shape of a line of $n$ nodes to be transformed into a nice shape of $n-1$ nodes. We use this to show that a 4-node seed enables the transformation of nice shapes of size $n$ into any other nice shape of size $n$ in $O(n^2)$ time. We leave as an open problem the expansion of the class of shapes which can be constructed using such a seed to include those derived from nice shapes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2108.09250v1-abstract-full').style.display = 'none'; document.getElementById('2108.09250v1-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, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 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">22 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/2106.12096">arXiv:2106.12096</a> <span> [<a href="https://arxiv.org/pdf/2106.12096">pdf</a>, <a href="https://arxiv.org/format/2106.12096">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</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"> Learning Identity-Preserving Transformations on Data Manifolds </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Marissa Connor</a>, <a href="/search/?searchtype=author&query=Fallah%2C+K">Kion Fallah</a>, <a href="/search/?searchtype=author&query=Rozell%2C+C">Christopher Rozell</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="2106.12096v2-abstract-short" style="display: inline;"> Many machine learning techniques incorporate identity-preserving transformations into their models to generalize their performance to previously unseen data. These transformations are typically selected from a set of functions that are known to maintain the identity of an input when applied (e.g., rotation, translation, flipping, and scaling). However, there are many natural variations that cannot… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.12096v2-abstract-full').style.display = 'inline'; document.getElementById('2106.12096v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2106.12096v2-abstract-full" style="display: none;"> Many machine learning techniques incorporate identity-preserving transformations into their models to generalize their performance to previously unseen data. These transformations are typically selected from a set of functions that are known to maintain the identity of an input when applied (e.g., rotation, translation, flipping, and scaling). However, there are many natural variations that cannot be labeled for supervision or defined through examination of the data. As suggested by the manifold hypothesis, many of these natural variations live on or near a low-dimensional, nonlinear manifold. Several techniques represent manifold variations through a set of learned Lie group operators that define directions of motion on the manifold. However, these approaches are limited because they require transformation labels when training their models and they lack a method for determining which regions of the manifold are appropriate for applying each specific operator. We address these limitations by introducing a learning strategy that does not require transformation labels and developing a method that learns the local regions where each operator is likely to be used while preserving the identity of inputs. Experiments on MNIST and Fashion MNIST highlight our model's ability to learn identity-preserving transformations on multi-class datasets. Additionally, we train on CelebA to showcase our model's ability to learn semantically meaningful transformations on complex datasets in an unsupervised manner. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2106.12096v2-abstract-full').style.display = 'none'; document.getElementById('2106.12096v2-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 March, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 22 June, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 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.13697">arXiv:2104.13697</a> <span> [<a href="https://arxiv.org/pdf/2104.13697">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</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.1142/S0218194018500262">10.1142/S0218194018500262 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Multi-Objective Reconstruction Of Software Architecture </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Schmidt%2C+F">Frederick Schmidt</a>, <a href="/search/?searchtype=author&query=MacDonell%2C+S">Stephen MacDonell</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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.13697v1-abstract-short" style="display: inline;"> Design erosion is a persistent problem within the software engineering discipline. Software designs tend to deteriorate over time and there is a need for tools and techniques that support software architects when dealing with legacy systems. This paper presents an evaluation of a Search Based Software Engineering (SBSE) approach intended to recover high-level architecture designs of software syste… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2104.13697v1-abstract-full').style.display = 'inline'; document.getElementById('2104.13697v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2104.13697v1-abstract-full" style="display: none;"> Design erosion is a persistent problem within the software engineering discipline. Software designs tend to deteriorate over time and there is a need for tools and techniques that support software architects when dealing with legacy systems. This paper presents an evaluation of a Search Based Software Engineering (SBSE) approach intended to recover high-level architecture designs of software systems by structuring low-level artefacts into high-level architecture artefact configurations. In particular , this paper describes the performance evaluation of a number of metaheuristic search algorithms applied to architecture reconstruction problems with high dimensionality in terms of objectives. These problems have been selected as representative of the typical challenges faced by software architects dealing with legacy systems and the results inform the ongoing developed of a software tool that supports the analysis of trade-offs between different reconstructed architectures. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2104.13697v1-abstract-full').style.display = 'none'; document.getElementById('2104.13697v1-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 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">Journal paper, 12 pages, 5 figures, 3 tables</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> International Journal of Software Engineering and Knowledge Engineering 28(6)(2018), pp.869-892 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2012.09287">arXiv:2012.09287</a> <span> [<a href="https://arxiv.org/pdf/2012.09287">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</span> </div> </div> <p class="title is-5 mathjax"> Optimizing the Parameters of A Physical Exercise Dose-Response Model: An Algorithmic Comparison </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Mark Connor</a>, <a href="/search/?searchtype=author&query=O%27Neill%2C+M">Michael O'Neill</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="2012.09287v1-abstract-short" style="display: inline;"> The purpose of this research was to compare the robustness and performance of a local and global optimization algorithm when given the task of fitting the parameters of a common non-linear dose-response model utilized in the field of exercise physiology. Traditionally the parameters of dose-response models have been fit using a non-linear least-squares procedure in combination with local optimizat… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.09287v1-abstract-full').style.display = 'inline'; document.getElementById('2012.09287v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2012.09287v1-abstract-full" style="display: none;"> The purpose of this research was to compare the robustness and performance of a local and global optimization algorithm when given the task of fitting the parameters of a common non-linear dose-response model utilized in the field of exercise physiology. Traditionally the parameters of dose-response models have been fit using a non-linear least-squares procedure in combination with local optimization algorithms. However, these algorithms have demonstrated limitations in their ability to converge on a globally optimal solution. This research purposes the use of an evolutionary computation based algorithm as an alternative method to fit a nonlinear dose-response model. The results of our comparison over 1000 experimental runs demonstrate the superior performance of the evolutionary computation based algorithm to consistently achieve a stronger model fit and holdout performance in comparison to the local search algorithm. This initial research would suggest that global evolutionary computation based optimization algorithms may present a fast and robust alternative to local algorithms when fitting the parameters of non-linear dose-response models. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2012.09287v1-abstract-full').style.display = 'none'; document.getElementById('2012.09287v1-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 December, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2020. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2007.00625">arXiv:2007.00625</a> <span> [<a href="https://arxiv.org/pdf/2007.00625">pdf</a>, <a href="https://arxiv.org/format/2007.00625">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"> On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Matthew Connor</a>, <a href="/search/?searchtype=author&query=Michail%2C+O">Othon Michail</a>, <a href="/search/?searchtype=author&query=Spirakis%2C+P">Paul Spirakis</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="2007.00625v1-abstract-short" style="display: inline;"> We study the class of networks which can be created in polylogarithmic parallel time by network constructors: groups of anonymous agents that interact randomly under a uniform random scheduler with the ability to form connections between each other. Starting from an empty network, the goal is to construct a stable network which belongs to a given family. We prove that the class of trees where each… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2007.00625v1-abstract-full').style.display = 'inline'; document.getElementById('2007.00625v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2007.00625v1-abstract-full" style="display: none;"> We study the class of networks which can be created in polylogarithmic parallel time by network constructors: groups of anonymous agents that interact randomly under a uniform random scheduler with the ability to form connections between each other. Starting from an empty network, the goal is to construct a stable network which belongs to a given family. We prove that the class of trees where each node has any k >= 2 children can be constructed in O(log n) parallel time with high probability. We show that constructing networks which are k-regular is Omega(n) time, but a minimal relaxation to (l, k)-regular networks, where l = k - 1 can be constructed in polylogarithmic parallel time for any fixed k, where k > 2. We further demonstrate that when the finite-state assumption is relaxed and k is allowed to grow with n, then k = log log n acts as a threshold above which network construction is again polynomial time. We use this to provide a partial characterisation of the class of polylogarithmic time network constructors. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2007.00625v1-abstract-full').style.display = 'none'; document.getElementById('2007.00625v1-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> 1 July, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 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">19 Pages 7 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/2006.13913">arXiv:2006.13913</a> <span> [<a href="https://arxiv.org/pdf/2006.13913">pdf</a>, <a href="https://arxiv.org/format/2006.13913">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</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"> Generative causal explanations of black-box classifiers </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=O%27Shaughnessy%2C+M">Matthew O'Shaughnessy</a>, <a href="/search/?searchtype=author&query=Canal%2C+G">Gregory Canal</a>, <a href="/search/?searchtype=author&query=Connor%2C+M">Marissa Connor</a>, <a href="/search/?searchtype=author&query=Davenport%2C+M">Mark Davenport</a>, <a href="/search/?searchtype=author&query=Rozell%2C+C">Christopher Rozell</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="2006.13913v2-abstract-short" style="display: inline;"> We develop a method for generating causal post-hoc explanations of black-box classifiers based on a learned low-dimensional representation of the data. The explanation is causal in the sense that changing learned latent factors produces a change in the classifier output statistics. To construct these explanations, we design a learning framework that leverages a generative model and information-the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.13913v2-abstract-full').style.display = 'inline'; document.getElementById('2006.13913v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2006.13913v2-abstract-full" style="display: none;"> We develop a method for generating causal post-hoc explanations of black-box classifiers based on a learned low-dimensional representation of the data. The explanation is causal in the sense that changing learned latent factors produces a change in the classifier output statistics. To construct these explanations, we design a learning framework that leverages a generative model and information-theoretic measures of causal influence. Our objective function encourages both the generative model to faithfully represent the data distribution and the latent factors to have a large causal influence on the classifier output. Our method learns both global and local explanations, is compatible with any classifier that admits class probabilities and a gradient, and does not require labeled attributes or knowledge of causal structure. Using carefully controlled test cases, we provide intuition that illuminates the function of our objective. We then demonstrate the practical utility of our method on image recognition tasks. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.13913v2-abstract-full').style.display = 'none'; document.getElementById('2006.13913v2-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> 22 October, 2020; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 24 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 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">Camera-ready version to appear at NeurIPS 2020</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2006.10597">arXiv:2006.10597</a> <span> [<a href="https://arxiv.org/pdf/2006.10597">pdf</a>, <a href="https://arxiv.org/format/2006.10597">other</a>] </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"> Variational Autoencoder with Learned Latent Structure </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M+C">Marissa C. Connor</a>, <a href="/search/?searchtype=author&query=Canal%2C+G+H">Gregory H. Canal</a>, <a href="/search/?searchtype=author&query=Rozell%2C+C+J">Christopher J. Rozell</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="2006.10597v2-abstract-short" style="display: inline;"> The manifold hypothesis states that high-dimensional data can be modeled as lying on or near a low-dimensional, nonlinear manifold. Variational Autoencoders (VAEs) approximate this manifold by learning mappings from low-dimensional latent vectors to high-dimensional data while encouraging a global structure in the latent space through the use of a specified prior distribution. When this prior does… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.10597v2-abstract-full').style.display = 'inline'; document.getElementById('2006.10597v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2006.10597v2-abstract-full" style="display: none;"> The manifold hypothesis states that high-dimensional data can be modeled as lying on or near a low-dimensional, nonlinear manifold. Variational Autoencoders (VAEs) approximate this manifold by learning mappings from low-dimensional latent vectors to high-dimensional data while encouraging a global structure in the latent space through the use of a specified prior distribution. When this prior does not match the structure of the true data manifold, it can lead to a less accurate model of the data. To resolve this mismatch, we introduce the Variational Autoencoder with Learned Latent Structure (VAELLS) which incorporates a learnable manifold model into the latent space of a VAE. This enables us to learn the nonlinear manifold structure from the data and use that structure to define a prior in the latent space. The integration of a latent manifold model not only ensures that our prior is well-matched to the data, but also allows us to define generative transformation paths in the latent space and describe class manifolds with transformations stemming from examples of each class. We validate our model on examples with known latent structure and also demonstrate its capabilities on a real-world dataset. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2006.10597v2-abstract-full').style.display = 'none'; document.getElementById('2006.10597v2-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 March, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 18 June, 2020; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 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 24th International Conference on Artificial Intelligence and Statistics (AISTATS 2021)</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.02644">arXiv:1912.02644</a> <span> [<a href="https://arxiv.org/pdf/1912.02644">pdf</a>, <a href="https://arxiv.org/format/1912.02644">other</a>] </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"> Representing Closed Transformation Paths in Encoded Network Latent Space </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M">Marissa Connor</a>, <a href="/search/?searchtype=author&query=Rozell%2C+C">Christopher Rozell</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.02644v1-abstract-short" style="display: inline;"> Deep generative networks have been widely used for learning mappings from a low-dimensional latent space to a high-dimensional data space. In many cases, data transformations are defined by linear paths in this latent space. However, the Euclidean structure of the latent space may be a poor match for the underlying latent structure in the data. In this work, we incorporate a generative manifold mo… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1912.02644v1-abstract-full').style.display = 'inline'; document.getElementById('1912.02644v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1912.02644v1-abstract-full" style="display: none;"> Deep generative networks have been widely used for learning mappings from a low-dimensional latent space to a high-dimensional data space. In many cases, data transformations are defined by linear paths in this latent space. However, the Euclidean structure of the latent space may be a poor match for the underlying latent structure in the data. In this work, we incorporate a generative manifold model into the latent space of an autoencoder in order to learn the low-dimensional manifold structure from the data and adapt the latent space to accommodate this structure. In particular, we focus on applications in which the data has closed transformation paths which extend from a starting point and return to nearly the same point. Through experiments on data with natural closed transformation paths, we show that this model introduces the ability to learn the latent dynamics of complex systems, generate transformation paths, and classify samples that belong on the same transformation path. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1912.02644v1-abstract-full').style.display = 'none'; document.getElementById('1912.02644v1-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> 5 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">Accepted at AAAI 2020</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.02884">arXiv:1801.02884</a> <span> [<a href="https://arxiv.org/pdf/1801.02884">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Chemical Physics">physics.chem-ph</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="Biological Physics">physics.bio-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Physics Education">physics.ed-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.1126/sciadv.aat2731">10.1126/sciadv.aat2731 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Sampling molecular conformations and dynamics in a multi-user virtual reality framework </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+M+O">Michael O Connor</a>, <a href="/search/?searchtype=author&query=Deeks%2C+H+M">Helen M. Deeks</a>, <a href="/search/?searchtype=author&query=Dawn%2C+E">Edward Dawn</a>, <a href="/search/?searchtype=author&query=Metatla%2C+O">Oussama Metatla</a>, <a href="/search/?searchtype=author&query=Roudaut%2C+A">Anne Roudaut</a>, <a href="/search/?searchtype=author&query=Sutton%2C+M">Matthew Sutton</a>, <a href="/search/?searchtype=author&query=Glowacki%2C+B+R">Becca Rose Glowacki</a>, <a href="/search/?searchtype=author&query=Sage%2C+R">Rebecca Sage</a>, <a href="/search/?searchtype=author&query=Tew%2C+P">Philip Tew</a>, <a href="/search/?searchtype=author&query=Wonnacott%2C+M">Mark Wonnacott</a>, <a href="/search/?searchtype=author&query=Bates%2C+P">Phil Bates</a>, <a href="/search/?searchtype=author&query=Mulholland%2C+A+J">Adrian J. Mulholland</a>, <a href="/search/?searchtype=author&query=Glowacki%2C+D+R">David R. Glowacki</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.02884v1-abstract-short" style="display: inline;"> We describe a framework for interactive molecular dynamics in a multiuser virtual reality environment, combining rigorous cloud-mounted physical atomistic simulation with commodity virtual reality hardware, which we have made accessible to readers (see isci.itch.io/nsb-imd). It allows users to visualize and sample, with atomic-level precision, the structures and dynamics of complex molecular struc… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.02884v1-abstract-full').style.display = 'inline'; document.getElementById('1801.02884v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1801.02884v1-abstract-full" style="display: none;"> We describe a framework for interactive molecular dynamics in a multiuser virtual reality environment, combining rigorous cloud-mounted physical atomistic simulation with commodity virtual reality hardware, which we have made accessible to readers (see isci.itch.io/nsb-imd). It allows users to visualize and sample, with atomic-level precision, the structures and dynamics of complex molecular structures 'on the fly', and to interact with other users in the same virtual environment. A series of controlled studies, wherein participants were tasked with a range of molecular manipulation goals (threading methane through a nanotube, changing helical screw-sense, and tying a protein knot), quantitatively demonstrate that users within the interactive VR environment can complete sophisticated molecular modelling tasks more quickly than they can using conventional interfaces, especially for molecular pathways and structural transitions whose conformational choreographies are intrinsically 3d. This framework should accelerate progress in nanoscale molecular engineering areas such as drug development, synthetic biology, and catalyst design. More broadly, our findings highlight VR's potential in scientific domains where 3d dynamics matter, spanning research and education. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1801.02884v1-abstract-full').style.display = 'none'; document.getElementById('1801.02884v1-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> 9 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">5 pages, 3 figures, 19 pages Supporting Info</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Science Advances, Jun 2018: Vol. 4, no. 6, eaat2731 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1606.05927">arXiv:1606.05927</a> <span> [<a href="https://arxiv.org/pdf/1606.05927">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computational Geometry">cs.CG</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Data Structures and Algorithms">cs.DS</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.1080/15578770802494516">10.1080/15578770802494516 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Minimum cost polygon overlay with rectangular shape stock panels </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Siringoringo%2C+W+S">Wilson S. Siringoringo</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Clements%2C+N">Nick Clements</a>, <a href="/search/?searchtype=author&query=Alexander%2C+N">Nick Alexander</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="1606.05927v1-abstract-short" style="display: inline;"> Minimum Cost Polygon Overlay (MCPO) is a unique two-dimensional optimization problem that involves the task of covering a polygon shaped area with a series of rectangular shaped panels. This has a number of applications in the construction industry. This work examines the MCPO problem in order to construct a model that captures essential parameters of the problem to be solved automatically using n… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.05927v1-abstract-full').style.display = 'inline'; document.getElementById('1606.05927v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1606.05927v1-abstract-full" style="display: none;"> Minimum Cost Polygon Overlay (MCPO) is a unique two-dimensional optimization problem that involves the task of covering a polygon shaped area with a series of rectangular shaped panels. This has a number of applications in the construction industry. This work examines the MCPO problem in order to construct a model that captures essential parameters of the problem to be solved automatically using numerical optimization algorithms. Three algorithms have been implemented of the actual optimization task: the greedy search, the Monte Carlo (MC) method, and the Genetic Algorithm (GA). Results are presented to show the relative effectiveness of the algorithms. This is followed by critical analysis of various findings of this research. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.05927v1-abstract-full').style.display = 'none'; document.getElementById('1606.05927v1-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> 19 June, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> International Journal of Construction Education & Research, 4(3), 1-24 (2008) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1606.05926">arXiv:1606.05926</a> <span> [<a href="https://arxiv.org/pdf/1606.05926">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Probabilistic estimation of software project duration </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1606.05926v1-abstract-short" style="display: inline;"> This paper presents a framework for the representation of uncertainty in the estimates for software design projects for use throughout the entire project lifecycle. The framework is flexible in order to accommodate uncertainty in the project and utilises Monte Carlo simulation to compute the propagation of uncertainty in effort estimates towards the total project uncertainty and therefore gives a… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.05926v1-abstract-full').style.display = 'inline'; document.getElementById('1606.05926v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1606.05926v1-abstract-full" style="display: none;"> This paper presents a framework for the representation of uncertainty in the estimates for software design projects for use throughout the entire project lifecycle. The framework is flexible in order to accommodate uncertainty in the project and utilises Monte Carlo simulation to compute the propagation of uncertainty in effort estimates towards the total project uncertainty and therefore gives a project manager the means to make informed decisions throughout the project life. The framework also provides a mechanism for accumulating project knowledge through the use of a historical database, allowing effort estimates to be informed by, or indeed based upon, the outcome of previous projects. Initial results using simulated data are presented and avenues for further work are discussed. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.05926v1-abstract-full').style.display = 'none'; document.getElementById('1606.05926v1-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> 19 June, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> New Zealand Journal of Applied Computing & Information Technology, 11(1), 11-22 (2007) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1606.05924">arXiv:1606.05924</a> <span> [<a href="https://arxiv.org/pdf/1606.05924">pdf</a>] </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> </div> </div> <p class="title is-5 mathjax"> Engineering design optimisation using tabu search </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Clarkson%2C+P+J">P. John Clarkson</a>, <a href="/search/?searchtype=author&query=Shahpar%2C+S">Shahrokh Shahpar</a>, <a href="/search/?searchtype=author&query=Leonard%2C+P">Paul Leonard</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="1606.05924v1-abstract-short" style="display: inline;"> This paper describes an optimisation methodology that has been specifically developed for engineering design problems. The methodology is based on a Tabu search (TS) algorithm that has been shown to find high quality solutions with a relatively low number of objective function evaluations. Whilst the methodology was originally intended for a small range of design problems it has since been success… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.05924v1-abstract-full').style.display = 'inline'; document.getElementById('1606.05924v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1606.05924v1-abstract-full" style="display: none;"> This paper describes an optimisation methodology that has been specifically developed for engineering design problems. The methodology is based on a Tabu search (TS) algorithm that has been shown to find high quality solutions with a relatively low number of objective function evaluations. Whilst the methodology was originally intended for a small range of design problems it has since been successfully applied to problems from different domains with no alteration to the underlying method. This paper describes the method and its application to three different problems. The first is from the field of structural design, the second relates to the design of electromagnetic pole shapes and the third involves the design of turbomachinery blades. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1606.05924v1-abstract-full').style.display = 'none'; document.getElementById('1606.05924v1-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> 19 June, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Proceedings of Design for Excellence: Engineering Design Conference (EDC 2000), 371-378 (2000) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.05782">arXiv:1605.05782</a> <span> [<a href="https://arxiv.org/pdf/1605.05782">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Optimization and Control">math.OC</span> </div> </div> <p class="title is-5 mathjax"> A comparison of semi-deterministic and stochastic search techniques </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Shea%2C+K">Kristina Shea</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="1605.05782v1-abstract-short" style="display: inline;"> This paper presents an investigation of two search techniques, tabu search (TS) and simulated annealing (SA), to assess their relative merits when applied to engineering design optimisation. Design optimisation problems are generally characterised as having multi-modal search spaces and discontinuities making global optimisation techniques beneficial. Both techniques claim to be capable of locatin… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.05782v1-abstract-full').style.display = 'inline'; document.getElementById('1605.05782v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.05782v1-abstract-full" style="display: none;"> This paper presents an investigation of two search techniques, tabu search (TS) and simulated annealing (SA), to assess their relative merits when applied to engineering design optimisation. Design optimisation problems are generally characterised as having multi-modal search spaces and discontinuities making global optimisation techniques beneficial. Both techniques claim to be capable of locating globally optimum solutions on a range of problems but this capability is derived from different underlying philosophies. While tabu search uses a semi-deterministic approach to escape local optima, simulated annealing uses a complete stochastic approach. The performance of each technique is investigated using a structural optimisation problem. These performances are then compared to each other as and to a steepest descent (SD) method. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.05782v1-abstract-full').style.display = 'none'; document.getElementById('1605.05782v1-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> 18 May, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 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">In I.C. Parmee [Ed.] Evolutionary Design & Manufacture (Selected Papers from ACDM'00), pp 287-298. Springer-Verlag: London (2000)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.05097">arXiv:1605.05097</a> <span> [<a href="https://arxiv.org/pdf/1605.05097">pdf</a>] </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> </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.1243/0959651981539541">10.1243/0959651981539541 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> A tabu search method for the optimisation of fluid power circuits </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Tilley%2C+D+G">Derek G. Tilley</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="1605.05097v1-abstract-short" style="display: inline;"> This paper describes the development of an efficient algorithm for the optimization of fluid power circuits. The algorithm is based around the concepts of Tabu search, where different timescale memory cycles are used as a metaheuristic to guide a hill climbing search method out of local optima and locate the globally optimum solution. Results are presented which illustrate the effectiveness of the… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.05097v1-abstract-full').style.display = 'inline'; document.getElementById('1605.05097v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.05097v1-abstract-full" style="display: none;"> This paper describes the development of an efficient algorithm for the optimization of fluid power circuits. The algorithm is based around the concepts of Tabu search, where different timescale memory cycles are used as a metaheuristic to guide a hill climbing search method out of local optima and locate the globally optimum solution. Results are presented which illustrate the effectiveness of the method on mathematical test functions. In addition to these test functions, some results are presented for real problems in hydraulic circuit design by linking the method to the Bathfp dynamic simulation software. In one such example the solutions obtained are compared to those found using simple steady state calculations. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.05097v1-abstract-full').style.display = 'none'; document.getElementById('1605.05097v1-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 May, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering, 212(5), 373 - 381 (1998) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.04684">arXiv:1605.04684</a> <span> [<a href="https://arxiv.org/pdf/1605.04684">pdf</a>] </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> </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/20.877636">10.1109/20.877636 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Pole shape optimization using a Tabu search scheme </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Leonard%2C+P+J">Paul J. Leonard</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1605.04684v1-abstract-short" style="display: inline;"> The pole shape optimization of an electromagnet typical of an MRI type application is investigated. We compare the use of different parameterizations of the pole shape and compare the convergence of the optimizations using a discrete variable step length Tabu Search scheme. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.04684v1-abstract-full" style="display: none;"> The pole shape optimization of an electromagnet typical of an MRI type application is investigated. We compare the use of different parameterizations of the pole shape and compare the convergence of the optimizations using a discrete variable step length Tabu Search scheme. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.04684v1-abstract-full').style.display = 'none'; document.getElementById('1605.04684v1-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 May, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Transactions on Magnetics, 36(4), 1115-1118 (2000) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.03670">arXiv:1605.03670</a> <span> [<a href="https://arxiv.org/pdf/1605.03670">pdf</a>] </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> </div> </div> <p class="title is-5 mathjax"> Optimisation of power transmission systems using a discrete Tabu Search method </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Tilley%2C+D+G">Derek G. Tilley</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="1605.03670v1-abstract-short" style="display: inline;"> This paper presents a brief description of the Tabu Search method and shows how it can be applied to two different power transmission systems. Examples are presented from two transmission systems. In the first example a mechanical transmission system is considered. A four bar mechanism is synthesised in order to produce a desired output motion. The second example is a hydrostatic transmission oper… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.03670v1-abstract-full').style.display = 'inline'; document.getElementById('1605.03670v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.03670v1-abstract-full" style="display: none;"> This paper presents a brief description of the Tabu Search method and shows how it can be applied to two different power transmission systems. Examples are presented from two transmission systems. In the first example a mechanical transmission system is considered. A four bar mechanism is synthesised in order to produce a desired output motion. The second example is a hydrostatic transmission operating under closed loop control in order to maintain a constant operating speed as the loading conditions change. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.03670v1-abstract-full').style.display = 'none'; document.getElementById('1605.03670v1-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, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 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">Optimisation of power transmission systems using a discrete Tabu Search method. Proceedings of Power Transmissions & Motion Control '98, 153-163</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.03667">arXiv:1605.03667</a> <span> [<a href="https://arxiv.org/pdf/1605.03667">pdf</a>] </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> </div> </div> <p class="title is-5 mathjax"> A comparison of two methods applied to the optimisation of fluid power circuits </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Tilley%2C+D+G">Derek G. Tilley</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="1605.03667v1-abstract-short" style="display: inline;"> This paper describes two optimisation methods which can be applied to the parameter selection stage of Fluid Power System design. These two methods used are a Genetic Algorithm (GA) and a Tabu Search method, both of which have been claimed to be truely global methods. GAs are a method inspired by natural selection and Darwinian evolution whilst Tabu Search is an aggressive search metaheuristic whi… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.03667v1-abstract-full').style.display = 'inline'; document.getElementById('1605.03667v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.03667v1-abstract-full" style="display: none;"> This paper describes two optimisation methods which can be applied to the parameter selection stage of Fluid Power System design. These two methods used are a Genetic Algorithm (GA) and a Tabu Search method, both of which have been claimed to be truely global methods. GAs are a method inspired by natural selection and Darwinian evolution whilst Tabu Search is an aggressive search metaheuristic which guides local search methods towards the globally optimum solution. Results are presented for two different circuit optimisation tasks. These results show that each of the two methods have both advantages and disadvantages. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.03667v1-abstract-full').style.display = 'none'; document.getElementById('1605.03667v1-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, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 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">A comparison of two methods applied to the optimisation of fluid power circuits. Proceedings of the 10th Bath International Fluid Power Workshop, 12-27 '97</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.03666">arXiv:1605.03666</a> <span> [<a href="https://arxiv.org/pdf/1605.03666">pdf</a>] </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> </div> </div> <p class="title is-5 mathjax"> Design and control of cross-coupled mechanisms driven by AC brushless servo motors </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1605.03666v1-abstract-short" style="display: inline;"> This paper presents an overview of a design methodology for the optimal synthesis of hybrid mechanisms. Hybrid mechanisms have been defined as multi-degree of freedom systems where the input motions are supplied by different motor types. In this work a five bar mechanism is designed for a given task under the constraint that one input axis rotates with constant velocity whilst the other input can… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.03666v1-abstract-full').style.display = 'inline'; document.getElementById('1605.03666v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.03666v1-abstract-full" style="display: none;"> This paper presents an overview of a design methodology for the optimal synthesis of hybrid mechanisms. Hybrid mechanisms have been defined as multi-degree of freedom systems where the input motions are supplied by different motor types. In this work a five bar mechanism is designed for a given task under the constraint that one input axis rotates with constant velocity whilst the other input can exhibit any motion requirement. A machine of this type is classified as being cross-coupled due to the mechanical linkage between the input axes. Cross-coupling implies that the input motion on one axis effects the position of the other input axis. This can lead to either opposition to, or accentuation of the control system input. Such a system as this is difficult to control due to the compensation for this on each axis leading to further disturbance. Results are presented for a real machine operating in this way and the actual output of the machine is compared to the desired input of the machine. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.03666v1-abstract-full').style.display = 'none'; document.getElementById('1605.03666v1-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, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 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">Design and control of cross-coupled mechanisms driven by AC brushless servo motors. Proceedings of Power Transmissions and Motion Control '98, 165-176</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.03360">arXiv:1605.03360</a> <span> [<a href="https://arxiv.org/pdf/1605.03360">pdf</a>] </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> </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.1080/095448298261534">10.1080/095448298261534 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> The Use of Harmonic Information in the Optimal Synthesis of Mechanisms </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Douglas%2C+S+S">Steve S. Douglas</a>, <a href="/search/?searchtype=author&query=Gilmartin%2C+M+J">Mike J. Gilmartin</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="1605.03360v1-abstract-short" style="display: inline;"> This paper reviews several uses of harmonic information in the synthesis of mechanisms and shows that such information can be put to even greater use in this field. Results are presented for both single and multi-degree of freedom systems which support this claim. In both cases, the inclusion of harmonic information into the objective function aids the search to locate high quality solutions. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.03360v1-abstract-full" style="display: none;"> This paper reviews several uses of harmonic information in the synthesis of mechanisms and shows that such information can be put to even greater use in this field. Results are presented for both single and multi-degree of freedom systems which support this claim. In both cases, the inclusion of harmonic information into the objective function aids the search to locate high quality solutions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.03360v1-abstract-full').style.display = 'none'; document.getElementById('1605.03360v1-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, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Journal of Engineering Design, 9(3), 239-249 (1997) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.01855">arXiv:1605.01855</a> <span> [<a href="https://arxiv.org/pdf/1605.01855">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</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.5121/csit.2014.4230">10.5121/csit.2014.4230 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Resource allocation using metaheuristic search </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Shah%2C+A">Amit Shah</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="1605.01855v1-abstract-short" style="display: inline;"> This research is focused on solving problems in the area of software project management using metaheuristic search algorithms and as such is research in the field of search based software engineering. The main aim of this research is to evaluate the performance of different metaheuristic search techniques in resource allocation and scheduling problems that would be typical of software development… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.01855v1-abstract-full').style.display = 'inline'; document.getElementById('1605.01855v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.01855v1-abstract-full" style="display: none;"> This research is focused on solving problems in the area of software project management using metaheuristic search algorithms and as such is research in the field of search based software engineering. The main aim of this research is to evaluate the performance of different metaheuristic search techniques in resource allocation and scheduling problems that would be typical of software development projects. This paper reports a set of experiments which evaluate the performance of three algorithms, namely simulated annealing, tabu search and genetic algorithms. The experimental results indicate that all of the metaheuristics search techniques can be used to solve problems in resource allocation and scheduling within a software project. Finally, a comparative analysis suggests that overall the genetic algorithm had performed better than simulated annealing and tabu search. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.01855v1-abstract-full').style.display = 'none'; document.getElementById('1605.01855v1-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 May, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 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">Proceedings of the Fourth International Conference on Computer Science & Information Technology 2014</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1605.01853">arXiv:1605.01853</a> <span> [<a href="https://arxiv.org/pdf/1605.01853">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Multiagent Systems">cs.MA</span> </div> </div> <p class="title is-5 mathjax"> A computational intuition pump to examine group creativity: building on the ideas of others </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Sosa%2C+R">Ricardo Sosa</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1605.01853v1-abstract-short" style="display: inline;"> This paper presents a computational approach to modelling group creativity. It presents an analysis of two studies of group creativity selected from different research cultures and identifies a common theme ("idea build-up") that is then used in the formalisation of an agent-based model used to support reasoning about the complex dynamics of building on the ideas of others. </span> <span class="abstract-full has-text-grey-dark mathjax" id="1605.01853v1-abstract-full" style="display: none;"> This paper presents a computational approach to modelling group creativity. It presents an analysis of two studies of group creativity selected from different research cultures and identifies a common theme ("idea build-up") that is then used in the formalisation of an agent-based model used to support reasoning about the complex dynamics of building on the ideas of others. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1605.01853v1-abstract-full').style.display = 'none'; document.getElementById('1605.01853v1-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 May, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Proceedings of the 2015 IASDR Conference: Interplay 2015. Brisbane, 2-5th November 2015 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.08322">arXiv:1604.08322</a> <span> [<a href="https://arxiv.org/pdf/1604.08322">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 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.4108/eai.25-4-2016.151165">10.4108/eai.25-4-2016.151165 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Development of a wearable haptic game interface </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Foottit%2C+J">Jacques Foottit</a>, <a href="/search/?searchtype=author&query=Brown%2C+D">Dave Brown</a>, <a href="/search/?searchtype=author&query=Marks%2C+S">Stefan Marks</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.08322v1-abstract-short" style="display: inline;"> This paper outlines the development and evaluation of a wearable haptic game interface. The device differs from many traditional haptic feedback implementation in that it combines vibrotactile feedback with gesture based input, thus becoming a two way conduit between the user and the virtual environment. The device is intended to challenge what is considered an "interface" and sets out to purposef… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.08322v1-abstract-full').style.display = 'inline'; document.getElementById('1604.08322v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.08322v1-abstract-full" style="display: none;"> This paper outlines the development and evaluation of a wearable haptic game interface. The device differs from many traditional haptic feedback implementation in that it combines vibrotactile feedback with gesture based input, thus becoming a two way conduit between the user and the virtual environment. The device is intended to challenge what is considered an "interface" and sets out to purposefully blur the boundary between man and machine. This allows for a more immersive experience, and a user evaluation shows that the intuitive interface allows the user to become the aircraft that is controlled by the movements of the user's hand. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.08322v1-abstract-full').style.display = 'none'; document.getElementById('1604.08322v1-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 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 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">arXiv admin note: substantial text overlap with arXiv:1604.05479</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> EAI Endorsed Transactions on Creative Technologies, 3(6), e5 (2016) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.06159">arXiv:1604.06159</a> <span> [<a href="https://arxiv.org/pdf/1604.06159">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 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/2677758.2677789">10.1145/2677758.2677789 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Social Play Spaces for Active Community Engagement </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Gavin%2C+J">Jenna Gavin</a>, <a href="/search/?searchtype=author&query=Kenobi%2C+B">Ben Kenobi</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.06159v1-abstract-short" style="display: inline;"> This paper puts forward the perspective that social play spaces are opportunities to utilise both technology and body for the benefit of community culture and engagement. Co-located social gaming coupled with tangible interfaces offer active participant engagement and the development of the local video game scene. This paper includes a descriptive account of Rabble Room Arcade, an experimental soc… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.06159v1-abstract-full').style.display = 'inline'; document.getElementById('1604.06159v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.06159v1-abstract-full" style="display: none;"> This paper puts forward the perspective that social play spaces are opportunities to utilise both technology and body for the benefit of community culture and engagement. Co-located social gaming coupled with tangible interfaces offer active participant engagement and the development of the local video game scene. This paper includes a descriptive account of Rabble Room Arcade, an experimental social event combining custom-built physical interface devices and multiplayer video games. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.06159v1-abstract-full').style.display = 'none'; document.getElementById('1604.06159v1-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 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 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">arXiv admin note: substantial text overlap with arXiv:1604.05793</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.06158">arXiv:1604.06158</a> <span> [<a href="https://arxiv.org/pdf/1604.06158">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 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/2677758.2677790">10.1145/2677758.2677790 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Augmented Body: Changing Interactive Body Play </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Martin%2C+M">Matthew Martin</a>, <a href="/search/?searchtype=author&query=Charlton%2C+J">James Charlton</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.06158v1-abstract-short" style="display: inline;"> This paper investigates the player's body as a system capable of unfamiliar interactive movement achieved through digital mediation in a playful environment. Body interactions in both digital and non-digital environments can be considered as a perceptually manipulative exploration of self. This implies a player may alter how they perceive their body and its operations in order to create a new play… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.06158v1-abstract-full').style.display = 'inline'; document.getElementById('1604.06158v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.06158v1-abstract-full" style="display: none;"> This paper investigates the player's body as a system capable of unfamiliar interactive movement achieved through digital mediation in a playful environment. Body interactions in both digital and non-digital environments can be considered as a perceptually manipulative exploration of self. This implies a player may alter how they perceive their body and its operations in order to create a new playful and original experience. This paper therefore questions how player interaction can change as their perception of their body changes using augmentative technology. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.06158v1-abstract-full').style.display = 'none'; document.getElementById('1604.06158v1-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 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.06157">arXiv:1604.06157</a> <span> [<a href="https://arxiv.org/pdf/1604.06157">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 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/2677758.2677774">10.1145/2677758.2677774 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> An Intuitive Tangible Game Controller </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Foottit%2C+J">Jacques Foottit</a>, <a href="/search/?searchtype=author&query=Brown%2C+D">Dave Brown</a>, <a href="/search/?searchtype=author&query=Marks%2C+S">Stefan Marks</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.06157v1-abstract-short" style="display: inline;"> This paper outlines the development of a sensory feedback device providing a tangible interface for controlling digital environments, in this example a flight simulator, where the intention for the device is that it is relatively low cost, versatile and intuitive. Gesture based input allows for a more immersive experience, so rather than making the user feel like they are controlling an aircraft t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.06157v1-abstract-full').style.display = 'inline'; document.getElementById('1604.06157v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.06157v1-abstract-full" style="display: none;"> This paper outlines the development of a sensory feedback device providing a tangible interface for controlling digital environments, in this example a flight simulator, where the intention for the device is that it is relatively low cost, versatile and intuitive. Gesture based input allows for a more immersive experience, so rather than making the user feel like they are controlling an aircraft the intuitive interface allows the user to become the aircraft that is controlled by the movements of the user's hand. The movements are designed to allow a sense of immersion that would be difficult to achieve with an alternative interface. A vibrotactile based haptic feedback is incorporated in the device to further enhance the connection between the user and the game environment by providing immediate confirmation of game events. When used for navigating an aircraft simulator, this device invites playful action and thrill. It bridges new territory on portable, low cost solutions for haptic devices in gaming contexts. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.06157v1-abstract-full').style.display = 'none'; document.getElementById('1604.06157v1-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 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 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">in Proceedings of the 2014 Conference on Interactive Entertainment</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05799">arXiv:1604.05799</a> <span> [<a href="https://arxiv.org/pdf/1604.05799">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Multimedia">cs.MM</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</span> </div> </div> <p class="title is-5 mathjax"> Mainstreaming video annotation software for critical video analysis </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Martin%2C+M">Matthew Martin</a>, <a href="/search/?searchtype=author&query=Charlton%2C+J">James Charlton</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.05799v1-abstract-short" style="display: inline;"> The range of video annotation software currently available is set within commercially specialized professions, distributed via outdated sources or through online video hosting services. As video content becomes an increasingly significant tool for analysis, there is a demand for appropriate digital annotation techniques that offer equivalent functionality to tools used for annotation of text based… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05799v1-abstract-full').style.display = 'inline'; document.getElementById('1604.05799v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05799v1-abstract-full" style="display: none;"> The range of video annotation software currently available is set within commercially specialized professions, distributed via outdated sources or through online video hosting services. As video content becomes an increasingly significant tool for analysis, there is a demand for appropriate digital annotation techniques that offer equivalent functionality to tools used for annotation of text based literature sources. This paper argues for the importance of video annotating as an effective method for research that is as accessible as literature annotation is. Video annotation has been shown to trigger higher learning and engagement but research struggles to explain the absence of video annotation in contemporary structures of education practice. In both academic and informal settings the use of video playback as a meaningful tool of analysis is apparent, yet the availability of supplementary annotation software is not within obvious grasp or even prevalent in standardized computer software. Practical software tools produced by the researcher have demonstrated effective video annotation in a short development time. With software design programs available for rapid application creation, this paper also highlights the absence of a development community. This paper argues that video annotation is an accessible tool, not just for academic contexts, but also for wider practical video analysis applications, potentially becoming a mainstream learning tool. This paper thus presents a practical multimodal public approach to video research that potentially affords a deeper analysis of media content. This is supported by an in-depth consideration of the motivation for undertaking video annotation and a critical analysis of currently available tools. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05799v1-abstract-full').style.display = 'none'; document.getElementById('1604.05799v1-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> 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Journal of Technologies and Human Usability, 11(3), 1-13 (2015) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05797">arXiv:1604.05797</a> <span> [<a href="https://arxiv.org/pdf/1604.05797">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 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/2683405.2683424">10.1145/2683405.2683424 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Towards the Holodeck: Fully Immersive Virtual Reality Visualisation of Scientific and Engineering Data </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Marks%2C+S">Stefan Marks</a>, <a href="/search/?searchtype=author&query=Estevez%2C+J+E">Javier E. Estevez</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.05797v1-abstract-short" style="display: inline;"> In this paper, we describe the development and operating principles of an immersive virtual reality (VR) visualisation environment that is designed around the use of consumer VR headsets in an existing wide area motion capture suite. We present two case studies in the application areas of visualisation of scientific and engineering data. Each of these case studies utilise a different render engine… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05797v1-abstract-full').style.display = 'inline'; document.getElementById('1604.05797v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05797v1-abstract-full" style="display: none;"> In this paper, we describe the development and operating principles of an immersive virtual reality (VR) visualisation environment that is designed around the use of consumer VR headsets in an existing wide area motion capture suite. We present two case studies in the application areas of visualisation of scientific and engineering data. Each of these case studies utilise a different render engine, namely a custom engine for one case and a commercial game engine for the other. The advantages and appropriateness of each approach are discussed along with suggestions for future work. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05797v1-abstract-full').style.display = 'none'; document.getElementById('1604.05797v1-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> 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05793">arXiv:1604.05793</a> <span> [<a href="https://arxiv.org/pdf/1604.05793">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 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.4108/eai.20-10-2015.150098">10.4108/eai.20-10-2015.150098 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Reinventing the Arcade: Computer Game Mediated Play Spaces for Physical Interaction </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Gavin%2C+J">Jenna Gavin</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.05793v1-abstract-short" style="display: inline;"> This paper suggests that recent developments in video game technology have occurred in parallel to play being moved from public into private spaces, which has had impact on the way people interact with games. The paper also argues and that there is potentially value in the creation of public play spaces to create opportunities to utilise both technology and body for the benefit of community cultur… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05793v1-abstract-full').style.display = 'inline'; document.getElementById('1604.05793v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05793v1-abstract-full" style="display: none;"> This paper suggests that recent developments in video game technology have occurred in parallel to play being moved from public into private spaces, which has had impact on the way people interact with games. The paper also argues and that there is potentially value in the creation of public play spaces to create opportunities to utilise both technology and body for the benefit of community culture and experiences through gaming. Co-located social gaming coupled with tangible interfaces offer alternative possibilities for the local video game scene. This paper includes a descriptive account of Rabble Room Arcade, an experimental social event combining custom-built tangible interface devices and multiplayer video games. The event was designed around games that promoted a return to simplicity through the use of unique tangible controllers to allow casual gamers to connect to the game and to each other, whilst also transforming the event into a spectacle. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05793v1-abstract-full').style.display = 'none'; document.getElementById('1604.05793v1-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> 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> EAI Endorsed Transactions on Creative Technologies 2(5) Paper e4 (2015) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05792">arXiv:1604.05792</a> <span> [<a href="https://arxiv.org/pdf/1604.05792">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</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.4108/eai.20-10-2015.150099">10.4108/eai.20-10-2015.150099 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Multi-agent evolutionary systems for the generation of complex virtual worlds </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Kruse%2C+J">Jan Kruse</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.05792v1-abstract-short" style="display: inline;"> Modern films, games and virtual reality applications are dependent on convincing computer graphics. Highly complex models are a requirement for the successful delivery of many scenes and environments. While workflows such as rendering, compositing and animation have been streamlined to accommodate increasing demands, modelling complex models is still a laborious task. This paper introduces the com… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05792v1-abstract-full').style.display = 'inline'; document.getElementById('1604.05792v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05792v1-abstract-full" style="display: none;"> Modern films, games and virtual reality applications are dependent on convincing computer graphics. Highly complex models are a requirement for the successful delivery of many scenes and environments. While workflows such as rendering, compositing and animation have been streamlined to accommodate increasing demands, modelling complex models is still a laborious task. This paper introduces the computational benefits of an Interactive Genetic Algorithm (IGA) to computer graphics modelling while compensating the effects of user fatigue, a common issue with Interactive Evolutionary Computation. An intelligent agent is used in conjunction with an IGA that offers the potential to reduce the effects of user fatigue by learning from the choices made by the human designer and directing the search accordingly. This workflow accelerates the layout and distribution of basic elements to form complex models. It captures the designer's intent through interaction, and encourages playful discovery. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05792v1-abstract-full').style.display = 'none'; document.getElementById('1604.05792v1-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> 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> EAI Endorsed Transactions on Creative Technologies 2(5) Paper e5 (2015) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05791">arXiv:1604.05791</a> <span> [<a href="https://arxiv.org/pdf/1604.05791">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="Human-Computer Interaction">cs.HC</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Neural and Evolutionary Computing">cs.NE</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/2843043.2843479">10.1145/2843043.2843479 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Procedural urban environments for FPS games </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Kruse%2C+J">Jan Kruse</a>, <a href="/search/?searchtype=author&query=Sosa%2C+R">Ricardo Sosa</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.05791v1-abstract-short" style="display: inline;"> This paper presents a novel approach to procedural generation of urban maps for First Person Shooter (FPS) games. A multi-agent evolutionary system is employed to place streets, buildings and other items inside the Unity3D game engine, resulting in playable video game levels. A computational agent is trained using machine learning techniques to capture the intent of the game designer as part of th… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05791v1-abstract-full').style.display = 'inline'; document.getElementById('1604.05791v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05791v1-abstract-full" style="display: none;"> This paper presents a novel approach to procedural generation of urban maps for First Person Shooter (FPS) games. A multi-agent evolutionary system is employed to place streets, buildings and other items inside the Unity3D game engine, resulting in playable video game levels. A computational agent is trained using machine learning techniques to capture the intent of the game designer as part of the multi-agent system, and to enable a semi-automated aesthetic selection for the underlying genetic algorithm. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05791v1-abstract-full').style.display = 'none'; document.getElementById('1604.05791v1-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> 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05503">arXiv:1604.05503</a> <span> [<a href="https://arxiv.org/pdf/1604.05503">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</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.infsof.2013.09.001">10.1016/j.infsof.2013.09.001 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Data stream mining for predicting software build outcomes using source code metrics </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Finlay%2C+J">Jacqui Finlay</a>, <a href="/search/?searchtype=author&query=Pears%2C+R">Russel Pears</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.05503v1-abstract-short" style="display: inline;"> Software development projects involve the use of a wide range of tools to produce a software artifact. Software repositories such as source control systems have become a focus for emergent research because they are a source of rich information regarding software development projects. The mining of such repositories is becoming increasingly common with a view to gaining a deeper understanding of th… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05503v1-abstract-full').style.display = 'inline'; document.getElementById('1604.05503v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05503v1-abstract-full" style="display: none;"> Software development projects involve the use of a wide range of tools to produce a software artifact. Software repositories such as source control systems have become a focus for emergent research because they are a source of rich information regarding software development projects. The mining of such repositories is becoming increasingly common with a view to gaining a deeper understanding of the development process. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05503v1-abstract-full').style.display = 'none'; document.getElementById('1604.05503v1-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> 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Information & Software Technology, 56(2), 183-198 (2014) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1604.05479">arXiv:1604.05479</a> <span> [<a href="https://arxiv.org/pdf/1604.05479">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 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.5121/ijgtt.2016.2101">10.5121/ijgtt.2016.2101 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> A wearable haptic game controller </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Foottit%2C+J">Jacques Foottit</a>, <a href="/search/?searchtype=author&query=Brown%2C+D">Dave Brown</a>, <a href="/search/?searchtype=author&query=Marks%2C+S">Stefan Marks</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1604.05479v1-abstract-short" style="display: inline;"> This paper outlines the development of a wearable game controller incorporating vibrotacticle haptic feedback that provides a low cost, versatile and intuitive interface for controlling digital games. The device differs from many traditional haptic feedback implementation in that it combines vibrotactile based haptic feedback with gesture based input, thus becoming a two way conduit between the us… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05479v1-abstract-full').style.display = 'inline'; document.getElementById('1604.05479v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1604.05479v1-abstract-full" style="display: none;"> This paper outlines the development of a wearable game controller incorporating vibrotacticle haptic feedback that provides a low cost, versatile and intuitive interface for controlling digital games. The device differs from many traditional haptic feedback implementation in that it combines vibrotactile based haptic feedback with gesture based input, thus becoming a two way conduit between the user and the virtual environment. The device is intended to challenge what is considered an "interface" and draws on work in the area of Actor-Network theory to purposefully blur the boundary between man and machine. This allows for a more immersive experience, so rather than making the user feel like they are controlling an aircraft the intuitive interface allows the user to become the aircraft that is controlled by the movements of the user's hand. This device invites playful action and thrill. It bridges new territory on portable and low cost solutions for haptic controllers in a gaming context. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1604.05479v1-abstract-full').style.display = 'none'; document.getElementById('1604.05479v1-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> 19 April, 2016; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2016. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> International Journal of Game Theory & Technology, 2(1), 1-19 (2016) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1410.7851">arXiv:1410.7851</a> <span> [<a href="https://arxiv.org/pdf/1410.7851">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computational Engineering, Finance, and Science">cs.CE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Artificial Intelligence">cs.AI</span> </div> </div> <p class="title is-5 mathjax"> Efficient optimisation of structures using tabu search </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Seffen%2C+K+A">Keith A. Seffen</a>, <a href="/search/?searchtype=author&query=Parks%2C+G+T">Geoffrey T. Parks</a>, <a href="/search/?searchtype=author&query=Clarkson%2C+P+J">P. John Clarkson</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="1410.7851v1-abstract-short" style="display: inline;"> This paper presents a novel approach to the optimisation of structures using a Tabu search (TS) method. TS is a metaheuristic which is used to guide local search methods towards a globally optimal solution by using flexible memory cycles of differing time spans. Results are presented for the well established ten bar truss problem and compared to results published in the literature. In the first ex… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.7851v1-abstract-full').style.display = 'inline'; document.getElementById('1410.7851v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1410.7851v1-abstract-full" style="display: none;"> This paper presents a novel approach to the optimisation of structures using a Tabu search (TS) method. TS is a metaheuristic which is used to guide local search methods towards a globally optimal solution by using flexible memory cycles of differing time spans. Results are presented for the well established ten bar truss problem and compared to results published in the literature. In the first example a truss is optimised to minimise mass and the results compared to results obtained using an alternative TS implementation. In the second example, the problem has multiple objectives that are compounded into a single objective function value using game theory. In general the results demonstrate that the TS method is capable of solving structural optimisation problems at least as efficiently as other numerical optimisation approaches. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.7851v1-abstract-full').style.display = 'none'; document.getElementById('1410.7851v1-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, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Connor, A.M., Seffen, K.A., Clarkson, P.J. & Parks, G.T. (1999) "Efficient optimisation of structures using tabu search" Proceedings of the 1st ASMO/ISSMO Conference on Engineering Design Optimization, 127-134 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1410.7849">arXiv:1410.7849</a> <span> [<a href="https://arxiv.org/pdf/1410.7849">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 mutli-thread tabu search algorithm </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">A. M. Connor</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="1410.7849v1-abstract-short" style="display: inline;"> This paper describes a novel refinement to a Tabu search algorithm that has been implemented in an attempt to improve the robustness of the search when applied to particularly complex problems. In this approach, two Tabu searches are carried out in parallel. Each search thread is characterised by it's own short term memory which forces that point out of local optima. However, the two search thread… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.7849v1-abstract-full').style.display = 'inline'; document.getElementById('1410.7849v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1410.7849v1-abstract-full" style="display: none;"> This paper describes a novel refinement to a Tabu search algorithm that has been implemented in an attempt to improve the robustness of the search when applied to particularly complex problems. In this approach, two Tabu searches are carried out in parallel. Each search thread is characterised by it's own short term memory which forces that point out of local optima. However, the two search threads share an intermediate term memory so allowing a degree of information to be passed between them. Results are presented for both unconstrained and constrained numerical functions as well as a problem in the field of hydraulic circuit optimization. Simulation of hydraulic circuit performance is achieved by linking the optimization algorithm to the commercial simulation package Bathfp. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1410.7849v1-abstract-full').style.display = 'none'; document.getElementById('1410.7849v1-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, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Design Optimization: International Journal of Product and Process Improvement, 1(3), 293-304, 1999 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.6104">arXiv:1407.6104</a> <span> [<a href="https://arxiv.org/pdf/1407.6104">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Mining developer communication data streams </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Finlay%2C+J">Jacqui Finlay</a>, <a href="/search/?searchtype=author&query=Pears%2C+R">Russel Pears</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="1407.6104v1-abstract-short" style="display: inline;"> This paper explores the concepts of modelling a software development project as a process that results in the creation of a continuous stream of data. In terms of the Jazz repository used in this research, one aspect of that stream of data would be developer communication. Such data can be used to create an evolving social network characterized by a range of metrics. This paper presents the applic… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6104v1-abstract-full').style.display = 'inline'; document.getElementById('1407.6104v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.6104v1-abstract-full" style="display: none;"> This paper explores the concepts of modelling a software development project as a process that results in the creation of a continuous stream of data. In terms of the Jazz repository used in this research, one aspect of that stream of data would be developer communication. Such data can be used to create an evolving social network characterized by a range of metrics. This paper presents the application of data stream mining techniques to identify the most useful metrics for predicting build outcomes. Results are presented from applying the Hoeffding Tree classification method used in conjunction with the Adaptive Sliding Window (ADWIN) method for detecting concept drift. The results indicate that only a small number of the available metrics considered have any significance for predicting the outcome of a build. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6104v1-abstract-full').style.display = 'none'; document.getElementById('1407.6104v1-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> 22 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Proceedings of the Fourth International Conference on Computer Science and Information Technology (CCSIT 2014) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.6103">arXiv:1407.6103</a> <span> [<a href="https://arxiv.org/pdf/1407.6103">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> An automatic architecture reconstruction and refactoring framework </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Schmidt%2C+F">Frederik Schmidt</a>, <a href="/search/?searchtype=author&query=MacDonell%2C+S+G">Stephen G. MacDonell</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1407.6103v1-abstract-short" style="display: inline;"> A variety of sources have noted that a substantial proportion of non trivial software systems fail due to unhindered architectural erosion. This design deterioration leads to low maintainability, poor testability and reduced development speed. The erosion of software systems is often caused by inadequate understanding, documentation and maintenance of the desired implementation architecture. If th… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6103v1-abstract-full').style.display = 'inline'; document.getElementById('1407.6103v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.6103v1-abstract-full" style="display: none;"> A variety of sources have noted that a substantial proportion of non trivial software systems fail due to unhindered architectural erosion. This design deterioration leads to low maintainability, poor testability and reduced development speed. The erosion of software systems is often caused by inadequate understanding, documentation and maintenance of the desired implementation architecture. If the desired architecture is lost or the deterioration is advanced, the reconstruction of the desired architecture and the realignment of this desired architecture with the physical architecture both require substantial manual analysis and implementation effort. This paper describes the initial development of a framework for automatic software architecture reconstruction and source code migration. This framework offers the potential to reconstruct the conceptual architecture of software systems and to automatically migrate the physical architecture of a software system toward a conceptual architecture model. The approach is implemented within a proof of concept prototype which is able to analyze java system and reconstruct a conceptual architecture for these systems as well as to refactor the system towards a conceptual architecture. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6103v1-abstract-full').style.display = 'none'; document.getElementById('1407.6103v1-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> 22 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Software Engineering Research,Management and Applications 2011, Springer Berlin / Heidelberg. 377: 95-111 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.6102">arXiv:1407.6102</a> <span> [<a href="https://arxiv.org/pdf/1407.6102">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Requirements engineering current practice and capability in small and medium software development enterprises in New Zealand </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Talbot%2C+A">Alison Talbot</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1407.6102v1-abstract-short" style="display: inline;"> This paper presents research on current industry practices with respect to requirements engineering as implemented within software development companies in New Zealand. A survey instrument is designed and deployed. The results are analysed and compared against what is internationally considered "best practice" and previous New Zealand and Australian studies. An attempt is made to assess the requir… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6102v1-abstract-full').style.display = 'inline'; document.getElementById('1407.6102v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.6102v1-abstract-full" style="display: none;"> This paper presents research on current industry practices with respect to requirements engineering as implemented within software development companies in New Zealand. A survey instrument is designed and deployed. The results are analysed and compared against what is internationally considered "best practice" and previous New Zealand and Australian studies. An attempt is made to assess the requirements engineering capability of New Zealand companies using both formal and informal frameworks. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6102v1-abstract-full').style.display = 'none'; document.getElementById('1407.6102v1-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> 22 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </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">Proceedings of the 9th ACIS Conference on Software Engineering Research, Management & Applications (SERA 2011)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.6101">arXiv:1407.6101</a> <span> [<a href="https://arxiv.org/pdf/1407.6101">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> </div> </div> <p class="title is-5 mathjax"> Improving web search using contextual retrieval </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Limbu%2C+D+K">Dilip K. Limbu</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Pears%2C+R">Russel Pears</a>, <a href="/search/?searchtype=author&query=MacDonell%2C+S+G">Stephen G. MacDonell</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="1407.6101v1-abstract-short" style="display: inline;"> Contextual retrieval is a critical technique for today's search engines in terms of facilitating queries and returning relevant information. This paper reports on the development and evaluation of a system designed to tackle some of the challenges associated with contextual information retrieval from the World Wide Web (WWW). The developed system has been designed with a view to capturing both imp… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6101v1-abstract-full').style.display = 'inline'; document.getElementById('1407.6101v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.6101v1-abstract-full" style="display: none;"> Contextual retrieval is a critical technique for today's search engines in terms of facilitating queries and returning relevant information. This paper reports on the development and evaluation of a system designed to tackle some of the challenges associated with contextual information retrieval from the World Wide Web (WWW). The developed system has been designed with a view to capturing both implicit and explicit user data which is used to develop a personal contextual profile. Such profiles can be shared across multiple users to create a shared contextual knowledge base. These are used to refine search queries and improve both the search results for a user as well as their search experience. An empirical study has been undertaken to evaluate the system against a number of hypotheses. In this paper, results related to one are presented that support the claim that users can find information more readily using the contextual search system. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6101v1-abstract-full').style.display = 'none'; document.getElementById('1407.6101v1-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> 22 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Proceedings of the 6th International Conference on Information Technology: New Generations (ITNG 2009) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.6100">arXiv:1407.6100</a> <span> [<a href="https://arxiv.org/pdf/1407.6100">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Information Retrieval">cs.IR</span> </div> </div> <p class="title is-5 mathjax"> A framework for contextual information retrieval from the WWW </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Limbu%2C+D+K">Dilip K. Limbu</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=MacDonell%2C+S+G">Stephen G. MacDonell</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="1407.6100v1-abstract-short" style="display: inline;"> Search engines are the most commonly used type of tool for finding relevant information on the Internet. However, today's search engines are far from perfect. Typical search queries are short, often one or two words, and can be ambiguous therefore returning inappropriate results. Contextual information retrieval (CIR) is a critical technique for these search engines to facilitate queries and retur… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6100v1-abstract-full').style.display = 'inline'; document.getElementById('1407.6100v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.6100v1-abstract-full" style="display: none;"> Search engines are the most commonly used type of tool for finding relevant information on the Internet. However, today's search engines are far from perfect. Typical search queries are short, often one or two words, and can be ambiguous therefore returning inappropriate results. Contextual information retrieval (CIR) is a critical technique for these search engines to facilitate queries and return relevant information. Despite its importance, little progress has been made in CIR due to the difficulty of capturing and representing contextual information about users. Numerous contextual information retrieval approaches exist today, but to the best of our knowledge none of them offer a similar service to the one proposed in this paper. This paper proposes an alternative framework for contextual information retrieval from the WWW. The framework aims to improve query results (or make search results more relevant) by constructing a contextual profile based on a user's behaviour, their preferences, and a shared knowledge base, and using this information in the search engine framework to find and return relevant information. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6100v1-abstract-full').style.display = 'none'; document.getElementById('1407.6100v1-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> 22 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </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">Proceedings of the 14th International Conference on Adaptive Systems and Software Engineering (IASSE 2005)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.6099">arXiv:1407.6099</a> <span> [<a href="https://arxiv.org/pdf/1407.6099">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Computation and Language">cs.CL</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Autonomous requirements specification processing using natural language processing </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Macdonell%2C+S+G">S. G. Macdonell</a>, <a href="/search/?searchtype=author&query=Min%2C+K">K. Min</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">A. M. Connor</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="1407.6099v1-abstract-short" style="display: inline;"> We describe our ongoing research that centres on the application of natural language processing (NLP) to software engineering and systems development activities. In particular, this paper addresses the use of NLP in the requirements analysis and systems design processes. We have developed a prototype toolset that can assist the systems analyst or software engineer to select and verify terms releva… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6099v1-abstract-full').style.display = 'inline'; document.getElementById('1407.6099v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.6099v1-abstract-full" style="display: none;"> We describe our ongoing research that centres on the application of natural language processing (NLP) to software engineering and systems development activities. In particular, this paper addresses the use of NLP in the requirements analysis and systems design processes. We have developed a prototype toolset that can assist the systems analyst or software engineer to select and verify terms relevant to a project. In this paper we describe the processes employed by the system to extract and classify objects of interest from requirements documents. These processes are illustrated using a small example. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.6099v1-abstract-full').style.display = 'none'; document.getElementById('1407.6099v1-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> 22 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </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">Proceedings of the ISCA 14th International Conferenceon Intelligent and Adaptive Systems and Software Engineering (IASSE 2005)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.4186">arXiv:1407.4186</a> <span> [<a href="https://arxiv.org/pdf/1407.4186">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Computers and Society">cs.CY</span> </div> </div> <p class="title is-5 mathjax"> Bridging the Research-Practice Gap in Requirements Engineering through Effective Teaching and Peer Learning </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andrew M. Connor</a>, <a href="/search/?searchtype=author&query=Buchan%2C+J">Jim Buchan</a>, <a href="/search/?searchtype=author&query=Petrova%2C+K">Krassie Petrova</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="1407.4186v1-abstract-short" style="display: inline;"> In this paper, we introduce the concept of the research practice gap as it is perceived in the field of software requirements engineering. An analysis of this gap has shown that two key causes for the research-practice gap are lack of effective communication and the relatively light coverage of requirements engineering material in University programmes. We discuss the design and delivery of a Mast… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.4186v1-abstract-full').style.display = 'inline'; document.getElementById('1407.4186v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.4186v1-abstract-full" style="display: none;"> In this paper, we introduce the concept of the research practice gap as it is perceived in the field of software requirements engineering. An analysis of this gap has shown that two key causes for the research-practice gap are lack of effective communication and the relatively light coverage of requirements engineering material in University programmes. We discuss the design and delivery of a Masters course in Software Requirements Engineering (SRE) that is designed to overcome some of the issues that have caused the research-practice gap. By encouraging students to share their experiences in a peer learning environment, we aim to improve shared understanding between students (many of whom are current industry practitioners) and researchers (including academic staff members) to improve the potential for effective collaborations, whilst simultaneously developing the requirements engineering skill sets of the enrolled students. Feedback from students in the course is discussed and directions for the future development of the curriculum and learning strategies are given. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.4186v1-abstract-full').style.display = 'none'; document.getElementById('1407.4186v1-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> 15 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </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">Proceedings of the 6th International Conference on Information Technology: New Generations (ITNG 2009)</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.2541">arXiv:1407.2541</a> <span> [<a href="https://arxiv.org/pdf/1407.2541">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Mining Software Metrics from Jazz </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Finlay%2C+J">Jacqui Finlay</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</a>, <a href="/search/?searchtype=author&query=Pears%2C+R">Russel Pears</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="1407.2541v1-abstract-short" style="display: inline;"> In this paper, we describe the extraction of source code metrics from the Jazz repository and the application of data mining techniques to identify the most useful of those metrics for predicting the success or failure of an attempt to construct a working instance of the software product. We present results from a systematic study using the J48 classification method. The results indicate that only… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.2541v1-abstract-full').style.display = 'inline'; document.getElementById('1407.2541v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.2541v1-abstract-full" style="display: none;"> In this paper, we describe the extraction of source code metrics from the Jazz repository and the application of data mining techniques to identify the most useful of those metrics for predicting the success or failure of an attempt to construct a working instance of the software product. We present results from a systematic study using the J48 classification method. The results indicate that only a relatively small number of the available software metrics that we considered have any significance for predicting the outcome of a build. These significant metrics are discussed and implication of the results discussed, particularly the relative difficulty of being able to predict failed build attempts. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.2541v1-abstract-full').style.display = 'none'; document.getElementById('1407.2541v1-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> 9 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1407.2330">arXiv:1407.2330</a> <span> [<a href="https://arxiv.org/pdf/1407.2330">pdf</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Software Engineering">cs.SE</span> </div> </div> <p class="title is-5 mathjax"> Synthetic Minority Over-sampling TEchnique(SMOTE) for Predicting Software Build Outcomes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/?searchtype=author&query=Pears%2C+R">Russel Pears</a>, <a href="/search/?searchtype=author&query=Finlay%2C+J">Jacqui Finlay</a>, <a href="/search/?searchtype=author&query=Connor%2C+A+M">Andy M. Connor</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="1407.2330v1-abstract-short" style="display: inline;"> In this research we use a data stream approach to mining data and construct Decision Tree models that predict software build outcomes in terms of software metrics that are derived from source code used in the software construction process. The rationale for using the data stream approach was to track the evolution of the prediction model over time as builds are incrementally constructed from previ… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.2330v1-abstract-full').style.display = 'inline'; document.getElementById('1407.2330v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1407.2330v1-abstract-full" style="display: none;"> In this research we use a data stream approach to mining data and construct Decision Tree models that predict software build outcomes in terms of software metrics that are derived from source code used in the software construction process. The rationale for using the data stream approach was to track the evolution of the prediction model over time as builds are incrementally constructed from previous versions either to remedy errors or to enhance functionality. As the volume of data available for mining from the software repository that we used was limited, we synthesized new data instances through the application of the SMOTE oversampling algorithm. The results indicate that a small number of the available metrics have significance for prediction software build outcomes. It is observed that classification accuracy steadily improves after approximately 900 instances of builds have been fed to the classifier. At the end of the data streaming process classification accuracies of 80% were achieved, though some bias arises due to the distribution of data across the two classes over time. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1407.2330v1-abstract-full').style.display = 'none'; document.getElementById('1407.2330v1-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> 8 July, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2014. </p> </li> </ol> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Connor%2C+M&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Connor%2C+M&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Connor%2C+M&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> </ul> </nav> <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