In this paper, the synchronization controller design problem for a class of chaotic delayed systems with parameter mismatch is investigated. Based on linear matrix inequality (LMI) technique and Lyapunov method, one n...
详细信息
In this paper, some new nonlinear generalized Gronwall-Bellman-Type integral inequalities with mixed time delays are established. These inequalities can be used as handy tools to research stability problems of delayed...
详细信息
In this paper, some new nonlinear generalized Gronwall-Bellman-Type integral inequalities with mixed time delays are established. These inequalities can be used as handy tools to research stability problems of delayed differential and integral dynamic systems. As applications, based on these new established inequalities, some p-stable results of a integro-differential equation are also given. Two numerical examples are presented to illustrate the validity of the main results.
In this paper, some new nonlinear generalized Gronwall-Bellman-Type integral inequalities with mixed time delays are established. These inequalities can be used as handy tools to research stability problems of delayed...
详细信息
In this paper, some new nonlinear generalized Gronwall-Bellman-Type integral inequalities with mixed time delays are established. These inequalities can be used as handy tools to research stability problems of delayed differential and integral dynamic systems. As applications, based on these new established inequalities, some p-stable results of a integro-differential equation are also given. Two numerical examples are presented to illustrate the validity of the main results.
User authentication is very important to information security. In this paper, we present an economical hash-based strong password authentication scheme by using of a popular removable storage device. With the help of ...
详细信息
User authentication is very important to information security. In this paper, we present an economical hash-based strong password authentication scheme by using of a popular removable storage device. With the help of the new scheme, the user can ¿remember¿ a random number that is not only a part of the user's ID but also a part of user's password, which makes the scheme to be one-time ID and one-time password with user identity protection. Mutual authentication is supported, which makes the scheme has the ability of message freshness and principal liveness. In this scheme, no plain text transferred, and data are protected each other by using hash functions, and most of the common attacks can be avoided. Furthermore, the server and the user exchange two random numbers that can be used to build a session key after authentication. Different methods of constructing the key influence the scheme security, an analysis of it is also be given.
Let G = (V, E) be a simple graph, k (1 ¿ k ¿ ¿(G) +1) is a positive integer, f is a mapping from V(G) ¿ E(G) to {1,2, ···, k} such that ¿uv ¿ E(G),f(u) ¿ f(v) and C(u)...
详细信息
Let G = (V, E) be a simple graph, k (1 ¿ k ¿ ¿(G) +1) is a positive integer, f is a mapping from V(G) ¿ E(G) to {1,2, ···, k} such that ¿uv ¿ E(G),f(u) ¿ f(v) and C(u) = C(v) if d(u) = d(v), we say that f is the adjacent vertex reducible vertex-total coloring of G. The maximum number of k is called the adjacent vertex reducible vertex-total chromatic number of G, simply denoted by ¿ avrvt (G). Where C(u) = {f(u)|u ¿ V(G)} ¿ {f(uv)|uv ¿ E{G)}. In this paper, the adjacent vertex reducible vertex-total chromatic number of some special graphs are given.
Since its introduction half a century ago IT has become one of the most important infrastructure components of virtually any organisation. An important key area of qualitative research in information systems is interv...
详细信息
Since its introduction half a century ago IT has become one of the most important infrastructure components of virtually any organisation. An important key area of qualitative research in information systems is interv...
详细信息
In this paper, low complexity linear network coordinated beamforming (N-CBF) algorithms under a zero inter-user interference constraint are proposed for the multi-cell downlink channel. We consider a downlink scenario...
详细信息
In this paper, a networked fault tolerant control strategy that utilizes a self-diagnostic smart actuator is presented with an application to ldquosteer-by-wirerdquo (SBW) which is a network based steering system for ...
详细信息
In this paper, a networked fault tolerant control strategy that utilizes a self-diagnostic smart actuator is presented with an application to ldquosteer-by-wirerdquo (SBW) which is a network based steering system for intelligent cars. Networked control systems (NCS) like SBW have various advantages, such as easy maintenance, low cost implementation and reconfiguration ability. In NCS, it is possible to achieve bi-directional communications using intelligent subsystems called ldquosmart *** Using a built-in processing unit and bi-directional communication, a smart actuator can offer the capability of self-diagnosis and self-compensation resulting in a high level of dependability. This paper highlights the usefulness of such smart actuators from the point of view of enhancing the ability of tolerating actuator faults without any redundant actuators. The proposed approach is mainly relying on an actuator performance index, called effectiveness factor, which can be obtained through self-diagnosis performed by the built-in actuator processor. Simulation results with a SBW system show that the proposed smart actuator-based control system provides fast and accurate control strategy to tolerate faults.
Certificateless public key cryptography was introduced to avoid the inherent key escrow problem in identity-based cryptography, and eliminate the use of certificates in traditional PKI. Most cryptographic schemes in c...
详细信息
Certificateless public key cryptography was introduced to avoid the inherent key escrow problem in identity-based cryptography, and eliminate the use of certificates in traditional PKI. Most cryptographic schemes in certificateless cryptography are built from bilinear mappings on elliptic curves which need costly operations. Despite the investigation of certificateless public key encryption without pairings, certificateless signature without pairings received much less attention than what it deserves. In this paper, we present a concrete pairing-free certificateless signature scheme for the first time. Our scheme is more computationally efficient than others built from pairings. The new scheme is provably secure in the random oracle model assuming the hardness of discrete logarithm problem.
暂无评论