Engineering Commons^™

Decaf: A New Event Detection Logic For The Purpose Of Fusing Delineated-Continuous Spatial Information, Kerry Q. Hart

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

Geospatial information fusion is the process of synthesizing information from complementary data sources located at different points in space and time. Spatial phenomena are often measured at discrete locations by sensor networks, technicians, and volunteers; yet decisions often require information about locations where direct measurements do not exist. Traditional methods assume the spatial phenomena to be either discrete or continuous, an assumption that underlies and informs all subsequent analysis. Yet certain phenomena defy this dichotomy, alternating as they move across spatial and temporal scales. Precipitation, for example, appears continuous at large scales, but it can be temporally decomposed into discrete …

Snail Algorithm For Task Allocation In Mesh Networks, Bartosz Duszel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Topic of this master's thesis is connected with task allocation algorithms and mesh networks. Author of this work has already graduated from Wroclaw, University of Technology (Poland) where during his studies he created software simulation environment for two different task allocation algorithms for mesh networks:Adaptive ScanandFrame Sliding. Those algorithms were compared by two, main parame- ters: simulation time and average mesh fulfillment (utilization level). All simulations were done in software environment which was developed specially for that research. This application was based on few, different types of objects: task (width, height, processing time), task queue (different number of tasks), task …

Approximate Techniques In Solving Optimal Camera Placement Problems, Jian Zhao, Ruriko Yoshida, Sen-Ching Samson Cheung, David Haws

Statistics Faculty Publications

While the theoretical foundation of the optimal camera placement problem has been studied for decades, its practical implementation has recently attracted significant research interest due to the increasing popularity of visual sensor networks. The most flexible formulation of finding the optimal camera placement is based on a binary integer programming (BIP) problem. Despite the flexibility, most of the resulting BIP problems are NP-hard and any such formulations of reasonable size are not amenable to exact solutions. There exists a myriad of approximate algorithms for BIP problems, but their applications, efficiency, and scalability in solving camera placement are poorly understood. Thus, …

Energy Efficiency Performance Improvements For Ant-Based Routing Algorithm In Wireless Sensor Networks, A. M. Zungeru, Kah Phooi Seng, Li-Minn Ang, W.C. Chia

Research outputs 2013

The main problem for event gathering in wireless sensor networks (WSNs) is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR) algorithm, based on the ant colony optimization (ACO) metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1) a new scheme to intelligently initialize …

Validation Of Weak Form Thermal Analysis Algorithms Supporting Thermal Signature Generation, Elton Lewis Freeman

Masters Theses

Extremization of a weak form for the continuum energy conservation principle differential equation naturally implements fluid convection and radiation as flux Robin boundary conditions associated with unsteady heat transfer. Combining a spatial semi-discretization via finite element trial space basis functions with time-accurate integration generates a totally node-based algebraic statement for computing. Closure for gray body radiation is a newly derived node-based radiosity formulation generating piecewise discontinuous solutions, while that for natural-forced-mixed convection heat transfer is extracted from the literature. Algorithm performance, mathematically predicted by asymptotic convergence theory, is subsequently validated with data obtained in 24 hour diurnal field experiments for …

Hardware Implementation Of Image Space Reconstruction Algorithm Using Fpgas, Javier Morales, Nayda Santiago, Miriam Leeser, Alejandro Fernandez

Miriam Leeser

The Image Space Reconstruction Algorithm (ISRA) has been used in hyperspectral imaging applications to monitor changes in the environment and specifically, changes in coral reef, mangrove, and sand in coastal areas. This algorithm is one of a set of iterative methods used in the hyperspectral imaging area to estimate abundance. However, ISRA is highly computational, making it difficult to obtain results in a timely manner. We present the use of specialized hardware in the implementation of this algorithm, specifically the use of VHDL and FPGAs. The implementation of ISRA algorithm has been divided into hardware and software units. The hardware …

