Artificial Intelligence and Robotics Commons^™

Information Extraction And Classification On Journal Papers, Lei Yu

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

The importance of journals for diffusing the results of scientific research has increased considerably. In the digital era, Portable Document Format (PDF) became the established format of electronic journal articles. This structured form, combined with a regular and wide dissemination, spread scientific advancements easily and quickly. However, the rapidly increasing numbers of published scientific articles requires more time and effort on systematic literature reviews, searches and screens. The comprehension and extraction of useful information from the digital documents is also a challenging task, due to the complex structure of PDF.

To help a soil science team from the United States …

Image Classification Using Fuzzy Fca, Niruktha Roy Gotoor

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Formal concept analysis (FCA) is a mathematical theory based on lattice and order theory used for data analysis and knowledge representation. It has been used in various domains such as data mining, machine learning, semantic web, Sciences, for the purpose of data analysis and Ontology over the last few decades. Various extensions of FCA are being researched to expand it's scope over more departments. In this thesis,we review the theory of Formal Concept Analysis (FCA) and its extension Fuzzy FCA. Many studies to use FCA in data mining and text learning have been pursued. We extend these studies to include …

Dimensional Analysis Of Robot Software Without Developer Annotations, John-Paul W. Ore

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Robot software risks the hazard of dimensional inconsistencies. These inconsistencies occur when a program incorrectly manipulates values representing real-world quantities. Incorrect manipulation has real-world consequences that range in severity from benign to catastrophic. Previous approaches detect dimensional inconsistencies in programs but require extra developer effort and technical complications. The extra effort involves developers creating type annotations for every variable representing a real-world quantity that has physical units, and the technical complications include toolchain burdens like specialized compilers or type libraries.

To overcome the limitations of previous approaches, this thesis presents novel methods to detect dimensional inconsistencies without developer annotations. We …

Higher-Level Consistencies: Where, When, And How Much, Robert J. Woodward

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Determining whether or not a Constraint Satisfaction Problem (CSP) has a solution is NP-complete. CSPs are solved by inference (i.e., enforcing consistency), conditioning (i.e., doing search), or, more commonly, by interleaving the two mechanisms. The most common consistency property enforced during search is Generalized Arc Consistency (GAC). In recent years, new algorithms that enforce consistency properties stronger than GAC have been proposed and shown to be necessary to solve difficult problem instances.

We frame the question of balancing the cost and the pruning effectiveness of consistency algorithms as the question of determining where, when, and how much of a higher-level …

Effectively Enforcing Minimality During Backtrack Search, Daniel J. Geschwender

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Constraint Processing is an expressive and powerful framework for modeling and solving combinatorial decision problems. Enforcing consistency during backtrack search is an effective technique for reducing thrashing in a large search tree. The higher the level of the consistency enforced, the stronger the pruning of inconsistent subtrees. Recently, high-level consistencies (HLC) were shown to be instrumental for solving difficult instances. In particular, minimality, which is guaranteed to prune all inconsistent branches, is advantageous even when enforced locally. In this thesis, we study two algorithms for computing minimality and propose three new mechanisms that significantly improve performance. Then, we integrate the …

Speech Emotion Recognition Using Convolutional Neural Networks, Somayeh Shahsavarani

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Automatic speech recognition is an active field of study in artificial intelligence and machine learning whose aim is to generate machines that communicate with people via speech. Speech is an information-rich signal that contains paralinguistic information as well as linguistic information. Emotion is one key instance of paralinguistic information that is, in part, conveyed by speech. Developing machines that understand paralinguistic information, such as emotion, facilitates the human-machine communication as it makes the communication more clear and natural. In the current study, the efficacy of convolutional neural networks in recognition of speech emotions has been investigated. Wide-band spectrograms of the …

An Unmanned Aerial System For Prescribed Fires, Evan M. Beachly

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Prescribed fires can lessen wildfire severity and control invasive species, but some terrains may be difficult, dangerous, or costly to burn with existing tools. This thesis presents the design of an unmanned aerial system that can ignite prescribed fires from the air, with less cost and risk than with aerial ignition from a manned aircraft. The prototype was evaluated in-lab and successfully used to ignite interior areas of two prescribed fires. Additionally, we introduce an approach that integrates a lightweight fire simulation to autonomously plan safe flight trajectories and suggest effective fire lines. Both components are unique in that they …

Hierarchical Active Learning Application To Mitochondrial Disease Protein Dataset, James D. Duin

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

This study investigates an application of active machine learning to a protein dataset developed to identify the source of mutations which give rise to mitochondrial disease. The dataset is labeled according to the protein's location of origin in the cell; whether in the mitochondria or not, or a specific target location in the mitochondria's outer or inner membrane, its matrix, or its ribosomes. This dataset forms a labeling hierarchy. A new machine learning approach is investigated to learn the high-level classifier, i.e., whether the protein is a mitochondrion, by separately learning finer-grained target compartment concepts and combining the results. This …

On Path Consistency For Binary Constraint Satisfaction Problems, Christopher G. Reeson

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Constraint satisfaction problems (CSPs) provide a flexible and powerful framework for modeling and solving many decision problems of practical importance. Consistency properties and the algorithms for enforcing them on a problem instance are at the heart of Constraint Processing and best distinguish this area from other areas concerned with the same combinatorial problems. In this thesis, we study path consistency (PC) and investigate several algorithms for enforcing it on binary finite CSPs. We also study algorithms for enforcing consistency properties that are related to PC but are stronger or weaker than PC.

We identify and correct errors in the literature …

