首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 218 毫秒
1.
The current paper addresses leader-following guaranteed cost synchronization with the cost budget given previously for the second-order wireless sensor networks. The published researches on guaranteed cost synchronization design criteria usually are based on the linear matrix inequality (LMI) techniques and cannot take the cost budget given previously into consideration. Firstly, the current paper proposes a guaranteed cost synchronization protocol, which can realize the tradeoff design between the battery power consumption and the synchronization regulation performance. Secondly, for the case without the given cost budget, sufficient conditions for leader-following guaranteed cost synchronization are presented and an upper bound of the cost function is shown. Thirdly, for the case that the cost budget is given previously, the criterion for leader-following guaranteed cost synchronization is proposed. Especially, the value ranges of control gains in these criteria are determined, which means that the existence of control gains in synchronization criteria can be guaranteed, but the LMI techniques can only determine the gain matrix and cannot give the value ranges of control gains. Moreover, these criteria are only associated with the minimum nonzero eigenvalue and the maximum eigenvalue, which can ensure the scalability of the wireless sensor networks. Finally, numerical simulations are given to illustrate theoretical results.  相似文献   

2.
This paper concerns the stability analysis problem for stochastic delayed switched genetic regulatory networks (GRNs) with both stable and unstable subsystems. By employing the piecewise Lyapunov functional method combined with the average dwell time approach, we show that if the average dwell time is chosen sufficiently large and the derivative of the Lyapunov-like function for unstable subsystems is bounded by certain kind of continuous function, then exponential stability criteria of a desired degree are guaranteed. The derived results show that the minimal average dwell time is proportional to the time delays. Finally, an example is given to illustrate the effectiveness of the derived results.  相似文献   

3.
This paper is devoted to solving the recursive state estimation (RSE) issue for a class of complex networks (CNs) with Round-Robin (RR) protocol and switching nonlinearities (SNs). A random variable obeying the Bernoulli distribution with known statistical properties is introduced to describe the switching phenomenon between two nonlinear functions. A Gaussian noise and time-varying outer coupling strength are adopted to show the changeable network topology (CNT). The RR protocol is applied to regulate signal transmissions, which determines that the element in measurement output has access to the communication networks at each step. The purpose of this paper is to construct a recursive state estimator such that, for all SNs, time-varying topology and RR protocol, the expected state estimation performance is guaranteed. Specifically, based on two recursive matrix equations, the covariance upper bound (CUB) of state estimation error is obtained firstly and then minimized via designing estimator gain in a proper way. Moreover, a feasible criterion is given to guarantee that the trace of obtained CUB is bounded and a monotonicity relationship is established between state estimation error and time-varying outer coupling strength. Lastly, a simulation experiment is illustrated to verify the feasibility of the addressed estimation method.  相似文献   

4.
This paper deals with the problem of non-fragile guaranteed cost control for a class of uncertain stochastic nonlinear time-delay systems. The parametric uncertainties are assumed to be time-varying and norm bounded. The time-delay factors are unknown and time-varying with known bounds. The aim of this paper is to design a memoryless non-fragile state feedback control law such that the closed-loop system is stochastically asymptotically stable in the mean square for all admissible parameter uncertainties and the closed-loop cost function value is not more than a specified upper bound. A new sufficient condition for the existence of such controllers is presented based on the linear matrix inequality (LMI) approach. Then, a convex optimization problem is formulated to select the optimal guaranteed cost controller which minimizes the upper bound of the closed-loop cost function. Numerical example is given to illustrate the effectiveness of the developed techniques.  相似文献   

5.
Competitive neural networks(CNNs) has not been well developed in nonlinear fractional order dynamical system, which is developed first time in this paper. Then, by means of a proper Lyapunov functional, asymptotic expansion of Mittag-Leffler function properties, together with some Caputo derivative properties, the testable novel sufficient conditions are given to guarantee the existence, uniqueness of the equilibrium point as well as global asymptotic stability for a class of fractional order competitive neural networks (FOCNNs) are all derived in the form of matrix elements. Furthermore, the boundedness for the solution of FOCNN is presented by employing Cauchy–Schwartz inequality and Gronwall inequality. Besides, a linear feedback control and adaptive feedback control are designed to achieve the global asymptotic synchronization criterion for FOCNNs with time delay and these explored consequences are extended from some previous integer order CNNs output. At last, two numerical simulations are performed to illustrate the effectiveness of our proposed theoretical results.  相似文献   

6.
Solutions for pulsatile fully developed flow of Newtonian viscous fluid in a straight rectangular channel can be synthesized from analytic solutions of steady flow and oscillatory flow. A new steady solution is presented that is valid for all duct aspect ratios. Also new oscillatory solutions are given, showing dependence on a “viscous diffusion length”, the square root of the kinematic viscosity divided by frequency.  相似文献   

