We address the question of finite-size scaling in percolation by studying bond percolation in a finite box of side length n, both in two and in higher dimensions. In dimension d = 2, we obtain a complete characterization of finite-size scaling. In dimensions d > 2, we establish the same results under a set of hypotheses related to so-called scaling and hyperscaling postulates which are widely b...

When searching for a target with eye movements, saccades are planned and initiated while the visual information is still being processed. If hand movements are needed to perform a search task, can they too be planned while visual information from the current position is still being processed? To find out we studied a visual search task in which participants had to move their hand to shift a win...

This work presents a thorough study of TCP like window based congestion control. These schemes are basically different from memory less AIMD and binomial schemes. As like this, a small step allows a much broader exploration of friendliness for TCP congestion controls than memory less AIMD and binomial schemes. We propose An Array of window based congestion controls possessing higher smoothness ...

IEEE 802.11 has employed distributed coordination function (DCF) adopting carrier sense multiple access with collision avoidance (CSMA/CA). To effectively resolve collisions, DCF uses binary exponential backoff (BEB) algorithm with three parameters, i.e., backoff stage, backoff counter and contention window. If a collision occurs, stations involving in the collision increase their backoff stage...

We consider wireless ad hoc networks in which each connection (file) traverses only one hop. We assume that files arrive for service at each link and a file departs when all its packets have been transmitted. The file size distribution can be arbitrary, but the file sizes are assumed to be bounded. We assume that a window flow control protocol regulates the injection of packets from each file i...

A £xed scale (typically 25ms) short time spectral analysis of speech signals, which are inherently multi-scale in nature [7] (typically vowels last for 40-80ms while stops last for 10-20ms), is clearly sub-optimal for time-frequency resolution. In this work, we detect piecewise quasi-stationary speech segments based on the likelihood of that segment which in turn is estimated from the linear pr...

We derive a closed-form expression for the message collision probability in the IEEE 802.3ah Ethernet Passive Optical Network (EPON) registration scheme. The expression obtained, although based on an approximation, shows a good match with simulation results. We use the results of our analysis to compute the size of the most efficient contention window and the most efficient number of nodes serv...

We propose here an extended linear feedback model, taking the binary exponential backoff mechanism adopted in IEEE 802.15.4 CSMA/CA and analyze the energy consumption issues of the one hop sensor nodes. Numerical results show that the energy consumption in Wireless Sensor Networks (WSNs) can be reduced by applying CSMA protocol with fixed contention window size. Besides, an optimal contention w...

In wireless cellular communications, accurate local mean (shadow) power estimation performed at a mobile station is important for use in power control, handoff, and adaptive transmission. Window-based weighted sample average shadow power estimators are commonly used due to their simplicity. In practice, the performance of these estimators degrades severely when the window size deviates beyond a...

Several methods have been developed to enhance the performance of image denoising algorithms. In this letter we have developed an algorithm for image noise removal based on local adaptive window size/shape filtering. While rectangular windows are efficient, they yield poor results near object boundaries. We describe an efficient method for determining the variable size of the locally adaptive w...