Digital Commons Network^™

Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Recently, the use of bridges/gateways to interconnect physically distant local area networks (LANs) has become increasingly popular. There are various ways of connecting these bridges/gateways. ISDN is one of them and an attractive one. In this paper we discuss our work in the gateway design for interconnecting LANs via ISDN.

Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg

Mathematics, Statistics and Computer Science Faculty Research and Publications

Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers w as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on w. For example, in every sense of relative ubiquity considered here, the set of dense linear orderings on w is …

The Origins Of Modern Computing, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

Efficient Parallel Binary Search On Sorted Arrays, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Computing Some Distance Functions Between Polygons, Mikhail J. Atallah, Celso C. Ribeiro, Sergio Lifschitz

Department of Computer Science Technical Reports

No abstract provided.

History Of The Computer Sciences Department At Purdue University, John R. Rice, Saul Rosen

Department of Computer Science Technical Reports

No abstract provided.

Mesh And Pyramid Algorithms For Iconic Indexing, Alok Choudhary, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In this paper parallel algorithms on meshes and pyramids for iconic indexing are presented. Our algorithms are asymptotically superior to previously known parallel algorithms.

Efficient Detection Of Quasiperiodicities In Strings, Alberto Apostolico, Andrzej Ehrenfeucht

Department of Computer Science Technical Reports

No abstract provided.

Unifying Parametric And Implicit Surface Representations For Computer Graphics: Parametric Surface Display And Algebraic Surface Fitting, Changrajit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.

A Statically-Typed Language With Classes, Mike Beaven, Ryan Stanisfer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.

The Cops Security Checker System, Daniel Farmer, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

A Logic For Natural Language, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

This paper describes a language called £N whose structure mirrors that of natural language. £N is characterized by absence of variables and individual constants. Singular predicates assume the role of both individual constants and free variables. The role of bound variables is played by predicate functors called "selection operators." Like natural languages, £N is implicitly many-sorted. £N does not have an identity relation. Its expressive power lies between the predicate calculus without identity and the predicate calculus with identity. The loss in expressiveness relative to the predicate calculus with identity however is not significant. Deduction in £N is intended to …

Convex Decomposition Of Polyhedra And Robustness, Chanderjit Bajaj, Tamal K. Dey

Department of Computer Science Technical Reports

No abstract provided.

Digital Search Trees Again Revisited: The Internal Path Length Perspective, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Simpler Proof Of Ph C Bp[Өp], Kenneth W. Regan, James S. Royer

Electrical Engineering and Computer Science - Technical Reports

We simplify the proof by S. Toda [Tod89] that the polynomial hierarchy PH is contained in BP[ӨP]. Our methods bypass the technical quantifier interchange lemmas in the original proof, and clarify the counting principles on which the result depends. We also show that relative to a random oracle R, PHR is strictly contained in ӨPR.

Typed Token Approach For Database Processing During Network Partitioning, Bharat Bhargava, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.

A Data Structure For Analyzing Collisions Of Moving Objects, George Vanecek

Department of Computer Science Technical Reports

No abstract provided.

Taxonomies Of Model-Theoretically Defined Topological Properties, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A topological classification scheme consists of two ingredients: (1) an abstract class K of topological spaces; and (2) a "taxonomy", i.e. a list of first order sentences, together with a way of assigning an abstract class of spaces to each sentence of the list so that logically equivalent sentences are assigned the same class.K, is then endowed with an equivalence relation, two spaces belonging to the same equivalence class if and only if they lie in the same classes prescribed by the taxonomy. A space X in K is characterized within the classification scheme if whenever Y _{E …}

Cascading Of Arithematic Coding Method With The Lzw Algorithm, Venkat R. Maram, Nageshwar R. Kadakuntla

Theses

Two known compression algorithms appropriate for communication are the LZW algorithm and the Arithmetic Coding method. Both algorithms are adaptive and require no extra communication from the encoder to the decoder. We present a scheme to cascade these algorithms into an adaptive algorithm which achieves higher compression ratio and is appropriate for communication.

A Lower Bound On Embedding Large Hypercubes Into Small Hypercubes, Ajay K. Gupta, Alfred J. Boals, Naveed A. Sherwani, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Visual Protocol Collection For The Enhancement Of The Radiological Diagnostic Process, Erika Rogers, Ronald C. Arkin, M. Baron, N. Ezquerra, E. Garcia

Computer Science and Software Engineering

This paper describes the Observation Phase of a research project that is designed to explore the nature of visual radiological diagnosis. It is concerned with the collection and analysis of visual protocol data in an effort to determine the salient image features that may impact on the different stages of the diagnostic process, both perceptual and cognitive. These features, once identified, will lead to the formulation of image enhancement hypotheses and the development of knowledge-based visualization techniques to assist the radiological diagnostic process.

