检索结果-内蒙古大学图书馆

7th International Green and Sustainable computing Conference, IGSC 2016

作者： Xue, Pei Li, Tao Dong, Han Liu, Chunbo Ma, Wenjing Pei, Songwen College of Computer and Control Engineering Nankai University Tianjin300071 China Information Security Evaluation Center Civil Aviation University of China Tianjin300300 China Laboratory of Parallel Software and Computational Science State Key Laboratory of Computing Science Institute of Software CAS Beijing China Shanghai Key Lab of Modern Optical Systems Department of Computer Science and Engineering University of Shanghai for Science and Technology Shanghai200093 China

ISBN: (纸本)9781509051175

Encryption algorithms are applied to a variety of fields and the security of encryption algorithms depends heavily on the computational infeasibility of exhaustive key-space search. RC4 algorithm has an extensive application for stream encryption, however, the disadvantages of traditional RC4 serial algorithm are large computational quantity and slow computation speed, which means a great challenge for throughput of computing system. Graphics processors recently have been widely used as accelerators for high throughput computing. In this paper, GPU is used to improve the efficiency and performance of attacking RC4 algorithm. First, we revised RC4 algorithm to make it easier to parallelize on a GPU. Then we take advantage of constant memory and shared memory in GPU to search the key space of RC4 algorithm efficiently. Besides, we solved the bank conflict problem in shared memory to further improve the performance. Our approach was evaluated in the whole key space of 40-bit, and the results show it can complete searching of the whole key space within 12.8 hours. © 2016 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuit

A sharp condition for exact support recovery of sparse signa...

引用

2016 IEEE International Symposium on Information Theory, ISIT 2016

作者： Wen, Jinming Zhou, Zhengchun Wang, Jian Tang, Xiaohu Mo, Qun College of Information Engineering Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen China ENS de Lyon LIP Lyon69007 France School of Mathematics Southwest Jiaotong University Chengdu610031 China Dept. of Electrical and Computer Engineering Seoul National University Seoul151742 Korea Republic of Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu610031 China Department of Mathematics Zhejiang University Hangzhou310027 China

ISBN: (纸本)9781509018062

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied in the literature. In this paper, we show that for any K-sparse signal x, if the sensing matrix A satisfies the restricted isometry property (RIP) of order K+1 with restricted isometry constant (RIC) δK+1K+1 since for any given positive integer K ≥ 2 and any 1/√K+1 ≤ t K+1 = t for which OMP may fail to recover the signal x in K iterations. Moreover, the constraint on the minimum magnitude of the nonzero elements of x is weaker than existing results. © 2016 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Survey on cyberspace security

引用

Science China(Information Sciences) 2015年第11期58卷 5-47页

作者： ZHANG HuanGuo HAN WenBao LAI XueJia LIN DongDai MA JianFeng LI JianHua Computer School of Wuhan University State Key Laboratory of Mathematics Engineering and Advanced Computing Department of Computer Shanghai Jiaotong University Institute of Information Engineering Chinese Academy of Sciences School of Cyber Engineering Xidian University School of Information Security Engineering Shanghai Jiaotong University

Along with the rapid development and wide application of information technology, human society has entered the information era. In this era, people live and work in cyberspace. Cyberspace is the collection of all information systems; it is the information environment for human survival. Therefore, it is necessary to ensure the security of cyberspace. This paper gives a comprehensive introduction to research and development in this field, with a description of existing problems and some currently active research topics in the areas of cyberspace itself, cyberspace security, cryptography, network security, information system security and information content security.

关键词： cyberspace security information security cryptography network security information system security information content security

来源：评论

学校读者我要写书评

暂无评论

Empirical analysis of Rate Limiting + Leap Ahead (RL+LA) countermeasure against witty worm 15

Empirical analysis of Rate Limiting + Leap Ahead (RL+LA) cou...

引用

15th IEEE International Conference on computer and Information Technology, CIT 2015, 14th IEEE International Conference on Ubiquitous computing and Communications, IUCC 2015, 13th IEEE International Conference on Dependable, Autonomic and Secure computing, DASC 2015 and 13th IEEE International Conference on Pervasive Intelligence and computing, PICom 2015

