Digital Commons Network^™

Real-Tv : Rtp/L3'S Visual Monitor, Richard Czop

Theses

Today many real-world activities are being monitored and controlled by some type of micro-processor based system. Emphasis is placed on manufacturing and controlling through the use of computers. The inherent nature of these real-world applications makes them difficult to control and monitor. They must be built meeting strict timing constraints and must be predictable. We need to develop simplistic, reliable, and cost effective methods for building, evaluating, monitoring and controlling these complex systems. These tools should provide the user with system insight. At the New Jersey Institute of Technology Real-Time Computing Laboratory, we are building a system that will provide …

Binary Image Decomposition And Compression Using Mathematical Morphology For Object Recognition, Venu Gopal Gogusetti

Theses

Image segmentation has been studied for several years. There are several segmentation techniques which are fast and effective but all of them are lacking the property of invariency to shift, rotation and sizing. In this study a new process is introduced which overcomes the shift, size and rotation variance and the compressed data can be used for object recognition.

Euclidean distance measurement is used in the compression process which is rotation invarient but is expensive in terms of time. Eucledean distance transformation is calculated using optimal double two scan algorithm with gray scale morphology, a new method developed by Dr. …

Dynamic Machine Scheduling, Expansion, And Control Of A Generic Workcell, Peter A. Murray

Theses

Factory automation has come a long way since the invention of the automatic flour mill. A workcell is a group of machines (robots) working together to produce a product. In the past workcells have been hard wired using methods such as Programmable Logic Controllers (PLCs). To change a part of this system would require reprogramming the entire system.

The Generic Work Cell (GWC) is a dynamic architecture which allows a workcell to be modified on the fly. The architecture enables the generation of new cells with minimal effort, and the modification of the system without reprogramming the entire system. The …

Searching For Orthogonal States Of Neural Networks, Heng Wang

Theses

Two approaches to find orthogonal states of neural network are presented in the paper. The first approach is a recursive one, it builds N orthogonal vectors based on N /2 orthogonal vectors. The second approach is a formula approach, in which orthogonal vectors can be obtained using a formula. Using these approaches, orthogonal states of neural network are found. Some properties of the neural network built on these orthogonal vectors are presented in Appendix A and some examples are given in Appendix B.

A Heuristical Method Of Corner Points Detection On An Image Boundary, Qiulin Li

Theses

A heuristics-based method of corner points detection on an image boundary is proposed and implemented. The method uses the sampled boundary distances to find all of the candidate corner points along the image boundary. Then the curvature characteristical value is used to measure the severity of curvature change of the candidate points. Those candidates whose curvature characteristical value is under some threshold are eliminated. The paper also proposed some mechanism to reduce the effect of noises on the boundary. Experiments show that it is an efficient method and it gives satisfactory results on some image boundaries.

Enforceable Interdatabase Constraints In Combining Multiple Autonomous Databases, Aidong Zhang, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Parallel Algorithms For Gray-Scale Digitized Picture Component Labeling On A Mesh-Connected Computer, Susanne E. Hambrusch, Xin He, Russ Miller

Department of Computer Science Technical Reports

No abstract provided.

Fault-Tolerant Concurrent Branch And Bound Algorithm Derived From Program Verification, Hanan Lutfiyya, Aggie Sun, Bruce M. Mcmillin

Computer Science Technical Reports

The process of showing that a program satisfies some particular properties with respect to its specification is called program verification. Axiomatic semantics is a verification method that makes assertions describing properties about the states of the program. There exists a transformation from the assertions of the verification proof of a program to executable assertions. These executable assertions may be embedded in the program to create a fault-tolerant program. While this approach has been applied to the sequential programming environment, the distributed programming environment presents special challenges. This paper focuses on applying concurrent programming axiomatic proof systems to generate executable assertions …

Exploring The Symbolic/Subsymbolic Continuum: A Case Study Of Raam, Doug Blank, Lisa Meeden, James Marshall

Computer Science Faculty Research and Scholarship

No abstract provided.

Parti Primitives For Unstructured And Block Structured Problems, Alan Sussman, Joel Saltz, Raja Das, S. Gupta, Dimitri Mavriplis, Ravi Ponnusamy

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper describes a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a 3-D unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.

