An idea of fuzzy reexivity of Felbin's type fuzzy normed linear spaces is introduced and its properties are studied. Concept of fuzzy uniform normal structure is given and using the geometric properties of this concept xed point theorems are proved in fuzzy normed linear spaces.

Jachymski [ Proc. Amer. Math. Soc., 136 (2008), 1359-1373] gave modified version of a Banach fixed point theorem on a metric space endowed with a graph. In the present paper, (G, Φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. Also, Hardy-Rogers G-contraction have been introduced and some fixed point theorems have been proved. S...

An automatic scaling C program translator is developed for the eecient execution of application programs in xed-point digital signal processors. The program for range estimation is automatically generated by inserting codes which collect the statistics of each signal during the simulation. With the range information, the number of shifts needed for the scaling is determined and the oating-point...

Resumen Background: Likelihood-based methods can work poorly when the residuals are not normally distributed and the variances across clusters are heterogeneous. Method: The performance of two estimation methods, the non-parametric residual bootstrap (RB) and the restricted maximum likelihood (REML) for fi tting multilevel models are compared through simulation studies in terms of bias, coverag...

in this paper direct proofs of some common fixed point results for two and three mappings under weak contractive conditions are given. some of these results are improved by using different arguments of control functions. examples are presented showing that some generalizations cannot be obtained and also that our results are distinct from the existing ones.

Two xed-point optimization utility programs, the range estimator and the xed-point simulator, are developed for scaling and wordlength determination of digital signal processing algorithms written in C or C++ language. By exploiting the operator overloading characteristics of C++ language, range estimation and xed-point simulation can be conducted just by modifying the variable declaration of t...

We say a functional equation () is stable if any function g satisfying the equation () approximatelyis near to true solution of (). Using xed point methods, we investigate approximately higherternary derivations in Banach ternary algebras via the Cauchy functional equationf(1x + 2y + 3z) = 1f(x) + 2f(y) + 3f(z) :

A xed-point C compiler is developed for convenient and efcient programming of TMS320C50 xed-point digital signal processor. This compiler supports the `fix' data type that can have an individual integer word-length according to the range of a variable. It can add or subtract two data having di erent integer word-lengths by automatically inserting shift operations. The accuracy of xed-point mult...

In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity i...

In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity i...