一类相空间中的准几率分布函数系

定义了一类相空间中的准几率分布函数系，这个准几率分布函数系直接建立在具有更加广泛意义的量子相空间Schr?dinger方程解的基础之上，其中定义_α=αp-i?q和_α=(1-α)q+i?p.发现了两个有趣的关系.(1)建立的量子相空间Schr?dinger方程的解实际上是对函数φ(λ)exp［i(1-α)qp］做窗口Fourier变换.(2)这个窗口函数g(λ)起着选择窗口形式的作用，而且不同的窗口对应着不同的分布函数.当g(λ)是一个代表Gauss窗的Gauss函数的时候，准几率分布函数就是一个类似于Husimi的分布函数f^HL_α(q,p)；当g(λ)是一个表示椭圆的复函数时，准几率分布函数就是一个椭圆分布函数f^E_α(q,p)；再在g(λ)为复函数的基础上附加α=0，就可得到标准序分布函数f^S(q,p)、反标准序分布函数f^AS(q,p)和Wigner分布函数f^W(q,p)，此时g(λ)表示高度为1/12π?而长度为λ的矩形窗. 关键词： 窗口Fourier变换 相空间 Wigner分布函数     

BaWO_4晶体的拉曼光谱分析

BaWO4晶体是一种很有应用前景的喇曼激光晶体。本文根据对称性分类,用商群理论分析了Ba-WO4晶体的喇曼光谱。一个原胞中含有两个BaWO4分子,理论上有36个振动膜,和我们用群论计算得数目一致。其中有18支拉曼活性光学膜。我们测得了10支拉曼峰,并对测得的各个配置的拉曼峰进行了指认,其中X(ZZ)X配置921cm-1处的喇曼峰强度最强,线宽较窄,对于作为喇曼激光晶体来讲是很有益的。     

一种可能的简并谱NNS分布

利用随机矩阵理论,通过对一特殊情形的简并谱展开研究,得到了简并谱一种可能的最小相邻间距NNS分布函数．研究表明,由于简并的存在,简并谱不仅可分解成随机谱和规则谱两个子谱,同时还影响其规则谱,使规则谱的能级斥力减少．     

On Inequalities with Measures of Sobolev Type Embedding Theorems on Open Sets of the Real Axis

We consider some Sobolev-type spaces and obtain a necessary and sufficient condition for their embedding in a Lebesgue space.     

On c‐Bhaskar Rao designs with block size 4

Several new families of c‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a c‐BRD (υ,4,λ) are that: (1)λ_min=?λ/3 ≤ c ≤ λ and (2a) c≡λ (mod 2), if υ > 4 or (2b) c≡ λ (mod 4), if υ = 4 or (2c) c≠ λ ? 2, if υ = 5. It is proved that these conditions are necessary, and are sufficient for most pairs of c and λ; in particular, they are sufficient whenever λ?c ≠ 2 for c > 0 and whenever c ? λ_min≠ 2 for c < 0. For c < 0, the necessary conditions are sufficient for υ> 101; for the classic Bhaskar Rao designs, i.e., c = 0, we show the necessary conditions are sufficient with the possible exception of 0‐BRD (υ,4,2)'s for υ≡ 4 (mod 6). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 361–386, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10009     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

     

关于圈的完全正矩阵实现

本文给出了一个关联图为圈的非负、半正定矩阵A为完全正的一个充要条件.我们还证明了这样的矩阵A（当A为完全正时）的分解指数即为A的阶数.     

Properties of large-scale TIDs observed in Central China

This paper investigates the large scale travelling ionospheric disturbances (LSTIDs) using the observation data of an HF Doppler array located in Central China. The data observed in a high solar activity year (year 1989) are analyzed to obtain the main propagation parameters of LSTIDs such as period, horizontal phase velocity and propagating direction. Results are outlined as follows: Most of the LSTIDs propagate southward; others tend to propagate northward, mostly in summer; dispersion of most LSTIDs is matched with that of Lamb pseudomode, while others have the dispersion of long period gravity wave mode. The horizontal phase velocities of these two modes are about 220 and 450 m/s respectively. The analysis shows that LSTIDs are strongly pertinent to solar activity and space magnetic storms; thus the results presented here are significant for the research of ionospheric weather in mid-low latitude region.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.