Digital Commons Network^™

Systems Integration In Pharmaceutical Industry Using Object-Oriented Expert System Technology, Korrapolu Reddy

Theses

SPHINX is an object-oriented expert system addressed to solve the burning problems of pharmaceutical industry. SPHINX stands for Systems integration in PHarmaceutical INdustry using object-oriented eXpert system technology.

Various problems that American pharmaceutical industries are facing have been explained. Using the revolutionary object-oriented concepts and the powerful expert systems technology, it has been shown how a prescription can be written to solve all the problems of pharmaceutical industries. A problem "Minimizing the wastage of Interferon" has been taken to demonstrate the power of Object-oriented Expert System technology.

Protocol Conformance Test Generation Using Circular Uio With Overlapping, Sesharao Patchipala

Theses

The purpose of the protocol conformance testing is to ensure that protocol implementations are consistent with their specifications. After the U-method was introduced, several test methods based on the Unique Input/Output (UI0) sequences which were the main concept in the U-method have been proposed, namely, the RCP-method, MUIO-method, MUIO with overlapping method, B-method, C-method. A good test sequence must be short and have wide fault coverage. By comparing the test sequences generated by the above test methods based on experimental results, reveals that the test sequences by the MUIO with overlapping method are the worst in quality but their lengths …

Computer Implementation Of Mason's Rule And Software Development Of Stochastic Petri Nets, Xiaoyong Zhao

Theses

A symbolic performance analysis approach for discrete event systems can be formulated based on the integration of Petri nets and Moment Generating Function concepts [1-3]. The key steps in the method include modeling a system with arbitrary stochastic Petri nets (ASPN), generation of state machine Petri nets with transfer functions, derivation of equivalent transfer functions, and symbolic derivation of transfer functions to obtain the performance measures. Since Mason's rule can be used to effectively derive the closed-form transfer function, its computer implementation plays a very important role in automating the above procedure. This thesis develops the computer implementation of Mason's …

Genetic Algorithms For Vertex Splitting In Dags, Matthias Mayer, Fikret ErçAl

Computer Science Technical Reports

Directed Acyclic Graphs are often used to model circuits and networks. The path length in such Directed Acyclic Graphs represents circuit or network delays. In the vertex splitting problem, the objective is to determine a minimum number of vertices from the graph to split such that the resulting graph has no path of length greater than a given δ. The problem has been proven to be NP-hard. A Genetic Algorithm is used to solve the DAG Vertex Splitting Problem. This approach uses a variable string length to represent the vertices that split the graph and a dynamic population size. The …

Intermediate Code Generation For Portable Scalable, Compilers. Architecture Independent Data Parallelism: The Preliminaries, Lenore Mullin, C. Chang, S. Huang, Matthias Mayer, N. Nemer, C. Ramakrishna

Computer Science Technical Reports

This paper introduces the goals of the Portable, Scalable, Architecture Independent (PSI) Compiler Project for Data Parallel Languages at the University of Missouri-Rolla. A goal of this project is to produce a subcompiler for data parallel scientific programming languages such as HPF(High Performance Fortran) where the input grammar is translated to a three-address code intermediate language. Ultimately we plan to integrate our work into automated synthesis systems for scientific programming because we feel that it should not be necessary to learn complicated programming techniques to use multiprocessor computers or networks of computers effectively. This paper shows how to compile a …

Modeling Of Supersonic Combustor Flows Using Parallel Computing, Bruce M. Mcmillin, Eric Jui-Lin Lu, Larry Reeves

Computer Science Technical Reports

Computational Fluid Dynamics (CFD) has matured rapidly in the past 20 years and is now an important tool for analyzing and understanding complex fluid flows. Since 1985, CFD has played a vital role in the study of hypersonic flight. It has provided the capability for scientists and engineers to model both internal and external hypersonic flow-fields. Such flows are often impractical or impossible to analyze in laboratory conditions. In particular, the recent application of CFD to the modeling of internal reacting supersonic combustor flows has significantly advanced the understanding of such flows and has increased confidence in the predictive ability …

The Computation Of Supersonic Combustor Flows Using Multi-Computers, Bruce M. Mcmillin, Eric Jui-Lin Lu, Larry Reeves

Computer Science Technical Reports

An explicit computational fluid dynamics (CFD) computer code with parallel processing capability has been developed for the purpose of simulating internal high-speed reacting flows. The code solves the three-dimensional Navier-Stokes equations for compressible flows. The CFD code can be executed on either sequential (single processor) computers or multi-computers (multiple processor machines with distributed memory and message passing between processors). The parallel implementation involves homogeneous domain decomposition between processors with message passing needed only between neighbor processors. The code is validated for a compression ramp, an expansion ramp, a viscous flat plate, and a viscous flat plate with wall injection. These …

How To Program In Ccsp, Elizabeth Arrowsmith, Bruce M. Mcmillin

Computer Science Technical Reports

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 1, January 1993, 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.

Emergent Control And Planning In An Autonomous Vehicle, Lisa Meeden, Gary Mcgraw, Doug Blank

Computer Science Faculty Research and Scholarship

No abstract provided.

A Probabilistic Analysis Of A Locality Maintaining Load Balancing Algorithm, Kishan Mehrotra, Sanjay Ranka, Jhy-Chun Wang

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents a simple load balancing algorithm and its probabilistic analysis. Unlike most of the previous load balancing algorithms, this algorithm maintains locality. We show that the cost of this load balancing algorithm is small for practical situations and discuss some interesting applications for data remapping.

Static And Runtime Scheduling Of Unstructured Communication, Sanjay Ranka, Jyu-Chun Wang

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

With the advent of new routing methods, the distance to which a message is sent is becoming relatively less and less important. Thus assuming no link contention, permutation seems to be an efficient collective communication primitive. All-to-many communication is required for solving a large class of irregular and loosely synchronous problems on distributed memory MIMD machines. In this paper we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. These partial permutations avoid node contention and/or link contention. We discuss several algorithms and study their effectiveness both from the view of static scheduling as …

Solving The Region Growing Problem On The Connection Machine, Nawal Copty, Sanjay Ranka, Geoffrey C. Fox, Ravi Shankar

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the CM-5 in the data parallel and message passing models. The performance of these implementations is examined and compared.

Architectural Support For High-Performance Distributed Computing, Jongbaek Park, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

The emergence of high speed networks and the proliferation of high performance workstations have attracted a lot of interest in workstation-based distributed computing. Current trend in local area networks is toward higher communication bandwidth as we progress from Ethernet networks that operate at 10 Mbit/sec to higher speed networks that can operate in Gbit/sec range. Also, current workstations are capable of delivering tens and hundreds of Megaflops of computing power. By using a cluster of such high-performance workstations and the high-speed networks, a high-performance distributed computing environment could be built in cost-effective manner as an alternative of supercomputing platform. However, …

Formal Method For Scheduling, Routing And Communication Protocol, Lenore Mullin, S. A. Thibault, D. R. Dooling, E. A. Sandberg

Computer Science Faculty Research & Creative Works

The PRAM model has been shown to be an optimal design for emulating both loose and tightly coupled multiprocessors for unit time operations. When virtual processors are required, multiplexing work to available processors is employed. This introduces a form of latency incurred by operating system overhead. Further complications arise when bandwidth creates bottlenecking of work units. G.E. Blelloch (1989) showed how to add parallel prefix operations (scans) to an extended PRAM model which uses unit step, not time operations. This paper shows how the psi) calculus can be used to group work units, i.e., pipelining the work units, so that …

Runtime Compilation Techniques For Data Partitioning And Communication Schedule Reuse, Ravi Ponnusamy, Joel Saltz, Alok Choudhary

Northeast Parallel Architecture Center

In this paper, we describe two new ideas by which HPF compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of compiler directives. The directives allow the user to use program arrays to describe graph connectivity, spatial location of army elements and computational load. The second is a simple conservative method that in many cases enables a compiler to recognize that it is possible to reuse previously computed results from inspectors (e.g. communication schedules, loop iteration partitions, information that associates off-processor data copies with on-processor buffer locations). We present performance …

A Fast Serial Algorithm For The Finite Temperature Quenched Potts Model, Gregory N. Hassold, Elizabeth A. Holm

Physics Publications

An efficient serial algorithm for finite temperature, quenched Potts model simulations of domain evolution has been developed. This ''n‐fold way'' algorithm eliminates unsuccessful spin flip attempts a priori by flipping sites with a frequency proportional to their site activity, defined as the sum of the probability of success for every possible spin flip at that site. Finite temperature efficiency for high‐spin degeneracy systems is achieved by utilizing a new, analytical expression for the portion of the site activity due to flips to non-neighbor spin values. Hence, to determine the activity of a site, only flips to the …

Fast Mapping And Remapping Algorithms For Irregular And Adaptive Problems, Chao Wei Ou, Sanjay Ranka, Geoffrey C. Fox

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper describes the performance of locality-based mapping and remapping partitioners for unstructured grids. We show that the algorithm produces good mappings at a relatively low cost and can be easily parallelized. Further, the algorithm can provide remapping for incremental problems at a fraction of the total cost.

