It is shown that the linear complementarity problem of finding an n-by-1 vector x such that Mx + q > 0, x > 0, and xT(Mx+q) = 0, where M is a given n-by-n real matrix and q is a given n-by-l vector, is solvable if and ...

User manual for the meta-symbolic simulation system that includes a behavioral simulation programming language that models, generates and manipulates events in the notation of a semantic network that changes through time, ...

We consider the complexity of several standard problems for various classes of Petri nets. In particular, the reachability problem, the liveness problem and the k-boundedness problems are analyzed. Some polynomial time ...

In this paper a new particle approach to the study of fluid dynamics is applied to the generation of ocean waves by earthquakes. Major interest is centered on a molecular type compression wave as the key mechanism for ...

The address range of mini-computers purchased two to three years ago was typically 32K words. Many owners of these computers are realizing that this is no longer adequate for their application. Various methods of extending ...

A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear complementarity problem: Mx + q > 0, x > 0, xT(Mx+q) = 0, where M is a given nxn symmetric real matrix and q is a given nxl ...

The purpose of this report is to present a new class of sufficient optimality conditions for pure and mixed integer programming problems. Some of the sets of sufficient conditions presented can be thought of a generalizations ...

A new particle approach for the study of solids is developed. The basic forces included are gravity and interparticle attraction and repulsion. Triangular and rectangular bodies are generated on the UNIVAC 1110 and various ...