Search results for: simulated annealing algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 5200

Search results for: simulated annealing algorithm

5080 A Genetic Based Algorithm to Generate Random Simple Polygons Using a New Polygon Merge Algorithm

Authors: Ali Nourollah, Mohsen Movahedinejad

Abstract:

In this paper a new algorithm to generate random simple polygons from a given set of points in a two dimensional plane is designed. The proposed algorithm uses a genetic algorithm to generate polygons with few vertices. A new merge algorithm is presented which converts any two polygons into a simple polygon. This algorithm at first changes two polygons into a polygonal chain and then the polygonal chain is converted into a simple polygon. The process of converting a polygonal chain into a simple polygon is based on the removal of intersecting edges. The merge algorithm has the time complexity of O ((r+s) *l) where r and s are the size of merging polygons and l shows the number of intersecting edges removed from the polygonal chain. It will be shown that 1 < l < r+s. The experiments results show that the proposed algorithm has the ability to generate a great number of different simple polygons and has better performance in comparison to celebrated algorithms such as space partitioning and steady growth.

Keywords: Divide and conquer, genetic algorithm, merge polygons, Random simple polygon generation.

Procedia PDF Downloads 505
5079 Biodegradation Behavior of Cellulose Acetate with DS 2.5 in Simulated Soil

Authors: Roberta Ranielle M. de Freitas, Vagner R. Botaro

Abstract:

The relationship between biodegradation and mechanical behavior is fundamental for studies of the application of cellulose acetate films as a possible material for biodegradable packaging. In this work, the biodegradation of cellulose acetate (CA) with DS 2.5 was analyzed in simulated soil. CA films were prepared by casting and buried in the simulated soil. Samples were taken monthly and analyzed, the total time of biodegradation was 6 months. To characterize the biodegradable CA, the DMA technique was employed. The main result showed that the time of exposure to the simulated soil affects the mechanical properties of the films and the values of crystallinity. By DMA analysis, it was possible to conclude that as the CA is biodegraded, its mechanical properties were altered, for example, storage modulus has increased with biodegradation and the modulus of loss has decreased. Analyzes of DSC, XRD, and FTIR were also carried out to characterize the biodegradation of CA, which corroborated with the results of DMA. The observation of the carbonyl band by FTIR and crystalline indices obtained by XRD were important to evaluate the degradation of CA during the exposure time.

Keywords: biodegradation, cellulose acetate, DMA, simulated soil

Procedia PDF Downloads 193
5078 Research on High Dielectric HfO₂ Stack Structure Applied to Field Effect Transistors

Authors: Kuan Yu Lin, Shih Chih Chen

Abstract:

This study focuses on the Al/HfO₂/Si/Al structure to explore the electrical properties of the structure. This experiment uses a radio frequency magnetron sputtering system to deposit high dielectric materials on p-type silicon substrates of 1~10 Ω-cm (100). Consider the hafnium dioxide film as a dielectric layer. Post-deposition annealing at 750°C in nitrogen atmosphere. Electron beam evaporation of metallic aluminum is then used to complete the top/bottom electrodes. The metal is post-annealed at 450°C for 20 minutes in a nitrogen environment to complete the MOS component. Its dielectric constant, equivalent oxide layer thickness, oxide layer defects, and leakage current mechanism are discussed. At PDA 750°C-5s, the maximum k value was found to be 21.2, and the EOT was 3.68nm.

Keywords: high-k gate dielectrics, HfO₂, post deposition annealing, RF magnetic

Procedia PDF Downloads 25
5077 Orthogonal Basis Extreme Learning Algorithm and Function Approximation

Authors: Ying Li, Yan Li

Abstract:

A new algorithm for single hidden layer feedforward neural networks (SLFN), Orthogonal Basis Extreme Learning (OBEL) algorithm, is proposed and the algorithm derivation is given in the paper. The algorithm can decide both the NNs parameters and the neuron number of hidden layer(s) during training while providing extreme fast learning speed. It will provide a practical way to develop NNs. The simulation results of function approximation showed that the algorithm is effective and feasible with good accuracy and adaptability.

Keywords: neural network, orthogonal basis extreme learning, function approximation

