Computer Sciences Commons^™

Bluetooth Security Protocol Analysis And Improvements, Chi Shing Lee

Master's Projects

Since its creation, Bluetooth has transformed itself from a cable replacement technology to a wireless technology that connects people and machines. Bluetooth has been widely adapted on mobile phones and PDAs. Many other vendors in other industries are integrating Bluetooth into their products. Although vendors are adapting to the technology, Bluetooth hasn’t been a big hit among users. Security remains a major concern. Poor implementation of the Bluetooth architecture on mobile devices leads to some high profiled Bluetooth hacks. Weak security protocol designs expose the Bluetooth system to some devastating protocol attacks. This paper first explores four Bluetooth protocol-level attacks …

Engineering Enterprise Software Systems With Interactive Uml Models And Aspect-Oriented Middleware, Paul Nguyen

Master's Projects

Large scale enterprise software systems are inherently complex and hard to maintain. To deal with this complexity, current mainstream software engineering practices aim at raising the level of abstraction to visual models described in OMG’s UML modeling language. Current UML tools, however, produce static design diagrams for documentation which quickly become out-of-sync with the software, and thus obsolete. To address this issue, current model-driven software development approaches aim at software automation using generators that translate models into code. However, these solutions don’t have a good answer for dealing with legacy source code and the evolution of existing enterprise software systems. …

Study Of Rna Secondary Structure Prediction Algorithms, Lisa Yu

Master's Projects

Dynamic programming algorithms such as Nussinov algorithm and Zuker algorithm define criteria to search the most stable RNA secondary structures. Stochastic Context-Free Grammar (SCFG) predicts the most possible RNA secondary structure using context-free grammar and a defined set of probabilities for each grammar rule. These algorithms form the base of using computer programs to predict RNA secondary structures without pseudoknots. In this report, we review these RNA secondary structure prediction algorithms and present our own software implementations of these algorithms. The Nussinov algorithm is easy to understand. But our results show that the Nussinov algorithm is overly simplified and can …

Compact Representation Of Association Rule, Mien K. Siao

Master's Projects

Bitmap is an extremely efficient way of representing data, but the drawback is that the order of data is fixed in a bitmap. Granular computing is a new theory that frees the bitmap method from fixed order of data in the same manner as linear algebra frees the matrix theory from a fixed basis. To obtain meaningful information using data mining techniques has been a central idea in recent database applications [2]. One of the core techniques in data mining is to find associations (undirected association rules) between attribute values [4]. The complexity of finding associations is often very high. …

Visualization Of Secondary Rna Structure Prediction Algorithms, Brandon Hunter

Master's Projects

This chapter introduces the secondary structure prediction problem. It describes what the secondary structure prediction problem is and why it is important. Based on the importance of the algorithm it is essential to have a clear means to visually represent the problem. Therefore, this chapter details the high level goals of the visualization. It details how the visualization will visually represent the problem through several simultaneous representations. These visual representations will be tied together in order to increase the understanding of the algorithm.

Scalable Energy-Efficient Routing In Mobile Ad Hoc Network, Rashmi Kukanur

Master's Projects

The quick deployment without any existing infrastructure makes mobile ad hoc networks (MANET) a striking choice for dynamic situations such as military and rescue operations, disaster recovery, and so on and so forth. However, routing remains one of the major issues in MANET due to the highly dynamic and distributed environment. Energy consumption is also a significant issue in ad hoc networks since the nodes are battery powered. This report discusses some major dominating set based approaches to perform energy efficient routing in mobile ad hoc networks. It also presents the performance results for each of these mentioned approaches in …

Geometry-Based Detection Of Flash Worms, Sang Soo Kim

Master's Projects

While it takes traditional internet worms hours to infect all the vulnerable hosts on the Internet, a flash worm takes seconds. Because of the rapid rate with which flash worms spread, the existing worm defense mechanisms cannot respond fast enough to detect and stop the flash worm infections. In this project, we propose a geometric-based detection mechanism that can detect the spread of flash worms in a short period of time. We tested the mechanism on various simulated flash worm traffics consisting of more than 10,000 nodes. In addition to testing on flash worm traffics, we also tested the mechanism …

Collapsar: A Vm-Based Honeyfarm And Reverse Honeyfarm Architecture For Network Attack Capture And Detention, Xuxian Jiang, Dongyan Xu, Yi-Min Wang

Department of Computer Science Technical Reports

No abstract provided.

Emd: An Ensemble Algorithm For Discovering Regulatory Motifs In Dna Sequences, Jianjun Hu, Yifeng D. Yang, Daisuke Kihara

Department of Biological Sciences Faculty Publications

Background

Understanding gene regulatory networks has become one of the central research problems in bioinformatics. More than thirty algorithms have been proposed to identify DNA regulatory sites during the past thirty years. However, the prediction accuracy of these algorithms is still quite low. Ensemble algorithms have emerged as an effective strategy in bioinformatics for improving the prediction accuracy by exploiting the synergetic prediction capability of multiple algorithms.

Results

We proposed a novel clustering-based ensemble algorithm named EMD for de novo motif discovery by combining multiple predictions from multiple runs of one or more base component algorithms. The ensemble approach is …

Application Of Spectral Analysis To Dna Sequences, Lan Zhao

Department of Computer Science Technical Reports

No abstract provided.

Enabling Autonomic Adaption Of Virtual Computational Environments In A Shared Distributed Infrastructure, Paul Ruth, Junghwan Rhee, Dongyan Xu, Rick Kennell, Sebastien Goasguen

Department of Computer Science Technical Reports

No abstract provided.

From Physics To Illumination Models Of Subsurface Scattering, Huiying Xu, Yi Ru, Yinlong Sun

Department of Computer Science Technical Reports

No abstract provided.

Improving Data Access For Computational Grid Applications, Ron Oldfield, David Kotz

Dartmouth Scholarship

High-performance computing increasingly occurs on “computational grids” composed of heterogeneous and geographically distributed systems of computers, networks, and storage devices that collectively act as a single “virtual” computer. A key challenge in this environment is to provide efficient access to data distributed across remote data servers. Our parallel I/O framework, called Armada, allows application and data-set providers to flexibly compose graphs of processing modules that describe the distribution, application interfaces, and processing required of the dataset before computation. Although the framework provides a simple programming model for the application programmer and the data-set provider, the resulting graph may contain bottlenecks …

On Improving Wireless Broadcast Reliability Of Sensor Networks Using Erasure Codes, Rajnish Kumar, Arnab Paul, Umakishore Ramachandran, David Kotz

Dartmouth Scholarship

Efficient and reliable dissemination of information over a large area is a critical ability of a sensor network for various reasons such as software updates and transferring large data objects (e.g., surveillance images). Thus efficiency of wireless broadcast is an important aspect of sensor network deployment. In this paper, we study FBcast, a new broadcast protocol based on the principles of modern erasure codes. We show that our approach provides high reliability, often considered critical for disseminating codes. In addition FBcast offers limited data confidentiality. For a large network, where every node may not be reachable by the source, we …

Proximity In Context: An Empirically Grounded Computational Model Of Proximity For Processing Topological Spatial Expression., John D. Kelleher, Geert-Jan Kruijff, Fintan Costello

Conference papers

The paper presents a new model for context-dependent interpretation of linguistic expressions about spatial proximity between objects in a natural scene. The paper discusses novel psycholinguistic experimental data that tests and verifies the model. The model has been implemented, and enables a conversational robot to identify objects in a scene through topological spatial relations (e.g. ''X near Y''). The model can help motivate the choice between topological and projective prepositions.

Bluetooth Assassin: A Location-Based Game For Mobile Devices, Miao Wang, Brian Mac Namee

Conference papers

This short paper will describe Bluetooth Assassin, a location-based game developed for mobile devices.

Specification For Visual Requirements Of Work-Centered Software Systems, James Robert Knapp

Browse all Theses and Dissertations

Work-centered software systems function as inherent work-aiding systems. Based on the design concept for a work-centered support system (WCSS), these software systems support user tasks and goals through both direct and indirect aiding methods within the interface client. In order to ensure the coherent development and delivery of work-centered software products, WCSS visual interface requirements must be specified in order to capture the cognitive and work-aiding aspects of the user interface design. Without the ability to specify such original requirements, the probability of creating an accurate and effective work-centered software system is significantly reduced. A new visual requirements specification language …

A Field Programmable Gate Array Architecture For Two-Dimensional Partial Reconfiguration, Fei Wang

Browse all Theses and Dissertations

Reconfigurable machines can accelerate many applications by adapting to their needs through hardware reconfiguration. Partial reconfiguration allows the reconfiguration of a portion of a chip while the rest of the chip is busy working on tasks. Operating system models have been proposed for partially reconfigurable machines to handle the scheduling and placement of tasks. They are called OS4RC in this dissertation. The main goal of this research is to address some problems that come from the gap between OS4RC and existing chip architectures and the gap between OS4RC models and practical applications. Some existing OS4RC models are based on an …

Classical And Quantum Algorithms For Finding Cycles, Jill Cirasella

Publications and Research

Quantum computing—so weird, so wonderful—inspires much speculation about the line between the possible and the impossible. (Of course, there is still unclarity about how “impossible” intractable problems are and about how “possible” quantum computers are.) This thesis takes a slightly different tack: instead of focusing on how to make the impossible possible, it focuses on how to make the possible easier.

More specifically, this paper discusses quantum algorithms for finding cycles in graphs, a problem for which polynomial-time classical algorithms already exist. It explains and compares the classical and quantum algorithms, and it introduces a few new algorithms and observations. …

Efficient Mining Of Group Patterns From User Movement Data, Yida Wang, Ee Peng Lim, San-Yih Hwang

Research Collection School Of Computing and Information Systems

In this paper, we present a new approach to derive groupings of mobile users based on their movement data. We assume that the user movement data are collected by logging location data emitted from mobile devices tracking users. We formally define group pattern as a group of users that are within a distance threshold from one another for at least a minimum duration. To mine group patterns, we first propose two algorithms, namely AGP and VG-growth. In our first set of experiments, it is shown when both the number of users and logging duration are large, AGP and VG-growth are …

A Meaningful Md5 Hash Collision Attack, Narayana D. Kashyap

Master's Projects

It is now proved by Wang et al., that MD5 hash is no more secure, after they proposed an attack that would generate two different messages that gives the same MD5 sum. Many conditions need to be satisfied to attain this collision. Vlastimil Klima then proposed a more efficient and faster technique to implement this attack. We use these techniques to first create a collision attack and then use these collisions to implement meaningful collisions by creating two different packages that give identical MD5 hash, but when extracted, each gives out different files with contents specified by the atacker.

Concept Based Document Clustering Using A Simplicial Complex, A Hypergraph, Kevin Lind

Master's Projects

This thesis evaluates the effectiveness of using a combinatorial topology structure (a simplicial complex) for document clustering. It is believed that a simplicial complex better identifies the latent concept space defined by a collection of documents than the use of hypergraphs or human categorization. The complex is constructed using groups of co-occurring words (term associations) identified using traditional data mining methods. Disjoint subsections of the complex (connect components) represent general concepts within the documents’ concept space. Documents clustered to these connect components will produce meaningful groupings. Instead, the most specific concepts (maximal simplices) are used as representative connect components to …

Automatic Extraction Of Keywords And Co-Occurrence Keyword Sets, Mong-Hang Vo

Master's Projects

Internet search has become an essential part of almost everyone’s daily life and work. To make wise personal and business decisions in a timely fashion, one must access the most relevant information efficiently. Because the amount of information on the Internet is enormous, it is important that a search engine ranks the information appropriately when it presents search results to users. Latent Semantic Indexing (LSI) addresses relevance ranking based on how significant a search word is in each document. Some innovative approaches of computing higher dimensional LSI (HD-LSI) were explored in this project. In traditional LSI, the term frequency-inverse document …

Enhancing Tcp Performance In Wired-Cum-Wireless Networks, Shruthi B. Krishnan

