Initial ranging is the primary and important process in wireless networks for the customer premise equipments (CPEs) to access the network and establish their connections with the base station. Contention may occur during the initial ranging process. To avoid contention, the mandatory solution defined in the standards is based on a truncated binary exponential random backoff (TBERB) algorithm w...

This paper presents a mechanism that improves the energy efficiency of PSM (Power Saving Mechanism) specified for DCF (Distributed Coordination Function) in IEEE 802.11. In PSM, time is divided into beacon intervals. At the start of each beacon interval, every node stays awake for a duration, called the ATIM Window. During the ATIM window, nodes exchange control packets to determine whether the...

Success of a tracking method depends largely on choosing the suitable window size as soon as the target size changes in image sequences. To achieve this goal, we propose a fast tracking algorithm based on adaptively adjusting tracking window. Firstly, tracking window is divided into four edge subwindows, and a background subwindow around it. Then, by calculating the spatiotemporal gradient powe...

An arrays of O's and l's has the u v horizontal window property if every nonzero view is seen once when a u v window is moved horizontally across the array. We study the problem of constructing an array which, for a given m, has the u x v horizontal window property for all factorizations rn uv. Using maximal linear shift register sequences for the rows we are able to construct such arrays of si...

Let T = τ + 1/C, where τ is the fixed propagation delay. Divide the time into intervals of T , starting from time t = 0. We number the intervals, starting from interval 0. Let the interval n be [nT, (n + 1)T ), for n = 0, 1, 2, .... Let us further divide each interval into identical time slots, each of which is equal to the transmission time of a fixed-size packet, 1/C. We assume CT is an integ...

This paper proposes a new focus measure operator for Shape From Focus to recover a dense depth map of a scene. The method can handle depth discontinuities effectively by using adaptively shaped and weighted support windows. The support window shapes and weights are determined from the image characteristics of the all-focused image of the scene. Similar and closer pixels in the support window ge...

We use random linear network coding (RLNC) based scheme for multipath communication in the presence of lossy links with different delay characteristics to obtain ultra-reliability and low latency. A sliding window version of RLNC is proposed where the coded packets are generated using packets in a window size and are inserted among systematic packets in different paths. The packets are schedule...

A central problem in stereo matching by computing correlation or sum of squared differences (SSD) lies in selecting an appropriate window size. If the window is too small and does not cover enough intensity variation, it gives a poor disparity estimate, because the signal (intensity variation) to noise ratio is low. If, on the other hand, the window is too large and covers a region in which the...

Scan statistics have been widely applied to test for unusual cluster of events in many scientific areas. It has been of practical interest on how to select the window size of a scan statistic. An adaptive procedure for multiple window scan statistics is proposed and the distributions are studied for independent identically distributed Bernoulli trials and uniform observations on (0, 1) in one-d...

We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional meanpayoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidabl...