• Title/Summary/Keyword: 도착지

Search Result 605, Processing Time 0.031 seconds

Analysis for Changes of Mode Choice Behavior from Providing Real-time Schedule for Public Transportation by Smartphone Application (스마트폰 애플리케이션을 이용한 대중교통 운행정보 제공에 따른 통행자 수단선택 행태변화 분석)

  • Choi, Sung-Taek;Rho, Jeong-Hyun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.6
    • /
    • pp.60-69
    • /
    • 2012
  • Public Transport Information Service which use smartphone Apps has received attention as the way of solution that reduced transport problem. Smartphone can offer real-time information because of a LBS(Location Based Service) system. This study try to find out which factor affect mode choice ratio of public transport, especially smartphone Apps. The result shows that rising oil price, traffic congestion, public information service with smartphone apps, BIS(Bus Information System) factors get 0.39, 0.27, 0.18, 0.16 scores with paired comparison. Younger and student respondents prefer smart phone public information service. Decision Tree shows that the most important decision factor is smartphone information service factor.

A Study on Energy Efficiency for Cluster-based Routing Protocol (클러스터 기반 라우팅 프로토콜의 에너지 효율성에 관한 연구)

  • Lee, Won-Seok;Ahn, Tae-Won;Song, ChangYoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.3
    • /
    • pp.163-169
    • /
    • 2016
  • To establish the equitable distribution of total energy load, a representative cluster based routing protocol LEACH selects cluster heads randomly in accordance with the pre-determined probability every round. But because the current energy level of sensor nodes is not considered, if a sensor node which has little residual energy is elected as a cluster head, it can not live to fulfil the role of cluster head which has big energy load. As a result, the first time of death of a node is quickened and the service quality of WSN gets worse. In this regard we propose a new routing method that, by considering the current energy of a cluster head and the distance between cluster heads and a base station, selects the sub cluster head for saving the energy of a cluster head. Simulation results show that the first time of death of a node prolongs, more data arrive at the base station and the service quality of WSN improves.

A Novel Ambiguity Resolution Method of Radar Pulses using Genetic Algorithm (유전 알고리즘 기반 레이더 펄스 모호성 해결방법)

  • Han, Jinwoo;Jo, Jeil;Kim, Sanhae;Park, Jintae;Song, Kyuha
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.4
    • /
    • pp.184-193
    • /
    • 2015
  • Passive Surveillance System based on the TDOA detects the emitter position in the air using TOA of pulses comprising emitter signal from multiple receivers. In case that PRI of pulses from the emitter is not enough big in comparison with the distance among receivers, it causes the ambiguity problem in selecting proper pulse pairs for TDOA emitter geolocation. In this paper, a novel ambiguity resolution method of radar pulses is presented by using genetic algorithm after changing ambiguity problem into optimization problem between TDOA of received pulses from each receiver and emitter position. Simulation results are presented to show the performance of the proposed method.

An Implementation of $A^*$ Algorithm with Turn Heuristic for Enhancing the Straightness of a Path (경로의 직진성을 고려한 턴 휴리스틱 $A^*$ 알고리즘의 구현)

  • Moon, Dae-Jin;Cho, Dae-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.11
    • /
    • pp.2072-2077
    • /
    • 2007
  • In driving a car, u-turn or left turn makes the speed of car decrease considerably or require more waiting time at the cross for the traffic signal to turn green. A more straight path, therefore, is probably fester to arrive at the destination than zig-zaged path with same distance. Previous works related to the path navigation do not consider the straightness of the path. In this paper, we have proposed the path navigation algorithm with turn heuristic for enhancing the straightness of a path. We have implement the proposed algorithm and compared it with a traditional $A^*$ algorithm. The experimental result shows that the degree of the straightness of a path is enhanced by 30% and the navigation distance of a path is deceased by 3.3%.

Periodic Scheduling Problem on Parallel Machines (병렬설비를 위한 주기적 일정계획)

  • Joo, Un Gi
    • Journal of Convergence for Information Technology
    • /
    • v.9 no.12
    • /
    • pp.124-132
    • /
    • 2019
  • Scheduling problems can be classified into offline and online ones. This paper considers an online scheduling problem to minimize makespan on the identical parallel machines. For dynamically arrived jobs with their ready times, we show that the sequencing order according to the ERD (Earliest Ready Date) rule is optimal to minimize makespan. This paper suggests an algorithm by using the MIP(Mixed Integer Programming) formulation periodically to find a good periodic schedule and evaluates the required computational time and resulted makespan of the algorithm. The comparition with an offline scheduling shows our algorithm makes the schedule very fast and the makespan can be reduced as the period time reduction, so we can conclude that our algorithm is useful for scheduling the jobs under online environment even though the number of jobs and machines is large. We expect that the algorithm is invaluable one to find good schedules for the smart factory and online scheduler using the blockchain mechanism.

Mileage-based Asymmetric Multi-core Scheduling for Mobile Devices (모바일 디바이스를 위한 마일리지 기반 비대칭 멀티코어 스케줄링)

  • Lee, Se Won;Lee, Byoung-Hoon;Lim, Sung-Hwa
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.26 no.5
    • /
    • pp.11-19
    • /
    • 2021
  • In this paper, we proposed an asymmetric multi-core processor scheduling scheme which is based on the mileage of each core. We considered a big-LITTLE multi-core processor structure, which consists of low power consuming LITTLE cores with general performance and high power consuming big cores with high performance. If a task needs to be processed, the processor decides a core type (big or LITTLE) to handle the task, and then investigate the core with the shortest mileage among unoccupied cores. Then assigns the task to the core. We developed a mileage-based balancing algorithm for asymmetric multi-core assignment and showed that the proposed scheduling scheme is more cost-effective compared to the traditional scheme from a management perspective. Simulation is also conducted for the purpose of performance evaluation of our proposed algorithm.

Formal Model of Extended Reinforcement Learning (E-RL) System (확장된 강화학습 시스템의 정형모델)

  • Jeon, Do Yeong;Song, Myeong Ho;Kim, Soo Dong
    • Journal of Internet Computing and Services
    • /
    • v.22 no.4
    • /
    • pp.13-28
    • /
    • 2021
  • Reinforcement Learning (RL) is a machine learning algorithm that repeat the closed-loop process that agents perform actions specified by the policy, the action is evaluated with a reward function, and the policy gets updated accordingly. The key benefit of RL is the ability to optimze the policy with action evaluation. Hence, it can effectively be applied to developing advanced intelligent systems and autonomous systems. Conventional RL incoporates a single policy, a reward function, and relatively simple policy update, and hence its utilization was limited. In this paper, we propose an extended RL model that considers multiple instances of RL elements. We define a formal model of the key elements and their computing model of the extended RL. Then, we propose design methods for applying to system development. As a case stud of applying the proposed formal model and the design methods, we present the design and implementation of an advanced car navigator system that guides multiple cars to reaching their destinations efficiently.

Advanced Estimation Model of Runway Visual Range using Deep Neural Network (심층신경망을 이용한 활주로 가시거리 예측 모델의 고도화)

  • Ku, SungKwan;Park, ChangHwan;Hong, SeokMin
    • Journal of Advanced Navigation Technology
    • /
    • v.22 no.6
    • /
    • pp.491-499
    • /
    • 2018
  • Runway visual range (RVR), one of the important indicators of aircraft takeoff and landing, is affected by meteorological conditions such as temperature, humidity, etc. It is important to estimate the RVR at the time of arrival in advance. This study estimated the RVR of the local airport after 1 hour by upgrading the RVR estimation model using the proposed deep learning network. To this end, the advancement of the estimation model was carried out by changing the time interval of the meteorological data (temperature, humidity, wind speed, RVR) as input value and the linear conversion of the results. The proposed method generates estimation model based on the past measured meteorological data and estimates the RVR after 1 hour and confirms its validity by comparing with measured RVR after 1 hour. The proposed estimation model could be used for the RVR after 1 hour as reference in small airports in regions which do not forecast the RVR.

Feature Extraction of Radar Signals Using Streaming Process (스트리밍 처리에 의한 레이더 신호 특성 추출)

  • Kim, Gwan-Tae;Ju, Young-Kwan;Jeon, Joongnam
    • Journal of Convergence for Information Technology
    • /
    • v.10 no.12
    • /
    • pp.31-38
    • /
    • 2020
  • Radar signal identification of electronic warfare is a technology that recognizes the pulse repetition interval (PRI) from a set of pulse description words (PDWs) generated by the signal receiver. Conventionally batch processing is widely used in which a number of PDWs are collected as a unit and identifies PRI from the batch. In this paper, we propose a feature extraction algorithm based on the streaming process. This technique does not wait to form a batch. Whenever a PDW(Pulse Description Word) is generated from the signal receiver, the streaming process tries to form a cluster of PDWs, and makes the DTOA (Difference of Time of Arrival) histogram, finds out the frame PRI based on the concentration ratio, and decides the number of stagger stages. Experiments proved that the proposed algorithm derives stable recognition results as the cluster size increases.

Power Analysis Attacks on the Stream Cipher Rabbit (스트림 암호 Rabbit에 대한 전력분석 공격)

  • Bae, Ki-Seok;Ahn, Man-Ki;Park, Jea-Hoon;Lee, Hoon-Jae;Moon, Sang-Jae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.3
    • /
    • pp.27-35
    • /
    • 2011
  • Design of Sensor nodes in Wireless Sensor Network(WSN) should be considered some properties as electricity consumption, transmission speed, range, etc., and also be needed the protection against various attacks (e.g., eavesdropping, hacking, leakage of customer's secret data, and denial of services). The stream cipher Rabbit, selected for the final eSTREAM portfolio organized by EU ECRYPT and selected as algorithm in part of ISO/IEC 18033-4 Stream Ciphers on ISO Security Standardization recently, is a high speed stream cipher suitable for WSN. Since the stream cipher Rabbit was evaluated the complexity of side-channel analysis attack as 'Medium' in a theoretical approach, thus the method of power analysis attack to the stream cipher Rabbit and the verification of our method by practical experiments were described in this paper. We implemented the stream cipher Rabbit without countermeasures of power analysis attack on IEEE 802.15.4/ZigBee board with 8-bit RISC AVR microprocessor ATmega128L chip, and performed the experiments of power analysis based on difference of means and template using a Hamming weight model.