A general velocity profile for a laminar flow over a flat plate with zero incidence is obtained by employing a new boundary condition to the other available boundary conditions. The general velocity profile is mathematically simple and nearest to the exact solution. Also other related values, boundary layer thickness, displacement thickness, momentum thickness and coefficient of friction are nearest to the exact solution compared with other corresponding values for other researchers.

Variable selection in Poisson regression with high dimensional data has been widely used in recent years. we proposed in this paper using a penalty function that depends on a function named a penalty. An Atan estimator was compared with Lasso and adaptive lasso. A simulation and application show that an Atan estimator has the advantage in the estimation of coefficient and variables selection.

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

Pinter's play One for the Road (1984) is considered one of his important plays because
it focuses on political issues, which he has not presented overtly before. Generally speaking,
Pinter's early plays describe man's existential fear of an unnamed danger which might be
represented by an intruder who invades the characters' solitude , threatens their peace, and
brings their hidden fears to the surface. Pinter began to write political plays as a result of his
political attitudes and his involvement in political activities over the last three decades.
Pinter's One for the Road deals with the oppressive and authoritarian operations of
state power. This play and Pinter's political plays which followed it, like Mountain

The linear segment with parabolic blend (LSPB) trajectory deviates from the specified waypoints. It is restricted to that the acceleration must be sufficiently high. In this work, it is proposed to engage modified LSPB trajectory with particle swarm optimization (PSO) so as to create through points on the trajectory. The assumption of normal LSPB method that parabolic part is centered in time around waypoints is replaced by proposed coefficients for calculating the time duration of the linear part. These coefficients are functions of velocities between through points. The velocities are obtained by PSO so as to force the LSPB trajectory passing exactly through the specified path points. Also, relations for velocity correction and exact v

Within the framework of big data, energy issues are highly significant. Despite the significance of energy, theoretical studies focusing primarily on the issue of energy within big data analytics in relation to computational intelligent algorithms are scarce. The purpose of this study is to explore the theoretical aspects of energy issues in big data analytics in relation to computational intelligent algorithms since this is critical in exploring the emperica aspects of big data. In this chapter, we present a theoretical study of energy issues related to applications of computational intelligent algorithms in big data analytics. This work highlights that big data analytics using computational intelligent algorithms generates a very high amo

In this paper, the process for finding an approximate solution of nonlinear three-dimensional (3D) Volterra type integral operator equation (N3D-VIOE) in R³ is introduced. The modelling of the majorant function (MF) with the modified Newton method (MNM) is employed to convert N3D-VIOE to the linear 3D Volterra type integral operator equation (L3D-VIOE). The method of trapezoidal rule (TR) and collocation points are utilized to determine the approximate solution of L3D-VIOE by dealing with the linear form of the algebraic system. The existence of the approximate solution and its uniqueness are proved, and illustrative examples are provided to show the accuracy and efficiency of the model.

Mathematical Subject Classificat

This study was design to investigate the dimensional stability of heat-activated acrylic resin with different methods of flask cooling (15 minutes rapid cooling, one hour bench cooling, four hours delayed deflasking, and 24 hours delayed deflasking) at different time intervals (immediately, two days, seven days, 30 days) after deflasking. Heat-activated acrylic resin was used to prepare acrylic samples. Then, measurement of the distances where achieved between the centers of selected marks in the acrylic samples. They were measured at different time intervals for different methods of flask cooling. The results showed that the group samples of the four hours and 24 hours of delayed deflasking was insignificantly different from the control an

In this paper, we will illustrate a gamma regression model assuming that the dependent variable (Y) is a gamma distribution and that it's mean ( ) is related through a linear predictor with link function which is identity link function g(μ) = μ. It also contains the shape parameter which is not constant and depends on the linear predictor and with link function which is the log link and we will estimate the parameters of gamma regression by using two estimation methods which are The Maximum Likelihood and the Bayesian and a comparison between these methods by using the standard comparison of average squares of error (MSE), where the two methods were applied to real da

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app