• Title/Summary/Keyword: MapReduce

Search Result 852, Processing Time 0.027 seconds

Design of a MapReduce-Based Mobility Pattern Mining System for Next Place Prediction (다음 장소 예측을 위한 맵리듀스 기반의 이동 패턴 마이닝 시스템 설계)

  • Kim, Jongwhan;Lee, Seokjun;Kim, Incheol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.8
    • /
    • pp.321-328
    • /
    • 2014
  • In this paper, we present a MapReduce-based mobility pattern mining system which can predict efficiently the next place of mobile users. It learns the mobility pattern model of each user, represented by Hidden Markov Models(HMM), from a large-scale trajectory dataset, and then predicts the next place for the user to visit by applying the learned models to the current trajectory. Our system consists of two parts: the back-end part, in which the mobility pattern models are learned for individual users, and the front-end part, where the next place for a certain user to visit is predicted based on the mobility pattern models. While the back-end part comprises of three distinct MapReduce modules for POI extraction, trajectory transformation, and mobility pattern model learning, the front-end part has two different modules for candidate route generation and next place prediction. Map and reduce functions of each module in our system were designed to utilize the underlying Hadoop infrastructure enough to maximize the parallel processing. We performed experiments to evaluate the performance of the proposed system by using a large-scale open benchmark dataset, GeoLife, and then could make sure of high performance of our system as results of the experiments.

A New Predictive EC Algorithm for Reduction of Memory Size and Bandwidth Requirements in Wavelet Transform (웨이블릿 변환의 메모리 크기와 대역폭 감소를 위한 Prediction 기반의 Embedded Compression 알고리즘)

  • Choi, Woo-Soo;Son, Chang-Hoon;Kim, Ji-Won;Na, Seong-Yu;Kim, Young-Min
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.7
    • /
    • pp.917-923
    • /
    • 2011
  • In this paper, a new prediction based embedded compression (EC) codec algorithm for the JPEG2000 encoder system is proposed to reduce excessive memory requirements. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform (DWT) stages compared with direct implementation of the DWT engine of this paper. The LOCO-I predictor and MAP are widely used in many lossless picture compression codec. The proposed EC algorithm use these predictor which are very simple but surprisingly effective. The predictive EC scheme adopts a forward adaptive quantization and fixed length coding to encoding the prediction error. Simulation results show that our LOCO-I and MAP based EC codecs present only PSNR degradation of 0.48 and 0.26 dB in average, respectively. The proposed algorithm improves the average PSNR by 1.39 dB compared to the previous work in [9].

Robust Inter-MAP Binding Update Scheme in HMIPv6 (HMIPv6 네트워크에서 Robust 한 Inter-MAP 바인딩 업데이트 기법)

  • Jinwook Park;Jongpil Jeong;Hyunseung Choo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1387-1390
    • /
    • 2008
  • In a wireless network, handover latency is very important in supporting user mobility with the required quality of service (QoS). In view of this many schemes have been developed which aim to reduce the handover latency. The Hierarchical Mobile IPv6 (HMIPv6) approach is one such scheme which reduces the high handover latency that arises when mobile nodes perform frequent handover in Mobile IPv6 wireless networks. Although HMIPv6 reduces handoff latency, failures in the mobility anchor point (MAP) results in severe disruption or total disconnection that can seriously affect user satisfaction in ongoing sessions between the mobile and its correspondent nodes. HMIPv6 can avoid this situation by using more than one mobility anchor point for each link. In [3], an improved Robust Hierarchical Mobile IPv6 (RH-MIPv6) scheme is presented which enhances the HMIPv6 method by providing a fault-tolerant mobile service using two different MAPs (Primary and Secondary). It has been shown that the RH-MIPv6 scheme can achieve approximately 60% faster recovery times compared with the standard HMIPv6 approach. However, if mobile nodes perform frequent handover in RH-MIPv6, these changes incur a high communication overhead which is configured by two local binding update units (LBUs) as to two MAPs. To reduce this communication overhead, a new cost-reduced binding update scheme is proposed here, which reduces the communication overhead compared to previous schemes, by using an increased number of MAP switches. Using this new proposed method, it is shown that there is a 19.6% performance improvement in terms of the total handover latency.

A MapReduce-based kNN Join Query Processing Algorithm for Analyzing Large-scale Data (대용량 데이터 분석을 위한 맵리듀스 기반 kNN join 질의처리 알고리즘)

  • Lee, HyunJo;Kim, TaeHoon;Chang, JaeWoo
    • Journal of KIISE
    • /
    • v.42 no.4
    • /
    • pp.504-511
    • /
    • 2015
  • Recently, the amount of data is rapidly increasing with the popularity of the SNS and the development of mobile technology. So, it has been actively studied for the effective data analysis schemes of the large amounts of data. One of the typical schemes is a Voronoi diagram based on kNN join algorithm (VkNN-join) using MapReduce. For two datasets R and S, VkNN-join can reduce the time of the join query processing involving big data because it selects the corresponding subset Sj for each Ri and processes the query with them. However, VkNN-join requires a high computational cost for constructing the Voronoi diagram. Moreover, the computational overhead of the VkNN-join is high because the number of the candidate cells increases as the value of the k increases. In order to solve these problems, we propose a MapReduce-based kNN-join query processing algorithm for analyzing the large amounts of data. Using the seed-based dynamic partitioning, our algorithm can reduce the overhead for constructing the index structure. Also, it can reduce the computational overhead to find the candidate partitions by selecting corresponding partitions with the average distance between two seeds. We show that our algorithm has better performance than the existing scheme in terms of the query processing time.

