في هذا البحث، تم تنفيذ الطريقة الحسابية الفعالة (ECM) المستندة إلى متعددة الحدود القياسية الأحادية لحل مشكلة تدفق جيفري-هامل غير الخطية. علاوة على ذلك، تم تطوير واقتراح الطرق الحسابية الفعالة الجديدة في هذه الدراسة من خلال وظائف أساسية مناسبة وهي متعددات الحدود تشيبشيف، بيرنشتاين، ليجندر، هيرمت. يؤدي استخدام الدوال الأساسية إلى تحويل المسألة غير الخطية إلى نظام جبري غير خطي من المعادلات، والذي يتم حله بع

In this paper, the effective computational method (ECM) based on the standard monomial polynomial has been implemented to solve the nonlinear Jeffery-Hamel flow problem. Moreover, novel effective computational methods have been developed and suggested in this study by suitable base functions, namely Chebyshev, Bernstein, Legendre, and Hermite polynomials. The utilization of the base functions converts the nonlinear problem to a nonlinear algebraic system of equations, which is then resolved using the Mathematica^®12 program. The development of effective computational methods (D-ECM) has been applied to solve the nonlinear Jeffery-Hamel flow problem, then a comparison between the methods has been shown. Furthermore, the maximum

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

Moment invariants have wide applications in image recognition since they were proposed.

The presented study investigated the scheduling regarding  jobs on a single machine. Each  job will be processed with no interruptions and becomes available for the processing at time 0. The aim is finding a processing order with regard to jobs, minimizing total completion time , total late work , and maximal tardiness  which is an NP-hard problem. In the theoretical part of the present work, the mathematical formula for the examined problem will be presented, and a sub-problem of the original problem of minimizing the multi-objective functions  is introduced. Also, then the importance regarding the dominance rule (DR) that could be applied to the problem to improve good solutions will be shown. While in the practical part, two

The optical absorption data of Hydrogenated Amorphous Silicon was analyzed using a Dunstan model of optical absorption in amorphous semiconductors. This model introduces disorder into the band-band absorption through a linear exponential distribution of local energy gaps, and it accounts for both the Urbach and Tauc regions of the optical absorption edge.Compared to other models of similar bases, such as the O’Leary and Guerra models, it is simpler to understand mathematically and has a physical meaning. The optical absorption data of Jackson et al and Maurer et al were successfully interpreted using Dunstan’s model. Useful physical parameters are extracted especially the band to the band energy gap , which is the energy gap in the a

With the revolutionized expansion of the Internet, worldwide information increases the application of communication technology, and the rapid growth of significant data volume boosts the requirement to accomplish secure, robust, and confident techniques using various effective algorithms. Lots of algorithms and techniques are available for data security.  This paper presents a cryptosystem that combines several Substitution Cipher Algorithms along with the Circular queue data structure. The two different substitution techniques are; Homophonic Substitution Cipher and Polyalphabetic Substitution Cipher in which they merged in a single circular queue with four different keys for each of them, which produces eight different outputs for