This study produces an image of theoretical and experimental case of high loading stumbling condition for hip prosthesis. Model had been studied namely Charnley. This model was modeled with finite element method by using ANSYS software, the effect of changing the design parameters (head diameter, neck length, neck ratio, stem length) on Charnley design, for stumbling case as impact load where the load reach to (8.7* body weight) for impact duration of 0.005sec.An experimental rig had been constructed to test the hip model, this rig consist of a wood box with a smooth sliding shaft where a load of 1 pound is dropped from three heights.
The strain produced by this impact is measured by using rosette strain gauge connected to Wheatstone

In the present paper, an eco-epidemiological model consisting of diseased prey consumed by a predator with fear cost, and hunting cooperation property is formulated and studied. It is assumed that the predator doesn’t distinguish between the healthy prey and sick prey and hence it consumed both. The solution’s properties such as existence, uniqueness, positivity, and bounded are discussed. The existence and stability conditions of all possible equilibrium points are studied. The persistence requirements of the proposed system are established. The bifurcation analysis near the non-hyperbolic equilibrium points is investigated. Numerically, some simulations are carried out to validate the main findings and obtain the critical values of th

Abstract\

In this research, estimated the reliability of water system network in Baghdad was done. to assess its performance during a specific period. a fault tree through static and dynamic gates was belt and these gates represent logical relationships between the main events in the network and analyzed using dynamic Bayesian networks . As it has been applied Dynamic Bayesian networks estimate reliability by translating dynamic fault tree to Dynamic Bayesian networks and reliability of the system appreciated. As was the potential for the expense of each phase of the network for each gate . Because there are two parts to the Dynamic Bayesian networks and two part of gate (AND), which includes the three basic units of the

In recent years, the evolution of the community structure in social networks has gained significant attention. Due to the rapid and continuous evolution of real-world networks over time. This makes the process of identifying communities and tracking their topology changes challenging. To tackle these challenges, it is necessary to find efficient methodologies for analyzing the behavior patterns of dynamic communities. Several previous reviews have introduced algorithms and models for community detection. However, these methods have not been very accurate in identifying communities. Moreover, none of the reviewed papers made an apparent effort to link algorithms that can accurately detect dynamic communities. This review aims to present a ta

Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

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