• Title/Summary/Keyword: Location memory

Search Result 227, Processing Time 0.027 seconds

Distributed Moving Objects Management System for a Smart Black Box

  • Lee, Hyunbyung;Song, Seokil
    • International Journal of Contents
    • /
    • v.14 no.1
    • /
    • pp.28-33
    • /
    • 2018
  • In this paper, we design and implement a distributed, moving objects management system for processing locations and sensor data from smart black boxes. The proposed system is designed and implemented based on Apache Kafka, Apache Spark & Spark Streaming, Hbase, HDFS. Apache Kafka is used to collect the data from smart black boxes and queries from users. Received location data from smart black boxes and queries from users becomes input of Apache Spark Streaming. Apache Spark Streaming preprocesses the input data for indexing. Recent location data and indexes are stored in-memory managed by Apache Spark. Old data and indexes are flushed into HBase later. We perform experiments to show the throughput of the index manager. Finally, we describe the implementation detail in Scala function level.

The Study on the GIS Software Engine based on PDA using GPS/GIS (GPS/GIS를 이용한 PDA기반 GIS 소프트웨어 엔진 연구)

  • PARK, Sung-Seok;KIM, Chang-Soo;SONG, Ha-Joo
    • Journal of Fisheries and Marine Sciences Education
    • /
    • v.17 no.1
    • /
    • pp.76-85
    • /
    • 2005
  • GIS (Geographic Information Systems) technology is a necessary function to support location based on service by using GPS in the mobile environment. These mobile systems have basic functional limitations such as a low rate of processing, limited memory capacity, and small screen size. Because of these limitations, most of the mobile systems require development of a reduced digital map to overcome problems with large-volume spatial data. In this paper, we suggest using the reduced digital map format in order to use location based on service in a PDA environment. The processing of the proposed data format consists of map generation, redefinition of layers, creating polygons, and format conversion. The proposed data format reduces the data size by about 98% comparing with DXF format based on the digital map of Busan.

A Study on the Avidance of Tool Interference in Free form Surface Machining (3차원 자유곡면 가공에 있어서의 공구간섭방지에 관한 연구)

  • 양균의;박윤섭;이희관
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.8
    • /
    • pp.1832-1843
    • /
    • 1995
  • Tool interference is one of the most critical problems in sculptured surface machining. When machining cavities and concaves, the tool frequently overcuts the portions of the surface, which cause inaccuracy in machining. So tool interference-free paths must be generated for rough cutting more efficiently. In this paper a software using SSI(Surface/Surface intersection) algorithm is developed for eliminating tool interference which occurs in an offset surface in 3-dimensional free form surface modeling. this work consists of two stages : using the offset data, the intersection curves are rapidly checked by this algorithm at the first stage. CL(cutter location) data are obtained by deleting the loop section of intersected offset patches at the second stage. This algorithm can reduce the amount of memory required to store machining data and also easily check region which have the possibility of intersection. Also, This software is verified to be useful in machining a curved object on a DNC milling machine.

Noise Reduction Algorithm of Salt-and-Pepper Using Reliability-based Weighted Mean Filter (복원화소의 신뢰도 기반 가중 평균 필터를 활용한 Salt-and-Pepper 잡음 제거 알고리즘)

  • Kim, Donghyung
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.17 no.2
    • /
    • pp.1-11
    • /
    • 2021
  • Salt and pepper is a type of impulse noise. It may appear due to an error in the image transmission process and image storage memory. This noise changes the pixel value at any position in the image to 0 (in case of pepper noise) or 255 (in case of salt noise). In this paper, we present an algorithm for SAP noise reduction. The proposed method consists of three steps. In the first step, the location of the SAP noise is detected, and in the second step, the pixel value of the detected location is restored using a weighted average of the surrounding pixel values. In the last step, a reliability matrix around the reconstructed pixels is constructed, and additional correction is performed with a weighted average using this. As a result of the experiment, the proposed method appears to have similar or higher objective and subjective image quality than previous methods for almost all SAP noise ratios.

Design and Implementation of a Main Memory Index based on the R-tree for Moving Object Databases (이동체 데이터베이스를 위한 R-tree 기반 메인 메모리 색인의 설계 및 구현)

  • Ahn, Sung-Woo;An, Kyoung-Hwan;Lee, Chaug-Woo;Hong, Bong-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.2 s.17
    • /
    • pp.53-73
    • /
    • 2006
  • Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

  • PDF

A Study on the Performance Measurement and Analysis on the Virtual Memory based FTL Policy through the Changing Map Data Resource (멥 데이터 자원 변화를 통한 가상 메모리 기반 FTL 정책의 성능 측정 및 분석 연구)

  • Hyun-Seob Lee
    • Journal of Internet of Things and Convergence
    • /
    • v.9 no.1
    • /
    • pp.71-76
    • /
    • 2023
  • Recently, in order to store and manage big data, research and development of a high-performance storage system capable of stably accessing large data have been actively conducted. In particular, storage systems in data centers and enterprise environments use large amounts of SSD (solid state disk) to manage large amounts of data. In general, SSD uses FTL(flash transfer layer) to hide the characteristics of NAND flash memory, which is a medium, and to efficiently manage data. However, FTL's algorithm has a limitation in using DRAM more to manage the location information of NAND where data is stored as the capacity of SSD increases. Therefore, this paper introduces FTL policies that apply virtual memory to reduce DRAM resources used in FTL. The virtual memory-based FTL policy proposed in this paper manages the map data by using LRU (least recently used) policy to load the mapping information of the recently used data into the DRAM space and store the previously used information in NAND. Finally, through experiments, performance and resource usage consumed during data write processing of virtual memory-based FTL and general FTL are measured and analyzed.

