Physical Sciences and Mathematics Commons^™

Graphical User Interface For Image Processing, Kumar Chebrolu

Theses

A user friendly, menu driven, highly interactive X Windows package for Image Processing Applications using Motif Widget Set under Motif Window Manager is developed. Modules related to Segementation, Enhancement, Representation, Transformations are developed. The above routines are useful for image manipulation. The current gray scale/binary image is displayed on the window. Online histogram is provided so that the user can change the threshold value interactively. The OSF/Motif toolkit is used efficiently and also Xlib calls to display the image by allocating colormap. An on-line image manipulation help menu facility is incorparated in the tool to make it more versatile.

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 …

Experiments With The Gap Variation Of Interpolation Search For Semi Uniform Distributed Alphabetic Files, Jatin M. Bhavsar

Theses

There are various techniques for searching a data from a data base. One of them is interpolation search. It works on uniformly distributed and sorted numerical tables and considered to be one of the fastest methods. On an average this method takes 'lg lg n'

Burton and Lewis [BL] shows the inefficiency of interpolation sarch for an alphabetic table whose distribution is not known or non-uniform. They introduce GAP variations of interpolation search to compare the inefficiency. However another approach to a non-uniform is to apply the cumulative distribution function F which transfer a non-uniform distribution to uniform one, for …

Introduction (1991), Robert Brabenec

ACMS Conference Proceedings 1991

An Eighth Conference on Mathematics from a Christian Perspective

Table Of Contents (1991), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1991

An Eighth Conference on Mathematics from a Christian Perspective

Schedule (1991), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1991

An Eighth Conference on Mathematics from a Christian Perspective

Learning: An Experiment With Five Selection Forms, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Correspondence Problem In Image Sequence Analysis, Chia-Hoang Lee, Anupam Joshi

Department of Computer Science Technical Reports

No abstract provided.

Cystic Fibrosis: Cluster Analysis Of Microbiology And Pulmonary Function, Lori Lee M. Larson '91

Honors Projects

In an attempt to find a relationship between pulmonary infection and pulmonary function in cystic fibrosis (CF) patients, microbiology data and pulmonary function test (PFT) data for clinic patients' visits were obtained from the University of Minnesota Relational Database. The two files were merged, totaling 12,193 cases, and then analyzed using a quick cluster subroutine of SPSSX on the University of Illinois IBM Mainframe System. QUICK CLUSTER analysis showed a relationship between the virulence of the microorganisms, the amount of growth of the microorganisms, and the pulmonary function test scores of CF patients

Visual Interaction In Diagnostic Radiology, Erika Rogers, Ronald C. Arkin, M. Baron

Computer Science and Software Engineering

The concept of Visual Interaction is introduced as the process which links perception and problem-solving such that problem-solving is affected by what is seen, and conversely, what is seen and perceived is affected by the current state of the problem-solving process. This paper describes the development of a cognitively-based model of the visual interaction process in diagnostic radiology, and shows how aspects of this model are being incorporated into the design and implementation of an intelligent computer-based radiological assistant. In order to achieve this, it is necessary to extract information about the nature and type of knowledge involved in this …

Method For The Automatic Level Adjustment In A Local Area Network, In Particular For A Multiprocessor Arrangement With A Bus System Of Optical Fibres, For The Purpose Of Collision Detection, Hans Thinschmidt, Franz J. Kurfess

Computer Science and Software Engineering

European Patent. Written in German.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1991, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Stability Of Token Passing Rings, Leonidas Greorgiadis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

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 …

Applying Formal Verification Methods To Pure Rule-Based Programs, Rose F. Gamble, Gruia-Catalin Roman, William E. Ball, H. Conrad Cunningham

All Computer Science and Engineering Research

Reliability, defined as the guarantee that a program satisfies its specifications, is an important aspect of many applications for which rule-based expert systems are suited. Verification refer to the process used to determine the reliability of the rule-based program. Because past approaches to verification are informal, guarantees of reliability cannot fully be made without severely restricting the system. On the other hand, by constructing formal specifications for a program and showing the program satisfies those specifications, guarantees of reliability can be made. This paper presents an assertional approach to the verification of rule-based programs. The proof logical needed for verification …

Indifference Graphs And The Single Row Routing Problem, Peter J. Looges

Computer Science Theses & Dissertations

This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.

