Didn't find any results in this catalog!
But we have some results in other catalogs.Search results for: MATCHING
-
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...
-
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.
-
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.
-
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.
-
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...
-
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...
-
Impedance matching in dual-frequency induction heating systems
Publication -
Matching Split Distance for Unrooted Binary Phylogenetic Trees
Publication -
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...