Computer Sciences Commons^™

New Algorithms For Mid-Crack Codes In Image Processing, Wai-Tak Wong

Theses

The chain code is a widely-used description for a contour image. Recently, a mid-crack code algorithm has been proposed as another more precise method for image representation. New algorithms using this new mid-crack code for image representation, restoration, and skeletonization are developed. The efficiency and accuracy can be increased obviously.

Firstly, the conversion of a binary image with multiple regions into the mid-crack codes is presented. A fast on-line implementation can be achieved using tables look-up. The input binary image may contain several object regions and their mid-crack codes can be extracted at the same time in a single-pass row-by-row …

Development Of A Flight Information System Using The Structured Method, Yeong-Lae Kwak

Theses and Dissertations

This thesis documents the development of a database system for the Flight Information System (FIS) of the Korean Air Force. The scope of the FIS is too large to be covered by this thesis. Thus, this thesis covers only the core part of the FIS due to the limitation of time and man-power. This thesis uses the structured method. Structured analysis and structured design techniques are mainly used two techniques. This thesis focused not only the development of the FIS but also the application of the software development method, the structured method, and its tools such as DFD, DD, ERD, …

Ada In The Soviet Union, Peter Wolcott

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Over the last decade and a half, the Ada programming language has aroused more financial, technical, political, and emotional forces than any other programming language. Because the language is a product of more than just technical factors, its progress is heavily influenced by the surrounding social, economic, and political environment. Judging by the technical characteristics of the language and the goals for its use, one would expect that Ada would be the subject of intense development by the USSR, as well as by the USA. In practice, the Ada experiences in these countries differ considerably. We examine the state of …

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 …

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 Machine Entity For A Coordinate Measurement Machine : The Generic Workcell Project, Richard C. Meyer

Theses

The Center for Manufacturing Systems (CMS) department at New Jersey Institute of Technology and Siemens Corporate Research located in Princeton have agreed to jointly implement a research project in generic workcell control architectures. This paper discusses the module, called a Machine Entity, developed by the author that interfaces the Brown & Sharpe Coordinate Measurement Machine located on the CMS factory floor with the cell control software. The module has been designed in such a manner to simplify the development of future Machine Entities, thereby reducing the time required to integrate the CMS factory floor.

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 …

Some Developments In Information Technology In The Irish Hotel And Catering Industry, Sean Connell, Elaine Sunderland, Ciaran Mcdonnell

Conference papers

This paper describes the current and potential future use of computers in the Hospitality Industry in Ireland. It briefly outlines two research projects which are being carried out in the Dublin College of Catering in the application of computers to the Industry.

Executing Multidatabase Transactions, Mansoor Ansari, Marek Rusinkiewicz, Linda Ness, Amit P. Sheth

Kno.e.sis Publications

In a multidatabase environment, the traditional transaction model has been found to be too restrictive. Therefore, several extended transaction models have been proposed in which some of the requirements of transaction, such as isolation or atomicity, are optional. The authors describe one of such extensions, the flexible transaction model and discuss the scheduling of transactions involving multiple autonomous database systems managed by heterogeneous DBMS.

The scheduling algorithm for flexible transactions is implemented using L.0, a logically parallel language which provides a framework for concisely specifying the multidatabase transactions and for scheduling them. The key aspects of a flexible transaction specification, …

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

Application Of Expert System Techniques For Award Implementation, Seng-Choon Yeoh

Theses : Honours

This paper describes a pilot expert system project, PESWEA, developed in conjunction with The Western Australian Government Railways Commission (Westrail), to locate and implement an expert system pilot solution to the problems and complexities of the awards. The paper will outline the process used to develop and implement a solution to a business requirement. In particular, the methodologies for the project, shell selection, and knowledge acquisition will be presented and discussed. The fundamentals of expert systems will be discussed to provide the reader an insight into the technology. In addition, this paper reviews the literature relevant to the research questions. …

Measurement Of The Tau Lepton Electronic Branching Fraction, D. Akerib, M. Thulasidas

Research Collection School Of Computing and Information Systems

The tau lepton electron branching fraction has been measured with the CLEO II detector at the Cornell Electron Storage Ring as Be=0.1749±0.0014±0.0022, with the first error statistical and the second systematic. The measurement involves counting electron-positron annihilation events in which both taus decay to electrons, and normalizing to the number of tau-pair decays expected from the measured luminosity. Detected photons in these events constitute a definitive observation of tau decay radiation.

