运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

Functional Limit Theorems for Multiparameter Fractional Brownian Motion

We prove a general functional limit theorem for multiparameter fractional Brownian motion. The functional law of the iterated logarithm, functional Lévy’s modulus of continuity and many other results are its particular cases. Applications to approximation theory are discussed.      

Little higgs models and T parity

Little Higgs models are an interesting extension of the Standard Model at the TeV scale. They provide a simple and attractive mechanism of electroweak symmetry breaking. We review one of the simplest models of this class, the Littlest Higgs model, and its extension with T parity. The model with T parity satisfies precision electroweak constraints without fine-tuning, contains an attractive dark matter candidate, and leads to interesting phenomenology at the Large Hadron Collider (LHC).     

The Level-split of the Two-level Entangled Atom in an Optical Field

The behavior of a two-level entangled atom in an optical field with circular polarization is studied in this paper. The interaction of an optical field and one of the entangled atoms is analyzed in detail. A general solution of the SchrAo¨Gdinger equation about the motion of the entangled atom is obtained. The properties of the action are dependent on the initial state of the atom. By detecting the entangled atom out of the field, we can obtain the state of the other atom moving in the field. It is shown that the state of the atom out of the field will influence the energies of the split-levels of the atom in the field.     

Lorentz-Compton佯谬与一个双赢判决性散射实验设计

通过对“可见光区域是否存在Compton效应”的讨论而进一步深化到经典条件下“光的量子理论能否包含光的经典电磁理论”的实验验证,发现了Lorentz-Compton佯谬,并基于逆Compton散射设计了一个敏感而又可行的双赢判决性散射实验来解决此佯谬。     

上海基础房价相关指标及走势的分析与研究

基础房价的相关指标及其走势一直是大众关心的热门话题．本文通过对上海基础房价相关指标的分析，建立了市场房价走势的两个数学模型．模型一：在相关性分析的基础上利用主成分分析消除指标间的共线性，再用回归拟合房价模型并进行预测；模型二：在相关性分析的基础上利用核估计方法预测出房价．继呵对2005年下半年的房价走势进行了预测，得出的结果与实际情况相吻合．     

Fast algorithms for determining the linear complexities of sequences over GF(pm) with the period 3n

In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p ^m) (any positive integer m) with the period 3n (n and p ^m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura algorithm, we can determine the linear complexity of any sequence over GF(p ^m) with the period 3n (n and p ^m − 1 are coprime) more efficiently.     

原子核电荷半径的新公式

结合原子核的电荷半径的实验数据,详细分析了描述原子核电荷半径的经验公式,表明电荷半径的Z^1/3律优于A^1/3律.更细致的考察发现,对于远离β稳定线的核素,电荷半径具有近似线性的同位旋相关性.由此得到的同位旋相关的Z^1/3公式更适合描述原子核的电荷半径.     

Measuring length of business cycles across countries using a new non‐stationary unit‐root cyclical approach

This article examines the length of the cycles in the gross domestic product (GDP) real per capita series of 15 countries by means of new statistical techniques based on unit root cycles. We propose tests for unit root cycles at each of the frequencies of the process. Using this approach, we are able to approximate the number of periods per cycle. The results show that the cycles have a periodicity of approximately six years when the disturbances are white noise. However, if we permit autocorrelation, they may also occur at smaller intervals of time. Copyright © 2006 John Wiley & Sons, Ltd.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.