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

Digital Commons Network

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

Articles 1 - 8 of 8

Full-Text Articles in Entire DC Network

Safe Stratified Datalog With Integer Order Programs, Peter Revesz Sep 1995

Safe Stratified Datalog With Integer Order Programs, Peter Revesz

CSE Conference and Workshop Papers

Guaranteeing termination of programs on all valid inputs is important for database applications. Termination cannot be guaranteed in Stratified Datalog with integer (gap)-order programs on generalized databases because they express any Turing-computable function. This paper introduces a restriction of those programs that can express only computable queries. The restricted language has a high expressive power and a non-elementary data complexity.


Restoration And Reconstruction Of Avhrr Images, Stephen E. Reichenbach, Daniel Kohler, Dennis Strelow Jul 1995

Restoration And Reconstruction Of Avhrr Images, Stephen E. Reichenbach, Daniel Kohler, Dennis Strelow

School of Computing: Faculty Publications

This paper describes the design of small convolution kernels for the restoration and reconstruction of Advanced Very High Resolution Radiometer (AVHRR) images. The kernels are small enough to be implemented efficiently by convolution, yet effectively correct degradations and increase apparent resolution. The kernel derivation is based on a comprehensive, end-to-end system model that accounts for scene statistics, image acquisition blur, sampling effects, sensor noise, and postfilter reconstruction. The design maximizes image fidelity subject to explicit constraints on the spatial support and resolution of the kernel. The kernels can be designed with h e r resolution than the image to perform …


Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White Jun 1995

Accessing Earth System Science Data And Applications Through High-Bandwidth Networks, R. Vetter, M. Ali, M. Daily, J. Gabrynowic, Sunil G. Narumalani, K. Nygard, W. Perrizo, P. Ram, S. Reichenbach, G. A. Seielstad, W. White

School of Computing: Faculty Publications

In this paper, we discuss gigabit network applications enabled by "Mission to Planet Earth," an international effort to monitor the Earth as a system. We describe the design of a network architecture to support applications developed as part of this program; introduce a new component, public access resource centers (PARC9s); and discuss how PARC's would facilitate access by users outside the traditional research community. We also describe how a particular class of users, agriculture users, might to Planet Earth program and delivered in a value-added form to them by a so-called AgPARC. The suggested architecture requires the deployment of high-bandwidth …


Hga: A Hardware-Based Genetic Algorithm, Stephen D. Scott, Ashok Samal, Sharad C. Seth Jan 1995

Hga: A Hardware-Based Genetic Algorithm, Stephen D. Scott, Ashok Samal, Sharad C. Seth

CSE Conference and Workshop Papers

A genetic algorithm (GA) is a robust problem-solving method based on natural selection. Hardware's speed advantage and its ability to parallelize offer great rewards to genetic algorithms. Speedups of 1-3 orders of magnitude have been observed when frequently used software routines were implemented in hardware by way of reprogrammable field-programmable gate arrays (FPGAs). Reprogrammability is essential in a general-purpose GA engine because certain GA modules require changeability (e.g. the function to be optimized by the GA). Thus a hardware-based GA is both feasible and desirable. A fully functional hardware-based genetic algorithm (the HGA) is presented here as a proof-of-concept system. …


A System For Recognizing A Large Class Of Engineering Drawings, Yuhong Yu, Ashok Samal, Sharad C. Seth Jan 1995

A System For Recognizing A Large Class Of Engineering Drawings, Yuhong Yu, Ashok Samal, Sharad C. Seth

CSE Conference and Workshop Papers

We present a complete system for recognizing a large class of symbolic engineering drawings that includes flowcharts, chemical plant diagrams, and logic & electrical circuits. The output of the system, a netlist identifying the symbol types and interconnections, may be used for design verification or as a compact portable representation of the drawing. The automatic recognition task is done in two stages: (1) domain-independent rules segment symbols from connection lines in the preprocessed drawing image and (2) an understanding subsystem makes use of a set of domain-specific matchers to classify symbols and correct errors automatically. A graphical user interface is …


Parallel Test Generation With Low Communication Overhead, Sivaramakrishnan Venkatraman, Sharad C. Seth, Prathima Agrawal Jan 1995

Parallel Test Generation With Low Communication Overhead, Sivaramakrishnan Venkatraman, Sharad C. Seth, Prathima Agrawal

CSE Conference and Workshop Papers

In this paper we present a method of parallelizing test generation for combinational logic using boolean satisfiability. We propose a dynamic search-space allocation strategy to split work between the available processors. This strategy is easy to implement with a greedy heuristic and is economical in its demand for inter-processor communication. We derive an analytical model to predict the performance of the parallel versus sequential implementations. The effectiveness of our method and analysis is demonstrated by an implementation on a Sequent (shared memory) multiprocessor. The experimental data shows significant performance improvement in parallel implementation, validates our analytical model, and allows predictions …


A Trainable, Single-Pass Algorithm For Column Segmentation, Son Sylwester, Sharad C. Seth Jan 1995

A Trainable, Single-Pass Algorithm For Column Segmentation, Son Sylwester, Sharad C. Seth

CSE Conference and Workshop Papers

Column Segmentation logically precedes OCR in the document analysis process. The trainable algorithm described here, XYCUT, relies on horizontal and vertical binary profiles to produce an XY- tree representing the column structure of a page of a technical document in a single pass through the bit image. Training against ground truth adjusts a single, resolution independent, parameter using only local information and guided by an edit distance function. The algorithm correctly segments the page image for a (fairly) wide range of parameter values, although small, local and repairable errors may be made, an effect measured by a repair cost function.


A Comprehensive, Automated Approach To Determining Sea Ice Thickness From Sar Data, Donna Haverkamp, Leen-Kiat Soh, Costas Tsatsoulis Jan 1995

A Comprehensive, Automated Approach To Determining Sea Ice Thickness From Sar Data, Donna Haverkamp, Leen-Kiat Soh, Costas Tsatsoulis

School of Computing: Faculty Publications

This paper documents an approach to sea ice classification through a combination of methods, both algorithmic and heuristic. The resulting system is a comprehensive technique, which uses dynamic local thresholding as a classification basis and then supplements that initial classification using heuristic geophysical knowledge organized in expert systems. The dynamic local thresholding method allows separation of the ice into thickness classes based on local intensity distributions. Because it utilizes the data within each image, it can adapt to varying ice thickness intensities to regional and seasonal charges and is not subject to limitations caused by using predefined parameters.