• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.93-102
• /
• 2020

In order for data obtained through all stages of digital crime investigation to be recognized as evidence capability, it must satisfy legal / technical requirements. In this paper, we propose a mechanism and implement software to provide digital forensic evidence by automatically recovering files by scanning / inspecting the unallocated area inside the storage disk block without relying on information provided by the file system. The proposed technique checks / analyzes the RAW disk data of the system under analysis in 512-byte block units based on information on the storage format / file structure of various files stored on the disk without referring to the file system-related information provided by the operating system. The file carving process was implemented, and a smart carving mechanism was proposed to intelligently restore deleted or damaged files in the storage device. As a result, we have provided a block based smart carving method to intelligently identify fragmented and damaged files in storage efficiently for forgery analysis on digital forensic investigation.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.627-635
• /
• 2016

When many processes issue write operations alternately on Log-structured File System (LFS), the created files can be fragmented on the file system layer although LFS sequentially allocates new blocks of each process. Unfortunately, this file fragmentation degrades read performance because it increases the number of block I/Os. Additionally, read-ahead operations which increase the number of data to request at a time exacerbates the performance degradation. In this paper, we suggest a new cleaning method on LFS that minimizes file fragmentation. During a cleaning process of LFS, our method sorts valid data blocks by inode numbers before copying the valid blocks to a new segment. This sorting re-locates fragmented blocks contiguously. Our cleaning method experimentally eliminates 60% of file fragmentation as compared to file fragmentation before cleaning. Consequently, our cleaning method improves sequential read throughput by 21% when read-ahead is applied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.555-567
• /
• 2010

Unlike single-hop systems, multi-hop systems that use relay nodes assign a part of the overall resources to relay communications. If efficient resource allocation schemes are not adopted, this leads to a loss of resources. Moreover, because we may not be able to guarantee high-link performance due to the adjacent-cell interference in relay-based cellular systems, resource efficiency can be severely decreased. In this paper, we propose efficient resource allocation schemes for downlink relay-based networks in 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution)-Advanced systems. Unlike conventional schemes that have static resource regions for each data link, the proposed schemes dynamically allocate the resources of each link to resource blocks, by considering the channel state and the capacity of each link. We also propose resource overlapping schemes in which two different links overlap at the same resource region, so as to improve cell or user throughput performance. The proposed resource overlapping schemes do not require additional processes such as interference cancellation in users, thank to considering additional interference from resource overlapping in advance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.3 s.309
• /
• pp.50-58
• /
• 2006

This paper describes the implementation of an efficient Rate-Distortion Optimization algerian to speed up rate control in JPEG2000. While the conventional algorithm determines the rate constant by averaging maximum R-D slope and minimum R-D slope for entire image, the proposed algorithm determines it by using R-D slopes of coding passes located near truncation point. Moreover, the rate allocation in proposed algorithm is conducted about only coding passes excluded from the previous rate allocation. As a result, it can reduce the number of operations required for rate-distortion optimization. The proposed algorithm was implemented in C programing language and was executed on the Altera Excalibur(EPXA4) development board.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.782-793
• /
• 2000

This paper presents a simple dynamical prediction scheme of the signal level which is attenuated and varied due to rain fading in satellite communication links using above 10GHz frequency bands. The proposed prediction scheme has four functional blocks for discrete-time low-pass filtering, slope-based prediction, mean-error correction and hybrid fixed/variable prediction margin allocation. Through simulations using Ka-band attenuation data obtained from the data measured over Ku-band by frequency-scaling, it is shown that the slope-based prediction with the mean-error correction has as small standard deviation of prediction error as below 1 dB, and that the error is about 1.5 to 2.5 times as small as that without the mean-error correction. The hybrid prediction margin allocation requires smaller average margin than those of both fixed and variable methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.319-321
• /
• 2006

