H.264帧内预测模式选择快速算法的研究

提出一种适用于H.264帧内预测的快速算法,利用相邻像素间的梯度筛选预测模式来避免不必要的预测模式计算。实验结果表明:用全I帧编码,该算法在图像质量和输出码率基本不变的情况下,编码时间大约节省了60%。     

On calibration error of randomized forecasting algorithms

It has been recently shown that calibration with an error less than Δ>0$\Delta >0$ is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by random rounding the deterministic forecasts up to Δ$\Delta$. We show that this error cannot be improved for a vast majority of sequences: we prove that, using a probabilistic algorithm, we can effectively generate with probability close to one a sequence “resistant” to any randomized rounding forecasting with an error much smaller than Δ$\Delta$. We also reformulate this result by means of a probabilistic game.     

CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles

Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher effi...     

Constructing the nearly shortest path in crossed cubes

A graph G is panconnected if each pair of distinct vertices u,v∈V(G) are joined by a path of length l for all d_G(u,v)?l?|V(G)|-1, where d_G(u,v) is the length of a shortest path joining u and v in G. Recently, Fan et. al. [J. Fan, X. Lin, X. Jia, Optimal path embedding in crossed cubes, IEEE Trans. Parall. Distrib. Syst. 16 (2) (2005) 1190-1200, J. Fan, X. Jia, X. Lin, Complete path embeddings in crossed cubes, Inform. Sci. 176 (22) (2006) 3332-3346] and Xu et. al. [J.M. Xu, M.J. Ma, M. Lu, Paths in Möbius cubes and crossed cubes, Inform. Proc. Lett. 97 (3) (2006) 94-97] both proved that n-dimensional crossed cube, CQ_n, is almost panconnected except the path of length d_CQn(u,v)+1 for any two distinct vertices u,v∈V(CQ_n). In this paper, we give a necessary and sufficient condition to check for the existence of paths of length d_CQn(u,v)+1, called the nearly shortest paths, for any two distinct vertices u,v in CQ_n. Moreover, we observe that only some pair of vertices have no nearly shortest path and we give a construction scheme for the nearly shortest path if it exists.     

Predictive models for emission of hydrogen powered car using various artificial intelligent tools

This paper investigates the use of artificial intelligent models as virtual sensors to predict relevant emissions such as carbon dioxide, carbon monoxide, unburnt hydrocarbons and oxides of nitrogen for a hydrogen powered car. The virtual sensors are developed by means of application of various Artificial Intelligent (AI) models namely; AI software built at the University of Tasmania, back-propagation neural networks with Levenberg–Marquardt algorithm, and adaptive neuro-fuzzy inference systems. These predictions are based on the study of qualitative and quantitative effects of engine process parameters such as mass airflow, engine speed, air-to-fuel ratio, exhaust gas temperature and engine power on the harmful exhaust gas emissions. All AI models show good predictive capability in estimating the emissions. However, excellent accuracy is achieved when using back-propagation neural networks with Levenberg–Marquardt algorithm in estimating emissions for various hydrogen engine operating conditions with the predicted values less than 6% of percentage average root mean square error.     

Web日志挖掘中的数据预处理技术

数据预处理是Web日志挖掘中的重要步骤,一般分为数据清理、用户识别、会话识别和路径补充。为消除代理服务器、防火墙和本地缓存对Web日志带来的影响,采用基于引用的分析方法完成用户会话识别和路径补充。实验结果表明,在Web访问日志中的记录引用信息较完整的情况下,该方法可以高效地获得用户的访问路径。     

基于运动方向预测的快速运动估计算法

利用序列图像的相邻块运动矢量的高度相关性和运动矢量的中心偏移特性,提出一种基于运动方向预测的快速运动估计算法。设计4种方向性模板,根据参考运动矢量预测出图像块的运动情况,根据不同的运动方向选择对应的方向性模板进行搜索。实验结果表明,该算法在速度和准确性方面都优于传统的快速运动估计算法。     

基于进程执行轮廓的缓冲区溢出攻击效果检测

缓冲区溢出攻击效果检测对缓冲区溢出安全防御工作具有重要意义,该文分析进程与Windows NativeAPI的关系,以Windows NativeAPI为数据源进行攻击效果检测。提出执行轮廓的概念及其建立方法,在分析缓冲区溢出攻击效果的基础上,提出基于进程执行轮廓的缓冲区溢出攻击效果检测方法,实验结果表明该方法的有效性。     

面向攻击图构建的网络连通性分析

针对目前网络攻击图构建系统的需求,设计网络连通性分析算法。通过对网络拓扑及防火墙规则进行离线分析,可以判断网络中由若干台过滤设备分隔的任意2台主机间的连通性。引入关键实体集的概念,结合经典的Apriori算法提出一种快速有效的获取关键实体集的方法。分析对比表明,关键实体集可以在连通性分析过程中为网络中各节点的重要性评估提供有力依据。     

eMule协议的安全性研究

研究eMule协议在安全性设计方面所存在的缺陷和不足,指出eMule软件在用户隐私泄露、用户积分欺诈和恶意代码攻击3个方面对用户造成的风险,给出改进方案。针对eMule协议在Ed2k链接格式上的2个漏洞提出一种新的攻击方式,设计攻击流程,并进行模拟攻击实验,实验结果表明该攻击方式的成功率达到100％。