We show that if G is a connected graph of maximum degree at most 4, which is not C2,5, then the strong matching number of G is at least 1 9n(G). This bound is tight and the proof implies a polynomial time algorithm to find an induced matching of this size.

We present problems in different application areas: tandem repeats (computational biology), poetry and music analysis, and author validation, that require a more sophisticated pattern matching model that hitherto considered. We introduce a new matching criterion—generalized function matching—that encapsulates the notion suggested by the above problems. The generalized function matching problem ...

The forecast for oil production from an reservoir is made with the aid of simulations. model parameters in simulations are uncertain whose values estimated by matching simulation predictions history. Bayesian inference (BI) provides a convenient way estimating mathematical model, starting probable distribution parameter and knowing BI techniques history require Markov chain Monte Carlo (MCMC) s...

We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sharp contrast with the bipartite case, as Little [7] proved that every bipartite non-Pfaffian graph contains a matching minor isomorphic to K3,3. We relax the notion of a matching minor and conjecture that there are onl...

Image registration is one of the most important tasks in image processing. The algorithms of image registration are classified into two categories: the feature-based matching and intensity-based matching. Each of them has its strength and weakness. In this paper, by combining these two techniques together, we developed a new algorithm for image registration. The algorithm utilises a parametric ...

The damping ratio of chassis suspension is a key parameter for damping matching of in-wheel motor vehicles (IWMVs). Because the motor is attached to the driving wheel, the initial design method of the damping ratio for traditional cars is not entirely suitable for IWMVs. This paper proposes an innovative initial design method of the damping ratio for IWMVs. Firstly, a traveling vibration model ...

The Hospitals/Residents problem is a many-to-one extension of the stable marriage problem. In its instance, each hospital specifies a quota, i.e., an upper bound on the number of positions it provides. It is well-known that in any instance, there exists at least one stable matching , and finding one can be done in polynomial time. In this paper, we consider an extension in which each hospital s...