Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 61621 - 61650 of 63730

Full-Text Articles in Entire DC Network

Visual Knowledge Query Language As A Front-End To Relational Systems, Keng Siau, Kok Phuang Tan, Hock Chuan Chan Sep 1991

Visual Knowledge Query Language As A Front-End To Relational Systems, Keng Siau, Kok Phuang Tan, Hock Chuan Chan

Research Collection School Of Computing and Information Systems

Relational query languages like SQL and QUEL require the users to understand the complex database structure. This is a burden on end users, especially novice end users who access the database on a casual and infrequent basis. To alleviate the need to know the logical database organization, this paper proposes the use of a semantic data model, known as the Enhanced Entity-Relationship (EER) model, as a front-end to the relational systems. A formal, high-level Visual Knowledge Query Language (VKQL) has also been designed for this interface. This language provides for knowledge abstraction as the user communicates only domain knowledge with …


Visual Knowledge Query Language As A Front-End To Relational Systems, Keng Siau, Kok Phuang Tan, Hock Chuan Chan Sep 1991

Visual Knowledge Query Language As A Front-End To Relational Systems, Keng Siau, Kok Phuang Tan, Hock Chuan Chan

Research Collection School Of Computing and Information Systems

Relational query languages like SQL and QUEL require the users to understand the complex database structure. This is a burden on end users, especially novice end users who access the database on a casual and infrequent basis. To alleviate the need to know the logical database organization, this paper proposes the use of a semantic data model, known as the Enhanced Entity-Relationship (EER) model, as a front-end to the relational systems. A formal, high-level Visual Knowledge Query Language (VKQL) has also been designed for this interface. This language provides for knowledge abstraction as the user communicates only domain knowledge with …


A Self-Organizing Binary Decision Tree For Incrementally Defined Rule-Based Systems, Douglas M. Campbell, Tony R. Martinez Sep 1991

A Self-Organizing Binary Decision Tree For Incrementally Defined Rule-Based Systems, Douglas M. Campbell, Tony R. Martinez

Faculty Publications

This paper presents an adaptive self-organizing concurrent system (ASOCS) model for massively parallel processing of incrementally defined rule systems in such areas as adaptive logic, robotics, logical inference, and dynamic control. An ASOCS is an adaptive network composed of many simple computing elements operating asynchronously and in parallel. This paper focuses on adaptive algorithm 3 (AA3) and details its architecture and learning algorithm. It has advantages over previous ASOCS models in simplicity, implementability, and cost. An ASOCS can operate in either a data processing mode or a learning mode. During the data processing mode, an ASOCS acts as a parallel …


An Application Of Interactive Computer Graphics To The Study Of Inferential Statistics And The General Linear Model, Stephen D. Pearce Sep 1991

An Application Of Interactive Computer Graphics To The Study Of Inferential Statistics And The General Linear Model, Stephen D. Pearce

Theses and Dissertations

This research created a learning environment, known as the Pearce Projection Modeling Environment (PPME) which is used as a tool by a teacher and student. The PPME was developed in an effort to create a new approach to the study of the General Linear Model through a constructive and projective, geometric approach. While the geometric approach to the GLM was developed over the past century, it has not been used extensively because of the inherent complexities associated with visualizing vector spaces. With the PPME, visualization is accomplished effortlessly. The PPME is a computer program that allows the student to enter …


Education Necessary For Air Force Software Managers To Use The Ada Programming Language And Software Engineering Effectively, James W. Worley Jr. Sep 1991

Education Necessary For Air Force Software Managers To Use The Ada Programming Language And Software Engineering Effectively, James W. Worley Jr.

Theses and Dissertations

This research investigated the perceived Ada and software engineering education needs of software managers throughout the Air Force and provided recommendations to Air Staff for developing the education. Since the Department of Defense mandated all DOD agencies use the Ada programming language for software development, the education of the personnel who have to support the policy has lagged behind the implementation Ada is not a simple language to use and is only fully effective if used with sound software engineering principles. A survey was given to Air Force mid-level personnel who manage software in some capacity. Of the software personnel …


