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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

Electrical Engineering and Computer Science - All Scholarship

2005

Articles 1 - 18 of 18

Full-Text Articles in Physical Sciences and Mathematics

Deriving Private Information From Randomized Data, Zhengli Huang, Wenliang Du, Biao Chen Jan 2005

Deriving Private Information From Randomized Data, Zhengli Huang, Wenliang Du, Biao Chen

Electrical Engineering and Computer Science - All Scholarship

Randomization has emerged as a useful technique for data disguising in privacy-preserving data mining. Its privacy properties have been studied in a number of papers. Kargupta et al. challenged the randomization schemes, and they pointed out that randomization might not be able to preserve privacy. However, it is still unclear what factors cause such a security breach, how they affect the privacy preserving property of the randomization, and what kinds of data have higher risk of disclosing their private contents even though they are randomized. We believe that the key factor is the correlations among attributes. We propose two data …

Go to article

An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning Jan 2005

An Efficient Scheme For Authenticating Public Keys In Sensor Networks, Wenliang Du, Ronghua Wang, Peng Ning

Electrical Engineering and Computer Science - All Scholarship

With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of some public key algorithms, such as Elliptic Curve Cryptography (ECC), is already close to being practical on sensor nodes. However, the energy consumption of PKC is still expensive, especially compared to symmetric-key algorithms. To maximize the lifetime of batteries, we should minimize the use of PKC whenever possible in sensor networks. This paper investigates how to replace one of the important PKC operations–the public key authentication–with symmetric key operations that are …

Go to article

Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning Jan 2005

Lad: Localization Anomaly Detection For Wireless Sensor Networks, Wenliang Du, Lei Fang, Peng Ning

Electrical Engineering and Computer Science - All Scholarship

In wireless sensor networks (WSNs), sensors ’ locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In the past, a number of location discovery (localization) schemes have been proposed. Most of these schemes share a common feature: they use some special nodes, called beacon nodes, which are assumed to know their own locations (e.g., through GPS receivers or manual configuration). Other sensors discover their locations based on the reference information provided by these beacon nodes. Most of the beacon-based localization schemes assume a benign environment, where all beacon nodes are supposed …

Go to article

Polymorphic Self-* Agents For Stigmergic Fault Mitigation In Large-Scale Real-Time Embedded Systems, Derek Messie, Jae C. Oh Jan 2005

Polymorphic Self-* Agents For Stigmergic Fault Mitigation In Large-Scale Real-Time Embedded Systems, Derek Messie, Jae C. Oh

Electrical Engineering and Computer Science - All Scholarship

Organization and coordination of agents within large-scale, complex, distributed environments is one of the primary challenges in the field of multi-agent systems. A lot of interest has surfaced recently around self-* (self-organizing, self-managing, self-optimizing, self-protecting) agents. This paper presents polymorphic self-* agents that evolve a core set of roles and behavior based on environmental cues. The agents adapt these roles based on the changing demands of the environment, and are directly implementable in computer systems applications. The design combines strategies from game theory, stigmergy, and other biologically inspired models to address fault mitigation in large-scale, real-time, distributed systems. The agents …

Go to article

Global Multimedia Collaboration System, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Shrideep Pallickard Jan 2005

Global Multimedia Collaboration System, Geoffrey C. Fox, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Shrideep Pallickard

Electrical Engineering and Computer Science - All Scholarship

In order to build an integrated collaboration system over heterogeneous collaboration technologies, we propose a Global Multimedia Collaboration System (Global-MMCS) based on XGSP A/V Web-Services framework. This system can integrate multiple A/V services, and support various collaboration clients and communities. Now the prototype is being developed and deployed across many universities in USA and China.

Go to article

Support For High Performance Real-Time Collaboration Within The Naradabrokering Substrate, Shrideep Pallickara, Hasan Bulut, Pete Burnap, Geoffrey C. Fox, Ahmet Uyar, David Walker Jan 2005

Support For High Performance Real-Time Collaboration Within The Naradabrokering Substrate, Shrideep Pallickara, Hasan Bulut, Pete Burnap, Geoffrey C. Fox, Ahmet Uyar, David Walker

Electrical Engineering and Computer Science - All Scholarship

The requirements for collaborative services, especially pertaining to order and delivery, are quite different compared to traditional distributed applications. The NaradaBrokering messaging substrate enables scalable, fault-tolerant, distributed interactions between entities, and is based on the publish/subscribe paradigm. The substrate also incorporates support for Grid and Web Service. More recently, we have incorporated services within the substrate which enable us to facilitate richer collaborative interactions. In this paper, we outline our rationale for incorporating these services and how these services interact with each other. We have conducted experiments related to profiling these services, and also on the performance and scaling of …

Go to article

Grid Service Architecture For Videoconferencing, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Sangyoon Oh, Geoffrey C. Fox Jan 2005

Grid Service Architecture For Videoconferencing, Wenjun Wu, Ahmet Uyar, Hasan Bulut, Sangyoon Oh, Geoffrey C. Fox

