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

Engineering Commons™

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

2008

Algorithms

Discipline
Institution
Publication
Publication Type

Articles 1 - 13 of 13

Full-Text Articles in Engineering

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

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 …

Go to article

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

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 …

Go to article

Reconstruction Of Dispersive Dielectric Properties For Pcb Substrates Using A Genetic Algorithm, Jianmin Zhang, Marina Koledintseva, James L. Drewniak, David Pommerenke, Richard E. Dubroff, Zhiping Yang, Wheling Cheng, Konstantin Rozanov, Antonio Orlandi, Giulio Antonini Aug 2008

Reconstruction Of Dispersive Dielectric Properties For Pcb Substrates Using A Genetic Algorithm, Jianmin Zhang, Marina Koledintseva, James L. Drewniak, David Pommerenke, Richard E. Dubroff, Zhiping Yang, Wheling Cheng, Konstantin Rozanov, Antonio Orlandi, Giulio Antonini

Electrical and Computer Engineering Faculty Research & Creative Works

An effective method for extracting parameters of a Debye or a Lorentzian dispersive medium over a wideband frequency range using a genetic algorithm (GA) and a transmission-line model is presented. Scattering parameters (S-parameters) of the transmission-line sections, including a parallel plate, microstrip, and stripline, are measured. Wave equations for TEM/quasi-TEM mode with a complex propagation constant and a frequency-dependent wave impedance are used to evaluate the corresponding S-parameters in an analytical model. The discrepancy between the modeled and measured S-parameters is defined as the objective function in the GA. The GA is used for search of the dispersive-medium parameters by …

Go to article

Multi-Objective Optimization Of Mixed-Variable, Stochastic Systems Using Single-Objective Formulations, Todd J. Paciencia Mar 2008

Multi-Objective Optimization Of Mixed-Variable, Stochastic Systems Using Single-Objective Formulations, Todd J. Paciencia

Theses and Dissertations

Many problems exist where one desires to optimize systems with multiple, often competing, objectives. Further, these problems may not have a closed form representation, and may also have stochastic responses. Recently, a method expanded mixed variable generalized pattern search/ranking and selection (MVPS-RS) and Mesh Adaptive Direct Search (MADS) developed for single-objective, stochastic problems to the multi-objective case by using aspiration and reservation levels. However, the success of this method in approximating the true Pareto solution set can be dependent upon several factors. These factors include the experimental design and ranges of the aspiration and reservation levels, and the approximation quality …

Go to article

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

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

Go to article

In Vivo Ultrasonic Attenuation Slope Estimates For Detecting Cervical Ripening In Rats: Preliminary Results, Timothy A. Bigelow, Barbara L. Mcfarlin, William D. O'Brien Jr., Michael L. Oelze Mar 2008

In Vivo Ultrasonic Attenuation Slope Estimates For Detecting Cervical Ripening In Rats: Preliminary Results, Timothy A. Bigelow, Barbara L. Mcfarlin, William D. O'Brien Jr., Michael L. Oelze

Timothy A. Bigelow

To effectively postpone preterm birth, cervical ripening needs to be detected and delayed. As the cervix ripens, the spacing between the collagen fibers increases and fills with water, hyaluronan, decorin, and enzymes suggesting that the ultrasonic attenuation of the cervix should decrease. The decrease in ultrasonic attenuation may be detectable, leading to an effective means of detecting cervical ripening. Herein, the traditional attenuation slope-estimation algorithm based on measuring the downshift in center frequency of the ultrasonic backscattered signal with propagation depth was modified and applied to the cervix of rats. The modified algorithm was verified using computer simulations and an …

Go to article

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

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 …

Go to article

Development And Flight Of A Robust Optical-Inertial Navigation System Using Low-Cost Sensors, Michael B. Nielsen Mar 2008

Development And Flight Of A Robust Optical-Inertial Navigation System Using Low-Cost Sensors, Michael B. Nielsen

Theses and Dissertations

This research develops and tests a precision navigation algorithm fusing optical and inertial measurements of unknown objects at unknown locations. It provides an alternative to the Global Positioning System (GPS) as a precision navigation source, enabling passive and low-cost navigation in situations where GPS is denied/unavailable. This paper describes two new contributions. First, a rigorous study of the fundamental nature of optical/inertial navigation is accomplished by examining the observability grammian of the underlying measurement equations. This analysis yields a set of design principles guiding the development of optical/inertial navigation algorithms. The second contribution of this research is the development and …

Go to article

Characterization And Implementation Of A Real-World Target Tracking Algorithm On Field Programmable Gate Arrays With Kalman Filter Test Case, Benjamin D. Hancey Mar 2008

Characterization And Implementation Of A Real-World Target Tracking Algorithm On Field Programmable Gate Arrays With Kalman Filter Test Case, Benjamin D. Hancey

Theses and Dissertations

A one dimensional Kalman Filter algorithm provided in Matlab is used as the basis for a Very High Speed Integrated Circuit Hardware Description Language (VHDL) model. The JAVA programming language is used to create the VHDL code that describes the Kalman filter in hardware which allows for maximum flexibility. A one-dimensional behavioral model of the Kalman Filter is described, as well as a one-dimensional and synthesizable register transfer level (RTL) model with optimizations for speed, area, and power. These optimizations are achieved by a focus on parallelization as well as careful Kalman filter sub-module algorithm selection. Newton-Raphson reciprocal is the …

Go to article

An Investigation Of Block Searching Algorithms For Video Frame Codecs, Jerome Casey Jan 2008

An Investigation Of Block Searching Algorithms For Video Frame Codecs, Jerome Casey

Other Resources

Block matching is the most computationally demanding aspect of the video encoding process. In many applications real-time video encoding is desired and therefore it is important that the encoding is fast. Also where handheld devices such as a PDA or mobile phone are concerned a less computationally intensive algorithm means a simpler processor can be used which saves on hardware costs and also extends battery life. An optimised algorithm also allows these devices to be used in low bandwidth wireless networks. The challenge is to decrease the computational load on the system without compromising the quality of the video stream …

Go to article

Improved And Generalized Learning Strategies For Dynamically Fast And Statistically Robust Evolutionary Algorithms, Yogesh Dashora, Sanjeev Kumar, Nagesh Shukla, M K. Tiwari Jan 2008

Improved And Generalized Learning Strategies For Dynamically Fast And Statistically Robust Evolutionary Algorithms, Yogesh Dashora, Sanjeev Kumar, Nagesh Shukla, M K. Tiwari

Faculty of Engineering - Papers (Archive)

This paper characterizes general optimization problems into four categories based on the solution representation schemes, as they have been the key to the design of various evolutionary algorithms (EAs). Four EAs have been designed for different formulations with the aim of utilizing similar and generalized strategies for all of them. Several modifications to the existing EAs have been proposed and studied. First, a new tradeoff function-based mutation has been proposed that takes advantages of Cauchy, Gaussian, random as well as chaotic mutations. In addition, a generalized learning rule has also been proposed to ensure more thorough and explorative search. A …

Go to article

Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.) Jan 2008

Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)

Electrical & Computer Engineering Faculty Publications

Automatic vegetation identification plays an important role in many applications including remote sensing and high performance flight simulations. This paper presents a method to automatically identify vegetation based upon satellite imagery. First, we utilize the ISODATA algorithm to cluster pixels in the images where the number of clusters is determined by the algorithm. We then apply morphological operations to the clustered images to smooth the boundaries between clusters and to fill holes inside clusters. After that, we compute six features for each cluster. These six features then go through a feature selection algorithm and three of them are determined to …

Go to article

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

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

Go to article