Digital Commons Network^™

Periodicity Detection In Time Series Databases, Mohamed G. Elfeky, Walid G. Aref, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Multi-Dimenstional Traversals For Normalization Constants, Jorge R. Ramos, Vernon J. Rego

Department of Computer Science Technical Reports

No abstract provided.

On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

Based on the analysis of temporal slices, we propose novel approaches for clustering and retrieval of video shots. Temporal slices are a set of two-dimensional (2-D) images extracted along the time dimension of an image volume. They encode rich set of visual patterns for similarity measure. In this paper, we first demonstrate that tensor histogram features extracted from temporal slices are suitable for motion retrieval. Subsequently, we integrate both tensor and color histograms for constructing a two-level hierarchical clustering structure. Each cluster in the top level contains shots with similar color while each cluster in bottom level consists of shots …

Resource Annotation Framework In A Georeferenced And Geospatial Digital Library, Zehua Liu, Ee Peng Lim, Dion Hoe-Lian Goh

Research Collection School Of Computing and Information Systems

G-Portal is a georeferenced and geospatial digital library that aims to identify, classify and organize geospatial and georeferenced resources on the web and to provide digital library services for these resources. Annotation service is supported in G-Portal to enable users to contribute content to the digital library. In this paper, we present a resource annotation framework for georeferenced and geospatial digital libraries and discuss its application in G-Portal. The framework is fiexible for managing annotations of heterogeneous web resources. It allows users to contribute not only the annotation content but also the schema of the annotations. Meanwhile, other digital library …

Crystalclear: Active Visualization Of Association Rules, Hian-Huat Ong, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Effective visualization is an important aspect of active data mining. In the context of association rules, this need has been driven by the large amount of rules produced from a run of the algorithm. To be able to address real user needs, the rules need to be summarized and organized so that it can be interpreted and applied in a timely manner. In this paper, we propose two visualization techniques that is an improvement over those used by existing data mining packages. In particular, we address the visualization of "differences" in the set of rules due to incremental changes in …

Vdl: A Language For Active Mining Variants Of Association Rules, Kok-Leong Ong, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The popularity of association rules has resulted in several variations being proposed. In each case, additional attributes in the data are considered so as to produce more informative rules. In the context of active mining, different types of rules may be required over a period of time due to knowledge needs or the availability of new attributes. The present approach is the ad-hoc development of algorithms for each variant of rules. This is time consuming and costly, and is a stumping block to the vision of active mining. We argue that knowledge needs and the changing characteristics of the data …

Data Mining With Newton's Method., James Dale Cloyd

Electronic Theses and Dissertations

Capable and well-organized data mining algorithms are essential and fundamental to helpful, useful, and successful knowledge discovery in databases. We discuss several data mining algorithms including genetic algorithms (GAs). In addition, we propose a modified multivariate Newton's method (NM) approach to data mining of technical data. Several strategies are employed to stabilize Newton's method to pathological function behavior. NM is compared to GAs and to the simplex evolutionary operation algorithm (EVOP). We find that GAs, NM, and EVOP all perform efficiently for well-behaved global optimization functions with NM providing an exponential improvement in convergence rate. For local optimization problems, we …

Intergenerational Partnerships In The Design Of A Digital Library Of Geography Examination Resources, Yin-Leng Theng, Dion Hoe-Lian Goh, Ee Peng Lim, Zehua Liu, Natalie Lee-San Pang, Patricia Bao-Bao Wong, Lian-Heong Chua

Research Collection School Of Computing and Information Systems

This paper describes the engagement of intergenerational partners in the design of a digital library of geographical resources (GeogDL) to help prepare Singapore students for a national examination in geography. GeogDL is built on top of G-Portal, a digital library providing services over geospatial and georeferenced Web content. Scenario-based design and claims analysis were employed as a means of refinement to the initial design of the GeogDL prototype.

A Data Mining Approach To Library New Book Recommendations, San-Yih Hwang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we propose a data mining approach to recommending new library books that have never been rated or borrowed by users. In our problem context, users are characterized by their demographic attributes, and concept hierarchies can be defined for some of these demographic attributes. Books are assigned to the base categories of a taxonomy. Our goal is therefore to identify the type of users interested in some specific type of books. We call such knowledge generalized profile association rules. In this paper, we propose a new definition of rule interestingness to prune away rules that are redundant and …

Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

In this papel; we investigate video shots retrieval based on the analysis of temporal slice images. Temporal slices are a set of2D images extracted along the time dimension of image sequences. They encode rich set of motion clues for shot similarity measure. Because motion is depicted as texture orientation in temporal slices, we utilize various texture features such as tensor histogram, Gabor feature, and the statistical feature of co-occurrence matrix extracted directly from slices for motion description and retrieval. In this way, motion retrieval can be treated in a similar way as texture retrieval problem. Experimental results indicate that the …

Semantic Exploration Of Lecture Videos, Edward Altman, Yu Chen, Wai Chong Low

Research Collection School Of Computing and Information Systems

E-Learning is rapidly changing the way that universities and corporations offer education and training. In recent years, the acquisition and distribution of rich media content has been largely automated, However, existing applications are functionally and visually static and remain organized around the delivery media, rather than the knowledge representation and learning tasks of the student. The innovative approach of this system is the extraction of semantically meaningful structures in the lecture combined with text analysis to support task based queries. In this demonstration we will show this combination of pedagogical and content descriptions leads to novel forms of visualization and …

Load-Sensitive Transmission Power Control In Wireless Ad-Hoc Networks, Seung Jong Park, Raghupathy Sivakumar

Computer Science Faculty Research & Creative Works

Transmission power control in ad-hoc networks has hitherto been used only for achieving connectivity of networks. It has been implicitly assumed that the optimal throughput performance in ad-hoc networks can be achieved when using the minimum transmission power required to keep the network connected. However, in this paper we argue that such an assumption remains valid only under high node densities, which is not the characteristic of typical ad-hoc networks. Using both throughput and throughput per unit energy as the optimization criteria, we demonstrate that the optimal transmission power depends on several network characteristics such as the number of stations, …

Active Processor Scheduling Using Evolution Algorithms, David J. Caswell

Theses and Dissertations

The allocation of processes to processors has long been of interest to engineers. The processor allocation problem considered here assigns multiple applications onto a computing system. With this algorithm researchers could more efficiently examine real-time sensor data like that used by United States Air Force digital signal processing efforts or real-time aerosol hazard detection as examined by the Department of Homeland Security. Different choices for the design of a load balancing algorithm are examined in both the problem and algorithm domains. Evolutionary algorithms are used to find near-optimal solutions. These algorithms incorporate multiobjective coevolutionary and parallel principles to create an …

Multi-Level Decomposition Of Probabilistic Relations, Stanislaw Grygiel, Martin Zwick, Marek Perkowski

Complex Systems Faculty Publications and Presentations

Two methods of decomposition of probabilistic relations are presented in this paper. They consist of splitting relations (blocks) into pairs of smaller blocks related to each other by new variables generated in such a way so as to minimize a cost function which depends on the size and structure of the result. The decomposition is repeated iteratively until a stopping criterion is met. Topology and contents of the resulting structure develop dynamically in the decomposition process and reflect relationships hidden in the data.

A Performance Study Of Lam And Mpich On An Smp Cluster, Brian Patrick Kearns

Dissertations and Theses

Many universities and research laboratories have developed low cost clusters, built from Commodity-Off-The-Shelf (COTS) components and running mostly free software. Research has shown that these types of systems are well-equipped to handle many problems requiring parallel processing. The primary components of clusters are hardware, networking, and system software. An important system software consideration for clusters is the choice of the message passing library.

MPI (Message Passing Interface) has arguably become the most widely used message passing library on clusters and other parallel architectures, due in part to its existence as a standard. As a standard, MPI is open for anyone …

Proofs Of Soundness And Strong Normalization For Linear Memory Types, Heng Huang, Chris Hawblitzel

Computer Science Technical Reports

Efficient low-level systems need more control over memory than safe high-level languages usually provide. As a result, run-time systems are typically written in unsafe languages such as C. This report describes an abstract machine designed to give type-safe code more control over memory. It includes complete definitions and proofs.

Exact Formulae For The Lovasz Theta Function Of Sparse Circulant Graphs, Valentino Crespi

Computer Science Technical Reports

The Lovasz theta function has attracted a lot of attention for its connection with diverse issues, such as communicating without errors and computing large cliques in graphs. Indeed this function enjoys the remarkable property of being computable in polynomial time, despite being sandwitched between clique and chromatic number, two well known hard to compute quantities. In this paper I provide a closed formula for the Lovasz function of a specific class of sparse circulant graphs thus generalizing Lovasz results on cycle graphs (circulant graphs of degree 2).

Development Of A Systems Engineering Model Of The Chemical Separations Process: Quarterly Progress Report 8/16/02- 11/15/02, Yitung Chen, Randy Clarksean, Darrell Pepper

Separations Campaign (TRP)

Two activities are proposed in this Phase I task: the development of a systems engineering model and the refinement of the Argonne code AMUSE (Argonne Model for Universal Solvent Extraction). The detailed systems engineering model is the start of an integrated approach to the analysis of the materials separations associated with the AAA Program. A second portion of the project is to streamline and improve an integral part of the overall systems model, which is the software package AMUSE. AMUSE analyzes the UREX process and other related solvent extraction processes and defines many of the process streams that are integral …

Measuring Packet Reordering, John M. Bellardo, Stefan Savage

Computer Science and Software Engineering

