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.     

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.     

一类经典”秘书问题”的推广

”秘书问题”在最优停时理论的发展中曾起过重要作用 ,实际中的一类问题与”秘书问题”有类似之处 ,但比”秘书问题”更复杂 .本文将经典”秘书问题”进行推广 ,建立了一类比经典”秘书问题”更有实际意义的模型 ,并给出了该类模型的解 .     

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

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

基于SPA的双枝模糊决策分析

将集对理论(SPA)与双枝模糊决策理论相结合,用集对分析的方法研究进行双枝模糊决策的方法,分别对双枝模糊决策因素域和双枝模糊决策的上枝、下枝和双枝进行了集对分析,给出了用SPA进行双枝模糊决策的性质,同时讨论了双枝模糊决策的动态分析方法,以及双枝模糊决策度强弱态势预测的方法,从而为双枝模糊决策理论的研究提供了新的视角和方法,为双枝模糊决策的应用提供了更方便的工具和更强的理论支持。     

Parametric multiple sequence alignment and phylogeny construction

Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences.     

Automorphisms of Green Orders and Their Derived Categories

In an earlier paper, Raphaël Rouquier and the author introduced the group of self-equivalences of a derived category. In the case of a Brauer tree algebra, we determined a nontrivial homomorphism of the Artin braid group to this group of self-equivalences. The class of Brauer tree algebras include blocks of finite group rings over a large enough field with cyclic defect groups. In the present paper we give an integral version of this homomorphism. Moreover, we identify some interesting arithmetic subgroups with natural groups of self-equivalences of the derived category.     

A Note on Cactus Trees: Variational vs. Recursive Approach

In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent.     

求解无线传感器网络路由问题的蚁群最优化算法及其收敛性

首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明．最后对找到最优解后信息素值的变化进行了分析．即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值．     

求解最小Steiner树的蚁群优化算法及其收敛性

最小Steiner树问题是NP难问题,它在通信网络等许多实际问题中有着广泛的应用．蚁群优化算法是最近提出的求解复杂组合优化问题的启发式算法．本文以无线传感器网络中的核心问题之一,路由问题为例,给出了求解最小Steiner树的蚁群优化算法的框架．把算法的迭代过程看作是离散时间的马尔科夫过程,证明了在一定的条件下,该算法所产生的解能以任意接近于1的概率收敛到路由问题的最优解．