We present sufficient conditions for the existence of solutions of second-order two-point boundary value and fractional order functional differential equation problems in a space where self distance is not necessarily zero. For this, first we introduce a Ciric type generalized F-contraction and F- Suzuki contraction in a metric-like space and give relevance to fixed point results. To illustrate...

In this paper, in order to improve both the performance and the efficiency of the conventional Gaussian Mixture Models (GMMs), generalized GMMs are firstly introduced by integrating the conventional GMMs and the active curve axis GMMs for fitting non-linear datasets, and then two types of Fuzzy Gaussian Mixture Models (FGMMs) with a faster convergence process are proposed based on the generaliz...

We discuss a number of distance functions encountered in the theory of computation, including metrics, ultra-metrics, quasi-metrics, generalized ultrametrics, partial metrics, d-ultra-metrics, and generalized metrics. We consider their properties, associated fixed-point theorems, and some general applications they have within the theory of computation. We consider in detail the applications of ...

Our model is a generalized linear programming relaxation of a much studied random K-SAT problem. Specifically, a set of linear constraints C on K variables is fixed. From a pool of n variables, K variables are chosen uniformly at random and a constraint is chosen from C also uniformly at random. This procedure is repeated m times independently. We ask the following question: is the resulting li...

Abstract: Two different ways of obtaining generalized low-density parity-check codes are considered. Lower bounds on the minimum distance, stopping distance, and pseudodistance are derived for these codes using graph based analysis. These bounds are generalizations of Tanner’s bit-oriented and parity-oriented bound for simple LDPC codes. The new bounds are useful in predicting the performance o...

We discuss about the generalized $F$-contraction mappings in partially ordered metric spaces. For this, we first introduce the notion of ordered weakly $F$-contraction mapping. We also present some fixed point results about this type of mapping in partially ordered metric spaces. Next, we introduce the notion of $acute{mathrm{C}}$iri$acute{mathrm{c}}$ type generalized ordered weakly $F$-contrac...

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [1]. Here we investigate in detail the application of that bound to one...

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we give some results on codewords that cannot reach the second weight also called the next to minimal distance. In the projective case the second distance of generalized Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.

we show that  higher derivations on a hilbert$c^{*}-$module associated with the cauchy functional equation satisfying generalized hyers--ulam stability.