본 논문에서는 다양한 캐리 전달 방식(carry propagation scheme)이 단일 가산기 설계를 위하여 복합적으로 사용되는 가산기 구조물 제안하며. 이를 통하여 보다 향상된 delay-area trade-off 점들을 갖는 설계공간을 생성한다. 제안된 구조의 가산기는 각기 다른 캐리전달 방식의 하부 가산기 블록들을 캐리 입/출력 신호를 선형으로 연결한 구조이며, 기존의 단일 캐리전달 방식의 가산기와 달리, 다양한 delay-area trade-off 특성을 갖는 여러 종류의 캐리전달 방식을 비트 수준에서 조합하여 사용함으로써 보다 섬세한 delay-area 설계공간을 생성해낼 수 있다. 그러나, 제안된 가산기 구조의 설계공간은 다양한 캐리전달 방식이 비트 수준에서 할당되므로, 할당가능한 설계 조합은 설계하고자 하는 가산기의 비트 폭과 고려하는 캐리전달 방식의 수에 비례하여 폭발적으로 증가하게 된다. 따라서, 제안된 가산기의 효율적이며, 자동화된 설계공간 탐색 방범이 요구된다. 본 논문에서는 이를 해결하기 위하여 정수 선형 프로그래밍 (Integer Linear Programming, ILP) 방법을 이용하여 제안한 가산기의 최적화 문제를 형식화함으로써 효과적인 설계공간의 탐색 방법을 제안하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.4
• /
• pp.383-393
• /
• 2000

In shared memory multiprocessor systems, false sharing occurs when several independent data objects, not shared but accessed by different processors, are allocated to the same coherency unit of memory. False sharing is one of the major factors that may degrade the performance of memory coherency protocols. This paper presents a new shared memory allocation scheme to reduce false sharing of parallel applications where master processor controls allocation of all the shared objects. Our scheme allocates the objects to temporary address space for the moment, and actually places each object in the address space of processor that first accesses the object later. Its goal is to allocate independent objects that may have different access patterns to different pages. We use execution-driven simulation of real parallel applications to evaluate the effectiveness of our scheme. Experimental results show that by using our scheme a considerable amount of false sharing faults can be reduced with low overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1193-1200
• /
• 2005

In this paper, we proposed an image hiding method which decreases the amount of calculation encrypting partial data rather than the whole image data using a discrete wavelet transform and a linear scalar quantization which have been adopted as the main technique in JPEG2000 standard and then implemented the proposed algorithm to hardware. A chaotic system was used instead of encryption algorithms to reduce further amount of calculation. It uses a method of random changing method using the chaotic system of the data in a selected subband. For ciphering the quantization index it uses a novel image encryption algorithm of cyclical shifting to the right or left direction and encrypts two quantization assignment method (Top-down coding and Reflection coding), made change of data less. The experiments have been performed with the proposed methods implemented in software for about 500 images. The hardware encryption system was synthesized to find the gate-level circuit with the Samsung $0.35{\mu}m$ Phantom-cell library and timing simulation was performed, which resulted in the stable operation in the frequency above 100MHz.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.108-121
• /
• 2004

In this paper, we propose an enhanced snapshot technique that solves performance degradation when snapshot is initiated for the storage cluster system. However, traditional snapshot technique has some limits adapted to large amount storage shared by multi-hosts in the following aspects. As volume size grows, (1) it deteriorates crucially the performance of write operations due to additional disk access to verify COW is performed. (2) Also it increases excessively the blocking time of write operation performed during the snapshot creation time. (3)Finally, it deteriorates the performance of write operations due to additional disk I/O for mapping block caused by the verification of COW. In this paper, we propose an efficient snapshot technique for large amount storage shared by multi-hosts in SAN Environments. We eliminate the blocking time of write operation caused by freezing while a snapshot creation is performing. Also to improve the performance of write operation when snapshot is taken, we introduce First Allocation Bit(FAB) and Snapshot Status Bit(SSB). It improves performance of write operation by reducing an additional disk access to volume disk for getting snapshot mapping block. We design and implement an efficient snapshot technique, while the snapshot deletion time, improve performance by deallocation of COW data block using SSB of original mapping entry without snapshot mapping entry obtained mapping block read from the shared disk.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.113-122
• /
• 2006

In this paper, we propose a fuzzy method to control bit-rate in the DCT Domain. The method consists of a bit-rate allocation with fuzzy measures and a least-distortion bit-rate reduction. Fuzzy measures are calculated by the code length, the discontinuity ambiguity, and the neighborhood momentum in each DCT block. These measures are summed with weights and form a reduction fuzziness to indicate the degree of preferable reduction. Using the reduction fuzziness. each DCT block is filtered by the least-distortion reduction method to adjust the bit-rate for the target bandwidth. In the experiment, we show the results that the transcoded video quality by the method is better and the bandwidth is more regular than those of existing methods in both visually and quantitatively.