10542337
A realtime software solution for resynchronizing filtered MPEG2 Transport stream
With the increasing demand and popularity of multimedia streaming applications over the current Internet, manipulating MPEG streams in a real-time software manner is gaining more and more importance. In this work, we studied the synchronization problem that arises when a gateway changes the data content carried in an MPEG2 Transport stream. In short, the distance between original time stamps will be changed non-uniformly when the video frames are resized, and decoders will fail to reconstruct the encoding clock from the resulting stream. We propose a cheap software real-time approach to solve this problem, which basically reuses the original time stamp packets and adapts their distance to accommodate the changes in bit rate. Experimental results from a real-time HDTV stream filter shows that our approach is correct and efficient.
11512625
Hourglass multimedia content and service composition framework for smart room environments
Pervasive environments with their ubiquitous multimedia devices such as video-enabled cell-phones, laptops, PC tablets, digital cameras, HDTV plasma displays are becoming integral part of our workplaces and homes. Furthermore, these digital multimedia devices make it easier and easier to create and view volumes of content that can be stored throughout the Internet. The big challenge is to organize the distributed content, get the distributed multimedia content composed, produced and distributed to users in customized fashion according to users' preference, and their resource availabilities in pervasive environments. Basically, the challenge is to create Internet Interactive Television where the user/interest group, residing in a pervasive environment, corresponds to the TV program director who decides and/or influences what content(s) will be viewed, how it will be composed, presented and delivered. In this paper, we present a vision how this challenge can be solved. We propose a novel hourglass-based system that delivers composite multimedia content to users in pervasive environments, which considers both users' interest in the content and the presentation capabilities of various display devices. This hourglass-based system relies on our content and service composition framework that allows for customized production, distribution and presentation of multimedia content for pervasive environments. We present the hourglass design, possible solutions for some content composition scenarios and validate the solutions via selected experiments.
19027501
A Study of Collaborative Dancing in Tele-immersive Environments
We first present the tele-immersive environments developed jointly by University of Illinois at Urbana-Champaign and University of California at Berkeley. The environment features 3D full and real body capturing, wide field of view, multi-display 3D rendering, and attachment free participant. We then describe a study of collaborative dancing between remotely located dancers in the shared virtual space. Two professional dancers are invited to the tele-immersive site of each university. As a preliminary experiment, we let the dancers perform elementary body movements and coordinate their dancing. The coordination requires one dancer to take the lead while the other follows her by appropriate movements. During the experiment, the dancers are dancing at various motion rates to evaluate how well the collaborative dancing is supported with the current technical boundary. Our important findings indicate that 1) tele-immersive environments have strong potential impact on the concept of choreography and communication of live dance performance, 2) the presence of multi-display system, real body 3D rendering, audio channel, and less intrusive-ness greatly enhances the immersive and dancing experience, and 3) the level of synchronization achieved by the dancers is higher than that expected from the video rate
677559
TEEVE: the next generation architecture for tele-immersive environments
Tele-immersive 3D multi-camera room environments are starting to emerge and with them new challenging research questions. One important question is how to organize the large amount of visual data, being captured, processed, transmitted and displayed, and their corresponding resources, over current COTS computing and networking infrastructures so that "everybody" would be able to install and use tele-immersive environments for conferencing and other activities. In this paper, we propose a novel cross-layer control and streaming framework over general purpose delivery infrastructure, called TEEVE (tele-immersive environments for everybody). TEEVE aims for effective and adaptive coordination, synchronization, and soft QoS-enabled delivery of tele-immersive visual streams to remote room(s). The TEEVE experiments between two tele-immersive rooms residing in different institutions more than 2000 miles apart show that we can sustain communication of up to 12 3D video streams with 4/spl sim/5 3D frames per second for each stream, yielding 4/spl sim/5 tele-immersive video rate.
11758
A multi-stream adaptation framework for bandwidth management in 3D tele-immersion
Tele-immersive environments will improve the state of collaboration among distributed participants. However, along with the promise a new set of challenges have emerged including the real-time acquisition, streaming and rendering of 3D scenes to convey a realistic sense of immersive spaces. Unlike 2D video conferencing, a 3D tele-immersive environment employs multiple 3D cameras to cover a much wider field of view, thus generating a very large volume of data that need to be carefully coordinated, organized, and synchronized for Internet transmission, rendering and display. This is a challenging task and a dynamic bandwidth management must be in place. To achieve this goal, we propose a multi-stream adaptation framework for bandwidth management in 3D tele-immersion. The adaptation framework relies on the hierarchy of mechanisms and services that exploits the semantic link of multiple 3D video streams in the tele-immersive environment. We implement a prototype of the framework that integrates semantic stream selection, content adaptation, and 3D data compression services with user preference. The experimental results have demonstrated that the framework shows a good quality of the resulting composite 3D rendered video in case of sufficient bandwidth, while it adapts individual 3D video streams in a coordinated and user-friendly fashion, and yields graceful quality degradation in case of low bandwidth availability.
10885412
Managing the pedigree and quality of information in dynamic information sharing environments
The quality of information is crucial for decision making in many mission-critical applications such as battlefield operations and intelligence analysis. However, as the system becomes larger and more diverse, it is becoming increasingly difficult to assess the quality of information from various operators or data sources. In this paper we propose an agent-based approach to managing the quality of information, e.g., its trustworthiness, in network centric information sharing environments, where software agents collaborate with each other to automatically represent and assess the trustworthiness of information from its pedigree within the framework of Dempster-Shafer theory.
10926456
An agent-based approach to knowledge management
Traditional approaches to knowledge management are essentially limited to document management. However, much knowledge in organizations or communities resides in an informal social network and may be accessed only by asking the right people. This paper describes MARS, a multiagent referral system for knowledge management. MARS assigns a software agent to each user. The agents facilitate their users' interactions and help manage their personal social networks. Moreover, the agents cooperate with one another by giving and taking referrals to help their users find the right parties to contact for a specific knowledge need.
11765401
Looking at Markov samplers through cusum path plots: a simple diagnostic idea
In this paper, we propose to monitor a Markov chain sampler using the cusum path plot of a chosen one-dimensional summary statistic. We argue that the cusum path plot can bring out, more effectively than the sequential plot, those aspects of a Markov sampler which tell the user how quickly or slowly the sampler is moving around in its sample space, in the direction of the summary statistic. The proposal is then illustrated in four examples which represent situations where the cusum path plot works well and not well. Moreover, a rigorous analysis is given for one of the examples. We conclude that the cusum path plot is an effective tool for convergence diagnostics of a Markov sampler and for comparing different Markov samplers.
41743230
Automatically wrapping legacy software into services: A grid case study
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing for solving large-scale data and computationally intensive problems. Peer-to-peer (P2P) systems have emerged as an infrastructure enabling technologies for enhanced scalability and reliability in file sharing and content distribution. It is envisioned that P2P enabled service-oriented grid systems would virtualize various resources as services with high scalability and reliability. Many legacy software resources exist nowadays, but making them grid aware services for effective resource sharing has become an issue of vital importance. This paper presents GSLab, a toolkit for automatically wrapping legacy software into services that can be published, discovered and reused in grid environments. GSLab employs Sun Grid Engine (SGE) to enhance its performance in execution of wrapped services. Using GSLab, we have automatically wrapped a legacy computer animation rendering code written in C as a service that can be discovered and accessed in a SGE environment. The evaluation results show that the performance of GSLab improves with an increase in the number of computing nodes involved.
5165355
Computational prediction of novel non-coding RNAs in Arabidopsis thaliana
BackgroundNon-coding RNA (ncRNA) genes do not encode proteins but produce functional RNA molecules that play crucial roles in many key biological processes. Recent genome-wide transcriptional profiling studies using tiling arrays in organisms such as human and Arabidopsis have revealed a great number of transcripts, a large portion of which have little or no capability to encode proteins. This unexpected finding suggests that the currently known repertoire of ncRNAs may only represent a small fraction of ncRNAs of the organisms. Thus, efficient and effective prediction of ncRNAs has become an important task in bioinformatics in recent years. Among the available computational methods, the comparative genomic approach seems to be the most powerful to detect ncRNAs. The recent completion of the sequencing of several major plant genomes has made the approach possible for plants.ResultsWe have developed a pipeline to predict novel ncRNAs in the Arabidopsis (Arabidopsis thaliana) genome. It starts by comparing the expressed intergenic regions of Arabidopsis as provided in two whole-genome high-density oligo-probe arrays from the literature with the intergenic nucleotide sequences of all completely sequenced plant genomes including rice (Oryza sativa), poplar (Populus trichocarpa), grape (Vitis vinifera), and papaya (Carica papaya). By using multiple sequence alignment, a popular ncRNA prediction program (RNAz), wet-bench experimental validation, protein-coding potential analysis, and stringent screening against various ncRNA databases, the pipeline resulted in 16 families of novel ncRNAs (with a total of 21 ncRNAs).ConclusionIn this paper, we undertake a genome-wide search for novel ncRNAs in the genome of Arabidopsis by a comparative genomics approach. The identified novel ncRNAs are evolutionarily conserved between Arabidopsis and other recently sequenced plants, and may conduct interesting novel biological functions.