Although it is possible to directly solve an entire flow-acoustics problem in one computation, this approach remains prohibitively large in terms of the computational resource required for most practical applications. Aeroacoustic problems are therefore usually split into two parts; one consisting of the source computation and one of the source propagation. Although both these parts entail grea...

Abstract The Lagrangian vortex particle method for two-dimensional flow simulation around airfoils is considered. Generally, the most time-consuming operation in particles interaction simulation, especially if it performed directly “point-to-point” all pairs of particles. result such convective velocities. This problem similar to N-body and has squared computational complexity O(N 2 ). only eff...

Programmable force fields have been used as an abstraction to represent a whole new class of devices that have been proposed for part manipulation. The general idea behind these devices is that a force field is implemented in a plane upon which the part is placed. The forces and torques exerted on the contact surface of the part translate and rotate the part. Manipulation plans for these device...

We explore a simple mathematical model of network computation, based on Markov chains. Similar models apply to a broad range of computational phenomena, arising in networks of computers, as well as in genetic, and neural nets, in social networks, and so on. The main problem of interaction with such spontaneously evolving computational systems is that the data are not uniformly structured. An in...

The fast rendering of complex scenes IS a fundamental problem in imaging systems. Imprecise computation is a two level scheme for executing screen update tasks . The full level specifies the maximum computation requirement of a rendering task while the reduced level specifies the minimum computation requirement which will render a region imprecisely but acceptably. Load sharing is a task alloca...

| Underlying recognition is an organization of objects and their parts into classes and hierarchies. A representation of parts for recognition requires that they be invariant to rigid transformations, robust in the presence of occlusions, stable with changes in viewing geometry, and be arranged in a hierarchy. These constraints are captured in a general framework using notions of a part-line an...

The computation of the basis inverse is the most time-consuming step in simplex type algorithms. This inverse does not have to be computed from scratch at any iteration, but updating schemes can be applied to accelerate this calculation. In this paper, we perform a computational comparison in which the basis inverse is computed with five different updating schemes. Then, we propose a parallel i...