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

Physical Sciences and Mathematics Commons™

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

PDF

Missouri University of Science and Technology

Computer Science Faculty Research & Creative Works

Series

1997

Articles 1 - 14 of 14

Full-Text Articles in Physical Sciences and Mathematics

Data Mining, Yongjian Fu Oct 1997

Data Mining, Yongjian Fu

Computer Science Faculty Research & Creative Works

Data mining is the process of identifying interesting patterns from large databases. It is the core part of the knowledge discovery in database (KDD) process. Tasks in data mining are classified into summarization, classification, clustering, association and trend analysis. Data mining techniques are adopted from many research areas including statistics, machine learning, database systems, neural networks, rough sets and visualization. The techniques have been applied successfully in many areas from business to science to sports.

Go to article

Information Retrieval On The World Wide Web, Venkat N. Gudivada, Vijay V. Raghavan, William I. Grosky, Rajesh Kasanagottu Sep 1997

Information Retrieval On The World Wide Web, Venkat N. Gudivada, Vijay V. Raghavan, William I. Grosky, Rajesh Kasanagottu

Computer Science Faculty Research & Creative Works

Effective search and retrieval are enabling technologies for realizing the full potential of the Web. The authors examine relevant issues, including methods for representing document content. They also compare available search tools and suggest methods for improving retrieval effectiveness.

Go to article

Time-Efficient Maze Routing Algorithms On Reconfigurable Mesh Architectures, Fikret Ercal, H. C. Lee Aug 1997

Time-Efficient Maze Routing Algorithms On Reconfigurable Mesh Architectures, Fikret Ercal, H. C. Lee

Computer Science Faculty Research & Creative Works

The routing problem is one of the most widely studied problems in VLSI design. Maze-routing algorithms are used in VLSI routing and robot path planning. Efficiency of the parallel maze routing algorithms which were mostly based on C. Y. Lee's algorithm8is poor. In this paper, we propose time-efficient algorithms to solve the maze-routing problem on a reconfigurable mesh architecture. The constant-time algorithms presented include: (i) testing the existence of specific types of paths between two terminals, and (ii) finding an absolute shortest path (ASP) and a shortest duplex-path (SDP). In addition, a fast algorithm to find the single shortest path …

Go to article

An Introduction To Algorithmic Information Theory: Its History And Some Examples, George Markowsky Mar 1997

An Introduction To Algorithmic Information Theory: Its History And Some Examples, George Markowsky

Computer Science Faculty Research & Creative Works

The goal of this paper is to provide a simple introduction to Algorithmic Information Theory (AIT) that will highlight some of the main ideas without presenting too many details. More technical treatments of these ideas can be found in References [1], [2], [3] and [4], which are listed at the end of the paper. The main ideas of Algorithmic Information Theory will be presented using English as the underlying programming language. The presentation illustrates the fact that the same arguments can be expressed in any other reasonable language and that the main results have a robust universality across all reasonable …

Go to article

A Fast Algorithm For Complete Subcube Recognition, Fikret Erçal, H. J. Burch Jan 1997

A Fast Algorithm For Complete Subcube Recognition, Fikret Erçal, H. J. Burch

Computer Science Faculty Research & Creative Works

The complete subcube recognition problem is defined as, given a collection of available processors on an n-dimensional hypercube, locate a subcube of dimension k that consists entirely of available processors, if one exists. Despite many algorithms proposed so far on this subject, improving the time complexity of this problem remains a challenge. Efficiency limits that can be reached have not been exhausted yet. This paper proposes a novel algorithm to recognize all the overlapping subcubes available on an n-dimensional hypercube whose processors are partially allocated. Given P=2n, as the total number of processors in the hypercube, the new algorithm runs …

Go to article

Evolutionary Computation Applied To Adaptive Information Filtering, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper, Joost N. Kok Jan 1997

Evolutionary Computation Applied To Adaptive Information Filtering, Daniel R. Tauritz, Ida G. Sprinkhuizen-Kuyper, Joost N. Kok

Computer Science Faculty Research & Creative Works

Information Filtering is concerned with filtering data streams in such a way as to leave only pertinent data (information) to be perused. When the data streams are produced in a changing environment the filtering has to adapt too in order to remain effective. Adaptive Information Filtering is concerned with filtering in changing environments. The changes may occur both on the transmission side (the nature of the streams can change), and on the reception side (the interest of a user can change). Weighted trigram analysis is a quick and flexible technique for describing the contents of a document. A novel application …

Go to article

Keyboardless Visual Programming Using Voice, Handwriting, And Gesture, Jennifer Leopold, A. Ambler Jan 1997

Keyboardless Visual Programming Using Voice, Handwriting, And Gesture, Jennifer Leopold, A. Ambler

Computer Science Faculty Research & Creative Works

Visual programming languages have facilitated the application development process, improving our ability to express programs, as well as our ability to view, edit and interact with them. Yet even in programming environments, productivity is restricted by the primary input sources: the mouse and the keyboard. As an alternative, we investigate a program development interface which responds to the most natural human communication technologies: voice, handwriting and gesture. Speech- and pen-based systems have yet to find broad acceptance in everyday life because they are insufficiently advantageous to overcome problems with reliability. However, we believe that a visual programming environment with a …

Go to article

User Defined Prewrites For Increasing Concurrency In Design Databases, Sanjay Kumar Madria, A. Embong Jan 1997

