90Mo电磁跃迁几率的测量

利用束流能量为116MeV的⁵⁹Co(³⁵Cl,2p2n)⁹⁰Mo反应布居⁹⁰Mo的高自旋态.用10台反康普顿HPGe探测器组成的探测阵列进行γγ符合测量.通过多普勒展宽峰的形状分析测定⁹⁰Mo高自旋态的寿命.在正宇称衰变系观察到增强的M1跃迁,推断I=13以上是扁椭形变.负宇称高自旋态具有大的B(E2)值,并随自旋增大而起伏变化.正、负宇称态之间的跃迁显示增大的E1跃迁,似有八极关联的可能.但是,⁹⁰Mo并不处在理论预言的存在八极形变的核区内.     

基于相对误差意义下的最小二乘法

最小二乘法一直广泛应用于科学技术各领域 ,但仅适用于等精度数据———因其评价依据是大致相同的绝对误差。而大多数科研及观测数据往往按被观测量的相对误差进行评价 ,即被观测量愈大 ,允许及实际测量误差也愈大。从这个意义上讲 ,若以相对拟合误差的平方和最小为条件 ,建立一套新的最小二乘法 ,那么当然可以期望新方法将具更广泛的用途和实际的意义。本文给出了新最小二乘法的实用结果     

四阶奇异摄动边值问题在自适应网格上的一致收敛分析

we study a difference scheme for the fourth-order singular pertur-bation differential equation on the Bakhvalov-Shishkin grid by Green‘‘s function.The method is shown to be uniformly convergent with respect to the perturbation parameter,of order N^-2 in the maxmum norm on Bakhvalov-Shishkin meshes.Numerical results support our theoretical results.     

双工移相器误差分析

本文定量地分析了各波片差相移误差对器件相移、隔离和损耗的影响。并对S波波段双工移相器进行了测试。相移实验表明理论计算与实验结果吻合。     

关于离散随机变量熵的一个上界

本文分析了离散随机变量熵与方差及有关微分熵的某种关系，给出了离散随机变量熵的一个上界，改进了Ｔ．Ｍ．Ｃｏｖｅｒ与Ｊ．Ａ．Ｔｈｏｍａｓ关于离散熵的上界的已有结果［１］，并以图和表的方式举出一些实例加以比较。     

波分复用波长路由节点的阻塞特性分析

利用概率统计理论的方法，从节点层次上定量分析了节点规模、复用波长数目以及波长转换对波分复用(WDM)波长路由网络中波长路由节点的影响。提出了基于概率统计的节点阻塞模型。数值结果突出表明波长转换能力越强的全光节点，其性能越优。为了提高网络资源的使用效率并增强全光网络的灵活性，必须实现全光网络中的虚波长路由波长转换器。通过数值计算找到了阻塞性能和代价的折中，研究中发现配置较低波长转换能力波长转换器的波长路由节点将会具备更强的性价比优势，当前在构建光通信系统时使用弱波长转换能力的光节点更可行。     

基于Internet的实时视频流的应用层QoS控制策略

分析了Internet上实时视频传输的特点，提出了基于Internet的实时视频流的应用层QoS控制策略，主要包括拥塞控制策略和差错控制策略以及相应的控制技术。在拥塞控制中，讨论速率控制和速率整形，速率控制主要是根据网络运行状态预测当前可用的带宽，并根据预测值调整视频速率，达到与可用带宽匹配；速率整形则是迫使发送端以码率控制算法规定的码率发送视频流。在差错控制中，则讨论了编码器差错复原、解码器错误隐藏和编码器／解码器交互的差错控制等控制策略。这些控制技术应用于终端系统并不需要路由器和网络的QoS支持，可以最大限度地提高视频质量。     

Multiscale methods for elliptic homogenization problems

In this article we study two families of multiscale methods for numerically solving elliptic homogenization problems. The recently developed multiscale finite element method [Hou and Wu, J Comp Phys 134 (1997), 169–189] captures the effect of microscales on macroscales through modification of finite element basis functions. Here we reformulate this method that captures the same effect through modification of bilinear forms in the finite element formulation. This new formulation is a general approach that can handle a large variety of differential problems and numerical methods. It can be easily extended to nonlinear problems and mixed finite element methods, for example. The latter extension is carried out in this article. The recently introduced heterogeneous multiscale method [Engquist and Engquist, Comm Math Sci 1 (2003), 87–132] is designed for efficient numerical solution of problems with multiscales and multiphysics. In the second part of this article, we study this method in mixed form (we call it the mixed heterogeneous multiscale method). We present a detailed analysis for stability and convergence of this new method. Estimates are obtained for the error between the homogenized and numerical multiscale solutions. Strategies for retrieving the microstructural information from the numerical solution are provided and analyzed. Relationship between the multiscale finite element and heterogeneous multiscale methods is discussed. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A NOTE ON THE BACKWARD ERRORS FOR INVERSE EIGENVALUE PROBLEMS

In this note,we consider the backward errors for more general inverse eigenvalus prob-lems by extending Sun‘‘‘‘s approach.The optimal backward errors defined for diagonal-ization matrix inverse eigenvalue problem with respect to an approximate solution,and the upper and lower bounds are derived for the optimal backward errors.The results may be useful for testing the stability of practical algorithms.     

Universal Alignment Probabilities and Subset Selection for Ordinal Optimization

We examine in this paper the subset selection procedure in the context of ordinal optimization introduced in Ref. 1. Major concepts including goal softening, selection subset, alignment probability, and ordered performance curve are formally introduced. A two-parameter model is devised to calculate alignment probabilities for a wide range of cases using two different selection rules: blind pick and horse race. Our major result includes the suggestion of quantifiable subset selection sizes which are universally applicable to many simulation and modeling problems, as demonstrated by the examples in this paper.