光子晶体在座舱罩雷达散射截面减缩中的应用

提出一种金属 介质型光子晶体薄膜，用传输矩阵法计算这种光子晶体薄膜的反射率和透射率。计算结果表明，这种光子晶体薄膜对毫米和厘米量级的微波的反射率高达99％以上；对于波长为微米量级的可见光，平均透光率为50％。分析了介质单元厚度、金属单元厚度、金属层总厚度对透射率的影响，给出这种光子晶体薄膜的材料选择和结构设计应遵循的原则。指出这种光子晶体薄膜涂镀在飞机座舱玻璃上，可以有效地减小座舱罩的雷达散射截面。     

校正空间分块镜复位误差所需的最少自由度的确定

可收展式分块镜共相位成像技术是实现光学系统超大口径、超高分辨率成像的关键技术。分块镜复位误差会引起各子镜之间的共相位误差和整个拼接镜面的面形误差。合理确定校正分块镜复位误差所需的自由度具有非常重要的意义。计算机仿真分析了分块镜的复位误差对拼接镜面面形误差的影响。结果表明,所需的校正自由度的个数不仅与展开机构的复位精度有关,而且与分块镜镜面的几何参数有关。     

一种可能的简并谱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.