• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.359-366
• /
• 2009

Analysis of 3-dimensional (3D) protein structure plays an important role of structural bioinformatics. The protein structure alignment is the main subjects of the structural bioinformatics and the most fundamental problem. Protein Structures are flexible and undergo structural changes as part of their function, and most existing protein structure comparison methods treat them as rigid bodies, which may lead to incorrect alignment. We present a new method that carries out the flexible structure alignment by means of finding SSPs(Similar Substructure Pairs) and flexible points of the protein. In order to find SSPs, we encode the coordinates of atoms in the backbone of protein into RDA(Relative Direction Angle) using local similarity of protein structure. We connect the SSPs with Floyd-Warshall algorithm and make compatible SSPs. We compare the two compatible SSPs and find optimal flexible point in the protein. On our well defined performance experiment, 68 benchmark data set is used and our method is better than three widely used methods (DALI, CE, FATCAT) in terms of alignment accuracy.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.1-11
• /
• 2006

This paper presents a digital auto-focusing method using a priori estimated point-spread-functions (PSF) database. The proposed algorithm efficiently removes out-of-focus blur in a degraded input image by selecting the optimal PSF from the database. The database consists of optical characteristics of image formation system. The PSF selection Process is performed based on a novel focusing measure. The proposed method includes a spatially adaptive filter for removing both noise and ringing artifacts. Experimental results show that the proposed method efficiently removes out-of-focus blur using significantly reduced computational load compared with the existing method.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.2
• /
• pp.145-152
• /
• 2003

In this paper, assuming that the score of speech utterance is the product of HMM log likelihood and HMM weight, we propose a new method that HMM weights are adapted iteratively like the general MCE training. The proposed method adjusts HMM weights for better performance using delta coefficient defined in terms of misclassification measure. Therefore, the parameter estimation and the Viterbi algorithms of conventional 1:.um can be easily applied to the proposed model by constraining the sum of HMM weights to the number of HMMs in an HMM set. Comparing with the general segmental MCE training approach, computing time decreases by reducing the number of parameters to estimate and avoiding gradient calculation through the optimal state sequence. To evaluate the performance of HMM-based speech recognizer by weighting HMM likelihood, we perform Korean isolated digit recognition experiments. The experimental results show better performance than the MCE algorithm with state weighting.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.161-169
• /
• 2012

In general, Euclidean minimum spanning tree is a tree connecting input nodes with minimum connecting cost. But the tree may not be optimal when applied to real world problems of three dimension. In this paper, three dimension Euclidean minimum spanning tree is proposed, connecting all input nodes of 3-dimensional space with minimum cost. In experiments for 30,000 input nodes with 100% space ratio, the tree produced by the proposed method can reduce 90.0% connection cost tree, compared with the tree by two dimension Prim's minimum spanning tree. In two dimension plane, the proposed tree increases 251.2% connecting cost, which is pointless in 3-dimensional real world. Therefore, the proposed method can work well for many connecting problems in real world space of three dimensions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.63-70
• /
• 2010

In IEEE 802.11e system providing differentiated services, there exist some problems as follows; collision probability increase due to the increase in the number of nodes by employing CSMA/CA transmission mode, transmission speed declining tendency towards the worst of it, which is caused by different transmission mode and decrease of TCP transmission rate as the result of the link occupancy by UDP when TCP shares the link with UDP by the TCP’s flow control characteristic. In this thesis, the initial minimum and maximum CW are set differently according to the number of connected nodes in the network to avoid collisions and TXOP is adjusted according to the channel state, in which ACs with low priority but better channel state will get gradually more chances to transmit leading to optimal channel capacity. Also, by allowing higher priority for ACK frames which control the TCP transmission, the flow control becomes better because that reduces the channel occupancy by UDP flow, and by this, fair transmission is obtained from the result of the more fair transmission and active resource allocation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.3
• /
• pp.13-18
• /
• 2011

