• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2003.10a
• /
• pp.70-86
• /
• 2003

Despite its usability, TCE has been managed as a hazardous material due to the toxicity and many contamination cases were surveyed in some developed countries. U.S.EPA(Kram et al., 2001) suggested DNAPL characterization methods and approaches based on survey experiences at several sites. However, Korea has not the least assessment of contamination and trial of remediation, although there are a lot of doubtable areas where ground water would be contaminated with TCE. In this study, we try to assess the volume and extent of ground water contamination with TCE and delineate the contamination source zones in an industrial area. Ground water in this area flows through fractures and the contaminant TCE has the properties of high volatility, high density and low partitioning to soil material. Thus, we applied a variety of technical approaches to identify the contamination status; documentary, hydrogeochemical, hydrogeological and geological surveys. In addition, additional survey was performed based on the interim findings, which showed that ground water contamination was limited to the relatively small area with high concentrations to the deep place. The contamination source zone is estimated to be the asphalt test institute where a great deal of TCE has been used to analyze the amount of asphalt soluble in TCE since 1984. Based on the contamination characterization and a myriad of documents about ground water remediation, appropriate site remediation management options will be recommended later. This study is now under way and this paper was focused on describing the technical approaches used to achieve the goals of this study.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.11-17
• /
• 2007

One of the popular methods used for pattern classification is the MBR (Memory-Based Reasoning) algorithm. Since it simply computes distances between a test pattern and training patterns or hyperplanes stored in memory, and then assigns the class of the nearest training pattern, it cannot explain how the classification result is obtained. In order to overcome this problem, we propose an incremental teaming algorithm based on RPA (Recursive Partition Averaging) to extract IF-THEN rules that describe regularities inherent in training patterns. But rules generated by RPA eventually show an overfitting phenomenon, because they depend too strongly on the details of given training patterns. Also RPA produces more number of rules than necessary, due to over-partitioning of the pattern space. Consequently, we present the IREA (Incremental Rule Extraction Algorithm) that overcomes overfitting problem by removing useless conditions from rules and reduces the number of rules at the same time. We verify the performance of proposed algorithm using benchmark data sets from UCI Machine Learning Repository.

• Journal of Ginseng Research
• /
• v.40 no.3
• /
• pp.292-299
• /
• 2016

Background: We previously reported that two-phase partition chromatography between ginseng water extract and soybean oil efficiently eliminated pesticide residues. However, an undesirable odor and an unpalatable taste unique to soybean oil were two major disadvantages of the method. This study was carried out to find an alternative vegetable oil that is cost effective, labor effective, and efficient without leaving an undesirable taste and smell. Methods: We employed six vegetable oils that were available at a grocery store. A 1-mL sample of the corresponding oil containing a total of 32 pesticides, representing four categories, was mixed with 10% aqueous ginseng extract (20 mL) and equivalent vegetable oil (7 mL) in Falcon tubes. The final concentration of the pesticides in the mixture (28 mL) was adjusted to approximately 2 ppm. In addition, pesticides for spiking were clustered depending on the analytical equipment (GC/HPLC), detection mode (electron capture detector/nitrogen-phosphorus detector), or retention time used. Samples were harvested and subjected to quantitative analysis of the pesticides. Results: Soybean oil demonstrated the highest efficiency in partitioning pesticide residues in the ginseng extract to the oil phase. However, canola oil gave the best result in an organoleptic test due to the lack of undesirable odor and unpalatable taste. Furthermore, the qualitative and quantitative changes of ginsenosides evaluated by TLC and HPLC, respectively, revealed no notable change before or after canola oil treatment. Conclusion: We suggest that canola oil is an excellent vehicle with respect to its organoleptic property, cost-effectiveness and efficiency of eliminating pesticide residues in ginseng extract.

• Journal of the Korean Chemical Society
• /
• v.36 no.1
• /
• pp.66-74
• /
• 1992

A method for the multiresidual simultaneous analysis of 11 thiocarbamates was studied using HPLC. Thiocarbamate in Chinese cabbage was analyzed in the order of extraction, partition, and cleanup in their optimum condition. Acetone was chosen as an extracting solvent. As a partitioning solvent, the mixture of 50% methylene chloride and petroleum ether containing extremely small water content showed good recoveries of thiocarbamate from the water layer. Partition efficiency was affected by pH of the water layer; it remained almost constant under the acidic and neutral condition while decreasing under the basic condition. The comparison done in cleanup step showed that the column chromatographic method is superior to the treatment of coagulating reagent. As an absorbent, the mixture of charcoal, magnesia, and celite with the ratio of 1 : 2 : 4 gave better recoveries and also effectively removed chlorophyll. Over the total procedure, the average recoveries for thiocarbamates in Chinese cabbage were 91% at about 2 ppm fortification level within the relative standard deviation of 8%, and the minimum detection limit (MDL) was 2.2${\sim}$9.3 ng.

