Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Norton's Theorem

Norton's Theorem

Norton's theorem is a fundamental principle stating that a linear two-terminal circuit can be substituted with an equivalent circuit, which comprises a current source (ⅠN) in parallel with a resistor (RN). Here, ⅠN represents the short-circuit current flowing through the terminals, and RN stands for the input or equivalent resistance at the terminals when all independent sources are deactivated. This implies that the circuit illustrated in Figure (a) can be exchanged with the one...

Frost Circles for Different Conjugated Systems

Frost Circles for Different Conjugated Systems

The inscribed polygon method is consistent with Hückel’s 4n + 2 rule and helps to learn whether the given cyclic compound is aromatic or not. The compound is stable and aromatic if every bonding molecular orbital (MO) is completely filled with a pair of electrons. However, if the non-bonding or antibonding orbitals are filled with electrons, the compound is unstable and not aromatic. Consider the Frost circle diagrams for cycloalkenes containing 4 to 8 carbons.

Hückel's Rule Diagram of π MOs: Frost Circle

Hückel's Rule Diagram of π MOs: Frost Circle

The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...

Theorem of Pappus

Theorem of Pappus

The Theorem of Pappus, also known as the Pappus–Guldinus Theorem, provides a geometric method for determining the volume and surface area of solids generated by the revolution of a plane region or a plane curve about an external axis. The theorem consists of two related statements. The first addresses the volume of solids formed by rotating plane areas, while the second addresses the surface area generated by rotating plane curves. Both results depend on the location of the centroid,...

Theorems of Pappus and Guldinus: Problem Solving

Theorems of Pappus and Guldinus: Problem Solving

Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Extending birthday paradox theory to estimate the number of tags in RFID systems.

PloS one·2014

See all related articles

Search research articles

Related Experiment Video

Updated: Apr 23, 2026

A Simple Protocol for Mapping the Plant Root System Architecture Traits

A Simple Protocol for Mapping the Plant Root System Architecture Traits

Published on: February 10, 2023

A chaotic cryptosystem for images based on Henon and Arnold cat map.

Ali Soleymani¹, Md Jan Nordin², Elankovan Sundararajan¹

¹Software Technology and Management Center (Softam), Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, 43600 Bangi, Selangor, Malaysia.

Thescientificworldjournal

|September 27, 2014

Summary

This study introduces a novel image encryption scheme using Arnold cat and Henon chaotic maps for secure data transmission. The proposed cryptosystem offers robust security against various attacks and ensures real-time performance for high-resolution images.

More Related Videos

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Related Experiment Videos

Last Updated: Apr 23, 2026

A Simple Protocol for Mapping the Plant Root System Architecture Traits

A Simple Protocol for Mapping the Plant Root System Architecture Traits

Published on: February 10, 2023

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

Area of Science:

Computer Science
Information Security
Applied Mathematics

Background:

Images are a prevalent data type, necessitating secure transmission over public networks.
Existing cryptosystems may lack the speed and security required for high-resolution images.

Purpose of the Study:

To develop a novel, fast, and secure image encryption scheme.
To enhance the security of image data against various attacks.

Main Methods:

A hybrid encryption scheme combining Arnold cat map and Henon chaotic map.
Arnold cat map for bit- and pixel-level permutations.
Henon map for secret image generation and permutation parameter control.

Main Results:

The proposed cryptosystem demonstrates strong resistance to statistical, brute force, and differential attacks.
Security analysis confirms the effectiveness across five diverse image types.
Evaluated running times indicate suitability for real-time applications.

Conclusions:

The novel cryptosystem provides a secure and efficient solution for image encryption.
The integration of chaotic maps enhances the protection of sensitive image data.
The scheme is well-suited for real-time applications requiring high-resolution image security.