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

Computer Sciences Commons

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

1999

Discipline
Institution
Keyword
Publication
Publication Type

Articles 211 - 240 of 427

Full-Text Articles in Computer Sciences

Automated Estimation Of Relaxation Parameters For Interface Relaxation, John R. Rice, P. Tsompanopoulou, E. Vavalis Apr 1999

Automated Estimation Of Relaxation Parameters For Interface Relaxation, John R. Rice, P. Tsompanopoulou, E. Vavalis

Department of Computer Science Technical Reports

No abstract provided.


Limit Laws For Heights In Generalized Tries And Patricia Tries, Charles Knessl, Wojciech Szpankowski Apr 1999

Limit Laws For Heights In Generalized Tries And Patricia Tries, Charles Knessl, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


2d-Pattern Matching Image And Video Compression: Theory, Algorithms, And Experiments, Marc Alzina, Wojciech Szpankowski, Ananth Y. Grama Apr 1999

2d-Pattern Matching Image And Video Compression: Theory, Algorithms, And Experiments, Marc Alzina, Wojciech Szpankowski, Ananth Y. Grama

Department of Computer Science Technical Reports

No abstract provided.


How To Get A Free Lunch (At No Cost), John R. Rice, Naren Ramakrishnan Apr 1999

How To Get A Free Lunch (At No Cost), John R. Rice, Naren Ramakrishnan

Department of Computer Science Technical Reports

No abstract provided.


Pythia-Ii: A Knowledge/Data Base System For Testing And Recommending Scientific, Elias N. Houstis, Vassilios S. Verykios, Ann C. Caitlin, Naren Ramakrishnan, John R. Rice Apr 1999

Pythia-Ii: A Knowledge/Data Base System For Testing And Recommending Scientific, Elias N. Houstis, Vassilios S. Verykios, Ann C. Caitlin, Naren Ramakrishnan, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Information Modeling And Method Engineering: A Psychological Perspective, Keng Siau Apr 1999

Information Modeling And Method Engineering: A Psychological Perspective, Keng Siau

Research Collection School Of Computing and Information Systems

Information modeling is the cornerstone of information systems analysis and design. Information models, the products of information modeling, not only provide the abstractions required to facilitate communication between the analysts and end users, but they also provide a formal basis for developing tools and techniques used in information systems development. The process of designing, constructing, and adapting information modeling methods for information systems development is known as method engineering. Despite the pivotal role of modeling methods in successful information systems development, most modeling methods are designed based on common sense and intuition of the method designers with little or no …


Pi-Web Join In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim Apr 1999

Pi-Web Join In A Web Warehouse, Sourav S. Bhowmick, Sanjay Kumar Madria, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

With the enormous amount of data stored in the World Wide Web, it is increasingly important to design and develop powerful web warehousing tools. The key objective of our web warehousing project, called WHOWEDA (Warehouse of Web Data), is to design and implement a web warehouse that materializes and manages useful information from the Web. In this paper, we introduce the concept of Pi-web join in the context of WHOWEDA. Pi-web join operator is a web information manipulation operator to combine relevant web information residing in two web tables. Informally, it is the combination of web join and web project …


Greedy Approximation Algorithms For K-Medians By Randomized Rounding, Neal E. Young Mar 1999

Greedy Approximation Algorithms For K-Medians By Randomized Rounding, Neal E. Young

Computer Science Technical Reports

We give an improved approximation algorithm for the general k-medians problem. Given any \epsilon>0, the algorithm finds a solution of total distance at most D(1+\epsilon) using at most k ln(n+n/\epsilon) medians (a.k.a. sites), provided some solution of total distance D using k medians exists. This improves over the best previous bound (w.r.t. the number of medians) by a factor of \Omega(1/\epsilon) provided 1/\epsilon=n^O(1). The algorithm is a greedy algorithm, derived using the method of oblivious randomized rounding. It requires at most k ln(n+n/\epsilon) linear-time iterations. We also derive algorithms for fractional and weighted variants of the problem.


Monitoring Distributed Processes With Intelligent Agents, Franz J. Kurfess, Klaus Holthaus, Dhaval P. Shah, Felip Miralles Mar 1999

Monitoring Distributed Processes With Intelligent Agents, Franz J. Kurfess, Klaus Holthaus, Dhaval P. Shah, Felip Miralles

Computer Science and Software Engineering

This paper describes a platform-independent application for the monitoring of distributed applications. The tool is intended for system administrators to properly distribute the components of a distributed application onto particular machines. An essential part of this tool is based on intelligent mobile agent technology used to access the target systems. Although a full implementation turned out to be infeasible due to security considerations, the implementation and experimentation indicate the suitability of intelligent agents technology for such purposes.


Load Dependent Single Chain Models Of Multichain Closed Queueing Networks, Amy Apon, Lawrence Dowdy Mar 1999

Load Dependent Single Chain Models Of Multichain Closed Queueing Networks, Amy Apon, Lawrence Dowdy

Publications

No abstract provided.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 15, Number 3, March 1999, College Of Engineering And Computer Science, Wright State University Mar 1999

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 15, Number 3, March 1999, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Data Integration By Describing Sources With Constraint Databases, Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su Mar 1999

Data Integration By Describing Sources With Constraint Databases, Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su

Kno.e.sis Publications

We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of constraint database techniques. We assume the existence of a global database schema. The contents of each data source are described using a set of constraint tuples over the global schema; each such tuple indicates possible contributions from the source. The “source description catalog” (SDC) of a global relation consists of its associated constraint tuples. Such a method of description is advantageous since it is flexible to add new sources and to modify existing …


Efficient Mining Of Partial Periodic Patterns In Time Series Database, Jiawei Han, Guozhu Dong, Yiwen Yin Mar 1999

Efficient Mining Of Partial Periodic Patterns In Time Series Database, Jiawei Han, Guozhu Dong, Yiwen Yin

Kno.e.sis Publications

Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search mainly consider finding full periodic patterns, where every point in time contributes (precisely or approximately) to the periodicity. However, partial periodicity is very common in practice since it is more likely that only some of the time episodes may exhibit periodic patterns.

We present several algorithms for efficient mining of partial periodic patterns, by exploring some interesting properties related to partial periodicity, such as the Apriori property and the max-subpattern hit set property, and by shared mining …


Analysis Of Usaf Battlelabs' Communication Infrastructure Over Various Protocols, Rocky A. Favorito, David M. Mcillece Mar 1999

Analysis Of Usaf Battlelabs' Communication Infrastructure Over Various Protocols, Rocky A. Favorito, David M. Mcillece

Theses and Dissertations

As a result of the doctrines exposed in the Air Force's "Global Engagement: A Vision for the 21st Century Air Force," the concept of a "Battlelab" was devised to support and develop the key warfighting capabilities needed in the next century. Although geographically separated, these labs must have the capability to exchange information with each other in a "Virtual Battlelab Environment" (VBE). Although many types of data will be exchanged, only variable-bit-rate (VBR) video and distributed interactive simulation (DIS) traffic are modeled in the VBE. The research described in this thesis utilizes a systems engineering approach to investigate the performance …


A Java Based Human Computer Interface For A Uav Decision Support Tool Using Conformal Mapping, Randy A. Flood Mar 1999

A Java Based Human Computer Interface For A Uav Decision Support Tool Using Conformal Mapping, Randy A. Flood

Theses and Dissertations

This paper describes the development of the Human Computer Interface (HCI) for a Decision Support System for routing Unmanned Aerial Vehicles (UAVs). This problem is a multi-vehicle routing problem with time-windows. Because of the unique nature of UAVs, a tool is needed to support dynamic re-routing. We solve the problem in two ways. First, we create a UAV Decision Support Tool (UAV DST) that uses a set of Java software objects to display maps and convert between latitude-longitude coordinates and x-y coordinates. Secondly, this library provides the ability for the user to dynamically reoptimize large UAV routing problems through a …


Methodology For Application Design Using Information Dissemination And Active Database Technologies, Robert H. Hartz Mar 1999

Methodology For Application Design Using Information Dissemination And Active Database Technologies, Robert H. Hartz

Theses and Dissertations

In dynamic data environments, the large volume of transactions requires flexible control structures to effectively balance the flow of information between producers and consumers. Information dissemination-based systems, using both data push and pull delivery mechanisms, provide a possible scalable solution for data-intensive applications. In this research, a methodology is proposed to capture information dissemination design features in the form of active database rules to effectively control dynamic data applications. As part of this design methodology, information distribution properties are analyzed, data dissemination mechanisms are transformed into an active rule framework, and the desired reactive behavior is achieved through rule customization. …


Parallel Data Mining With The Message Passing Interface Standard On Clusters Of Personal Computers, Lonnie P. Hammack Mar 1999

Parallel Data Mining With The Message Passing Interface Standard On Clusters Of Personal Computers, Lonnie P. Hammack

Theses and Dissertations

Piles of personal computers (PoPCs) have begun to challenge the performance of the traditional Massively Parallel Processors (MPPs) and the less traditional networks of workstations (NOWs) as platforms for parallel computing. Large clusters of PCs have reached and at times exceeded the performance of modern MPPs at a fraction of the cost. Built with commodity components, these clusters can be constructed for about half the cost of a comparable NOW. The primary competing operating systems (OIS) in use on PoPCs are Linux and Windows NT. This thesis investigation compares the performance of an NT cluster with that of a Linux …


Transforming Aggregate Object-Oriented Formal Specifications To Code, John A. Kissack Mar 1999

Transforming Aggregate Object-Oriented Formal Specifications To Code, John A. Kissack

Theses and Dissertations

The feasibility of a transformational formal-based software engineering tool has been the focus of AFIT research for several years. Until now, the main research emphasis has been placed on the individual components that would comprise such a transformational system; therefore, this research demonstrates how a representative collection of aggregate objects would be transformed from specification to code. The research focused on critical integration issues associated with a formal-based software transformation system, such as the source specification, the problem space architecture, design architecture, design transforms, and target software transforms. Software is critical in today's Air Force, yet its specification, design, and …


Extensible Multi-Agent System For Heterogeneous Database Association Rule Mining And Unification, Christopher G. Marks Mar 1999

Extensible Multi-Agent System For Heterogeneous Database Association Rule Mining And Unification, Christopher G. Marks

Theses and Dissertations

The Probabilities, Expert System, Knowledge, and Inference (PESKI) System uses the data mining of association rules to fill incompleteness in the knowledge of an expert system. The rules are mined from transactional data sources and then incorporated using an existing link to PESKI. One method of providing a system that will easily allow new data sources to be added is using an information gathering agent-based system. This research first develops a methodology for designing and creating a multi-agent system. It then applies this methodology to design a platform independent means of data mining data sources of any format. The use …


Protein Structure Prediction Using Parallel Linkage Investigating Genetic Algorithms, Karl R. Deerman Mar 1999

Protein Structure Prediction Using Parallel Linkage Investigating Genetic Algorithms, Karl R. Deerman

Theses and Dissertations

AFIT has had a long-standing interest in solving the protein structure prediction (PSP) problem. The PSP problem is an intractable problem that if "solved" can lead to revolutionary new techniques for everything from the development of new medicines to optical computer switches. The challenge is to find a reliable and consistent method of predicting the 3-dimensional structure of a protein given its defining sequence of amino acids. PSP is primarily concerned with predicting the tertiary protein structure without regards to how the protein came to this folded state. The tertiary structure determines the protein's functionality.


A Modeling And Simulation Approach To Analyze The Workload Associated With The Growth Of Network Router Access Control Lists, Douglas R. Lomsdalen Mar 1999

A Modeling And Simulation Approach To Analyze The Workload Associated With The Growth Of Network Router Access Control Lists, Douglas R. Lomsdalen

Theses and Dissertations

Organizations can no longer isolate their networks from the rest of the world and still remain competitive. An organization willing to compete in the world market must take the necessary precautions to protect its network, the systems located on those networks, and its mission critical data. There are performance issues associated with the use of access control lists (ACL); however, if ACLs are implemented properly and periodically reviewed, a secure network can be attained. This research attempts to determine how the growth of an ACL affects packet flow and router CPU consumption, and also identify the specific length of an …


A Structured Approach To Software Tool Integration, Penelope A. Noe Mar 1999

A Structured Approach To Software Tool Integration, Penelope A. Noe

Theses and Dissertations

As the trend towards commercial off-the-shelf (COTS) software continues, civilian companies and government agencies alike are battling with the challenge of making multiple software packages and applications work together. Many of these companies and agencies have attempted to integrate the software tools to form a coherent system that satisfies their goals, often without the use of a step by step approach guiding the effort. Many researchers in the field of software tool integration have determined the areas that need to be addressed when tools are integrated. Some researchers have developed and expanded upon a theoretical model for integration. This model …


An Interactive Tool For Refining Software Specifications From A Formal Domain Model, Gary L. Anderson Mar 1999

An Interactive Tool For Refining Software Specifications From A Formal Domain Model, Gary L. Anderson

Theses and Dissertations

This work examines the process for refining a software specification from a formal object-oriented domain model. This process was implemented with interactive software to demonstrate the feasibility and benefits of automating what has been a tedious and often error-prone manual task. The refinement process operates within the framework of a larger Knowledge-Based Software Engineering system. A generic object-oriented representation is used to store a domain model, which allows the specification tool to access, select, and manipulate the required objects to form a customized specification. The specification is also stored as an object-oriented model, which in turn can be accessed by …


Transforming Cobol Legacy Software To A Generic Imperative Model, Dina L. Moraes Mar 1999

Transforming Cobol Legacy Software To A Generic Imperative Model, Dina L. Moraes

Theses and Dissertations

Legacy COBOL code presents challenges for organizations wishing to increase their effectiveness and improve their efficiency. The systems that utilize this code are vital to enterprise operations, yet maintenance of code is expensive. This research presents an alternative that overcomes some of the problems of legacy COBOL code through the use of software reengineering techniques. This research develops a transformation system to convert COBOL code into a generic imperative model, recapturing the initial design and deciphering the requirements implemented by the legacy code, thereby making possible the documentation of legacy systems, design restructuring, and the re-design of a new, enhanced …


