Filtry
wszystkich: 39
wybranych: 35
Filtry wybranego katalogu
Wyniki wyszukiwania dla: MINIMUM-WEIGHT PERFECT MATCHING
-
Comparing phylogenetic trees using a minimum weight perfect matching
PublikacjaA 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...
-
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...
-
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...
-
Properties of the triset metric for phylogenetic trees
Publikacjathe following paper presents a new polynomial time metric for unrootedphylogenetic trees (based on weighted bipartite graphs and the method ofdetermining a minimum perfect matching) and its properties. also many its properties are presented.
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
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...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
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...
-
Exact-match Based Wikipedia-WordNet Integration
PublikacjaAbility to link between WordNet synsets and Wikipedia articles allows usage of those resources by computers during natural language processing. A lot of work was done in this field, however most of the approaches focus on similarity between Wikipedia articles and WordNet synsets rather than creation of perfect matches. In this paper we proposed a set of methods for automatic perfect matching generation. The proposed methods were...
-
Exact modal absorbing boundary condition for waveguide simulations - discrete Green's function approach
PublikacjaA modal absorbing boundary condition (ABC) based on the discrete Green's function (DGF) is introduced and applied for termination of waveguides simulated by means of the finite-difference time-domain (FDTD) method. The differences between the developed approach and implementations already demonstrated in the literature are presented. By applying DGF, a consistent theoretical approach to modal ABC in the FDTD method is obtained....
-
The share of investments in gold and oil using the example of selected European stock exchanges– A comparative analysis
PublikacjaIn this article, optimal investment portfolios with minimal risk and maximum efficiency were calculated. The portfolios were designated for ten selected European stock exchanges, based on the listings of the twenty largest companies in each of those markets. All calculations were made based on company shares only, company shares and investments in gold, shares of companies and investments in crude oil as well as shares of companies...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Nested Kriging Surrogates for Rapid Multi-Objective Optimization of Compact Microwave Components
PublikacjaA procedure for rapid EM-based multi-objective optimization of compact microwave components is presented. Our methodology employs a recently developed nested kriging modelling to identify the search space region containing the Pareto-optimal designs, and to construct a fast surrogate model. The latter permits determination of the initial Pareto set, further refined using a separate surrogate-assisted process. As an illustration,...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Visual Lip Contour Detection for the Purpose of Speech Recognition
PublikacjaA method for visual detection of lip contours in frontal recordings of speakers is described and evaluated. The purpose of the method is to facilitate speech recognition with visual features extracted from a mouth region. Different Active Appearance Models are employed for finding lips in video frames and for lip shape and texture statistical description. Search initialization procedure is proposed and error measure values are...
-
NEW DESIGNS OF CENTRIFUGAL MAGNETIC FLUID SEALS FOR ROTATING SHAFTS IN MARINE TECHNOLOGY
PublikacjaThe centrifugal magnetic fluid seals have important advantage over the conventional centrifugal seals. They maintain very good sealing capacity at static, medium and high speeds of shaft rotation, with the increased seal lifetime, and minimum torque and static friction. These seals are particularly useful in cases when the angular shaft velocity varies and sometimes decreases to nearly or exactly zero, such as in flywheel applications,...
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Optimum Control of Gyroscopic Systems
PublikacjaThe problem of optimum control of transverse rotor vibrations with gyroscopic interactions has been described and solved in the paper. An integral performance index has been defined for such system in order to minimize vibration level of a chosen rotor point. For this reason, an efficient way of finding the weight coefficients of integral performance index for multi-degrees-of-freedom system with gyroscopic interactions has been...
-
Low-fidelity model considerations for simulation-based optimisation of miniaturised wideband antennas
PublikacjaHere, variable-fidelity electromagnetic (EM)-based design optimisation of miniaturised antennas is discussed. The authors focus on an appropriate selection of discretisation density of the low-fidelity EM model, which results in good performance of the optimisation algorithm in terms of its computational complexity and reliability. Trust-region gradient search with low-fidelity model corrected by means of non-linear frequency scaling...