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

Digital Commons Network

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

Physical Sciences and Mathematics

Other

Theses/Dissertations

2009

Articles 1 - 17 of 17

Full-Text Articles in Entire DC Network

A Privacy Enhanced Situation-Aware Middleware Framework For Ubiquitous Computing Environments, Gautham V. Pallapa Jan 2009

A Privacy Enhanced Situation-Aware Middleware Framework For Ubiquitous Computing Environments, Gautham V. Pallapa

Computer Science and Engineering Dissertations

The Ubiquitous Computing paradigm integrates myriads of small, inexpensive, heterogeneous networked devices, including sensors, distributed throughout the environment, with the intent of enabling context awareness in systems deployed to monitor the environment. This is accomplished by monitoring events, such as access, or utilization of resources, and obtaining knowledge about user activities, and interactions with other entities in the environment. Existing context-aware systems predominantly encapsulate the occurred activities either by using Event-Condition-Action rules, where an instance of the event performs as a trigger, or by prediction mechanisms, such as Dynamic Bayesian Networks, which compute decisions, based on the information obtained. However, …


Reactive Control Composition For Mobile Manipulators, Binu George Mathew Jan 2009

Reactive Control Composition For Mobile Manipulators, Binu George Mathew

Computer Science and Engineering Theses

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 …


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

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

Computer Science and Engineering Dissertations

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 A Mobile File Sharing System For Opportunistic Networks, Gautam Ravendra Chavan Jan 2009

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

Computer Science and Engineering Theses

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 …


Autonomic Trust Management In Dynamic Systems, Brent Lagesse Jan 2009

Autonomic Trust Management In Dynamic Systems, Brent Lagesse

Computer Science and Engineering Dissertations

Research in pervasive computing is aimed at creating environments where users can seamlessly benefit from ubiquitous computing resources despite the complexity of the environment. Providing security in such systems is a difficult task since traditional security mechanisms often require significant user attention and do not scale well to large, mobile, and open environments. To combat this problem, distributed trust has been proposed to provide security in pervasive systems. While much research has been performed in the area, many vulnerabilities and insufficiencies still exist, especially in mobile ad-hoc systems that cannot support distributed trust mechanisms requiring pre-existing infrastructure and cooperation. Dynamic …


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

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

Computer Science and Engineering Dissertations

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 …


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

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

Computer Science and Engineering Theses

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 …


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

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

Computer Science and Engineering Theses

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 …


Web Application Integration Using Mashups, Ronda Hilton Jan 2009

Web Application Integration Using Mashups, Ronda Hilton

Computer Science and Engineering Theses

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 …


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

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

Computer Science and Engineering Theses

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 …


Attributes Selection And Package Design To Maximize Visibility Of Objects, Md Zahiduzzaman Miah Jan 2009

Attributes Selection And Package Design To Maximize Visibility Of Objects, Md Zahiduzzaman Miah

Computer Science and Engineering Dissertations

In recent years, there has been significant interest in the development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in databases (e.g., buyers searching for products in a catalog). We introduce a complementary problem: how to guide a seller in selecting the best attributes of a new tuple (e.g., a new product) to highlight so that it stands out in the crowd of existing competitive products and is widely visible to the pool of potential buyers. For example, assume one wants to sell an iPod in e-commerce site, but the title allows …


Query Auditing Against Partial Disclosure, Mayur Motgi Jan 2009

Query Auditing Against Partial Disclosure, Mayur Motgi

Computer Science and Engineering Theses

Many government agencies, businesses, and nonprofit organizations need to collect, analyze, and report data about individuals in order to support their short-term and long-term planning activities. Statistical Databases therefore contain confidential information such as income, credit ratings, type of disease, or test scores of individuals. Such data are typically stored online and analyzed using sophisticated database management systems (DBMS) and software packages. On one hand, such database systems are expected to satisfy user requests of aggregate statistics related to non-confidential and confidential attributes. On the other hand, the system should be secure enough to guard against a user's ability to …


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

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

Computer Science and Engineering Theses

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 …


Enabling Context-Aware Applications In Smart Environments‏, Roman Arora Jan 2009

Enabling Context-Aware Applications In Smart Environments‏, Roman Arora

Computer Science and Engineering Theses

Recognizing human activities is an important feature for the development of contextaware applications that are so fundamental to enabling assistive environments. Only once these applications are able to determine the activities that their inhabitants are performing can they assist the individuals and their special needs. In order to do this, it is necessary to build models that can accurately capture and recognize the observed patterns. Equally important is the need to manage and distribute the information that has been inferred, and to provide Quality of Service (QoS) guarantees so that context-aware applications can react effectively to emergent situations. In this …


Peon: Privacy-Enhanced Opportunistic Networks With Applications In Assistive Environments, Gauri Vakde Jan 2009

Peon: Privacy-Enhanced Opportunistic Networks With Applications In Assistive Environments, Gauri Vakde

Computer Science and Engineering Theses

Opportunistic Networking holds a great deal of potential for making communications easier and more flexible in pervasive assistive environments. However, security and privacy must be addressed to make these communications acceptable with respect to protecting patient privacy. We propose Privacy-Enhanced Opportunistic Networking (PEON), a system for using opportunistic networking in privacy-preserving way. PEON uses concepts from anonymous communications, re-routing messages through groups of peer nodes to hide the relation between the sources and destinations. We describe a set of protocols that explore a practical range of trade-offs between privacy and communication costs by modifying how closely the protocol adheres to …


Autonomous Abstraction Of Policies Based On Policy Homomorphism, Srividhya Rajendran Jan 2009

Autonomous Abstraction Of Policies Based On Policy Homomorphism, Srividhya Rajendran

Computer Science and Engineering Dissertations

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 …


Energy Efficient Routing Structures And Wakeup Schemes For Wireless Sensor Networks, Byoung Lee Jan 2009

Energy Efficient Routing Structures And Wakeup Schemes For Wireless Sensor Networks, Byoung Lee

Computer Science and Engineering Dissertations

Wireless sensor networks, which consist of a large number of sensor nodes and a base station, are used for many applications aimed at collecting information. Each sensor node is equipped with a small amount of battery, limited memory, finite radio range and small CPU. It gathers required information and it sends the information to the base station. The large number of sensors can cover a large area by cooperating with each other to build a multi-hop wireless network. However, the small amount of battery is one of the critical concerns because sensor network life time depends on battery longevity. It …