Thin films of CuPc of various thicknesses (150,300 and 450) nm have been deposited using pulsed laser deposition technique at room temperature. The study showed that the spectra of the optical absorption of the thin films of the CuPc  are two bands of absorption one in the visible region at about 635 nm, referred to as Q-band, and the second in ultra-violet region where B-band is located at 330 nm. CuPc thin films were found to have direct band gap with values around (1.81 and 3.14 (eV respectively. The vibrational studies were carried out using Fourier transform infrared spectroscopy (FT-IR). Finally, From open and closed aperture Z-scan data non-linear absorption coefficient and non-linear refractive index have been calculated res

Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be pure relative to submodule T of M (Simply T-pure) if for each ideal A of R, N?AM=AN+T?(N?AM). In this paper, the properties of the following concepts were studied: Pure essential submodules relative to submodule T of M (Simply T-pure essential),Pure closed submodules relative to submodule T of M (Simply T-pure closed) and relative pure complement submodule relative to submodule T of M (Simply T-pure complement) and T-purely extending. We prove that; Let M be a T-purely extending module and let N be a T-pure submodule of M. If M has the T-PIP, then N is T-purely extending.

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la

In this paper, the problem of resource allocation at Al-Raji Company for soft drinks and juices was studied. The company produces several types of tasks to produce juices and soft drinks, which need machines to accomplish these tasks, as it has 6 machines that want to allocate to 4 different tasks to accomplish these tasks. The machines assigned to each task are subject to failure, as these machines are repaired to participate again in the production process. From past records of the company, the probability of failure machines at each task was calculated depending on company data information. Also, the time required for each machine to complete each task was recorded. The aim of this paper is to determine the minimum expected ti

The using of recycled aggregates from construction and demolition waste (CDW) can preserve natural aggregate resources, reduce the demand for landfill, and contribute to a sustainable built environment. Concrete demolition waste has been proven to be an excellent source of aggregates for new concrete production. At a technical, economic, and environmental level, roller compacted concrete (RCC) applications benefit various civil construction projects. Roller Compacted Concrete (RCC) is a homogenous mixture that is best described as a zero-slump concrete placed with compacting equipment, uses in storage areas, dams, and most often as a basis for rigid pavements. The mix must be sufficiently dry to support

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la

In this paper by using δ-semi.open sets we introduced the concept of weakly δ-semi.normal and δ-semi.normal spaces . Many properties and results were investigated and studied. Also we present the notion of δ- semi.compact spaces and we were able to compare with it δ-semi.regular spaces

Let R be associative; ring; with an identity and let D be unitary left R- module; . In this work we present semiannihilator; supplement submodule as a generalization of R-a- supplement submodule, Let U and V be submodules of an R-module D if D=U+V and whenever Y≤ V and D=U+Y, then annY≪R;. We also introduce the the concept of semiannihilator -supplemented ;modules and semiannihilator weak; supplemented modules, and we give some basic properties of this conseptes

In this paper we introduce a new type of functions called the generalized regular
continuous functions .These functions are weaker than regular continuous functions and
stronger than regular generalized continuous functions. Also, we study some
characterizations and basic properties of generalized regular continuous functions .Moreover
we study another types of generalized regular continuous functions and study the relation
among them

In this paper, a method for data encryption was proposed using two secret keys, where the first one is a matrix of XOR's and NOT's gates (XN key), whereas the second key is a binary matrix (KEYB) key. XN and KEYB are (m*n) matrices where m is equal to n. Furthermore this paper proposed a strategy to generate secret keys (KEYBs) using the concept of the LFSR method (Linear Feedback Shift Registers) depending on a secret start point (third secret key s-key). The proposed method will be named as X.K.N. (X.K.N) is a type of symmetric encryption and it will deal with the data as a set of blocks in its preprocessing and then encrypt the binary data in a case of stream cipher.