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 60061 - 60090 of 63085

Full-Text Articles in Entire DC Network

Managing Risks In Information Technology Projects, Boon Siong Neo, Kwong Sin Leong Jan 1994

Managing Risks In Information Technology Projects, Boon Siong Neo, Kwong Sin Leong

Research Collection School Of Accountancy

The development and implementation of IT (Information Technology) projects are plagued with problems of cost and time overruns. technical inadequacy, inability to meet user requirements. lack of utilization. and failure to achieve anticipated benefits. These problems occur to some projects and not to others because I) IT projects have different profiles of risk. and 2) IT project risks have been managed more or less effectively. This paper synthesizes the literature into four classes of risks. and applies it to evaluate TradeNet. an EDLbased trading system implemented in Singapore in I989. Through a case study of TradeNet. we derived a typology …


Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman Jan 1994

Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise, Paul W. Goldberg, Sally A. Goldman

All Computer Science and Engineering Research

Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder the …


Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt Jan 1994

Learning From A Consistently Ignorant Teacher, Michael Frazier, Sally Goldman, Nina Mishra, Leonard Pitt

All Computer Science and Engineering Research

One view of computational learning theory is that of a learner acquiring the knowledge of a teacher. We introduce a formal model of learning capturing the idea that teachers may have gaps in their knowledge. The goal of the learner is still to acquire the knowledge of the teacher, but now the learner must also identify the gaps. This is the notion of learning from a consistently ignorant teacher. We consider the impact of knowledge gaps on learning, for example, monoton DNF and d-dimensional boxes, and show that leraning is still possible. Negatively, we show that knowledge gaps make learning …


Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn Jan 1994

Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn

All Computer Science and Engineering Research

The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic can be supported via an ATM extension port on the MMX. The major components of the MMX are an ATMizer and three multimedia channels. The ATMizer implements the host interface, the interface to the ATM network, and hte interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used …


An Application-Oriented Error Control Scheme For High Speed Networks, Fengmin Gong, Gurudatta Parulkar Jan 1994

An Application-Oriented Error Control Scheme For High Speed Networks, Fengmin Gong, Gurudatta Parulkar

All Computer Science and Engineering Research

Many new network applications demand interprocess communication (IPC) services that are not supported by existing transport protocol mechanisms. Large bandwidth-delay products of high-speed networks also render the existing control mechanisms such as flow and error control less efficient. In particular, new error control schemes that can provide variable degrees of error recovery according to the applications requirements are needed. This paper presents the design, evaluation, and implementation of an application-oriented error control scheme that is aimed at supporting efficient IPC in high-speed networking environments. Our results show that the proposed error control scheme allows effective control of trade-off between the …


An Incremental Distributed Algorithm For Computing Biconnected Components, Bala Swaminathan, Kenneth J. Goldman Jan 1994

An Incremental Distributed Algorithm For Computing Biconnected Components, Bala Swaminathan, Kenneth J. Goldman

All Computer Science and Engineering Research

