• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.2
• /
• pp.107-121
• /
• 2016

We analyze the complexity of the LLL algorithm, invented by Lenstra, Lenstra, and $Lov{\acute{a}}sz$ as a a well-known lattice reduction (LR) algorithm which is previously known as having the complexity of $O(N^4{\log}B)$ multiplications (or, $O(N^5({\log}B)^2)$ bit operations) for a lattice basis matrix $H({\in}{\mathbb{R}}^{M{\times}N})$ where B is the maximum value among the squared norm of columns of H. This implies that the complexity of the lattice reduction algorithm depends only on the matrix size and the lattice basis norm. However, the matrix structures (i.e., the correlation among the columns) of a given lattice matrix, which is usually measured by its condition number or determinant, can affect the computational complexity of the LR algorithm. In this paper, to see how the matrix structures can affect the LLL algorithm's complexity, we derive a more tight upper bound on the complexity of LLL algorithm in terms of the condition number and determinant of a given lattice matrix. We also analyze the complexities of the LLL updating/downdating schemes using the proposed upper bound.

• Communications for Statistical Applications and Methods
• /
• v.22 no.3
• /
• pp.277-283
• /
• 2015

Pickands constant $H_{\alpha}$ appears in the classical result about tail probabilities of the extremes of Gaussian processes and there exist several different representations of Pickands constant. However, the exact value of $H_{\alpha}$ is unknown except for two special Gaussian processes. Significant effort has been made to find numerical approximations of $H_{\alpha}$. In this paper, we attempt to compute numerically $H_{\alpha}$ based on its representation derived by $H{\ddot{u}}sler$ (1999) and Albin and Choi (2010). Our estimates are compared with the often quoted conjecture $H_{\alpha}=1/{\Gamma}(1/{\alpha})$ for 0 < ${\alpha}$ ${\leq}$ 2. This conjecture does not seem compatible with our simulation result for 1 < ${\alpha}$ < 2, which is also recently observed by Dieker and Yakir (2014) who devised a reliable algorithm to estimate these constants along with a detailed error analysis.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.99-101
• /
• 2005

This paper is concerned with the active vibration control of flexible plate system using $H_2$ controller. The main objective of this paper is to propose the system identification for estimation dynamic equation of plate vibration system and control algorithm such as $H_2$ controller design. In this paper dynamic equation is determined by considering only the first, second, and third vibration modes, and experiments confirm that this model works well. The $H_2$ control algorithm is proposed and implemented on the experimental setup to show their efficacy. Effectiveness and performance of the designed controller was verified by both simulation and experiment result.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.5
• /
• pp.653-659
• /
• 2006

The design of $H_2$-optimal control with regional pole assignment via state feedback in linear time-invariant systems is investigated. The aim is to find a state feedback controller such that the closed-loop system has the desired eigenvalues lying in some desired stable regions and attenuates the disturbance between the output vector and the disturbance vector. Based on a proposed result of parametric eigenstructure assignment via state feedback in linear systems, the considered $H_2$-optimal control problem is changed into a minimization problem with certain constraints, and a simple and effective algorithm is proposed for this considered problem. A numerical example and its simulation results show the simplicity and effectiveness of this proposed algorithm.

• Journal of Biomedical Engineering Research
• /
• v.40 no.4
• /
• pp.132-136
• /
• 2019

This study proposes an auto-titrating algorithm for auto-titrating positive airway pressure (APAP). The process of the proposed algorithm is as follows. First, sleep apnea-hypopnea and snoring events were detected using nasal pressure. Second, APAP base pressure and SDB events were used for automatic titration of optimal pressure. And, auto-titrating algorithm is built into M3 (MEK-ICS CO. Ltd., Republic of Korea) for evaluation. The detection results of SDB showed mean sensitivity (Sen.) and positive predictive value (PPV.) of 85.7% and 87.8%, respectively. The mean pressure and apnea-hypopnea index (AHI) of auto-titrating algorithm showed $13.0{\pm}5.2cmH_2O$ and $3.0{\pm}2.4$ events/h, respectively. And, paired t-test was conducted to verify whether the performance of our algorithm has no significant difference with AutoSet S9 (p>0.05). These results represent better or comparable outcomes compared to those of previous APAP devices.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.151-160
• /
• 2005

In this paper, we propose a new fast motion estimation algorithm based on successive elimination algorithm (SEA) which can dramatically reduce heavy complexity of the variable block size motion estimation in H.264 encoder. The proposed method applies the conventional SEA in the hierarchical manner to the seven block modes. That is, the proposed algorithm can remove the unnecessary computation of SAD by means of the process that the previous minimum SAD is compared to a current SAD for each mode which is obtained by accumulating sum norms or SAD of $4\times4$ blocks. As a result, we have tighter bound in the inequality between SAD and sum norm than in the ordinary SEA. If the basic size of the block is smaller than $4\times4$, the bound will become tighter but it also causes to increase computational complexity, specifically addition operations for sum norm. Compared with fast full search algorithm of JM of H.264, our algorithm saves 60 to $70\%$ of computation on average for several image sequences.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.91-98
• /
• 2004

DHP mining association rules algorithm maintains previously independent direct hash table to reduce the sire of hash tree containing the frequency number of each candidate large itemset. It performs pruning by using the direct hash table when the hash tree is constructed. The mort large the size of direct hash table increases, the higher the effort of pruning becomes. Especially, the effect of pruning in phase 2 which generate 2-large itemsets is so high that it dominates the overall performance of DHP algorithm. So, following the speedy trends of producing VLM(Very Large Memory) systems, extreme increment of direct hash table size is being tried and one of those trials is perfect hash table in phase 2. In case of using perfect hash table in phase 2, we found that some rearrangement of DHP algorithm got about 20% performance improvement compared to simply ｜H$_2$｜ reconfigured DHP algorithm. In this paper, we examine the feasibility of perfect hash table in phase 2 and propose PHP algorithm, a rearranged DHP algorithm, which uses the characteristics of perfect hash table sufficiently, then make an analysis on the results in experimental environment.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.31-36
• /
• 2010

After the launch of MPEG-2, it is widely used in multimedia applications like a Digital-TV or a DVD. Then, After the launch of H.264 at 2004, it has been expected to replace MPEG-2 and services IPTV and DMB. As we have been used to MPEG-2 devices by this time, we can not access H.264 Broadcast with MPEG-2 device. So We propose a new approach to transcode H.264 video into MPEG-2 form which can facilitate to display H.264 video with MPEG-2 device. To reduce the quality loss by transcoding, we use CPDT(Cascaded Pixel Domain Transcoder) structure. And to minimize processing time, SKIP block, INTRA block and motion vectors obtain from decoding process is employed for transcoding. we use BMA(Boundary Matching Algorithm) to select only one from candidate motion vectors. Experimental results show a considerable improved PSNR with reduction in processing time compared with existing methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.2
• /
• pp.355-361
• /
• 2009

This paper proposes a new basic unit level rate control algorithm which generates the output bits corresponding to the target bits. The H.264 standard uses various coding modes and optimization methods to improve the compression performance, which makes it difficult to control the generated traffic accurately. In the proposed scheme, the allocated bits to a frame are distributed to all basic units properly to encode each basic unit according to the bit budget. After encoding the frame, the encoding parameters are adjusted according to the difference between the target and the resulting values. It is shown by experimental results that the new algorithm can generate output bit rates accurately corresponding to the target bit rates with the PSNR performance better than that of the existing rate control algorithm.