Isospin Mass Splittings From Precision Measurements Of D*-D Mass Differences, D. Bortoletto, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Using the decay modes, D*+→D+π0 and D*0→D0π0, we have measured the D*+−D+ and D*0−D0 mass differences to be 140±0.08±0.06 and 142.12±0.05±0.05 MeV, respectively. Combining these measurements with the Particle Data Group average for the D*+−D0 mass difference, we obtain isospin mass splittings for D*+−Dusp*0 and D+−D0 of 3.32±0.08±0.05 and 4.80±0.10 ±0.06 MeV. We discuss the implications of these measurements for models of isospin mass differences and model-dependent estimates of fD.

Measurement Of Τ Decays Involving Η Mesons, M. Artuso, M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Electronic Branching Ratio Of The Lepton, R. Ammar, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Using data accumulated by the CLEO I detector operating at the Cornell Electron Storage Ring, we have measured the ratio R=Γ(τ→eν¯eντ)Γ1 where Γ1 is the τ decay rate to final states with one charged particle. We find R=0.2231±0.0044±0.0073 where the first error is statistical and the second is systematic. Together with the measured topological one-charged-particle branching fraction, this yields the branching fraction of the τ lepton to electrons, Be=0.192±0.004±0.006.

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 …

Migrating A C-Based Cad Tool To An Object-Oriented Database/C++ Environment: Conversion Costs And Performance Analysis, Mark A. Roth, Timothy M. Jacobs

AFIT Documents

his paper examines the potential of object-oriented databases to support complex design applications. To do this we migrated the Magic very large scale integrated (VLSI) circuit design tool written in the C language to a new environment in which Magic's existing file management code is replaced with a C++ language interface to the commercial object-oriented database management system (OODBMS) product Object Store. In our initial implementation we found the performance of this tool as implemented on the OODBMS to be marginally faster than the tool as currently implemented with a flat file system in several critical areas. Increased functionality, including …

Ccis Networking - December 1991, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

An Object-Oriented Database Implementation Of The Magic Vlsi Layout Design System, Timothy M. Jacobs

Theses and Dissertations

This thesis attempts to prove that the commercially available Object Store data management system provide the performance and functionality necessary to support a complex engineering design system. This is accomplished by modifying the Magic VLSI circuit layout design system to eliminate its current Unix file data management system and replace it with Object Store. The approach to this research effort includes a design recovery of the Magic system and identification of its ket data management functions. These functions are then modified to take advantage of the database management facilities of Object Store. Additional code is added to instrument performance measurement …

A Case Study In Software Reuse: The Rntds Architecture, Barry J. Stevens

Computer Science Theses & Dissertations

It has been asserted that the most significant gains in software productivity will come from increased levels of software reuse. Some economic models for predicting savings through software reuse exist, but none are based on actual project experience. This paper surveys those models and presents the results of a case study, the Restructured Naval Tactical Data Systems (RNTDS) architecture, in the light of those models. According to the models, software reuse via the RNTDS architecture has enabled the production of fourteen major computer programs at five to twenty-one percent of the cost to create them without software reuse. Organizational characteristics …

Specifying Interdatabase Dependencies In A Multidatabase Environment, Marek Rusinkiewicz, Amit P. Sheth, George Karabatis

Kno.e.sis Publications

The problem of interdatabase dependencies and the effect they have on applications updating interdependent data are addressed. A model that allows specifications of constraints among multiple databases in a declarative fashion is proposed. The separation of the constraints from the application programs facilitates the maintenance of data constraints and allows flexibility in their implementation. It allows investigation of various mechanisms for enforcing the constraints, independently of the application programs. By grouping the constraints together, it is possible to check their completeness and discover possible contradictions among them. The concepts of polytransactions, which use interdatabase dependencies to generate a series of …

An Experimental Sequence Examining The Effect Of Task Type, Memory Condition, And Display Presentation Type On Performance Time And Error Rate, Using Columnar Table Versus Vertical Bar Graph Versus Line Graph, Suparna Das

Theses

A total of 126 subjects at various levels of school and a health related manufacturing firm participated in three experiments that compared Tables, Line graphs and Bar graphs forms of data presentation. The experiments were performed each consisting of a training task followed by answering some questions based on the presented material. The experimental series were presented to six groups. Group 1, 3, 5 viewed Line graphs, Tables or Bar graphs respectively while answering the questions while the other three groups answered questions based on memory of either Line graphs, Table or Bar graph presentation.

The independent variables were:

1. Memory …

Constrained-Latency Storage Access: A Survey Of Application Requirements And Storage System Design Approaches, Richard Staehli, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Applications with Constrained Latency Storage Access (CLSA) are those that have large storage needs and hard constraints on the amount of latency they can tolerate. Such applications present a problem when the storage technology that is cost effective and large enough cannot meet their latency constraints for demand fetching. Examples are found in the developing field of multimedia computing and, to a lesser extent, in real-time database literature. This paper examines the nature of timing constraints at the application-storage interface and defines a classification for both the synchronization constraints of the application and the latency characteristics of the storage system. …

Visual Knowledge Query Language As A Front-End To Relational Systems, Keng Siau, Kok Phuang Tan, Hock Chuan Chan

Research Collection School Of Computing and Information Systems

Relational query languages like SQL and QUEL require the users to understand the complex database structure. This is a burden on end users, especially novice end users who access the database on a casual and infrequent basis. To alleviate the need to know the logical database organization, this paper proposes the use of a semantic data model, known as the Enhanced Entity-Relationship (EER) model, as a front-end to the relational systems. A formal, high-level Visual Knowledge Query Language (VKQL) has also been designed for this interface. This language provides for knowledge abstraction as the user communicates only domain knowledge with …

Visual Knowledge Query Language As A Front-End To Relational Systems, Keng Siau, Kok Phuang Tan, Hock Chuan Chan

Research Collection School Of Computing and Information Systems

Relational query languages like SQL and QUEL require the users to understand the complex database structure. This is a burden on end users, especially novice end users who access the database on a casual and infrequent basis. To alleviate the need to know the logical database organization, this paper proposes the use of a semantic data model, known as the Enhanced Entity-Relationship (EER) model, as a front-end to the relational systems. A formal, high-level Visual Knowledge Query Language (VKQL) has also been designed for this interface. This language provides for knowledge abstraction as the user communicates only domain knowledge with …

Connectionist Expert System With Adaptive Learning Capability, B. T. Low, Hochung Lui, Ah-Hwee Tan, Hoonheng Teh

Research Collection School Of Computing and Information Systems

A neural network expert system called adaptive connectionist expert system (ACES) which will learn adaptively from past experience is described. ACES is based on the neural logic network, which is capable of doing both pattern processing and logical inferencing. The authors discuss two strategies, pattern matching ACES and rule inferencing ACES. The pattern matching ACES makes use of past examples to construct its neural logic network and fine-tunes itself adaptively during its use by further examples supplied. The rule inferencing ACES conceptualizes new rules based on the frequencies of use on the rule-based neural logic network. A new rule could …

Rule-Based Module And Object-Oriented Design For Optical Character Recognition, Min Gao

Theses

In this thesis, I present a optical character recognition technique based on the rule-based module and object-oriented design. A document image is first scanned, and then segmented into isolated characters by the use of projection profiles. The recognition procedures include three steps: contour extraction, strokes detection and rule-based classification. The contour extraction is to extract the outbound boundary and to perform the boundary linking and noise removal. The stroke detection is to detect the features or strokes of the outbound boundary, such as horizontal/vertical lines, left/right slash lines and left-/right-opened curves. The rule-based classification consists of two rules: character definition …

The Performance Of Training Pattern Sets In A New Art-Based Neural Architecture For Image Enhancement, Fu-Chun Chang

Theses

Neural network can be applied on the image enhancement after adding another two layers into the Adaptive Resonance Theory architectures (ART 1). The analysis for selecting a nice training pattern set associate the appropriate vigilance values is the main concerns in this thesis. For a single training pattern ,the network can act as a mathematical morphology operators such as erosion , dilation, opening and closing. With more than one training patterns in the network, 16 experiments are tested and are compared to each other in order to find the best selection for doing the image enhancement work. With both the …

On The Relationship Between Parsimonious Covering And Boolean Minimization, Venu Dasigi, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Minimization of Boolean switching functions is a basic problem in the design of logic circuits. The designer first comes up with a switching function expressed in terms of several binary input variables that satisfies the desired functionality, and then attempts to minimize the function as a sum of products or product of sums. It turns out that a sum of products form of a switching function that has no redundancy is a union of prime implicants of the function.

In this paper we would like to explicate some of the relationships of the boolean minimization problem to a formalization of …

The Architecture Of Braid: A System For Bridging Al/Db Systems, Amit P. Sheth, Anthony B. O'Hare

Kno.e.sis Publications

We describe the design of BrAID (a Bridge between Artificial Intelligence and Database Management Systems), an experimental system for the efficient integration of logic based Artificial Intelligence (Al) and database (DB) technologies. Features provided by BrAID include (a) access to conventional DBMSs, (b) support for multiple inferencing strategies, (c) a powerful caching subsystem that manages views and employs subsumption to facilitate the reuse of previously cached data, (d) lazy or eager evaluation of queries submitted by the AI system, and (e) the generation of advice by the AI system to aid in cache management and query execution planning. To discuss …