Active Processor Scheduling Using Evolution Algorithms

The allocation of processes to processors has long been of interest to engineers. The processor allocation problem considered here assigns multiple applications onto a computing system. With this algorithm researchers could more efficiently examine real-time sensor data like that used by United States Air Force digital signal processing efforts or real-time aerosol hazard detection as examined by the Department of Homeland Security. Different choices for the design of a load balancing algorithm are examined in both the problem and algorithm domains. Evolutionary algorithms are used to find near-optimal solutions. These algorithms incorporate multiobjective coevolutionary and parallel principles to create an effective and efficient algorithm for real-world allocation problems. Three evolutionary algorithms (EA) are developed. The primary algorithm generates a solution to the processor allocation problem. This allocation EA is capable of evaluating objectives in both an aggregate single objective and a Pareto multiobjective manner. The other two EAs are designed for fine turning returned allocation EA solutions. One coevolutionary algorithm is used to optimize the parameters of the allocation algorithm. This meta-EA is parallelized using a coarse-grain approach to improve performance. Experiments are conducted that validate the improved effectiveness of the parallelized algorithm. Pareto multiobjective approach is used to optimize both effectiveness and efficiency objectives. The other coevolutionary algorithm generates difficult allocation problems for testing the capabilities of the allocation EA. The effectiveness of both coevolutionary algorithms for optimizing the allocation EA is examined quantitatively using standard statistical methods. Also the allocation EAs objective tradeoffs are analyzed and compared

Estimation of Stator Resistance and Rotor Flux Linkage in SPMSM Using CLPSO with Opposition-Based-Learning Strategy

Electromagnetic parameters are important for controller design and condition monitoring of permanent magnet synchronous machine (PMSM) system. In this paper, an improved comprehensive learning particle swarm optimization (CLPSO) with opposition-based-learning (OBL) strategy is proposed for estimating stator resistance and rotor flux linkage in surface-mounted PMSM; the proposed method is referred to as CLPSO-OBL. In the CLPSO-OBL framework, an opposition-learning strategy is used for best particles reinforcement learning to improve the dynamic performance and global convergence ability of the CLPSO. The proposed parameter optimization not only retains the advantages of diversity in the CLPSO but also has inherited global exploration capability of the OBL. Then, the proposed method is applied to estimate the stator resistance and rotor flux linkage of surface-mounted PMSM. The experimental results show that the CLPSO-OBL has better performance in estimating winding resistance and PM flux compared to the existing peer PSOs. Furthermore, the proposed parameter estimation model and optimization method are simple and with good accuracy, fast convergence, and easy digital implementation

Knowledge management overview of feature selection problem in high-dimensional financial data: Cooperative co-evolution and Map Reduce perspectives

The term big data characterizes the massive amounts of data generation by the advanced technologies in different domains using 4Vs volume, velocity, variety, and veracity-to indicate the amount of data that can only be processed via computationally intensive analysis, the speed of their creation, the different types of data, and their accuracy. High-dimensional financial data, such as time-series and space-Time data, contain a large number of features (variables) while having a small number of samples, which are used to measure various real-Time business situations for financial organizations. Such datasets are normally noisy, and complex correlations may exist between their features, and many domains, including financial, lack the al analytic tools to mine the data for knowledge discovery because of the high-dimensionality. Feature selection is an optimization problem to find a minimal subset of relevant features that maximizes the classification accuracy and reduces the computations. Traditional statistical-based feature selection approaches are not adequate to deal with the curse of dimensionality associated with big data. Cooperative co-evolution, a meta-heuristic algorithm and a divide-And-conquer approach, decomposes high-dimensional problems into smaller sub-problems. Further, MapReduce, a programming model, offers a ready-To-use distributed, scalable, and fault-Tolerant infrastructure for parallelizing the developed algorithm. This article presents a knowledge management overview of evolutionary feature selection approaches, state-of-The-Art cooperative co-evolution and MapReduce-based feature selection techniques, and future research directions

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Learning with a network of competing synapses

Competition between synapses arises in some forms of correlation-based plasticity. Here we propose a game theory-inspired model of synaptic interactions whose dynamics is driven by competition between synapses in their weak and strong states, which are characterized by different timescales. The learning of inputs and memory are meaningfully definable in an effective description of networked synaptic populations. We study, numerically and analytically, the dynamic responses of the effective system to various signal types, particularly with reference to an existing empirical motor adaptation model. The dependence of the system-level behavior on the synaptic parameters, and the signal strength, is brought out in a clear manner, thus illuminating issues such as those of optimal performance, and the functional role of multiple timescales.Comment: 16 pages, 9 figures; published in PLoS ON

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

Diagnosing Hepatitis Using Hybrid Fuzzy-CBR

The Malaysia populations are currently estimated to be 28.9 million with a number of medical specialists is 2,500 and 20,280 doctors. This ratio figures to cause patients need to wait longer in government hospitals and clinics before they can meet doctor or medical specialist. In order to resolve this problem, Ministry of Health has pledged to reduce waiting time of patient examination from 45 minutes to 30 minutes by provide allocation of large budget to the medical sector. This budget will be used either to buy new equipment, which can work with large capacity or upgrade the old equipment to work faster or build the new hospital to tend more patients or hire other doctors from overseas. Due to that reason and the coming which World Hepatitis Day on 28 July 2012, this study proposes a the use of hybrid intelligent, which combine Fuzzy Logic and Case-Based Reasoning (CBR) approach that could be integrated in the diagnosis system to classify patient condition by using fuzzy technique and similarity measurement based on current symptoms of a hepatitis patient. Focus of this study is to develop an automated decision support system that can be used by the doctors to accelerate diagnosis processing. As a result, a prototype called Intelligent Medical Decision Support System (IMDSS) using Fuzzy-CBR engine for diagnosis purposes has been developed, validated and evaluated in this study. The finding through validation and evaluation phase indicates that IMDSS is reliable in assisting doctors during the diagnosis process. In fact, the diagnosis of a patient has become easier than the manual process and easy to use