Physical Sciences and Mathematics Commons^™

An Object Based Approach Towards The Automation Of Office Procedures Using Intelligent Messages, Robert L. Palumbo

Student Work

Office support systems are used to automate routine office tasks. Since office tasks often require the cooperation of several office workers who may be physically dispersed, it is important to develop advanced communication systems that better facilitate collaborative and cooperative office work among office workers.

In this thesis, we propose an approach to the construction of advanced communication systems in which messages are represented as objects that are “intelligent” and “active” and can therefore perform certain activities (such as interacting with various entities to collect data) and decisions (such as dynamically deciding which user to go to next) on their …

Pargal: A Package For Parallel Graph Algorithms, Winston Anand-Kumar

Masters Theses

In this thesis, we have considered three graph problems namely, spanning forest problem, connected component problem and minimum cost spanning forest problem. Standard methods to solve these problems using sequential algorithms by various authors are presented for each problem. Efficient parallel algorithms for these problems have also been presented by various authors; however, most of these solutions demands a need for large number of processors, which immediately increases the cost of the hardware and in most of the cases it seems not very practical.

We present efficient solutions for the three problems on a hypercube parallel computer using p processors. …

An Integrated Simulation Model Development Environment For Slam Ii Using Object-Oriented Paradigm, Rizvan Erol

Masters Theses

An integrated simulation model development environment was implemented to assist the modeler by automating certain activities of simulation modeling. The system included interactive model definition, experimental design, automatic simulation program generation in SLAM II. Object-oriented paradigm at software development stage was extensively used to conceptualize the structure, and rules of the SLAM II language in order to generate efficient, and modular program code. The present system targeted modeling of various probabilistic inventory control system problems. The remarkable advantages of the system were rapid model development time, and achieving reliable program code without requiring any knowledge in SLAM II. Object-oriented programming …

An Efficient Over-The-Cell Routing Algorithm For High Performance Circuits, Sivakumar Natarajan

Masters Theses

In this thesis, we present a three-layer and a two-layer over-the-cell (OTC) channel routing algorithm (WILMA3 and WILMA2 respectively) for high speed circuits. This router not only minimizes the channel height by using over-the-cell areas but also achieves the net’s timing requirements.

We have implemented our routers in C on SUN Sparc 1+ workstation and tested it on MCNC benchmarks Primary I and II. Experimental results show that WILMA3 can achieve results which are 72% better (on the average) than the conventional two layer channel router, 61% better than two layer over-the-cell router and 51% better than three layer greedy …

Eztex: A Graphical User Interface System For Latex, Ravi K. Kosaraju

Masters Theses

No abstract provided.

Improved Global Routing Using ⋋-Geometry, Surendra Burman

Masters Theses

No abstract provided.

A Computer Simulation Of The Rotary Vacuum Filter Brown Stock Washing System Using Distribution Sampling, Edison G. Yiu

Masters Theses

A probabilistic model was utilized to simulate the brown stock washing system's error due to process variability and measurement noise. Mass balances of the washing system were performed using distribution sampling. This model relies on a nonlinear relationship between displacement and dilution, which permitted the generation of displacement ratio based upon wash liquor ratio. Experimental trials were performed on a pilotscale rotary vacuum single-stage washer. Nonlinear first-order relationship appears to characterize a pilotscale washer adequately. Differences were observed between the means and standard deviations of the measured results compared to the simulation output. Future work is needed to identify the …

Compiling Ace For Distributed-Memory Machines, Jun Song

Dissertations and Theses

Distributed-memory machines offer a very high level of performance, flexibility and scalability. But the memory organization of this kind of machine determines that processes on different processors must communicate explicitly by sending and receiving messages. As a result, the programmer faces the enormously difficult task of detailed planning of algorithm-irrelevant, low-level communication issues. This level of programming resembles writing assembly programs for a sequential machine.

ACE is a message-passing language with abstract communication statements. It was defined by Dr. Jingke Li at Portland State University. The communication in ACE is still explicit, but it is abstracted to a higher level. …

Performance Analysis Of Queueing Systems With Synchronous Server, Wonmu Hur

Theses

The performance measures are derived for a queueing system which is characterized by its synchronous server operations. This property is the one which normal queueing systems lack. A system of this nature contains a single common server to which multiple number of buffers are connected in parallel, where the server operates only when all system buffers are occupied.

In this thesis, the analysis is carried out focusing on the simplest system involving only two buffers. Throughout the analysis, a symmetricity of the system is assumed (i.e., system is symmetrical in terms of arriving customer statistics.). Also assumed are the Poisson …

Domain Analysis Within The Gensif Framework, Heiko Thimm

Theses

The GenSIF framework which is targeted towards very large, distributed, and complex software systems recently has been proposed to accomplish a form of systems engineering and systems development in which the issue of systems integration is considered from the beginning on.

One of the components of GenSIF is domain analysis. Domain analysis leads to the design of a domain model. The specific needs GenSIF has in that area were investigated with an emphasis on domain modeling. Main points addressed in that investigation were the issue regarding the relevant information for the domain modeling process and the required type of domain …

Design And Implementation Of Two Text Recognition Algorithms, Madhumathi Yendamuri

Theses

This report presents two algorithms for text recognition. One is a neural-based orthogonal vector with pseudo-inverse approach for pattern recognition. A method to generate N orthogonal vectors for an N-neuron network is also presented. This approach converges the input to the corresponding orthogonal vector representing the prototype vector. This approach can restore an image to the original image and thus has error recovery capacility. Also, the concept of sub-networking is applied to this approach to enhance the memory capacity of the neural network. This concept drastically increases the memory capacity of the network and also causes a reduction of the …

Character Recognition Using String Matching, Xiaozhi Ye

Theses

To handle noisy and distorted pattern is the use of similarity or distance measures. A similarity or distance measure can be defined between a representation of an unknown pattern and a representation of a prototype pattern. Recognition of the unknown pattern can be carried out on the basis of the maximum-similarity or minimum distance criterion (Bunke 1990) This approach is proposed to recognize the noisy or distorted character image. In this work, a directly string representation of the pattern ( prototype as well as unknown input) using the histogram method, a decision procedure for classification is the well known Levenshtein …

Porting Cosmos Expert System From Unix To Dos, Ching-Jeng Chiu

Theses

COSMOS is an object-oriented Knowledge Based System building Tools (KBSTs) to solve problem in engineering industry. COSMOS stands for C++ Object-oriented System Made for expert System development.

In order to provide more people those who don't have a Sun workstation to use this expert system, our task is porting COSMOS form UNIX to DOS.

Because the differents of workstation environment, the user interface and structure of original COSMOS no longer can be used, therefore we made some necessary change before we porting it to IBM Personal Computer.

In stead of X Window system®, we implemented ObjectWindows® runs on Microsoft WindowsTM. …

Formal Implementation Of High-Level Languages For Data-Parallel Programming, Deb Banerjee

Dartmouth College Ph.D Dissertations

The success of parallel architectures has been limited by the lack of high-level parallel programming languages and useful programming models. The data-parallel model of programming has been demonstrated to be useful and natural on a wide variet of parallel architectures. This dissertation presents a set of formal techniques for compiling high- level languages based on data-parallelism.

Multiple Learner Systems Using Resampling Methods, Binyun Xie

Computer Science Theses & Dissertations

The N-Learners Problem deals with combining a number of learners such that the resultant system is "better", under some criterion, than the best of the individual learners. We consider a system of probably approximately correct concept learners. Depending on the available information, there are several methods to make the composite system better than the best of the individual learners. If a sample and an oracle that generates data points (but, not their classification) is available, then we show that we can achieve arbitrary levels of the normalized confidence of the composite system if (a) a robust learning algorithm is available, …

Text-Independent Automatic Speaker Identification Using Partitioned Neural Networks, Laszlo Rudasi

Electrical & Computer Engineering Theses & Dissertations

