Computer Sciences Commons^™

Web Application Integration Using Mashups, Ronda Hilton

Computer Science and Engineering Theses - Archive

The HTML DOM is the W3C standard data model for HTML documents. A web page may be viewed as a tree structure with data nodes at each level, according to the HTML DOM, to enable web applications to access it dynamically. If a web page mashes up more than one web application, the data from one web application may flow as input into another. The user may manually transfer such data piecemeal by using the mouse to cut and paste the displayed text. Instead of this tedious and error-prone repetitious method of data transfer, the mashup may contain a software …

Pseudo-Hierarchical Ant-Based Clustering Using A Heterogeneous Agent Hierarchy And Automatic Boundary Formation, Jeremy Bernard Brown

Computer Science and Engineering Theses - Archive

The behavior and self-organization of ant colonies has been widely studied and served as the inspiration and source of many swarm intelligence models and related clustering algorithms. Unfortunately, most models that directly mimic ants produce too many clusters and converge too slowly. A wide range of research has attempted to address this issue through various means, but a number of problems remain: 1) Ants must still physically move from one cluster to another through intermediate locations, 2) current methods for remote relocation of an item only consider one movement at time to a particular location and do not consider patterns …

An Auction Mechanism For Grid Scheduling And Resource Allocation In The Context Of Atlas, Tengkok Aaron Thor

Computer Science and Engineering Dissertations - Archive

The technological advancements in the areas of computing and networking over the recent years have led to an emerging infrastructure known as Computational Grids, which provides users with the flexibility of pervasive access to enormous computational resources hosted at remote locations. Effective resource management and job scheduling poses a challenge when constraints such as resource utilization, response time, global and local policies need to be taken into account, while dealing with potentially independent sources of jobs, computational, and storage resources. It must be ensured that scheduling decisions made are still valid by the time a job is to be executed, …

Design And Analysis Of Application Architecture For Opportunistic Networks Using Ad Hoc Wi-Fi, Sankalp Vinod Shere

Computer Science and Engineering Theses - Archive

In recent years, the number of smartphone users has increased by many folds. In fact, it is estimated to reach 100 million by 2013. Current generation of smartphones has better storage, battery, computing capabilities and they come equipped with short range communication technologies like Bluetooth and Wi-Fi. These improved capabilities coupled with staggering rise in number of users, has prompted growing interest in smartphone applications that help users to communicate with each other directly and over the internet. In particular as a result, when a large number of mobile users can communicate directly with each other during opportunistic contacts when …

Reactive Control Composition For Mobile Manipulators, Binu George Mathew

Computer Science and Engineering Theses - Archive

A mobile manipulator is a manipulator mounted on a mobile platform. Due to this combination it has increased mobility compared to a fixed manipulator and increased dexterity compared to a mobile platform. At the same time it has a significantly higher number of degrees of freedom than fixed manipulators or mobile platforms and an increased task and workspace. In particular, the size of the workspace of the manipulator is restricted only by the workspace limitations of the mobile platform and the obstacles around the goal location. In addition, the extra degrees of freedom increase the number of ways in which …

Design And Analysis Of A Mobile File Sharing System For Opportunistic Networks, Gautam Ravendra Chavan

Computer Science and Engineering Theses - Archive

In the past several years, wireless mobile devices with advanced computing, sensing, and storing capabilities have been increasingly developed by handset manufacturers, deployed by wireless carriers, and accepted by consumers. A prominent example is the vast success of Apple's iPhone, which witnessed a sale of 1 million units during the first 3 days of sales for its new version iPhone 3GS. As a result of the increasing popularity of these mobile devices, users can carry, utilize, and exchange information embedded therein, ideally wherever they go and whenever they want. A prominent scenario is where information is exchanged among users when …

The Reputation System For Robust, Structured P2p Systems, Apurv Ashok Dhadphale

Computer Science and Engineering Theses - Archive

Structured peer-to-peer systems are distributed communication systems that typically use Distributed Hash Table (DHT) indexing to efficiently locate the resources. These networks are highly scalable and can route the messages correctly even for the extremely dynamic environment. But these networks are vulnerable; even a small fraction of malicious nodes can bias the lookup results when they are present on a lookup path. In our thesis, we address this problem of reliably searching the insecure p2p networks. We propose a reputation system to reduce the number of failed lookups and make the networks more robust. For our study, the concept is …

