Synchronization of Multi-links Memristor-Based Switching Networks Under Uniform Random Attacks

A variety of influence factors are common to the support networks which are used as cyber-physical systems. In this paper, we consider the problem of finite-time and exponential synchronization for the memristor-based switching networks (MSNs) with multi-links and multiple time-varying delays under uniform random attacks via asymptotic controller and adaptive controller. We propose a more general system model and utilize an analytical method which is different from the classical analytical techniques like set-valued mappings technique and differential inclusions to preprocess the MSNs to a class of switching networks with some uncertain parameters. Then, based on appropriate Lyaponov functionals and linear matrix inequality, several useful criteria ensuring the finite-time synchronization or asymptotic synchronization of MSNs with multi-links and time-varying delays under uniform random attacks via designed control law are obtained. Finally, two numerical examples are designed to show the feasibility and the correctness of our proposed results.     

Exponential stabilisation of memristive neural networks under intermittent output feedback control

In this paper, the exponential stabilisation problem is studied for a general class of memristive time-varying delayed neural networks under periodically intermittent output feedback control. First, the periodically intermittent output feedback control rule is designed for the exponential stabilisation of the memristive time-varying delayed neural networks. Then, we derive stabilisation criteria so that the memristive time-varying delayed neural networks are exponentially stable. By the mathematical induction method and constructing suitable Lyapunov–Krasovskii functionals, some easy-to-check criteria are obtained to ensure the exponential stabilisation of memristive time-varying delayed neural networks. Finally, two numerical simulation examples are given to illustrate the validity of the obtained results.     

具反应扩散混合时滞Cohen-Grossberg神经网络的指数耗散性

利用扩散算子特性、M-矩阵性质和不等式分析技巧,在不要求神经网络激励函数的有界性、单调性、可微性以及平均时滞有界性的弱保守条件下,研究了一类具有反应扩散混合时滞的非自治Cohen-Grossberg神经网络的实不变集、全局指数稳定性和指数耗散性,并给出了相关的充分性条件.文中所使用的方法摒弃了常规构造适当的Lyapunov泛函的方法,克服了Lyapunov泛函难构造的困难,且得到的结果扩展和改进了其他文献结果.最后给出了一个数值例子来说明所得结果的有效性.     

Constrained surface interpolation by means of a genetic algorithm

We propose an evolutionary technique (a genetic algorithm) to solve heavily constrained optimization problems defined on interpolating tensor product surfaces by adjusting the parameter values associated with the data points to be interpolated. Throughout our study we assume that the functional, which operates on these types of interpolating surfaces, is described by a surface integral and fulfills the following conditions: it is not necessarily a smooth functional (i.e., it may have vanishing gradient vectors), it is bounded (i.e., the optimization algorithm can converge in a finite number of steps), it is invariant under parametrization, rigid body transformation and uniform scaling (i.e., different surface parametrization at different scales should generate the same optimized shape). We have successfully tested the proposed algorithm for functionals that involve: minimal surface area, minimal Willmore, umbilic deviation and total curvature energies, minimal third-order scale invariant weighted Mehlum–Tarrou energies, and isoperimetric like problems. In general, our algorithm can be used in the case of any kind of not necessarily smooth surface fairing functionals. The run-time and memory complexities of the suggested algorithm are reasonable. Moreover, the algorithm is independent of the type of tensor product surface.     

Relaxed delay-dependent exponential stability condition for a class of neural networks with polytopic uncertainties and distributed delays

The global robust exponential stability of a class of neural networks with polytopic uncertainties and distributed delays is investigated in this paper.Parameter-dependent Lypaunov-Krasovskii functionals and free-weighting matrices are employed to obtain sufficient condition that guarantee the robust global exponential stability of the equilibrium point of the considered neural networks.The derived sufficient condition is proposed in terms of a set of relaxed linear matrix inequalities (LMIs),which can be checked easily by recently developed algorithms solving LMIs.A numerical example is given to demonstrate the effectiveness of the proposed criteria.     

时变时滞不确定性神经网络的被动性准则

研究具有时变时滞不确定性神经网络的被动性问题。通过构造适当的Lyapunov泛函并利用一些分析技巧,给出一个新的条件,以确保与时变延迟的不确定性神经网络的被动性。被动条件以线性矩阵不等式(LMI)表示,可以很容易地通过有效内点算法进行求解。通过一个数例证明了该方法的有效性。     

On learning vector-valued functions

In this letter, we provide a study of learning in a Hilbert space of vectorvalued functions. We motivate the need for extending learning theory of scalar-valued functions by practical considerations and establish some basic results for learning vector-valued functions that should prove useful in applications. Specifically, we allow an output space Y to be a Hilbert space, and we consider a reproducing kernel Hilbert space of functions whose values lie in Y. In this setting, we derive the form of the minimal norm interpolant to a finite set of data and apply it to study some regularization functionals that are important in learning theory. We consider specific examples of such functionals corresponding to multiple-output regularization networks and support vector machines, for both regression and classification. Finally, we provide classes of operator-valued kernels of the dot product and translation-invariant type.     

