7849532
A Peer-to-Peer Resource Sharing System with Data Grid Technology for Mobile Devices
Increases in mobile device processing power, storage capacity, and connectivity in recent years have led to a rapid rise in mobile device use. But mobile users face challenges in making connections with other users in order to share resources. To address this issue, we propose an architecture that uses peer-to-peer protocol to establish a resource sharing platform for mobile devices, combined with a data grid to help analyze and classify resources.
5072535
A Workflow-based Computational Resource Broker with Information Monitoring in Grids
As grid computing becomes a reality, a resource broker is needed to manage and monitor available resources. This work presents a workflow-based computational resource broker whose main function is to match available resources with user requests and consider network information status during matchmaking. The resource broker provides a uniform interface for accessing available and the appropriate resources via user credentials. We utilize the NWS tool to monitor the network-related information and resources status. Also, we constructed a grid platform using Globus Toolkit that integrates the distributed resources of five universities in Taichung, Taiwan, where the resource broker is developed. As a result, the proposed broker provides secure and updated information about available resources and serves as a link to the diverse systems available in the grid
1129410
On Construction and Performance Evaluation of Cluster of Linux PC Clusters Environments
Multi-cluster with NAT (network address translation) is a kind of building cluster of clusters (CoCs) in parallel processing, we can easily combine two or more PC clusters which had setting on difference place to form a big one parallel system to reach the acceptable performance and resolving the issue of insufficient public IP address. In this paper, it includes three parts: First we construct a CoCs with four PC clusters which connected with NAT on difference place in LAN environment. Second, we build a monitor system in our system in order to control and observe this system in a convenient way; this monitor system also has a client with mobile availability for users without computers. Third, we evaluate the system performance with different MPI parallel programs for the analysis of different parallel models
7749374
A Performance-Based Approach to Dynamic Workload Distribution for Master-Slave Applications on Grid Environments
Effective workload distribution techniques can significantly reduce the total completion time of a program on grid computing environments. In this paper, we propose a dynamic performance-based workload partition approach for master-slave types of applications on grids. Furthermore, we implement two types of applications and conduct the experimentations on our grid testbed. Experimental results showed that our method could execute more efficiently than traditional schemes.
45556411
On Implementation of a Scalable Wallet-Size Cluster Computing System for Multimedia Applications
In order to obtain a low-cost, low-power consumption and small sized digital home processing center, especially for multimedia applications, we propose a scalable wallet-size cluster computing system in this paper. Such system uses low-cost, low-power consumption and small sized microprocessors as computing nodes to form a cluster system. 
 
The main reason why we are interested to investigate and build such system is to increase the computing power and to accelerate the H.264 video processing. We analyzed the H.264 decoder scheme and distributed the most heavy-load computations in the decoder scheme to each computing node (or microprocessor) of the cluster system for the processing of signals, in parallel. To run multimedia applications in this cluster system, an efficient real-time video processing is implemented.
40839198
A Recursive-Adjustment Co-allocation Scheme in Data Grid Environments
The co-allocation architecture was developed in order to enable parallel downloads of datasets from multiple servers. Several co-allocation strategies have been coupled and used to exploit rate differences among various client-server links and to address dynamic rate fluctuations by dividing files into multiple blocks of equal sizes. However, a major obstacle, the idle time of faster servers having to wait for the slowest server to deliver the final block, makes it important to reduce differences in finish time among replica servers. In this paper, we propose a dynamic co-allocation scheme, namely Recursive-Adjustment Co-Allocation scheme, to improve the performance of data transfer in Data Grids. Our approach reduces the idle time spent waiting for the slowest server and decreases data transfer completion time.
14199867
Peer-to-peer architecture for content-based music retrieval on acoustic data
In traditional peer-to-peer search networks, operations focus on properly labeled files such as music or video, and the actual search is often limited to text tags. The explosive growth of available multimedia documents in recent years calls for more flexible search capabilities, namely search by content. Most content-based search algorithms are computationally intensive, making them inappropriate for a peer-to-peer environment. In this paper, we discuss a content-based music retrieval algorithm that can be decomposed and parallelized efficiently. We present a peer-to-peer architecture for such a system that makes use of spare resources among subscribers, with protocols that dynamically redistribute load in order to maximize throughput and minimize inconvenience to subscribers. Our framework can be extended beyond the music retrieval domain and adapted to other scenarios where resource pooling is desired, as long as the underlying algorithm satisfies certain conditions.
8861403
Design and implementation of the just-in-time retrieving policy for schedule-based distributed multimedia presentations
In order to provide the smooth playback of a distributed multimedia presentation, the object-retrieving engine for the player must fetch each object before its playback time. In this paper, a smart object-retrieving engine is proposed, which adopts a retrieving policy named the just-in-time policy. The policy expects the retrieval process of an object to finish right before the playback time of the object to achieve a better buffer utilization and network bandwidth efficiency. The proposed object-retrieving engine focuses on SMIL1.0-based multimedia presentations. By converting the synchronization relationship of objects in the SMIL 1.0 document to Real-Time Synchronization Model, which simplifies the handling of the synchronization relationship, and considering the end-to-end bandwidth as well as the user interactions, the object-retrieving engine determines the object request time for each object. The engine issues the request to fetch each object for the ongoing presentation at the object request time, and provides the player with proper media objects. The feasibility and better performance of the proposed just-in-time retrieving policy had been proved by performance measurements of system implementation.
17968973
Authoring Cases from Free-Text Maintenance Data
Automatically authoring or acquiring cases in the case-based reasoning (CBR) systems is recognized as a bottleneck issue that can determine whether a CBR system will be successful or not. In order to reduce human effort required for authoring the cases, we propose a framework for authoring the case from the unstructured, free-text, historic maintenance data by applying natural language processing technology. This paper provides an overview of the proposed framework, and outlines its implementation, an automated case creation system for the Integrated Diagnostic System. Some experimental results for testing the framework are also presented.
3116757
Intellectual Property Protection for Electronic Commerce Applications
Online content distribution businesses require methods to protect the intellectual property of distributed content. Intellectual property protection is a mechanism to protect the rights of ownership of original work so that no one can use the rights-protected work in any way without seeking permission for the use and, if necessary, paying the rights owners a royalty for the use. Digital watermarking is the core technology in electronic rights protection. However, research addressing the concerns of businesses about intellectual property protection schemes through watermarking is scarce. In this paper, we address these concerns by first introducing watermark design patterns (WDPs) for electronic commerce applications, then presenting problems of copyright protection using watermarking, and finally presenting management concerns. A WDP is defined as the requirements of a digital watermark for a particular type of distributed media content under the protection of its intellectual property. This paper introduces four WDPs for four types of media data - video, image, audio, and text and they are denoted as WDPvideo, WDPimage, WDPaudio and WDPtext respectively. The four WDPs are derived from the characteristics of watermarking techniques and the properties of a distributor’s web site. In our study, the proposed WDPs are used to relate the digital watermarking techniques to electronic commerce applications, and their relationships are presented graphically. The relationship diagram can facilitate electronic commerce application developers to select appropriate digital watermarking techniques and off-the-shelf systems for intellectual property protection on their web sites.
11357878
Pseudorandom bit generators in stream-cipher cryptography
Progress in the design and analysis of pseudorandom bit generators over the last decade is surveyed. Background information is provided, and the linear feedback shift registers that serve as building blocks for constructing the generators are examined. Three methods for attacking keystream generators are reviewed, and three techniques for designing them are considered, focusing on how they fail or how their weakness is exposed under the attacks previously described. These techniques are nonlinear feedforward transformation, step control, and multiclocking.<<ETX>>