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...

Methods of window matching to estimate 3D points are the most serious factors affecting the accuracy, robustness, and computational cost of Multi-View Stereo (MVS) algorithms. Most existing MVS algorithms employ window matching based on Normalized CrossCorrelation (NCC) to estimate the depth of a 3D point. NCC-based window matching estimates the displacement between matching windows with sub-pi...

This article deals with a bi-objective matching problem. The input is a complete graph and two values on each edge (a weight and a length) which satisfy the triangle inequality. It is unlikely that every instance admits a matching with maximum weight and maximum length at the same time. Therefore, we look for a compromise solution, i.e. a matching that simultaneously approximates the best weigh...

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 derive analytical expressions for the propagation speed of downward combustion fronts of thin solid fuels with a background flow initially at rest. The classical combustion model for thin solid fuels that consists of five coupled reaction-convection-diffusion equations is here reduced into a single equation with the gas temperature as the single variable. For doing so we apply a two-zone com...

We address the issue of applying join operation to the relational data managed in the form of multiple replicas in data grid. A join algorithm is developed that solves the problem of replica matching and execution node selection by making use of matching theory. To ease the data transference among the grid nodes, we introduce relation reduction and row blocking techniques. The analytical and ex...

Tag collision has a negative impact on the performance of RFID systems. In this paper, we propose an algorithm termed anti-collision protocol based on improved collision detection (ACP-ICD). In this protocol, dual prefixes matching and collision bit detection technique are employed to reduce the number of queries and promptly identify tags. According to the dual prefixes matching method and col...

A method for matching sequences from two perspective views of a moving person silhouette is presented. Regular (approximate uniform thickness) parts are detected on an image and a skeleton is generated. A 3D regular region graph is defined to gather possible poses based on the two 2D-regular regions, one for each view, at a given frame. The matching process of 3D graphs with a model graph resul...