Strategies For Steganalysis Of Bitmap Graphics Files, Christopher J. Fogle Mar 1999

Strategies For Steganalysis Of Bitmap Graphics Files, Christopher J. Fogle

Theses and Dissertations

Steganography is the art and science of communicating through covert channels. The goal of steganography is to hide the fact that a message is even being transmitted. In the context of today's digital world, this ancient practice is enjoying resurgence due to the plethora of hiding places made possible by modern information media. Of particular concern is the use of graphics image files to conceal both legitimate and criminal communications.


Incorporating Scene Mosaics As Visual Indexes Into Uav Video Imagery Databases, Timothy I. Page Mar 1999

Incorporating Scene Mosaics As Visual Indexes Into Uav Video Imagery Databases, Timothy I. Page

Theses and Dissertations

The rise of large digital video archives has strengthened the need for more efficient ways of indexing video files an accessing the information contained in them. Reconnaissance platforms, such as the Predator UAV, are contributing thousands of hours of video footage that require analysis, storage, and retrieval. A process is proposed for converting a video stream into a series of mosaic and selected still images that provide complete coverage of the original video. The video mosaic images can be utilized as visual indexes into a video database. In addition, mosaic images contain information from an entire sequence of video frames …


Computation Of Scattering From Bodies Of Revolution Using An Entire-Domain Basis Implementation Of The Moment Method, Arthur P. Ford Iv Mar 1999

Computation Of Scattering From Bodies Of Revolution Using An Entire-Domain Basis Implementation Of The Moment Method, Arthur P. Ford Iv

Theses and Dissertations

Research into improved calibration targets for measurement of radar cross-section has created a need for the ability to accurately compute the scattering from perfectly conducting bodies of revolution. Common computational techniques use Moment Method codes that employ subdomain basis functions to expand the unknown current density. This approach has its shortcomings. Large numbers of basis functions are required, and increasing the number of basis functions to improve accuracy after an initial computation requires re-computation of previous results and lost processing time. This research involves using basis functions that have as their domain the entire length of the surface. Entire-domain basis …


Analysis Of The Applicability Of Video Segmentation To Unmanned Aerial Vehicle Surveillance Video, Bradley L. Pyburn Mar 1999

Analysis Of The Applicability Of Video Segmentation To Unmanned Aerial Vehicle Surveillance Video, Bradley L. Pyburn

Theses and Dissertations

The focus of this research is to determine if applying edge detection segmentation (proposed by Ramin Zabih, Justin Miller, and Kevin Mai) to Unmanned Aerial Vehicle (UAV) video footage can provide meaningful segments for database storage and retrieval. The edge detection segmentation algorithm is applied to fifty-four UAV video sequences containing visual effects such as abrupt camera changes, camera zooms, motion (rapid and gradual), and cloud cover while varying the frame rate from 5 fps to 30 fps. An analysis of the results is performed to compare actual versus expected outcomes, similar sequences, and scenes with motion, along with explaining …


Generating Executable Code From Formal Specifications Of Primitive Objects, Travis W. Tankersley Mar 1999

Generating Executable Code From Formal Specifications Of Primitive Objects, Travis W. Tankersley

Theses and Dissertations

The concept of developing a model for producing compilable and executable code from formal software specifications has long been a goal of software engineers. Previous research at the Air Force Institute of Technology (AFIT) has been focused on specification and domain analysis. An analysis model is populated using specifications written in Z. Then, a set of preliminary design transforms refines the specification in the analysis model. This research bridges the gap between analysis and design, allowing source code to be produced from formal specifications of primitive objects using transformational programming. The contribution of this thesis is to transform the analysis …


Graphical User Interface And Microprocessor Control Enhancement Of A Pseudorandom Code Generator, John M. Kos Mar 1999

Graphical User Interface And Microprocessor Control Enhancement Of A Pseudorandom Code Generator, John M. Kos

Theses and Dissertations

Modern digital communication techniques often require the generation of pseudorandom numbers or sequences. The ability to quickly and easily produce various codes such as maximal length codes, Gold codes, Jet Propulsion Laboratory ranging codes, syncopated codes, and non-linear codes in a laboratory environment is essential. This thesis addresses the issue of providing automated computer control to previously built, manually controlled hardware incorporating the Stanford Telecom STEL-1032 Pseudo-Random Number (PRN) Coder. By incorporating a microcontroller into existing hardware, the STEL-1032 can now be conveniently controlled from a MATLAB Graphical User Interface (GUI). The user can quickly create, save, and recall various …