‎‎‎Recently Samet et al. introduced the notion of $alpha$-$psi$-contractive type mappings and established some fixed point theorems in complete metric spaces. In this paper, we introduce $alpha$-$(psi,varphi)$-contractive mappings and stablish coincidence and common fixed point theorems for two mapping in complete metric spaces. We present some examples to illustrate our results. As application...

We show that the variational inequality $VI(C,A)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-Lipschitzian mapping $A: Cto H$ with $r>gamma mu^2$, where$C$ is a nonempty closed convex subset of a Hilbert space $H$. Fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...

In this paper we introduce a generalization of Meir-Keeler contraction forrandom mapping T : Ω×C → C, where C be a nonempty subset of a Banachspace X and (Ω,Σ) be a measurable space with being a sigma-algebra of sub-sets of. Also, we apply such type of random fixed point results to prove theexistence and unicity of a solution for an special random integral equation.

This paper investigates the moments and stress resultants from infinite FG laminates with different polygonal cutouts subject to uniaxial tensile load. The analytical solution used for the calculation of stress resultants and moments is the basis of the complex-variable method and conformal mapping function. The impact of various factors, namely cutout orientation angle, cutout aspect ratio as ...

Restriction Site Mapping is one of the interesting tasks in Computational Biology. A DNA strand can be thought of as a string on the letters A, T, C, and G. When a particular restriction enzyme is added to a DNA solution, the DNA is cut at particular restriction sites. The goal of the restriction site mapping is to determine the location of every site for a given enzyme. In partial digest metho...

As a starting point we take the space-mapping iteration technique by Bandler et al. for the efficient solution of optimization problems. This technique achieves acceleration of accurate design processes with the help of simpler, easier to optimize models. We observe the difference between the solution of the optimization problem and the computed space-mapping solutions. We repair this discrepan...