The hero traditionally has such admirable traits as courage, fortitude,
chivalry and patriotism. In the literary works, the hero is the leading
character and the pivot around which all the characters and the events
revolve. The characteristics of the hero usually reflect the cultural values
of his time. Because, in each age, Man's attitudes towards himself and the
world change, different images of the hero emerge.
In Greek Mythology, the hero is frequently favoured by the gods;
therefore, he is himself semi-divine. The Greek hero is of princely birth
and is endowed with good physique, exceptional strength, skill in
athletics and battle, energy and eloquence, like Odysseus who is the hero
of the Odyssey, long epic poem traditionally ascribed to the Greek poet
Homer. Odysseus is the king of Ithaca and he is a valorous, mighty leader
who took part in the siege of Troy. On his way back to Ithaca, after the
end of the war, he passed through many dangerous adventures in which
he encountered ruthless monsters such as Cyclopes, a giant with one eye,
and Scylla, an equally dreadful monster with six head. 1
Abstract: Chalcones were used to synthesis series of 2-pyrazoline derivatives and evaluated their antimicrobial and anti-inflammatory activities (E)-1,3-diphenylprop-2-en-1-one (1-5) were synthesized by Claisen-Schmidt Condensation method through the reaction of acetophenone with five various para substituted benzaldehyde in presence of KOH, the reaction monitoring by TLC and the result intermediates were checked by melting point and FT-IR Various 2-Pyrazoline derivatives were prepared by one pot reaction that involved the refluxing of (E)-1,3-diphenylprop-2-en-1-one (1–5) and Hydrazine monohydrate in the presence of glacial acetic acid for 24 hours at a temperature of (45–50) °C fo
... Show More
(2)
(1)
(7)
(7)
This paper introduces an innovative method for image encryption called "Two-Fold Cryptography," which leverages the Henon map in a dual-layer encryption framework. By applying two distinct encryption processes, this approach offers enhanced security for images. Key parameters generated by the Henon map dynamically shape both stages of encryption, creating a sophisticated and robust security system. The findings reveal that Two-Fold Cryptography provides a notable improvement in image protection, outperforming traditional single-layer encryption techniques.
In this work, satellite images for Razaza Lake and the surrounding area
district in Karbala province are classified for years 1990,1999 and
2014 using two software programming (MATLAB 7.12 and ERDAS
imagine 2014). Proposed unsupervised and supervised method of
classification using MATLAB software have been used; these are
mean value and Singular Value Decomposition respectively. While
unsupervised (K-Means) and supervised (Maximum likelihood
Classifier) method are utilized using ERDAS imagine, in order to get
most accurate results and then compare these results of each method
and calculate the changes that taken place in years 1999 and 2014;
comparing with 1990. The results from classification indicated that
In this paper, a method is proposed to increase the compression ratio for the color images by
dividing the image into non-overlapping blocks and applying different compression ratio for these
blocks depending on the importance information of the block. In the region that contain important
information the compression ratio is reduced to prevent loss of the information, while in the
smoothness region which has not important information, high compression ratio is used .The
proposed method shows better results when compared with classical methods(wavelet and DCT).
In this study, dynamic encryption techniques are explored as an image cipher method to generate S-boxes similar to AES S-boxes with the help of a private key belonging to the user and enable images to be encrypted or decrypted using S-boxes. This study consists of two stages: the dynamic generation of the S-box method and the encryption-decryption method. S-boxes should have a non-linear structure, and for this reason, K/DSA (Knutt Durstenfeld Shuffle Algorithm), which is one of the pseudo-random techniques, is used to generate S-boxes dynamically. The biggest advantage of this approach is the production of the inverted S-box with the S-box. Compared to the methods in the literature, the need to store the S-box is eliminated. Also, the fabr
... Show MoreIn this paper, we designed a new efficient stream cipher cryptosystem that depend on a chaotic map to encrypt (decrypt) different types of digital images. The designed encryption system passed all basic efficiency criteria (like Randomness, MSE, PSNR, Histogram Analysis, and Key Space) that were applied to the key extracted from the random generator as well as to the digital images after completing the encryption process.
Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima
... Show More
(1)
Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.
In this paper, an algorithm through which we can embed more data than the
regular methods under spatial domain is introduced. We compressed the secret data
using Huffman coding and then this compressed data is embedded using laplacian
sharpening method.
We used Laplace filters to determine the effective hiding places, then based on
threshold value we found the places with the highest values acquired from these filters
for embedding the watermark. In this work our aim is increasing the capacity of
information which is to be embedded by using Huffman code and at the same time
increasing the security of the algorithm by hiding data in the places that have highest
values of edges and less noticeable.
The perform