A general common fixed point theorem for two pairs of weakly compatible self mappings proved in compact metric spaces employing a slightly modified implicit relation which generalizes almost all existing relevant common fixed point theorems. Some related results are also derived besides furnishing illustrative examples. AMS subject classifications: 47H10, 54H25

In this paper, we prove some common fixed point theorems for two pairs of weakly compatible selfmaps satisfying a new ψ-contractive condition in the framework of a partial metric space. We also provide illustrative examples in support of our new results. The results obtained in this paper differ from the recent relative results in literature. c ©2016 All rights reserved.

In this article, using the common (CLR) property, common fixed point results for two pairs of weakly compatible mappings satisfying contractive condition of integral type on metric spaces are established. Furthermore, the existence and uniqueness of common solution for system of functional equations arising in dynamic programming are discussed as an application of a common fixed point theorem p...

A letter matrix is an n-by-n matrix whose entries are n symbols, each appearing n times. The row (column) distribution of a letter matrix is an n-by-n nonnegative integer matrix that tells how many of each letter are in each row (column). A row distribution R and a column distribution C are compatible if there exits a letter matrix A whose row distribution is R and whose column distribution is ...

− A method for the reconstruction of a 3D shape is described and applied to a practical measurement case. Multiple stereo systems are employed to measure a 3D surface with superimposed colored markers. The described procedure comprises a detailed uncertainty analysis of all the measurement phases, and a statistical compatibility analysis of the colored markers measured by different stereo pairs...

Deep metric learning maps visually similar images onto nearby locations and dissimilar apart from each other in an embedding manifold. The process is mainly based on the supplied image negative positive training pairs. In this paper, a dynamic sampling strategy proposed to organize pairs easy-to-hard order feed into network. It allows network learn general boundaries between categories easy at ...

In this paper, we have developed a new general distance measure that not only can be used in a vector quantization (VQ) of the line spectrum frequency (LSF) parameters but performes well in the LSF transformed domain. The new distance is based on the spectral sensitivity of LSF and their transformed coe cients. In addition, the x scaling factor is used to decrease the sensitivity of spectral er...

Voice adaptation describes the process of converting the output of a text-to-speech synthesizer voice to sound like a different voice after a training process in which only a small amount of the desired target speaker’s speech is seen. We employ a locally linear conversion function based on Gaussian mixture models to map bark-scaled line spectral frequencies. We compare performance for three di...