Procedia PDF Downloads 505
5076 An IM-COH Algorithm Neural Network Optimization with Cuckoo Search Algorithm for Time Series Samples

Authors: Wullapa Wongsinlatam

Abstract:

Back propagation algorithm (BP) is a widely used technique in artificial neural network and has been used as a tool for solving the time series problems, such as decreasing training time, maximizing the ability to fall into local minima, and optimizing sensitivity of the initial weights and bias. This paper proposes an improvement of a BP technique which is called IM-COH algorithm (IM-COH). By combining IM-COH algorithm with cuckoo search algorithm (CS), the result is cuckoo search improved control output hidden layer algorithm (CS-IM-COH). This new algorithm has a better ability in optimizing sensitivity of the initial weights and bias than the original BP algorithm. In this research, the algorithm of CS-IM-COH is compared with the original BP, the IM-COH, and the original BP with CS (CS-BP). Furthermore, the selected benchmarks, four time series samples, are shown in this research for illustration. The research shows that the CS-IM-COH algorithm give the best forecasting results compared with the selected samples.

Keywords: artificial neural networks, back propagation algorithm, time series, local minima problem, metaheuristic optimization

Procedia PDF Downloads 115
5075 Support Vector Regression with Weighted Least Absolute Deviations

Authors: Kang-Mo Jung

Abstract:

Least squares support vector machine (LS-SVM) is a penalized regression which considers both fitting and generalization ability of a model. However, the squared loss function is very sensitive to even single outlier. We proposed a weighted absolute deviation loss function for the robustness of the estimates in least absolute deviation support vector machine. The proposed estimates can be obtained by a quadratic programming algorithm. Numerical experiments on simulated datasets show that the proposed algorithm is competitive in view of robustness to outliers.

Keywords: least absolute deviation, quadratic programming, robustness, support vector machine, weight

Procedia PDF Downloads 491
5074 Effect of Annealing Temperature on Microstructural Evolution of Nanoindented Cu/Si Thin Films

Authors: Woei-Shyan Lee, Yu-Liang Chuang

Abstract:

The nano-mechanical properties of as-deposited Cu/Si thin films indented to a depth of 2000 nm are investigated using a nanoindentation technique. The nanoindented specimens are annealed at a temperature of either 160 °C or 210°C, respectively. The microstructures of the as-deposited and annealed samples are then examined via transmission electron microscopy (TEM). The results show that both the loading and the unloading regions of the load-displacement curve are smooth and continuous, which suggests that no debonding or cracking occurs during nanoindentation. In addition, the hardness and Young’s modulus of the Cu/Si thin films are found to vary with the nanoindentation depth, and have maximum values of 2.8 GPa and 143 GPa, respectively, at the maximum indentation depth of 2000 nm. The TEM observations show that the region of the Cu/Si film beneath the indenter undergoes a phase transformation during the indentation process. In the case of the as-deposited specimens, the indentation pressure induces a completely amorphous phase within the indentation zone. For the specimens annealed at a temperature of 160°C, the amorphous nature of the microstructure within the indented zone is maintained. However, for the specimens annealed at a higher temperature of 210°C, the indentation affected zone consists of a mixture of amorphous phase and nanocrystalline phase. Copper silicide (η-Cu3Si) precipitates are observed in all of the annealed specimens. The density of the η-Cu3Si precipitates is found to increase with an increasing annealing temperature.

Keywords: nanoindentation, Cu/Si thin films, microstructural evolution, annealing temperature

Procedia PDF Downloads 364
5073 Performance of Non-Deterministic Structural Optimization Algorithms Applied to a Steel Truss Structure

Authors: Ersilio Tushaj

Abstract:

