displaying 1000 best results Help
Search results for: ROOT FINDING ALGORITHM
-
Complex Root Finding Algorithm Based on Delaunay Triangulation
PublicationA simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points...
-
Efficient Complex Root Finding Algorithm for Microwave and Optical Propagation Problems
PublicationArticle relates to the use of innovative root finding algorithm (on a complex plane) to study propagation properties of microwave and optical waveguides. Problems of this type occur not only in the analysis of lossy structures, but also in the study of complex and leaky modes (radiation phenomena). The proposed algorithm is simple to implement and can be applied for functions with singularities and branch cuts in the complex plane...
-
On root finding algorithms for complex functions with branch cuts
PublicationA simple and versatile method is presented, which enhances the complex root finding process by eliminating branch cuts and branch points in the analyzed domain. For any complex function defined by a finite number of Riemann sheets, a pointwise product of all the surfaces can be obtained. Such single-valued function is free of discontinuity caused by branch cuts and branch points. The roots of the new function are the same as the...
-
Evaluation of propagation parameters of open guiding structures with the use of complex root finding algorithms
PublicationAn efficient complex root tracing algorithm is utilized for the investigation of electromagnetic wave propagation in open guiding structures. The dispersion characteristics of propagated and leaky waves are calculated for a couple of chosen waveguides. The efficiency of the root tracing algorithm is discuses and compared to a global root finding algorithm.
-
An efficient algorithm for finding ideal schedules
PublicationPodejmujemy problem szeregowania zadań jednostkowych z zadanymi czasamy przybycia i zależnościami kolejnościowymi. Uszeregowanie jest idealne jeśli jednocześnie minimalizuje maksymalny oraz średni czas zakończenia zadania. Podajemy przyklad pokazujący, że uszeregowania idealne nie istnieją dla relacji zależności zadań będącej drzewem, gdy dopuścimy możliwość wystąpienia przerwań. Z drugiej strony podajemy algorytm o złożoności...
-
A polynomial algorithm for finding T-span of generalized cacti
Publication -
A polynomial algorithm for finding T-span of generalized cacti.
PublicationW pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.
-
Efficient Complex Root Tracing Algorithm for Propagation and Radiation Problems
PublicationAn efficient complex root tracing algorithm for propagation and radiation problems is presented. The proposed approach is based on a discretization of Cauchy’s Argument Principle and its generalization to the C × R space. Moreover, an engagement of the tracing process with a global root finding algorithm recently presented in the literature is performed. In order to confirm a validity and efficiency of the proposed technique, a...
-
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...
-
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.
-
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...
-
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...
-
Multi-objective electric distribution network reconfiguration solution using runner-root algorithm
Publication -
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...
-
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...
-
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...
-
Scattering and Propagation Analysis for the Multilayered Structures Based on Field Matching Technique
PublicationA 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 New Approach to Stability Evaluation of Digital Filters
PublicationIn 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...
-
Numerical Test for Stability Evaluation of Discrete-Time Systems
PublicationIn 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...
-
Analysis of graphene multi-strip planar guiding structures with the use of spectral domain approach
PublicationSpectral domain approach is modified and used to analyze some simple structures containing graphene strips. The modification is simple and concerns the Green’s function only. Moreover, the method is combined with the recently published root finding algorithms, which significantly improve the efficiency of the analysis. The results obtained for a simple guiding structure is verified and the field displacement effect is confirmed.
-
RECSYS CHALLENGE 2015: a BUY EVENT PREDICTION IN THE E-COMMERCE DOMAIN
PublicationIn this paper we present our approach to RecSys Challenge 2015. Given a set of e-commerce events, the task is to predict whether a user will buy something in the current session and, if yes, which of the item will be bought. We show that the data preparation and enrichment are very important in finding the solution for the challenge and that simple ideas and intuitions could lead to satisfactory results. We also show that simple...
-
Stability analysis of interconnected discrete-time fractional-order LTI state-space systems
PublicationIn this paper, a stability analysis of interconnected discrete-time fractional-order (FO) linear time-invariant (LTI) state-space systems is presented. A new system is formed by interconnecting given FO systems using cascade, feedback, parallel interconnections. The stability requirement for such a system is that all zeros of a non-polynomial characteristic equation must be within the unit circle on the complex z-plane. The obtained...
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 194
Open Research DataThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 194, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 192
Open Research DataThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 192, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 191
Open Research DataThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 191, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 193
Open Research DataThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 193, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 190
Open Research DataThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 190, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Metody zwiększania dostępności i efektywności informatycznej infrastruktury w inteligentnym mieście
PublicationW pracy omówiono metody zwiększania dostępności i efektywności informatycznej infrastruktury w inteligentnym mieście. Sformułowano dwa kryteria do oceny rozmieszczenia kluczowych zasobów w systemie smart city. Zobrazowano proces wyznaczania rozwiązań kompromisowych spośród rozwiązań Pareto-optymalnych. Omówiono metaheurystyki inteligencji zbiorowej, w tym roju cząstek, kolonii mrówek, roju pszczół oraz ewolucji różnicowej, za pomocą...
-
Evaluating Accuracy of Respiratory Rate Estimation from Super Resolved Thermal Imagery
PublicationNon-contact estimation of Respiratory Rate (RR) has revolutionized the process of establishing the measurement by surpassing some issues related to attaching sensors to a body, e.g. epidermal stripping, skin disruption and pain. In this study, we perform further experiments with image processing-based RR estimation by using various image enhancement algorithms. Specifically, we employ Super Resolution (SR) Deep Learning (DL) network...
-
Multipath Complex Root Tracing
PublicationThe problem of multipath root tracing is being addressed in this communication. The self-adaptive complex root tracing algorithm, which was previously utilized for the investigation of various propagation and radiation problems, is analyzed here for the cases when the traced characteristic bifurcates. A procedure of multiroute detection is proposed and demonstrated on the coaxially loaded cylindrical waveguide example.
-
The Chow Ring of flag manifolds
Open Research DataSchubert calculus is the intersection theory of 19th century. Justifying this calculus is the content of the 15th problem of Hilbert. In the course to establish the foundation of algebraic geometry, Van der Vaerden and A. Weil attributed the problem to the determination of the chow ring of flag manifolds G/P, where G is a compact Lie group and P is...
-
Square root RC Nyquist filter of fractional delay
PublicationIn this paper we propose a discrete-time FIR (finite impulse response) filter which couples the role of square root Nyquist filter with fractional delay filter. This filter enables to substitute for a cascade of square root RC (SRRC) Nyquist filter and fractional delay filter in one device/algorithm. The aim is to compensate for transmission delay in communication system. Statistically defined performances, e.g. BER (bit error...
-
Plant Root
Journals -
Square Root Raised Cosine Fractionally Delaying Nyquist Filter - Design and Performance Evaluation
PublicationIn this paper we propose a discrete-time FIR (Finite Impulse Response) filter which is applied as a square root Nyquist filter and fractional delay filter simultaneously. The filter enables to substitute for a cascade of square root Nyquist filter and fractional delay filter in one device/algorithm. The aim is to compensate for transmission delay in digital communication system. Performance of the filter as a matched filter is...
-
Variational Method of Finding Streamlines in Ring Cascades for Creeping Flows
PublicationThis paper presents a new, analytical method of finding streamlinesfor creeping flows inside a ring cascade which is composed of an infinite number of infinitely thin blades. An analytical solution has been obtained through minimisation of a dissipation functional by means of variational calculus method. The necessary condition for optimum of a functional gives the Stokes equation if some additional assumptions are introduced....
-
Mersenne Number Finding and Collatz Hypothesis Verification in the Comcute Grid System
PublicationIn this chapter, some mathematic applications have been described to test scalability of the Comcute grid system. Especially, a verification of the Collatz hypothesis and finding Mersenne numbers were applied to prove the scalability and high performance of this grid system. Results were compared with outcomes obtained by the other grid systems.
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating 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...
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublicationThe 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...
-
FPGA realization of an improved alpha max plus beta min algorithm
PublicationThe generalized improved version of the alpha max plus beta min square-rooting algorithm and its realization in the Field Programmable Gate Array (FPGA) are presented. The algorithm computes the square root to calculate the approximate magnitude of a complex sample. It is especially useful for pipelined calculations in the DSP. In case of four approximation regions it is possible to reduce the peak error form 3.95% to 0.33%. This...
-
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...
-
Performance comparison of new modified gradient algorithm and Foy algorithm for iterative position calculation
PublicationIn the paper a new position calculation algorithm is presented. It is proposed for indoor environments and is called modified gradient algorithm. This algorithm is compared with well-known Foy algorithm. The comparative analysis is based on real distance measurements conducted in indoor environment.
-
Multicriteria Evolutionary Weather Routing Algorithm in Practice
PublicationThe Multicriteria Evolutionary Weather Routing Algorithm (MEWRA) has already been introduced by the author on earlier TransNav 2009 and 2011 conferences with a focus on theoretical application to a hybrid-propulsion or motor-driven ship. This paper addresses the topic of possible practical weather routing applications of MEWRA. In the paper some practical advantages of utilizing Pareto front as a result of multicriteria optimization...
-
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...
-
Field Cultivation and in vitro Cultures, Root-Forming Callus Cultures and Adventitious Root Cultures, of Panax quinquefolium as a Source of Ginsenosides
Publication -
Establishment of hairy root cultures of Ammi majus
Publication -
Why do Open Government Data initiatives fail in developing countries? A root cause analysis of the most prevalent barriers and problems
PublicationOpen government data (OGD) include the provision of government data, which have so far been reserved for the provision of public utilities and services, wherein different stakeholders may create value out of the same source. Recently, OGD initiatives around the world have dampened or were found to be inadequate for one or other reasons. The present study seeks to underline the root causes behind these inadequate or stalled initiatives...
-
APPLICATION OF APRIORI ALGORITHM IN THE LAMINATION PROCESS IN YACHT PRODUCTION
PublicationThe 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...
-
The effect of impacted third molars on second molar external root resorption, a cross-sectional cone beam computed tomography study
PublicationBackground: Third molars have the highest prevalence of impaction in teeth and can cause pathological damage on the adjacent second molars. This study aims to evaluate the effects of factors related to impacted third molars on external root resorption (ERR) in adjacent second molars using cone-beam computed tomography (CBCT). Material and Methods: In CBCTs, the effect of impacted third molars on the root surface of adjacent second...
-
Finding deformation of the straight rail track by GNSS measurements
PublicationW 2009 roku na Politechnice Gdańskiej i Akademii Marynarki Wojennej w Gdyni zostały przeprowadzone, po raz pierwszy, ciągłe pomiary satelitarne toru kolejowego z wykorzystaniem względnej metody fazowej na bazie polskiej Aktywnej Sieci Geodezyjnej ASG-EUPOS i serwisu czasu rzeczywistego RTK (GPRS) - NAVGEO. Przeprowadzona analiza wykazała silny związek między lokalizacją odbiornika GNSS i dokładnością wyznaczania pozycji, wpływ...
-
Adversarial attack algorithm for traffic sign recognition
PublicationDeep learning suffers from the threat of adversarial attacks, and its defense methods have become a research hotspot. In all applications of deep learning, intelligent driving is an important and promising one, facing serious threat of adversarial attack in the meanwhile. To address the adversarial attack, this paper takes the traffic sign recognition as a typical object, for it is the core function of intelligent driving. Considering...
-
Interactive Information Retrieval Algorithm for Wikipedia Articels
PublicationThe article presents an algorithm for retrieving textual information in documents collection. The algorithm employs a category system that organizers the repository and using interaction with user improves search precision. The algorithm was implemented for simple English Wikipedia and the first evaluation results indicates the proposed method can help to retrieve information from large document repositories.
-
New Indoor Positioning Algorithm for Distance Measurements
PublicationIn the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
Termination functions for evolutionary path planning algorithm
PublicationIn this paper a study of termination functions (stop criterion) for evolutionary path planning algorithm is presented. Tested algorithm is 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. For the simulation purposes a close to real tested environment is created. Five...
-
Adaptive Algorithm for Interactive Question-based Search
PublicationPopular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...
-
Chromatographic separation, determination and identification of ecdysteroids: Focus on Maral root (Rhaponticum carthamoides, Leuzea carthamoides )
PublicationThe review presents general principles for choosing optimal conditions for ecdysteroid separation, identification, and isolation using HPLC/TLC techniques in RP, NP- HILIC or NP modes. Analytics of ecdyteroids pose a still insufficiently resolved problem. Plant-derived ecdysteroids are a point of interest of pharmaceutical industry and sport medicine due to their postulated adaptogenic and anabolic properties. In insects, ecdysteroids...
-
Comparison of new position estimation algorithm for indoor environment
PublicationIn the paper a new position estimation algorithm based on distance measurements is presented. This algorithm is dedicated for indoor environments. In the paper the new algorithm is compared with Chan algorithm. For the comparison were used real measurements conducted inside a building.
-
Superresolution algorithm to video surveillance system
PublicationAn application of a multiframe SR (superresolution) algorithm applied to video monitoring is described. The video signal generated by various types of video cameras with different parameters and signal distortions which may be very problematic for superresolution algorithms. The paper focuses on disadvantages in video signal which occur in video surveillance systems. Especially motion estimation and its influence on superresolution...
-
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...
-
Information Retrieval with the Use of Music Clustering by Directions Algorithm
PublicationThis paper introduces the Music Clustering by Directions (MCBD) algorithm. The algorithm is designed to support users of query by humming systems in formulating queries. This kind of systems makes it possible to retrieve songs and tunes on the basis of a melody recorded by the user. The Music Clustering by Directions algorithm is a kind of an interactive query expansion method. On the basis of query, the algorithm provides suggestions...
-
Damage Detection in the Wind Turbine Blade Using Root Mean Square and Experimental Modal Parameters
PublicationThe paper presents results of an experimental study related to a non-destructive diagnostic technique used for preliminary determination the location and size of delamination in composite coatings of wind turbine blades. The proposed method of damage detection is based on the analysis of the ten first mode shapes of bending vibrations, which correspond to displacements of rotor blades perpendicular to the rotor plane. Modal parameters...
-
Ontology clustering by directions algorithm to expand ontology queries
PublicationThis paper concerns formulating ontology queries. It describes existing languages in which ontologies can be queried. It focuses on languages which are intended to be easily understood by users who are willing to retrieve information from ontologies. Such a language can be, for example, a type of controlled natural language (CNL). In this paper a novel algorithm called Ontology Clustering by Directions is presented. The algorithm...
-
Reproducibility of Finding Enriched Gene Sets in Biological Data Analysis
Publication -
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Lexicon Based Algorithm for Domain Ontology Merging and Alignment
PublicationMore and more systems contain some kind of knowledge describing their field of operation. Such knowledge in many cases is stored as an ontology. A need arises for ability to quickly match those ontologies to enable interoperability of such systems. The paper presents a lexicon based algorithm for merging and aligning of OWL ontologies. The proposed similarity levels are being presented and the proposed algorithm is being described....
-
DEVELOPMENT OF THE ALGORITHM OF POLISH LANGUAGE FILM REVIEWS PREPROCESSING
PublicationThe algorithm and the software for conducting the procedure of Preprocessing of the reviews of films in the Polish language were developed. This algorithm contains the following steps: Text Adaptation Procedure; Procedure of Tokenization; Procedure of Transforming Words into the Byte Format; Part-of-Speech Tagging; Stemming / Lemmatization Procedure; Presentation of Documents in the Vector Form (Vector Space Model) Procedure; Forming...
-
Clonal selection algorithm for vehicle routing
PublicationOver the years several successful computing techniques have been inspired by biological mechanisms. Studies of the mechanisms that allow the immune systems of vertebratesto adapt and learn have resulted in a class of algorithms called artificial immune systems. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents...
-
Distributed Evolutionary Algorithm for Path Planning in Navigation Situation
PublicationThis article presents the use of a multi-population distributed evolutionary algorithm for path planning in navigation situation. The algorithm used is with partially exchanged population and migration between independently evolving populations. In this paper a comparison between a multi-population and a classic single-population algorithm takes place. The impact on the ultimate solution has been researched. It was shown that using...
-
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,...
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
Experimental research on evolutionary path planning algorithm with fitness function scaling for collision scenarios
PublicationThis article presents typical ship collision scenarios, simulated using the evolutionary path planning system and analyses the impact of the fitness function scaling on the quality of the solution. The function scaling decreases the selective pressure, which facilitates leaving the local optimum in the calculation process and further exploration of the solution space. The performed investigations have proved that the use of scaling...
-
Impact of Initial Population on Evolutionary Path Planning Algorithm
PublicationIn this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal shippaths 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. For the simulation purposes a close to real tested environment is created. Four tests are performed....
-
AN ALGORITHM FOR PORTAL HYPERTENSIVE GASTROPATHY RECOGNITION ON THE ENDOSCOPIC RECORDINGS
PublicationSymptoms recognition of portal hypertensive gastropathy (PHG) can be done by analysing endoscopic recordings, but manual analysis done by physician may take a long time. This increases probability of missing some symptoms and automated methods may be applied to prevent that. In this paper a novel hybrid algorithm for recognition of early stage of portal hypertensive gastropathy is proposed. First image preprocessing is described....
-
Proximal primal–dual best approximation algorithm with memory
PublicationWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
Impact of Initial Population on Evolutionary Path Planning Algorithm
PublicationIn this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is 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. For the simulation purposes a close to real tested environment is created. Four tests are performed....
-
Novel 5.1 Downmix Algorithm with Improved Dialogue Intelligibility
PublicationA new algorithm for 5.1 to stereo downmix is introduced, which addresses the problem of dialogue intelligibility. The algorithm utilizes proposed signal processing algorithms to enhance the intelligibility of movie dialogues, especially in difficult listening conditions or in compromised speaker setup. To account for the latter, a playback configuration utilizing a portable device, i.e. an ultrabook, is examined. The experiments...
-
Using Long-Short term Memory networks with Genetic Algorithm to predict engine condition
PublicationPredictive maintenance (PdM) is a type of approach for maintenance processes, allowing maintenance actions to be managed depending on the machine's current condition. Maintenance is therefore carried out before failures occur. The approach doesn’t only help avoid abrupt failures but also helps lower maintenance cost and provides possibilities to manufacturers to manage maintenance budgets in a more efficient way. A new deep neural...
-
Point cloud unification with optimization algorithm
PublicationTerrestrial laser scanning is a technology that enables to obtain three-dimensional data – an accurate representation of reality. During scanning not only desired objects are measured, but also a lot of additional elements. Therefore, unnecessary data is being removed, what has an impact on efficiency of point cloud processing. It can happen while single point clouds are displayed – user decides what he wants...
-
Robust algorithm for active feedback control of narrowband noise
PublicationThe problem of active control of narrowband acoustic noise is considered. It is shown that the proposed earlier feedback control algorithm called SONIC (self-optimizing narrowband interference canceller), based on minimization of the L2-norm performance measure, can be re-derived using the L1 approach. The resulting robust SONIC algorithm is more robust to heavy-tailed measurement noise, such as the αlpha-stable noise, than the...
-
Selection of optimal location and rated power of capacitor banks in distribution network using genetic algorithm
PublicationIn this paper, the problem of placement and rated power of capacitor banks in the Distribution Network (DN) is considered. We try to suggest the best places for installing capacitor banks and define their reactive power. The considered formulation requires the optimization of the cost of two different objectives. Therefore the use of properly multiobjective heuristic optimization methods is desirable. To solve this problem we use...
-
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...
-
Eventual Convergence of the Reputation-Based Algorithm in IoT Sensor Networks
PublicationUncertainty in dense heterogeneous IoT sensor networks can be decreased by applying reputation-inspired algorithms, such as the EWMA (Exponentially Weighted Moving Average) algorithm, which is widely used in social networks. Despite its popularity, the eventual convergence of this algorithm for the purpose of IoT networks has not been widely studied, and results of simulations are often taken in lieu of the more rigorous proof....
-
Voice command recognition using hybrid genetic algorithm
PublicationAbstract: Speech recognition is a process of converting the acoustic signal into a set of words, whereas voice command recognition consists in the correct identification of voice commands, usually single words. Voice command recognition systems are widely used in the military, control systems, electronic devices, such as cellular phones, or by people with disabilities (e.g., for controlling a wheelchair or operating a computer...
-
Moving object tracking algorithm evaluation in autonomous surveillance system
PublicationResults of evaluation of video object tracking algorithm being a part of an autonomous surveillance system are presented. The algorithm was investigated employing a set of benchmarks recorded locally. The precision of object detection, evaluated with such metrics as fragmentation, object area recall and object precision, is in focus. The experiments aimed at examining the detection quality using various object detection algorithm...
-
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,...
-
Finding Temperature Distribution at Heat Recovery Unit Using Genetic Algorithms
Publication -
Finding the protection of lighting grounding with estimating its impulse impedance componets
PublicationOmówiono metodę rozdzielania składowych impedancji udarowej uziemień. Podano wskazania dotyczące oceny jakości ochrony odgromowej na podstawie wartości składowych impedancji udarowej.
-
Determining PAHs and PCBs in aqueous samples: finding and evaluating sources of error
PublicationW pracy opisano wyniki badań modelowych (z wykorzystaniem dopowiednich roztworów wzorcowych), których celem było wykrycie źródeł błędów oznaczeń oraz oszacowanie ich wielkości. Przedmiotem badań było oszacowanie wpływu takich procesów jak:- adsorpcja na ściankach naczyń,- adsorpcja na cząstkach materii zawieszonej,- usuwanie nadmiaru rozpuszczalnika (z ekstraktu)na wyniki oznaczeń końcowych.
-
A note on an approximative scheme of finding almost homoclinic solutions for Newtonian systems
PublicationIn this work we will be concerned with the existence of an almost homoclinic solution for a perturbed Newtonian system in a finite dimensional space. It is assumed that a potential is C^1 smooth and its gradient is bounded with respect to a time variable. Moreover, a forcing term is continuous, bounded and squere integrable. We will show that the appproximative scheme due to J. Janczewska for a time periodic potential extends to...
-
An approximative scheme of finding almost homoclinic solutions for a class of Newtonian systems
PublicationW niniejszej pracy badamy istnienie rozwiązań prawie homoklinicznych (ang. almost homoclinic solutions) dla pewnej klasy układów Newtona. Rozwiązanie prawie homokliniczne otrzymujemy jako granicę ciągu rozwiązań okresowych dla pewnego ciągu równań różniczkowych.
-
The Method of Finding the Optimal Spindle Speed When Milling Flexible Details
PublicationThe paper presents a new method of vibration reduction during milling of flexible details. The method consists in selecting the optimal spindle speed, based on the natural frequency of the workpiece. For this purpose, an original method was created, which is based on minimizing the work of cutting forces in the direction of the depth of cutting. The effectiveness of the method has been proved by comparing the RMS values of vibration...
-
Using River Formation Dynamics Algorithm in Mobile Robot Navigation
PublicationRiver Formation Dynamics is a heuristic optimization algorithm based on the manner, in which drops of water form the river bed. The idea is to imitate the movement of drops on the edges between given nodes thus performing a search based on their height, which is modified through the mechanism of soil erosion and sediment deposition. In this way decreasing gradients are constructed, and these are followed by subsequent drops to...
-
A Parallel Genetic Algorithm for Creating Virtual Portraits of Historical Figures
PublicationIn this paper we present a genetic algorithm (GA) for creating hypothetical virtual portraits of historical figures and other individuals whose facial appearance is unknown. Our algorithm uses existing portraits of random people from specific historical period and social background to evolve a set of face images potentially resembling the person whose image is to be found. We then use portraits of the person's relatives to judge...
-
Hardware realization of shadow detection algorithm in FPGA
PublicationW referacie opisano problem detekcji cieni w sekwencjach wideo. Na podstawie metod znanych z literatury opracowano algorytm detekcji cieni, działający w czasie rzeczywistym i przeznaczony do realizacji sprzętowej w układzie FPGA. Algorytmy zostały przetestowane i porównane w środowisku MATLAB. Za pomocą języka VHDL zrealizowano system detekcji cieni wykorzystujący opracowany algorytm i zaimplementowano go w układzie Virtex-4. Został...
-
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
-
Video analytics-based algorithm for monitoring egress from buildings
PublicationA concept and a practical implementation of the algorithm for detecting of potentially dangerous situations related to crowding in passages is presented. An example of such a situation is a crush which may be caused by an obstructed pedestrian pathway. The surveillance video camera signal analysis performed in the online mode is employed in order to detect hold-ups near bottlenecks like doorways or staircases. The details of the...
-
Video Analytics-Based Algorithm for Monitoring Egress from Buildings
PublicationA concept and practical implementation of the algorithm for detecting of potentially dangerous situations of crowding in passages is presented. An example of such situation is a crush which may be caused by obstructed pedestrian pathway. Surveillance video camera signal analysis performed on line is employed in order to detect hold-ups near bottlenecks like doorways or staircases. The details of implemented algorithm which uses...