Policy Iteration Approach to the Infinite Horizon Average Optimal Control of Probabilistic Boolean Networks

A Nonaugmented Method for the Minimal Observability of Boolean Networks

This article proposes a nonaugmented method for investigating the minimal observability problem of Boolean networks (BNs). This method can be applied to more general BNs and reduce the computational and space complexity of existing results. First, unobservable states concerning an unobservable BN are classified into three categories using the vertex-colored state transition graph, each accompanied by a necessary and sufficient condition for determining additional measurements to make them distinguishable. Then, an algorithm is designed to identify the additional measurements that would render an unobservable BN observable using the conditions. Next, to determine the minimum added measurements, a necessary and sufficient condition and an algorithm based on a constructed matrix are presented. Finally, the results obtained are compared with existing literature and illustrated with examples.

Almost Sure Stability of Complex-Valued Complex Networks: A Noise-Based Delayed Coupling Under Random Denial-of-Service Attacks

This article is concerned with stability for stochastic complex-valued delayed complex networks under random denial-of-service (RDoS) attacks. Different from the existing literature on the stability of stochastic complex-valued systems that concentrate on moment stability, we investigate almost sure stability (ASS), where noise plays a stabilizing role. It is noted that, besides the vertex systems influenced by noise, the interactions among vertices are also at the mercy of noise. As a consequence, an innovative noise-based delayed coupling (NDC) in the presence of RDoS attacks is proposed first to accomplish the stability of complex-valued networks, where the RDoS attacks have a certain probability of triumphantly interfering with communications at active intervals of attackers. Namely, RDoS attacks considered are randomly launched at active periods, which is more realistic. In terms of the Lyapunov method and stochastic analysis theory, an almost sure exponential stability (ASES) criterion of the system discussed straightforwardly is developed by constructing a delay-free auxiliary system, while removing the traditional assumption of moment stability. The criterion strongly linked with topological structure, RDoS frequency, attack successful probability, and noise intensity reveals that the higher the noise intensity, the faster the convergence rate is for the stability of the network. In light of the criterion established, we present an algorithm that can be employed to analyze the tolerable attack parameters and the upper bound of the coupling delays, under the prerequisite of guaranteeing the stability of the network. Eventually, the theoretical results are applied to inertial complex-valued neural networks (ICNNs) and an illustrative example is presented to substantiate the efficiency of the theoretical works.

Hidden Order of Boolean Networks

It is a common belief that the order of a Boolean network is mainly determined by its attractors, including fixed points and cycles. Using the semi-tensor product (STP) of matrices and the algebraic state-space representation (ASSR) of the Boolean networks, this article reveals that in addition to this explicit order, there is a certain implicit or hidden order, which is determined by the fixed points and limit cycles of their dual networks. The structure and certain properties of dual networks are investigated. Instead of a trajectory, which describes the evolution of a state, the hidden order provides a global horizon to describe the evolution of the overall network. We conjecture that the order of networks is mainly determined by the dual attractors via their corresponding hidden orders. Then these results about the Boolean networks are further extended to the k -valued case.

Minimal Pinning Control for Oscillatority of Boolean Networks

In this article, minimal pinning control for oscillatority (i.e., instability) of Boolean networks (BNs) under algebraic state space representations method is studied. First, two criteria for oscillatority of BNs are obtained from the aspects of state transition matrix (STM) and network structure (NS) of BNs, respectively. A distributed pinning control (DPC) from these two aspects is proposed: one is called STM-based DPC and the other one is called NS-based DPC, both of which are only dependent on local in-neighbors. As for STM-based DPC, one arbitrary node can be chosen to be controlled, based on certain solvability of several equations, meanwhile a hybrid pinning control (HPC) combining DPC and conventional pinning control (CPC) is also proposed. In addition, as for NS-based DPC, pinning control nodes (PCNs) can be found using the information of NS, which efficiently reduces the high computational complexity. The proposed STM-based DPC and NS-based DPC in this article are shown to be simple and concise, which provide a new direction to dramatically reduce control costs and computational complexity. Finally, gene networks are simulated to discuss the effectiveness of theoretical results.

Research on High-Frequency Information-Transmission Method of Smart Grid Based on CNN-LSTM Model

In order to solve the problem of the slow transmission rate of high-frequency information in smart grid and improve the efficiency of information transmission, a research method of high-frequency information transmission in smart grids based on the CNN-LSTM model is proposed. It effectively combines the superiority of the CNN algorithm for high-frequency information feature extraction and the learning ability of the LSTM algorithm for global features of high-frequency information. Meanwhile, the client buffer is divided by the VLAN area division method, which avoids the buffer being too large due to line congestion. The intelligent control module is adopted to change the traditional control concept. In addition, the neural network optimization control module is used for intelligent control, which ensures the feedback speed of the control terminal and avoids the problem of increasing the buffer area caused by the feedback time difference. The experimental results show that via the method in this paper, the total efficiency of single-channel transmission reaches 96% and the transmission rate reaches 46 bit/s; the total efficiency of multiplex transmission is 89% and the transmission rate reaches 75 bit/s. It is verified that the method proposed in this paper has a fast transmission rate and high efficiency.

Research on Information Extraction of the Dongting Lake Ecological Wetland Based on Genetic Algorithm Optimized Convolutional Neural Network

