Physical Sciences and Mathematics Commons^™

Soft Robotic Grippers For Biological Sampling On Deep Reefs, Kevin C. Galloway, Kaitlyn P. Becker, Brennan Phillips, Jordan Kirby, Stephen Licht, Dan Tchernov, Robert J. Wood, David F. Gruber

Publications and Research

This article presents the development of an underwater gripper that utilizes soft robotics technology to delicately manipulate and sample fragile species on the deep reef. Existing solutions for deep sea robotic manipulation have historically been driven by the oil industry, resulting in destructive interactions with undersea life. Soft material robotics relies on compliant materials that are inherently impedance matched to natural environments and to soft or fragile organisms. We demonstrate design principles for soft robot end effectors, bench-top characterization of their grasping performance, and conclude by describing in situ testing at mesophotic depths. The result is the first use of …

Campus-Scale Mobile Crowd-Tasking: Deployment And Behavioral Insights, Thivya Kandappu, Archan Misra, Shih-Fen Cheng, Nikita Jaiman, Randy Tandriansiyah, Cen Chen, Hoong Chuin Lau, Deepthi Chander, Koustuv Dasgupta

Research Collection School Of Computing and Information Systems

Mobile crowd-tasking markets are growing at an unprecedented rate with increasing number of smartphone users. Such platforms differ from their online counterparts in that they demand physical mobility and can benefit from smartphone processors and sensors for verification purposes. Despite the importance of such mobile crowd-tasking markets, little is known about the labor supply dynamics and mobility patterns of the users. In this paper we design, develop and experiment with a realwporld mobile crowd-tasking platform, called TA$Ker. Our contributions are two-fold: (a) We develop TA$Ker, a system that allows us to empirically study the worker responses to push vs. pull …

Detection Of Bird Nests In Overhead Catenary System Images For High-Speed Rail, Xiao Wu, Ping Yuan, Qiang Peng, Chong-Wah Ngo, Jun-Yan He

Research Collection School Of Computing and Information Systems

The high-speed rail system provides a fast, reliable and comfortable means to transport large number of travelers over long distances. The existence of bird nests in overhead catenary system (OCS) can hazard to the safety of the high-speed rails, which will potentially result in long time delays and expensive damages. A vision-based intelligent inspection system capable of automatic detection of bird nests built on overhead catenary would avoid the damages and increase the reliability and punctuality, and therefore is attractive for a high-speed railway system. However, OCS images exhibit great variations with lighting changes, illumination conditions and complex backgrounds, which …

Hpcnmf: A High-Performance Toolbox For Non-Negative Matrix Factorization, Karthik Devarajan, Guoli Wang

COBRA Preprint Series

Non-negative matrix factorization (NMF) is a widely used machine learning algorithm for dimension reduction of large-scale data. It has found successful applications in a variety of fields such as computational biology, neuroscience, natural language processing, information retrieval, image processing and speech recognition. In bioinformatics, for example, it has been used to extract patterns and profiles from genomic and text-mining data as well as in protein sequence and structure analysis. While the scientific performance of NMF is very promising in dealing with high dimensional data sets and complex data structures, its computational cost is high and sometimes could be critical for …

A Proactive Sampling Approach To Project Scheduling Under Uncertainty, Pradeep Varakantham, Na Fu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Uncertainty in activity durations is a key characteristic of many real world scheduling problems in manufacturing, logistics and project management. RCPSP/max with durational uncertainty is a general model that can be used to represent durational uncertainty in a wide variety of scheduling problems where there exist resource constraints. However, computing schedules or execution strategies for RCPSP/max with durational uncertainty is NP-hard and hence we focus on providing approximation methods in this paper. We pro- vide a principled approximation approach based on Sample Average Approximation (SAA) to compute proactive schedules for RCPSP/max with durational uncertainty. We further contribute an extension to …

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 …

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 …

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 …

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 …

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 …

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 …

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

Integrating Cobots In Engineering Technology Education, Ana M. Djuric, Vukica Jovanovic, Tatiana V. Goris, Otilia Popescu

Engineering Technology Faculty Publications

Collaborative robots or CoBots, unlike traditional robots, are safe and flexible enough to work harmoniously with humans. Exploiting the efficiency of automated operations and the flexibility of manual operations in one process can improve productivity and worker job satisfaction. CoBots technology has been experiencing strong growth in different areas such as ground transportation, food-processing industry, car manufacturing, and naval or aeronautical engineering. Current CoBots education and training opportunities are rare or non-existent in university environments. In response to this need, we developed several CoBots modules which will be integrated in the current robotics and mechatronics courses. In this paper we …

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 …

