• Title/Summary/Keyword: continuous map

Search Result 320, Processing Time 0.027 seconds

MAPPINGS ON FUZZY PROXIMITY AND FUZZY UNIFORM SPACES

  • Kim, Yong Chan
    • Korean Journal of Mathematics
    • /
    • v.4 no.2
    • /
    • pp.149-161
    • /
    • 1996
  • We define the fuzzy uniformly continuous map and investigate some properties of fuzzy uniformly continuous maps. We will prove the existences of initial fuzzy uniform structures induced by some functions. From this fact, we construct the product of two fuzzy uniform spaces.

  • PDF

Function Approximation for Reinforcement Learning using Fuzzy Clustering (퍼지 클러스터링을 이용한 강화학습의 함수근사)

  • Lee, Young-Ah;Jung, Kyoung-Sook;Chung, Tae-Choong
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.587-592
    • /
    • 2003
  • Many real world control problems have continuous states and actions. When the state space is continuous, the reinforcement learning problems involve very large state space and suffer from memory and time for learning all individual state-action values. These problems need function approximators that reason action about new state from previously experienced states. We introduce Fuzzy Q-Map that is a function approximators for 1 - step Q-learning and is based on fuzzy clustering. Fuzzy Q-Map groups similar states and chooses an action and refers Q value according to membership degree. The centroid and Q value of winner cluster is updated using membership degree and TD(Temporal Difference) error. We applied Fuzzy Q-Map to the mountain car problem and acquired accelerated learning speed.

Development of a Sustainable Community-based Hazard Map Creation Support System for Traditional Towns with Local Heritage

  • Okazaki, Yasuhisa;Mori, Seina;Wakuya, Hiroshi;Mishima, Nobuo;Hayashida, Yukuo;Min, Byung-Won
    • International Journal of Contents
    • /
    • v.12 no.2
    • /
    • pp.58-65
    • /
    • 2016
  • This paper describes design and development of a system that supports continuous creation of hazard maps by local residents in their daily life. We made an interview survey to design our system in a model traditional town in Saga, Japan. The results show that in spite of continuous efforts, many practical problems remain and residents feel unsafe. Based on these results, we designed and developed a unique ICT-based support system which contributes to community-based disaster prevention/reduction. The continuous resident participation and posting design are core concept for our sustainable community-based approach. Our system continues to support making a hazard map by integrating the community-based hazard information. Local residents register information about the spot (disaster types, a risk level, a photograph, comments, positional information) that can be dangerous in case of disaster. We have evaluated the usefulness and possibilities of our prototype system implemented as an iOS application.

A CLASS OF MAPPINGS BETWEEN Rz-SUPERCONTINUOUS FUNCTIONS AND Rδ-SUPERCONTINUOUS FUNCTIONS

  • Prasannan, A.R.;Aggarwal, Jeetendra;Das, A.K.;Biswas, Jayanta
    • Honam Mathematical Journal
    • /
    • v.39 no.4
    • /
    • pp.575-590
    • /
    • 2017
  • A new class of functions called $R_{\theta}$-supercontinuous functions is introduced. Their basic properties are studied and their place in the hierarchy of strong variants of continuity, which already exist in the literature, is elaborated. The class of $R_{\theta}$-supercontinuous functions properly contains the class of $R_z$-supercontinuous functions [39] which in turn properly contains the class of $R_{cl}$-supercontinuous functions [43] and so includes all cl-supercontinuous (clopen continuous) functions ([38], [34]) and is properly contained in the class of $R_{\delta}$-supercontinuous functions [24].

Inverse halftoning Using Anisotropic diffusion and Edge map (비등방성 확산 필터와 에지맵을 이용한 역하프토닝)

  • 고기영;주동현;염동훈;김두영
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.12a
    • /
    • pp.81-84
    • /
    • 2000
  • Digital Halftoning convert a continuous-tone images to a binary images. Inverse halftoning addresses the problem of recovering a continuous image from a halftoned binary image. Simple low pass filtering can remove the high frequency noise but it also removes the edge information. Thus the edge information should be separated from the halftoning noise. As a result, the edge of result image is blurring. This paper present that we obtain continuous-tone-image which using Anisotropic diffusion filter. To reduce noise without blurring the edges of reconstructed image use edge map. The experimental results show that proposed method gives a higher PSNR and better subjective quality than conventional methods. As a result, the edge information of reconstructed image reduce blurring.

  • PDF