Consistency And Generalization In Incrementally Trained Connectionist Networks, Tony R. Martinez

Faculty Publications

This paper discusses aspects of consistency and generalization in connectionist networks which learn through incremental training by examples or rules. Differences between training set learning and incremental rule or example learning are presented. Generalization, the ability to output reasonable mappings when presented with novel input patterns, is discussed in light of the above learning methods. In particular, the contrast between humming distance generalization and generalizing by high order combinations of critical variables is overviewed. Examples of detailed rules for an incremental learning model are presented for both consistency and generalization constraints.

A Direct Access Method Using A Neural Network Model, John William Meyer, George Winston Zobrist

Computer Science Technical Reports

One of the concerns in computer science involves optimizing usage of machines to make them more efficient and cost effective. One item of particular concern is the use of secondary storage devices, devices that store data other than in the main memory of the computer to which it is attached. The times for searching for data on these devices consistently proves to be a contributing factor in inefficient computer usage.

One data access method that avoids searching when possible is the hashing method. A function is defined to return the record number of a record based on its key field. …

Monotone Logic Programming, Howard A. Blair, Allen Brown Jr., V. S. Subrahmanian

Electrical Engineering and Computer Science - Technical Reports

We propose a notion of an abstract logic. Based on this notion, we define abstract logic programs to be sets of sentences of an abstract logic. When these abstract logics possess certain logical properties (some properties considered are compactness, finitariness, and monotone consequence relations) we show how to develop a fixed-point, model-state-theoretic and proof theoretic semantics for such programs. The work of Melvin Fitting on developing a generalized semantics for multivalued logic programming is extended here to arbitrary abstract logics. We present examples to show how our semantics is robust enough to be applicable to various non-classical logics like temporal …

Forecasting Sunspot Numbers Using Neural Networks, Ming Li, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

A recurrent connectionist network has been designed to model sunspot data. Preliminary experimental work shows that the network can produce competitive results as compared to traditional autoregressive models. The method is not problem specific and could be applied to other problems in dynamical system modeling, recognition, prediction, and control fields. It is observed that statistical methods can be used to design an appropriate neural network architecture.

Arrays And The Lambda Calculus, Klaus Berkling

Electrical Engineering and Computer Science - Technical Reports

Why do functional languages have more difficulties with arrays than procedural languages? The problems arising in the designing of functional languages with arrays and in their implementations are manifold. They can be classified according to 1) first principles, 2) semantics, 3) pragmatics, and 4) performance. This paper attempts to give an outline of the issues in this area, and their relation to the lambda calculus. The lambda calculus is a formal system and as such seemingly remote from practical applications. However, specific representations and implementations of that system may be utilized to realize arrays such that progress is made towards …

Optical Switching And Routing Architectures For Fiber-Optic Computer Communication Networks, Alok Choudhary, Salim Hariri, Wang Song, Partha Banerjee, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

Optical technology has become a significant part of communication networks. We propose an Optical Interface Message Processor (OPTIMP) that exploits high-bandwidth, parallelism, multi-dimensional capability, and high storage density offered by optics. The most time consuming operations such as switching and routing in communication networks are performed in optical domain in the proposed system. Our design does not suffer from the optical/electrical conversion bottlenecks and can perform switching and routing in the range of Gigabits/s. The proposed design can have significant impact in high-speed communication networks as well as high-speed interconnection networks for parallel computers. The source-destination (S-D) information from a …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, May 1990, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Strong Completeness Results For Paraconsistent Logic Programming, Howard A. Blair, V. S. Subrahmanian

Electrical Engineering and Computer Science - Technical Reports

In [6], we introduced a means of allowing logic programs to contain negations in both the head and the body of a clause. Such programs were called generally Horn programs (GHPs, for short). The model-theoretic semantics of GHPs were defined in terms of four-valued Belnap lattices [5]. For a class of programs called well-behaved programs, an SLD-resolution like proof procedure was introduced. This procedure was proven (under certain restrictions) to be sound (for existential queries) and complete (for ground queries). In this paper, we remove the restriction that programs be well-behaved and extend our soundness and completeness results to apply …

A Root Finding Algorithm For Parallel Architecture Machines, Stuti Moitra

Computer Science Theses & Dissertations

In this thesis a parallel algorithm for determining the zeros of any given analytic function is described. Parallelism is achieved by modifying the traditional bisection algorithm for architecture machines.

Given any user supplied function f(X), continuous on the interval A_o ≤ x ≤ B₀, and the tolerance of accuracy an algorithm of determining up to ten roots, with error of approximation less than or equal to tolerance, on parallel systems like Distributed Array Processor (OAP) and N-cube is considered.

A variation of the bisection method has been adapted for this purpose. At each level of iteration a …