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

A novel plaintext-related dynamic dna image encryption algorithm based on a 4D conservative chaotic system

PHYSICA SCRIPTA 2024年第10期99卷 105215-105215页

作者： Yan, Shaohui Zhang, Jiandong Jiang, Defeng Cui, Yu Northwest Normal Univ Coll Phys & Elect Engn Lanzhou 730070 Peoples R China

Conservative chaotic systems can circumvent the flaws of dissipative systems, as they do not form chaotic attractors, thus enhancing their resilience to attacks. In this paper, a new non-Hamiltonian 4D conservative system is proposed, and the system's conservativeness and chaotic properties are confirmed through the analysis of equilibrium points, chaotic flow projections, Poincar & eacute;sections, Lyapunov exponents, and Hamiltonian energy. Moreover, the system exhibits rich dynamical behaviors such as multistability, spectral entropy complexity, and offset-boosting. Building on this, a plaintext-related initial state generation algorithm using hash function is proposed, increasing sensitivity to plaintext. Also, a dynamic dna algorithm is proposed by using plaintext information to control dna operations. This ensures that the encryption operation is unique for each image. This algorithm enriches the encoding rules, thus enhancing the algorithm's security. Experimental results show that the algorithm exhibits outstanding performance and strong resilience against various attacks.

关键词： conservative chaotic system image encryption dna algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient and Secure Color Image Encryption System with Enhanced Speed and Robustness Based on Binary Tree

引用

EGYPTIAN INFORMATICS JOURNAL 2024年 27卷

作者： Elmenyawi, Marwa A. Aziem, Nada M. Abdel Bahaa-Eldin, Ayman M. Benha Univ Benha Fac Engn Banha Egypt Arab Acad Sci Technol & Maritime Transport Arab Le Cairo Egypt ElSewedy Univ Technol Al Sharqia Governorate Egypt

Recently, there has been a growing demand for image encryption techniques that offer robust protection and minimize processing time. The proposed paper proposes an efficient color image encryption system that excels speed and security. The encryption system comprises three fundamental phases. The initial phase generates unique encryption key by combining user -defined input with the original image and applying various operations and hash functions. In the confusion phase, the image is divided into blocks, forming a Binary Tree (BT) using primary color blocks, ensuring that the root and leaves belong to different colors. The confused matrix is derived through an inorder traversal that ensures non -adjacency of pixels of the same color, introducing an added layer of security. Finally, each pixel is scrambled by applying BT to its binary form to add more security and complexity. A dna sequence is generated, and operations are executed based on two different chaotic maps, enhancing unpredictability and attack resistance. Extensive testing has validated the effectiveness of the proposed system, revealing a remarkable 28 -45% reduction in processing time compared to recent techniques. Moreover, the system successfully withstands various attacks, as demonstrated through rigorous evaluations, including high-performance, visual perception, and cryptosystem strength evaluations. These results underscore the practical applicability and robust security offered by our efficient color image encryption solution, which provides a practical solution for applications prioritizing efficiency.

关键词： Color image encryption Binary Tree Inorder traversal Chaotic map dna algorithm Hash function

来源：评论

学校读者我要写书评

暂无评论

A New dna algorithm for Coverage of Wireless Sensor Networks

A New DNA Algorithm for Coverage of Wireless Sensor Networks

引用

2015 International Conference on Advances in Management Engineering and Information Technology(AMEIT 2015)

作者： Y.C.Guo B.L.Zhang College of Electronic and Information Engineering Nanjing University of Information Science and Technology

Wireless sensor networks(WSNs) which consist of many sensors are used to monitor environmental conditions in the target area. However, unreasonable deployment for WSNs may lead to redundancy and decline working life. In order to implement full coverage for the monitored area and reduce redundancy and energy wastage, this paper proposes a new dna algorithm for coverage of WSNs. We transform WSNs coverage problem into minimum set covering problem, and according to the characteristics of minimum set covering problem, the corresponding algorithm steps are designed. Besides, a specific instance is used to verify the correctness of the proposed algorithm. The results show that the proposed algorithm can implement full coverage and reduce redundancy for WSNs. Furthermore, the proposed algorithm can be reliable and easy to be carried out.

