In this paper, a least squares group finite element method for solving coupled Burgers' problem in   2-D is presented. A fully discrete formulation of least squares finite element method is analyzed, the backward-Euler scheme for the time variable is considered, the discretization with respect to space variable is applied as biquadratic quadrangular elements with nine nodes for each element. The continuity, ellipticity, stability condition and error estimate of least squares group finite element method are proved.  The theoretical results  show that the error estimate of this method is . The numerical results are compared with the exact solution and other available literature when the convection-dominated case to illustrate the effic

  يعد تحليل العلاقات الكمية بين البنية والممتلكات/النشاط (QSPR/QSAR) أمرًا بالغ الأهمية لفهم خصائص المركبات المرتبطة بالمخدرات، خاصة في علاج مرض الزهايمر. في هذه الدراسة، هدفنا هو استخدام أساليب مبتكرة بما في ذلك استخدام المؤشرات الطوبولوجية -درجة و-  درجة ، المستمدة من نظرية الرسم البياني، لتقييم الخصائص والخصائص الفيزيائية والكيميائية لخمسة أدوية لمرض الزهايمر: تاكرين، دونيبيزيل، ريفيستيجمين، جالانتامي

The concept of Cech fuzzy soft bi-closure space ( ˇ Cfs bi-csp) ( ˇ U, L1, L2, S) is initiated and studied by the authors in [6]. The notion of pairwise fuzzy soft separated sets in Cfs bi-csp is defined in this study, and various features of ˇ this notion are proved. Then, we introduce and investigate the concept of connectedness in both Cfs bi-csps and its ˇ associated fuzzy soft bitopological spaces utilizing the concept of pairwise fuzzy soft separated sets. Furthermore, the concept of pairwise feebly connected is introduced, and the relationship between pairwise connected and pairwise feebly connected is discussed. Finally, we provide various instances to further explain our findings.

Many industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho