Digital Commons Network^™

Implementation Of Cross Intersection Between Triangular Surfaces, Chaman Sabharwal, Thomas G. Melson

Computer Science Faculty Research & Creative Works

No abstract provided.

Multiple-Screen Panning System, Abdo Fathy Youssef

Theses

There is a need to provide graphics capabilities for the objective of "Group Graphics". This is the ability of a group of humans to work collaboratively on the same diagram. It is the intent of this project to provide some of the fundamental software tools to allow a group of individuals to deal with a "mosaic" form of graphics made up of many separate screens that can be panned and conceptually edited by each individual who is working on portions of the overall document.

Simple tools are provided for the creation of graphics screens as well as saveing and retrieving …

An Experimental Performance Analysis For The Rate Of Convergence Of 5-Point Star On General Domains, John R. Rice, Mo Mu

Department of Computer Science Technical Reports

No abstract provided.

Software Engineering Team Project Group Member Evaluations: Some Empirical Results, Herbert E. Dunsmore, David P. Moffett, Steven T. Ward

Department of Computer Science Technical Reports

No abstract provided.

Concurrency Enhancement Through Program Unification: A Performance Analysis, Vernon J. Rego, Aditya P. Mathur

Department of Computer Science Technical Reports

No abstract provided.

An Experimental Performance Analysis For The Rate Of Convergence On Collocation On General Domains, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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

Department of Computer Science Technical Reports

No abstract provided.

A Parallel Spline Collocation-Capacitance Method For Elliptic Parallel Differential Equations, C. C. Christara, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Comments On Mohr And Henderson's Path Consistency, Ching-Chih Han, Chia-Hoang Lee

Department of Computer Science Technical Reports

No abstract provided.

Structure And Motion From Two Perspective Views Via Planar Patch, Chia-Hoang Lee

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 …

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 …

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

Ua8 Wku Administrative Software Project, Wku Information Technology

WKU Administration Documents

Outline of project to upgrade software in WKU's administrative offices and brief overview of Information Technology history.

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

Composite Graph Coloring Algorithms And Applications, Stephen Hong Seng Yek

Masters Theses

"A vertex-composite graph is a graph that can have unequal chromaticities on its vertices. Vertex-composite graph coloring or composite graph coloring involves coloring each vertex of a composite graph with consecutive colors according to the vertex's chromaticity with no two vertices adjacent to one another having the same color(s).

New heuristic algorithms including the use of the saturation degree method have been developed in this research. All eleven heuristic algorithms including Clementson and Elphick algorithms were then tested using random composite graphs with five different chromaticity distributions. The best algorithm which uses the least average colors from the experiment is …

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.

An Application Of A Fast Data Encryption Standard Implementation, Matt Bishop

Computer Science Technical Reports

The Data Encryption Standard is used as the basis for the UNIX password encryption scheme. Some of the security of that scheme depends on the speed of the implementation. This paper presents a mathematical formulation of a fast implementation of the DES in software, discusses how the mathematics can be translated into code, and then analyzes the UNIX password scheme to show how these results can be used to implement it. Experimental results are provided for several computers to show that the given method speeds up the computation of a password by roughly 20 times (depending on the specific computer).

Theft Of Information In The Take-Grant Protection Model, Matt Bishop

Computer Science Technical Reports

(Revised 5/90). Questions of information flow are in many ways more important than questions of access control, because the goal of many security policies is to thwart the unauthorized release of information, not merely the illicit obtaining of access rights to that information. The Take-Grant Protection Model is an excellent theoretical tool for examining such issues because conditions necessary and sufficienct for information to flow between tow objects, and for rights to object to be obtained or stolen, are known. In this paper we extend these results by examinig the question of information flow from an object the owner of …

The Sharing Of Rights And Information In A Capability-Based Protection System, Matt Bishop

Computer Science Technical Reports

The paper examines the question of sharing of rights and information in the Take-Grant Protection Model by concentrating on the similarities between the two; in order to do this, we state and prove new theorems for each that specifically show the similarities. The proof for one of the original theorems is also provided. These statements of necessary and sufficient conditions are contrasted to illustrate the proposition that transferring rights and transferring information are fundamentally the same, as one would expect in a capability-based system. We then discuss directions for future research in light of these results.

Resource Sharing: A Study Of Florida's Shared-Used Library Collections, Susan Anderson

CCAC Theses and Dissertations

Designed to provide library service for two or more different groups of library users in one library facility, shared-use or joint-use libraries are a unique aspect of library resources sharing. Thirteen examples of shared-use library collections in shared or joint-use library facilities in Florida were examined in this investigation. Special focus was placed on the perceptions of librarians who work in these libraries in order to determine how well the libraries meet the information needs on users and how successful the libraries are in conserving financial resources as a result of combined collections. A design of a special resource collections …

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 …

The Utilization Of Competitive Intelligence In Strategic Planning, Sallyann Carr

CCAC Theses and Dissertations

No abstract provided.

Evaluation Of 3d Voxel Rendering Algorithms For Real-Time Interaction On A Simd Graphics Processor, Don Schreiter, John B. Zimmerman

All Computer Science and Engineering Research

The display of three-dimensional medical data is becoming more common, but current hardware and image rendering algorithms do not generally allow real-time interaction with the image by the user. Real-time interactions, such as image rotation, utilize the motion processing capabilities of the human visual system, allowing a better understanding of the structures being imaged. Recent advances in general purpose graphics display equipment could make real-time interaction feasible in clinical setting. We have evaluated the capabilities of one type of advanced display architecture, the PIXAR Imaging Computer, for real-time interaction while displaying three-dimensional medical data as two-dimensional projections. It was discovered …

Metaprolog User Manual, Hamid Bacha

Electrical Engineering and Computer Science - Technical Reports

MetaProlog is a logic-based programming language which subsumes the full Prolog language. This implementation is an incremental compiler (which also looks and feels like an interpreter) supporting meta-level constructs that are usually provided by the underlying architecture in other systems and are not directly available to the user. The most obvious feature of MetaProlog is the ability to handle multiple databases (referred to as theories) at the same time. In contrast to ordinary Prolog’s single-theory database, a MetaProlog database is a collection of theories. A theory is a first-class object and can be passed around as the value of a …

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 …

Hardware Algorithms For Data Compression, N. Ranganathan

Retrospective Theses and Dissertations

Data compression is the reduction of redundancy m data representation in order to decrease storage and communication costs. Data compression techniques have been used in practice primarily through software implementations which fail to meet the speed and performance requirements of current and future systems. This Ph.D. dissertation presents a set of hardware algorithms for compression and decompression techniques and the results of detailed simulations performed to quantify the effects of incorporating such hardware in various architectural environments. A new pipelined algorithm for data compression applicable to static binary encoding schemes is presented. A fast hardware algorithm for decompression that uses …

Test Generation By Fault Sampling, Vishwani Agrawal, Hassan Farhat, Sharad C. Seth

Mathematics Faculty Publications

This paper presents a novel technique of generating tests from a random sample of faults. The entire fault population of the circuit is randomly divided into two groups. Only one group, usually the smaller one, is used for test generation by the test-generator and fault-simulator programs. This group is known as the sample and its coverage is deterministic. The coverage of faults in the remaining group is similar to that of random vectors and is estimated from the distribution of fault detection probabilities in the circuit. As the sample size increases, the fraction of unsampled faults reduces. At the same …