基于半像素错位的多幅图像重建高分辨率图像技术研究

介绍了一种基于半像素错位的多幅图像重建高分辨率图像技术。分析了半像素错位的多幅图像与高分辨率图像各像素灰度值的对应关系 ,并从CCD数字化采样的角度进行了论证。同时 ,结合实际摄像机CCD结构 ,求出了高分辨率图像重建的计算公式 ,并通过实验进行了验证和完善。重建的本质是以原高分辨率图像的 4邻域平均图像为基础 ,增加一定比例的边缘细节信息 ,去接近原高分辨率图像。CCD的动态范围越大 ,图像的灰度级越多 ,那么计算误差就越小 ,图像的边缘细节信息就可以利用更多 ,重建的图像就越接近原高分辨率图像。通过实验和分析表明 ,利用半像素错位的多幅低分辨率图像重建高分辨率图像的原理是正确的 ,方案是可行的     

How to Express a Parallel Sum of k Matrices

We present an alternative expression for the parallel sum of k Hermitian nonnegative definite matrices by using the Moore-Penrose inverse of a block matrix.     

用区域分解算法结合蒙特卡罗法求坦克温度场和红外辐射出射度

本文将区域分解算法和蒙特卡罗法相结合，求坦克温度场和红外辐射出射度．采用蒙特卡罗法计算辐射传递系数，可以考虑界面的复杂辐射特性，如：镜反射、各向异性发射、各向异性反射等；可直接考虑界面的复杂几何特性，如:相互遮挡、太阳入射方向上的投影面积等．引入辐射传递系数，分离了计算的难点，使得在时间域（计算步骤）上能把整个问题分解为若干个子问题并行处理、在空间域（计算区域）上将坦克分解为若干个子区域，缩小计算规模，并可使用多个处理器并行计算；同时减轻了蒙特卡罗法编程的难度，缩短了计算时间．     

The implementation of ab initio quantum chemistry calculations on transputers

Summary The RHF and geometry optimization sections of the ab initio quantum chemistry code, GAMESS, have been optimized for a network of parallel microprocessors, Inmos T800-20 transputers, using both indirect and direct SCF techniques. The results indicate great scope for implementation of such codes on small parallel computer systems, very high efficiencies having been achieved, particularly in the cases of direct SCF and geometry optimization with large basis sets.The work, although performed upon one particular parallel system, the Meiko Computing Surface, is applicable to a wide range of parallel systems with both shared and distributed memory.     

高俘获效率电子辐照加速器的设计研究

加速管是一台加速器的核心部分. 一般电子辐照加速器的俘获效率在50%左右, 一半的电子都损失在加速管内. 丢失的电子打在加速管内壁, 产生轫致辐射、腔体发热量增加、真空变坏等许多负面影响. 采用一段等梯度加速结构, 相速沿加速管呈线形增加,调整相速变化规律及加速管腔体的尺寸参数, 设计出的加速管最终的俘获效率提高到90%以上, 同时平均加速梯度没有因此降低, 加速管总长度没有增加.     

局部对称共形平坦黎曼流形中具有平行平均曲率向量的子流形

本文把[1]的结论推广到了环绕空间是局部对称共形平坦的情形,即获得了:设M~是局部对称共形平坦黎曼流形N~+p(p>1)中具有平行平均曲率向量的紧致子流形,如果则M~位于N~+p的全测地子流形N~+1中。其中S,H分别是M~的第二基本形式长度的平方和M~的平均曲率,T_C、t_c分别是N~+p的Ricci曲率的上、下确界,K是N~+p的数量曲率。     

A Comparative Study on Dynamic and Static Sparsity Patterns in Parallel Sparse Approximate Inverse Preconditioning

Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. This revised version was published online in July 2006 with corrections to the Cover Date.     

一种高性能数字显微图像分析系统

给出了基于Windows操作系统的24位真彩色通用的高性能显微图像检测与分析软件系统，它采用先进的图像处理和形态分析算法，能对各种显微图像进行处理、分析和检测；并具有友好的操作界面、性能稳定等特点，可为材料、冶金、医药、生物、化工等相关领域的用户提供便捷的显微图像分析及处理测量工具。     

A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.