Towards Building A Review Recommendation System That Trains Novices By Leveraging The Actions Of Experts, Shilpa Khanal

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Online reviews increase consumer visits, increase the time spent on the website, and create a sense of community among the frequent shoppers. Because of the importance of online reviews, online retailers such as Amazon.com and eOpinions provide detailed guidelines for writing reviews. However, though these guidelines provide instructions on how to write reviews, reviewers are not provided instructions for writing product-specific reviews. As a result, poorly-written reviews are abound and a customer may need to scroll through a large number of reviews, which could be up to 6000 pixels down from the top of the page, in order to find …

A Visual Analysis Of Articulated Motion Complexity Based On Optical Flow And Spatial-Temporal Features, Beau Michael Christ

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

The understanding of motion is an important problem in computer vision with applications including crowd-flow analysis, video surveillance, and estimating three-dimensional structure. A less-explored problem is the visual characterization and quantification of motion complexity. An important motion class that is prevalent in living beings is articulated motion (segments connected by joints). At present, no known standardized measure for quantifying the complexity of articulated motion exists. Such a measure could facilitate advanced motion analysis with applications including video indexing, motion comparison, and advanced biological study of visual signals in organisms.

This dissertation presents an in-depth study of the development of several …

Reflective, Deliberative Agent-Based Information Gathering, Adam D. Eck

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

As computational devices and entities become further established as routine, omnipresent components of our everyday lives (e.g., wearable sensors, smart homes, cyber-physical systems, embodied agents, human-robot interactions), such systems face an increased pressure to perpetually understand the complex, noisy, uncertain world around them in real-time. This environmental knowledge enables computational systems to intelligently decide how to best behave in response to the current situation, adapt to the ever-changing conditions of the dynamic world, and accomplish system goals that ultimately aim to improve our daily experience. However, achieving and maintaining such knowledge is very complicated due to the complexities and challenging …

A Comparative Study Of Underwater Robot Path Planning Algorithms For Adaptive Sampling In A Network Of Sensors, Sreeja Banerjee

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Monitoring lakes, rivers, and oceans is critical to improving our understanding of complex large-scale ecosystems. We introduce a method of underwater monitoring using semi-mobile underwater sensor networks and mobile underwater robots in this thesis. The underwater robots can move freely in all dimension while the sensor nodes are anchored to the bottom of the water column and can move only up and down along the depth of the water column. We develop three different algorithms to optimize the path of the underwater robot and the positions of the sensors to improve the overall quality of sensing of an area of …

Understanding Human Learning Using A Multiagent Based Unified Learning Model Simulation, Vlad T. Chiriacescu

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Within cognitive science, computational modeling based on cognitive architectures has been an important approach to addressing questions of human cognition and learning. Modeling issues such as limited expressivity in representing knowledge and lack of appropriate selection of model structure represent a challenge for existing architectures. Furthermore, latest research shows that the concepts of long-term memory, motivation and working memory are critical cognitive aspects but a unifying cognitive paradigm integrating those concepts hasn’t been previously achieved.

Derived from a synthesis of neuroscience, cognitive science, psychology, and education, the Unified Learning Model (ULM) provides this integration by merging a statistical learning mechanism …

Practical Tractability Of Csps By Higher Level Consistency And Tree Decomposition, Shant Karakashian

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Constraint Satisfaction is a flexible paradigm for modeling many decision problems in Engineering, Computer Science, and Management. Constraint Satisfaction Problems (CSPs) are in general NP-complete and are usually solved with search. Research has identified various islands of tractability, which enable solving certain CSPs with backtrack-free search. For example, one sufficient condition for tractability relates the consistency level of a CSP to treewidth of the CSP's constraint network. However, enforcing higher levels of consistency on a CSP may require the addition of constraints, thus altering the topology of the constraint network and increasing its treewidth. This thesis addresses the following question: …

Identification Of Tcp Protocols, Juan Shao

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

Recently, many new TCP algorithms, such as BIC, CUBIC, and CTCP, have been deployed in the Internet. Investigating the deployment statistics of these TCP algorithms is meaningful to study the performance and stability of the Internet. Currently, there is a tool named Congestion Avoidance Algorithm Identification (CAAI) for identifying the TCP algorithm of a web server and then for investigating the TCP deployment statistics. However, CAAI using a simple k-NN algorithm can not achieve a high identification accuracy. In this thesis, we comprehensively study the identification accuracy of five popular machine learning models. We find that the random forest model …

Multiagent Coalition Formation In Uncertain Environments With Type-Changing Influences And Its Application Towards Forming Human Coalitions, Nobel A. Khandaker

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

We aim to solve the problem forming multiagent coalitions in uncertain environments where the coalition members’ capability of solving tasks change due to their learning. The MCFP-Mproblem for the agents refers to forming or joining coalitions on behalf of a set of human users so that those human users can solve tasks and improve their types (expertise) to improve their performances over time. MCFP-A problem for a set of agents refers to their forming or joining coalitions so that they are able to solve a set of assigned tasks while optimize their performance over time. We propose the Integrated Human …

Agent Sensing With Stateful Resources, Adam D. Eck

Department of Computer Science and Engineering: Dissertations, Theses, and Student Research

In many real-world applications of multi-agent systems, agent reasoning suffers from bounded rationality caused by both limited resources and limited knowledge. When agent sensing also requires resource use, the agent’s knowledge revision is affected due to its inability to always sense when and as accurately as needed, further leading to poor decision making. In this research, we consider what happens when sensing activities require the use of stateful resources, which we define as resources whose state-dependent behavior changes over time based on usage. Specifically, sensing itself can change the state of a resource, and thus its behavior, which affects both …