Search
Now showing items 1-10 of 233
UPS-indel: a Universal Positioning System for Indels
(Nature, 2017-10-26)
Storing biologically equivalent indels as distinct entries in databases causes data redundancy, and misleads downstream analysis. It is thus desirable to have a unified system for identifying and representing equivalent ...
Structural Design using Cellular Automata
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2001), TR-01-02
Traditional parallel methods for structural design do not scale well. This paper discusses the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one ...
Dissipative Waves in Fluids Having Both Positive and Negative Nonlinearity
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1986), TR-86-39
The present study examines weakly dissipative, weakly nonlinear waves in which the fundamental derivative changes sign. The undisturbed state is taken to be at rest, uniform and in the vicinity of the 0 locus. The cubic ...
Design of Composite Laminates by a Genetic Algorithm with Memory
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1994), TR-94-02
This paper describes the use of a genetic algorithm with memory for the design of minimum thickness composite laminates subject to strength, buckling and ply contiguity constraints. A binary tree is used to efficiently ...
Theory of Globally Convergent Probability-one Homotopies for Non-linear Programming
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2000), TR-00-04
For many years globally convergent probability-one homotopy methods have been remarkably successful on difficult realistic engineering optimization problems,most of which were attacked by homotopy methods because other ...
Enrichment Procedures for Soft Clusters: A Statistical Test and its Applications
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2010-02-01), TR-10-02
Clusters, typically mined by modeling locality of attribute spaces, are often evaluated for their ability to demonstrate ‘enrichment’ of categorical features. A cluster enrichment procedure evaluates the membership of a ...
Solving Galerkin Approximations to Nonlinear Two-Point Boundary Value Problems by a Globally Convergent Homotopy Method
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1986), TR-86-27
The Chow-Yorke algorithm, i.e., a homotopy method that has been proved globally convergent j problems, certain classes of zero finding and nonlinear programming problems, and two-point, boundary based on shooting, finite ...
Power Saving Experiments for Large Scale Global Optimization
(Department of Computer Science, Virginia Polytechnic Institute & State University, 2009), TR-09-14
Green computing, an emerging field of research that seeks to reduce excess power consumption in high performance computing (HPC), is gaining popularity among researchers. Research in this field often relies on simulation or ...
Two Point Constraint Approximation in Structural Optimization
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1986), TR-86-21
The use of constraint approximations is recognized as a primary means of achieving computational efficiency in structural optimization. Existing approximation methods are based upon the value of the constraint function and ...
Preconditioned Iterative Methods for Homotopy Curve Tracking
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1991-05-01), TR-91-07
Homotopy algorithms are a class of methods for solving systems of nonlinear equations that are globally convergent with probability one. All homotopy algorithms are based on the construction of an appropriate homotopy map ...