A Study on the Problems and Improvement Plan of Cadastral Map Data Maintenance Project (지적·임야도 자료정비 사업의 문제점 및 개선방안 연구)

  • Baek, Kyu-Yeong;Choi, Yun-Soo
    • Journal of Cadastre & Land InformatiX
    • /
    • v.50 no.1
    • /
    • pp.63-73
    • /
    • 2020
  • The Ministry of Land, Infrastructure and Transport carried out a pilot project for data maintenance in 2011 to ensure the accuracy of cadastral records nationwide, and now trying to reduce the errors such as omission of the cadastral book, inconsistency of land category between cadastral account book and cadastral map, etc. and the boundary between the map boundary, scale, and administrative areas. In this study, we looked at the currents status and problems of the cadastral research, improving the cadastral map, which has been promoted by the government and the cadastral office. In order to revitalize the cadastral map data maintenance project, it is necessary to re-establish the plan for each step for challenging the limitation of current data maintenance, and the master plan for promotion system, and develop manuals to maintain consistency and secure accuracy of cadastral map maintenance, such as "Coverage and Maintenance Guidelines for Cadastral Maps", and secure the national budget for error correction in cadastral map led by government.

Modified Arachnoid Plasty Reduces Chronic Subdural Hematoma after Unruptured Aneurysm Clipping : Technical Note

  • Lee, Won Jae;Nam, Taek Min;Jo, Kyung-Il;Yeon, Je Young;Hong, Seung-Chyul;Kim, Jong-Soo
    • Journal of Korean Neurosurgical Society
    • /
    • v.61 no.6
    • /
    • pp.761-766
    • /
    • 2018
  • Objective : Chronic subdural hematoma (CSDH) is a rare complication of unruptured intracranial aneurysm (UIA) clipping surgery. To prevent postoperative CSDH by reducing subdural fluid collection, we applied the modified arachnoid plasty (MAP) during the UIA clipping surgery to seal the dissected arachnoid plane. Methods : This retrospective study included 286 patients enrolled from July 2012 to May 2015. We performed arachnoid plasty in all patients, with MAP used after June 17, 2014. Patients were divided into two groups (non-MAP vs. MAP), and by using uni- and multivariate analyses, baseline characteristics, and relationships with postoperative CSDH between the two groups were analyzed. The degree of preoperative brain atrophy was estimated using the bicaudate ratio (BCR) index. Results : Ten patients (3.5%) among 286 patients had postoperative CSDH after clipping. Nine (3.1%) were in the non-MAP group, and one (0.9%) was in the MAP group. The higher BCR index showed statistical significance with occurrence of postoperative CSDH in both uni- (p=0.018) and multivariate (p=0.012; odds ratio [OR], 8.547; 95% confidence interval [CI], 1.616-45.455) analyses. MAP was associated with a lower risk of postoperative CSDH (p=0.022; OR, 0.068; 95% CI, 0.007-0.683). Conclusion : This study shows that the degree of preoperative brain atrophy is associated with an increased occurrence of CSDH after clipping and that MAP could help reduce the risk of postoperative CSDH after unruptured aneurysm clipping via a lateral supraorbital approach.

Spatial Data Update Method for Efficient Operation of the Integrated Underground Geospatial Map Management System (지하공간통합지도 관리 시스템의 효율적인 운영을 위한 공간 데이터 갱신 방법)

  • Lee, Bong-Jun;Kouh, Hoon-Joon
    • Journal of Industrial Convergence
    • /
    • v.20 no.7
    • /
    • pp.57-64
    • /
    • 2022
  • There are various structures in the underground space, and the structures is managed as 3D data in Integrated Underground Geospatial Map Management System(IUGMMS). The worker transmits and updates the integrated map including the changed underground geospatial data to IUGMMS with the completed book submission program. However, there is a problem in that the transmission time and the update time is delayed because the size of the integrated map file is large. In this paper, we try to extract and transmit only the changed integrated map by obtaining and comparing each spatial characteristic information of the integrated map. As a result of the experiment, the transmission time of the suggestion method is short and the update time is also short than the transitional method because the suggestion method transmits only the integrated map including the changed underground geospatial data. As a result, it was possible to reduce the delay time in transmitting and updating the changed integrated map.

