Digital Commons Network^™

The Integration Of Database Systems, Tony Schaller, Omran A. Bukhres, Ahmed K. Elmagarmid, Xiangning Liu

Department of Computer Science Technical Reports

No abstract provided.

Design And Implementation Of A Threads Library, Janche Sang, Felipe Knop, Vernon Rego

Department of Computer Science Technical Reports

No abstract provided.

Convergence Analysis Of A Non-Overlapping Domain Decomposition Method For Elliptic Pdes, John R. Rice, E. A. Vavalis, D. Yang

Department of Computer Science Technical Reports

No abstract provided.

Real Time Texture Analysis From The Parallel Computation Of Fractal Dimension, Halford I. Hayes Jr.

Computer Science Theses & Dissertations

The discrimination of texture features in an image has many important applications: from detection of man-made objects from a surrounding natural background to identification of cancerous from healthy tissue in X-ray imagery. The fractal structure in an image has been used with success to identify these features but requires unacceptable processing time if executed sequentially.

The paradigm of data parallelism is presented as the best method for applying massively parallel processing to the computation of fractal dimension of an image. With this methodology, and sufficient numbers of processors, this computation can reach real time speeds necessary for many applications. A …

Multilevel Parallel Communications, Sanjay Khanna

Computer Science Theses & Dissertations

The research reported in this thesis investigates the use of parallelism at multiple levels to realize high-speed networks that offer advantages in throughput, cost, reliability, and flexibility over alternative approaches. This research specifically considers use of parallelism at two levels: the "upper" level and the "lower" level. At the upper level, N protocol processors perform functions included in the transport and network layers. At the lower level, M channels provide data and physical layer functions. The resulting system provides very high bandwidth to an application. A key concept of this research is the use of replicated channels to provide a …

A Framework For Data Sharing In Computer Supported Cooperative Environments, Mohamed Youssef Eltoweissy

Computer Science Theses & Dissertations

Concurrency control is an indispensable part of any information sharing system. Co-operative work introduces new requirements for concurrency control which cannot be met using existing applications and database management systems developed for non-cooperative environments. The emphasis of concurrency control in conventional database management systems is to keep users and their applications from inadvertently corrupting data rather than support a workgroup develop a product together. This "insular" approach is necessary because applications that access the database have been built with the assumptions that they have exclusive access to the data they manipulate and that users of these applications are generally oblivious …

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 …

Operational Evaluation Of Responsiveness Properties, Grace Tsai, Matt Insall, Bruce M. Mcmillin

Computer Science Technical Reports

In this paper, a new technique for ensuring run-time satisfaction of properties-specifically responsiveness property, a subset of liveness property, in responsive systems, is presented. Since whether the run-time behavior of a system is satisfied depends on the execution (operational) environment, we develop a translation which takes into account the constraints in the operational environment, and generates histories for each process in the system. Thus, every process can utilize its history to operationally evaluate the system behavior and signal errors if its history is violated. Therefore, this technique provides software safety, handles error-detection, and ensures run-time satisfaction of responsiveness property in …

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 …

Designing A Unix Novice Interface, Lee K. Seitz

Honors Capstone Projects and Theses

No abstract provided.

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 …

On Inverse Sigmoid Functions, Anil Ravindran Menon, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

Networks with sigmoid node functions have been shown to be universal approximators, and can use straightforward implementations of learning algorithms. Mathematically, what is common to different sigmoid functions used by different researchers? We establish a common representation of inverse sigmoid functions in terms of the Guass Hypergeometric function, generalizing different node function formulations. We also show that the continuous Hopfield network equation can be transformed into a Legendre differential equation, without assuming the specific form of the node function; this establishes a link between Hopfield nets and the method of function approximation using Legendre polynomials

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 …

A Conjectured Paradigm Shift In 21st Century Mathematics Pedagogy, Paul Isihara

ACMS Conference Proceedings 1993

With greater and greater capacity for automated content delivery, the role of teachers may shift increasingly to providing the human touch in pedagogy such as love for students.

A New Look At An Old 3:16 An Acms Devotional, Russell W. Howell

ACMS Conference Proceedings 1993

This paper examines John 3:16 in the bible by examining the language and cultural backgrounds of the verse.

Knuth's (1, 2, 1) Unstacking, Paul J. Zwier

ACMS Conference Proceedings 1993

This presentation is dedicated to Donald Knuth who has proposed many interesting and challenging problems in the Problems Section of The American Mathematical Monthly. The problem considered ist hat proposed by Barry Hayes, Knuth, and Carlos Subi (E3267 [1988,456]). The published solution, due to Albert Nijenhuis, just recently appeared in the March 1993 Monthly, pages 292-294.

The problem is as follows. Suppose that we are given n piles of blocks; the i-th pile having ai blocks, i = 1, 2, …, n. Dismantle the piles by choosing a pile having 2 or more blocks, removing …

Paper Abstracts, Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Using Maple To Teach Calculus, Ken Rietz

ACMS Conference Proceedings 1993

No abstract provided.

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

ACMS Conference Proceedings 1993

No abstract provided.

Introduction (1993), Russell Howell

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

Using Matlab And Mathematica In Numerical Analysis, John H. Matthews

ACMS Conference Proceedings 1993

No abstract provided.

Abraham Robinson (1918-1974): The Man And The Mathematics, Joseph W. Dauben

ACMS Conference Proceedings 1993

No abstract provided.

Infinity And The Absolute: Insights Into Our World, Our Faith, And Ourselves, Tim Pennings

ACMS Conference Proceedings 1993

No abstract provided.

Devotional Reflections, Jonathan Leech

ACMS Conference Proceedings 1993

No abstract provided.

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

ACMS Conference Proceedings 1993

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, …

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

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

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

ACMS Conference Proceedings 1993

Paradigm Shifts in the Mathematical Sciences

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.

Ua66/3/2 Computer Science Alumni Newsletter, Vol. 8, Wku Computer Science

WKU Administration Documents

Newsletter created by WKU Computer Science for alumni of the program. This issue includes list of faculty research and scholarly activity and results of alumni survey.

Fast Accurate Simulation Of Large Shared Memory Multiprocessors, Bob Boothe Phd

Faculty Publications

Fast computer simulation is an essential tool in the design of large parallel computers. Our Fast Accurate Simulation Tool, FAST, is able to accurately simulate large shared memory multiprocessors and their execution of parallel applications at simulation speeds that are one to two orders of magnitude faster than previous comparable simulators. The key ideas involve execution driven simulation techniques that modify the object code of the application program being studied. This produces an augmented version of the code that is directly executed and performs much of the work of the simulation. We extend the previous work by introducing several new …