Temperature measurement of reflected shock wave by using chemical indicator

This report describes a new method for measuring the temperature of the gas behind the reflected shock wave in shock tube, corresponding to the reservoir temperature of a shock tunnel, based on the chemical reaction of small amount of CF₄ premixed in the test gas. The final product C₂F₄ is used as the temperature indicator, which is sampled and detected by a gas chromatography in the experiment. The detected concentration of C₂F₄ is correlated to the temperature of the reflected shock wave with the initial pressureP ₁ and test time τ as parameters in the temperature range 3 300 K<T<5 600 K, pressure range 5 kPa<P ₁<12 kPa and τ≅0.4 ms. The project supported by the China Aerodynamics Project for Basic Researches (J13.5.2 ZK04)     

解模守恒微分方程的显式平方守恒格式

对具有模守恒的微分方程,经典的显式Runge—Kutta方法和线性多步方法不能保微分方程的模守恒特性．我们利用李群算法和Cayley变换构造了高阶显式平方守恒格式,应用到模守恒的微分方程如Euler方程,Landau—Lifshitz方程,并且与相同阶的显式Runge—Kutta方法在保模守恒和精度方面进行了比较,数值结果表明用李群算法构造的新的显式平方守恒格式能保微分方程模守恒的特性且它和相应Runge—Kutta方法有相同的精度．     

插值细分曲线有理参数点的精确求值

本文提出了求值插值细分曲线上任意有理参数的算法.通过构造与细分格式相关的矩阵,m进制分解给定有理数以及特征分解循环节对应算子乘积,计算得到控制顶点权值,实现对称型静态均匀插值细分曲线的求值.本文给出了四点细分和四点Ternary细分曲线的求值实例.算法可以推广到求值其他非多项式细分格式中.     

关于SSSP（n）和SISP（n）的均值

研究了Smarandache最小平方数列和Smarandache最大平方数列的均值性质,并用初等方法得到了关于这两个数列均值的渐近公式．     

A modified SQP-filter method for nonlinear complementarity problem

The nonlinear complementarity problem can be reformulated as a nonlinear programming. For solving nonlinear programming, sequential quadratic programming (SQP) type method is very effective. Moreover, filter method, for its good numerical results, are extensively studied to handle nonlinear programming problems recently. In this paper, a modified quadratic subproblem is proposed. Based on it, we employ filter technique to tackle nonlinear complementarity problem. This method has no demand on initial point. The restoration phase, which is always used in traditional filter method, is not needed. Global convergence results of the proposed algorithm are established under suitable conditions. Some numerical results are reported in this paper.     

The optimal pricing and ordering policy for an integrated inventory model when trade credit linked to order quantity

In traditional inventory models, it is implicitly assumed that the buyer must pay for the purchased items as soon as they have been received. However, in many practical situations, the vendor is willing to provide the buyer with a permissible delay period when the buyer’s order quantity exceeds a given threshold. Therefore, to incorporate the concept of vendor–buyer integration and order-size-dependent trade credit, we present a stylized model to determine the optimal strategy for an integrated vendor–buyer inventory system under the condition of trade credit linked to the order quantity, where the demand rate is considered to be a decreasing function of the retail price. By analyzing the total channel profit function, we developed some useful results to characterize the optimal solution and provide an iterative algorithm to find the retail price, buyer’s order quantity, and the numbers of shipment per production run from the vendor to the buyer. Numerical examples and sensitivity analysis are given to illustrate the theoretical results, and some managerial insights are also obtained.     

A note on “Convergence of a Halpern-type iteration algorithm for a class of pseudo-contractive mappings”

In [C.O. Chidume, G. De Souza, Convergence of a Halpern-type iteration algorithm for a class of pseudocontractive mappings, Nonlinear Analysis (2007), doi:10.1016/j.na.2007.08.008], the authors proved a strong convergence result for strictly pseudo-contractive mappings using a Halpern-type iteration algorithm. However, the main result is not correct. In this note, we provide a counter-example to the theorem.     

奇异类内离差矩阵条件下的Fisher最优判据

特征提取是模式分类与识别的重要环节，Fisher最优判据是特征提取的基本方法之一．本文提出了一种计算奇异类内离差矩阵条件下Fisher最优判据的新方法，并给出了计算步骤．     

Predictor-Corrector Smoothing Methods for Monotone LCP

In this paper, we analyze the global and local convergence properties of two predictor-corrector smoothing methods, which are based on the framework of the method in [1], for monotone linear complementarity problems (LCPs). The difference between the algorithm in [1] and our algorithms is that the neighborhood of smoothing central path in our paper is different to that in [1]. In addition, the difference between Algorithm 2.1 and the algorithm in [1] exists in the calculation of the predictor step. Comparing with the results in [1],the global and local convergence of the two methods can be obtained under very mild conditions. The global convergence of the two methods do not need the boundness of the inverse of the Jacobian. The superlinear convergence of Algorithm 2.1‘ is obtained under the assumption of nonsingularity of generalized Jacobian of Φ(x,y) at the limit point and Algorithm 2.1 obtains superlinear convergence under the assumption of strict complementarity at the solution. The efficiency of the two methods is tested by numerical experiments.