Contemporary database systems are used in a variety of business applications requiring rapid retrieval of online data. When records contain unique information indexed by a single key, the retrieval operation can be simplified. However, when added generality and flexibility is needed, inverted files and sophisticated data models result in a...
During the past year the rapid increase in the cost of copper and aluminum has led operating companies to investigate the feasibility of using iron and steel conductors for transmission and distribution purposes where small blocks of power are to be served. This Thesis gives the results of tests on...
ELGDF (Extended Large Grain Data Flow) is a design language that allows representation of a wide variety of parallel programs. The syntax is graphical and hierarchical to allow construction and viewing of realistically sized programs. ELGDF language facilitates describing parallel programs in a natural way for both shared memory model...
New parallel algorithms for solving the decomposed linear programs are developed. Direct parallelization of the sequential algorithm results in very limited performance improvement using multiple processors. By redesigning the algorithm, we achieved more than 2*P times performance improvement over the sequential algorithm, where P is the number of processors used...
A denotational semantics is presented for a language that includes multiple-valued functions (essentially Lisp S-expressions), which map from ground values into the power domain of ground values. The domain equations are reflexive. and fixed points of all functions are defined. Thus, it is possible to specify an operating system as...
The WEPP (Water Erosion Prediction Project) application computes soil loss and sediment yield from a field based on the data on crops, management practices, and operations. In order to make WEPP, which is a Windows-based application, easily accessible, Web WEPP (Web-based WEPP) was developed by our research group.
Web WEPP...
We demonstrate an approach to transform keyword queries automatically into queries that combine keywords appropriately by boolean operations, such as and and or. Most current search engines will preprocess the queries before they really use these queries to search locally stored files or web pages. However, the search engines usually...