Artificial Intelligence and Robotics Commons^™

Nlu Framework For Voice Enabling Non-Native Applications On Smart Devices, Soujanya Lanka, Deepika Panthania, Pooja Kushalappa, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Voice is a critical user interface on smart devices (wearables, phones, speakers, televisions) to access applications (or services) available on them. Unfortunately, only a few native applications (provided by the OS developer) are typically voice enabled in devices of today. Since, the utility of a smart device is determined more by the strength of external applications developed for the device, voice enabling non-native applications in a scalable, seamless manner within the device is a critical use case and is the focus of our work. We have developed a Natural Language Understanding (NLU) framework that uses templates supported by the application …

Achieving Stable And Fair Profit Allocation With Minimum Subsidy In Collaborative Logistics, Lucas Agussurja, Hoong Chuin Lau, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

With the advent of e-commerce, logistics providers are faced with the challenge of handling fluctuating and sparsely distributed demand, which raises their operational costs significantly. As a result, horizontal cooperation are gaining momentum around the world. One of the major impediments, however, is the lack of stable and fair profit sharing mechanism. In this paper, we address this problem using the framework of computational cooperative games. We first present cooperative vehicle routing game as a model for collaborative logistics operations. Using the axioms of Shapley value as the conditions for fairness, we show that a stable, fair and budget balanced …

Shortest Path Based Decision Making Using Probabilistic Inference, Akshat Kumar

Research Collection School Of Computing and Information Systems

We present a new perspective on the classical shortest path routing (SPR) problem in graphs. We show that the SPR problem can be recast to that of probabilistic inference in a mixture of simple Bayesian networks. Maximizing the likelihood in this mixture becomes equivalent to solving the SPR problem. We develop the well known Expectation-Maximization (EM) algorithm for the SPR problem that maximizes the likelihood, and show that it does not get stuck in a locally optimal solution. Using the same probabilistic framework, we then address an NP-Hard network design problem where the goal is to repair a network of …

Robust Decision Making For Stochastic Network Design, Akshat Kumar, Arambam James Singh, Pradeep Varakantham, Daniel Sheldon

Research Collection School Of Computing and Information Systems

We address the problem of robust decision making for stochastic network design. Our work is motivated by spatial conservation planning where the goal is to take management decisions within a fixed budget to maximize the expected spread of a population of species over a network of land parcels. Most previous work for this problem assumes that accurate estimates of different network parameters (edge activation probabilities, habitat suitability scores) are available, which is an unrealistic assumption. To address this shortcoming, we assume that network parameters are only partially known, specified via interval bounds. We then develop a decision making approach that …

Online Spatio-Temporal Matching In Stochastic And Dynamic Domains, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Spatio-temporal matching of services to customers online is a problem that arises on a large scale in many domains associated with shared transportation (ex: taxis, ride sharing, super shuttles, etc.) and delivery services (ex: food, equipment, clothing, home fuel, etc.). A key characteristic of these problems is that matching of services to customers in one round has a direct impact on the matching of services to customers in the next round. For instance, in the case of taxis, in the second round taxis can only pick up customers closer to the drop off point of the customer from the first …

The Global Rock-Art Database Project Towards Machine Learning: Building A Collaborative Open Source Platform For Heritage Management From Information Structure To Information Visualization Using Australian Heritage Examples, Robert Haubt

Staff Scholarship - Australia & Dubai

This guest talk, presented at Lava Lab at the University of Hawaiʻi, explores the intersection of collaboration, data ontology, and information visualization in advancing machine learning within the Global Rock Art Database project. Drawing on insights from the project’s first four years, the talk emphasizes the critical need for cultural heritage preservation by systematically recording and structuring global rock art data in accessible and sustainable ways. This effort not only supports public education on rock art but also facilitates scholarly research.

Key discussions include advancements in data ontology using the CIDOC Conceptual Reference Model (CIDOC CRM) for semantic data management …

Artificially Intelligent Computer Assisted Language Learning System With Ai Student Component, Denee M. Mcclain

Capstone Research Projects

