In this research, the kinetic studies of four isoenzymes of Asprtate aminotransferase, which partially purified from the urine of chronic renal failure patients were carried out .The four isoenzymes were obeyed Michaelis-Menton's equation and the optimum concentration of their substrate (Aspartic acid) was (166.5x10-3) mole/liter,and their Km values were determined. Four isoenzymesI,II,III,IV have shown an optimum pH at 7.4.The four isoenzymes obeyed Arrhenius equation up to 37º C and their Ea and Q10 constants were determined .

Tn   t·  p.a,p r        We hae  reported it;vestigations O:U   the·  effeot of

simtHtaneous s·ubs'tituti9n   of  :Pb . a;t tbe,1'1-based .IJPercqndl,lctor was·

prepar.d by adcling; an .amoun· 0f Pb t. the TIJ-PbxBa;iCa2CuaOo'ti cor:npound. The: usu;d solid'7state  teactin  meJ;}Jo.d                                                        &nb

In this research we study a variance component model, Which is the one of the most important models widely used in the analysis of the data, this model is one type of a multilevel models, and it is considered as linear models , there are three types of linear variance component models ,Fixed effect of linear variance component model, Random effect of linear variance component model and Mixed effect of linear variance component model . In this paper we will examine the model of mixed effect of linear variance component model with one –way random effect ,and the mixed model is a mixture of fixed effect and random effect in the same model, where it contains the parameter (μ) and treatment effect (τ_i ) which  has

A mathematical method with a new algorithm with the aid of Matlab language is proposed to compute the linear equivalence (or the recursion length) of the pseudo-random key-stream periodic sequences using Fourier transform. The proposed method enables the computation of the linear equivalence to determine the degree of the complexity of any binary or real periodic sequences produced from linear or nonlinear key-stream generators. The procedure can be used with comparatively greater computational ease and efficiency. The results of this algorithm are compared with Berlekamp-Massey (BM) method and good results are obtained where the results of the Fourier transform are more accurate than those of (BM) method for computing the linear equivalenc

The parametric programming considered as type of sensitivity analysis. In this research concerning to study the effect of the variations on linear programming model (objective function coefficients and right hand side) on the optimal solution. To determine the parameter (θ) value (-5≤ θ ≤5).Whereas the result، the objective function equal  zero and the decision variables are non basic، when the parameter (θ = -5).The objective function value increases when the parameter (θ= 5) and the decision variables are basic، with the except of X_24, X₃₄.Whenever the parameter value increase, the objectiv

In this paper, the continuous classical boundary optimal control problem (CCBOCP) for triple linear partial differential equations of parabolic type (TLPDEPAR) with initial and boundary conditions (ICs & BCs) is studied. The Galerkin method (GM) is used to prove the existence and uniqueness theorem of the state vector solution (SVS) for given continuous classical boundary control vector (CCBCV). The proof of the existence theorem of a continuous classical boundary optimal control vector (CCBOCV) associated with the TLPDEPAR is proved. The derivation of the Fréchet derivative (FrD) for the cost function (CoF) is obtained. At the end, the theorem of the necessary conditions for optimality (NCsThOP) of this problem is stated and prov

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples