• Proceedings of the KIEE Conference
• /
• 1997.07c
• /
• pp.1078-1082
• /
• 1997

The distance in load parameter space to the closest voltage collapse point provides the worst case power margin and the left eigenvector identifies the most effective direction to steer the system to maximize voltage stability under contingency. This paper presents the results of the comparative performance study of the algorithms, which are applicable to a large scale power system, for computing the closest saddle node bifurcation (CSNB) point. Dobson's iterative method converges with robustness. However the slow process of updating the load increasing direction makes the algorithm less efficient. The direct method converges very quickly. But it diverges if the initial guess is not very close to CSNB. Zeng's method of estimating the approximate critical point in the pre-determined direction is attractive in the sense that it uses only using load flow equations. However, the method is found to be less efficient than Dobson's iterative method. It may be concluded from the above observation that the direct method with the initial values obtained by carrying out the iterative method twice is most efficient at this time and more efficient algorithms are needed for on-line application.

• Steel and Composite Structures
• /
• v.36 no.1
• /
• pp.31-45
• /
• 2020

The purpose of this study is to develop an effective iterative two-stage method (ITSM) for structural damage identification of offshore platform structures. In each iteration, a new damage index, Modal Energy-Based Damage Index (MEBI), is proposed to help effectively locate the potential damage elements in the first stage. Then, in the second stage, the beetle antenna search (BAS) algorithm is used to estimate the damage severity of these elements. Compared with the well-known particle swarm optimization (PSO) algorithm and genetic algorithm (GA), this algorithm has lower computational cost. A modal energy based objective function for the optimization process is proposed. Using numerical and experimental data, the efficiency and accuracy of the ITSM are studied. The effects of measurement noise and spatial incompleteness of mode shape are both considered. All the obtained results show that under these influences, the ITSM can accurately identify the true location and severity of damage. The results also show that the objective function based on modal energy is most suitable for the ITSM compared with that based on flexibility and weighted natural frequency-mode shape.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.4
• /
• pp.41-50
• /
• 1994

An iterative time marching procedure for solving incompressible viscous flows has been applied to the flow around a propeller. This procedure solves three-dimensional Navier-Stokes equations on a moving, body-fitted, non-orthogonal grid using first-order accurate scheme for the time deivatives and second-and third-order accurate schemes for the spatial derivatives. To accelerate iterative process, a multigrid technique has been applied. This procedure is suitable for efficient execution on the current generation of vector or massively parallel computer architectures. Generally good agreement with published experimental and numerical data has been obtained. It was also found that the multigrid technique was efficient in reducing the CPU time needed for the simulation and improved the solution quality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.855-870
• /
• 2019

In this paper, an adaptive iterative algorithm is proposed for motion deblurring by using the salient intensity prior. Based on the observation that the salient intensity of the clear image is sparse, and the salient intensity of the blurred image is less sparse during the image blurring process. The salient intensity prior is proposed to enforce the sparsity of the distribution of the saliency in the latent image, which guides the blind deblurring in various scenarios. Furthermore, an adaptive iteration strategy is proposed to adjust the number of iterations by evaluating the performance of the latent image and the similarity of the estimated blur kernel. The negative influence of overabundant iterations in each scale is effectively restrained in this way. Experiments on publicly available image deblurring datasets demonstrate that the proposed algorithm achieves state-of-the-art deblurring results with small computational costs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1649-1665
• /
• 2021

In view of the low accuracy of the traditional FunkSVD algorithm, and in order to improve the computational efficiency of the algorithm, this paper proposes a parallel algorithm of improved FunkSVD based on Spark (SP-FD). Using RMSProp algorithm to improve the traditional FunkSVD algorithm. The improved FunkSVD algorithm can not only solve the problem of decreased accuracy caused by iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, thereby achieving the effect of improving the accuracy of the algorithm. And using the Spark big data computing framework to realize the parallelization of the improved algorithm, to use RDD for iterative calculation, and to store calculation data in the iterative process in distributed memory to speed up the iteration. The Cartesian product operation in the improved FunkSVD algorithm is divided into blocks to realize parallel calculation, thereby improving the calculation speed of the algorithm. Experiments on three standard data sets in terms of accuracy, execution time, and speedup show that the SP-FD algorithm not only improves the recommendation accuracy, shortens the calculation interval compared to the traditional FunkSVD and several other algorithms but also shows good parallel performance in a cluster environment with multiple nodes. The analysis of experimental results shows that the SP-FD algorithm improves the accuracy and parallel computing capability of the algorithm, which is better than the traditional FunkSVD algorithm.

• The Korean Journal of Nuclear Medicine Technology
• /
• v.28 no.1
• /
• pp.35-40
• /
• 2024

Purpose: To improve the image quality in positron emission tomography (PET), the attenuation correction technique based on the computed tomography (CT) data is important process. However, the artifact is caused by metal material during PET/CT scan, and the image quality is degraded. Therefore, the purpose of this study was to evaluate image quality according to with and without iterative metal artifact reduction (iMAR) algorithm using customized 3D printing phantom. Materials and Methods: The Hoffman and Derenzo phantoms were designed. To protect the gamma ray transmission and express the metal portion, lead substance was located to the surface. The SiPM based PET/CT was used for acquisition of PET images according to application with and without iMAR algorithm. The quantitative methods were used by signal to noise ratio (SNR), coefficient of variation (COV), and contrast to noise ratio (CNR). Results and Discussion: The results shows that the image quality applying iMAR algorithm was higher 1.15, 1.19, and 1.11 times than image quality without iMAR algorithm for SNR, COV, and CNR. Conclusion: In conclusion, the iMAR algorithm was useful for improvement of image quality by reducing the metal artifact lesion.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.5
• /
• pp.1-7
• /
• 2002

In this paper, an extended type of a direct learning control(DLC) method is proposed for the effective control of systems which perform a given task repetitively. DLC methods have been suggested to overcome the defects of iterative learning control, the learning process should be resumed from the beginning even if a slight change occurs in the desired output pattern. If a given desired output trajectory is "proportional" to the output trajectories which are learned previously, we can obtain the desired control input directly without the iterative learning process by using the DLC. First, most existing DLC methods are shown to be applicable only to single-input single-output systems with the relative degree one and then, an extended type of DLC is proposed for a class of nonlinear systems having the relative degree more than or equal to one by using the known relative degree of a nonlinear system. By the simulation results for the arbitrary nonlinear system with the relative degree more than one, the validity and the performance of the proposed DLC method are examined.

• The Journal of Korean Association of Computer Education
• /
• v.19 no.1
• /
• pp.101-109
• /
• 2016

Designing algorithms is a very important learning process in computational thinking education because it requires learner's logical and procedural thinking. But the case studies that have topics of algorithms learning and students' types of errors in learning algorithms are not enough. So the purpose of this study is to analyze students' errors that discovered in the process of learning three control structures of programming using flowchart and provide types of errors in designing algorithms. Results about tests of three types of control structures in university student's algorithms learning class showed different cases of types of errors; types of sequential control error are not presented in the class, types of conditional control error are presented in the case of setting the conditions of nested conditional control, and types of iterative control are showed in the many cases of iterative conditions, statements of single and nested iterative control structure. The results of study will be a good case study about teaching designing algorithms of computational thinking education in elementary, secondary school and university.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.231-239
• /
• 2002

This paper presents a new fractal coding scheme to find sub-optimal transformation by performing an iterative encoding process. An optimal transformation can be defined as the transformation generating the attractor which is closest to an original image. Unfortunately, it has been well-known that it is actually impossible to find the optimal transformation due to heavy computation. In this paper, however, by means of some new theorems related with the fractal transformation due the attractor, it is shown that for a special case the optimal transformation can be obtained as well as for a general case the sub-optimal transformation. The proposed method based on the theorems obtains the sub-optimal transformation performing an iterative process as if done in decoding. Thus, it requires more computation than the conventional method but improves the image quality. We verify the superiority of the proposed method through the experimental results fur real images, which shows that the proposed method approaches to the optimal method in the performance and is superior to the conventional method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.5 s.347
• /
• pp.121-127
• /
• 2006

It is well known the fact that turbo codes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. In this paper, it proposes the efficient stop criterion algorithm for turbo codes using the maximum sign change of LLR. It is verifying that the proposal variable iterative decoding controller can be reduced the average iterative decoding number compared to conventional schemes with a negligible degradation of the error performance.