A Model For Syntactic Control Of Interference, Peter W. O'Hearn

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Two imperative programming language phrases interfere when one writes to a storage variable that the other reads from or writes to. Reynolds has described an elegant linguistic approach to controlling interference in which a refinement of typed λ-calculus is used to limit sharing of storage variables; in particular, different identifiers are required never to interfere. This paper examines semantic foundations of the approach. We describe a category that has (an abstraction of) interference information built into all objects and maps. This information is used to define a “tensor” product whose components are required never to interfere. Environments are defined using …

Distributed Scheduling Of Unstructured Collective Communication On The Cm-5 (1993), Jyu-Chun Wang, Tseng-Hui Lin, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Parallelization of many irregular applications results in unstructured collective communication. In this paper we present a distributed algorithm for scheduling such communication on parallel machines. We describe the performance of this algorithm on the CM-5 and show that the scheduling algorithm has very small overhead and gives a significant improvement over naive methods.

Ccis Networking - January 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond

Computer Science Faculty Research & Creative Works

Functional reasoning, a subfield of model-based reasoning, is discussed. This approach uses abstractions of a device's purpose to index behaviors that achieve that purpose. Functional modeling, a variation on this method, also uses simulation as a core reasoning strategy. The complex causal knowledge of a device along functional lines is decomposed, then a causal story of how the device will operate in a particular situation given stated boundary conditions is composed. The application of the functional approach to modeling the fuel system of a F/A-18 aircraft is described. The representation of the F/A-18 fuel system includes 89 component devices, 92 …

Georg Cantor And The Battle For Transfinite Set Theory, Joseph Dauben

ACMS Journal 2004

Georg Cantor is well known as the founder of transfinite set theory. Equally celebrated, however, are the obstacles he faced in trying to win acceptance for his seemingly unorthodox views, his acrimonious differences with Leopold Kronecker and his unfortunate but progressively debilitating nervous breakdowns that some authors have linked directly to his many problems with set theory. Above all, Cantor's justification of set theory was all the more urgent because of Kronecker's critical denunciation of Cantor's mathematics. In tracing the evolution of Cantorian set theory, it is necessary to examine the opposition it met, and evaluate the technical, philosophical, psychological, …

Digital Information In The Peel-Harvey Catchment Area, Dennis Van Gool

Agriculture reports

This paper presents a summary of the main features of the digital mapping data available in the Peel-Harvey Catchment area. This type of information is essential for Geographic Information System (GIS) users to assess projects involving the use of digital data such as plotting of mapped themes, topological overlays, area calculations and reporting.

Monitoring Shared Memory: A Toolset Prototype For The Informix Online Administrator, Eric Gronholz

Honors Theses, 1963-2015

The "Monitor" Program was developed to assist system administrators for the INFORMIX OnLine Database Server with their evaluation of shared memory components used on their system. Using the Open Software Foundation (OSF)/Motif Widget set for Xt Intrinsics on the X Window System, this program creates scaled dials and pop-up windows to display system information at regular intervals. The program is surprisingly simple to operate and is general enough that with just a few modifications, it can be used to monitor any system information, not just shared memory information for OnLine. This program marks a new way to look at systems …

Software And Hardware Support For Workstation-Based, Salim Hariri, Manish Parashar, Jongbaek Park

Electrical Engineering and Computer Science - All Scholarship

The proliferation of high performance workstations and the emergence of high speed networks have attracted a lot of interest in workstation-based supercomputing. We project that workstation-based environments with supercomputing capabilities will be available in the not-so-distant future. However a number of hardware and software issues have to be resolved before the full potential of these workstation-based supercomputing environments can be exploited. The presented research has two main objectives: (1) to investigate the limitations of communications techniques used in current workstation-based systems and to identify a set of requirements that must be satisfied to achieve workstation-based supercomputing; (2) to use these …

When Will A Genetic Algorithm Outperform Hill-Climbing?, Melanie Mitchell, John H. Holland

Computer Science Faculty Publications and Presentations

In this paper we review some previously published experimental results in which a simple hillclimbing algorithm-Random Mutation Hill-Climbing (RMHC)-significantly outperforms a genetic algorithm on a simple "Royal Road" function. vVe present an analysis of RMHC followed by an analysis of an "idealized" genetic algorithm (IGA) that is in turn significantly faster than RMHC. We isolate the features of the IGA that allow for this speedup, and discuss how these features can be incorporated into a real GA and a fitness landscape, making the GA better approximate the IGA. We use these features to design a modified version of the previously …

Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield

Computer Science Faculty Publications and Presentations

No abstract provided.

On Extremal Nonsupereulerian Graphs With Clique Number M, Zhi-Hong Chen

Scholarship and Professional Work - LAS

No abstract provided.

On The Edge Arboricity Of A Random Graph, P. A. Catlin, Zhi-Hong Chen, E. M. Palmer

Scholarship and Professional Work - LAS

No abstract provided.