• Title/Summary/Keyword: Computer data processing

Search Result 4,329, Processing Time 0.031 seconds

Arrival Time Estimation for Bus Information System Using Hidden Markov Model (은닉 마르코프 모델을 이용한 버스 정보 시스템의 도착 시간 예측)

  • 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.4
    • /
    • pp.189-196
    • /
    • 2017
  • BIS(Bus Information System) provides the different information related to buses including predictions of arriving times at stations. BIS have been deployed almost all cities in our country and played active roles to improve the convenience of public transportation systems. Moving average filters, Kalman filter and regression models have been representative in forecasting the arriving times of buses in current BIS. The accuracy in prediction of arriving times depends largely on the forecasting algorithms and traffic conditions considered when forecasting in BIS. In present BIS, the simple prediction algorithms are used only considering the passage times and distances between stations. The forecasting of arrivals, however, have been influenced by the traffic conditions such as traffic signals, traffic accidents and pedestrians ets., and missing data. To improve the accuracy of bus arriving estimates, there are big troubles in building models including the above problems. Hidden Markov Models have been effective algorithms considering various restrictions above. So, we have built the HMM forecasting models for bus arriving times in the current BIS. When building models, the data collected from Sunchean City at 2015 have been utilized. There are about 2298 stations and 217 routes in Suncheon city. The models are developed differently week days and weekend. And then the models are conformed with the data from different districts and times. We find that our HMM models can provide more accurate forecasting than other existing methods like moving average filters, Kalmam filters, or regression models. In this paper, we propose Hidden Markov Model to obtain more precise and accurate model better than Moving Average Filter, Kalman Filter and regression model. With the help of Hidden Markov Model, two different sections were used to find the pattern and verified using Bootstrap process.

A Study on Big Data Based Non-Face-to-Face Identity Proofing Technology (빅데이터 기반 비대면 본인확인 기술에 대한 연구)

  • Jung, Kwansoo;Yeom, Hee Gyun;Choi, Daeseon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.10
    • /
    • pp.421-428
    • /
    • 2017
  • The need for various approaches to non-face-to-face identification technology for registering and authenticating users online is being required because of the growth of online financial services and the rapid development of financial technology. In general, non-face-to-face approaches can be exposed to a greater number of threats than face-to-face approaches. Therefore, identification policies and technologies to verify users by using various factors and channels are being studied in order to complement the risks and to be more reliable non-face-to-face identification methods. One of these new approaches is to collect and verify a large number of personal information of user. Therefore, we propose a big-data based non-face-to-face Identity Proofing method that verifies identity on online based on various and large amount of information of user. The proposed method also provides an identification information management scheme that collects and verifies only the user information required for the identity verification level required by the service. In addition, we propose an identity information sharing model that can provide the information to other service providers so that user can reuse verified identity information. Finally, we prove by implementing a system that verifies and manages only the identity assurance level required by the service through the enhanced user verification in the non-face-to-face identity proofing process.

Dynamic Buffer Partitioning Technique for Efficient Continuous Media Service in VOD Servers (VOD 서버에서 효율적인 연속미디어 서비스를 위한 동적 버퍼 분할 기법)

  • Kwon, Chun-Ja;Choi, Chang-Yeol;Choi, Hwang-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.137-146
    • /
    • 2002
  • In VOD server, in order to guarantee playback of continuous media, such as video, without hiccups for multiusers, the server has to manage its buffer sophisticatedly by prefeching a part of the data into the buffer As the continuous media data buffered by one user can be used again by the others, the number of disk accesses is reduced and then the latency time far the users is also reduced. In this paper, we propose a new buffer management technique for continuous media in VOD server. Our basic algorithm partitions the buffer into groups and then a group of buffer which has the lowest utilization is chosen and partitioned again for a new user. The basic algorithm is extended for supporting multiple streams and clip data and for providing VCR functions. Our proposed technique is able to increase in the number of concurrent users as increasing the utilization of the buffer and to minimize the average waiting time for multiuser accesses as the bandwidth of storage is slowly reached to the limit. In the simulation study for comparing the performance of our technique with that of the existing techniques, we show that the average waiting time is reduced mere than 50% and the number of concurrent users increases by 1 ∼5% as compared with those of the exiting techniques.

