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

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

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

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

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

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

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

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

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

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