• Title/Summary/Keyword: Steiner Point

Search Result 15, Processing Time 0.016 seconds

Understanding On the Theosophy of Rudolf Steiner (루돌프 슈타이너의 신지학에 대한 이해)

  • Lee, Won-Il
    • Journal of Christian Education in Korea
    • /
    • v.62
    • /
    • pp.75-99
    • /
    • 2020
  • What means the Waldorf school based on integrative imagination to our educational reality in our days? This is the key question in this article. This article seeks to the fundamental meaning of the Waldrof school to know our educational problems. For this purpose this article explore understanding on the theosophy of Rudolf Steiner in the insufficient research until now. The theosophy of Rudolf Steiner in this article is investigated with the understanding of Triune God, human, and educational arts. The understanding of triune God is identified as the critiques to the view point of materialism, the meaning of logos in the scripture of John, the Christ as the foundation of all creatures. The understanding of human being is distinguished as the nature of body, soul, and spirit in the theosophy. Especially the nature of spirit is to see the invisible in the visible things through the eyes of mind that means esoteric spirituality not unrealistic spirituality of monasticism but integrative spirituality of overcoming the dualism between spirit and material. The educational characteristics for the integrative spirituality and imagination is called as the educational arts by Rudolf Steiner. The educational arts includes contents of the soul life, the education of freedom with individuality, and integrative education. The educational arts intends to the wholistic education with harmonious interaction of intellect, feeling, and willing to equip the individual human being in the spirit. And the educational arts educates with the harmony of story, play, art, and integrative curriculum of subject contents. The educational arts is to intend for reformation in christian education including church school and alternative school, etc. The Waldorf school needs to emphasizing the christian spirituality in the educational arts.

An Optimal Routing for Point to Multipoint Connection Traffics in ATM Networks (일대다 연결 고려한 ATM 망에서의 최적 루팅)

  • Chung, Sung-Jin;Hong, Sung-Pil;Chung, Hoo-Sang;Kim, Ji-Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.4
    • /
    • pp.500-509
    • /
    • 1999
  • In this paper, we consider an optimal routing problem when point-to-point and point-to-multipoint connection traffics are offered in an ATM network. We propose a mathematical model for cost-minimizing configuration of a logical network for a given ATM-based BISDN. Our model is essentially identical to the previous one proposed by Kim(Kim, 1996) which finds a virtual-path configuration where the relevant gains obtainable from the ATM technology such as the statistical multiplexing gain and the switching/control cost-saving gain are optimally traded-off. Unlike the Kim's model, however, ours explicitly considers the VP's QoS(Quality of Service) for more efficient utilization of bandwidth. The problem is a large-scale, nonlinear, and mixed-integer problem. The proposed algorithm is based on the local linearization of equivalent-capacity functions and the relaxation of link capacity constraints. As a result, the problem can be decomposed into moderate-sized shortest path problems, Steiner arborescence problems, and LPs. This fact renders our algorithm a lot faster than the previous nonlinear programming algorithm while the solution quality is maintained, hence application to large-scale network problems.

  • PDF

SGOSST Mechanism for Quality of Service In Network (네트워크 QoS를 위한 SGOSST 메커니즘)

  • Kim, In-Bum
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.107-114
    • /
    • 2011
  • Because of boost of communications devices furnishing diverse services and rapid expansion of mobile business, good use and management of the existing network system become very important. Also, offering service corresponding with user communication requirement grades which vary widely in each person, is vital for communication service provider. In this paper, SGOSST, a mechanism of efficient network construction with minimum cost for network QoS is proposed. In experiments, though spending 252.97% more execution times, our SGOSST QoS network consumed 5.11% less connecting costs than the network constructed by weighted minimum spanning tree method. Therefore our mechanism can work well for efficient operation and service providing in the network formed with users and communication devices of various service requirement grade as smart/mobile equipment.

APPROXIMATION OF CONVEX POLYGONS

  • Lee, Young-Soo
    • Journal of applied mathematics & informatics
    • /
    • v.10 no.1_2
    • /
    • pp.245-250
    • /
    • 2002
  • Consider the Convex Polygon Pm={Al , A2, ‥‥, Am} With Vertex points A$\_$i/ = (a$\_$i/, b$\_$i/),i : 1,‥‥, m, interior P$\^$0/$\_$m/, and length of perimeter denoted by L(P$\_$m/). Let R$\_$n/ = {B$_1$,B$_2$,‥‥,B$\_$n/), where B$\_$i/=(x$\_$i/,y$\_$I/), i =1,‥‥, n, denote a regular polygon with n sides of equal length and equal interior angle. Kaiser[4] used the regular polygon R$\_$n/ to approximate P$\_$m/, and the problem examined in his work is to position R$\_$n/ with respect to P$\_$m/ to minimize the area of the symmetric difference between the two figures. In this paper we give the quality of a approximating regular polygon R$\_$n/ to approximate P$\_$m/.

A Study on the G-Node and Disconnected Edges to Improve the Global and Local Locating Heuristic for GOSST Problem (GOSST 문제에 대한 전역적 배치와 지역적 배치 휴리스틱의 개선을 위한 G-Node와 단절에 관한 연구)

  • Kim, In-Bum;Kim, Chae-Kak
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9B
    • /
    • pp.569-576
    • /
    • 2007
  • This paper is on the enhancement of our heuristics for GOSST problem that could apply to the design of communication networks offering graduated services. This problem hewn as one of NP-Hard problems finds a network topology meeting the G-Condition with minimum construction cost. In our prior research, we proposed two heuristics. We suggest methods of selecting G-Node and disconnections for Global or Local locating heuristic in this research. The ameliorated Local locating heuristic retrenches 17% more network construction cost saving ratio and the reformed Global locating heuristic does 14% more than our primitives.