Physical Sciences and Mathematics Commons^™

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, …

Some Contributions To Generalized Inverse And The Linear Complementarity Problem., N. Eagambaram Dr.

Doctoral Theses

A generalized inverse (g-inverse) of a matrix A is a solution x to the matrix equationA XA = A(1.1.1)A g-inverse of A can be defined alternatively as a matrix x such that x = Xb is a solution to the linear equation Ax -b for any b that makes - b consistent. There is a vast literature on g-inverse. For a number of results on g-inverses and their applications one may refer to the well known books in the literature by Rao and Mitra (1971); and by Ben Israel and Greville (1974).Another inverse that lies hidden in the definition of …

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 …

On Consisten Estimation Of Classes In R2 In The Context Of Cluster Analysis., C. A. Murthy Dr.

Doctoral Theses

Brief reviow of oluater analysis. The literature on oluater analy ste is baaically orianted touerda the development of algori thme 1,2,3, 4, 5]. Andaxberg [1] gives the verloue stepo in aluster analy al a starting from the chai ce of data pointa to interpreting the results. Harti gan 5] desoribes veari oun cluatering algo- ri thms in hin book. He also states the ueos of tho ae methoda in vari oue fielde. Jardines end Sibaon [6] dovelopa meaoures of di ssimilarity and regerde a alustor mothod as a funotion from di andmilori tymatrlces to trees. Clustering tochniquos can ba broadly …

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 …

On A Class Of Stochastic Approximation -Type Parameter-Learning Algorithms For Pattern Recognition., Amita Pal Dr.

Doctoral Theses

The first tank can involve one or more subtasks. For instance, it may require the design of a classifier on the basis of whatever prior knowledge there is of the feature space, or given the design, to estimate efficiently the parameters of the classifier. The latter might involve the estimation of the density function itself if very little is known about the class-conditional fenture distribution, or it may necessitate the entimation of the parameters of the fenture distribution, if one can assume it to have some known form. It may also involve estimating the boundaries of the classes, if even …

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 …

Some Studies In Analysis And Recognition Of 2 Dimensional Shapes., Swapan Kumar Parui Dr.

Doctoral Theses

Analysis and recognition of 2-dimensional shapes constitute an important problem in the fields of Pattern Recognition, Image Analysis, Computer Vision, Robotics and other related areas of research. If we look at the problem from the point of view of image or scene analysis, in a sense, the antire subject of automatic scene analysis might be defined as the problem of describing and recognizing the shape of the ob jects in an image. Shape is the primal intrinsic property for the vision system because we associate the definitions of objects with shape, rather than with colour or reflectivity, for example.According to …

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.

On Some Deterministic And Stochastic Scheduling Problems., V. Rajendra Prasad Dr.

Doctoral Theses

Scheduling problems are quite common in nature. They arise whenever there is a need to plan the execution of various operations over time. Like many ot her real life problems such as inventories, networks, queues etc. almost all the scheduling problems car be rapresented by appropriate mathematical models. The theory of scheduling is a disciplina which doals with the construction of suitable mathematical models for sche duling problems and their analysis. Scheduling theory came into prominance after Johnson (1954) had published his work on a fiow shop sche duling problem.The current reseu rch work in scheduling thoory can ba classified …

A Classification Of Certain Graphs With Minimal Imperfection Properties, S. H. Whitesides

Dartmouth Scholarship

The family of (α, ω) graphs are of interest for several reasons. For example, any minimal counter-example to Berge's Strong Perfect Graph Conjecture belongs to this family. This paper accounts for all (4, 3) graphs. One of these is not obtainable by existing techniques for generating (α + 1, ω) graphs from (α, ω) graphs.

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.

Generalized Inverses Of Special Types Of Matrices., Rao Vara Prasada Pullepu Sree Satya Narayana Dr.

Doctoral Theses

Inverses, in the regular sense of the term, do not exist for singular square matrices and rectangular matrices. however for such matrices there exist matrices which satisfy many important properties similar to those of inverses of nonsingular matrices and for many purposes, can be used in the same way as regular inverses. These matrices are named generalised inverses (g-inverses) to distinguish then from the inverses of nonsingular matricos. Only since 1955 this field of study af generalized inverse was: invostigated systenatically and was expiorcd for nany beautiful and interesting results and applications though the concept of generalizod inverse was first …

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 …

Study Of Dynamic Programming And Gambling Systems., N. D. Prabhakar Dr.

Doctoral Theses

The body of methods known as Dynamic Programming (d.p.) was developed by Bellman and was successfully applied by him to solve practical problems in diverse fields (see 12] and the pa pers cited there.). These methods revolved around an intuitively appealing principle which Bellman called the principle of optimatity. A general formulation of d.p. problem was given by Blackwell (3, s] which is narrower in scope than Bollman's but includes many important applications i12) and offers a proper framework for asking the many inte- resting and mathematically sophisticated questions that arise in d.p.. Strauch, Brown, Maitra, Furukawa, Dantas, Hinderer etc., …

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.