The traditional method for studying non-stationary signals is spectrogram based on the short-time Fourier transform (STFT). The well known limitation of the STFT is the inherent trade-off between time and frequency resolution. The Wigner-Ville (WV) distribution has the best time-frequency resolution, but its draw back is generating cross-terms. The MATCHING pursuit (MP) distribution based on using the Gaussian atom is always positive, does not include crossterm, and has convenient resolution. In this paper, we have shown in addition to the known properties, the MP distribution can also remove the additive noise inherently. On the other words, we are able to remove the noise just by limiting the algorithm iterations and without paying any additional cost. Although the MP distribution based on using the Gaussian atoms is always positive and it has convenient resolution, according to the MP the time marginal and the frequency marginal will not be obtained accurately. In this paper, it has been shown that by implementing the minimum cross entropy (MCE) technique according to the MP distribution as a priory positive distribution, the new extracted distribution has the most similarity to the MP distribution and it also satisfies the correct time and frequency marginal.

< p >The various subject matters of jurisprudence (Fiqh) contain many religious laws limited by legal measures. In these cases, the correct recognition of the fulfillment of legal measure and the way it is performed by religiously competent person is an important matter. Four theories can be driven from the expressions of the jurists in this regard including rational precision, customary precision, customary negligence and statement in detail. When it is the matter of limitation, the customary precision is the criterion for recognition of duty, but considering the way of its performance the customary accuracy is acceptable. In addition, considering the recognition of the concept of measure, the customary negligence is considered to be harmless, but considering adapting an example to the concepts, it is not acceptable. Alongside these matters, scientific and experimental precision can also be studied. While quoting and criticizing the statements, this article prefers the statement in detail. In most cases, there is a deliberation and insistence on strict observance of the specified limits in the word of divine law which indicates the importance of a particular amount in the view of the Legislator and the tolerance thereof is rejected. However, in some cases, the method of confinement may be discovered from the language of reason or other evidences and that the substantiation of a particular amount is the detector of the actual realization of the subject of religious law. Therefore, in those cases, accuracy is not demanded.

Introduction: Preimplantation genetic diagnosis (PGD) has become an important option for couple at risk of conceiving affected children with single gene disorders. PGD has recently been used in combination with Human Leukocyte Antigen (HLA) MATCHING, allowing selection and transfer of unaffected embryos also having a close HLA match with those of an existing affected child. In such cases, PGD was used not only to avoid the birth of affected children, but also to conceive healthy children who may be potential HLA-identical donors of haematopoietic stem cells (HSC) for transplantation in siblings with a life-threatening disorder. This study includes 76 cycles, for 55 couples overall, performed in a 2-years period. In a total of 48 couples preimplantation HLA MATCHING was performed in combination with PGD for a single gene disorder, from whom 66 cycles were performed, including 65 cycles for 47 couples for -thalassaemia and 1 cycle for Wiscott-Aldrich syndrome. HLA MATCHING procedure, not involving testing for a causative gene, was performed for 7 couples having a child affected by ALL (5 cycles) and sporadic DBA (5 cycles). Material and Methods: An indirect single-cell HLA typing protocol based on a multiplex fluorescent polymerase chain reaction (PCR) of short tandem repeat (STR) markers scattered throughout the HLA complex was used. A nested multiplex PCR assay was used to co-amplify all the selected loci. The first round PCR contained the external primers for the amplification of the informative HLA STR markers selected during the preclinical work-up of each PGD case, the gene regions involved by mutations, STR markers linked to these regions for ADO detection and STR markers used for detection of aneuploidies in patients of advanced reproductive age. The first round multiplex PCR was followed by separate second round PCR reactions for each locus. Mutation analysis was performed using the minisequencing method. Results: A total of 696 embryos were tested, involving analysis of 1178 blastomeres, in 1088 (92.4%) of which a successful amplification was obtained. A reliable HLA haplotype was obtained in 1088 /1088 (100%) of the blastomeres with positive PCR results. Testing for chromosome 6 copy number revealed 53 (7.6%) embryos with aneuploidies, including a total of 5 (0.7%) trisomies, 48 (6.9%) monosomies, which affected the HLA MATCHING diagnosis for these embryos, leading to a conclusive diagnosis in only 643/696 embryos (92.4%). Recombination was found in 34 (4.9%) embryos, 7 (1.0%) of which were originally unaffected and HLA compatible, but were not considered for transfer because of recombination. In total, 102 (15.9%) embryos revealed an HLA match with the affected siblings, 76 (11.8%) of which resulted unaffected and 64 (10.0%) have been transferred back to patients in 41 cycles. Twelve pregnancies were achieved (29.3% per transfer); 4 pregnancies resulted only biochemical, one spontaneously miscarried and one resulted ectopic, and was then terminated. Five healthy HLA matched children have been already delivered and cord blood stem cells were transplanted to 3 affected siblings, resulting in a successful hematopoietic reconstruction. Conclusions: These preliminary results are very encouraging and, complemented by other similar experiences in the field, demonstrate that preimplantation HLA MATCHING represent a valid alternative for the achievement of a successful treatment in children affected by severe congenital or acquired bone marrow disorders, in the absence of a compatible related donor.

