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

arXiv 2017年

作者： Luo, Ming-Xing Li, Hui-Ran Lai, Hong Wang, Xiaojun Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu610031 China Department of Physics University of Michigan Ann ArborMI48109 United States School of Computer and Information Science Southwest University Chongqing400715 China School of Electronic Engineering Dublin City University Dublin 9 Ireland

The linear superposition principle in quantum mechanics is essential for several no-go theorems such as the no-cloning theorem, the no-deleting theorem and the no-superposing theorem. It remains an open problem of finding general forbidden principles to unify these results. In this paper, we investigate general quantum transformations forbidden or permitted by the superposition principle for various goals. First, we prove a no-encoding theorem that forbids linearly superposing of an unknown pure state and a fixed state in Hilbert space of a finite dimension. Two general forms include the no-cloning theorem, the no-deleting theorem, and the no-superposing theorem as special cases. Second, we provide a unified scheme for presenting perfect and imperfect quantum tasks (cloning and deleting) in a one-shot manner. This scheme may lead to fruitful results that are completely characterized with the linear independence of the input pure states. The generalized upper bounds for the success probability are proved. Third, we generalize a recent superposing of unknown states with fixed overlaps when multiple copies of the input states are available. Copyright © 2017, The Authors. All rights reserved.

关键词： Cloning

来源：评论

学校读者我要写书评

暂无评论

Modularity based community detection with deep learning 25

Modularity based community detection with deep learning

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Liang, Yang Cao, Xiaochun He, Dongxiao Chuan, Wang Xiao, Wang Weixiong, Zhang State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China School of Information Engineering Tianjin University of Commerce China School of Computer Science and Technology Tianjin Key Laboratory of Cognitive Computing and Application Tianjin University China Department of Computer Science and Technology Tsinghua University China College of Math and Computer Science Institute for Systems Biology Jianghan University China Department of Computer Science and Engineering Washington University St. Louis United States

Identification of module or community structures is important for characterizing and understanding complex systems. While designed with different objectives, i.e., stochastic models for regeneration and modularity maximization models for discrimination, both these two types of model look for low-rank embedding to best represent and reconstruct network topology. However, the mapping through such embedding is linear, whereas real networks have various nonlinear features, making these models less effective in practice. Inspired by the strong representation power of deep neural networks, we propose a novel nonlinear reconstruction method by adopting deep neural networks for representation. We then extend the method to a semi-supervised community detection algorithm by incorporating pairwise constraints among graph nodes. Extensive experimental results on synthetic and real networks show that the new methods are effective, outperforming most state-of-the-art methods for community detection.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of parallel replica molecular dynamics

引用

AIP Conference Proceedings 2018年第1期1978卷

作者： Boyao Zhang Jue Wang Yangde Feng Ji Xiang Lei Wang 1Computer Network Information Center Chinese Academy of Science Department of High Performance Computing Technology and Application Development Beijing China 2University of Chinese Academy of Sciences Beijing China 3State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China 4School of cybersecurity Chinese Academy of Sciences China

Molecular dynamics simulation is an important tool for studying materials microstructure evolution under radiation effects. It is difficult to simulate atomic diffusion in materials owing to the time-scale limitations of the molecular dynamics method. Accelerated molecular dynamics has been developed as a solution and the parallel replica method is the simplest and most accurate of the accelerated dynamics techniques. The simulation time scale can reach several orders more than the direct molecular dynamics, while retaining the complete atomic detail. In parallel replica method, the entire system is replicated on each of M available parallel or distributed processors, it is in line with the characteristics of high-performance parallel computing and can be optimized from the program level.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GB-RC4: Effective brute force attacks on RC4 algorithm using GPU 7

GB-RC4: Effective brute force attacks on RC4 algorithm using...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：