Computer Sciences Commons^™

Applications Of Fuzzy Counterpropagation Neural Networks To Non-Linear Function Approximation And Background Noise Elimination, I. M. Wiryana

Theses: Doctorates and Masters

An adaptive filter which can operate in an unknown environment by performing a learning mechanism that is suitable for the speech enhancement process. This research develops a novel ANN model which incorporates the fuzzy set approach and which can perform a non-linear function approximation. The model is used as the basic structure of an adaptive filter. The learning capability of ANN is expected to be able to reduce the development time and cost of the designing adaptive filters based on fuzzy set approach. A combination of both techniques may result in a learnable system that can tackle the vagueness problem …

A Model Of Visual Recognition Implemented Using Neural Networks, Vincent C. Phillips

Theses: Doctorates and Masters

The ability to recognise and classify objects in the environment is an important property of biological vision. It is highly desirable that artificial vision systems also have this ability. This thesis documents research into the use of artificial neural networks to implement a prototype model of visual object recognition. The prototype model, describing a computtional architecture, is derived from relevant physiological and psychological data, and attempts to resolve the use of structural decomposition and invariant feature detection. To validate the research a partial implementation of the model has been constructed using multiple neural networks. A linear feed-forward network performs pre-procesing …

Ccis Networking - July 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

The paper provides an efficient method to find all feasible offsets for a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only for problems with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Theta(n) to Omega(n^2), where n is the number of nets. But, if the number of columns c is O(n), one can solve the problem in time O(n^{1.5}lg n ), which improves upon a `naive' O(cn) approach. As a corollary of this result, the same time bound suffices to find the optimal offset …

Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.

Ccis Networking - January 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Fortran 90d/Hpf Compiler For Distributed Memory Mimd Computers: Design, Implementation, And Performance Results, Zeki Bozkus, Alok Choudhary, Geoffrey C. Fox, Tomasz Haupt

Northeast Parallel Architecture Center

Fortran 90D/HPF is a data parallel language with special directives to enable users to specify data alignment and distributions. This paper describes the design and implementation of a Fortran90D/HPF compiler. Techniques for data and computation partitioning, communication detection and generation, and the run-time support for the compiler are discussed. Finally, initial performance results for the compiler are presented which show that the code produced by the compiler is portable, yet efficient. We believe that the methodology to process data distribution, computation partitioning, communication system design and the overall compiler design can be used by the implementors of HPF compilers.

Ccis Networking - July 1992, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

A Study Of The Methodologies Currently Available For The Maintenance Of The Knowledge-Base In An Expert System, Kai Teh

Theses: Doctorates and Masters

This research studies currently available maintenance methodologies for expert system knowledge bases and taxonomically classifies them according to the functions they perform. The classification falls into two broad categories. These are: (1) Methodologies for building a more maintainable expert system knowledge base. This section covers techniques applicable to the development phases. Software engineering approaches as well as other approaches are discussed. (2) Methodologies for maintaining an existing knowledge base. This section is concerned with the continued maintenance of an existing knowledge base. It is divided into three subsections. The first subsection discusses tools and techniques which aid the understanding of …

Ccis Networking - December 1991, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Apt Compiler Toolkit User Manual, George K. Thiruvathukal, Ufuk Verun

Computer Science: Faculty Publications and Other Works

The Apt Compiler Toolkit was designed to address the need for structured, efficient, portable, and capable tools to prototype language translators and compilers. In the current release of the toolkit tools are available for the generation of scanners, parsers, and data structures. A robust library of functions is supplied with the toolkit which includes support for the scanner, the parser, abstract data types (which are commonly used in language translators/compilers), and string functions.

An Examination And Analysis Of The Boltzmann Machine, Its Mean Field Theory Approximation, And Learning Algorithm, Vincent Clive Phillips

Theses : Honours

It is currently believed that artificial neural network models may form the basis for inte1ligent computational devices. The Boltzmann Machine belongs to the class of recursive artificial neural networks and uses a supervised learning algorithm to learn the mapping between input vectors and desired outputs. This study examines the parameters that influence the performance of the Boltzmann Machine learning algorithm. Improving the performance of the algorithm through the use of a naïve mean field theory approximation is also examined. The study was initiated to examine the hypothesis that the Boltzmann Machine learning algorithm, when used with the mean field approximation, …

The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.

The Development Of An Expert System For The Diagnosis Of Diseases In Fibre And Dairy Goats, Tim S. Roberts

Theses: Doctorates and Masters

This thesis details the development of an expert system for the diagnosis of diseases in fibre and dairy goats. Divided into five sections, five appendices, and a bibliography, this thesis centres on the methods used to build the expert system: the decisions taken at the outset of, and during the course of, development; some of the problems encountered, and the solutions to those problems. A detailed appraisal is made of the development process and suggestions are made for future developments over similar domains (for example, the diagnosis of diseases in animals other than goats). Much emphasis is placed on three …

The New Generation Of Computer Literacy, J. Paul Myers Jr.

Computer Science Faculty Research

A tremendous mismatch is developing between two of the most critical components of any computer literacy course: the textbooks and the students. We are encountering a "new generation" of students (literally as well as figuratively!) who are much better acquainted with computer usage than their earlier counterparts. Yet many textbooks with increasing emphasis in those same computer tools continue to appear. There are signs of a coming change in that a few authors and publishers apparently are becoming aware of the need for innovations in texts for non-scientists. These textbooks open the door for a new orientation to principles in …

Program Development For Computer Simulation And Analysis For Multiplex Chromatography, Barbara Pawliszyn

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

In this report, the programs developed for the analysis of simulated data in multiplex chromatography are written in the ASYST language. The integration of the program modules into a menu-driven, user-friendly prototype program is outlined. The program is developed to allow for flexibility and easy upgrading of the code.

This report examines the calculation procedures potentially useful in multiplex chromatography. Analysis of the mutliplex chromatograms is done by three mathematical methods, Cross-Correlation, Hadamard Transform and Fast Fourier Transform. The effects of experimental length/chromatogram length and decision sequences on correlation noise present in a single chromatogram, are discussed. As the number …

Centre For Computer Aided Management: An Overview, V B Kaujalagi

IIMB Management Review

No abstract provided.

Rediflow Multiprocessing, Robert M. Keller, Frank C. H. Lin, Jiro Tanaka

All HMC Faculty Publications and Research

We discuss the concepts underlying Rediflow, a multiprocessing system being designed to support concurrent programming through a hybrid model of reduction, dataflow, and von Neumann processes. The techniques of automatic load-balancing in Rediflow are described in some detail.

Structure Of The Information Base And Operations On The Entities In A System For Information Servicing Of Collectivities, Peter H. Barnev, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

This paper treats, from an user point of view, the structure of the entities in the information base (IB) of a System for information servicing of collectivities (SISC) as well as the operations on these entries.

A Model Of Data Structures Commonly Used In Programming Languages And Data Base Management Systems, William L. Honig

Computer Science: Faculty Publications and Other Works

This thesis claims that contemporary data structures can be understood and studied with an intelligible model which captures their essential differences and similarities and, further, that such a model is an appropriate basis for a top-down description method for data structures. To define the scope of the model, the data structures included in 21 programming languages and data base management systems have been tabulated. Each individual data structure is illustrated with an example drawn from a published paper or a working computer program. This mélange of data structures is divided into three classes (aggregates, associations , and files) and each …

The Myhill Functor, Input-Reduced Machines, And Generalised Krohn-Rhodes Theory, Robert H. Yacobellis

Computer Science: Faculty Publications and Other Works

No abstract provided.

Problems Encountered With Control Networks In Highly-Restructurable Digital Systems, Donald F. Wann, Robert A. Ellis, Mishell J. Stucki, Robert M. Keller

All HMC Faculty Publications and Research

This paper discusses problems encountered with control networks in highly restructurable digital systems. In particular the treatment of implementation errors is covered with emphasis on concurrent processing. The implementation of concurrent processing networks may result in errors which will be quite complex to detect and systematic methods are warranted. Four meta control elements are employed in obtaining convenient concurrent structures. We analyze several error detecting schemes and conclude that the arc-node method with node partitioning appears to be the most realistic approach at this time.