This study focuses on complexity MATCHING and lexical MATCHING to investigate speech convergence in the conversations of bilingual Persian-English speakers in three language conditions namely Persian, English, and mixed in the context of lingua receptiva as an attempt to investigate such MATCHING mechanisms between a Latin-based language and a non-Latin-based language. Complexity MATCHING investigates convergence in terms of the hierarchical temporal structure of human speech while lexical MATCHING explores convergence in terms of the frequency occurrence of the matched lemmas. For this purpose, 14 master’, s students from the Shahid Chamran University of Ahvaz majoring in English language conversed with one another in dyadic groups in three language conditions each of which had its own topic namely movies, music, and books. In complexity MATCHING, Allan Factor analysis in terms of multiscale clustering of onset events was considered. In lexical MATCHING, the focus was on the distribution of all lemmas and matched lemmas and the possible correlation between the two. The results revealed a gradual increase in Allan Factor log-log plots in relation to the longer timescales that correspond with discourse patterns for complexity MATCHING. For lexical MATCHING, the positive correlation between all lemmas and matched lemmas (rs =. 607) suggested that as participants talked to each other more, they unconsciously tried to match their psychological perceptions with each other more. This suggests that speech convergence is vigorous in both bilingual and monolingual interactions.

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record MATCHING is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record MATCHING is proposed that can be adapted automatically with input error patterns. In field MATCHING phase, edit distance method is used. Naturally, it had been customized for Persian language problems such as similarity of Persian characters, usual typographical errors in Persian, etc. In record MATCHING phase, the importance of each field can be determined by specifying a coefficient related to each field. Coefficient of each field must be dynamically changed, because of changes of typographical error patterns. For this reason, Genetic Algorithm (GA) is used for supervised learning of coefficient values. The simulation results show the high abilities of this algorithm compared with other methods (such as Decision Trees).

Least square MATCHING (LSM) is one of the most accurate image MATCHING methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square MATCHING (FLSM) is being presented. The main idea of the proposed FLSM is decreasing the size of the observation equations to improve the efficiency of the MATCHING process. For this purpose, the pixels in the MATCHING window are ordered using a special robustness measure. Then, a specific percent of the pixels with the highest robustness is selected for MATCHING process. The phase congruency and entropy measures are used to compute the proposed robustness measure. The proposed FLSM method was successfully applied to match various synthetic and real image pairs, and the results demonstrate its capability to increase MATCHING efficiency. The MATCHING results show that the proposed FLSM method is three times faster than standard LSM method.

The MATCHING polynomial of a graph has coefficients that give the number of MATCHINGs in the graph. In this paper, we determine all connected graphs on eight vertices whose MATCHING polynomials have only integer zeros. A graph is MATCHING integral if the zeros of its MATCHING polynomial are all integers. We show that there are exactly two MATCHING integral graphs on eight vertices.