Search results for: simulated annealing algorithm
5050 Quick Sequential Search Algorithm Used to Decode High-Frequency Matrices
Authors: Mohammed M. Siddeq, Mohammed H. Rasheed, Omar M. Salih, Marcos A. Rodrigues
Abstract:
This research proposes a data encoding and decoding method based on the Matrix Minimization algorithm. This algorithm is applied to high-frequency coefficients for compression/encoding. The algorithm starts by converting every three coefficients to a single value; this is accomplished based on three different keys. The decoding/decompression uses a search method called QSS (Quick Sequential Search) Decoding Algorithm presented in this research based on the sequential search to recover the exact coefficients. In the next step, the decoded data are saved in an auxiliary array. The basic idea behind the auxiliary array is to save all possible decoded coefficients; this is because another algorithm, such as conventional sequential search, could retrieve encoded/compressed data independently from the proposed algorithm. The experimental results showed that our proposed decoding algorithm retrieves original data faster than conventional sequential search algorithms.Keywords: matrix minimization algorithm, decoding sequential search algorithm, image compression, DCT, DWT
Procedia PDF Downloads 1125049 Post Growth Annealing Effect on Deep Level Emission and Raman Spectra of Hydrothermally Grown ZnO Nanorods Assisted by KMnO4
Authors: Ashish Kumar, Tejendra Dixit, I. A. Palani, Vipul Singh
Abstract:
Zinc oxide, with its interesting properties such as large band gap (3.37eV), high exciton binding energy (60 meV) and intense UV absorption has been studied in literature for various applications viz. optoelectronics, biosensors, UV-photodetectors etc. The performance of ZnO devices is highly influenced by morphologies, size, crystallinity of the ZnO active layer and processing conditions. Recently, our group has shown the influence of the in situ addition of KMnO4 in the precursor solution during the hydrothermal growth of ZnO nanorods (NRs) on their near band edge (NBE) emission. In this paper, we have investigated the effect of post-growth annealing on the variations in NBE and deep level (DL) emissions of as grown ZnO nanorods. These observed results have been explained on the basis of X-ray Diffraction (XRD) and Raman spectroscopic analysis, which clearly show that improved crystalinity and quantum confinement in ZnO nanorods.Keywords: ZnO, nanorods, hydrothermal, KMnO4
Procedia PDF Downloads 3655048 An Algorithm Based on Control Indexes to Increase the Quality of Service on Cellular Networks
Authors: Rahman Mofidi, Sina Rahimi, Farnoosh Darban
Abstract:
Communication plays a key role in today’s world, and to support it, the quality of service has the highest priority. It is very important to differentiate between traffic based on priority level. Some traffic classes should be a higher priority than other classes. It is also necessary to give high priority to customers who have more payment for better service, however, without influence on other customers. So to realize that, we will require effective quality of service methods. To ensure the optimal performance of the network in accordance with the quality of service is an important goal for all operators in the mobile network. In this work, we propose an algorithm based on control parameters which it’s based on user feedback that aims at minimizing the access to system transmit power and thus improving the network key performance indicators and increasing the quality of service. This feedback that is known as channel quality indicator (CQI) indicates the received signal level of the user. We aim at proposing an algorithm in control parameter criterion to study improving the quality of service and throughput in a cellular network at the simulated environment. In this work we tried to parameter values have close to their actual level. Simulation results show that the proposed algorithm improves the system throughput and thus satisfies users' throughput and improves service to set up a successful call.Keywords: quality of service, key performance indicators, control parameter, channel quality indicator
Procedia PDF Downloads 1725047 ACOPIN: An ACO Algorithm with TSP Approach for Clustering Proteins in Protein Interaction Networks
Authors: Jamaludin Sallim, Rozlina Mohamed, Roslina Abdul Hamid
Abstract:
In this paper, we proposed an Ant Colony Optimization (ACO) algorithm together with Traveling Salesman Problem (TSP) approach to investigate the clustering problem in Protein Interaction Networks (PIN). We named this combination as ACOPIN. The purpose of this work is two-fold. First, to test the efficacy of ACO in clustering PIN and second, to propose the simple generalization of the ACO algorithm that might allow its application in clustering proteins in PIN. We split this paper to three main sections. First, we describe the PIN and clustering proteins in PIN. Second, we discuss the steps involved in each phase of ACO algorithm. Finally, we present some results of the investigation with the clustering patterns.Keywords: ant colony optimization algorithm, searching algorithm, protein functional module, protein interaction network
Procedia PDF Downloads 5705046 Text Based Shuffling Algorithm on Graphics Processing Unit for Digital Watermarking
Authors: Zayar Phyo, Ei Chaw Htoon
Abstract:
In a New-LSB based Steganography method, the Fisher-Yates algorithm is used to permute an existing array randomly. However, that algorithm performance became slower and occurred memory overflow problem while processing the large dimension of images. Therefore, the Text-Based Shuffling algorithm aimed to select only necessary pixels as hiding characters at the specific position of an image according to the length of the input text. In this paper, the enhanced text-based shuffling algorithm is presented with the powered of GPU to improve more excellent performance. The proposed algorithm employs the OpenCL Aparapi framework, along with XORShift Kernel including the Pseudo-Random Number Generator (PRNG) Kernel. PRNG is applied to produce random numbers inside the kernel of OpenCL. The experiment of the proposed algorithm is carried out by practicing GPU that it can perform faster-processing speed and better efficiency without getting the disruption of unnecessary operating system tasks.Keywords: LSB based steganography, Fisher-Yates algorithm, text-based shuffling algorithm, OpenCL, XORShiftKernel
Procedia PDF Downloads 1215045 Annealing Process Study at Galvanizing Line: Characterization and Implication Inherent to Lead Entrainment
Authors: Marcelo Franzkowiak Stahlschmidt
Abstract:
This paper discusses the experiments carried out based on the wire drawing process analysis and later annealing on lead furnace on a galvanizing line. Using Design of Experiments methodology, the aim of this work is to understand the occurrence of lead entrainment originating from the annealed wires in order to decrease this problem. Wire samples were collected from wire drawing machines and galvanizing line and submitted to surface roughness analysis and its implications on lead drag out based on wire speed, wire diameter, lead bath temperature, thermal capacity of the lead kettle, wire surface condition, wire roughness and wire superficial cleanliness. Proposals to decrease lead drag out were made in order to increase wire drawing machines and galvanizing line performance.Keywords: wire drawing process, galvanizing, heat treatment, lead
Procedia PDF Downloads 6115044 An Optimization Algorithm for Reducing the Liquid Oscillation in the Moving Containers
Authors: Reza Babajanivalashedi, Stefania Lo Feudo, Jean-Luc Dion
Abstract:
Liquid sloshing is a crucial problem for the dynamic of moving containers in the packaging industries. Sloshing issues have been so far mainly modeled within the framework of fluid dynamics or by using equivalent mechanical models with different kinds of movements and shapes of containers. Nevertheless, these approaches do not allow to determinate the shape of the free surface of the liquid in case of the irregular shape of the moving containers, so that experimental measurements may be required. If there is too much slosh in the moving tank, the liquid can be splashed out on the packages. So, the free surface oscillation must be controlled/reduced to eliminate the splashing. The purpose of this research is to propose an optimization algorithm for finding an optimum command law to reduce surface elevation. In the first step, the free surface of the liquid is simulated based on the separation variable and weak formulation models. Then Genetic and Gradient algorithms are developed for finding the optimum command law. The optimum command law is compared with existing command laws, and the results show that there is a significant difference in surface oscillation between optimum and existing command laws. This algorithm is applicable for different varieties of bottles in case of using the camera for detecting the liquid elevation, and it can produce new command laws for different kinds of tanks to reduce the surface oscillation and remove the splashing phenomenon.Keywords: sloshing phenomenon, separation variables, weak formulation, optimization algorithm, command law
Procedia PDF Downloads 1165043 An Algorithm for the Map Labeling Problem with Two Kinds of Priorities
Authors: Noboru Abe, Yoshinori Amai, Toshinori Nakatake, Sumio Masuda, Kazuaki Yamaguchi
Abstract:
We consider the problem of placing labels of the points on a plane. For each point, its position, the size of its label and a priority are given. Moreover, several candidates of its label positions are prespecified, and each of such label positions is assigned a priority. The objective of our problem is to maximize the total sum of priorities of placed labels and their points. By refining a labeling algorithm that can use these priorities, we propose a new heuristic algorithm which is more suitable for treating the assigned priorities.Keywords: map labeling, greedy algorithm, heuristic algorithm, priority
Procedia PDF Downloads 4025042 Half Mode Substrate Integrated Wave Guide of Band Pass Filter Based to Defected Ground Structure Cells
Authors: Damou Mehdi, Nouri Keltoum, Feham Mohammed, Khazini Mohammed, Bouazza Tayb Habibi Chawki
Abstract:
The Half mode SIW filter is treated by two softwares (HFSS (High Frequency Structure Simulator) and CST (Computer Simulation Technology)). The filter HMSIW has a very simple structure and a very compact size. The simulated results by CST are presented and compared with the results simulated by a high-frequency structure simulator. Good agreement between the simulated CST and simulated results by HFSS is observed. By cascading two of them according to design requirement, a X-band bandpass filter is designed and simulated to meet compact size, low insertion loss, good return loss as well as second harmonic suppression. As an example, we designed the proposed HMSIW filter at X band by HFSS. The filter has a pass-band from 7.3 GHz to 9.8 GHz, and its relative operating fraction bandwidth is 29.5 %. There are one transmission zeros are located at 14.4 GHz.Keywords: substrate integrated waveguide, filter, HMSIW, defected ground structures (DGS), simulation BPF
Procedia PDF Downloads 5425041 Simulation-Based Learning in the Exercise Science Curriculum: Peer Role Play vs Professional Simulated Patient
Authors: Nathan Reeves
Abstract:
Aim: The aim of this study was to evaluate if there was an impact on student learning when peer role play was substituted for a professional actor in the role of simulated patient in a simulation-based scenario. Method: Third-year exercise science students enrolled in a field project course in 2015 (n=24), and 2016 (n=20) participated in a simulation-based case scenario designed to develop their client-centred exercise prescription skills. During the simulation, students were provided with feedback from the simulated patients. In 2015, three professional actors played the part of the simulated patient, and in 2016 one of the simulated patients was a student from another exercise science cohort (peer role play). The student learning experience, consistency in case fidelity and feedback provided by the simulated patients was evaluated using a 5-point Likert scale survey and collecting phenomenological data. Results: Improvements to student pre and post confidence remained constant between the 2015 and 2016 cohorts (1.04 and 0.85). The perceived usefulness and enjoyability also remained high across the two cohorts (4.96 and 4.71). The feedback provided by all three simulated patients in 2016 was seen to strongly support student learning experience (4.82), and was of a consistent level (4.47). Significance of the findings to allied health: Simulation-based education is rapidly expanding in the curricula across the allied health professions. The simulated patient methodology continues to receive support as a pedagogy to develop a range of clinical skills including communication, engagement and client-centeredness. Upskilling students to peer role play can be a reasonable alternative to engaging paid actors.Keywords: exercise science, simulation-based learning, simulated patient, peer role play
Procedia PDF Downloads 2735040 A Hybrid Distributed Algorithm for Multi-Objective Dynamic Flexible Job Shop Scheduling Problem
Authors: Aydin Teymourifar, Gurkan Ozturk
Abstract:
In this paper, a hybrid distributed algorithm has been suggested for multi-objective dynamic flexible job shop scheduling problem. The proposed algorithm is high level, in which several algorithms search the space on different machines simultaneously also it is a hybrid algorithm that takes advantages of the artificial intelligence, evolutionary and optimization methods. Distribution is done at different levels and new approaches are used for design of the algorithm. Apache spark and Hadoop frameworks have been used for the distribution of the algorithm. The Pareto optimality approach is used for solving the multi-objective benchmarks. The suggested algorithm that is able to solve large-size problems in short times has been compared with the successful algorithms of the literature. The results prove high speed and efficiency of the algorithm.Keywords: distributed algorithms, apache-spark, Hadoop, flexible dynamic job shop scheduling, multi-objective optimization
Procedia PDF Downloads 3165039 Tuning of Kalman Filter Using Genetic Algorithm
Authors: Hesham Abdin, Mohamed Zakaria, Talaat Abd-Elmonaem, Alaa El-Din Sayed Hafez
Abstract:
Kalman filter algorithm is an estimator known as the workhorse of estimation. It has an important application in missile guidance, especially in lack of accurate data of the target due to noise or uncertainty. In this paper, a Kalman filter is used as a tracking filter in a simulated target-interceptor scenario with noise. It estimates the position, velocity, and acceleration of the target in the presence of noise. These estimations are needed for both proportional navigation and differential geometry guidance laws. A Kalman filter has a good performance at low noise, but a large noise causes considerable errors leads to performance degradation. Therefore, a new technique is required to overcome this defect using tuning factors to tune a Kalman filter to adapt increasing of noise. The values of the tuning factors are between 0.8 and 1.2, they have a specific value for the first half of range and a different value for the second half. they are multiplied by the estimated values. These factors have its optimum values and are altered with the change of the target heading. A genetic algorithm updates these selections to increase the maximum effective range which was previously reduced by noise. The results show that the selected factors have other benefits such as decreasing the minimum effective range that was increased earlier due to noise. In addition to, the selected factors decrease the miss distance for all ranges of this direction of the target, and expand the effective range which leads to increase probability of kill.Keywords: proportional navigation, differential geometry, Kalman filter, genetic algorithm
Procedia PDF Downloads 4835038 Optimization of Roster Construction In Sports
Authors: Elijah Cavan
Abstract:
In Major League Sports (MLB, NBA, NHL, NFL), it is the Front Office Staff (FOS) who make decisions about who plays for their respective team. The FOS bear the brunt of the responsibility for acquiring players through drafting, trading and signing players in free agency while typically contesting with maximum roster salary constraints. The players themselves are volatile assets of these teams- their value fluctuates with age and performance. A simple comparison can be made when viewing players as assets. The problem here is similar to that of optimizing your investment portfolio. The The goal is ultimately to maximize your periodic returns while tolerating a fixed risk (degree of uncertainty/ potential loss). Each franchise may value assets differently, and some may only tolerate lower risk levels- these are examples of factors that introduce additional constraints into the model. In this talk, we will detail the mathematical formulation of this problem as a constrained optimization problem- which can be solved with classical machine learning methods but is also well posed as a problem to be solved on quantum computersKeywords: optimization, financial mathematics, sports analytics, simulated annealing
Procedia PDF Downloads 845037 A Variant of a Double Structure-Preserving QR Algorithm for Symmetric and Hamiltonian Matrices
Authors: Ahmed Salam, Haithem Benkahla
Abstract:
Recently, an efficient backward-stable algorithm for computing eigenvalues and vectors of a symmetric and Hamiltonian matrix has been proposed. The method preserves the symmetric and Hamiltonian structures of the original matrix, during the whole process. In this paper, we revisit the method. We derive a way for implementing the reduction of the matrix to the appropriate condensed form. Then, we construct a novel version of the implicit QR-algorithm for computing the eigenvalues and vectors.Keywords: block implicit QR algorithm, preservation of a double structure, QR algorithm, symmetric and Hamiltonian structures
Procedia PDF Downloads 3735036 A New Tool for Global Optimization Problems: Cuttlefish Algorithm
Authors: Adel Sabry Eesa, Adnan Mohsin Abdulazeez Brifcani, Zeynep Orman
Abstract:
This paper presents a new meta-heuristic bio-inspired optimization algorithm which is called Cuttlefish Algorithm (CFA). The algorithm mimics the mechanism of color changing behavior of the cuttlefish to solve numerical global optimization problems. The colors and patterns of the cuttlefish are produced by reflected light from three different layers of cells. The proposed algorithm considers mainly two processes: reflection and visibility. Reflection process simulates light reflection mechanism used by these layers, while visibility process simulates visibility of matching patterns of the cuttlefish. To show the effectiveness of the algorithm, it is tested with some other popular bio-inspired optimization algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO) and Bees Algorithm (BA) that have been previously proposed in the literature. Simulations and obtained results indicate that the proposed CFA is superior when compared with these algorithms.Keywords: Cuttlefish Algorithm, bio-inspired algorithms, optimization, global optimization problems
Procedia PDF Downloads 5325035 Using Genetic Algorithms and Rough Set Based Fuzzy K-Modes to Improve Centroid Model Clustering Performance on Categorical Data
Authors: Rishabh Srivastav, Divyam Sharma
Abstract:
We propose an algorithm to cluster categorical data named as ‘Genetic algorithm initialized rough set based fuzzy K-Modes for categorical data’. We propose an amalgamation of the simple K-modes algorithm, the Rough and Fuzzy set based K-modes and the Genetic Algorithm to form a new algorithm,which we hypothesise, will provide better Centroid Model clustering results, than existing standard algorithms. In the proposed algorithm, the initialization and updation of modes is done by the use of genetic algorithms while the membership values are calculated using the rough set and fuzzy logic.Keywords: categorical data, fuzzy logic, genetic algorithm, K modes clustering, rough sets
Procedia PDF Downloads 2125034 An Improved Ant Colony Algorithm for Genome Rearrangements
Authors: Essam Al Daoud
Abstract:
Genome rearrangement is an important area in computational biology and bioinformatics. The basic problem in genome rearrangements is to compute the edit distance, i.e., the minimum number of operations needed to transform one genome into another. Unfortunately, unsigned genome rearrangement problem is NP-hard. In this study an improved ant colony optimization algorithm to approximate the edit distance is proposed. The main idea is to convert the unsigned permutation to signed permutation and evaluate the ants by using Kaplan algorithm. Two new operations are added to the standard ant colony algorithm: Replacing the worst ants by re-sampling the ants from a new probability distribution and applying the crossover operations on the best ants. The proposed algorithm is tested and compared with the improved breakpoint reversal sort algorithm by using three datasets. The results indicate that the proposed algorithm achieves better accuracy ratio than the previous methods.Keywords: ant colony algorithm, edit distance, genome breakpoint, genome rearrangement, reversal sort
Procedia PDF Downloads 3165033 Developing New Algorithm and Its Application on Optimal Control of Pumps in Water Distribution Network
Authors: R. Rajabpour, N. Talebbeydokhti, M. H. Ahmadi
Abstract:
In recent years, new techniques for solving complex problems in engineering are proposed. One of these techniques is JPSO algorithm. With innovative changes in the nature of the jump algorithm JPSO, it is possible to construct a graph-based solution with a new algorithm called G-JPSO. In this paper, a new algorithm to solve the optimal control problem Fletcher-Powell and optimal control of pumps in water distribution network was evaluated. Optimal control of pumps comprise of optimum timetable operation (status on and off) for each of the pumps at the desired time interval. Maximum number of status on and off for each pumps imposed to the objective function as another constraint. To determine the optimal operation of pumps, a model-based optimization-simulation algorithm was developed based on G-JPSO and JPSO algorithms. The proposed algorithm results were compared well with the ant colony algorithm, genetic and JPSO results. This shows the robustness of proposed algorithm in finding near optimum solutions with reasonable computational cost.Keywords: G-JPSO, operation, optimization, pumping station, water distribution networks
Procedia PDF Downloads 3725032 Intelligent Rescheduling Trains for Air Pollution Management
Authors: Kainat Affrin, P. Reshma, G. Narendra Kumar
Abstract:
Optimization of timetable is the need of the day for the rescheduling and routing of trains in real time. Trains are scheduled in parallel with the road transport vehicles to the same destination. As the number of trains is restricted due to single track, customers usually opt for road transport to use frequently. The air pollution increases as the density of vehicles on road transport is increased. Use of an alternate mode of transport like train helps in reducing air-pollution. This paper mainly aims at attracting the passengers to Train transport by proper rescheduling of trains using hybrid of stop-skip algorithm and iterative convex programming algorithm. Rescheduling of train bi-directionally is achieved on a single track with dynamic dual time and varying stops. Introduction of more trains attract customers to use rail transport frequently, thereby decreasing the pollution. The results are simulated using Network Simulator (NS-2).Keywords: air pollution, AODV, re-scheduling, WSNs
Procedia PDF Downloads 3335031 The Effect of Mechanical Stress on the Magnetic Structure and Properties of Ferromagnetic Microwires in Glass Insulation
Authors: N. N. Orlova, A. S. Aronin, Yu. P. Kabanov, S. I. Bozhko, V. S. Gornakov
Abstract:
We have investigated the change of the magnetic structure and the hysteresis properties of iron-based microwires after decreasing levels of internal mechanical stresses. The magnetic structure was investigated by the method of magneto-optical indicator film and the method of magnetic force microscopy. The hysteresis properties were studied by the vibrating sample magnetometer. The stresses were decreased by removing the glass coat and/or by low-temperature isothermal annealing. Previously, the authors carried out experimentally investigation of the magnetic structure of Fe-based microwire using these methods. According to the obtained results the domain structure of a microwire with a positive magnetostriction is composed of the inner cylindrical domains with the magnetization along the wire axis and the surface layer of the ring shape domains with the radial direction of magnetization. Surface ring domains with opposite magnetization direction (i.e., to the axis or from the axis) alternate with each other. For the first time the size of magnetic domains was determined experimentally. In this study it was found that in the iron-based microwires the value of the coercive force can be reduce more than twice by decreasing levels of internal mechanical stresses. Decrease of the internal stress value by the relaxation annealing influence on the magnetic structure. So in the as-prepared microwires observed local deviations of the magnetization of the magnetic core domains from the axis of the wire. After low-temperature annealing the local deviations of magnetization is not observed.Keywords: amorphous microwire, magnetic structure, internal stress, hysteresis properties, ferromagnetic
Procedia PDF Downloads 5445030 Zamzam Water as Corrosion Inhibitor for Steel Rebar in Rainwater and Simulated Acid Rain
Authors: Ahmed A. Elshami, Stephanie Bonnet, Abdelhafid Khelidj
Abstract:
Corrosion inhibitors are widely used in concrete industry to reduce the corrosion rate of steel rebar which is present in contact with aggressive environments. The present work aims to using Zamzam water from well located within the Masjid al-Haram in Mecca, Saudi Arabia 20 m (66 ft) east of the Kaaba, the holiest place in Islam as corrosion inhibitor for steel in rain water and simulated acid rain. The effect of Zamzam water was investigated by electrochemical impedance spectroscopy (EIS) and Potentiodynamic polarization techniques in Department of Civil Engineering - IUT Saint-Nazaire, Nantes University, France. Zamzam water is considered to be one of the most important steel corrosion inhibitor which is frequently used in different industrial applications. Results showed that zamzam water gave a very good inhibition for steel corrosion in rain water and simulated acid rain.Keywords: Zamzam water, corrosion inhibitor, rain water, simulated acid rain
Procedia PDF Downloads 3595029 Linear Array Geometry Synthesis with Minimum Sidelobe Level and Null Control Using Taguchi Method
Authors: Amara Prakasa Rao, N. V. S. N. Sarma
Abstract:
This paper describes the synthesis of linear array geometry with minimum sidelobe level and null control using the Taguchi method. Based on the concept of the orthogonal array, Taguchi method effectively reduces the number of tests required in an optimization process. Taguchi method has been successfully applied in many fields such as mechanical, chemical engineering, power electronics, etc. Compared to other evolutionary methods such as genetic algorithms, simulated annealing and particle swarm optimization, the Taguchi method is much easier to understand and implement. It requires less computational/iteration processing to optimize the problem. Different cases are considered to illustrate the performance of this technique. Simulation results show that this method outperforms the other evolution algorithms (like GA, PSO) for smart antenna systems design.Keywords: array factor, beamforming, null placement, optimization method, orthogonal array, Taguchi method, smart antenna system
Procedia PDF Downloads 3625028 A Fast Silhouette Detection Algorithm for Shadow Volumes in Augmented Reality
Authors: Hoshang Kolivand, Mahyar Kolivand, Mohd Shahrizal Sunar, Mohd Azhar M. Arsad
Abstract:
Real-time shadow generation in virtual environments and Augmented Reality (AR) was always a hot topic in the last three decades. Lots of calculation for shadow generation among AR needs a fast algorithm to overcome this issue and to be capable of implementing in any real-time rendering. In this paper, a silhouette detection algorithm is presented to generate shadows for AR systems. Δ+ algorithm is presented based on extending edges of occluders to recognize which edges are silhouettes in the case of real-time rendering. An accurate comparison between the proposed algorithm and current algorithms in silhouette detection is done to show the reduction calculation by presented algorithm. The algorithm is tested in both virtual environments and AR systems. We think that this algorithm has the potential to be a fundamental algorithm for shadow generation in all complex environments.Keywords: silhouette detection, shadow volumes, real-time shadows, rendering, augmented reality
Procedia PDF Downloads 4145027 Growth Mechanism, Structural and Compositional Properties of Cu₂ZnSnS₄ (CZTS) Thin Films Deposited by Sputtering Method from a Compound Target
Authors: Sanusi Abdullahi, Musa Momoh, Abubakar Umar Moreh, Aminu Muhammad Bayawa, Olubunmi Popoola
Abstract:
Kesterite-type Cu₂ZnSnS₄ (CZTS) thin films were deposited on corning glass from a single quaternary target. In this study, we investigated the growth mechanism and the influence of thin film thickness on the structural and compositional properties of CZTS films. All the four samples (as-deposited inclusive) show peaks corresponding to kesterite-type structure. The diffraction peaks of (112) are sharp and the small characteristics peaks of the kesterite structure such as (220)/ (204) and (312)/ (116) are also clearly observed in X-ray diffraction pattern. These results indicate that the quaternary CZTS would be a potential candidate for solar cell applications.Keywords: RF sputtering, Cu2ZnSnS4 thin film, annealing, growth mechanism, annealing, growth mechanism, renewable energy
Procedia PDF Downloads 3445026 An Enhanced Harmony Search (ENHS) Algorithm for Solving Optimization Problems
Authors: Talha A. Taj, Talha A. Khan, M. Imran Khalid
Abstract:
Optimization techniques attract researchers to formulate a problem and determine its optimum solution. This paper presents an Enhanced Harmony Search (ENHS) algorithm for solving optimization problems. The proposed algorithm increases the convergence and is more efficient than the standard Harmony Search (HS) algorithm. The paper discusses the novel techniques in detail and also provides the strategy for tuning the decisive parameters that affects the efficiency of the ENHS algorithm. The algorithm is tested on various benchmark functions, a real world optimization problem and a constrained objective function. Also, the results of ENHS are compared to standard HS, and various other optimization algorithms. The ENHS algorithms prove to be significantly better and more efficient than other algorithms. The simulation and testing of the algorithms is performed in MATLAB.Keywords: optimization, harmony search algorithm, MATLAB, electronic
Procedia PDF Downloads 4285025 A Novel Algorithm for Production Scheduling
Authors: Ali Mohammadi Bolban Abad, Fariborz Ahmadi
Abstract:
Optimization in manufacture is a method to use limited resources to obtain the best performance and reduce waste. In this paper a new algorithm based on eurygaster life is introduced to obtain a plane in which task order and completion time of resources are defined. Evaluation results show our approach has less make span when the resources are allocated with some products in comparison to genetic algorithm.Keywords: evolutionary computation, genetic algorithm, particle swarm optimization, NP-Hard problems, production scheduling
Procedia PDF Downloads 3515024 Downscaling Daily Temperature with Neuroevolutionary Algorithm
Authors: Min Shi
Abstract:
State of the art research with Artificial Neural Networks for the downscaling of General Circulation Models (GCMs) mainly uses back-propagation algorithm as a training approach. This paper introduces another training approach of ANNs, Evolutionary Algorithm. The combined algorithm names neuroevolutionary (NE) algorithm. We investigate and evaluate the use of the NE algorithms in statistical downscaling by generating temperature estimates at interior points given information from a lattice of surrounding locations. The results of our experiments indicate that NE algorithms can be efficient alternative downscaling methods for daily temperatures.Keywords: temperature, downscaling, artificial neural networks, evolutionary algorithms
Procedia PDF Downloads 3205023 An Optimization Algorithm Based on Dynamic Schema with Dissimilarities and Similarities of Chromosomes
Authors: Radhwan Yousif Sedik Al-Jawadi
Abstract:
Optimization is necessary for finding appropriate solutions to a range of real-life problems. In particular, genetic (or more generally, evolutionary) algorithms have proved very useful in solving many problems for which analytical solutions are not available. In this paper, we present an optimization algorithm called Dynamic Schema with Dissimilarity and Similarity of Chromosomes (DSDSC) which is a variant of the classical genetic algorithm. This approach constructs new chromosomes from a schema and pairs of existing ones by exploring their dissimilarities and similarities. To show the effectiveness of the algorithm, it is tested and compared with the classical GA, on 15 two-dimensional optimization problems taken from literature. We have found that, in most cases, our method is better than the classical genetic algorithm.Keywords: chromosome injection, dynamic schema, genetic algorithm, similarity and dissimilarity
Procedia PDF Downloads 3135022 Simulation Approach for a Comparison of Linked Cluster Algorithm and Clusterhead Size Algorithm in Ad Hoc Networks
Authors: Ameen Jameel Alawneh
Abstract:
A Mobile ad-hoc network (MANET) is a collection of wireless mobile hosts that dynamically form a temporary network without the aid of a system administrator. It has neither fixed infrastructure nor wireless ad hoc sessions. It inherently reaches several nodes with a single transmission, and each node functions as both a host and a router. The network maybe represented as a set of clusters each managed by clusterhead. The cluster size is not fixed and it depends on the movement of nodes. We proposed a clusterhead size algorithm (CHSize). This clustering algorithm can be used by several routing algorithms for ad hoc networks. An elected clusterhead is assigned for communication with all other clusters. Analysis and simulation of the algorithm has been implemented using GloMoSim networks simulator, MATLAB and MAPL11 proved that the proposed algorithm achieves the goals.Keywords: simulation, MANET, Ad-hoc, cluster head size, linked cluster algorithm, loss and dropped packets
Procedia PDF Downloads 3665021 Hybrid Algorithm for Frequency Channel Selection in Wi-Fi Networks
Authors: Cesar Hernández, Diego Giral, Ingrid Páez
Abstract:
This article proposes a hybrid algorithm for spectrum allocation in cognitive radio networks based on the algorithms Analytical Hierarchical Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) to improve the performance of the spectrum mobility of secondary users in cognitive radio networks. To calculate the level of performance of the proposed algorithm a comparative analysis between the proposed AHP-TOPSIS, Grey Relational Analysis (GRA) and Multiplicative Exponent Weighting (MEW) algorithm is performed. Four evaluation metrics is used. These metrics are the accumulative average of failed handoffs, the accumulative average of handoffs performed, the accumulative average of transmission bandwidth, and the accumulative average of the transmission delay. The results of the comparison show that AHP-TOPSIS Algorithm provides 2.4 times better performance compared to a GRA Algorithm and, 1.5 times better than the MEW Algorithm.Keywords: cognitive radio, decision making, hybrid algorithm, spectrum handoff, wireless networks
Procedia PDF Downloads 506