Computer Engineering Commons^™

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 …

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 …

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