Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2022
Policy-based optimization: single-step policy gradient method seen as an evolution strategy
Neural Computing and Applications (NCAA), Volume 35, Issue 1Pages 449–467https://doi.org/10.1007/s00521-022-07779-0AbstractThis research reports on the recent development of black-box optimization methods based on single-step deep reinforcement learning and their conceptual similarity to evolution strategy (ES) techniques. It formally introduces policy-based ...
- research-articleMay 2022
On Chaos based duo confusion duo diffusion for colour images
- A. Sridevi,
- R. Sivaraman,
- Varun Balasubramaniam,
- Sreenithi,
- J. Siva,
- V. Thanikaiselvan,
- Amirtharajan Rengarajan
Multimedia Tools and Applications (MTAA), Volume 81, Issue 12Pages 16987–17014https://doi.org/10.1007/s11042-022-12471-5AbstractIn recent years, owing to the frequent flow of digital images worldwide over the transmission media, it has become essential to secure them from leakages. Moreover, many applications like military image databases, confidential video conferencing, ...
- articleJune 2018
A Verified ODE Solver and the Lorenz Attractor
Journal of Automated Reasoning (JAUR), Volume 61, Issue 1-4Pages 73–111https://doi.org/10.1007/s10817-017-9448-yA rigorous numerical algorithm, formally verified with Isabelle/HOL, is used to certify the computations that Tucker used to prove chaos for the Lorenz attractor. The verification is based on a formalization of a diverse variety of mathematics and ...
- research-articleSeptember 2015
A Novel Encryption Algorithm Using Chaotic Lorenz Attractor and Knights Tour
ICCCT '15: Proceedings of the Sixth International Conference on Computer and Communication Technology 2015Pages 323–327https://doi.org/10.1145/2818567.2818667A considerable amount of research has been carried out in harvesting the benefit of chaos theory in image encryption. However, there are not many schema that effectively maximize the advantages of Lorenz system. In this paper, we present one such image ...
- research-articleFebruary 2013
Forward and adjoint sensitivity computation of chaotic dynamical systems
This paper describes a forward algorithm and an adjoint algorithm for computing sensitivity derivatives in chaotic dynamical systems, such as the Lorenz attractor. The algorithms compute the derivative of long time averaged "statistical" quantities to ...
- articleJanuary 2002
A Rigorous ODE Solver and Smale's 14th Problem
Foundations of Computational Mathematics (FOCM), Volume 2, Issue 1Pages 53–117https://doi.org/10.1007/s002080010018We present an algorithm for computing rigorous solutions to a large class of ordinary differential equations. The main algorithm is based on a partitioning process and the use of interval arithmetic with directed rounding. As an application, we prove ...