• Title/Summary/Keyword: Predecessor

Search Result 108, Processing Time 0.026 seconds

A study on the property of Hyanggyo and public libraries under the colony of Japanese empire (일제시대의 향교재산과 공공도서관에 관한 연구)

  • 김남석
    • Journal of Korean Library and Information Science Society
    • /
    • v.16
    • /
    • pp.159-190
    • /
    • 1989
  • Under the colony of Japanese Empire, libraries of Hyanggyo's(a Confucian temple and a old-time School belonging to it) property a n.0, ppeared 45 libraries. Effects of these libraries are as follows: 1. Libraries of Hyanggyo's property impeded Korean people's enlightenment works in the aspect of a save the Nation movement spread all over the country by taking in Confucian scholars and those who work for the good of the locality. 2. It having prepared a point to civilize Koreans for Japanizing as far as rural and fishing community through libraries of Hyanggyo's property. 3. Though many libraries of Hyanggyo's property were closed, a quite libraries became the predecessor of Korea modern library which linked with public libraries.

  • PDF

Collaborative Tools in High Energy Physics and EVO Server at KISTI (고에너지물리를 위한 협업환경 도구와 KISTI EVO 서버)

  • KIM, Hyunwoo;CHO, Kihyeon
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.234-237
    • /
    • 2007
  • We report on our experience on utilization of collaborative tools for KISTI high energy physics group. Our main subject will be the new EVO (Enabling Virtual Organization) server that we hosted recently at KISTI. The EVO is a next generation collaborative tool from CalTech high energy physics group with several improvements from its predecessor VRVS (Virtual Room Videoconferencing System). EVO has the same baseline structure as in VRVS. The network of servers lies at the heart of EVO structure and one server called Panda communicates with local clients called Koala.

  • PDF

A Study on the Architectural Process and the Characteristic of Municipal Building in Busan (부산부청(釜山府廳)의 건축과정과 변용특성)

  • Song, Hye-Young
    • Journal of architectural history
    • /
    • v.29 no.5
    • /
    • pp.7-16
    • /
    • 2020
  • The Municipal Building of Busan was the first western-style building of Korea in 1879. It was also the predecessor of Busan Metropolitan City Hall. On the other hand, the Municipal Building of Busan was a symbolic structure that shows the history of Busan. The Municipal Building of Busan has inherited the construction location and site, including the speciality of Choryangwaegwan, and is a good example of the process of inheriting the authority of the former space through the appropriation of the building. The Municipal Building of Busan was relocated to the edge of the coast in 1934 because a small and dilapidated building failed to function properly. The relocation of the Municipal Building of Busan in 1934 was the origin of changing the coastal space in downtown. As a result, landfill sites along the coast were in the limelight and developed into the downtown area of Busan after Korea's liberation.

Obstacle Avoidance and Local Path Planning for Mobile Robots using the Fast Elastic Band (FEB를 이용한 이동로봇의 장애물 회피와 국지경로계획)

  • Kim, Il-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.8
    • /
    • pp.794-798
    • /
    • 2010
  • This paper presents a new obstacle-avoidance method for mobile robots. This approach, called the FEB (Fast Elastic Band) method, has been developed and successfully tested on the experimental mobile robot PHOPE-1S. The FEB method eliminates the shortcomings of the elastic band method previously introduced, yet retains all the advantages of its predecessor. The FEB algorithm is computationally efficient, and it allows continuous and fast motion of the mobile robot without stopping for obstacles. The FEB-controlled mobile robot traverses very densely cluttered obstacle courses and is able to pass through narrow openings or narrow corridors without oscillations. The results of the simulation and experiment have verified the validity of the proposed method.

Improvement of Gear Rattle Noise of a Small Car by Experimental Approach (시험적 방법에 의한 경승용차 기어 래틀 소음 개선)

  • 조영호;김인동;이병로;이학철
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2001.05a
    • /
    • pp.628-632
    • /
    • 2001
  • Experimental approach was investigated to improve gear rattle noise of a small car. During the development of a small car serious problem occurred inside the transmission gear units. The transmission was a carried over system from a less powered predecessor. Several components of suspicion were investigated, and applied to reduce rattle noise. In general, backlash, the assembly gaps, and the clutch disk rattle induce gear rattle noise. Above mentioned improvements were applied to reduce the noise, but still problem remained. Meanwhile, the temperature inside the gearbox was reported to be unusually high and the life of transmission oil quality deteriorated drastically, Temperature increment caused the large gap between the bearing outer diameter and the transmission housing. Large gap made the gear shaft assembly move intermittently and impact each other. The tighter control of the assembly gap allowed the rotating shafts smoothly and reduced the gear rattle noise even in the high temperature range.

  • PDF

