关于Kruskal算法的一种新实现

通过给网络G的每一个顶点赋予一个所在连通分支编号的方法 ,来判定每条边的加入是否构成圈 ,讨论了Kruskal算法中判定圈的新途径 ,给出了Kruskal算法的一种新的实现方法     

Unique Solvability of Certain Hybrid Networks from Their Distances

Phylogenetic relationships among taxa have usually been represented by rooted trees in which the leaves correspond to extant taxa and interior vertices correspond to extinct ancestral taxa. Recently, more general graphs than trees have been investigated in order to be able to represent hybridization, lateral gene transfer, and recombination events. A model is presented in which the genome at a vertex is represented by a binary string. In the presence of hybridization and the absence of convergent evolution and homoplasies, the evolution is modeled by an acyclic digraph. It is shown how distances are most naturally related to the vertices rather than to the edges. Indeed, distances are computed in terms of the “originating weights” at vertices. It is shown that some distances may not in fact correspond to the sum of branch lengths on any path in the graph. In typical applications, direct measurements can be made only on the leaves, including the root. A study is made of how to infer the originating weights at interior vertices from such information. Received August 18, 2004     

一种动态的决策树算法研究

通过对SPRINT、RAINFOREST等传统决策树算法改进，使其能够适应不断生长的训练集，生成一棵与旧树相关的树；改进后的算法，新样本一来即可处理，随时产生一个相关的决策树，并且此树还不断优化，具有实时性．     

Fast heuristics for the Steiner tree problem with revenues,budget and hop constraints

This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed.     

The minimum spanning tree problem with fuzzy costs

In this paper the minimum spanning tree problem in a given connected graph is considered. It is assumed that the edge costs are not precisely known and they are specified as fuzzy intervals. Possibility theory is applied to characterize the optimality of edges of the graph and to choose a spanning tree under fuzzy costs.     

A characterization of the folk rule for multi-source minimal cost spanning tree problems

In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tree problems with multiple sources. The properties we need are: cone-wise additivity, cost monotonicity, symmetry, isolated agents, and equal treatment of source costs.     

Unified Noncrossing Multiple Quantile Regressions Tree

In this article, we consider the estimation problem of a tree model for multiple conditional quantile functions of the response. Using the generalized, unbiased interaction detection and estimation algorithm, the quantile regression tree (QRT) method has been developed to construct a tree model for an individual quantile function. However, QRT produces different tree models across quantile levels because it estimates several QRT models separately. Furthermore, the estimated quantile functions from QRT often cross each other and consequently violate the basic properties of quantiles. This undesirable phenomenon reduces prediction accuracy and makes it difficult to interpret the resulting tree models. To overcome such limitations, we propose the unified noncrossing multiple quantile regressions tree (UNQRT) method, which constructs a common tree structure across all interesting quantile levels for better data visualization and model interpretation. Furthermore, the UNQRT estimates noncrossing multiple quantile functions simultaneously by enforcing noncrossing constraints, resulting in the improvement of prediction accuracy. The numerical results are presented to demonstrate the competitive performance of the proposed UNQRT over QRT. Supplementary materials for this article are available online.     

The distribution of height and diameter in random non‐plane binary trees

This study is dedicated to precise distributional analyses of the height of non‐plane unlabelled binary trees (“Otter trees”), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size n is proved to admit a limiting theta distribution, both in a central and local sense, and obey moderate as well as large deviations estimates. The approximations obtained for height also yield the limiting distribution of the diameter of unrooted trees. The proofs rely on a precise analysis, in the complex plane and near singularities, of generating functions associated with trees of bounded height. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

落叶松受雅氏落叶松尺蠖危害程度光谱检测

近年来蒙古国雅氏落叶松尺蠖灾害不断加剧，逐渐逼近大兴安岭地区，将威胁我国北方森林生态系统安全。以现代遥感监测方法替代传统检测方法，及早掌握该虫害发生发展规律对防控有重要意义。为快速、大范围遥感监测雅氏落叶松尺蠖灾害，利用光谱分析技术研究了该害虫危害下落叶松受害程度检测模型。通过实测健康和轻度、中度、重度受害落叶松光谱，计算与比较不同受害程度落叶松原始光谱和去除包络线光谱的敏感度，揭示光谱敏感波段及去除包络线光谱敏感性。然后对去除包络线光谱进行一阶导数变换获得光谱特征参数并分析其随受害程度的变化特征，构建基于CART(分类与回归树)算法的落叶松受害程度光谱检测模型。研究表明：去除包络线光谱敏感性比原始光谱更显著，尤其在480～520 nm(蓝边)、640～720 nm(红谷、红边)、1 416～1 500 nm(短波红外谷)等波段内光谱敏感度介于0.1～2.0，而且出现了敏感峰现象。随受害程度增加，去除包络线光谱敏感性增强趋势比原始光谱更明显；在蓝边波段上去除包络线光谱敏感峰位置向短波方向移动，即502 nm→490 nm，而在红谷及红边、短波红外谷等波段上光谱敏感峰位置向长波方向移动，即664 nm→672 nm和1 436 nm→1 448 nm；红谷位置和短波红外谷位置归一化反射率以及红谷和短波红外谷面积呈上升趋势。在蓝边与红边波段内去除包络线光谱一阶导数对受害程度有明显响应，出现了波峰现象。随害虫危害程度加剧红边位置蓝移(718 nm→700 nm)，红边斜率及面积和蓝边斜率及面积呈下降趋势。基于此，利用红边斜率、红谷位置和短波红外谷位置归一化反射率、红谷和短波红外谷面积、蓝边斜率及面积等去除包络线光谱特征参数构建的CART模型对落叶松受害程度有很好的检测能力。与多元线性回归模型相比，CART模型检测精度更高，其Kappa系数达0.875。研究结果对雅氏落叶松尺蠖灾害的防治有参考价值。