Computer Sciences Commons^™

Hdb-Subdue, A Relational Database Approach To Graph Mining And Hierarchical Reduction, Srihari Padmanabhan

Computer Science and Engineering Theses - Archive

Data mining aims at discovering interesting and previously unknown patterns from data sets. Transactional mining (association rules, decision trees etc.) can be effectively used to find non-trivial patterns in categorical and unstructured data. For applications that have an inherent structure (e.g., chemical compounds, proteins) graph mining is appropriate, because mapping the structured data into other representations would lead to loss of structure. The need for mining structured data has increased in the past few years. Graph mining uses graph theory principles to perform mining. Database mining of graphs aims at mining structured graph data stored in relational database tables using …

Graph-Based Learning Using A Naive Bayesian Classifier, Robert Hawes

Computer Science and Engineering Theses - Archive

Graph-based data representation is becoming increasingly more commonplace, as graphs can represent some kinds of data more efficiently than relational tables. As such, interesting patterns in the form of subgraphs can be discovered by mining these graph-based datasets. Because the learned patterns can be used to predict future occurrences, it is necessary to learn graphical concepts that can optimally classify the data in the presence of uncertainty. This work explores the construction and learning of optimal naïve Bayesian graph classifiers to distinguish between positive and negative graphs given a set of graphs as examples. Whereas most previous work in graph-based …

Approaches For Validating Frequent Episodes Based On Periodicity In Time-Series Data, Dhawal Y. Bhatia

Computer Science and Engineering Theses - Archive

There is ongoing research on sequence mining of time-series data. We study Hybrid Apriori, an interval-based approach to episode discovery that deals with different periodicities in time-series data. Our study identifies the anomaly in the Hybrid Apriori by confirming the false positives in the frequent episodes discovered. The anomaly is due to the folding phase of the algorithm, which combines periods in order to compress data. We propose a main memory based solution to distinguish the false positives from the true frequent episodes. Our algorithm to validate the frequent episodes has several alternatives such as the naïve approach, the partitioned …

Csegrid Portal: A Secure Web-Based Solution For Providing Ubiquitious Access To Grid Services (Design, Development And Implementation Of A Prototype), Srikant D. Rao

Computer Science and Engineering Theses - Archive

Grid computing is emerging as a revolutionary concept for performing high performance computations on the grid. The grid infrastructure comprises of a large set of distributed computing resources that are shared across geographical and organizational boundaries. There is a need within the scientific community for friendly interfaces that can be used to obtain ubiquitous access to the grid resources. In this work, we address these needs by designing and implementing a web-based grid portal system (CSEGrid) that provides the user with transparent access to grid services like job submission, job status and resource monitoring, data transfer between grid resources, etc. …

Solving The Rubik's Cube With Parallel Processing, Aslesha Pramod Nargolkar

Computer Science and Engineering Theses - Archive

This thesis investigates parallel processing techniques for solving the 3 x 3 x 3 Rubik's Cube. We explore various state-space search based algorithmic approaches to optimally solve the Cube. The parallel processing approach is based on IDA* using a pattern database as the underlying heuristic because of its well established effectiveness. The parallel algorithm is an extension of the Michael Reid algorithm which is sequential. The parallel algorithm exhibits good speedup and scalability. Nearly 150 random as well as symmetrical cube configurations were tested for the experiments on sequential and parallel implementations. The proposed parallel algorithm using master-slave type of …

Evolving Modular Programs By Extracting Reusable Functions Using Significance Testing, Anthony Loeppert

Computer Science and Engineering Theses - Archive

Genetic programming is an automatic programming method that uses biologically inspired methods to evolve programs. Genetic programming, and evolutionary methods in general, are useful for problem domains in which a method for \emph{constructing} solutions is either not known or infeasible, but a method for \emph{rating} solutions exists. In order to address more complex problem domains, techniques exist to extract functions (modules) automatically during a GP search. This work describes a method to identify useful automatically extracted functions from a GP search to assist subsequent GP searches within the same problem domain, using significance testing. Functions classified as beneficial augment the …

Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper we introduce heuristics that guide a subgraph discovery algorithm away from banal paths towards more "informative" ones. Given an RDF graph a user might pose a question of the form: "What are the most relevant ways in which entity X is related to entity Y?" the response to which is a subgraph connecting X to Y. We use our heuristics to …

Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa

Research Collection School Of Computing and Information Systems

Website archival refers to the task of monitoring and storing snapshots of website(s) for future retrieval and analysis. This task is particularly important for websites that have content changing over time with older information constantly overwritten by newer one. In this paper, we propose WEBARC as a set of software tools to allow users to construct a logical structure for a website to be archived. Classifiers are trained to. determine relevant web pages and their categories, and subsequently used in website downloading. The archival schedule can be specified and executed by a scheduler. A website viewer is also developed to …

Online Support For Multivariate Integration, Shujun Li

Dissertations

In this dissertation, we present an online problem solving environment for multivariate numerical integration. To build an environment for users with various backgrounds, we address issues of Web interface support for end-users, remote application programming interfaces for distributed system programmers, visualization of multivariate integrand functions for problem analysis, and highly efficient integration methods. Compared to previous implementations, our new load balancing schemes increase the scalability of parallel integration and hence are suitable for large scale computations. A parallel integration service, called PI service, was implemented based on Web services technologies to support both remote integration and remote visualization. The multivariate …

Radar - A Novel Admission Control And Handoff Management Scheme For Multimedia Leo Satellite Networks, Syed Rashidali Rizvi

Computer Science Theses & Dissertations

Low Earth Orbit (LEO) satellite networks are deployed as an enhancement to terrestrial wireless networks in order to provide broadband services to users regardless of their location. In addition to global coverage, these satellite systems support communications with hand-held devices and offer low cost-per-minute access cost, making them promising platforms for Personal Communication Services (PCS). LEO satellites are expected to support multimedia traffic and to provide their users with some form of Quality of Service (QoS) guarantees. However, the limited bandwidth of the satellite channel, satellite rotation around the Earth and mobility of end-users makes QoS provisioning and mobility management …

Robust And Efficient Localization Techniques For Cellular And Wireless Sensor Networks, Haseebulla M. Khan

Computer Science Theses & Dissertations

Localization in wireless networks refers to a collection of tasks that, collectively, determines the location of a mobile user, striving to hide the effects of mobility from the user and/or application. Localization has become an important issue and has drawn considerable attention, as many applications including E-911, cargo tracking, locating patients, location-sensitive billing, etc., require knowledge of the location of user/objects. It was realized, quite a while back, that extending emergency 911-like services (E-911) to continually growing mobile population is one of the extremely important localization applications. The bulk of the proposed solutions to emergency location management in wireless environments …

How Hard Is It To Cheat In The Gale-Shapley Stable Matching Algorithm, Chien-Chung Huang

Computer Science Technical Reports

We study strategy issues surrounding the stable marriage problem. Under the Gale-Shapley algorithm (with men proposing), a classical theorem says that it is impossible for every liar to get a better partner. We try to challenge this theorem. First, observing a loophole in the statement of the theorem, we devise a coalition strategy in which a non-empty subset of the liars gets a better partner and no man is worse off than before. This strategy is restricted in that not everyone has the incentive to cheat. We attack the classical theorem further by means of randomization. However, this theorem shows …

A Steerable, Untethered, 250x60 Micron Mems Mobile Micro-Robot, Bruce R. Donald, Christopher G. Levey, Craig D. Mcgray, Igor Paprotny, Daniela Rus

Computer Science Technical Reports

We present a steerable, electrostatic, untethered, MEMS micro-robot, with dimensions of 60 µm by 250 µm by 10 µm. This micro-robot is 1 to 2 orders of magnitude smaller in size than previous micro-robotic systems. The device consists of a curved, cantilevered steering arm, mounted on an untethered scratch drive actuator. These two components are fabricated monolithically from the same sheet of conductive polysilicon, and receive a common power and control signal through a capacitive coupling with an underlying electrical grid. All locations on the grid receive the same power and control signal, so that the devices can be operated …

Correlogram Method For Comparing Bio-Sequences, Gandhali P. Samant

Theses and Dissertations

