Non-separating trees in connected graphs

Let T be any tree of order d≥1. We prove that every connected graph G with minimum degree d contains a subtree T^′ isomorphic to T such that G−V(T^′) is connected.     

Quasi-median hulls in Hamming space are Steiner hulls

A Hamming space Λⁿ consists of all sequences of length n over an alphabet Λ and is endowed with the Hamming distance. In particular, any set of aligned DNA sequences of fixed length constitutes a subspace of a Hamming space with respect to mismatch distance. The quasi-median operation returns for any three sequences u,v,w the sequence which in each coordinate attains either the majority coordinate from u,v,w or else (in the case of a tie) the coordinate of the first entry, u; for a subset of Λⁿ the iterative application of this operation stabilizes in its quasi-median hull. We show that for every finite tree interconnecting a given subset X of Λⁿ there exists a shortest realization within Λⁿ for which all interior nodes belong to the quasi-median hull of X. Hence the quasi-median hull serves as a Steiner hull for the Steiner problem in Hamming space.     

The clique-separator graph for chordal graphs

We present a new representation of a chordal graph called the clique-separator graph, whose nodes are the maximal cliques and minimal vertex separators of the graph. We present structural properties of the clique-separator graph and additional properties when the chordal graph is an interval graph, proper interval graph, or split graph. We also characterize proper interval graphs and split graphs in terms of the clique-separator graph. We present an algorithm that constructs the clique-separator graph of a chordal graph in O(n³) time and of an interval graph in O(n²) time, where n is the number of vertices in the graph.     

On the no-arbitrage condition in option implied trees

The aim of this paper is to discuss the no-arbitrage condition in option implied trees based on forward induction and to propose a no-arbitrage test that rules out the negative probabilities problem and hence enhances the pricing performance. The no-arbitrage condition takes into account two main features: the position of the node in the tree and the relation between the dividend yield and the risk-free rate. The proposed methodology is tested in and out of sample with Italian index options data and findings support a good pricing performance.     

An involution on increasing trees

We introduce a method to construct bijections on increasing trees. Using this method, we construct an involution on increasing trees, from which we obtain the equidistribution of the statistics ‘number of odd vertices’ and ‘number of even vertices at odd levels’. As an application, we deduce that the expected value of the number of even vertices is twice the expected value of the number of odd vertices in a random recursive tree of given size.     

Use of a tree‐structured hierarchical model for estimation of location and uncertainty in multivariate spatial data

Analysis and modeling of spatial data are of considerable interest in many applications. However, the prediction of geographical features from a set of chemical measurements on a set of geographically distinct samples has never been explored. We report a new, tree‐structured hierarchical model for the estimation of geographical location of spatially distributed samples from their chemical measurements. The tree‐structured hierarchical modeling used in this study involves a set of geographic regions stored in a hierarchical tree structure, with each nonterminal node representing a classifier and each terminal node representing a regression model. Once the tree‐structured model is constructed, given a sample with only chemical measurements available, the predicted regional location of the sample is gradually restricted as it is passed through a series of classification steps. The geographic location of the sample can be predicted using a regression model within the terminal subregion. We show that the tree‐structured modeling approach provides reasonable estimates of geographical region and geographic location for surface water samples taken across the entire USA. Further, the location uncertainty, an estimate of a probability that a test sample could be located within a pre‐estimated, joint prediction interval that is much smaller than the terminal subregion, can also be assessed. Copyright © 2014 John Wiley & Sons, Ltd.     

基于小波域三状态HMT模型的含噪图像增强

针对含噪图像增强问题,提出一种基于小波域三状态隐马尔可夫树模型的方法,采用三状态的高斯混合模型逼近小波系数的分布,不需要设定精确的阈值,依据期望最大算法训练得到的每个系数所属状态的后验概率,将系数区分为噪声系数、弱边缘系数和强边缘系数,然后通过抑制噪声系数,增强细节特征系数来达到对含噪图像增强的目的,并引入循环平移策略避免人工失真.通过对含噪的标准图像和人脑核磁共振图像进行仿真实验,并与几种经典的图像增强方法作视觉上的对比和定量分析.实验结果表明,本文所提出的方法具有很好的鲁棒性,在突出了图像中更多的细节信息的同时,可以有效抑制噪声.     

基于Contourlet域隐马尔可夫树模型的图像融合算法

本文提出一种基于Contourlet域隐马尔可夫树(HMT)模型的图像融合算法。由于Contourlet变换能克服小波变换在处理高维信号时的不足,它比小波变换具有更好的方向性、较高的逼近精度和更好的稀疏表达性能。而HMT模型能有效捕获尺度间、尺度内的contourlet系数特性。因此将Contourlet域HMT模型应用于图像融合领域,能充分挖掘数据之间的相关性,更好的提取图像边缘特征,为融合提取更多的特征信息。实验结果表明本文的算法获得的融合图像视觉效果良好,是一种有效且可行的融合算法。     

New approach for amplitudes with multiple fermion lines

A new approach for tree-level amplitudes with multiple fermion lines is presented. It primarily focuses on the simplification of fermion lines. By calculating two vectors recursively without any matrix multiplications, the result of a fermion line is reduced to a very compact form depending only on the two vectors. Comparisons with other packages are presented, and the results show that our package FDC provides a very good performance in the processes of multiple fermion lines with this new approach and some other improvements. A further comparison with WHIZARD shows that this new approach has a competitive efficiency in computing pure amplitude squares without phase space integration.     

有向树的部分逆M矩阵完备及其算法设计

1 引言 M矩阵是具有非正非对角元且其逆是非负矩阵的一类矩阵．逆M矩阵是逆为M矩阵的一类非负矩阵．部分矩阵是指一个矩阵中一些元已定,其余未定元还可以自由选择的矩阵．如果在一个部分矩阵中,其每个已定的主子矩阵均为逆M矩阵并且所有已定元均是非负的,称这个部分矩阵是一个部分逆M矩阵．一个部分逆M矩阵的完备式是对