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

               In this research, the semiparametric Bayesian method is compared with the classical  method to  estimate reliability function of three  systems :  k-out of-n system, series system, and parallel system. Each system consists of three components, the first one represents the composite parametric in which failure times distributed as exponential, whereas the second and the third components are nonparametric ones in which reliability estimations depend on Kernel method using two methods to estimate bandwidth parameter h method and Kaplan-Meier method. To indicate a better method for system reliability function estimation, it has be

The fuzzy sets theory has been applied in many fields, such as operations research, control theory and management sciences, etc. In particular, an application of this theory in decision making problem is linear programming problems with fuzzy technological coefficients numbers, as well as studying the parametric linear programming problems in the case of changes in the objective function. In this paper presenting a new procedure which connects and makes link between fuzzy linear programming problem with fuzzy technological coefficients numbers and parametric linear programming problem with change in coefficients of the objective function, then develop a numerical example illustrates the steps of solution to this kind of problems.

The basic solution to overcome difficult issues related to huge size of digital images is to recruited image compression techniques to reduce images size for efficient storage and fast transmission. In this paper, a new scheme of pixel base technique is proposed for grayscale image compression that implicitly utilize hybrid techniques of spatial modelling base technique of minimum residual along with transformed technique of Discrete Wavelet Transform (DWT) that also impels mixed between lossless and lossy techniques to ensure highly performance in terms of compression ratio and quality. The proposed technique has been applied on a set of standard test images and the results obtained are significantly encourage compared with Joint P

In this paper, the computational complexity will be reduced using a revised version of the selected mapping (SLM) algorithm. Where a partial SLM is achieved to reduce the mathematical operations around 50%. Although the peak to average power ratio (PAPR) reduction gain has been slightly degraded, the dramatic reduction in the computational complexity is an outshining achievement. Matlab simulation is used to evaluate the results, where the PAPR result shows the capability of the proposed method.  

     Estimating multivariate location and scatter with both affine equivariance and positive break down has always been difficult. Awell-known estimator which satisfies both properties is the Minimum volume Ellipsoid Estimator (MVE) Computing the exact (MVE) is often not feasible, so one usually resorts to an approximate Algorithm. In the regression setup, algorithm for positive-break down estimators like Least Median of squares typically recomputed the intercept at each step, to improve the result. This approach is called intercept adjustment. In this paper we show that a similar technique, called location adjustment, Can be applied to the (MVE). For this purpose we use the Minimum Volume Ball (MVB). In order

A numerical method (F.E.)was derived for incompressible viscoelastic materials, the aging and
environmental phenomena especially the temperature effect was considered in this method. A
treatment of incompressibility was made for all permissible values of poisons ratio. A
mechanical model represents the incompressible viscoelastic materials and so the properties can
be derived using the Laplace transformations technique .A comparison was made with the other
methods interested with viscoelastic materials by applying the method on a cylinder of viscoelastic material surrounding by a steel casing and subjected to a constant internal pressure, as well as a comparison with another viscoelastic method and for Asphalt Concrete pro

This paper aims to find new analytical closed-forms to the  solutions of the nonhomogeneous functional differential equations of the n^th order with finite and constants delays and various initial delay conditions in terms of elementary functions using Laplace transform method. As well as, the definition of dynamical systems for ordinary differential equations is used to introduce the definition of dynamical systems for delay differential equations which contain multiple delays with a discussion of their dynamical properties: The exponential stability and strong stability

   This paper applies the Modified Adomian Decomposition Method (MADM) for solving Integro-Differential Inequality, this method  is one of effective to construct analytic approximate solutions for linear and nonlinear integro-differential inequalities without solving many integrals and transformed or discretization. Several examples are presented, the analytic results show that this method is a promising and powerful for solving these problems.

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.