This dissertation introduces a binary partitioned approach to statistical pattern classification which is applied to talker identification using neural networks. In recent years artificial neural networks have been shown to work exceptionally well for small but difficult pattern classification tasks. However, their application to large tasks (i.e., having more than ten to 20 categories) is limited by a dramatic increase in required training time. The time required to train a single network to perform N-way classification is nearly proportional to the exponential of N. In contrast, the binary partitioned approach requires training times on the order of N². …

Visual Graphic Knowledge Management Methodology, Jih-Shih Hsu

Computer Science Theses & Dissertations

As computer technology evolves, graphic workstations are becoming more popular. They support more friendly user interfaces than do conventional terminals. The better user interfaces require more effort to develop. Therefore, many user interface (UI) design systems have been developed to facilitate the creation of modern user interfaces, but not very successfully. Many of them either provide limited features or are difficult to use. Besides, these UI design systems are actually like black boxes to their users because the underlying technology is opaque; their users cannot learn how to utilize the underlying window systems through user interface design sessions. In a …

Multigrid Algorithms For Massively Parallel Machines, Satyanarayan Gupta

Computer Science Theses & Dissertations

Numerical solutions of partial differential equations (pde's) are required in many physical problems arising in areas such as computational fluid dynamics, atmospheric sciences, electromagnetics etc. One of the most popular methods of solving pde's is the use of the multigrid algorithm. However, the implementation of the multigrid algorithm on massively parallel machines is not very efficient because of (i) low processor utilization and (ii) high communication overheads. These problems need to be addressed to make better use of massively parallel machines for solving pde's using the multigrid algorithm.

In this dissertation, we present three parallel multigrid algorithms which …

High Performance Issues On Parallel Architectures, Peter J. Looges

Computer Science Theses & Dissertations

In an effort to reduce communication latency in mesh-type architectures, these architectures have been augmented by various types of global and reconfigurable bus structures. The static bus structures provide excellent performance in many areas of computation especially structured numerical computations, but they lack the flexibility required of many large numerical and non-numerical applications. Reconfigurable bus systems have the dynamic adaptability to handle a much wider range of applications. While reconfigurable meshes can often yield constant time results for many problems, the cost of this performance is paid in the number of processors required. While in actuality the majority of these …

Sequential And Parallel Discrete Event Simulation On Computer Communication Networks, Tao Zhou

Masters Theses

This thesis presents the discrete event simulation technique on the network design, focusing on the methodology, modeling and implementation. The developed technique is suitable for the analysis of any store-and-forward computer communication networks with any level of complexity. The proposed generic simulation model can be used to test the architectures and protocols of existing networks and networks being designed. In implementation of the sequential discrete event simulation, an object-oriented programming strategy is applied to the network simulation using the C++ language. The parallel discrete event simulation is introduced to solve the problem of long time execution of the sequential simulation …

Decomposition Of Geometric-Shaped Structuring Elements And Optimization On Euclidean Distance Transformation Using Morphology, Hong Wu

Theses

Mathematical morphology which is based on geometric shape, provides an approach to the processing and analysis of digital images. Several widely-used geometric-shaped structuring elements can be used to explore the shape characteristics of an object. In first chapter, we present a unified technique to simplify the decomposition of various types of big geometric-shaped structuring elements into dilations of smaller structuring components by the use of a mathematical transformation. Hence, the desired morphological erosion and dilation are equivalent to a simple inverse transformation over the result of operations on the transformed decomposable structuring elements. We also present a strategy to decompose …

Graphical Image Persistence And Code Generation For Object Oriented Databases, Subrata Chatterjee

Theses

Attached is the detailed description of the design and implementation of graphical image persistence and code generation for object oriented databases. Graphical image persistent is incorporated into a graphics editor called OODINI. OODINI creates and manipulates graphical schemas for object-oriented databases. This graphical image on secondary storage is then translated into an abstract, generic code for dual model databases. This abstract code, DAL can then be converted into different dual model database languages. We provide an example by generating code for the VODAK Data Modeling language. It is also possible to generate a different abstract language code, OODAL from a …

Interpreting And Integrating Landsat Remote Sensing Image And Geographic Information System By Fuzzy Unsupervised Clustering Algorithm, Gwotsong Philip Chen

Theses

Due to the resolution of Landsat images and the multiplicity of the terrain, it is improper to assign each pixel in an image to one of a number of land cover types by using the conventional remote sensing classification method. This is also known as the hard partition method. The concept of the fuzzy set provides the means to resolve this problem. This paper presents a two-pass-mode fuzzy unsupervised clustering algorithm.

In the first passing, the cluster mean vectors which represent the geographic attributes or the land cover types are derived. In the second passing, the concept of fuzzy set …

Transformations And Analysis Of Parallel Real Time Programs, Chandima J. Gunasekara

Theses

The problem of schedulability analysis of a set of real time programs form a NP complete problem. The exponential complexity of analysis is a direct result of the complexity in the real time programs, as a combinatorial explosion takes place when trying to determine access patterns of shared resources. Thus, to transform the original programs to a less complex form, while preserving its timing characteristics, is the only viable solution. By using such transformations to reduce the complexity of real time programs, it is possible to schedulability analyze programs at compile time efficiently, without adding an unnecessary overhead to the …

An Implementation And Evaluation Of Distributed Information System Based On The Osca Architecture Guidelines, Babita Masand

Theses

The concepts in this thesis discuss and evaluate the need for systems integration. As a conceptual architecture, the OSCA^TM architecture is investigated. A prototype of the CS Department distributed information system is built following the guidelines and standards of this conceptual architecture. This prototype is implemented in 'C'. RPC (remote procedure call) is used for the communication channel to implement the distributed environment. Conclusions and results that were achieved by implementing this prototype are presented. The main outcome of this thesis is the introduction of the infrastructure to the GenSIF framework.

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 …

Single Object Detection Using Multiple Sensors With Unknown Noise Distributions, Shaofen Chen

Computer Science Theses & Dissertations

We consider the design of an object classification system that identifies single objects using a system of sensors; each sensor outputs a random vector, according to an unknown (noise) probability distribution, in response to a sensed object. We consider a special class of systems, called the linearly separable systems, where the error-free sensor outputs corresponding to distinct objects can be mapped into disjoint intervals on real line. Given a set of sensor outputs corresponding to known objects, we show that a detection rule α_emp that approaches the correct rule with a high probability can be computed. We show …

The Development And Application Of Testing Techniques In An Object-Oriented Paradigm, Robert F. Kozal

Masters Theses

This thesis is the study of testing object-oriented programs. Aspects of object-oriented programs for which testing techniques are developed include classes, methods, inheritance, polymorphism, and encapsulation. The application of these techniques are illustrated, and a comparison between traditional testing techniques and object-oriented techniques is also drawn.

On Planar Routing Of Multi-Terminal Nets In Vlsi Physical Design, Jahangir A. Hashmi

Masters Theses

In this thesis, we study two problems related to the physical design of VLSI circuits. One problem is related to the VLSI global routing and the other is related to the detailed routing in a bounded region.

We consider the routing of multiple multi-terminal nets on a single layer. We suggest a new approach for this problem. Our approach is based on simultaneously finding a forest of k non-intersecting spanning trees. We present an O(n^3) algorithm for finding two spanning trees corresponding to two nets on a single layer.

We also study the problem of finding a minimum Steiner tree …

A Survey Of Computer Use In Occupational Therapy Fieldwork Sites, Martha E. Parks

Masters Theses

Eighty-three Western Michigan University occupational therapy fieldwork sites were surveyed to determine: (a) extent of computer use, (b) diagnostic categories with which computers are used, (c) extent of computer knowledge of registered occupational therapists (OTRs), and (d) adequacy of computer knowledge of fieldwork students. Forty-seven (56.6%) of the 83 surveys were returned. OTRs at 36 (76.6%) of the 47 sites currently use computers. Word processing is the most common way in which these OTRs use computers. The most common clinical use of computers is perceptual/motor assessment and treatment, while the most common research use of computers is for report writing. …