Steganography is a mean of hiding information within a more obvious form of
communication. It exploits the use of host data to hide a piece of information in such a way
that it is imperceptible to human observer. The major goals of effective Steganography are
High Embedding Capacity, Imperceptibility and Robustness. This paper introduces a scheme
for hiding secret images that could be as much as 25% of the host image data. The proposed
algorithm uses orthogonal discrete cosine transform for host image. A scaling factor (a) in
frequency domain controls the quality of the stego images. Experimented results of secret
image recovery after applying JPEG coding to the stego-images are included.

Internet of Things (IoT) is one of the newest matters in both industry and academia of the communication engineering world. On the other hand, wireless mesh networks, a network topology that has been debate for decades that haven’t been put into use in great scale, can make a transformation when it arises to the network in the IoT world nowadays. A Mesh IoT network is a local network architecture in which linked devices cooperate and route data using a specified protocol. Typically, IoT devices exchange sensor data by connecting to an IoT gateway. However, there are certain limitations if it involves to large number of sensors and the data that should be received is difficult to analyze. The aim of the work here is to implement a self-

    Much has been written about Baghdad in the history books and documents ,about the Origin  of its call , Reality ,history ,peoples ,Rulers and  all that have passed since  the beginning of creation and so far...

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph  make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs  of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs  derived from the group  and a few classes of zero-divisor graphs  of the commutative ring R are examined.

   What linguists mentioned about the infinitive and its use in the linguistic levels of speech, whether with its verb, or what was mentioned in the difference between the infinitive and the noun of the source, are matters that are related to the phenomenon of hearing in speech, a need necessitated by the nature of the linguistic law

With the growing use of electronic commerce has worked many companies, especially public shareholding to take advantage of them treated in the trade, so that the e-commerce part of the corporate environment, and this has made a career of accounting and auditing facing new challenges to the sophistication of the information and the rapid growth in the market for electronic commerce. And raised many questions about the ability of the audit profession to facing these challenges and how to audit operations of e-commerce and how to give confidence on websites, this sense it has become necessary keep the internal control systems of this technology and what has caused changes to the accounting system, and evolve to fit the developments that hav

We present the concept of maps Γ- periodi2 on Γ -near-ring S. Our main goal is to research and explore the presence and mapping traits such as h Γ –hom anti-Γ –hom, Γ –α-derivations of Γ -periodi2 on Γ- near-rings.

     Face detection is one of the important applications of biometric technology and image processing. Convolutional neural networks (CNN) have been successfully used with great results in the areas of image processing as well as pattern recognition. In the recent years, deep learning techniques specifically CNN techniques have achieved marvellous accuracy rates on face detection field. Therefore, this study provides a comprehensive analysis of face detection research and applications that use various CNN methods and algorithms. This paper presents ten of the most recent studies and illustrate the achieved performance of each method. 

There are many tools and S/W systems to generate finite state automata, FSA, due to its importance in modeling and simulation and its wide variety of applications. However, no appropriate tool that can generate finite state automata, FSA, for DNA motif template due to the huge size of the motif template. In addition to the optional paths in the motif structure which are represented by the gap. These reasons lead to the unavailability of the specifications of the automata to be generated. This absence of specifications makes the generating process very difficult. This paper presents a novel algorithm to construct FSAs for DNA motif templates. This research is the first research presents the problem of generating FSAs for DNA motif temp