抓好数学建模竞赛 推动数学教学改革

本文通过近几年组织数学建模教学和指导学生参加竞赛的实践 ,探索抓好数学建模竞赛 ,促进数学教学改革 ,推动数学素质教育 ,提高人才培养质量的途径、措施和方法     

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

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

Separate Polarization Modes Synchronization and Synchronization Switches between Vertical-Cavity Surface-Emitting Lasers

For vertical-cavity surface-emitting lasers (VCSELs) with polarization-rotated feedback, there exist several synchronization types such as synchronizations between total powers and synchronizations between separate polarization modes. Based on the two-mode rate equations, we study and compare numerically the performances of different synchronization types. Our results show that three synchronization types exhibit good performances when their synchronization conditions are satisfied. They are the complete synchronization between total powers, complete synchronization between x-polarized modes, and generalized synchronization between x-polarized and y-polarized modes. The former two types are sensitive to the injection rate and spontaneous emission, while the third type is contrary. Synchronization type with the best performance may switch from one to another, with changing of injection rate and spontaneous emission factor.     

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).     

增强型延迟反馈法控制低维混沌系统的解析研究

基于时间延迟反馈控制混沌系统的方法,提出一种增强型控制方案,并利用分析延迟系统产生Hopf分支条件的方法,给出这种方案控制低维连续自治混沌系统时,在达到控制目标的条件下,控制参数的一般解析关系.将这一方案和分析方法应用到两个混沌模型中,结果表明:采用修正的方案可以明显地改善控制混沌的效果和质量;解析分析的结果与实际数值计算的结果一致. 关键词： 延迟反馈 混沌控制 Hopf分支     

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.