Development of Workbench for Analysis and Visualization of Whole Genome Sequence (전유전체(Whole gerlome) 서열 분석과 가시화를 위한 워크벤치 개발)

  • Choe, Jeong-Hyeon;Jin, Hui-Jeong;Kim, Cheol-Min;Jang, Cheol-Hun;Jo, Hwan-Gyu
    • The KIPS Transactions:PartA
    • /
    • v.9A no.3
    • /
    • pp.387-398
    • /
    • 2002
  • As whole genome sequences of many organisms have been revealed by small-scale genome projects, the intensive research on individual genes and their functions has been performed. However on-memory algorithms are inefficient to analysis of whole genome sequences, since the size of individual whole genome is from several million base pairs to hundreds billion base pairs. In order to effectively manipulate the huge sequence data, it is necessary to use the indexed data structure for external memory. In this paper, we introduce a workbench system for analysis and visualization of whole genome sequence using string B-tree that is suitable for analysis of huge data. This system consists of two parts : analysis query part and visualization part. Query system supports various transactions such as sequence search, k-occurrence, and k-mer analysis. Visualization system helps biological scientist to easily understand whole structure and specificity by many kinds of visualization such as whole genome sequence, annotation, CGR (Chaos Game Representation), k-mer, and RWP (Random Walk Plot). One can find the relations among organisms, predict the genes in a genome, and research on the function of junk DNA using our workbench.

Cooperative Multi-Agent Reinforcement Learning-Based Behavior Control of Grid Sortation Systems in Smart Factory (스마트 팩토리에서 그리드 분류 시스템의 협력적 다중 에이전트 강화 학습 기반 행동 제어)

  • Choi, HoBin;Kim, JuBong;Hwang, GyuYoung;Kim, KwiHoon;Hong, YongGeun;Han, YounHee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.8
    • /
    • pp.171-180
    • /
    • 2020
  • Smart Factory consists of digital automation solutions throughout the production process, including design, development, manufacturing and distribution, and it is an intelligent factory that installs IoT in its internal facilities and machines to collect process data in real time and analyze them so that it can control itself. The smart factory's equipment works in a physical combination of numerous hardware, rather than a virtual character being driven by a single object, such as a game. In other words, for a specific common goal, multiple devices must perform individual actions simultaneously. By taking advantage of the smart factory, which can collect process data in real time, if reinforcement learning is used instead of general machine learning, behavior control can be performed without the required training data. However, in the real world, it is impossible to learn more than tens of millions of iterations due to physical wear and time. Thus, this paper uses simulators to develop grid sortation systems focusing on transport facilities, one of the complex environments in smart factory field, and design cooperative multi-agent-based reinforcement learning to demonstrate efficient behavior control.

Program Development to Evaluate Permeability Tensor of Fractured Media Using Borehole Televiewer and BIPS Images and an Assessment of Feasibility of the Program on Field Sites (시추공 텔리뷰어 및 BIPS의 영상자료 해석을 통한 파쇄매질의 투수율텐서 계산 프로그램 개발 및 현장 적용성 평가)

  • 구민호;이동우;원경식
    • The Journal of Engineering Geology
    • /
    • v.9 no.3
    • /
    • pp.187-206
    • /
    • 1999
  • A computer program to numerically predict the permeability tensor of fractured rocks is developed using information on discontinuities which Borehole Televiewer and Borehole Image Processing System (BIPS) provide. It uses orientation and thickness of a large number of discontinuities as input data, and calculates relative values of the 9 elements consisting of the permeability tensor by the formulation based on the EPM model, which regards a fractured rock as a homogeneous, anisotropic porous medium. In order to assess feasibility of the program on field sites, the numerically calculated tensor was obtained using BIPS logs and compared to the results of pumping test conducted in the boreholes of the study area. The degree of horizontal anisotropy and the direction of maximum horizontal permeability are 2.8 and $N77^{\circ}CE$, respectively, determined from the pumping test data, while 3.0 and $N63^{\circ}CE$ from the numerical analysis by the developed program. Disagreement between two analyses, especially for the principal direction of anisotropy, seems to be caused by problems in analyzing the pumping test data, in applicability of the EPM model and the cubic law, and in simplified relationship between the crack size and aperture. Aside from these problems, consideration of hydraulic parameters characterizing roughness of cracks and infilling materials seems to be required to improve feasibility of the proposed program. Three-dimensional assessment of its feasibility on field sites can be accomplished by conducting a series of cross-hole packer tests consisting of an injecting well and a monitoring well at close distance.

  • PDF

Scheduling Method of Real-Time Mobile Transaction Manager considering Value of Transactions and Validity of Real-Time Data (트랜잭션의 중요도와 데이터의 유효성을 고려한 실시간 이동 트랜잭션 관리자의 스케줄링 기법)

  • Jo, Suk-Gyeong;Kim, Gyeong-Bae;Lee, Sun-Jo;Bae, Hae-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.533-542
    • /
    • 2001
  • In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

  • PDF

