闭排队网络中性能势与无穷小实现因子之间的关系

In this paper,the concept of the infinitesimal realization factor is extended to the parameter-dependent performance functions in closed queueing networks. Then the concepts of realization matrix (its elements are called realization factors) and performance potential are introduced,and the relations between infinitesimal realization factors and these two quantities are discussed. This provides a united framework for both IPA and non IPA approaches. Finally,another physical meaning of the service rate is given.     

Matrix effects in the determination of butyltin compounds in environmental samples by GC AA after hydride generation

Experiments for the determination of mono-, di and tri-butyltin (MBT, DBT and TBT) by hydride generation/gas chromatography/atomic absorption spectrometry in various matrices (sediment, suspended matter, mussel, algae and water) have revealed that poor butyltin recoveries are obtained in sediments displaying high sulphur and hydrocarbon contents; very poor recoveries were also observed for TBT in sediments with high chlorophyll pigment contents as well as in algal samples. It was however not clear whether the hydride generatin was inhibited by these infering compounds, as was previously assumed in the case of hydrocarbons, or whether interferences affected the atomization rate. Further studies were performed to solve this problem in order to validate this method in the case of analyses of, for example, oil-contaminated sediment and algae. This paper presents the results obtained. It is concluded here that the poor recoveries were due to an inhibition of hydride generation rather than to interference at the atomization stage.     

关于CVD 矩阵的n- 宽度

本文证明了d_2k =δ_2k =d^2k ≥b_2k，其中d_2k ,δ_2k , b_2k分别表示Ａ（Ｂｌ^M_p）在ｌ^N_q下的Ｋｏｌｍｏｇｏｒｏｖ，线性，Ｂｅｒｎｓｔｅｉｎ ２ｋ－宽度，ｄ^2k 表示Ａ^Ｔ（Ｂｌ^N相似文献   

转动喇曼散射截面的群论计算

本文利用群链U(4)U(3)O(3)描述双原子分子N_2和O_2振转谱的对称性质,并利用群论方法计算了N_2和O_2分子转动喇曼散射的跃迁矩阵元,给出了它们的转动喇曼散射的截面。结果与实验较好地符合。     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .     

Transfer matrix approach of vibration isolation analysis of periodic composite structure

The transmission properties of elastic waves propagating in a three-dimensional composite structure embedded periodically with spherical inclusions are analyzed by the transfer matrix method in this paper. Firstly, the periodic composite structures are divided into many layers, the transfer matrix of monolayer structure is deduced by the wave equations, and the transfer matrix of the entire structure is obtained in the case of boundary conditions of displacement and stress continuity between layers. Then, the effective impedance of the structure is analyzed to calculate its reflectivity and transmissivity of vibration isolation. Finally, numerical simulation is carried out; the experiment results validate the accuracy and feasibility of the method adopted in the paper and some useful conclusions are obtained. Project (No. 50075029) supported by the National Natural Science Foundation of China.     

Regularization of singular systems of linear algebraic equations by shifts

Regularization of singular systems of linear algebraic equations by shifts is examined. New equivalent conditions for the shift regularizability of such systems are derived.     

基于矩阵初等变换的n元函数极值的快速判别法

给出了 n元函数极值的一个充分条件 ,并结合矩阵的初等变换建立了 n元函数极值的一种快速判别法 ,最后给出了一个例子     

Some properties of the bilevel programming problem

The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board.     

A note on the complex semi‐definite matrix Procrustes problem

This note outlines an algorithm for solving the complex ‘matrix Procrustes problem’. This is a least‐squares approximation over the cone of positive semi‐definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalizes the method of Allwright (SIAM J. Control Optim. 1988; 26 (3):537–556), who obtained a numerical solution to the real‐valued version of the problem. It is shown that, subject to an appropriate rank assumption, the complex problem can be formulated in a real setting using a matrix‐dilation technique, for which the method of Allwright is applicable. However, this transformation results in an over‐parametrization of the problem and, therefore, convergence to the optimal solution is slow. Here, an alternative algorithm is developed for solving the complex problem, which exploits fully the special structure of the dilated matrix. The advantages of the modified algorithm are demonstrated via a numerical example. Copyright © 2007 John Wiley & Sons, Ltd.