Temperature effect on deposition rate of silicon nitride films

Temperature effects on deposition rate of silicon nitride films were characterized by building a neural network prediction model. The silicon nitride films were deposited by using a plasma enhanced chemical vapor deposition system and process parameter effects were systematically characterized by 2⁶⁻¹ fractional factorial experiment. The process parameters involved include a radio frequency power, pressure, temperature, SiH₄, N₂, and NH₃ flow rates. The prediction performance of generalized regression neural network was drastically improved by optimizing multi-valued training factors using a genetic algorithm. Several 3D plots were generated to investigate parameter effects at various temperatures. Predicted variations were experimentally validated. The temperature effect on the deposition rate was a complex function of parameters but N₂ flow rate. Larger decreases in the deposition rate with the temperature were only noticed at lower SiH₄ (or higher NH₃) flow rates. Typical effects of SiH₄ or NH₃ flow rate were only observed at higher or lower temperatures. A comparison with the refractive index model facilitated a selective choice of either SiH₄ or NH₃ for process optimization.     

Kuhn-Tucker条件与线性规划的对偶性

证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系.     

高非线性度向量弹性函数

利用已知弹性函数级联上高非线性度多输出布尔函数的方法构造（n,m,t）弹性函数,其非线性度为2^n-1-2^n-l/2-1＋2^l/2.nlmax（n-l,m,t）,在相同条件下改进了Kurosawa的非线性度2^n-1-2^n-l/2-1.特别地,本文构造了两类具体的向量弹性函数,得到两个不同的非线性度.本文所得函数的非线性度在大多数情况下是比较好的.     

多元线性回归法在互联网网间结算中的应用

本文建立一个理论模型研究互联网互联结算的问题。文章利用多元线性回归法对互联网骨干网运营商(IBPs:Internet Backbone Providers)的网络价值进行评估,利用IBPs各自的网络价值对其交换速率进行加权,从而得出网络价值加权速率,依据这个速率进行结算既可以反映了每个网络对互联的贡献程度,又反映了在互联中对网络资源的被占用程度。     

A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

Some results on quasipolyhedral convexity

The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions, which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right scalar multiplication (including the case where λ=0⁺) and pointwise addition.      

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of ²n−1 permutations that pairwise generate the symmetric group Sn. There is no set of ²n−1+1 permutations having this property. For all sufficiently large integers n with n≡2mod4, there exists a set of ²n−2 even permutations that pairwise generate the alternating group An. There is no set of ²n−2+1 permutations having this property.     

Lower bound for the convergence rate of nonstationary Jacobi-like iteration

Stationary and nonstationary Jacobi-like iterative processes for solving systems of linear algebraic equations are examined. For a system whose coefficient matrix A is an H-matrix, it is shown that the convergence rate of any Jacobi-like process is at least as high as that of the point Jacobi method as applied to a system with 〈A〉 as the coefficient matrix, where 〈A〉 is a comparison matrix of A.     

线性常微分方程的保线性变换及其应用

研究了线性常微分方程的保线性变换，得到任意两个二阶线性常微分方程等价的条件，并用于求解一类二阶线性变系数齐次常微分方程．对数学物理方法教学中怎样通过适当的变换把给定的二阶线性变系数齐次常微分方程化为可解的方程给出了合理解释。     

A Note on the Linearity of Real-valued Functions with Respect to Suitable Metrics

In this paper we prove that for every real-valued Morse function φ on a smooth closed manifold ℳ and every neighborhood U of its critical points a suitable Riemannian metric μ _U exists such that φ is linear outside U