Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics

2017 ◽  
Author(s):  
Pierre Laroche ◽  
Franc Marchetti ◽  
Sebastien Martin ◽  
Zsuzsanna Roka
Keyword(s):  
Complete Matching

Complete Pattern Matching for DNA Computing

2006 ◽  
Vol 05 (04) ◽  
pp. 337-343
Author(s):  
Nadia Nedjah ◽  
Luiza De Macedo Mourelle
Keyword(s):  
Information Retrieval ◽  
Logic Programming ◽  
Pattern Matching ◽  
Theorem Proving ◽  
Dna Computing ◽  
Term Rewriting ◽  
Matching Method ◽  
Subject Term ◽  
Matching Technique ◽  
Complete Matching

Pattern matching is essential in many applications such as information retrieval, logic programming, theorem-proving, term rewriting and DNA-computing. It usually breaks down into two categories: root and complete pattern matching. Root matching determines whether a subject term is an instance of a pattern in a pattern set while complete matching determines whether a subject term contains a sub-term that is an instance of a pattern in a pattern set. For the sake of efficiency, root pattern matching need to be deterministic and lazy. Furthermore, complete pattern matching also needs to be parallel. Unlike root pattern matching, complete matching received little interest from the researchers of the field. In this paper, we present a novel deterministic multi-threaded complete matching method. This method subsumes a deterministic lazy root matching technique that was developped by the authors in an earlier work. We evaluate the performance of proposed method using theorem-proving and DNA-computing applications.

Study on Three-Level Matching Model of Product Configuration Oriented to Mass Customization

2009 ◽  
Vol 407-408 ◽  
pp. 257-263
Author(s):  
Jiang Hua Ge ◽  
Yong Lin Xu ◽  
Yong Tao Huang ◽  
Guo An Gao
Keyword(s):  
Mathematical Model ◽  
Mass Customization ◽  
Product Structure ◽  
Product Configuration ◽  
Retrieval Algorithm ◽  
Configuration Design ◽  
Similarity Matching ◽  
Matching Model ◽  
Correlation Matching ◽  
Complete Matching

This paper proposed configuration three-level matching model based on modular product structure in order to solve the product configuration design problem in mass customization (MC). According to the product structure and the features of configuration design, the model divided the configuration course into three parts as first-level complete matching, second-level similarity matching and third-level correlation matching. Firstly obtained standard module that meets clients’ demands by retrieval algorithm of first-level complete matching and similar module of the customized by mathematical model of second-level similarity matching. Then based on them, analyzed the correlation matrix among modules and associated attributes of modules interface, and established the mathematical model of third-level correlation matching and realized the optimum combination of modules. Finally, verified the model by examples. The results indicate that this model could effectively solve the low-efficiency problem of deformation module recombination design in traditional product configuration so to rapidly respond to clients’ customization demands.

scholarly journals Finding a complete matching with the maximum product on weighted bipartite graphs

1993 ◽  
Vol 25 (5) ◽  
pp. 65-71
Author(s):  
Frank S.C. Tseng ◽  
Wei-Pang Yang ◽  
Arbee L.P. Chen
Keyword(s):  
Bipartite Graphs ◽  
Complete Matching

Orderings of component level versus system level at active redundancies for coherent systems with dependent components

2021 ◽  
pp. 1-23
Author(s):  
Rongfang Yan ◽  
Junrui Wang ◽  
Bin Lu
Keyword(s):  
Hazard Rate ◽  
System Level ◽  
Stochastic Comparison ◽  
Coherent Systems ◽  
Component Level ◽  
Comparison Results ◽  
Versus System ◽  
Level Versus ◽  
Theoretical Results ◽  
Complete Matching

This paper investigates the issue of stochastic comparison of multi-active redundancies at the component level versus the system level. Based on the assumption that all components are statistically dependent, in the case of complete matching and nonmatching spares, we present some interesting comparison results in the sense of the hazard rate, reversed hazard rate and likelihood ratio orders, respectively. And we also obtain two comparison results between relative agings of resulting systems at the component level and the system level. Several numerical examples are provided to illustrate the theoretical results.

scholarly journals Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut

2020 ◽  
Vol 35 ◽  
pp. 100551
Author(s):  
Pierre Laroche ◽  
Franc Marchetti ◽  
Sébastien Martin ◽  
Anass Nagih ◽  
Zsuzsanna Róka
Keyword(s):  
Branch And Cut ◽  
Problem Complexity ◽  
Polyhedral Analysis ◽  
Complete Matching

Target Recognition Based on Polar Coordinate Template Matching

2013 ◽  
Vol 712-715 ◽  
pp. 2368-2371
Author(s):  
Ce Yao ◽  
Chun Bo Xiu
Keyword(s):  
Template Matching ◽  
Tracking System ◽  
Second Phase ◽  
Invariant Property ◽  
Matching Method ◽  
Rotation Invariant ◽  
Polar Coordinate ◽  
Invariant Properties ◽  
Candidate Point ◽  
Complete Matching

In order to improve the rotation invariant property of the conventional template matching method, a novel template matching based on the polar coordinate was proposed. The origin of the polar coordinate was at the center of the template. And the matching result was central symmetry, which made the method have the translation and rotation invariant properties simultaneously. The recognition process was divided into two phased. In the first phase, gray information was used to complete matching calculation, and some candidate points were selected according to the matching result. In the second phase, edge strong matching of candidate points was completed. The candidate point, where the sum of gray matching value and edge strong matching value was minimal, was determined as the best matching point. Experiments results show that this method can meet the real-time requirement of the TV tracking system.

Sign in / Sign up

Export Citation Format

Share Document