The Internet architecture provides an unsequenced datagram delivery service. Nevertheless, many higher-layer protocols, such as TCP, assume that packets are usually delivered in sequence, and consequently suffer significant degradation when packets are reordered in flight. While there have been several recent proposals to create protocols that adapt to reordering, evaluating their effectiveness requires understanding the dynamics of the reordering processes prevalent in the Internet. Unfortunately, Internet packet sequencing is a poorly characterized and understudied behavior. This failing can be largely attributed to the lack of accurate and universally applicable methods for measuring packet reordering. In this paper, we describe a …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 2, November 2002, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

A Theoretical Framework For The Multicast Address Allocation Problem, Daniel Zappala, Chris Gauthierdickey, Virginia Lo, Timothy Singer

Faculty Publications

The multicast address allocation problem requires Internet domains to allocate unique addresses to multicast applications from a globally-shared space. We develop a theoretical framework for multicast allocation algorithms that is influenced by subcube allocation in hypercube computer systems. Based on this framework we derive complexity results for the address allocation problem and describe several new allocation algorithms that use a hypercube model for address representation.

A Pseudo Nearest-Neighbor Approach For Missing Data Recovery On Gaussian Random Data Sets, Xiaolu Huang, Qiuming Zhu

Computer Science Faculty Publications

Missing data handling is an important preparation step for most data discrimination or mining tasks. Inappropriate treatment of missing data may cause large errors or false results. In this paper, we study the effect of a missing data recovery method, namely the pseudo- nearest neighbor substitution approach, on Gaussian distributed data sets that represent typical cases in data discrimination and data mining applications. The error rate of the proposed recovery method is evaluated by comparing the clustering results of the recovered data sets to the clustering results obtained on the originally complete data sets. The results are also compared with …

Nsu Graduate Teacher Education Program (Gtep) Computer Science Education Courses 2002, Nova Southeastern University

Abraham S. Fischler College of Education and School of Criminal Justice College Archive

No abstract provided.

Design And Implementation Of Interactive Tutorials For Data Structures, Ross Gore, Lewis Barnett Iii

Department of Math & Statistics Technical Report Series

The Tutorial Generation Toolkit (TGT) is a set of Java classes that supports authoring of interactive tutorial applications. This paper describes extensions to the capabilities of the TGT and several new tutorials aimed at the Data Structures course which were built using the toolkit.

Evaluating Probabilistic Queries Over Imprecise Data, Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabhakar

Department of Computer Science Technical Reports

No abstract provided.

Mining Of Correlated Rules In Genome Sequences, L. Lin, L. Wong, Tze-Yun Leong, P. S. Lai

Research Collection School Of Computing and Information Systems

With the huge amount of data collected by scientists in the molecular genetics community in recent years, there exists a need to develop some novel algorithms based on existing data mining techniques to discover useful information from genome databases. We propose an algorithm that integrates the statistical method, association rule mining, and classification rule mining in the discovery of allelic combinations of genes that are peculiar to certain phenotypes of diseased patients.

Defending Against Redirect Attacks In Mobile Ip, Robert H. Deng, Jianying Zhou, Feng Bao

Research Collection School Of Computing and Information Systems

The route optimization operation in Mobile IP Version 6 (MIPv6) allows direct routing from any correspondent node to any mobile node and thus eliminates the problem of "triangle routing" present in the base Mobile IP Version 4 (MIPv4) protocol. Route optimization, however, requires that a mobile node constantly inform its correspondent nodes about its new care-of addresses by sending them binding update messages. Unauthenticated or malicious binding updates open the door for intruders to perform redirect attacks, i.e., malicious acts which redirect traffic from correspondent nodes to locations chosen by intruders. How to protect binding update messages to defend against …

Predicting Bottleneck Bandwidth Sharing By Generalized Tcp Flows, Archan Misra, Teunis Ott, John Baras

Research Collection School Of Computing and Information Systems

The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each …

The Capacity Of Multi-Hop Wireless Networks With Tcp Regulated Traffic, Sorav Bansal, Rajeev Shorey, Shobhit Chugh, Anurag Goel, Kapil Kumar, Archan Misra

Research Collection School Of Computing and Information Systems

We study the dependence of the capacity of multi-hop wireless networks on the transmission range of nodes in the network with TCP regulated traffic. Specifically, we examine the sensitivity of the capacity to the speed of the nodes and the number of TCP connections in an ad hoc network. By incorporating the notion of a minimal acceptable QoS metric (loss) for an individual session, we argue that the QoS-aware capacity is a more accurate model of the TCP-centric capacity of an ad-hoc network. We study the dependence of capacity on the source application (Telnet or FTP) and on the choice …

Web Classification Using Support Vector Machine, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In web classification, web pages from one or more web sites are assigned to pre-defined categories according to their content. Since web pages are more than just plain text documents, web classification methods have to consider using other context features of web pages, such as hyperlinks and HTML tags. In this paper, we propose the use of Support Vector Machine (SVM) classifiers to classify web pages using both their text and context feature sets. We have experimented our web classification method on the WebKB data set. Compared with earlier Foil-Pilfs method on the same data set, our method has been …