Iron–phthalocyanine (FePc) organic photoconductive detector was fabricated using pulsed laser deposition (PLD) technique to work in ultraviolet (UV) and visible regions. The organic semiconductor material (iron phthalocyanine) was deposited on n-type silicon wafer (Si) substrates at different thicknesses (100, 200 and 300) nm. FePc organic photoconductive detector has been improved by two methods: the first is to manufacture the detector on PSi substrates, and the second is by coating the detector with polyamide–nylon polymer to enhance the photoconductivity of the FePc detector. The current–voltage (I–V) characteristics, responsivity, photocurrent gain, response time and the quantum efficiency of the fabricated photoconductive detector were measured. The performance of the fabricated detector was taken under dark and illumination using two types of light sources: UV LED with wavelength (365[Formula: see text]nm), power of (10[Formula: see text]W) and Tungsten lamp with wavelength range between (500–800) nm and the optical power of (250[Formula: see text]W). The photoresponse enhancement was improved by coating the FePc films with 200[Formula: see text]nm of polyamide nylon polymer. This type of coating, which can be considered as a surface treatment, highly increased the photoresponse of the fabricated FePc UV detector. The results show that the responsivity increased four orders of magnitudes more than the responsivity of the uncoated FePc film. The effects of the coated polymers on the responsivity and the response time of the detector were investigated.
In this paper Hermite interpolation method is used for solving linear and non-linear second order singular multi point boundary value problems with nonlocal condition. The approximate solution is found in the form of a rapidly convergent polynomial. We discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems. The examples to demonstrate the applicability and efficiency of the method have been given.
The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time. Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle to involve four types of binary code books (i.e. Pour when , Flat when , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding procedure, with very small distortion per block, by designing s
... Show Moreيعد هذا النص أحد النصوص المسمارية المصادرة التي بحوزة المتحف العراقي، ويحمل الرقم المتحفي (235869)، قياساته )12،7x 6x 2،5سم). يتضمن مدخولات كميات من الشعير،أرخ النص الى عصر أور الثالثة (2012-2004 ق.م) و يعود الى السنة الثالثة من حكم الملك أبي-سين (2028-2004 ق.م)،أن الشخصية الرئيسة في هذا النص هو)با-اَ-كا مسمن الماشية( من مدينة أري-ساكرك، ومقارنته مع النصوص المسمارية المنشورة التي تعود الى أرشيفه يبلغ عددها (196) نصاً تضمنت نشاطاته م
... Show MoreAbstract
The research aims to build a training program to develop some executive functions for kindergarten children. To achieve this goal, the two researchers built the program according to the following steps:
1. Determining the general objective of the program.
2. Determining the behavioral objectives of the program.
3. Determining the included content in the program.
4. Implementing the content of the activities of the program.
5. Evaluating the Program.
The program included (12) training activities, the training activities included several items: the title of the activity, the time of implementation of the activity, the general objective of the activity, the procedural behavioral objective, the means and tools u
In this paper, we proved that if R is a prime ring, U be a nonzero Lie ideal of R , d be a nonzero (?,?)-derivation of R. Then if Ua?Z(R) (or aU?Z(R)) for a?R, then either or U is commutative Also, we assumed that Uis a ring to prove that: (i) If Ua?Z(R) (or aU?Z(R)) for a?R, then either a=0 or U is commutative. (ii) If ad(U)=0 (or d(U)a=0) for a?R, then either a=0 or U is commutative. (iii) If d is a homomorphism on U such that ad(U) ?Z(R)(or d(U)a?Z(R), then a=0 or U is commutative.
This investigation was undertaken to evaluate the effectiveness of using Hydrated lime as a (partial substitute) by weight of filler (lime stone powder) with five consecutive percentage namely (1.0, 1.5, 2.0, 2.5, 3.0) % by means of aggregate treatment, by introducing dry lime on dry and 2–3% Saturated surface aggregate on both wearing and binder coarse. Marshall design method, indirect tensile test and permanent deformation under repeated loading of Pneumatic repeated load system at full range of temperature (20, 40, 60) C0 were examined The study revealed that the use of 2.0% and 1.5 % of dry and wet replacement extend the pavement characteristics by improving the Marshall properties and increasing the TSR%. Finally, increase permanent
... Show MoreThe researchers have a special interest in studying Markov chains as one of the probability samples which has many applications in different fields. This study comes to deal with the changes issue that happen on budget expenditures by using statistical methods, and Markov chains is the best expression about that as they are regarded reliable samples in the prediction process. A transitional matrix is built for three expenditure cases (increase ,decrease ,stability) for one of budget expenditure items (base salary) for three directorates (Baghdad ,Nineveh , Diyala) of one of the ministries. Results are analyzed by applying Maximum likelihood estimation and Ordinary least squares methods resulting
... Show MoreThe aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).