共查询到18条相似文献,搜索用时 203 毫秒
1.
2.
本文首次定义了近完全图的概念并采用先分解后组合的方法研究出一种边数很多、接近于完全图的不同构图的确定方法及其数目的比较算法,给出了判断定理及其证明和应用。 相似文献
3.
本文算法产生有源网络无源树边的完全k树多项式,算法时间复杂度与列写无向图全部树的改进的Minty算法相同。用该算法分析有源网络的符号函数可有效地减少对消冗余项数,同时也避免了对无源完全树边的符号鉴别问题。文章讨论了算法的合理性,并举例说明了它在网络分析中的应用。 相似文献
4.
5.
6.
7.
本文研究了不确定型模糊Kripke结构的计算树逻辑的模型检测问题,并说明了该问题可以在对数多形式时间内解决.首先给出了不确定型模糊Kripke结构的定义,引入了模糊计算树逻辑的语法和语义.为了刻画存在量词∃和任意量词∀在不确定型模糊Kripke结构中的两种语义解释,在模糊计算树逻辑语法中引入了路径量词∃sup,∃inf和∀sup,∀inf,分别用于替换存在量词∃和任意量词∀.其次讨论了基于不确定型模糊Kripke结构的计算树逻辑模型检测算法,特别地对于模糊计算树逻辑公式∃suppUq,∀suppUq,∃infpUq和∀infpUq分别给出时间复杂度为对数多项式时间的改进算法. 相似文献
8.
迭代树搜索(ITS)是一种有效的基于M-算法的软MIMO检测方案。然而ITS会遇到某些比特的对数似然比(LLR)无法确定的情况,虽可采用赋常数值方法(称为clipping)解决,但这会影响系统性能。为此,该文提出一种新的基于M-算法的软检测方案。该方案在树的每一级递推计算部分符号序列的后验概率,并基于此近似计算从第1级到该级的所有比特LLR,再采用M-算法保留部分符号序列延伸至下一级。该算法可确保每比特都可计算LLR,且能得到可靠性高的LLR值。考虑到某些比特LLR会多次计算,文中给出了算法的低复杂度实现。另外,该文还给出了一种计算符号序列后验概率的简单方法。最后,仿真结果表明所提算法相比ITS具有更好的性能,并使性能与复杂度达到较好的折中。 相似文献
9.
《中国无线电电子学文摘》2002,(2)
0153.2 02020009一种新的布尔函数求补算法/陈国章,何王廉,陈敏(夭津理工学院).天津大学学报一2001,3《4)一447一451研究了SOP(积的和型)布尔函数的求补算法,分析了已有的求补算法之间的深层联系,给出了否定树的概念.证明了单边求补算法、Sharp算法与德·摩根律是等效的、不相交的.Shal,p算法是递归算法的一个特例.提出了以否定树为基础的解决SOP型函数求补运算的新算法.图6表1参5(木)的变换族可以用一个矩阵群来描述,多次变换运算完全转化为相应的矩阵乘法运算.最后,数字信号分数Fourier变换的仿真计算表明,分数Fotlrier变换具有独特的… 相似文献
10.
11.
Liu Shidong Zhang Shunyi Zhou Jinquan Qiu Gong’an 《电子科学学刊(英文版)》2008,25(2):209-217
Overlay multicast has become one of the most promising multicast solutions for IP network, and Neutral Network(NN) has been a good candidate for searching optimal solutions to the constrained shortest routing path in virtue of its powerful capacity for parallel computation. Though traditional Hopfield NN can tackle the optimization problem, it is incapable of dealing with large scale networks due to the large number of neurons. In this paper, a neural network for overlay multicast tree computation is presented to reliably implement routing algorithm in real time. The neural network is constructed as a two-layer recurrent architecture, which is comprised of Independent Variable Neurons (IDVN) and Dependent Variable Neurons (DVN), according to the independence of the decision variables associated with the edges in directed graph. Compared with the heuristic routing algorithms, it is characterized as shorter computational time, fewer neurons, and better precision. 相似文献
12.
An upper bound on the order of complexity of a linear active network is the sum of the numbers of tree capacitances and link inductances, defined by a common tree of the voltage and current graph that contains a maximum number of capacitances and a minimum number of inductances. It is valid as far as a common tree exists, and is the lowest possible upper bound if only the network topology is known. 相似文献
13.
黄汝激 《电子科学学刊(英文版)》1990,7(4):296-305
First,the state space tree method for finding communication network overall re-liability is presented.It directly generates one disjoint tree multilevel polynomial of a networkgraph.Its advantages are smaller computational effort(its computing time complexity is O(en_l),where e is the number of edges and n_l is the number of leaves)and shorter resulting expression.Second,based on it an exact decomposition algorithm for finding communication network overallreliability is presented by applying the hypergraph theory.If we use it to carry out the m-timedecomposition of a network graph,the communication network scale which can be analyzed by acomputer can be extended to m-fold. 相似文献
14.
15.
16.
本文提出了求通信网络总可靠度的状态空间树法。它直接产生网络图的一个不交化树多层多项式,优点是计算量较小[计算时间复杂度为0(?),(?)为边数,n_1为叶数],所得表达式较短。在此基础上应用超图理论提出了求通信网络总可靠度的精确分解算法。用它进行网络图的m次分解,一台计算机所能计算的通信网络规模可以扩大m倍。 相似文献
17.
Fu-Shang P. Tsen Ting-Yi Sung Men-Yang Lin Lih-Hsing Hsu Myrvold W. 《Reliability, IEEE Transactions on》1994,43(4):600-603
A most vital edge of a graph (w.r.t. the spanning trees) is an edge whose deletion most drastically decreases the number of spanning trees. We present an algorithm for determining the most vital edges based on Kirchoff's matrix-tree theorem whose asymptotic time-complexity can be reduced to that of the fastest matrix multiplication routine, currently O(n2.376). The foundation for this approach is a more general algorithm for directed graphs for counting the rooted spanning arborescences containing each of the arcs of a digraph. A network can be modeled as a probabilistic graph. Under one such model proposed by Kel'mans, the all-terminal network reliability, maximizing the number of spanning trees is critical to maximizing reliability when edges are very unreliable. For this model, the most vital edges characterize the locations where an improvement of the reliability of the link most improves the reliability of the network 相似文献
18.
IVAN MARTINEC 《International Journal of Electronics》2013,100(3):411-417
The realization of a class of state equations by RC network and one voltage-controlled voltage source is described. The linear graph of the network has at least one complete tree such that the tree branches correspond to all capacitances, to all voltage sources and to the controlled source only. 相似文献