Digital Commons Network^™

Seth: A Quorum-Based Replicated Database System For Experimentation With Failures, Bharat Bhargava, Abdelsalam Helal, Jagannathan Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

Automated Circuit Diagnosis Using First Order Logic Tools, Barbara Smith, Ralph W. Wilkerson, Gerald E. Peterson, Mcdonnell Douglas

Computer Science Faculty Research & Creative Works

While Numerous Diagnostic Expert Systems Have Been Successfully Developed in Recent Years, They Are Almost Uniformly based on Heuristic Reasoning Techniques (I.e., Shallow Knowledge) in the Form of Rules. This Paper Reports on an Automated Circuit Diagnostic Tool based on Reiter's Theory of Diagnosis. in Particular, this is a Theory of Diagnosis based on Deep Knowledge (I.e., Knowledge based on Certain Design Information) and using First Order Logic as the Representation Language. the Inference Mechanism Which is Incorporated as Part of the Diagnostic Tool is a Refutation based Theorem Prover using Rewriting Systems for Boolean Algebra Developed by Hsiang. Consequently, …

Robust Replication Control Using Primary Copy Method, Niraj K. Sharma

Department of Computer Science Technical Reports

No abstract provided.

Shadow Pattern Simulator, Roberto A. Brown

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This paper describes an interactive computer program that can be used as a design tool in assessing the shading effects of trees in relation to buildings. The program determines the area and position of the shadow cast by a tree or group of trees on a surface of a building which can have any orientation. The program outputs numerical and graphical hourly results at any time of the day, for any day of the year, at any location on the earth, for any relative positioning between the tree and building, and estimates percent irradiation reductions on building surfaces resulting from …

Yet Another Application Of A Binomial Recurrence, Wojciech Szpankowski, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

An Approach To Support Automatic Generation Of User Interfaces, Prasun Dewan, Marvin Solomon

Department of Computer Science Technical Reports

No abstract provided.

An Optimal Parallel Algorithm For The Visibility Of A Simple Polygon From A Point, Mikhail J. Atallah, Danny Z. Chen, Hubert Wagner

Department of Computer Science Technical Reports

No abstract provided.

Algorithms For Planar Geometric Models, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.

Sequences And Digital Trees: A Symbiosis, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Note On Two Simulation Benchmarks, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

An Inherently Parallel Large Grained Data Flow Environment, Roger E. Eggen, John R. Metzner

Computer Science Faculty Research & Creative Works

A parallel programming environment based on data flow is described. Programming in the environment involves use with an interactive graphic editor which facilitates the construction of a program graph consisting of modules, ports, paths and triggers. Parallelism is inherent since data presence allows many modules to execute concurrently. The graph is executed directly without transformation to traditional representations. The environment supports programming at a very high level as opposed to parallelism at the individual instruction level.

A Linear-Processor Algorithm For Depth-First Search In Planar Graphs, Gregory E. Shannon

Department of Computer Science Technical Reports

No abstract provided.

Metaprolog Design And Implementation, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

Many researchers in the area of logic programming have recognized the limits of logic languages such as Prolog and suggested a meta level approach as an alternative. Some of the main drawbacks cited are the control strategy, the presence of a single database, and the ad hoc extensions to the base logic programming paradigm to allow the dynamic modification of the database. The MetaProlog language, which includes Prolog and some of its metalanguage, deals with some of these problems. In this paper, the design and implementation of MetaProlog are described and the changes to the Warren Abstract Machine (WAM) on …

Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal

All HMC Faculty Publications and Research