Field Programmable Gate Arrays To Accelerate Sub-Surface Imaging Problems, Miriam Leeser

Miriam Leeser

No abstract provided.

Phase Unwrapping Using Reconfigurable Hardware, Sherman Braganza, Miriam Leeser, W. C. Warger Ii, C. M. Warner, C. A. Dimarzio

Miriam Leeser

The most computationally intensive part of the minimum LP Norm phase unwrapping algorithm[1] (its kernel) is the 2D Discrete Cosine Transform(DCT) that computes the variable p in the equation Qp=c using the Preconditioned Conjugate Gradient (PCG) method. The separability of the DCT means that the 2D transform can be decomposed into a series of 1D DCTS that compute the transforms of the rows followed by the transforms of the columns. Furthermore, the DCT can be expressed in terms of a Fast Fourier Transform (FFT), which allows the hardware implementation to use a pre-designed FFT core. This poster presents a design …

Phase Unwrapping Using Reconfigurable Hardware, Sherman Braganza, Miriam Leeser, W. C. Warger Ii, C. M. Warner, C. A. Dimarzio

Charles A. DiMarzio

The most computationally intensive part of the minimum LP Norm phase unwrapping algorithm[1] (its kernel) is the 2D Discrete Cosine Transform(DCT) that computes the variable p in the equation Qp=c using the Preconditioned Conjugate Gradient (PCG) method. The separability of the DCT means that the 2D transform can be decomposed into a series of 1D DCTS that compute the transforms of the rows followed by the transforms of the columns. Furthermore, the DCT can be expressed in terms of a Fast Fourier Transform (FFT), which allows the hardware implementation to use a pre-designed FFT core. This poster presents a design …

Fast Software Multiplication In F_2[X] For Embedded Processors, Serdar Süer Erdem

Turkish Journal of Electrical Engineering and Computer Sciences

We present a novel method for fast multiplication of polynomials over F_2 which can be implemented efficiently in embedded software. Fast polynomial multiplication methods are needed for the efficient implementation of some cryptographic and coding applications. The proposed method follows a strategy to reduce the memory accesses for input data and intermediate values during computation. This strategy speeds up the binary polynomial multiplication significantly on typical embedded processors with limited memory bandwidth. These multiplications are usually performed by the comb method or the Karatsuba-based methods in embedded software. The proposed method has speed and memory advantages over these methods on …

Towards Fast And Accurate Algorithms For Processing Fuzzy Data: Interval Computations Revisited, Gang Xiang, Vladik Kreinovich

Departmental Technical Reports (CS)

A Graph-Based Approach To Symbolic Functional Decomposition Of Finite State Machines, Piotr Szotkowski, Mariusz Rawski, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

This paper discusses the symbolic functional decomposition method for implementing finite state machines in field-programmable gate array devices. This method is a viable alternative to the presently widespread two-step approaches to the problem, which consist of separate encoding and mapping stages; the proposed method does not have a separate decomposition step instead, the state's final encoding is introduced gradually on every decomposition iteration. Along with general description of the functional symbolic decomposition method's steps, the paper discusses various algorithms implementing the method and presents an example realisation of the most interesting algorithm. In the end, the paper compares the results …

Proactive Service Migration For Long-Running Byzantine Fault-Tolerant Systems, Wenbing Zhao, H. Zhang

Electrical and Computer Engineering Faculty Publications

A proactive recovery scheme based on service migration for long-running Byzantine fault-tolerant systems is described. Proactive recovery is an essential method for ensuring the long-term reliability of fault-tolerant systems that are under continuous threats from malicious adversaries. The primary benefit of our proactive recovery scheme is a reduced vulnerability window under normal operation. This is achieved in two ways. First, the time-consuming reboot step is removed from the critical path of proactive recovery. Second, the response time and the service migration latency are continuously profiled and an optimal service migration interval is dynamically determined during runtime based on the observed …