关键词： wireless sensor networks dna algorithm minimum set covering

来源：评论

学校读者我要写书评

暂无评论

A dna algorithm for Solving Vehicle Routing Problem

A DNA Algorithm for Solving Vehicle Routing Problem

引用

International Conference on Computational Science and Computational Intelligence (CSCI)

作者： Molaei, Somayeh Molaei, Shahram Asl, M. A. Goudarzian Sadeghi, Javad Tavakkoli-Moghaddam, R. Amirkabir Univ Technol Dept Compute Sci Tehran Iran Univ Econ Sci Dept Management Tehran Iran Islamic Azad Univ Persian Gulf Int Branch Dept Business Adm Khorramshahr Iran Azad Univ Dept Ind Engn Qazvin Iran Univ Tehran Dept Ind Engn Tehran Iran

ISBN: (纸本)9781479930098

Since the great capacity of deoxyribonucleic acid (dna) computing to perform parallel relation, it has magnetized attention. Rely on this property, the dna computing can be used for solving hard problems such as NP. Complete problems. Therefore, this paper proposes a molecular algorithm to solve Vehicle Routing Problem (VRP) as an NP. hard problem. In addition, a new representation for graph in dna format is presented so that a graph is represented with only its vertices strands by defining an identifier in which specifies the existence edge between two vertices. The proposed algorithm generates an initial pool solution and creates whole random search space by polymerase chain reaction (PCR) operation and chooses a feasible solution by valid length and then selects the best solution based on distance between customers. We use both properties, selection by the length of strand that it has done by Gel Electrophoresis, and selection based on Guanine-Cytosine content.

关键词： dna algorithm Vehicle Routing Problem Guanine-Cytosine Content Graph representation

来源：评论

学校读者我要写书评

暂无评论

A new dna algorithm for solving the minimum set covering problem based on molecular beacon

A new DNA algorithm for solving the minimum set covering pro...

引用

2014 International Conference on Communication Technology and System(ICCTS 2014)

作者： Yecai Guo Binglong Zhang School of Electronic and Information Engineering Nanjing University of Information Science and Technology

dna computing is a new way of computing in computer research, which is different from the traditional method of calculation. A large number of facts indicate that many complex problems can be solved by using it. Molecular beacon is a biological molecule with similar to hairpin and can detect the target sequences in solution accurately. According to the characteristics of mathematical model for the minimum set covering problem, this paper proposed a new dna algorithm for solving the minimum set covering problem based on molecular beacon. In this proposed algorithm, the principle of molecular beacon is introduced and the procedure of solving the minimal set covering problem model is analyzed, the corresponding experimental operations were designed and a specific instance is used to verify the correctness of the proposed algorithm. The results show that this proposed algorithm is reliable and easy to be carried out without any catalyst and enzymes. Besides, molecular structures used in experiments are simple.

关键词： Minimum set covering molecular beacon dna algorithm experimental operations specific instance

来源：评论

学校读者我要写书评

暂无评论

FPGA-Based Parallel dna algorithm for Optimal Configurations of an Omnidirectional Mobile Service Robot Performing Fire Extinguishment

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2011年第3期58卷 1016-1026页

作者： Tsai, Ching-Chih Huang, Hsu-Chih Lin, Shui-Chun Natl Chung Hsing Univ Dept Elect Engn Taichung 402 Taiwan HungKuang Univ Dept Comp Sci & Informat Engn Taichung 433 Taiwan Natl Chin Yi Univ Technol Dept Elect Engn Taichung 411 Taiwan

