• Title/Summary/Keyword: GPS 속도

Search Result 376, Processing Time 0.026 seconds

Nitrogen and Phosphorus Removal Characteristics of a New Biological Nutrient Removal Process with Pre-Denitrification by Pilot Scale and Computer Simulation Program (선단무산소조를 이용한 영양소제거공정(Bio-NET)의 질소·인 제거 특성)

  • Oh, Young-Khee;Oh, Sung-Min;Hwang, Yenug-Sang;Lee, Kung-Soo;Park, No-Yeon;Ko, Kwang-Baik
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.22 no.1
    • /
    • pp.121-132
    • /
    • 2000
  • This study is to investigate the performance of a new BNR process using predenitrification scheme focusing on nitrogen removal and the possibility of adapting a computer simulation scheme in BNR process development. By using a pre-denitrification basin, higher $COD/NO_3-N$ ratio could be sustained in this BNR process. The results of the investigation showed a SDNR value of 9.04mg/gMv/hr. In the anoxic tank, the average value of SPRR of 6.25mgP/gMv/hr was observed to be very sensitive to SCOD load of influents. By calibrating internal parameters (stoichiometric and kinetic parameters) of the simulation model, the results of simulation for various BNR processes gave good agreement with observed data. The major adjustment was given with three parameters, maximum specific growth rate of heterotrophic biomass, short chain fatty acid (SCFA) limit, and phosphorous release rate. With the series of simulations on varying operational conditions, the simulation by computer program can be a useful tool for process selection, and design and operation of municipal wastewater treatment plant.

  • PDF

Long-Term Arrival Time Estimation Model Based on Service Time (버스의 정차시간을 고려한 장기 도착시간 예측 모델)

  • Park, Chul Young;Kim, Hong Geun;Shin, Chang Sun;Cho, Yong Yun;Park, Jang Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.297-306
    • /
    • 2017
  • Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

A Study for Optimized Detecter Location Considering the Traffic Characteristics in National Highway (일반국도 통행특성을 고려한 지점검지기의 적정설치지점 선정에 관한 연구)

  • Byeon, Sang-Cheol;Lee, Seung-Jae
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.2 s.88
    • /
    • pp.19-30
    • /
    • 2006
  • This study deals with the optimized detector location considering the traffic characteristics in National Highway. Although there ave many construction works for ITS in National Highway, there is not specific criteria for detector location which can effect the accuracy of traffic information. This study. therefore. aims to Provide the optimized detector location criteria which can represent the traffic characteristics of National Highway. It collects traffic factors of study area by GPS Probe-car and defector, and Presents the optimized detector location by the correlation analysis between spot-speed and link-travel-time. The main results of this study are as followings ; First, the correlation between the spot-speed and link-travel-time Presents the opposite bell shape of the graph (U-type owe) which is increased it?on the upstream then, declined through some unspecified Point of the link. Second, the optimized detector location usually distributes around midstream of link, even though it does not have a consistency. Third, therefore, the optimized detector location generally should be located between $55{\sim}60%$ of total link length. Forth. high level of vertical slope is one of the most important factors of detector location, so it should be excluded for determination of optimized detector location. Finally, expecting that the results of this study would improve the accuracy of travel time estimation and forecasting.