作者： Shahzad, Khurram Woodhead, Steve Internet Security Research Laboratory Department of Electrical and Computer Engineering University of Greenwich Chatham United Kingdom

ISBN: (纸本)9781509001545

Wormable system vulnerabilities continue to be identified and so fast spreading network worms continue to pose a threat to the internet infrastructure due to their increased virulence, speed and sophistication in successive internet-wide outbreaks. The cost of a single worm outbreak has been estimated to be as high as US $2.6 billion. In this paper, we report the empirical analysis of distributed worm detection and prevention countermeasure Rate Limiting + Leap Ahead (RL+LA) by using Pseudo-Witty worm with real outbreak characteristics of Witty worm. RL+LA, is a distributed automated worm detection and containment scheme that is based on the correlation of Domain Name System (DNS) queries and the destination IP address of outgoing TCP SYN and UDP datagrams leaving the network boundary, while it also utilizes cooperation between different communicating scheme members using a custom protocol, which we term Friends. The results show a significant increase in time of infection of Witty worm, when the countermeasure scheme is invoked, although it cannot completely stops the propagation of worm. © 2015 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Erratum to “An Efficient Code-Based Threshold Ring Signature Scheme with a Leader-Participant Model”

引用

security and Communication Networks 2017年第1期2017卷

作者： Guomin Zhou Peng Zeng Xiaohui Yuan Siyuan Chen Kim-Kwang Raymond Choo Department of Computer and Information Technology Zhejiang Police College Hangzhou Zhejiang Province *** Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai *** Department of Computer Science and Engineering University of North Texas Denton TX 76203 USAunt.edu College of Information Engineering China University of Geosciences Wuhan *** Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio TX 78249 USAutsa.edu

来源：评论

学校读者我要写书评

暂无评论

Empirical Analysis of Rate Limiting + Leap Ahead (RL+LA) Countermeasure against Witty Worm

Empirical Analysis of Rate Limiting + Leap Ahead (RL+LA) Cou...

引用

IEEE International Conference on Ubiquitous computing and Communications

作者： Khurram Shahzad Steve Woodhead Internet Security Research Laboratory Department of Electrical and Computer Engineering University of Greenwich Chatham UK

ISBN: (纸本)9781509001552

Wormable system vulnerabilities continue to be identified and so fast spreading network worms continue to pose a threat to the internet infrastructure due to their increased virulence, speed and sophistication in successive internet-wide outbreaks. The cost of a single worm outbreak has been estimated to be as high as US $2.6 billion. In this paper, we report the empirical analysis of distributed worm detection and prevention countermeasure Rate Limiting + Leap Ahead (RL+LA) by using Pseudo-Witty worm with real outbreak characteristics of Witty worm. RL+LA, is a distributed automated worm detection and containment scheme that is based on the correlation of Domain Name System (DNS) queries and the destination IP address of outgoing TCP SYN and UDP datagrams leaving the network boundary, while it also utilizes cooperation between different communicating scheme members using a custom protocol, which we term Friends. The results show a significant increase in time of infection of Witty worm, when the counter-measure scheme is invoked, although it cannot completely stops the propagation of worm.

关键词： Worms Witty malware rate limiting counter-measure

来源：评论

学校读者我要写书评

暂无评论

Radiation constrained wireless charger placement

Radiation constrained wireless charger placement

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Haipeng Dai Yunhuai Liu Alex X. Liu Lingtao Kong Guihai Chen Tian He State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu CHINA Third Research Institute of Ministry of Public Security Shanghai CHINA Shanghai key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Computer Science and Engineering University of Minnesota Minneapolis MN USA Department of Automation Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781467399548

Wireless Power Transfer has become a commercially viable technology to charge devices because of the convenience of no power wiring and the reliability of continuous power supply. This paper concerns the fundamental issue of wireless charger placement with electromagnetic radiation (EMR) safety. Although there are a few wireless charging schemes consider EMR safety, none of them addresses the charger placement issue. In this paper, we propose PESA, a wireless charger Placement scheme that guarantees EMR SAfety for every location on the plane. First, we discretize the whole charging area and formulate the problem into the Multidimensional 0/1 Knapsack (MDK) problem. Second, we propose a fast approximation algorithm to the MDK problem. Third, we optimize our scheme to improve speed by double partitioning the area. We prove that the output of our algorithm is better than (1 - ϵ) of the optimal solution to PESA with a smaller EMR threshold (1 - ϵ/2)Rt and a larger EMR coverage radius (1 + ϵ/2)D. We conducted both simulations and field experiments to evaluate the performance of our scheme. Our experimental results show that in terms of charging utility, our algorithm outperforms the prior art by up to 45.7%.

