Search
Filters
total: 1024
filtered: 833
-
Catalog
Chosen catalog filters
Search results for: MATCHING PAIR DISTANCE
-
On a matching distance between rooted phylogenetic trees
PublicationThe Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...
-
Matching Split Distance for Unrooted Binary Phylogenetic Trees
PublicationRekonstrukcja drzew ewolucji jest jednym z głównych celów w bioinformatyce. Drzewa filogenetyczne reprezentuje historię ewolucji i związki pokrewieństwa między różnymi gatunkami. W pracy proponujemy nową ogólną metodę określania odległości między nieukorzenionymi drzewami filogenetycznymi, szczególnie użyteczną dla dużych zbiorów gatunków. Następnie podajemy szczegółowe własności jednej metryki określonej przy użyciu tej metody...
-
Matching Split Distance for Unrooted Binary Phylogenetic Trees
Publication -
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions
PublicationAbility to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublicationIn the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...
-
Generalization of Phylogenetic Matching Metrics with Experimental Tests of Practical Advantages
PublicationThe ability to quantify a dissimilarity of different phylogenetic trees is required in various types of phylogenetic studies, for example, such metrics are used to assess the quality of phylogeny construction methods and to define optimization criteria in supertree building algorithms. In this article, starting from the already described concept of matching metrics, we define three new metrics for rooted phylogenetic trees. One...
-
Towards increasing F-measure of approximate string matching in O(1) complexity
PublicationThe paper analyzes existing approaches for approximate string matching based on linear search with Levenshtein distance, AllScan and CPMerge algorithms using cosine, Jaccard and Dice distance measures. The methods are presented and compared to our approach that improves indexing time using Locally Sensitive Hashing. Advantages and drawbacks of the methods are identified based on theoretical considerations as well as empirical evaluations...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublicationWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Quasi-analytical Near-to-Far Field Transformation Based on Field Matching Method for Scattering Problems
PublicationA new quasi-analytical near-to-far field transformation based on field matching method (field expansion in a base of Hankel functions) is presented. This approach uses finite element method to obtain near field, then the field is expressed in a base of Hankel functions. The evaluated coefficients allow to calculate the field outside the numerical domain, also in a far distance. The main advantage of the proposed technique is avoiding of...
-
Long-distance quantum communication over noisy networks without long-time quantum memory
PublicationThe problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension D and transmission...
-
Stereo vision with Equal Baseline Multiple Camera Set (EBMCS) for obtaining depth maps of plants
PublicationThis paper presents a method of improving the estimation of distances between an autonomous harvesting robot and plants with ripe fruits by using the vision system based on five cameras. The system is called Equal Baseline Multiple Camera Set (EBMCS). EBMCS has some features of a camera matrix and a camera array. EBMCS is regarded as a set of stereo cameras for estimating distances by obtaining disparity maps and depth maps. This...
-
Influence of Aggregating Window Size on Disparity Maps Obtained from Equal Baseline Multiple Camera Set (EBMCS)
PublicationThis paper is concerned with obtaining disparity maps on the basis of images from Equal Baseline Multiple Camera Set (EBMCS). EBMCS consists of a central camera and side cameras. Algorithms for obtaining disparity maps with the use of EBMCS take advantage of aggregating windows similarly to stereo matching algorithms for a stereo camera, a camera matrix or a camera array. The paper analyzes the influence of aggregating window size...
-
Disaster-Resilient Routing Schemes for Regional Failures
PublicationLarge-scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical...
-
Tracking body movement for radio channel measurements in BAN with indoor positioning system
PublicationThis paper presents indoor positioning system based on inertial navigation with additional distance measurements using UWB modems and map matching to increase accuracy and eliminate position drift. Such system may be used to track position of human body during radio channel measurements for body area networks. Performance of proposed system and limitations caused by inertial navigation are briefly described.
-
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...
-
3D Vision System for a Robotic Arm Based on Equal Baseline Camera Array
PublicationThis paper presents a lightweight 3D vision system called Equal Baseline Camera Array (EBCA). EBCA can work in different light conditions and it can be applied for measuring large range of distances. The system is a useful alternative to other known distance measuring devices such as structured-light 3D scanners, time-of-flight cameras, Light Detection and Ranging (LIDAR) devices and structure from motion techniques. EBCA can be...
-
Influence of image transformations and quality degradations on SURF detector efficiency
PublicationA method for task-oriented examination of SURF keypoint detector accuracy is presented in the paper. It consists of generating test images, based on a given exemplar, processed by affine transformations: random rotation and scaling, and varying degree of degradations: darkening, blurring, noising, and compression. Details of applied degradation procedure are presented, followed by essentials of SURF-based images matching. A distance...
-
On the partition dimension of trees
PublicationGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Circularly Polarized Antenna Array design with the Potential of Gain-Size Trade-off and Omnidirectional Radiation for Millimeter-Wave Small Base Station Applications
PublicationThis paper presents the design and validation of a slot-patch-hybrid circularly polarized antenna array for 28 GHz millimeter (mm) wave (mm-wave) applications. The proposed design has a simple geometry that facilitates the fabrication process, which is otherwise a challenging task due to the sub-mm dimensions of the circuit in the mm-wave band. In the proposed structure, aperture-coupled series slot-fed array is utilized to excite...
-
Relation-based Wikipedia Search System for Factoid Questions Answering
PublicationIn this paper we propose an alternative keyword search mechanism for Wikipedia, designed as a prototype solution towards factoid questions answering. The method considers relations between articles for finding the best matching article. Unlike the standard Wikipedia search engine and also Google engine, which search the articles content independently, requiring the entire query to be satisfied by a single article, the proposed...
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Miniaturized Metal-Mountable U-shaped Inductive-Coupling-Fed UHF RFID Tag Antenna with Defected Microstrip Surface
PublicationThis study presents a novel miniature ultra-high frequency (UHF) radio frequency identification (RFID) tag for metallic objects. Its arrangement includes a U-shaped feeder, which is inductively coupled to two E-type connected patches. Size reduction is achieved by means of utilizing the U-shaped feeder, and introducing a defection in the connection between the two E-type patches. The defection in the connection area between the...
-
Biometryczna kontrola dostępu
PublicationOpisano szczegółowo algorytm detekcji oraz identyfikacji człowieka na podstawie punktów nodalnych twarzy. Zdefiniowano pojęcia: biometria, proces pomiaru biometrycznego, metody biometrycznej identyfikacji oraz kontrola dostępu. Przedstawiono opis opracowanego systemu biometrycznej identyfikacji wykorzystującego sztuczne sieci neuronowe. Podano wyniki badań oraz przeprowadzono ich wnikliwą dyskusję.Biometrics is the study of automated...
-
Sano-Tachiya-Noolandi-Hong, Onsager and Braun models vs Monte Carlo simulation of charge photogeneration in organic solids
PublicationThe Sano-Tachiya-Noolandi-Hong (STNH), Onsager, and Braun models as well as Monte Carlo (MC) simulations of charge recombination/separation have been applied for the first time to reproduce the results of the electromodulated photoluminescence measurements in vacuum-evaporated films of fluorescent materials commonly used in optoelectronic devices. The values of the electron-hole pair final recombination speed in the monomer emitters:...
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Matching trajectory of a person to a map in inertial navigation system
PublicationPaper describes the method of matching, to a map, trajectories of a person walking indoors, obtained from inertial navigation module. General principle of matching algorithm based on particle filtering is presented. Method of detecting particle collisions is described as well. The last chapter provides test results of map matching related to a true trajectory.
-
Matching Exception Class Hierarchies between .NET, Java Environments
PublicationThe paper presents a methodology of exception classification and matching exception messages between .NET andJava environments. The methodology operates on existing exception class hierarchies and proposes two complementingapproaches: automated and manual matching. The automated matching uses the similarity measure to find associationsbetween exception messages from the two sets of classes for the considered programming languages....
-
Is This Distance Teaching Planning That Bad?
PublicationIn spring 2020, university courses were moved into the virtual space due to the Covid-19 lockdown. In this paper, we use experience from courses at Gdańsk University of Technology and ETH Zurich to identify core problems in distance teaching planning and to discuss what to do and what not to do in teaching planning after the pandemic. We conclude that we will not return to the state of (teaching) affairs that we had previously....
-
Pattern matching localization in ZigBee wireless sensor networks.
PublicationLokalizacja typu Pattern matching w sieciach sensorów bezprzewodowych ZigBee.Prezentacja metod implementacji algorytmów lokalizacji. Praktyczne zastosowanie i testowanie lokalizacji sieci ZigBee.
-
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.
-
Improvement of Imperfect String Matching Based on Asymetric n-Grams
PublicationTypical approaches to string comparing treats them as either different or identical without taking into account the possibility of misspelling of the word. In this article we present an approach we used for improvement of imperfect string matching that allows one to reconstruct potential string distortions. The proposed method increases the quality of imperfect string matching, allowing the lookup of misspelled words without significant...
-
Bulk linearized CMOS differential pair transconductor for continuous-time OTA-C filter design
PublicationIn this paper, the MOS differential pair driven simultaneously from gates and bulk terminals is described. An approximated analytical solution of the voltage to current transfer function has been found for the proposed circuit. Four possible combinations of gate and bulk connections of the input signal are presented. Basing on the configuration giving the best linearity, the operational transconductance amplifier (OTA) has been designed...
-
Dynamic Compatibility Matching of Services for Distributed Workflow Execution
PublicationThe paper presents a concept and an implementation of dynamic learn-ing of compatibilities of services used in a workflow application. While services may have the same functionality, they may accept input and produce output in different formats. The proposed solution learns matching of outputs and inputs at runtime and uses this knowledge in subsequent runs of workflow applications. The presented solution was implemented in an...
-
FFT spectrum based matching algorithm for activedynamic thermography
PublicationIn Active Dynamic thermography (ADT) sequences of consecutive temperature distributions are analyzed. In biomedical applications of ADT, the problems of a patient's movements in front of a thermal camera should be eliminated before data analysis. Complete mechanical stabilization of the patients is impossible due to natural voluntary and involuntary moves caused by pulse breathing, etc. This paper presents a simple and efficient...
-
Are Pair Trading Strategies Profitable During COVID-19 Period?
PublicationPair trading strategy is a well-known profitable strategy in stock, forex, and commodity markets. As most of the world stock markets declined during COVID-19 period, therefore this study is going to observe whether this strategy is still profitable after COVID-19 pandemic. One of the powerful algorithms of DBSCAN under the umbrella of unsupervised machine learning is applied and three clusters were formed by using market and accounting...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.
-
Average distance is submultiplicative and subadditive with respect to the strong product of graphs
PublicationWe show that the average distance is submultiplicative and subadditive on the set of non-trivial connected graphs with respect to the strong product. We also give an application of the above-mentioned result.
-
Comparing phylogenetic trees using a minimum weight perfect matching
PublicationA phylogenetic tree represents historical evolutionary relationshipbetween different species or organisms. There are various methods for reconstructing phylogenetic trees.Applying those techniques usually results in different treesfor the same input data. An important problem is to determinehow distant two trees reconstructed in such a wayare from each other. Comparing phylogenetic trees is alsouseful in mining phylogenetic information...
-
A PROPOSAL FOR ONE-IMAGE PHOTOGRAMMETRY SYSTEM FOR MEASURING THE CLEARANCE DISTANCE. CASE STUDY
PublicationMeasurement of the clearance distance (both in the context of the rail and road) is one of the current and increasingly discussed topics in the context of photogrammetric and image processing (computer vision) methods. The article presents a description of a simple and rapid method of measure the clearance distance between the obstacles by using one-image photogrammetry. The proposed method was tested for the railway, tram and...
-
A correlation between electron-hole pair radii and magnetomodulation of exciplex fluorescence in electron donor-electron acceptor organic systems
PublicationElectric field dependencies of electromodulated photoluminescence and magnitudes of the magnetic-field effect on photoluminescence havebeen measured in vacuum-evaporated films of m-MTDATA [4,4',4"-tris(N-(3-methylphenyl)-N-phenylamino)triphenylamine]:bathophe-nanthroline, m-MTDATA:BCP (bathocuproine), as well as 4,4',4"-tris[2-naphthyl(phenyl)amino]triphenylamine:BCP. The Sano-Tachiya-Noolandi-Hong extension of standard Onsager...
-
Resolving Conflicts in Object Tracking in Video Stream Employing Key Point Matching
PublicationA novel approach to resolving ambiguous situations in object tracking in video streams is presented. The proposed method combines standard tracking technique employing Kalman filters with global feature matching method. Object detection is performed using a background subtraction algorithm, then Kalman filters are used for object tracking. At the same time, SURF key points are detected only in image sections identified as moving...
-
The acid strength of the datively bound complexes involving AlF3 lone pair acceptor and various lone pair donors
Publication -
An optimized system for sensor ontology meta-matching using swarm intelligent algorithm
PublicationIt is beneficial to annotate sensor data with distinct sensor ontologies in order to facilitate interoperability among different sensor systems. However, for this interoperability to be possible, comparable sensor ontologies are required since it is essential to make meaningful links between relevant sensor data. Swarm Intelligent Algorithms (SIAs), namely the Beetle Swarm Optimisation Algorithm (BSO), present a possible answer...
-
On the low-cost design of abbreviated multisection planar matching transformer
PublicationA numerically demanding wideband matching transformer composed of three nonuniform transmission lines (NUTLs) has been designed and optimized at a low computational cost. The computational feasibility of the design has been acquired through the exploitation of low-fidelity NUTL models in most steps of the design procedure and an implicit space mapping optimization engine, providing high accuracy results with only a handful of EM...
-
Space-mapping-based design flow of miniaturized broadband matching transformer with perforated metallization
PublicationA fast design procedure of unconventional passive components has been presented and experimentally validated on the basis of a wideband microstrip four-section matching transformer (50:6 OHm). A classic impedance matching circuit has been miniaturized by means of compact microstrip resonant cells (CMRCs) leading to a considerable length reduction (34%) together with minor degradation in its performance. The spacemapping-based design...
-
Resonance microstrip structure with patch of arbitrary convex geometry with the use of field matching technique
PublicationAn analysis of the resonance frequency problem of planar microstrip structure with patch of arbitrary convex geometry is presented. A full-wave analysis is employed utilizing a combination of Galerkin’s moment method and field matching technique. In this approach, a field matching technique is adopted to calculate the patch surface current densities, and next the method of moments is utilized to calculate resonance frequencies...
-
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...
-
Finite element/mode-matching analysis of ferrite/dielectric line junctions of arbitrary cross-section
PublicationThis paper is focused on the analysis of line junctions obtained as a cascade of dielectric and ferrite guides of arbitrary cross-section. The main application of such structures is nonreciprocal devices such as isolators, circulators, or phase shifters. The efficient finite element/mode-matching approach is proposed to the analysis of such structures. In this approach, thefiniteelementmethod is applied todetermine propagation...
-
London penetration depth in local pair superconductors
Publication -
A PAIR OF PERFECTLY CONDUCTING DISKS IN AN EXTERNAL FIELD
Publication