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

Research on Stream Cipher Model Based on Chaos Theory

International Journal of Technology Management 2013年第2期 91-93页

作者： Sun Wenjie State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan 102206

Chaos is a similar and random process which is very sensitive to initial value in deterministic system. It is a performance of nonlinear dynamical system with built-in randomness. Combined with the advantages and disadvantages of the present chaos encryption model, the paper proposes a chaotic stream cipher model based on chaos theory, which not only overcomes finite precision effect, but also improves the randomness of chaotic system and output sequence. The Sequence cycle theory generated by the algorithm can reach more than 10600 at least, which completely satisfies the actual application requirements of stream cipher system.

关键词： chaos theory stream cipher algorithm

来源：评论

学校读者我要写书评

暂无评论

An Automatic Parallel-Stage Decoupled Software Pipelining Parallelization Algorithm Based on OpenMP

An Automatic Parallel-Stage Decoupled Software Pipelining Pa...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Xiaoxian Liu Rongcai Zhao Lin Han Peng Liu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479914449

While multicore processors increase throughput for multi-programmed and multithreaded codes, many important applications are single threaded and thus do not benefit. Automatic parallelization techniques play an important role in migrating singe threaded applications to multicore platforms. Unfortunately, the prevalence of control flow, recursive data structures, and general pointer accesses in ordinary programs renders the traditional automatic parallelization techniques unsuitable. Parallel-Stage Decoupled Software Pipelining (PS-DSWP) is proposed to exploit fine-grained pipeline parallelism lurking in ordinary programs with the existence of all kinds of dependences, including arbitrary control dependences, at the instruction level. But it requires knowledge of architectural properties and hardware support of a communication channel and two special instructions. We propose an improved PS-DSWP algorithm based on OpenMP in this paper. It is implemented without relying on CPU architectures by using a high level intermediate representation. Moreover, the Program Dependence Graph (PDG) used in the algorithm is built based on the basic blocks, which exploits coarser-grained parallelism than the original PS-DSWP transformation with PDG based on instructions. OpenMP is employed in our algorithm to assign task and implement synchronization among threads while avoiding dependence on hardware support. We evaluate the loops with complex memory patterns and control flow, which cannot be dealt with by traditional techniques, on multicore platform. As a result, they can be parallelized and gain significant performance improvement with our algorithm. We obtain a maximum speedup as high as 2.07x and on average 1.39x with 5 threads.

关键词： Instruction sets Synchronization Pipeline processing Multicore processing Merging

来源：评论

学校读者我要写书评

暂无评论

Convergence and Scalarization in Whole Function Vectorization

Convergence and Scalarization in Whole Function Vectorizatio...

引用

IEEE International Symposium on Dependable, Autonomic and Secure computing (DASC)

作者： Feng Yue Jianmin Pang Jiuzhen Jin Dai Chao State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

When implementing SPMD programs on multi core platforms, whole function vectorization is an important optimization method. SPMD program has drawback that lots of instructions across multi threads are redundant which is sustained in vectorization. This paper proposes to alleviate this overhead by detecting scalar operations and extract them out in vectorization instructions. An algorithm is designed to deal with control flow and data flow synchronously in which convergent and invariance analysis is employed to statically identify convergent execution and invariant values or instructions. Our algorithm is effectively on implementing SPMD programs on multi core platforms. The experiments show our method could improve the execution efficiency by 13.3%.

关键词： Convergence Optimization Algorithm design and analysis Vectors Instruction sets Graphics processing units Multicore processing

来源：评论

学校读者我要写书评

暂无评论

The Speedup Model for Manycore Processor

The Speedup Model for Manycore Processor

引用

International Conference on Information Science and Cloud computing Companion (ISCC-C)

作者： Nan Ye Ziyu Hao Xianghui Xie State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781479952465

Integrating a large number of simple cores on the chip to provide the desired performance and throughput, microprocessor has entered the many core era. In order to fully extract the ability of the many core processor, we propose speedup models for many core architecture in this paper. Under the assumption of Hill-Marty model, we deduce our formulas based on Gustafson's Law and Sun-Ni's Law. Then, compared with the Hill-Marty model, we theoretically analyze the best allocation under the given resources. Furthermore, we apply the conclusions of our models to evaluate current many core processors and predict concrete future architecture. Our results show that the many core architecture is capable of extensive scalability and being beneficial to promote the performance, especially heterogeneous one. By using simple analytical models, we provide a better understanding of architecture design and our work complement existing studies.

关键词： Computational modeling Computer architecture Complexity theory Analytical models Parallel processing Predictive models Resource management

来源：评论

学校读者我要写书评

暂无评论

Data recovery of user-defined procedures in binary translation

Data recovery of user-defined procedures in binary translati...

引用

International Conference on BioMedical engineering and Informatics (BMEI)

作者： Xiaonan Liu Rongcai Zhao Jianmin Pang Meijuan Yin Zhenfang Wei State Key Laboratory or Mathematics Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479927623

A binary program is a set of binary data and operations on the data. In binary translation, operations on the source machine will be transplanted to the target machine. Also, the data which the operations depend on should be migrated to the target machine, so as to ensure the complete consistency of the data accessed by the transplanted target codes and the data accessed by the source codes. Firstly, the method is presented in this paper to convert the access to the data on the source machine to the access to the corresponding data on the target machine for the user-defined procedure, and to ensure the correctness of the accessed data on the target machine in the meanwhile. Then, for the binary translation from x64 architecture to RISC architecture, the data recovery method based on semantic mapping and balanced stack frame is proposed. Also, problems in data recovery for the user-defined procedure are solved by the proposed method.

关键词： Registers Semantics Libraries Reduced instruction set computing Computer architecture Layout Data mining

来源：评论

学校读者我要写书评

暂无评论

