in this paper, we study the existence of coupled coincidence andcoupled common fixed points for single-valued and fuzzy mappingsunder a contractive condition in metric space. presented theoremsextend and improve the main results of abbas and$acute{c}$iri$acute{c}$ {itshape et al.} [m. abbas, l.$acute{c}$iri$acute{c}$, {itshape et al.}, coupled coincidenceand common fixed point theorems for hybr...

The breakdown point behavior of M-estimators in linear models with xed designs, arising from planned experiments or qualitative factors, is characterized. Particularly, this behavior at xed designs is quite diierent from that at designs which can be corrupted by outliers|the situation prevailing in the literature. For xed designs, the breakdown points of robust M-estimators (those with bounded ...

in this paper, a concept of generalized weakly contraction mappings in partially ordered fuzzy metric spaces is introduced and  coincidence point  theorems on partially ordered fuzzy metric spaces are proved. also, as the corollary of these theorems, some common fixed point theorems on partially ordered fuzzy metric spaces are presented.

let $c$ be a nonempty closed convex subset of a real hilbert space $h$. let ${s_n}$ and ${t_n}$ be sequences of nonexpansive self-mappings of $c$, where one of them is a strongly nonexpansive sequence. k. aoyama and y. kimura introduced the iteration process $x_{n+1}=beta_nx_n+(1-beta_n)s_n(alpha_nu+(1-alpha_n)t_nx_n)$ for finding the common fixed point of ${s_n}$ and ${t_n}$, where $uin c$ is ...

Macbeath gave a formula for the number of xed points for each non-identity element of a cyclic group of automorphisms of a compact Riemann surface in terms of the universal covering transformation group of the cyclic group. We observe that this formula generalizes to determine the xed-point set of each non-identity element of a cyclic group of automorphisms acting on a closed non-orientable sur...

We describe new algorithms for multi{frame structure from motion from tracked point features. The algorithms are essentially linear and give accuracies similar to those of a maximum{likelihood estimate. For the common situation where the calibration is xed and approximately known, we experimentally compare the fully projective versions of our algorithms to mixed projective/Euclidean strategies....

In this paper a hybrid type theory HTT is deened which combines the programming language notion of partial type with the logical notion of total type into a single theory. A new partial type constructor A is added to the type theory: objects in A may diverge, but if they converge, they must be members of A. A xed point typing rule is given to allow for typing of xed points. The underlying theor...

The basics of a block oriented fractal image coder, are described. The output of the coder is an IFS (Iterated Function System) code, which describes the image as a xed-point of a contractive transformation. A new hierarchical interpretation of the IFS code, which relates diierent scales of the xed-point to the code, is presented and proved. The proof is based on nding a function of a continuou...