Spede: A Simple Programming Environment For Distributed Execution (Users' Manual), James Gochee

Dartmouth College Undergraduate Theses

Traditional single processor computers are quickly reaching their full computational potentials. The quest for faster and faster chips have brought technology to the point where the laws of physics are hampering future gains. Significant gains in speed must therefore come from using multiple processors instead of a single processor. This technology usually represents itself in the form of a parallel computer, such as the Connection Machine Model 5. Recently however, much interest has been focused on software that organizes single processor computers to behave like a parallel computer. This is desirable for sites which have large installations of workstations, since …

Methods For Calculating Solar Position And Day Length Including Computer Programs And Subroutines, M L. Roderick

Resource management technical reports

The theory of calculating solar position is described. Using this theory, a number of computing routines are prepared in the C programming language. These routines are suitable for users who program in C, and have an ANSI compatible C compiler. These routines are fully documented, with both the underlying theory, and code particulars, and may be used as a stand alone reference. The source code has also been published in appendix B of the report.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 1, January 1992, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

A Prototype Document Image Analysis System For Technical Journals, George Nagy, Sharad C. Seth, Mahesh Viswanathan

School of Computing: Faculty Publications

Intelligent document segmentation can bring electronic browsing within the reach of most users. The authors show how this is achieved through document processing, analysis, and parsing the graphic sentence.

Grounding Via Scanning: Cooking Up Roles From Scratch, Doug Blank, Michael Gasser

Computer Science Faculty Research and Scholarship

No abstract provided.

A Case For The Use Of Application Generators In The Creation Of Software For The Hotel Industry, Peter O'Connor, Ciaran Mcdonnell

Conference papers

The article makes the case for the use of Program Generators in producing software for the Hotel and Catering Industry

Instructional Use Of Computers For Entry-Level Physical Therapy Education In The United States, Edmund M. Kosmahl

CCAC Theses and Dissertations

Little was known about the value of computer assisted instruction (CAl) for entry-level physical therapy (PT) education. Factors that affect implementation and use of CAl in entry-level PT education had not been identified. Because of this paucity of information, decision-making about the implementation and use of CAl in entry-level PT education had been hampered.

This study used mail questionnaire survey methods to find:

1. The extent of use of computer-assisted instruction (CAl) in entry-level physical therapy (PT) education.
2. The perceived value of CAl compared to more traditional instructional methods for entry-level PT education.
3. What factors affect implementation and use of CAl …

Flattening C++ Classes, Umesh Bellur, Al Villarica, Kevin Shank, Imram Bashir, Doug Lea

Center for Advanced Systems and Engineering

Inheritance with derived classes and virtual functions are key design concepts in C++. Despite this, their use can result in significant degradation of run time performance. We present a class flattening tool, which we believe will help eliminate the overhead associated with virtual functions in C++ programs. A flattener may also prove useful in the reuse, debugging, and understanding of C++ components. This report deals with the issues associated with flattening, and then presents a detailed design of such a tool.

Compiling Distribution Directives In A Fortran 90d Compiler, Zeki Bozkus, Alok Choudhary, Geoffrey C. Fox, Sanjay Ranka

Northeast Parallel Architecture Center

Data Partitioning and mapping is one of the most important steps of in writing a parallel program; especially data parallel one. Recently, Fortran D, and subsequently, High Performance Fortran (HPF) have been proposed to allow users to specify data distributions and alignments for arrays in programs. This paper presents the design of a Fortran 90D compiler that takes a Fortran 90D program as input and produces a node program + message passing calls for distributed memory machines. Specifically, we present the design of the Data Partitioning Module that processes the alignment and distribution directives and illustrate what are the important …

A Comparison Of Text And Graphics As Effective User Interfaces In A Proposed Advanced Train Control System, Kenneth A. Organes

UNF Graduate Theses and Dissertations

This study tested the effectiveness of three screen interface formats for use in a proposed on-board computer to be used as part of an advanced train control system. One of the three formats contained only graphic depictions of the data, one contained only textual representations and the third had a mixture of graphic and textual data.

Twenty-eight subjects with varying railroad experience were recruited for the experiment. They were divided into three groups, each of which was presented with a simulation using one of the three interface types. The simulations depicted possible engine, track and train conditions that might be …

Towards The Integration Of Object-Oriented Constructs Within Structured Query Language (Sql), Paul Francis Rabuck

UNF Graduate Theses and Dissertations

This paper explores the possibility of coupling SQL with a semantic data model. For this study, the primary objective was to build a working prototype of a program that allows a database designer to define data objects and their respective interrelationships using the Object-oriented Semantic Association Model (OSAM*).

The prototype isolates from the designer the low level commands (i.e., CREATE TABLE, CREATE INDEX) which comprise the SQL data definition language (DOL). Once the objects are defined by the designer, the prototype generates the relational database table definitions without the designer having to directly use the SQL DOL.

Program Maintenance And Code Reuse: Object Oriented Versus Procedure Oriented Programming, Beiramali Moradi

Theses

The purpose of this thesis is to address the problem of the increasing cost of program maintenance in the data processing world. On average, programmers today spend 60% of their time in program maintenance and that figure is increasing at an estimated rate of 1 % each year. The cost is staggering and almost every business would like to find ways of reducing maintenance costs. One way to help reduce maintenance and development costs is to improve code reusability. Both maintenance programming and code reusability are the focus of this thesis.

Today's most commonly used programming language style is procedure …

Distributed Ray Casting For High-Speed Volume Rendering, Patricia L. Brightbill

Theses and Dissertations

The volume rendering technique known as ray casting or ray tracing is notoriously slow for large volume sizes, yet provides superior images. A technique is needed to accelerate ray tracing volumes without depending on special purpose or parallel computers. The realization and improvements in distributed computing over the past two decades has motivated its use in this work. This thesis explores a technique to speedup ray casting by distributed programming. The work investigates the possibility of dividing the volume among general purpose workstations and casting rays (using Levoy's front-to-back algorithm) through each subvolume independently. The final step being the composition …

A Switch-Level Test Generation System, Kent L. Einspahr, Sharad C. Seth

School of Computing: Conference and Workshop Papers

This paper presents a switch-level test generation system for synchronous sequential circuits in which a new algorithm for switch-level test generation and an existing fault simulator are integrated. For test generation, a switch-level circuit is modeled as a logic network that correctly models all aspects of switch-level behavior. The time-frame based algorithm uses asynchronous processing within each clock phase to achieve stability in the circuit, and synchronous processing between clock phases to model the passage of time. Unlike earlier time-frame based test generators for general sequential circuits, the test generator presented uses the monotonicity of the logic network to speed …

Query Optimization In Oodb, Hwee Hwa Pang, Hongjun Lu, Beng Chin Ooi

Research Collection School Of Computing and Information Systems

In object-oriented databases, relationships are generally maintained explicitly. The partial result of a retrieved object can be used to efficiently retrieve related objects. Instead of optimizing joins as in relational database systems, pointer chasing is optimized in object-oriented database systems. Further, semantics inherent in the object-oriented database, like superclass-subclass relationships and composite-component relationships between object classes, must be realised. In this paper, we describe our initial result in query optimization in an object-oriented database system. Semantic query transformation is used to preprocess the query. semantically optimized query is then translated into a query evaluation plan which comprises method invocations that …

The Complexity Of Software Testing, J. Paul Myers Jr.

Computer Science Faculty Research

The futility of using a general-purpose metric to characterise 'the' complexity of a program has been argued to support the design of specific metrics for the different stages of the software life-cycle. An analysis of the module testing activity is performed, providing evidence of the absurdity of all-purpose metrics, as well as a methodical means with which to measure testing complexity. Several standard metrics are seen to serve as component measures for the intricacies of testing. The methodology is applied to compare traditional and adaptive means of testing. It is shown that previous informal arguments asserting the superiority of adaptive …

System Design Quality And Efficiency Of System Analysts: An Automated Case Tool Versus A Manual Method, Satomi H. Sugishita

UNF Graduate Theses and Dissertations

The purpose of the current research study is to find out if CASE tools help to increase the software design quality and efficiency of system analysts and designers when they modify a system design document. Results of the experimental data analysis show that only the experience level of subjects had an effect on quality of their work. Results indicated that the design methods, either CASE tools or manual, do not have a significant effect on quality of the modification task nor the efficiency of system analysts and designers.

A Universal Method Of Scientific Inquiry, Daniel N. Osherson, Michael Stob, Scott Weinstein

University Faculty Publications and Creative Works

A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of “successful scientific inquiry” is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible.

Constrained Completion: Theory, Implementation, And Results, Daniel Patrick Murphy

Doctoral Dissertations

"The Knuth-Bendix completion procedure produces complete sets of reductions but can not handle certain rewrite rules such as commutativity. In order to handle such theories, completion procedure were created to find complete sets of reductions modulo an equational theory. The major problem with this method is that it requires a specialized unification algorithm for the equational theory. Although this method works well when such an algorithm exists, these algorithms are not always available and thus alternative methods are needed to attack problems. A way of doing this is to use a completion procedure which finds complete sets of constrained reductions. …

Proving Functionally Difficult Problems Through Model Generation, Richard Rankin, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

Satchmo [MA88] is a Theorem Prover Implemented in Prolog Which Attempts to Provide Satisfiability Checking through Model Generation. This Paper Gives a Brief Introduction to SATCHMO and Reports Extensions to the Original Work Which Allow SATCHMO to Solve Problems Previously Considered to Be Finitely Unprovable within the SATCHMO System. the Specific Problems Are from [PE86, MO85, LU85] and Were Designed to Convert Simple Propositional Logic Problems into Functionally Difficult First Order Problems. Although the Benefits of using the SATCHMO System Are Many, the Fact that It Could Not Offer Proofs for a Set of Problems Provable in Other Systems is …