Search
Search results for: Computational algorithm
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublicationThe paper presents a systematic computational package for analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The algorithm is based on the transfer function method (DTFM). With this algorithm, a bond graph technique for the modelling is developed to simplify computations. Analysis of different systems requires only changing the inputs data in the form of the bond graph diagram
-
A COMPUTATIONAL ALGORITHM FOR THE NUMERICAL SOLUTION OF NONLINEAR FRACTIONAL INTEGRAL EQUATIONS
Publication -
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...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Interactive Query Expansion with the Use of Clustering by Directions Algorithm
PublicationThis paper concerns Clustering by Directions algorithm. The algorithm introduces a novel approach to interactive query expansion. It is designed to support users of search engines in forming web search queries. When a user executes a query, the algorithm shows potential directions in which the search can be continued. This paper describes the algorithm and it presents an enhancement which reduces the computational complexity of...
-
Reduction of Computational Complexity in Simulations of the Flow Process in Transmission Pipelines
PublicationThe paper addresses the problem of computational efficiency of the pipe-flow model used in leak detection and identification systems. Analysis of the model brings attention to its specific structure, where all matrices are sparse. With certain rearrangements, the model can be reduced to a set of equations with tridiagonal matrices. Such equations can be solved using the Thomas algorithm. This method provides almost the same values...
-
Context Search Algorithm for Lexical Knowledge Acquisition
PublicationA Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. A knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game,...
-
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...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
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...
-
Quality Evaluation of Novel DTD Algorithm Based on Audio Watermarking
PublicationEcho cancellers typically employ a doubletalk detection (DTD) algorithm in order to keep the adaptive filter from diverging in the presence of near-end speech signal or other disruptive sounds in the microphone signal. A novel doubletalk detection 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...
-
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 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...
-
Arterial cannula shape optimization by means of the rotational firefly algorithm
PublicationThe article presents global optimization results of arterial cannula shapes by means of the newly modified firefly algorithm. The search for the optimal arterial cannula shape is necessary in order to minimize losses and prepare the flow that leaves the circulatory support system of a ventricle (i.e. blood pump) before it reaches the heart. A modification of the standard firefly algorithm, the so-called rotational firefly algorithm,...
-
Hybrid DUMBRA: an efficient QoS routing algorithm for networks with DiffServ architecture
PublicationDynamic routing is very important issue of current packet networks. It may support the QoS and help utilize available network resources. Unfortunately current routing mechanisms are not sufficient to fully support QoS. Although many research has been done in this area no generic QoS routing algorithm has been proposed that could be used across all network structures. Existing QoS routing algorithms are either dedicated to limited...
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublicationPerforming global sensitivity analysis (GSA) can be challenging due to the combined effect of the high computational cost, but it is also essential for engineering decision making. To reduce this cost, surrogate modeling such as neural networks (NNs) are used to replace the expensive simulation model in the GSA process, which introduces the additional challenge of finding the minimum number of training data samples required to...
-
Model Management for Low-Computational-Budget Simulation-Based Optimization of Antenna Structures Using Nature-Inspired Algorithms
PublicationThe primary objective of this study is investigation of the possibilities of accelerating nature-inspired optimization of antenna structures using multi-fidelity EM simulation models. The primary methodology developed to achieve acceleration is a model management scheme which the level of EM simulation fidelity using two criteria: the convergence status of the optimization algorithm, and relative quality of the individual designs...
-
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...
-
Real‐Time PPG Signal Conditioning with Long Short‐Term Memory (LSTM) Network for Wearable Devices
PublicationThis paper presents an algorithm for real‐time detection of the heart rate measured on a person’s wrist using a wearable device with a photoplethysmographic (PPG) sensor and accelerometer. The proposed algorithm consists of an appropriately trained LSTM network and the Time‐Domain Heart Rate (TDHR) algorithm for peak detection in the PPG waveform. The Long Short‐Term Memory (LSTM) network uses the signals from the accelerometer...
-
A Novel Trust-Region-Based Algorithm with Flexible Jacobian Updates for Expedited Optimization of High-Frequency Structures
PublicationSimulation-driven design closure is mandatory in the design of contemporary high-frequency components. It aims at improving the selected performance figures through adjustment of the structure’s geometry (and/or material) parameters. The computational cost of this process when employing numerical optimization is often prohibitively high, which is a strong motivation for the development of more efficient methods. This is especially...
-
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...
-
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)...
-
Optimized Computational Intelligence Model for Estimating the Flexural Behavior of Composite Shear Walls
PublicationThis article presents a novel approach to estimate the flexural capacity of reinforced concrete-filled composite plate shear walls using an optimized computational intelligence model. The proposed model was developed and validated based on 47 laboratory data points and the Transit Search (TS) optimization algorithm. Using 80% of the experimental dataset, the optimized model was selected by determining the unknown coefficients of...
-
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...
-
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 Based on Phase Analysis for Propagation and Radiation Problems
PublicationA flexible and effective algorithm for complex roots and poles finding is presented. A wide class of analytic functions can be analyzed, and any arbitrarily shaped search region can be considered. The method is very simple and intuitive. It is based on sampling a function at the nodes of a regular mesh, and on the analysis of the function phase. As a result, a set of candidate regions is created and then the roots/poles are verified...
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Direct spectrum detection based on Bayesian approach
PublicationThe paper investigates the Bayesian framework's performance for a direct detection of spectrum parameters from the compressive measurements. The reconstruction signal stage is eliminated in by the Bayesian Compressive Sensing algorithm, which causes that the computational complexity and processing time are extremely reduced. The computational efficiency of the presented procedure is significantly...
-
Computationally-efficient design optimisation of antennas by accelerated gradient search with sensitivity and design change monitoring
PublicationElectromagnetic (EM) simulation tools are of primary importance in the design of contemporary antennas. The necessity of accurate performance evaluation of complex structures is a reason why the final tuning of antenna dimensions, aimed at improvement of electrical and field characteristics, needs to be based on EM analysis. Design automation is highly desirable and can be achieved by coupling EM solvers with numerical optimisation...
-
Expedited Design Closure of Antenna Input Characteristics by Trust Region Gradient Search and Principal Component Analysis
PublicationOptimization-based parameter tuning has become an inherent part of contemporary antenna design process. For the sake of reliability, it is typically conducted at the level of full-wave electromagnetic (EM) simulation models. This may incur considerable computational expenses depending on the cost of an individual EM analysis, the number of adjustable variables, the type of task (local, global, single-/multi-objective optimization),...
-
Hybridized Space-Vector Pulsewidth Modulation for Multiphase Two-Level Voltage Source Inverter
PublicationIn space vector pulsewidth modulation (SVPWM) algorithms for multiphase two-level voltage source inverters (VSI), the components of active vectors in all orthogonal spaces have to be calculated within the processor and stored in its memory. These necessitate intensive computational efforts of the processor and large memory space. This article presents a hybridized SVPWM for multiphase two-level VSI. In this algorithm, elements...
-
Optimal shape design of multi-element trawl-doors using local surrogate models
PublicationTrawl-doors have a large influence on the fuel consumption of fishing vessels. Design and optimiza-tion of trawl-doors using computational models are a key factor in minimizing the fuel consump-tion. This paper presents an optimization algorithm for the shape design of trawl-door shapes using computational fluid dynamic (CFD) models. Accurate CFD models are computationally expensive. Therefore, the direct use of traditional optimization...
-
Performance Evaluation of Selected Parallel Object Detection and Tracking Algorithms on an Embedded GPU Platform
PublicationPerformance evaluation of selected complex video processing algorithms, implemented on a parallel, embedded GPU platform Tegra X1, is presented. Three algorithms were chosen for evaluation: a GMM-based object detection algorithm, a particle filter tracking algorithm and an optical flow based algorithm devoted to people counting in a crowd flow. The choice of these algorithms was based on their computational complexity and parallel...
-
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ść,...
-
Constrained aerodynamic shape optimization using neural networks and sequential sampling
PublicationAerodynamic shape optimization (ASO) involves computational fluid dynamics (CFD)-based search for an optimal aerodynamic shape such as airfoils and wings. Gradient-based optimization (GBO) with adjoints can be used efficiently to solve ASO problems with many design variables, but problems with many constraints can still be challenging. The recently created efficient global optimization algorithm with neural network (NN)-based prediction...
-
Image Segmentation of MRI image for Brain Tumor Detection
Publicationthis research work presents a new technique for brain tumor detection by the combination of Watershed algorithm with Fuzzy K-means and Fuzzy C-means (KIFCM) clustering. The MATLAB based proposed simulation model is used to improve the computational simplicity, noise sensitivities, and accuracy rate of segmentation, detection and extraction from MR...
-
The Complexity of Zero-Visibility Cops and Robber
PublicationIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
Multi-fidelity robust aerodynamic design optimization under mixed uncertainty
PublicationThe objective of this paper is to present a robust optimization algorithm for computationally efficient airfoil design under mixed (inherent and epistemic) uncertainty using a multi-fidelity approach. This algorithm exploits stochastic expansions derived from the Non-Intrusive Polynomial Chaos (NIPC) technique to create surrogate models utilized in the optimization process. A combined NIPC expansion approach is used, where both...
-
Reduced-cost electromagnetic-driven optimisation of antenna structures by means of trust-region gradient-search with sparse Jacobian updates
PublicationNumerical optimisation plays more and more important role in the antenna design. Because of lack of design-ready theoretical models, electromagnetic (EM)-simulation-driven adjustment of geometry parameters is a necessary step of the design process. At the same time, traditional parameter sweeping cannot handle complex topologies and large number of design variables. On the other hand, high computational cost of the conventional...
-
Patch size setup and performance/cost trade-offs in multi-objective EM-driven antenna optimization using sequential domain patching
PublicationPurpose This paper aims to assess control parameter setup and its effect on computational cost and performance of deterministic procedures for multi-objective design optimization of expensive simulation models of antenna structures. Design/methodology/approach A deterministic algorithm for cost-efficient multi-objective optimization of antenna structures has been assessed. The algorithm constructs a patch connecting extreme Pareto-optimal...
-
Wideband Model Order Reduction for Macromodels in Finite Element Method
PublicationAbstract: This paper presents a novel algorithm for accelerating 3D Finite Element Method simulations by introducing macromodels created in local model order reduction in the selected subdomains of the computational domain. It generates the projection basis for a compact system of equations associated with a separate subdomain. Due to non-linear frequency dependency in the Right Hand Side (RHS), the standard reduction methods do...
-
A low complexity double-talk detector based on the signal envelope
PublicationA new algorithm for double-talk detection, intended for use in the acoustic echo canceller for voice communication applications, is proposed. The communication system developed by the authors required the use of a double-talk detection algorithm with low complexity and good accuracy. The authors propose an approach to doubletalk detection based on the signal envelopes. For each of three signals: the far-end speech, the microphone...
-
Computational analysis of an infinite magneto-thermoelastic solid periodically dispersed with varying heat flow based on non-local Moore–Gibson–Thompson approach
PublicationIn this investigation, a computational analysis is conducted to study a magneto-thermoelastic problem for an isotropic perfectly conducting half-space medium. The medium is subjected to a periodic heat flow in the presence of a continuous longitude magnetic field. Based on Moore–Gibson–Thompson equation, a new generalized model has been investigated to address the considered problem. The introduced model can be formulated by combining...
-
Probabilistic sensitivity of the limit states of structures using Monte Carlom simulation
PublicationThe paper presents the concept of probabilistic sensitivity of structural limit states with respect to given design variables. A general idea is presented, illustrated by a simple case solved in an analytical way. More general approach is presented for the engineering structures, in this case a dedicated Monte Carlo simulation procedure is involved as part of the methodology. Illustration of the engineering case is done, by means...
-
Modeling DAC Application Execution Time
PublicationAn application written in the Divide And Conquer paradigm is more difficult to model than SPMD application because of complex algorithm, causing use of many coefficients in a computational complexity function. Processors are divided into various layers, each layer contains different number of processors. Data packets processed in different layers and transferred between layers have different length. Moreover first layer processors use...
-
Multi-fidelity aerodynamic design trade-off exploration using point-by-point Pareto set identification
PublicationAerodynamic design is inherently a multi-objective optimization (MOO) problem. Determining the best possible trade-offs between conflicting aerodynamic objectives can be computationally challenging when carried out directly at the level of high-fidelity computational fluid dynamics simulations. This paper presents a computationally cheap methodology for exploration of aerodynamic design trade-offs. In particular, point-by-point...
-
Computational fluid dynamics simulation of heat transfer from densely packed gold nanoparticles to isotropic media
PublicationThis work aims to determine and compare heat generation and propagation of densely packed gold nanoparticles (Au NPs) induced by a resonant laser beam (532 nm) according to the Mie theory. The heat flux propagation is transferred into the materials, which here are: silica glass; soda-lime-silica glass; borosilicate glass; polymethyl methacrylate (PMMA); polycarbonate (PC); and polydimetylosiloxane (PDMS). This analysis aims to...
-
Computationally Effcient Solution of a 2D Diffusive Wave Equation Used for Flood Inundation Problems
PublicationThis paper presents a study dealing with increasing the computational efficiency in modeling floodplain inundation using a two-dimensional diffusive wave equation. To this end, the domain decomposition technique was used. The resulting one-dimensional diffusion equations were approximated in space with the modified finite element scheme, whereas time integration was carried out using the implicit two-level scheme. The proposed...
-
Patch size setup and performance/cost trade-offs in multi-objective antenna optimization using domain patching technique
PublicationA numerical study concerning multi-objective optimization of antenna structures using sequential domain patching (SDP) technique has been presented. We investigate the effect of various setups of the patch size on the operation of the SDP algorithm and possible trade-offs concerning the quality of the Pareto set found by SDP and the computational cost of the optimization process. Our considerations are illustrated using a UWB monopole...