敏感设备电压暂降失效后果状态格序化评估

为评估敏感设备经历电压暂降后的最可能故障状态,提出一种格序化方法。从设备电压暂降多值映射后果状态的物理属性出发,提出多值映射后果状态刻画方法,用各后果状态的上、下概率构成的区间数刻画设备状态,各可能状态构成格。引入可能度概念,用可能度矩阵对不满足连通性的后果状态进行比较,确定最可能状态。仿真结果与实测结果表明,提出的方法不仅能准确评估最可能结果,还能给出其它可能结果的排序,对样本的依赖性小,工程应用价值明显。

复数域的格序化问题研究

推广了关于复数域格序化问题的Birkhoff-Pierce定理,证明了复数域作为二维实代数其上的偏序只有离散偏序和平凡偏序。

Computation of the Simplest Normal Forms for Resonant Double Hopf Bifurcations System Based on Lie Transform

The simplest normal form of resonant double Hopf bifurcation was studied based on Lie operator. The coefficients of the simplest normal forms of resonant double Hopf bifurcation and the nonlinear transformations in terms of the original system coefficients were given explicitly. The nonlinear transformations were used for reducing the lower- and higher-order normal forms, and the rank of system matrix was used to determine the coefficient of normal form which could be reduced. These make the gained normal form simpler than the traditional one. A general program was compiled with Mathematica. This program can compute the simplest normal form of resonant double Hopf bifurcation and the non-resonant form up to the 7th order.

Exploring Image Culture Through Narrative： A Study on Jennifer Egan＇s Twitter Fiction Black Box

Notable for the completeness with which it surrenders formally and artistically to the textual dictates of Twitter, Jennifer Egan＇s 2012 short science fiction Black Box is one of the most triumphant and fully-fledged fictions written in the form of new media. This paper explores the Twitter narrative employed in Black Box, pointing out that the serialized tweeting format of the story released via computer, mobile phone, or other electronic equipments brings readers immediate reading experience, allowing readers to sense the same feelings as the protagonist does. Through the experimental serialization of＂Twitter＂ narrative, Egan expresses her concerns and worries about the security of the American security as well as the whole world in the post-＂9.11＂ period and at the same time she embraces the virtues and pleasures of traditional storytelling delivered through a wholly new digital format. This paper concludes that Black Box is perhaps one of the boldest experiments of narrative form and is direct exploration into the contemporary image culture.

Improved twin support vector machine

We improve the twin support vector machine(TWSVM)to be a novel nonparallel hyperplanes classifier,termed as ITSVM(improved twin support vector machine),for binary classification.By introducing the diferent Lagrangian functions for the primal problems in the TWSVM,we get an improved dual formulation of TWSVM,then the resulted ITSVM algorithm overcomes the common drawbacks in the TWSVMs and inherits the essence of the standard SVMs.Firstly,ITSVM does not need to compute the large inverse matrices before training which is inevitable for the TWSVMs.Secondly,diferent from the TWSVMs,kernel trick can be applied directly to ITSVM for the nonlinear case,therefore nonlinear ITSVM is superior to nonlinear TWSVM theoretically.Thirdly,ITSVM can be solved efciently by the successive overrelaxation(SOR)technique or sequential minimization optimization(SMO)method,which makes it more suitable for large scale problems.We also prove that the standard SVM is the special case of ITSVM.Experimental results show the efciency of our method in both computation time and classification accuracy.

CONVEXIFICATION AND CONCAVIFICATION METHODS FOR SOME GLOBAL OPTIMIZATION PROBLEMS

In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and concavification transformations to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions, and propose several convexification and concavification transformations to convert a non-monotone objective function into a convex or concave function in some programming problems with strictly monotone constraint functions. Finally, we prove that the original programming problem can be converted into an equivalent concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem. Then the global optimal solution of the original problem can be obtained by solving the converted concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem using the existing algorithms about them.