基于多Agent动态影响图的协作实现

将MAIDs在时间上进行扩展,提出一种新决策模型——多Agent动态影响图（MADIDs）,对动态环境中的协作关系进行建模;给出MADIDs的一种分层分解的分布近似方法,进而通过将决策结点和效用结点的推理引入到BK算法中,给出MADIDs环境模型的一种扩展BK（EBK）近似推理算法;引入一种BP神经网络学习MADIDs的局部效用函数。最后,针对一个表示协作关系的MADID模型,进行算法比较和仿真实验,实验结果显示了MADIDs模型的有效性。     

中国牡丹的输出及其在国外的发展 Ⅱ:野生牡丹

报道了中国野生牡丹向国外（主要是欧美）输出及其后发展的情况，并探讨了如何利用野生种质资源培育新品种的问题：欧美利用黄牡丹（Ｐａｅｏｎｉａｌｕｔｅａ）和紫牡丹（Ｐｄａｌａｖａｙｉ）与普通牡丹（Ｐｓｕｆｆｒｕｔｉｃｏｓａ）杂交已取得巨大成就；大花黄牡丹（Ｐｌｕｄｌｏｗｉ）、狭叶牡丹（Ｐｐｏｔａｎｉｎｉ）、紫斑牡丹（Ｐｒｏｃｋｉ）和杨山牡丹（Ｐｏｓｔｉ）等野生种在育种中应用的潜力很大．丰富花色、延长花期、扩大裁培范围等育种问题，均可利用野生种质资源加以解决．     

利用谱方法的多路选择器树形网络设计

讨论了逻辑函数的Walsh谱的一种分解方法,以及Walsh变换的一种快速并行算法,这种算法可在真值表阵列上方便地实现.给出了利用Walsh谱方法进行多路选择器树形网络设计的一种方法,这种方法可以使待设计的多路选择器网络成为最小树形网络,并且容易实现多路选择器网络的自动综合.     

城市交通网络中商业街的选址分析与计算

商业街在城市交通网络体系中的选址是商业街布局的重要方面。本文提出交通网络商业街选址问题并建立数学模型，给出了两种选址原则：（1）城市中所有节点至商业街（只需要达到商业街的其中一个节点）之间的最短路径之和最小。（2）城市中所有点对之间过商业街的最短路径之和最小。针对以上两个方面，分另4给出其计算方法，并进行了算法的时间和空间复杂性分析。     

树型传输网单故障分支识别的节点分析算法

本文提出了树型传输网单故障分支识别的一种新算法──节点分析算法，该算法使编制故障分支识别的组态软件变得简单、可行。     

一种群决策中确定专家判断认真程度的方法

给出一种群决策中确定专家判断认真程度的方法。主要思路是通过提取专家判断矩阵的全部信息，确定专家意见的一致程度，从而确定专家判断的认真程度。最后给出一个典型的算例以说明该方法的可行性和有效性。     

林农复合系统中的种群共存增益和林分控制

通过在江苏省里下河地区连续８年的试验，发现林农复合系统生产力的提高主要来自资源共亨增益和林木生产增益。前者通过资源开发途径，后者通过物种间的互利作用。在３年生林分中，人增益占复合经营总生物量的７７．１－８１．４％，但随林龄增加面降低。而间作引起的林木生长量增加的比值低于３．３％，但随林增加有所提高。根据资源共享增益和林木生长增益，确定了随机冠投影面积变化庆进行的林分结构的最佳控制数值。     

The generation of random,binary unordered trees

Several techniques are given for the uniform generation of trees for use in Monte Carlo studies of clustering and tree representations. First, general strategies are reviewed for random selection from a set of combinatorial objects with special emphasis on two that use random mapping operations. Theorems are given on how the number of such objects in the set (e.g., whether the number is prime) affects which strategies can be used. Based on these results, methods are presented for the random generation of six types of binary unordered trees. Three types of labeling and both rooted and unrooted forms are considered. Presentation of each method includes the theory of the method, the generation algorithm, an analysis of its computational complexity and comments on the distribution of trees over which it samples. Formal proofs and detailed algorithms are in appendices.     

A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance

We propose a development stemming from Roux (1988). The principle is progressively to modify the dissimilarities so that every quadruple satisfies not only the additive inequality, as in Roux's method, but also all triangle inequalities. Our method thus ensures that the results are tree distances even when the observed dissimilarities are nonmetric. The method relies on the analytic solution of the least-squares projection onto a tree distance of the dissimilarities attached to a single quadruple. This goal is achieved by using geometric reasoning which also enables an easy proof of algorithm's convergence. This proof is simpler and more complete than that of Roux (1988) and applies to other similar reduction methods based on local least-squares projection. The method is illustrated using Case's (1978) data. Finally, we provide a comparative study with simulated data and show that our method compares favorably with that of Studier and Keppler (1988) which follows in the ADDTREE tradition (Sattath and Tversky 1977). Moreover, this study seems to indicate that our method's results are generally close to the global optimum according to variance accounted for.We offer sincere thanks to Gilles Caraux, Bernard Fichet, Alain Guénoche, and Maurice Roux for helpful discussions, advice, and for reading the preliminary versions of this paper. We are grateful to three anonymous referees and to the editor for many insightful comments. This research was supported in part by the GREG and the IA² network.     

基于决策树的轨道电路故障诊断知识表示方法研究

针对ZPW-2000A无绝缘轨道电路故障逻辑机理模糊的问题,本文采用了基于决策树的轨道电路专家系统知识表示方法.该方法首先将轨道电路故障影响较大的特征向量样本建立故障决策表,然后运用最小信息熵算法对属性值离散化,根据决策树算法快速学习及分类的特点对离散后的数据样本进行训练学习,生成故障决策树后进行知识规则的获取,在专家系统的知识库中以产生规则存储.通过对ZPW-2000A无绝缘轨道电路的实例分析验证了该方法在轨道电路专家系统知识表示与获取中的有效性和实用性.