In this paper, the classical continuous triple optimal control problem (CCTOCP) for the triple nonlinear parabolic boundary value problem (TNLPBVP) with state vector constraints (SVCs) is studied.  The solvability theorem for the classical continuous triple optimal control vector CCTOCV with the SVCs is stated and proved. This is done under suitable conditions. The mathematical formulation of the adjoint triple boundary value problem (ATHBVP) associated with TNLPBVP is discovered. The Fréchet derivative of the Hamiltonian" is derived.  Under suitable conditions, theorems of necessary  and sufficient conditions for the optimality of the TNLPBVP with the SVCs are stated and proved.    

In this research, the focus was placed on estimating the parameters of the Hypoexponential distribution function using the maximum likelihood method and genetic algorithm. More than one standard, including MSE, has been adopted for comparison by Using the simulation method

 With the spread use of internet, especially the web of social media, an unusual quantity of information is found that includes a number of study fields such as psychology, entertainment, sociology, business, news, politics, and other cultural fields of nations. Data mining methodologies that deal with social media allows producing enjoyable scene on the human behaviour and interaction. This paper demonstrates the application and precision of sentiment analysis using traditional feedforward and two of recurrent neural networks (gated recurrent unit (GRU) and long short term memory (LSTM)) to find the differences between them. In order to test the system’s performance, a set of tests is applied on two public datasets. The firs

  Problem solving methods and mechanisms contribute to facilitating human life by providing tools to solve simple and complex daily problems. These mechanisms have been essential tools for professional designers and design students in solving design problems.
This research dealt with one of those mechanisms, which is the (the substance-field model model), as it has been mentioning that this mechanism is characterized by the difficulty of its application, which formed the main research problem. In home gardens (the sub-problem of research), an analysis of this problem was applied and then a solution was found to address it. The researcher used the 3dsmax program to implement the proposed design.
The most important research res

The research seeks to examine the ability of fifth preparatory students in solving a mathematical problem in relation to system thinking. To this end, the researcher chose (140) fifth preparatory students from four-different secondary schools in Kirkuk city for the academic year (2016-2017). Two tests were adopted to collect study data: a test of (5) items about skills in solving math problem designed by (Al-raihan, 2006); and a test of system thinking skills designed by the researcher himself consisted of (14) items. It was divided into four skills (analyzing the main system to subsystems, eliminating all inner gaps of system, identifying the inner connection of system, and reorganizing the system). The findings indicated a good ability

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

The partial level density PLD of pre-equilibrium reactions that are described by Ericson’s formula has been studied using different formulae of single particle level density . The parameter  was used from the equidistant spacing model (ESM) model and the non- equidistant spacing model (non-ESM) and another formula of  are derived from the relation between  and level density parameter . The formulae used to derive  are the Roher formula, Egidy formula, Yukawa formula, and Thomas –Fermi formula. The partial level density results that depend on  from the Thomas-Fermi formula show a good agreement with the experimental data.

In gene regulation, transcription factors (TFs) play a key function. It transmits genetic information from DNA to messenger RNA during the process of DNA transcription. During this step, the transcription factor binds to a segment of the DNA sequence known as Transcription Factor Binding Sites (TFBS). The goal of this study is to build a model that predicts whether or not a DNA binding site attaches to a certain transcription factor (TF). TFs are regulatory molecules that bind to particular sequence motifs in the gene to induce or restrict targeted gene transcription. Two classification methods will be used, which are support vector machine (SVM) and kernel logistic regression (KLR). Moreover, the KLR algorithm depends on another regress

This paper provides a four-stage Trigonometrically Fitted Improved Runge-Kutta (TFIRK4) method of four orders to solve oscillatory problems, which contains an oscillatory character in the solutions. Compared to the traditional Runge-Kutta method, the Improved Runge-Kutta (IRK) method is a natural two-step method requiring fewer steps. The suggested method extends the fourth-order Improved Runge-Kutta (IRK4) method with trigonometric calculations. This approach is intended to integrate problems with particular initial value problems (IVPs) using the set functions  and   for trigonometrically fitted. To improve the method's accuracy, the problem primary frequency  is used. The novel method is more accurate than the conventional Runge-Ku

   The main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits  of( FMOLP)   algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun