In this study, He's parallel numerical algorithm by neural network is applied to type of integration of fractional equations is Abel’s integral equations of the 1^st and 2^nd kinds. Using a Levenberge – Marquaradt training algorithm as a tool to train the network. To show the efficiency of the method, some type of Abel’s integral equations is solved as numerical examples. Numerical results show that the new method is very efficient problems with high accuracy.

This paper proposes a new algorithm (F2SE) and algorithm (Alg(n – 1)) for solving the
two-machine flow shop problem with the objective of minimizing total earliness. This
complexity result leads us to use an enumeration solution approach for the algorithm (F2SE)
and (DM) is more effective than algorithm Alg( n – 1) to obtain approximate solution.

The current study aims to

1) identify the prevalent Enneagram personality types and the academic self among the sixth-grade students of the distinguished secondary schools; 2) the differences of relationship between the Enneagram personality types and the academic self-concept based on gender; 3) identify the correlation between the Enneagram personality types and the academic self-concept; and 4) identify the contribution of each type of personality types to the academic self-concept. To this end, two instrument were used to collect the data: Riso-Hudson’s scale,1995 was administered to measure enneagram types which had translated to the Arabic language by ( al-yassery,2004), the other instrument was

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

This research aimed at identifying the factors that affecting in the recruitment of a teaching staff for the Massive Open Online Courses (MOOCs) in university teaching at the University of Khartoum. The descriptive method was followed. The questionnaire was used as a tool for data collection,, which was distributed directly to a sample of (181) respondent of the teaching staff members of the senate at University of Khartoum from those who were attend at the senate meeting No. (409) which was held on 22 August 2016 Of (272). The researcher followed for the distribution the chance method, where each questionnaire was distributed to each of a teaching staff from different faculties at the University of Khartoum, according to his willingness

Learning Disabilities are described as a hidden and puzzling disability. Children with these difficulties have the potential to hide weaknesses in their performance because they are a homogenous group of disorders that consist of obvious difficulties in acquiring and using reading, writing, Mathematical inference. Thus, the research aims to identify the disabilities of academic learning in (reading, writing, mathematics), identify the problems of behavior (general, motor, social). Identify the relationship among behaviour problems. The research also aims to identify the counseling needs to reduce the behavioral problems. The researcher adopted the analytical descriptive method by preparing two main tools for measuring learning disabiliti

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the