Performance improvement on mobile devices using MVC+Prefetch Controller Pattern (MVC+Prefetch Controller 패턴을 사용한 모바일 기기의 성능향상 기법)

  • Im, Byung-Jai;Lee, Eun-Seok
    • The KIPS Transactions:PartD
    • /
    • v.18D no.3
    • /
    • pp.179-184
    • /
    • 2011
  • Current mobile devices have surpassed its boundaries as a more communication tool to a smart device which provides additional features. These features have supported the smart life of its users, but have reached its limit from low-performance processors and short-battery time. These issues can be resolved b implementing higher performing hardware, but they come with a burden of high cost. This paper introduces a new way of managing computing resources in a mobile device by enhancing the quality of human-computer interaction. The real-speed felt by users are mainly influenced by the time it takes form a user's input to the device to display the completed result on the screen. Since the size of the screen for mobile devices are small, if the processor only fetch data to be used for displaying on screen, the time can be significantly reduced. MVC+Prefetch Controller pattern accomplished this goal by using the minimum amount of data from DB to fetch display and still manages to support high-speed data transfer to achieve seamless display. This idea has been realized by practice using Samsung mobile phone S8500, which demonstrated the superior performance on user's perspective.

Energy-Efficient Multipath Routing Protocol for Supporting Mobile Events in Wireless Sensor Networks (무선 센서 네트워크에서 이동 이벤트를 지원하기 위한 에너지 효율적인 멀티패스 라우팅 프로토콜)

  • Kim, Hoewon;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.455-462
    • /
    • 2016
  • Wireless sensor networks have been researched to gather data about events on sensor fields from sources at sinks. Multipath routing is one of attractive approaches to reliably send data against the problem of frequent breakages on paths from sources to sinks due to node and link failures. As mobile events such as humans, animals, and vehicles are considered, sources may be continuously generated according to the movement of the mobile event. Thus, mobile events provide new challenging issue in multipath routing. However, the research on multipath routing mainly focus on both efficient multipath construction from sources to static sinks and fast multipath reconstruction against path breakages. Accordingly, the previous multipath routing protocols request each source continuously generated by a mobile event to construct individual multipath from the source to sinks. This induces the increase of multipath construction cost in the previous protocols in proportion to the number of source. Therefore, we propose efficient multipath routing protocol for supporting continuous sources generated by mobile events. In the proposed protocol, new source efficiently reconstructs its multipath by exploiting the existing multipath of previous sources. To do this, the proposed protocol selects one among three reconstruction methods: a local reconstruction, a global partial one, and a global full one. For a selection decision, we provide an analytical energy consumption cost model that calculates the summation of both the multipath reconstruction cost and the data forwarding cost. Simulation results show that the proposed protocol has better performance than the previous protocol to provide multipath routing for mobile events.

Comparative Analysis of NDWI and Soil Moisture Map Using Sentinel-1 SAR and KOMPSAT-3 Images (KOMPSAT-3와 Sentinel-1 SAR 영상을 적용한 토양 수분도와 NDWI 결과 비교 분석)

  • Lee, Jihyun;Kim, Kwangseob;Lee, Kiwon
    • Korean Journal of Remote Sensing
    • /
    • v.38 no.6_4
    • /
    • pp.1935-1943
    • /
    • 2022
  • The development and application of a high-resolution soil moisture mapping method using satellite imagery has been considered one of the major research themes in remote sensing. In this study, soil moisture mapping in the test area of Jeju Island was performed. The soil moisture was calculated with optical images using linearly adjusted Synthetic Aperture Radar (SAR) polarization images and incident angle. SAR Backscatter data, Analysis Ready Data (ARD) provided by Google Earth Engine (GEE), was used. In the soil moisture processing process, the optical image was applied to normalized difference vegetation index (NDVI) by surface reflectance of KOMPSAT-3 satellite images and the land cover map of Environmental Systems Research Institute (ESRI). When the SAR image and the optical images are fused, the reliability of the soil moisture product can be improved. To validate the soil moisture mapping product, a comparative analysis was conducted with normalized difference water index (NDWI) products by the KOMPSAT-3 image and those of the Landsat-8 satellite. As a result, it was shown that the soil moisture map and NDWI of the study area were slightly negative correlated, whereas NDWI using the KOMPSAT-3 images and the Landsat-8 satellite showed a highly correlated trend. Finally, it will be possible to produce precise soil moisture using KOMPSAT optical images and KOMPSAT SAR images without other external remotely sensed images, if the soil moisture calculation algorithm used in this study is further developed for the KOMPSAT-5 image.