Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

嵌入式实时操作系统内核混合代码的自动化验证框架

"如何构造高可信的软件系统"已成为学术界和工业界的研究热点.操作系统内核作为软件系统的基础组件，它的安全可靠是构造高可信软件系统的重要环节.为了确保操作系统内核的安全可靠，将形式化方法引入到操作系统内核验证中，提出了一个自动化验证操作系统内核的框架.该验证框架包括：（1）分别对C语言程序和混合语言程序（C语言和汇编语言）进行验证；（2）在混合语言程序验证中，为汇编程序建立抽象模型，并将C语言程序和抽象模型粘合形成基于C语言验证工具可接收的验证模型；（3）从规范中提取性质，基于该自动验证工具，对性质完成自动验证；（4）该框架不限于特定的硬件架构.成功地运用该验证框架对两种不同硬件平台的嵌入式实时操作系统内核μC/OS-II进行了验证.结果显示：利用该框架在对两个不同的硬件平台上内核验证时，框架的可重复利用率很高，高达到88%，虽然其抽象模型需要根据不同的硬件平台进行重构.在对基于这两种平台的操作系统内核验证中，分别发现了10~12处缺陷.其中，在ARM平台上两处与硬件相关的问题被发现.实验表明，该方法对不同硬件平台的同一个操作系统分析验证具有一定的通用性.     

Complexity classification in qualitative temporal constraint reasoning

We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete.     

Planning the GMAW process by constraint propagation

Although the gas metal arc welding (GMAW) process is widely used for joining metals, its planning is still a cumbersome task. The planning procedure involves many complex interrelationships among the process variables and depends heavily on empirical knowledge. Therefore, a solution method that allows a convenient way to represent the domain knowledge and evaluate the process variable relationships is needed. Further, the lack of a strong domain theory to quantify these interrelationships is a deficiency in the planning of the GMAW process. This paper presents a solution method that overcomes this deficiency and introduces a convenient knowledge representation scheme. The solution method considers the planning procedure to be a constraint satisfaction problem (CSP). The AC-4 algorithm is used to obtain arc consistency among nodes in the constraint network and the PC-4 algorithm is applied to obtain path consistency in the network. A modified version of the AC-4 algorithm is developed to reduce the search space and correspondingly reduce the computation time. An example is presented to demonstrate the capability of the method and its potential to reduce lead time.     

Elastic T-stress solutions for semi-elliptical surface cracks in finite thickness plates

Three-dimensional finite element analyses have been conducted to calculate the elastic T-stress for semi-elliptical surface cracks in finite thickness plates. Far-field tension and bending loads were considered. The analysis procedures and results were verified using both exact solutions and approximate solutions. The T-stress solutions are presented along the crack front for cracks with a/t values of 0.2, 0.4, 0.6 or 0.8 and a/c values of 0.2, 0.4, 0.6 or 1.0. Based on the present finite element calculations for T-stress, empirical equations for the T-stress at three locations: the deepest, the surface and the middle points of the crack front under tension or bending are presented. The numerical results are approximated by empirical formulae fitted with an accuracy of 1% or better. They are valid for 0.2?a/c?1 and 0?a/t?0.8. These T-stress results together with the corresponding K or J values for surface cracks are suitable for the analysis of constraint effects for surface cracked components.     

On finding optimal and near-optimal lineal spanning trees

The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879.     

以技术进步促进蒸汽能源的节约

本文运用“软科学”一即通过建立数学模型，进行系统分析和系统优化，阐述对蒸汽管网优化运行的方法及原理，达到提高供热效率及节能降耗的目的．     

Branching and pruning: An optimal temporal POCL planner based on constraint programming

A key feature of modern optimal planners such as graphplan and blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planners provide an alternative branching scheme but lacking comparable pruning mechanisms do not perform as well. In this paper, a domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules. The key novelty in the formulation is the ability to reason about supports, precedences, and causal links involving actions that are not in the plan. Experiments over a wide range of benchmarks show that the resulting optimal temporal planner is much faster than current ones and is competitive with the best parallel planners in the special case in which actions have all the same duration.¹     

变形镜交连值的优化分析

关于优化光波控制,自适应光学校正是至关重要的一个环节,可用于改善激光光束质量及校正光束在传输过程中气流引起的波前畸变等。变形镜是其核心器件,而交连值是影响变形镜校正精度的关键因素。针对变形镜实际使用时需要对致动器进行一定的约束,利用带约束的最小二乘法,分析了在一定约束条件下交连值变化对变形镜校正精度及控制稳定性的影响。以Zernike像差和以大气湍流模型构造的像差为校正对象,寻找校正效果最好的交连值。结果表明各阶Zernike像差对应的最优交连值差异较大,最优交连值主要分布在15%～35%之间。从控制误差引起的校正效果变化的方面考虑,对正方形致动器排布的最优交连值位于15%～25%区域。