Digital Commons Network^™

Benefits Of Using Team Choice For Windows As A Multi-Criteria Decision Making Group Decision Support System, Eddie Goggans

Mahurin Honors College Capstone Experience/Thesis Projects

Various experiments have been conducted over the past ten years using several different types of group decision support systems (GDSSs). Many previous GDSS designs have had success in these experiments with brainstorming but have been limited in providing judgment and choice support. TeamChoice for Windows is a multi-criteria decision making GDSS that is currently under development in an effort to overcome the limitations of previous systems and to significantly advance the capabilities of GDSSs. This paper discusses some of the general aspects of GDSSs, existing limitations, and explains the developments and use of TeamChoice for Windows as a multi-criteria decision …

Knowledge-Based Nonuniform Crossover, Harpal Maini, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We present a new "knowledge-based non-uniform crossover" (KNUX) operator for genetic algorithms (GA's) that generalizes uniform crossover. We extend this to "Dynamic KNUX" (DKNUX), which constantly updates the knowledge extracted so far from the environment's feedback on previously generated chromosomes. KNUX can improve on good solutions previously obtained by using other algorithms. The modifications made by KNUX are orthogonal to other changes in parameters of GA's, and can be pursued together with any other proposed improvements. Whereas most genetic search methods focus on improving the move-selection procedures, after having chosen a fixed move-generation mechanism, KNUX and DKNUX make the move-generation …

Classification Characteristics Of Som And Art2, J. J. Aleshunas, Daniel C. St. Clair, William E. Bond

Mathematics and Statistics Faculty Research & Creative Works

Artificial neural network algorithms were originally designed to model human neural activities. They attempt to recreate the processes involved in such activities as learning, short term memory, and long-term memory. Two widely used unsupervised artificial neural network algorithms are the Self-Organizing Map (SOM) and Adaptive Resonance Theory (ART2). Each was designed to simulate a particular biological neural activity. Both can be used as unsupervised data classifiers. This paper compares performance characteristics of two unsupervised artificial neural network architectures; the SOM and the ART2 networks. The primary factors analyzed were classification accuracy, sensitivity to data noise, and sensitivity of the algorithm …

Generating Indexing Functions Of Regularly Sparse Arrays For Array Compilers, Scott Thibault, Lenore Mullin, Matt Insall

Computer Science Technical Reports

There are many applications involving arrays that contain non-zero components in regular geometric partitions. These include triangular, diagonal, tridiagonal, banded, etc. When computing with this type of arrays, they are usually stored in a packed form and computations are performed with only the non-zero components. This packed form requires an indexing function that maps an index of the array to an index of the packed lexico-graphically stored array. This paper presents a method of describing regular partitions and of automatically generating an indexing function from that description. These methods enable an array compiler to compile array operations on these type …

Genetic Algorithms And Artificial Life, Melanie Mitchell, Stephanie Forrest

Computer Science Faculty Publications and Presentations

Genetic algorithms are computational models of evolution that play a central role in many artificial-life models. We review the history and current scope of research on genetic algorithms in artificial life, giving illustrative examples in which the genetic algorithm is used to study how learning and evolution interact, and to model ecosystems, immune system, cognitive systems, and social systems. We also outline a number of open questions and future directions for genetic algorithms in artificial-life research

Polylog Depth Circuits For Integer Factoring And Discrete Logarithms, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

AbstractIn this paper, we develop parallel algorithms for integer factoring and for computing discrete logarithms. In particular, we give polylog depth probabilistic boolean circuits of subexponential size for both of these problems, thereby solving an open problem of Adleman and Kompella.

Existing sequential algorithms for integer factoring and discrete logarithms use a prime base which is the set of all primes up to a bound B. We use a much smaller value for B for our parallel algorithms than is typical for sequential algorithms. In particular, for inputs of length n, by setting B = nlogdn with d a positive …

A Performance-Driven Routing Approach For Mcm-C, Qiong Yu

Masters Theses

In this paper, a new routing methodology for Ceramic MultiChip Module (MCM-C) is presented. In the proposed approach, the routing space is partitioned into several towers and the routing process is decomposed into three phases, namely, routing distribution, terminal assignment, and tower routing. During the routing distribution phase, the routing is uniformly distributed among towers. The locations of nets on the faces of each tower are assigned during the terminal assignment phase whereas the exact paths for the nets in each tower are determined during the tower routing phase.

The existing approaches to MCM routing are extensions of two-dimensional approaches …

Global Picture Archiving And Communication Systems (Gpacs): An Overview, Russell C. Ellis

Theses and Dissertations

The world is currently experiencing a computer revolution. With the expansion and development of new computer technology, the age of video is upon us. The medical world is also currently undergoing a dramatic change. With the development and perfection of non-invasive techniques of probing the body, large amounts of computer data is collected and much of it is used to generate images. The organization and management of these images is the topic of this thesis. The discussion of storage schemes, databases, communications and data compression techniques gives the reader a background and some insight to the current state of the …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Maintaining Consistency Of Data In Mobile Distributed Environments, Evaggelia Pitoura, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Tcp Buffering And Performance Over An Atm Network, Douglas E. Comer, John C. Lin

Department of Computer Science Technical Reports

No abstract provided.

Authorship Analysis: Identifying The Author Of A Program, Ivan Krsul

Department of Computer Science Technical Reports

No abstract provided.

Countering Abuse Of Name-Based Authentication, Christoph L. Schuba, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Supporting Complex Data Types In A Relational Distributed Database System, Bharat Bhargava, Yin-He Jiang

Department of Computer Science Technical Reports

No abstract provided.

Dynamic Task Scheduling For The Atamm Multicomputer Operating System Using Embedded Firmware On Microcontrollers, Sudhir Sastry

Electrical & Computer Engineering Theses & Dissertations

A dynamic task scheduling strategy for the distributed processing of large grain dataflow algorithms using embedded firmware on an ATAMM testbed consisting of interconnected microcontrollers is presented in this thesis. The ODU/NASA developed Algorithm to Architecture Mapping Model, ATAMM, uses marked graph models to specify data and control flow for the execution of iterative, deterministic large grain dataflow algorithms in a multicomputing environment. The testbed consists of a bank of four 68HC11 microcontrollers that communicate over a token bus. The token bus arbitration scheme used is contention free and well suited for real-time computing applications. The execution of data flow …

A Multi-Chip Module Implementation Of A Neural Network, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout

Faculty Publications

The requirement for dense interconnect in artificial neural network systems has led researchers to seek high-density interconnect technologies. This paper reports an implementation using multi-chip modules (MCMs) as the interconnect medium. The specific system described is a self-organizing, parallel, and dynamic learning model which requires a dense interconnect technology for effective implementation; this requirement is fulfilled by exploiting MCM technology. The ideas presented in this paper regarding an MCM implementation of artificial neural networks are versatile and can be adapted to apply to other neural network and connectionist models.

Adaptive Execution Of Data Parallel Computations On Networks Of Heterogeneous Workstations, Robert Prouty, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Parallel environments consisting of a network of heterogeneous workstations introduce an inherently dynamic environment that differs from multicomputers. Workstations are usually considered “shared” resources while multicomputers provide dedicated processing power. The number of workstations available for use is continually changing; the parallel machine presented by the network is in effect continually reconfiguring itself. Application programs must effectively adapt to the changing number of processing nodes while maintaining computational efficiency. This paper examines methods for adapting to this dynamic environment within the framework of explicit message passing under the data parallel programming model. We present four requirements which we feel a …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Effective Parallel Algorithm Animation, Paul W. Chase

Theses and Dissertations

The AFIT Algorithm Animation Research Facility AAARF was developed by the Air Force Institute of Technology AFIT as a teaching aid for data structures and algorithm design. In particular, an extensive set of performance animations has been developed for the Intel iPSC Hypercube parallel processing system. This research focuses in part on developing animation support for discrete event simulation, mission routing, and evolutionary algorithms based on abstract representations of parallel algorithm behavior. The effort also builds extensions to the AAARF system and examines direction for further research. An innovative adaptable application-specific animation construction environment has been designed and implemented. The …

Dyadic Wavelet Features For Isolated Word Speaker Dependent Speech Recognition, Stephen Ainge

Theses and Dissertations

This research examines the use of dyadic wavelet features for the recognition of speaker dependent isolated word speech. The features were generated using three different wavelet filters-Daubechies 4 coefficient (Db4), Daubechies 20 coefficient (Db20) and a 31 coefficient cubic spline and three different window lengths-15ms, 8ms and 4ms. The accuracy of the standard and over-sampled dyadic wavelet methods were compared. The over-sampled dyadic wavelet method using the Db4 scaling function, with a maximum accuracy of 65.5, was found to be the most accurate of the wavelet methods tested. The accuracy of this over-sampled dyadic Db4 wavelet method was compared to …

Clustering Techniques In Speaker Recognition, Douglas N. Prescott

Theses and Dissertations

This thesis presents a comparison based on identification rate, of three clustering techniques applied to cepstral features for speaker identification. LBG vector quantization as developed by Linde, Buzo and Gray; is used to provide benchmark performance for comparison with Fuzzy clustering (based on the unsupervised fuzzy partition-optimal number of classes, UFP-ONC algorithm by Gath and Geva) and an Artificial Neural Network, the Multilayer Perceptron. Cepstral features from the TIMIT, King and AFIT93 corpus speaker databases are used to produce speaker-identification classifiers using each of the clustering algorithms. The experiment reported evaluates the speaker identification performance using the 20-dimensional cepstral features …

Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson

Theses and Dissertations

Large-scale structural optimization problems are often difficult to solve with reasonable efficiency and accuracy. Such problems are often characterized by constraint functions which are not explicitly defined. Constraint and gradient functions are usually expensive to evaluate. An optimization approach which uses the NLPQL sequential quadratic programming algorithm of Schittkowski, integrated with the Automated Structural Optimization System ASTROS is tested. The traditional solution approach involves the formulation and solution of an explicitly defined approximate problem during each iteration. This approach is replaced by a simpler approach in which the approximate problem is eliminated. In the simpler approach, each finite element analysis …

A Simulation Approach To Granite Sentry System Analysis, Marilyn J. Bauer

Theses and Dissertations

This study demonstrated the use of simulation modelling to analyze Granite Sentry system performance. The availability simulation model constructed provides a number of system performance measures as a function of component MTBFs and MTTRs. Analysis of failure data prior to model construction supported the generally accepted use of exponentially distributed failure rates and lognormally distributed repair times.

The Effective Use Of Animation In Simulation Model Validation, Christopher L. Swider

Theses and Dissertations

This study examined two animation displays moving icons, bar graphs at two presentation speeds to determine how each of these factors affected the animations ability to communicate violations of model assumptions. Subjects viewed animation displays individually and in combination at each presentation speed. Eight problem scenarios were presented to evaluate each animations ability to communicate violations of different assumptions. Each animations communication ability was measured subjectively and objectively. Subjective measures in the form of pairwise comparisons were used to calculate normalized preference ratings for each animation. objective measures included problem identification accuracy and problem time. Subjective results indicated that moving …

Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson

Theses and Dissertations

This research proposes an analytical approach for assessing flow disturbance, or compromise, based on limited sampling of arc flow information in multi-commodity, or multiple origin-destination O-D, networks with failing arcs. There were three objectives established for this research. The first objective was to bound the expected flow, given the arcs fail with certain probabilities, which was accomplished by reviewing current approaches for single-commodity networks and extending the results to the multi-commodity case. The second objective was to determine the best placement of flow monitors to obtain the most accurate estimates of O-D pair volumes. This was accomplished using a multi-criteria …

Efficient Sequential And Parallel Algorithms For The Negative Cycle Problem, Dimitris Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis

Computer Science Technical Reports

We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an $n$-vertex planar digraph $G$ with real edge weights. Its running time ranges from $O(n)$ up to $O(n^{1.5}\log n)$ as a certain topological measure of $G$ varies from $1$ up to $\Theta(n)$. Moreover, an efficient CREW PRAM implementation is given. Our algorithm applies also to digraphs whose genus $\gamma$ is $o(n)$.

Conference On A Disk: A Successful Experiment In Hypermedia Publishing (Extended Abstract), M Cheyney, P Gloor, D B. Johnson, F Makedon, J Matthews, P Metaxas

Computer Science Technical Reports

Academic conferences are a long-standing and effective form of multimedia communication. Conference participants can transmit and recieve information through sight, speech, gesture, text, and touch. This same-time, same-place communication is sufficiently valuable to justify large investments in time and travel funds. Printed conference proceedings are attempts to recapture the value of a life conference, but they are limited by a fragmented and inefficient approach to the problem. We addressed this problem in the multimedia proceedings of the DAGS'92 conference. The recently published CD-ROM delibers text, graphic, audio, and video information as an integrated whole, with extensive provisions for random access …

Videoscheme: A Research, Authoring, And Teaching Tool For Multimedia, J Matthews, F Makedon, P Gloor

Computer Science Technical Reports

The availability of digital multimedia technology poses new challenges to researchers, authors, and educators, even as it creates new opportunities for rich communication. This paper suggests interactive computer programming as a fruitful approach to these challenges. VideoScheme, a prototype video programming environment, is described along with promising applications.

Quickest Paths: Faster Algorithms And Dynamization, Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis

Computer Science Technical Reports

Given a network $N=(V,E,{c},{l})$, where $G=(V,E)$, $|V|=n$ and $|E|=m$, is a directed graph, ${c}(e) > 0$ is the capacity and ${l}(e) \ge 0$ is the lead time (or delay) for each edge $e\in E$, the quickest path problem is to find a path for a given source--destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast data transmissions in communication networks. The best previous algorithm for the single--pair quickest path problem runs in time $O(r m+r n \log n)$, where $r$ is the number …

Decoding Linear Block Codes Using A Priority-First Search: Performance Analysis And Suboptimal Version, Yunghsiang S. Han, Carlos R.P. Hartmann, Kishan Mehrotra

Electrical Engineering and Computer Science - Technical Reports

An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra's Algorithm was proposed by Han, Hartmann, and Chen. In this report we prove that this algorithm is efficient for most practical communication systems where the probability of error is less than 10-3 by finding an upper bound of the computation performance of the algorithm. A suboptimal decoding algorithm is also proposed. The performance of this suboptimal decoding algorithm is within 0.25 dB and 0.5 dB of the performance of an optimal decoding algorithm for the (104, 52) binary extended quadratic residue code and the (128, 64) …