conventional FCM algorithm does not fully utilize the spatial information in the image. In this research, we use a FCM algorithm that incorporates spatial information into the membership function for clustering. The spatial function is the summation of the membership functions in the neighborhood of each pixel under consideration. The advantages of the method are that it is less
sensitive to noise than other techniques, and it yields regions more homogeneous than those of other methods. This technique is a powerful method for noisy image segmentation. 

Root-finding is an oldest classical problem, which is still an important research topic, due to its impact on computational algebra and geometry. In communications systems, when the impulse response of the channel is minimum phase the state of equalization algorithm is reduced and the spectral efficiency will improved. To make the channel impulse response minimum phase the prefilter which is called minimum phase filter is used, the adaptation of the minimum phase filter need root finding algorithm. In this paper, the VHDL implementation of the root finding algorithm introduced by Clark and Hau is introduced.
VHDL program is used in the work, to find the roots of two channels and make them minimum phase, the obtained output results are

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th

LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2

t:

The most famous thing a person does is talk. He loves and hates, and continues with it confirming relationships, and with it, too, comes out of disbelief into faith. Marry a word and separate with a word. He reaches the top of the heavens with a kind word, with which he will gain the pleasure of God, and the Lord of a word that the servant speaks to which God writes with our pleasure or throws him on his face in the fire. Emotions are inflamed, the United Nations is intensified with a word, and relations between states and war continue with a word.

What comes out of a person’s mouth is a translator that expresses the repository of his conscience and reveals the place of his bed, for it is evidence of

Abstract. This work presents a detailed design of a three-jointed tendon-driven robot finger with a cam/pulleys transmission and joint Variable Stiffness Actuator (VSA). The finger motion configuration is obtained by deriving the cam/pulleys transmission profile as a mathematical solution that is then implemented to achieve contact force isotropy on the phalanges. A VSA is proposed, in which three VSAs are designed to act as a muscle in joint space to provide firm grasping. As a mechatronic approach, a suitable type and number of force sensors and actuators are designed to sense the touch, actuate the finger, and tune the VSAs. The torque of the VSAs is controlled utilizing a designed Multi Input Multi Output (MIMO) fuzzy controll

Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destina