Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002     

用于强磁场的快响应真空规的研制进展

研制了能在强磁场、强干扰环境下工作的快响应真空电离规(快规),用于对HL 2A装置偏滤器室和等离子体附近的中性粒子密度和通量进行原位测量。介绍了快规的结构、工作原理、设计要点以及实验结果。在无磁场的情况下,快规对气体压强的测量范围为6.4×10-6～0.15Pa,在1×10-5～0.15Pa范围内,快规收集极离子流与发射电子流之比与气压保持良好线性关系;在0 15T的磁场下,快规的规管常数未发生显著变化,在规管对称轴与磁力线的夹角小于15o时,规管常数的变化小于10%。     

Fourier-Feynman transform, convolution and first variation

We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral. This revised version was published online in June 2006 with corrections to the Cover Date.     

苯对N,N-二甲基甲酰胺化合物~1H NMR的影响研究

本文研究了N,N-二甲基甲酰胺(DMF)在四氯化碳和苯混合溶剂中的~1H NMR。观察到N,N-二甲基甲酰胺(DMF)分子中两个甲基和混合溶剂中苯的共振吸收峰的化学位移随苯的摩尔分数增加而逐渐移向高场,而且两个甲基共振吸收峰向高场移动的程度不同,α甲基较β甲基为甚。DMF分子中两个甲基和混合溶剂中苯的化学位移可以用线性方程表示(δ=A+Bx),这里x是混合溶剂中苯的摩尔分数。相关系数R接近于-1。     

Simplified analytic solutions and a novel fast algorithm for Yb-doped double-clad fiber lasers

In this paper, continuous wave Yb³⁺-doped double-clad fiber lasers (DCFLs) with linear-cavity are investigated theoretically and numerically using the rate equations. Under the steady state conditions, the simplified analytic solutions of Yb³⁺-doped DCFLs under considering the scattering loss are deduced in the strongly pump condition. Compared with the known analytic solutions in published literatures, our analytic solutions are more accurate, especially, at higher reflectivity of output mirror. In addition, a fast and stable algorithm based on the Newton-Raphson method is proposed to simulate numerically Yb³⁺-doped DCFLs. The results by simplified analytic solutions are in good agreement with those by the numerical simulation. Moreover, we have performed the optimization of an Yb³⁺-doped DCFL using the simplified analytic solutions and the numerical simulations, respectively.     

聚变等离子体中的快离子压强

本文运用Fokker-Planck方程的慢化近似,考虑存在多种离子成份(包括杂质),假定它们具有共同的温度,我们得到了聚变产生的快离子压强的简单封闭形式表示式。表明在典型的工作温度下(～60keV),D-~3He等离子体中聚变产生的快离子压强约为本底热压强的20％,这与D-T等离子体工作在20keV时的比值几乎相同。因此,D-~3He和D-T在它们相应的预期工作温度下,它们各自的快离子压强对总压强的影响是类似的,然而在更高的温度下,这个比值将变得更大。     

用于快点火研究的超短脉冲的相干合成

 利用傅里叶光学方法，建立了一个基于远场的多束超短脉冲相干合成的理论模型。研究了一个口径为50 cm，脉宽为1 ps的超短脉冲相干合成系统的各种误差对脉冲远场时域和空域特性的影响。结果表明：若要求远场的一倍衍射极限区域的积分能量分布达到理想情况下的90％，该系统的相位延迟误差小于0.63，沿x方向角度误差小于0.37 μrad，沿y方向角度误差小于0.34 μrad；若要求远场叠加脉冲的时域展宽小于25％，系统的剩余啁啾因子应小于1.32(不考虑相位延迟)或1.52(考虑0.63的相位延迟)。     

n维广义函数的集值导数

本文将文献［9］中给出的一维广义函数的集值导数的某些结果，推广到n维情形，并给出一些与优化有关的其他结果．     

The PDE-preserving operators on nuclearly entire functions of bounded type

The PDE-preserving operators O on the space of nuclearly entire functions of bounded type H_Nb(E) on a Banach space E are characterized. An operator is PDE-preserving when it preserves homogenous solutions to homogeneous convolution equations. We establish a one to one correspondence between O and a set Σ of sequences of entire functionals, i.e. exponential type functions. In this way, algebraic structures on Σ, such as ring structures, can be carried over to O and vice versa. In particular, it follows that O is a non-commutative ring (algebra) with unity with respect to composition and the convolution operators form a commutative subring (subalgebra). We discuss range and kernel properties, for the operators in O, and characterize the projectors (onto polynomial spaces) in O by determining the corresponding elements in Σ. This revised version was published online in June 2006 with corrections to the Cover Date.     

Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation

PS_N is a fast forward permutation if for each m the computational complexity of evaluating P^m(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in S_N is Θ(N) if one does not use queries of the form P^m(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form P^m(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold.