Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .

A coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c

The extracting of personal sprite from the whole image faced many problems in separating the sprite edge from the unneeded parts, some image software try to automate this process, but usually they couldn't find the edge or have false result. In this paper, the authors have made an enhancement on the use of Canny edge detection to locate the sprite from the whole image by adding some enhancement steps by using MATLAB. Moreover, remove all the non-relevant information from the image by selecting only the sprite and place it in a transparent background. The results of comparing the Canny edge detection with the proposed method shows improvement in the edge detection.

Our country faced lots of crises specially Wars and still living under the traumatic events. This would result in psychological disorder specially the Acute Stress Disorder (ASD). That’s if not treated, it will turn to be over Post Traumatic Stress Disorder(PTSD). Also not mentioning the shortage of recourses speaks about war and crises. That treat with its inflections psychologically and sociologically theses cases if happened.

The importance of this study arise through it is objective to introduce a program for EMDR which give benefit for treat in health, social, educational institutes.

Aims:

The objective of this Study is the identification of a Test the effectiveness of Eye Movement Desensi

A QR code is a type of barcode that can hold more information than the familiar kind scanned at checkouts around the world. The “QR” stands for “Quick Response”, a reference to the speed at which the large amounts of information they contain can be decoded by scanners. They are being widely used for advertising campaigns, linking to company websites, contest sign-up pages and online menus. In this paper, we propose an efficient module to extract QR code from background and solve problem of rotation in case of inaccurate image taken from mobile camera.