In this paper, the definition of meet-continuity on $L$-directedcomplete posets (for short, $L$-dcpos) is introduced. As ageneralization of meet-continuity on crisp dcpos, meet-continuity on$L$-dcpos, based on the generalized Scott topology, ischaracterized. In particular, it is shown that every continuous$L$-dcpo is meet-continuous and $L$-continuous retracts ofmeet-continuous $L$-dcpos are al...

A. Csaszar introduced and extensively studied the notion of generalized open sets. Following Csazar, we introduce a new notion superconnected. The main purpose of this paper is to study generalized superconnected spaces. Various characterizations of generalized superconnected spaces and preservation theorems are discussed.

Both preorders and ordinary ultrametric spaces are instances of generalized ul-trametric spaces. Every generalized ultrametric space can be isometrically embedded in a (complete) function space by means of an ultrametric version of the categorical Yoneda Lemma. This simple fact gives naturally rise to: 1. a topology for generalized ultrametric spaces which for arbitrary preorders corresponds to...

Generalized metric spaces are a common generalization of preorders and ordinary metric spaces. Every generalized metric space can be isometrically embedded in a complete function space by means of a metric version of the categorical Yoneda embedding. This simple fact gives naturally rise to: 1. a topology for generalized metric spaces which for arbitrary preorders corresponds to the Alexandroo ...

In this paper‎, ‎we mainly investigate how the generalized metrizability properties of the remainders affect the metrizability of rectifiable spaces‎, ‎and how the character of the remainders affects the character‎ ‎and the size of a rectifiable space‎. ‎Some results in [A. V‎. ‎Arhangel'skii and J‎. ‎Van Mill‎, ‎On topological groups with a first-countable remainder‎, ‎Topology Proc. 42 (2013...

Generalized principal curves are capable of representing complex data structures as they may have branching points or may consist of disconnected parts. For their construction using an unsupervised learning algorithm the templates need to be structurally adaptive. The present algorithm meets this goal by a combination of a competitive Hebbian learning scheme and a self-organizing map algorithm....