• Journal of Korean Neurosurgical Society
• /
• v.46 no.3
• /
• pp.245-251
• /
• 2009

Objective : The authors analyzed the effectiveness and therapeutic response of Novalis shaped beam radiosurgery for metastatic brain tumors, and the prognostic factors which influenced the outcome. Methods : We performed a retrospective analysis of 106 patients who underwent 159 treatments for 640 metastatic brain lesions between January 2000 and April 2008. The pathologies of the primary tumor were mainly lung (45.3%), breast (18.2%) and GI tract (13.2%). We classified the patients using Radiation Therapy Oncology Group Recursive Partitioning Analysis (RPA) and then analyzed the survival and prognostic factors according to the Kaplan Meier method and univariate analysis. Results : The overall median actuarial survival rate was 7.3 months from the time of first radiosurgery treatment while 1 and 2 year actuarial survival estimates were 31% and 14.4%, respectively. Median actuarial survival rates for RPA classes I, II, and III were 31.3 months, 7.5 months and 1.7 months, respectively. Patients' life spans, higher Karnofsky performance scores and age correlated closely with RPA classes. However, sex and the number of lesions were not found to be significantly associated with length of survival. Conclusion : This result suggests that Novalis radiosurgery can be a good treatment option for treatment of the patients with brain metastases.

• Journal of Digital Contents Society
• /
• v.9 no.3
• /
• pp.471-481
• /
• 2008

Test scheduling considering power dissipation is an effective technique to reduce the testing time of complex SoCs and to enhance fault coverage under limitation of allowed maximum power dissipation. In this paper, a modeling technique of test resources and a test scheduling algorithm for efficient test procedures are proposed and confirmed. For test resources modeling, two methods are described. One is to use the maximum point and next maximum point of power dissipation in test resources, the other one is to model test resources by partitioning of them. A novel heuristic test scheduling algorithm, using the extended-tree-growing-graph for generation of maximum embedded cores usable simultaneously by using relations between test resources and cores and power-dissipation-changing-graph for power optimization, is presented and compared with conventional algorithms to verify its efficiency.

• Journal of Korea Game Society
• /
• v.13 no.2
• /
• pp.39-48
• /
• 2013

In MMORPGs(Massively Multi-player Online Role-Playing Games) a large number of players actively interact with one another in a virtual world. Therefore MMORGs must be able to quickly process real-time access requests and process requests from numerous gaming users. A key challenge is that the workload of the game server increases as the number of gaming users increases. To address this workload problem, many developers apply with distributed server architectures which use dynamic map partitioning and load balancing according to the server function. Therefore most MMORPG servers partition a virtual world into zones and each zone runs on multiple game servers. These methods cause of players frequently move between game servers, which imposes high overhead for data updates. In this paper, we propose a new architecture that apply with an arithmetic server dedicated to data operation. This architecture enables the existing game servers to process more access and job requests by reducing the load. Through mathematical modeling and experimental results, we show that our scheme yields higher efficiency than the existing ones.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.6
• /
• pp.1253-1262
• /
• 2014

Regression tree is a tree-structured solution in which a simple regression model is fitted to the data in each node made by recursive partitioning of predictor space. There have been many efforts to apply tree algorithms to various regression problems like logistic regression and quantile regression. Recently, algorithms have been expanded to the panel data analysis such as RE-EM algorithm by Sela and Simonoff (2012), and extension of GUIDE by Loh and Zheng (2013). The algorithms are briefly introduced and prediction accuracy of three methods are compared in this paper. In general, RE-EM shows good prediction accuracy with least MSE's in the simulation study. A RE-EM tree fitted to business survey index (BSI) panel data shows that sales BSI is the main factor which affects business entrepreneurs' economic sentiment. The economic sentiment BSI of non-manufacturing industries is higher than that of manufacturing ones among the relatively high sales group.

• Journal of Information Technology and Architecture
• /
• v.9 no.4
• /
• pp.455-464
• /
• 2012

Due to the recent data explosion, methods which can meet the requirement of large data analysis has been studying. This paper proposes MRIterativeBUC algorithm which enables efficient computation of large data cube by distributed parallel processing with MapReduce framework. MRIterativeBUC algorithm is developed for efficient iterative operation of the BUC method with MapReduce, and overcomes the limitations about the storage size and processing ability caused by large data cube computation. It employs the idea from the iceberg cube which computes only the interesting aspect of analysts and the distributed parallel process of cube computation by partitioning and sorting. Thus, it reduces data emission so that it can reduce network overload, processing amount on each node, and eventually the cube computation cost. The bottom-up cube computation and iterative algorithm using MapReduce, proposed in this paper, can be expanded in various way, and will make full use of many applications.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.624-640
• /
• 2004

Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.