Human language may have started from a consistent set of mappings between meanings and signals. These mappings, referred to as the early vocabulary, are considered to be the results of conventions established among the agents of a population. In this study, we report simulation models for investigating how such conventions can be reached. We propose that convention is essentially the product of...

for all x, y ∈ C and each n ≥ 1. The class of asymptotically nonexpansive mappings was introduced by Goebel and Kirk [1] as an important generalization of nonexpansive mappings. It was proved in [1] that if C is a nonempty bounded closed convex subset of a real uniformly convex Banach space and T is an asymptotically nonexpansive self mapping on C, then F (T ) is nonempty closed convex subset o...

Let E be a uniformly convex Banach space and K be a nonempty closed convex subset of E. Let {Ti}i=1 be N nonexpansive self-mappings of K with F = ∩i=1F (Ti) ̸= ∅ (here F (Ti) denotes the set of fixed points of Ti). Suppose that one of the mappings in {Ti}i=1 is semi-compact. Let {αn} ⊂ [δ, 1 − δ] for some δ ∈ (0, 1) and {βn} ⊂ [τ, 1] for some τ ∈ (0, 1]. For arbitrary x0 ∈ K, let the sequence {x...

Let C0 X,X be the set of all continuous self-mappings on a topological space X. Let f ∈ C0 X,X . For integer n ≥ 0, define the nth iterate of f by f f ◦ fn−1 and f0 id, where id denotes the identity mapping on X and ◦ denotes the composition of mappings. An equation with iteration as its main operation is simply called an iterative equation. Founded on the problem of iterative roots, the proble...

In this paper, we first introduce a family S = {Sn : C → C} of non-Lipschitzian mappings, called total asymptotically nonexpansive (briefly, TAN) on a nonempty closed convex subset C of a real Banach space X, and next give necessary and sufficient conditions for strong convergence of the sequence {xn} defined recursively by the algorithm xn+1 = Snxn, n ≥ 1, starting from an initial guess x1 ∈ C...

The main aim of this paper is to introduce three classes $H^0_{p,q}$, $H^1_{p,q}$ and $TH^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. First, we discuss the starlikeness and convexity of mappings in $H^0_{p,q}$ and $H^1_{p,q}$. Then establish the covering theorem for mappings in $H^1_{p,q}$. Finally, we determine the extreme points of the class $TH^*_{p}$.

In this paper, the concept of intuitionistic fuzzy mapping as a generalization of fuzzy mapping is presented, and its' relationship with intuitionistic fuzzy relations is derived. Moreover, some basicoperations of intuitionistic fuzzy mappings are defined, hence we can conclude that all of intuitionistic fuzzy mappings constitute a soft algebrawith respect to these operations. Afterwards, the A...

This research intends to design a system to control affective content in music production. This is done by taking into account a knowledge base with mappings between affective states (happiness, sadness, etc.) and music features (rhythm, melody, etc.). The knowledge base is grounded on the state of the art done in areas of Music Psychology. An emotional description specified by the user is used...

The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are connected. Dynamic link matching (DLM) is a self-organizing dynamical system to establish such connectivity patterns for object recognition, but with rather naturally given simple interactions between pattern elements, its...