• Journal of Korean Neurosurgical Society
• /
• v.44 no.6
• /
• pp.358-363
• /
• 2008

Objective : This study was performed to assess the efficacy of GKS in patients with ten or more brain metastases. Methods : From Aug 2002 to Dec 2007, twenty-six patients (13 men and 13 women) with ten or more cerebral metastatic lesions underwent GKS. The mean age was 55 years (32-80). All patients had Karnofsky performance status (KPS) score of 70 or better. According to recursive partitioning analysis (RPA) classification, 3 patients belonged to class I and 23 to class II. The location of primary tumor was lung (21), breast (3) and unknown (2). The mean number of the lesions per patient was 16.6 (10-37). The mean cumulated volume was 10.9 cc (1.0-42.2). The median marginal dose was 15 Gy (9-23). Overall survival and the prognostic factors for the survival were retrospectively analyzed by using Kaplan Meier method and univariate analysis. Results : Overall median survival from GKS was 34 weeks (8-199). Local control was possible for 79.5% of the lesions and control of all the lesions was possible in at least 14 patients (53.8%) until 6 months after GKS. New lesions appeared in 7 (26.9%) patients during the same period. At the last follow-up, 18 patients died; 6 (33.3%) from systemic causes, 10 (55.6%) from neurological causes, and 2 (11.1 %) from unknown causes. Synchronous onset in non-small cell lung cancer (p=0.007), high KPS score (${\geq}80$, p=0.029), and controlled primary disease (p=0.020) were favorable prognostic factors in univariate analysis. Conclusion : In carefully selected patients, GKS may be a treatment option for ten or more brain metastases.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.605-614
• /
• 2007

As a standard query language to search XML data, XQuery and XPath were proposed by W3C. By widely using XQuery and XPath languages, recent researches focus on the development of query processing algorithm and data structure for efficiently processing XML query with the enormous XML database system. Recently, when processing XML path expressions, the concept of the structural join which may determine the structural relationship between XML elements, e.g., ancestor-descendant or parent-child, has been one of the dominant XPath processing mechanisms. However, structural joins which frequently occur in XPath query processing require high cost. In this paper, we propose a new structural join algorithm, called SISJ, based on our structured index, called SI, in order to process XPath queries efficiently. Experimental results show that our algorithm performs marginally better than previous ones. However, in the case of high recursive documents, it performed more than 30% by the pruning feature of the proposed method.

• The Korean Journal of Applied Statistics
• /
• v.18 no.2
• /
• pp.253-269
• /
• 2005

One of the basic assumptions of the regression models is that the parameter vector does not vary across sample observations. If the parameter vector is not constant for all observations in the sample, the statistical model is changed and the usual least squares estimators do not yield unbiased, consistent and efficient estimates. This study investigates the regression model with some or all parameters vary across partitions of the whole sample data when the model permits different response coefficients during unusual time periods. Since the usual test for overall homogeneity of regressions across partitions of the sample data does not explicitly identify the break points between the partitions, the testing the equality between subsets of coefficients in two or more linear regressions is generalized and combined with the test procedure to search the break point. The method is applied to find the possibility and the turning point of the structural change in the long-run unemployment rate in the usual static framework by using the regression model. The relationships between the variables included in the model are reexamined in the dynamic framework by using Vector Autoregression.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.40 no.4
• /
• pp.264-274
• /
• 2003

This paper presents a direct generalized minimum-variance self tuning controller with a PID structure using neural network which adapts to the changing parameters of the nonlinear system with nonminimum phase behavior, noises and time delays. The self-tuning controller with a PID structure is a combination of the simple structure of a PID controller and the characteristics of a self-tuning controller that can adapt to changes in the environment. The self-tuning control effect is achieved through the RLS (recursive least square) algorithm at the parameter estimation stage as well as through the Robbins-Monro algorithm at the stage of optimizing the design parameter of the controller. The neural network control effect which compensates for nonlinear factor is obtained from the learning algorithm which the learning error between the filtered reference and the auxiliary output of plant becomes zero. Computer simulation has shown that the proposed method works effectively on the nonlinear nonminimum phase system with time delays and changed system parameter.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.681-684
• /
• 2015

Power amplifier is an essential component for transmitting signals to a remote receiver in wireless communication systems. Power amplifier is a non-linear device in general, and the nonlinear distortion becomes severer as the output power increases. The nonlinearity results in spectral regrowth, which leads to adjacent channel interference, and decreases the transmit signal quality. To linearize power amplifiers, many techniques have been developed so far. Among the techniques, digital pre-distortion is known as the most cost and performance effective technique. However, the linearization performance falls down abruptly when the power amplifier operates in its saturation region. This is because of the severe nonlinearity. To relieve this problem, this paper proposes a new adaptive predistortion technique. The proposed technique controls the adaptive algorithm based on the power amplifier input level. Specifically, for small signals, the adaptive predistortion algorithm works normally. On the contrary, for large signals, the adaptive algorithm stops until small signals occur again. By doing this, wrong coefficient update by severe nonlinearity can be avoided. Computer simulation results show that the proposed method can improve the linearization performance compared with the conventional digital predistortion algorithms.

• Journal for History of Mathematics
• /
• v.21 no.3
• /
• pp.127-142
• /
• 2008

In this paper, we introduce four different approaches of proving Cayley formula, which counts the number of trees(acyclic connected simple graphs). The first proof was done by Cayley using recursive formulas. On the other hands the core idea of the other three proofs is the bijective method-find an one to one correspondence between the set of trees and a suitable family of combinatorial objects. Each of the three bijection gives its own generalization of Cayley formula. In particular, the last proof, done by Seo and Shin, has an application to computer science(theoretical computation), which is a typical example that pure mathematics supply powerful tools to other research fields.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.3 no.3
• /
• pp.272-275
• /
• 2014

An improved fuzzy Kalman filtering speed estimation scheme was proposed by means of measuring stator side voltage and current value based on vector control state equation of induction motor. The designed fuzzy adaptive controller conducted recursive online correction of measurement noise covariance matrix by monitoring the ratio of theory residuals and actual residuals to make it approach real noise level gradually, allowing the filter to perform optimal estimation to improve estimation accuracy of EKF. Meanwhile, co-simulation scheme based on MATLAB and Ansoft was proposed in order to improve simulation accuracy. Field-circuit coupling problems of induction motor under the action of vector control were solved and the parameter optimization accuracy was improved dramatically. The simulation and experimental results show that this algorithm has a strong ability to inhibit the random measurement noise. It is able to estimate motor speed accurately, and has superior static and dynamic characteristics.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.84-92
• /
• 2006

In this paper, we propose an efficient multicasting algorithm in multistage interconnection networks (MIN's) employing the region encoding scheme. The proposed algorithm uses the recursive scheme to recycle a multicast message at most two times through MIN, in order to send it to its desired destinations. It is composed of two recycling phases which are the copying phase and the routing phase of the multicast message. In the first phase, a source sends the message to a region that contains the largest number of destination regions, and destinations in these regions receive and store the message in this phase. The remaining destinations can finally receive the message in the second phase. This method of the algorithm can improve its performance by reducing the delay of message and the volume of traffic. Moreover, we evaluate the performance of our algorithm in terms of the average number of recycling and the number of internal links used per destination, comparing with the previously proposed algorithm.

• 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.

• 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.