displaying 1000 best results Help
Search results for: ALGORITHM
-
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...
-
Hybrid evolutionary partitioning algorithm for heat transfer enhancement in VLSI circuits
PublicationW niniejszym artykule przedstawiono metodę pozwalającą na polepszenie transferu ciepła z układu scalonego do otoczenia poprzez zwiększenie liczby połączeń zewnętrznych, co pozwoliło na polepszenie przewodności cieplnej układu scalonego. Dla osiągnięcia tego celu opracowano nowy, hybrydowy, ewolucyjny algorytm podziału (ang. Hybrid Evolutionary Partitioning Algorithm - HEPA). Obliczenia przeprowadzone dla wybranych przykładów testowych...
-
Adjusted SpikeProp algorithm for recurrent spiking neural networks with LIF neurons
PublicationA problem related to the development of a supervised learning method for recurrent spiking neural networks is addressed in the paper. The widely used Leaky-Integrate-and-Fire model has been adopted as a spike neuron model. The proposed method is based on a known SpikeProp algorithm. In detail, the developed method enables gradient descent learning of recurrent or multi-layer feedforward spiking neural networks. The research included...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Global Complex Roots and Poles Finding Algorithm in C × R Domain
PublicationAn algorithm to find the roots and poles of a complex function depending on two arguments (one complex and one real) is proposed. Such problems are common in many fields of science for instance in electromagnetism, acoustics, stability analyses, spectroscopy, optics, and elementary particle physics. The proposed technique belongs to the class of global algorithms, gives a full picture of solutions in a fixed region ⊂ C × R and...
-
Performance evaluation of the parallel object tracking algorithm employing the particle filter
Publication -
Learning from Imbalanced Data Using Over-Sampling and the Firefly Algorithm
Publication -
A genetic algorithm application for automatic layout design of modular residential homes
Publication -
A fast algorithm for computing the flux around non-overlapping disks on the plane
Publication -
Optimal Power Flow Problem Using Particle Swarm Optimization Algorithm
Publication -
Corrupted speech intelligibility improvement using adaptive filter based algorithm
PublicationA technique for improving the quality of speech signals recorded in strong noise is presented. The proposed algorithmemploying adaptive filtration is described and additional possibilities of speech intelligibility improvement arediscussed. Results of the tests are presented.
-
A Biased-Randomized Iterated Local Search Algorithm for Rich Portfolio Optimization
Publication -
Designing RBF Networks Using the Agent-Based Population Learning Algorithm
Publication -
A multirate approach to DDS algorithm versus Taylor-series expansion technique.
PublicationPokazano, że cyfrowy generator syntezy bezpośredniej (DDS) można traktować jako algorytm wieloszybkościowy. Rozważono i porównano dwa sposoby wykorzystania pamięci. W pierwszym z nich zastosowano filtr ułamkowo-opóźniający o strukturze Farrowa. Drugie podejście oparto na rotacji fazy na podstawie rozwinięcia w szereg Taylora. Eksperymenty pokazują, że za pomocą obu tych sposobów, dla sinusoidy zespolonej generowanej w kwadraturowym...
-
Efficient analysis of waveguide componets using a hybrid PEE-FDFD algorithm.
PublicationZaproponowano przyspieszenie analizy podzespołów falowodowych poprzez połączenie metody różnic skończonych w dziedzinie częstotliwości FDFD oraz rozwinięcia w funkcje własne PEE. Proponowane sformułowanie pozwala jawnie zdefiniować operator macierzowy dla zadanego problemu. Proponowana technika została zaprezentowana zarówno dla problemów własnych jak i układów z pobudzeniem.
-
Innovative optimization algorithm of variable speed pumps in district heating systems.
PublicationW referacie przedstawiono innowacyjny algorytm matematyczny optymalizacji pracy pomp zmienno prędkościowych w systemach ciepłowniczych. Algorytm wykorzystuje procedurę iterecyjnego wyznaczania parametrów pracy pomp, których charakterystyki są linearyzowane odcinkami w układzie dwóch współrzędnych. Do rozwiązania modelu całkowitoliczbowego zaproponowano wykorzystanie systemu GAMS. W pracy przedstawiono podstawy metodologiczne i...
-
Estimation of musical sound separation algorithm effectiveness employing neural networks.
PublicationŚlepa separacja dźwięków sygnałów muzycznych zawartych w zmiksowanym materiale jest trudnym zadaniem. Jest to spowodowane tym, że dźwięki znajdujące się w relacjach harmonicznych mogą zawierać kolidujące składowe sinusoidalne (składowe harmoniczne). Ewaluacja wyników separacji jest również problematyczna, gdyż analiza błędu energetycznego często nie odzwierciedla subiektywnej jakości odseparowanych sygnałów. W tej publikacji zostały...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublicationW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
Pareto Task Assignments by an Adaptive Quantum-based Evolutionary Algorithm AQMEA
PublicationW pracy scharakteryzowano state_of_the_art w zakresie kwantowych algorytmów ewolucyjnych. Scharakteryzowano zasady efektywnego projektowania tej klasy algorytmów genetycznych. Podano wyniki uzyskane za pomocą kwantowego algorytmu ewolucyjnego AQMEA w zakresie wyznaczanie przydziałów zadań optymalnych w sensie Pareto.
-
Iterative Global Sensitivity Analysis Algorithm with Neural Network Surrogate Modeling
PublicationGlobal sensitivity analysis (GSA) is a method to quantify the effect of the input parameters on outputs of physics-based systems. Performing GSA can be challenging due to the combined effect of the high computational cost of each individual physics-based model, a large number of input parameters, and the need to perform repetitive model evaluations. To reduce this cost, neural networks (NNs) are used to replace the expensive physics-based...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Atomic Force Microscope data post-processing algorithm for higher harmonics imaging
PublicationPrevious works have proved that higher harmonics topography imaging using atomic force microscope (AFM) can significantly enhanced its measurement capabilities. Integrated tools dedicated to most of microscopes allow to visualize the investigated surface only by one selected harmonic. Because of the different characteristics of a sample, scanning tip and the environment, appropriate harmonic selection is time consuming and requires...
-
Multimodal Genetic Algorithm with Phase Analysis to Solve Complex Equations of Electromagnetic Analysis
PublicationIn this contribution, a new genetic-algorithm-based method of finding roots and poles of a complex function of a complex variable is presented. The algorithm employs the phase analysis of the function to explore the complex plane with the use of the genetic algorithm. Hence, the candidate regions of root and pole occurrences are selected and verified with the use of discrete Cauchy's argument principle. The algorithm is evaluated...
-
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...
-
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...
-
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....
-
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
-
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...
-
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...
-
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...
-
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...
-
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...
-
A Self-Adaptive Complex Root Tracing Algorithm for the Analysis of Propagation and Radiation Problem
PublicationAn improved complex root tracing algorithm for radiation and propagation issues is proposed. The approach is based on a self-adaptive discretization of Cauchy’s argument principle for a C × R space and requires a reduced number of function calls in comparison to other procedures presented in the literature. A few different examples concerning propagation and radiation problems have been considered to verify the validity and efficiency...
-
Task Assignments in Logistics by Adaptive Multi-Criterion Evolutionary Algorithm with Elitist Selection
PublicationAn evolutionary algorithm with elitist selection has been developed for finding Pareto-optimal task assignments in logistics. A multi-criterion optimization problem has been formulated for finding a set of Pareto- optimal solutions. Three criteria have been applied for evaluation of task assignment: the workload of a bottleneck machine, the cost of machines, and the numerical performance of system. The machine constraints have...
-
APPLYING RANSAC ALGORITHM FOR FITTING SCANNING STRIPS FROM AIRBORNE LASER SCANNING
PublicationDuring the development of the data acquired by airborne laser scanning the important issue is the fitting and georeferencing of ALS point clouds by means of the tie surfaces and the reference planes. The process of scanning strips adjustment is based on mutual integration of point clouds (scanning strips) and their adaptation to the reference planes.In simultaneous adjustment all strips are combined into one geometrically coherent...
-
Evaluation of Sound Enhancement in Mobile Device Using Virtual Bass Synthesiss Algorithm
PublicationAn experiment conducted to validate possibility of use virtual bass synthesis (VBS) algorithm in a portable computer is presented. The subjective listening tests based on the procedure of pairwise comparison between VBS, based on the so-called missing fundamental phenomenon, and standard bass boost technique are employed. The evaluation was carried out in two types of conditions: in a professional listening room and employing an...
-
Optimizing the computation of a parallel 3D finite difference algorithm for graphics processing units
PublicationThis paper explores the possibilities of using a graphics processing unit for complex 3D finite difference computation via MUSTA‐FORCE and WENO algorithms. We propose a novel algorithm based on the new properties of CUDA surface memory optimized for 2D spatial locality and compare it with 3D stencil computations carried out via shared memory, which is currently considered to be the best approach. A case study was performed for...
-
Optimising Sequencing Batch Reactor Operation Cycle Planning Using Evolutionary Algorithm
PublicationThe objective of this research was to optimise the operation cycle of the Sequencing Batch Reactor (SBR). Appropriate time balances of aerobic to anaerobic phases, as well as a set dissolved oxygen level are the key to ensuring the quality of effluent from the wastewater treatment process. The proposal to solve this optimisation problem was based on multi-objective optimisation using an evolutionary multi-objective optimisation...
-
Direct algorithm for optimizing robust MPC of drinking water distribution systems hydraulics
PublicationModel-based predictive control is an effective method for control the large scale systems [1]–[6], [8], [16], [17]. Method is based on on-line solution of the control task over the control horizon using current and past measurements, as well as the system model. Only a first element of calculated control sequence is applied to the plant. At the next sampling instant, based on new process output measurements, control procedure is...
-
Objective relaxation algorithm for reliable simulation-driven size reduction of antenna structure
PublicationThis letter investigates reliable size reduction of antennas through electromagnetic-driven optimization. It is demonstrated that conventional formulation of the design task by direct footprint miniaturization with imposing constraints on electrical performance parameters may not lead to optimum results. The reason is that—in a typical antenna structure—only a few geometry parameters explicitly determine the antenna footprint,...
-
An object-based SAR image iceberg detection algorithm applied to the Amundsen Sea
Publication -
Efficient calculation of the resonant frequencies of a SIW resonator with FDFD-based macromodel algorithm
PublicationW pracy przedstawiono efektywną metodę do analizy struktur ze integrowanym podłożem (SIW). W celu szybkiego obliczenia częstotliwości rezonansowych używany jest algorytm FDFD z zaimplementowanymi makromodelami.
-
From the Dynamic Lattice Liquid Algorithm to the Dedicated Parallel Computer – mDLL Machine
Publication -
Signal Partitioning Algorithm for Highly Efficient Gaussian Mixture Modeling in Mass Spectrometry
Publication -
Probabilistic Sequence Mining – Evaluation and Extension of ProMFS Algorithm for Real-Time Problems
Publication -
Application of Shuffled Frog-Leaping Algorithm for Optimal Software Project Scheduling and Staffing
Publication -
Implementation of adaptive feed-forward algorithm on embedded PowerPC405 processor for FLASH accelerator
Publication -
Improving signal quality of a speech codec using hybrid perceptual-parametric algorithm
PublicationW artykule zaprezentowano hybrydową architekturę parametryczno-perceptualną kodeka mowy. Jego podstawę stanowi kodek CELP, który wspomagany jest kodekiem perceptualnym. Celem zastosowania proponowanej metody jest uzyskanie poprawy jakości kodowania sygnału mowy. Badaniom poddano dwie architektury, z których w jednej dźwięczne części sygnału rezydualnego kodeka CELP kodowane są perceptualnie. Drugi z proponowanych kodeków dokonuje...
-
Kernel-Based Fuzzy C-Means Clustering Algorithm for RBF Network Initialization
Publication