An Expert System Job Aid For Users Of The Automated Scheduling Module, Kevin A. Gore Sep 1991

An Expert System Job Aid For Users Of The Automated Scheduling Module, Kevin A. Gore

Theses and Dissertations

This research developed an Expert System for novice aircraft maintenance schedulers (AFSC: 392XX) with little experience using the Automated Scheduling Module (ASM). First, an in-depth literature review was completed. Next, personal interviews were conducted with an ASM expert and other 392XX personnel. Prototypes using VP-Expert and KnowledgePro shells were created. The knowledgePro shell was selected to create the ASM Job Aid, combining the knowledge of the expert and AFM 66-279. The program was verified, validated, and favorably reviewed by 392XX personnel. Recommendations include: The Air Force Logistics Management Center (AFLMC) examine the ASM Job AId and develop a Performance Support …


Heuristics For Hospital Inventory Management, Thomas G. Hibson Sep 1991

Heuristics For Hospital Inventory Management, Thomas G. Hibson

Theses and Dissertations

This study investigated the reasoning strategies used by hospital logistics management experts and was conducted at the Wright-Patterson AFB (WPAFB) Medical Center. An expert system was developed to verify the captured strategies. The particular area of interest of this study was the reasoning strategies involved in the reconciliation of the Monthly Stock Status Report within the Medical Logistics Branch. A literature review revealed there were few guidelines as to when and what action to pursue when reconciling the Monthly Stock Status Report. Though there were no references in the literature on expert systems that dealt with this particular report, there …


A Topological Model For Parallel Algorithm Design, Jeffrey A. Simmers Sep 1991

A Topological Model For Parallel Algorithm Design, Jeffrey A. Simmers

Theses and Dissertations

This research demonstrates that formal, mathematical analysis in theoretical computer science can be recast in terms of the topology of complete metric spaces, and also presents a methodical technique for developing formal specifications. This effort shows that the topology of complete metric spaces provides a tool that can be used to both recreate major results about computational models and also to develop new results about these models. Using the two computational models CSP and UNITY, this effort shows that the required mathematics needed to support this alternative to the traditional analysis of computational models can be readily supported by a …


Work-Preserving Real-Time Emulation Of Meshes On Butterfly Networks, Alf-Christian Achilles Aug 1991

Work-Preserving Real-Time Emulation Of Meshes On Butterfly Networks, Alf-Christian Achilles

Theses

The emulation of a guest network G on a host network H is work-preserving and real-time if the inefficiency, that is the ratio WG/WH of the amounts of work done in both networks, and the slowdown of the emulation are O(1).

In this thesis we show that an infinite number of meshes can be emulated on a butterfly in a work-preserving real-time manner, despite the fact that any emulation of an s x s-node mesh in a butterfly with load 1 has a dilation of Ω(logs).

The recursive embedding of a mesh in a butterfly presented by …


The Ganith Algebraic Geometry Toolkit V 1.0, Chanderjit Bajaj, Andrew V. Royappa Aug 1991

The Ganith Algebraic Geometry Toolkit V 1.0, Chanderjit Bajaj, Andrew V. Royappa

Department of Computer Science Technical Reports

No abstract provided.


The Vaidak Medical Imaging And Model Reconstruction Toolkit, Brian Bailey, Chanderjit Bajaj, Malcolm C. Fields Aug 1991

The Vaidak Medical Imaging And Model Reconstruction Toolkit, Brian Bailey, Chanderjit Bajaj, Malcolm C. Fields

Department of Computer Science Technical Reports

No abstract provided.


Suffix Trees Revisited: (Un)Expected Asymptotic Behaviors, Wojciech Szpankowski Aug 1991

Suffix Trees Revisited: (Un)Expected Asymptotic Behaviors, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Xs: A Hardware Independent Graphics And Windows Library, Vinod Anupam, Chanderjit L. Bajaj, Andrew Burnett, Malcolm C. Fields, Andrew V. Royappa Aug 1991

