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.     

32位MIPS微处理器中乘法器的设计和实现

在Booth算法的基础上,结合MIPS 4KC微处理器中的流水线结构和乘法器的工作过程,提出了一种改进的Booth乘法器的设计方法,并采用全制定方法实现,用这种方法实现的乘法器单元具有面积小、单元电路可重复性好、版图设计工作量小、功耗低等特点.     

Low‐gain adaptive stabilization of semilinear second‐order hyperbolic systems

In this paper low‐gain adaptive stabilization of undamped semilinear second‐order hyperbolic systems is considered in the case where the input and output operators are collocated. The linearized systems have an infinite number of poles and zeros on the imaginary axis. The adaptive stabilizer is constructed by a low‐gain adaptive velocity feedback. The closed‐loop system is governed by a non‐linear evolution equation. First, the well‐posedness of the closed‐loop system is shown. Next, an energy‐like function and a multiplier function are introduced and the exponential stability of the closed‐loop system is analysed. Some examples are given to illustrate the theory. Copyright © 2004 John Wiley & Sons, Ltd.     

Rolling of a non-homogeneous ball over a sphere without slipping and twisting

Consider the problem of rolling a dynamically asymmetric balanced ball (the Chaplygin ball) over a sphere. Suppose that the contact point has zero velocity and the projection of the angular velocity to the normal vector of the sphere equals zero. This model of rolling differs from the classical one. It can be realized, in some approximation, if the ball is rubber coated and the sphere is absolutely rough. Recently, J. Koiller and K. Ehlers pointed out the measure and the Hamiltonian structure for this problem. Using this structure we construct an isomorphism between this problem and the problem of the motion of a point on a sphere in some potential field. The integrable cases are found.      

The Hamiltonian Canonical Form for Euler-Lagrange Equations

Based on the theory of calculus of variation, some suffcient conditions are given for some Euler-Lagrangcequations to be equivalently represented by finite or even infinite many Hamiltonian canonical equations. Meanwhile,some further applications for equations such as the KdV equation, MKdV equation, the general linear Euler Lagrangeequation and the cylindric shell equations are given.     

Kuhn-Tucker条件与线性规划的对偶性

证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.     

Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.     

有界对称域上的Dp乘子

设Ω是Cⁿ中包含原点的有界对称域。本文在Ω上得到了关于D^p空间的两个乘子定理。     

电信运营市场上过度进入的供给分析

本文在分析光纤主干网和本地接入服务市场上电信运营商的供给行为的基础上,首先证明了拥有主干网的运营商愿意租出自己的部分光纤,接着分析证明了上述两市场上使投资更倾向于过度的乘数效应,并进一步证明网络外部性使乘数效应更加明显.旨在对我国电信运营市场发展给出一些参考意见.