• Title/Summary/Keyword: 도착지

Search Result 605, Processing Time 0.031 seconds

Deep Learning based Frame Synchronization Using Convolutional Neural Network (합성곱 신경망을 이용한 딥러닝 기반의 프레임 동기 기법)

  • Lee, Eui-Soo;Jeong, Eui-Rim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.4
    • /
    • pp.501-507
    • /
    • 2020
  • This paper proposes a new frame synchronization technique based on convolutional neural network (CNN). The conventional frame synchronizers usually find the matching instance through correlation between the received signal and the preamble. The proposed method converts the 1-dimensional correlator ouput into a 2-dimensional matrix. The 2-dimensional matrix is input to a convolutional neural network, and the convolutional neural network finds the frame arrival time. Specifically, in additive white gaussian noise (AWGN) environments, the received signals are generated with random arrival times and they are used for training data of the CNN. Through computer simulation, the false detection probabilities in various signal-to-noise ratios are investigated and compared between the proposed CNN-based technique and the conventional one. According to the results, the proposed technique shows 2dB better performance than the conventional method.

Risk Analysis of Aircraft Operations in Seoul TMA Based on DAA Well Clear Metrics using Recorded ADS-B Data (ADS-B 데이터를 이용한 서울 TMA에서의 DAA Well Clear 기반 위험도 분석)

  • Lee, Hak-Tae;Lee, Hyeonwoong
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.6
    • /
    • pp.527-532
    • /
    • 2020
  • Seoul terminal maneuvering area (TMA) that includes Incheon International Airport (ICN) and Gimpo International Airport is a very congested airspace with around 1,000 daily flights and the airspace blocked at the boundary between Incheon flight information region (FIR) and Pyongyang FIR. Consequently, with frequency radar vectorings, separation assurance in this airspace is complicated thus resulting in higher controller workload. In this paper, the conflict and collision risks in Seoul TMA are analyzed using recorded ADS-B data for past three years. Using the recorded trajectories, original flight plan procesures and routes are reconstructed and the risks are quantified using detect and avoid well clear (DWC) metric that is developed for large unmanned aircraft system. The region west of ICN was found to be the highest risk area regardless of the runway directions. In addition, merge and crossing points between procedures displayed relatively high risks.

Risk Analysis of Flight Procedures at Incheon International Airport and Gimpo International Airport (인천국제공항과 김포국제공항의 비행 절차 위험도 분석)

  • Lee, Hyeonwoong;Lee, Hak-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.6
    • /
    • pp.500-507
    • /
    • 2020
  • This paper presents a risk assessment methodology for standard flight procedures using recorded automatic dependent surveillance-broadcast (ADS-B) data. Utilizing the proposed methodology, the results of risk analyses in RKSI (incheon international airport) and RKSS (gimpo international airport) using trajectories that are regenerated based on 100 days of ADS-B data are presented. For the risk metric, detect and avoid well clear (DWC) is used. With this index, each procedure was evaluated for the sections with highest level of risk. Among the standard instrument departure (SID) of RKSI, the section between SI712 and RANOS of RNAV BOPTA 1L showed the highest level of risk. For the standard terminal arrival route (STAR) of RKSI, section between SI947 and DANAN of RNAV GUKDO 1N wasthe one with the highest level of risk. For RKSS, the segment between SS726 and SS727 of RNAV BULTI 1X and the segment between KAKSO and KALMA of RNAV OLMEN 1D showed the highest level of risk among the SIDs and STARs, respectivly.

An Optimal Container Deployment Policy in Fog Computing Environments (Fog Computing 환경에서의 최적화된 컨테이너 배포 정책)

  • Jin, Sunggeun;Chun, In-Geol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.3
    • /
    • pp.1-7
    • /
    • 2021
  • Appropriate containers are deployed to cope with new request arrivals at Fog Computing (FC) hosts. In the case, we can consider two scenarios: (1) the requests may be queued until sufficient resources are prepared for the container deployments; (2) FC hosts may transfer arrived service requests to nearby FC hosts when they cannot accommodate new container deployments due to their limited or insufficient resources. Herein, for more employed neighboring FC hosts, arrived service requests may experience shorter waiting time in container deployment queue of each FC host. In contrast, they may take longer transfer time to pass through increased number of FC hosts. For this reason, there exists a trade-off relationship in the container deployment time depending on the number of employed FC hosts accommodating service request arrivals. Consequently, we numerically analyze the trade-off relationship to employ optimal number of neighboring FC hosts.