One Wide-Sense Circuit Tree per Traffic Class Based Inter-domain Multicast

One Wide-Sense Circuit Tree per Traffic Class Based Inter-do...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Chen Yue Li Chaoling Huang Kaixiang Zhang Xiaobo State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Traditional multicast protocol forms multicast trees rooted at different sources to forward packets. If the multicast sources and receivers are in different domains, these trees will produce a great number of multicast states in the backbone, resulting in poor scalability. Therefore, we propose a one Wide-Sense Circuit Tree per Traffic Class based inter-domain multicast (WSCT-TC), in which a Wide-Sense Circuit Tree (WSCT) is established for a class of multicast traffic. The WSCT is established in the backbone, along which multicast packets are forwarded by label switching. The spec of WSCT can be reconfigured according to the QoS (Quality of Service) requirement of multicast applications, to provide preferable QoS. Simulating experiment shows that WSCT-TC behaves better scalability.

关键词： Switches Receivers IP networks Quality of service Routing protocols Internet

来源：评论

学校读者我要写书评

暂无评论

Steganalysis of F5-like steganography based on selection of joint distribution features 13

Steganalysis of F5-like steganography based on selection of ...

引用

5th International Conference on Internet Multimedia computing and Service, ICIMCS 2013

作者： Liu, Yuan Luo, Xiangyang Lu, Jicang Gong, Daofu Zhengzhou Information Science and Technology Institute Zhengzhou 450001 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Zhengzhou Information Science and Technology Institute State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001 China

ISBN: (纸本)9781450322522

For steganalysis of F5-like steganography with two types of widely used joint distribution statistical features: co-occurrence matrix and Markov transition probability matrix, a feature selection and fusion method based on separability comparison is proposed in this paper. Firstly, the changing ways of F5-like steganography to image data is analyzed. Then, according to different affecting ways of the changing to two types of features, the separability of each feature component is analyzed and compared. At last, based on the comparison conclusion, a new feature is obtained by selection and fusion. Experimental results show that, compared with existing typical features, the proposed new feature can achieve higher steganalytic accuracy and enhance the detection reliability. © 2013 ACM.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

The Research on Cryptographic Algorithms Recognition Technology

The Research on Cryptographic Algorithms Recognition Technol...

引用

International Conference on Intelligent System Design and engineering Application (ISDEA)

作者： Rui Chang Liehui Jiang Hui Shu Yaobin Xie State Key Laboratory of Mathematic Engineering and Advanced Computing Zhengzhou Henan China

At present, the research on security of computer system and searching for malicious codes pays more attention to cryptographic algorithms recognition technology. However, the existing theories or tools in the field of cryptographic algorithms recognition are not mature. In order to improve the accuracy of cryptographic algorithms recognizing, this paper discusses encryption and decryption functions characteristic information database and proposes a recognition model to recognize cryptographic algorithms from binary files. The accuracy assessment indicates the model is effective and feasible.

关键词： Algorithm design and analysis Ciphers Databases Information entropy Encryption Accuracy

来源：评论

学校读者我要写书评

暂无评论

A flag simulation strategy based on fusion of semantic trees in binary translation

A flag simulation strategy based on fusion of semantic trees...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Xiaonan Liu Rongcai Zhao Jianmin Pang Meijuan Yin Lili Bai Wuping Chen State Key Laboratory or Mathematics Engineering and Advanced Computing Zhengzhou China Science and Technology on Information Assurance Laboratory Beijing China

ISBN: (纸本)9781467352512

Binary translation is the emulation of one instruction set by another through translation of code. Sequences of instructions are translated from the source to the target instruction set. The semantic equivalence conversion of instructions is the core of a binary translation system. In order to simulate the behavior of a program on the target platform more accurately, the change of the special state register must be exactly simulated. A flag register simulation strategy based on fusion of semantic trees is presented in this paper. First, it is determined whether the instructions meet some special conditions by the relations among instruction semantic trees. Then these instructions will be fused if the conditions are met. Finally, binary translation is carried out on the fused instructions. The experimental results show that the proposed binary translation strategy is effective. The strategy can not only reduce the problem of code inflation, but also improve the execution efficiency of the translated code.

关键词： Semantics Vegetation Optimization Registers Software Linux Computers

来源：评论

学校读者我要写书评

暂无评论

An improved affinity propagation clustering algorithm for large-scale data sets

An improved affinity propagation clustering algorithm for la...

引用

International Conference on Natural Computation (ICNC)

作者： Xiaonan Liu Meijuan Yin Junyong Luo Wuping Chen State Key Laboratory or Mathematics Engineering and Advanced Computing Zhengzhou China Science and Technology on Information Assurance Laboratory Beijing China

Affinity Propagation (AP) clustering does not need to set the number of clusters, and has advantages on efficiency and accuracy, but is not suitable for large-scale data clustering. To ensure both a low time complexity and a good accuracy for the clustering method of affinity propagation on large-scale data clustering, an improved AP clustering algorithm named hierarchical affinity propagation (HAP) is proposed, which clusters data points by using AP algorithm several times on different level data. The data set to be clustered is firstly divided into several subsets, each of which can be efficiently clustered by AP algorithm. Then, the AP algorithm is performed on each subset to respectively select cluster centers of each subset. Further, AP clustering was again implemented on all the local cluster centers to select well-suited global exemplars of whole data set. Finally, to efficiently and accurately cluster data points in a large-scale, all the data points are clustered by the similarities between each data point and the global exemplars. The experimental results on real and simulated data sets show that, compared with the traditional AP and adaptive AP algorithm, the HAP algorithm can greatly reduce the clustering time consumption with a relatively better clustering results.

关键词： Clustering algorithms Partitioning algorithms Algorithm design and analysis Indexes Memory management Availability Computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：