Dongting Lake is an important lake wetland in China. How to quickly and accurately obtain the basic information of the Dongting Lake ecological wetland is of great + significance for the dynamic monitoring, protection, and sustainable utilization of the wetland. Therefore, this article proposes the information extraction of the Dongting Lake ecological wetland based on genetic algorithm optimized convolutional neural network (GA-CNN), an analysis model combining genetic algorithm (GA) and convolutional neural network (CNN). Firstly, we know the environmental information of Dongting Lake, take Gaofen-1 image as the data source, and use normalized vegetation index and normalized water body index as auxiliary data to preprocess the change detection of remote sensing images to obtain high-precision fitting images. GA-CNN is constructed to efficiently extract the information of the Dongting Lake ecological wetland, and the Relu excitation function is used to improve the phenomenon of gradient disappearance and convergence fluctuation so as to reduce the operation time. Logistic regression is used for feature extraction, and finally the automatic identification and information extraction of the Dongting Lake ecological wetland are realized. The research results show that the method proposed in this article can more deeply dig the information of ground objects, express depth features, and has high accuracy and credibility.

Evaluation and Analysis of Bridge Modal Parameters Under Intelligent Monitoring Environment

After the bridge is completed, the structural materials will be gradually eroded or aged under the influence of climate, temperature, and building environment. Under long-term static and dynamic loads, the structural strength and stiffness of bridge structures, including bridge deck and bridge support, will decrease with the accumulation of time. Bridge modal parameter identification is not only the premise and foundation of health monitoring, but also the main part of bridge structure dynamic identification. Therefore, this paper proposes a bridge modal parameter identification model based on Bayesian method. The model fully considers the uncertainty of parameters and the selection of modal parameters, and identifies more local information through the probability distribution of model parameters and a posteriori confidence. The reliability of the bridge is monitored in real time through the Bayesian dynamic model, and the monitoring error is only 0.01, which can realize high-precision bridge modal parameter identification.

A Novel Hybrid Model for the Prediction and Classification of Rolling Bearing Condition

Rotating machinery is a key piece of equipment for tremendous engineering operations. Vibration analysis is a powerful tool for monitoring the condition of rotating machinery. Furthermore, vibration signals have the characteristics of time series. Hence, it is necessary to monitor the condition of vibration signal series to avoid any catastrophic failure. To this end, this paper proposes an effective condition monitoring strategy under a hybrid method framework. First, we add variational mode decomposition (VMD) to preprocess the data points listed in a time order into a subseries, namely intrinsic mode functions (IMFs). Then the framework of the hybrid prediction model, namely the autoregressive moving average (ARMA)-artificial neural network (ANN), is adopted to forecast the IMF series. Next, we select the sensitive modes that contain the prime information of the original signal and that can imply the condition of the machinery. Subsequently, we apply the support vector machine (SVM) classification model to identify the multiple condition patterns based on the multi-domain features extracted from sensitive modes. Finally, the vibration signals from the Case Western Reserve University (CWRU) laboratory are utilized to verify the effectiveness of our proposed method. The comparison results demonstrate advantages in prediction and condition monitoring.

A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints

As two important types of generalized convex functions, pseudoconvex and quasiconvex functions appear in many practical optimization problems. The lack of convexity poses some difficulties in solving pseudoconvex optimization with quasiconvex constraint functions. In this paper, we propose a one-layer recurrent neural network for solving such problems. We prove that the state of the proposed neural network is convergent from the feasible region to an optimal solution of the given optimization problem. We show that the proposed neural network has several advantages over the existing neural networks for pseudoconvex optimization. Specifically, the proposed neural network is applicable to optimization problems with quasiconvex inequality constraints as well as affine equality constraints. In addition, parameter matrix inversion is avoided and some assumptions on the objective function and inequality constraints in existing results are relaxed. We demonstrate the superior performance and characteristics of the proposed neural network with simulation results in three numerical examples.

A second-order accelerated neurodynamic approach for distributed convex optimization

Based on the theories of inertial systems, a second-order accelerated neurodynamic approach is designed to solve a distributed convex optimization with inequality and set constraints. Most of the existing approaches for distributed convex optimization problems are usually first-order ones, and it is usually hard to analyze the convergence rate for the state solution of those first-order approaches. Due to the control design for the acceleration, the second-order neurodynamic approaches can often achieve faster convergence rate. Moreover, the existing second-order approaches are mostly designed to solve unconstrained distributed convex optimization problems, and are not suitable for solving constrained distributed convex optimization problems. It is acquired that the state solution of the designed neurodynamic approach in this paper converges to the optimal solution of the considered distributed convex optimization problem. An error function which demonstrates the performance of the designed neurodynamic approach, has a superquadratic convergence. Several numerical examples are provided to show the effectiveness of the presented second-order accelerated neurodynamic approach.

Set Stability and Set Stabilization of Boolean Control Networks Avoiding Undesirable Set

The traditional set stability of Boolean networks (BNs) refers to whether all the states can converge to a given state subset. Different from the existing results, the set stability investigated in this paper is whether all states in a given initial set can converge to a given destination set. This paper studies the set stability and set stabilization avoiding undesirable sets of BNs and Boolean control networks (BCNs), respectively. First, by virtue of the semi-tensor product (STP) of matrices, the dynamics of BNs avoiding a given undesirable set are established. Then, the set reachability and set stability of BNs from the initial set to destination set avoiding an undesirable set are investigated, respectively. Furthermore, the set stabilization of BCNs from the initial set to destination set avoiding a given undesirable set are investigated. Finally, a design method for finding the time optimal set stabilizer is proposed, and an example is provided to illustrate the effectiveness of the results.