Liquid: A Detection Resistant Covert Timing Channel Based On Ipd Shaping, Robert J. Walls

Computer Science and Engineering Theses - Archive

Covert timing channels provide a way to surreptitiously leak information from an entity in a higher-security level to an entity in a lower level. The difficulty of detecting or eliminating such channels makes them a desirable choice for adversaries that value stealth over throughput. When one considers the possibility of such channels transmitting information across network boundaries, the threat becomes even more acute. A promising technique for detecting covert timing channels focuses on using entropy-based tests. This method is able to reliably detect known covert timing channels by using a combination of entropy and conditional entropy to detect anomalies in …

An Integrated Framework For Qos-Aware Data Reporting In Wireless Sensor Networks, Hyun Jung Choe

Computer Science and Engineering Dissertations - Archive

Wireless sensor networks are being deployed in a wide variety of applications such as environment monitoring, smart buildings, security, machine surveillance system, and so on.The deployment of sensor networks for a specific sensing application enhances the ability to control and examine the physical environments while collecting meaningful information from the monitoring area.In densely deployed networks, the sensor nodes located in an adjacent area detect the targeted phenomena in its sensing range and report the gathered (raw or processed) data to designated sinks via single-hop or multi-hop communication paths.Although the correlation of data from proximity sensors cause overheads in terms of …

Room Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 40 maps of size 512x512 and problem sets. Maps are divided into rooms of size 8x8, 16x16, 32x32, and 64x64. There are 10 maps and problem sets for each room size. Maps with differing room sizes are not scaled: thickness of walls and passages differs.

Random Obstacle Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 70 maps of size 512x512 and benchmark problem sets. These maps are algorithm-generated by blocking grid cells. Maps contain 10%, 15%, 20%, 25%, 30%, 35%, or 40% blocked cells. There are 10 maps and problem sets for each percentage.

Strategy, Robot Soccer In Fira Mirosot Category, Kushtrim Dragusha

Theses and Dissertations

Robot Soccer strategy is main part of robot soccer system, where strategy makes briefing of the entire system. Where, using different functions and programming hardware features in the way of batter usage of system, should improve the soccer game of robots. Functions combined between each other to make so called strategy where it is called main part of entire system. Because of this beautiful impact on system, any way entire system is just to make strategy working, and for sure devices on system will have also their impact on strategy behaviour. Thesis mainly has to deal with the way of …

Empirical Usage Metadata In Learning Objects, Gwen Nugent, Kevin Kupzyk, S. A. Riley, L.D. Miller, Jesse Hostetler, Leen-Kiat Soh, Ashok Samal

School of Computing: Conference and Workshop Papers

The iLOG Project (Intelligent Learning Object Guide) is designed to augment multimedia learning objects with information about (1) how a learning object has been used, (2) how it has impacted instruction and learning, and (3) how it should be used. The goal of the project is to generate metadata tags from data collected while students interact with learning objects; these metadata tags can then be used to help teachers identify learning objects that match the educational and experiential backgrounds of their students. The project involves the development of an agent-based intelligent system for tracking student interaction with learning objects, in …

Density-Based Clustering Of Polygons, Deepti Joshi, Ashok Samal, Leen-Kiat Soh

School of Computing: Conference and Workshop Papers

Clustering is an important task in spatial data mining and spatial analysis. We propose a clustering algorithm P-DBSCAN to cluster polygons in space. PDBSCAN is based on the well established density-based clustering algorithm DBSCAN. In order to cluster polygons, we incorporate their topological and spatial properties in the process of clustering by using a distance function customized for the polygon space. The objective of our clustering algorithm is to produce spatially compact clusters. We measure the compactness of the clusters produced using P-DBSCAN and compare it with the clusters formed using DBSCAN, using the Schwartzberg Index. We measure the effectiveness …

Redistricting Using Heuristic-Based Polygonal Clustering, Deepti Joshi, Leen-Kiat Soh, Ashok K. Samal

School of Computing: Conference and Workshop Papers

Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too complex for an automated system to be developed that can produce unbiased plans. In this paper we present a novel method for redistricting a geographic area using a heuristic-based approach for polygonal spatial clustering. While clustering geospatial polygons several complex issues need to be addressed – such as: removing order dependency, clustering all polygons assuming no outliers, and strategically utilizing domain knowledge to guide the clustering process. In order to address these …

Joint Computing And Network Resource Scheduling In A Lambda Grid Network, Vaidhehi Lakshmiraman, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication …

Regression Model Checking, Guowei Yang, Matthew B. Dwyer, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Model checking is a promising technique for verifying program behavior and is increasingly finding usage in industry. To date, however, researchers have primarily considered model checking of single versions of programs. It is well understood that model checking can be very expensive for large, complex programs. Thus, simply reapplying model checking techniques on subsequent versions of programs as they evolve, in the limited time that is typically available for validating new releases, presents challenges. To address these challenges, we have developed a new technique for regression model checking (RMC), that applies model checking incrementally to new versions of systems. We …

Revealing The Copy And Paste Habits Of End Users, Kathryn T. Stolee, Sebastian Elbaum, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Transferring data across applications is a common end user task, and copying and pasting via the clipboard lets users do so relatively easily. Using the clipboard, however, can also introduce inefficiencies and errors in user tasks. To help researchers and tool developers understand and address these problems, we studied how end users interact with the clipboard through cut, copy, and paste actions. This study was performed by logging clipboard interactions while end users performed everyday tasks. From the clipboard usage data, we have identified several usage patterns that describe how data is transferred within the desktop environment. Such patterns help …

Autonomous Abstraction Of Policies Based On Policy Homomorphism, Srividhya Rajendran

Computer Science and Engineering Dissertations - Archive

A life long learning agent performing in a complex and dynamic environment needs the ability to learn increasingly complex tasks over time. These agents over their lifetime have to learn new tasks, adapt the policies of already learned tasks and extract and reuse the knowledge gained to learn new, more complex tasks. To do this, they need methods that allow them to autonomously extract knowledge from the already learned policy instances and reuse the knowledge gained to learn related tasks in novel environments.This dissertation presents a novel approach that enables an agent to autonomously abstract reusable skills and concepts using …

Probabilistic Analysis Of A Motif Discovery Algorithm For Multiple Sequences, Bin Fu, Ming-Yang Kao, Lusheng Wang

Computer Science Faculty Publications

We study a natural probabilistic model for motif discovery that has been used to experimentally test the quality of motif discovery programs. In this model, there are k background sequences, and each character in a background sequence is a random character from an alphabet Σ. A motif G = g1g2 · · · gm is a string of m characters. Each background sequence is implanted into a probabilistically generated approximate copy of G. For an approximate copy b1b2 · · · bm of G, every character bi is probabilistically generated such that the probability for r $b_i\neq g_i$ is at …

Characterization Of 1h Nmr Spectroscopic Data And The Generation Of Synthetic Validation Sets, Paul E. Anderson, Michael L. Raymer, Benjamin J. Kelly, Nicholas V. Reo, Nicholas J. Delraso, Travis E. Doom

Kno.e.sis Publications

Motivation: Common contemporary practice within the nuclear magnetic resonance (NMR) metabolomics community is to evaluate and validate novel algorithms on empirical data or simplified simulated data. Empirical data captures the complex characteristics of experimental data, but the optimal or most correct analysis is unknown a priori; therefore, researchers are forced to rely on indirect performance metrics, which are of limited value. In order to achieve fair and complete analysis of competing techniques more exacting metrics are required. Thus, metabolomics researchers often evaluate their algorithms on simplified simulated data with a known answer. Unfortunately, the conclusions obtained on simulated data are …

A Comparison Of The Rule And Case-Based Reasoning Approaches For The Automation Of Help-Desk Operations At The Tier-Two Level, Michael Forrester Bryant

CCAC Theses and Dissertations

This exploratory study investigates the hypothesis that case-based reasoning (CBR) systems have advantages over rule-based reasoning (RBR) systems in providing automated support for Tier-2 help desk operations. The literature suggests that rule-based systems are best suited for problem solving when the system being analyzed is a single-purpose, specialized system and the rules for solving the problems are clear and do not change with high frequency. Case-based systems, because of their ability to offer alternative solutions for a given problem, give help-desk technicians more flexibility. Specifically, this dissertation aims to answer the following questions:

1. Which paradigm, rule-based or case-based reasoning, …

An Online Community For Computer Technology Support And Training For College Office Support Staff, Mava F. Wilson

CCAC Theses and Dissertations

Educational institutions strive to stay on the edge of technological advances in response to stakeholders' desire to receive value for their investment. Rapid changes in computer technology present a dilemma to colleges and universities in the support and training arena. An important segment of the institutional population, office support staff are vital to the everyday running of departments with extremely diverse responsibilities critical to the institutional mission. Office support staff seem to be left out when support and training programs for new technology are being planned. With technology changing so quickly it is vital that organizations have support and training …

Flocking In The Time-Dissonance Plane, Adam James Wilson

Publications and Research

This paper describes a technique for the sonification of an idealized model of the flocking behavior of birds, fish, and insects. Flocking agents are represented by pitches that move through time to produce chords of variable dissonance. The objective of each agent is to move toward more consonant chord formations with other agents. The output of the sonification is intended to provide material for use in musical composition.

Information Overload: Cctv, Your Networks, Communities And Crime, Vandra Harris, Crispin Harris

Australian Security and Intelligence Conference

Electronic surveillance continues to play a central but often unobserved role in contemporary Western societies and attempts to police them. This paper focuses on closed circuit television (CCTV) footage and its technological implications, particularly relating infrastructure and data storage and integrity. While CCTV might appear attractive in augmenting law enforcement systems, the authors argue that the debate on use of CCTV in crime prevention remains incomplete without an effective understanding of the diverse costs. This discussion reveals startling ICT resource needs and associated costs, together with very specific technological capacity. These contribute significantly to the costs of such systems, reinforcing …

Professional Intelligence Judgement Artistry: Some Early Observations, Jeff Corkill

Australian Security and Intelligence Conference

Intelligence analysis is critical national security and law enforcement function dependant on the intellectual capacity of individual analysts. The practice of intelligence is undertaken in an extremely complex environment often under a veil of secrecy, and where uncertain and deceptive information represents the norm. In order to develop as a profession appropriate constructs with which to explore and explain how analysts process intelligence, make decisions and reach judgements are needed. An improved understanding will offer opportunities to develop appropriate training and professional development for intelligence analysts. This paper introduces the construct of Professional Intelligence Judgement Artistry together with some very …

Information Brokerage - A New Approach Using Knowledge Management, Robert Loew

Theses

Traditional knowledge management attempts to store the total enterprise knowledge into IT related structures, but knowledge management strategies should focus also on people and organisations and not just on technology.

This can be addressed in part by communicating knowledge between people, in and across organisations. Such communication focuses on the development and exchange of people’s experience.

This thesis introduces a hybrid knowledge management solution consisting of an automated system that includes people: employees, experts and Knowledge Brokers (KB). The hybrid concept supports the identification of suitable people for certain topics of discussion. Further, it supports the knowledge communication process by …

Automated Network Planning For Industrial Ethernet Networks, Holger Machens

Theses

Engineers usually use computer aided methods to ease the increasingly complex planning task of automation plants. One such computer aided method for automated planning of Industrial Ethernet networks under given network QoS requirements is presented in this thesis. The method is based on partitioning the given set of network nodes according to specified communication relationships between the nodes, thereby creating subsets of nodes which are joined using given networking algorithms. Several networking algorithms may be applicable for each subset of nodes and any complete solution is a combination of several partial solutions, one for each subset of nodes. Enumeration through …

Optimal Tracking Control Of Affine Nonlinear Discrete-Time Systems With Unknown Internal Dynamics, Travis Dierks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, direct dynamic programming techniques are utilized to solve the Hamilton Jacobi-Bellman equation forward-in-time for the optimal tracking control of general affine nonlinear discrete-time systems using online approximators (OLA's). the proposed approach, referred as adaptive dynamic programming (ADP), is utilized to solve the infinite horizon optimal tracking control of affine nonlinear discrete-time systems in the presence of unknown internal dynamics and a known control coefficient matrix. the design is implemented using OLA's to realize the optimal feedback control signal and the associated cost function. the feedforward portion of the control input is derived and approximated using an additional …

The Informational Content Of Canonical Disjoint Np-Pairs, Christian Glaßer, Alan L. Selman, Liyu Zhang

Computer Science Faculty Publications

We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between propositional proof systems translate to reductions between their canonical pairs. We focus on the opposite direction and study the following questions.

Q1: For which propositional proof systems f and g does the implication hold, and for which does it fail?

Q2: For which propositional proof systems of different strengths are the canonical pairs equivalent?

Q3: What do (non-)equivalent canonical pairs tell about the corresponding propositional proof systems?

Q4: Is every NP-pair (A, B), where A is NP-complete, strongly many-one equivalent to the …