The Elliptic Curve Cryptography (ECC) algorithm meets the requirements for multimedia encryption since the encipher operation of the ECC algorithm is applied at points only and that offer significant computational advantages. The encoding/decoding operations for converting the text message into points on the curve and vice versa are not always considered a simple process. In this paper, a new mapping method has been investigated for converting the text message into a point on the curve or point to a text message in an efficient and secure manner; it depends on the repeated values in coordinate to establish a lookup table for encoding/ decoding operations. The proposed method for mapping process is&

This study aimed to study the inhibition activity of purified bacteriocin produced from the local isolation Lactococcuslactis ssp. lactis against pathogenic bacteria species isolated from clinical samples in some hospitals Baghdad city. Screening of L. lactis ssp. Lactis and isolated from the intestines fish and raw milk was performed in well diffusion method. The results showed that L. lactis ssp. lactis (Lc4) was the most efficient isolate in producing the bacteriocin as well observed inhibitory activity the increased that companied with the concentration, the concentration of the twice filtrate was better in obtaining higher inhibition diameters compared to the one-fold concentration. The concentrate

Steganography is the art of concealing security data in media, such as pictures, audio, video, text, and protocols. The objective of this paper is hiding a secret message in a colour image to prevent an attacker from accessing the message. This is important because more people use the Internet all the time and network connections are spread around the world. The hidden secret message uses two general algorithms that are embedded and extracted. This paper proposes a new algorithm to conceal a secret message in a colour image in LSB. This algorithm includes three phases: 1) dividing the colour image into a number of blocks, 2) concealing the secret message, and 3) transmitting the stego-image from the sender in a multiplexer network and re

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

Using the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through that region. The result

Using the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through tha

Load balancing in computer networks is one of the most subjects that has got researcher's attention in the last decade. Load balancing will lead to reduce processing time and memory usage that are the most two concerns of the network companies in now days, and they are the most two factors that determine if the approach is worthy applicable or not. There are two kinds of load balancing, distributing jobs among other servers before processing starts and stays at that server to the end of the process is called static load balancing, and moving jobs during processing is called dynamic load balancing. In this research, two algorithms are designed and implemented, the History Usage (HU) algorithm that statically balances the load of a Loaded

Interface evaluation has been the subject of extensive study and research in human-computer interaction (HCI). It is a crucial tool for promoting the idea that user engagement with computers should resemble casual conversations and interactions between individuals, according to specialists in the field. Researchers in the HCI field initially focused on making various computer interfaces more usable, thus improving the user experience. This study's objectives were to evaluate and enhance the user interface of the University of Baghdad's implementation of an online academic management system using the effectiveness, time-based efficiency, and satisfaction rates that comply with the task questionnaire process. We made a variety of interfaces f

The aim of this paper is adopted to give an approximate solution for advection dispersion equation of time fractional order derivative by using the Chebyshev wavelets-Galerkin Method . The Chebyshev wavelet and Galerkin method properties are presented. This technique is used to convert the problem into the solution of linear algebraic equations. The fractional derivatives are described based on the Caputo sense. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique.