This paper deals with the numerical solution of the discrete classical optimal control problem (DCOCP) governing by linear hyperbolic boundary value problem (LHBVP). The method which is used here consists of: the GFEIM " the Galerkin finite element method in space variable with the implicit finite difference method in time variable" to find the solution of the discrete state equation (DSE) and the solution of its corresponding discrete adjoint equation, where a discrete classical control (DCC) is given.  The gradient projection method with either the Armijo method (GPARM) or with the optimal method (GPOSM) is used to solve the minimization problem which is obtained from the necessary conditi

        The secure data transmission over internet is achieved using Steganography. It is the art and science of concealing information in unremarkable cover media so as not to arouse an observer’s suspicion. In this paper the color cover image is divided into equally four parts, for each part select one channel from each part( Red, or Green, or  Blue), choosing one of these channel depending on the high color ratio in that part. The chosen part is decomposing into four parts {LL, HL, LH, HH} by using discrete wavelet transform. The hiding image is divided into four part n*n then apply DCT on each part. Finally the four DCT coefficient parts embedding in four high frequency sub-bands {HH} in

The denoising of a natural image corrupted by Gaussian noise is a problem in signal or image processing.  Much work has been done in the field of wavelet thresholding but most of it was focused on statistical modeling of wavelet coefficients and the optimal choice of thresholds.  This paper describes a new method for the suppression of noise in image by fusing the stationary wavelet denoising technique with adaptive wiener filter. The wiener filter is applied to the reconstructed image for the approximation coefficients only, while the thresholding technique is applied to the details coefficients of the transform, then get the final denoised image is obtained by combining the two results. The proposed method was applied by usin

CD-nanosponges were prepared by crosslinking B-CD with diphenylcarbonate (DPC) using ultrasound assisted technique. 5-FU was incorporated with NS by freeze drying, and the phase solubility study, complexation efficiency (CE) entrapment efficiency were performed. Also, the particle morphology was studied using SEM and AFM. The in-vitro release of 5-FU from the prepared nanosponges was carried out in 0.1N HCl.

5-FU nanosponges particle size was in the nano size. The optimum formula showed a particle size of (405.46±30) nm, with a polydispersity index (PDI) (0.328±0.002) and a negative zeta potential (-18.75±1.8). Also the drug entrapment efficiency varied with the CD: DPC molar ratio from 15.6 % to 30%. The SEM an

    The emergence of COVID-19 has resulted in an unprecedented escalation in different aspects of human activities, including medical education. Students and educators across academic institutions have confronted various challenges in following the guidelines of protection against the disease on one hand and accomplishing learning curricula on the other hand. In this short view, we presented our experience in implementing e-learning to the undergraduate nursing students during the present COVID-19 pandemic emphasizing the learning content, barriers, and feedback of students and educators. We hope that this view will trigger the preparedness of nursing faculties in Iraq to deal with this new modality of learning and improve it should t

A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.

   In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11),  n = 2,3,…,10,11  by geometric method, with the related blocking sets and projective codes.