人群头发元素分布及某些特征研究

本文介绍用堆中子活化分析法测定人群头发中I、Br、Mg、Mn、Cu、Na、V、Cl、Al、Ca、S等11种元素。研究人发中元素分布特征、相关性特征、性别年令分布特征。方法学中还从法庭科学应用角度介绍同一性识别中差异率和重合几率的双判据方法。     

基于信息元的教学资源组织系统设计与实现 *

以文本类型教学资源为研究对象,在领域知识可拓信息网模型和CELTS-3的基础上,阐述了基于信息元的教学资源组织系统设计与实现过程,包括信息特征元数据描述框架、特征词获取、信息元距离度量、信息元匹配规则以及匹配算法等.该系统通过有限的信息元描述无限的资源,实现了教学资源的高效组织,支持学习过程中资源自动重组.     

基于演化算法的奇偶校验器自动设计*

基于演化算法技术,提出一种新的设计思想,实现奇偶校验器的电路自动设计.实验证明,多目标演化算法具有较少的运算量和较高的效率,能自动设计出使用逻辑门数更少、延时更小的奇偶校验器.     

An accelerated algorithm for full band electron–phonon scattering rate computation

Computing scattering rates of electrons and phonons stands at the core of studies of electron transport properties. In the high field regime, the interactions between all electron bands with all phonon bands need to be considered. This full band interaction implies a huge computational burden in calculating scattering rates. In this study, a new accelerated algorithm is presented for this task, which speeds up the computation by two orders of magnitude (100 times) and dramatically simplifies the coding. At the same time, it visually demonstrates the physical process of scattering more clearly.     

Local artificial boundary conditions for Schrödinger and heat equations by using high-order azimuth derivatives on circular artificial boundary

The aim of the paper is to design high-order artificial boundary conditions for the Schrödinger equation on unbounded domains in parallel with a treatment of the heat equation. We first introduce a circular artificial boundary to divide the unbounded definition domain into a bounded computational domain and an unbounded exterior domain. On the exterior domain, the Laplace transformation in time and Fourier series in space are applied to achieve the relation of special functions. Then the rational functions are used to approximate the relation of the special functions. Applying the inverse Laplace transformation to a series of simple rational function, we finally obtain the corresponding high-order artificial boundary conditions, where a sequence of auxiliary variables are utilized to avoid the high-order derivatives in respect to time and space. Furthermore, the finite difference method is formulated to discretize the reduced initial–boundary value problem with high-order artificial boundary conditions on a bounded computational domain. Numerical experiments are presented to illustrate the performance of our method.     

A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs

In recent years growing interest in local distributed algorithms has widely been observed. This results from their high resistance to errors and damage, as well as from their good performance, which is independent of the size of the network. A local deterministic distributed algorithm finding an approximation of a Minimum Dominating Set in planar graphs has been presented by Lenzen et al., and they proved that the algorithm returns a 130-approximation of the Minimum Dominating Set. In this article we will show that the algorithm is two times more effective than was previously assumed, and we prove that the algorithm by Lenzen et al. outputs a 52-approximation to a Minimum Dominating Set. Therefore the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half.     

Efficient multiple-precision integer division algorithm

Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient multi-precision integer division algorithm, and experimentally showed that it is about three times faster than the most popular algorithms proposed by Knuth [2] and Smith [3]. This paper reports a bug in the algorithm of Huang et al. [1], and suggests the necessary corrections. The theoretical correctness proof of the proposed algorithm is also given. The resulting algorithm remains as fast as that of [1].     

A multi-objective hyper-heuristic based on choice function

Hyper-heuristics are emerging methodologies that perform a search over the space of heuristics in an attempt to solve difficult computational optimization problems. We present a learning selection choice function based hyper-heuristic to solve multi-objective optimization problems. This high level approach controls and combines the strengths of three well-known multi-objective evolutionary algorithms (i.e. NSGAII, SPEA2 and MOGA), utilizing them as the low level heuristics. The performance of the proposed learning hyper-heuristic is investigated on the Walking Fish Group test suite which is a common benchmark for multi-objective optimization. Additionally, the proposed hyper-heuristic is applied to the vehicle crashworthiness design problem as a real-world multi-objective problem. The experimental results demonstrate the effectiveness of the hyper-heuristic approach when compared to the performance of each low level heuristic run on its own, as well as being compared to other approaches including an adaptive multi-method search, namely AMALGAM.     

基于Wiener结构的软测量模型及辨识算法

Wiener模型结构能有效地表征系统的动态和静态特性, 因此这里首先基于这一结构建立软测量模型, 利用动态与静态子模型分别建立辅助变量与主导变量间的动态与静态关系, 并说明该软测量模型的可行性, 给出模型具体表达式. 其次, 针对所提模型, 提出分步辨识方式获得最优模型参数, 说明其可行性. 再次, 为了减少计算和实现模型在线更新, 这里提出参数辨识递推算法, 并给出软测量模型参数的收敛性结论. 通过实例仿真, 可以看出本文提出模型的可行性, 以及分步辨识方式与递推算法的有效性.     

基于FPGA的高频全数字低电平系统算法实现

本套加速器高频低电平系统(LLRF)是中国ADS注入器II高频系统的原型机,其工作频率为162.5 MHz,以实现超导加速腔的幅度与相位稳定控制和谐振频率调节。该系统主要由射频前端和数字信号处理FPGA两部分组成。射频前端主要实现高频信号的上下变频和电平匹配;数字信号处理FPGA是系统的核心,主要完成射频信号幅值与相位的数字稳定控制,超导腔谐振频率控制,以及1 000 M以太网通信。在实验室环境下,对该系统进行了幅度和相位稳定度测试,相位稳定度峰峰值为±0.3°,有效值为0.09°,幅值相对稳定度峰峰值为±5×10-3,有效值为3.2×10-3,达到了设计要求。