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

To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of

A lotic ecosystem is considered a source of carbon dioxide (CO2) in the atmosphere where it becomes supersaturated with CO2, which contributes to the global carbon cycle. To enhance our comprehension of the roles of CO2 in rivers, an outdoor experiment was designed with controlled carbon source inputs to investigate the roles of the dissolved organic carbon (DOC) and dissolved inorganic carbon (DIC) in the phytoplankton community. Plastic enclosures were installed in the Tigris River within Baghdad for that goal. Samples were collected on the first day, as well as on the 5th and the 12th days from 14 enclosures. The enclosures were treated by artificial glucose (C6H12O6) (10, 20, 30mg/ l) as DOC sources, while sodium bicarbonate (NaHCO3) (1

Audio-visual detection and recognition system is thought to become the most promising methods for many applications includes surveillance, speech recognition, eavesdropping devices, intelligence operations, etc. In the recent field of human recognition, the majority of the research be- coming performed presently is focused on the reidentification of various body images taken by several cameras or its focuses on recognized audio-only. However, in some cases these traditional methods can- not be useful when used alone such as in indoor surveillance systems, that are installed close to the ceiling and capture images right from above in a downwards direction and in some cases people don't look straight the cameras or it cannot be added in some

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).

This paper highlights the main features of conjunctive adverbials and their occurrence in English academic prose. It accounts for the semantic roles of conjunctive adverbials, forms in which they are used, their positions within a sentence, and their frequency of occurrence in different registers with special reference to academic prose. It also tries to investigate possible differences in men's and women's use of conjunctive adverbials.
Keyword: conjunctive adverbials, linking adverbials, stance adverbials, circumstance adverbials, academic prose

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c