红外光谱发射率测量系统的温漂修正方法

针对探测器光谱响应度温漂现象对红外光谱发射率测量系统重复性的影响,分析探测器温度与输出电压之间的变化规律,提出了基于多项式拟合的光谱响应度温漂修正方法。研究探测器自身温度与其光谱响应度的函数关系,对探测器光谱响应度随温度变化的曲线进行数据拟合,得到探测器温度-光谱响应度的拟合方程,计算光谱响应度的温漂修正系数,修正探测器的输出电压,消除光谱响应度温漂现象对探测器输出电压造成的影响。研制光谱响应度温漂修正装置,测得探测器光谱响度的温漂曲线,对比指数拟合曲线和多项式拟合曲线与测量曲线的吻合度,结果表明6阶多项式拟合曲线的一致性较好,提高了基于积分球反射计的光谱发射率测量系统的重复性。     

Non-intrusive hybrid interval method for uncertain nonlinear systems using derivative information

This paper proposes a new non-intrusive hybrid interval method using derivative information for the dynamic response analysis of nonlinear systems with uncertain-butbounded parameters and/or initial conditions. This method provides tighter solution ranges compared to the existing polynomial approximation interval methods. Interval arithmetic using the Chebyshev basis and interval arithmetic using the general form modified affine basis for polynomials are developed to obtain tighter bounds for interval computation.To further reduce the overestimation caused by the "wrapping effect" of interval arithmetic, the derivative information of dynamic responses is used to achieve exact solutions when the dynamic responses are monotonic with respect to all the uncertain variables. Finally, two typical numerical examples with nonlinearity are applied to demonstrate the effectiveness of the proposed hybrid interval method, in particular, its ability to effectively control the overestimation for specific timepoints.     

基于统计窗的恒星连续谱自动拟合方法

提出一种基于统计窗的恒星连续谱拟合方法。该方法将恒星光谱划分为若干个统计窗,在每个窗口内根据信噪比选取一定比例的流量点,然后对选出来的流量点进行低阶多项式迭代拟合,从而得到连续谱。实验表明,与其他方法相比,该方法得到的连续谱更接近于实际连续谱。该方法对SDSS中除M外的各种光谱型连续谱的拟合均具有很高的实用性和鲁棒性,对于郭守敬望远镜(LAMOST)先导巡天恒星光谱的连续谱拟合同样具有非常好的效果。     

多项式偏最小二乘法对非线性体系红外谱图的分析

文章利用了一种非线性模型多项式偏最小二乘法(PPLS),结合傅里叶变换红外光谱遥感技术,对大气中的五组分混合体系进行了同时分析。并与偏最小二乘法(PLS)得到的结果进行了比较,PPLS显示出较好的处理非线性数据的能力。尤其是对混合物中的苯和氯仿的预测,均方根预测误差(RMSEP)分别是0.043和0.087,用PLS预测相应的RMSEP为0.402和0.842。PPLS的这一预测精度,可以满足遥感傅里叶变换红外光谱对大气中有毒气体的实时、在线监测的需要。同时PPLS可以用较少的潜变量对变量进行解释,显示出PPLS模型的稳健性和简单化。     

On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming

This paper investigates the capabilities of several non-quadratic polynomial yield functions to model the plastic anisotropy of orthotropic sheet metal (plane stress). Fourth, sixth and eighth-order homogeneous polynomials are considered. For the computation of the coefficients of the fourth-order polynomial an improved set of analytic formulas is proposed. For sixth and eighth-order polynomials the identification uses optimization. Simple constraints on the optimization process are shown to lead to real-valued convex functions. A general method to extend the above plane stress criteria to full 3D stress states is also suggested. Besides their simplicity in formulation, it is found that polynomial yield functions are capable to model a wide range of anisotropic plastic properties (e.g., the Numisheet’93 mild steel, AA2008-T4, AA2090-T3). The yield functions have then been implemented into a commercial finite element code as constitutive subroutines. The deep drawing of square (Numisheet’93) and cylindrical (AA2090-T3) cups have been simulated. In both cases excellent agreement with experimental data is obtained. In particular, it is shown that non-quadratic polynomial yield functions can simulate cylindrical cups with six or eight ears. We close with a discussion on earing and further examples.     

一类图的特征多项式与匹配多项式

本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。     

Solution of the least squares method problem of pairwise comparison matrices

The aim of the paper is to present a new global optimization method for determining all the optima of the Least Squares Method (LSM) problem of pairwise comparison matrices. Such matrices are used, e.g., in the Analytic Hierarchy Process (AHP). Unlike some other distance minimizing methods, LSM is usually hard to solve because of the corresponding nonlinear and non-convex objective function. It is found that the optimization problem can be reduced to solve a system of polynomial equations. Homotopy method is applied which is an efficient technique for solving nonlinear systems. The paper ends by two numerical example having multiple global and local minima. This research was supported in part by the Hungarian Scientific Research Fund, Grant No. OTKA K 60480.     

Stability of two player game structures

We have extended a two player game-theoretical model proposed by V. Gurvich [To theory of multi-step games, USSR Comput. Math and Math. Phys. 13 (1973)] and H. Moulin [The Strategy of Social Choice, North Holland, Amsterdam, 1983]: All the considered game situations are framed by the same game structure. The structure determines the families of potential decisions of the two players, as well as the subsets of possible outcomes allowed by pairs of such choices. To be a solution of a game, a pair of decisions has to determine a (pure) functional equilibrium of the situational pair of payoff mappings which transforms the realized outcome into real-valued rewards of the players. Accordingly we understand that a structure is stable, if it admits functional equilibria for all possible game situations; and that it is complete, if every situation that only partitions the potential outcomes, is dominated by one of the players. We have generalized and strengthened a theorem by V. Gurvich [Equilibrium in pure strategies, Soviet Math. Dokl. 38 (1989)], proving that a proper structure is stable iff it is complete. Additional results provide game-theoretical insight that focuses the inquiry on the complexity of the stability decision problem; in particular, for coherent structures.These results also have combinatorial importance because every structure is characterized by a pair of hypergraphs [C. Berge, Graphes et Hypergraphes, Dunod, 1970] over a common ground set. The structure is dual (complete/coherent) iff the clutter of one hypergraph equals (includes/is included in) the blocker of the other one. So, for non-void coherent structures, the stability decision problem is equivalent to the much studied subexponential [M.L. Fredman, L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996)] hypergraph duality decision problem.     

Norm Bounds for Ehrhart Polynomial Roots

M. Beck et al. found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and applies to a larger family of polynomials.     

Exploiting equalities in polynomial programming

We propose a novel approach for solving polynomial programs over compact domains with equality constraints. By means of a generic transformation, we show that existing solution schemes for the, typically simpler, problem without equalities can be used to address the problem with equalities.