Search

This paper considers the event-triggered consensus problem for multi-agent systems (MASs) under intermittently random denial-of-service (IRDoS) attacks. The IRDoS attack compromises communication networks when the attacker is at active periods. Then, the distributed event-triggered controller is designed to achieve the consensus objective, and each agent's communications towards neighbors are interrupted by the IRDoS attack with a certain probability when the triggered instants are at active periods of attackers. Furthermore, the sufficient conditions on the attack duration and successful probability, under which the designed control protocol guarantees secure consensus of MASs, are proposed. Finally, the effectiveness of the distributed event-triggered controller under a class of IRDoS attack is illustrated with a numerical example. [ABSTRACT FROM AUTHOR]

In this paper, a novel cooperative attack policy comprising adaptive and bias signals is studied against the cyber-physical systems (CPSs) based on the model knowledge. From the attacker's stand point, the design objective is deteriorating the system performance and deceiving the previously equipped detector in the CPSs. Combining with H ∞ and H − indexes, the bias signal is elaborately designed to compromise the systems by applying the linear matrix inequality (LMI) technology. Different from the existing works, in order to increase the attack effectiveness, an adaptive signal is also injected to compensate the possible external disturbance by the attacker. Moreover, some technology difficulties in the H ∞ / H − attack design problems are also investigated with the LMI approach. Finally, a practical example is given to illustrate the effectiveness and stealthiness of the cooperative attack policy. [ABSTRACT FROM AUTHOR]

Highlights • A stochastic coding scheme is proposed to generate covariance difference of the compromised data under replay attack, which removes the performance degradations in existing works. • A residual-based detector is designed to detect the covariance changes caused by the coding scheme subject to the false alarm rate (FAR) and attack detection rate (ADR) limitations. Then, an output-based detector is proposed, which effectively reduce the design complexity of the residual-based detector. • Different from traditional detector, the above detectors apply a novel form to remove the non-convex constrain conditions in design optimal problems. Abstract In this paper, the security problems in cyber-physical systems (CPSs) against replay attack are considered. With replay attacks, attacker records and covers the transmitted data between the senders and receivers of the sensors. In order to achieve the detection objective for malicious replay attacks, the stochastic coding scheme is proposed to make the CPSs generate covariance differences between the normal and compromised data. Different from the existing results, this method detects the replay attack without sacrificing any system performances in normal systems. Based on the coding scheme, two types of detectors are further designed to detect the covariance changes in residual and output, respectively. Moreover, the output-based detector has more low-computing solution process than the residual-based one. Finally, a practical example is proposed to demonstrate the superiority of the stochastic coding scheme. [ABSTRACT FROM AUTHOR]

Abstract: Box-Behnken design has been popularly used for the second-order response surface model. It is formed by combining two-level factorial designs with incomplete block designs in a special manner—the treatments in each block are replaced by an identical design. In this paper, we construct small Box–Behnken design. These designs can fit the second-order response surface model with reasonably high efficiencies but with only a much smaller run size. The newly constructed designs make use of balanced incomplete block design (BIBD) or partial BIBD, and replace treatments partly by 2III 3−1 designs and partly by full factorial designs. It is shown that the orthogonality properties in the original Box and Behnken designs will be kept in the new designs. Furthermore, we classify the parameters into groups and introduce Group Moment Matrix (GMM) to estimate all the parameters in each group. This allows us to significantly reduce the amount of computational costs in the construction of the designs. [Copyright &y& Elsevier]

Domain adaptation is one of the mainstream deep transfer learning strategies to deal with unsupervised fault diagnosis issues. Nevertheless, the existing domain adaptation based diagnosis approaches mainly focus on the alignment of source domain and target domain at global level, which may lead to the confusion between subdomains and finally restrict the improvement of target domain accuracy. In this work, the subdomain adaptation capsule network (SACNet) is developed, and the contributions of the proposed method mainly reflected in the following aspects. Firstly, in the proposed architecture, a novel distance metrics named local joint maximum mean discrepancy (LJMMD) is developed and embedded as part of the objective function. Utilizing the LJMMD, the joint distribution of feature and prediction space of target domain can be matched with that of source domain at subdomain level, which can avoid the limitations of global or single marginal distributions match. Secondly, the capsule network with vector-output is substituted for the classical fully connected adaption layer. Instead of matching specific values, the module value of the capsule vector is set as the object of domain adaption. Thus, the discrepancy between different domains can be admitted to a certain extent, which can endow the model with more excellent generalization ability. The experimental results indicate that, compared with other methods, the suggested LJMMD can achieve higher diagnostic accuracy in most transfer tasks. Besides, the diagnostic accuracy of the developed SACNet can be further improved by nearly 2% after adopting the capsule adaptation layer. [ABSTRACT FROM AUTHOR]

In this paper, a generalized (2+1)-dimensional Camassa–Holm–Kadomtsev–Petviashvili (gCHKP) equation is investigated, which describes the role of dispersion in the formation of patterns in liquid drops. We succinctly construct its bilinear formalism. By further using homoclinic breather limit approach, some exact solutions including breather waves, rogue waves and solitary waves of the equation are well presented. Our results show that rogue waves can come from the extreme behavior of the breather solitary waves for the (2+1)-dimensional gCHKP equation. [ABSTRACT FROM AUTHOR]

We consider the rogue dn-periodic waves (the rogue wave solutions on the dn-periodic waves background) for the Hirota equation by using Darboux transformation. We take Jacobian elliptic function dn as a seed solution, which is modulationally unstable as regards long wave perturbations. Through nonlinearization of the Lax pair for Hirota equation, the corresponding periodic eigenfunctions are successfully obtained. Based on these periodic eigenfunctions, we further construct the solutions of the Lax pair equations with dn-periodic wave seed solutions. In addition, numerical simulations are presented to reveal the phenomena of these solutions under different parameters choices. • We consider the rogue periodic waves for the Hirota equation. • Jacobian elliptic function solution is considered for regarding long wave perturbations. • We obtain the corresponding periodic eigenfunctions. • We further construct the solutions of the Lax pair equations with periodic wave seed solutions. • Numerical simulations are presented to reveal the phenomena of these solutions under different parameters choices. [ABSTRACT FROM AUTHOR]