• Title/Summary/Keyword: 도착지

Search Result 605, Processing Time 0.028 seconds

A Study of Hierarchical Stepwise Migration and Depopulation : focusing on city rank-size and NIR change, 1995~2014 (도시 계층성에 따른 단계적 이동과 과소화 검토 -1995~2014년 도시 순위-규모와 자연적 인구증가율 변화를 중심으로-)

  • Lee, Chung Sup;Eun, Seog In
    • Journal of the Korean association of regional geographers
    • /
    • v.22 no.1
    • /
    • pp.120-134
    • /
    • 2016
  • This study aims to investigate the hierarchical stepwise migration and its influences on regions (metropolitan areas, cities and counties of Korea administrative district) through analyzing the city rank-size and the changes of natural increase of population. The result shows that the inter-regional migration has been associated to the decrease of the population and the decline of NIR in the regions where outflows have been persisted. Also, theses demographic events have sequentially occurred through the hierarchy of settlement system: gradually from rural (gun) and lower ranked regions in the system of city rank-size, to urban (si) and regions in the high ranks in the system. Based on the result of this study, it is possible to understand and expect the major origins of inter-regional migration, the presence of the hierarchical stepwise migration and most significantly, the spatial expansion of depopulation problems.

  • PDF

An Efficient Location Management Scheme for High-speed Mobile Nodes (고속으로 이동하는 노드들을 위한 효율적인 위치 갱신 기법)

  • 송의성;길준민;황종선
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.5
    • /
    • pp.581-594
    • /
    • 2003
  • Recently, a location management is being more important in mobile communication systems due to an explosive increase of mobile users. Current systems have used a concept of location area. Based on this concept, a mobile user performs a location update whenever it moves into a new location area. However, this scheme can not avoid unnecessary location updates when a mobile user moves around with high movement rate as compared to call arrival rate. That results in tremendous location management cost. To overcome this drawback, our proposal divides service areas into two sets: One is a set of areas that mobile users move with high speed and another is a set of areas that they move with low speed. After establishing these two sets, this paper employs different location tracking schemes for each sets. Generally, most mobile users with high speed have a low CMR and a regular direction until they arrive at their destination. Using such the moving behavior, systems can predict a mobile user's next location area in advance. When the mobile user moves into the predicted location, our proposal does not perform a location update. Thus, it can reduce overall location management cost. The Markov model is used to analyze the performance of our proposal. Using the model, this paper compares our proposal with IS-41 and TLA. The analytic results show that as CMR grows lower, an overall cost of our proposal becomes less, particularly if a mobile user frequently moves into the specific location are predicted by mobile systems. Also, our proposal has a better performance than other two schemes when the communication cost between HLR and VLR is high.

Protocol Monitor System Between Cortex M7 Based PLC And HMI

  • Kim, Ki-Su;Lee, Jong-Chan;Ha, Heon-Seong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.6
    • /
    • pp.17-23
    • /
    • 2020
  • In this paper, collecting real-time data frames that occur during RS232 communication between an HMI and PLC of automation equipment by sniffing real-time information data frames through MCU without modification of the HMI or PLC, a method is proposed that allows users to collect data without being dependent on the modification of PLC and HMI systems. The user collects necessary information from the sniffing data through the parsing operation, and the original communication interface is maintained by transmitting the corresponding sniffing frame to the destination. The MCU's UART communication interface circuit is physically designed according to the RS232 communication standard, and this additionally improves efficiency more so than an interrupt-based system by using the DMA device inside the MCU. In addition, the data frame IO operation is performed by logically separating the work of the DMA interrupt service routine from the work of the main thread using the circular queue. Through this method, the user receives the sniffing data frame between the HMI and PLC in RS232 format, and the frame transfer between PLC and HMI arrives normally at the original destination. By sniffing the data frame without further modification of the PLC and HMI, it can be confirmed that it arrives at the user system normally.

A Link-Label Based Node-to-Link Optimal Path Algorithm Considering Non Additive Path Cost (비가산성 경로비용을 반영한 링크표지기반 Node-to-Link 최적경로탐색)

  • Lee, Mee Young;Nam, Doohee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.91-99
    • /
    • 2019
  • Existing node-to-node based optimal path searching is built on the assumption that all destination nodes can be arrived at from an origin node. However, the recent appearance of the adaptive path search algorithm has meant that the optimal path solution cannot be derived in node-to-node path search. In order to reflect transportation data at the links in real-time, the necessity of the node-to-link (or link-to-node; NL) problem is being recognized. This research assumes existence of a network with link-label and non-additive path costs as a solution to the node-to-link optimal path problem. At the intersections in which the link-label has a turn penalty, the network retains its shape. Non-additive path cost requires that M-similar paths be enumerated so that the ideal path can be ascertained. In this, the research proposes direction deletion and turn restriction so that regulation of the loop in the link-label entry-link-based network transformation method will ensure that an optimal solution is derived up until the final link. Using this method on a case study shows that the proposed method derives the optimal solution through learning. The research concludes by bringing to light the necessity of verification in large-scale networks.

A Study on the Commercialization of a Blockchain-based Cluster Infection Monitoring System (블록체인 기반의 집단감염 모니터링 시스템의 상용화 연구)

  • Seo, Yong-Mo;Hwang, Jeong-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.10
    • /
    • pp.38-47
    • /
    • 2021
  • This study is about a blockchain-based collective quarantine management system and its commercialization model. The configuration of this system includes a biometric information transmission unit that generates biometric information based on measured values generated from wearable devices, a biometric information transmission unit that transmits biometric information generated here from a quarantine management platform, and action information transmitted from the community server. is a system including an action information receiving unit for receiving from the quarantine management platform. In addition, a biometric information receiving unit that collects biometric information from the terminal, an encryption unit that encodes biometric information generated through the biometric information receiving unit based on blockchain encryption technology, and a database of symptoms of infectious diseases to store symptom information and an infection diagnosis database. The generated database includes a location information check unit that receives from the terminal of the user identified as a symptomatic person and determines whether the user has arrived in the community based on the location information confirmation unit and the location of the user after the location is confirmed. It includes a community arrival judgment unit that judges. And, the community server helps the interaction between the generated information. Such a blockchain based collective quarantine management system can help to advance the existing quarantine management system and realize a safer and healthier society.

A Design and Implementation of Bus Information Notification Application

  • Kang, A-Yeon;Lee, Tae-Hyeon;Lee, Na-Kyung;Lee, Won-Joo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.6
    • /
    • pp.81-88
    • /
    • 2021
  • In this paper, we design and implement a bus information notification application based on the GPS sensor of a smartphone. This application provides the ability to check bus stops within a radius of 200m based on the current user's location using the smartphone's GPS sensor, Google Map, and open API. In addition, if you click the marker of the desired stop, you can see the name of the stop, and click the view arrival information button to check the detailed bus arrival information of the stop. In addition, it provides a function to check the location information of pharmacies, nonghyups, and post offices that sell public masks, the names of public mask stores, and mask inventory through the public mask store button. Each icon was used differently to make visual differences in order to easily indicate the difference between the times of public mask sales and bus stops. In addition, if you want to know the information of other bus stops and the route of the desired bus, not around the user's location, click the bus stop search button. Finally, after storing the destination stop or location, it implements a function that provides an alarm when it approaches the location.

Pohang City Fire Vulnerable Area Prediction and Fire Damage Rating Measurement by Administrative District (포항시 화재 취약지역 예측 및 이에 따른 행정구역별 화재 피해 등급 측정)

  • Lim, Jung-Hoon;Kim, Heon-Joo
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.4
    • /
    • pp.166-176
    • /
    • 2021
  • Due to urbanization and industrialization, the importance of large-scale fire prevention, management and measures is increasing day by day. However, the fire site arrival rate in Golden Time, which is a factor that can minimize large-scale fire damage, of Pohang, a large city with a population of over 500,000, is relatively low. So additional fire fighting power deployment and infrastructure investment are required. However, as budget and manpower are limited, it is necessary to selectively deploy fire fighting power and invest in infrastructure. Therefore, this study attempted to present a fire damage rating that can compare the level of fire damage, which is an index that can help selectively provide fire fighting services in Pohang and make related decisions. For the index, the OD cost matrix was used to predict fire vulnerable areas with a high probability of increasing the fire scale in the event of a fire. Also fire damage was measured by predicting the level of fire damage in the event of a fire according to population, building density, and access of fire trucks. It is expected that the fire damage rating will be able to help in various decisions related to fire fighting service deployment and services not only in Pohang city, but also in other regions.

Developing UAM Time Data Sharing System for Efficient Operation of Vertiport (버티포트 효율적 운용을 위한 UAM 시간정보 공유체계 개발방안)

  • Yeong-min Sim;Ye-seung Hwang;Jae-wook Chun;Min-jae Lee;Woo-choon Moon
    • Journal of Advanced Navigation Technology
    • /
    • v.28 no.4
    • /
    • pp.408-419
    • /
    • 2024
  • Currently, the airport is expected to improve flight punctuality and operational efficiency after establishing A-CDM, which provides a foundation for mutual cooperation based on an information sharing system among stakeholders. An important element of the A-CDM is to share time information generated by each stakeholder from the arrival of an aircraft to ground operations and departure of the aircraft, thereby supporting timely arrival and departure of aircraft and improving the efficiency and punctuality of airport operations. In the UAM system, a vertiport that plays a role similar to an airport also needs to establish a system to share time information generated by each stakeholder for efficient operation of limited resources. In this regard, a method is needed to identify time information that needs to be shared by each stakeholder and apply technology to share it. In this paper, we propose an application method for system technology that classifies and mutually shares time information generated by stakeholders related to Vertiport operation according to data characteristics.

Analysis of the Blocking Probability for Wireless PKI (무선 PKI에서의 블러킹 확률 분석)

  • Shin Seung-Soo;Choi Seung Kwon;Ji Hong-Il;Shin Dong-Hwa;Cho Yong-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5A
    • /
    • pp.426-435
    • /
    • 2005
  • this paper, we made out blocking probability analysis for a new authentication structure for reducing the certificate acquisition time which is one of the factors that should be improved in a conventional wireless PKI. A conventional key exchange method simply performs the key exchange setup step based on discrete algebraic subjects. But the mutual-authentication procedure of wireless PKI for reducing authentication time uses an elliptical curve for a key exchange setup step. Besides, we proposed advanced handover method and blocking probability analysis for wireless PKI. Proposed handover method shows reduced handover processing time than conventional method since it can reduce CRL retrieval time. Also, we compared proposed authentication structure and conventional algorithm, and simulation results show that proposed authentication method outperforms conventional algorithm in all environment regardless of call arrival rate, queue service rate, queue size

Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks (광 버스트 스위칭 망에서 최소 경로비용 기반의 동적 경로배정 기법)

  • Lee Hae joung;Song Kyu yeop;Yoo Kyoung min;Yoo Wan;Kim Young chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.72-84
    • /
    • 2005
  • Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.