一种基于图论与熵的专家判断客观可信度的确定方法

本文给出一种群决策中确定专家判断可信度的方法，其主要思路是首先通过图论中最小生成树的方法提取专家判断矩阵的全部信息，其次，使用相对熵指标确定获得专家判断的最终结果，并同时衡量专家自身判断的统一程度，从而确定专家判断的相对客观可信度。最后，文章给出一个典型的算例以说明该方法的可行性和有效性。     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

类铜离子的电子碰撞参数及其规律

用准相对论扭曲波方法系统地计算了Ｂａ、Ｎｄ、Ｇｄ、Ｙｂ、Ａｕ、Ｐｂ类铜离子组态能级之间的电子碰撞激发强度Ω（ｎｌ－ｎｌ），３≤ｎ≤７，４≤ｎ≤７，同时给出了高能极限的碰撞强度和外推到阈值的碰撞强度，用最小二乘样条方法拟合了全能域碰撞强度及热平均速率系数。对于一个激发过程，用１０个参数可以得到碰撞电子在任意能量下的碰撞强度以及任意温度下的速率系数。     

一种改进的计算探测器校正因子的相关抽样方法

对于小尺寸探测器处于大块介质的情形, 在探测器的校正因子的Monte Carlo模拟中, 存在两个难题: 一是由于探测器尺寸很小粒子难以到达探测器并发生碰撞; 二是两个随机变量比值难以达到要求精度. 本文使用经过改进的粒子碰撞自动重要抽样方法, 再结合相关抽样方法, 解决了这两个难题, 并在MCNP-4C程序平台上加以实现. 除了粒子碰撞自动重要抽样以外, 还选用了其他3种方法: 直接模拟、区域分裂、强迫碰撞+Dxtran球分别与相关抽样方法结合, 对一个简化的探测器校正因子计算模型进行了计算. 实际计算结果表明, 相关抽样方法无论与哪种方法结合, 都起到了提高相关量计算效率的作用; 而它与粒子碰撞自动重要抽样结合, 比其他方法具有明显的优越性.     

基于多信道预约可冲突避免的多址接入协议

本文为多跳分布多无线网络提出了一套灵活而有效的自适应获取冲突避免（AACA）的多址接入协议。在该协议中，各节点竞争公共信道，利用RTS/CTS对话形式来预约各业务信道，成功预约后的分组传输不会受到其他节点的干扰。它使用任意确定数目信道，以异步方式工作，并且使得各节点利用半双工无线电台就可以灵活、简便地实现资源预约。分析和比较结果说明，所提出的多信道预约协议可以有效地解决隐藏终端、暴露终端以及侵入终端的问题。     

浙江中部夏熟作物田主要杂草生态相似性的数量分析

应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查，将所得数据转换成重要值，以杂草在27个样点中的重要值为运算指标，应用主成分分析法和图论聚类中的最小生成树法，对24种杂草的生态学相似性进行了比较，指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因：杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。     

形式化语言在UMTS开发中的应用

由于3G协议规范的复杂性，3GPP方法论指导方针中鼓励使用标准的形式化语言来进行UMTS产品的设计、开发与测试。文中概要性地描述了UMTS的体系结构和在规范描述中用到的一些形式化语言的基本概念和特点，探讨了这些形式化语言在UMTS开发中的应用。使用形式化语言开发UMTS可以简化和改进测试程序，实现新产品与新标准的同步推出。     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.