The efficient solution that satisfies the optimal condition is an important issue in the structural engineering design problem. The new codes of structural design consist in design methodology that looks after the exploitation of the total resources of the construction material. In recent years some non-deterministic or meta-heuristic structural optimization algorithms have been developed widely in the research community. These methods search the optimum condition starting from the simulation of a natural phenomenon, such as survival of the fittest, the immune system, swarm intelligence or the cooling process of molten metal through annealing. Among these techniques the most known are: the genetic algorithms, simulated annealing, evolution strategies, particle swarm optimization, tabu search, ant colony optimization, harmony search and big bang crunch optimization. In this study, five of these algorithms are applied for the optimum weight design of a steel truss structure with variable geometry but fixed topology. The design process selects optimum distances and size sections from a set of commercial steel profiles. In the formulation of the design problem are considered deflection limitations, buckling and allowable stress constraints. The approach is repeated starting from different initial populations. The design problem topology is taken from an existing steel structure. The optimization process helps the engineer to achieve good final solutions, avoiding the repetitive evaluation of alternative designs in a time consuming process. The algorithms used for the application, the results of the optimal solutions, the number of iterations and the minimal weight designs, will be reported in the paper. Based on these results, it would be estimated, the amount of the steel that could be saved by applying structural analysis combined with non-deterministic optimization methods.

Keywords: structural optimization, non-deterministic methods, truss structures, steel truss

Procedia PDF Downloads 188
5072 A Genetic Algorithm Based Sleep-Wake up Protocol for Area Coverage in WSNs

Authors: Seyed Mahdi Jameii, Arash Nikdel, Seyed Mohsen Jameii

Abstract:

Energy efficiency is an important issue in the field of Wireless Sensor Networks (WSNs). So, minimizing the energy consumption in this kind of networks should be an essential consideration. Sleep/wake scheduling mechanism is an efficient approach to handling this issue. In this paper, we propose a Genetic Algorithm-based Sleep-Wake up Area Coverage protocol called GA-SWAC. The proposed protocol puts the minimum of nodes in active mode and adjusts the sensing radius of each active node to decrease the energy consumption while maintaining the network’s coverage. The proposed protocol is simulated. The results demonstrate the efficiency of the proposed protocol in terms of coverage ratio, number of active nodes and energy consumption.

Keywords: wireless sensor networks, genetic algorithm, coverage, connectivity

Procedia PDF Downloads 486
5071 An Optimized RDP Algorithm for Curve Approximation

Authors: Jean-Pierre Lomaliza, Kwang-Seok Moon, Hanhoon Park

Abstract:

It is well-known that Ramer Douglas Peucker (RDP) algorithm greatly depends on the method of choosing starting points. Therefore, this paper focuses on finding such starting points that will optimize the results of RDP algorithm. Specifically, this paper proposes a curve approximation algorithm that finds flat points, called essential points, of an input curve, divides the curve into corner-like sub-curves using the essential points, and applies the RDP algorithm to the sub-curves. The number of essential points play a role on optimizing the approximation results by balancing the degree of shape information loss and the amount of data reduction. Through experiments with curves of various types and complexities of shape, we compared the performance of the proposed algorithm with three other methods, i.e., the RDP algorithm itself and its variants. As a result, the proposed algorithm outperformed the others in term of maintaining the original shapes of the input curve, which is important in various applications like pattern recognition.

Keywords: curve approximation, essential point, RDP algorithm

Procedia PDF Downloads 504
5070 A New Dual Forward Affine Projection Adaptive Algorithm for Speech Enhancement in Airplane Cockpits

Authors: Djendi Mohmaed

Abstract:

In this paper, we propose a dual adaptive algorithm, which is based on the combination between the forward blind source separation (FBSS) structure and the affine projection algorithm (APA). This proposed algorithm combines the advantages of the source separation properties of the FBSS structure and the fast convergence characteristics of the APA algorithm. The proposed algorithm needs two noisy observations to provide an enhanced speech signal. This process is done in a blind manner without the need for ant priori information about the source signals. The proposed dual forward blind source separation affine projection algorithm is denoted (DFAPA) and used for the first time in an airplane cockpit context to enhance the communication from- and to- the airplane. Intensive experiments were carried out in this sense to evaluate the performance of the proposed DFAPA algorithm.

Keywords: adaptive algorithm, speech enhancement, system mismatch, SNR

Procedia PDF Downloads 108
5069 A High-Level Co-Evolutionary Hybrid Algorithm for the Multi-Objective Job Shop Scheduling Problem

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a hybrid distributed algorithm has been suggested for the multi-objective job shop scheduling problem. Many new approaches are used at design steps of the distributed algorithm. Co-evolutionary structure of the algorithm and competition between different communicated hybrid algorithms, which are executed simultaneously, causes to efficient search. Using several machines for distributing the algorithms, at the iteration and solution levels, increases computational speed. The proposed algorithm is able to find the Pareto solutions of the big problems in shorter time than other algorithm in the literature. Apache Spark and Hadoop platforms have been used for the distribution of the algorithm. The suggested algorithm and implementations have been compared with results of the successful algorithms in the literature. Results prove the efficiency and high speed of the algorithm.

Keywords: distributed algorithms, Apache Spark, Hadoop, job shop scheduling, multi-objective optimization

Procedia PDF Downloads 333
5068 A Transform Domain Function Controlled VSSLMS Algorithm for Sparse System Identification

Authors: Cemil Turan, Mohammad Shukri Salman

Abstract:

The convergence rate of the least-mean-square (LMS) algorithm deteriorates if the input signal to the filter is correlated. In a system identification problem, this convergence rate can be improved if the signal is white and/or if the system is sparse. We recently proposed a sparse transform domain LMS-type algorithm that uses a variable step-size for a sparse system identification. The proposed algorithm provided high performance even if the input signal is highly correlated. In this work, we investigate the performance of the proposed TD-LMS algorithm for a large number of filter tap which is also a critical issue for standard LMS algorithm. Additionally, the optimum value of the most important parameter is calculated for all experiments. Moreover, the convergence analysis of the proposed algorithm is provided. The performance of the proposed algorithm has been compared to different algorithms in a sparse system identification setting of different sparsity levels and different number of filter taps. Simulations have shown that the proposed algorithm has prominent performance compared to the other algorithms.

Keywords: adaptive filtering, sparse system identification, TD-LMS algorithm, VSSLMS algorithm

Procedia PDF Downloads 323
5067 Implementation of MPPT Algorithm for Grid Connected PV Module with IC and P&O Method

Authors: Arvind Kumar, Manoj Kumar, Dattatraya H. Nagaraj, Amanpreet Singh, Jayanthi Prattapati

Abstract:

In recent years, the use of renewable energy resources instead of pollutant fossil fuels and other forms has increased. Photovoltaic generation is becoming increasingly important as a renewable resource since it does not cause in fuel costs, pollution, maintenance, and emitting noise compared with other alternatives used in power applications. In this paper, Perturb and Observe and Incremental Conductance methods are used to improve energy conversion efficiency under different environmental conditions. PI controllers are used to control easily DC-link voltage, active and reactive currents. The whole system is simulated under standard climatic conditions (1000 W/m2, 250C) in MATLAB and the irradiance is varied from 1000 W/m2 to 300 W/m2. The use of PI controller makes it easy to directly control the power of the grid connected PV system. Finally the validity of the system will be verified through the simulations in MATLAB/Simulink environment.

Keywords: incremental conductance algorithm, modeling of PV panel, perturb and observe algorithm, photovoltaic system and simulation results

Procedia PDF Downloads 479
5066 A Hybrid ICA-GA Algorithm for Solving Multiobjective Optimization of Production Planning Problems

Authors: Omar Ramzi Jasim, Jalal Sultan Ashour

Abstract:

Production Planning or Master Production Schedule (MPS) is a key interface between marketing and manufacturing, since it links customer service directly to efficient use of production resources. Mismanagement of the MPS is considered as one of fundamental problems in operation and it can potentially lead to poor customer satisfaction. In this paper, a hybrid evolutionary algorithm (ICA-GA) is presented, which integrates the merits of both imperialist competitive algorithm (ICA) and genetic algorithm (GA) for solving multi-objective MPS problems. In the presented algorithm, the colonies in each empire has be represented a small population and communicate with each other using genetic operators. By testing on 5 production scenarios, the numerical results of ICA-GA algorithm show the efficiency and capabilities of the hybrid algorithm in finding the optimum solutions. The ICA-GA solutions yield the lower inventory level and keep customer satisfaction high and the required overtime is also lower, compared with results of GA and SA in all production scenarios.

Keywords: master production scheduling, genetic algorithm, imperialist competitive algorithm, hybrid algorithm

Procedia PDF Downloads 442
5065 Effect of Annealing on Electrodeposited ZnTe Thin Films in Non-Aqueous Medium

Authors: Shyam Ranjan Kumar, Shashikant Rajpal

Abstract:

Zinc Telluride (ZnTe) is a binary II-VI direct band gap semiconducting material. This semiconducting material has several applications in sensors, photo-electrochemical devices and photovoltaic solar cell. In this study, Zinc telluride (ZnTe) thin films were deposited on nickel substrate by electrodeposition technique using potentiostat/galvanostat at -0.85 V using AR grade of Zinc Chloride (ZnCl2), Tellurium Tetrachloride (TeCl4) in non-aqueous bath. The developed films were physically stable and showed good adhesion. The as deposited ZnTe films were annealed at 400ºC in air. The solid state properties and optical properties of the as deposited and annealed films were carried out by XRD, EDS, SEM, AFM, UV–Visible spectrophotometer, and photoluminescence spectrophotometer. The diffraction peak observed at 2θ = 49.58° with (111) plane indicate the crystalline nature of ZnTe film. Annealing improves the crystalline nature of the film. Compositional analysis reveals the presence of Zn and Te with tellurium rich ZnTe film. SEM photograph at 10000X shows that grains of film are spherical in nature and densely distributed over the surface. The average roughness of the film is measured by atomic force microscopy and it is nearly equal to 60 nm. The direct wide band gap of 2.12 eV is observed by UV-Vis spectroscopy. Luminescence peak of the ZnTe films are also observed in as deposited and annealed case.

Keywords: annealing, electrodeposition, optical properties, thin film, XRD, ZnTe

Procedia PDF Downloads 161
5064 Design of Chaos Algorithm Based Optimal PID Controller for SVC

Authors: Saeid Jalilzadeh

Abstract:

SVC is one of the most significant devices in FACTS technology which is used in parallel compensation, enhancing the transient stability, limiting the low frequency oscillations and etc. designing a proper controller is effective in operation of svc. In this paper the equations that describe the proposed system have been linearized and then the optimum PID controller has been designed for svc which its optimal coefficients have been earned by chaos algorithm. Quick damping of oscillations of generator is the aim of designing of optimum PID controller for svc whether the input power of generator has been changed suddenly. The system with proposed controller has been simulated for a special disturbance and the dynamic responses of generator have been presented. The simulation results showed that a system composed with proposed controller has suitable operation in fast damping of oscillations of generator.

Keywords: chaos, PID controller, SVC, frequency oscillation

Procedia PDF Downloads 419
5063 An Algorithm for Herding Cows by a Swarm of Quadcopters

Authors: Jeryes Danial, Yosi Ben Asher

Abstract:

Algorithms for controlling a swarm of robots is an active research field, out of which cattle herding is one of the most complex problems to solve. In this paper, we derive an independent herding algorithm that is specifically designed for a swarm of quadcopters. The algorithm works by devising flight trajectories that cause the cows to run-away in the desired direction and hence herd cows that are distributed in a given field towards a common gathering point. Unlike previously proposed swarm herding algorithms, this algorithm does not use a flocking model but rather stars each cow separately. The effectiveness of this algorithm is verified experimentally using a simulator. We use a special set of experiments attempting to demonstrate that the herding times of this algorithm correspond to field diameter small constant regardless of the number of cows in the field. This is an optimal result indicating that the algorithm groups the cows into intermediate groups and herd them as one forming ever closing bigger groups.

Keywords: swarm, independent, distributed, algorithm

Procedia PDF Downloads 147
5062 A Review Paper on Data Mining and Genetic Algorithm

Authors: Sikander Singh Cheema, Jasmeen Kaur

Abstract:

In this paper, the concept of data mining is summarized and its one of the important process i.e KDD is summarized. The data mining based on Genetic Algorithm is researched in and ways to achieve the data mining Genetic Algorithm are surveyed. This paper also conducts a formal review on the area of data mining tasks and genetic algorithm in various fields.

