muscle fatigue assessment has been the basis of numerous studies, specifically, in neuromuscular rehabilitation and the applications of fessystems. various emgbased techniques, in time and frequency domains, have been investigatedover years for the detection and evaluationof this phenomenon. the main objective of this study has beento evaluate the efficiency of applying a number of techniques w...

Abstract The renorming technique allows one to apply the Banach Contraction Principle for maps which are not contractions with respect original metric. This method was invented by Bielecki and manifested in an extremely elegant proof of Global Existence Uniqueness Theorem ODEs. present paper provides further extensions applications Bielecki’s problems stemming from functional analysis theory eq...

Removal and contraction are basic operations for several methods conceived in order to handle irregular image pyramids, for multi-level image analysis for instance. We give the definitions of removal and contraction operations in the generalized maps framework. We propose a first experimentation of irregular pyramid as a basis for a discrete geometrical modeler that can handle both discrete and...

The Meir-Keeler contraction, an important generalization of the classical Banach contraction has received enormous attention during the last four decades. In this paper, we present a review of Meir-Keeler type fixed point theorems and obtain some results using general Meir-Keeler type conditions for a sequence of maps in a metric space. Further, a recent result of Meir-Keeler type common fixed ...

We study synchronization functions in basic examples of discontinuous forced systems with contractive response and chaotic driving. The forcing is given by baker-type maps and the response is assumed to depend monotonically on the drive. The resulting synchronization functions have dense sets of discontinuities and their graphs appear to be extremely choppy. We show that these functions have bo...

Many speed-up techniques developed for accelerating the computation of shortest paths in road networks, like reach or contraction hierarchies, are based on the property that some streets are ’more important’ than others, e.g. on long routes the usage of an interstate is almost inevitable. In grids there is no obvious hierarchy among the edges, especially if the costs are uniform. Nevertheless w...

An iterated function system on X R d is deened by successively iterating an i.i.d. sequence of random Lipschitz functions from X to X. This paper shows how Fn = f 1 fn may converge even in the absence of the strong contraction conditions | for instance, Lipschitz constant smaller than 1 on average | which earlier work has required. Instead, it is posited that there be a region of contraction wh...

It is shown that each contraction A on a Hilbert space H, with A + A I for some 2 R, has a unitary dilation U on H H satisfying U + U I. This is used to settle a conjecture of Halmos in the aarmative: The closure of the numerical range of each contraction A is the intersection of the closures of the numerical ranges of all unitary dilations of A. By means of the duality theory of completely pos...

We first consider a cyclic φ-contraction map on a reflexive Banach space X and provide a positive answer to a question raised by Al-Thagafi and Shahzad on the existence of best proximity points for cyclic φ-contraction maps in reflexive Banach spaces in one of their works 2009 . In the second part of the paper, we will discuss the existence of best proximity points in the framework of more gene...