Intelligent Computer Assisted Language Learning (ICALL) systems follow an accepted format, which utilizes an artificially intelligent tutor. The systems allow the user to input a sentence in the target language and the AI tutor analyzes the sentence and provides error correction. This approach can be expensive, impractical, and inflexible. Inflexibility can result in a lower quality of learning for the users of these systems. Here I present an alternative format for ICALL systems that utilizes an artificially intelligent student. This alternative is cost effective and practical because it does not require extra development time to make the artificial intelligence an …

Techno-Apocalypse: Technology, Religion, And Ideology In Bryan Singer’S H+, Edward Brennan

Books/Book chapters

This essay critically analyses the digital series H+. In the near future, adults who can afford them, have replaced tablets and cell phones with nanotechnology implants. The H+ implant acts as a medical diagnostic and can overlay the user's senses with a computer interface. The apocalypse comes in the form of a computer virus which infects the H+ network and instantly kills one third of humanity. The series represents the anxiety and religiosity that surrounds the possible social consequences of digital technology. It also explores the tensions and intersections between technology and faith. This essay makes the case, however, that …

Ai Education: Birds Of A Feather, Todd W. Neller

Computer Science Faculty Publications

Games are beautifully crafted microworlds that invite players to explore complex terrains that spring into existence from even simple rules. As AI educators, games can offer fun ways of teaching important concepts and techniques. Just as Martin Gardner employed games and puzzles to engage both amateurs and professionals in the pursuit of Mathematics, a well-chosen game or puzzle can provide a catalyst for AI learning and research. [excerpt]

Modeling, Learning And Reasoning About Preference Trees Over Combinatorial Domains, Xudong Liu

Theses and Dissertations--Computer Science

In my Ph.D. dissertation, I have studied problems arising in various aspects of preferences: preference modeling, preference learning, and preference reasoning, when preferences concern outcomes ranging over combinatorial domains. Preferences is a major research component in artificial intelligence (AI) and decision theory, and is closely related to the social choice theory considered by economists and political scientists. In my dissertation, I have exploited emerging connections between preferences in AI and social choice theory. Most of my research is on qualitative preference representations that extend and combine existing formalisms such as conditional preference nets, lexicographic preference trees, answer-set optimization programs, possibilistic …

Automated Conjecturing Approach For Benzenoids, David Muncy

Theses and Dissertations

Benzenoids are graphs representing the carbon structure of molecules, defined by a closed path in the hexagonal lattice. These compounds are of interest to chemists studying existing and potential carbon structures. The goal of this study is to conjecture and prove relations between graph theoretic properties among benzenoids. First, we generate conjectures on upper bounds for the domination number in benzenoids using invariant-defined functions. This work is an extension of the ideas to be presented in a forthcoming paper. Next, we generate conjectures using property-defined functions. As the title indicates, the conjectures we prove are not thought of on our …

Eeg Interictal Spike Detection Using Artificial Neural Networks, Howard J. Carey Iii

Theses and Dissertations

Epilepsy is a neurological disease causing seizures in its victims and affects approximately 50 million people worldwide. Successful treatment is dependent upon correct identification of the origin of the seizures within the brain. To achieve this, electroencephalograms (EEGs) are used to measure a patient’s brainwaves. This EEG data must be manually analyzed to identify interictal spikes that emanate from the afflicted region of the brain. This process can take a neurologist more than a week and a half per patient. This thesis presents a method to extract and process the interictal spikes in a patient, and use them to reduce …

Factororacle: An Extensible Max External For Investigating Applications Of The Factor Oracle Automaton In Real-Time Music Improvisation, Adam James Wilson

Publications and Research

There are several extant software systems designed to generate music in real-time using a factor oracle automaton constructed from the musical input of a human improvisor. The impetus for the design of the factorOracle external is neither a desire to supersede these systems nor introduce novel algorithms for traversing the oracle, but rather to provide a fast, canonical interface for the automaton in Cycling74’s Max and, in future iterations, the Pure Data programming environment. Technical features of the factorOracle software are introduced here.

