Filters
total: 402
filtered: 365
-
Catalog
Chosen catalog filters
Search results for: DOMINATION NUMBER, ALGORITHM, TREE
-
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...
-
An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds
PublicationFor a given self-map f of M, a closed smooth connected and simply-connected manifold of dimension m 4, we provide an algorithm for estimating the values of the topological invariant D^m_r [f], which equals the minimal number of r-periodic points in the smooth homotopy class of f. Our results are based on the combinatorial scheme for computing D^m_r [f] introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013),...
-
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...
-
Accelerating Video Frames Classification With Metric Based Scene Segmentation
PublicationThis paper addresses the problem of the efficient classification of images in a video stream in cases, where all of the video has to be labeled. Realizing the similarity of consecutive frames, we introduce a set of simple metrics to measure that similarity. To use these observations for decreasing the number of necessary classifications, we propose a scene segmentation algorithm. Performed experiments have evaluated the acquired...
-
Deep-Learning-Based Precise Characterization of Microwave Transistors Using Fully-Automated Regression Surrogates
PublicationAccurate models of scattering and noise parameters of transistors are instrumental in facilitating design procedures of microwave devices such as low-noise amplifiers. Yet, data-driven modeling of transistors is a challenging endeavor due to complex relationships between transistor characteristics and its designable parameters, biasing conditions, and frequency. Artificial neural network (ANN)-based methods, including deep learning...
-
Pressure drop and heat transfer during boiling and condensation at subcritical region
PublicationMost of the data presented in the literature relate to saturation temperatures in the range - 20°C to 40°C due to the application in refrigeration technology. There is necessity to extend databases to higher values of saturation temperature due to new applications such as Organic Rankine Cycle and high temperature heat pumps. Only few papers contain data for high reduced pressure for low boiling point liquids. This paper focus...
-
Expedited antenna optimization with numerical derivatives and gradient change tracking
PublicationDesign automation has been playing an increasing role in the development of novel antenna structures for various applications. One of its aspects is electromagnetic (EM)-driven design closure, typically applied upon establishing the antenna topology, and aiming at adjustment of geometry parameters to boost the performance figures as much as possible. Parametric optimization is often realized using local methods given usually reasonable...
-
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...
-
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...
-
Adaptive Method for Modeling of Temporal Dependencies between Fields of Vision in Multi-Camera Surveillance Systems
PublicationA method of modeling the time of object transition between given pairs of cameras based on the Gaussian Mixture Model (GMM) is proposed in this article. Temporal dependencies modeling is a part of object re-identification based on the multi-camera experimental framework. The previously utilized Expectation-Maximization (EM) approach, requiring setting the number of mixtures arbitrarily as an input parameter, was extended with the...
-
Data fusion of GPS sensors using Particle Kalman Filter for ship dynamic positioning system
PublicationDepending on standards and class, dynamically positioned ships make use of different numbers of redundant sensors to determine current ship position. The paper presents a multi-sensor data fusion algorithm for the dynamic positioning system which allows it to record the proper signal from a number of sensors (GPS receivers). In the research, the Particle Kalman Filter with data fusion was used to estimate the position of the vessel....
-
Collision-free network exploration
PublicationMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
Application of Regression Line to Obtain Specified Number of Points in Reduced Large Datasets
PublicationModern measurement techniques like scanning technology or sonar measurements, provide large datasets, which are a reliable source of information about measured object, however such datasets are sometimes difficult to develop. Therefore, the algorithms for reducing the number of such sets are incorporated into their processing. In the reduction algorithms based on the...
-
Discrete convolution based on polynomial residue representation
PublicationThis paper presents the study of fast discrete convolution calculation with use of the Polynomial Residue Number System (PRNS). Convolution can be based the algorithm similar to polynomial multiplication. The residue arithmetic allows for fast realization of multiplication and addition, which are the most important arithmetic operations in the implementation of convolution. The practical aspects of hardware realization of PRNS...
-
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...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Gaze tracking in multi-display environment
PublicationThis paper presents the basic ideas of eye and gaze tracking in multiple-display environment. The algorithm for display detection and identification is described as well as the rules for gaze interaction in multi display environment. The core of the method is to use special LED markers and eye and scene tracking glasses. Scene tracking camera registers markers position which is then represented as a cloud of points. Analyzing the...
-
Pipelined division of signed numbers with the use of residue arithmetic in FPGA
PublicationAn architecture of a pipelined signed residue divider for small number ranges is presented. The divider makes use of the multiplicative division algorithm where initially the reciprocal of the divisor is calculated and subsequently multiplied by the dividend. The divisor represented in the signed binary form is used to compute the approximated reciprocal in the residue form by the table look-up. In order to reduce the needed length...
-
An inverse algorithm for contact heat conduction problems with an interfacial heat source based on a first-order thermocouple model
PublicationInverse problems of contact heat conduction with an interfacial heat source are common in various fields of science, engineering and technology. In this study, an algorithm for their solution is developed based on an inverse parametric optimisation method with an impulse response function describing the heat partition and contact heat transfer. A first-order thermocouple model with a time constant parameter is embedded in the impulse...
-
Improving methods for detecting people in video recordings using shifting time-windows
PublicationWe propose a novel method for improving algorithms which detect the presence of people in video sequences. Our focus is on algorithms for applications which require reporting and analyzing all scenes with detected people in long recordings. Therefore one of the target qualities of the classification result is its stability, understood as a low number of invalid scene boundaries. Many existing methods process images in the recording...
-
A bisection‐based heuristic for rapid EM‐driven multiobjective design of compact impedance transformers
PublicationDesign of microwave structures is a multiobjective task where several conflicting requirements have to be considered at the same time. For contemporary circuits characterized by complex geometries, multiobjective optimization cannot be performed using standard population‐based algorithms due to high cost of electromagnetic (EM) evaluations. In this work, we propose a deterministic approach for fast EM‐driven multiobjective design...
-
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...
-
Employing flowgraphs for forward route reconstruction in video surveillance system
PublicationPawlak’s flowgraphs were utilized as a base idea and knowledge container for prediction and decision making algorithms applied to experimental video surveillance system. The system is used for tracking people inside buildings in order to obtain information about their appearance and movement. The fields of view of the cameras did not overlap. Therefore, when an object was moving through unsupervised areas, prediction was needed...
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublicationWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Improving depth maps of plants by using a set of five cameras
PublicationObtaining high-quality depth maps and disparity maps with the use of a stereo camera is a challenging task for some kinds of objects. The quality of these maps can be improved by taking advantage of a larger number of cameras. The research on the usage of a set of five cameras to obtain disparity maps is presented. The set consists of a central camera and four side cameras. An algorithm for making disparity maps called multiple...
-
PLC-based Implementation of Stochastic Optimization Method in the Form of Evolutionary Strategies for PID, LQR, and MPC Control
PublicationProgrammable logic controllers (PLCs) are usually equipped with only basic direct control algorithms like proportional-integral-derivative (PID). Modules included in engineering software running on a personal computer (PC) are usually used to tune controllers. In this article, an alternative approach is considered, i.e. the development of a stochastic optimizer based on the (μ,λ) evolution strategy (ES) in a PLC. For this purpose,...
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
Macromodels for efficient FEM simulations of waveguides and resonators
PublicationThis paper introduces a novel technique for enhancing the efficiency of the finite element method (FEM) by incorporating special modules, called macromodels, into the standard eigenvalue formulation. The number of unknowns in the separated macromodel subdomain can be significantly reduced by orthogonal projection, using the efficient nodal order reduction algorithm. The idea of macromodels implementation is demonstrated on a simple...
-
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...
-
Study of various machine learning approaches for Sentinel-2 derived bathymetry
PublicationIn recent years precise and up-to-date information regarding seabed depth has become more and more important for companies and institutions that operate on coastlines. While direct, in-situ measurements are performed regularly, they are expensive, time-consuming and impractical to be performed in short time intervals. At the same time, an ever-increasing amount of satellite imaging data becomes available. With these images, it...
-
Multi-agent graph searching and exploration algorithms
PublicationA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
The study on the appearance of deformation defects in the yacht lamination process using an AI algorithm and expert knowledge
PublicationThis article describes the application of the A-priori algorithm for defining the rule-based relationships between individual defects caused during the lamination process, affecting the deformation defect of the yacht shell. The data from 542 yachts were collected and evaluated. For the proper development of the algorithm, a technological process of the yacht lamination supported by expert decisions was described. The laminating...
-
Multimodal Particle Swarm Optimization with Phase Analysis to Solve Complex Equations of Electromagnetic Analysis
PublicationIn this paper, a new meta-heuristic method of finding roots and poles of a complex function of a complex variable is presented. The algorithm combines an efficient space exploration provided by the particle swarm optimization (PSO) and the classification of root and pole occurrences based on the phase analysis of the complex function. The method initially generates two uniformly distributed populations of particles on the complex...
-
Adaptive identification of sparse underwater acoustic channels with a mix of static and time-varying parameters
PublicationWe consider identification of sparse linear systems with a mix of static and time-varying parameters. Such systems are typical in underwater acoustics (UWA), for instance, in applications requiring identi- fication of the acoustic channel, such as UWA communications, navigation and continuous-wave sonar. The recently proposed fast local basis function (fLBF) algorithm provides high performance when identi- fying time-varying systems....
-
Influence of Self-Similar Traffic Type on Performance of QoS Routing Algorithms
PublicationProviding a Quality of Services (QoS) into current telecommunication networks based on packet technology is a big challenge nowadays. Network operators have to support a number of new services like voice or video which generate new type of traffic. This traffic serviced with QoS in consequence requires access to appropriate network resources. Additionally, new traffic type is mixed with older one, like best-effort. Analysis of...
-
Local response surface approximations and variable-fidelity electromagnetic simulations for computationally efficient microwave design optimisation
PublicationIn this study, the authors propose a robust and computationally efficient algorithm for simulation-driven design optimisation of microwave structures. Our technique exploits variable-fidelity electromagnetic models of the structure under consideration. The low-fidelity model is optimised using its local response surface approximation surrogates. The high-fidelity model is refined by space mapping with polynomial interpolation of...
-
Computational Bar Size Optimization of Single Layer Dome Structures Considering Axial Stress and Shape Disturbance
PublicationA computational method is proposed in this paper to minimize the material usage in the construction of modern spatial frame structures by prestressing a minimal number of members. The computational optimization is conducted in two steps. Firstly, a numerical model of a single-layer dome structure is used to minimize the cross-sectional area through several iterations. Different assumed ratios (r) ranging from 0.95 to 0.75 are multiplied...
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
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...
-
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...
-
Discovering patterns of Web Page Visits from Associaton Rules Viewpoint
PublicationThe popularity of the Internet results from the almost unlimited resources of information stored in it. At the same time, Internet portals have become a widespread source of information and note very large number of visits. The list of web pages opened by users is stored in web servers' log files. Extraction of knowledge on the navigation paths of users has become carefully analyzed problem. Currently, there are a number of algorithms...
-
Three-objective antenna optimization by means of kriging surrogates and domain segmentation
PublicationIn this paper, an optimization framework for multi-objective design of antenna structures is discussed which exploits data-driven surrogates, a multi-objective evolutionary algorithm, response correction techniques for design refinement, as well as generalized domain segmentation. The last mechanism is introduced to constrain the design space region subjected to sampling, which permits reduction of the number of training data samples...
-
Rzadka reprezentacja sygnału niestacjonarnego w technice oszczędnego próbkowania
PublicationPrzedstawiono zastosowanie techniki oszczędnego próbkowania do rekonstrukcji sygnału niestacjonarnego na podstawie skompresowanych próbek w dziedzinie czas-częstotliwość. Zastosowano nadmiarowy algorytm z różnymi słownikami aby znaleźć rzadką reprezentację sygnału. Wyniki symulacji potwierdzają, że zastosowanie oszczędnego próbkowania pozwala na rekonstrukcję sygnału niestacjonarnego z małej liczby losowo pobranych próbek, z niewielką...
-
Partially Isolated Multi-Active Bridge DC-DC Converter with Bidirectional EV Charging Ports
PublicationThere is a growing interest in multiport converters due to their ability to interconnect various energy sources and loads using reduced number of components. Regarding electric vehicle (EV) chargers connection, existing multiport solutions either lack scalability, featuring only one isolated charging port or the operation of ports depend on each other, complicating the converter control algorithm. This article proposes a partially...
-
Reduced-order models in the finite element analysis
PublicationA novel technique of incorporating macromodels into finite element electromagnetic analysis of waveguide components is presented. Macromodels are generated by using a model order reduction algorithm (ENOR), which results in significant decrease of the number of variables, that describe the computational region. Proposed technique allows for using a few independent macromodels as well as to duplicating one macromodel in many subregions...
-
Proposal of a method for effective tasks distribution in the execution of compolex problems
PublicationAn access to a great number of various services allows for decomposition of complex problems into smaller and less complex tasks. Those tasks can be presented in a form of a dependency graph. This paper shows an idea of executing such a problem using cooperating autonomous agents. Main focus of this work is cooperation covering effective tasks distribution among executors. This paper presents an algorithm for dynamic executor selection...
-
Fast EM-driven optimization using variable-fidelity EM models and adjoint sensitivities
PublicationA robust and computationally efficient technique for microwave design optimization is presented. Our approach exploits variable-fidelity electromagnetic (EM) simulation models and adjoint sensitivities. The low-fidelity EM model correction is realized by means of space mapping (SM). In the optimization process, the SM parameters are optimized together with the design itself, which allows us to keep the number...
-
Compressive Sensing Approach to Harmonics Detection in the Ship Electrical Network
PublicationThe contribution of this paper is to show the opportunities for using the compressive sensing (CS) technique for detecting harmonics in a frequency sparse signal. The signal in a ship’s electrical network, polluted by harmonic distortions, can be modeled as a superposition of a small number of sinusoids and the discrete Fourier transform (DFT) basis forms its sparse domain. According to the theory of CS, a signal may be reconstructed...
-
Autonomous port management based AGV path planning and optimization via an ensemble reinforcement learning framework
PublicationThe rapid development of shipping trade pushes automated container terminals toward the direction of intelligence, safety and efficiency. In particular, the formulation of AGV scheduling tasks and the safety and stability of transportation path is an important part of port operation and management, and it is one of the basic tasks to build an intelligent port. Existing research mainly focuses on collaborative operation between...