27 research outputs found

    Sensorless control of DC drive using artificial neural network

    Get PDF
    DOI nefunkčníThe paper deals with the application of an artificial neural network in the speed control of the DC drive without a speed sensor. The sensorless control structure of the DC drive contains the feedforward artificial neural network for speed estimation. The sensorless DC drive was simulated in program Matlab with Simulink toolbox. The main goal was to find the simplest artificial neural network structure with minimum number of neurons, but simultaneously good control characteristics are required. Despite the used neural network, which is very simple, it was achieved satisfactory results. The simulation results were confirmed by measurement of important quantities on a laboratory stand with the DC drive.Web of Science111020

    Similarity analysis of EEG data based on self organizing map neural network

    Get PDF
    The Electroencephalography (EEG) is the recording of electrical activity along the scalp. This recorded data are very complex. EEG has a big role in several applications such as in the diagnosis of human brain diseases and epilepsy. Also, we can use the EEG signals to control an external device via Brain Computer Interface (BCI) by our mind. There are many algorithms to analyse the recorded EEG data, but it still remains one of the big challenges in the world. In this article, we extended our previous proposed method. Our extended method uses Self-organizing Map (SOM) as an EEG data classifier. The proposed method we can divide in following steps: capturing EEG raw data from the sensors, applying filters on this data, we will use the frequencies in the range from 0.5~Hz to 60~Hz, smoothing the data with 15-th order of Polynomial Curve Fitting, converting filtered data into text using Turtle Graphic, Lempel-Ziv complexity for measuring similarity between two EEG data trials and Self-Organizing Map Neural Network as a final classifiers. The experiment results show that our model is able to detect up to 96% finger movements correctly

    Do evolutionary algorithms indeed require random numbers? Extended study

    Get PDF
    An inherent part of evolutionary algorithms, that are based on Darwin theory of evolution and Mendel theory of genetic heritage, are random processes. In this participation, we discuss whether are random processes really needed in evolutionary algorithms. We use n periodic deterministic processes instead of random number generators and compare performance of evolutionary algorithms powered by those processes and by pseudo-random number generators. Deterministic processes used in this participation are based on deterministic chaos and are used to generate periodical series with different length. Results presented here are numerical demonstration rather than mathematical proofs. We propose that a certain class of deterministic processes can be used instead of random number generators without lowering of evolutionary algorithms performance. © Springer International Publishing Switzerland 2013

    Partitioning networks into cliques: a randomized heuristic approach

    Get PDF
    In the context of community detection in social networks, the term community can be grounded in the strict way that simply everybody should know each other within the community. We consider the corresponding community detection problem. We search for a partitioning of a network into the minimum number of non-overlapping cliques, such that the cliques cover all vertices. This problem is called the clique covering problem (CCP) and is one of the classical NP-hard problems. For CCP, we propose a randomized heuristic approach. To construct a high quality solution to CCP, we present an iterated greedy (IG) algorithm. IG can also be combined with a heuristic used to determine how far the algorithm is from the optimum in the worst case. Randomized local search (RLS) for maximum independent set was proposed to find such a bound. The experimental results of IG and the bounds obtained by RLS indicate that IG is a very suitable technique for solving CCP in real-world graphs. In addition, we summarize our basic rigorous results, which were developed for analysis of IG and understanding of its behavior on several relevant graph classes

    Chaos enhanced differential evolution in the task of evolutionary control of selected set of discrete chaotic systems

    Get PDF
    Evolutionary technique differential evolution (DE) is used for the evolutionary tuning of controller parameters for the stabilization of set of different chaotic systems. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used also as the chaotic pseudorandom number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. The optimizations were performed for three different chaotic systems, two types of case studies and developed cost functions.Web of Science2014art. no. 83648

    Chaos enhanced differential evolution in the task of evolutionary control of selected set of discrete chaotic systems

    Get PDF
    Evolutionary technique differential evolution (DE) is used for the evolutionary tuning of controller parameters for the stabilization of set of different chaotic systems. The novelty of the approach is that the selected controlled discrete dissipative chaotic system is used also as the chaotic pseudorandom number generator to drive the mutation and crossover process in the DE. The idea was to utilize the hidden chaotic dynamics in pseudorandom sequences given by chaotic map to help differential evolution algorithm search for the best controller settings for the very same chaotic system. The optimizations were performed for three different chaotic systems, two types of case studies and developed cost functions.Grant Agency of the Czech Republic [GACR P103/13/08195S]; Grant of SGS [SP2014/159, SP2014/170]; VSB-Technical University of Ostrava, Czech Republic; Development of Human Resources in Research and Development of Latest Soft Computing Methods and Their Application in Practice Project - Operational Programme Education for Competitiveness [CZ.1.07/2.3.00/20.0072]; ESF; budget of the Czech Republic; European Regional Development Fund under the Project CEBIA-Tech [CZ.1.05/2.1.00/03.0089]; Internal Grant Agency of Tomas Bata University [IGA/FAI/2014/010

    Exploring the Integration of Agent-Based Modelling, Process Mining, and Business Process Management through a Text Analytics–Based Literature Review

    Get PDF
    Agent-based modelling and business process management are two interrelated yet distinct concepts. To explore the relationship between these two fields, we conducted a systematic literature review to investigate existing methods and identify research gaps in the integration of agent-based modelling, process mining, and business process management. Our search yielded 359 research papers, which were evaluated using predefined criteria and quality measures. This resulted in a final selection of forty-two papers. Our findings reveal several research gaps, including the need for enhanced validation methods, the modelling of complex agents and environments, and the integration of process mining and business process management with emerging technologies. Existing agent-based approaches within process mining and business process management have paved the way for identifying the validation methods for performance evaluation. The addressed research gaps primarily concern validation before delving deeper into specific research topics. These include improved validation methods, modelling of complex agents and environments, and a preliminary exploration of integrating process mining and business process management with emerging technologies
    corecore