Algorithm for Block Packing of Main Memory Allocation Problem (주기억장치 할당 문제의 블록 채우기 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.6
    • /
    • pp.99-105
    • /
    • 2022
  • This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.

A Study on the Application of Machine Learning to Improve BIS (Bus Information System) Accuracy (BIS(Bus Information System) 정확도 향상을 위한 머신러닝 적용 방안 연구)

  • Jang, Jun yong;Park, Jun tae
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.3
    • /
    • pp.42-52
    • /
    • 2022
  • Bus Information System (BIS) services are expanding nationwide to small and medium-sized cities, including large cities, and user satisfaction is continuously improving. In addition, technology development related to improving reliability of bus arrival time and improvement research to minimize errors continue, and above all, the importance of information accuracy is emerging. In this study, accuracy performance was evaluated using LSTM, a machine learning method, and compared with existing methodologies such as Kalman filter and neural network. As a result of analyzing the standard error for the actual travel time and predicted values, it was analyzed that the LSTM machine learning method has about 1% higher accuracy and the standard error is about 10 seconds lower than the existing algorithm. On the other hand, 109 out of 162 sections (67.3%) were analyzed to be excellent, indicating that the LSTM method was not entirely excellent. It is judged that further improved accuracy prediction will be possible when algorithms are fused through section characteristic analysis.

Vehicle control system base on the low power long distance communication technology(NB-IoT)

  • Kim, Sam-Taek
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.6
    • /
    • pp.117-122
    • /
    • 2022
  • In this paper, we developed a vehicle control terminal using IoT and low-power long-distance communication (NB-IoT) technology. This system collects information on the location and status of a parked vehicle, and transmits the vehicle status to the vehicle owner's terminal in real time with low power to prevent vehicle theft, and in the case of a vehicle in motion, When primary information about the vehicle, such as an impact, is collected and transmitted to the server, the server analyzes the relevant data to generate secondary information on traffic congestion, road damage, and safety accidents. By sending it, you can know the exact arrival time of the vehicle at its destination. This terminal device is an IoT gateway for a vehicle and can be connected to various wired and wireless sensors inside the vehicle. In addition, the data collected from vehicle maintenance, efficient operation, and vehicles can be usefully used in the private or public sector.

DDoS Defense using Address Prefix-based Priority Service (Address Prefix에 기반한 우선 순위 서비스를 이용한 DDoS 방어)

  • Jin, Jinghe;Lee, Tai-Jin;Nam, Seung-Yeob
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.207-217
    • /
    • 2009
  • We propose a two-stage Distributed Denial of Service (DDoS) defense system, which can protect a given subnet by serving existing flows and new flows with a different priority based on IP history information. Denial of Service (DoS) usually occurs when the resource of a network node or link is limited and the demand of the users for that resource exceeds the capacity. The objective of the proposed defense system is to provide continued service to existing flows even in the presence of DDoS attacks. The proposed scheme can protect existing connections effectively with a smaller memory size by reducing the monitored IP address set through sampling and per-prefix history management. We evaluate the performance of the proposed scheme through simulation.

Waiting Time and Sojourn Time Analysis of Discrete-time Geo/G/1 Queues under DT-policy (DT-정책 하에서 운영되는 이산시간 Geo/G/1 시스템의 대기시간과 체재시간 분석)

  • Se Won Lee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.29 no.2
    • /
    • pp.69-80
    • /
    • 2024
  • In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.

Implementation of The Personal Secretary System using Raspberry-Pi (라즈베리파이를 이용한 개인 비서 시스템 구현)

  • Park, Na-Hyun;Park, Ji-Hyun;Yun, So-Hyun;Park, Jeong-Sik;Kim, Tai-Woo
    • Journal of Internet of Things and Convergence
    • /
    • v.3 no.1
    • /
    • pp.1-8
    • /
    • 2017
  • Information and time are very important for a modem life, and researches about the personal secretary system that provides specific information for each individual are being studied. In this research, we developed the personal secretary system called Genie which provides the user with desired informations such as weather, news, and traffic information with time. It is expected that the Genie system will provide information on news, weather, traffic information including bus arrival times, and memos with time so that users can find their own leisure time and live a comfortable life.