DYNAMICAL STABILITY AND SHADOWING PROPERTY OF CONTINUOUS MAPS

  • Koo, Ki-Shik;Ryu, Hyun Sook
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.11 no.1
    • /
    • pp.73-85
    • /
    • 1998
  • This paper deals with the topological stability of continuous maps. First, the notion of local expansion is given and we show that local expansions of compact metric spaces have the shadowing property. Also, we prove that if a continuous surjective map f is a local homeomorphism and local expansion, then f is topologically stable in the class of continuous surjective maps. Finally, we find homeomorphisms which are not topologically stable.

  • PDF

ON THE SIMPLICIAL COMPLEX STEMMED FROM A DIGITAL GRAPH

  • HAN, SANG-EON
    • Honam Mathematical Journal
    • /
    • v.27 no.1
    • /
    • pp.115-129
    • /
    • 2005
  • In this paper, we give a digital graph-theoretical approach of the study of digital images with relation to a simplicial complex. Thus, a digital graph $G_k$ with some k-adjacency in ${\mathbb{Z}}^n$ can be recognized by the simplicial complex spanned by $G_k$. Moreover, we demonstrate that a graphically $(k_0,\;k_1)$-continuous map $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}}^{n_1}$ can be converted into the simplicial map $S(f):S(G_{k_0}){\rightarrow}S(G_{k_1})$ with relation to combinatorial topology. Finally, if $G_{k_0}$ is not $(k_0,\;3^{n_0}-1)$-homotopy equivalent to $SC^{n_0,4}_{3^{n_0}-1}$, a graphically $(k_0,\;k_1)$-continuous map (respectively a graphically $(k_0,\;k_1)$-isomorphisim) $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}^{n_1}$ induces the group homomorphism (respectively the group isomorphisim) $S(f)_*:{\pi}_1(S(G_{k_0}),\;v_0){\rightarrow}{\pi}_1(S(G_{k_1}),\;f(v_0))$ in algebraic topology.

  • PDF

CONVERGENCE OF THE NEWTON METHOD FOR AUBIN CONTINUOUS MAPS

  • Argyros, Ioannis K.
    • East Asian mathematical journal
    • /
    • v.25 no.2
    • /
    • pp.153-157
    • /
    • 2009
  • Motivated by optimization considerations we revisit the work by Dontchev in [7] involving the convergence of Newton's method to a solution of a generalized equation in a Banach space setting. Using the same hypotheses and under the same computational cost we provide a finer convergence analysis for Newton's method by using more precise estimates.

VARIOUS SHADOWING PROPERTIES FOR INVERSE LIMIT SYSTEMS

  • Lee, Manseob
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.4
    • /
    • pp.657-661
    • /
    • 2016
  • Let $f:X{\rightarrow}X$ be a continuous surjection of a compact metric space and let ($X_f,{\tilde{f}}$) be the inverse limit of a continuous surjection f on X. We show that for a continuous surjective map f, if f has the asymptotic average, the average shadowing, the ergodic shadowing property then ${\tilde{f}}$ is topologically transitive.

Reinforcement Learning with Clustering for Function Approximation and Rule Extraction (함수근사와 규칙추출을 위한 클러스터링을 이용한 강화학습)

  • 이영아;홍석미;정태충
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.11
    • /
    • pp.1054-1061
    • /
    • 2003
  • Q-Learning, a representative algorithm of reinforcement learning, experiences repeatedly until estimation values about all state-action pairs of state space converge and achieve optimal policies. When the state space is high dimensional or continuous, complex reinforcement learning tasks involve very large state space and suffer from storing all individual state values in a single table. We introduce Q-Map that is new function approximation method to get classified policies. As an agent learns on-line, Q-Map groups states of similar situations and adapts to new experiences repeatedly. State-action pairs necessary for fine control are treated in the form of rule. As a result of experiment in maze environment and mountain car problem, we can achieve classified knowledge and extract easily rules from Q-Map