Achieving processor cooperation in the presence of faults is a major problem in distributed systems. Popular paradigms such as Byzantine agreement have been studied principally in the context of a complete network. Indeed, Dolev [J. Algorithms, 3 (1982), pp. 14–30] and Hadzilacos [Issues of Fault Tolerance in Concurrent Computations, Ph.D. thesis, Harvard University, Cambridge, MA, 1984] have shown that Ω(t) connectivity is necessary if the requirement is that all nonfaulty processors decide unanimously, where t is the number of faults to be tolerated. We believe that in forseeable technologies the number of faults will grow with the size of the …

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Bachert, Sara. Rational Portrayal of the Irrationational in The Pit and the Pendulum
• Bell, Suzanne. Early Secret Involvement of the United States Military in Cambodia
• Brock, Beth. The Informal Caregiving System: The Frail Elderlys' Avenue of Choice
• Daniel, Janice. Child Sexual Abuse
• Johnson, Linda. International Telecommunications Trade with Japan
• Jones, LaMont. Ernie Pyle: Journalist Without Peer
• Kesserling, Marcia. Attitudes Toward the Need for Computer Literacy
• Lewis, Gloria. John Donne's Attitude Toward Love
• Majdi, …

Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger

All HMC Faculty Publications and Research

A new method for constructing wide-sense nonblocking networks is presented. Application of this method yields (among other things) wide-sense nonblocking generalized connectors with n inputs and outputs and size O( n log n ), and with depth k and size O( n^{1 + 1/k} ( log n )^{1 - 1/k} ).

Ua35/11 Wku Student Honors Research Bulletin, Wku University Honors Program

WKU Administration Documents

The Western Kentucky University Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers represent work done by students from throughout the university.

• Kesselring, Marcia. Attitudes Toward the Need for Computer Literacy
• Tuck, Janna & Karen Wiggins. Methylation and Confirmation of PGE
• Lewis, Gloria. John Donne's Attitude Toward Love
• Johnson, Linda. International Telecommunications Trade with Japan
• Sharpe, Greg. Precipitation Patterns in Bowling Green, Kentucky, 1980-1985
• Smith, Sandy. Religion and the Media: Alliance or War?
• Bell, Suzanne. Early Secret Involvement of the United States Military in Cambodia
• Scariot, Linda. Parental Divorce and Childhood Emotional Disturbances
• Daniel, Janice. …

Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger

Masters Theses

"State-of-the-art combat simulators require a 360 degree field of view, allowing the pilot and radar intercept officer to have the same visibility in the simulator that they would experience in the aircraft. The sky/earth display must be computer - generated and displayed with a minimum of two channels to provide the most realistic display possible. The two channels of display come together in the dome, forming an equator, that must be as indiscernible to the aircrew as possible. To accomplish this, an algorithm has been developed for controlling the video output which makes the two separate channel displays appear as …

A Coprocessor Design For The Architectural Support Of Non-Numeric Operations, Timothy W. Curry

Retrospective Theses and Dissertations

Computer Science is concerned with the electronic manipulation of information. Continually increasing amounts of computer time are being expended on information that is not numeric. This is represented in part by modem computing requirements such as the block moves associated with context switching and virtual memory management, peripheral device communication, compilers, editors, word processors, databases, and text retrieval. This dissertation examines the traditional support of non-numeric information from a software, firmware, and hardware perspective and presents a coprocessor design to improve the performance of a set of non-numeric operations. Simple micro-coding of operations can provide a degree of performance improvement …

On K - Y - Insensitive Donimation, Teresa Haynes Rice

Retrospective Theses and Dissertations

A connected graph G is defined to be k-1-insensitive if the domination number 1(G) is unchanged when an arbitrary set of k edges is removed. The problem has been solved fork= 1. This Ph.D. dissertation focuses on finding extremal k-1-insensitive graphs on p nodes, fork~ 2. A graph is extremal if it has the minimum number of edges. Two subproblems are considered. The first, which has been solved completely, specifies that the same set of nodes dominates each graph obtained from G by removing k edges. The second requires only that the graph G be connected. This is a much …

Some Optimally Adaptive Parallel Graph Algorithms On Erew Pram Model, Sajal K. Das

Retrospective Theses and Dissertations

The study of graph algorithms is an important area of research in computer science, since graphs offer useful tools to model many real-world situations. The commercial availability of parallel computers have led to the development of efficient parallel graph algorithms.

Using an exclusive-read and exclusive-write (EREW) parallel random access machine (PRAM) as the computation model with a fixed number of processors, we design and analyze parallel algorithms for seven undirected graph problems, such as, connected components, spanning forest, fundamental cycle set, bridges, bipartiteness, assignment problems, and approximate vertex coloring. For all but the last two problems, the input data structure …