Automated Design Of Boolean Satisfiability Solvers Employing Evolutionary Computation, Alex Raymond Bertels

Masters Theses

"Modern society gives rise to complex problems which sometimes lend themselves to being transformed into Boolean satisfiability (SAT) decision problems; this thesis presents an example from the program understanding domain. Current conflict-driven clause learning (CDCL) SAT solvers employ all-purpose heuristics for making decisions when finding truth assignments for arbitrary logical expressions called SAT instances. The instances derived from a particular problem class exhibit a unique underlying structure which impacts a solver's effectiveness. Thus, tailoring the solver heuristics to a particular problem class can significantly enhance the solver's performance; however, manual specialization is very labor intensive. Automated development may apply hyper-heuristics …

Using Genetic Algorithms To Evolve Artificial Neural Networks, William T. Kearney

Honors Theses

This paper demonstrates that neuroevolution is an effective method to determine an optimal neural network topology. I provide an overview of the NeuroEvolution of Augmenting Topologies (NEAT) algorithm, and describe how unique characteristics of this algorithm solve various problem inherent to neuroevolution (namely the competing conventions problem and the challenges associated with protecting topological innovation). Parallelization is shown to greatly speed up efficiency, further reinforcing neuroevolution as a potential alternative to traditional backpropagation. I also demonstrate that appropriate parameter selection is critical in order to efficiently converge to an optimal topology. Lastly, I produce an example solution to a medical …

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; …

Applications Of Computational Geometry And Computer Vision, Joseph Lemley

All Master's Theses

Recent advances in machine learning research promise to bring us closer to the original goals of artificial intelligence. Spurred by recent innovations in low-cost, specialized hardware and incremental refinements in machine learning algorithms, machine learning is revolutionizing entire industries. Perhaps the biggest beneficiary of this progress has been the field of computer vision. Within the domains of computational geometry and computer vision are two problems: Finding large, interesting holes in high dimensional data, and locating and automatically classifying facial features from images. State of the art methods for facial feature classification are compared and new methods for finding empty hyper-rectangles …

Implementation Of An Air Supply Unit Control Scheme For The Uc2av (Unmanned Circulation Control Aerial Vehicle), Cameron Rosen

Electronic Theses and Dissertations

The expanded prevalence of Unmanned Aerial Vehicles (UAVs) in recent years has created many opportunities to research novel applications for their use, enabled by the reduced cost, mission flexibility, and reduced risk that small-scale unmanned platforms provide in comparison to larger aircraft. Despite the versatility of unmanned aviation, limitations on payload size and weight, fuel and power capacity, and takeoff and landing infrastructure can restrict UAV applications, and have created a need for lift augmenting technologies that can reduce the impact of these limitations. Circulation Control (CC) is an active flow technique that has been proven as a method for …

Improving The Vector Auto Regression Technique For Time-Series Link Prediction By Using Support Vector Machine, Proceso L. Fernandez Jr, Jan Miles Co

Department of Information Systems & Computer Science Faculty Publications

Predicting links between the nodes of a graph has become an important Data Mining task because of its direct applications to biology, social networking, communication surveillance, and other domains. Recent literature in time-series link prediction has shown that the Vector Auto Regression (VAR) technique is one of the most accurate for this problem. In this study, we apply Support Vector Machine (SVM) to improve the VAR technique that uses an unweighted adjacency matrix along with 5 matrices: Common Neighbor (CN), Adamic-Adar (AA), Jaccard’s Coefficient (JC), Preferential Attachment (PA), and Research Allocation Index (RA). A DBLP dataset covering the years from …

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 …

The Reconfigurable Machinery Efficient Workspace Analysis Based On The Twist Angles, Ana M. Djuric, Vukica Jovanovic, Mirjana Filipovic, Ljubinko Kevac

Engineering Technology Faculty Publications

A novel methodology for the calculation, visualisation and analysis of the Reconfigurable Machinery Efficient Workspace (RMEW), based on the twist angles, is presented in this paper. The machinery's kinematic parameters are used for calculating the workspace, while the efficient workspace is associated with the machinery's path and includes the end-effector position and orientation. To analyse and visualise many different machinery efficient workspaces at the same time, the calculation is based on the previously developed and validated complex reconfigurable machinery's kinematic structure named n-DOF Global Kinematic Model (n-GKM). An industrial robot is used as an example to demonstrate …

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 …

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, …