We dealt with the nature of the points under the influence of periodic function chaotic functions associated functions chaotic and sufficient conditions to be a very chaotic functions Palace
The art of preventing the detection of hidden information messages is the way that steganography work. Several algorithms have been proposed for steganographic techniques. A major portion of these algorithms is specified for image steganography because the image has a high level of redundancy. This paper proposed an image steganography technique using a dynamic threshold produced by the discrete cosine coefficient. After dividing the green and blue channel of the cover image into 1*3-pixel blocks, check if any bits of green channel block less or equal to threshold then start to store the secret bits in blue channel block, and to increase the security not all bits in the chosen block used to store the secret bits. Firstly, store in the cente
... Show MoreThis research deals with increasing the hardening and insulating the petroleum pipes against the conditions and erosion of different environments. So, basic material of epoxy has been mixed with Ceramic Nano Zirconia reinforcement material 35 nm with the percentages (0,1,2,3,4,5) %, whereas the paint basis of broken petroleum pipes was used to paint on it, then it was cut into dimensions (2 cm. × 2 cm.) and 0.3cm high. After the paint and percentages are completed, the samples were immersed into the paint. Then, the micro-hardness was checked according to Vickers method and thermal inspection of paint, which contained (Thermal conduction, thermal flux and Thermal diffusivity), the density of the painted samples was calculate
... Show MoreThat the essential contribution of this research is a description of how complex systems analysis service of the properties of the queue in Baghdad Teaching Hospital using a technique network is techniques method (Q - GERT) an acronym of the words:
Queuing theory _ Graphical Evaluation and Review Technique
Any method of assessment and review chart where you will be see the movement flow of patients within the system and after using this portal will be represented system in the form of planned network probabilistic analysis and knowledge of statistical distributions appropriate for times of arrival and departure were using the program ready (Win QSB) and simulatio
... Show MoreAttacking a transferred data over a network is frequently happened millions time a day. To address this problem, a secure scheme is proposed which is securing a transferred data over a network. The proposed scheme uses two techniques to guarantee a secure transferring for a message. The message is encrypted as a first step, and then it is hided in a video cover. The proposed encrypting technique is RC4 stream cipher algorithm in order to increase the message's confidentiality, as well as improving the least significant bit embedding algorithm (LSB) by adding an additional layer of security. The improvement of the LSB method comes by replacing the adopted sequential selection by a random selection manner of the frames and the pixels wit
... Show MoreThe 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
... Show MoreIn 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