排序方式: 共有14条查询结果,搜索用时 31 毫秒
1.
CPS—1方案的中止概率曲线及其应用 总被引:4,自引:4,他引:0
本文结合国家标准GB8052-87,利用中止概率曲线的概念,讨论了连续抽样方案CSP-1的中止检查规则及其统计特性,并提出了确定最优中止参数的原则和方法。 相似文献
2.
3.
起源于稀疏矩阵计算和其它应用领域的一个图G的最小填充问题就是在G中寻找一个边数| F |最小的添加边集F,使得G+F是弦图.这里最小值| F |称为图G的填充数,表示为f(G).对一般图来说,这个问题是NP-困难问题.一些特殊图类的最小填充问题已被研究.本文给出了序列平行图G的最小填充数的具体值. 相似文献
4.
5.
6.
2×2列联表的统计推断在现代医学,各种临床试验以及现代生物学的研究中通常是感兴趣的问题,其中归因风险的统计推断经常出现在流行病学和健康服务研究中.本文我们针对2×2列联表中归因风险的统计推断给出了一种新的方法,利用2×2列联表中边际和条件概率提出了Score检验,给出了建立在置信区间之上的Score检验的描述.并对Score检验和似然比检验的效果进行评价,依据覆盖概率、左尾错误率及右尾错误率得出结论:Score检验与似然比检验相比更有效. 相似文献
7.
The interval graph completion problem of a graph G includes two class problems: the profile problem and the pathwidth problem, denoted as P(G) and PW(G) respectively, where the profile problem is to find an interval supergraph with the smallest possible number of edges; the pathwidth problem is to find an interval supergraph with the smallest possible cliquesize. These two class problems have important applications to numerical algebra, VLSI-layout and algorithm graph theory respectively; And they are known to be NP-complete for general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the exact solutions of the profile and the pathwidth of the complete multipartite Graph Kn1,n2,…,nr(r≥2) are determined. 相似文献
8.
9.
The interval graph completion problem on a graph G is to find an added edge set F such that G + F is an interval supergraph with the smallest possible number of edges. The problem has important applications to numerical algebra, V LSI-layout and algorithm graph theory etc; And it has been known to be N P-complete on general graphs. Some classes of special graphs have been investigated in the literatures. In this paper the interval graph completion problem on split graphs is investigated. 相似文献
10.
The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given. The structure of the optimal solutions set on the shortest paths is studied in this paper. First,the conditions of having unique shortest path between two distinguished vertices s and t in a network G are discussed;Second,the structural properties of 2-transformation graph (?) on the shortest-paths for G are presented heavily. 相似文献