language is a system and every system has rules that govern the structure of its vocabulary. the rules of the arabic language are based on the vowels that consistent with the meanings used in the context represent the words' position. there are some basic rules in addition to vowels which are mostly seen in the written texts. one of these rules is the matching rule that refers to the condi...

background: one of the challenges of pet/mri combined systems is to derive an attenuation map to correct the pet image. for that, the pseudo-ct image could be used to correct the attenuation. until now, most existing scientific researches construct this pseudo-ct image using the registration techniques. however, these techniques suffer from the local minima of the non-rigid deformation energy f...

the purpose of the matching interdiction problem in a weighted graph is to findtwo vertices such that the weight of the maximum matching in the graph withoutthese vertices is minimized. an approximate solution for this problem has beenpresented. in this paper, we consider dendrimers as graphs such that the weightsof edges are the bond lengths. we obtain the maximum matching in some types ofdend...

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solvi...

A capacitive power transfer (CPT) system wirelessly transfers energy between coupling plates and performance issues related to CPT systems are resonance conditions, matching impedance, voltage stress, loss. generalized circuit model is proposed for shielded (S-CPT) using an algebraic method. The S-CPT analyzed based on the symmetric asymmetric configurations, relationship parameters of obtained...

The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type unification problem is decidable. We give the first nontrivial lower bound for the problem by showing (our main result) that it is exponential time hard. Fur...

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

Graphs provide a natural mechanism for visualising many algebraic systems. They are particularly useful for describing algebras in a monoidal category, such as frobenius algebras and bialgebras, which play a vital role in quantum computation. In this context, terms in the algebra are represented as graphs, and algebraic identities as graph rewrite rules. To describe the theory of a more powerfu...

Geometric invariants are important for shape recognition and matching. Existing invariants in projective geometry are typically defined on the limited number (e.g., five for the classical cross-ratio) of collinear planar points and also lack the ability to characterize the curve or surface underlying the given points. In this paper, we present a projective invariant named after the characterist...