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.

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 discusses the formal transformation in urban structure, all the cities around the world have undergone a series of formal transformations, resulting in radical transformations to their functions. And to calculate this transformation the descriptive analytical method was applied to this research. First, local urban management data and Landsat-9 visual data were used after processing by GIS. Then, the data were processed mathematically based on their engineering sequences. The aims of this research were as follows: to explore the formal transformations in cities, their dimensions and their consequences and impacts; to identify the underlying causes of their occurrence by deriving realistic results from trends in such degrees of t

Tin oxide was deposited by using vacuum thermal method on silicon wafer engraved by Computer Numerical Controlled (CNC) Machine. The inscription was engraved by diamond-made brine. Deep 0.05 mm in the form of concentric squares. Electrical results in the dark were shown high value of forward current and the high value of the detection factor from 6.42 before engraving to 10.41 after engraving. (I-V) characters in illumination with powers (50, 100, 150, 200, 250) mW/cm2 show Improved properties of the detector, Especially at power (150, 200, 250) mW/cm2. Response improved in rise time from 2.4 μs to 0.72 μs and time of inactivity improved 515.2 μs to 44.2 μs. Sensitivity angle increased at zone from 40o to 65o.

The aim of this research is to determine the uranium concentration in soil and water samples taken from different locations from the middle and south of Iraq using fission fragments track registration. Twelve samples of soil and water were taken from middle and South of Iraq. The nuclear reaction used as a source of nuclear fission fragments is U-235 (n.f) obtained by bombardment U-235with thermal neutrons from (Am-Be) neutron source with flux (5X103 n.cm-2.s-1). The concentration values were calculated by a comparison with standard samples recommended by IAEA.The results of the measurements show that the uranium concentration in soil samples were in Thekar (16.38 ppm), AL-Basra (16.1ppm) and (0.78 ppm) in Baghdad, from the results

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.