Electrical Engineering and Computer Science - All Scholarship

In this paper we present a scalable, integrated and service-oriented collaboration system, namely Global Multimedia Collaboration System, based on the XGSP collaboration framework and NaradaBrokering messaging middleware. This system can provide videoconferencing services to heterogeneous endpoints such as H.323, SIP, Access Grid, RealPlayer as well as cellular phone. This paper discusses the design principle, system architecture and implementation in detail. The extensive performance measurement has been made to evaluate the scalability of the system.

Go to article

Privacy-Preserving Top-N Recommendation On Horizontally Partitioned Data, Huseyin Polat, Wenliang Du Jan 2005

Privacy-Preserving Top-N Recommendation On Horizontally Partitioned Data, Huseyin Polat, Wenliang Du

Electrical Engineering and Computer Science - All Scholarship

Collaborative filtering techniques are widely used by many E-commerce sites for recommendation purposes. Such techniques help customers by suggesting products to purchase using other users’ preferences. Today’s top-recommendation schemes are based on market basket data, which shows whether a customer bought an item or not. Data collected for recommendation purposes might be split between different parties. To provide better referrals and increase mutual advantages, such parties might want to share data. Due to privacy concerns, however, they do not want to disclose data. This paper presents a scheme for binary ratings-based top-N recommendation on horizontally partitioned data, in which two …

Go to article

A State-Free Data Delivery Protocol For Multihop Wireless Sensor Networks, Dazhi Chen, Jing Deng, Pramod K. Varshney Jan 2005

A State-Free Data Delivery Protocol For Multihop Wireless Sensor Networks, Dazhi Chen, Jing Deng, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

A novel, state-free, and competition-based data delivery protocol, called State-free Implicit Forwarding (SIF), is proposed for multihop wireless sensor networks. The SIF protocol assumes moderate node density and distance-to-sink awareness. The state-free feature of SIF makes it robust to high network dynamics. SIF also combines the tasks of routing and MAC, via cross-layer design, to simplify the complexity of the protocol stack in sensors and to save precious network resources. Simulation results are presented to show that SIF performs better than some previously proposed protocols for data delivery in terms of communication overhead, packet delivery ratio, and average packet delay.

Go to article

Decision Fusion Rules In Multi-Hop Wireless Sensor Networks, Ying Lin, Biao Chen, Pramod K. Varshney Jan 2005

Decision Fusion Rules In Multi-Hop Wireless Sensor Networks, Ying Lin, Biao Chen, Pramod K. Varshney

Electrical Engineering and Computer Science - All Scholarship

We consider in this paper the decision fusion problem for a wireless sensor network (WSN) operating in a fading environment. In particular, we develop channel-aware decision fusion rules for a resource constrained WSN where decisions from local sensors may go through multi-hop transmission to reach a fusion center. Each relay node employs a binary relay scheme whereby the relay output is inferred from the channel impaired observation received from its source node. This estimated binary decision is subsequently transmitted to the next node until it reaches the fusion center. Under a flat fading channel model, we derive the optimum fusion …

Go to article

Gridbased Collaboration In Interactive Data Language Applications, Minjun Wang, Geoffrey C. Fox, Marlon Pierce Jan 2005

Gridbased Collaboration In Interactive Data Language Applications, Minjun Wang, Geoffrey C. Fox, Marlon Pierce

Electrical Engineering and Computer Science - All Scholarship

Interactive Data Language (IDL) is an array-oriented data analysis and visualization application, which is widely used in research, commerce, and education. It is meaningful to make user IDL applications collaborative between computers over networks, using a common message broker as the underlying communication system. In order to achieve the global collaboration, we have brought together in the research a Grid-based Collaboration paradigm, a Shared Event model, different implementing structures, methodologies and technologies. We have succeeded in our prototype codes, and we are currently working on a real life IDL application package to make it collaborative. At the same time, we …

Go to article

Reliability-Centric High-Level Synthesis, S. Tosun, N. Mansouri, E. Arvas, Mahmut Kandemir, Yuan Xie Jan 2005

Reliability-Centric High-Level Synthesis, S. Tosun, N. Mansouri, E. Arvas, Mahmut Kandemir, Yuan Xie

Electrical Engineering and Computer Science - All Scholarship

Importance of addressing soft errors in both safety critical applications and commercial consumer products is increasing, mainly due to ever shrinking geometries, higher-density circuits, and employment of power-saving techniques such as voltage scaling and component shut-down. As a result, it is becoming necessary to treat reliability as a first-class citizen in system design. In particular, reliability decisions taken early in system design can have significant benefits in terms of design quality. Motivated by this observation, this paper presents a reliability-centric high-level synthesis approach that addresses the soft error problem. The proposed approach tries to maximize reliability of the design while …

Go to article

Prototype Of Fault Adaptive Embedded Software For Large-Scale Real-Time Systems, Derek Messie, Mina Jung, Jae C. Oh, Shweta Shetty, Steven Nordstrom, Michael Haney Jan 2005

