Preparation of Incompact Strontium Aluminate Phosphors

The incompact long afterglow pigment SrAl2O4: Eu, Dy was synthesized by ceramics technology.The agglomerated starting raw material had little effect on the synthesis of SrA12O4 matrix through solid-state reaction method,but the shrinkage and densification was retarded greatly by the agglomerated powder by the formation of large and extensive pore network.The sintering mechanism is surface diffusion ( without flux B2O3 ) and grain boundary diffusion (with B2O3 as flux)respectively, and the as-prepared long afterglow pigment glows in the dark for over 4000 min.     

Investigation of Structure and Hydriding Properties of La0.6 Nd0.4 Ni4.8 Mn0.2 Cux Alloys

The structure and hydriding performance of La0.6Nd0.4Ni4.8Mn0.2Cux (x = 0 ～ 0.4) alloys were investigated in order to develop suitable materials for metal hydride air conditioner. The effect of Cu addition on the crystal structure,equilibrium pressure, hydrogen capacity and hysteresis as well as hydrogen absorption/desorption kinetics were systematically studied by using the measurement of P-C isotherms, X-ray diffraction and scanning electron microscopy. As the amount of Cu increases, the plateau pressure increases and hydrogen absorption/desorption kinetics is improved, but the effective hydrogen storage capacity decreases. It is shown that variations in the basal plane parameter a can be used as an indication for the plateau pressure changes. With the increase of parameter a, the plateau pressure decreases. For La0.6 Nd0.4Ni4.8Mn0.2Cux(x = 0 ～ 0.4) alloys there is a relationship between the effective hydrogen storage capacities and the ratios of their unit cell parameters c and a. The effective hydrogen storage capacity decreases with increase of a/c.     

一种基于潜在语义分析的查询扩展算法

该文提出一种新的查询扩展算法。通过对文本进行潜在语义分析,引入计算词语间语义相似度的方法,将文本聚类应用到检索的交互过程中,以提高信息检索的质量。实验结果表明该算法对于提高检索的准确率是十分有效的。     

基于路径共同顺序的TSP遗传算法

遗传算法是一种解决TSP问题的有效算法。文章提出了一种基于路径共同顺序的新型遗传操作方法,即首先寻找父辈的共有路径信息,然后构建后代,该方法缩小了搜索优解的范围,加快了优化过程的收敛速度。在此基础上针对TSP实例,实现了基于共同顺序的优化方法来解决小规模TSP问题,以及更有效的基于共同顺序的循环优化方法来解决大规模TSP问题。实验结果验证了该方法的有效性。     

基于Part-Whole关系的人造物属性分析

知识分析是建立知识库系统过程中的重要一环,其目的就是帮助检查知识库中的知识一致性、完备性和精确性。该文重点讨论了基于Part-Whole关系的人造物属性分析,主要内容是:一是部分和整体的属性之间是否具有继承关系;二是部分的公共属性和整体相同属性的属性值之间的内在约束关系。     

基于H.26L关键算法模块软件编码器的设计与实现

继制定了H.261、H.263、H.263+等视频压缩标准后,ITU—T正在制定新的视频压缩标准H.26L,目的是为了取得更加有效的图像压缩效果和提供理想的传输接口。文章首先分析了H.26L的各个关键算法模块的原理,与H.263、H.263+进行比较分析,得出其优点;然后阐述如何用VisualC++6.0实现这些算法模块;最后通过实验证明,该文设计的软件编码器能达到更高效的压缩比、信噪比和编码速度,具有一定的实用价值。     

支持动态配置和抽象编程的软件体系结构描述

随着软件规模的不断增长和对软件安全性要求的提高,软件体系结构、动态配置和较高层次上的程序设计成为软件工程中的研究热点。目前在软件开发过程中用于这三者的技术是不同的,因此软件开发过程中各个阶段的表述方式不统一。该文提出一种面向图形的编程方法来解决该问题,该方法以一种统一的方式实现了基于组件的分布式系统的软件体系结构描述、动态配置和抽象编程。另外还给出一个简单的例子来说明该方法如何支持上述三个阶段中的对软件的描述。     

Analysis of the Kalman filter based estimation algorithm: an orthogonal decomposition approach

In this paper we shall provide new analysis on some fundamental properties of the Kalman filter based parameter estimation algorithms using an orthogonal decomposition approach based on the excited subspace. A theoretical analytical framework is established based on the decomposition of the covariance matrix, which appears to be very useful and effective in the analysis of a parameter estimation algorithm with the existence of an unexcited subspace. The sufficient and necessary condition for the boundedness of the covariance matrix in the Kalman filter is established. The idea of directional tracking is proposed to develop a new class of algorithms to overcome the windup problem. Based on the orthogonal decomposition approach two kinds of directional tracking algorithms are proposed. These algorithms utilize a time-varying covariance matrix and can keep stable even in the case of unsufficient and/or unbounded excitation.     

Assembly planning using a novel immune approach

Inspired by the vertebrate immune system, artificial immune system (AIS) has emerged as a new branch of computational intelligence. This paper explores the application of AIS in the problem of assembly planning and proposes a novel approach, called the immune optimization approach (IOA), to generate the optimal assembly plan. Based on the bionic principles of AIS, IOA introduces manifold immune operations including immune selection, clonal selection, inoculation and immune metabolism to derive the optimal assembly sequence. Maintenance of population diversity, attention to the local as well as the global search, and employment of heuristic knowledge to direct the search of optimized assembly sequences are the major concerns of IOA. The details of IOA are presented and the immune operations are discussed. Two practical products are taken as examples to illustrate the validity of IOA in assembly planning, and encouraging solutions in quality and efficiency are achieved. Comparisons with genetic algorithm demonstrate that IOA finds the optimal assembly solution or near-optimal ones more reliably and more efficiently, indicating that IOA has potential and advantages in dealing with assembly planning.     

遗传蚂蚁算法在几何约束求解中的应用

约束问题可以转化为优化问题.引入GAAA(遗传蚂蚁算法)解决几何约束问题.为了充分利用遗传算法的快速性,随机性和全局收敛性,在算法的前期采用遗传算法.它的结果是产生信息素的初始分布.算法的后期采用蚂蚁算法.因为有初始信息素的分布,具有并行、有反馈性和高效的求解效率.由于在遗传算法中使用随机的种群,这样不仅能够提高蚂蚁算法的速度,而且在求精解的时候能够避免陷入局部最优解.算法具有良好的优化性能和时间性能.