This paper describes a distributed algorithm for computing the biconnected components of a dynamically changing graph. Our algorithm has a worst case communication complexity of O(b + c) messages for an edge insertion and O(b' + c) messages for an edge removal, and a worst case time complexity of O(c) for both operations, where c is the maximum number of biconnected components in any of the connected components during the operation, b is the number of nodes in the biconnected component containing the new edge, and bprime is the number of nodes in the biconnected component in which the update …


Visual Presentation Of Software Specifications And Designs, Gruia-Catalin Roman, Delbert Hart, Charles Calkins Jan 1994

Visual Presentation Of Software Specifications And Designs, Gruia-Catalin Roman, Delbert Hart, Charles Calkins

All Computer Science and Engineering Research

Formal methods hold the promise for high dependability in the design of critical software. However, software engineers who employ formal methods need to communicate their design decisions to users, customers, managers, and collegues who may not be in a position to acquire a full understanding of the formal notation being used. Visualizations derived from formal specifications and designs must be able to convey the required information precisely and reliably without the use of formal notation. This paper discusses a design methodology which attempts to integrate a design methodology based upon specification and program refinement with a state-of-the-art approach to rapid …


Distributed Multimedia Systems Research Prospectus, Jonathan Turner Jan 1994

Distributed Multimedia Systems Research Prospectus, Jonathan Turner

All Computer Science and Engineering Research

Distributed multimedia computing and communiation systems combine computer systems, networks and distributed software to facilitate applications that enable and enhance collaborative work, direct interpersonal communication, remote access to information and real-time presentation of information from a variety of sources. Over the next decade, we expect such systems to become central to the infrastructure of our increasingly information-driven society. This prospectus describes a program of research being pursued within the Computer and Communications Research Center of Washington University and the Departments of Computer Science and Electrical Engineering. This program seeks to promote the creation of effective distributed multimedia systems and develop …


Connection Management In Reconfigurable Distributed Systems, Bala Swaminathan Jan 1994

Connection Management In Reconfigurable Distributed Systems, Bala Swaminathan

All Computer Science and Engineering Research

The Programmer's Playground takes a new approach to simplifying and supporting the construction of distributed applications. The approach, called I/O abstraction, separates the description of a system's communication structure from the descriptions of its computational components so that software modules written in existing programming languages cna be integrated flexibly and dynamically by both programmers and end-users. This separation is achieved by estabishing logical connectinos among the data interfaces of independent software modules. The logical connections provide a uniform high-level view of communication for both discrete and continuous data. The I/O abstraction approach inherits ideas from the I/O automaton model, a …


A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu Jan 1994

A Greedy Hypercube-Labeling Algorithm, D. Bhagavathi, C. E. Grosch, S. Olariu

Computer Science Faculty Publications

Due to its attractive topological properties, the hypercube multiprocessor has emerged as one of the architectures of choice when it comes to implementing a large number of computational problems. In many such applications, Gray-code labelings of the hypercube are a crucial prerequisite for obtaining efficient algorithms. We propose a greedy algorithm that, given an n-dimensional hypercube H with N=22 nodes, returns a Gray-code labeling of H, that is, a labeling of the nodes with binary strings of length n such that two nodes are neighbors in the hypercube if, and only if, their labels differ in exactly …


Translation Of Semantic Aspects Of Oodini Graphical Representation To Onto Oodb Data Definition Language, Xiaoyong Wang Jan 1994

Translation Of Semantic Aspects Of Oodini Graphical Representation To Onto Oodb Data Definition Language, Xiaoyong Wang

Theses

In this thesis we present a system to translate the semantic elements in the graphical schema language of OODINI from API of OODAL to the Type definition of ONTOS DB. To translate semantic constraints of the graphical language, we patch more information to existent class data structure in API of OODAL. After a brief review of OODINI, ONTOS DB and the existent translator without the ability to translate semantic constraints, we describe in detail the methods to translate the essential relationship. dependent relationship, multi-valued essential relationship and multi-valued dependent relationship. We employ an Inverse Reference to a "Set of" Type …


The Management Of Information Technology Investments In The Australian Ambulance Services, Anthony J. Ahern Jan 1994

The Management Of Information Technology Investments In The Australian Ambulance Services, Anthony J. Ahern

Theses: Doctorates and Masters

Information Technology plays a significant role in the administration and operation of most organisations today. This is certainly the case with each of the Australian Ambulance Services. With the rapid increase in the use of Information Technology and the expectation about its use by both staff and the general public, the Ambulance Service managements' are faced with the dilemma of trying to ensure that their organisations are able to get the full advantage of advances in Information Technology and at the same time ensure that investments in IT are maintained at appropriate levels that will ensure the maximum return on …


A Model Of Visual Recognition Implemented Using Neural Networks, Vincent C. Phillips Jan 1994

A Model Of Visual Recognition Implemented Using Neural Networks, Vincent C. Phillips

Theses: Doctorates and Masters

The ability to recognise and classify objects in the environment is an important property of biological vision. It is highly desirable that artificial vision systems also have this ability. This thesis documents research into the use of artificial neural networks to implement a prototype model of visual object recognition. The prototype model, describing a computtional architecture, is derived from relevant physiological and psychological data, and attempts to resolve the use of structural decomposition and invariant feature detection. To validate the research a partial implementation of the model has been constructed using multiple neural networks. A linear feed-forward network performs pre-procesing …


Applications Of Fuzzy Counterpropagation Neural Networks To Non-Linear Function Approximation And Background Noise Elimination, I. M. Wiryana Jan 1994

Applications Of Fuzzy Counterpropagation Neural Networks To Non-Linear Function Approximation And Background Noise Elimination, I. M. Wiryana

Theses: Doctorates and Masters

An adaptive filter which can operate in an unknown environment by performing a learning mechanism that is suitable for the speech enhancement process. This research develops a novel ANN model which incorporates the fuzzy set approach and which can perform a non-linear function approximation. The model is used as the basic structure of an adaptive filter. The learning capability of ANN is expected to be able to reduce the development time and cost of the designing adaptive filters based on fuzzy set approach. A combination of both techniques may result in a learnable system that can tackle the vagueness problem …


On The Equivalence Of Mceliece's And Niederreiter's Public-Key Cryptosystems, Y. X. Li, Robert H. Deng, X. M. Wang Jan 1994

On The Equivalence Of Mceliece's And Niederreiter's Public-Key Cryptosystems, Y. X. Li, Robert H. Deng, X. M. Wang

Research Collection School Of Computing and Information Systems

It is shown that McEliece's and Niederreiter's public-key cryptosystems are equivalent when set up for corresponding choices of parameters. A security analysis for the two systems based on this equivalence observation, is presented


Identifying Faces Using Multiple Retrievals, Jian Kang Wu, Arcot Desai Narasimhalu Jan 1994

Identifying Faces Using Multiple Retrievals, Jian Kang Wu, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

During a police investigation, officers often have to sort through hundreds of photographs to identify a suspect. To aid this task, we at the Institute of Systems Science developed and implemented a flexible database system that can retrieve faces using personal information, fuzzy and free-text descriptors, and classification trees.


A Semantic Framework For Understanding The Behavior Of Modules And Classes In Programming Languages, Mahesh Dodani, Benjamin Kok Siew Gan Jan 1994

A Semantic Framework For Understanding The Behavior Of Modules And Classes In Programming Languages, Mahesh Dodani, Benjamin Kok Siew Gan

Research Collection School Of Computing and Information Systems

Recent trends in programming language design and implementation are aimed at integrating the two most important constructs to combat complexity: modules and classes. Both constructs provide encapsulation, a cornerstone of reliable programming. These constructs differ in their approach to building hierarchies: modules define visibility of components while classes define visibility of functionality. How can modules and classes be effectively integrated within a simple programming language? This question captures the essence of developing semantics of these constructs to ensure that they interact in a meaningful way. This paper develops a formal denotational semantic framework for understanding the interaction between classes and …


A Simulated Annealing/Tabu Search Algorithm For The Vehicle Routing Problem, Jeffrey Dale White, Billy E. Gillett Dec 1993

A Simulated Annealing/Tabu Search Algorithm For The Vehicle Routing Problem, Jeffrey Dale White, Billy E. Gillett

Computer Science Technical Reports

The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was introduced in 1958 by G. B. Dantzig and J. H. Ramser. This thesis creates three algorithms that endeavor to find an optimal solution for each problem tested. Two of the algorithms (Simulated Annealing and Tabu Search) have been used previously to solve this problem. These two solution methods are revisited to discover whether a new approach to creating routes will produce the best-known optimal values every time. New routes are created by forming route neighborhoods and then selecting cities from these neighborhoods for insertion. …


Process Driven Software Engineering Environments, John Hayes Lampkin, T. Lo, Daniel C. St. Clair Dec 1993

Process Driven Software Engineering Environments, John Hayes Lampkin, T. Lo, Daniel C. St. Clair

Computer Science Technical Reports

Software development organizations have begun using Software Engineering Environments (SEEs) with the goal of enhancing the productivity of software developers and improving the quality of software products. The encompassing nature of a SEE means that it is typically very tightly coupled with the way an organization does business. To be most effective, the components of a SEE must be well integrated and the SEE itself must be integrated with the organization.

The challenge of tool integration increases considerably when the components of the environment come from different vendors and support varying degrees of “openness”. The challenge of integration with the …


Subsumption In Modal Logic, Dirk Heydtmann, Ralph W. Wilkerson Dec 1993

Subsumption In Modal Logic, Dirk Heydtmann, Ralph W. Wilkerson

Computer Science Technical Reports

Subsumption has long been known as a technique to detect redundant clauses in the search space of automated deduction systems for classical first order logic. In recent years several automated deduction methods for non-classical modal logics have been developed. This thesis explores, how subsumption can be made to work in the context of these modal logic deduction methods.

Many modern modal logic deduction methods follow an indirect approach. They translate the modal sentences into some other target language, and then determine whether there exists a proof in that language, rather than doing deduction in the modal language itself. Consequently, subsumption …


The Difficulty Of Approximating The Chromatic Number For Random Composite Graphs, Jeffrey Wayne Jenness, Billy E. Gillett Dec 1993

The Difficulty Of Approximating The Chromatic Number For Random Composite Graphs, Jeffrey Wayne Jenness, Billy E. Gillett

Computer Science Technical Reports

Combinatorial Optimization is an important class of techniques for solving Combinatorial Problems. Many practical problems are Combinatorial Problems, such as the Traveling Salesman Problem (TSP) and Composite Graph Coloring Problem (CGCP). Unfortunately, both of these problems are NP-complete and it is not known if efficient algorithms exist to solve these problems. Even approximation with guaranteed results can be just as difficult. Recently, many generalized search techniques have been developed to improve upon the solutions found by the heuristic algorithms.

This paper presents results for CGCP. In particular, exact and heuristic algorithms are presented and analyzed. This study is made, to …


A Syntax-Directed Editor For Borland’S Turbo Pascal, John Gatewood Ham, Thomas J. Sager Dec 1993

A Syntax-Directed Editor For Borland’S Turbo Pascal, John Gatewood Ham, Thomas J. Sager

Computer Science Technical Reports

This study details the design and implementation of the LSD program, a syntax-directed editor for use in editing the source code for Borland’s Turbo Pascal. LSD is a dual-mode editor which allows both traditional text editing and also grammar-based editing. LSD promotes better programming for novice users by allowing the user to edit the program with a graphical representation of a parse tree. A list of syntactically correct choices is displayed at each point where a choice must be made in the structure of the program. Since only these choices are available, no syntax errors are possible. For more advanced …


Fault-Tolerant Ring Embeddings In Hypercubes -- A Reconfigurable Approach, Jun-Lin Liu, Bruce M. Mcmillin Dec 1993

Fault-Tolerant Ring Embeddings In Hypercubes -- A Reconfigurable Approach, Jun-Lin Liu, Bruce M. Mcmillin

Computer Science Technical Reports

We investigate the problem of designing reconfigurable embedding schemes for a fixed hypercube (without redundant processors and links). The fundamental idea for these schemes is to embed a basic network on the hypercube without fully utilizing the nodes on the hypercube. The remaining nodes can be used as spares to reconfigure the embeddings in case of faults. The result of this research shows that by carefully embedding the application graphs, the topological properties of the embedding can be preserved under fault conditions, and reconfiguration can be carried out efficiently.

In this dissertation, we choose the ring as the basic network …


Effect Of Joystick Versus Control Yoke Use On Personal Computer (Pc) Flight Training: A Comparative Analysis, Gregory Alan Fontaine Dec 1993

Effect Of Joystick Versus Control Yoke Use On Personal Computer (Pc) Flight Training: A Comparative Analysis, Gregory Alan Fontaine

Master's Theses - Daytona Beach

The purpose of this study was to provide a comparative performance analysis of a generic control yoke device and a generic joystick device. The comparison provided data needed for further evaluation of personal computer (PC) aircrew training device (ATD) potential. Both devices were used in support of the same PC flight simulation software program, and were evaluated using the experimental research method. Objective and subjective data were obtained during controlled testing, and subsequently analyzed using basic summation and t-test methods. The results tested the research hypothesis that there is no significant difference in personal computer ATD operator performance using a …


Script-Based Qos Specifications For Multimedia Presentations, Richard Staehli, Jonathan Walpole Dec 1993

Script-Based Qos Specifications For Multimedia Presentations, Richard Staehli, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Multimedia presentations can convey information not only by the sequence of events but by their timing. The correctness of such presentations thus depends on the timing of events as well as their sequence and content. This paper introduces a formal specification language for playback of real-time presentations. The main contribution of this language is a quality of service (QOS) specification that relaxes resolution and synchronization requirements for playback. Our definitions give a precise meaning to the correctness of a presentation. This specification language will form the basis for a QOS interface for reservation of operating system resources.


Design And Development Of A Heterogeneous Parallel Computing System, Eruch R. Rustomji Dec 1993

Design And Development Of A Heterogeneous Parallel Computing System, Eruch R. Rustomji

Masters Theses

A parallel and distributed processing environment can be defined as one where a set of workstations is configured in a certain topology (such as completely connected linear chain) to simulate the working of a particular parallel architecture. Such an environment provides an extremely useful means of experimenting with parallel algorithms, without the use of expensive dedicated parallel machines.

Several parallel and distributed processing environments exist, such as Parallel Virtual Machine, The Condor System and the Reactive Kernel System/ Cosmic Environment System. Each of these systems has some unique features and limitations. Other systems include p4, Hermes, Linda and Express.

This …


Graphical Event-Directed Scenario Behavioral Specifications For The Scenario-Based Engineering Process (Sep) Using A Domain Specific Software Architecture (Assa) Philosophy, Miao Xia Dec 1993

Graphical Event-Directed Scenario Behavioral Specifications For The Scenario-Based Engineering Process (Sep) Using A Domain Specific Software Architecture (Assa) Philosophy, Miao Xia

Computer Science and Engineering Theses - Archive

This thesis extends scenarios of a system into real-time event digraphs. A scenario is an event trace resulting from a particular thread of system execution. An event digraph is an event network. Multiple external stimuli result in a wave of execution in distributed and parallel architecture. A graph theoretic formal definition for event digraphs is developed with the finite sets of events and the scenario event order (SEO). A scenario language is developed from the event digraph. In modeling an event digraph, we introduce the frontier expansion mechanism which let the users and the developers go around the question if …


Genetic Algorithms And Their Application To The Protein Folding Problem, Donald J. Brinkman Dec 1993

Genetic Algorithms And Their Application To The Protein Folding Problem, Donald J. Brinkman

Theses and Dissertations

The protein folding problem involves the prediction of the secondary and tertiary structure of a molecule given the primary structure. The primary structure defines sequence of amino-acid residues, while the secondary structure describes the local 3-dimensional arrangement of amino-acid residues within the molecule. The relative orientation of the secondary structural motifs, namely the tertiary structure, defines the shape of the entire biomolecule. The exact, mechanism by which a sequence of amino acids protein folds into its 3- dimensional conformation is unknown Current approaches to the protein folding problem include calculus-based methods, systematic search, model building and symbolic methods, random methods …


A Parallel Computational Fluid Dynamics Unstructured Grid Generator, Deborah E. Davis Dec 1993

A Parallel Computational Fluid Dynamics Unstructured Grid Generator, Deborah E. Davis

Theses and Dissertations

This research addressed the development of a parallel computational fluid dynamics unstructured grid generator using Delaunay triangulation. The generator is applied to simple elliptical and cylindrical two-dimensional bodies. The methodologies used included Watsons point insertion algorithm, Holmes and Snyders point creation algorithm, a discretized surface definition, Andersons clustering function, and a Laplacian smoother. The first version of the software involved a processor boundary exchange at the end of each iteration with no inter-processor communications during the iterations The second version used inter-processor communication during each iteration instead of the boundary exchange. Version 1 demonstrated a speedup of 1.8 for some …


Developing A Sophisticated User Interface To Support Domain-Oriented Application Composition And Generation Systems, Jay A. Cossentine Dec 1993

Developing A Sophisticated User Interface To Support Domain-Oriented Application Composition And Generation Systems, Jay A. Cossentine

Theses and Dissertations

This research refined the visual presentation and usability of a previously developed visual interface for a domain-oriented application composition and generation system. The refined visual interface incorporated domain-specific bit-mapped graphics and sophisticated user interface design concepts to reduce user workload. User workload was reduced through object layout, window design, and color utilization techniques; by combining repetitive procedures into single commands; and reusing, rather than recreating, composition information throughout the application composition process. The Software Refinery environment, including its graphical interface tool INTERVISTA, was used to develop techniques for visualizing and manipulating objects contained in a formal object base. INTERVISTA was …