Xs: A Hardware Independent Graphics And Windows Library, Vinod Anupam, Chanderjit L. Bajaj, Andrew Burnett, Malcolm C. Fields, Andrew V. Royappa

Department of Computer Science Technical Reports

No abstract provided.


Computer Viruses And Ethics, Eugene H. Spafford Aug 1991

Computer Viruses And Ethics, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.


C1 Smoothing Of Polyhedra With Implicit Surface Patches, Chanderjit L. Bajaj, Insung Ihm Aug 1991

C1 Smoothing Of Polyhedra With Implicit Surface Patches, Chanderjit L. Bajaj, Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.


Using Algebraic Geometry For Multivariate Hermite Interpolation, Chanderjit L. Bajaj Aug 1991

Using Algebraic Geometry For Multivariate Hermite Interpolation, Chanderjit L. Bajaj

Department of Computer Science Technical Reports

No abstract provided.


On A Matrix Identity Connecting Iteration Operators Associated With A P-Cyclic Matrix, Apostolos Hadjidimos, Dimitrios Noutsoss Aug 1991

On A Matrix Identity Connecting Iteration Operators Associated With A P-Cyclic Matrix, Apostolos Hadjidimos, Dimitrios Noutsoss

Department of Computer Science Technical Reports

No abstract provided.


On Surface Design With Implicit Algebraic Surfaces (Ph.D. Thesis), Insung Ihm Aug 1991

On Surface Design With Implicit Algebraic Surfaces (Ph.D. Thesis), Insung Ihm

Department of Computer Science Technical Reports

No abstract provided.


Decompositions Of Polyhedra In Three Dimensions (Ph.D. Thesis), Tamal Krishna Dey Aug 1991

Decompositions Of Polyhedra In Three Dimensions (Ph.D. Thesis), Tamal Krishna Dey

Department of Computer Science Technical Reports

No abstract provided.


Formal Methods Of Real-Time Systems, Su-Mei Tsai, Bruce M. Mcmillin Aug 1991

Formal Methods Of Real-Time Systems, Su-Mei Tsai, Bruce M. Mcmillin

Computer Science Technical Reports

Formal aid in specification and verification techniques have become an accepted approach to achieving reliable software for life-critical real-time systems, in which testing may be impossible or too dangerous, since the real inputs to the systems come from the real world. Modelling, assertion languages, and proof systems are three major components that are employed to accomplish the confidence of safe real-time environments. This paper examines these currently available techniques that are used for safety analysis of real-time systems.


Application-Oriented Fault-Tolerant Parallel Branch & Bound, Aggie Sun, Bruce M. Mcmillin Aug 1991

Application-Oriented Fault-Tolerant Parallel Branch & Bound, Aggie Sun, Bruce M. Mcmillin

Computer Science Technical Reports

An important aspect which is often overlooked in the software design cycle is the question of reliability. Many methodologies in the past have attempted to provide reliability efficiently but have never been successful at eliminating explicit time and space redundancy. The approach taken here is based on the Application-Oriented Fault Tolerance Paradigm which provides reliability by examining the behavior and properties of the application. This paper will demonstrate how fault detecting constraints are developed and incorporated using the Application-Oriented Fault Tolerance paradigm for the class of Branch and Bound algorithms. Branch and bound algorithms are a type of combinatorial search …


An Improved Algorithm For Neural Network Classification Of Imbalanced Training Sets, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka Aug 1991

An Improved Algorithm For Neural Network Classification Of Imbalanced Training Sets, Rangachari Anand, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

In this paper, we analyze the reason for the slow rate of convergence of net output error when using the backpropagation algorithm to train neural networks for a two-class problems in which the numbers of exemplars for the two classes differ greatly. This occurs because the negative gradient vector computed by backpropagation for an imbalanced training set does not point initially in a downhill direction for the class with the smaller number of exemplars. Consequently, in the initial iteration, the net error for the exemplars in this class increases significantly. The subsequent rate of convergence of the net error is …


Semi-Distributed Load Balancing For Massively Parallel Multicomputer Systems, Ishfaq Ahmad, Arif Ghafoor Aug 1991

Semi-Distributed Load Balancing For Massively Parallel Multicomputer Systems, Ishfaq Ahmad, Arif Ghafoor

Electrical Engineering and Computer Science - Technical Reports

This paper presents a semi-distributed approach, for load balancing in large parallel and distributed systems, which is different from the conventional centralized and fully distributed approaches. The proposed strategy uses a two-level hierarchical control by partitioning the interconnection structure of a distributed or multiprocessor system into independent symmetric regions (spheres) centered at some control points. The central points, called schedulers, optimally schedule tasks within their spheres and maintain state information with low overhead. We consider interconnection structures belonging to a number of families of distance transitive graphs for evaluation, and using their algebraic characteristics, show that identification of spheres and …


Explicit Clock Temporal Logic In Timing Constraints For Real-Time Systems, S. Ramanna, J. F. Peters Iii Aug 1991

Explicit Clock Temporal Logic In Timing Constraints For Real-Time Systems, S. Ramanna, J. F. Peters Iii

Electrical Engineering and Computer Science - Technical Reports

A form of explicit clock temporal logic (called TLrt) useful in specifying timing constraints on controller actions, a real-time database (rtdb) items, and constraints in a real-time constraint base (rtcb), is presented. Timing as well as other forms of constraints are stored in the rtcb. A knowledge-based approach to ensure the integrity of information in an rtdb is given. The rtcb is realized as a logic program called Constrainer, which is a historyless integrity checker for a real-time database. The consistency and integrity issues for an rtcb and rtdb are investigated. The formal bases for a temporally complete rtdb and …


Multi Cast Routing In Unreliable Networks, Martina Schollmeyer, Bruce M. Mcmillin Jul 1991

Multi Cast Routing In Unreliable Networks, Martina Schollmeyer, Bruce M. Mcmillin

Computer Science Technical Reports

The efficient routing of messages in a multicomputer interconnection network is the key to the performance of such a network. Multicast communication refers to the delivery of a message from a source node to several destination nodes. Although multicast is highly desirable for many applications, it is not directly supported in most multicomputer architectures. This paper examines existing algorithms for multicast routing in multicomputer networks and groups them into a number of categories such as multicast trees, multicast paths, multicast stars, etc. These algorithms are evaluated in terms of deadlock handling, adaptability and suitability for wormhole routing. Wormhole routing is …


Collision Detection And Analysis In A Physically Based Simulation, William J. Bouma, George Vanĕček Jul 1991

Collision Detection And Analysis In A Physically Based Simulation, William J. Bouma, George Vanĕček

Department of Computer Science Technical Reports

No abstract provided.


Formal Generation Of Executable Assertions For A Fault-Tolerant Parallel Bitonic Sort, Hanan Lutfiyya, Bruce M. Mcmillin Jul 1991

Formal Generation Of Executable Assertions For A Fault-Tolerant Parallel Bitonic Sort, Hanan Lutfiyya, Bruce M. Mcmillin

Computer Science Technical Reports

No abstract provided.


Type Reconstruction For Coercion Polymorphism (Technical Summary), Ryan Stansifer, Dan Wetklow Jul 1991

Type Reconstruction For Coercion Polymorphism (Technical Summary), Ryan Stansifer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.


Selective Inheritance And Overriding In Statically-Typed Object-Oriented Languages, Ryan Stansifer, Dan Wetklow Jul 1991

Selective Inheritance And Overriding In Statically-Typed Object-Oriented Languages, Ryan Stansifer, Dan Wetklow

Department of Computer Science Technical Reports

No abstract provided.


Representation Requirements For Supporting Decision-Model Formulation, Tze-Yun Leong Jul 1991

Representation Requirements For Supporting Decision-Model Formulation, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

This paper outlines a methodology for analyzing the representational support for knowledge-based decision-modeling in a broad domain. A relevant set of inference patterns and knowledge types are identified. By comparing the analysis results to existing representations, some insights are gained into a design approach for integrating categorical and uncertain knowledge in a context sensitive manner.