Multi-Break Rearrangements And Breakpoint Re-Uses: From Circular To Linear Genomes, Max A. Alekseyev

Faculty Publications

Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions, fissions, and translocations, 3-break rearrangements represent a natural generalization of transpositions. Alekseyev and Pevzner (2007a, 2008a) studied multi-break rearrangements in circular genomes and further applied them to the analysis of chromosomal evolution in mammalian genomes. In this paper, we extend these results to the more difficult case of linear genomes. In particular, we give lower bounds for the rearrangement distance between linear genomes and for the breakpoint re-use rate as functions of the number and proportion …

Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …

Constellation Design Of Geosynchronous Navigation Satellites Which Maximizes Availability And Accuracy Over A Specified Region Of The Earth, Halil Ibrahim Ozdemir

Theses and Dissertations

Currently, there are four Global Navigation Satellite Systems (GNSS) either being developed or in existence-GPS, GLONASS, Compass, and Galileo. Additionally, there are several Regional Navigation Satellite Systems (RNSS) planned or in existence, as well as numerous augmentation systems (which require a GNSS for operation). It can be anticipated that there will be interest in developing additional independent regional navigation satellite systems to cover areas of interest to particular countries or regions, who want to have their own system. In this paper, a genetic algorithm is used in an effort to determine near-optimal RNSS constellations. First, a cost function is setup, …

Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley

Theses and Dissertations

There is a need to expedite the process of designing military hardware to stay ahead of the adversary. The core of this project was to build reusable, synthesizeable libraries to make this a possibility. In order to build these libraries, Matlab® commands and functions, such as Conv2, Round, Floor, Pinv, etc., had to be converted into reusable VHDL modules. These modules make up reusable libraries for the Mission Specific Process (MSP) which will support AFRL/RY. The MSP allows the VLSI design process to be completed in a mere matter of days or months using an FPGA or ASIC design, as …

Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti

Computer Science Faculty Publications

Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …

Nesting System With Quantization And Knowledge Base Applied, Leszek Koszalka, Grzegorz Chmaj

Electrical & Computer Engineering Faculty Research

Nesting algorithms deal with placing two dimensional shapes on the given canvas. In this paper a binary way of solving the nesting problem is proposed. Geometric shapes are quantized into binary form, which is used to operate on them. After finishing nesting they are converted back into original geometrical form. Investigations showed, that there is a big influence of quantization accuracy for the nesting effect. However, greater accuracy results with longer time of computation. The proposed knowledge base system is able to strongly reduce the computational time.

Multivariate Discretization Of Continuous Valued Attributes., Ehab Ahmed El Sayed Ahmed 1978-

Electronic Theses and Dissertations

The area of Knowledge discovery and data mining is growing rapidly. Feature Discretization is a crucial issue in Knowledge Discovery in Databases (KDD), or Data Mining because most data sets used in real world applications have features with continuously values. Discretization is performed as a preprocessing step of the data mining to make data mining techniques useful for these data sets. This thesis addresses discretization issue by proposing a multivariate discretization (MVD) algorithm. It begins withal number of common discretization algorithms like Equal width discretization, Equal frequency discretization, Naïve; Entropy based discretization, Chi square discretization, and orthogonal hyper planes. After …

Integrated Coverage And Connectivity Configuration For Energy Conservation In Sensor Networks, Guoliang Xing, Xiaorui Wang, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill

All Computer Science and Engineering Research

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Fur-thermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs …

Web Mining For Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis

Magdalini Eirinaki

Web personalization is the process of customizing a Web site to the needs of specific users, taking advantage of the knowledge acquired from the analysis of the user's navigational behavior (usage data) in correlation with other information collected in the Web context, namely, structure, content, and user profile data. Due to the explosive growth of the Web, the domain of Web personalization has gained great momentum both in the research and commercial areas. In this article we present a survey of the use of Web mining for Web personalization. More specifically, we introduce the modules that comprise a Web personalization …