This paper presents a coarse-grain parallel deoxyribonucleic acid (Pdna) algorithm for optimal configurations of an omnidirectional mobile robot with a five-link robotic arm. This efficient coarse-grain Pdna is proposed to search for the global optimum of the redundant inverse kinematics problem with minimal movement, thereby showing better population diversity and avoiding premature convergence. Moreover, the pipelined hardware implementation, hardware/software co-design, and System-on-a-Programmable-Chip (SoPC) technology on a field-programmable gate array (FPGA) chip are employed to realize the proposed Pdna in order to significantly shorten its processing time. Simulations and experimental results are conducted to illustrate the merit and superiority of the proposed FPGA-based Pdna algorithm in comparison with conventional genetic algorithms (GAs) for omnidirectional mobile robot performing fire extinguishment.

关键词： dna algorithm embedded system field-programmable gate-array (FPGA) omnidirectional mobile robot parallel processing

来源：评论

学校读者我要写书评

暂无评论

Solving application oriented graph theoretical problems with dna computing

引用

7th International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2012)

作者： Halasz, Veronika Hegedues, Laszlo Hornyak, Istvan Nagy, Benedek Univ Debrecen Fac Informat Debrecen Hungary Univ Debrecen Fac Informat Dept Comp Sci Debrecen Hungary

ISBN: (纸本)9788132210375

Social networks are represented by graphs. Important features of the network, e.g., length of shortest paths, centrality, are given by graph theoretical way. Bipartite graphs are used to represent various problems, for example, in medicine or in economy. The relations between customers and goods can be represented by bipartite graphs. Genes and various diseases can also form a bipartite graph, where a disease is connected to those genes that could cause it. In this paper dna computing approach is presented for solving some graph theoretical problems. Since dna computing uses a massively parallel approach, hard graph theoretical problems can be solved (at least in theory). Our main contribution is to present Projection algorithms for bipartite graphs;the molecular tube obtained by them can be used as a base for further processes.

关键词： dna computing Graph algorithms Bipartite graphs dna algorithm Networks Social network Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

A New algorithm for the Graph Coloring by Real-Time PCR

引用

JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 2013年第10期10卷 2487-2490页

作者： Iranmanesh, Ali Nejati, Razeih Tarbiat Modares Univ Dept Math Fac Math Sci Tehran Iran

In this paper, we gave a dna algorithm for the graph coloring problem. At first, we synthesized all combinatorial color assignments to the vertices of graph and then we choose all of vertices which are colored legally... 详细信息

关键词： dna algorithm Real-Time PCR Graph Coloring Problem Double Strands Primer Probes

来源：评论

学校读者我要写书评

暂无评论

Traffic guidance system based on dna algorithm

引用

Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering) 2008年第5期32卷 810-813页

作者： Ma, Xiaofeng Yan, Xinping Engineering Research Center of Transportation Safety Ministry of Education WUT Wuhan 430063 China

Traffic guidance system based on dna algorithm is introduced in this study. The road network is transformed a normal connected graph, so its edges and nodes can be coded according to the characteristic of dna algorithm. Different from GA, SA and Neural Network Model, the structure of dna double helix and the Waston-Crick complementary condition can improve the searching speed. Finally, computing results of GA and dna model are given respectively. The results show that dna algorithm is effective to traffic guidance system especially the road network is complex;meanwhile the real time performance and accuracy are satisfied.

关键词： dna algorithm Route optimization Traffic guidance system

来源：评论

学校读者我要写书评

暂无评论

Solving the minimum bisection problem using a biologically inspired computational model

引用

THEORETICAL COMPUTER SCIENCE 2010年第6期411卷 888-896页

作者： Liu, Xingchang Yang, Xiaofan Li, Shenglin Ding, Yong Logist Engn Univ Dept Logist Informat Engn Chongqing 400016 Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China

The traditional trend of dna computing aims at solving computationally intractable problems. The minimum bisection problem (MBP) is a well-known NP-hard problem, which is intended to partition the vertices of a given graph into two equal halves so as to minimize the number of those edges with exactly one end in each half. Based on a biologically inspired computational model, this paper describes a novel algorithm for the minimum bisection problem, which requires a time cost and a dna strand length that are linearly proportional to the instance size. (C) 2009 Elsevier B.V. All rights reserved.

关键词： dna algorithm Adleman-Lipton-sticker model Minimum bisection problem

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：