The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
When outsourcing large sets of data to the cloud, it is desirable for clients to efficiently check, whether all outsourced data is still retrievable at any later point in time without requiring to download all of it. Provable data possession (PDP)/proofs of retrievability (PoR), for which various constructions exist, are concepts to solve this issue. Interestingly, by now, no PDP/PoR scheme leading...
The main goal of device-independent quantum key distribution is to design protocols for secret key distribution whose security does not rely on any assumption on the inner working of the devices used in the implementation. We discuss recent progress on the problem, with an emphasis on possible implementations.
Conventional experiments on MTT are built upon the belief that fixing the detections to different trackers is sufficient to obtain a fair comparison. In this work we argue how the true behavior of a tracker is exposed when evaluated by varying the input detections rather than by fixing them. We propose a systematic and reproducible protocol and a MATLAB toolbox for generating synthetic data starting...
Modern cellular networks utilizing the long-term evolution (LTE) set of standards face an ever-increasing demand for mobile data from connected devices and header compression is employed to minimize the overhead for IP-based cellular network traffic. In this paper, we evaluate the three implementations of header compressions used by these networks with respect to their potential throughput increase...
In this paper, a novel active queue management scheme is proposed to control the congestion in the networks using TCP/IP protocol for transport layer. Active queue management (AQM) is a complement protocol to TCP/IP which provides feedback to the TCP sources in order to perform close loop congestion control. We use the nonlinear model of TCP/AQM system and build our controller on this realistic model...
Radiation robust circuit design for harsh environments like space is a big challenge for today engineers and researchers. As circuits become more and more complex and CMOS processes get denser and smaller, their immunity towards particle strikes decreases drastically. This work has for objective to improve the System on Chip (SoC) robustness against particle attacks targeting very advanced processes...
This paper discusses how Sybil attacks can undermine trust management systems and how to respond to these attacks using advanced techniques such as credibility and probabilistic databases. In such attacks end-users have purposely different identities and hence, can provide inconsistent ratings over the same Web Services. Many existing approaches rely on arbitrary choices to filter out Sybil users...
The goal of this paper is to compute transmission rates and delays that provably stabilize Multi-Agent Systems (MASs) in the presence of disturbances and noise. In other words, given the existing information delay among the agents and the underlying communication topology, we determine rates at which information between the agents need to be exchanged such that the MAS of interest is ℒp-stable with...
To move mixed criticality research into industrial practice requires models whose run-time behaviour is acceptable to systems engineers. Certain aspects of current models, such as abandoning lower criticality tasks when certain situations arise, do not give the robustness required in application domains such as the automotive and aerospace industries. In this paper a new bailout protocol is developed...
This paper solves the output synchronization problem for groups of identical linear agents subject to constant external disturbances. We propose novel distributed control laws with integral action. In a first step, we assume that each agent has access to its own state. Then, we present observer-based implementations for the cases where each agent has only access to its output or to a relative output...
We formulate a method for designing dynamic average consensus estimators with optimal worst-case asymptotic convergence rate over a large set of undirected graphs. The estimators achieve average consensus for constant inputs and are robust to both initialization errors and changes in network topology. The structure of a general class of polynomial linear protocols is characterized and used to find...
Whereas synchronization (consensus, agreement) in linear networks has been thoroughly studied in recent years up to certain exhaustiveness, reaching a synchrony among general nonlinear agents still remains a hard open problems. In this paper, we propose a general criteria of synchronization in undirected networks with nonlinear nodes, based on the idea of incremental dissipativity. We show that our...
Detecting the text in natural scene images is often challenging due to the complexity and variety of text's appearance and its interaction with the scene context. In this paper, we present a novel hierarchical text detection method exploiting textual characteristics at both character and text line scales for improved accuracy. First, seed candidate characters are detected with discriminative deep...
We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of nonnegative matrices or (if the matrices are subject to additional normalization constraints) as compression of quantum models. We derive both lower and upper bounds on compressibility...
It has recently been shown that distributed queue-based adaptation of CSMA's contention aggressiveness can provably optimize network utility. However, such an approach is fragile, in that it suffers high performance degradation under conditions of asymmetric channels, heterogeneous traffic, and packet collisions. In this work, we address the main sources of performance degradation in optimal CSMA...
This paper proposes the use of Synchronous Ethernet in networks with multiple paths for the synthesis of a precise frequency reference for distributed measurement systems. The paper presents novel approach based on a Kalman filter with outlier identification and removal followed by a linear quadratic regulator (LQR). The algorithm, to be implemented within a network element, is able to synthetize...
Multi-agent systems (MASs) are universal in nature, including biological, physical, and engineering systems. This paper investigates the robust consensus of a class of linear MASs with transmission noise. In detail, we develop a new framework to design an observer-based consensus protocol utilizing sampled data. That is, some sufficient conditions are derived to guarantee the existence of sampled...
We present a new anomaly detector for data traffic, ‘SMS’, based on combining random projections (sketches) with multiscale analysis, which has low computational complexity. The sketches allow ‘normal’ traffic to be automatically and robustly extracted, and anomalies detected, without the need for training data. The multiscale analysis extracts statistical descriptors, using wavelet leader tools developed...
The Dirty Paper Trellis Codes (DPTC) watermarking is a very efficient high capacity scheme. Nevertheless, it suffers of two drawbacks: its security weakness and its CPU computation complexity. In a previous work, we treat those drawbacks by proposing a more secure embedding space and a faster embedding technique. In the current paper, we study the robustness of the scheme with the use of a psychovisual...
Since the first protocol, proposed by Benette and Brassard in 1984 (BB84), the Quantum Cryptographic(QC) protocols has been studied widely in recent years. It is observed that most of the later QC protocols are variants of BB84 with the intention of addressing one or more problems incurred during the practical implementation of BB84 protocol. Amongst many candidates, SARG04 provides robust performance...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.