Digital Commons Network^™

Selection Networks, Nicholas Pippenger

All HMC Faculty Publications and Research

An upper bound asymptotic to $2n\log _e n$ is established for the number of comparators required in a network that classifies $n$ values into two classes, each containing $n / 2$ values, with each value in one class less than or equal to each value in the other. (The best lower bound known for this problem is asymptotic to $(n / 2)\log _2 n$.)

Supereuleriaun Graphs And The Petersen Graph, Zhi-Hong Chen

Scholarship and Professional Work - LAS

Using a contraction method, we find some best-possible sufficient condi­tions for 3-edge-connected simple graphs such that either the graphs have spanning eulerian subgraphs or the graphs are contractible to the Petersen graph.

Curriculum-Oriented Cai Based On Instructional Technology To Be Used For Teaching Secondary School Students Introductory Library Skills, Theresa K. Toohil

CCAC Theses and Dissertations

In 1990, the New York State Education Department presented a syllabus that required the teaching of curriculum-oriented library skills and suggested the use of computers to be integrated with the teaching of these skills whenever possible. Schools in New York State are now trying to implement the suggestions in the syllabus. Many authors of educational articles have written at length concerning the incorporation of computer-assisted instruction (CAl) into the classroom, but clear directions have not been provided in the literature for the design or implementation of the necessary software.

The purpose of this study was to design a program based …

Dissertation Report Is 8995 Using Dialog Cip At Winona State University To Educate End-Users, Kathryn Sullivan

CCAC Theses and Dissertations

Graduate students need to know the resources of their university library in order to do research and cannot be expected to remember any library training they may have received as undergraduates. A class offered by the library on how to search databases available through DIALOG's Classroom Instruction Program (CIP) was proposed, in cooperation with existing research classes in the student's field. A study was conducted at Winona State University. Winona, MN, with research classes offered by two professors in the field of special education. The study was to determine whether the information presented in an instruction session based on six …

Inclusive Production Of The Charmed Baryon C+ From E+E- Annihilations At S=10.55 Gev, P. Avery, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results on inclusive production of the charmed baryon Λc+ from e+e− annihilations at √s=10.5 GeV. Measurements are presented of the inclusive cross section times branching fraction for the continuum production of Λc+ as observed in six different decay modes, and of a new, improved value of the Λc+ mass. The inclusive cross section times the branching fraction into pK−π+ is measured to be 10.0±1.5±1.5 pb summed over all xp. The branching fractions of Λc+ into p¯K0, p¯K0π+π−, Λπ+, Λπ+π−π+, and Ξ−K+π+ relative to that into pK−π+ are measured to be 0.44±0.07±0.05, 0.43±0.12±0.04, 0.18±0.03±0.03, 0.65±0.11±0.12, and 0.15±0.04±0.03, respectively. The …

A Visualization Model For Massively Parallel Algorithms, Rashi Khanna, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

A visualization model has been developed to analyze the performance of a massively parallel algorithm. Most visualization tools that have been developed so far for performance analysis are based generally on individual processor information and communication patterns. These tools, however, are inadequate for massively parallel computations. It is difficult to comprehend the visual information for many processors. The model, SMILI (Scientific visualization in Multicomputing for Interpretation of Large amounts of Information), addresses this problem by using abstract representations to attain a composite picture which gives better insight to the behavior of the algorithm. Chernoff s Faces have been selected to …

Functional Reasoning And Functional Modelling, J. Sticklen, William E. Bond

Computer Science Faculty Research & Creative Works

A car that will not start on a cold winter day and one that will not start on a hot summer day usually indicate two very different situations. When pressed to explain the difference, we would give a winter account- "Oil is more viscous in cold conditions, and that causes . . .'' -and a summer story- "Vapor lock is a possibility in hot weather and is usually caused by . . .'' How do we build such explanations? One possibility is that understanding how the car works as a device gives us a basis for generating the explanations. But …

A Mergeable Double-Ended Priority Queue, S. Olariu, Z. Wen

Computer Science Faculty Publications

An implementation of a double-ended priority queue is discussed. This data structure referred to as min–max–pair heap can be built in linear time; the operations Delete-min, Delete-max and Insert take O(log n) time, while Find-min and Find-max run in O(1) time. In contrast to the min-max heaps, it is shown that two min–max–pair heaps can be merged in sublinear time. More precisely, two min–max–pair heaps of sizes n and k can be merged in time O(log (n/k) * log k).

Fuzzy Neural Logic Network And Its Learning Algorithms, Fiona Fui-Hoon Nah, Nah Fiona

Research Collection School Of Computing and Information Systems

The paper introduces the basic features of fuzzy neural logic network. Each fuzzy neural logic network model is trained from a set of knowledge in the form of examples using one of the three learning algorithms introduced. These three learning algorithms are the delta rule controlled learning algorithm and two mathematical construction algorithms, namely, the local learning method and the global learning method. Once the fuzzy neural logic network model is constructed, it is ready to accept any unknown input from the user. With a low percentage of mismatched features, output solution can be obtained.

Exclusive And Inclusive Semileptonic Decays Of B Mesons To D Mesons, R. Fulton, M. Thulasidas

Research Collection School Of Computing and Information Systems

