1393061
Characteristics of streaming media stored on the Web
Despite the growth in multimedia, there have been few studies that focus on characterizing streaming audio and video stored on the Web. This investigation used a customized Web crawler to traverse 17 million Web pages from diverse geographic locations and identify nearly 30,000 streaming audio and video clips available for analysis. Using custom-built extraction tools, these streaming media objects were analyzed to determine attributes such as media type, encoding format, playout duration, bitrate, resolution, and codec. The streaming media content encountered is dominated by proprietary audio and video formats with the top four commercial products being RealPlayer, Windows Media Player, MP3 and QuickTime. The distribution of the stored playout durations of streaming audio and video clips are long-tailed. More than half of the streaming media clips encountered are video, encoded primarily for broadband connections and at resolutions considerably smaller than the resolutions of typical monitors.
12676409
Measurements of the congestion responsiveness of windows streaming media
While previous research has shown that streaming media can respond to network congestion, it is not known to what extent commercial products are responsive. This research characterizes the bitrate response of Windows Streaming Media (WSM) to changes in network capacity and loss rate. A streaming media test bed was built to systematically vary network and content encoding characteristics and measure WSM congestion responsiveness. The results demonstrate that WSM improve response to congestion when content is encoded into several bitrates by the content provider.
9337355
Weather forecasting: predicting performance for streaming video over wireless LANs
The growth of wireless LANs has brought the expectation for high-bitrate streaming video to wireless PCs. However, it remains unclear how wireless channel characteristics impact the quality of streaming video sent over wireless LANs. This paper presents results from experiments that stream commercial video over a wireless campus network. By analyzing the streaming video quality and capturing wireless LAN characteristics across network and wireless link layers, "weather forecasts" are created such that selected wireless LAN performance indicators might be used to predict the streaming video quality. Furthermore, a quantified measurement of accuracy is presented to evaluate the effectiveness of individual weather forecasts. The paper evaluates six distinct weather forecasts four different streaming configurations including TCP and UDP streaming, and single and multiple-level encoded videos. The results show that the wireless Received Signal Strength Indicator (RSSI) and average wireless link capacity are the most accurate indicators to predict the performance of streaming video over wireless LANs. The weather forecast philosophy can be beneficial for adapting video streaming in wireless LAN environments.
7887955
PatternHunter: faster and more sensitive homology search
MOTIVATION
Genomics and proteomics studies routinely depend on homology searches based on the strategy of finding short seed matches which are then extended. The exploding genomic data growth presents a dilemma for DNA homology search techniques: increasing seed size decreases sensitivity whereas decreasing seed size slows down computation.


RESULTS
We present a new homology search algorithm 'PatternHunter' that uses a novel seed model for increased sensitivity and new hit-processing techniques for significantly increased speed. At Blast levels of sensitivity, PatternHunter is able to find homologies between sequences as large as human chromosomes, in mere hours on a desktop.


AVAILABILITY
PatternHunter is available at http://www.bioinformaticssolutions.com, as a commercial package. It runs on all platforms that support Java. PatternHunter technology is being patented; commercial use requires a license from BSI, while non-commercial use will be free.
10085490
Circumferences of regular claw-free graphs
A known result obtained independently by Fan and Jung is that every 3-connected k-regular graph on n vertices contains a cycle of length at least min{3k,n}. This raises the question of how much can be said about the circumferences of 3-connected k-regular claw-free graphs. In this paper, we show that every 3-connected k-regular claw-free graph on n vertices contains a cycle of length at least min{6k-17,n}.
8200318
A Web Service for Exchanging Procedural CAD Models Between Heterogeneous CAD Systems
It is a challenging issue to exchange procedural CAD models between heterogeneous CAD systems. In this paper, we extend the synchronized collaborative design environment among heterogeneous CAD systems, which we developed previously, to a Web services based platform for exchange of procedural CAD models between heterogeneous CAD systems. First, the real-time exchange of one single operation is extended to the exchange of a complete procedural CAD model between heterogeneous CAD systems. Second, Web services technology is adopted to encapsulate the procedural CAD model exchange functions to a standard interface, which is then released on the Internet and can be easily used by remote developers in their windows applications, Web applications, and so on. Finally, a Web service for exchange of procedural CAD models between SolidWorks and Autodesk Mechanical Desktop is realized.
3009418
The hamiltonian index of a graph and its branch-bonds
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the iterated line graph $L^m(G)$ is hamiltonian is called the hamiltonian index of $G,$ denoted by $h(G).$ A reduction method to determine the hamiltonian index of a graph $G$ with $h(G)\geq 2$ is given here. With it we will establish a sharp lower bound and a sharp upper bound for $h(G)$, respectively, which improves some known results of P.A. Catlin et al. [J. Graph Theory 14 (1990)] and H.-J. Lai [Discrete Mathematics 69 (1988)]. Examples show that $h(G)$ may reach all integers between the lower bound and the upper bound.
406684
Tri-training: exploiting unlabeled data using three classifiers
In many practical data mining applications, such as Web page classification, unlabeled training examples are readily available, but labeled ones are fairly expensive to obtain. Therefore, semi-supervised learning algorithms such as co-training have attracted much attention. In this paper, a new co-training style semi-supervised learning algorithm, named tri-training, is proposed. This algorithm generates three classifiers from the original labeled example set. These classifiers are then refined using unlabeled examples in the tri-training process. In detail, in each round of tri-training, an unlabeled example is labeled for a classifier if the other two classifiers agree on the labeling, under certain conditions. Since tri-training neither requires the instance space to be described with sufficient and redundant views nor does it put any constraints on the supervised learning algorithm, its applicability is broader than that of previous co-training style algorithms. Experiments on UCI data sets and application to the Web page classification task indicate that tri-training can effectively exploit unlabeled data to enhance the learning performance.