Sphere Decoding (SD) is a decoding technique able to achieve the Maximum Likelihood (ML) performance in fading environments; nevertheless, the main disadvantage of this technique is its high complexity, especially in poor channel conditions. In this paper, we present an adaptive hybrid algorithm which reduces the conventional Sphere Decoder's complexity and keeps the ML performance. The system called Adaptive OSIC-SD modifies its operation based on Signal to Noise Ratio (SNR) information and achieves an optimal performance in terms of Bit Error Rate (BER) and complexity. Through simulations, we probe that the proposed system maintains almost the same bit error rate performance of the conventional SD, and exhibits a lower, quasi-constant complexity.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.29-34
• /
• 2014

We introduce a number of antenna optimization problem for the zero-forcing beamforming (ZFBF) scheme to enhance energy-efficiency (EE) of the multiple-input-multiple-output broadcast channel. For proposed optimization problem, we assume an instantaneous channel gain of the ZFBF scheme as an average channel gain, given by $N_a-K+1$, in order to reduce a computational complexity of finding the number of active antennas $N_a$. Then, we convert a fractional-form objective function into a subtractive-form, and find a solution of $N_a$ and the maximum EE by an iterative process. Simulation results show that the maximum EE value obtained by proposed algorithm is almost identical to the optimal EE value by the exhaustive search method.

• Journal of Digital Contents Society
• /
• v.15 no.4
• /
• pp.457-464
• /
• 2014

Recently, interests in space information data are increasing due to the initiation of spatial information open platform service by the Ministry of Land, Infrastructure and Transport. The purpose of this study is optimizing management and storing of the texture data, one kinds of 3D-spatial data. First, extract 3D-spatial data through the aerial triangulation and 3D-writing using raw image taken with the Multi-directional aerial camera and the vertical aerial camera. And develop the method to create single texture data and related technique by align and place corresponding 3D-spatial data to optimal storage space. Through experiment, the results show effect of 8 times of storage capacity reduction compared to existing single-file storage method, additionally, new method can improve file management efficiency in comparison with multiple file storage method. The results of this study can be cornerstone of three-dimensional space information management when dealing with bulk data, and utilizations will be enhanced through the further studies and algorithm improvement.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.187-198
• /
• 2005

In this paper, we propose the enhanced header compression scheme for the efficient data traffic transmission in Ipv6 networks. The bandwidth of wireless links and IP networks will probably be limited due to properties of the physical medium and regulatory limits on the use of frequencies for radio communications. That is major cause of user throughput reduction. Therefore, We discuss the IPHC(RFC2507) and ROHC(RFC3095) scheme. IPHC is simple header compression scheme and ROHC is enhanced header compression that have fast optimal recovery scheme. We have studied the enhanced header compression scheme in ROHC. We will show that indication of compression context values preventing from packet losses can provide the fast recovery of compression state. Computer simulations show that the proposed scheme has better performance than the previous one.

• Journal of Korean Society for Quality Management
• /
• v.44 no.2
• /
• pp.389-408
• /
• 2016

Purpose: This study was designed to analyze the behavioral change of knowledge structures and the trends of research topics in the quality management field. Methods: The network structure and knowledge structure of the words were visualized in map form using co-word analysis, cluster analysis and strategic diagram. Results: Summarizing the research results obtained in this study are as follows. First, the word network derived from co-occurrence matrix had 106 nodes and 5,314 links and its density was analyzed to 0.95. Average betweenness centrality of word network was 2.37. In addition, average closeness centrality and average eigenvector centrality of word network were 0.01. Second, by applying optimal criteria of cluster decision and K-means algorithm to word co-occurrence matrix, 106 words were grouped into seven clusters such as standard & efficiency, product design, reliability, control chart, quality model, 6 sigma, and service quality. Conclusion: According to the results of strategic diagram analysis over time, the traditional research topics of quality management field related to reliability, 6 sigma, control chart topics in the third quadrant were revealed to be declined for their study importance. Research topics related to product design and customer satisfaction were found to be an important research topic over analysis periods. Research topic related to management innovation was emerging state and the scope of research topics related to process model was extended to research topics with system performance. Research topic related to service quality located in the first quadrant was analyzed as the key research topic.