Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 25 of 25

Full-Text Articles in Engineering

Comparative Analysis Of Fullstack Development Technologies: Frontend, Backend And Database, Qozeem Odeniran Jan 2023

Comparative Analysis Of Fullstack Development Technologies: Frontend, Backend And Database, Qozeem Odeniran

Electronic Theses and Dissertations

Accessing websites with various devices has brought changes in the field of application development. The choice of cross-platform, reusable frameworks is very crucial in this era. This thesis embarks in the evaluation of front-end, back-end, and database technologies to address the status quo. Study-a explores front-end development, focusing on angular.js and react.js. Using these frameworks, comparative web applications were created and evaluated locally. Important insights were obtained through benchmark tests, lighthouse metrics, and architectural evaluations. React.js proves to be a performance leader in spite of the possible influence of a virtual machine, opening the door for additional research. Study b …


Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector Apr 2022

Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector

LSU Doctoral Dissertations

In recent years, the study of autonomous entities such as unmanned vehicles has begun to revolutionize both military and civilian devices. One important research focus of autonomous entities has been coordination problems for autonomous robot swarms. Traditionally, robot models are used for algorithms that account for the minimum specifications needed to operate the swarm. However, these theoretical models also gloss over important practical details. Some of these details, such as time, have been considered before (as epochs of execution). In this dissertation, we examine these details in the context of several problems and introduce new performance measures to capture practical …


Changing The Focus: Worker-Centric Optimization In Human-In-The-Loop Computations, Mohammadreza Esfandiari Aug 2020

Changing The Focus: Worker-Centric Optimization In Human-In-The-Loop Computations, Mohammadreza Esfandiari

Dissertations

A myriad of emerging applications from simple to complex ones involve human cognizance in the computation loop. Using the wisdom of human workers, researchers have solved a variety of problems, termed as “micro-tasks” such as, captcha recognition, sentiment analysis, image categorization, query processing, as well as “complex tasks” that are often collaborative, such as, classifying craters on planetary surfaces, discovering new galaxies (Galaxyzoo), performing text translation. The current view of “humans-in-the-loop” tends to see humans as machines, robots, or low-level agents used or exploited in the service of broader computation goals. This dissertation is developed to shift the focus back …


Algorithmic Robot Design: Label Maps, Procrustean Graphs, And The Boundary Of Non-Destructiveness, Shervin Ghasemlou Jul 2020

Algorithmic Robot Design: Label Maps, Procrustean Graphs, And The Boundary Of Non-Destructiveness, Shervin Ghasemlou

Theses and Dissertations

This dissertation is focused on the problem of algorithmic robot design. The process of designing a robot or a team of robots that can reliably accomplish a task in an environment requires several key elements. How the problem is formulated can play a big role in the design process. The ability of the model to correctly reflect the environment, the events, and different pieces of the problem is crucial. Another key element is the ability of the model to show the relationship between different designs of a single system. These two elements can enable design algorithms to navigate through the …


Exploring The Behavior Repertoire Of A Wireless Vibrationally Actuated Tensegrity Robot, Zongliang Ji Jun 2019

Exploring The Behavior Repertoire Of A Wireless Vibrationally Actuated Tensegrity Robot, Zongliang Ji

Honors Theses

Soft robotics is an emerging field of research due to its potential to explore and operate in unstructured, rugged, and dynamic environments. However, the properties that make soft robots compelling also make them difficult to robustly control. Here at Union, we developed the world’s first wireless soft tensegrity robot. The goal of my thesis is to explore effective and efficient methods to explore the diverse behavior our tensegrity robot. We will achieve that by applying state-of-art machine learning technique and a novelty search algorithm.


Algorithm For Premature Ventricular Contraction Detection From A Subcutaneous Electrocardiogram Signal, Iris Lynn Shelly Dec 2016

Algorithm For Premature Ventricular Contraction Detection From A Subcutaneous Electrocardiogram Signal, Iris Lynn Shelly

Dissertations and Theses

Cardiac arrhythmias occur when the normal pattern of electrical signals in the heart breaks down. A premature ventricular contraction (PVC) is a common type of arrhythmia that occurs when a heartbeat originates from an ectopic focus within the ventricles rather than from the sinus node in the right atrium. This and other arrhythmias are often diagnosed with the help of an electrocardiogram, or ECG, which records the electrical activity of the heart using electrodes placed on the skin. In an ECG signal, a PVC is characterized by both timing and morphological differences from a normal sinus beat.

An implantable cardiac …


Evaluation Of Data-Path Topologies For Self-Timed Conditional Statements, Navaneeth Prasannakumar Jamadagni Aug 2015

Evaluation Of Data-Path Topologies For Self-Timed Conditional Statements, Navaneeth Prasannakumar Jamadagni

Dissertations and Theses

This research presents a methodology to evaluate data path topologies that implement a conditional statement for an average-case performance that is better than the worst-case performance. A conditional statement executes one of many alternatives depending on how Boolean conditions evaluate to true or false. Alternatives with simple computations take less time to execute. The self-timed designs can exploit the faster executing alternatives and provide an average-case behavior, where the average depends on the frequency of simple and complex computations, and the difference in the completion times of simple and complex computations. The frequency of simple and complex computations depends on …


Modeling User Transportation Patterns Using Mobile Devices, Erfan Davami Jan 2015

Modeling User Transportation Patterns Using Mobile Devices, Erfan Davami

Electronic Theses and Dissertations

Participatory sensing frameworks use humans and their computing devices as a large mobile sensing network. Dramatic accessibility and affordability have turned mobile devices (smartphone and tablet computers) into the most popular computational machines in the world, exceeding laptops. By the end of 2013, more than 1.5 billion people on earth will have a smartphone. Increased coverage and higher speeds of cellular networks have given these devices the power to constantly stream large amounts of data. Most mobile devices are equipped with advanced sensors such as GPS, cameras, and microphones. This expansion of smartphone numbers and power has created a sensing …


Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev Feb 2014

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …


Computational Methods For Comparative Non-Coding Rna Analysis: From Structural Motif Identification To Genome-Wide Functional Classification, Cuncong Zhong Jan 2013

Computational Methods For Comparative Non-Coding Rna Analysis: From Structural Motif Identification To Genome-Wide Functional Classification, Cuncong Zhong

Electronic Theses and Dissertations

Recent advances in biological research point out that many ribonucleic acids (RNAs) are transcribed from the genome to perform a variety of cellular functions, rather than merely acting as information carriers for protein synthesis. These RNAs are usually referred to as the non-coding RNAs (ncRNAs). The versatile regulation mechanisms and functionalities of the ncRNAs contribute to the amazing complexity of the biological system. The ncRNAs perform their biological functions by folding into specific structures. In this case, the comparative study of the ncRNA structures is key to the inference of their molecular and cellular functions. We are especially interested in …


Quasinovo: Algorithms For De Novo Peptide Sequencing, James Paul Cleveland Jan 2013

Quasinovo: Algorithms For De Novo Peptide Sequencing, James Paul Cleveland

Theses and Dissertations

High-throughput proteomics analysis involves the rapid identification and characterization of large sets of proteins in complex biological samples. Tandem mass spectrometry (MS/MS) has become the leading approach for the experimental identification of proteins. Accurate analysis of the data produced is a computationally challenging process that relies on a complex understanding of molecular dynamics, signal processing, and pattern classification. In this work we address these modeling and classification problems, and introduce an additional data-driven evolutionary information source into the analysis pipeline.

The particular problem being solved is peptide sequencing via MS/MS. The objective in solving this problem is to decipher the …


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

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 …


Algorithms For Community Identification In Complex Networks, Mahadevan Vasudevan Jan 2012

Algorithms For Community Identification In Complex Networks, Mahadevan Vasudevan

Electronic Theses and Dissertations

