Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary instance of SNMF provides superior clustering quality compared to many classic clustering algorithms on a variety of synthetic and real world data sets. In this w...

Parallel algorithms are often rst designed as a sequence of rounds where each round includes any number of independent constant time operations This so called work time presentation is then followed by a processor scheduling implementation on a more concrete computational model Many parallel algorithms are geometric decaying in the sense that the sequence of work loads is upper bounded by a dec...

Transitioning from a simulation environment to real flight can be costly for MAV system and algorithm designers as they wrestle with the challenges and unpredictability of the real world. This transition often involves problems that can result in hardware damage or possibly injury. We have developed a system that cost-effectively addresses these problems. The system creates a virtual cage in wh...

The graph theory [1], traditionally covered in Discrete Mathematics and Algorithms courses [2, 3], introduces students to the modeling of various types of relations between entities in technical, physical, chemical, biological, and social systems and their complex dynamics. Graph representations are widely used in computer science (analyses of the flow of computation, data communication in netw...

An evolution equation for a population of strings evolving under the genetic operators: selection, mutation and crossover is derived. The corresponding equation describing the evolution of schematas is found by performing an exact coarse graining of this equation. In particular exact expressions for schemata reconstruction are derived which allows for a critical appraisal of the “building-block...

Despite recent developments in protein structure prediction, an accurate new fold prediction algorithm remains elusive. One of the challenges facing current techniques is the size and complexity of the space containing possible structures for a query sequence. Traditionally, to explore this space fragment assembly approaches to new fold prediction have used stochastic optimization techniques. H...

A set of coefficient selection rules is proposed for efficiently determining the effective DCT watermarking coefficients of an image for JPEG attack. These rules are simple in computation but they are derived from the theoretically optimized data set with the aid of the parametric classifiers. They improve the watermark robustness (correctly decoding) and, in the mean time, decrease the error d...

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...