Rational measuring design of the tree length is a course to optimize all position of it before bucking. This paper offers the weighted digraph in the digrams and theories to solve the optimal problem of rational measu...Rational measuring design of the tree length is a course to optimize all position of it before bucking. This paper offers the weighted digraph in the digrams and theories to solve the optimal problem of rational measuring of tree length based on experts researches in home and foreign. Sawlines are defined as apexes xd log between two sawlines as a side yn the price of log as weight Wij. It can describe the digraph of the rational measuring design of the tree length T=(X. Y.Wij), which consists of point -set and side-set. Oweing to Wij≥0, using Mr. E. W. Dijkstra's theory, we can obtain the 'path' of maximum profit of the tree length under the best availability of the tree length.展开更多
This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is ...This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the theoretical results.展开更多
Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix...Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix A_(α)(D),which is defined as Aα(D)=αW(D)+(1−α)A(D),0≤α≤1.The spectral radius of A_(α)(D)is called the Aαspectral radius of D,denoted byλα(D).We obtain some upper bounds on the Aαspectral radius of strongly connected irregular weighted digraphs.展开更多
文摘Rational measuring design of the tree length is a course to optimize all position of it before bucking. This paper offers the weighted digraph in the digrams and theories to solve the optimal problem of rational measuring of tree length based on experts researches in home and foreign. Sawlines are defined as apexes xd log between two sawlines as a side yn the price of log as weight Wij. It can describe the digraph of the rational measuring design of the tree length T=(X. Y.Wij), which consists of point -set and side-set. Oweing to Wij≥0, using Mr. E. W. Dijkstra's theory, we can obtain the 'path' of maximum profit of the tree length under the best availability of the tree length.
基金supported by the National Natural Science Foundation of China(6127312661363002+3 种基金61374104)the Natural Science Foundation of Guangdong Province(10251064101000008S2012010009675)the Fundamental Research Funds for the Central Universities(2012ZM0059)
文摘This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the theoretical results.
基金Supported by the National Natural Science Foundation of China (Grant No.12001434)The Natural Science Basic Research Program of Shaanxi Province (Grant No.2022JM-006)Chinese Universities Scientific Fund (Grant No.2452020021)
文摘Let D be a weighted digraph with n vertices in which each arc has been assigned a positive number.Let A(D)be the adjacency matrix of D and W(D)=diag(w_(1)^(+),w_(2)^(+),...,w_(n)^(+)).In this paper,we study the matrix A_(α)(D),which is defined as Aα(D)=αW(D)+(1−α)A(D),0≤α≤1.The spectral radius of A_(α)(D)is called the Aαspectral radius of D,denoted byλα(D).We obtain some upper bounds on the Aαspectral radius of strongly connected irregular weighted digraphs.