Search
displaying 1000 best results Help
Search results for: ELLIPSE-FITTING ALGORITHM
-
Selection of energy storage units by genetic algorithm for mitigating voltage deviations
PublicationIn recent years, energy storage units have become very popular. They are applied both for economic and technical purposes. Unfortunately, the cost of such devices is still high and selecting their proper location and rated power have to be performed precisely. In this paper, a Genetic-Algorithm-based optimization method for selecting the best configuration of energy storage units in the power network is proposed. The presented...
-
Neural modelling of dynamic systems with time delays based on an adjusted NEAT algorithm
PublicationA problem related to the development of an algorithm designed to find an architecture of artificial neural network used for black-box modelling of dynamic systems with time delays has been addressed in this paper. The proposed algorithm is based on a well-known NeuroEvolution of Augmenting Topologies (NEAT) algorithm. The NEAT algorithm has been adjusted by allowing additional connections within an artificial neural network and...
-
Electronic nose algorithm design using classical system identification for odour intensity detection
PublicationThe two elements considered crucial for constructing an efficient environmental odour intensity monitoring systems are sensors and algorithms typically addressed to as electronic nose sensor (e-nose). Due to operational complexity of biochemical sensors developed in human bodies algorithms based on computational methods of artificial intelligence are typically considered superior to classical model based approaches in development...
-
A new optimal algorithm for a time-dependent scheduling problem
PublicationIn this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j_1, ..., j_n and the processing time pi of the i-th job is given by p_i = 1 + b_is_i, where si is the starting time of the i-th job, i = 1, ..., n. If all jobs have different and non-zero deterioration rates and bi > bj => bi >= (b_min+1)/(b_min) b_j + 1/b_min, where b_min = min{b_i}, then...
-
FPGA computation of magnitude of complex numbers using modified CORDIC algorithm
PublicationIn this work we present computation of the magnitude of complex numbers using a modified version of the CORDIC algorithm that uses only five iterations. The relationship between the computation error and the number of CORDIC iterations are presented for floating-point and integer arithmetics. The proposed modification of CORDIC for integer arithmetic relies upon the introduction of correction once basic computations are performed...
-
Smart Virtual Bass Synthesis Algorithm Based on Music Genre Classification
PublicationThe aim of this paper is to present a novel approach to the Virtual Bass Synthesis (VBS) algorithms applied to portable computers. The proposed algorithm employed automatic music genre recognition to determine the optimum parameters for the synthesis of additional frequencies. The synthesis was carried out using the non-linear device (NLD) and phase vocoder (PV) methods depending on the music excerpt genre. Classification of musical...
-
Interference aware bluetooth scatternet (re)configuration algorithm IBLUERA
PublicationThis paper presents a new algorithm IBLUEREA, which enables reconfiguration of Bluetooth scatternet to reduce interference. IBLUEREA makes use of the complex model comparing ISM environment efficiency. The mechanism envisages the use of the assessment of the probability of successful (unsuccessful) frame transmission in order to take a decision concerning co-existence of technologies which make use of the same ISM band (here Bluetooth...
-
Evolutionary Algorithm for Selecting Dynamic Signatures Partitioning Approach
PublicationIn the verification of identity, the aim is to increase effectiveness and reduce involvement of verified users. A good compromise between these issues is ensured by dynamic signature verification. The dynamic signature is represented by signals describing the position of the stylus in time. They can be used to determine the velocity or acceleration signal. Values of these signals can be analyzed, interpreted, selected, and compared....
-
An algorithm for enhancing macromodeling in finite element analysis of waveguide components
PublicationAn algorithm for enhancing the finite element method with local model order reduction is presented. The proposed technique can be used in fast frequency domain simulation of waveguide components and resonators. The local reduction process applied to cylindrical subregions is preceded by compression of the number of variables on its boundary. As a result,the finite element large system is converted into a very compact set of linear...
-
Convergence of Monte Carlo algorithm for solving integral equations in light scattering simulations
PublicationThe light scattering process can be modeled mathematically using the Fredholm integral equation. This equation is usually solved after its discretization and transformation into the system of algebraic equations. Volume integral equations can be also solved without discretization using the Monte Carlo (MC) algorithm, but its application to the light scattering simulations has not been sufficiently studied. Here we present implementation...
-
Sensorless algorithm for sustaining controllability of IPMSM drive in electric vehicle after resolver fault
PublicationThis paper presents a sensorless algorithm designated for the emergency control of an interior permanent magnet synchronous motor (IPMSM) drive in electric or hybrid vehicle. The algorithm is based on analysing the derivatives of motor phase currents measured over the duration of particular inverter states. The method is computationally simple and does not require additional hardware since the derivatives are measured indirectly....
-
An Optimal Power Point Tracking Algorithm in a Solar PV Generation System
PublicationThe non-linearity in I-V characteristics of a PV panel requires to be operated at knee point to extract maximum power. In order to operate the panel at optimal point, maximum power point tracking (MPPT) algorithm is employed in the control structure. The main objective of MPP tracking is to keep the operation at knee point of I-V characteristics under varying condition of temperature and solar insolation. Under non uniform solar...
-
Improved magnitude estimation of complex numbers using alpha max and beta min algorithm
PublicationThe paper presents an improved algorithm for calculating the magnitude of complex numbers. This problem, which is a special case of square rooting, occurs for example, in FFT processors and complex FIR filters. The proposed method of magnitude calculation makes use of the modified alpha max and beta min algorithm. The improved version of the algorithm allows to control the maximum magnitude approximation error by using an adequate...
-
Updating the Coupling Algorithm between HYDRUS and MODFLOW in the HYDRUS Package for MODFLOW
PublicationThe HYDRUS-based flow package for MODFLOW (the HPM or the HYDRUS package) is an existing unsaturated zone flow package for MODFLOW. In MODFLOW with the HPM, the groundwater modeling domain is discretized into regular grids that can be combined into multiple zones based on similarities in soil hydrology, topographical characteristics, and the depth to the groundwater. Each of these zones is assigned one unsaturated soil profile...
-
Feature type and size selection for adaboost face detection algorithm
PublicationThe article presents different sets of Haar-like features defined for adaptive boosting (AdaBoost) algorithm for face detection. Apart from a simple set of pixel intensity differences between horizontally or vertically neighboring rectangles, the features based on rotated rectangles are considered. Additional parameter that limits the area on which the features are calculated is also introduced. The experiments carried out on...
-
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublicationThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
Interference aware Bluetooth scatternet (Re)configuration algorithm IBLUEREA
PublicationThe paper presents a new algorithm IBLUEREA, which enables reconfiguration of Bluetooth (BT) scatternet to reduce mutual interferences between BT and Wi-Fi (IEEE 802.11b) networks operating on the same area. IBLUEREA makes use of proposed procedure for modelling ISM environment around a given BT scatternet. The mechanism is based on estimation of the probabilities of successful (unsuccessful) frame transmissions. This determination...
-
Central heating temperature control algorithm for systems with condensing boilers
PublicationThe problem of control of a central heating system in a small residence is considered. It is assumed that the system is based on a condensing boiler. Since the boiler efficiency depends on a returning water temperature, the proposed control goal is to provide proper air temperature in the residence as well as the lowest possible water temperature. The proposed algorithm is applied to two buildings. Both of them have the same heating...
-
Comparison of Single and Multi-Population Evolutionary Algorithm for Path Planning in Navigation Situation
PublicationIn this paper a comparison of single and multi-population evolutionary algorithm is presented. Tested algorithms are used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. Principle of operation of single-population and multi-population evolutionary algorithm is described....
-
Path planning algorithm for ship collisions avoidance in environment with changing strategy of dynamic obstacles
PublicationIn this paper a path planning algorithm for the ship collision avoidance is presented. Tested algorithm is used to determine close to optimal ship paths taking into account changing strategy of dynamic obstacles. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. Principle of operation of evolutionary algorithm and based on it dedicated application...
-
Prediction based on integration of Decisional DNA and a feature selection algorithm Relief-F
PublicationThe paper presents prediction model based on Decisional DNA and Set of experienced integrated with Relief_F algorithm for feature selection
-
APPLICATION OF APRIORI ALGORITHM IN THE LAMINATION PROCESS IN YACHT PRODUCTION
PublicationThe article specifies the dependence of defects occurring in the lamination process in the production of yachts. Despite great knowledge about their genesis, they cannot be completely eliminated. Authentic data obtained through cooperation with one of the Polish yacht shipyards during the years 2013–2017 were used for the analysis. To perform a simulation, the sample size was observed in 1450 samples, consisting of 6 models of...
-
Application of the Monte Carlo algorithm for solving volume integral equation in light scattering simulations
PublicationVarious numerical methods were proposed for analysis of the light scattering phenomenon. Important group of these methods is based on solving the volume integral equation describing the light scattering process. The popular method from this group is the discrete dipole approximation (DDA). DDA uses various numerical algorithms to solve the discretized integral equation. In the recent years, the application of the Monte Carlo (MC)...
-
Non-Least Square GNSS Positioning Algorithm for Densely Urbanized Areas
PublicationThe paper introduces an essentially new algorithm for calculating the GNSS position as an alternative to the least-square method. The proposed approach can be widely applied to any positioning method that uses multiple position lines for position calculation and is an example ofhow using a numerical solution can improve position accuracy without access to historical data. In essence, the method is based on the adaptation of the...
-
Performance of Watermarking-based DTD Algorithm Under Time-varying Echo Path Conditions
PublicationA novel double-talk detection (DTD) algorithm based on techniques similar to those used for audio signal watermarking was introduced by the authors. The application of the described DTD algorithm within acoustic echo cancellation system is presented. The problem of DTD robustness to time-varying conditions of acoustic echo path is discussed and explanation as to why such conditions occur in practical situations is provided. The...
-
Robustness analysis of watermarking-based dtd algorithm under time-variable echo conditions
PublicationA novel double-talk detection (DTD) algorithm based on techniques similar to those used for audio signal watermarking was introduced by the authors. The application of the described DTD algorithm within acoustic echo cancellation system is presented. The problem of DTD robustness to time-varying conditions of acoustic echo path is discussed and explanation as to why such conditions occur in practical situations is provided. The...
-
Implementation of the FOPID Algorithm in the PLC Controller - PWR Thermal Power Control Case Study
PublicationIn the paper authors describe proposition of design and verification procedures of the discrete Fractional Order PID (FOPID) algorithm for control of the Pressurized Water Reactor (PWR) thermal power near its nominal operating point. The FOPID algorithm synthesis consists of: off-line optimal tunning of its parameters in continuous time-domain with LQ (Linear Quadratic) performance index and simplified models of nuclear reactor...
-
Numerically efficient algorithm for compact microwave device optimization with flexible sensitivity updating scheme
PublicationAn efficient trust-region algorithm with flexible sensitivity updating management scheme for electromagnetic (EM)-driven design optimization of compact microwave components is proposed. During the optimization process, updating of selected columns of the circuit response Jacobian is performed using a rank-one Broyden formula (BF) replacing finite differentiation (FD). The FD update is omitted for directions sufficiently well aligned...
-
Reinforcement Learning Algorithm and FDTD-based Simulation Applied to Schroeder Diffuser Design Optimization
PublicationThe aim of this paper is to propose a novel approach to the algorithmic design of Schroeder acoustic diffusers employing a deep learning optimization algorithm and a fitness function based on a computer simulation of the propagation of acoustic waves. The deep learning method employed for the research is a deep policy gradient algorithm. It is used as a tool for carrying out a sequential optimization process the goal of which is...
-
An Improvement of Global Complex Roots and Poles Finding Algorithm for Propagation and Radiation Problems
PublicationAn improvement of the recently developed global roots finding algorithm has been proposed. The modification allows to shorten the computational time by reducing the number of function calls. Moreover, both versions of the algorithms (standard and modified) have been tested for numerically defined functions obtained from spectral domain approach and field matching method. The tests have been performed for three simple microwave...
-
An optimal sliding mode control based on immune-wavelet algorithm for underwater robotic manipulator
PublicationIn this paper, a robust optimal Sliding Mode Controller (SMC) based on new algorithm of Artificial Immune System (AIS) is proposed for trajectory tracking of underwater manipulators. A new AIS algorithm is used to derive optimal values of surface parameters and boundary layer thickness in SMC with considering minimum torques and error. Surface parameters and boundary layer thickness are considered as antibody in AIS and Morlet...
-
Things You Might Not Know about the k-Nearest Neighbors Algorithm
PublicationRecommender Systems aim at suggesting potentially interesting items to a user. The most common kind of Recommender Systems is Collaborative Filtering which follows an intuition that users who liked the same things in the past, are more likely to be interested in the same things in the future. One of Collaborative Filtering methods is the k Nearest Neighbors algorithm which finds k users who are the most similar to an active user...
-
The choice of parameters of induction motor model using a genetic algorithm.
PublicationRozważano problem doboru parametrów modeli matematycznych dużych 3 -fazowych silników indukcyjnych. Modele o prawidłowo dobranych parametrach mogą być pomocne podczas procedur projektowych. Podane silniki mogą być używane jako napędy sterów strumieniowych statków. Symulacje w środowisku Matlab, uwzględniają modele statyczne silników. Parametry silników dobierane są za pomocą przybornika Genetic Algorithm Toolbox. Skuteczność metody...
-
Evolutional algorithm in stock control
Publication -
The Algorithm of Modelling and Analysis of Latent Semantic Relations: Linear Algebra vs. Probabilistic Topic Models
PublicationThis paper presents the algorithm of modelling and analysis of Latent Semantic Relations inside the argumentative type of documents collection. The novelty of the algorithm consists in using a systematic approach: in the combination of the probabilistic Latent Dirichlet Allocation (LDA) and Linear Algebra based Latent Semantic Analysis (LSA) methods; in considering each document as a complex of topics, defined on the basis of separate...
-
An algorithm for selecting a machine learning method for predicting nitrous oxide emissions in municipal wastewater treatment plants
PublicationThis study presents an advanced algorithm for selecting machine learning (ML) models for nitrous oxide (N2O) emission prediction in wastewater treatment plants (WWTPs) employing the activated sludge process. The examined ML models comprised multivariate adaptive regression spline (MARS), support vector machines (SVM), and extreme gradient boosting (XGboost). The study explores the concept that involves new criteria to select the...
-
Self-Adaptive Mesh Generator for Global Complex Roots and Poles Finding Algorithm
PublicationIn any global method of searching for roots and poles, increasing the number of samples increases the chances of finding them precisely in a given area. However, the global complex roots and poles finding algorithm (GRPF) (as one of the few) has direct control over the accuracy of the results. In addition, this algorithm has a simple condition for finding all roots and poles in a given area: it only requires a sufficiently dense...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublicationWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publicationgenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
An optimized system for sensor ontology meta-matching using swarm intelligent algorithm
PublicationIt is beneficial to annotate sensor data with distinct sensor ontologies in order to facilitate interoperability among different sensor systems. However, for this interoperability to be possible, comparable sensor ontologies are required since it is essential to make meaningful links between relevant sensor data. Swarm Intelligent Algorithms (SIAs), namely the Beetle Swarm Optimisation Algorithm (BSO), present a possible answer...
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublicationThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
Convex set of quantum states with positive partial transpose analysed by hit and run algorithm
PublicationThe convex set of quantum states of a composite K×K system with positive partial transpose is analysed. A version of the hit and run algorithm is used to generate a sequence of random points covering this set uniformly and an estimation for the convergence speed of the algorithm is derived. For K >3 or K=3 this algorithm works faster than sampling over the entire set of states and verifying whether the partial transpose is positive....
-
Evolutionary algorithm and decisional DNA for multiple travelling salesman problem
PublicationIn the real world, it is common to face optimization problems that have two or more objectives that must be optimized at the same time, that are typically explained in different units, and are in conflict with one another. This paper presents a hybrid structure that combines set of experience knowledge structures (SOEKS) and evolutionary algorithms, NSGA-II (Non-dominated Sorting Genetic Algorithm II), to solve multiple optimization...
-
Hardware implementation of digital image stabilization using optical flow algorithm and FPGA technology
PublicationW artykule przedstawiono efektywną procedurę uproszczenia algorytmu przepływu optycznego oraz jego realizację w układzie programowalnym FPGA. Zmodyfikowany algorytm wykorzystuję metodę blokowego dopasowania podobszarów oraz jednowymiarową reprezentację podobszarów. Dodatkowo, funkcja korelacji oparta jest o normę L1. W rezultacie uzyskano zmniejszenie zużytych zasobów kosztem nieznacznej utraty dokładności. Zarówno dokładność,...
-
An facile Fortran-95 algorithm to simulate complex instabilities in three-dimensional hyperbolic systems
Open Research DataIt is well know that the simulation of fractional systems is a difficult task from all points of view. In particular, the computer implementation of numerical algorithms to simulate fractional systems of partial differential equations in three dimensions is a hard task which has no been solved satisfactorily. Here, we provide a Fortran-95 code to solve...
-
Obtaining a Well-Trained Artificial Intelligence Algorithm from Cross-Validation in Endoscopy
PublicationThe article shortly discusses endoscopic video analysis problems and artificial intelligence algorithms supporting it. The most common method of efficiency testing of these algorithms is to perform intensive cross-validation. This allows for accurately evaluate their performance of generalization. One of the main problems of this procedure is that there is no simple and universal way of obtaining a specific instance of a well-trained...
-
Efficient algorithm for blinking LED detection dedicated to embedded systems equipped with high performance cameras
PublicationThis paper presents the concept and implementation of an efficient algorithm for detection of blinking LED or similar signal sources. Algorithm is designed for embedded devices equipped with high performance cameras being a part of an indoor positioning embedded system. An algorithm to be implemented in such a system should be efficient in terms of computational power what is hard to be achieved when large amount of data from camera...
-
Implementation of magnitude calculation of complex numbers using improved alpha max plus beta min algorithm
PublicationThe paper presents the hardware implementation of the improved alpha max plus beta min algorithm for calculating the magnitude of complex numbers. This version of the algorithm requires the general division which is performed using a noniterative multiplicative division algorithm. We analyze in detail the division algorithm, its error and the impact of finite word-length signal representations on the assumed total computation error....
-
FPGA-Based Implementation of Real Time Optical Flow Algorithm and Its Applications for Digital Image Stabilization
PublicationAn efficient simplification procedure of the optical flow (OF) algorithm as well as its hardware implementation using the field programmable gate array (FPGA) technology is presented. The modified algorithm is based on block matching of subsets of successive frames, and exploits one-dimensional representation of subsets as well as the adaptive adjustments of their sizes. Also, an l1-norm-based correlation function requiring no...
-
Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm
PublicationThis paper introduces a generalized Pareto ranking bisection algorithm for low-cost multi-objective design optimization of antenna structures. The algorithm allows for identifying a set of Pareto optimal sets of parameters (that represent the best trade-offs between considered objectives) by iterative partitioning of the intervals connecting previously found designs and executing a Pareto-ranking-based poll search. The initial...