Steganography is defined as hiding confidential information in some other chosen media without leaving any clear evidence of changing the media's features. Most traditional hiding methods hide the message directly in the covered media like (text, image, audio, and video). Some hiding techniques leave a negative effect on the cover image, so sometimes the change in the carrier medium can be detected by human and machine. The purpose of suggesting hiding information is to make this change undetectable. The current research focuses on using complex method to prevent the detection of hiding information by human and machine based on spiral search method, the Structural Similarity Index Metrics measures are used to get the accuracy and quality

Natural dye sensitized solar cell was prepared using strawberry and pomegranate dyes with anatase nanocrystalline titanium dioxide powder. A study of the optical properties of the two dyes, involving the absorption spectrum was determined in the visible region. I-V characteristics under illumination were performed. The results showed that the two prepared dye sensitized solar cells have acceptable values efficiency about (0.94 with Fill factor (45)) and (0.74 with Fill factor (44)) for strawberry and pomegranate dyes, respectively.

In this paper, the memorization capability of a multilayer interpolative neural network is exploited to estimate a mobile position based on three angles of arrival. The neural network is trained with ideal angles-position patterns distributed uniformly throughout the region. This approach is compared with two other analytical methods, the average-position method which relies on finding the average position of the vertices of the uncertainty triangular region and the optimal position method which relies on finding the nearest ideal angles-position pattern to the measured angles. Simulation results based on estimations of the mobile position of particles moving along a nonlinear path show that the interpolative neural network approach outperf

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a

0

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.