We report new measurements of the branching fractions B ( B − → D 0 l − ¯ ν ) , B ( ¯ B 0 → D + l − ¯ ν ) , and B ( B − → D * 0 l − ¯ ν ) . Combining these results with our previous measurement of B ( ¯ B 0 → D * + l − ¯ ν ) , we find that the ratio of semileptonic widths for final states with a vector meson and pseudoscalar meson is ( 2.6 + 1.1 + 1.0 − 0.6 …

Cascading Of Ever Adaptive Variation Of Lzw Algorithm With Arithmetic Coding Method, Ramesh Vishwanatham, Ketan Tejani

Theses

Two known compression algorithms appropriate for communication are LZW and the Arithmetic Coding method. Both algorithms are adaptive and require no extra communication from the encoder to the decoder. We have considered a variation of LZW algorithm known as Online version which result in better compression. Here we present a scheme to cascade Online LZW with Arithmetic algorithms into an Ever Adaptive data compression algorithm which achieves higher compression ratio and is appropriate for communication.

Implementation Of Object Oriented University Database Using Vodak/Vml-0 Prototype, Abhay V. Bhave

Theses

In recent years object - oriented programming has gained a tremendous popularity in the design and implementation of emerging data - intensive application systems. Object oriented knowledge based approaches have proved to be very powerful vehicle when developing, integrating complex systems.

Using a University database demonstrated here is an object oriented model. This model uses VODAK/VML-0 prototype which was developed by GMD - IPSI, Darmstadt FRG. The Conceptual Schema of this database was done using The Dual Model, but as the current VODAK/VML version does not support dual model, the schema was modified before use. There are 167 classes defined …

Heuristic Guided Pre-Optimized Algorithm Substitution For Parallel Computers, Ko-Yang Wang

Department of Computer Science Technical Reports

No abstract provided.

Models And Algorithms For Co-Scheduling Compute-Intensive Tasks On A Network Of Workstations, Mikhail J. Atallah, Christina Lock, Dan C. Marinescu, Howard J. Seigel, Thomas L. Casavant

Department of Computer Science Technical Reports

No abstract provided.

Voronoi Diagrams In A River, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

Brep-Index: A Multi-Dimensional Space Partitioning Tree, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.

Fitting Semantics For Conditional Term Rewriting, Chilukuri K. Mohan

Electrical Engineering and Computer Science - Technical Reports

This paper investigates the semantics of conditional term rewriting systems with negation which do not satisfy useful properties like termination. It is shown that the approach used by Fitting [5] for Prolog-style logic programs is applicable in this context. A monotone operator is developed, whose fixpoints describe the semantics of conditional rewriting. Several examples illustrate this semantics for non-terminating rewrite systems which could not be easily handled by previous approaches.

Analyzing Images Containing Multiple Sparse Patterns With Neural Networks, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We have addressed the problem of analyzing images containing multiple sparse overlapped patterns. This problem arises naturally when analyzing the composition of organic macromolecules using data gathered from their NMR spectra. Using a neural network approach, we have obtained excellent results in using NMR data to analyze the presence of amino acids in protein molecules. We have achieved high correct classification percentages (about 87%) for images containing as many as five substantially distorted overlapping patterns.

Use Of Grasp Force Focus Positioning To Enhance The Torque Resistance Capability Of Robotic Grasps, Stephen G. Edwards

Theses and Dissertations

Three-point-contact grasps are unique in that the homogeneous solution for the contact forces always produces a grasp force focus. Careful positioning of this focus point in the grasp plane can help avoid two things; slipping at the contact points, and violation of joint torque limits. The focus placement method is explored theoretically by examining two types of grasps on cylinders; 1) fingertip grasps using three independently operated fingers, and 2) single-finger power grasps with one contact point on each of three links. Constraint maps are generated for various fingertip grasps in order to show how proper placement of the grasp …

Determining Concurrency In Object-Oriented Design Of Real-Time Embedded Systems Using Ada, Kenneth D. Baum

Theses and Dissertations

One of the characteristics of real-time systems is concurrency. Designers of real-time systems have traditionally determined system concurrency at implementation time using the facilities of a cyclic executive. With the advent of programming language constructs for specifying concurrency, determining concurrency at design time has become a possibility. Several design methods, all of which are extensions of either Structured Design or Jackson System Development, provide heuristics to help the designer make concurrency decisions. The object-oriented approach, however, has no corresponding heuristics to aid designers of real-time systems. The purpose of this thesis was to develop heuristics to help designers make concurrency …

Optimal Superprimitivity Testing For Strings, Alberto Apostolico, Martin Farach, Costas S. Iliopoulos

Department of Computer Science Technical Reports

No abstract provided.

Implementation And Performance Of A Communication Facility For Distributed Transaction Processing, Enrique Mafla, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Managing Data Synchronization Automatically For Distributed-Memory Architectures, Ko-Yang Wang

Department of Computer Science Technical Reports

No abstract provided.

Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper describes parallel algorithms for the following operations on quadtrees - boolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1990, 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.

Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper presents a neural network approach to multivariate time-series analysis. Real world observations of flour prices in three cities have been used as a benchmark in our experiments. Feedforward connectionist networks have been designed to model flour prices over the period from August 1972 to November 1980 for the cities of Buffalo, Minneapolis, and Kansas City. Remarkable success has been achieved in training the networks to learn the price curve for each of these cities, and thereby to make accurate price predictions. Our results show that the neural network approach leads to better predictions than the autoregressive moving average(ARMA) …

Software Performance Evaluation Papers In Toms, Volumes 1-15, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

This paper presents an encoding algorithm to enable fast computation of the least upper bound (LUB) and greatest lower bound (GLB) of a partially ordered set. The algorithm presented reduces the LUB computation to an OR operation on the codes. The GLB computation is reduced essentially to an AND operation on the codes. The time complexity of our encoding algorithm is O(n + e) where n is the number of nodes and e is the number of edges. With respect to space requirements the algorithm presented gives good results for small lattices (code length was 50 bits for a 300 …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1990, 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.

Domain Decomposer: A Software Tool For Mapping Pde Computations To Parallel Architectures, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, P. N. Papachiou, S. K. Kortesis

Department of Computer Science Technical Reports

No abstract provided.