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.
In this paper, we focus on designing feed forward neural network (FFNN) for solving Mixed Volterra – Fredholm Integral Equations (MVFIEs) of second kind in 2–dimensions. in our method, we present a multi – layers model consisting of a hidden layer which has five hidden units (neurons) and one linear output unit. Transfer function (Log – sigmoid) and training algorithm (Levenberg – Marquardt) are used as a sigmoid activation of each unit. A comparison between the results of numerical experiment and the analytic solution of some examples has been carried out in order to justify the efficiency and the accuracy of our method.
... Show More
This paper discussed the solution of an equivalent circuit of solar cell, where a single diode model is presented. The nonlinear equation of this model has suggested and analyzed an iterative algorithm, which work well for this equation with a suitable initial value for the iterative. The convergence of the proposed method is discussed. It is established that the algorithm has convergence of order six. The proposed algorithm is achieved with a various values of load resistance. Equation by means of equivalent circuit of a solar cell so all the determinations is achieved using Matlab in ambient temperature. The obtained results of this new method are given and the absolute errors is demonstrated.
Optimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol
The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot
... Show MoreBackground and Aim: due to the rapid growth of data communication and multimedia system applications, security becomes a critical issue in the communication and storage of images. This study aims to improve encryption and decryption for various types of images by decreasing time consumption and strengthening security. Methodology: An algorithm is proposed for encrypting images based on the Carlisle Adams and Stafford Tavares CAST block cipher algorithm with 3D and 2D logistic maps. A chaotic function that increases the randomness in the encrypted data and images, thereby breaking the relation sequence through the encryption procedure, is introduced. The time is decreased by using three secure and private S-Boxes rather than using si
... Show MoreBiomedical signal such as ECG is extremely important in the diagnosis of patients and is commonly recorded with a noise. Many different kinds of noise exist in biomedical environment such as Power Line Interference Noise (PLIN). Adaptive filtering is selected to contend with these defects, the adaptive filters can adjust the filter coefficient with the given filter order. The objectives of this paper are: first an application of the Least Mean Square (LMS) algorithm, Second is an application of the Recursive Least Square (RLS) algorithm to remove the PLIN. The LMS and RLS algorithms of the adaptive filter were proposed to adapt the filter order and the filter coefficients simultaneously, the performance of existing LMS
... Show MoreGiven a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.
The Islamic Issue did not rise the “widespread arguments” in contemporary times, just as the issue of applying Islamic Law. Just as the Islamic forces used this purpose, or employed it during their march to reach to power by adopting the sacred as motivation towered the power, or control the governance. However, the reality show that this goal remained within the boundaries of slogans in the sense of a teleological slogan, and did not go beyond the limits of advocacy or arrangement as the primary source of legislation with differences of teleological reasoning, in a manner that reflected an intellectual problem about the validity of the use of this concept or the ability to apply and enforce the law in today's world, to impose
... Show More