Solid-phase epitaxy of CaSi2 on Si(1 1 1) and the Schottky-barrier height of CaSi2/Si(1 1 1)

Thin Ca films were evaporated on Si(1 1 1) under UHV conditions and subsequently annealed in the temperature range 200–650 °C. The interdiffusion of Ca and Si was examined by ex situ Auger depth profiling. In situ monitoring of the Si 2p core-level shift by X-ray photoemission spectroscopy (XPS) was employed to study the silicide formation process. The formation temperature of CaSi₂ films on Si(1 1 1) was found to be about 350 °C. Epitaxial growth takes place at T≥400 °C. The morphology of the films, measured by atomic force microscopy (AFM), was correlated with their crystallinity as analyzed by X-ray diffraction (XRD). According to measurements of temperature-dependent I–V characteristics and internal photoemission the Schottky-barrier height of CaSi₂ on Si(1 1 1) amounts to qΦ_Bn=0.25 eV on n-type and to qΦ_Bp=0.82 eV on p-type silicon.     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph

We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

中国邮路问题的一个解法

本给出中国邮路问题的一个解法。虽然它仍只是初始方案，但因考虑了问题的足够信息，因而这种方案至少拉近了与最优解的距离。     

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

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

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.     

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

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