Keywords: data mining, KDD, genetic algorithm, descriptive mining, predictive mining

Procedia PDF Downloads 565
5061 Optimum Design of Grillage Systems Using Firefly Algorithm Optimization Method

Authors: F. Erdal, E. Dogan, F. E. Uz

Abstract:

In this study, firefly optimization based optimum design algorithm is presented for the grillage systems. Naming of the algorithm is derived from the fireflies, whose sense of movement is taken as a model in the development of the algorithm. Fireflies’ being unisex and attraction between each other constitute the basis of the algorithm. The design algorithm considers the displacement and strength constraints which are implemented from LRFD-AISC (Load and Resistance Factor Design-American Institute of Steel Construction). It selects the appropriate W (Wide Flange)-sections for the transverse and longitudinal beams of the grillage system among 272 discrete W-section designations given in LRFD-AISC so that the design limitations described in LRFD are satisfied and the weight of the system is confined to be minimal. Number of design examples is considered to demonstrate the efficiency of the algorithm presented.

Keywords: firefly algorithm, steel grillage systems, optimum design, stochastic search techniques

Procedia PDF Downloads 396
5060 Effect of Quenching Medium on the Hardness of Dual Phase Steel Heat Treated at a High Temperature

Authors: Tebogo Mabotsa, Tamba Jamiru, David Ibrahim

Abstract:

Dual phase(DP) steel consists essentially of fine grained equiaxial ferrite and a dispersion of martensite. Martensite is the primary precipitate in DP steels, it is the main resistance to dislocation motion within the material. The objective of this paper is to present a relation between the intercritical annealing holding time and the hardness of a dual phase steel. The initial heat treatment involved heating the specimens to 1000oC and holding the sample at that temperature for 30 minutes. After the initial heat treatment, the samples were heated to 770oC and held for a varying amount of time at constant temperature. The samples were held at 30, 60, and 90 minutes respectively. After heating and holding the samples at the austenite-ferrite phase field, the samples were quenched in water, brine, and oil for each holding time. The experimental results proved that an equation for predicting the hardness of a dual phase steel as a function of the intercritical holding time is possible. The relation between intercritical annealing holding time and hardness of a dual phase steel heat treated at high temperatures is parabolic in nature. Theoretically, the model isdependent on the cooling rate because the model differs for each quenching medium; therefore, a universal hardness equation can be derived where the cooling rate is a variable factor.

Keywords: quenching medium, annealing temperature, dual phase steel, martensite

Procedia PDF Downloads 57
5059 Enhancing Power Conversion Efficiency of P3HT/PCBM Polymer Solar Cells

Authors: Nidal H. Abu-Zahra, Mahmoud Algazzar

Abstract:

In this research, n-dodecylthiol was added to P3HT/PC70BM polymer solar cells to improve the crystallinity of P3HT and enhance the phase separation of P3HT/PC70BM. The improved crystallinity of P3HT/PC70BM doped with 0-5% by volume of n-dodecylthiol resulted in improving the power conversion efficiency of polymer solar cells by 33%. In addition, thermal annealing of the P3HT/PC70MB/n-dodecylthiolcompound showed further improvement in crystallinity with n-dodecylthiol concentration up to 2%. The highest power conversion efficiency of 3.21% was achieved with polymer crystallites size L of 11.2nm, after annealing at 150°C for 30 minutes under a vacuum atmosphere. The smaller crystallite size suggests a shorter path of the charge carriers between P3HT backbones, which could be beneficial to getting a higher short circuit current in the devices made with the additive.

Keywords: n-dodecylthiol, congugated PSC, P3HT/PCBM, polymer solar cells

Procedia PDF Downloads 255
5058 Presenting a Job Scheduling Algorithm Based on Learning Automata in Computational Grid

Authors: Roshanak Khodabakhsh Jolfaei, Javad Akbari Torkestani

Abstract:

As a cooperative environment for problem-solving, it is necessary that grids develop efficient job scheduling patterns with regard to their goals, domains and structure. Since the Grid environments facilitate distributed calculations, job scheduling appears in the form of a critical problem for the management of Grid sources that influences severely on the efficiency for the whole Grid environment. Due to the existence of some specifications such as sources dynamicity and conditions of the network in Grid, some algorithm should be presented to be adjustable and scalable with increasing the network growth. For this purpose, in this paper a job scheduling algorithm has been presented on the basis of learning automata in computational Grid which the performance of its results were compared with FPSO algorithm (Fuzzy Particle Swarm Optimization algorithm) and GJS algorithm (Grid Job Scheduling algorithm). The obtained numerical results indicated the superiority of suggested algorithm in comparison with FPSO and GJS. In addition, the obtained results classified FPSO and GJS in the second and third position respectively after the mentioned algorithm.

Keywords: computational grid, job scheduling, learning automata, dynamic scheduling

Procedia PDF Downloads 314
5057 A Multi-Objective Evolutionary Algorithm of Neural Network for Medical Diseases Problems

Authors: Sultan Noman Qasem

Abstract:

This paper presents an evolutionary algorithm for solving multi-objective optimization problems-based artificial neural network (ANN). The multi-objective evolutionary algorithm used in this study is genetic algorithm while ANN used is radial basis function network (RBFN). The proposed algorithm named memetic elitist Pareto non-dominated sorting genetic algorithm-based RBFNN (MEPGAN). The proposed algorithm is implemented on medical diseases problems. The experimental results indicate that the proposed algorithm is viable, and provides an effective means to design multi-objective RBFNs with good generalization capability and compact network structure. This study shows that MEPGAN generates RBFNs coming with an appropriate balance between accuracy and simplicity, comparing to the other algorithms found in literature.

Keywords: radial basis function network, hybrid learning, multi-objective optimization, genetic algorithm

Procedia PDF Downloads 533
5056 Utilizing Reflection as a Tool for Experiential Learning through a Simulated Activity

Authors: Nadira Zaidi

Abstract:

The aim of this study is to gain direct feedback of interviewees in a simulated interview process. Reflection based on qualitative data analysis has been utilized through the Gibbs Reflective Cycle, with 30 students as respondents at the Undergraduate level. The respondents reflected on the positive and negative aspects of this active learning process in order to increase their performance in actual job interviews. Results indicate that students engaged in the process successfully imbibed the feedback that they received from the interviewers and also identified the areas that needed improvement.

Keywords: experiential learning, positive and negative impact, reflection, simulated

Procedia PDF Downloads 114
5055 Structural and Magnetic Properties of CoFe2O4:Nd3+/Dy3+/Pr3+/Gd3+ Nanoparticles Synthesized by Starch-Assisted Sol-Gel Auto-Combustion Method and Annealing Effect

Authors: Raghvendra Singh Yadav, Ivo Kuřitka, Jaromir Havlica, Zuzana Kozakova, Jiri Masilko, Lukas Kalina, Miroslava Hajdúchová, Vojtěch Enev, Jaromir Wasserbauer

Abstract:

In this work, we investigated the structural and magnetic properties of CoFe2O4:Nd3+/Dy3+/Pr3+/Gd3+ nanoparticles synthesized by starch-assisted sol-gel combustion method. X-ray diffraction pattern confirmed the formation of cubic spinel structure of rare-earth ions (Nd3+, Dy3+, Pr3+, Gd3+) doped CoFe2O4 spinel ferrite nanoparticles. Raman and Fourier Transform Infrared spectroscopy study also confirmed cubic spinel structure of rare-earth ions (Nd3+, Dy3+, Pr3+, Gd3+) substituted CoFe2O4 nanoparticles. The field emission scanning electron microscopy study revealed the effect of annealing temperature on size of rare-earth ions (Nd3+, Dy3+, Pr3+, Gd3+) substituted CoFe2O4 nanoparticles and particles were in the range of 10-100 nm. The magnetic properties of rare-earth ions (Nd3+, Dy3+, Pr3+, Gd3+) substituted CoFe2O4 nanoparticles were investigated by using vibrating sample magnetometer. The variation in saturation magnetization, coercivity and remanent magnetization with annealing temperature/ particle size of rare-earth ions (Nd3+, Dy3+, Pr3+, Gd3+) substituted CoFe2O4 nanoparticles was observed. Acknowledgment: This work was supported by the Ministry of Education, Youth and Sports of the Czech Republic – Program NPU I (LO1504).

Keywords: starch, sol-gel combustion method, rare-earth ions, spinel ferrite nanoparticles, magnetic properties

Procedia PDF Downloads 328
5054 Microwave Assisted Growth of Varied Phases and Morphologies of Vanadium Oxides Nanostructures: Structural and Optoelectronic Properties

Authors: Issam Derkaoui, Mohammed Khenfouch, Bakang M. Mothudi, Malik Maaza, Izeddine Zorkani, Anouar Jorio

Abstract:

Transition metal oxides nanoparticles with different morphologies have attracted a lot of attention recently owning to their distinctive geometries, and demonstrated promising electrical properties for various applications. In this paper, we discuss the time and annealing effects on the structural and electrical properties of vanadium oxides nanoparticles (VO-NPs) prepared by microwave method. In this sense, transmission electron microscopy (TEM), X-ray diffraction (XRD), Raman Spectroscopy, Ultraviolet-visible absorbance spectra (Uv-Vis) and electrical conductivity were investigated. Hence, the annealing state and the time are two crucial parameters for the improvement of the optoelectronic properties. The use of these nanostructures is promising way for the development of technological applications especially for energy storage devices.

Keywords: Vanadium oxide, Microwave, Electrical conductivity, Optoelectronic properties

Procedia PDF Downloads 165
5053 A Hybrid Tabu Search Algorithm for the Multi-Objective Job Shop Scheduling Problems

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a hybrid Tabu Search (TS) algorithm is suggested for the multi-objective job shop scheduling problems (MO-JSSPs). The algorithm integrates several shifting bottleneck based neighborhood structures with the Giffler & Thompson algorithm, which improve efficiency of the search. Diversification and intensification are provided with local and global left shift algorithms application and also new semi-active, active, and non-delay schedules creation. The suggested algorithm is tested in the MO-JSSPs benchmarks from the literature based on the Pareto optimality concept. Different performances criteria are used for the multi-objective algorithm evaluation. The proposed algorithm is able to find the Pareto solutions of the test problems in shorter time than other algorithm of the literature.

Keywords: tabu search, heuristics, job shop scheduling, multi-objective optimization, Pareto optimality

Procedia PDF Downloads 414
5052 Microstructures Evolution of a Nano/Ultrafine Grained Low Carbon Steel Produced by Martensite Treatment Using Accumulative Roll Bonding

Authors: Mehdi Salari

Abstract:

This work introduces a new experimental method of martensite treatment contains accumulative roll-bonding used for producing the nano/ultrafine grained structure in low carbon steel. The ARB process up to 4 cycles was performed under unlubricated conditions, while the annealing process was carried out in the temperature range of 450–550°C for 30–100 min. The microstructures of the deformed and annealed specimens were investigated. The results showed that in the annealed specimen at 450°C for 30 or 60 min, recrystallization couldn’t be completed. Decrease in time and temperature intensified the volume fraction of the martensite cell blocks. Fully equiaxed nano/ultrafine grained ferrite was developed from the martensite cell blocks during the annealing at temperature around 500°C for 100 min.

Keywords: martensite process, accumulative roll bonding, recrystallization, nanostructure, plain carbon steel

Procedia PDF Downloads 350
5051 A Learning-Based EM Mixture Regression Algorithm

Authors: Yi-Cheng Tian, Miin-Shen Yang

Abstract:

The mixture likelihood approach to clustering is a popular clustering method where the expectation and maximization (EM) algorithm is the most used mixture likelihood method. In the literature, the EM algorithm had been used for mixture regression models. However, these EM mixture regression algorithms are sensitive to initial values with a priori number of clusters. In this paper, to resolve these drawbacks, we construct a learning-based schema for the EM mixture regression algorithm such that it is free of initializations and can automatically obtain an approximately optimal number of clusters. Some numerical examples and comparisons demonstrate the superiority and usefulness of the proposed learning-based EM mixture regression algorithm.

Keywords: clustering, EM algorithm, Gaussian mixture model, mixture regression model

Procedia PDF Downloads 478