The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica^®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4^th order Runge-Kutta meth

The aim of this paper is to estimate a nonlinear regression function of the Export of the crude oil Saudi (in Million Barrels) as a function of the number of discovered fields.

 Through studying the behavior of the data we show that its behavior was not followed a linear pattern or can put it in a known form so far there was no possibility to see a general trend resulting from such exports.

We use different nonlinear estimators to estimate a regression function, Local linear estimator, Semi-parametric as well as an artificial neural network estimator (ANN).

The results proved that the (ANN) estimator is the best nonlinear estimator am

في هذا البحث نحاول تسليط الضوء على إحدى طرائق تقدير المعلمات الهيكلية لنماذج المعادلات الآنية الخطية والتي تزودنا بتقديرات متسقة تختلف أحيانا عن تلك التي نحصل عليها من أساليب الطرائق التقليدية الأخرى وفق الصيغة العامة لمقدرات K-CLASS. وهذه الطريقة تعرف بطريقة الإمكان الأعظم محدودة المعلومات "LIML" أو طريقة نسبة التباين الصغرى"LVR

The major target of this paper is to study a confirmed class of meromorphic univalent functions . We procure several results, such as those related to coefficient estimates, distortion and growth theorem, radii of starlikeness, and convexity for this class, n additionto hadamard product, convex combination, closure theorem, integral operators, and  neighborhoods.

  There are many researches deals with constructing an efficient solutions for real problem having Multi - objective confronted with each others. In this paper we construct a decision for Multi – objectives based on building a mathematical model formulating a unique objective function by combining the confronted objectives functions. Also we are presented some theories concerning this problem. Areal application problem has been presented to show the efficiency of the performance of our model and the method. Finally we obtained some results by randomly generating some problems.

This paper concentrates on employing the -difference equations approach to prove another generating function, extended generating function, Rogers formula and Mehler’s formula for the polynomials , as well as thegenerating functions of Srivastava-Agarwal type. Furthermore, we establish links between the homogeneous -difference equations and transformation formulas.

This paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove