• Title/Summary/Keyword: (k, s)-generalization

Search Result 408, Processing Time 0.03 seconds

CONTINUITY OF AN APPROXIMATE JORDAN MAPPING

  • Lee, Young-Whan
    • Communications of the Korean Mathematical Society
    • /
    • v.20 no.3
    • /
    • pp.505-509
    • /
    • 2005
  • We show that every $\varepsilon-approximate$ Jordan functional on a Banach algebra A is continuous. From this result we obtain that every $\varepsilon-approximate$ Jordan mapping from A into a continuous function space C(S) is continuous and it's norm less than or equal $1+\varepsilon$ where S is a compact Hausdorff space. This is a generalization of Jarosz's result [3, Proposition 5.5].

PROBABILITIES OF ANALOGUE OF WIENER PATHS CROSSING CONTINUOUSLY DIFFERENTIABLE CURVES

  • Ryu, Kun Sik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.3
    • /
    • pp.579-586
    • /
    • 2009
  • Let $\varphi$ be a complete probability measure on $\mathbb{R}$, let $m_{\varphi}$ be the analogue of Wiener measure over paths on [0, T] and let f(t) be continuously differentiable on [0, T]. In this note, we give the analogue of Wiener measure $m_{\varphi}$ of {x in C[0, T]$\mid$x(0) < f(0) and $x(s_0){\geq}f(s_{0})$ for some $s_{0}$ in [0, T]} by use of integral equation techniques. This result is a generalization of Park and Paranjape's 1974 result[1].

  • PDF

The Selection Methodology of Road Network Data for Generalization of Digital Topographic Map (수치지형도 일반화를 위한 도로 네트워크 데이터의 선택 기법 연구)

  • Park, Woo Jin;Lee, Young Min;Yu, Ki Yun
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.3
    • /
    • pp.229-238
    • /
    • 2013
  • Development of methodologies to generate the small scale map from the large scale map using map generalization has huge importance in management of the digital topographic map, such as producing and updating maps. In this study, the selection methodology of map generalization for the road network data in digital topographic map is investigated and evaluated. The existing maps with 1:5,000 and 1:25,000 scales are compared and the criteria for selection of the road network data, which are the number of objects and the relative importance of road network, are analyzed by using the T$\ddot{o}$pfer's radical law and Logit model. The selection model derived from the analysis result is applied to the test data, and the road network data of 1:18,000 and 1:72,000 scales from the digital topographic map of 1:5,000 scale are generated. The generalized results showed that the road objects with relatively high importance are selected appropriately according to the target scale levels after the qualitative and quantitative evaluations.

THE ROTATION THEOREM ON ANALOGUE OF WIENER SPACE

  • Ryu, Kun-Sik;Shim, Shung-Hoon
    • Honam Mathematical Journal
    • /
    • v.29 no.4
    • /
    • pp.577-588
    • /
    • 2007
  • Bearman's rotation theorem is not only very important in pure mathematics but also plays the key role for various research areas, related to Wiener measure. In 2002, the author and professor Im introduced the concept of analogue of Wiener measure, a kind of generalization of Wiener measure and they presented the several papers associated with it. In this article, we prove a formula on analogue of Wiener measure, similar to the formula in Bearman's rotation theorem.

ON FIXED POINT THEOREMS FOR MULTIVALUED MAPPINGS OF FENG-LIU TYPE

  • ALTUN, ISHAK;MINAK, GULHAN
    • Bulletin of the Korean Mathematical Society
    • /
    • v.52 no.6
    • /
    • pp.1901-1910
    • /
    • 2015
  • In the present paper, considering the Jleli and Samet's technique we give many fixed point results for multivalued mappings on complete metric spaces without using the Pompeiu-Hausdorff metric. Our results are real generalization of some related fixed point theorems including the famous Feng and Liu's result in the literature. We also give some examples to both illustrate and show that our results are proper generalizations of the mentioned theorems.

ON NIL GENERALIZED POWER SERIESWISE ARMENDARIZ RINGS

  • Ouyang, Lunqun;Liu, Jinwang
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.3
    • /
    • pp.463-480
    • /
    • 2013
  • We in this note introduce a concept, so called nil generalized power serieswise Armendariz ring, that is a generalization of both S-Armendariz rings and nil power serieswise Armendariz rings. We first observe the basic properties of nil generalized power serieswise Armendariz rings, constructing typical examples. We next study the relationship between the nilpotent property of R and that of the generalized power series ring [[$R^{S,{\leq}}$]] whenever R is nil generalized power serieswise Armendariz.

Modified Error Back Propagation Algorithm using the Approximating of the Hidden Nodes in Multi-Layer Perceptron (다층퍼셉트론의 은닉노드 근사화를 이용한 개선된 오류역전파 학습)

  • Kwak, Young-Tae;Lee, young-Gik;Kwon, Oh-Seok
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.9
    • /
    • pp.603-611
    • /
    • 2001
  • This paper proposes a novel fast layer-by-layer algorithm that has better generalization capability. In the proposed algorithm, the weights of the hidden layer are updated by the target vector of the hidden layer obtained by least squares method. The proposed algorithm improves the learning speed that can occur due to the small magnitude of the gradient vector in the hidden layer. This algorithm was tested in a handwritten digits recognition problem. The learning speed of the proposed algorithm was faster than those of error back propagation algorithm and modified error function algorithm, and similar to those of Ooyen's method and layer-by-layer algorithm. Moreover, the simulation results showed that the proposed algorithm had the best generalization capability among them regardless of the number of hidden nodes. The proposed algorithm has the advantages of the learning speed of layer-by-layer algorithm and the generalization capability of error back propagation algorithm and modified error function algorithm.

  • PDF

ON INTEGRAL DOMAINS IN WHICH EVERY ASCENDING CHAIN ON PRINCIPAL IDEALS IS S-STATIONARY

  • Hamed, Ahmed;Kim, Hwankoo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.5
    • /
    • pp.1215-1229
    • /
    • 2020
  • Let D be an integral domain and S a multiplicative subset of D. An ascending chain (Ik)k∈ℕ of ideals of D is said to be S-stationary if there exist a positive integer n and an s ∈ S such that for each k ≥ n, sIk ⊆ In. As a generalization of domains satisfying ACCP (resp., ACC on ∗-ideals) we define D to satisfy S-ACCP (resp., S-ACC on ∗-ideals) if every ascending chain of principal ideals (resp., ∗-ideals) of D is S-stationary. One of main results of this paper is the Hilbert basis theorem for an integral domain satisfying S-ACCP. Also we investigate the class of such domains D and we generalize some known related results in the literature. Finally some illustrative examples regarding the introduced concepts are given.