Preferred Language
Articles
/
bsj-5309
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

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 optimal timetable schedules with different copies by increasing the probability of giving the best schedule for each stage in the campus with the ability to replace the timetable when needed. The Evolutionary Algorithm (EA) utilized in this paper is the Genetic Algorithm (GA) which is a common multi-solution metaheuristic search based on the evolutionary population that can be applied to solve complex combinatorial problems like timetabling problems. In this work, all inputs: courses, teachers, and time acted by one array to achieve local search and combined this acting of the timetable by using the heuristic crossover to ensure that the essential conditions are not broken. The result of this work is a flexible scheduling system, which shows the diversity of all possible timetables that can be created depending on user conditions and needs.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Sep 27 2020
Journal Name
Journal Of The College Of Education For Women
Social Media and Academic Excellence
...Show More Authors

The current research seeks to shed light on the role that social media can play, through the optimal use of it by students, in achieving academic excellence. The most prominent aims that constitute it are:Identifying the social sites most used by students; learning how students interact with the published study material on communication sites and benefit from them to achieve their academic excellence; and knowing the connection between using social media and achieving academic excellence, and the role that these sites play in achieving academic excellence.That incorrect use by students leads to adverse results, and thus affects their academic level. Failure of parents to monitor their student’ use of social media leads

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Feb 01 2021
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Features of genetic algorithm for plain text encryption
...Show More Authors

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

... Show More
View Publication
Scopus (15)
Crossref (4)
Scopus Crossref
Publication Date
Thu Dec 01 2011
Journal Name
2011 Developments In E-systems Engineering
Enhanced Computation Time for Fast Block Matching Algorithm
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Symmetry
Fast Overlapping Block Processing Algorithm for Feature Extraction
...Show More Authors

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

... Show More
View Publication
Scopus (29)
Crossref (29)
Scopus Clarivate Crossref
Publication Date
Fri Sep 03 2021
Journal Name
Entropy
Reliable Recurrence Algorithm for High-Order Krawtchouk Polynomials
...Show More Authors

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

... Show More
View Publication
Scopus (36)
Crossref (32)
Scopus Clarivate Crossref
Publication Date
Thu Sep 26 2019
Journal Name
Processes
Fine-Tuning Meta-Heuristic Algorithm for Global Optimization
...Show More Authors

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

... Show More
View Publication Preview PDF
Scopus (29)
Crossref (24)
Scopus Clarivate Crossref
Publication Date
Wed Apr 01 2020
Journal Name
Journal Of Economics And Administrative Sciences
REVIEWING THE IMPLICATIONS OF TRAINING FOR ACADEMIC ADMINISTRATION STAFF AT CENTRAL MICHIGAN UNIVERSITY
...Show More Authors

Training has an effect on employees’ performances. Accordingly, the person who is responsible for employees’ development must figure out the most effective way to train and develop employees. Central Michigan University (CMU) has recognized the importance of providing appropriate training for employees who have a duty in advising students. The reason is that these employees have a significant impact on students’ educational performances. Thus, special attention to this category of employees is needed to improve advising quality. This research attempted to explore the impact of training on academic advising at CMU. Face-to-face interviews and online surveys were used as data collection tools for this study. The study scope c

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Mar 15 2026
Journal Name
Alustath Journal For Human And Social Sciences
Investing the English Academic Writing Lesson for Developing College of Languages Graduates Employability
...Show More Authors

Employment and employability requirements are currently a substantial concern for many Iraqi and international institutions and universities due to their vital role in empowering and enhancing graduates' opportunities of obtaining a job that suits their specializations and mends the gap between job applicants and employers. Most Iraqi universities and institutions lack a supportive mechanism that provides employment skills, requirements, and training courses to empower an eligible applicant. This study invests academic writing lesson to qualify (110) students from the English department who participated in a one-month training course aimed at raising awareness of the importance of understanding and mastering employability requiremen

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Jun 01 2020
Journal Name
Iop Conference Series: Materials Science And Engineering
Common Fixed Point problem for Classes of Nonlinear Maps in Hilbert Space
...Show More Authors
Abstract<p>in this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.</p>
View Publication
Scopus (6)
Crossref (1)
Scopus Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Pertanika Journal Of Science & Technology
Modified Kohonen network algorithm for selection of the initial centres of Gustafson-Kessel algorithm in credit scoring
...Show More Authors

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res

... Show More
Scopus (9)
Scopus