15909597
Cluster and Grid Based Classification of Transposable Elements in Eukaryotic Genomes
In the last few years many computer and laboratory improvements in the production and analysis of DNA sequences have made possible the complete sequencing of whole genomes. This provides a wealth of raw genomes that needs to be processed and annotated. All eukaryotic genomes examined and published thus far contain repetitive DNA. The amount of repetitive DNA in any specific eukaryotic genome ranges from 5% to 80%. These repeats consist mainly of transposable elements and tandem repeats which need to be identified, classified and annotated in order to sequence and annotate an entire genome. This paper discusses the design and implementation of a distributed cluster and grid based workflow to classify transposable elements. We show experimental results for representative species genomes on a cluster and grid. The performance and results of the workflow with regard to turnaround time, scalability, load balancing, resource utilization and fault tolerance are shown and discussed
11624555
A Query Algebra for Fragmented XML Stream Data
The increased usage of mobile devices coupled with an unprecedented demand for information has pushed the scalability problem of pull-based data service to the focus. A broadcast model of streaming data over a wireless medium has been proposed as a viable alternative for information dissemination. In the streaming broadcast model, servers broadcast data in an asynchronous and unacknowledged mode while clients process personalized and complex queries locally, relieving the load on the server. We address the query processing of streamed XML data, which is fragmented into manageable chunks for easier synchronization. Although there has been some work done in defining algebras that model XQueries on XML documents, no work has been done in defining query algebras for fragmented XML stream data. We define a model for processing fragmented XML stream data, using the concept of holes and fillers. This model offers the flexibility required by the server to disseminate data in manageable fragments, whenever they become available, and to send repetitions, replacements and removal of fragments. We then present a query algebra for XQuery that operates on this streamed XML data model. The XML fragments are operated upon in a continuous pipelined fashion without the need of materializing the transmitted document at the client site.
10614369
PICO: A Middleware Framework for Pervasive Computing
The pervasive information community organization is a framework for creating mission-oriented dynamic communities of autonomous software entities that perform tasks for users and devices. PICO's telemedicine example scenario demonstrates its potential as a simple, unique, and versatile middleware framework for pervasive computing.
29185449
Performance Analysis and Scalability of the ThreadmanTM Thread Manager
6061688
Mobile Agent Connection Establishment and Management (CEMA)—Message Exchange for Pervasive Computing Environments
Pervasive computing is an emerging technology that offers new possibilities to distributed computing and computer networking; it employs a wide variety of smart, ubiquitous devices throughout an individual's working and living environment. Mobile agents are software entities that can migrate between servers (mobile agent environments) of the network accomplishing various tasks on the behalf of their owners. The objective of this paper is to describe a test and prototyping environment for experimenting with mobile agents in pervasive environments. A prototype environment for a novel, proactive infrastructure is described for mobile agent assisted pervasive computing. In addition, a new message passing algorithm is provided for mobile agent connection establishment and management (CEMA). Simulation results show the performance of the proposed approach.
6748545
Quality of Service Primitives for Operating System Support of Multimedia Applications
139273
Applications-driven parallel I/O
The authors investigate the needs of some massively parallel applications running on distributed-memory parallel computers at Argonne National Laboratory and identify some common parallel I/O operations. For these operations, routines were developed that hide the details of the actual implementation (such as the number of parallel disks) from the application, while providing good performance. An important feature is the ability for the application programmer to specify that a file be accessed either as a high-performance parallel file or as a conventional Unix file, simply by changing the value of a parameter on the file open call. These routines are examples of a parallel I/O abstraction that can enhance development, portability, and performance of I/O operations in applications. Some of the specific issues in their design and implementation in a distributed-memory toolset are discussed.
15912029
A butterfly subdivision scheme for surface interpolation with tension control
A new interpolatory subdivision scheme for surface design is presented. The new scheme is designed for a general triangulation of control points and has a tension parameter that provides design flexibility. The resulting limit surface is C1 for a specified range of the tension parameter, with a few exceptions. Application of the butterfly scheme and the role of the tension parameter are demonstrated by several examples.
38710043
Computer-Mediated Communication as Employee Voice: The Profit Sharing Plan
35397691
Accomplishing More by Doing Less - Lessons from Spanish Language Instruction
206967153
Iterative Joint Source-Channel Decoding of H.264 Compressed Video
This paper proposes an iterative joint source-channel decoding (IJSCD) scheme for the transmission of H.264 compressed video over a noisy channel. It uses channel coding along with H.264 semantic verification. The structure, selection of design parameters, and performance of the proposed IJSCD based on a rate-% recursive systematic convolutional (RSC) code over an AWGN channel are described and discussed as an illustrative example. In the example, for the same PSNR, the proposed IJSCD scheme offers a significant saving of 2.1dB in required channel SNR as compared to a system using the same RSC code alone. Furthermore, the performance can be improved by iterative decoding at the cost of increased delay. Hence, a tradeoff can be made between performance improvement and delay