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.
This paper addresses the containment control problem for discrete-time high-order multi-agent systems with time-varying delays. Based on the distributed containment control protocol only depends on the agent's own information and its neighbors' partial information, the properties of the product of infinite nonnegative matrices and the composite of binary relation are utilized to derive a necessary...
The containment control problem for general discrete-time second-order multi-agent systems is investigated in this paper. Based on a distributed containment control algorithm with the state gain parameters in a given range, we transform the system to an equivalent error system, and then analyze the convergence of the error system by the eigenvalues of the corresponding coefficient matrix. Finally,...
Asynchronous containment control problem of discrete-time multi-agent system is investigated in this paper. It is assumed that each agent can detect the state information of neighbors to update its state by its own clock, which is independent of the other agents. Based on nonnegative matrix theory and graph theory, we derive a necessary and sufficient condition to guarantee that all the follower agents...
String matching is a basic problem of string operation, and privacy-preserving string matching, as a special case of secure multi-party computation, has broad applications in auction, bidding and some other commercial areas. In this paper, some protocols are proposed to solve this private matching problem, the security and correctness are analyzed respectively, and the actual efficiency is tested...
At present, many studies focus on the efficiency of handoff among different networks, while research on how to maintain the safety during registration process of handoff is not enough. Unfortunately, mobile node is vulnerable to various security threats and attacks when handover for being lack of protection. A security scheme based on the IPSec protocol which was combined with fast handoff signaling...
Secure two-party vector dominance means that the two sides of the computation want to judge whether their vectors have the dominance relation securely, a new problem which is called multi-dimensional vector comparison problem is proposed based on the vector dominance in this paper, it can be applied in many commercial areas, such as auction, bidding and so on. Two solutions are provided for this problem,...
We study the capabilities of virtual addressing schemes for efficient and failure tolerant routing in sensor networks. In particular, we present the virtual cord protocol (VCP) that uses techniques known from peer-to-peer networks, i.e. distributed hash tables (DHTs) are used to associate data items in sensor networks with particular node addresses. The addresses of nodes are dynamically maintained...
DNS amplification attacks utilize IP address spoofing and large numbers of open recursive DNS servers to perform the bandwidth consumption attack. During an attack, it ceaselessly fabricates DNS queries to the exploited open recursive DNS servers, and all the responses, often with larger size than the query messages, are reflected to the single victim due to the source IP address spoofing. While it...
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.