User Defined Prewrites For Increasing Concurrency In Design Databases, Sanjay Kumar Madria, A. Embong

Computer Science Faculty Research & Creative Works

We introduce a prewrite operation before a write operation is performed on design databases, a database that consists of objects as engineering designs. A prewrite operation does not actually make a design but it only makes available the model of the design that the transaction will produce in future. Once the prewrite design by a transaction is announced, the transaction executes a pre-commit operation. After the pre-commit, read operations can access the prewrite design even before the pre-committed transaction has finally made the design and committed. Therefore, our algorithm increases the potential concurrency as compared to the algorithms that permit …

Go to article

A Concurrency Control Algorithm For An Open And Safe Nested Transaction Model, Sanjay Kumar Madria Jan 1997

A Concurrency Control Algorithm For An Open And Safe Nested Transaction Model, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We present a concurrency control algorithm for an open and safe nested transaction model. We use prewrite operations in our model to increase the concurrency. Prewrite operations are modeled as subtransactions in the nested transaction tree. The subtransaction which initiates prewrite subtransactions are modelled as recovery point subtransaction. The recovery point subtransaction can release their locks before its ancestors commit. Thus, our model increases the concurrency in comparison to other nested transaction models. Our model is useful an environment of long-running transactions common in object oriented databases, computer aided design and in the software development process

Go to article

High-Order Object Model Based Software Analysis, Xiaoqing Frank Liu, Hungwen Lin Jan 1997

High-Order Object Model Based Software Analysis, Xiaoqing Frank Liu, Hungwen Lin

Computer Science Faculty Research & Creative Works

The integration of object oriented modeling and structured analysis (SA) for developing a well structured object oriented software system is a challenge for requirements analysts and software designers. Some of the existing object oriented modeling techniques adopt approaches that are very different from SA, and others have clumsily stayed with SA after a few modifications. Our High Order Object Modeling Technique (HOOMT) however, attempts to strike a mean between both extremes while at the same time provides an effective modeling method. HOOMT consists of two models, the High Order Object Model and the Object Information Flow Model. By using the …

Go to article

Rmesh Algorithms For Parallel String Matching, Hsi-Chieh Lee, Fikret Erçal Jan 1997

Rmesh Algorithms For Parallel String Matching, Hsi-Chieh Lee, Fikret Erçal

Computer Science Faculty Research & Creative Works

String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines, and spelling correction. Especially with the introduction of search engines dealing with tremendous amount of textual information presented on the world wide web and the research on DNA sequencing, this problem deserves special attention and any algorithmic or hardware improvements to speed up the process will benefit these important applications. In this paper, we present three algorithms for string matching on reconfigurable mesh architectures. Given a text T of length n and a pattern P of …

Go to article

Timestamp-Based Approach For The Detection And Resolution Of Mutual Conflicts In Distributed Systems, Sanjay Kumar Madria Jan 1997

Timestamp-Based Approach For The Detection And Resolution Of Mutual Conflicts In Distributed Systems, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

We present a timestamp based algorithm for the detection of both write-write and read-write conflicts for a single file in distributed systems during network partitions. Our algorithm allows operations to occur in different network partitions simultaneously. When the sites from different partitions merge, the algorithm detects and resolves both read-write and write-write conflicts without taking into account the semantics of the transactions. Once the conflicts have been detected some reconciliation steps for the resolution of conflicts have also been proposed. Our algorithm will be useful in real-time systems where timeliness of operations is more important than response time (delayed commit)

Go to article

An Efficient Algorithm For Direct Computation Of Adjacent Block Coefficients In The Transformed Domain, Chaman Sabharwal, Brian Quandt Jan 1997

An Efficient Algorithm For Direct Computation Of Adjacent Block Coefficients In The Transformed Domain, Chaman Sabharwal, Brian Quandt

Computer Science Faculty Research & Creative Works

The current research in many areas of image processing involves operations performed in the compressed domain [Smith and Rowe 1993, Chang 93]. Compressed domain may be DCT, Wavelet, JPEG or MPEG etc. The algorithms for .these transformations may be used for information filtering such as feature extraction and edge detection. The image transformations such as compositing, occluding, and scaling may also be performed in the compressed domain. It is desirable to perform these operations on compressed data directly because the smaller size of data involves less computational complexity. The computation in the compressed domain eliminates the overhead of decoding the …

Go to article

Direct Finite First-Order Model Generation With Negative Constraint Propagation Heuristic, Olga Shumsky, Ralph W. Wilkerson, Fikret Ercal, William W. Mccune Jan 1997

Direct Finite First-Order Model Generation With Negative Constraint Propagation Heuristic, Olga Shumsky, Ralph W. Wilkerson, Fikret Ercal, William W. Mccune

Computer Science Faculty Research & Creative Works

An Automated Finite First-Order Model Generator Has Been Developed. the Problem is Viewed as a First-Order Satisfiability Problem. Most Existing Model Generators Reduce the Problem to Propositional Satisfiability by Converting the Input First-Order Clauses into Propositional Clauses. This Generator, Unlike Others, Stores the Input First-Order Clauses and Solves the Problem Directly. It Uses an Exhaustive Backtracking Algorithm with Weight-Based Splitting. a Negative Constraint Propagation is Implemented to Reduce the Number of Decision Points and Thus to Speed Up the Search. © 1997 ACM.

Go to article