一类本原双色有向图的指数界

对一类相对特殊的双色本原有向图给出了本原条件,结合圈矩阵给出了本原指数的上下界,并刻画了取得指数上下界时所对应的极图。

基于分层有向图与动态时空相关性的小区域光伏超短期预测方法

小区域光伏发电功率准确预测,已成为高渗透多台区系统精准调控运行的技术瓶颈。目前光伏发电功率的预测方法缺乏对台区小区域内光伏集群效应的考虑,忽略了输入变量的内在因果关系以及动态相关性。针对于上述问题,提出一种基于分层有向图以及动态图卷积循环网络(dynamic graph convolutional recurrent network,DGCRN)的小区域光伏预测方法。首先,考虑出力数据与数值天气预报(numerical weather prediction,NWP)单向关系,生成具有因果联系的分层有向图。其次,依据节点属性在每个时间步生成动态图,与预先定义的静态图有机结合,以捕捉节点之间的动态时空相关性。最后,将具有动态时空相关性的图结构用于模型训练。以某个小区域台区29个光伏节点加以预测建模,实验结果表明,DGCRN模型具备捕获多参量间的因果规律和提取光伏功率的短期动态特征的能力,其在小区域多节点的光伏发电功率预测性能优越。

高超声速滑翔飞行器多模型鲁棒跟踪方法

针对高超声速滑翔飞行器(HGV)具有机动能力强、机动样式多变、机动时机不确定等特点,提出了一种基于有向图变结构多模型的鲁棒跟踪(CHF-DSVSMM)方法。考虑到高超声速滑翔飞行器的跳跃滑翔运动特性,建立了包括自适应非零均值衰减震荡(ANMDO)模型、“当前”统计模型(CSM)等机动模型的模型集。针对固定结构多模型算法存在模型相互竞争、运算时间长的缺点,设计了基于有向图结构的切换准则自适应地改变模型集构成,提高模型匹配性。对于地基雷达探测中存在闪烁噪声的问题,采用容积Huber-based滤波方法进行状态估计。仿真结果表明,所提算法与现有方法相比具有更高的跟踪精度,并对闪烁噪声具有良好的鲁棒性。

非正则赋权有向图A_(α)谱半径的上界

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.

点传递二部有向图的极大连通性

有向图X的连通度κ(X)是删除一些点使得剩余的图不再强连通的最小点数.若有向图X的连通度恰好达到最小度,则有向图X是极大连通的.证明了强连通点传递二部有向图是极大连通的,并得出Bi-Cayley有向图也是极大连通的.

基于有向图的分布式连续时间非光滑耦合约束凸优化分析

研究一类分布式优化问题,其目标是在满足耦合不等式约束和局部可行集约束的情况下使非光滑全局代价函数值最小.首先,对原有的分布式连续时间投影算法进行拓展,结合线性代数理论分析,设计一个适用于强连通加权平衡有向通信网络拓扑图的算法.其次,在局部代价函数和耦合不等式约束函数是非光滑凸函数的假设条件下,利用Moreau-Yosida函数正则化使目标函数和约束函数近似光滑可微.然后,根据强连通加权平衡有向图的分布式连续时间投影算法构造李雅普诺夫函数,证明该算法下的平衡解是分布式优化问题最优解,并对算法进行收敛性分析.最后,通过数值仿真验证算法的有效性.

仙人掌图的m-步竞争数

有向图D的m-步竞争图G是一个无向图,G与D具有相同的顶点集,若在G中顶点x和y相邻,当且仅当存在一个顶点a,在D中同时有从x到a和从y到a的长为m的有向路径.对于任意的无向图G,G与足够多的孤立顶点的并可以作为一个无圈有向图的m-步竞争图,则G的m-步竞争数是指满足条件的所添加的最小的孤立顶点的个数.本文主要研究了仙人掌图的m≥1-步竞争数.

On a Class of Supereulerian Digraphs

The 2-sum of two digraphs and , denoted , is the digraph obtained from the disjoint union of and by identifying an arc in with an arc in . A digraph D is supereulerian if D contains a spanning eulerian subdigraph. It has been noted that the 2-sum of two supereulerian (or even hamiltonian) digraphs may not be supereulerian. We obtain several sufficient conditions on and for to be supereulerian. In particular, we show that if and are symmetrically connected or partially symmetric, then is supereulerian.

