Automatically generated playlists have become an important medium for accessing and exploring large collections of music. In this paper, we present a probabilistic model for generating coherent playlists by embedding songs and social tags in a unified metric space. We show how the embedding can be learned from example playlists, providing the metric space with a probabilistic meaning for song/s...

‎In this paper‎, ‎we generalize the proximal point algorithm to complete CAT(0) spaces and show‎ ‎that the sequence generated by the proximal point algorithm‎ $w$-converges to a zero of the maximal‎ ‎monotone operator‎. ‎Also‎, ‎we prove that if $f‎: ‎Xrightarrow‎ ‎]-infty‎, +‎infty]$ is a proper‎, ‎convex and lower semicontinuous‎ ‎function on the complete CAT(0) space $X$‎, ‎then the proximal...

In this paper, using the concept of w-distances on a metric space, we first prove a generalized fixed point theorem for mappings without continuity in a complete metric space. Using this result, we obtain new and well-known fixed point theorems in a complete metric space.

In this paper, we obtain a characterization of linear spaces which may be normed so as to become complete, linear, normed metric spaces. In this connection, K. Kunugui and M. Fréchet have shown that every metric space S is isometric with a subset of a complete, linear, normed metric space. I t follows from our result that if the cardinal number of 5 is the limit of a denumerable sequence of car...

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been de ned in the setting of probabilisti...

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been de ned in the setting of probabilisti...

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been defined in the setting of probabilist...

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been de ned in the setting of probabilisti...

Kaneko et al.[4] etc many authors extended with multi-valued maps for the notion of compatible maps in complete metric space. Recently, O’Regan et al.[5] presented fixed point and homotopy results for compatible single-valued maps on complete metric spaces. In this paper, we will establish some common fixed point theorems using compatible maps in intuitionistic fuzzy metric space. : Common fixe...

In this paper, we prove a common fixed point theorem for noncompatible maps in probabilistic metric space using implicit relation. Our result does not require either the completeness of the space or continuity of the maps. Full text