Performance Analysis Of A Dynamic Bandwidth Allocation Algorithm In A Circuit-Switched Communications Network, Timothy M. Schwamb

Theses and Dissertations

Military communications networks typically employ a gateway multiplexer to aggregate all communications traffic onto a single link. These multiplexers typically use a static bandwidth allocation method via time-division multiplexing (TDM). Inefficiencies occur when a high-bandwidth circuit, e.g., a video teleconferencing circuit, is relatively inactive rendering a considerable portion of the aggregate bandwidth wasted while inactive. Dynamic bandwidth allocation (DBA) reclaims unused bandwidth from circuits with low utilization and reallocates it to circuits with higher utilization without adversely affecting queuing delay. The proposed DBA algorithm developed here measures instantaneous utilization by counting frames arriving during the transmission time of a single …

A Reconfigurable Superscalar Architecture, Christopher B. Mayer

Theses and Dissertations

The invention of the Field Programmable Gate Array (FPGA) has led to a number of interesting developments. One is the idea of providing custom hardware support for applications running on a computer. These reconfigurable computers have been shown to decrease the execution time for some applications. Based on past results, attention has subsequently turned to using reconfigurable computing in general-purpose computers (e.g. desktop and workstation environments). This thesis develops a design for just such a computer. The design, FPGADLX, is based on a hypothetical superscalar computer running the DLX instruction set and is generic enough in principle to be adapted …

Fpga Processor Implementation For The Forward Kinematics Of The Umdh, Steven M. Parmley

Theses and Dissertations

The focus of this research was on the implementation of a forward kinematic algorithm for the Utah MIT Dexterous Hand (UMDH). Specifically, the algorithm was synthesized from mathematical models onto a Field Programmable Gate Array (FPGA) processor. This approach is different from the classical, general purpose microprocessor design where all robotic controller functions including forward Kinematics are executed serially from a compiled programming language such as C. The compiled code and subsequent real time operating system must be stored on some form of nonvolatile memory, typically magnetic media such as a fixed or hard disk drive, along with other computer …

A Mammographic Registration Method Based On Optical Flow And Multiresolution Computing, Kevin A. Lee

Theses and Dissertations

Mammography is a potent weapon in the fight against Breast Cancer, due in large part to its widespread availability and low cost. Despite the fact that mammography can detect small lesions as early as two years before they become palpable on physical exam, between 10 and 30 percent of cancerous lesions go undetected during evaluation by the radiologist. One approach to improving detection rates involves comparing mammograms of the same breast from successive years. Since most forms of breast cancer develop slowly, multiple view techniques might be able to detect subtle changes indicative of cancerous growth. This thesis proposes a …

Modeling And Simulation Support For Parallel Algorithms In A High-Speed Network, Dustin E. Yates

Theses and Dissertations

This thesis investigates the ability of a simulation model to compare and contrast parallel processing algorithms in a high-speed network. The model extends existing modeling, analysis, and comparison of parallel algorithms by providing graphics based components that facilitate the measurement of system resources. Simulation components are based on the Myrinet local area network standard. The models provide seven different topologies to contrast the performance of five variations of Fast Fourier Transform (FFT) algorithms. Furthermore, the models were implemented using a commercially developed product that facilitates the testing of additional topologies and the investigation of hardware variations. Accurate comparisons are statistically …

Implementation Of Inversion Algorithms In Reconfigurable Systolic Arrays, Haritini E. Andre

Retrospective Theses and Dissertations

Reducing the computing time of the matrix inversion has been a concern of many authors. The use of Systolic architectures containing orthogonally connected processing elements capable of few instructions multiple data have allowed for new algorithms to be implemented. Two algorithms are examined that rely on the triangularization methods for matrix inversion. One can be applied to the general non-singular matrix and the other to the symmetric matrix. The throughput in both implementation is revolutionized. The speed improvement over Liu and Young’s implementation of the symmetric matrix inversion is by a factor of three.

The throughput in both implementation is …