• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2004

In this paper. we propose a storage system for XML documents using relational databases. Additional processing is required to store XML documents in the relational databases due to the discrepancy between XML structures and relational schema. This study aims to store XML documents with DTD in the relational databases. We propose the association inlining that exploits shred inlining and hybrid inlining and avoids relation fragments and excessive joins. Experiments show some improvements in the performance with the proposed method. The information of the storage structures is extracted from the simplified DTD. Existing map classes are extended in order to map various structures of XML to relational schema. Map classes are defined for various structures such as elements with multiple values, elements with multiple super elements, and elements with recursive structures through analyzing XML documents. Map files that are XML structures and used in generating SQL statements are created by using the extracted information of storage structures and map classes.

• Journal of Korean Neurosurgical Society
• /
• v.59 no.4
• /
• pp.392-399
• /
• 2016

Objective : Brain metastases in gynecologic cancer (ovarian, endometrial, and cervical cancer) patients are rare, and the efficacy of Gamma Knife Radiosurgery (GKRS) to treat these had not been evaluated. We assessed the efficacy of GKRS and prognostic factors for tumor control and survival in brain metastasis from gynecologic cancers. Methods : This retrospective study was approved by the institutional review board. From May 1995 to October 2012, 26 women (mean age 51.3 years, range 27-70 years) with metastatic brain tumors from gynecologic cancer were treated with GKRS. We reviewed their outcomes, radiological responses, and clinical status. Results : In total 24 patients (59 lesions) were available for follow-up imaging. The median follow-up time was 9 months. The mean treated tumor volume at the time of GKRS was $8185mm^3$ (range $10-19500mm^3$), and the median dose delivered to the tumor margin was 25 Gy (range, 10-30 Gy). A local tumor control rate was 89.8% (53 of 59 tumors). The median overall survival was 9.5 months after GKRS (range, 1-102 months). Age-associated multivariate analysis indicated that the Karnofsky performance status (KPS), the recursive partitioning analysis (RPA) classification, and the number of treated lesions were significant prognostic factors for overall survival (HR=0.162, p=0.008, HR=0.107, p=0.038, and HR=2.897, p=0.045, respectively). Conclusion : GKRS is safe and effective for the management of brain metastasis from gynecologic cancers. The clinical status of the patient is important in determining the overall survival time.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.11
• /
• pp.999-1005
• /
• 2007

In case of an abnormal condition of control surface, the real-time estimation of aerodynamic derivatives are required for the reconfigurable control system to be flight for missions or return to the head office. The goal of this paper is to represent a technique of fault detection to the control surface as a base research to the fault tolerant control system for safety improvement of UAV. The real-time system identification for the fault detection to the control surface was applied with the recursive Fourier Transform and verified through the HILS and flight test. The failures of the control surface are detected by comparing the control derivatives in fault condition with the normal condition. As a result from the flight test, we have confirmed that the control derivatives of fault condition less than about 50% in the normal condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.81-89
• /
• 2003

For improving the performance of noise suppression in tactical communication environments, an enhanced MELP vocoder is suggested, in which an acoustic noise suppressor is integrated into the front end of the MELP algorithm, and an FEC code into the channel side of the MELP algorithm. The acoustic noise suppressor is the modified IS-127 EVRC noise suppressor which is adapted for the MELP vocoder. As for FEC, the turbo code, which consists of rate-113 encoding and BCJR-MAP decoding algorithm, is utilized. In acoustic noise environments, the lower the SNR becomes, the more the effects of noise suppression is increased. Moreover, The suggested system has greater noise suppression effects in stationary noise than in non-stationary noise, and shows its superiority by 0.24 in MOS test to the original MELP vocoder. When the interleave size is one MELP frame, BER 10-6 is accomplished at channel bit SNR 4.2 ㏈. The iteration of decoding at 3 times is suboptimal in its complexity vs. performance. Synthetic quality is realized as more than MOS 2.5 at channel bit SNR 2 ㏈ in subjective voice quality test, when the interleave size is one MELP frame and the iteration of decoding is more than 3 times.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.526-535
• /
• 2005

Ontology is a methodology on describing specific concepts and their relationships, and it is being considered important more and more as semantic web and variety of knowledge management systems are being highlighted. Ontology uses the relationships among concerts to represent some concrete semantics of specific concept. When we want to get some useful information from ontology, we severely have to process the transitive relationships because most of relationships among concepts represent transitivity. Technically, it causes recursive calls to process such transitive closure queries with heavy costs. This paper describes the efficient technique for processing transitive closure queries in ontology. To the purpose of it, we examine some approaches of current systems for transitive closure queries, and propose a technique by graph labeling scheme. Basically, we assume large size of ontology, and then we show that our approach gives relative efficiency in processing of transitive closure, queries.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.721-728
• /
• 2010

CAMC (constant amplitude multi-code) has a better performance of error correction in iterative decoding than SPCPC (single parity check product code). CAMC benefits from a processing gain since it belongs to a spread spectrum signal. We show that the processing gain enhances the performance of CAMC. Additional correction of bit errors is achieved in the de-spreading of iteratively decoded signal. If the number of errors which survived the iterative decoding is less than or equal to ($\sqrt{N}/2-1$), all of the bit errors are removed after the de-spreading. We also propose a stopping criterion in the iterative decoding, which is based on the histogram of EI (extrinsic information). The initial values of EI are randomly distributed, and then they converge to ($-E_{max}$) or ($+E_{max}$) over the iterations. The strength of the convergence reflects how successfully error correction process is performed. Experimental results show that the proposed method achieves a gain of 0.2 dB in Eb/No.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.62-67
• /
• 2001

In the recent mobile communication systems, the performance of Turbo Code using the error correction coding depends on the interleaver influencing the free distance determination and the recursive decoding algorithms that is executed in the turbo decoder. However, performance depends on the interleaver depth that need a large time delay over the reception process. Moreover, Turbo Code has been known as the robust ending method with the confidence over the fading channel. The International Telecommunication Union(ITU) has recently adopted as the standardization of the channel coding over the third generation mobile communications such as IMT-2000. Therefore, in this paper, we proposed of the method to improve the conventional performance with the parallel concatenated 4-New Turbo Decoder using MAP a1gorithm in spite of complexity increasement. In the real-time video and video service over the third generation mobile communications, the performance of the proposed method was analyzed by the reduced decoding delay using the variable decoding method by computer simulation over AWGN and fading channels.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.144-154
• /
• 1999

The binomial sequences are family of orthogonal sequences that can be generated with remarkable simplicity-no multiplications are necessary. This paper introduces a class of non-recursive multidimensional filters for frequency-selective image processing without multiplication operations. The magnitude responses are narrow-band. approximately gaussian-shaped with center frequencies which can be positioned to yield low-pass. band-pass. or high-pass filtering. Algorithms for the efficient implementation of these filters in software or in hardware are described. Also. we show that the binomial QMFs are the maximally flat magnitude square Perfect Reconstruction paraunitary filters with good compression capability and these are shown to be wavelet filters as well. In wavelet transform the original image is decomposed at different scales using a pyramidal algorithm architecture. The decomposition is along the vertical and horizontal direction and maintains constant the number of pixels required to describe the images. An efficient perfect reconstruction binomial QMF-Wavelet signal decomposition structure is proposed. The technique provides a set of filter solutions with very good amplitude responses and band split. The proposed binomial QMF-filter structure is efficient, simple to implement on VLSl. and suitable for multi-resolution signal decomposition and coding applications.

• Korean Journal of Applied Biomechanics
• /
• v.17 no.4
• /
• pp.149-156
• /
• 2007

The purpose of this study was to compare the world class women's hurdlers with kinematic variables Lee Yeon-Kyoung's in the 100m hurdle. Among korea elite female hurdler, Lee Yeon-Kyoung was participated as a subject. Eight JVC video cameras(GR-HD1KR) were used to film the performance of Lee Yeon-Kyoung at a frame rate of 60fields/s. The real-life three-dimensional coordinate data of digitized body landmarks were smoothed using a fourth order Butterworth low pass recursive digital filter with an estimated optimum cutoff frequency of 7.4Hz. After analyzing and comparing Lee Yeon Kyung's kinematic variables with the world top class hurdlers in the woman's 100m hurdle run, the following conclusions were obtained. 1. Lee should be able to increase the speed with over 5.4m/s from start to first hurdle and then maintain the speed range from 8.33m/s to 8.67m/s until 10th hurdle. Lee should have to maintain the speed with 8.51m/s from 10th hurdle to finish line. 2. Lee has to reach her maximum running speed at 5th hurdle and then has to shorten running time with 0.5sec between hurdles. 3. Lee should be able to run around 2.5sec from start to frist hurdle and then maintain under 1.00sec following phases. Lee should be able to maintain under 1.10sec from 10th hurdle to finish line. 4. Lee needs to control a consistent takeoff and landing distance pattern, Lee needs to lower the height of the center of gravity of the body with 0.33m when she clears the hurdles.