SAF: A Scheme of Swap Space Allocation in File Systems to Reduce Disk Seek Time (SAF: 디스크 탐색 시간 향상을 위한 파일 시스템 내 스왑 공간 할당 기법)

  • Ahn, Woo-Hyun;Kim, Bo-Gon;Kim, Byung-Gyu;Oh, Jae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1289-1300
    • /
    • 2011
  • In recent computer systems with high-performance, users execute programs needing large memory and programs intensively accessing files simultaneously. Such a large memory requirement makes virtual memory systems access swap spaces in disk, and intensive file accesses require file systems to access file system partitions in disk. Executing the two kinds of programs at once incurs large disk seeks between swap spaces and file system partitions frequently. To solve the problem, this paper proposes a new scheme called SAF to create several swap spaces in a file system partition, where pages to be paged out are stored. When a page is paged out, the scheme stores the page to one of the swap spaces close to a disk location where the most recently accessed file is located. The chosen swap space in the file system partition is closer to the disk location than the traditional swap space, so that our scheme can reduce the large disk seek time spent to move to the traditional swap space in paging out a page. The experiment of our scheme implemented in FreeBSD 6.2 shows that SAF reduces the execution time of several benchmarks over FreeBSD ranging from 14% to 42%.

Location-Awareness Management in IP-based IMT Network Platform ($IP^2$)

  • NamGung, Jung-Il;Shin, Soo-Young;Jung, Byeong-Hwa;Park, Hyun-Moon;Yun, Nam-Yeol;Park, Soo-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.901-910
    • /
    • 2010
  • $IP^2$, as an extended concept of the next generation IMT network, is a concept of basically supporting mobility using two steps of IP address (i.e. IPha (IP Host address) and IPra (IP routing address)) in IP backbone network. Current $IP^2$system has a shortcoming of excess usage of network resources caused by sending paging messages to all cells in LA (Location Area) in paging procedure. Considering the evolving direction of network, which is taking mobility with various speed and integration of devices into consideration, this shortcoming must be overcome. In this paper, we proposed a method to reduce time and memory for paging by maintaining current information of MN (Mobile Node) not in Active state with proxy server. Performance evaluation based on NS-2 simulations has shown that the efficiency of network resources is improved in the proposed method.

A Swapping Red-black Tree for Wear-leveling of Non-volatile Memory (비휘발성 메모리의 마모도 평준화를 위한 레드블랙 트리)

  • Jeong, Minseong;Lee, Eunji
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.6
    • /
    • pp.139-144
    • /
    • 2019
  • For recent decades, Non-volatile Memory (NVM) technologies have been drawing a high attention both in industry and academia due to its high density and short latency comparable to that of DRAM. However, NVM devices has write endurance problem and thus the current data structures that have been built around DRAM-specific features including unlimited program cycles is inadequate for NVM, reducing the device lifetime significantly. In this paper, we revisit a red-black tree extensively adopted for data indexing across a wide range of applications, and make it to better fit for NVM. Specifically, we observe that the conventional red-black tree wears out the specific location of memory because of its rebalancing operation to ensure fast access time over a whole dataset. However, this rebalancing operation frequently updates the long-lived nodes, which leads to the skewed wear out across the NVM cells. To resolve this problem, we present a new swapping wear-leveling red-black tree that periodically moves data in the worn-out node into the young node. The performance study with real-world traces demonstrates the proposed red-black tree reduces the standard deviation of the write count across nodes by up to 12.5%.

A Study on the Preference of Design Components of Shop Facade (숍 파사드 디자인 구성요소에 대한 선호도 연구)

  • Yeo, Mi;Oh, Sun Ae
    • Korean Institute of Interior Design Journal
    • /
    • v.24 no.2
    • /
    • pp.171-179
    • /
    • 2015
  • The aim of this study is to figure out the preference features on design components of shop facade on the basis of the questionnaire survey on short-term memory and sensory memory of human right after an image experiment. As for a preceding research, this study examined the design features of facade into tangible elements and intangible elements, and also classified them into physical, aesthetical, marketing and symbolic components in detail. And, it extracted 5 representative elements in preceding studies including shape, material, pattern, color and sign, which is the standard of a questionnaire survey and preference analysis. The subjects of the experiment were 30 men and women who were over 20 years old majoring interior design. They were exposed to 20 images with 10 seconds respectively through a video, and were asked to respond the questionnaire promptly. The findings of preference analysis of design components of facade including shape, material, pattern, color and sign are as follows. Firstly, shape was the most interesting and attracting component, and designs applied with shape of objects such as 'web', 'drawer', 'wheel' and 'button' obtained high preference. Secondly, as for material, block, steel, exposed concrete board attracted higher preference as memorable materials than other materials. Material was affected by shape, pattern and color. Thirdly, pattern was the most lasting element. Designed pattern had higher preference than simple pattern. Fourthly, as for color, red and green with strong stimulation and attention attained priority having long lasting memory. Fifthly, when visiting a shop, sign out of 5 elements of shape, material, pattern, color and sign drew attention the most. As for the preference of location of sign, 'center top' was the most noticeable. The findings of this study could be utilized for facade design, and also could be used for commercialization considering highly preferred components, and top preference aspects of such elements. advised that to give an impression to customers is important to make a successful design for sales marketing, which, in turn, would lead customers to revisit the shop.