Processing the data from a large variety of zero-pressure-gradient boundary layer flows shows that the Reynolds-number-dependent scaling law, which the present authors obtained earlier for pipes, gives an accurate description of the velocity distribution in a selfsimilar intermediate region of distances from the wall adjacent to the viscous sublayer. The appropriate length scale that enters the...

The problem of robust decoding of VLC encoded streams in presence of channel errors is essentially a problem of joint estimation and segmentation of the bit stream. A correct segmentation and estimation of a VLC compressed stream in presence of channel noise requires to re-augment the redundancy of the stream. Instead of using a channel code, the approach described here dedicates specifically e...

We study the problem of parameterized matching in a stream where we want to output matches between a pattern of length m and the last m symbols of the stream before the next symbol arrives. Parameterized matching is a natural generalisation of exact matching where an arbitrary one-to-one relabelling of pattern symbols is allowed. We show how this problem can be solved in constant time per arriv...

Fractal dimensions have been frequently applied to generalize the complexity and drainage of particular stream networks. Certain techniques to calculate dimension have become particularly popular, specifically the Divider method, functional-box counting, and as a function between bifurcation and length ratios. The frequency and variability with which these techniques are applied creates discrep...

Mundja is a MAC generation algorithm that has been designed for use together with a stream cipher. Mundja accumulates the message onto two independent registers: the first is a Cyclic Redundancy Checksum (CRC) that uses linear feedback; the second is a strengthened version of the SHA-256 register [5] that uses nonlinear feedback. Mundja is fast (asymptotically about 4 times the speed of HMAC-SH...

Data stream mining is a process of extracting the information from continuously coming rapid data records. Data stream can be viewed as an ordered sequence of instances appears at time varying. Data stream classification has three major problems: infinite length, concept drift and concept evolution or arrival of novel class. In this paper, we propose a new approach for detection of novel class ...

It is well known that text compression can be achieved by predicting the next symbol in the stream of text data based on the history seen up to the current symbol. The better the prediction the more skewed the conditional probability distribution of the next symbol and the shorter the codeword that needs to be assigned to represent this next symbol. What about the opposite direction ? suppose w...

The lazy Viterbi decoder is a maximum-likelihood decoder for block and stream convolutional codes. For many codes of practical interest, under reasonable noise conditions, the lazy decoder is much faster than the original Viterbi decoder. For a code of constraint length , the lazy algorithm is about 50% faster than an optimized implementation of the Viterbi decoder whenever SNR dB. Moreover, wh...

Experiments were performed in the T5 Hypervelocity Shock Tunnel to investigate nonequilibrium real-gas effects on separation length using a double-wedge geometry and nitrogen test gas. Local external flow conditions were estimated by computing the inviscid nonequilibrium flow field. A new scaling parameter was developed to approximately account for wall temperature effects on separation length ...

This paper aims to develop an Adaptive Sliding Kalman Filter (ASKF) by fusing the concept of change detection in a data stream, adapting noise covariance matrices and the Sliding Kalman filter (SKF). Adaptive Kalman filtering (AKF) scheme modifies the noise covariance matrix (Q and R) value based on a window of past innovation sequence whereas SKF is a window based filtering technique which use...