Bounds on the absorbant number of generalized Kautz digraphs

The generalized Kautz digraphs have many good properties as interconnection network topologies. In this note, the bounds of the absorbant number for the generalized Kautz digraph are given, and some sufficient conditions for the absorbant number of the generalized Kautz digraph attaining the bounds are presented.

Connectivities of Minimal Cayley Coset Digraphs

we prove that the Connectivities of Minimal Cayley Coset Digraphs are their regular degrees. Connectivity of transitive digraphs and a combinatorial propertyof finite groups Ann., Discrete Math., 8 1980 61--64 Meng Jixiang and Huang Qiongxiang On the connectivity of Cayley digraphs, to appear Sabidussi, G. Vertex transitive graphs Monatsh. Math., 68 1969 426--438 Watkins, M. E. Connectivity of transitive graphs J. Combin. Theory, 8 1970 23--29 Zemor, G. On positive and negative atoms of Cayley digraphs Discrete Applied Math., 23 1989 193--195 Department of Mathematics,Xinjiang University,Urumpi 830046.APPLIED MATHEMATICS 3. Statement of Inexact Method Here we assume F to be continuousely differentiable. Inexact Newton method was first studied in the solution of smooth equations (see ). Now, such a technique has been widely used in optimizations, nonlinear complementarity problems and nonsmooth equations (see, and , etc.) In order to establish the related inexact methods,we introduce a nonlinear operator T(x): R n R n . Its components are defined as follows: (T(x)p) i=[HL(2:1,Z;2,Z] (x k+p k) i, if i∈(x k), H i(x k)+ min {(p k) i,F i(x k) Tp k}, if i∈(x k), F i(x k)+F i(x k) Tp k, i∈(x k).(3.1) Then, it is clear that the subproblem (2.5) turns to T(x k)p k=0.(3.2) In inexact algorithm, we determine p k in the followinginexact way ( see ). ‖T(x k)p k‖ υ k‖H(x k)‖,(3.3) where υ k is a given positive sequence. It is then obviously that (3.2),or equivalently (2.5), is a special case of (3.3) corresponding to υ k=0 . In particular, (3.3) can be used as a termination rule of the iterative process for solving (2.5). The following proposition shows the existence of λ k satisfying (2.4). Proposition 3.1. Let F be continuously differe ntiable. υ k is chosen so that υ k for some constant ∈(0,1). Then p k generated by (3.3) is a descent direction of θ at x k, and for some constant σ∈(0, min (1/2,1- holds θ(x k)-θ(x k+λ kp k) 2σλ kθ(x k)(3.4) for all sufficiently small λ k>0. Proof For simplification, we omit the lower subscripts k and denote (x k) i , H i(x k) , (BH(x k)p k) i , etc.by x i , H i , (BHp) i , etc. respectively. To estimate the directional derivative of θ at x k along p k , we divide it into three parts: D p k θ(x k)=H T(x k)BH(x k)p k=T 1+T 2+T 3,(3.5) where T 1=Σ i∈α k H i(BHp) i , T 2=Σ i∈β k H i(BHp) i , T 3=Σ i∈γ k H i(BHp) i . Consider i∈α k= k∪α -(x k) . In this case, we always have H i(BH(x)p) i=H i 2+H i(x i+p i) . If i∈ k , then H i(BHp) i -H i 2+|H i‖(T(x)p) i|. If i∈α -(x k) , then x i<0 . We have either x i+p i 0 , or x i+p i<0 . When x i+p i 0 , we get H i(BH(x)p) i -H i 2 .In the later case, x i+p i<0 , so H i(BH(x)p) i=-H i 2+|H i‖x i+p i|. Then, by elementary computation, we deduce that T 1 -Σi∈α kH i 2+Σ i∈α k|H i‖(T(x)p) i|.(3.6) Received March 1, 1995. 1991 MR Subject Classification: 05C25

A Signed Digraphs Based Method for Detecting Inherently Unsafe Factors of Chemical Process at Conceptual Design Stage

Digraph-based causal models have been widely used to model the cause and effect behavior of process systems. Signed digraphs （SDG） capture the direction of the effect. It should be mentioned that there are loops in SDG generated from chemical process. From the point of the inherent operability, the worst unsafe factor is the SDG having positive loops that means any disturbance occurring within the loop will propagate through the nodes one by one and are amplified gradually, so the system may lose control, which may lead to an accident. So finding the positive loops in a SDG and treating these unsafe factors in a proper manner can improve the inherent safety of a chemical process. This article proposed a method that can detect the above-mentioned unsafe factors in the proc- ess conceptual design stage automatically through the analysis of the SDG generated from the chemical process. A case study is illustrated to show the working of the algorithm, and then a complicated case from industry is studied to depict the effectiveness of the proposed algorithm.

An Explicit Integer Programming Model of the Minimal Spanning Tree Problem for Digraphs with Asymmetric Weights

As far as the minimal spanning tree problem for the digraph with asymmetric weightsis concerned, an explicit integer programming model is proposed, which could be solved successfullyusing the integer programming packages such as LINDO, and furthermore this model is extendedinto the stochastic version, that is, the minimal spanning tree problem for the digraph with theweights is not constant but random variables. Several algorithms are also developed to solve themodels. Finally, a numerical demonstration is given.

Twin domination in generalized Kautz digraphs

Let G = （V,A） be a digraph.A set T of vertices of G is a twin dominating set of G if for every vertex v ∈ V ／ T.There exist u,w ∈ T （possibly u = w） such that （u,v）,（v,w） ∈ A.The twin domination number γ＊（G） of G is the cardinality of a minimum twin dominating set of G.In this paper we consider the twin domination number in generalized Kautz digraphs GK（n,d）.In these digraphs,we establish bounds on the twin domination number and give a sufficient condition for the twin domination number attaining the lower bound.We give the exact values of the twin domination numbers by constructing minimum twin dominating sets for some special generalized Kautz digraphs.

Hamiltonian Cayley Digraphs on Direct Products of Dihedral Groups

We prove that a Cayley digraph on the direct product of dihedral groups D2n × D2m with outdegree two is Hamiltonian if and only if it is connected.

Ordered and Ordered Hamilton Digraphs

A digraph D is k-ordered if for every sequence S：v 1,v 2,…,v k of k distinct vertices,there exists a cycle C such that C encounters the vertices of S in the specified order.In particular,we say that D is k-ordered hamiltonian if for every sequence S：v 1,v 2,…,v k of k distinct vertices,there exists a hamiltonian cycle C such that the vertices of S are encountered on C in the specified order.In this paper,sufficient conditions for digraphs to be ordered and ordered hamiltonian have been given.

A Note on Hamiltionian Decomposition of Cayley Digraphs on Dicyclic Groups

For every dicyclic group,there is a generating set of two elements such that the corresponding Cayley digraph is Harmiltonian decomposable.

2-Competition Index of Primitive Digraphs Using Graph Theory

Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.

A Robust Image Watermarking Scheme Using Z-Transform, Discrete Wavelet Transform and Bidiagonal Singular Value Decomposition

Watermarking is a widely used solution to the problems of authentication and copyright protection of digital media especially for images,videos,and audio data.Chaos is one of the emerging techniques adopted in image watermarking schemes due to its intrinsic cryptographic properties.This paper proposes a new chaotic hybrid watermarking method combining Discrete Wavelet Transform(DWT),Z-transform(ZT)and Bidiagonal Singular Value Decomposition(BSVD).The original image is decomposed into 3-level DWT,and then,ZT is applied on the HH3 and HL3 sub-bands.The watermark image is encrypted using Arnold Cat Map.BSVD for the watermark and transformed original image were computed,and the watermark was embedded by modifying singular values of the host image with the singular values of the watermark image.Robustness of the proposed scheme was examined using standard test images and assessed against common signal processing and geometric attacks.Experiments indicated that the proposed method is transparent and highly robust.

An efficient parallel algorithm for shortest pathsin planar layered digraphs

This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.

STUDY ON DIGRAPH OF TREE LENGTH MEASURING DESIGN

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.