Multi-Objective Optimization of a Fractional-Order Lorenz System DOI Creative Commons
Luis Gerardo de la Fraga

Fractal and Fractional, Journal Year: 2025, Volume and Issue: 9(3), P. 171 - 171

Published: March 12, 2025

A fractional-order Lorenz system is optimized to maximize its maximum Lyapunov exponent and Kaplan-York dimension using the Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm. The integrated with a recent process called “modified two-stage Runge-Kutta” (M2sFRK) method, which very fast efficient. Pseudo-Random Number Generator (PRNG) was built one of systems that obtained. M2sFRK method allows for obtaining optimization time also designing efficient PRNG linear complexity, O(n). designed generates 24 random bits at each iteration step, sequences pass all National Institute Standards Technology (NIST) TestU01 statistical tests, making suitable cryptographic applications. presented methodology could be extended any other chaotic system.

Language: Английский

A Wide-Range Adjustable Conservative Memristive Hyperchaotic System with Transient Quasi-Periodic Characteristics and Encryption Application DOI Creative Commons
Fei Yu, Boon Thong Tan, Ting He

et al.

Mathematics, Journal Year: 2025, Volume and Issue: 13(5), P. 726 - 726

Published: Feb. 24, 2025

In comparison with dissipative chaos, conservative chaos is better equipped to handle the risks associated reconstruction of phase space due absence attractors. This paper proposes a novel five-dimensional (5D) memristive hyperchaotic system (CMHS), by incorporating memristors into four-dimensional (4D) chaotic (CCS). We conducted comprehensive analysis, using Lyapunov exponent diagrams, bifurcation portraits, equilibrium points, and spectral entropy maps thoroughly verify system’s properties. The exhibited characteristics such as hyperchaos multi-stability over an ultra-wide range parameters initial values, accompanied transient quasi-periodic phenomena. Subsequently, pseudorandom sequences generated new were tested demonstrated excellent performance, passing all tests set National Institute Standards Technology (NIST). final stage research, image-encryption application based on 5D CMHS was proposed. Through security feasibility algorithm confirmed.

Language: Английский

Citations

0

Optimization of Direct Convolution Algorithms on ARM Processors for Deep Learning Inference DOI Creative Commons
Shang Li, Fei Yu,

Shankou Zhang

et al.

Mathematics, Journal Year: 2025, Volume and Issue: 13(5), P. 787 - 787

Published: Feb. 27, 2025

In deep learning, convolutional layers typically bear the majority of computational workload and are often primary contributors to performance bottlenecks. The widely used convolution algorithm is based on IM2COL transform take advantage highly optimized GEMM (General Matrix Multiplication) kernel acceleration, using BLAS (Basic Linear Algebra Subroutine) library, which tends incur additional memory overhead. Recent studies have indicated that direct approaches can outperform traditional implementations without this paper, we propose a high-performance implementation for inference preserves channel-first data layout layer inputs/outputs. We evaluate our proposed multi-core ARM CPU platform compare it with state-of-the-art optimization techniques. Experimental results demonstrate new performs better across evaluated scenarios platforms.

Language: Английский

Citations

0

Multi-Objective Optimization of a Fractional-Order Lorenz System DOI Creative Commons
Luis Gerardo de la Fraga

Fractal and Fractional, Journal Year: 2025, Volume and Issue: 9(3), P. 171 - 171

Published: March 12, 2025

A fractional-order Lorenz system is optimized to maximize its maximum Lyapunov exponent and Kaplan-York dimension using the Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm. The integrated with a recent process called “modified two-stage Runge-Kutta” (M2sFRK) method, which very fast efficient. Pseudo-Random Number Generator (PRNG) was built one of systems that obtained. M2sFRK method allows for obtaining optimization time also designing efficient PRNG linear complexity, O(n). designed generates 24 random bits at each iteration step, sequences pass all National Institute Standards Technology (NIST) TestU01 statistical tests, making suitable cryptographic applications. presented methodology could be extended any other chaotic system.

Language: Английский

Citations

0