Computer Sciences Commons^™

Parallel Algorithm Fundamentals And Analysis, Bruce M. Mcmillin, Hanan Lutfiyya, Grace Tsai, Jun-Lin Liu

Computer Science Technical Reports

This session explores, through the use of formal methods, the “intuition” used in creating a parallel algorithm design and realizing this design on distributed memory hardware. The algorithm class NC and the LSTM machine are used to show why some algorithms realize their promise of speedup better than others and the algorithm class NP is used to show why other algorithms will never be good for parallelization. Performance and correctness through cooperative axiomatic reasoning and temporal reasoning provide an additional basis for understanding parallel algorithm design and specification. Finally, the realities of algorithm design are presented through partitioning and mapping …

Parallel Algorithm Fundamentals And Analysis, Bruce M. Mcmillin, Hanan Lutfiyya, Grace Tsai, Jun-Lin Liu

Computer Science Technical Reports

This session explores, through the use of formal methods, the “intuition” used in creating a parallel algorithm design and realizing this design on distributed memory hardware. The algorithm class NG and the LSTM machine are used to show why some algorithms realize their promise of speedup better than others and the algorithm class NP is used to show why other algorithms will never be good for parallelization. The realities of algorithm design are presented through partitioning and mapping issues and models. Finally, correctness through cooperative axiomatic reasoning provides an additional basis for understanding parallel algorithm design and specification and is …

X.500 Directory Service Support For Electronic Mail, Mihai G. Sirbu, Fikret ErçAl

Computer Science Technical Reports

One of the difficult problems on the Internet is finding the electronic mail addresses of users. In practice, there are some indirect ways of finding these addresses such as the finger program in UNIX, but almost all of these methods require the user to know the exact host name of the destination. What is most desirable is an automated mechanism which provides the e-mail addresses of users if some minimal information about the destination site is known.

This thesis describes the design of such a directory service support system, based on the X.500 Series of CCITT Recommendation, for the elm …

Genetic Algorithm With 3-Parent Uniform Crossover, L. Vincent Edmondson, Billy E. Gillett

Computer Science Technical Reports

A new genetic algorithm which uses a 3-parent uniform crossover operator is developed and analyzed. Uniform crossover operators are shown to be based on the premise that all bit-level genetic information should be passed from parents to children. The 3-parent uniform crossover operator is shown to adhere to this premise. The 3-parent uniform crossover operator is shown to be better than the 2-parent uniform crossover operator on the De Jong test functions.

Two new genetic algorithms which use 3-parent traditional crossover operators are developed and analyzed. The first uses a strategy of randomly selecting 3 of the 6 children resulting …

A Framework For Controlling Cooperative Agents, Kuo-Chu Lee, William H. Mansfield, Amit P. Sheth

Kno.e.sis Publications

Presents an overview of the ITX (Interacting Transaction) system, which supports complex interactions among cooperating agents in the presence of user interventions that change application objectives and system failures. The system's components and its unique fixed-point criterion for feedback control of iterative interactions are described. An example of a simplified multimedia teleconferencing application is discussed to illustrate the features of the ITX system.

Ccis Networking - July 1993, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

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 …

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 …

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 …

On Object Semantic Similarity In Heterogeneous Database Integration, Xiangning Lui, Omran A. Bukhres

Department of Computer Science Technical Reports

No abstract provided.

A Semi-Linear Elliptic Pde Model For The Static Solution Of Josephson Junctions, J. G. Caputo, N. Flytzanis, E. A. Vavalis

Department of Computer Science Technical Reports

No abstract provided.

Converting A Rational Function To A Standard Nurbs Representation, Chandrajit Bajaj, Guoliang Xu

Department of Computer Science Technical Reports

No abstract provided.

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.

A Taxonomic And Analytical Survey Of Multidatabase Systems, Tony Schaller, Omran A. Bukhres, Jiansan Chen, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Academic Programs In Computational Science And Engineering, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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.

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 …

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 …

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 …