First and foremost, I would like to extend my deepest gratitude to my advisor, Professor Narsingh Deo, for his excellent guidance and encouragement, and also for introducing me to this wonderful science of complex networks. Without his support this dissertation would not have been possible. I would also like to thank the members of my research committee, professors Charles Hughes, Ratan Guha, Mainak Chatterjee and Yue Zhao for their advice and guidance during the entire process. I am indebted to the faculty and the staff of the Department of Electrical Engineering and Computer Science for providing me the resources and …


Blind Deconvolution Through Polarization Diversity Of Long Exposure Imagery, Steven P. James Mar 2009

Blind Deconvolution Through Polarization Diversity Of Long Exposure Imagery, Steven P. James

Theses and Dissertations

The purpose of the algorithm developed in this thesis was to create a post processing method that could resolve objects at low signal levels using polarization diversity and no knowledge of the atmospheric seeing conditions. The process uses a two-channel system, one unpolarized image and one linearly polarized image, in a GEM algorithm to reconstruct the object. Previous work done by Strong showed that a two-channel system using polarization diversity on short exposure imagery could produce images up to twice the diffraction limit. In this research, long exposure images were simulated and a simple Kolmogorov model used. This allowed for …


Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso Jan 2009

Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso

Electronic Theses and Dissertations

Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other entities. The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in . A defensive alliance in a graph G = (V, E) is a non empty set S ⊆ V where, for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. Consequently, every vertex that is a member of a defensive alliance has at least as many vertices defending it as there are vertices attacking it. Alliances can …


Multiframe Shift Estimation, Stephen A. Bruckart Mar 2006

Multiframe Shift Estimation, Stephen A. Bruckart

Theses and Dissertations

The purpose of this research was to develop a fundamental framework for a new approach to multiframe translational shift estimation in image processing. This thesis sought to create a new multiframe shift estimator, to theoretically prove and experimentally test key properties of it, and to quantify its performance according to several metrics. The new estimator was modeled successfully and was proven to be an unbiased estimator under certain common image noise conditions. Furthermore its performance was shown to be superior to the cross correlation shift estimator, a robust estimator widely used in similar image processing cases, according to several criteria. …


Dynamic Shared State Maintenance In Distributed Virtual Environments, Felix George Hamza-Lup Jan 2004

Dynamic Shared State Maintenance In Distributed Virtual Environments, Felix George Hamza-Lup

Electronic Theses and Dissertations

Advances in computer networks and rendering systems facilitate the creation of distributed collaborative environments in which the distribution of information at remote locations allows efficient communication. Particularly challenging are distributed interactive Virtual Environments (VE) that allow knowledge sharing through 3D information. In a distributed interactive VE the dynamic shared state represents the changing information that multiple machines must maintain about the shared virtual components. One of the challenges in such environments is maintaining a consistent view of the dynamic shared state in the presence of inevitable network latency and jitter. A consistent view of the shared scene will significantly increase …


Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra Mar 2002

Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra

Theses and Dissertations

The most recent research involved registering images in the presence of translations and rotations using one iteration of the redundant discrete wavelet transform. We extend this work by creating a new multiscale transform to register two images with translation or rotation differences, independent of scale differences between the images. Our two-dimensional multiscale transform uses an innovative combination of lowpass filtering and the continuous wavelet transform to mimic the two-dimensional redundant discrete wavelet transform. This allows us to obtain multiple subbands at various scales while maintaining the desirable properties of the redundant discrete wavelet transform. Whereas the discrete wavelet transform produces …


Automatic Target Cueing Of Hyperspectral Image Data, Terry A. Wilson Sep 1998

Automatic Target Cueing Of Hyperspectral Image Data, Terry A. Wilson

Theses and Dissertations

Modern imaging sensors produce vast amounts data, overwhelming human analysts. One such sensor is the Airborne Visible and Infrared Imaging Spectrometer (AVIRIS) hyperspectral sensor. The AVIRIS sensor simultaneously collects data in 224 spectral bands that range from 0.4µm to 2.5µm in approximately 10nm increments, producing 224 images, each representing a single spectral band. Autonomous systems are required that can fuse "important" spectral bands and then classify regions of interest if all of this data is to be exploited. This dissertation presents a comprehensive solution that consists of a new physiologically motivated fusion algorithm and a novel Bayes optimal self-architecting classifier …


Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki Jun 1998

Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki

