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

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

重建吸收介质参数(ρ(3),α(3))(英)

本文考虑重建吸收介质的密度ρ（3）和吸收系数α（3）的双参数反演问题。通过波动方程特征积分的方法并引人辅助函数，我们得到了原反问题的一个等价的封闭的积分方程组。利用本文的反演方法，ρ（3）tα（3）可以由反射数据f（t）和透射数据g（t）在深度变量子下同时恢复出来。     

模糊集单调型分解定理

模糊集的分解集定理有两种形式，第一种形式与模糊集的λ—截集有关：Ａ＝其中Ａ＿λ是的λ—截集￣［１］．第二种形式与集合套有关：其中Ｈ（λ）为集合套￣［２］或者Ａ＝其中Ｈ（λ）为集合套，Ｑ为（０，１）的可列稠密子集＿［３］，．其实，这两种形式在本文提出的基本模糊集的概念下，可以统一起来成为任何模糊集可以分解为一些（可数或不可数）基本模糊集的和。不仅如此，本文还提出简单模糊集的概念，并证明了任何模糊集都可以表示成为可数个单调上升的简单模糊集的和，或等价地，可以表示成可数个单调上升的简单模糊集的极限，所用的证明方法是构造性的，所以对模糊集的结构也得出了一个清晰的认识．     

The dehydration of copper(II) acetate monohydrate

The thermal dehydration of copper(II) acetate hydrate has been studied between 353 and 406 K, over a range of humidities. The dehydration is controlled by nucleation-and-growth kinetics at low temperatures, with an activation energy of 154 kJ·mol⁻¹, which changes to contracting-disc kinetics at higher temperatures with a lower activation energy of 76 kJ·mol⁻¹. Frequency factors have also been derived; the value for the high temperature process is low (10⁷s⁻¹) and that for the low temperature step is high (10¹⁷s⁻¹). Optical microscopy has been used to clarify the bulk kinetics; there is evidence for a reactive layer at the surface of the decomposing solid. In celebration of the 60^th birthday of Dr Andrew K. Galwey     

A Characterization of Cosmological Time Functions

A characterization of time functions on a spacetime is made by using theMöbius equation. It is shown that a time function characterized in this wayyields past timelike geodesic incompleteness and local Lorentzian warpedproduct decomposition of spacetime, provided that the stress-energy tensoris a fluid. Also, by imposing additional assumptions on the stress-energytensor and global analytic structure of the spacetime, more restrictivedecompositions closer to Robertson–Walker spacetimes are obtained.     

矩阵方程（A^TXA，B^TXB=（C，D）的反对称解及其最佳逼近

本利用矩阵对的标准相关分解，得到了矩阵方程(A^TXB，B^TXB)=(C，D)反对称解存在的充分必要条件及通解表达式，同时给出了解关于已知矩阵的最佳逼近．     

布尔“复合函数”的Walsh循环谱和自相关函数

本文利用布尔随机变量联合分布的分解式给出了布尔“复合函数”和某布尔函数符合率的分解算式,由此求得了布尔“复合函数”的 Walsh循环谱和自相关函数的计算公式,公式清楚地表明了“复合”所得布尔函数的 Walsh循环谱与起“复合”作用的函数和被“复合”的各函数所有线性组合的 Walsh循环谱之间的关系、“复合”所得布尔函数的自相关函数与起“复合”作用的函数谱和被“复合”的各函数的谱及相关函数之间的关系,这两个公式在布尔函数的密码学性质研究中会有广泛的应用.     

ROBUSTNESS OF AN UPWIND FINITE DIFFERENCE SCHEME FOR SEMILINEAR CONVECTION-DIFFUSION PROBLEMS WITH BOUNDARY TURNING POINTS

We consider a singularly perturbed semilinear convection-diffusion problem with a boundary layer of attractive turning-point type. It is shown that its solution can be decomposed into a regular solution component and a layer component. This decomposi-tion is used to analyse the convergence of an upwinded finite difference scheme on Shishkin meshes.     

Calorimetric study of methane interaction with supported Pd catalysts

As supported palladium oxide catalysts present the best performances in methane combustion in lean conditions, microcalorimetric studies of the interaction between methane and palladium oxide or metallic palladium supported on Al₂O₃, ZrO₂ and BN have been performed at 673 K. At this temperature methane reduced the palladium oxide, and the heat of reduction of palladium oxide was shown to depend on the dispersion and on the support. The lowest heats of reduction corresponded to the highest rates of methane combustion. Moreover methane reforming occurred on metallic palladium, producing hydrogen, and again methane decomposition was shown to depend on the support. This revised version was published online in July 2006 with corrections to the Cover Date.     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003