Background: Optimal root canal retreatment was required safe and efficient removal of filling material from root canal. The aim of this in vitro study was to compare the efficacy of reciprocating and continuous motion of four retreatment systems in removal of root canal filling material. Materials and Methods: Forty distal roots of the mandibular first molars teeth were used in this study, these roots were embedded in cold clear acrylic,roots were instrumented using crown down technique and rotary ProTaper systemize Sx to size F2 ,instrumentation were done with copiousirrigation of 2.5% sodium hypochlorite and 17% buffered solution of EDTA was used as final irrigant followed by distilledwater, roots were obturated with AH26 sealer and Prota

The research included five sections containing the first section on the introduction of the research and its importance and was addressed to the importance of the game of gymnastic and skilled parallel effectiveness and the importance of learning, but the problem of research that there is a difference in learning this skill and difficulty in learning may be one of the most important reasons are fear and fear of falling and injury, And a lack of sense of the movement of the movement is one of the obstacles in the completion of the skill and the goal of research to design a device that helps in learning the skill of descending Almtor facing with half a cycle according to the typical locomotor track on the parallel device of the technical men'

The Hartley transform generalizes to the fractional Hartley transform (FRHT) which gives various uses in different fields of image encryption. Unfortunately, the available literature of fractional Hartley transform is unable to provide its inversion theorem. So accordingly original function cannot retrieve directly, which restrict its applications. The intension of this paper is to propose inversion theorem of fractional Hartley transform to overcome this drawback. Moreover, some properties of fractional Hartley transform are discussed in this paper.

Steganography is the art of secret communication. Its purpose is to hide the presence of information, using, for example, images as covers. The frequency domain is well suited for embedding in image, since hiding in this frequency domain coefficients is robust to many attacks. This paper proposed hiding a secret image of size equal to quarter of the cover one. Set Partitioning in Hierarchal Trees (SPIHT) codec is used to code the secret image to achieve security. The proposed method applies Discrete Multiwavelet Transform (DMWT) for cover image. The coded bit stream of the secret image is embedded in the high frequency subbands of the transformed cover one. A scaling factors ? and ? in frequency domain control the quality of the stego

Steganography is a mean of hiding information within a more obvious form of
communication. It exploits the use of host data to hide a piece of information in such a way
that it is imperceptible to human observer. The major goals of effective Steganography are
High Embedding Capacity, Imperceptibility and Robustness. This paper introduces a scheme
for hiding secret images that could be as much as 25% of the host image data. The proposed
algorithm uses orthogonal discrete cosine transform for host image. A scaling factor (a) in
frequency domain controls the quality of the stego images. Experimented results of secret
image recovery after applying JPEG coding to the stego-images are included.

Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image

Digital image is widely used in computer applications. This paper introduces a proposed method of image zooming based upon inverse slantlet transform and image scaling. Slantlet transform (SLT) is based on the principle of designing different filters for different scales.

      First we apply SLT on color image, the idea of transform color image into slant, where large coefficients are mainly the   signal and smaller one represent the noise. By suitably modifying these coefficients , using scaling up image by  box and Bartlett filters so that the image scales up to 2X2 and then inverse slantlet transform from modifying coefficients using to the reconstructed image .

  &nbs

In this paper, an algorithm for reconstruction of a completely lost blocks using Modified
Hybrid Transform. The algorithms examined in this paper do not require a DC estimation
method or interpolation. The reconstruction achieved using matrix manipulation based on
Modified Hybrid transform. Also adopted in this paper smart matrix (Detection Matrix) to detect
the missing blocks for the purpose of rebuilding it. We further asses the performance of the
Modified Hybrid Transform in lost block reconstruction application. Also this paper discusses
the effect of using multiwavelet and 3D Radon in lost block reconstruction.

The research aims to shed light on the role of artificial intelligence in achieving Ambidexterity performance, as banks work to take advantage of modern technologies, artificial intelligence is an innovation that is expected to have a long-term impact, as well as banks can improve the quality of their services and analyze data to ensure that customers' future needs are understood. . The Bank of Baghdad and the Middle East Bank were chosen as a community for the study because they had a role in the economic development of the country as well as their active role in the banking market. A sample of department managers was highlighted in collecting data and extracting results based on the checklist, which is the main tool for the stu

Image compression is one of the data compression types applied to digital images in order to reduce their high cost for storage and/or transmission. Image compression algorithms may take the benefit of visual sensitivity and statistical properties of image data to deliver superior results in comparison with generic data compression schemes, which are used for other digital data. In the first approach, the input image is divided into blocks, each of which is 16 x 16, 32 x 32, or 64 x 64 pixels. The blocks are converted first into a string; then, encoded by using a lossless and dictionary-based algorithm known as arithmetic coding. The more occurrence of the pixels values is codded in few bits compare with pixel values of less occurre