Master's Projects

Increasing popularity for mobile devices has prompted industrial and academic research towards improving the performance of wireless applications. Transmission Control Protocol (TCP) plays an important role in defining a network’s performance, and its use in wireless networks has exposed several inadequacies in its operation. Tight coupling of TCP’s error and congestion control mechanisms has proven to be incompatible with the unique characteristics of wireless channels. TCP, designed for wired networks, assumes any loss of packet to be an indication of congestion in the network. Wireless networks exhibit a higher bit error rate, low and varying bandwidth, and disconnections of hosts …

Clustering High Dimensional Data Using Svm, Tam P. Ngo

Master's Projects

The Web contains massive amount of documents from across the globe to the point where it has become impossible to classify them manually. This project’s goal is to find a new method for clustering documents that are as close to humans’ classification as possible and at the same time to reduce the size of the documents. This project uses a combination of Latent Semantic Indexing (LSI) with Singular Value Decomposition (SVD) calculation as well as Support Vector Machine (SVM) classification. With SVD, data sets are decomposed and can be truncated to reduce the data sets size. The reduced data set …

A Fast Algorithm For Data Mining, Aarathi Raghu

Master's Projects

In the past few years, there has been a keen interest in mining frequent itemsets in large data repositories. Frequent itemsets correspond to the set of items that occur frequently in transactions in a database. Several novel algorithms have been developed recently to mine closed frequent itemsets - these itemsets are a subset of the frequent itemsets. These algorithms are of practical value: they can be applied to real-world applications to extract patterns of interest in data repositories. However, prior to using an algorithm in practice, it is necessary to know its performance as well implementation issues. In this project, …

Juice: An Svg Rendering Peer For Java Swing, Ignatius Yuwono

Master's Projects

SVG—a W3C XML standard—is a relatively new language for describing low-level vector drawings. Due to its cross-platform capabilities and support for events, SVG may potentially be used in interactive GUIs/graphical front-ends. However, a complete and full-featured widget set for SVG does not exist at the time of this writing. I have researched and implemented a framework which retargets a complete and mature raster- based widget library—the JFC Swing GUI library—into a vector-based display substrate: SVG. My framework provides SVG with a full-featured widget set, as well as augmenting Swing’s platform coverage. Furthermore, by using bytecode instrumentation techniques, my Swing to …

Finding Optimal Reduct For Rough Sets By Using A Decision Tree Learning Algorithm, Xin Li

Master's Projects

Rough Set theory is a mathematical theory for classification based on structural analysis of relational data. It can be used to find the minimal reduct. Minimal reduct is the minimal knowledge representation for the relational data. The theory has been successfully applied to various domains in data mining. However, a major limitation in Rough Set theory is that finding the minimal reduct is an NP-hard problem. C4.5 is a very popular decision tree-learning algorithm. It is very efficient at generating a decision tree. This project uses the decision tree generated by C4.5 to find the optimal reduct for a relational …

Cooperative Interval Caching In Clustered Multimedia Servers, Kim Tran

Master's Projects

In this project, we design a cooperative interval caching (CIC) algorithm for clustered video servers, and evaluate its performance through simulation. The CIC algorithm describes how distributed caches in the cluster cooperate to serve a given request. With CIC, a clustered server can accommodate twice (95%) more number of cached streams than the clustered server without cache cooperation. There are two major processes of CIC to find available cache space for a given request in the cluster: to find the server containing the information about the preceding request of the given request; and to find another server which may have …

Automated Generation Of Context-Aware Tests, Zhimin Wang, Sebastian Elbaum, David Rosenblum

School of Computing: Technical Reports

The incorporation of context-awareness capabilities into pervasive applications allows them to leverage contextual information to provide additional services while maintaining an acceptable quality of service. These added capabilities, however, introduce a distinct input space that can affect the behavior of these applications at any point during their execution, making their validation quite challenging. In this paper, we introduce an approach to improve the test suite of a context-aware application by identifying context-aware program points where context changes may affect the application’s behavior, and by systematically manipulating the context data fed into the application to increase its exposure to potentially valuable …