7.
In this paper, the mean-square exponential synchronization of stochastic multilayer networks with white-noise-based time-varying coupling is investigated via intermittent dynamic periodic event-triggered control. The existence of a dynamic term can reduce the number of event triggers. Furthermore, by introducing periodic sampling mechanism, a minimum inter-execution time is guaranteed to avoid Zeno phenomenon. Additionally, by employing Lyapunov method, graph theory, and stochastic analysis techniques, synchronization criteria for multilayer networks under intermittent dynamic periodic event-triggered control are established. To clarify the process of synchronization of multilayer networks, a brief framework is developed on the basis of Tajan’s algorithm. Ultimately, theoretical results are applied into Chua’s circuits and corresponding numerical simulations are given to illustrate the effectiveness and feasibility of the results.  相似文献   

8.
This paper revisits the observer-based positive edge consensus problem for nodal networks. So far, existing positive edge consensus of directed networks with less conservative connectivity conditions have to use the global topology information. On the other hand, instead of using global topology information, the positive consensus conditions using the bounds of the eigenvalues of the Laplacian matrix are conservative. To tackle these problems, less conservative bounds of the eigenvalues of the Laplacian matrix are presented. Based on a general distributed observer-based approach, the necessary and sufficient conditions of the edge consensus are derived. And then, with the improved bounds of the Laplacian eigenvalues, less conservative sufficient conditions without using global topology information are given. By solving the algebraic Riccati inequalities, semi-definite programming algorithms are developed to obtain the solutions. Finally, simulation results are also given to illustrate the given results.  相似文献   

9.
The main goal of this study is to investigate a minimal energy rest-to-rest maneuvering control problem with open final time of a rigid spacecraft actuated by three orthogonal momentum wheels. Different from conventional shooting methods, this control problem is formulated and solved as a constrained nonlinear programming (NLP) one by utilizing an iterative procedure. In this novel method, the count of control steps is fixed initially and the sampling period is treated as a variable in the optimization process. An approach to find the initial feasible solutions of the NLP problem is also proposed. Since initial feasible solutions can be found easily, the optimization process of the NLP problem can be started from different points to find the minimal energy rest-to-rest maneuver of the rigid spacecraft between two attitudes. To show the feasibility of the proposed method, simulation results are included for illustration.  相似文献   

10.
Novel stability criterion is presented for the existence, uniqueness and globally asymptotic stability of the equilibrium point of a class of cellular neural networks with time-varying delays. Based on Gu's discretized Lyapunov–Krasovskii functional (LKF) theory, a novel vector LKF is introduced by dividing the variation interval of the time delay into several subintervals with equal length. By using the homeomorphism mapping principle, free-weighting matrix method and linear matrix inequality (LMI) techniques, the obtained condition is less conservative than some previous results. Three examples are also given to show the effectiveness of the presented criterion.  相似文献   

11.
魏龙  党兴华 《科学学研究》2017,35(1):146-160
针对惯例复制的微观动态及其网络复制困境,分析了常规惯例和柔性惯例复制及其网络行为偏好,采用多主体仿真方法构建了基于惯例复制的技术创新网络演化模型,对比分析不同情境下惯例复制行为对技术创新网络演化的差异性影响。结果表明:常规惯例和柔性惯例是惯例复制行为产生的根源性划分,常规惯例复制具有追求相似性选择与封闭式网络的行为偏好,而柔性惯例复制具有追求择优性选择与开放式网络的行为偏好;相比柔性惯例,稳定环境常规惯例复制作用下网络的小世界特征更显著,动荡环境不仅延长了惯例复制的演化阶段,而且抑制了网络的小世界效应;常规惯例复制作用下结构涌现为高模块化和高连通性均匀分布的社群网络,柔性惯例复制作用下结构涌现为低模块化和高连通性非均匀分布的公约网络;自组织演化过程中常规惯例复制对稳定环境的依赖性更强,能够提升网络弹性延缓网络僵化,而柔性惯例复制对动荡环境的依赖性更强。研究结论有助于揭示技术创新网络演化的动力学机制。  相似文献   

12.
胡平  石娟  焦阳 《科研管理》2016,37(2):55-62
挖掘2000-2011年长三角地区信息服务业的专利数据,基于隶属网络关系分别构建了上海、南京、杭州、苏州这四个城市的集群网络和整个长三角地区的集群网络,并从个体网和整体网两方面对集群网络的动态发展特点进行分析,以期了解网络的动态演化特征。研究表明:1)集群网络中的企业或科研机构获取资源的平均能力不断增强,集群网络表现出规模持续增大、连通性不断增强的趋势,到了成长阶段连通性趋近100%。2)长三角地区集群网络中,城市内的关系增长要快于城市间的关系增长,形成了以上海为领跑者,南京、杭州、苏州为追随者的格局。3)每个城市的集群网络以及整个长三角地区的集群网络都有着小世界网络的特征,信息传播效率很高。  相似文献   

