基于R型聚类-因子分析的指标体系简化方法

评价指标体系过于复杂,容易产生冗余信息,增加计算与分析的难度.本文针对评价指标体系的简化方法展开研究,提出了基于R型聚类-因子分析的代表元提取方法.该方法具有定量控制代表元的信息丢失率、代表元实际含义易于解释等优点,同时避免了因子分析难以处理独立指标的问题.实验结果表明本文所提出的R型聚类–因子分析指标体系简化方法可以在没有先验知识可用的情况下,有效提高指标体系的简明性与有效性,同时保持指标信息的完备性.     

基于综合法的火炮方向机齿轮传动误差分析

方向机对火炮射击精度影响很大,齿轮传动误差是方向机传动误差的主要来源。恰当的分析方法能提高方向机齿轮传动设计精度与效率。本文将齿轮传动误差分为静态误差与动态误差。结合理论分析,用概率分析法计算出静态误差;用有限元分析法计算出动态误差,最后得到总的传动误差。基于分析结果采样拟合出不同载荷下的误差曲线。将这种分析方法应用到火炮方向机齿轮传动误差分析中,得到了该火炮方向机齿轮传动在变载荷下的误差曲线。该分析方法为火炮方向机齿轮传动设计提供参考。为火炮其他部件的设计提供一种思路。     

A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization

We present a primal–dual augmented Lagrangian method to solve an equality constrained minimization problem. This is a Newton-like method applied to a perturbation of the optimality system that follows from a reformulation of the initial problem by introducing an augmented Lagrangian function. An important aspect of this approach is that, by a choice of suitable updating rules of parameters, the algorithm reduces to a regularized Newton method applied to a sequence of optimality systems. The global convergence is proved under mild assumptions. An asymptotic analysis is also presented and quadratic convergence is proved under standard regularity assumptions. Some numerical results show that the method is very efficient and robust.     

Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization

The conjugate gradient method is an effective method for large-scale unconstrained optimization problems. Recent research has proposed conjugate gradient methods based on secant conditions to establish fast convergence of the methods. However, these methods do not always generate a descent search direction. In contrast, Y. Narushima, H. Yabe, and J.A. Ford [A three-term conjugate gradient method with sufficient descent property for unconstrained optimization, SIAM J. Optim. 21 (2011), pp. 212–230] proposed a three-term conjugate gradient method which always satisfies the sufficient descent condition. This paper makes use of both ideas to propose descent three-term conjugate gradient methods based on particular secant conditions, and then shows their global convergence properties. Finally, numerical results are given.     

Self-consistent gradient flow for shape optimization

We present a model for image segmentation and describe a gradient-descent method for level-set based shape optimization. It is commonly known that gradient-descent methods converge slowly due to zig–zag movement. This can also be observed for our problem, especially when sharp edges are present in the image. We interpret this in our specific context to gain a better understanding of the involved difficulties. One way to overcome slow convergence is the use of second-order methods. For our situation, they require derivatives of the potentially noisy image data and are thus undesirable. Hence, we propose a new method that can be interpreted as a self-consistent gradient flow and does not need any derivatives of the image data. It works very well in practice and leads to a far more efficient optimization algorithm. A related idea can also be used to describe the mean-curvature flow of a mean-convex surface. For this, we formulate a mean-curvature Eikonal equation, which allows a numerical propagation of the mean-curvature flow of a surface without explicit time stepping.     

New pixel driving circuit using self‐discharging compensation method for high‐resolution OLED micro displays on a silicon backplane

A new 4T2C pixel circuit formed on a silicon substrate is proposed to realize a high‐resolution 7.8‐μm pixel pitch AMOLED microdisplay. In order to achieve high luminance uniformity, the pixel circuit compensates its Vth variation of the MOSFET for the driving transistor internally by using self‐discharging method. Also presented are 0.5‐in Quad‐VGA and 1.25‐in wide Quad‐XGA microdisplays with the proposed pixel circuit.     

Dynamic neural network method-based improved PSO and BR algorithms for transient probabilistic analysis of flexible mechanism

To improve the computing efficiency and precision of transient probabilistic analysis of flexible mechanism, dynamic neural network method (DNNM)-based improved particle swarm optimization (PSO)/Bayesian regularization (BR) (called as PSO/BR-DNNM) is proposed based on the developed DNNM with the integration of extremum response surface method (ERSM) and artificial neural network (ANN). The mathematical model of DNNM is established based on ANN on the foundation of investigating ERSM. Aiming at the high nonlinearity and strong coupling characteristics of limit state function of flexible mechanism, accurate weights and thresholds of PSO/BR-DNNM function are discussed by searching initial weights and thresholds based on the improved PSO and training final weights and thresholds by the BR-based training performance function. The probabilistic analysis of two-link flexible robot manipulator (TFRM) was investigated with the proposed method. Reliability degree, distribution characteristics and major factors (section sizes of link-2) of TFRM are obtained, which provides a useful reference for a more effective TFRM design. Through the comparison of three methods (Monte Carlo method, DNNM, PSO/BR-DNNM), it is demonstrated that PSO/BR-DNNM reshapes the probability of flexible mechanism probabilistic analysis and improves the computing efficiency while keeping acceptable computational precision. Moreover, the proposed method offers a useful insight for reliability-based design optimization of flexible mechanism and thereby also enriches the theory and method of mechanical reliability design.     

On decomposition methods in interactive user-preference based optimization

Evolutionary multi-objective optimization (EMO) methodologies have been widely applied to find a well-distributed trade-off solutions approximating to the Pareto-optimal front in the past decades. However, integrating the user-preference into the optimization to find the region of interest (ROI) [1] or preferred Pareto-optimal solutions could be more efficient and effective for the decision maker (DM) straightforwardly. In this paper, we propose several methods by combining preference-based strategy (like the reference points) with the decomposition-based multi-objective evolutionary algorithm (MOEA/D) [2], and demonstrate how preferred sets or ROIs near the different reference points specified by the DM can be found simultaneously and interactively. The study is based on the experiments conducted on a set of test problems with objectives ranging from two to fifteen objectives. Experiments have proved that the proposed approaches are more efficient and effective especially on many-objective problems to provide a set of solutions to the DM's preference, so that a better and a more reliable decision can be made.     

基于模式的远监督关系抽取算法

远监督关系抽取算法能够自动将关系库中的关系与无标注的文本对齐,以进行文本中的关系抽取。目前提出的远监督关系抽取算法中,大多数是基于特征的。然而,此类算法在将实例转换为特征时,经常会出现关键信息不突出、数据集线性不可分等问题,影响关系抽取的效果。该文提出了一种基于模式的远监督关系抽取算法,其中引入了基于模式的向量,并使用了基于核的机器学习算法来克服上述问题。实验结果表明,该文提出的基于模式的远监督关系抽取算法,能够有效地提升远监督关系抽取的准确率。