In the paper, we propose a reliable asynchronous image transfer protocol, RAIT. RAIT applies a double sliding window method to node-to-node transfer, with one sliding window for the receiving queue, which is used to prevent packet loss caused by communication failure between nodes, and another sliding window for the sending queue, which prevents packet loss caused by network congestion. The rou...

Mining frequent closed itemsets in data streams is an important task in stream data mining. In this paper, an efficient mining algorithm (denoted as EMAFCI) for frequent closed itemsets in data stream is proposed. The algorithm is based on the sliding window model, and uses a Bit Vector Table (denoted as BVTable) where the transactions and itemsets are recorded by the column and row vectors res...

The US banking industry has gone through a decade of mergers and consolidations where the universal view appears to be that achieving larger scale is the only means for survival among the megabanks of the nation and the world. However, one of the smallest banks in the nation, Security First Network Bank, has shaken up traditional bankers by introducing branchless banking via the internet. The i...

Identifying the top-k most frequent elements is one of the many problems associated with data streams analysis. It is a well-known and difficult problem, especially if the analysis is to be performed and maintained up to date in near real time. Analyzing data streams in time sliding window model is of particular interest as only the most recent, more relevant events are considered. Approximate ...

Sliding-window aggregation is a widely-used approach for extracting insights from the most recent portion of a data stream. Most aggregation operations of interest can be cast as binary operators that are associative, but not necessarily commutative nor invertible. However, non-invertible operators are nontrivial to support efficiently. The best existing algorithms for this setting require Oplo...

Traffic smoothing for delivery of online VBR media streams is one of the most important problems in designing multimedia systems. Given available client buffer and a window-sliding size, conventional approaches try to reduce bandwidth allocated in each window. However, they can not lead to the minimization of bandwidth allocated for transmitting entire stream. Although a window-sliding approach...

In this paper, a novel rate control scheme with sliding window basic unit is proposed to achieve consistent or smooth visual quality for H.264/AVC based video streaming. A sliding window consists of a group of successive frames and moves forward by one frame each time. To make the sliding window scheme possible for real-time video streaming, the initial encoder delay inherently in a video strea...

Although traditional databases and data warehouses have been exploited widely to manage persistent data, a large number of applications from sensor network need functional supports for transient data in the continuous data stream. One of the crucial functions is to summarize the data items within a sliding window. A sliding window contains a fixed width span of data elements. The data items are...

We consider a sliding window W over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We present an indexed version of the sliding window based on a suffix tree. The data structure of size Θ(|W |) has optimal time queries Θ(m + occ) and amortized consta...

The objective of this study is to examine the portfolio theory that suggests that diversification can potentially reduce the return variance and the probability of failure of a portfolio. The current study is to investigate the diversification measure by means of Hershman-Herfindahl index, and applies the " diversification index " proposed by Demsetz & Strahan (1997) by scaling systematic risk ...