Academically-Sponsored Coastal Research Vessels In The New England Region: An Assessment Of Current Management And Implications For The Future, Brendan B. Mcavoy

Marine Affairs Theses and Major Papers

In New England an informal communications network exists between coastal research vessel operating institutions. Vessel scheduling and operational support has been identified as adequate for the current amount of research being conducted within the region. However, societal shift towards coastal regions is prompting an increase in attention to research within the coastal zone. Current and pending federal initiatives are responding to this increased research need. This, in turn, is beginning to impose greater demands on coastal vessel sea-time. Therefore, a strengthening of the region's inter-institutional communications network may be warranted for the future in order to better coordinate coastal research …

Knowledge Organization And Inference Engine For The Wvu Face Decision Support System, S. Carrow, R. S. Nutter Jr., R. S. Raman, N. A. Reddy, Y. V. Reddy, R. Larry Grayson

Mining Engineering Faculty Research & Creative Works

The knowledge-based organization for the West Virginia University Face Decision Support System is given, along with the initial development of the associated inference engine. The knowledge base contains generic knowledge about underground coal mines that utilize continuous miners. A typical knowledge entry is given, and the inference engine methodology is explained. The engine utilizes this knowledge with data from monitoring systems and from interaction with the section foreman, to assist in making section management decisions and plans.

No Antitwins In Minimal Imperfect Graphs, Stephan Olariu

Computer Science Faculty Publications

It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent either to both of them or to neither of them. By analogy, we shall call vertices x and yantitwins if every vertex distinct from x and y is adjacent to precisely one of them. Lovász proved that no minimal imperfect graph has twins. The purpose of this note is to prove the analogous statement for antitwins.

What Is The Path To Fast Fault Simulation?, Miron Abramovici, Balaji Krishnamurthy, Rob Mathews, Bill Rogers, Michael Schulz, Sharad C. Seth, John Waicukauski

School of Computing: Faculty Publications

Motivated by the recent advances in fast fault simulation techniques for large combinational circuits, a panel discussion has been organized for the 1988 International Test Conference. This paper is a collective account of the position statements offered by the panelists.

Digital Neural Networks, Tony R. Martinez

Faculty Publications

Demands for applications requiring massive parallelism in symbolic environments have given rebirth to research in models labeled as neural networks. These models are made up of many simple nodes which are highly interconnected such that computation takes place as data flows amongst the nodes of the network. To present, most models have proposed nodes based on simple analog functions, where inputs are multiplied by weights and summed, the total then optionally being transformed by an arbitrary function at the node. Learning in these systems is accomplished by adjusting the weights on the input lines. This paper discusses the use of …

Integrated Online Media Management Systems For Media Centers: A Model For Selection And Effective Use, Nancy R. Keating

CCAC Theses and Dissertations

The researcher proposed to advice in the selection of an Integrated Online Library System (IOLS) for use in the 103 school media centers in the Palm Beach County Schools, Florida. This was accomplished by evaluating the two finalists of those vendors who answered the district's Request for Proposal (RFP). Of the five vendors who responded to the RFP. CLSI and SIRSI were selected as the systems most likely to meet the needs of the media centers of the school district.

An overview and definition of IOLS was first discussed. This overview then related itself to the needs of the school …

Self-Alignments In Words And Their Applications, Alberto Apostolico, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.

An Application Of Stochastic Learning Automata To Queueing Disciplines, Tearesa Lynn Wegscheid

Masters Theses

There has been extensive research in the area of Stochastic Learning in both Psychology and Computer Science. This thesis examines the literature of Stochastic Learning automata with respect to operation control. It traces the development of an optimal reinforcement scheme, and examines the applications of Stochastic Learning automata in routing. The paper simulates M/M/3 and M/M/5 queueing systems similar to the system described by Glorioso and Osorio. The simulation implements L_r-p, L_i-p, and L_r-i learning models and compares their performance to Teller Window and Jockeying. A blocking factor is developed to provide more information for …