• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.1
• /
• pp.40-45
• /
• 2014

This paper suggests the optimal generation dispatch algorithm for ensuring voltage stability margin considering high wind energy injection. Generally, with wind generation being installed into the power system, we would have to consider several factors such as the voltage stability margin because wind turbine generators are mostly induction machines. If the proportion of wind generation increases in the power system increases this would affect the overall stability of the system including the voltage stability. This paper considers a specific system that is composed of two areas: area 1 and area 2. It is assumed that generation cost in area 1 is relatively higher than that in area 2. From an economic point of view generation in area 1 should be decreased, however, in the stability point of view the generation in area 2 should be decreased. Since the power system is a nonlinear system, it is very difficult to find the optimal solution and the genetic algorithm is adopted to solve the objective function that is composed of a cost function and a function concerned with voltage stability constraints. For the simulations, the New England system was selected. The algorithm is implemented and Python 2.5.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.19 no.2
• /
• pp.27-46
• /
• 2016

In this study, the parameter-elevation regressions on independent slopes model-Kongju National University(PRISM-KNU) system was developed to interpolate monthly precipitation data. One of the features of PRISM-KNU is that it can adjust the allowable range of slope according to the elevation range in the equation representing a linear relationship between the precipitation and elevation. The parameter value of the model was determined by using the optimization technique, and the result was applied to produce monthly precipitation data with a spatial resolution of $1{\times}1km$ from 2000 to 2014 in South Korea. In the result, the Kling-Gupta Efficiency for model evaluation was over 0.7 in 86% of the total cases simulated. In addition, a dramatic change in the spatial pattern of precipitation data was observed in the output of the Modified Korean PRISM, but such a phenomenon did not occur in the output of the PRISM-KNU. This study confirmed the appropriateness of the PRISM-KNU, and the result showed that the spatial consistency of the data produced by the model improved compared with that produced by the Modified Korean PRISM. It is expected that the PRISM-KNU and its output will be utilized in various studies in the future.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.49 no.1
• /
• pp.29-38
• /
• 2012

The noise generated in the process of obtaining the medical image acts as the element obstructing the image interpretation and diagnosis. To restore the true image from the image polluted from the noise, the total variation optimization algorithm was proposed by the R.O. F (L.Rudin, S Osher, E. Fatemi). This method removes the noise by fitting the balance of the regularity and fidelity. However, the blurring phenomenon of the border area generated in the process of performing the iterative operation cannot be avoided. In this paper, we propose the adaptive total variation method by mapping the control parameter to the proposed transfer function for minimizing boundary error. The proposed transfer function is determined by the noise variance and the local property of the image. The proposed method was applied to 464 tooth images. To evaluate proposed method performance, PSNR which is a indicator of signal and noise's signal power ratio was used. The experimental results show that the proposed method has better performance than other methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.37-47
• /
• 2008

Exploitation of address generation units which are typically provided in DSPs plays an important role in DSP code generation since that perform fast address computation in parallel to the central data path. Offset assignment is optimization of memory layout for program variables by taking advantage of the capabilities of address generation units, consists of memory layout generation and address pointer assignment steps. In this paper, we propose an effective address pointer assignment method to minimize the number of address calculation instructions in DSP code generation. The proposed approach reduces the time complexity of a conventional address pointer assignment algorithm with fixed memory layouts by using minimum cost-nodes breaking. In order to contract memory size and processing time, we employ a powerful pruning technique. Moreover our proposed approach improves the initial solution iteratively by changing the memory layout for each iteration because the memory layout affects the result of the address pointer assignment algorithm. We applied the proposed approach to about 3,000 sequences of the OffsetStone benchmarks to demonstrate the effectiveness of the our approach. Experimental results with benchmarks show an average improvement of 25.9% in the address codes over previous works.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.3
• /
• pp.31-37
• /
• 2020

Identification of the mandibular canal path in Computed Tomography (CT) scans is important in dental implantology. Typically, prior to the implant planning, dentists find a sagittal plane where the mandibular canal path is maximally observed, to manually identify the mandibular canal. However, this is time-consuming and requires extensive experience. In this paper, we propose a deep-learning-based framework to detect the desired sagittal plane automatically. This is accomplished by utilizing two main techniques: 1) a modified version of the iterative transformation network (ITN) method for obtaining initial planes, and 2) a fine searching method based on a convolutional neural network (CNN) classifier for detecting the desirable sagittal plane. This combination of techniques facilitates accurate plane detection, which is a limitation of the stand-alone ITN method. We have tested on a number of CT datasets to demonstrate that the proposed method can achieve more satisfactory results compared to the ITN method. This allows dentists to identify the mandibular canal path efficiently, providing a foundation for future research into more efficient, automatic mandibular canal detection methods.

• Journal of Radiation Protection and Research
• /
• v.37 no.3
• /
• pp.149-158
• /
• 2012

In this paper, we measured the variations of radon concentrations in groundwater using low-level Liquid Scintillation Counter (LSC), an instrument for analyzing the alpha and beta radionuclides at its 10 sites around the Kumjung-Gu, north-western of Busan. Optimization of Pulse Shape Analyzer (PSA) to determinate the highest value of figure of merit (FM) was decided using Quantulus 1200 LSC with radium-226 source, the optimal PSA level was shown in the range of 100 to 110. The results show that the Minimum Detectable Activity (MDA) of radon concentrations is 0.61 $Bq{\cdot}L^{-1}$ for 20 minutes in PSA level. We find that the average radon concentration in groundwater is high in granitic rock area and low in volcanic rock area. (Biotite granite : 191.39 $Bq{\cdot}L^{-1}$, Micro graphic granite : 141.88 $Bq{\cdot}L^{-1}$, Adamellite : 92.94 $Bq{\cdot}L^{-1}$, Andesite (volcanic) : 35.35 $Bq{\cdot}L^{-1}$). No significant seasonal variation pattern is observed from the long-term variation analysis from 10 selected sites. We have not seen the significant correlation of radon concentration to groundwater temperature, atmospheric temperature, atmospheric pressure and rainfall. The concentration variation is probably caused by more complex factors and processes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.540-548
• /
• 2012

The Weapon Target Allocation(WTA) problem is the NP-Complete problem. The WTA problem is that the threatful air targets are assigned by weapon of allies for killing the targets. A good solution of NP-complete problem is heuristic algorithms. Genetic algorithms are commonly used heuristic for global optimization, and it is good solution on the diverse problem domain. But there has been very little research done on the generation of their initial population. The initialization of population is one of the GA step, and it decide to initial value of individuals. In this paper, we propose to the population initialization method to improve a Genetic Algorithm. When it initializes population, the proposed algorithm reflects the characteristics of the WTA problem domain, and inherits the dominant gene. In addition, the search space widely spread in the problem space to find efficiently the good quality solution. In this paper, the proposed algorithm to verify performance examine that an analysis of various properties and the experimental results by analyzing the performance compare to other algorithms. The proposed algorithm compared to the other initialization methods and a general genetic algorithm. As a result, the proposed algorithm showed better performance in WTA problem than the other algorithms. In particular, the proposed algorithm is a good way to apply to the variety of situation WTA problem domain, because the proposed algorithm can be applied flexibly to WTA problem by the adjustment of RMI.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.13-21
• /
• 2010

One of the most distinguished features of the DHP association rules mining algorithm is that it counts the support of hash key combinations composed of k items at phase k-1, and uses the counted support for pruning candidate large itemsets to improve performance. At this time, it is desirable for each hash key combination to have a separate count variable, where it is impossible to allocate the variables owing to memory shortage. So, the algorithm uses a direct hashing mechanism in which several hash key combinations conflict and are counted in a same hash bucket. But the direct hashing mechanism is not efficient because the distribution of hash key combinations is unvalanced by the characteristics sourced from the mining process. This paper proposes a mapped perfect hashing function which maps the region of hash key combinations into a continuous integer space for phase 3 and maximizes the efficiency of direct hashing mechanism. The results of a performance test experimented on 42 test data sets shows that the average performance improvement of the proposed hashing mechanism is 7.3% compared to the existing method, and the highest performance improvement is 16.9%. Also, it shows that the proposed method is more efficient in case the length of transactions or large itemsets are long or the number of total items is large.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.1
• /
• pp.59-67
• /
• 2013

Complex-shaped tall building causes many structural challenges due to its structural characteristics regarding inclined members and complexed shape. This paper is aimed at development of design process using computational-platform which is effective design tool for responding frequent design changes, particularly as to overseas projects. StrAuto, a parametric structural modeling and optimizing system, provides the optimized alternatives according to design intent and realize a swift process converting a series of structural information necessary to nonlinear analytical models. The application of the process was to a 45-story hotel building in Ulanbator, Mongolia adopting shear wall and special moment frame with outrigger systems. To investigate the safety of lateral force resisting system against maximum considered earthquake(MCE), nonlinear response history analysis was conducted using StrAuto.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2010.05a
• /
• pp.1706-1709
• /
• 2010

Sewerage Treatment Plants(STPs) are complexes systems in which a range of physical, chemical and biological processes occur. Since Activated Sludge Model(ASM) No.1 was published, a number of new mathematical models for simulating biological processes have been developed. However, these models have disadvantages in cost and simplicity due to the laboriousness and tediousness of their procedures. One of the major difficulties of these mathematical model based tools is that the field-operators mostly don't have the time or the computer-science skills to handle there models, so it mainly remains on experts or special engineers. In order to solve these situations and help the field-operators, the $KM^2BM$(K-water & More-M Mass Balance Model) based on the dynamic-mass balance model was developed. This paper presents $KM^2BM$ as a simulation tools for STPs design and optimization. This model considers the most important microbial behavioral processes taking place in a STPs to maximize potential applicability without increasing neither model parameter estimation nor wastewater characterization efforts.