Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

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.     

Biham–Middleton–Levine model with four-directional traffic

We study the four-directional traffic flow on a two-dimensional lattice. In the case of discrete densities, we assume equal number of vehicles in each lane. Except for the minimum density, the gridlock emerges swiftly. Two kinds of gridlock have been observed. The global gridlock dominates the system when the density is twice the minimum value. At higher densities, the system is pervaded by local gridlocks. We also analyze the time evolution of average speed. In the case of continuous densities, the vehicle numbers vary from lane to lane. The global gridlock is then destroyed by the fluctuations; while the local gridlock can still be observed.     

树映射的分布混沌

设T是个有限树,f是T上的连续映射．证明了f是分布混沌的当且仅当它的拓扑熵是正数．一些已知结论得到了改进．     

Decomposition algorithms for the tree edit distance problem

We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.     

The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands

By showing that there is an upper bound for the price of anarchyρ(Γ) for a non-atomic congestion game Γ with only separable cost maps and fixed demands, Roughgarden and Tardos show that the cost of forgoing centralized control is mild. This letter shows that there is an upper bound for ρ(Γ) in Γ for fixed demands with symmetric cost maps. It also shows that there is a weaker bound for ρ(Γ) in Γ with elastic demands.     

Correlation of mercury concentrations in tree core and lichen samples in southeastern Louisiana

To determine if a correlation exists between mercury concentrations in lichens and wood from tree cores, tree core and lichen samples were taken from sites under mercury advisories and analyzed for mercury using a Bacharach 50B Mercury Analyzer System employing the Manual Cold Vapor Atomic Absorption EPA method 7471A. Wood from tree cores was dated using tree ring data. Wood samples from the cores were analyzed for various depths in the tree core (periods of time) to determine if variations occur throughout the cores. Preliminary data indicate that a strong correlation exists between mercury concentrations in tree core and lichen samples. Samples were analyzed for the 6-month period of summer 2003–winter 2004. A correlation coefficient of 0.882 was found between the tree core and lichen data sets. The derived correlations were used to estimate concentrations of mercury in tree rings for sites in lichen samples which were previously analyzed. These predicted values compared favorably to recently determined concentrations of Hg in tree cores. The strong correlation between lichen and tree core Hg concentrations suggests similar uptake mechanism for the two types of biota.     

Two-worker blocking congestion model with walk speed m in a no-passing circular passage system

This paper introduces a blocking model and closed-form expression of two workers traveling with walk speed m (m = integer) in a no-passing circular-passage system of n stations and assuming n = m + 2, 2m + 2, …. We develop a Discrete-Timed Markov Chain (DTMC) model to capture the workers’ changes of walk, pick, and blocked states, and quantify the throughput loss from blocking congestion by deriving a steady state probability in a closed-form expression. We validate the model with a simulation study. Additional simulation comparisons show that the proposed throughput model gives a good approximation of a general-sized system of n stations (i.e., n > 2), a practical walk speed system of real number m (i.e., m ? 1), and a bucket brigade order picking application.     

基于错误矩阵方程的解决城市交通拥堵决策研究

针对解决城市交通拥堵决策问题,首先给出了错误优化矩阵的概念,在此基础上引出错误矩阵方程的概念,利用消错理论中的错误优化矩阵方程,从错误优化的角度来研究并解决城市交通拥堵的决策方法.相应结合实际状况给出当前状态矩阵,从而进行下一步的求解,步步推理获得了决策人满意的方案集,为决策者提供最优建议.