关键词： Safety Wireless communication Wireless sensor networks Approximation algorithms Partitioning algorithms Inductive charging Aggregates

来源：评论

学校读者我要写书评

暂无评论

A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuit

A sharp condition for exact support recovery of sparse signa...

引用

IEEE International Symposium on Information Theory

作者： Jinming Wen Zhengchun Zhou Jian Wang Xiaohu Tang Qun Mo College of Information Engineering Shenzhen University Shenzhen China ENS de Lyon LIP Lyon France School of Mathematics Southwest Jiaotong University Chengdu China Dept. of Electrical & Computer Engineering Seoul National University Seoul Korea Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu China Department of Mathematics Zhejiang University Hangzhou China

ISBN: (纸本)9781509018079

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied in the literature. In this paper, we show that for any K-sparse signal x, if the sensing matrix A satisfies the restricted isometry property (RIP) of order K+1 with restricted isometry constant (RIC) δ K+1 K+1 since for any given positive integer K ≥ 2 and any 1/√K+1 ≤ t K+1 = t for which OMP may fail to recover the signal x in K iterations. Moreover, the constraint on the minimum magnitude of the nonzero elements of x is weaker than existing results.

关键词： Matching pursuit algorithms Electronic mail Sensors Indexes Information theory Noise measurement Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fast approximate matching of binary codes with distinctive bits

引用

Frontiers of computer Science 2015年第5期9卷 741-750页

作者： Chenggang Clarence YAN Hongtao XIE Bing ZHANG Yanping MA Qiong DAI Yizhi LIU Institute of Information Engineering Chinese Academy of Sciences National Engineering Laboratory for Information Security Technologies Beijing 100093 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Department of Automation Tsinghua University Beijing 100083 China School of Physics Beijing Institute of Technology Beijing 100081 China School of Information Science and Engineering Ocean University of China Qingdao 266100 China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan 411201 China

Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate nearest neighbor search, in which hierarchical clustering trees （HCT） are widely used. However, HCT select cluster centers randomly and build indexes with the entire binary code, this degrades search performance. In this paper, we first propose a new clustering algorithm, which chooses cluster centers on the basis of relative distances and uses a more homogeneous partition of the dataset than HCT has to build the hierarchical clustering trees. Then, we present an algorithm to compress binary codes by extracting distinctive bits according to the standard deviation of each bit. Consequently, a new index is proposed using compressed binary codes based on hierarchical decomposition of binary spaces. Experiments conducted on reference datasets and a dataset of one billion binary codes demonstrate the effectiveness and efficiency of our method.

关键词： binary codes approximate nearest neighbor search hierarchical clustering index

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource provision for cloud broker with multiple reserved instance terms 1

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Zhang, Jiangtao Chen, Shi Huang, Hejiao Wang, Xuan Du, Dingzhu School of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen518055 China Public Service Platform of Mobile Internet Application Security Industry Shenzhen518057 China Shenzhen Key Laboratory of Internet of Information Collaboration Shenzhen518055 China Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application Shenzhen518055 China Department of Computer Science University of Texas at Dallas RichardsonTX75080 United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

Relying on the knowledge of the pricing benefit of long-term reserved resource and multiplexing gains, cloud broker strives to minimize its cost by utilizing infrastructure resources from public cloud service provider. Different reserved instance terms accompanied by different prices are provisioned by the provider. How to choose the appropriate ones from various terms to meet the dynamic user demands at the least cost is a great challenge. This paper addresses the challenge by two algorithms. Extensive real world traces driven evaluations show that the heuristic algorithm runs about twice as fast as the approximation one, while both algorithms can save almost the same resource cost up to 27%. © Springer International Publishing Switzerland 2015.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：