This paper is devoted to further strengthening, in the current asymmetric information environment, informed level of operators about network performance. Specifically, view burst and perishability a packet loss event, better meet real-time requirements high-speed backbone performance monitoring, model for Packet Loss Measurement at access boundary Based on Sampled Flow (PLMBSF) presented this u...

In this letter, on the basis of a recently proposed discrete-time port-Hamiltonian representation sampled-data dynamics, we propose new time-varying digital feedback for steering mobile robots. The quality passivity-based control is validated and compared through simulations with existing literature continuous-time implementation using unicycle as case study.

This paper deals with the optimal solution to the sampled-data minimum variance filtering problem for linear systems with noise in the states and in the measurements. The solution is derived in the time-domain by using a fast sampling zeroorder hold input discretization of the continuous time systems together with a lifting technique. The original sampled-data system is transformed into an equi...

Deep packet inspection and payload analysis is required for various purposes such as the detection and identification of attacks as well as service and application-level analysis of packet streams. However, network-wide deployment of fullfledged network analyzers and intrusion detection systems is a very costly solution, especially in large networks and at high link speeds. On the other hand, m...

We present two new schemes for digital steganography of point-sampled geometry in the spatial domain. To the best of our knowledge, our schemes are the first in the literature for such types of geometry. Both schemes employ a principal component analysis to translate the points’ coordinates to the new coordinate system, resulting in a blind approach. In the first scheme, we establish a list of ...

We consider the wide class of real-time systems that periodically sample their inputs. A desirable property of such systems is that their outputs should be, in some sense, more precise when the sampling period gets shorter. An approximation of this property consists in requiring that, whenever the inputs don’t change, the outputs stabilize after a finite number of steps. We present a set of heu...

Repetitive control is one control algorithm based on the Internal Model Principle (Francis & Wonham, 1976) and has been widely implemented in various applications. A repetitive control based system has been shown to work well for tracking periodic reference commands or for rejecting periodic disturbances. Although the idea has been verified as early as 1981 (Inoue et al., 1981), a rigorous anal...

When augmented with the longest common prefix (LCP) array and some other structures, the suffix array can solve many string processing problems in optimal time and space. A compressed representation of the LCP array is also one of the main building blocks in many compressed suffix tree proposals. In this paper, we describe a new compressed LCP representation: the sampled LCP array. We show that...

An analysis of the effects of time-sampling on the obseroer error lineariza-tion design methodology shows that requiring the method to be applicable for an open set of sampling times trioializes the class of allowable systems. Abstract-The effects of time-sampling on the solvability conditions for the observer linearization design methodology are investigated. It is shown that the class of syst...

We describe linear-time algorithms for solving a class of problems that involve transforming a cost function on a grid using spatial information. These problems can be viewed as a generalization of classical distance transforms of binary images, where the binary image is replaced by an arbitrary function on a grid. Alternatively they can be viewed in terms of the minimum convolution of two func...