Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Entire DC Network

Devious: A Distributed Environment For Vision Tasks, Phillip R. Romig Iii, Ashok K. Samal Nov 1994

Devious: A Distributed Environment For Vision Tasks, Phillip R. Romig Iii, Ashok K. Samal

CSE Conference and Workshop Papers

We present a system for the integration of computer vision tasks in a distributed environment. This system, called DeViouS, is based on the client/server model and runs in a heterogeneous environment of Unix workstations. It takes advantage of the free cycles in modern workstation environments to distribute and speed up the execution of vision tasks.

Two primary goals of DeViouS are to provide a practical distributed system and a research environment for vision computing. DeViouS is based on a modular design that allows experimentation in various aspects of algorithm design, scheduling and network programming. It can make use of any …


Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz May 1994

Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz

CSE Conference and Workshop Papers

We describe the Constraint Object Data Model (CODM), which enhances an object-based data model with existential constraints to naturally represent partially specified information. We present the Constraint Object Query Language (COQL), a declarative, rule-based query language that can be used to infer relationships about and monotonically refine information represented in the CODM. COQL has a model-theoretic and an equivalent fixed-point semantics, based on the notions of constraint entailment and "proofs in all possible worlds." We also provide a novel polynomial-time algorithm for quantifier elimination for set-order constraints, a restricted class of set constraints that uses membership of subset-equal.


Recognizing Plants Using Stochastic L-Systems, Ashok K. Samal, Brian Peterson, David J. Holliday Jan 1994

Recognizing Plants Using Stochastic L-Systems, Ashok K. Samal, Brian Peterson, David J. Holliday

CSE Conference and Workshop Papers

Recognizing naturally occurring objects has been a difficult task in computer vision. One of the keys to recognizing objects is the development of a suitable model. One type of model, the fractal, has been used successfully to model complex natural objects. A class of fractals, the L-system, has not only been used to model natural plants, but has also aided in their recognition. This research extends the work in plant recognition using L-systems in two ways. Stochastic L-systems are used to model and generate more realistic plants. Furthermore, to handle the complexity of recognition, a learning system is used that …


Logic Simulation Using An Asynchronous Parallel Discrete-Event Simulation Model On A Simd Machine, Sharad C. Seth, Lee Gowen, Matt Payne, Don Sylwester Jan 1994

Logic Simulation Using An Asynchronous Parallel Discrete-Event Simulation Model On A Simd Machine, Sharad C. Seth, Lee Gowen, Matt Payne, Don Sylwester

CSE Conference and Workshop Papers

The Chandy-Misra-Bryant (CMB) model has been applied to logic simulation of synchronous sequential circuits using a massively parallel SIMD computer, a CM-2 Connection Machine. Several methods of reducing message traffic in a logic simulation have been adapted to the SIMD architecture of the CM-2, with the result that each method of reducing message traffic actually decreases the speed of the simulation. This suggests that communication costs required to support logic simulation are small compared to the cost of deciding which messages need not be sent.