A Point-to-Point Shortest Path Search Algorithm for Digraph (방향그래프의 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.7
    • /
    • pp.893-900
    • /
    • 2007
  • This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

Development of Intelligent Compaction System for Efficient Quality Control (효율적 품질관리를 위한 지능형 다짐 시스템 개발)

  • Lee, Soomin;Park, Sangil;Lee, Riho;Seo, Jongwon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.5
    • /
    • pp.751-760
    • /
    • 2018
  • Currently, the quality measurement of the work is carried out by the supervisor's visual inspection, as the workers individually judge the number of resolutions, thickness, speed and vibration. After work, we are conducting follow-up work through traditional spot test, which is less representative. Therefore, it is impossible to check the results of the resolution, and there is always the possibility that problems will arise due to poor construction. This study demonstrates the feasibility of using the continuous compaction strength measurement method by comparing the continuous compaction strength measurement method and the conventional compaction strength measurement method after performing the compaction in the actual field scale in various test conditions. The validity is verified by analyzing the Compaction Meter Value of an Intelligent Compaction roller composed of a Global Positioning System and an accelerometer, Based on the proven results, a full range of quality can be confirmed without a single test. The quality confirmation is visualized in the compaction control program developed in this study, This enables the field manager to perform real-time quality monitoring at the same time as compaction.

A Design and Implementation for a Reliable Data Storage in a Digital Tachograph (디지털 자동차운행기록계에서 안정적인 데이터 저장을 위한 설계 및 구현)

  • Baek, Sung Hoon;Son, Myunghee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.2
    • /
    • pp.71-78
    • /
    • 2012
  • The digital tachograph is a device that automatically records speed and distance of a vehicle, together with the driver's activity and vehicle status at an accident. It records vehicle speed, break status, acceleration, engine RPM, longitude and latitude of GPS, accumulated distance, and so on. European Commission regulation made digital tachographs mandatory for all trucks from 2005. Republic of Korea made digital tachographs mandatory for all new business vehicles from 2011 and is widening the range of vehicles that must install digital tachographs year by year. This device is used to analyze driver's daily driving information and car accidents. Under a car accident that makes the device reliability unpredictable, it is very important to store driving information with maximum reliability for its original mission. We designed and implemented a practical digital tachograph. This paper presents a storage scheme that consists of a first storage device with small capacity at a high reliability and a second storage device with large capacity at a low cost in order to reliably records data with a hardware at a low cost. The first storage device records data in a SLC NAND flash memory in a log-structured style. We present a reverse partial scan that overcomes the slow scan time of log-structured storages at the boot stage. The scheme reduced the scan time of the first storage device by 1/50. In addition, our design includes a scheme that fast stores data at a moment of accident by 1/20 of data transfer time of a normal method.

Fast Heuristic Algorithm for Similarity of Trajectories Using Discrete Fréchet Distance Measure (이산 프레셰 거리 척도를 이용한 궤적 유사도 고속계산 휴리스틱 알고리즘)

  • Park, Jinkwan;Kim, Taeyong;Park, Bokuk;Cho, Hwan-Gue
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.4
    • /
    • pp.189-194
    • /
    • 2016
  • A trajectory is the motion path of a moving object. The advances in IT have made it possible to collect an immeasurable amount of various type of trajectory data from a moving object using location detection devices like GPS. The trajectories of moving objects are widely used in many different fields of research, including the geographic information system (GIS) field. In the GIS field, several attempts have been made to automatically generate digital maps of roads by using the vehicle trajectory data. To achieve this goal, the method to cluster the trajectories on the same road is needed. Usually, the $Fr{\acute{e}}chet$ distance measure is used to calculate the distance between a pair of trajectories. However, the $Fr{\acute{e}}chet$ distance measure requires prolonged calculation time for a large amount of trajectories. In this paper, we presented a fast heuristic algorithm to distinguish whether the trajectories are in close distance or not using the discrete $Fr{\acute{e}}chet$ distance measure. This algorithm trades the accuracy of the resulting distance with decreased calculation time. By experiments, we showed that the algorithm could distinguish between the trajectory within 10 meters and the distant trajectory with 95% accuracy and, at worst, 65% of calculation reduction, as compared with the discrete $Fr{\acute{e}}chet$ distance.

A Mobile P2P Message Platform Enabling the Energy-Efficient Handover between Heterogeneous Networks (이종 네트워크 간 에너지 효율적인 핸드오버를 지원하는 모바일 P2P 메시지 플랫폼)

  • Kim, Tae-Yong;Kang, Kyung-Ran;Cho, Young-Jong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.10
    • /
    • pp.724-739
    • /
    • 2009
  • This paper suggests the energy-efficient message delivery scheme and the software platform which exploits the multiple network interfaces of the mobile terminals and GPS in the current mobile devices. The mobile terminals determine the delivery method among 'direct', 'indirect', and 'WAN' based on the position information of itself and other terminals. 'Direct' method sends a message directly to the target terminal using local RAT. 'Indirect' method extends the service area by exploiting intermediate terminals as relay node. If the target terminal is too far to reach through 'direct' or 'indirect' method, the message is sent using wireless WAN technology. Our proposed scheme exploits the position information and, thus, power consumption is drastically reduced in determining handover time and direction. Network simulation results show that our proposed delivery scheme improves the message transfer efficiency and the handover detection latency. We implemented a message platform in a smart phone realizing the proposed delivery scheme. We compared our platform with other typical message platforms from energy efficiency aspect by observing the real power consumption and applying the mathematical modeling. The comparison results show that our platform requires significantly less power.

Design of Embedded Security Controller Based on Client Authentication Utilizing User Movement Information (사용자의 이동정보를 활용한 클라이언트 인증 기반의 임베디드 보안 컨트롤러 설계)

  • Hong, Suk-Won
    • Journal of Digital Convergence
    • /
    • v.18 no.3
    • /
    • pp.163-169
    • /
    • 2020
  • A smart key has been used in a variety of embedded environments and there also have been attacks from a remote place by amplifying signals at a location of a user. Existing studies on defence techniques suggest multiple sensors and hash functions to improve authentication speed; these, however, increase the electricity usage and the probability of type 1 error. For these reasons, I suggest an embedded security controller based on client authentication and user movement information improving the authentication method between a controller and a host device. I applied encryption algorithm to the suggested model for communication using an Arduino board, GPS, and Bluetooth and performed authentication through path analysis utilizing user movement information for the authentication. I found that the change in usability was nonsignificant when performing actions using the suggested model by evaluating the time to encode and decode. The embedded security controller in the model can be applied to the system of a remote controller for a two-wheeled vehicle or a mobile and stationary host device; in the process of studying, I found that encryption and decryption could take less then 100ms. The later study may deal with protocols to speed up the data communication including encryption and decryption and the path data management.

Methodology for Processing GPS-based Bicycle Speed Data for Monitoring Bicycle Traffic (자전거 모니터링을 위한 자료처리 프로세스 개발 및 응용 - GPS기반 자전거 속도자료를 중심으로)

  • Rim, Heesub;Joo, Shinhye;Oh, Cheol
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.13 no.3
    • /
    • pp.10-24
    • /
    • 2014
  • Bicycle is a useful transportation mode that is healthy, emission-free, and environmentally compatible. Although large efforts have been made to promote the use of bicycling to date, there still exist various hurdles and limitations. One of the key issues to increase bicycling is how to gather bicycle-related data from the field and to generate valuable information for both users and operations agencies. This study proposes a method to process bicycle trajectory data which is obtained from tracing global positioning systems(GPS) equipped bicycle, which is defined as the probe bicycle. The proposed method is based on the concept of statistical quality control of data. In addition, a data collection and processing scenario in support of public bicycle system is presented. The outcomes of this study would be valuable fundamentals for developing bicycle traffic information systems that is a part of future intelligent transportation systems(ITS).