This work concentrates on solving the finite-time H infinity output synchronization (FTHOS) issue of directed coupled reaction-diffusion neural networks (DCRDNNs) with multiple delayed and adaptive output couplings in...
详细信息
This work concentrates on solving the finite-time H infinity output synchronization (FTHOS) issue of directed coupled reaction-diffusion neural networks (DCRDNNs) with multiple delayed and adaptive output couplings in the presence of external disturbances. Based on the output information, an adaptive law to adjust output coupling weights and a controller are respectively developed to ensure that the DCRDNNs achieve FTHOS. Then, in the special case of no external disturbances, a corollary on the finite-time output synchronization (FTOS) of the DCRDNNs with multiple delayed and adaptive output couplings is provided. In addition, a novel adaptive scheme to update output coupling weights is devised to ensure H infinity output synchronization (HOS) in the DCRDNNs with multiple delayed output couplings. Finally, the relevant simulation graphs are provided to certify the validity of several synchronization criteria.
Spiking neural (SN) P systems are a class of distributed parallel computing devices inspired by the way neurons communicate by means of spikes. In this work, we investigate reversibility in SN P systems, as well as ...
详细信息
Spiking neural (SN) P systems are a class of distributed parallel computing devices inspired by the way neurons communicate by means of spikes. In this work, we investigate reversibility in SN P systems, as well as the computing power of reversible SN P systems. Reversible SN P systems are proved to have Turing creativity, that is, they can compute any recursively enumerable set of non-negative integers by simulating universal reversible register machine.
This article explores the average controllability of composite networks generated by factor networks via Cartesian product from energy control perspective, which can be characterized by the controllability Gramian-bas...
详细信息
This article explores the average controllability of composite networks generated by factor networks via Cartesian product from energy control perspective, which can be characterized by the controllability Gramian-based metrics. The considered factors are directed weighted networks with diagonalizable / non-diagonalizbable Laplacian dynamics. It is shown that the average controllability of a composite network is determined by the spectral properties of its factors without calculating its own high-dimensional matrix, which reveals how the energy-related controllability of a Cartesian product network (CPN) can be derived from its factors' features. This will reduce the computational complexity and provide insights to study the energy control of other graph product networks.
This paper investigates the problem of memory-event-driven bipartite tracking consensus of delayed linear multi-agent systems (MASs) within insecure cooperative and antagonistic interaction networks under scaling atta...
详细信息
This paper investigates the problem of memory-event-driven bipartite tracking consensus of delayed linear multi-agent systems (MASs) within insecure cooperative and antagonistic interaction networks under scaling attacks. The study aims to address a more challenging and practical scenario of asynchronous communication. An effective approach of asynchronous memory-event-triggered control (METC) is proposed to overcome the security consensus problem of asynchronous scaling attacks on MASs with heterogeneous time-varying input delays, which may result in either communication tampering or communication interruption on the interactive edge between agents. Furthermore, a distributed memory-based delayed controller is designed to ensure exponential bipartite tracking consensus for the closed-loop control system. Additionally, the memory-based control gains under networked attacks are obtained using the Lyapunov functional method and Halanay inequality, and the upper bound for the allowable delay is established in the system stability analysis. Finally, the proposed control strategy and theoretical results are validated by simulation examples.
Accurate cell classification is crucial but expensive for large-scale single-cell RNA sequencing (scRNA-seq) analysis. Gene selection (GS) emerges as a pivotal technique in identifying gene subsets of scRNA-seq for cl...
详细信息
As the deadliest form of pollution, air pollution had a prolonged severe damage to the human health and life safety of nearly 99% of the world's population. Facing to the problem that billions of tons of pollutant...
详细信息
In this paper, the DVRT(vector radiative transfer theory of densely distributed random discrete scatters) model to calculate the brightness temperature emitted by radiometer calibration load is presented. It takes the...
详细信息
In this paper, the DVRT(vector radiative transfer theory of densely distributed random discrete scatters) model to calculate the brightness temperature emitted by radiometer calibration load is presented. It takes the multiple scattering of isolation layer into account, which is neglected by the incoherent homogeneous model often used in calibration. Hence, it works much better than incoherent homogeneous model at millimeter wave band. Furthermore, the iteration of DVRT model is presented, and it proves that the incoherent homogeneous model is just the zero-order solution of DVRT model. Some numerical results are provided in the end.
DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence desig...
详细信息
DNA computing is a new vista of computation, which is of biochemical type. Since each piece of information is encoded in biological sequences, their design is crucial for successful DNA computation. DNA sequence design is involved with a number of design criteria, which is difficult to be solved by the traditional optimization methods. In this paper, the multi-objective carrier chaotic evolution algorithm (MCCEA) is introduced to solve the DNA sequence design problem. By merging the chaotic search base on power function carrier, a set of good DNA sequences are generated. Furthermore, the simulation results show the efficiency of our method.
P systems are distributed parallel computing models in the area of membrane computing, which are inspired by the structure and the functioning of living cells, as well as the organization of cells in tissues, organs, ...
详细信息
P systems are distributed parallel computing models in the area of membrane computing, which are inspired by the structure and the functioning of living cells, as well as the organization of cells in tissues, organs, and other higher order structures. P systems with proteins on membranes are a class of P systems, which have proved to be very efficient computing devices. Specifically, it was known that the Quantified satisfiability problem (QSAT) of a Boolean formula can be solved by a semi-uniform family of P systems with proteins on membranes and with membrane division. However, it remains open whether a uniform families of P systems with proteins on membranes can solve in polynomial time exactly the class of problems PSPACE. In this work, we present a uniform solution to QSAT problem by P systems with proteins on membranes in a linear time with respect to both the number n of Boolean variables and the number m of clauses of the instance, which answers the above open problem.
Most existing flocking algorithms assume one single virtual leader and rely on information on both relative positions and relative velocities among neighboring *** this paper,the problem of controlling a flock of mobi...
详细信息
Most existing flocking algorithms assume one single virtual leader and rely on information on both relative positions and relative velocities among neighboring *** this paper,the problem of controlling a flock of mobile autonomous agents to follow multiple virtual leaders is investigated by using only position information in the sense that agents with the same virtual leader asymptotically attain the same velocity and track the corresponding virtual leader based on only position measurements.A flocking algorithm is proposed under which every agent asymptotically attains its desired velocity,collision between agents can be avoided,and the final tight formation minimizes all agents' global potentials.A simulation example is presented to verify and illustrate the theoretical results.
暂无评论