Harnessing The Power Of Text Mining For The Detection Of Abusive Content In Social Media, Hao Chen, Susan Mckeever, Sarah Jane Delany

Conference papers

Abstract The issues of cyberbullying and online harassment have gained considerable coverage in the last number of years. Social media providers need to be able to detect abusive content both accurately and efficiently in order to protect their users. Our aim is to investigate the application of core text mining techniques for the automatic detection of abusive content across a range of social media sources include blogs, forums, media-sharing, Q&A and chat - using datasets from Twitter, YouTube, MySpace, Kongregate, Formspring and Slashdot. Using supervised machine learning, we compare alternative text representations and dimension reduction approaches, including feature selection and …

Evaluation Of Supervised Machine Learning For Classifying Video Traffic, Farrell R. Taylor

CCAC Theses and Dissertations

Operational deployment of machine learning based classifiers in real-world networks has become an important area of research to support automated real-time quality of service decisions by Internet service providers (ISPs) and more generally, network administrators. As the Internet has evolved, multimedia applications, such as voice over Internet protocol (VoIP), gaming, and video streaming, have become commonplace. These traffic types are sensitive to network perturbations, e.g. jitter and delay. Automated quality of service (QoS) capabilities offer a degree of relief by prioritizing network traffic without human intervention; however, they rely on the integration of real-time traffic classification to identify applications. Accordingly, …

Automatically Defined Templates For Improved Prediction Of Non-Stationary, Nonlinear Time Series In Genetic Programming, David Moskowitz

CCAC Theses and Dissertations

Soft methods of artificial intelligence are often used in the prediction of non-deterministic time series that cannot be modeled using standard econometric methods. These series, such as occur in finance, often undergo changes to their underlying data generation process resulting in inaccurate approximations or requiring additional human judgment and input in the process, hindering the potential for automated solutions.

Genetic programming (GP) is a class of nature-inspired algorithms that aims to evolve a population of computer programs to solve a target problem. GP has been applied to time series prediction in finance and other domains. However, most GP-based approaches to …

Persuasion In Online Communication : Automation And Counteraction, Samira Shaikh Shaikh

Legacy Theses & Dissertations (2009 - 2024)

In this thesis, we studied persuasion in online communication and how to automate

An Approach To Automatic Detection Of Suspicious Individuals In A Crowd, Satabdi Mukherjee

Dissertations and Theses

This paper describes an approach to identify individuals with suspicious objects in a crowd. It is based on a well-known image retrieval problem as applied to mobile visual search. In many cases, the process of building a hierarchical tree uses k-means clustering followed by geometric verification. However, the number of clusters is not known in advance, and sometimes it is randomly generated. This may lead to a congested clustering which can cause problems in grouping large real-time data. To overcome this problem we have applied the Indian Buffet stochastic process approach in this paper to the clustering problem. We present …

Cp-Nets: From Theory To Practice, Thomas E. Allen

Theses and Dissertations--Computer Science

Conditional preference networks (CP-nets) exploit the power of ceteris paribus rules to represent preferences over combinatorial decision domains compactly. CP-nets have much appeal. However, their study has not yet advanced sufficiently for their widespread use in real-world applications. Known algorithms for deciding dominance---whether one outcome is better than another with respect to a CP-net---require exponential time. Data for CP-nets are difficult to obtain: human subjects data over combinatorial domains are not readily available, and earlier work on random generation is also problematic. Also, much of the research on CP-nets makes strong, often unrealistic assumptions, such as that decision variables must …

Preferences: Optimization, Importance Learning And Strategic Behaviors, Ying Zhu

Theses and Dissertations--Computer Science

Preferences are fundamental to decision making and play an important role in artificial intelligence. Our research focuses on three group of problems based on the preference formalism Answer Set Optimization (ASO): preference aggregation problems such as computing optimal (near optimal) solutions, strategic behaviors in preference representation, and learning ranks (weights) for preferences.

In the first group of problems, of interest are optimal outcomes, that is, outcomes that are optimal with respect to the preorder defined by the preference rules. In this work, we consider computational problems concerning optimal outcomes. We propose, implement and study methods to compute an optimal outcome; …