排气全燃型联合循环设计点性能简明估计公式

排气全燃型联合循环设计点性能简明估计公式蔡睿贤（中国科学院工程热物理研究所北京１０Ｏ０８０）关键词：排气全燃型联合循环，热力分析主要符号表Ｈｕ燃料热值Ｌ燃料理论空气量ｌ比功Ｐ单位能量价格Ｒ燃气轮机与蒸汽轮机的功率比α过量空气系数β摩尔燃料系数△增量η...     

我国AB股双重上市公司经营业绩变化的实证分析

本文以46家在上海和深圳同时上市AB股的公司的样本,分析了公司实行双重上市前1年及其后4年的经营业绩的变化趋势以及股权结构和上市顺序对它的影响。研究表明,双重上市当年及其后4年经营业绩显著下降;股权结构和上市顺序对公司经营业绩影响明显。最后,文章提出了改善AB股公司经营业绩的对策建议。     

矩阵方程（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     

Construction of best Bregman approximations in reflexive Banach spaces

An iterative method is proposed to construct the Bregman projection of a point onto a countable intersection of closed convex sets in a reflexive Banach space.

     

Stationary Distributions of GI/M/c Queue with PH Type Vacations

We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies.     

Convergent Algorithm Based on Progressive Regularization for Solving Pseudomonotone Variational Inequalities

In this paper, we extend the Moreau-Yosida regularization of monotone variational inequalities to the case of weakly monotone and pseudomonotone operators. With these properties, the regularized operator satisfies the pseudo-Dunn property with respect to any solution of the variational inequality problem. As a consequence, the regularized version of the auxiliary problem algorithm converges. In this case, when the operator involved in the variational inequality problem is Lipschitz continuous (a property stronger than weak monotonicity) and pseudomonotone, we prove the convergence of the progressive regularization introduced in Refs. 1, 2.