Search
Search results for: APPROXIMATION ALGORITHM
-
Locating and Identifying Ferromagnetic Objects
PublicationThe new non-iterative method of determining the dipole moment and location is presented in this paper. The algorithm of an object's localization and identification was achieved by using numerical calculations and approximation method. The arbitrary shapes of an object were assumed in the identification algorithm - axially symmetric spheroid (a prolate and an oblate). Several examples of localization and identification of an object's...
-
Locating and Identifying Ferromagnetic Objects
PublicationThe new non-iterative method of determining the dipole moment and location is presented in this paper. The algorithm of an object's localization and identification was achieved by using numerical calculations and approximation method. The arbitrary shapes of an object were assumed in the identification algorithm - axially symmetric spheroid (a prolate and an oblate). Several examples of localization and identification of an object's...
-
Cost-efficient multi-objective design optimization of antennas in highly-dimensional parameter spaces
PublicationMulti-objective optimization of antenna structures in highly-dimensional parameter spaces is investigated. For expedited design, variable-fidelity EM simulations and domain patching algorithm are utilized. The results obtained for a monopole antenna with 13 geometry parameters are compared with surrogate-assisted optimization involving response surface approximation modeling.
-
Algorithm for Automatic Wear Estimation of Railway Contact Strips Based on 3D Scanning Results
PublicationElectric rail vehicles use current collection system which consists of overhead contact line and a current collector (pantograph) mounted on the roof of a vehicle. A pantograph is equipped with contact strips, which slide along the contact wire, ensuring steady electric contact. Contact strips are made of carbon layer, fixed to an aluminum carrier. The carbon layer wears down due to friction. Using overly worn contact strips increases...
-
Impact of Low Switching-to-Fundamental Frequency Ratio on Predictive Current Control of PMSM: A simulation study
PublicationPredictive current control algorithms for permanent magnet synchronous (PMSM) drives rely on an assumption that within short intervals motor currents can be approximated with linear functions. This approximation may result either from discretizing the motor model or from simplifications applied to the continuous-time model. As the linear current approximation has been recognized as inaccurate in case when the drive operates with...
-
Solution of the dike-break problem using finite volume method and splitting technique
PublicationIn the paper the finite volume method (FVM) is presented for the solution of two-dimensional shallow water equations. These equations are frequently used to simulate the dam-break and dike-break induced flows. The applied numerical algorithm of FVM is based on the wave-propagation algorithm which ensures a stable solution and simultaneously minimizes the numerical errors. The dimensional decomposition according to the coordinate...
-
Rotational Design Space Reduction for Cost-Efficient Multi-Objective Antenna Optimization
PublicationCost-efficient multi-objective design of antenna structures is presented. Our approach is based on design space reduction algorithm using auxiliary single-objective optimization runs and coordinate system rotation. The initial set of Pareto-optimal solutions is obtained by optimizing a response surface approximation model established in the reduced space using coarse-discretization EM simulation data. The optimization engine is...
-
Shared processor scheduling of multiprocessor jobs
PublicationWe study a problem of shared processor scheduling of multiprocessor weighted jobs. Each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs. This simultaneous execution reduces their completion times due to the processing time overlap. Each of the m shared processors may charge a different fee but otherwise the processors are identical. The goal is to maximize the total...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Application of regularized Savitzky–Golay filters to identification of time-varying systems
PublicationSavitzky–Golay (SG) filtering is a classical signal smoothing technique based on the local least squares approximation of the analyzed signal by a linear combination of known functions of time (originally — powers of time, which corresponds to polynomial approximation). It is shown that the regularized version of the SG algorithm can be successfully applied to identification of time-varying finite impulse response (FIR) systems....