A multi-start central force optimization for global optimization

Central force optimization (CFO) is an efficient and powerful population-based intelligence algorithm for optimization problems. CFO is deterministic in nature, unlike the most widely used metaheuristics. CFO, however, is not completely free from the problems of premature convergence. One way to overcome local optimality is to utilize the multi-start strategy. By combining the respective advantages of CFO and the multi-start strategy, a multi-start central force optimization (MCFO) algorithm is proposed in this paper. The performance of the MCFO approach is evaluated on a comprehensive set of benchmark functions. The experimental results demonstrate that MCFO not only saves the computational cost, but also performs better than some state-of-the-art CFO algorithms. MCFO is also compared with representative evolutionary algorithms. The results show that MCFO is highly competitive, achieving promising performance.     

大直径平底负压容器优化设计

通过对大直径平底负压容器平底板的设计计算,平底板计算厚度很厚。通过分析,提出了对平底板采取加强措施,从而减薄平底板计算厚度的方法。该容器在实际生产过程中性能可靠、稳定,对类似设备设计具有借鉴意义。     

Application of Vis–NIR hyperspectral imaging in classification between fresh and frozen-thawed pork Longissimus Dorsi muscles

Fresh and frozen-thawed (F-T) pork meats were classified by Vis–NIR hyperspectral imaging. Eight optimal wavelengths (624, 673, 460, 588, 583, 448, 552 and 609 nm) were selected by successive projections algorithm (SPA). The first three principal components (PCs) obtained by principal component analysis (PCA) accounted for over 99.98% of variance. Gray-level-gradient co-occurrence matrix (GLGCM) was applied to extract 45 textural features from the PC images. The correct classification rate (CCR) was employed to evaluate the performance of the partial least squares-discriminate analysis (PLS-DA) models, by using (A) the reflected spectra at full wavelengths and (B) those at the optimal wavelengths, (C) the extracted textures based on the PC images, and (D) the fused variables combining spectra at the optimal wavelengths and textures. The results showed that the best CCR of 97.73% was achieved by applying (D), confirming the high potential of textures for fresh and F-T meat discrimination.     

一种军棋机器博弈的多棋子协同博弈方法

针对在军棋博弈不完全信息对弈中，面对棋子不同价值、不同位置、不同搭配所产生的不同棋力，传统的单子意图搜索算法，不能满足棋子之间的协同性与沟通性，同时也缺乏对敌方的引诱与欺骗等高级对抗能力。本文提出一种结合UCT搜索策略的高价值棋子博弈方法，实现高价值棋子协同博弈的策略。实战经验表明:高价值多棋子军棋协同博弈策略优于单棋子军棋博弈策略。     

因素空间理论下基点分类算法研究

目前，基于因素空间理论的背景基提取算法计算过程复杂，初始化必须依赖各因素极值，基点数量提取冗余等原因，未能在应用中取得很好效果。为此，结合内点判别法和知识可继承、可扩展的思想，提出一种计算简单、初始化独立、基点数量小的改进的背景基提取算法。然后，利用改进的背景基提取算法构造出一种全新的数据分类算法-基点分类算法，基点分类算法以提取每一类样本的背景基为预测模型，再通过新定义的λ-背景基，优化预测模型。数值实验表明:基点分类算法原理简单、构造难度小、分类模型泛化能力强，预测能力准确率高，同时严格的模型限定区域又能为识别新类别提供新方法。     

空间红外大口径折射式低温镜头设计与验证

针对目标探测类空间红外相机大范围成像、高灵敏度探测、高精度定位等应用需求,文中提出采用像方远心光路和低温光学技术结合的解决方案,设计了物方视场角8°×8°、入瞳口径265 mm、工作温度200 K的像方远心折射式光学系统。镜头最大口径280 mm,采用多级分散的弹性支撑设计,解决大口径低温透镜装框、透镜组件支撑和镜头整体安装各环节的热应力卸载问题。在保证高刚度和低漏热的情况下,使低温下透镜的热应力对镜头能量集中度的影响降低到可接受范围内。镜头完成装调及室温下像质确认后,进行了力学振动试验,并将其制冷到200 K水平测试像质,测试结果表明,镜头能量集中度达到轴上75%,边缘视场72%。     

Adaptive fuzzy control for nontriangular form systems with time-varying full-state constraints

This article investigates an adaptive fuzzy tracking control problem for a class of nontriangular form systems with asymmetric time-varying full state constraints. Unknown functions are approximated by the fuzzy logic systems. A domination approach is employed to tackle the nontriangular form structure. Time-varying asymmetric barrier Lyapunov functions (ABLFs) are adopted to ensure full-state constraints satisfaction. Based on the backstepping technique and time-varying ABLFs, an adaptive controller is proposed and guarantees that all the signals in the closed-loop system are ultimately bounded and the time-varying full state constraints are met. Simulation examples are presented to further demonstrate the effectiveness of the proposed approach.     

Does decision quality (always) increase with the size of information samples? Some vicissitudes in applying the law of large numbers.

Adaptive decision making requires that contingencies between decision options and their relative assets be assessed accurately and quickly. The present research addresses the challenging notion that contingencies may be more visible from small than from large samples of observations. An algorithmic account for such a seemingly paradoxical effect is offered within a satisficing-choice framework. Accordingly, a choice is only made when the sample contingency describing the relative evaluation of the 2 options exceeds a critical threshold. Small samples, because of the high dispersion of their sampling distribution, facilitate above-threshold contingencies. Across a broad range of parameters, the resulting small-sample advantage in terms of hits is stronger than their disadvantage in false alarms. Computer simulations and experiments support the model predictions. The relative advantage of small samples is most apparent when information loss is low, when the threshold is high relative to the ecological contingency, and when the sampling process is self-truncated. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

一种改进的新三步搜索算法

在对三步法工作原理进行研究的基础上提出了新三步搜索算法（NITSS）。该方法充分利用视频序列运动矢量概率分布上的中心偏置特性．在三步搜索算法的基础上引入了十字型分布的4个点构成搜索点群。实验结果表明。新三步搜索算法解决了三步法的小运动估计效果较差问题．提高了搜索精度，保持了三步法的高效率。     

An effective coding approach for multiobjective integrated resource selection and operation sequences problem

In this paper, we consider an integrated Resource Selection and Operation Sequences (iRS/OS) problem in Intelligent Manufacturing System (IMS). Several kinds of objectives are taken into account, in which the makespan for orders should be minimized; workloads among machine tools should be balanced; the total transition times between machines in a local plant should also be minimized. To solve this multiobjective iRS/OS model, a new two vectors-based coding approach has been proposed to improve the efficiency by designing a chromosome containing two kinds of information, i.e., operation sequences and machine selection. Using such kind of chromosome, we adapt multistage operation-based Genetic Algorithm (moGA) to find the Pareto optimal solutions. Moreover a special technique called left-shift hillclimber has been used as one kind of local search to improve the efficiency of our algorithm. Finally, the experimental results of several iRS/OS problems indicate that our proposed approach can obtain best solutions. Further more comparing with previous approaches, moGA performs better for finding Pareto solutions. Received: May 2005/Accepted: December 2005