Efficient Evaluation of Path Algebra Expressions

  • Lee, Tae-kyong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.5 no.1
    • /
    • pp.1-15
    • /
    • 2000
  • In this paper, an efficient system for finding answers to a given path algebra expression in a directed acylic graph is discussed more particulary, in a multimedia presentration graph. Path algebra expressions are formulated using revised versions of operators next and until of temporal logic, and the connected operator. To evaluate queries with path algebra expressions, the node code system is proposed. In the node code system, the nodes of a presentation graph are assigned binary codes (node codes) that are used to represent nodes and paths in a presentation graph. Using node codes makes it easy to find parent-child predecessor-sucessor relationships between nodes. A pair of node codes for connected nodes uniquely identifies a path, and allows efficient set-at-a-time evaluations of path algebra expressions. In this paper, the node code representation of nodes and paths in multimedia presentation graphs are provided. The efficient algorithms for the evaluation of queries with path algebra expressions are also provided.

  • PDF

Application of Bucket-brigades to Order Picking in Warehouses (물류창고에서 Bucket Brigade를 활용한 오더피킹에 대한 연구)

  • Koo, Pyung-Hoi
    • IE interfaces
    • /
    • v.21 no.3
    • /
    • pp.333-342
    • /
    • 2008
  • Warehouses form an important link in a supply chain network. Among a variety of activities in warehouses, order picking is the process of retrieving a number of items out of storage to meet customer orders. Today, as the transactions through direct sales are wide spread, warehouses often receive a large amount of small orders to be handled within tight time windows, which makes fast and efficient order picking more important than ever. This paper examines a new order picking method where the concept of bucket brigade (BB) is applied. Bucket brigade is a way of dynamically coordinating workers who progressively perform a set of operations along a flow line. In bucket brigades, a worker is not assigned his jobs in a static way. Each worker takes a job from his predecessor when he is free. We identify some considerations when bucket brigades are applied to order picking activities. A new BB picking protocol is presented to improve existing BB picking protocols. Through simulation experiments, the performance of BB order picking is evaluated under various logistics environments.

An Efficient Algorithm for Causal Message Delivery in Distributed Mobile Systems (분산 이동 시스템에서 인과적 메시지 전달을 위한 효율적인 알고리즘)

  • 노성주;정광식;김기범;안진호;황종선
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.232-234
    • /
    • 2000
  • 분산 이동 시스템은 단순한 통신 기능에서 작업 흐름 관리, 화상회의, 전자 메일과 같은 서비스를 제공하는 시스템으로 급속히 확대.발전하고 있으며, 이들 어플리케이션들은 사용자의 요구를 반영하기 위해 메시지를 인과적 순서로 전달해야 한다. 인과적 메시지 전달을 제공하는 기존의 방법들은 많은 피기백(piggyback) 정보로 인한 통신 오버헤드 혹은 어플리케이션으로 전달하는 메시지의 지연, 이동 호스트의 증가에 대한 비확장성 등의 문제점이 있다. 이 논문은 기지국과 이동 호스트 사이의 종속 정보 행렬을 기지국이 유지하며, 즉각 선행자 메시지(immdiate predecessor message)에 대한 종속 정보만을 각 메시지에 피기백하는 방법을 통하여 기존 기법의 문제점을 해결하는 효율적인 인과적 메시지 전달 기법을 제안한다. 제안하는 알고리즘은 이전의 알고리즘들과 비교해서 낮은 메시지 오버헤드를 가지며, 메시지를 전달할 때의 불필요한 지연(inhibition)이 발생하지 않는다. 또한 제안된 알고리즘은 이동 호스트의 에너지 사용에 대한 제약성, 무선 통신의 낮은 대역폭, 이동 호스트 수의 증가에 대한 확장성, 무선 통신의 잦은 접속 단절과 같은 요소를 고려한다.

  • PDF

Achievement of Korea-China Collaborative Project and Collaboration with KAHP (한ㆍ중 기생충 감염관리 시범사업의 성과)

  • Pung, Jeong
    • Journal of Korea Association of Health Promotion
    • /
    • v.2 no.2
    • /
    • pp.199-208
    • /
    • 2004
  • Congratulations on the 40th Anniversary of KAHP, which has made great contributions to the control of parasitic diseases in Korea, and to the development of collaboration with China and other Asia countries aiming at the common interest. The 40 years of KAN/KAHP and its predecessor, Korea Association of Parasite Eradication has composed a brilliant road map to bring the prevalence of intestinal parasite infection from 84.3% in 1971 to the current prevalence of 2.4%, and to endeavor in the promotion of the health of children, man and woman, and low income families in Korea, as well as to generously share the successful experience in parasite control with China during the last half century. Indeed, the 40th birth day of KAHP is marked with great achievements and bright future.

  • PDF

Perfect Hashing Algorithm Using TPSACA (TPSACA를 이용한 완전 해싱 알고리즘)

  • 김석태;이석기;최언숙;조성진
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.6
    • /
    • pp.1047-1054
    • /
    • 2004
  • One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.