Search
Now showing items 1-10 of 475
Autonomous storage management for low-end computing environments
(2011)
To make storage management transparent to users, enterprises rely on expensive storage infrastructure, such as high end storage appliances, tape robots, and offsite storage facilities, maintained by full-time professional ...
Krylov-secant methods for solving large-scale systems of coupled nonlinear parabolic equations
(1997)
This dissertation centers on two major aspects dictating the computational time of applications based on the solution of systems of coupled nonlinear parabolic equations: nonlinear and linear iterations. The former aspect ...
Differentiated and predictable quality of service in Web server systems
(2001)
As the World Wide Web experiences increasing commercial and mission-critical use, server systems are expected to deliver high and predictable performance. The phenomenal improvement in microprocessor speeds, coupled with ...
A framework for building pedagogic Java programming environments
(2002)
Java has become the dominant language for teaching introductory computer science at both the high school and college levels. Yet Java's development tools and syntax often distract beginning students from the programming ...
A subgradient algorithm for nonlinear integer programming and its parallel implementation
(1991)
This work concerns efficiently solving a class of nonlinear integer programming problems: min $\{f(x)$: $x \in \{0,1\}\sp{n}\}$ where $f(x)$ is a general nonlinear function. The notion of subgradient for the objective ...
Myoelectric signal recognition using genetic programming
(1995)
This thesis presents a new method of myoelectric signal recognition. Myoelectric signals are electric signals generated by the motion of a person's muscle and can be used as control input for prosthetic hands. It uses ...
Message passing versus distributed shared memory on networks of workstations
(1995)
We compared the message passing library Parallel Virtual Machine (PVM) with the distributed shared memory system TreadMarks, on networks of workstations. We presented the performance of nine applications, including Water ...
Analysis and implementation of an implicitly restarted Arnoldi iteration
(1995)
The Arnoldi algorithm, or iteration, is a computationally attractive technique for computing a few eigenvalues and associated invariant subspace of large, often sparse, matrices. The method is a generalization of the Lanczos ...
Efficient simulation of simple instruction set array processors
(1990)
Simple instruction set array processors are groups of regularly connected processors with small instruction sets and local memories. The processors are augmented by built-in communication instructions. Because of the ...
Sequential gradient-restoration algorithm for optimal control problems with general boundary conditions
(1978)
This thesis considers the numerical solution of two classes of optimal control problems, called Problem P1 and Problem P2 for easy identification.
Problem P1 involves a functional I subject to differential constraints and ...