Prototype Of Fault Adaptive Embedded Software For Large-Scale Real-Time Systems, Derek Messie, Mina Jung, Jae C. Oh, Shweta Shetty, Steven Nordstrom, Michael Haney

Electrical Engineering and Computer Science - All Scholarship

This paper describes a comprehensive prototype of large-scale fault adaptive embedded software developed for the proposed Fermilab BTeV high energy physics experiment. Lightweight self-optimizing agents embedded within Level 1 of the prototype are responsible for proactive and reactive monitoring and mitigation based on specified layers of competence. The agents are self-protecting, detecting cascading failures using a distributed approach. Adaptive, reconfigurable, and mobile objects for reliability are designed to be self-configuring to adapt automatically to dynamically changing environments. These objects provide a self-healing layer with the ability to discover, diagnose, and react to discontinuities in real-time processing. A generic modeling environment …

Go to article

Multi-Objective Mobile Agent Routing In Wireless Sensor Networks, Ramesh Rajagopalan, Chilukuri K. Mohan, Pramod Varshney, Kishan Mehrotra Jan 2005

Multi-Objective Mobile Agent Routing In Wireless Sensor Networks, Ramesh Rajagopalan, Chilukuri K. Mohan, Pramod Varshney, Kishan Mehrotra

Electrical Engineering and Computer Science - All Scholarship

A recent approach for data fusion in wireless sensor networks involves the use of mobile agents that selectively visit the sensors and incrementally fuse the data, thereby eliminating the unnecessary transmission of irrelevant or non-critical data. The order of sensors visited along the route determines the quality of the fused data and the communication cost. We model the mobile agent routing problem as a multi-objective optimization problem, maximizing the total detected signal energy while minimizing the energy consumption and path loss. Simulation results show that this problem can be solved successfully using evolutionary multi-objective algorithms such as EMOCA and NSGA-II. …

Go to article

Adapting H.323 Terminals In A Service-Oriented Collaboration System, Wenjun Wu, Hasan Bulut, Ahmet Uyar, Geoffrey C. Fox Jan 2005

Adapting H.323 Terminals In A Service-Oriented Collaboration System, Wenjun Wu, Hasan Bulut, Ahmet Uyar, Geoffrey C. Fox

Electrical Engineering and Computer Science - All Scholarship

Global Multimedia Collaboration System (Global-MMCS), a scalable, robust and service-oriented collaboration system, can bridge H.323, SIP, Access Grid clients and 2.5G/3G cellular phones in audiovisual collaborations. The H.323 gateway in Global-MMCS enables H.323 terminals to interact with other clients, and provides them the complete H.323 conference control services.

Go to article

Instantiations Of Shared Event Model In Grid-Based Collaboration, Minjun Wang, Geoffrey C. Fox, Marlon Pierce Jan 2005

Instantiations Of Shared Event Model In Grid-Based Collaboration, Minjun Wang, Geoffrey C. Fox, Marlon Pierce

Electrical Engineering and Computer Science - All Scholarship

The Internet is a global infrastructure that brings resources and people together. Diverse fields are prospering on it, such as Grid computing and collaboration. We demonstrate the Grid-based Collaboration idea by making three interface applications collaborative between computers over networks, using a common message broker as the underlying communication system. To achieve the global collaboration, we have brought together in the research a Grid-based Collaboration paradigm, a Shared Event model, different implementing structures, methodologies and technologies. We describe the applications’ event structures in messages coordinating the Grid-base collaboration. We further abstract the collaboration of the applications to be collaboration between …

Go to article

Searching For High-Value Rare Events With Uncheatable Grid Computing, Wenliang Du, Michael T. Goodrich Jan 2005

Searching For High-Value Rare Events With Uncheatable Grid Computing, Wenliang Du, Michael T. Goodrich

Electrical Engineering and Computer Science - All Scholarship

High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (which comprise the computation grid) in such a way that clients are rewarded for performing tasks assigned to them. Although natural, rare-event searching presents significant challenges for a computation supervisor, who partitions and distributes the search space out to clients while contending with “lazy” clients, who don’t do all their tasks, and “hoarding ” clients, who don’t report rare events back to the supervisor. We provide schemes, based on a technique we call chaff injection, for efficiently …

Go to article

Searching For High-Value Rare Events With Uncheatable Grid Computing, Wenliang Du, Michael T. Goodrich Jan 2005

Searching For High-Value Rare Events With Uncheatable Grid Computing, Wenliang Du, Michael T. Goodrich

Electrical Engineering and Computer Science - All Scholarship

High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (which comprise the computation grid) in such a way that clients are rewarded for performing tasks assigned to them. Although natural, rare-event searching presents significant challenges for a computation supervisor, who partitions and distributes the search space out to clients while contending with “lazy” clients, who don’t do all their tasks, and “hoarding ” clients, who don’t report rare events back to the supervisor. We provide schemes, based on a technique we call chaff injection, for efficiently …

Go to article