This paper proposes implementations of the well-known traffic policing mechanisms for high speed networks. The implementations are based on a high performance development environment and are described through commented block diagrams. The considered mechanisms are Leaky Bucket with variants, Jumping Window, Triggered Jumping Window, Continuous Sliding Window, Discretized Sliding Window and Time...

In this study, the author compares the supply-demand mismatch of retail banking services and the changing patterns in Illinois and New York from 1982 to 2007 amid fundamental banking transformation and geographical deregulation. The study uses measures of concentration like the Herfindahl-Herschman Index (HHI) and the E-Index. The study finds that the traditionally unit banking Illinois has nar...

While traditional data-management systems focus on evaluating single, adhoc queries over static data sets in a centralized setting, several emerging applications require (possibly, continuous) answers to queries on dynamic data that is widely distributed and constantly updated. Furthermore, such query answers often need to discount data that is “stale”, and operate solely on a sliding window of...

We study algorithms for the sliding-window model, an important variant of data-stream in which goal is to compute some function a fixed-length suffix stream. extend smooth-histogram framework Braverman and Ostrovsky (FOCS 2007) almost-smooth functions, includes all subadditive functions. Specifically, we show that if can be \(\left( 1+{{\varepsilon }}\right) \)-approximated insertion-only strea...

We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data streams, where the observed order of data may be different from the order in which the data was generated. The set of recent elements is modeled as a sliding timestamp window of the stream, whose elements are changing co...

While vehicle license plate recognition (VLPR) is usually done with a sliding window approach, it can have limited performance on datasets with characters that are of variable width. This can be solved by hand-crafting algorithms to prescale the characters. While this approach can work fairly well, the recognizer is only aware of the pixels within each detector window, and fails to account for ...

Studies on adoption of new technologies have focused mainly on the behaviour of adoption and on efficiency gains from advancement in the state of technology. The contention of this study is that it is more appropriate to regard the adoption of technology in the banking industry in dual aspects by banks and by customers, given the intermediary role of banks. Despite growing interest in e-Commerc...

• Standard stream model: m elements from universe of size n, come one by one. Goal: compute a function of stream. Constraints: (1) Limited space (working memory), sublinear in n and m. (2) Access data sequentially. (3) Process each element quickly. • Graph stream: elements of the stream are edges. Let n be the number of vertices. We have m = O(n 2). To be able to handle interesting functions, w...

MAX and MIN are two important aggregates offered by the original SQL specification. In the paper, we propose a novel mechanism, i.e. the exemplary sketch, to evaluate MAX and MIN over sliding windows with various size in the data stream environment. Performance analysis shows that evaluating MAX or MIN over w sliding windows with various size using the exemplary sketch takes O(ln n) expected am...