Physical Sciences and Mathematics Commons^™

Defining, Executing And Visualizing Representative Workflows In A Retail Domain, May Zeineldin

Graduate Theses and Dissertations

Our lives are filled with routine activities that we do more or less on auto-pilot such as driving to work and cooking. This thesis explores a workflow representation as a way to represent such activities of daily living. The domain of a retail store environment is used. Workflows are initially expressed in a structured English representation, then translated into a Petri net notation and implemented in mix of Petri nets, Lua, and C so that the resulting workflows can be displayed as the actions of collections of avatarbots (avatars controlled by programs) in a 3D virtual world, Second Life. One …

Processj: A Process-Oriented Programming Language, Matthew Sowders

UNLV Theses, Dissertations, Professional Papers, and Capstones

Java is a general purpose object-oriented programming language that has been widely adopted. Because of its high adoption rate and its lineage as a C-style language, its syntax is familiar to many programmers. The downside is that Java is not natively concurrent. Volumes have been written about concurrent programming in Java; however, concurrent programming is difficult to reason about within an object-oriented paradigm and so is difficult to get right.

occam -π is a general purpose process-oriented programming language. Concurrency is part of the theoretical underpinnings of the language. Concurrency is simple to reason about within an occam -π application …

High Performance Geospatial Analysis On Emerging Parallel Architectures, Seth Warn

Graduate Theses and Dissertations

Geographic information systems (GIS) are performing increasingly sophisticated analyses on growing data sets. These analyses demand high performance. At the same time, modern computing platforms increasingly derive their performance from several forms of parallelism. This dissertation explores the available parallelism in several GIS-applied algorithms: viewshed calculation, image feature transform, and feature analysis. It presents implementations of these algorithms that exploit parallel processing to reduce execution time, and analyzes the effectiveness of the implementations in their use of parallel processing.

Automating Construction And Selection Of A Neural Network Using Stochastic Optimization, Jason Lee Hurt

UNLV Theses, Dissertations, Professional Papers, and Capstones

An artificial neural network can be used to solve various statistical problems by approximating a function that provides a mapping from input to output data. No universal method exists for architecting an optimal neural network. Training one with a low error rate is often a manual process requiring the programmer to have specialized knowledge of the domain for the problem at hand.

A distributed architecture is proposed and implemented for generating a neural network capable of solving a particular problem without specialized knowledge of the problem domain. The only knowledge the application needs is a training set that the network …

Consolidated Study On Query Expansion, Abhishek Biruduraju

UNLV Theses, Dissertations, Professional Papers, and Capstones

A typical day of million web users all over the world starts with a simple query. The quest for information on a particular topic drives them to search for it, and in the pursuit of their info the terms they supply for queries varies from person to person depending on the knowledge they have. With a vast collection of documents available on the web universe it is the onus of the retrieval system to return only those documents that are relevant and satisfy the user’s search requirements. The document mismatch problem is resolved by appending extra query terms to the …

Study Of Feature Selection Algorithms For Text-Categorization, Kandarp Dave

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis will discuss feature selection algorithms for text-categorization. Feature selection algorithms are very important, as they can make-or-break a categorization engine. The feature selection algorithms that will be discussed in this thesis are Document Frequency, Information Gain, Chi Squared, Mutual Information, NGL (Ng-Goh-Low) coefficient, and GSS (Galavotti-Sebastiani-Simi) coefficient . The general idea of any feature selection algorithm is to determine importance of words using some measure that can keep informative words, and remove non-informative words, which can then help the text-categorization engine categorize a document, D , into some category, C . These feature selection methods are explained, implemented, …

On Co-Optimization Of Constrained Satisfiability Problems For Hardware Software Applications, Kunal Ganeshpure

Doctoral Dissertations 1896 - February 2014

Manufacturing technology has permitted an exponential growth in transistor count and density. However, making efficient use of the available transistors in the design has become exceedingly difficult. Standard design flow involves synthesis, verification, placement and routing followed by final tape out of the design. Due to the presence of various undesirable effects like capacitive crosstalk, supply noise, high temperatures, etc., verification/validation of the design has become a challenging problem. Therefore, having a good design convergence may not be possible within the target time, due to a need for a large number of design iterations.

Capacitive crosstalk is one of the …

Improved Algorithms For Ear-Clipping Triangulation, Bartosz Kajak

UNLV Theses, Dissertations, Professional Papers, and Capstones

We consider the problem of improving ear-slicing algorithm for triangulating a simple polygon. We propose two variations of ear-slicing technique for generating “good-quality” triangulation. The first approach is based on searching for the best triangle along the boundary. The second approach considers polygon partitioning on a pre-process before applying the ear-slicing. Experimental investigation reveals that both approaches yield better quality triangulation than the standard ear-slicing method.

Monte Carlo Simulation Of Electron-Induced Air Fluorescence Utilizing Mobile Agents: A New Paradigm For Collaborative Scientific Simulation, Christopher Daniel Walker

Dissertations