On the learning dynamics of two-layer quadratic neural networks for understanding deep learning

Deep learning performs as a powerful paradigm in many real-world applications; however, its mechanism remains much of a mystery. To gain insights about nonlinear hierarchical deep networks, we theoretically describe the coupled nonlinear learning dynamic of the two-layer neural network with quadratic activations, extending existing results from the linear case. The quadratic activation, although rarely used in practice, shares convexity with the widely used ReLU activation, thus producing similar dynamics. In this work, we focus on the case of a canonical regression problem under the standard normal distribution and use a coupled dynamical system to mimic the gradient descent method in the sense of a continuous-time limit, then use the high order moment tensor of the normal distribution to simplify these ordinary differential equations. The simplified system yields unexpected fixed points. The existence of these non-global-optimal stable points leads to the existence of saddle points in the loss surface of the quadratic networks. Our analysis shows there are conserved quantities during the training of the quadratic networks. Such quantities might result in a failed learning process if the network is initialized improperly. Finally, We illustrate the comparison between the numerical learning curves and the theoretical one, which reveals the two alternately appearing stages of the learning process.     

Global Passivity Analysis of Interval Neural Networks with Discrete and Distributed Delays of Neutral Type

This paper is concerned with delay-dependent passivity analysis for delayed neural networks (DNNs) of neutral type. We first discuss the passivity conditions for DNNs without uncertainties and then extend this result to the case of interval uncertainties. By partitioning the delay intervals into multiple equidistant subintervals, some appropriate Lyapunov-Krasovskii functionals (LKFs) are constructed on these intervals. Considering these new LKFs and using free-weighting matrix approach, several new passivity criteria are proposed in terms of linear matrix inequalities, which are dependent on the size of the time delay. Finally, five numerical examples are given to illustrate the effectiveness and less conservatism of the developed techniques.     

Core Lines in 3D Second‐Order Tensor Fields

Vortices are important features in vector fields that show a swirling behavior around a common core. The concept of a vortex core line describes the center of this swirling behavior. In this work, we examine the extension of this concept to 3D second‐order tensor fields. Here, a behavior similar to vortices in vector fields can be observed for trajectories of the eigenvectors. Vortex core lines in vector fields were defined by Sujudi and Haimes to be the locations where stream lines are parallel to an eigenvector of the Jacobian. We show that a similar criterion applied to the eigenvector trajectories of a tensor field yields structurally stable lines that we call tensor core lines. We provide a formal definition of these structures and examine their mathematical properties. We also present a numerical algorithm for extracting tensor core lines in piecewise linear tensor fields. We find all intersections of tensor core lines with the faces of a dataset using a simple and robust root finding algorithm. Applying this algorithm to tensor fields obtained from structural mechanics simulations shows that it is able to effectively detect and visualize regions of rotational or hyperbolic behavior of eigenvector trajectories.     

Some theorems on linear positive operators and functionals and their applications

In this paper, we prove two theorems concerning linear positive operators and functionals in a very general sense. We show how these results can be used to derive new results in a wide range of applications from approximation theory, to the numerical treatment of differential equations and to the numerical analysis connected with signals and images.     

Restoration of matrix fields by second-order cone programming

Summary Wherever anisotropic behavior in physical measurements or models is encountered matrices provide adequate means to describe this anisotropy. Prominent examples are the diffusion tensor magnetic resonance imaging in medical imaging or the stress tensor in civil engineering. As most measured data these matrix-valued data are also polluted by noise and require restoration. The restoration of scalar images corrupted by noise via minimization of an energy functional is a well-established technique that offers many advantages. A convenient way to achieve this minimization is second-order cone programming (SOCP). The goal of this article is to transfer this method to the matrix-valued setting. It is shown how SOCP can be applied to minimize various energy functionals defined for matrix fields. These functionals couple the different matrix channels taking into account the relations between them. Furthermore, new functionals for the regularization of matrix data are proposed and the corresponding Euler–Lagrange equations are derived by means of matrix differential calculus. Numerical experiments substantiate the usefulness of the proposed methods for the restoration of matrix fields.      

A delay decomposition approach to delay-dependent passivity analysis for interval neural networks with time-varying delay

This paper is concerned with delay-dependent passivity analysis for interval neural networks with time-varying delay. By decomposing the delay interval into multiple equidistant subintervals, new Lyapunov-Krasovskii functionals (LKFs) are constructed on these intervals. Employing these new LKFs, a new passivity criterion is proposed in terms of linear matrix inequalities, which is dependent on the size of the time delay. Finally, some numerical examples are given to illustrate the effectiveness of the developed techniques.     

