Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infectio...Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infection graph for channel assignment with the goal of global optimization minimizing the total interferences in wireless sensor networks.The channel assignment problem is equivalent to the generalized graph-coloring problem which is a NP-complete problem.We further present a meta-heuristic Wireless Sensor Network Parallel Tabu Search(WSN-PTS) algorithm,which can optimize global networks with small numbers of iterations.The results from a simulation experiment reveal that the novel algorithm can effectively solve the channel assignment problem.展开更多
Multi-body dynamics,relative coordinates and graph theory are combined to analyze the structure of a vehicle suspension.The dynamic equations of the left front suspension system are derived for modeling.First,The pure...Multi-body dynamics,relative coordinates and graph theory are combined to analyze the structure of a vehicle suspension.The dynamic equations of the left front suspension system are derived for modeling.First,The pure tire theory model is used as the input criteria of the suspension multibody system dynamic model in order to simulate the suspension K&C characteristics test.Then,it is important to verify the accuracy of this model by comparing and analyzing the experimental data and simulation results.The results show that the model has high precision and can predict the performance of the vehicle.It also provides a new solution for the vehicle dynamic modeling.展开更多
One of the hot research topics in propagation dynamics is identifying a set of critical nodes that can influence maximization in a complex network.The importance and dispersion of critical nodes among them are both vi...One of the hot research topics in propagation dynamics is identifying a set of critical nodes that can influence maximization in a complex network.The importance and dispersion of critical nodes among them are both vital factors that can influence maximization.We therefore propose a multiple influential spreaders identification algorithm based on spectral graph theory.This algorithm first quantifies the role played by the local structure of nodes in the propagation process,then classifies the nodes based on the eigenvectors of the Laplace matrix,and finally selects a set of critical nodes by the constraint that nodes in the same class are not adjacent to each other while different classes of nodes can be adjacent to each other.Experimental results on real and synthetic networks show that our algorithm outperforms the state-of-the-art and classical algorithms in the SIR model.展开更多
In this paper,we prove that there does not exist an r-UPC[2]-graph for each r≥5 and there does not exist an r-UPC[C_t^2]-graph for each r≥3,where t is the number of bridges in a graph and C_t^2 is the number of comb...In this paper,we prove that there does not exist an r-UPC[2]-graph for each r≥5 and there does not exist an r-UPC[C_t^2]-graph for each r≥3,where t is the number of bridges in a graph and C_t^2 is the number of combinations of t bridges taken 2 at a time.展开更多
A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also ...A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials.展开更多
The paper employs the principles of graph theory in nanobiophotonics, where the soot-assisted intra-pigmental energy transport in leaves is unveiled through the laser-induced thermal lens(TL) technique. Nanofluids wit...The paper employs the principles of graph theory in nanobiophotonics, where the soot-assisted intra-pigmental energy transport in leaves is unveiled through the laser-induced thermal lens(TL) technique. Nanofluids with different soot concentrations are sprayed over Lablab purpureus(L) sweet leaves, and the extracted pigments are analyzed. The graph features of the constructed complex network from the TL signal of the samples are analyzed to understand their variations with optical absorbance. Besides revealing the presence of optimum soot concentration that can enhance photosynthesis,the study brings out the potential application of graph features in nanobiophotonics.展开更多
The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which ...The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by sev- eral examples.展开更多
Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity throu...Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity through the network in the seriously blocked situation. It is an important parameter in designing and operating a transport network, especially in an emergency evacuation network. A branch and bound method is presented to solve the minimum flow problem on the basis of the blocking flow theory and the algorithm and its application are illustrated by examples.展开更多
To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation f...To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation from any initial states, while the velocity converges to that of the virtual leader whose velocity cannot be measured by agents in real time. The two cases of switching topologies without communication delay and fixed topology with time-varying communication delay are both considered for multi-agent networks. By using the Lyapunov stability theory, the issue of stability is analysed for multi-agent systems with switching topologies. Then, by considering the time-varying communication delay, the sufficient condition is proposed for the multi-agent systems with fixed topology. Finally, two numerical examples are given to illustrate the effectiveness of the proposed leader-following formation control protocols.展开更多
Traditional cellular network requires that a user equipment(UE) should associate to the same base station(BS) in both the downlink(DL) and the uplink(UL). Based on dual connectivity(DC) introduced in LTE-Advanced R12,...Traditional cellular network requires that a user equipment(UE) should associate to the same base station(BS) in both the downlink(DL) and the uplink(UL). Based on dual connectivity(DC) introduced in LTE-Advanced R12, DL/UL decouple access scheme has been proposed, which is especially suitable for heterogeneous networks(Het Nets). This paper is the pioneer to take the DL/UL decouple access scheme into consideration and develop a novel resource allocation algorithm in a two-tier Het Net to improve the total system throughput in the UL and ease the load imbalance between macro base stations(MBSs) and pico base stations(PBSs). A model is formulated as a nonlinear integer programming, and the proposed algorithm is a sub-optimal algorithm based on the graph theory. First, an undirected and weighted interference graph is obtained. Next, the users are grouped to let users with large mutual interferences to be assigned to different clusters. Then, the users in different clusters are allocated to different resource blocks(RBs) by using the Hungarian algorithm. Simulation results show that the proposed algorithm can provide great promotions for both the total system throughput and the average cell edge user throughput and successfully ease the load imbalance between MBSs and PBSs.展开更多
By leveraging the 5G enabled vehicular ad hoc network(5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertain...By leveraging the 5G enabled vehicular ad hoc network(5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertainment experience. However, many enabling applications in 5G-VANET rely on the efficient content sharing among mobile vehicles, which is a very challenging issue due to the extremely large data volume, rapid topology change, and unbalanced traffic. In this paper, we investigate content prefetching and distribution in 5G-VANET. We first introduce an edge computing based hierarchical architecture for efficient distribution of large-volume vehicular data. We then propose a multi-place multi-factor prefetching scheme to meet the rapid topology change and unbalanced traffic. The content requests of vehicles can be served by neighbors, which can improve the sharing efficiency and alleviate the burden of networks. Furthermore, we use a graph theory based approach to solve the content distribution by transforming it into a maximum weighted independent set problem. Finally, the proposed scheme is evaluated with a greedy transmission strategy to demonstrate its efficiency.展开更多
An integrated dynamic model of natural gas pipeline networks is developed in this paper.Components for gas supply,e.g.,pipelines,junctions,compressor stations,LNG terminals,regulation stations and gas storage faciliti...An integrated dynamic model of natural gas pipeline networks is developed in this paper.Components for gas supply,e.g.,pipelines,junctions,compressor stations,LNG terminals,regulation stations and gas storage facilities are included in the model.These components are firstly modeled with respect to their properties and functions and,then,integrated at the system level by Graph Theory.The model can be used for simulating the system response in different scenarios of operation,and evaluate the consequences from the perspectives of supply security and resilience.A case study is considered to evaluate the accuracy of the model by benchmarking its results against those from literature and the software Pipeline Studio.Finally,the model is applied on a relatively complex natural gas pipeline network and the results are analyzed in detail from the supply security and resilience points of view.The main contributions of the paper are:firstly,a novel model of a complex gas pipeline network is proposed as a dynamic state-space model at system level;a method,based on the dynamic model,is proposed to analyze the security and resilience of supply from a system perspective.展开更多
We discuss in this paper a deterministic multi-group MSIR epidemic model with a vaccination rate, the basic reproduction number Ro, a key parameter in epidemiology, is a threshold which determines the persistence or e...We discuss in this paper a deterministic multi-group MSIR epidemic model with a vaccination rate, the basic reproduction number Ro, a key parameter in epidemiology, is a threshold which determines the persistence or extinction of the disease. By using Lyapunov function techniques, we show if Ro is greater than 1 and the deterministic model obeys some conditions, then the disease will prevail, the infective persists and the endemic state is asymptotically stable in a feasible region. If Ro is less than or equal to 1, then the infective disappear so the disease dies out. In addition, stochastic noises around the endemic equilibrium will be added to the deterministic MSIR model in order that the deterministic model is extended to a system of stochastic ordinary differential equations. In the stochastic version, we carry out a detailed analysis on the asymptotic behavior of the stochastic model. In addition, regarding the value of Ro, when the stochastic system obeys some conditions and Ro is greater than 1, we deduce the stochastic system is stochastically asymptotically stable. Finally, the deterministic and stochastic model dynamics are illustrated through computer simulations.展开更多
The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple li...The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time- varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities （LMIs）, which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method.展开更多
A negative example shows that the model given by Mason Iri is used to prove that the relationship between the minimum flow problem and the Hamiltonian path problem in a (directed) network, is not rigorous. A new model...A negative example shows that the model given by Mason Iri is used to prove that the relationship between the minimum flow problem and the Hamiltonian path problem in a (directed) network, is not rigorous. A new model called minimum spanning flow in a network is established to revise the old one. It is proved that the problem of determining whether there is a Hamiltonian path from a specified vertex s to another t on a given digraph can be reducible at polynomial time to the problem of constructing a minimum spanning flow in a two-terminal extended network s,t , with the unit capacity for all arcs.展开更多
We build a double quantum-dot system with Coulomb coupling and aim at studying connections among the entropy production,free energy,and information flow.By utilizing concepts in stochastic thermodynamics and graph the...We build a double quantum-dot system with Coulomb coupling and aim at studying connections among the entropy production,free energy,and information flow.By utilizing concepts in stochastic thermodynamics and graph theory analysis,Clausius and nonequilibrium free energy inequalities are built to interpret local second law of thermodynamics for subsystems.A fundamental set of cycle fluxes and affinities is identified to decompose two inequalities by using Schnakenberg's network theory.Results show that the thermodynamic irreversibility has energy-related and information-related contributions.A global cycle associated with the feedback-induced information flow would pump electrons against the bias voltage,which implements a Maxwell demon.展开更多
ransport network in the paper is defined as follows: (1) Connected and directed network without self loop;(2) There is only one source vertex with zero in degree; (3) There is only one sink vertex with zero out de...ransport network in the paper is defined as follows: (1) Connected and directed network without self loop;(2) There is only one source vertex with zero in degree; (3) There is only one sink vertex with zero out degree;(4) The capacity of every arc is non negative integer Blocking flow is a kind of flow commonly happened in a transport network . Its formation is due to the existance of a blocking cutset in the network. In this paper the fundamental concepts and theorems of the blocking flow and the blocking cutset are introduced and a linear programming model for determining the blocking cutset in a network is set up. In order to solve the problem by graph theoretical approach a method called 'two way flow augmenting algorithm' is developed. With this method an iterative procedure of forward and backward flow augmenting process is used to determine whether a given cutset is a blocking one.展开更多
Opinion dynamics has recently attracted much attention,and there have been a lot of achievements in this area.This paper first gives an overview of the development of opinion dynamics on social networks.We introduce s...Opinion dynamics has recently attracted much attention,and there have been a lot of achievements in this area.This paper first gives an overview of the development of opinion dynamics on social networks.We introduce some classical models of opinion dynamics in detail,including the DeGroot model,the Krause model,O-1 models,sign networks and models related to Gossip algorithms.Inspired by some real life cases,we choose the unit circle as the range of the individuals'opinion values.We prove that the individuals'opinions of the randomized gossip algorithm in which the individuals'opinion values are on the unit circle reaches consensus almost surely.展开更多
In the electricity market, charging based on the traditional spot electricity price often results in the payment imbalance of electric network, and goes against the development of the power system. So, it is necessary...In the electricity market, charging based on the traditional spot electricity price often results in the payment imbalance of electric network, and goes against the development of the power system. So, it is necessary to modify the spot price. The key of the modification lies in how to calculate the fixed unit transmission cost of each node, that is how to allocate the fixed transmission cost to users.To solve this problem, we develop a power flow tracing algrithm to modify the spot price. We put forward a path searching method based on the graph theory after studying the fundamental principle of power flow tracing and apply the method to the downstream tracing algorithm and upstream tracing algorithm according to the proportional distribution principle. Furthermore, to improve the computational efficiency of the algorithm, we introduce the branch expunction method to optimize the node order. By using the result of power flow tracing to get fixed node transmission cost and introducing it to modify the spot price, we obtain the synthetical price.The application to a 5-bus system prove the algorithm feasible.展开更多
This paper sets up a mathematical model of switching network and switching function by utilizing graph theory to describe the logical function of different paths.The function varies with open and closed states of air ...This paper sets up a mathematical model of switching network and switching function by utilizing graph theory to describe the logical function of different paths.The function varies with open and closed states of air doors in a complex mine air sub network, and the computer program for solving the switching function of complex networks are offered. It gives the method for discriminating a reversible branch in a complex network by means of the switching function, and the method of counter inverted logical control of airflow inversion by means of open and short circuit conversion of key branches. The research has solved the problem of the stablization of air flow for normal ventination and reversing ventination in a diagonal network.展开更多
基金supported by National Key Basic Research Program of China(973 program) under Grant No. 2007CB307101National Natural Science Foundation of China under Grant No.60833002,No.60802016,No.60972010+1 种基金Next Generation Internet of China under Grant No.CNGI-0903-05the Fundamental Research Funds for the Central Universities under Grant No.2009YJS011
文摘Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infection graph for channel assignment with the goal of global optimization minimizing the total interferences in wireless sensor networks.The channel assignment problem is equivalent to the generalized graph-coloring problem which is a NP-complete problem.We further present a meta-heuristic Wireless Sensor Network Parallel Tabu Search(WSN-PTS) algorithm,which can optimize global networks with small numbers of iterations.The results from a simulation experiment reveal that the novel algorithm can effectively solve the channel assignment problem.
基金Supported by the National Key Research and Development Program of China(2017YFB0103801)
文摘Multi-body dynamics,relative coordinates and graph theory are combined to analyze the structure of a vehicle suspension.The dynamic equations of the left front suspension system are derived for modeling.First,The pure tire theory model is used as the input criteria of the suspension multibody system dynamic model in order to simulate the suspension K&C characteristics test.Then,it is important to verify the accuracy of this model by comparing and analyzing the experimental data and simulation results.The results show that the model has high precision and can predict the performance of the vehicle.It also provides a new solution for the vehicle dynamic modeling.
基金the National Natural Science Foundation of China(Grant No.62176217)the Program from the Sichuan Provincial Science and Technology,China(Grant No.2018RZ0081)the Fundamental Research Funds of China West Normal University(Grant No.17E063)。
文摘One of the hot research topics in propagation dynamics is identifying a set of critical nodes that can influence maximization in a complex network.The importance and dispersion of critical nodes among them are both vital factors that can influence maximization.We therefore propose a multiple influential spreaders identification algorithm based on spectral graph theory.This algorithm first quantifies the role played by the local structure of nodes in the propagation process,then classifies the nodes based on the eigenvectors of the Laplace matrix,and finally selects a set of critical nodes by the constraint that nodes in the same class are not adjacent to each other while different classes of nodes can be adjacent to each other.Experimental results on real and synthetic networks show that our algorithm outperforms the state-of-the-art and classical algorithms in the SIR model.
文摘In this paper,we prove that there does not exist an r-UPC[2]-graph for each r≥5 and there does not exist an r-UPC[C_t^2]-graph for each r≥3,where t is the number of bridges in a graph and C_t^2 is the number of combinations of t bridges taken 2 at a time.
基金This research is partially supported by NNSF of China.
文摘A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials.
文摘The paper employs the principles of graph theory in nanobiophotonics, where the soot-assisted intra-pigmental energy transport in leaves is unveiled through the laser-induced thermal lens(TL) technique. Nanofluids with different soot concentrations are sprayed over Lablab purpureus(L) sweet leaves, and the extracted pigments are analyzed. The graph features of the constructed complex network from the TL signal of the samples are analyzed to understand their variations with optical absorbance. Besides revealing the presence of optimum soot concentration that can enhance photosynthesis,the study brings out the potential application of graph features in nanobiophotonics.
文摘The maximum clique or maximum independent set of graph is a classical problem in graph theory. Com- bined with Boolean algebra and integer programming, two integer programming models for maximum clique problem, which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by sev- eral examples.
文摘Blockage is a kind of phenomenon frequently occurred in a transport network, in which the human beings are the moving subjects. The minimum flow of a network defined in this paper means the maximum flow quantity through the network in the seriously blocked situation. It is an important parameter in designing and operating a transport network, especially in an emergency evacuation network. A branch and bound method is presented to solve the minimum flow problem on the basis of the blocking flow theory and the algorithm and its application are illustrated by examples.
基金Project supported by the National Natural Science Foundation for Distinguished Young Scholars of China (Grant No. 60525303)the National Natural Science Foundation of China (Grant No. 60704009)+1 种基金the Key Project for Natural Science Research of the Hebei Educational Department (Grant No. ZD200908)the Doctorial Fund of Yanshan University (Grant No. B203)
文摘To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation from any initial states, while the velocity converges to that of the virtual leader whose velocity cannot be measured by agents in real time. The two cases of switching topologies without communication delay and fixed topology with time-varying communication delay are both considered for multi-agent networks. By using the Lyapunov stability theory, the issue of stability is analysed for multi-agent systems with switching topologies. Then, by considering the time-varying communication delay, the sufficient condition is proposed for the multi-agent systems with fixed topology. Finally, two numerical examples are given to illustrate the effectiveness of the proposed leader-following formation control protocols.
基金supported by the National Natural Science Foundation General Program of China under Grant No.61171110the National Basic Research Program of China under Grant No.2013CB329003
文摘Traditional cellular network requires that a user equipment(UE) should associate to the same base station(BS) in both the downlink(DL) and the uplink(UL). Based on dual connectivity(DC) introduced in LTE-Advanced R12, DL/UL decouple access scheme has been proposed, which is especially suitable for heterogeneous networks(Het Nets). This paper is the pioneer to take the DL/UL decouple access scheme into consideration and develop a novel resource allocation algorithm in a two-tier Het Net to improve the total system throughput in the UL and ease the load imbalance between macro base stations(MBSs) and pico base stations(PBSs). A model is formulated as a nonlinear integer programming, and the proposed algorithm is a sub-optimal algorithm based on the graph theory. First, an undirected and weighted interference graph is obtained. Next, the users are grouped to let users with large mutual interferences to be assigned to different clusters. Then, the users in different clusters are allocated to different resource blocks(RBs) by using the Hungarian algorithm. Simulation results show that the proposed algorithm can provide great promotions for both the total system throughput and the average cell edge user throughput and successfully ease the load imbalance between MBSs and PBSs.
基金the support of National Science and Technology Major Project of the Ministry of Science and Technology of China under Grant No.2016ZX03001025003the Natural Science Foundation of Beijing under Grant No.4181002+2 种基金the Natural Science Foundation of China under Grant No.91638204BUPT Excellent Ph.D. Students Foundation under Grant No.CX2018210Natural Sciences and Engineering Research Council (NSERC),Canada
文摘By leveraging the 5G enabled vehicular ad hoc network(5G-VANET), it is widely recognized that connected vehicles have the potentials to improve road safety, transportation intelligence and provide in-vehicle entertainment experience. However, many enabling applications in 5G-VANET rely on the efficient content sharing among mobile vehicles, which is a very challenging issue due to the extremely large data volume, rapid topology change, and unbalanced traffic. In this paper, we investigate content prefetching and distribution in 5G-VANET. We first introduce an edge computing based hierarchical architecture for efficient distribution of large-volume vehicular data. We then propose a multi-place multi-factor prefetching scheme to meet the rapid topology change and unbalanced traffic. The content requests of vehicles can be served by neighbors, which can improve the sharing efficiency and alleviate the burden of networks. Furthermore, we use a graph theory based approach to solve the content distribution by transforming it into a maximum weighted independent set problem. Finally, the proposed scheme is evaluated with a greedy transmission strategy to demonstrate its efficiency.
基金supported by National Natural Science Foundation of China[grant number 51904316]provided by China University of Petroleum,Beijing[grant number2462021YJRC013,2462020YXZZ045]
文摘An integrated dynamic model of natural gas pipeline networks is developed in this paper.Components for gas supply,e.g.,pipelines,junctions,compressor stations,LNG terminals,regulation stations and gas storage facilities are included in the model.These components are firstly modeled with respect to their properties and functions and,then,integrated at the system level by Graph Theory.The model can be used for simulating the system response in different scenarios of operation,and evaluate the consequences from the perspectives of supply security and resilience.A case study is considered to evaluate the accuracy of the model by benchmarking its results against those from literature and the software Pipeline Studio.Finally,the model is applied on a relatively complex natural gas pipeline network and the results are analyzed in detail from the supply security and resilience points of view.The main contributions of the paper are:firstly,a novel model of a complex gas pipeline network is proposed as a dynamic state-space model at system level;a method,based on the dynamic model,is proposed to analyze the security and resilience of supply from a system perspective.
基金supported by the National Natural Science Foundation of China(Grant No.11326078)the Project of Science and Technology of Heilongjiang Province of China(Grant No.12531187)
文摘We discuss in this paper a deterministic multi-group MSIR epidemic model with a vaccination rate, the basic reproduction number Ro, a key parameter in epidemiology, is a threshold which determines the persistence or extinction of the disease. By using Lyapunov function techniques, we show if Ro is greater than 1 and the deterministic model obeys some conditions, then the disease will prevail, the infective persists and the endemic state is asymptotically stable in a feasible region. If Ro is less than or equal to 1, then the infective disappear so the disease dies out. In addition, stochastic noises around the endemic equilibrium will be added to the deterministic MSIR model in order that the deterministic model is extended to a system of stochastic ordinary differential equations. In the stochastic version, we carry out a detailed analysis on the asymptotic behavior of the stochastic model. In addition, regarding the value of Ro, when the stochastic system obeys some conditions and Ro is greater than 1, we deduce the stochastic system is stochastically asymptotically stable. Finally, the deterministic and stochastic model dynamics are illustrated through computer simulations.
基金supported by the National Natural Science Foundation of China (Grant Nos. 60904046, 60972164, 60974071, and 60804006)the Special Fund for Basic Scientific Research of Central Colleges, Northeastern University, China (Grant No. 090604005)+2 种基金the Science and Technology Program of Shenyang (Grant No. F11-264-1-70)the Program for Liaoning Excellent Talents in University (Grant No. LJQ2011137)the Program for Liaoning Innovative Research Team in University (Grant No. LT2011019)
文摘The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time- varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities （LMIs）, which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method.
文摘A negative example shows that the model given by Mason Iri is used to prove that the relationship between the minimum flow problem and the Hamiltonian path problem in a (directed) network, is not rigorous. A new model called minimum spanning flow in a network is established to revise the old one. It is proved that the problem of determining whether there is a Hamiltonian path from a specified vertex s to another t on a given digraph can be reducible at polynomial time to the problem of constructing a minimum spanning flow in a two-terminal extended network s,t , with the unit capacity for all arcs.
基金Project supported by the National Natural Science Foundation(Grant No.11805159)the First Batch of National First-class Undergraduate Courses of China(2020)+1 种基金the Natural Science Foundation of Fujian Province,China(Grant No.2019J05003)Teaching Research Program of Thermodynamics and Statistical Physics in the Institution of Higher Education of China(2019).
文摘We build a double quantum-dot system with Coulomb coupling and aim at studying connections among the entropy production,free energy,and information flow.By utilizing concepts in stochastic thermodynamics and graph theory analysis,Clausius and nonequilibrium free energy inequalities are built to interpret local second law of thermodynamics for subsystems.A fundamental set of cycle fluxes and affinities is identified to decompose two inequalities by using Schnakenberg's network theory.Results show that the thermodynamic irreversibility has energy-related and information-related contributions.A global cycle associated with the feedback-induced information flow would pump electrons against the bias voltage,which implements a Maxwell demon.
文摘ransport network in the paper is defined as follows: (1) Connected and directed network without self loop;(2) There is only one source vertex with zero in degree; (3) There is only one sink vertex with zero out degree;(4) The capacity of every arc is non negative integer Blocking flow is a kind of flow commonly happened in a transport network . Its formation is due to the existance of a blocking cutset in the network. In this paper the fundamental concepts and theorems of the blocking flow and the blocking cutset are introduced and a linear programming model for determining the blocking cutset in a network is set up. In order to solve the problem by graph theoretical approach a method called 'two way flow augmenting algorithm' is developed. With this method an iterative procedure of forward and backward flow augmenting process is used to determine whether a given cutset is a blocking one.
基金This work was partially supported by the National Natural Science Foundation of China(61873262).
文摘Opinion dynamics has recently attracted much attention,and there have been a lot of achievements in this area.This paper first gives an overview of the development of opinion dynamics on social networks.We introduce some classical models of opinion dynamics in detail,including the DeGroot model,the Krause model,O-1 models,sign networks and models related to Gossip algorithms.Inspired by some real life cases,we choose the unit circle as the range of the individuals'opinion values.We prove that the individuals'opinions of the randomized gossip algorithm in which the individuals'opinion values are on the unit circle reaches consensus almost surely.
文摘In the electricity market, charging based on the traditional spot electricity price often results in the payment imbalance of electric network, and goes against the development of the power system. So, it is necessary to modify the spot price. The key of the modification lies in how to calculate the fixed unit transmission cost of each node, that is how to allocate the fixed transmission cost to users.To solve this problem, we develop a power flow tracing algrithm to modify the spot price. We put forward a path searching method based on the graph theory after studying the fundamental principle of power flow tracing and apply the method to the downstream tracing algorithm and upstream tracing algorithm according to the proportional distribution principle. Furthermore, to improve the computational efficiency of the algorithm, we introduce the branch expunction method to optimize the node order. By using the result of power flow tracing to get fixed node transmission cost and introducing it to modify the spot price, we obtain the synthetical price.The application to a 5-bus system prove the algorithm feasible.
文摘This paper sets up a mathematical model of switching network and switching function by utilizing graph theory to describe the logical function of different paths.The function varies with open and closed states of air doors in a complex mine air sub network, and the computer program for solving the switching function of complex networks are offered. It gives the method for discriminating a reversible branch in a complex network by means of the switching function, and the method of counter inverted logical control of airflow inversion by means of open and short circuit conversion of key branches. The research has solved the problem of the stablization of air flow for normal ventination and reversing ventination in a diagonal network.
