多布鲁姆过滤器检索算法研究
作者：
田小梅;胡灿;李浪
期刊：
衡阳师范学院学报 ,2015年36(06):27-31 ISSN：1673-0313
作者机构：
衡阳师范学院计算机科学与技术学院,湖南衡阳,421002;湖南环境生物职业技术学院艺术设计学院,湖南衡阳,421005;[胡灿] 湖南环境生物职业技术学院;[李浪; 田小梅] 衡阳师范学院
关键词：
布鲁姆过滤器;多布鲁姆过滤器检索算法;并行布鲁姆过滤器;海量数据;布鲁姆过滤器代数运算
摘要：
对于日益增长的海量数据来说,它的高效存储与检索成为一类具有挑战性的问题.布鲁姆过滤器是一种高效的存储结构,支持数据的快速检索,可用于海量数据的处理.各类分布式网络系统处理海量数据时,常常借助多布鲁姆过滤器检索算法来完成.本文概括了多布鲁姆过滤器检索算法的研究现状,总结了算法的主要应用,并给出了进一步的研究方向.
语种：
中文
展开
基于云计算的网络学习资源共建共享关键技术研究
作者：
刘辉
期刊：
电脑与电信 ,2015年(6):19-20+30 ISSN：1008-6609
作者机构：
衡阳师范学院计算机科学与技术学院,湖南 衡阳,421002;[刘辉] 衡阳师范学院
关键词：
云计算;网络学习资源共享;关键技术;解决方案
摘要：
云计算具备十分可靠的安全的数据存储系统和方便快捷的网络服务系统,教育资源通过云计算可以有效地进行提取、组织、分类和索引,进而实现教育资源的有效共享。本文就网络学习资源共享中出现的一些问题进行分析,探究在云计算环境下网络学习资源共建共享的解决方案。
语种：
中文
展开
Randomized Algorithms for Parameterized Kidney Exchange Problem
作者：
Mugang Lin;Jianxin Wang;Qilong Feng
作者机构：
[Mugang Lin; Jianxin Wang; Qilong Feng] School of Information Science and Engineering,Central South University,Changsha 410083,China;[Mugang Lin] Department of Computer Science,Hengyang Normal University,Hengyang 421002,China
会议名称：
2015全国理论计算机科学学术年会
会议时间：
2015-10-30
会议地点：
金华
会议主办单位：
中国计算机学会
会议论文集名称：
2015全国理论计算机科学学术年会论文集
关键词：
Kidney exchange problem;Randomized algorithm;Parameterized algorithm
摘要：
Kidney exchange programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs.The core of these programs are algorithms to solve kidney exchange problem, which can be modeled as finding a maximum weight packing of vertex-disjoint cycles with length at most some small constant L (typically 2 ≤ L ≤ 5) in a directed graph.In generally, the objective function is maximizing the number of possible kidney transplants.In this paper, we study the random methods for the kidney exchange problem involving only 2-cycle and 3-cycle exchanges.First, we formal the kidney exchange problem as a parameterized model.And then we propose a randomized parameterized algorithm of running time O*(5.63k3 · 22k2) by randomly partitioning the vertices.Last, by using the random divide-and-conquer technique, another randomized algorithm of running time O* (k2[log k2/2.k3[logk3]/2.42k3.22k2) is given for the parameterized kidney problem.Moreover,our randomized algorithms can be extended to solve the general kidney exchange problem.
语种：
英文
展开
基于ACM/ICPC模式的数据结构教学的探讨
作者：
赵磊
期刊：
福建电脑 ,2015年(12):152-153 ISSN：1673-2782
作者机构：
衡阳师范学院 计算机科学与技术学院 湖南 衡阳 421001;[赵磊] 衡阳师范学院
关键词：
数据结构
摘要：
针对数据结构课程教学中存在的问题,在调研ACM/ICPC模式和特点的基础上,将ACM/ICPC引入到数据结构课程教学中。通过建立ACM/ICPC在线评测系统、基于ACM模式改进教学计划、进行基于ACM模式的课堂教学、改革考核手段等方式来实施数据结构课程的教学改革,并在实际教学应用中取得了很好的效果。
语种：
中文
展开
融入ACM／ICPC竞赛的程序设计类课程教学的改革与探讨
作者：
赵磊
期刊：
电脑知识与技术 ,2015年11(25):116-117 ISSN：1009-3044
作者机构：
衡阳师范学院计算机科学与技术学院,湖南衡阳,421001;[赵磊] 衡阳师范学院
关键词：
程序设计
摘要：
针对程序设计类教学中存在的问题,在调研ACM/ICPC竞赛模式和特点的基础上,将ACM/ICPC竞赛引入到程序设计类教学中,通过建立ACM/ICPC在线评测系统、课堂教学融入ACM/ICPC、实践教学全程ACM/ICPC化、改革考核手段等方式来实施程序设计类课程的教学改革,并在实际教学应用中取得了一定的成效。
语种：
中文
展开
EPCBC密码算法的FPGA优化实现研究
作者：
李浪;邹祎;贺位位;李仁发
期刊：
电子科技大学学报 ,2015年44(1):97-100 ISSN：1001-0548
作者机构：
[李浪; 邹祎] Department of Computer Science, Hengyang Normal University, Hengyang;Hunan;421002, China;[李仁发] College of Information Science and Engineering, Hunan University, Changsha;410082, China
关键词：
面积优化;EPCBC加密算法
摘要：
针对资源约束的智能卡加密需要小面积实现的问题,对EPCBC加密算法从硬件上实现面积优化进行了如下研究:1)相同运算只实现一次,主程序调用32次完成加密;2)对S盒变换和密钥变换使用同一寄存器,从而节省寄存器数量;3)把密文轮操作和密钥更新放在一个模块中。通过FPGA优化结果表明,EPCBC密码算法实现面积大幅度减小,优化率达到56%,同时加密运算性能也没有降低,从而为开发受资源约束的智能卡密码硬件提供可行方案。
语种：
中文
展开
新形势下高校工会服务教职工的现状与对策研究
作者：
郑光勇;徐峰
期刊：
才智(才情斋) ,2015年(33):145-146 ISSN：1673-0208
作者机构：
衡阳师范学院计算机科学与技术学院
关键词：
高校工会;服务;现状;对策
摘要：
论文研究了在当前新的形势下,如何提高高校工会的工作效率,充分发挥服务教职工的职能。介绍了工会的相关基础研究工作以及高校工会的职能,并以作者所在学校为例,通过调查工会工作的实际情况,以点带面分析了当前高校工会在服务教职工方面的不足,针对当前存在的一些问题,探索了高校工会服务教职工的有效对策。
语种：
中文
展开
一种轻量级TWINE密码硬件优化实现研究
作者：
李浪;邹祎;贺位位;李仁发;刘波涛
期刊：
计算机科学 ,2015年42(2):127-130 ISSN：1002-137X
作者机构：
[李浪; 邹祎; 贺位位; 刘波涛] 衡阳师范学院计算机系;[李仁发] 湖南大学信息科学与工程学院
关键词：
轻量级密码算法;优化;FPGA实现
摘要：
随着物联网的广泛应用,如何有效实现轻量级密码算法成为近年的研究热点。对2011年提出的TWINE加密算法进行了硬件优化实现,相同的轮运算只实现一次,采用重复调用方式完成。TWINE算法总共有36轮运算,其中前35轮运算结构相同,可以重复调用实现,而第36轮相比前35轮在结构上少了块混淆,因此原始算法最多只能进行35轮重复调用。直接进行36轮循环调用运算,同时在36轮循环运算完成后构造一个块混淆逆运算,运算一次块混淆逆运算即可使输出密文正确。这样使TWINE最后的第36轮不必重新实现,而是直接复用前面可重复轮函数模块,只需增加一个比原始算法最后一轮运算相对简单的块混淆逆运算。下载到FPGA上的实验结果表明,优化后的TWINE密码算法在面积上减少了2204个Slices,系统速率提高了5倍。
语种：
中文
展开
Parameterized Minimum Cost Partition of a Tree with Supply and Demand
作者：
Lin, Mugang* ;Li, Wenjun;Feng, Qilong
期刊：
Lecture Notes in Computer Science ,2015年9130:180-189 ISSN：0302-9743
通讯作者：
Lin, Mugang
作者机构：
[Feng, Qilong; Li, Wenjun; Lin, Mugang] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.;[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.
通讯机构：
[Lin, Mugang] C;Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.
会议名称：
International Frontiers of Algorithmics Workshop
会议时间：
20150703-05
会议地点：
Guilin
会议主办单位：
[Lin, Mugang;Li, Wenjun;Feng, Qilong] Cent S Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China.^[Lin, Mugang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.
会议论文集名称：
Frontiers in algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings
摘要：
In this paper, we study the minimum cost partition problem of a tree with supply and demand. For the kernelizaton of the problem, several reduction rules are given, which result in a kernel of size O(k<sup>2</sup>) for the problem. Based on the branching technique, a parameterized algorithm of running time O* (2.828<sup>k</sup>) is presented. ©Springer International Publishing Switzerland 2015.
语种：
英文
展开
一种基于边交换的贪心算法求解md-MST问题
作者：
赵磊;刘辉;魏书堤;陈坚祯;林睦纲
期刊：
数学的实践与认识 ,2015年(19):175-185 ISSN：1000-0984
作者机构：
衡阳师范学院计算机系,湖南衡阳,421001
关键词：
最小度限制最小生成树;贪心;边交换;最优解
摘要：
通过对最小度限制最小生成树（md-MST）问题性质进行分析,提出了一种基于边交换的贪心算法.算法先用贪心算法生成一棵生成树ST,然后对生成树ST经过边交换调整,得到满足问题约束条件的可行解,再对生成树ST进行进一步边交换优化,得到md-MST问题的最优解或接近最优解的近似解.实验证明,算法能在短对间内求出大规模顶点随机图的md-MST,是一种非常实用的求解md-MST问题的精确算法.
语种：
中文
展开
大学计算机基础课程教学现状研究与改革探讨
作者：
余莹;魏书堤;邓红卫;陈坚祯
期刊：
亚太教育 ,2015年(25):77+63 ISSN：2095-9214
作者机构：
[陈坚祯; 魏书堤; 余莹; 邓红卫] 衡阳师范学院计算机科学与技术学院
关键词：
计算机基础课程;教学改革;教学效果
摘要：
通过设置合理课程体系,提高教师队伍业务素养,实施以创新能力培养为核心的实验教学等措施进行教学改革,提高计算机基础课程教学的效果和质量,实现培养非计算机专业学生计算思维和操作技能的教学目标。
语种：
中文
展开
Motion boundary based sampling and 3D co-occurrence descriptors for action recognition
作者：
Peng, Xiaojiang;Qiao, Yu* ;Peng, Qiang
期刊：
Image and Vision Computing ,2014年32(9):616-628 ISSN：0262-8856
通讯作者：
Qiao, Yu
作者机构：
[Peng, Qiang; Peng, Xiaojiang] Southwest Jiaotong Univ, Chengdu, Peoples R China.;[Peng, Xiaojiang] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.;[Qiao, Yu; Peng, Xiaojiang] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen Key Lab CVPR, Shenzhen, Peoples R China.;[Qiao, Yu] Chinese Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China.;[Qiao, Yu] 1068 Xueyuan Ave, Shenzhen, Peoples R China.
通讯机构：
[Qiao, Yu] 1;1068 Xueyuan Ave, Shenzhen, Peoples R China.
关键词：
3D co-occurrence descriptors;Action recognition;Bag of Features;Dense trajectory;Motion boundary
摘要：
Recent studies witness the success of Bag-of-Features (BoF) frameworks for video based human action recognition. The detection and description of local interest regions are two fundamental problems in BoF framework. In this paper, we propose a motion boundary based sampling strategy and spatial-temporal (3D) co-occurrence descriptors for action video representation and recognition. Our sampling strategy is partly inspired by the recent success of dense trajectory (DT) based features [Wang et al., 2013] for action recognition. Compared with DT, we densely sample spatial-temporal cuboids along a motion boundary which can greatly reduce the number of valid trajectories and preserve the discriminative power. Moreover, we develop a set of 3D co-occurrence descriptors which take account of the spatial-temporal context within local cuboids and deliver rich information for recognition. Furthermore, we decompose each 3D co-occurrence descriptor at pixel level and bin level and integrate the decomposed components with a multi-channel framework, which can improve the performance significantly. To evaluate the proposed methods, we conduct extensive experiments on three benchmarks including KTH, YouTube and HMDB51. The results show that our sampling strategy significantly reduces the computational cost of point tracking without degrading performance. Meanwhile, we achieve superior performance than the state-of-the-art methods. We report 95.6% on KTH, 87.6% on YouTube and 51.8% on HMDB51. © 2014 Elsevier B.V.
语种：
英文
展开
A study on the flow field simulation of insertion flow sensor in large diameter pipeline
作者：
Chen Jian-zhen* ;Li Bin;Wang Hui;Lian Xiao-man;Xu Yu-ming
期刊：
Applied Mechanics and Materials ,2014年487:470-474 ISSN：1660-9336
通讯作者：
Chen Jian-zhen
作者机构：
[Chen Jian-zhen; Lian Xiao-man; Xu Yu-ming; Wang Hui] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421002, Peoples R China.;[Li Bin] Shanghai Univ, Sch Mech & Elect Engn & Automat, Shanghai, Peoples R China.
通讯机构：
[Chen Jian-zhen] H;Hengyang Normal Univ, Dept Comp Sci, Hengyang 421002, Peoples R China.
会议名称：
International Conference on Mechanical Structures and Smart Materials (ICMSSM 2013)
会议时间：
NOV 16-17, 2013
会议地点：
Xiamen, PEOPLES R CHINA
会议主办单位：
[Chen Jian-zhen;Wang Hui;Lian Xiao-man;Xu Yu-ming] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421002, Peoples R China.^[Li Bin] Shanghai Univ, Sch Mech & Elect Engn & Automat, Shanghai, Peoples R China.
会议论文集名称：
Applied Mechanics and Materials
关键词：
CFD;Flow field distribution;Insertion flowmeter
摘要：
The study is to employ the analysis method of CFD simulation, when putting the insertion flow sensor in large-diameter pipe, to analyse the characteristics of flow field distribution of the insertion flow sensor in detail. It reveals the flow field distribution at the position of average flowrate and the vortex shedding around insertion flow sensor, which provides an important basis for design of the insertion flow sensor with high performance.
语种：
英文
展开
Solder joint imagery compressing and recovery based on compressive sensing
作者：
Zhao, Huihuang* ;Wang, Yaonan;Qiao, Zhijun;Fu, Bin
期刊：
Soldering & Surface Mount Technology ,2014年26(3):129-138 ISSN：0954-0911
通讯作者：
Zhao, Huihuang
作者机构：
[Zhao, Huihuang; Wang, Yaonan] Hunan Univ, Coll Elect & Informat Engn, Changsha 410082, Hunan, Peoples R China.;[Zhao, Huihuang] HengYang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.;[Fu, Bin; Qiao, Zhijun] Univ Texas Pan Amer, Dept Math, Edinburg, TX 78541 USA.
通讯机构：
[Zhao, Huihuang] H;Hunan Univ, Coll Elect & Informat Engn, Changsha 410082, Hunan, Peoples R China.
关键词：
Assembly;Solder joints;Solder;Pin-in-paste
摘要：
Purpose: The purpose of this paper is to develop an improved compressive sensing algorithm for solder joint imagery compressing and recovery. The improved algorithm can improve the performance in terms of peak signal to noise ratio (PSNR) of solder joint imagery recovery. Design/methodology/approach: Unlike the traditional method, at first, the image was transformed into a sparse signal by discrete cosine transform;then the solder joint image was divided into blocks, and each image block was transformed into a one-dimensional data vector. At last, a block compressive sampling matching pursuit was proposed, and the proposed algorithm with different block sizes was used in recovering the solder joint imagery. Findings: The experiments showed that the proposed algorithm could achieve the best results on PSNR when compared to other methods such as the orthogonal matching pursuit algorithm, greedy basis pursuit algorithm, subspace pursuit algorithm and compressive sampling matching pursuit algorithm. When the block size was 16 X 16, the proposed algorithm could obtain better results than when the block size was 8X8 and 4X4. Practical implications: The paper provides a methodology for solder joint imagery compressing and recovery, and the proposed algorithm can also be used in other image compressing and recovery applications. Originality/value: According to the compressed sensing (CS) theory, a sparse or compressible signal can be represented by a fewer number of bases than those required by the Nyquist theorem. The findings provide fundamental guidelines to improve performance in image compressing and recovery based on compressive sensing. ©Emerald Group Publishing Limited.
语种：
英文
展开
A parallel chemical reaction optimization for multiple choice knapsack problem
作者：
Tung Khac Truong;Ahmad Salah;Yuming Xu;Shuangnan Fan
期刊：
Communications in Computer and Information Science ,2014年405:482-489 ISSN：1865-0929
通讯作者：
Fan, S.
作者机构：
[Truong T.K.] Industrial University of Hochiminh City, Hochiminh, Viet Nam;[Salah A.] Department of Computer Science, Zagazig University, Zagazig, Sharkia, 44519, Egypt;[Xu Y.] Department of Computer Science, Hengyang Normal University, Hengyang, Hunan, 421008, China;[Fan S.] College of Computer, Hunan Science and Technology Economy Trade Vocation College, Hengyang, Hunan, 421001, China
通讯机构：
[Fan, S.] C;College of Computer, , Hengyang, Hunan, 421001, China
会议名称：
26th International Conference on Parallel Computational Fluid Dynamics, ParCFD 2013
会议时间：
20 May 2013 through 24 May 2013
关键词：
Knapsack problem;Paralleled artificial chemical reaction optimization;Soft computing
摘要：
This research proposed a new parallel algorithm based on chemical reaction optimization for multiple-choice knapsack problem (MCKP). In the proposed algorithm, master-slave parallel architecture is used and four problem-specific chemical reaction operators are suggested. The experimental results have proven the superior performance of the proposed algorithm compared to the basic chemical reaction optimization. © Springer-Verlag Berlin Heidelberg 2014.
语种：
英文
展开
Action Recognition with Stacked Fisher Vectors
作者：
Peng, Xiaojiang;Zou, Changqing;Qiao, Yu* ;Peng, Qiang
期刊：
Lecture Notes in Computer Science ,2014年8693(PART 5):581-595 ISSN：0302-9743
通讯作者：
Qiao, Yu
作者机构：
[Qiao, Yu; Peng, Xiaojiang; Zou, Changqing] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen Key Lab CVPR, Shenzhen, Peoples R China.;[Peng, Xiaojiang] Southwest Jiaotong Univ, Chengdu, Peoples R China.;[Peng, Xiaojiang; Zou, Changqing] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.;[Qiao, Yu] Chinese Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China.
通讯机构：
[Qiao, Yu] C;Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen Key Lab CVPR, Shenzhen, Peoples R China.
会议名称：
13th European Conference on Computer Vision (ECCV)
会议时间：
SEP 06-12, 2014
会议地点：
Zurich, SWITZERLAND
会议主办单位：
[Peng, Xiaojiang;Zou, Changqing;Qiao, Yu] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen Key Lab CVPR, Shenzhen, Peoples R China.^[Peng, Xiaojiang] Southwest Jiaotong Univ, Chengdu, Peoples R China.^[Peng, Xiaojiang;Zou, Changqing] Hengyang Normal Univ, Dept Comp Sci, Hengyang, Peoples R China.^[Qiao, Yu] Chinese Univ Hong Kong, Hong Kong, Hong Kong, Peoples R China.
会议论文集名称：
Lecture Notes in Computer Science
关键词：
Action recognition;Fisher vectors;stacked Fisher vectors;max-margin dimensionality reduction
摘要：
Representation of video is a vital problem in action recognition. This paper proposes Stacked Fisher Vectors (SFV), a new representation with multi-layer nested Fisher vector encoding, for action recognition. In the first layer, we densely sample large subvolumes from input videos, extract local features, and encode them using Fisher vectors (FVs). The second layer compresses the FVs of subvolumes obtained in previous layer, and then encodes them again with Fisher vectors. Compared with standard FV, SFV allows refining the representation and abstracting semantic information in a hierarchical way. Compared with recent mid-level based action representations, SFV need not to mine discriminative action parts but can preserve mid-level information through Fisher vector encoding in higher layer. We evaluate the proposed methods on three challenging datasets, namely Youtube, J-HMDB, and HMDB51. Experimental results demonstrate the effectiveness of SFV, and the combination of the traditional FV and SFV outperforms state-of-the-art methods on these datasets with a large margin. ©2014 Springer International Publishing.
语种：
英文
展开
A two-stage optimization algorithm of logistics transportation network
作者：
Wei, Shudi* ;Hui, Wang;Zhao, Huihuang
期刊：
Applied Mechanics and Materials ,2014年511-512:886-891 ISSN：1660-9336
通讯作者：
Wei, Shudi
作者机构：
[Zhao, Huihuang; Wei, Shudi; Hui, Wang] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
通讯机构：
[Wei, Shudi] H;Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
会议名称：
International Conference on Sensors, Mechatronics and Automation (ICSMA)
会议时间：
DEC 24-25, 2013
会议地点：
Shenzhen, PEOPLES R CHINA
会议主办单位：
[Wei, Shudi;Hui, Wang;Zhao, Huihuang] Hengyang Normal Univ, Dept Comp Sci, Hengyang 421008, Hunan, Peoples R China.
会议论文集名称：
Applied Mechanics and Materials
关键词：
AHP algorithm;Dynamic programming;Transport network
摘要：
In each step of logistics, transportation plays an important role to increase profit for the logistics enterprises. The vehicle routing problem is getting more and more attention of researchers and logistics enterprises. There are many factors that affect the path, many of which can only be described qualitatively, such as traffic, environment etc., These factors need to be taken into account comprehensively for path selection. The paper proposes the two-stage optimization method of transport network to solve the problem of optimal path, which combines the qualitative analysis with quantitative analysis. Examples show that it is feasible. Keywords: Transport network; AHP algorithm; Dynamic programming
语种：
英文
展开
基于Contourlet域的隐马尔可夫树模型的图像融合算法
作者：
易小波;龙祖强;邹存
期刊：
电脑与信息技术 ,2014年22(1):11-13 ISSN：1005-1228
作者机构：
衡阳师范学院计算机系,湖南衡阳,421008;[易小波; 龙祖强; 邹存] 衡阳师范学院
关键词：
图像融合;Contourlet变换;隐马尔可夫树模型;混合高斯模型
摘要：
提出一种基于Contourlet域隐马尔可夫树(CHMT)的多聚焦图像融合方法.CHMT能有效捕获不同尺度系数之间、不同方向系数之间的相关性,能为图像融合提取更多的特征信息.算法对低频子带采用区域方差法,高频子带则依据训练后模型的每一系数的后验概率进行不同的融合处理,以减少融合图像边缘处的斑块模糊现象.仿真实验结果表明,该算法优于基于Contourlet域的常规融合算法,融合后的图像具有更好的主观视觉效果.
语种：
中文
展开
FPGA Optimal Implementation of Lightweight Cryptographic Algorithms MIBS
作者：
Lang Li;Botao Liu
作者机构：
Department of Computer Science, Hengyang Normal University, HengYang, Hunan 421002, People's Republi
会议名称：
2014全国第十二届嵌入式系统学术会议
会议时间：
2014-09-21
会议地点：
长沙
会议论文集名称：
2014全国第十二届嵌入式系统学术会议论文集
关键词：
MIBS Block Cipher;FPGA;Optimal implementation
摘要：
The cryptographic algorithm MIBS was proposed in CANS 2009.It is a lightweight cryptographic algorithm which is currently suitable for the implementation such as RFID Smart Card of the IoT.It is studied to achieve the hardware area optimal implementation of encryption algorithm MIBS.Firstly,the same round operation is implemented only once.Secondly,Permutation byte is only necessary to change the order,so we can do one of the Mixlayer and Permutation.Thirdly,updateKey and SubCell are required in S-box.The two modules are not encapsulated.It can be achieved through assign functions.It is called in S-boxes at the same time in MIBSRound,this can save register.We use the assign functions so that the MIBS encryption is completed only requiring 32 clock cycles.Experimental results show that the area of optimized MIBS is less than original MIBS on FPGA.Encryption rate of optimal MIBS is 194.982 Mbps.To our knowledge,this is the first issue about implementation of MIBS algorithm on FPGA which can provide reference for the further application of IOT encryption.
语种：
英文
展开
A modified energy saving scheduling algorithm on heterogeneous systems
作者：
Shen A.;Xu Y.
作者机构：
[Shen A.] College of Information Science and Engineering, Hunan University, Chang Sha, 400082, China;[Xu Y.] Department of Computer Science, Hengyang Normal University, Heng Yang, 421008, China
会议名称：
26th International Conference on Parallel Computational Fluid Dynamics, ParCFD 2013
会议时间：
20 May 2013 through 24 May 2013
关键词：
DPM;DVS;Energy saving;Heterogeneous computing;Scheduling algorithm
摘要：
Efficient application scheduling with low energy consumption is critical for achieving high performance in heterogeneous computing system (HCS). One of the classical approaches is the combination of heuristics and Dynamic Voltage Scaling (DVS). We propose a new schedule scheme which concentrates on the energy consumption of supply voltage's varying and a modified algorithm which analyses the extra energy cost by voltage switches and the energy saving by working at a lower level to get a better energy performance of the whole system. The performance comparison study shows that the proposed algorithm outperforms the existing scheduling algorithms. © Springer-Verlag Berlin Heidelberg 2014.
语种：
英文
展开