Sequence comparison is one of the most primitive operations used in bio-informatics. It is used as a basis for many other complex manipulations in the field of Computational Molecular Biology. Many methods and algorithms were developed to compare and align sequences effectively. Most of these methods use linear comparison and some standard scoring schemes to calculate the similarity between sequences. We described an alternative approach to compare sequences based on the correlogram method. This method has already been used in the past for comparing images. By using the correlogram method, a sequence is projected on a 3-D space and the …

A Combined Routing Method For Ad Hoc Wireless Networks, Zhenhui Jiang

Dartmouth College Master’s Theses

To make ad hoc wireless networks adaptive to different mobility and traffic patterns, we studied in this thesis an approach to swap from one protocol to another protocol dynamically, while routing continues. By the insertion of a new layer, we were able to make each node in the ad hoc wireless network notify each other about the protocol swap. To ensure that routing works efficiently after the protocol swap, we initialized the destination routing protocol's data structures and reused the previous routing information to build the new routing table. We also tested our approach under different network topologies and traffic …

A Methodology For Efficiently Sampling The Conformation Space Of Molecular Structures, Audrey Lee, Ileana Streinu, Oliver Brock

Computer Science: Faculty Publications

Motivated by recently developed computational techniques for studying protein flexibility, and their potential applications in docking, we propose an efficient method for sampling the conformational space of complex molecular structures. We focus on the loop closure problem, identified in the work of Thorpe and Lei (2004 Phil. Mag. 84 1323-31) as a primary bottleneck in the fast simulation of molecular motions. By modeling a molecular structure as a branching robot, we use an intuitive method in which the robot holds onto itself for maintaining loop constraints. New conformations are generated by applying random external forces, while internal, attractive forces pull …

Crawdad: A Community Resource For Archiving Wireless Data At Dartmouth, David Kotz, Tristan Henderson

Dartmouth Scholarship

Wireless network researchers are seriously starved for data about how real users, applications, and devices use real networks under real network conditions. CRAWDAD (Community Resource for Archiving Wireless Data at Dartmouth) is a new National Science Foundation-funded project to build a wireless-network data archive for the research community. It will host wireless data and provide tools and documents to make collecting and using the data easy. This resource should help researchers identify and evaluate real and interesting problems in mobile and pervasive computing. To learn more about CRAWDAD and discuss its direction, about 30 interested people gathered at a workshop …

The Stochastic Dance Of Early Hiv Infection, Stephen J. Merrill

Mathematics, Statistics and Computer Science Faculty Research and Publications

The stochastic nature of early HIV infection is described in a series of models, each of which captures aspects of the dance of HIV during the early stages of infection. It is to this highly variable target that the immune response must respond. The adaptability of the various components of the immune response is an important aspect of the system's operation, as the nature of the pathogens that the response will be required to respond to and the order in which those responses must be made cannot be known beforehand. As HIV infection has direct influence over cells responsible for …

The Sbc-Tree: An Index For Run-Length Compressed Sequences, Mohamed Y. Eltabakh, Wing-Kai Hon, Rahul Shah, Walid G. Aref, Jeffrey S. Vitter

Department of Computer Science Technical Reports

No abstract provided.

Scaling Byzantine Fault-Tolerant Replication To Wide Area Networks, Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan Kirsch, John Lane, Josh Olsen, David Zage

Department of Computer Science Technical Reports

No abstract provided.

Improving The Performance Of Nested Loop Algorithm Using Separators, Nachiappan N. Nachiappan

Theses and Dissertations - UTB/UTPA

This thesis studies the properties of distance-based outliers and a better detection method for large multi-dimensional datasets. Outlier detection is an important task to find out the objects that deviate in a high ratio from the rest of the objects. The proposed algorithm breaks the data set into divisions and sets the area of access for each division, thus reducing the unnecessary access for a major set of elements. This algorithm reduces the run time of the existing algorithm by using separators. Datasets of varying sizes have been tested to analyze the empirical values of these procedures. Effective data structures …

An Improvement And A Generalization Of Zippel's Sparse Multivariate Polynomial Interpolation Algorithm, Michael D. Brazier

Theses and Dissertations - UTB/UTPA

The algorithm most often used for the problem of interpolating sparse multivariate polynomials from their values is Zippel's probabilistic algorithm (1988). The algorithm evaluates the function to be interpolated at a significant number of points, and for many problems of interest processing evaluations dominates the running time. This thesis presents an improvement of Zippel's algorithm, which decreases the number of evaluations needed for an interpolation by using transposed Vandermonde systems for the univariate interpolation step of Zippel's algorithm. The technique also allows a more general form of the algorithm: it becomes possible to interpolate more than one variable within a …

Investigation Of Egocentric And Exocentric Distance Perception In Virtual Environments: Application To Enhance Transfer Of Training In Multi-Model Ves, Cali Fidopiastis

Link Foundation Modeling, Simulation and Training Fellowship Reports

In this report we summarize the results for three experiments completed during the Link Fellowship period. The aim of the first and second experiments were to test the efficacy of a novel assessment procedure for determining visual acuity and quantifying depth errors of observers wearing an optical see-t1u·ough prototype head-mounted display. If successful, the assessments could provide an optimization procedure capable of discerning limitations attributed to separate components of the VE system or to the system as a whole. The second experiment explored the feasibility of utilizing mixed reality (a mix of real and virtual items) environments for the study …

J2me Programming, Chong-Wei Xu

Faculty Articles

Handheld devices, such as programmable cell phones and personal digital assistants (PDAs), have already become more numerous than PCs. Students need to be prepared today to work on the most widely available computing platforms of tomorrow. With their small size and mobility, these handheld devices present both new opportunities and unique software engineering challenges. J2ME stands for Java 2 Micro Edition that is one of the three Java Editions (J2SE, J2EE, and J2ME) specially designed for handheld devices. J2ME plus handheld devices are the platforms for wireless Internet and mobile business in the future.

Studying The Performance Of A Firewall In Network Courses, José M. Garrido

Faculty Articles

This paper presents a simple simulation model of a firewall to derive several performance metrics and briefly argues on the importance and value of modeling and simulation in courses that study various aspects of perimeter defense in network security.

The simulation model mentioned previously is part of an effort by faculty of our department to develop a multi-disciplinary repository of computational models that includes object-oriented discrete-event simulation models. One of the goals of this repository is to build resources that help educate students of computer science, software engineering, and information technology, in modeling and information security.

This and other network …

A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao

Research Collection School Of Computing and Information Systems

The need for protecting rights over relational data is of ever increasing concern. There have recently been some pioneering works in this area. In this paper, we propose an effective fingerprinting scheme based on the idea of block method in the area of multimedia fingerprinting. The scheme ensures that certain bit positions of the data contain specific values. The bit positions are determined by the keys known only to the owner of the data and different buyers of the database have different bit positions and different specific values for those bit positions. The detection of the fingerprint can be completed …

Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

A forward secure blind signature scheme was proposed by Duc, Cheon and Kim, in ICICS 2003. The security of the scheme was proved to be equivalent to the strong RSA assumption in the random oracle model. In this paper we present an attack to the scheme by forging valid signatures with public keys only. The attack is so efficient that forging a valid signature needs less computation than legally generating a signature, even considering only the user side. Our result implies that the security proof of the scheme must be invalid. Furthermore we point out the fault of the proof …

Using An Easy-To-Use And Free Tool In Teaching And Researching Networks And Security Issues, Victor A. Clincy

Faculty Articles

ITGuru is a powerful simulation environment developed by OpNET Corporation. ITGuru is unique because of its ability to model the entire networking domain, including its routers, switches, protocols, servers, and the individual applications they support. ITGuru improves network researchers' and instructors' ability to identify and solve problems throughout the network. The OpNET Corporation provides a FREE academic copy of their simulation environment to universities for both teaching and research.

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …

Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman

All Computer Science and Engineering Research

We present a novel architecture and execution model for an infrastructure supporting fault-tolerant, long-running distributed applications spanning multiple administrative domains. Components for both transaction processing and persistent state are replicated across multiple servers, en-suring that applications continue to function correctly de-spite arbitrary (Byzantine) failure of a bounded number of servers. We give a formal model of application execution, based on atomic execution steps, linearizability and a sep-aration between data objects and transactions that act on them. The architecture is designed for robust interoperability across domains, in an open and shared Internet computing infrastructure. A notable feature supporting cross-domain applications is …