Wyszukiwarka
Filtry
wszystkich: 199
Wyniki wyszukiwania dla: COMPLEX ROOTS FINDING ALGORITHM
-
A Self-Adaptive Complex Root Tracing Algorithm for the Analysis of Propagation and Radiation Problem
PublikacjaAn 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...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublikacjaW 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.
-
Implementation of magnitude calculation of complex numbers using improved alpha max plus beta min algorithm
PublikacjaThe 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....
-
An facile Fortran-95 algorithm to simulate complex instabilities in three-dimensional hyperbolic systems
Dane BadawczeIt 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...
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublikacjaThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
Numerical Test for Stability Evaluation of Discrete-Time Systems
PublikacjaIn this paper, a new numerical test for stability evaluation of discrete-time systems is presented. It is based on modern root-finding techniques at the complex plane employing the Delaunay triangulation and Cauchy's Argument Principle. The method evaluates if a system is stable and returns possible values and multiplicities of unstable zeros of the characteristic equation. For state-space discrete-time models, the developed test...
-
A New Approach to Stability Evaluation of Digital Filters
PublikacjaIn this paper, a new numerical method of evaluating digital filter stability is presented. This approach is based on novel root-finding algorithms at the complex plane using the Delaunay triangulation and Cauchy's Argument Principle. The presented algorithm locates unstable zeros of the characteristic equation with their multiplicities. The proposed method is generic and can be applied to a vast range of systems. Verification of...
-
Human voice modification using instantaneous complex frequency
PublikacjaThe paper presents the possibilities of changing human voice by modifying instantaneous complex frequency (ICF) of the speech signal. The proposed method provides a flexible way of altering voice without the necessity of finding fundamental frequency and formants' positions or detecting voiced and unvoiced fragments of speech. The algorithm is simple and fast. Apart from ICF it uses signal factorization into two factors: one fully...
-
Scattering and Propagation Analysis for the Multilayered Structures Based on Field Matching Technique
PublikacjaA semi-analytical method is employed to the analysis of scattering and guiding problems in multilayer dielectric structures. The approach allows to investigate objects with arbitrary convex cross section and is based on the direct field matching technique involving the usage of the field projection at the boundary on a fixed set of orthogonal basis functions. For the scattering problems the scattered field in the far zone is calculated...
-
A novel genetic approach to provide differentiated levels of service resilience in IP-MPLS/WDM networks
PublikacjaThis paper introduces a novel class-based method of survivable routing for connection-oriented IP-MPLS/WDM networks, called MLS-GEN-H. The algorithm is designed to provide differentiated levels of service survivability in order to respond to varying requirements of end-users. It divides the complex problem of survivable routing in IP-MPLS/WDM networks into two subproblems, one for each network layer, which enables finding the...
-
Task Assignments in Logistics by Adaptive Multi-Criterion Evolutionary Algorithm with Elitist Selection
PublikacjaAn 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...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Genetic Programming for Workload Balancing in the Comcute Grid System
PublikacjaA genetic programming paradigm is implemented for reliability optimization in the Comcute grid system design. Chromosomes are generated as the program functions and then genetic operators are applied for finding Pareto-suboptimal task assignment and scheduling. Results are compared with outcomes obtained by an adaptive evolutionary algorithm.
-
Experiments on Preserving Pieces of Information in a Given Order in Holographic Reduced Representations and the Continuous Geometric Algebra Model
PublikacjaGeometric Analogues of Holographic Reduced Representations (GAc, which is the continuous version of the previously developed discrete GA model) employ role-filler binding based on geometric products.Atomic objects are real-valued vectors in n-dimensional Euclidean space and complex statements belong to a hierarchy of multivectors. The property of GAc and HRR studied here is the ability to store pieces of information in a given...
-
Instantaneous complex frequency for pipeline pitch estimation
PublikacjaIn the paper a pipeline algorithm for estimating the pitch of speech signal is proposed. The algorithm uses instantaneous complex frequencies estimated for four waveforms obtained by filtering the original speech signal through four bandpass complex Hilbert filters. The imaginary parts of ICFs from each channel give four candidates for pitch estimates. The decision regarding the final estimate is made based on the real parts of...
-
Multi-objective Weather Routing with Customised Criteria and Constraints
PublikacjaThe paper presents a weather routing algorithm utilising a multi-objective optimisation with constraints, namely the Multi-objective Evolutionary Weather Routing Algorithm (MEWRA). In the proposed approach weather route recommendations can be made simultaneously e.g. for passage time, fuel consumption and safety of passage by means of Pareto optimisation. The sets of criteria and constraints in the optimisation process are fully...
-
APPLICATION OF APRIORI ALGORITHM IN THE LAMINATION PROCESS IN YACHT PRODUCTION
PublikacjaThe 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...
-
Programming Geometry as a Creative Play with Architectural Form
PublikacjaIn the twenty-first century "programming" is the key word that opens unprecedented opportunities for design and materialization of geometrically complex architectural objects. From the digital designer perspective programming geometry can be seen as a creative play with a form and a process of generation/exploration as well as the possibility of applying the computing power as a co-designer in the process of finding solutions for...
-
Partial dominated schedules and minimizing the total completion time of deteriorating jobs
PublikacjaA problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function pi=ai+bisi, where si is the starting time of the job, ai>=0, bi>=0, for i=1,...,n. Jobs are non-preemptive and independent and there are neither ready times nor deadlines. The goal is to minimize the total weighted completion time. We show how to employ the concept of non-dominated schedules to construct...
-
Complexity Issues on of Secondary Domination Number
PublikacjaIn 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...