We compute the polynomial entropy of induced maps on hyperspace for a homeomorphism $f$ an interval or circle with finitely many non-wandering points.

The problem of Word Sense Disambiguation (WSD) can be defined as the task of assigning the most appropriate sense to the polysemous word within a given context. Many supervised, unsupervised and semi-supervised approaches have been devised to deal with this problem, particularly, for the English language. However, this is not the case for Hindi language, where not much work has been done. In th...

We show that if $$(X,d)$$ is a metric space which admits consistent convex geodesic bicombing, then we can construct conical bicombing on $$CB(X)$$ , the hyperspace of nonempty, closed, bounded, and subsets $$X$$ (with Hausdorff metric). If normed or an $$\mathbb {R}$$ -tree, this same method produces . follow by examining nonempty compact assuming proper space.

An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the ...