• Journal of Navigation and Port Research
• /
• v.38 no.2
• /
• pp.89-96
• /
• 2014

This paper presents an improvement for calculating method of astronomical ship position based on circle of equal altitude equation. In addition, to enhance the accuracy of ship position achieved from solving equation system, the authors used singular value decomposition (SVD) in least square method instead of normal decomposition. In maths, the SVD was proved more numerically stable than normal decomposition. Therefore, the solution of equation system will be more efficient and the result would be more accurate than previous methods. By proposal algorithm, a computer program have been developed to help the navigators in calculating directly ship position when the modern equipment has failure. Finally, some of experiments are carried out to verify effectiveness of proposed algorithm, the results show that the accuracy of ship position based on new method is better than the intercept method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.499-506
• /
• 2003

The design cycle associated with large engineering systems requires an initial decomposition of the complex system into design processes which are coupled through the transference of output data. Some of these design processes may be grouped into iterative subcycles. In analyzing or optimizing such a coupled system, it is essential to determine the best order of the processes within these subcycles to reduce design cycle time and cost. This is accomplished by decomposing large multidisciplinary problems into several sub design structure matrices (DSMs) and processing them in parallel This paper proposes a new method for parallel decomposition of multidisciplinary problems to improve design efficiency by using the multi-objective genetic algorithm and two sample test cases are presented to show the effect of the suggested decomposition method.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.4
• /
• pp.245-254
• /
• 2007

This research proposed feature extraction algorithms as an input of STEP Ap214 data, and feature parameterization process to simplify further design change and maintenance. The procedure starts with suppression of blend faces of an input solid model to generate its simplified model, where both constant and variable-radius blends are considered. Most existing cell decomposition algorithms utilize concave edges, and they usually require complex procedures and computing time in recomposing the cells. The proposed algorithm using reference features, however, was found to be more efficient through testing with a few sample cases. In addition, the algorithm is able to recognize depression features, which is another strong point compared to the existing cell decomposition approaches. The proposed algorithm was implemented on a commercial CAD system and tested with selected industrial product models, along with parameterization of recognized features for further design change.

• Communications for Statistical Applications and Methods
• /
• v.3 no.2
• /
• pp.37-42
• /
• 1996

Maximum likelihood estimation of Cholesky decomposition is considered under normality assumption. It is shown that maximum liklihood estimation gives a Cholesky decomposition of the sample covariance matrix. The joint distribution of the maximum likelihood estimators is derived. The ussual algorithm for a Cholesky decomposition is shown to be equivalent to a maximumlikelihood estimation of a Cholesky root when the underlying distribution is a multivariate normal one.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.35 no.11
• /
• pp.511-518
• /
• 1986

An algorithm for block-decomposition of a linear, time-invariant, discrete large-scale systems is presented, based upon the matrix sign function on Z-plane. The block-decomposition is performed by defining a reference circle, a circular stripe and projection operators. Simulation study shows that the presented algorithm is very useful for multivariable control system's analysis and design.

• East Asian mathematical journal
• /
• v.37 no.3
• /
• pp.295-305
• /
• 2021

In this paper, we analyze the efficiency of a domain decomposition method for the two-dimensional telegraph equations. We formulate the theoretical spectral radius of the iteration matrix generated by the domain decomposition method, because the rate of convergence of an iterative algorithm depends on the spectral radius of the iteration matrix. The theoretical spectral radius is confirmed by the experimental one using MATLAB. Speedup and operation ratio of the domain decomposition method are also compared as the two measurements of the efficiency of the method. Numerical results support the high efficiency of the domain decomposition method.

• Proceedings of the Safety Management and Science Conference
• /
• 2001.05a
• /
• pp.173-178
• /
• 2001

This paper studies the structure and reliability of homogeneous s-coherent multistate system. We describe efficiency of inclusion-exclusion algorithm and pivotal decomposition algorithm for reliability calculation of 2-states system which developed in (Lee 1999) ［10］. We extend our method, applied in ［10］, to the case when components of the system are given multi-states. As an application, the high pressure injection system of a pressurized water reactor is modeled as a multistate system composed of homogeneous s-coherent multistate subsystems. And Several examples are illustrated.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3384-3390
• /
• 2011

This paper describes a domain decomposition method of parallel finite element analysis for elasto-plastic structural problems. As a parallel numeral algorithm for the finite element analysis, the authors have utilized the domain decomposition method combined with an iterative solver such as the conjugate gradient method. Here the domain decomposition method algorithm was applied directly to elasto-plastic problem. The present system was successfully applied to three-dimensional elasto-plastic structural problems.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.11-28
• /
• 2016

In this paper, we proposed a dictionary extension and a ternary decomposition technique to improve the effectiveness of Khmer word segmentation. Most word segmentation approaches depend on a dictionary. However, the dictionary being used is not fully reliable and cannot cover all the words of the Khmer language. This causes an issue of unknown words or out-of-vocabulary words. Our approach is to extend the original dictionary to be more reliable with new words. In addition, we use ternary decomposition for the segmentation process. In this research, we also introduced the invisible space of the Khmer Unicode (char\u200B) in order to segment our training corpus. With our segmentation algorithm, based on ternary decomposition and invisible space, we can extract new words from our training text and then input the new words into the dictionary. We used an extended wordlist and a segmentation algorithm regardless of the invisible space to test an unannotated text. Our results remarkably outperformed other approaches. We have achieved 88.8%, 91.8% and 90.6% rates of precision, recall and F-measurement.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.3
• /
• pp.245-252
• /
• 2010

This paper proposes a constrained multi-area dispatch scheduling algorithm applicable to interconnected power system operations. The dispatch scheduling formulated as an MIP problem can be efficiently computed by GBD algorithm. GBD guarantees adequate computation speed and solution convergence by reducing the dimension of the dispatch scheduling problem. In addition, the regional decomposition technique based on ADM is introduced to obtain efficient inter-temporal OPF solution. It can find the most economic dispatch schedule incorporating power transactions without each regional utility's private information open.