Theses and Dissertations

Representing speech signals such that specific characteristics of speech are included is essential in many Air Force and DoD signal processing applications. A mathematical construct called a frame is presented which captures the important time-varying characteristic of speech. Roughly speaking, frames generalize the idea of an orthogonal basis in a Hilbert space, Specific spaces applicable to speech are L2(R) and the Hardy spaces Hp(D) for p> 1 where D is the unit disk in the complex plane. Results are given for representations in the Hardy spaces involving Carleson's inequalities (and its extensions), …


Applications Of Unsupervised Clustering Algorithms To Aircraft Identification Using High Range Resolution Radar, Dzung Tri Pham Dec 1997

Applications Of Unsupervised Clustering Algorithms To Aircraft Identification Using High Range Resolution Radar, Dzung Tri Pham

Theses and Dissertations

Identification of aircraft from high range resolution (HRR) radar range profiles requires a database of information capturing the variability of the individual range profiles as a function of viewing aspect. This database can be a collection of individual signatures or a collection of average signatures distributed over the region of viewing aspect of interest. An efficient database is one which captures the intrinsic variability of the HRR signatures without either excessive redundancy typical of single-signature databases, or without the loss of information common when averaging arbitrary groups of signatures. The identification of 'natural' clustering of similar HRR signatures provides a …


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

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 …


A Single Chip Low Power Implementation Of An Asynchronous Fft Algorithm For Space Applications, Bruce W. Hunt Dec 1997

A Single Chip Low Power Implementation Of An Asynchronous Fft Algorithm For Space Applications, Bruce W. Hunt

Theses and Dissertations

A fully asynchronous fixed point FFT processor is introduced for low power space applications. The architecture is based on an algorithm developed by Suter and Stevens specifically for a low power implementation. The novelty of this architecture lies in its high localization of components and pipelining with no need to share a global memory. High throughput is attained using large numbers of small, local components working in parallel. A derivation of the algorithm from the discrete Fourier transform is presented followed by a discussion of circuit design parameters specifically, those relevant to space applications. The generic architecture is explained with …


A Numerical Study Of High-Speed Missile Configurations Using A Block- Structured Parallel Algorithm, Douglas C. Blake Dec 1993

A Numerical Study Of High-Speed Missile Configurations Using A Block- Structured Parallel Algorithm, Douglas C. Blake

Theses and Dissertations

A numerical analysis of the aerodynamic phenomena associated with the high-speed flight of a sharp-nosed, four-finned, high-fineness ratio missile using a block-structured, parallel computer algorithm is presented. The algorithm, PANS-3EM, utilizes a second-order-accurate, shock-capturing, Total Variation Diminishing scheme and incorporates a Baldwin-Lomax turbulence model. PANS-3EM allows for extreme flexibility in the choice of computational domain decomposition and computing machine of implementation. Developmental work consists of conceptualization and verification of the algorithm as well as parallel performance and scalability studies conducted on a variety of computing platforms. Using PANS-3EM, the aerodynamic characteristics of the missile are investigated. Drag and pitching moment …


Performance Modeling And Enhancement For The Atamm Data Flow Architecture, Sukhamoy Som Apr 1989

Performance Modeling And Enhancement For The Atamm Data Flow Architecture, Sukhamoy Som

Electrical & Computer Engineering Theses & Dissertations

Algorithm To Architecture Mapping Model (ATAMM) is a new marked graph model from which the rules for data and control flow in a homogeneous, multicomputer, data flow architecture may be defined. This research is concerned with performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in such an ATAMM defined architecture. Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of computing element requirements. Operating strategies are developed for optimum time performance and for sub-optimum time performance under limited availability of computing elements. An ATAMM simulator is used to test …