Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
Articles 1 - 7 of 7
Full-Text Articles in Engineering
Multi-Break Rearrangements And Breakpoint Re-Uses: From Circular To Linear Genomes, Max A. Alekseyev
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
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 …
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
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 …
An Investigation Of Block Searching Algorithms For Video Frame Codecs, Jerome Casey
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 …
Improved And Generalized Learning Strategies For Dynamically Fast And Statistically Robust Evolutionary Algorithms, Yogesh Dashora, Sanjeev Kumar, Nagesh Shukla, M K. Tiwari
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 …
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
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. …
Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)
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 …