• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2748-2766
• /
• 2016

Compared with traditional patch-based sparse representation, recent studies have concluded that group-based sparse representation (GSR) can simultaneously enforce the intrinsic local sparsity and nonlocal self-similarity of images within a unified framework. This article investigates an accelerated split Bregman method (SBM) that is based on GSR which exploits image compressive sensing (CS). The computational efficiency of accelerated SBM for the measurement matrix of a partial Fourier matrix can be further improved by the introduction of a fast Fourier transform (FFT) to derive the enhanced algorithm. In addition, we provide convergence analysis for the proposed method. Experimental results demonstrate that accelerated SBM is potentially faster than some existing image CS reconstruction methods.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.216-226
• /
• 2000

This paper suggests a new access path, hashed B-tree which is an efficient access method for integrity checking. Hashed B-tree is based on the observation that most query patterns in enforcing integrity constraints are point queries. Hashed B-tree compresses the key by hashing procedure, which reduces the height of tree and results in fast node search. This method has the advantages such as it can be implemented easily and use the B-tree concurrency control and recovery algorithm with minor modifications.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.643-651
• /
• 2000

ATM network technology is generally used for the integration of multimedia services in high-speed Internet. ABR (Available Bit Rate) and UBR (Unspecified Bit Rate) service classes have been developed specifically to support data application. In this paper, through the result of simulation, we analyzed the effect of TCP data transmission performance by using FRR (Fast Retransmission and Recovery) and Nagle's Algorithm on the UBR service, and by adjusting EFCI switch parameter on the ABR service. As a result of our study, performance improvement of TCP over ATM network is observed by adjusting TCP parameters and setting of effective switch parameter.

• Proceedings of the KIEE Conference
• /
• 1998.07b
• /
• pp.601-603
• /
• 1998

In this paper, Hadamard transform imaging spectrometers utilizing Grill spectrometers are proposed. General Hadamard Transform Spectrometers (HTS) carry out one-encoding through input masks, but Grill spectrometers carry out double-encoding through entrance and exit masks. Thus Grill spectrometers increase the signal-to-noise ratio by double-encoding. we reconfigure the system by using the Grill spectrometers which use a left cyclic S-matrix instead of the conventional right cyclic one. Then, we model the system and apply the mask characteristics method, i.e. $T^{I}$ method, to complete fast algorithm. Through computer simulations, we want to prove the superiority of the proposed system by comparing with the conventional HTS. From Observations concerning the average mean square error(AMSE) associated with estimates from the $T^{I}$ spectrum-recovery method, the relative performances of the two systems are compared.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.127-128
• /
• 2016

오픈플로우 네트워크에서 컨트롤과 데이터 플레인은 스위치나 라우터로 분리되어있다. 이 중 인밴드(in-band) 오픈플로우 네트워크에서 컨트롤 트래픽은 데이터 트래픽과 같은 채널을 사용한다. 그러므로 데이터 트래픽 경로의 오류 발생은 컨트롤과 데이터 트래픽에 영향을 미친다. 기존의 오픈플로우 네트워크에서 오류 복구는 컨트롤러와 스위치 간 모니터링을 필요로 한다. 하지만 수백만 개 이상의 플로우가 흐르는 네트워크에서 이는 오버헤드를 발생시킨다. 이 논문은 기존 모니터링 오버헤드를 줄이기 위해 개미 행동양식을 활용한 인밴드 오픈플로우 네트워크에서 오류 복구 기법을 제안한다.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.1
• /
• pp.39-45
• /
• 2018

Compressive sensing allows recovering an original signal which has a small dimension of the signal compared to the dimension of the entire signal in a short period of time through a small number of observations. In this paper, we proposed a method for detecting tonal signal which caused by the machinery component of a vessel such as an engine, gearbox, and support elements. The tonal signal can be modeled as the sparse signal in the frequency domain when it compares to whole spectrum range. Thus, the target tonal signal can be estimated by S-OMP (Simultaneous-Orthogonal Matching Pursuit) which is one of the sparse signal recovery algorithms. In simulation section, we showed that S-OMP algorithm estimated more precise frequencies than the conventional FFT (Fast Fourier Transform) thresholding algorithm in low SNR (Signal to Noise Ratio) region.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.675-684
• /
• 2004

There have been several efforts to avoid unnecessary retransmission timeouts (RTOs), which is the main cause for TCP throughput degradation. Unnecessary RTOs can be classified into three groups according to their cause. RTOs due to multiple packet losses in the same window for TCP Reno, the most prevalent TCP version, can be avoided by TCP NewReno or using selective acknowledgement (SACK) option. RTOs occurring when a packet is lost in a window that is not large enough to trigger fast retransmit can be avoided by using the Limited Transmit algorithm. In this Paper, we comparatively analyze these schemes to cope with unnecessary RTOs by numerical analysis and simulations. On the basis of the results in this paper, TCP performance can be quantitatively predicted from the aspect of loss recovery probability. Considering that overall performance of TCP is largely dependent upon the loss recovery performance, the results shown in this paper are of great importance.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.17-28
• /
• 2008

Recently, main memory access is a performance bottleneck for many computer applications. Cache memory is introduced in order to reduce memory access latency. However, it is possible for cache memory to reduce memory access latency, when desired data are located on cache. EST tree is proposed to solve this problem by improving T tree. However, when doing a range search, EST tree has to search unnecessary nodes. Therefore, this paper proposes $CST^+$ tree which has the merit of CST tree and is possible to do a range search by linking data nodes with linked lists. By experiments, we show that $CST^+$ is $4{\sim}10$ times as fast as CST and $CSB^+$. In addition, rebuilding an index Is an essential step for the database recovery from system failure. In this paper, we propose a fast tree index rebuilding algorithm called MaxPL. MaxPL has no node-split overhead and employs a parallelism for reading the data records and inserting the keys into the index. We show that MaxPL is $2{\sim}11$ times as fast as sequential insert and batch insert.

• Journal of Gastric Cancer
• /
• v.13 no.2
• /
• pp.98-105
• /
• 2013

Purpose: The aim of this study is to investigate the clinical factors affecting on the cure rate by invasive and open surgery for gastric cancer and to establish a subgroup of patients who can be applied by the early recovery after surgery program through this retrospective analysis. Materials and Methods: In this retrospective study, we analyzed 425 patients who underwent gastric cancer surgery between January 2011 and December 2011 and were managed with conventional clinical therapies. This clinical algorithm was made when the patient was in minimally invasive surgery group and discharged from hospital one day faster than them in open surgery group. Results: The completion rate of the clinical pathway was 62.4%. Despite the different applications of clinical pathway, completion rate in minimally invasive surgery group was significantly higher than that of open group (P<0.001). In multivariate analysis, the surgical procedure of minimally invasive surgery (odds ratio=4.281) was the most predictable factor to complete clinical pathway. Additionally, younger patients (odds ratio=1.933) who underwent distal gastrectomy (odds ratio=1.999) without combined resection (odds ratio=3.069) were predicted to accomplish the clinical pathway without any modifications. Conclusions: We concluded that high efficacy of the clinical pathway for gastric cancer surgery was expected to selected patients through retrospective analysis (expected completion rate=85.4%). In addition, these patients would become enrolled criteria for early recovery program in gastric cancer surgery.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.280-295
• /
• 2015

Block cipher ARIA was first proposed by some South Korean experts in 2003, and later, it was established as a Korean Standard block cipher algorithm by Korean Agency for Technology and Standards. In this paper, we focus on the security evaluation of ARIA block cipher against the recent zero-correlation linear cryptanalysis. In addition, Partial-sum technique and FFT (Fast Fourier Transform) technique are used to speed up the cryptanalysis, respectively. We first introduce some 4-round linear approximations of ARIA with zero-correlation, and then present some key-recovery attacks on 6/7-round ARIA-128/256 with the Partial-sum technique and FFT technique. The key-recovery attack with Partial-sum technique on 6-round ARIA-128 needs $2^{123.6}$ known plaintexts (KPs), $2^{121}$ encryptions and $2^{90.3}$ bytes memory, and the attack with FFT technique requires $2^{124.1}$ KPs, $2^{121.5}$ encryptions and $2^{90.3}$ bytes memory. Moreover, applying Partial-sum technique, we can attack 7-round ARIA-256 with $2^{124.6}$ KPs, $2^{203.5}$ encryptions and $2^{152}$ bytes memory and 7-round ARIA-256 employing FFT technique, requires $2^{124.7}$ KPs, $2^{209.5}$ encryptions and $2^{152}$ bytes memory. Our results are the first zero-correlation linear cryptanalysis results on ARIA.