Search results for "FIX"
showing 10 items of 1335 documents
The fixed point property for mappings admitting a center
2007
Abstract We introduce a class of nonlinear continuous mappings in Banach spaces which allow us to characterize the Banach spaces without noncompact flat parts in their spheres as those that have the fixed point property for this type of mapping. Later on, we give an application to the existence of zeroes for certain kinds of accretive operators.
Fixed points and completeness on partial metric spaces
2015
Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008), 1861-1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. Paesano and Vetro [D. Paesano and P. Vetro, Suzuki's type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces, Topology Appl., 159 (2012), 911-920] proved an analogous fixed point result for a selfmapping on a partial metric space that characterizes the partial metric 0-completeness. In this paper we prove a fixed point result for a new class of…
Berinde mappings in orbitally complete metric spaces
2011
Abstract We give a fixed point theorem for a self-mapping satisfying a general contractive condition of integral type in orbitally complete metric spaces. Some examples are given to illustrate our obtained result.
Weibull Model for Dynamic Pricing in e-Business
2011
As is the case with traditional markets, the sellers on the Internet do not usually know the demand functions of their customers. However, in such a digital environment, a seller can experiment different prices in order to maximize his profits. In this paper, we develop a dynamic pricing model to solve the pricing problem of a Web-store, where seller sets a fixed price and buyer either accepts or doesn’t buy. Frequent price changes occur due to current market conditions. The model is based on the two-parameter Weibull distribution (indexed by scale and shape parameters), which is used as the underlying distribution of a random variable X representing the amount of revenue received in the sp…
Common fixed points of generalized contractions on partial metric spaces and an application
2011
Abstract In this paper, common fixed point theorems for four mappings satisfying a generalized nonlinear contraction type condition on partial metric spaces are proved. Presented theorems extend the very recent results of I. Altun, F. Sola and H. Simsek [Generalized contractions on partial metric spaces, Topology and its applications 157 (18) (2010) 2778–2785]. As application, some homotopy results for operators on a set endowed with a partial metric are given.
Suzukiʼs type characterizations of completeness for partial metric spaces and fixed points for partially ordered metric spaces
2012
Abstract Recently, Suzuki [T. Suzuki, A generalized Banach contraction principle that characterizes metric completeness, Proc. Amer. Math. Soc. 136 (2008) 1861–1869] proved a fixed point theorem that is a generalization of the Banach contraction principle and characterizes the metric completeness. In this paper we prove an analogous fixed point result for a self-mapping on a partial metric space or on a partially ordered metric space. Our results on partially ordered metric spaces generalize and extend some recent results of Ran and Reurings [A.C.M. Ran, M.C. Reurings, A fixed point theorem in partially ordered sets and some applications to matrix equations, Proc. Amer. Math. Soc. 132 (2004…
On the size of transducers for bidirectional decoding of prefix codes
2012
In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci. 411 (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [ IEEE Commun. Lett. 3 (1999) 245–247]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this transducer is minimal. Here we consider the number of states of such a transducer, related to some features of the considered prefix code X . We find some bounds of such a number of states in relation wi…
Loop-free Gray code algorithm for the e-restricted growth functions
2011
The subject of Gray codes algorithms for the set partitions of {1,2,...,n} had been covered in several works. The first Gray code for that set was introduced by Knuth (1975) [5], later, Ruskey presented a modified version of [email protected]?s algorithm with distance two, Ehrlich (1973) [3] introduced a loop-free algorithm for the set of partitions of {1,2,...,n}, Ruskey and Savage (1994) [9] generalized [email protected]?s results and give two Gray codes for the set of partitions of {1,2,...,n}, and recently, Mansour et al. (2008) [7] gave another Gray code and loop-free generating algorithm for that set by adopting plane tree techniques. In this paper, we introduce the set of e-restricte…
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…
DEFECT THEOREMS FOR TREES
2000
We generalize different notions of a rank of a set of words to sets of trees. We prove that almost all of those ranks can be used to formulate a defect theorem. However, as we show, the prefix rank forms an exception.