Databases and Information Systems Commons^™

Factor Criteria Metric (Fcm) For Requirements Analysis Phase In The Development Of Management Information Systems, Wei Yin Chew

Student Works (2000-2009)

This project establishes a way to measure a characteristic of a product and a characteristic of a process involved in the requirements analysis phase for the development of management information systems (M!Ss) by adapting and enhancing McCall's Factor Criteria Metric (FCM) model. The two selected characteristics are the understandability of a software requirements specification (SRS) and effectiveness of a requirements gathering interview (RGI). To define the measurement for these two characteristics, a structure of factors, criteria, checklists and metrics for the characteristics of the products and processes is established based on McCall's FCM model. In addition, a software tool, FCMware, …

Xcert Software, Inc., Keng Siau

Research Collection School Of Computing and Information Systems

Xcert’s business is in developing Internet and Intranet security enhancement technology. Xcert was founded in April 1996 by Andrew Csinger and Pat Richard and was headquartered in Vancouver, Canada. Xcert’s solution to Internet security was a public key infrastructure (PKI). PKI is a system of digital certi® cates, certi® cate authorities (CAs) and other registration authorities that verify and authenticate the validity of each party involved in an Internet transaction. Xcert’s PKI technology allows organizations of any size to issue digital certi® cates to their members. These organizations become their own CA and are empowered to issue digital certi® cates …

Xcert Software, Inc., Keng Siau

Research Collection School Of Computing and Information Systems

The case on Xcert Software, Inc., illustrates the operational and strategic issues encountered by a startup IT company in the Internet security business. Xcert faces difficulty in a number of areas: (1) finances, (2) future direction and leadership, (3) organizational structure, experience and size, and (4) marketing. This is a discussion case that introduces students to the competitive world of Internet business and provides them an opportunity to discuss and debate the myriad issues facing the founders of Xcert.

Wide-Area Incident Management System On The Internet, Kaan Ozbay, Pushkin Kachroo

Electrical & Computer Engineering Faculty Research

The incident management process consists of four sequential steps-incident detection, response, clearance and recovery. Each of these components comprises of a number of operations and coordinated decision-making between the agencies involved. The provision of computer based support tools for the personnel involved will help develop appropriate strategies and increase efficiency and expediency. Existing systems are developed on various traditional computing platforms. However, with the advent of World Wide Web and Internet based programming tools such as Java, it is now possible to develop platform independent decision support tools for the incident management agencies. Any agency will be able to use …

A System For Structured Management Of Hypermedia Resources For The World Wide Web, Kevin L. Marlowe

Computer Science Theses & Dissertations

The World Wide Web (WWW) is arguably the preferred method for disseminating information across the Internet. Most of the work to support the advancement of WWW technology has focused on servers used in storing and retrieving information, browsers for viewing this information, and editors or filters for creating the information.

One area which has received little attention is that of actually managing this information at the local host. This thesis describes the development of a means for organizing local data prior to its publishing on the WWW, a method for gathering local pages together and preparing them for distribution, and …

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=2² 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 …

Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results from a search for the decays B0→π+π-, B0→K+π-, and B0→K+K-. We find 90% confidence level upper limits on the branching fractions, Bππ

A Case Tool For Conceptual Database Design, Keng Siau, Kok Phuang Tan, Hock Chuan Chan

Research Collection School Of Computing and Information Systems

The paper describes a Computer Aided Software Engineering (CASE) tool to support conceptual database modelling. One popular approach for conceptual database modelling is use of the Entity-Relationship (ER) model. The paper proposes the use of an Enhanced Entity-Relationship (EER) model for conceptual database modelling. This Enhanced Entity-Relationship model extends the Entity-Relationship model by incorporating the generalization/specialization, aggregation and categorization abstractions. The CASE tool, which is based on the Enhanced Entity-Relationship model, is known as the Enhanced Entity-Relationship Diagrammer (EERD). In addition, the CASE tool supports direct visual query and update based on the EERM.

Application Of Expert System Techniques For Award Implementation, Seng-Choon Yeoh

Theses : Honours

This paper describes a pilot expert system project, PESWEA, developed in conjunction with The Western Australian Government Railways Commission (Westrail), to locate and implement an expert system pilot solution to the problems and complexities of the awards. The paper will outline the process used to develop and implement a solution to a business requirement. In particular, the methodologies for the project, shell selection, and knowledge acquisition will be presented and discussed. The fundamentals of expert systems will be discussed to provide the reader an insight into the technology. In addition, this paper reviews the literature relevant to the research questions. …

A Case Study In Software Reuse: The Rntds Architecture, Barry J. Stevens

Computer Science Theses & Dissertations

It has been asserted that the most significant gains in software productivity will come from increased levels of software reuse. Some economic models for predicting savings through software reuse exist, but none are based on actual project experience. This paper surveys those models and presents the results of a case study, the Restructured Naval Tactical Data Systems (RNTDS) architecture, in the light of those models. According to the models, software reuse via the RNTDS architecture has enabled the production of fourteen major computer programs at five to twenty-one percent of the cost to create them without software reuse. Organizational characteristics …

A Mergeable Double-Ended Priority Queue, S. Olariu, Z. Wen

Computer Science Faculty Publications

An implementation of a double-ended priority queue is discussed. This data structure referred to as min–max–pair heap can be built in linear time; the operations Delete-min, Delete-max and Insert take O(log n) time, while Find-min and Find-max run in O(1) time. In contrast to the min-max heaps, it is shown that two min–max–pair heaps can be merged in sublinear time. More precisely, two min–max–pair heaps of sizes n and k can be merged in time O(log (n/k) * log k).

Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell

Computer Science Faculty Publications

Database designers and researchers often need efficient schemes to evaluate transaction performance. In this paper, we chose two important performance measures: the average number of nodes accessed and the average number of data items accessed per node by a transaction in a distributed database system. We derive analytical expressions to evaluate these metrics. For general applicability, we consider partially replicated distributed database systems. Our first set of analytic results are closed-form expressions for these two measures. These are based on some fairly restrictive simplifying assumptions. When these assumptions are relaxed, no closed-form expressions exist for these averages. Hence, we develop …

Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala

Computer Science Faculty Publications

Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.

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.