• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.177-185
• /
• 2012

In this paper, we developed the composition system that it can efficiently edit camera recording data, images, office document such as powerpoint data, MS word data etc in real-time and broadcasting system that the file is made by the composition system. In this Study, we developed two kinds of algorithm; Approximate Composition for Optimization (ACFO) and Sequence Composition using Memory Que (SCUMQ). Especially, the system is inexpensive and useful because the system is based on mobile devices and PCs when lectures hope to make video institutional contents. Therefore, it can be contributed for e-learning and m-learning. In addition, the system can be applied to various fields, different kinds of multimedia creation, remote conferencing, and e-commerce.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.91-95
• /
• 2008

Flash memory is widely used in embedded systems because of its benefits such as non-volatile, shock resistant, and low power consumption. But NAND flash memory suffers from out-place-update, limited erase cycles, and page based read/write operations. To solve these problems, log-structured filesystem was proposed such as YAFFS. However, YAFFS sequentially retrieves an array of all block information to allocate free block for a write operation. Also before the write operation, YAFPS read the array of block information to find invalid block for erase. These could reduce the performance of the filesystem. This paper suggests fast operation method for NAND flash filesystem that solves the above-mentioned problems. We implemented the proposed methods in YAFFS. And we measured the performance compared with the original technique.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.51-56
• /
• 2009

Flash memory has rapidly deployed as data storage. However, the flash memory has a major disadvantage that recorded data cannot be dynamically overwritten. In order to solve this "erase-before-write" problem, the log block buffer scheme used Flash memory file system. however, the current managements of the log buffer, in case random write pattern, BAST technique have problem of frequent merge operation, but FAST technique don't consider merge operation by frequently updated data. Previous methods not consider merge operation cost and frequently updated data. In this paper, we propose a new log buffer management scheme, called JBB. Our proposed method evaluates the worth of the merge of log blocks, so we conducts the merge operation between infrequently updated data and its data blocks, and postpone the merge operation between frequently updated data and its data blocks. Through the method, we prevent the unnecessary merge operations, reduce the number of the erase operation, and improve the utilization of the flash memory storage. We show the superiority of our proposed method through the performance evaluation with BAST and FAST.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.852-859
• /
• 2015

As the amount of knowledge information significantly increases, a lot of progress has been made in the studies focusing on how to reason large scale ontology effectively at the level of RDFS or OWL. These reasoning methods are divided into TBox classifications and ABox realizations. A TBox classification mainly deals with integrity and dependencies in schema, whereas an ABox realization mainly handles a variety of issues in instances. Therefore, the ABox realization is very important in practical applications. In this paper, we propose a realization method for analyzing the constraint of the specified class, so that the reasoning system automatically infers the classes to which instances belong. Unlike conventional methods that take advantage of the object oriented language based distributed file system, we propose a large scale ontology reasoning method using spark, which is a functional programming-based in-memory system. To verify the effectiveness of the proposed method, we used instances created from the Wine ontology by W3C(120 to 600 million triples). The proposed system processed the largest 600 million triples and generated 951 million triples in 51 minutes (696 K triple / sec) in our largest experiment.

• Journal of Magnetics
• /
• v.21 no.4
• /
• pp.491-495
• /
• 2016

We developed an embedded Object-Oriented Micromagnetic Frame (OOMMF) script schemes for more flexible simulations for complex and dynamic mircomagnetic behaviors. The OOMMF can be called from any kind of softwares by system calls, and we can interact with OOMMF by updating the input files for next step from the output files of the previous step of OOMMF. In our scheme, we set initial inputs for OOMMF simulation first, and run OOMMF for ${\Delta}t$ by system calls from any kind of control programs. After executing the OOMMF during ${\Delta}t$, we can obtain magnetization configuration file, and we adjust input parameters, and call OOMMF again for another ${\Delta}t$ running. We showed one example by using scripting embedded OOMMF scheme, tunneling magneto-resistance dependent switching time. We showed the simulation of tunneling magneto-resistance dependent switching process with non-uniform current density using the proposed framework as an example.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.10
• /
• pp.1508-1515
• /
• 2017

This paper proposes the defect detection method for automatic inspection machines in printed circuit boards (PCBs) manufacturing system. The defects of PCB such as open, short, pin hole and scratch can be detected by comparing the standard image and the target image. The standard image is obtained from CAD file such as ODB++ format, and the target image is obtained by arranging, filtering and binarization of captured PCB image. Since the PCB size is too large and image resolution is too high, the image processing requires a lot of memory and computational time. The wavelet transform is applied to compress the standard and target images, which results in reducing the memory and computational time. To increase the inspection accuracy, we utilize the he HH-domain as well as LL-domain of the transformed images. Experimental results are finally presented to show the performance improvement of the proposed method.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.12
• /
• pp.429-436
• /
• 2022

Temporary files are generated when the Hash Join is performed on tables larger than the memory. During the join process, each temporary file is deleted sequentially after it completes the I/O operations. This paper reveals for that the fallocate system call and file deletion-related trim options significantly impact the hash join performance when temporary files are managed on SSDs rather than hard disks. The experiment was conducted on various commercial and research SSDs using PostgreSQL, a representative open-source database. We find that it is possible to improve the join performance up to 3 to 5 times compared to the default combination depending on whether fallocate and trim options are used for temporary files. In addition, we investigate the write amplification and trim command overhead in the SSD according to the combination of the two options for temporary files.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.293-296
• /
• 1998

When the information of announcement facility is modified or added, they are recorded on a tape and then are updated manually using the cassette tape recorder at each office. But the degrade of the tone quality owing to repeated use of the tape and some recording mistakes by processing manually deteriorate the quality of service. And new services such as IN(Intelligent Network) and added functions make the announcement changed very often. Therefore the improved skill of the announcement handling is needed. This paper introduces the implementation of the TDX-10A on-line recording function of transferring voice in PCM data file and storing it in the memory of the recorded announcement facility, when message is recorded onthe fixed type of announcement facility.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2784-2790
• /
• 2015

The column-oriented database storage is a very advanced model for large-volume data transactions because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly data warehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. In this research, we propose a new transaction recovery scheme for a column-oriented database environment which is based on a flash media file system. We improved traditional shadow paging schemes by reusing old data pages which are supposed to be invalidated in the course of writing a new data page in the flash file system environment. In order to reuse these data pages, we exploit reused shadow list structure in our column-oriented shadow recovery(CoSR) scheme. CoSR scheme minimizes the additional storage overhead for keeping shadow pages and minimizes the I/O performance degradation caused by column data compression of traditional recovery schemes. Based on the results of the performance evaluation, we conclude that CoSR outperforms the traditional schemes by 17%.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.325-337
• /
• 1997

This paper introduces the basic concepts and requirements of database system based on the object-oriented paradigm,and presents the overview of the design of an object-oriented data base system which refects those conceprs and requirements . The system imolemented on C++,consists of three structure layers.The inner layer, which is in fact a storage system,performs file I/O,while the inermediate layer is responisible for most of the functions except the ones rerated to the user interface, such as the transaction management,the schema manage-ment,and the management of buffers in main memory etc.The outer layer,designed mainly for the uwerunteface,mot only privides the functions for graphical user interface,preprocessor,and interpreter etc,but also supports extended SQL for object-oriented features.