Filtry
wszystkich: 1019
wybranych: 830
-
Katalog
- Publikacje 830 wyników po odfiltrowaniu
- Czasopisma 10 wyników po odfiltrowaniu
- Konferencje 2 wyników po odfiltrowaniu
- Osoby 7 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 4 wyników po odfiltrowaniu
- Wydarzenia 1 wyników po odfiltrowaniu
- Dane Badawcze 164 wyników po odfiltrowaniu
Filtry wybranego katalogu
Wyniki wyszukiwania dla: MATCHING PAIR DISTANCE
-
On a matching distance between rooted phylogenetic trees
PublikacjaThe 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
PublikacjaRekonstrukcja 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
Publikacja -
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions
PublikacjaAbility 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
PublikacjaIn 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
PublikacjaThe 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
PublikacjaThe 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
PublikacjaWe 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
PublikacjaA 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
PublikacjaThe 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
PublikacjaThis 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)
PublikacjaThis 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
PublikacjaLarge-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
PublikacjaThis 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
PublikacjaA 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
PublikacjaThis 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
PublikacjaA 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
PublikacjaGiven 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
PublikacjaThis 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
PublikacjaIn 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...