zienah hassan razak al hadad

The communication technology improved recently in many important fields in daily life, this increases the demands for techniques which are more suitable to these situations. Recently the orthogonal transformation represents a good choice for security especially if it combined with a studied way for permutation, this can be provided by chaotic mapping which provides perfect mechanism for permutation. In this paper, we concentrate on the most popular chaotic maps and what are the mappings that used with DCT as an example in our research for orthogonal transformation and finally summarize the performance of this works to give a hint for the researchers to decide the suitable combination for their problems according to their requirement

Abstract— In the increasing needed for security of communication and transmitted media and the development of communication system which surely transmits the data via the unsecured channel, many approaches appear to attempt to maintain the secret information generally and speech information specially. From this approach that is the most recently the chaotic maps that provide the perfect way for the security of data, and is used widely in speech scrambling. The chaotic maps used successfully for encryption of large-scale media such as video, audio, and image data because of its perfect properties as pseudo-randomness, sensitivity to parameters of the system and initial conditions and periodicity. In our proposed system we use a new combination of chaotic maps that depend on Arnold and Lucas maps, Arnold-Lucas map performs the scrambling process in a good way and give good results. The proposed system evaluated using SNR, PSNR, and correlation measures and the results of our proposed system were better compared with Arnold cat map and Fibonacci map.

Abstract: Steganography is an important area of research in recent years involving a number of applications. It is the science of embedding information into the cover images viz. text, video, and images. Various Steganography methods have been applied in terms of robustness, Imperceptibility (stego-image), and capacity. However, most of hiding image in image focus on capacity and Imperceptibility (image quality) and most of them need cover image to be 8 times bigger than secret image, for that reason this project focus on apply new techniques to reduce the size of cover image requiring by insert 4 bits in each pixel instead of one with mention to image quality. The quality of cover image is considered high due to the inserting process by add the message or inverse of message. Moreover, selecting a suitable pixel within the same block case less change to the cover image and keep quality of cover image too.

Abstract: Steganography can be defined as a science and art of invisible communication for secret purpose, as well as steganography is the term applied to any number of processes that will hide a message within an object, where the hidden message will not be apparent to an observer. The paper describes the novel method for hiding information within an image depending on information discovered indirectly from the image. there are two important factors in any algorithm which must be decided before hiding step, that are the number of bits will be used in hiding step and the positions of pixels that will be altered to contains the hiding information. Hiding information is not free process and the capacity of hiding information is mostly limited and restricted by the size of cover images in addition, there is a tradeoff between both steganography capacity and stego image quality.

Abstract: A mathematical model was built and implemented to estimate the optimal number of nodes required to be deployed in each new designed MANETs environment. Many queuing theory parameters were used to study and analyze the behavior of the MANETs. Mobile Ad-hoc Network (MANET) was defined as a set of mobile nodes that moved freely and connected among each other without any infrastructure or administrator control. Each node contains a kind of queuing system like buffer used it to serve the arriving packets that reached to the busy node. The packets reach each node in certain sequence. The number of received (arriving packets) per unit time is called “arrival rate". The average rate or the average time between any two successive packets is called the inter- arrival time and follow certain statistical distributions. The node will serve the packets according to certain mechanism (discipline) like drop tail.

Abstract The traffic in urban roads regularized by traffic lights, that distribute fixed time for intersection sides, which may be crossing time of vehicles for some sides and long waiting time for others in the intersection. In this work we proposed Agent subsystem which is local responsible for controlling the time periods to be distributed over time to each intersection according to the vehicles queue length and give the priority for the side that have the longer queue length of vehicles. The perception for this agent are sensors that evaluate the queue length at each intersection side of the traffic light location, and the effecter will be the distributed time for the intersection sides.

The Department of Computer Science presents a workshop on electronic extortion, its causes and methods, and how to avoid falling into the trap of extortionists, and the Iraqi law’s treatment of extortion crimes and how to address them.

The Department of Computer Science is holding a workshop for students of the fourth stage in the Department of Computer Science on how to write graduation research and create a seminar for the purpose of discussion and the academic foundations used in writing research