On agreement forests

Tree rearrangement operations are widely used to measure the dissimilarity between phylogenetic trees with identical leaf sets. The tree bisection and reconnection (tbr) distance for unrooted trees can be equivalently defined in terms of agreement forests. For both the tbr distance and the less general subtree prune and regraft (spr) distance, we use such forests to derive new upper and lower bounds on the maximal possible distance between two trees with n leaves.     

Exact boundary controllability of nodal profile for quasilinear hyperbolic systems in a tree‐like network

In this paper, the exact boundary controllability of nodal profile is established for quasilinear hyperbolic systems with general nonlinear boundary and interface conditions in a tree‐like network with general topology. The basic principles for giving nodal profiles and for choosing boundary controls are presented, respectively. Copyright © 2011 John Wiley & Sons, Ltd.     

Minimum congestion spanning trees in bipartite and random graphs

The first problem considered in this article reads: is it possible to find upper estimates for the spanning tree congestion in bipartite graphs, which are better than those for general graphs? It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n 3 2 , where n is the number of vertices. The second problem is to estimate spanning tree congestion of random graphs. It is proved that the standard model of random graphs cannot be used to find graphs whose spanning tree congestion has order greater than n 3 2 .     

Fisher方程和Burgers-Fisher方程新的精确行波解

本文研究了Fisher方程和Burgers-Fisher方程.运用一种辅助微分方程方法,得到了这两种非线性偏微分方程新的精确行波解.     

Tree approximation of the long wave radiation parameterization in the NCAR CAM global climate model

The computation of Global Climate Models (GCMs) presents significant numerical challenges. This paper presents new algorithms based on sparse occupancy trees for learning and emulating the long wave radiation parameterization in the NCAR CAM climate model. This emulation occupies by far the most significant portion of the computational time in the implementation of the model. From the mathematical point of view this parameterization can be considered as a mapping R²²⁰→R³³ which is to be learned from scattered data samples (xⁱ,yⁱ), i=1,…,N. Hence, the problem represents a typical application of high-dimensional statistical learning. The goal is to develop learning schemes that are not only accurate and reliable but also computationally efficient and capable of adapting to time-varying environmental states. The algorithms developed in this paper are compared with other approaches such as neural networks, nearest neighbor methods, and regression trees as to how these various goals are met.     

利用推广的(G′/G)展开法求解(2+1)维BBM方程

利用推广的(G′/G)展开法,借助于计算机代数系统Mathematica,获得了(2+1)维BBM方程的丰富的显式行波解,分别以含两个任意参数的双曲函数、三角函数及有理函数表示.     

基于粗糙模糊集的聚类决策及应用

对基于粗糙模糊集的聚类问题进行了研究.首先,定义了粗糙模糊值与粗糙模糊集的相似度,给出了粗糙模糊集相似度的一般表达式;然后利用该公式构建了模糊相似矩阵,进而给出了粗糙模糊集的一种聚类方法;最后以实际算例说明了这种思想.     

Hierarchical structure of Turkey’s foreign trade

We examine the hierarchical structures of Turkey’s foreign trade by using real prices of their commodity export and import move together over time. We obtain the topological properties among the countries based on Turkey’s foreign trade during the 1996-2010 period by using the concept of hierarchical structure methods (minimal spanning tree, (MST) and hierarchical tree, (HT)). These periods are divided into two subperiods, such as 1996-2002 and 2003-2010, in order to test various time-window and observe the temporal evolution. We perform the bootstrap techniques to investigate a value of the statistical reliability to the links of the MSTs and HTs. We also use a clustering linkage procedure in order to observe the cluster structure much better. From the structural topologies of these trees, we identify different clusters of countries according to their geographical location and economic ties. Our results show that the DE (Germany), UK (United Kingdom), FR (France), IT (Italy) and RU (Russia) are more important within the network, due to a tighter connection with other countries. We have also found that these countries play a significant role for Turkey’s foreign trade and have important implications for the design of portfolio and investment strategies.     

Topology of the correlation networks among major currencies using hierarchical structure methods

We studied the topology of correlation networks among 34 major currencies using the concept of a minimal spanning tree and hierarchical tree for the full years of 2007-2008 when major economic turbulence occurred. We used the USD (US Dollar) and the TL (Turkish Lira) as numeraires in which the USD was the major currency and the TL was the minor currency. We derived a hierarchical organization and constructed minimal spanning trees (MSTs) and hierarchical trees (HTs) for the full years of 2007, 2008 and for the 2007-2008 period. We performed a technique to associate a value of reliability to the links of MSTs and HTs by using bootstrap replicas of data. We also used the average linkage cluster analysis for obtaining the hierarchical trees in the case of the TL as the numeraire. These trees are useful tools for understanding and detecting the global structure, taxonomy and hierarchy in financial data. We illustrated how the minimal spanning trees and their related hierarchical trees developed over a period of time. From these trees we identified different clusters of currencies according to their proximity and economic ties. The clustered structure of the currencies and the key currency in each cluster were obtained and we found that the clusters matched nicely with the geographical regions of corresponding countries in the world such as Asia or Europe. As expected the key currencies were generally those showing major economic activity.     

扰动Vakhnenko方程物理模型的行波解

研究了一类扰动Vakhnemko方程.给出了改进的渐近方法.首先, 对原模型系统对应的典型方程得到对应的行波解.其次, 引入一个泛函, 建立迭代关系式,将求解非线性问题转化为求解一系列的迭代序列.然后, 逐次地求出对应的解的近似式, 最后,得到了原扰动Vakhnemko模型行波解的任意次精度的近似展开式,并讨论了它的精度. 关键词： 泛函 行波解 Vakhnemko方程