13.
Aligning time series of different sampling rates is an important but challenging task. Current commonly used dynamic time warping methods usually suffer from pathological temporal singularity problem. In order to overcome this, we transform the alignment task to a spatial-temporal multi-objective optimization (MOO) problem. Existing MOO algorithms are always inefficient in finding Pareto optimal alignment solutions due to their insufficiency in maintaining convergence and diversity among the obtained Pareto solutions. In light of this, we propose a novel and efficient MOO algorithm Cell-MOWOA which integrates Cellular automata with the rising Whale Optimization Algorithm to find Pareto optimal alignment solutions. Innovative multi-variate non-linear cell state evolutionary rules are designed within Pareto solution external archive to improve the convergence and diversity of the Pareto solutions, and novel whale population updating mechanism is designed to accelerate the convergence to the Pareto front. Besides, new integer whale updating mechanism is presented to transform real-number whale solutions to integer whale solutions. Experimental results on 85 gold-standard UCR time series datasets showed that Cell-MOWOA outperformed six state-of-the-art baselines by 24.53% in average in increasing alignment accuracy and 42.66% in average in reducing singularity. Besides, it achieved outstanding runtime efficiency, especially on long time series datasets.  相似文献   

14.
This paper investigates steady-state distributions of probabilistic Boolean networks via cascading aggregation. Under this approach, the problem is converted to computing least square solutions to several corresponding equations. Two necessary and sufficient conditions for the existence of the steady-state distributions for probabilistic Boolean networks are given firstly. Secondly, an algorithm for finding the steady-state distributions of probabilistic probabilistic Boolean networks is given. Finally, a numerical example is given to show the effectiveness of the proposed method.  相似文献   

15.
The concept of a smart city, based on advanced information and communications technology (ICT), emerged to mitigate the impact of rapid urbanization and was considered feasible. However, the selection of technology and policy for providing better services to citizens and ensuring sustainable development is a multiple-objective decision process that is usually performed by experts in relevant domains. The major goal of this study is to propose a structural method for policy selection, which consists of three phases. In the first phase, the modified Delphi method is used to determine the elements of the decision by surveying panel members for their opinions. In the second phase, an analytic hierarchy process is used to ascertain the priority of each alternative according to the goal of the decision. In the third phase, zero-one goal programming models are developed to select a feasible portfolio based on the political goal and the annual budget. We conducted an empirical study to demonstrate and validate that the proposed model can induce the municipality to consider citizens’ requirements, identify the strengths and weaknesses of proposed policies, and select a feasible project portfolio in response to public expectations. In addition, the study found that a feasible portfolio, including consideration of citizens, business, and the environment, enables the public perceptions of government performance within the resource constraints of the organization.  相似文献   

16.
There are many cases where it is necessary to store sets of data that are variable in length, and to search these in order to satisfy requests for subsets with a common characteristic. This article presents a file structure that holds an integrated English dictionary used to locate clusters of words for presentation to an intelligent spelling error correction system. Although the emphasis has been on misspelling, the structure presented is capable of handling any other types of lumpy data provided the characteristics used in search requests can be translated into a set of integer numbers.  相似文献   

17.
Set stabilization of probabilistic Boolean control networks (PBCNs) is investigated in this paper and some interesting results are derived. The main results consist of three parts. (1) A definition of set stabilizability with probability one by closed-loop control is proposed for PBCNs, which is not a natural extension from deterministic Boolean control networks to PBCNs due to the random feature of PBCNs. (2) A necessary and sufficient set stabilizability condition is provided for PBCNs. (3) An algorithm for designing a state feedback controller is developed. It is guaranteed that all designed controllers can stabilize a PBCN to a given subset with probability one. The design method is constructive, so it is convenient to use this method in practical application. The results derived above are fundamental and important, since based on them many problems about PBCNs can be solved, for example partial stabilization, synchronization, and so on. Finally, a practical example is employed to show the effectiveness of our results.  相似文献   

18.
单圈T函数可以作为LFSR( linear feedback shift register)的代替组件用来设计序列密码,这样的序列密码算法在软件上具有很好的运行效率.研究了单圈T函数输出序列的线性复杂度等密码学性质.给出了当n为一般情况时,单圈T函数输出序列的线性复杂度,以及相应的极小多项武.  相似文献   

19.
Social networks and many other graphs are attributed, meaning that their nodes are labelled with textual information such as personal data, expertise or interests. In attributed graphs, a common data analysis task is to find subgraphs whose nodes contain a given set of keywords. In many applications, the size of the subgraph should be limited (i.e., a subgraph with thousands of nodes is not desired). In this work, we introduce the problem of compact attributed group (AG) discovery. Given a set of query keywords and a desired solution size, the task is to find subgraphs with the desired number of nodes, such that the nodes are closely connected and each node contains as many query keywords as possible. We prove that finding an optimal solution is NP-hard and we propose approximation algorithms with a guaranteed ratio of two. Since the number of qualifying AGs may be large, we also show how to find approximate top-k AGs with polynomial delay. Finally, we experimentally verify the effectiveness and efficiency of our techniques on real-world graphs.  相似文献   

20.
In this paper, the discrete-time fuzzy cellular neural network with variable delays and impulses is considered. Based on M-matrix theory and analytic methods, several simple sufficient conditions checking the global exponential stability and the existence of periodic solutions are obtained for the neural networks. Moreover, the estimation for exponential convergence rate index is proposed. The obtained results show that the stability and periodic solutions still remain under certain impulsive perturbations for the neural network with stable equilibrium point and periodic solutions. Some examples with simulations are given to show the effectiveness of the obtained results.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号