Fe-Al合金中与Al反位置原子弛豫有关的内耗峰

利用内耗方法对Fe47Al53合金中Al反位置原子的运动特征进行了研究,在410℃附近观察到了一个与合金热历史相关的弛豫型内耗峰.在快冷样品中内耗峰高度明显高于慢冷样品时内耗峰的高度;而对于快冷样品,升温测量时内耗峰高度又明显高于随后的降温测量时内耗峰的高度,内耗峰高度表明该内耗峰与快冷时残留的缺陷有关.由于该内耗峰激活能为1.88 eV,与Fe47Al53合金中Fe空位的迁移能相当,因而该峰应产生于应力诱导下Al反位置原子在Fe空位之间的运动.     

多操作系统的安全组建与维护

介绍了多操作系统安装的必要性,分析了计算机的启动过程,结合运用常用的磁盘分区工具,对硬盘分出多个主分区和扩展分区,利用GAG系统引导管理软件,在计算机启动时激活不同的主分区,从而达到启动不同操作系统的目的。另外还介绍了系统的维护和一些注意事项。     

一种改进的动力学演化算法

动力学演化算法(DEA)是一种新颖的基于统计机制理论的演化计算技术.DEA通过驱动所有的个体运动和演化,可以有效地保持种群的多样性,但是在解决一些困难的函数优化问题时,DEA收敛速度慢并且易收敛于局部最优解.提出了一种改进的带有多父体杂交和差分变异算子的动力学演化算法(IDEA),有效地加快了DEA的收敛速度并且可以轻易逃离次优解.通过解决典型的数值函数优化问题来证实算法的有效性,实验结果表明,改进的动力学演化算法具有更高的收敛速度和收敛精度.     

Office COM加载项的研究与实现

利用Office COM加载项可以补充和扩展Office应用系统的功能,可以将工作中常用的一些功能,设计成用Office COM加载项来实现,由Office COM加载项提供的功能,在整个Office应用程序中都能够使用,从而能够减少工作量,提高工作效率。本文介绍了Office COM加载项的工作原理以及用VSTO技术创建Office COM加载项的一般过程。     

A digital-twin visualized architecture for Flexible Manufacturing System

The new generation of industrial 4.0 intelligent manufacturing system consists of Human-Cyber-Physical System (HCPS), integrating human with cyber and physical systems. In manufacturing, a digital-twin visualization architecture is to solve the human-machine interaction problem that concerns digital-twin modeling on the Cyber-Physical (C-P) side and on the Human-Cyber side. Although there are many related research and applications, there lacks attention in terms of full life cycle functional services and lightweight architecture. This paper presents a general architecture of digital-twin visualization for flexible manufacturing systems (FMS). How the digital-twin C-P modeling of multi-source heterogeneous information can be described is investigated and how the 3D visualized human-machine interaction with digital-twin scenario information is explored in the proposed architecture. Besides, the visualization method of high-value information, relating to the life cycle planning, design, debugging and service stages, is studied and discussed thoroughly. Also, a digital-twin modeling concept of "Geometric information (G)-Historical samples (H)-Object attribute (O)-Snapshot collection (S)-Topology constraint (T)" (GHOST) is proposed, and methods for developing virtual digital-twin scenes architecture are presented. Based on the proposed modeling concept of GHOST for digital-twin, prototypes have been developed for the general platform of digital-twin RESTful services and the cross-platform general visual mock-up software. Experimental results show that this method is effective in the FMS lifecycle in various aspects.     

Efficient protocol for data clustering by fuzzy Cuckoo Optimization Algorithm

Data clustering is a technique for grouping similar and dissimilar data. Many clustering algorithms fail when dealing with multi-dimensional data. This paper introduces efficient methods for data clustering by Cuckoo Optimization Algorithm; called COAC and Fuzzy Cuckoo Optimization Algorithm, called FCOAC. The COA by inspire of cuckoo bird nature life tries to solve continuous problems. This algorithm clusters a large dataset to prior determined clusters numbers by this meta-heuristic algorithm and optimal the results by fuzzy logic. Firstly, the algorithm generates a random solutions equal to cuckoo population and with length dataset objects and with a cost function calculates the cost of each solution. Finally, fuzzy logic tries for the optimal solution. The performance of our algorithm is evaluated and compared with COAC, Black hole, CS, K-mean, PSO and GSA. The results show that our algorithm has better performance in comparison with them.     

基于连续级配方程的粗粒料压实密度缩尺效应试验研究

根据双江口心墙堆石坝堆石料的原型平均设计级配曲线,采用剔除法、等量替代法、相似级配法和混合法等4种不同缩尺方法得到室内最大干密度试验成果。结合土的连续级配方程,采用级配面积与小于5 mm的颗粒质量分数P₅构建的函数式作为级配量化指标,拟合出最大干密度与试验前级配曲线面积、P₅及最大粒径之间的关系,据此可推求出原型级配的最大干密度。通过分析得到试验前后级配量化指标之间的拟合公式,并利用试验前后级配量化指标的相对变化量B_w作为颗粒破碎的定量指标,探讨了缩尺方法对压实过程粗粒料颗粒破碎的影响。结果表明,采用等量替代法缩尺,B_w随粒径的增大呈减小趋势;而采用剔除法、相似级配法和混合法缩尺,B_w随粒径增大呈增大趋势。     

A new chain-coding algorithm for binary images using run-length codes

This paper presents a new algorithm for converting a binary image into chain codes using its run-length codes. The basic idea of conventional chain-coding algorithm is to follow boundary pixels by convolving a 3 × 3 window with the image and to sequentially generate chain codes. The proposed algorithm has two phases, namely run-length coding and chain-code generation. We use connectivity information between runs as well as their coordinates in the phase of run-length coding. In the second phase (chain-code generation) the connectivity information extracted in the first phase is utilized for sequentially tracking runs containing the boundary pixels to be followed. This algorithm has an advantage that we can detect easily the inclusion relationship between boundaries at the same time as chain-code generation.     

Automatic smoothing with geometric surface patches

The generation of smooth surfaces from a mesh of three-dimensional data points is an important problem in the field of Computer Aided Geometric Design. A new smoothing method based upon generalized Coons' patches and calculus of variation is presented.