The identification of salinity-tolerance genes is a critical aspect of the new molecular technology. In this work cDNA-RAPD is used for the identification of genes expressed in salt tolerant but not in salt sensitive wheat. Two cultivars wheat, salt tolerance (Dijla) and sensitive (Tamooz2) were used for the preparation of RNA and cDNA synthesis. Eight primers were used for random amplification of cDNA constructed from RNA and three primers were differentially expressed in salt tolerant cultivars. Genes related to salt tolerant were predicted using NCBI blast for the three primers. The predicted genes were involved in salt tolerance of wheat and other plants as well. This indicates the suitability of the primers and the method for

This paper is concerned with combining two different transforms to present a new joint transform FHET and its inverse transform IFHET. Also, the most important property of FHET was concluded and proved, which is called the finite Hankel – Elzaki transforms of the Bessel differential operator property, this property was discussed for two different boundary conditions, Dirichlet and Robin. Where the importance of this property is shown by solving axisymmetric partial differential equations and transitioning to an algebraic equation directly. Also, the joint Finite Hankel-Elzaki transform method was applied in solving a mathematical-physical problem, which is the Hotdog Problem. A steady state which does not depend on time was discussed f

In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.

The Population growth and decay issues are one of the most pressing issues in many sectors of study. These issues can be found in physics, chemistry, social science, biology, and zoology, among other subjects.

We introduced the solution for these problems in this paper by using the SEJI (Sadiq- Emad- Jinan) integral transform, which has some mathematical properties that we use in our solutions. We also presented the SEJI transform for some functions, followed by the inverse of the SEJI integral transform for these functions. After that, we demonstrate how to use the SEJI transform to tackle population growth and decay problems by presenting two applications that demonstrate how to use this transform to obtain solutions.

Fin

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio

In this paper we use Bernstein polynomials for deriving the modified Simpson's 3/8 , and the composite modified Simpson's 3/8 to solve one dimensional linear Volterra integral equations of the second kind , and we find that the solution computed by this procedure is very close to exact solution.

Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

problems with its unobvious effect on scientific creativity and information. Problem solving is one of main goals of researchers because it develops their right logical thinking methods. The present study aims at measuring logical thinking among female it structures in the university mea swing problem solving among them ,identifying statically differences significance in logical thinking among female instructors in the university according to (Specialization Variable), identifying differences significance in problem Solving among female instructions in the university according to ( Specialization Variable) and identifying the Correlation between logical thinking and problem solving among female instructors in the university. The sample c

   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