并将可达性图与可达性树进行比较，证明了可达图是较可达树更为有力的一种分析工具。
Compare the reachable tree and the reachable graph prove that reachable graph is better than reachable tree.
首先，我们给出一些图的邻接谱半径的一些新的可达上界，并说明这些新结果在一定情形下比已有的结果要好。
Firstly, we present some sharp upper bounds on the adjacency spectral radius of graphs, and show that these bounds are somewhat better than the known ones.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
The Adjacency Matrix of the Directed Graph is easy to build, but the reach-relation of factors is more useful when building the structure model.
使用该涂料所复制的彩虹全息图衍射效率可达到6.8%。
The diffraction efficiency was 6.8 % from the laser holography images recorded by the coating.
若有向图D中任何两个顶点是互相可达的，则称D为强连通图。
A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.
首先，我们给出一些图的邻接谱半径的一些新的可达上界，并说明这些新结果在一定情形下比已有的结果要好。
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs and strongly connected diagraphs.
产品WSJ的转化率可达91%以上，通过红外谱图分析得出，单体WS J与最初的设计一致。
The yield of product WSJ's is about 91%, and the structure of the monomer WSJ is consistent with the original design by IR analysis.
结果表明，对于二值图象，其压缩比可达18%以上，对于灰阶图象约为7%。
Experimental results show that the ration of image data compression is more than 18% for binary images and about 7% for gray level images.
系统依赖图的概念及两阶段图形可达性算法的出现，则有效解决了程序切片的过程调用问题。
To program slicing, the concept of SDG and a two-pass algorithm are effective to solve "calling-context" problem.
结果表明，对于二值图象，其压缩比可达18％以上，对于灰阶图象约为7％。
Experimental results show that the ration of image data compression is more than 18% for binary images and about 7% for gray level ima…
结果表明，对于二值图象，其压缩比可达18％以上，对于灰阶图象约为7％。
Experimental results show that the ration of image data compression is more than 18% for binary images and about 7% for gray level ima…
应用推荐