飞腾平台中硬件数据压缩的驱动设计与实现

数据压缩是有效处理大数据的关键技术,在飞腾处理器平台上基于zlib库的数据压缩通常采用软件的方式实现,在数据处理量大而且实时性要求较高的情况下,已经难以满足需求。针对这个问题,通过研究zlib编程函数库,结合飞腾处理器的特性,完成了飞腾平台中硬件数据压缩的驱动设计与实现,其中提出了双向DMA传输技术和基于一致性内存的命令环机制,从而进一步提高了基于硬件的数据压缩的效率。通过实验证实了飞腾平台中采用硬件数据压缩改进的有效性。     

基于生理振动分析的手机用户身份识别

为保护手机用户的个人信息,对用户进行身份识别认证,提出一种生物识别方法。利用智能手机内置的传感器,采集人体的生理振动信息;通过对采集数据进行去重力等预处理,提取均值、方差、能量、峰度、偏度等特征指标,利用z‐score方法进行标准化处理;进行分类器设计,得出分类器的查准率、误检率等评价指标。分析60组不同用户的生理振动数据,分析结果表明,该分类器的查准率最高可达98?33％。     

引入测评机制的综合学习粒子群优化算法

综合学习粒子群算法（CLPSO）能够改善粒子群算法多样性差且易局部收敛的问题,相比传统PSO算法能够一定程度避免算法早熟,但却存在收敛速度慢的问题。对此,提出一种CLPSO的改进算法（CLPSO‐II）,为每个粒子随机构造两个学习粒子,引入测评机制,择优学习。实验结果表明,CLPSO‐II能有效提高CLPSO的搜索效率,在处理多峰函数时,其性能优于传统粒子群算法（PSO）、全面学习粒子群算法（FIPS）和综合学习粒子群算法（CLPSO）。     

一种用于流交换的代理重签名方案

为了解决大规模复杂网络环境下流交换的安全问题,首次将代理重签名技术应用到安全流交换中,提出一种用于流交换的基于陷门Hash函数的代理重签名方案.首先,针对陷门Hash函数在流交换应用中存在的密钥泄露问题,提出一种新的基于椭圆曲线的无密钥泄露的陷门Hash函数(EDL-MTH),并对其安全性加以证明;然后,基于EDL-MTH构造了一个在随机预言模型下可证明适应性选择消息攻击安全的代理重签名方案;最后,通过一个示例分析了该方案在安全流交换中的应用和性能.     

应用佳点集的混合反向学习人工鱼群算法

为了改善人工鱼群算法求解精度较低、容易过早收敛的弱点,提出了一种应用佳点集和反向学习的人工鱼群算法.改进算法在迭代中对当前种群中部分优质个体执行一般动态反向学习,生成它们的反向种群,引导种群向包含全局最优的解空间逼近,以提高算法的平衡和探索能力.当种群的拥挤程度超过阈值λ时,利用佳点集机制对大部分个体重新初始化,以帮助算法脱离局部最优的约束.在六个Benchmark函数上的实验表明,该算法收敛速度快、求解精度高,适合求解函数优化问题.     

基本初等函数的保密云计算服务协议

目前云计算已经成为解决很多问题的一个有力平台,同时也带来了大量的安全隐患。其中,关于基本初等函数的保密计算是所有云计算的基础和核心。 提出了所有基本初等函数的保密云计算服务协议,其基本思想是将原始数据做变换后,把计算复杂部分发给云平台,通过云计算将结果反馈给接受服务方,从而保密地计算相应函数。通过广泛接受的模拟范例证明了协议的安全性。协议中接受计算服务方可用很少的计算资源解决复杂的计算问题,保证了较低的计算复杂度和通信复杂度,因此提出的协议是有效可行的,可以成为云保密计算中的基础子协议。     

On the Controllability of Nonlocal Second‐Order Impulsive Neutral Stochastic Integro‐Differential Equations with Infinite Delay

In this paper, we investigate the controllability for a class of nonlocal second‐order impulsive neutral stochastic integro‐differential equations with infinite delay in Hilbert spaces. More precisely, a set of sufficient conditions for the controllability results of nonlocal second‐order impulsive neutral stochastic integro‐differential equations with infinite delay are derived by means of the Banach fixed point theorem combined with theories of a strongly continuous cosine family of bounded linear operators. As an application, an example is provided to illustrate the obtained theory.     

Security optimal power flow considering loading margin stability using hybrid FFA–PS assisted with brainstorming rules

This paper presents a new power system planning strategy which combines firefly algorithm (FFA) with pattern search algorithm (PS). The purpose is minimizing total fuel cost, total power loss and reducing total voltage deviation, with the objective of enhancing the loading margin stability and consequently the power system security. A new interactive and simple mechanism, inspired in brainstorming process, is proposed that allows FFA and PS algorithms to explore new regions of the search space. In this study the Static VAR compensator (SVC) is modeled and integrated in an efficient location which is chosen considering the voltage stability index. The proposed algorithm is interactive and tries to optimize a set of control variables at the same time, namely, active power generations, voltage of generators, tap transformers, and the reactive power of shunt compensators to optimize three objective functions such as: fuel cost, total power loss and total voltage deviation. These variables are optimized using a flexible interactive and competitive search mechanism. The proposed planning strategy has been examined and applied to two practical test systems IEEE 14-Bus and IEEE 30-Bus. Simulation results confirm the effectiveness of this hybrid strategy for solving the security optimal power flow.     

Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions

In this paper, we generalize polynomial-time primal–dual interior-point methods for symmetric optimization based on a class of kernel functions, which is not coercive. The corresponding barrier functions have a finite value at the boundary of the feasible region. They are not exponentially convex and also not strongly convex like many usual barrier functions. Moreover, we analyse the accuracy of the algorithm for this class of functions and we obtain an upper bound for the accuracy which depends on a parameter of the class.