Digital Commons Network^™

A Framework For Flexible Transaction Management In Multidatabase Systems, Aidong Zhang, Omran Bukhres, Ahmed Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Policy And Procedures Manual: Department Of Computer Sciences, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Performance Of A Token-Passing System With Batch Arrivals And Its Application To File Transfers, Robert H. Deng, Xuanyu Zhang, Kuan Tase Huang

Research Collection School Of Computing and Information Systems

This paper investigates the performance of token-passing systems with limited service and Poisson arrivals. For pure Poisson arrivals, the Laplace-Stieltjes Transform (LST) of an approximate customer/packet waiting time distribution is derived and expressed as a functional equation, from which the approximate mean and variance of waiting time are obtained; for batch Poisson arrivals, an approximate mean of waiting time is derived. Mean waiting time approximations are compared against both simulation results and other results presented in the literature; the variance approximation is evaluated by comparing it to simulation results only, since no other results on variance have been reported so …

Performance Analysis Of Interconnected Lans With Server/Client Configuration, Jiangling Du, Robert H. Deng, Chi Chung Ko

Research Collection School Of Computing and Information Systems

In this paper, we study the end-to-end performance of interconnected local area networks (LAN) with server/client configuration. The system uses bridges to connect two token-ring LANs through a high-speed communication link. A server station located on one LAN receives requests from client-stations on the same LAN as well as on the remote LAN, processes the requests, and returns responses to the client-stations. The end-to-end connections of the interconnected network are modelled as single-chain and multiple-chain closed queueing systems, which are solved by an iterative algorithm based on the MVA (mean value analysis) method. The performance examples are shown in terms …

A General Method For Maximizing The Error-Detecting Ability Of Distributd Algorithms, Martina Schollmeyer, Bruce M. Mcmillin

Computer Science Technical Reports

Error-detecting algorithms can determine when, at run time, a program deviates from its expected behavior due to a hardware, software or communication error. In a fixed interconnect multiprocessor system, the error detecting ability heavily depends on the number of faults, which is bounded, and their spatial distribution. Otherwise multiple fault occurrences can mask each other. This paper provides a general method for computing the overall system failure bound, the maximal fault index, from the system topology and local communication patterns. The result of the computation is used to design a mapping of processes to processor groups such that multiple processor …

Putting Humpty-Dumpty Together Again: Reconstructing Functions From Their Projections., Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We present a problem decomposition approach to reduce neural net training times. The basic idea is to train neural nets in parallel on marginal distributions obtained from the original distribution (via projection), and then reconstruct the original table from the marginals (via a procedure similar to the join operator in database theory). A function is said to be reconstructible, if it may be recovered without error from its projections. Most distributions are non-reconstructible. The main result of this paper is the Reconstruction theorem, which enables non-reconstructible functions to be expressed in terms of reconstructible ones, and thus facilitates the application …

Off-Line Cursive Handwriting Recognition Using Style Parameters, Berrin A. Yanikoglu, Peter A. Sandon

Computer Science Technical Reports

We present a system for recognizing off-line cursive English text, guided in part by global characteristics of the handwriting. A new method for finding the letter boundaries, based on minimizing a heuristic cost function, is introduced. The function is evaluated at each point along the baseline of the word to find the best possible segmentation points. The algorithm tries to find all the actual letter boundaries and as few additional ones as possible. After size and slant normalizations, the segments are classified by a one hidden layer feedforward neural network. The word recognition algorithm finds the segmentation points that are …

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

Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih

Computer Science: Faculty Publications and Other Works