A new paradigm for utilization of mobile agents in a modular architecture for scientific simulation is demonstrated through a case study involving Monte Carlo simulation of low energy electron interactions with molecular nitrogen gas. Design and development of Monte Carlo simulations for physical systems of moderate complexity can present a seemingly overwhelming endeavor. The researcher must possess or otherwise develop a thorough understanding the physical system, create mathematical and computational models of the physical system’s components, and forge a simulation utilizing those models. While there is no single route between a collection of physical concepts and a Monte Carlo simulation …

Benchmarking Bottom-Up And Top-Down Strategies To Sparql-To-Sql Query Translation, Andrii Kashliev

Theses and Dissertations - UTB/UTPA

Many researchers have proposed using conventional relational databases to store and query large Semantic Web datasets. The most complex component of this approach is SPARQL-to-SQL query translation. Existing algorithms perform this translation using either bottom-up or top-down strategy and result in semantically equivalent but syntactically different relational queries. Do relational query optimizers always produce identical query execution plans for semantically equivalent bottom-up and top-down queries? Which of the two strategies yields faster SQL queries? To address these questions, this work studies bottom-up and top-down translations of SPARQL queries with nested optional graph patterns. This work presents: (1) A basic graph …

Intractability Of Integration And Derivative For Multivariate Polynomial And Trigonometric Function, Liang Ding

Theses and Dissertations - UTB/UTPA

We study the hardness of some basic linear operators which involve high dimension integration or derivative. For a multivariate polynomial ��(��1, ⋯ , ����) which has format ∏ ∑ ��1, we show that there is no any factor polynomial time approximation for the integration of ��(��1, ⋯ , ����) in the unit cube [0,1] �� unless P = NP. In addition to polynomials, we extend the discussion to nonlinear function. For a trigonometric function ��(��1, ⋯ , ����) of format ∏ ∑ �������� ∗ , we show that it is #P-hard to compute derivative ����(��) (��1,⋯,����) ����1⋯������ at the origin …

Partition A 3-Colorable Graph Into A Small Bipartite Subgraph And A Large Independent Set, Qing Wang

Theses and Dissertations - UTB/UTPA

Exact algorithms have made a little progress for the 3-coloring problem: improved from to since 1976. The best exact algorithm for the 3-coloring problem is by Beigel and Eppstein, and its analysis is very complicated. We study the parameterized 3-coloring problem: partitioning a 3-colorable graph into a bipartite subgraph and an independent set. Taking the size of the bipartite subgraph as the parameter k, we propose the first parameter algorithm of complexity . Our algorithm can solve the 3-coloring problem faster than the best exact algorithm for graphs with k ≤ 0.527n where n is the graph size. Our study …

A Methodology To Develop A Communication Protocol For Visualizing Simulations In A Collaborative Virtual Reality Environment, Lacey Suzanne Duckworth

Dissertations

In the technology field, simulations and collaborative virtual reality environments (CVREs) are not generally combined because it is complicated to develop large scale simulations within CVREs. The complexity of combining these two technologies in order to form a better form of visualization stems from the lack of a methodology to help derive these scalable simulations. Simulations require very complex calculations that the CVRE cannot perform as it is overloaded in calculations for the maintenance and stability of the environment itself. Since the simulation cannot be held within the CVRE, the solution is to move the simulation external to the CVRE …

Cloud Shadow Detection And Removal From Aerial Photo Mosaics Using Light Detection And Ranging (Lidar) Reflectance Images, Glover Eugene George

Dissertations

The process of creating aerial photo mosaics can be severely affected by clouds and the shadows they create. In the CZMIL project discussed in this work, the aerial survey aircraft flies below the clouds, but the shadows cast from clouds above the aircraft cause the resultant mosaic image to have sub-optimal results. Large intensity variations, caused both from the cloud shadow within a single image and the juxtaposition of areas of cloud shadow and no cloud shadow during the image stitching process, create an image that may not be as useful to the concerned research scientist. Ideally, we would like …

Narrative Analysis And Computational Model To Predict Interestingness Of Narratives, Laxman Thapa

Theses and Dissertations - UTB/UTPA

In this research, I present results demonstrating the classification of the specially generated narratives by a machine agent by listening to human subject describing the same sets of the events. These classifications are based on human ratings of interestingness for many different recountings of the same stories. The classification is performed on various features selected after analyzing the different possible feature that affect on the interestingness of narratives. The features were extracted from the surface text as well as from annotations of how each narration relates to the content of the known story. I present the annotation process and resulting …

Data Aggregation And Dissemination In Vehicular Ad-Hoc Networks, Khaled Ibrahim

Computer Science Theses & Dissertations

Vehicular Ad-Hoc Networks (VANETs) are a fast growing technology that many governments and automobile manufacturers are investing in to provide not only safer and more secure roads, but also informational and entertainment-based applications for drivers. The applications developed for VANETs can be classified into multiple categories (safety, informational, entertainment). Most VANET applications, regardless of their category, depend on having certain vehicular data(vehicular speed, X position and Y position) available. Although these applications appear to use the same vehicular data, the characteristics of this data (i.e., amount, accuracy, and update rate) will vary based on the application category. For …