一种新型指纹锁电路设计

市场上主流的电子锁是基于密码设计的。密码锁的最大的缺陷是密码容易被他人窃取、猜测及遗忘。随着生物技术的发展,越来越多的活体技术应用到识别系统中,如指纹、掌纹、人脸、虹膜等。相对于其它的活体识别技术,指纹识别系统以其可实现性强,成本相对低廉,同时又具备较高的安全性,被越来越多的应用到各种场合。文章给出了一种新型的指纹锁架构,并详细论述了系统的各个组成部分以及指纹识别算法的实现流程。文章对降低系统功耗和增加保密性都提出了独特的方法。     

LAG WINDOW ESTIMATION OF THE DEGREE OF DIFFERENCING IN FRACTIONALLY INTEGRATED TIME SERIES MODELS

Abstract. In this paper we consider the estimation of the degree of differencing d in the fractionally integrated autoregressive moving-average time series model ARFIMA ( p, d, q ). Using lag window spectral density estimators we develop a regression type estimator of d which is easy to calculate and does not require prior knowledge of p and q. Some large sample properties of the estimator are studied and the performance of the estimator for small samples is investigated using the simulation method for a range of commonly used lag windows. Some practical recommendations on the choice of lag windows and the choice of the window parameters are provided.     

基于匹配策略融合的低误差快速图像拼接算法

针对目前多数拼接算法正确匹配率低、耗时及误差大的问题,提出了基于匹配策略融合的改进图像拼接算法。该算法首先仅在图像的重合区域提取SIFT特征点,并计算SURF特征描述符;其次,融合改进的最近邻比次近邻、双向交叉检查及匹配差值的阈值化3种匹配策略,结合坐标约束及RANSAC算法完成特征匹配;最后,提出利用配准参数计算任意图像到参考图像坐标空间的投影变换模型的方法,并利用多线程技术将所有图像投影至参考坐标系,经过亮度校正、加权融合后合成全景图。实验结果表明,提出的拼接算法正确匹配率提高了10~20%,拼接总耗时约为传统逐帧扩大式拼接算法的1/3,且累计误差大大降低,拼接图像畸变小。     

TREOR多晶X射线衍射图指标化程序的适用性

多晶Ｘ射线衍射图指标化的ＴＲＥＯＲ程序已被普遍采用，特别是在硅酸盐矿物等材料的晶体结构研究工作中应用很多。然而，实际上它存在着一定的缺陷，有可能得出错误的结果。本文对这一程序作了详细的检验，发现即使在理想条件下它都不适用于低对称晶系的指标化。在对程序作改进以后，该程序可适用于高对称晶系多晶衍射的指标化     

基于神经网络的轮胎胎号字符识别

介绍了采用BP神经网络来进行轮胎胎号字符识别的一种尝试性方法。用Matlab来模拟用神经网络进行胎号数字识别这一过程，用投影—变换系数法进行特征提取，确定特征输入、隐含层的神经元和输出后，经训练后可识别胎号，识别率尚可。     

香荚兰豆专题系列之六-影响香荚兰豆萃取物品质的因素及掺假的鉴别

本文主要叙述了作者在十多年来香荚兰豆萃取物的生产研究和学习心得,在我国卷烟、食品、香料香精工业中对香荚兰豆萃取物的加工及应用日益增多的今天,具有一定的参考和借鉴作用。     

Controlling aliased dynamics in motion systems? An identification for sampled-data control approach

Sampled-data control systems occasionally exhibit aliased resonance phenomena within the control bandwidth. The aim of this paper is to investigate the aspect of these aliased dynamics with application to a high performance industrial nano-positioning machine. This necessitates a full sampled-data control design approach, since these aliased dynamics endanger both the at-sample performance and the intersample behaviour. The proposed framework comprises both system identification and sampled-data control. In particular, the sampled-data control objective necessitates models that encompass the intersample behaviour, i.e., ideally continuous time models. Application of the proposed approach on an industrial wafer stage system provides a thorough insight and new control design guidelines for controlling aliased dynamics.     

An EM-based identification algorithm for a class of hybrid systems with application to power electronics

In this paper we present an identification algorithm for a class of continuous-time hybrid systems. In such systems, both continuous-time and discrete-time dynamics are involved. We apply the expectation-maximisation algorithm to obtain the maximum likelihood estimate of the parameters of a discrete-time model expressed in incremental form. The main advantage of this approach is that the continuous-time parameters can directly be recovered. The technique is particularly well suited to fast-sampling rates. As an application, we focus on a standard identification problem in power electronics. In this field, our proposed algorithm is of importance since accurate modelling of power converters is required in high- performance applications and for fault diagnosis. As an illustrative example, and to verify the performance of our proposed algorithm, we apply our results to a flying capacitor multicell converter.     

Fast fingerprint identification for large databases

Fingerprint matching has emerged as an effective tool for human recognition due to the uniqueness, universality and invariability of fingerprints. Many different approaches have been proposed in the literature to determine faithfully if two fingerprint images belong to the same person. Among them, minutiae-based matchers highlight as the most relevant techniques because of their discriminative capabilities, providing precise results. However, performing a fingerprint identification over a large database can be an inefficient task due to the lack of scalability and high computing times of fingerprint matching algorithms.In this paper, we propose a distributed framework for fingerprint matching to tackle large databases in a reasonable time. It provides a general scheme for any kind of matcher, so that its precision is preserved and its time of response can be reduced.To test the proposed system, we conduct an extensive study that involves both synthetic and captured fingerprint databases, which have different characteristics, analyzing the performance of three well-known minutiae-based matchers within the designed framework. With the available hardware resources, our distributed model is able to address up to 400 000 fingerprints in approximately half a second. Additional details are provided at http://sci2s.ugr.es/ParallelMatching.