Shortening the Computational Time of the Fluorescent DNA Computing

2003 ◽  
pp. 85-94 ◽  
Author(s):  
Yoichi Takenaka ◽  
Akihiro Hashimoto
Keyword(s):  
Dna Computing ◽  
Computational Time

A novel auto-encoder induced chaos based image encryption framework aiding DNA computing sequence

2021 ◽  
pp. 1-17
Author(s):  
P. Alli ◽  
J. Dinesh Peter
Keyword(s):  
Image Encryption ◽  
Dna Computing ◽  
Vital Role ◽  
Primary Data ◽  
Computational Time ◽  
Security Threats ◽  
Secret Key ◽  
Dna Encoding ◽  
Digital Network ◽  
Encryption And Decryption

The day-to-day progress in communication plays a vital role in transmitting millions and trillions of data through the unsecured network channels. It creates a way where the user’s data becomes the victim of various security threats. Among those users’ data, images act as primary data, and its encryption security methodologies are fascinating. The conventional encryption techniques don’t work well against the various other hidden security threats but require substantial computational time and cost with poor permutation performance. Hence to deal with this, an auto-encoder induced DNA (Deoxyribonucleic acid) sequence via chaotic image encryption framework is designed in our proposed work. It integrates the properties of DNA encoding and the chaotic maps to handle the data losses effectively and resist several attacks such as statistical attacks, chosen-plaintext attacks, etc. Moreover, an auto-encoder is used to control the data noises, thereby ensuring a better encryption performance. Here, the auto-encoder is activated to generate a permuted image with less time complexity and noise. A secret key is then initialized with the aid of SHA-256. Finally, image encryption and decryption are achieved, followed by the successful transmission of data over a digital network. The performance of the proposed work is analyzed with varied metrics to strengthen its efficiency over the prior techniques.

Symmetric Multistep Methods Revisited: II. Numerical Experiments

1999 ◽  
Vol 173 ◽  
pp. 309-314 ◽  
Author(s):  
T. Fukushima
Keyword(s):  
Multistep Methods ◽  
Computational Time ◽  
Integration Time ◽  
Implicit Methods ◽  
Symmetric Methods ◽  
Celestial Bodies ◽  
The Stability ◽  
Predictor Corrector ◽  
Symmetric Multistep Methods ◽  
Integration Errors

AbstractBy using the stability condition and general formulas developed by Fukushima (1998 = Paper I) we discovered that, just as in the case of the explicit symmetric multistep methods (Quinlan and Tremaine, 1990), when integrating orbital motions of celestial bodies, the implicit symmetric multistep methods used in the predictor-corrector manner lead to integration errors in position which grow linearly with the integration time if the stepsizes adopted are sufficiently small and if the number of corrections is sufficiently large, say two or three. We confirmed also that the symmetric methods (explicit or implicit) would produce the stepsize-dependent instabilities/resonances, which was discovered by A. Toomre in 1991 and confirmed by G.D. Quinlan for some high order explicit methods. Although the implicit methods require twice or more computational time for the same stepsize than the explicit symmetric ones do, they seem to be preferable since they reduce these undesirable features significantly.

Better logic for DNA computing

2019 ◽  
Author(s):  
Andrew Scott
Keyword(s):  
Dna Computing

A Comparative Study of Ant and Genetic Algorithms in Digital Mammography

2018 ◽  
pp. 194-200
Author(s):  
J. Magelin Mary ◽  
Chitra K. ◽  
Y. Arockia Suganthi
Keyword(s):  
Genetic Algorithm ◽  
Image Processing ◽  
Medical Image ◽  
Medical Image Processing ◽  
Processing Technique ◽  
Input Image ◽  
Image Processing Technique ◽  
Computational Time ◽  
Image Mining ◽  
The Individual

Image processing technique in general, involves the application of signal processing on the input image for isolating the individual color plane of an image. It plays an important role in the image analysis and computer version. This paper compares the efficiency of two approaches in the area of finding breast cancer in medical image processing. The fundamental target is to apply an image mining in the area of medical image handling utilizing grouping guideline created by genetic algorithm. The parameter using extracted border, the border pixels are considered as population strings to genetic algorithm and Ant Colony Optimization, to find out the optimum value from the border pixels. We likewise look at cost of ACO and GA also, endeavors to discover which one gives the better solution to identify an affected area in medical image based on computational time.

Combustion Driven by Fragment-based Ab Initio Molecular Dynamics Simulation

2019 ◽  
Author(s):  
Liqun Cao ◽  
Jinzhe Zeng ◽  
Mingyuan Xu ◽  
Chih-Hao Chin ◽  
Tong Zhu ◽  
...  
Keyword(s):  
Molecular Dynamics ◽  
Ab Initio ◽  
Large Scale ◽  
Methane Combustion ◽  
Combustion Method ◽  
Dynamics Simulation ◽  
Ab Initio Molecular Dynamics ◽  
Computational Time ◽  
Combustion Mechanism ◽  
Daily Lives

