基于感兴趣区的虹膜定位算法

快速虹膜定位是实现虹膜自动识别系统的基础.利用小波变换后LL频带是图像内容的抽样缩略的性质,只对LL频带的图像进行虹膜定位,基于图像光斑特性选择定位感兴趣区域,用Hough变换定位虹膜内圆,单行梯度最大值方法定位虹膜外圆,然后按比例还原所有的参数值.试验结果表明这些参数与在原始图像中进行虹膜定位得到的参数一致,定位时间大大缩短,说明了该定位算法的有效性.     

一种基于SOADL的Web服务合成方法

服务合成是面向服务的软件开发中的一个重要开发活动.探讨了体系结构设计和服务合成之间的关系,提出了一种基于体系结构的Web服务合成方法.通过自动发现服务以及自动生成过程代码和部署代码,可以将SOADL的体系结构模型转化为一个可执行的BPEL组合系统,来实现Web服务的合成.与其它服务合成方法相比,合成方法可以更好地实现从设计到实现的平滑过渡,提高合成的效率和保障合成后系统与体系结构模型之间的可跟踪性.     

语义Web服务研究方法概述

综述了语义Web服务研究背景和国内外研究现状,从行为操作、体系结构和服务本体三个方面详细描述了语义Web服务基础设施模型,研究了当前在开发语义Web服务框架方面的四种主要研究方法:IRS(Internet Reasoning Service)、OWL-S(Web Ontology Language for Service)、WSMX(Web Service Execution Environment)和METEOR-S(Managing End-To-End OpeRations-Semantics),并进行了相关的比较分析.结合已有的研究成果,指出了语义Web服务未来的研究方向及其面临的挑战.     

一种改进的支持向量机降维方法

提出了一种基于支持向量机的改进的降维方法.在输入和特征空间中,特征子集的选取分别根据原始特征每一维对分类的贡献来获得.最后,通过将输入和特征空间中的特征选取联合起来,得到了一种改进的降维方法.实验表明:使用这种方法,在保持对分类准确率不受明显的影响的同时,能大大地提高训练和预测的速度.     

间接竞争ELISA方法用于脱落酸的检测

该文研制了植物激素脱落酸(ABA)间接竞争酶联免疫试剂盒,该试剂盒可对ABA进行快速检测.文中成功制备了脱落酸和牛血清蛋白的交联物(ABA-BSA),并对交联物的浓度、抗体稀释度、酶标二抗稀释度对实验的影响进行了考察.结果表明,该试剂盒具有高灵敏性,最低检出浓度为1.38 ng/mL,在10ns/mL～1 000 ng/mL之间,吸光度与浓度的对数呈良好的线性关系.样品添加回收率在95.98%～102.25%之间,平均回收率为100.18%,变异系数(CV)在1.27%～4.68%之间,平均变异系数为3.18%.     

A single layer zero skew clock routing in X architecture

With its advantages in wirelength reduction and routing flexibility compared with conventional Manhattan routing, X architecture has been proposed and applied to modern IC design. As a critical part in high-performance integrated circuits, clock network design meets great challenges due to feature size decrease and clock frequency increase. In order to eliminate the delay and attenuation of clock signal introduced by the vias, and to make it more tolerant to process variations, in this paper, we propose an algorithm of a single layer zero skew clock routing in X architecture (called Planar-CRX). Our Planar-CRX method integrates the extended deferred-merge embedding algorithm (DME-X, which extends the DME algorithm to X architecture) with modified Ohtsuki’s line-search algorithm to minimize the total wirelength and the bends. Compared with planar clock routing in the Manhattan plane, our method achieves a reduction of 6.81% in total wirelength on average and gets the resultant clock tree with fewer bends. Experimental results also indicate that our solution can be comparable with previous non-planar zero skew clock routing algorithm. Supported in part by the National Natural Science Foundation of China (Grant No. 60876026), and the Specialized Research Fund for the Doctoral Program of Higher Education (Crant No. 200800030026)     

跨信任域授权模型

分析ISO10181访问控制框架与权限管理基础设施PMI,提出了跨信任域的授权模型CTRA.并用可信的边界安全网关实现该模型,解决了跨不同信任域的信任与授权问题,建立了跨不同安全域的信息交换与共享的可信计算平台.     

Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows

Detecting duplicates in data streams is an important problem that has a wide range of applications. In general,precisely detecting duplicates in an unbounded data stream is not feasible in most streaming scenarios,and,on the other hand,the elements in data streams are always time sensitive. These make it particular significant approximately detecting duplicates among newly arrived elements of a data stream within a fixed time frame. In this paper,we present a novel data structure,Decaying Bloom Filter(DBF),as an extension of the Counting Bloom Filter,that effectively removes stale elements as new elements continuously arrive over sliding windows. On the DBF basis we present an efficient algorithm to approximately detect duplicates over sliding windows. Our algorithm may produce false positive errors,but not false negative errors as in many previous results. We analyze the time complexity and detection accuracy,and give a tight upper bound of false positive rate. For a given space G bits and sliding window size W,our algorithm has an amortized time complexity of O((G/W))~(1/2). Both analytical and experimental results on synthetic data demonstrate that our algorithm is superior in both execution time and detection accuracy to the previous results.     

销售财务系统中数据库性能优化研究

随着数据库在各行各业中的广泛应用,销售财务系统中数据库性能的好坏直接影响到企业业务的正常运行以及企业的效率。为了提高企业效率,通过在设计阶段、运行阶段调优数据库,介绍了几点优化销售财务系统中数据库性能的方法,完成了数据库的优化,使数据库运行在高性能状态下。     

基于局部奇异值分解和D-S理论的人脸识别方法

;提出了基于局部奇异值分解和D-S证据理论的人脸识别方法.首先分割出人脸图像的5个特殊区域并分别进行奇异值分解,提取一些较大的奇异值构成每一区域的特征向量;在识别阶段,计算待识别人脸图像每一区域对所有训练样本人脸图像相应区域的隶属度,最后由D-S理论的组合规则做出判断.基于ORL人脸数据库的实验结果证明了本文方法的有效性和可行性.