A Study on the Estimation Method of Carbon Storage Using Environmental Spatial Information and InVEST Carbon Model: Focusing on Sejong Special Self-Governing City - Using Ecological and Natural Map, Environmental Conservation Value Assessment Map, and Urban Ecological Map - (환경공간정보와 InVEST Carbon 모형을 활용한 탄소저장량 추정 방법에 관한 연구: 세종시를 중심으로 - 생태·자연도, 국토환경성평가지도, 도시생태현황지도를 대상으로 -)

  • Hwang, Jin-Hoo;Jang, Rae-ik;Jeon, Seong-Woo
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.25 no.5
    • /
    • pp.15-27
    • /
    • 2022
  • Climate change is considered a severe global problem closely related to carbon storage. However, recent urbanization and land-use changes reduce carbon stocks in terrestrial ecosystems. Recently, the role of protected areas has been emphasized as a countermeasure to the climate change, and protected areas allow the area to continue to serve as a carbon sink due to legal restrictions. This study attempted to expand the scope of these protected areas to an evaluation-based environmental spatial information theme map. In this study, the area of each grade was compared, and the distribution of land cover for each grade was analyzed using the Ecological and Nature Map, Environmental Conservation Value Assessment Map and Urban Ecological Map of Sejong Special Self-Governing City. Based on this, the average carbon storage for each grade was derived using the InVEST Carbon model. As a result of the analysis, the high-grade area of the environmental spatial information generally showed a wide area of the natural area represented by the forest area, and accordingly, the carbon storage amount was evaluated to be high. However, there are differences in the purpose of production, evaluation items, and evaluation methods between each environmental spatial information, there are differences in area, land cover, and carbon storage. Through this study, environmental spatial information based on the evaluation map can be used for land use management in the carbon aspect, and it is expected that a management plan for each grade suitable for the characteristics of each environmental spatial information is required.

Study of Pallet Scale Modified Atmosphere Packaging Films for Reducing Water Condensation

  • Kim, Jinse;Park, Jong Woo;Park, Seokho;Choi, Dong Soo;Choi, Seung Ryul;Kim, Yong Hoon;Lee, Soo Jang;Park, Chun Wan;Lee, Jung- Soo;Cho, Byoung-Kwan
    • Journal of Biosystems Engineering
    • /
    • v.41 no.2
    • /
    • pp.98-107
    • /
    • 2016
  • Purpose: The aim of this study was to find an appropriate polymer film, which could reduce the water condensation for pallet-size modified atmosphere packaging (MAP). Methods: Five different types of films were selected from several commercialized films. Prior to the real food storage test, plastic boxes with wetted plastic balls were used to simulate the high humidity conditions of real food storage. The initial MAP condition was 5% oxygen and 95% nitrogen, and the $O_2$ concentration, the relative humidity and water condensation inside the films were checked on a daily basis. The MAP test for tomatoes was conducted by using the most appropriate film from the five films examined in this study. Results: Every film except Mosspack(R) indicated a similar variation in the $O_2$ concentration over the course of time. The relative humidity near the surfaces of all the films except nylon-6 approached saturation conditions over time. For three kinds of films, namely, low-density polyethylene (LDPE) film, anti-fogging oriented polypropylene (AFOPP) film, and Mosspack(R), the inner surfaces of the films were fully covered with dew after a storage period of a day. Conversely, an area of 4.5% was covered with dew in the case of the poly lactic acid (PLA) film, and there was no dew inside the nylon-6 film. The pallet-size MAP test for tomatoes was conducted by using the nylon-6 film and there was no water condensation inside the nylon-6 film over three weeks of storage. Conclusions: During the pallet scale MAP, water condensation could cause severe fungal infection and wetting of the corrugated box. Hence, it was important to minimize water condensation. This study showed that the MAP films with high WVTR such as nylon-6 and PLA could reduce the water condensation inside the pallet scale MAP.

Improvement of Disparity Map using Loopy Belief Propagation based on Color and Edge (Disparity 보정을 위한 컬러와 윤곽선 기반 루피 신뢰도 전파 기법)

  • Kim, Eun Kyeong;Cho, Hyunhak;Lee, Hansoo;Wibowo, Suryo Adhi;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.5
    • /
    • pp.502-508
    • /
    • 2015
  • Stereo images have an advantage of calculating depth(distance) values which can not analyze from 2-D images. However, depth information obtained by stereo images has due to following reasons: it can be obtained by computation process; mismatching occurs when stereo matching is processing in occlusion which has an effect on accuracy of calculating depth information. Also, if global method is used for stereo matching, it needs a lot of computation. Therefore, this paper proposes the method obtaining disparity map which can reduce computation time and has higher accuracy than established method. Edge extraction which is image segmentation based on feature is used for improving accuracy and reducing computation time. Color K-Means method which is image segmentation based on color estimates correlation of objects in an image. And it extracts region of interest for applying Loopy Belief Propagation(LBP). For this, disparity map can be compensated by considering correlation of objects in the image. And it can reduce computation time because of calculating region of interest not all pixels. As a result, disparity map has more accurate and the proposed method reduces computation time.