Indexed families of functionals and gaussian radial basis functions

We report on results concerning the capabilities of gaussian radial basis function networks in the setting of inner product spaces that need not be finite dimensional. Specifically, we show that important indexed families of functionals can be uniformly approximated, with the approximation uniform also with respect to the index. Applications are described concerning the classification of signals and the synthesis of reconfigurable classifiers.     

Surface Fairing towards Regular Principal Curvature Line Networks

Freeform surfaces whose principal curvature line network is regularly distributed, are essential to many real applications like CAD modeling, architecture design, and industrial fabrication. However, most designed surfaces do not hold this nice property because it is hard to enforce such constraints in the design process. In this paper, we present a novel method for surface fairing which takes a regular distribution of the principal curvature line network on a surface as an objective. Our method first removes the high‐frequency signals from the curvature tensor field of an input freeform surface by a novel rolling guidance tensor filter, which results in a more regular and smooth curvature tensor field, then deforms the input surface to match the smoothed field as much as possible. As an application, we solve the problem of approximating freeform surfaces with regular principal curvature line networks, discretized by quadrilateral meshes. By introducing the circular or conical conditions on the quadrilateral mesh to guarantee the existence of discrete principal curvature line networks, and minimizing the approximate error to the original surface and improving the fairness of the quad mesh, we obtain a regular discrete principal curvature line network that approximates the original surface. We evaluate the efficacy of our method on various freeform surfaces and demonstrate the superiority of the rolling guidance tensor filter over other tensor smoothing techniques. We also utilize our method to generate high‐quality circular/conical meshes for architecture design and cyclide spline surfaces for CAD modeling.     

Passivity analysis of impulsive complex networks

In this paper, we first investigate input passivity and output passivity for a class of impulsive complex networks with time-varying delays. By constructing suitable Lyapunov functionals, some input passivity and output passivity conditions are derived for the impulsive complex networks. Finally, an example is given to show the effectiveness of the proposed criteria.     

State Estimation of Quaternion-Valued Neural Networks with Leakage Time Delay and Mixed Two Additive Time-Varying Delays

In this paper, the state estimation of quaternion-valued neural networks (QVNNs) with leakage time delay, both discrete and distributed two additive time-varying delays is studied. By considering the QVNNs as a whole, instead of decomposing it into two complex-valued neural networks or four real-valued neural networks. Via constructing suitable Lyapunov–Krasovskii functionals, combining free weight matrix, reciprocally convex approach, and matrix inequalities, the sufficient criteria for time delays are given in the form of quaternion-valued linear matrix inequalities and complex-valued linear matrix inequalities. Some observable output measurements are used to estimate the state of neurons, which ensures the global asymptotic stability of the error-state system. Finally, the effectiveness of theoretical analysis is illustrated by a numerical simulation.

     

Passivity and Pinning Passivity of Coupled Delayed Reaction–Diffusion Neural Networks with Dirichlet Boundary Conditions

This paper respectively considers passivity problem and pinning passivity problem for coupled delayed reaction–diffusion neural networks (CDRDNNs). By construction of appropriate Lyapunov functionals and utilization of inequality techniques, several passivity conditions are derived for the CDRDNNs. Moreover, the pinning control technique is developed to obtain some passivity criteria for CDRDNNs. Finally, two numerical examples are also provided to verify the correctness of the theoretical results.     

State Estimation for Discrete-Time Neural Networks with Markov-Mode-Dependent Lower and Upper Bounds on the Distributed Delays

This paper is concerned with the state estimation problem for a new class of discrete-time neural networks with Markovian jumping parameters and mixed time-delays. The parameters of the neural networks under consideration switch over time subject to a Markov chain. The networks involve both the discrete-time-varying delay and the mode-dependent distributed time-delay characterized by the upper and lower boundaries dependent on the Markov chain. By constructing novel Lyapunov-Krasovskii functionals, sufficient conditions are firstly established to guarantee the exponential stability in mean square for the addressed discrete-time neural networks with Markovian jumping parameters and mixed time-delays. Then, the state estimation problem is coped with for the same neural network where the goal is to design a desired state estimator such that the estimation error approaches zero exponentially in mean square. The derived conditions for both the stability and the existence of desired estimators are expressed in the form of matrix inequalities that can be solved by the semi-definite programme method. A numerical simulation example is exploited to demonstrate the usefulness of the main results obtained.     

Global asymptotic stability of high-order Hopfield type neural networks with time delays

This paper studies the problem of global asymptotic stability of a class of high-order Hopfield type neural networks with time delays. By utilizing Lyapunov functionals, we obtain some sufficient conditions for the global asymptotic stability of the equilibrium point of such neural networks in terms of linear matrix inequality (LMI). Numerical examples are given to illustrate the advantages of our approach.