Maximum Queue Length And Waiting Time Revisited: Multiserver G|G|C Queue, John S. Sadowsky, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Route Adaptation And Persistence In Networks, Kenneth R. Rodemann

Department of Computer Science Technical Reports

No abstract provided.

Learning, Teaching, Optimization And Approximation, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Using Genetic Algorithms To Solve Combinatorial Optimization Problems, Xinwei Cui

FIU Electronic Theses and Dissertations

Genetic algorithms are stochastic search techniques based on the mechanics of natural selection and natural genetics. Genetic algorithms differ from traditional analytical methods by using genetic operators and historic cumulative information to prune the search space and generate plausible solutions. Recent research has shown that genetic algorithms have a large range and growing number of applications.

The research presented in this thesis is that of using genetic algorithms to solve some typical combinatorial optimization problems, namely the Clique, Vertex Cover and Max Cut problems. All of these are NP-Complete problems. The empirical results show that genetic algorithms can provide efficient …

Logical Inference Of Horn Clauses In Petri Net Models, C. Lin, A. Chaudhury, A. B. Whinston, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

A Framework For Intelligent Parallel Compilers, Ko-Yang Want

Department of Computer Science Technical Reports

No abstract provided.

On The Impossibility Of Atomic Commitment In Multidatabase Systems, James G. Mullen, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Preventing Weak Password Choices, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Prefetching And Caching Techniques In File Systems For Mimd Multiprocessors, David F. Kotz

Dartmouth Scholarship

The increasing speed of the most powerful computers, especially multiprocessors, makes it difficult to provide sufficient I/O bandwidth to keep them running at full speed for the largest problems. Trends show that the difference in the speed of disk hardware and the speed of processors is increasing, with I/O severely limiting the performance of otherwise fast machines. This widening access-time gap is known as the “I/O bottleneck crisis.” One solution to the crisis, suggested by many researchers, is to use many disks in parallel to increase the overall bandwidth. \par This dissertation studies some of the file system issues needed …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, April 1991, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Computer Modeling Of A Liquid Fuel Spray, Clemin R. Goodin Jr.

Opportunities for Undergraduate Research Experience Program (OURE)

The initial phase of this project involved manipulation of a lengthy FORTRAN computer code named "Kirwan." The code originated from England many years ago and was transferred to UMR by Dr. Drallmeier. Dr. Drallmeier had the code on a series of 5.25 inch floppy diskettes and the objective of the project was to load the code on to the Apollo computer system and be able to use it....The second phase of the project was begun in early November 1990 and is currently ongoing. The objective of this project is to predict "Rosin-Rammler" (RR) distribution equations for a fuel spray, given …

Using Software To Demonstrate Kinematics Of Gear Sets, John F. Hall

Opportunities for Undergraduate Research Experience Program (OURE)

The research was done in the area of developing software which could be used to demonstrate the motion of gears. To demonstrate this motion involved learning about programming using graphics. Engineering skills were used in the programming in various ways. One way was in developing and implementing the equations and theory. The more critical engineering aspect of this project is in determining what is effective in demonstrating the kinematic principles associated with gear sets.

The programs will be a helpful aid in showing students what is happening with the motion of gear sets. Not only will instructors be allowed to …

Suggestions For Improvements In Current Computer Image Processing Methods In Detection And Quantification Of The Severity Of Atrophic Rhinitis In Pigs, Jimmy Yu

Opportunities for Undergraduate Research Experience Program (OURE)

This paper investigates several techniques to aid in the utilization of computer image processing methods to detect and quantify the severity of atrophic rhinitis in pigs. An algorithm for reducing the complexity of matrix multiplications from O(n³) to O(n^2.81) is explored. A one-pixel-wide edge detection method is also studied. These techniques are considered for improving the accuracy, repeatability, and speed of existing detection and quantification methods.

An Evolutionary Approach To Load Balancing Parallel Computations, N. Mansouri, Geoffrey C. Fox

Electrical Engineering and Computer Science - Technical Reports

We present a new approach to balancing the workload in a multicomputer when the problem is decomposed into subproblems mapped to the processors. It is based on a hybrid genetic algorithm. A number of design choices for genetic algorithms are combined in order to ameliorate the problem of premature convergence that is often encountered in the implementation of classical genetic algorithms. The algorithm is hybridized by including a hill climbing procedure which significantly improves the efficiency of the evolution. Moreover, it makes use of problem specific information to evade some computational costs and to reinforce favorable aspects of the genetic …