Nisoldipine (NSD) is a dihydropyridine class of calcium channel blockers used for hypertension treatment, it belongs to class II BCS (low solubility with high permeability), its absolute bioavailability is only 5% due to presystemic metabolism in the gut wall. It is also a substrate for a CYP3A and P-gp. Bilosomes are lipid bilayer vesicles incorporating bile salts in their walls to prevent degredation by GIT bile salts. The aim of this study is to prepare nisoldipine bilosomes as vesicular carrier and assess the effect of different formulation variables such as type of surfactant, amount of cholesterol, surfactant and sonication time on particle size, entrapment efficiency and poly dispersity index of the prepared bilos

In this paper we present the theoretical foundation of forward error analysis of numerical algorithms under;• Approximations in "built-in" functions.• Rounding errors in arithmetic floating-point operations.• Perturbations of data.The error analysis is based on linearization method. The fundamental tools of the forward error analysis are system of linear absolute and relative a prior and a posteriori error equations and associated condition numbers constituting optimal of possible cumulative round – off errors. The condition numbers enable simple general, quantitative bounds definitions of numerical stability. The theoretical results have been applied a Gaussian elimination, and have proved to be very effective means of both a prior

        The current research aims to highlight the role of human resource management with its practices (human resource planning, selection and placement, training and development, performance evaluation, compensation, and incentives) in raising the level of individuals' performance and its dimensions (task performance, contextual performance, unproductive work behavior, and adaptive performance) by explaining the research problem, which can be limited to the low level of performance of individuals, where the researchers use the descriptive analytical approach and the SPSS program in the practical aspect of the research community represented by the general manager and his assistant

The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient b_i is random variable

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

In this paper, we designed a new efficient stream cipher cryptosystem that depend on a chaotic map to encrypt (decrypt) different types of digital images. The designed encryption system passed all basic efficiency criteria (like Randomness, MSE, PSNR, Histogram Analysis, and Key Space) that were applied to the key extracted from the random generator as well as to the digital images after completing the encryption process.

A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th