The paper provides an efficient method to find all feasible offsets for a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only for problems with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Theta(n) to Omega(n^2), where n is the number of nets. But, if the number of columns c is O(n), one can solve the problem in time O(n^{1.5}lg n ), which improves upon a `naive' O(cn) approach. As a corollary of this result, the same time bound suffices to find the optimal offset …

Dmodel And Dalgebra : A Data Model And Algebra For Office Documents, Fortune Solani Mhlanga

Dissertations

This dissertation presents a data model (called D_model) and an algebra (called D_ algebra) for office documents. The data model adopts a very natural view of modeling office documents. Documents are grouped into classes; each class is characterized by a "frame template", which describes the properties (or attributes) for the class of documents. A frame template is instantiated by providing it with values to form a "frame instance" which becomes the synopsis of the document of the class associated with the frame template. Different frame instances can be grouped into a folder. Therefore, a folder is a set of frame …

Megsdf Mega-System Development Framework, Tamar Zemel

Dissertations

A framework for developing large, complex software systems, called Mega-Systems, is specified. The framework incorporates engineering, managerial, and technological aspects of development, concentrating on an engineering process. MegSDF proposes developing Mega-Systems as open distributed systems, pre-planned to be integrated with other systems, and designed for change.

At the management level, MegSDF divides the development of a Mega-System into multiple coordinated projects, distinguishing between a meta-management for the whole development effort, responsible for long-term, global objectives, and local managements for the smaller projects, responsible for local, temporary objectives.

At the engineering level, MegSDF defines a process model which specifies the tasks …

Techniques Of Petri Net Reduction, Sreeranga Kalavapalli

Theses

Petri Nets have the capability to analyze large and complex concurrent systems. However, there is one constraint. The number of reachability states of the concurrent systems outweighs the capability of Petri Nets. Previous Petri Net reduction techniques focussed on reducing a subnet to a single transition and hence not powerful enough to reduce a Petri Net. This paper presents six reduction rules and discusses their drawbacks. A new reduction technique called Knitting Technique to delete paths of a Petri Net while retaining all the properties of the original net is presented. Further Structural matrix which facilitates reduction is presented.

Throughput Of Existing Multiprocessor File Systems (An Informal Study), David Kotz

Computer Science Technical Reports

Fast file systems are critical for high-performance scientific computing, since many scientific applications have tremendous I/O requirements. Many parallel supercomputers have only recently obtained fully parallel I/O architectures and file systems, which are necessary for scalable I/O performance. Scalability aside, I show here that many systems lack sufficient absolute performance. I do this by surveying the performance reported in the literature, summarized in an informal table.

The State Of Computer Science Facilities Of Schools Across The United States That Are Comparable To Illinois Wesleyan University, Sarah A. Bartz '93

Honors Projects

The purpose of this study is to compare Illinois Wesleyan's academic computer facilities with those at other comparable U.S. colleges and universities. This study also investigates factors affecting these facilities such as the methods other institutions use to deal with and plan for the constantly changing computer world. To obtain this information a survey was mailed to over 250 institutions across the U.S. that were considered comparable to IWU. These institutions include the Associated Colleges of the Midwest, the Oberlin Group, and some of the top colleges and universities in the U.S. as ranked in U.S. News and World Report's …

The Design, Analysis, And Implementation Of Parallel Simulated Annealing And Parallel Genetic Algorithms For The Composite Graph Coloring Problem, Brent S. Elmer, Billy E. Gillett

Computer Science Technical Reports

The composite graph coloring problem (CGCP) is similar to the standard graph coloring problem (SGCP). Associated with each vertex of a composite graph is a positive integer which represents the chromaticity of that vertex. This number is the number of consecutive integers (colors) which must be assigned to the vertex. The goal of the CGCP is to color the graph with as few colors as possible. The largest integer used in the coloring is called the chromatic number of the graph. The CGCP is proven to be NP-complete.

Exact, heuristic, and stochastic methods are analyzed and compared. Exact methods are …

The Third International Conference On Expert Systems For Numerical Computing, Elias N. Houstis, John R. Rice, Robert Vichnevetsky

Department of Computer Science Technical Reports

No abstract provided.

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

Parallel Electronic Prototyping Of Physical Objects, Poting Wu, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Building A Large Scale Distributed Object System For A Multilingual Programming Environment, Patrick A. Muckelbauer, Vincent F. Russo

Department of Computer Science Technical Reports

No abstract provided.

Federated Autonomous Databases: Project Overview, Satya Prabhakar, Jiandong Huang, James Richardson, Jaideep Srivastava, Ee Peng Lim, Sham Navathe, Ashok Savarase, Mark Foresti

Research Collection School Of Computing and Information Systems

The paper presents an overview of an ongoing research program, Federated Autonomous Databases, sponsored by Rome Laboratory (US Air Force) and conducted by Honeywell in collaboration with the University of Minnesota and Georgia Institute of Technology. This program is exploratory in nature and is aimed at understanding and solving, within the scope of the program definition, the problem of providing integrated access to distributed, heterogeneous and autonomous databases.

Integrating Theory And Practice In Parallel File Systems, Thomas H. Cormen, David Kotz

Computer Science Technical Reports

Several algorithms for parallel disk systems have appeared in the literature recently, and they are asymptotically optimal in terms of the number of disk accesses. Scalable systems with parallel disks must be able to run these algorithms. We present a list of capabilities that must be provided by the system to support these optimal algorithms: control over declustering, querying about the configuration, independent I/O, turning off file caching and prefetching, and bypassing parity. We summarize recent theoretical and empirical work that justifies the need for these capabilities.

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

Dynamic Id3: A Symbolic Learning Algorithm For Many-Valued Attribute Domains, Roger Gallion, Chaman Sabharwal, Daniel C. St. Clair, William E. Bond

Computer Science Faculty Research & Creative Works

Quinlan's ID3 machine learning algorithm induces classification trees (rules) from a set of training examples. The algorithm is extremely effective when training examples are composed of attributes whose values are taken from small discrete domains. The classification accuracy of ID3-produced trees on domains whose attributes are many-valued tends to be marginal due to the large number of possible values which may be associated with each attribute. Attempts to solve this problem by a priori grouping of attribute values into distinct subsets has met with limited success. The dynamic ID3 algorithm improves the performance of ID3 on this type of problem …

Simulated Annealing And Optimal Codes, Gary R. Greenfield

Department of Math & Statistics Technical Report Series

Following standard notation, an (n, m, d) code C denotes a binary code C which has length n, size m, and Hamming distance d. According to Hill [6] the “main coding theory problem” is to optimize one of these three parameters when the other two are held fixed. The usual version of this optimization problem is to find the largest code for a given length and given minimum distance. This is the problem we shall consider, thus making it clear what we mean by an “optimal code.”

Back-Face Culling Applied To Collision Detection Of Polyhedra, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

Recovering 3d Image Parameters From Corresponding Two 2d Images, Chaman Sabharwal

Computer Science Faculty Research & Creative Works

An improved algorithm for computing the three-dimensional structure of a scene from pair of stereo images is given. The spatial relationship between the two images is not known, only the "corresponding" points in the two images are known. This problem of 3D scene reconstruction involves: (1) establishing a one-to-one correspondence between the image plane stereo pairs corresponding to the spatial points-'the correspondence problem', and (2) determining the relative orientation of the two image planes and the depth relation of spatial points with respect to the image planes. This paper assumes the first problem solved [Usikov et al. 1991] and addresses …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 9, Number 2, February 1993, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Decentralized Global Transaction Management In Multidatabase Systems, Aidong Zhang, Jiansan Chen, Ahmed K. Elmagarmid, Omran Bukhres

Department of Computer Science Technical Reports

No abstract provided.

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.

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 …