Combustion is a kind of important reaction that affects people's daily lives and the development of aerospace. Exploring the reaction mechanism contributes to the understanding of combustion and the more efficient use of fuels. Ab initio quantum mechanical (QM) calculation is precise but limited by its computational time for large-scale systems. In order to carry out reactive molecular dynamics (MD) simulation for combustion accurately and quickly, we develop the MFCC-combustion method in this study, which calculates the interaction between atoms using QM method at the level of MN15/6-31G(d). Each molecule in systems is treated as a fragment, and when the distance between any two atoms in different molecules is greater than 3.5 Å, a new fragment involved two molecules is produced in order to consider the two-body interaction. The deviations of MFCC-combustion from full system calculations are within a few kcal/mol, and the result clearly shows that the calculated energies of the different systems using MFCC-combustion are close to converging after the distance thresholds are larger than 3.5 Å for the two-body QM interactions. The methane combustion was studied with the MFCC-combustion method to explore the combustion mechanism of the methane-oxygen system.

On the trustability of semi-empirical methods to the calculation of gas phase formation enthalpies of inorganic compounds containing heavy metals: tin borates

2017 ◽  
Author(s):  
Robson de Farias
Keyword(s):  
Heavy Metals ◽  
Gas Phase ◽  
Phase Formation ◽  
Inorganic Compounds ◽  
Formation Enthalpy ◽  
Computational Time ◽  
Gas Formation ◽  
Formation Enthalpies ◽  
Knudsen Effusion Mass Spectrometry ◽  
Semi Empirical

<p>In the present work, are calculated the gas formation enthalpies (SE; PM3 and PM6) for tin borates: SnB<sub>2</sub>O<sub>4</sub><sup> </sup>and Sn<sub>2</sub>B<sub>2</sub>O<sub>5</sub>. The calculated values are compared with experimental ones, obtained by Knudsen effusion mass spectrometry [3]. It is shown that SE methods, besides their lower computational time consuming can, indeed, provide reliable gas phase formation enthalpy values for inorganic compounds containing heavy metals.</p>

Path Planning of Mobile Robot Using Improved Artificial Bee Colony Algorithm

2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi
Keyword(s):  
Mobile Robot ◽  
Comparative Research ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Dynamic Control ◽  
Computational Time ◽  
Bee Colony ◽  
Shortest Distance ◽  
Minimum Number ◽  
Cubic Polynomial

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.

Improving the Computational Cost for Copied Region Detection in Forensic Images

2016 ◽  
Vol 2 (1) ◽  
pp. 55
Author(s):  
Tu Huynh-Kha ◽  
Thuong Le-Tien ◽  
Synh Ha ◽  
Khoa Huynh-Van
Keyword(s):  
Wavelet Transform ◽  
Euclidean Distance ◽  
Research Work ◽  
Computational Cost ◽  
Correlation Coefficients ◽  
Zernike Moments ◽  
Computational Time ◽  
Discrete Wavelet ◽  
Feature Vectors ◽  
Region Detection

This research work develops a new method to detect the forgery in image by combining the Wavelet transform and modified Zernike Moments (MZMs) in which the features are defined from more pixels than in traditional Zernike Moments. The tested image is firstly converted to grayscale and applied one level Discrete Wavelet Transform (DWT) to reduce the size of image by a half in both sides. The approximation sub-band (LL), which is used for processing, is then divided into overlapping blocks and modified Zernike moments are calculated in each block as feature vectors. More pixels are considered, more sufficient features are extracted. Lexicographical sorting and correlation coefficients computation on feature vectors are next steps to find the similar blocks. The purpose of applying DWT to reduce the dimension of the image before using Zernike moments with updated coefficients is to improve the computational time and increase exactness in detection. Copied or duplicated parts will be detected as traces of copy-move forgery manipulation based on a threshold of correlation coefficients and confirmed exactly from the constraint of Euclidean distance. Comparisons results between proposed method and related ones prove the feasibility and efficiency of the proposed algorithm.

Normal form method in search for periodic solutions of ordinary differential equations. Case of the fourth order

2018 ◽  
pp. 24-34
Author(s):  
V. F. Edneral ◽  
O. D. Timofeevskaya
Keyword(s):  
Normal Form ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Periodic Solutions ◽  
Fourth Order ◽  
Numerical Solutions ◽  
Numerical Calculations ◽  
Computational Time ◽  
Resonant Normal Form ◽  
Normal Form Method

Introduction:The method of resonant normal form is based on reducing a system of nonlinear ordinary differential equations to a simpler form, easier to explore. Moreover, for a number of autonomous nonlinear problems, it is possible to obtain explicit formulas which approximate numerical calculations of families of their periodic solutions. Replacing numerical calculations with their precalculated formulas leads to significant savings in computational time. Similar calculations were made earlier, but their accuracy was insufficient, and their complexity was very high.Purpose:Application of the resonant normal form method and a software package developed for these purposes to fourth-order systems in order to increase the calculation speed.Results:It has been shown that with the help of a single algorithm it is possible to study equations of high orders (4th and higher). Comparing the tabulation of the obtained formulas with the numerical solutions of the corresponding equations shows good quantitative agreement. Moreover, the speed of calculation by prepared approximating formulas is orders of magnitude greater than the numerical calculation speed. The obtained approximations can also be successfully applied to unstable solutions. For example, in the Henon — Heyles system, periodic solutions are surrounded by chaotic solutions and, when numerically integrated, the algorithms are often unstable on them.Practical relevance:The developed approach can be used in the simulation of physical and biological systems.

Sign in / Sign up

Export Citation Format

Share Document