• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.753-758
• /
• 2010

In this paper we propose an efficient marker tracking system that exploits IR and web cameras. The proposed method solves the marker swap problem and allows for fast and responsive marker tracking. We use color information gathered from the IR reflector to assign a unique identification to each marker. We can locate each marker withthe IR camera and also identify the marker uniquely by using color information provided by the web camera. The experiment results show that marker swapping can be eliminated effectively. Furthermore, our approach allows for faster and more responsive marker tracking.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.80-90
• /
• 2019

Even though Non-Volatile Memory (NVM) is used for data storage, a page table should be built to access data in it. And this observation leads us to the Persistent Page Table (PPT) scheme that keeps the page table in NVM persistently. By the way, processors have different page table structures and really operational page table cannot be built without virtual and physical addresses of NVM. However, those addresses are determined dynamically when NVM storage is attached to the system. Thus, the PPT should have system-independent and also address-independent structure and really working system-dependent page table should be built from the PPT. Moreover, entries of PPT should be updated atomically and, in this paper, we describe the design of PPT that meets those requirements. And we investigate how file systems can decrease the journaling overhead with the swap operation, which is a new operation created by the PPT. We modified the Ext4 file system in Linux and experiments conducted with Filebench workloads show that the swap operation enhances file system performance up to 60%.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.62 no.6
• /
• pp.11-20
• /
• 2020

We estimated the spatio-temporally distributed soil moisture using Sentinel-1A/B SAR (Synthetic Aperture Radar) sensor images and soil moisture data assimilation technique in South Korea. Soil moisture data assimilation technique can extract the hydraulic parameters of soils using observed soil moisture and GA (Genetic Algorithm). The SWAP (Soil Water Atmosphere Plant) model associated with a soil moisture assimilation technique simulates the soil moisture using the soil hydraulic parameters and meteorological data as input data. The soil moisture based on Sentinel-1A/B was validated and evaluated using the pearson correlation and RMSE (Root Mean Square Error) analysis between estimated soil moisture and TDR soil moisture. The soil moisture data assimilation technique derived the soil hydraulic parameters using Sentinel-1A/B based soil moisture images, ASOS (Automated Synoptic Observing System) weather data and TRMM (Tropical Rainfall Measuring Mission)/GPM (Global Precipitation Measurement) rainfall data. The derived soil hydrological parameters as the input data to SWAP were used to simulate the daily soil moisture values at the spatial domain from 2001 to 2018 using the TRMM/GPM satellite rainfall data. Overall, the simulated soil moisture estimates matched well with the TDR measurements and Sentinel-1A/B based soil moisture under various land surface conditions (bare soil, crop, forest, and urban).

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.841-847
• /
• 2016

As network technology advances, a larger number of devices are connected through the Internet. Recently, cloud storage services are gaining popularity, as they are convenient to access anytime and anywhere. Among cloud storage services, object storage is the representative one due to their characteristics of low cost, high availability, and high durability. One limitation of object storage services is that they can access data on the cloud only through the HTTP-based RESTful APIs. In our work, we resolve this limitation with the in-memory file system which provides a POSIX interface to the file system users and communicates with cloud object storages with RESTful APIs. In particular, our flush mechanism is compatible with existing file systems, as it is based on the swap mechanism of the Linux kernel. Our in-memory file system backed by cloud storage reduces the performance overheads and shows a better performance than S3QL by 57% in write operations. It also shows a comparable performance to tmpfs in read operations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.4
• /
• pp.65-69
• /
• 2019

This paper presents an optimized adoption of NVM for the storage system considering application characteristics. To do so, we first characterize the storage access patterns for different application types, and make two prominent observations that can be exploited in allocating NVM storage efficiently. The first observation is that a bulk of I/O does not happen on a single storage partition, but it is varied significantly for different application categories. Our second observation is that there exists a large proportion of single accessing in storage data. Based on these observations, we show that maximizing the storage performance with NVM is not obtained by fixing it as a specific storage partition but by allocating it adaptively for different applications. Specifically, for graph, database, and web applications, using NVM as a swap, a journal, and a file system partitions, respectively, performs well.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1035-1038
• /
• 2008

가상 메모리의 스왑 저장 장치로서 플래시 메모리를 사용하는 경우, 시스템을 기동할 때 스왑 영역의 초기화를 위한 삭제 연산이 요구되어 기동 시간이 오래 걸리는 문제점이 있다. 본 논문에서는 스왑 영역의 플래시 메모리 내용을 모두 삭제하지 않고 일부만을 삭제함으로서 기동 시간을 줄일 수 있는 방법을 연구하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.476-487
• /
• 2009

The virtual memory system in 4.4 BSD operating systems exploits a clustering scheme to reduce disk I/Os in paging out (or flushing) modified pages that are intended to be replaced in order to make free rooms in memory. Upon the page out of a victim page, the scheme stores a cluster (or group) of modified pages contiguous with the victim in the virtual address space to swap disk at a single disk write. However, it fails to find large clusters of contiguous pages if applications change pages not adjacent with each other in the virtual address space. To address the problem, we propose a new clustering scheme called Multiple-Object Clustering (MOC), which together stores multiple clusters in the virtual address space at a single disk write instead of paging out the clusters to swap space at separate disk I/Os. This multiple-cluster transfer allows the virtual memory system to significantly decrease disk writes, thus improving the page-out performance. Our experiments in the FreeBSD 6.2 show that MOC improves the execution times of realistic benchmarks such as NS2, Scimark2 SOR, and nbench LU over the traditional clustering scheme ranging from 9 to 45%.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.11a
• /
• pp.489-497
• /
• 2000

After IMF situation, the money market environment is changing rapidly. Therefore, many companies including financial institutions and many individual investors are concerned about forecasting the money market, and they make an effort to insure the various profit and hedge methods using derivatives like option, futures and swap. In this research, we developed a prototype of forecasting system for KOSPI 200 option, especially call option, trading using artificial neural networks(ANN), To avoid the overfitting problem and the problem involved int the choice of ANN structure and parameters, we employed the ANN ensemble approach. We conducted two types of simulation. One is conducted with the hold signals taken into account, and the other is conducted without hold signals. Even though our models show low accuracy for the sample set extracted from the data collected in the early stage of IMF situation, they perform better in terms of profit and stability than the model that uses only the theoretical price.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.57-62
• /
• 2022

Recently, fast storage media such as phage-change memory (PCM) emerge, and memory management policies for slow disk storage need to be revisited. In this paper, we propose a new page replacement policy that makes use of PCM as a swap device of virtual memory systems. The proposed policy aims at reducing write traffic to the swap device as well as reducing the number of page faults pursued by traditional page replacement policies. This is because a write operation in PCM is slow and PCM has limited write endurances. Specifically, the proposed policy focuses on the reduction of page faults when the memory load of the system is high, but it aims at reducing write traffic to storage when free memory space is sufficient. Simulation experiments with various memory reference traces show that the proposed policy reduces write traffic to PCM without performance degradations.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.157-162
• /
• 2004

This paper suggests the CAMD(Compression Algorithm for in-Memory Data) algorithm that is not moved the pages into the swap space by assigning the compressed cache area in the main memory. The CAMD algorithm that supports the virtual memory system takes high memory usability and performance benefit by reducing the page fault. The memory data is not general data. It is extraordinary data format. In general it consists of specific form of data. Therefore. the CAMD algorithm can compress this data efficiently.