实际问题的数据集通常受到各种噪声的影响,超限学习机(extreme learning machine,ELM)对这类数据集进行学习时,表现出预测精度低、预测结果波动大.为了克服该缺陷,采用了能够削弱噪声影响的指数Laplace损失函数.该损失函数是建立在Gaus...实际问题的数据集通常受到各种噪声的影响,超限学习机(extreme learning machine,ELM)对这类数据集进行学习时,表现出预测精度低、预测结果波动大.为了克服该缺陷,采用了能够削弱噪声影响的指数Laplace损失函数.该损失函数是建立在Gauss核函数基础上,具有可微、非凸、有界且能够趋近于Laplace函数的特点.将其引入到超限学习机中,提出了鲁棒超限学习机回归估计(exponential Laplace loss function based robust ELM for regression,ELRELM)模型.利用迭代重赋权算法求解模型的优化问题.在每次迭代中,噪声样本点被赋予较小的权值,能够有效地提高预测精度.真实数据集实验验证了所提出的模型相比较于对比算法具有更优的学习性能和鲁棒性.展开更多
This paper is concerned with a Nash equilibrium(NE)tracking issue in online games with bandit feedback,where cost functions vary with time and agents only have access to the values of these functions at two points dur...This paper is concerned with a Nash equilibrium(NE)tracking issue in online games with bandit feedback,where cost functions vary with time and agents only have access to the values of these functions at two points during each round.A partial-decision information setting is considered,in which agents have only access to the decisions of their neighbors.The primary objective of this paper is to develop a distributed online NE tracking algorithm that ensures sublinear growth of regret with respect to the total round T,under both the bandit feedback and partial-decision information setting.By utilizing a two-point estimator together with the leader-following consensus method,a new distributed online NE tracking algorithm is established with the estimated gradient and local estimated decisions based on the projection gradient-descent method.Moreover,sufficient conditions are derived to guarantee an improved upper bound of dynamic regret compared to existing bandit algorithms.Finally,a simulation example is presented to demonstrate the effectiveness of the proposed algorithm.展开更多
This study examines the bipartite quasi-synchronization(B-Q synchronization)issue of coupled networks with general cooperative-competitive topology and the event-triggered communications between nodes to curb the comm...This study examines the bipartite quasi-synchronization(B-Q synchronization)issue of coupled networks with general cooperative-competitive topology and the event-triggered communications between nodes to curb the communication cost.In the existing literature concerning bipartite synchronization,the network topology is required to be structurally balanced,which necessitates that competitive interactions exist only between two distinct subgroups.In this study,we aim to lengthen the network’s topology to a more general signed network in which antagonistic interactions can exist in the same or different subgroups.According to signed graph theory and the markovian stochastic event-triggering mechanism,the dynamical model of multiple neural networks(MNNs)with structurally unbalanced and markovian event-triggered communication is established.By utilizing the stochastic Lyapunov stability analysis,some adequate criteria for B-Q synchronization of MNNs with the structurally unbalanced graph are obtained;also,a bound for the B-Q synchronization error is provided.As a special case,the bipartite synchronization criteria for MNNs with the structurally balanced graph are also obtained.Finally,two simulations are performed to verify the theoretical result.展开更多
This paper is concerned with the exponential H_∞ filtering problem for a class of discrete-time switched neural networks with random time-varying delays based on the sojourn-probability-dependent method. Using the av...This paper is concerned with the exponential H_∞ filtering problem for a class of discrete-time switched neural networks with random time-varying delays based on the sojourn-probability-dependent method. Using the average dwell time approach together with the piecewise Lyapunov function technique, sufficient conditions are proposed to guarantee the exponential stability for the switched neural networks with random time-varying delays which are characterized by introducing a Bernoulli stochastic variable.Based on the derived H_∞ performance analysis results, the H_∞ filter design is formulated in terms of Linear Matrix Inequalities(LMIs). Finally, two numerical examples are presented to demonstrate the effectiveness of the proposed design procedure.展开更多
This paper concerns the stabilization of switched dynamical networks with logarithmic quantization couplings in a settling time.The switching sequence is constrained by hybrid dwell time. Controller is designed by usi...This paper concerns the stabilization of switched dynamical networks with logarithmic quantization couplings in a settling time.The switching sequence is constrained by hybrid dwell time. Controller is designed by using limited information. Due to the quantization and switching, traditional finite-time analysis methods cannot be utilized directly. By designing multiple Lyapunov functions and constructing comparison systems, a general criterion formulated by matrix inequalities is first given. Then specific conditions in terms of linear matrix inequalities are established by partitioning the dwell time and using convex combination technique. An optimal algorithm is proposed for the estimation of settling time. Numerical simulations are given to verify the effectiveness of the theoretical results.展开更多
This present work uses different methods to synchronize the inertial memristor systems with linear coupling. Firstly, the mathematical model of inertial memristor-based neural networks(IMNNs) with time delay is propos...This present work uses different methods to synchronize the inertial memristor systems with linear coupling. Firstly, the mathematical model of inertial memristor-based neural networks(IMNNs) with time delay is proposed, where the coupling matrix satisfies the diffusion condition, which can be symmetric or asymmetric. Secondly, by using differential inclusion method and Halanay inequality, some algebraic self-synchronization criteria are obtained. Then, via constructing effective Lyapunov functional, designing discontinuous control algorithms, some new sufficient conditions are gained to achieve synchronization of networks. Finally, two illustrative simulations are provided to show the validity of the obtained results, which cannot be contained by each other.展开更多
One of the fundamental problems in pinning control of complex networks is selecting appropriate pinning nodes, such that the whole system is controlled. This is particularly useful for complex networks with huge numbe...One of the fundamental problems in pinning control of complex networks is selecting appropriate pinning nodes, such that the whole system is controlled. This is particularly useful for complex networks with huge numbers of nodes. Recent research has yielded several pinning node selection strategies, which may be efficient. However, selecting a set of pinning nodes and identifying the nodes that should be selected first remain challenging problems. In this paper, we present a network control strategy based on left Perron vector. For directed networks where nodes have the same in-and out-degrees, there has so far been no effective pinning node selection strategy, but our method can find suitable nodes. Likewise, our method also performs well for undirected networks where the nodes have the same degree. In addition, we can derive the minimum set of pinning nodes and the order in which they should be selected for given coupling strengths. Our proofs of these results depend on the properties of non-negative matrices and M-matrices. Several examples show that this strategy can effectively select appropriate pinning nodes, and that it can achieve better results for both directed and undirected networks.展开更多
The use of non-destructive testing(NDT) equipment, such as the falling weight deflectometer(FWD), provides important estimates of road health and helps to optimize road management regimes. However, periodic road testi...The use of non-destructive testing(NDT) equipment, such as the falling weight deflectometer(FWD), provides important estimates of road health and helps to optimize road management regimes. However, periodic road testing and post-processing of the collected data are cumbersome and require much expertise, a considerable amount of time, money, and other resources. This study attempts to develop a reliable prediction method for estimating the deflection basin area of different asphalt pavements using road temperature, load time, and load pressure as main characteristics. The data are obtained from 19 kinds of asphalt pavements on a 2.038-km-long full-scale fleld accelerated pavement testing track named RIOHTrack(Research Institute of Highway Track) in Tongzhou, Beijing. In addition, a chaotic particle swarm algorithm(CPSO) and a segmented regression strategy are proposed in this paper to optimize the XGBoost model. The experiment results of the proposed method are compared with those of classical machine learning algorithms and achieve an average of mean square error and mean absolute error respectively by 5.80 and 1.59.The experiments demonstrate the superiority of the XGBoost algorithm over classical machine learning methods in dealing with nonlinear problems in road engineering. Signiflcantly, the method can reduce the frequency of deflection tests without affecting its estimation accuracy, which is a promising alternative way to facilitate the rapid assessment of pavement conditions.展开更多
This paper focuses on the comparative analysis of bifurcation control approaches for a fractional-order delayed predator-prey system. The state feedback schemes with and without time delay are dexterously designed dur...This paper focuses on the comparative analysis of bifurcation control approaches for a fractional-order delayed predator-prey system. The state feedback schemes with and without time delay are dexterously designed during the bifurcation control for the proposed system, and the comparative study is elaborately performed on bifurcation control theoretically. The salient feature of the current paper is that the analysis of time of bifurcation control for the proposed system is investigated based on various state feedback control strategies. Analysis reveals that the feedback control approach without time delay overly outmatches the one with time delay for bifurcation control in the considered systems so long as the uniform feedback gain is selected. It consumes less time to control bifurcation while utilizing the first controller in comparison with the second one. Numerical examples are ultimately employed to confirm the correctness of the theoretical results.展开更多
This paper addresses the bipartite consensus over cooperation-competition networks affected by denial-of-service(DoS) attacks.Consider that a network consists of multiple interactive agents, and the relationship betwe...This paper addresses the bipartite consensus over cooperation-competition networks affected by denial-of-service(DoS) attacks.Consider that a network consists of multiple interactive agents, and the relationship between neighboring agents is cooperative or competitive. Meanwhile, information transmission among the agents is unavailable during the intervals of attacks. In order to save communication resources and exclude the Zeno behavior, an event-triggered scheme depending on the sampled-data information from neighboring agents is proposed, and efficient defense strategies in response to the attacks are put forward.Suppose that the frequency and duration of DoS attacks meet certain requirements, then according to the signed graph theory,the La Salle’s invariance principle, and the convergence of monotone sequences, the results of bipartite consensus via the eventtriggered protocol are provided, which are mainly related to the communication topology of the network, the sampling period,and the threshold parameters in the event-triggered scheme. It is shown that the bipartite consensus is realized even though the DoS attacks take place frequently. Furthermore, this paper discusses the bipartite consensus in the presence of DoS attacks with a random unsuccessful rate. Finally, numerical simulations illustrate the theoretical results.展开更多
The basic conception and theoretical system of smart metro are not clear and there is not a unified understanding at the academic level.Based on this fact,there is no guidance of the smart metro construction.Therefore...The basic conception and theoretical system of smart metro are not clear and there is not a unified understanding at the academic level.Based on this fact,there is no guidance of the smart metro construction.Therefore,this paper conducts a complete and systemic research on several basic theoretical issues of smart metro,such as the development history,concept,connotation,characteristics,evolution stages,system architecture and main construction content.Firstly,the internal and external development demands are analyzed in this paper.In addition,the subject-cycle-function(SCF)model of smart metro concept is obtained.Moreover,the essential connotation,three typical characteristics and the evolution process of smart metro are introduced.Furthermore,the evolution relationships of main function,achievement goal,instrument subject,decision subject,control subject and factor relationship for every evolution stage are clarified.Finally,according to the theory of system engineering,the three-hierarchy system architecture and five main construction contents are proposed.The both can be used to construct the technical system of smart metro at the academic level,and provide theoretical support and technical guidance for promoting the development of smart metro construction in China.展开更多
This paper focuses on the vector traffic network equilibrium problem with demands uncertainty and capacity constraints of arcs, in which, the demands are not exactly known and assumed as a discrete set that contains f...This paper focuses on the vector traffic network equilibrium problem with demands uncertainty and capacity constraints of arcs, in which, the demands are not exactly known and assumed as a discrete set that contains finite scenarios. For different scenario, the demand may be changed, which seems much more reasonable in practical programming. By using the linear scalarization method,we introduce several definitions of parametric equilibrium flows and reveal their mutual relations. Meanwhile, the relationships between the scalar variational inequality as well as the(weak) vector equilibrium flows are explored, meanwhile, some necessary and sufficient conditions that ensure the(weak) vector equilibrium flows are also considered. Additionally, by means of nonlinear scalarization functionals, two kinds of equilibrium principles are derived. All of the derived conclusions contain the demands uncertainty and capacity constraints of arcs, thus the results proposed in this paper improved some existing works. Finally, some numerical examples are employed to show the merits of the improved conclusions.展开更多
文摘实际问题的数据集通常受到各种噪声的影响,超限学习机(extreme learning machine,ELM)对这类数据集进行学习时,表现出预测精度低、预测结果波动大.为了克服该缺陷,采用了能够削弱噪声影响的指数Laplace损失函数.该损失函数是建立在Gauss核函数基础上,具有可微、非凸、有界且能够趋近于Laplace函数的特点.将其引入到超限学习机中,提出了鲁棒超限学习机回归估计(exponential Laplace loss function based robust ELM for regression,ELRELM)模型.利用迭代重赋权算法求解模型的优化问题.在每次迭代中,噪声样本点被赋予较小的权值,能够有效地提高预测精度.真实数据集实验验证了所提出的模型相比较于对比算法具有更优的学习性能和鲁棒性.
基金supported by the National Natural Science Foundation of China(Grant Nos.62173087,62176056,and 61833005)the Fundamental Research Funds for the Central Universities+2 种基金in part by the Alexander von Humboldt Foundation of Germanysupported by Zhi Shan Youth Scholar Program from Southeast Universityby Young Elite Scientists Sponsorship Program by CAST(Grant No.2021QNRC001)。
文摘This paper is concerned with a Nash equilibrium(NE)tracking issue in online games with bandit feedback,where cost functions vary with time and agents only have access to the values of these functions at two points during each round.A partial-decision information setting is considered,in which agents have only access to the decisions of their neighbors.The primary objective of this paper is to develop a distributed online NE tracking algorithm that ensures sublinear growth of regret with respect to the total round T,under both the bandit feedback and partial-decision information setting.By utilizing a two-point estimator together with the leader-following consensus method,a new distributed online NE tracking algorithm is established with the estimated gradient and local estimated decisions based on the projection gradient-descent method.Moreover,sufficient conditions are derived to guarantee an improved upper bound of dynamic regret compared to existing bandit algorithms.Finally,a simulation example is presented to demonstrate the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China(Grant Nos.62073122,61833005 and 11872175)the Outstanding Youth Scienceof Henan Province(Grant No.222300420022)the Key Program of Higher Education of Henan Province(Grant No.21A120001)。
文摘This study examines the bipartite quasi-synchronization(B-Q synchronization)issue of coupled networks with general cooperative-competitive topology and the event-triggered communications between nodes to curb the communication cost.In the existing literature concerning bipartite synchronization,the network topology is required to be structurally balanced,which necessitates that competitive interactions exist only between two distinct subgroups.In this study,we aim to lengthen the network’s topology to a more general signed network in which antagonistic interactions can exist in the same or different subgroups.According to signed graph theory and the markovian stochastic event-triggering mechanism,the dynamical model of multiple neural networks(MNNs)with structurally unbalanced and markovian event-triggered communication is established.By utilizing the stochastic Lyapunov stability analysis,some adequate criteria for B-Q synchronization of MNNs with the structurally unbalanced graph are obtained;also,a bound for the B-Q synchronization error is provided.As a special case,the bipartite synchronization criteria for MNNs with the structurally balanced graph are also obtained.Finally,two simulations are performed to verify the theoretical result.
基金supported by the National Natural Science Foundation of China(Grant Nos.61573096 and 61272530)the Natural Science Foundation of Jiangsu Province of China(Grant No.BK2012741)the 333 Engineering Foundation of Jiangsu Province of China(Grant No.BRA2015286)
文摘This paper is concerned with the exponential H_∞ filtering problem for a class of discrete-time switched neural networks with random time-varying delays based on the sojourn-probability-dependent method. Using the average dwell time approach together with the piecewise Lyapunov function technique, sufficient conditions are proposed to guarantee the exponential stability for the switched neural networks with random time-varying delays which are characterized by introducing a Bernoulli stochastic variable.Based on the derived H_∞ performance analysis results, the H_∞ filter design is formulated in terms of Linear Matrix Inequalities(LMIs). Finally, two numerical examples are presented to demonstrate the effectiveness of the proposed design procedure.
基金supported by the National Natural Science Foundation of China(Grants Nos.61673078,61573096,61273220&61472257)
文摘This paper concerns the stabilization of switched dynamical networks with logarithmic quantization couplings in a settling time.The switching sequence is constrained by hybrid dwell time. Controller is designed by using limited information. Due to the quantization and switching, traditional finite-time analysis methods cannot be utilized directly. By designing multiple Lyapunov functions and constructing comparison systems, a general criterion formulated by matrix inequalities is first given. Then specific conditions in terms of linear matrix inequalities are established by partitioning the dwell time and using convex combination technique. An optimal algorithm is proposed for the estimation of settling time. Numerical simulations are given to verify the effectiveness of the theoretical results.
基金supported by the National Natural Science Foundation of China(Grant Nos.61573096,61374079 and 61603125)the Chinese Scholarship Council(Grent No.201708410029)+1 种基金the"333 Engineering"Foundation of Jiangsu Province of China(Grant No.BRA2015286)Key Program of Henan Universities(Grant No.17A120001)
文摘This present work uses different methods to synchronize the inertial memristor systems with linear coupling. Firstly, the mathematical model of inertial memristor-based neural networks(IMNNs) with time delay is proposed, where the coupling matrix satisfies the diffusion condition, which can be symmetric or asymmetric. Secondly, by using differential inclusion method and Halanay inequality, some algebraic self-synchronization criteria are obtained. Then, via constructing effective Lyapunov functional, designing discontinuous control algorithms, some new sufficient conditions are gained to achieve synchronization of networks. Finally, two illustrative simulations are provided to show the validity of the obtained results, which cannot be contained by each other.
基金supported by the National Natural Science Foundation of China(Grant Nos.61573096,61374011,61833005)the China Postdoctoral Science Foundation(Grant No.2014M561557)+1 种基金the Shandong Province University Scientific Research Project of China(Grant No.J15LI12)the Postdoctoral Science Foundation of Jiangsu Province of China(Grant No.1402040B)
文摘One of the fundamental problems in pinning control of complex networks is selecting appropriate pinning nodes, such that the whole system is controlled. This is particularly useful for complex networks with huge numbers of nodes. Recent research has yielded several pinning node selection strategies, which may be efficient. However, selecting a set of pinning nodes and identifying the nodes that should be selected first remain challenging problems. In this paper, we present a network control strategy based on left Perron vector. For directed networks where nodes have the same in-and out-degrees, there has so far been no effective pinning node selection strategy, but our method can find suitable nodes. Likewise, our method also performs well for undirected networks where the nodes have the same degree. In addition, we can derive the minimum set of pinning nodes and the order in which they should be selected for given coupling strengths. Our proofs of these results depend on the properties of non-negative matrices and M-matrices. Several examples show that this strategy can effectively select appropriate pinning nodes, and that it can achieve better results for both directed and undirected networks.
基金supported by the National Key Research and Development Program of China (Grant No. 2020YFA0714300)the National Natural Science Foundation of China (Grant Nos. 61833005 and 62003084)the Natural Science Foundation of Jiangsu Province of China (Grant No.BK20200355)。
文摘The use of non-destructive testing(NDT) equipment, such as the falling weight deflectometer(FWD), provides important estimates of road health and helps to optimize road management regimes. However, periodic road testing and post-processing of the collected data are cumbersome and require much expertise, a considerable amount of time, money, and other resources. This study attempts to develop a reliable prediction method for estimating the deflection basin area of different asphalt pavements using road temperature, load time, and load pressure as main characteristics. The data are obtained from 19 kinds of asphalt pavements on a 2.038-km-long full-scale fleld accelerated pavement testing track named RIOHTrack(Research Institute of Highway Track) in Tongzhou, Beijing. In addition, a chaotic particle swarm algorithm(CPSO) and a segmented regression strategy are proposed in this paper to optimize the XGBoost model. The experiment results of the proposed method are compared with those of classical machine learning algorithms and achieve an average of mean square error and mean absolute error respectively by 5.80 and 1.59.The experiments demonstrate the superiority of the XGBoost algorithm over classical machine learning methods in dealing with nonlinear problems in road engineering. Signiflcantly, the method can reduce the frequency of deflection tests without affecting its estimation accuracy, which is a promising alternative way to facilitate the rapid assessment of pavement conditions.
基金supported by the Nanhu Scholars Program for Young Scholars of XYNU
文摘This paper focuses on the comparative analysis of bifurcation control approaches for a fractional-order delayed predator-prey system. The state feedback schemes with and without time delay are dexterously designed during the bifurcation control for the proposed system, and the comparative study is elaborately performed on bifurcation control theoretically. The salient feature of the current paper is that the analysis of time of bifurcation control for the proposed system is investigated based on various state feedback control strategies. Analysis reveals that the feedback control approach without time delay overly outmatches the one with time delay for bifurcation control in the considered systems so long as the uniform feedback gain is selected. It consumes less time to control bifurcation while utilizing the first controller in comparison with the second one. Numerical examples are ultimately employed to confirm the correctness of the theoretical results.
基金supported by the National Natural Science Foundation of China (Grant Nos. 61833005,and 11972156)the Natural Science Foundation of Jiangsu Province (Grant No. BK20181342)the work of J.H.Park was supported by the National Research Foundation of Korea (NRF)and the Korea Government (MSIT)(Grant No. 2020R1A2B5B02002002)。
文摘This paper addresses the bipartite consensus over cooperation-competition networks affected by denial-of-service(DoS) attacks.Consider that a network consists of multiple interactive agents, and the relationship between neighboring agents is cooperative or competitive. Meanwhile, information transmission among the agents is unavailable during the intervals of attacks. In order to save communication resources and exclude the Zeno behavior, an event-triggered scheme depending on the sampled-data information from neighboring agents is proposed, and efficient defense strategies in response to the attacks are put forward.Suppose that the frequency and duration of DoS attacks meet certain requirements, then according to the signed graph theory,the La Salle’s invariance principle, and the convergence of monotone sequences, the results of bipartite consensus via the eventtriggered protocol are provided, which are mainly related to the communication topology of the network, the sampling period,and the threshold parameters in the event-triggered scheme. It is shown that the bipartite consensus is realized even though the DoS attacks take place frequently. Furthermore, this paper discusses the bipartite consensus in the presence of DoS attacks with a random unsuccessful rate. Finally, numerical simulations illustrate the theoretical results.
基金supported by the National Key R&D Program of China (Grant Nos. 2016YFB1200402 & 2018YFB2101002)the Beijing Top-notch Talent Program (Grant No. 2011AA040202)the Key Projects of the National Natural Science Foundation of China (Grant No. 61833005)
文摘The basic conception and theoretical system of smart metro are not clear and there is not a unified understanding at the academic level.Based on this fact,there is no guidance of the smart metro construction.Therefore,this paper conducts a complete and systemic research on several basic theoretical issues of smart metro,such as the development history,concept,connotation,characteristics,evolution stages,system architecture and main construction content.Firstly,the internal and external development demands are analyzed in this paper.In addition,the subject-cycle-function(SCF)model of smart metro concept is obtained.Moreover,the essential connotation,three typical characteristics and the evolution process of smart metro are introduced.Furthermore,the evolution relationships of main function,achievement goal,instrument subject,decision subject,control subject and factor relationship for every evolution stage are clarified.Finally,according to the theory of system engineering,the three-hierarchy system architecture and five main construction contents are proposed.The both can be used to construct the technical system of smart metro at the academic level,and provide theoretical support and technical guidance for promoting the development of smart metro construction in China.
基金supported by the National Natural Science Foundation of China(Grant Nos.61573096,61272530 and 61573106)the Natural Science Foundation of Jiangsu Province of China(Grant No.BK2012741)the “333 Engineering” Foundation of Jiangsu Province of China(Grant No.BRA2015286)
文摘This paper focuses on the vector traffic network equilibrium problem with demands uncertainty and capacity constraints of arcs, in which, the demands are not exactly known and assumed as a discrete set that contains finite scenarios. For different scenario, the demand may be changed, which seems much more reasonable in practical programming. By using the linear scalarization method,we introduce several definitions of parametric equilibrium flows and reveal their mutual relations. Meanwhile, the relationships between the scalar variational inequality as well as the(weak) vector equilibrium flows are explored, meanwhile, some necessary and sufficient conditions that ensure the(weak) vector equilibrium flows are also considered. Additionally, by means of nonlinear scalarization functionals, two kinds of equilibrium principles are derived. All of the derived conclusions contain the demands uncertainty and capacity constraints of arcs, thus the results proposed in this paper improved some existing works. Finally, some numerical examples are employed to show the merits of the improved conclusions.