对Al-Cu合金中α-Al及Al2Cu生长行为的探讨

研究了Al-Cu合金中α-Al和Al2Cu的生长行为,分析了初生α-Al及初生Al2Cu作为共晶核心形核的能力.结果发现,在过共晶组织中,初生相Al2Cu形貌大部分有明显的拐角,观察其平面有的呈矩形,呈现小面生长特性.而α-Al与Al2Cu共晶生长时,Al2Cu择优生长特征削弱,与α-Al耦合生长呈现非小面-非小面生长,表明Al2Cu在不同的生长阶段表现出的生长行为不同.在亚共晶组织中,初生相α-Al周围形成离异共晶的Al2Cu,而过共晶组织中初生相Al2Cu周围没有离异共晶的α-Al,表明初生相Al2Cu作为共晶层片核心的能力比初生相α-Al作为共晶层片核心的能力强.     

基于B/S架构的嵌入式网络视频监控系统

根据目前视频监控需求,采用ARM11处理器与Linux操作系统相结合的方式,提出了一种基于B/S架构的远程网络视频监控方案。使用V4L2进行视频图像采集,选择H.264压缩标准,通过硬件多格式编码器MFC完成视频硬件压缩。运用RTP流媒体传输技术实现视频数据的打包传输,客户端通过安装Active X控件完成视频图像的显示,最终实现网络视频监控功能。     

PCET based copy-move forgery detection in images under geometric transforms

With the advent of the powerful editing software and sophisticated digital cameras, it is now possible to manipulate images. Copy-move is one of the most common methods for image manipulation. Several methods have been proposed to detect and locate the tampered regions, while many methods failed when the copied region undergone some geometric transformations before being pasted, because of the de-synchronization in the searching procedure. This paper presents an efficient technique for detecting the copy-move forgery under geometric transforms. Firstly, the forged image is divided into overlapping circular blocks, and Polar Complex Exponential Transform (PCET) is employed to each block to extract the invariant features, thus, the PCET kernels represent each block. Secondly, the Approximate Nearest Neighbor (ANN) Searching Problem is used for identifying the potential similar blocks by means of locality sensitive hashing (LSH). In order to make the algorithm more robust, morphological operations are applied to remove the wrong similar blocks. Experimental results show that our proposed technique is robust to geometric transformations with low computational complexity.     

Study on the security of the authentication scheme with key recycling in QKD

In quantum key distribution (QKD), the information theoretically secure authentication is necessary to guarantee the integrity and authenticity of the exchanged information over the classical channel. In order to reduce the key consumption, the authentication scheme with key recycling (KR), in which a secret but fixed hash function is used for multiple messages while each tag is encrypted with a one-time pad (OTP), is preferred in QKD. Based on the assumption that the OTP key is perfect, the security of the authentication scheme has be proved. However, the OTP key of authentication in a practical QKD system is not perfect. How the imperfect OTP affects the security of authentication scheme with KR is analyzed thoroughly in this paper. In a practical QKD, the information of the OTP key resulting from QKD is partially leaked to the adversary. Although the information leakage is usually so little to be neglected, it will lead to the increasing degraded security of the authentication scheme as the system runs continuously. Both our theoretical analysis and simulation results demonstrate that the security level of authentication scheme with KR, mainly indicated by its substitution probability, degrades exponentially in the number of rounds and gradually diminishes to zero.     

Recover Fault Services via Complex Service-to-Node Mappings in Wireless Sensor Networks

With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level.     

基于变周期技术的自适应数据采集算法

在数据采集系统中,按需采集是平衡数据数量、提高数据质量的有效手段。本文所提出的自适应数据采集算法是基于有限采样点的一元线性回归拟合,通过实时地对采集到的数据进行分析,不断修正采样周期,使得采样周期能够快速、准确地适应被测对象的动态变化。MATLAB软件仿真表明,本方法对于被测量加速变化具有较强的动态捕捉能力,能够在降低平均采样频率的前提下减小采样失真度,且与同类方法相比失真度低,稳定性高,是测控系统中实时数据采集的一种较好的代替方案。     

盖下坝水电站坝址区岩溶发育情况初步分析

盖下坝水电站工程为高山峡谷型电站,坝址区及附近岩石为碳酸盐岩,属中等坚硬易溶岩.岩溶发育是影响本工程库水外渗的重大工程地质问题之一.从施工开挖揭示的各种溶蚀现象中分析岩溶发育特征及其规律,为防渗设计提供依据.     

A chaotic non-dominated sorting genetic algorithm for the multi-objective automatic test task scheduling problem

Solving a task scheduling problem is a key challenge for automatic test technology to improve throughput, reduce test time, and operate the necessary instruments at their maximum capacity. Therefore, this paper attempts to solve the automatic test task scheduling problem (TTSP) with the objectives of minimizing the maximal test completion time (makespan) and the mean workload of the instruments. In this paper, the formal formulation and the constraints of the TTSP are established to describe this problem. Then, a new encoding method called the integrated encoding scheme (IES) is proposed. This encoding scheme is able to transform a combinatorial optimization problem into a continuous optimization problem, thus improving the encoding efficiency and reducing the complexity of the genetic manipulations. More importantly, because the TTSP has many local optima, a chaotic non-dominated sorting genetic algorithm (CNSGA) is presented to avoid becoming trapped in local optima and to obtain high quality solutions. This approach introduces a chaotic initial population, a crossover operator, and a mutation operator into the non-dominated sorting genetic algorithm II (NSGA-II) to enhance the local searching ability. Both the logistic map and the cat map are used to design the chaotic operators, and their performances are compared. To identify a good approach for hybridizing NSGA-II and chaos, and indicate the effectiveness of IES, several experiments are performed based on the following: (1) a small-scale TTSP and a large-scale TTSP in real-world applications and (2) a TTSP used in other research. Computational simulations and comparisons show that CNSGA improves the local searching ability and is suitable for solving the TTSP.