• The Journal of the Acoustical Society of Korea
• /
• v.32 no.3
• /
• pp.247-251
• /
• 2013

In this paper, near-field source localization algorithm is presented using Matrix Pencil in Uniform Linear Array(ULA). Based on the centrosymmetry of the ULA, the proposed algorithm decouples the steering vectors which allow for the bearing estimation using Matrix pencil. With estimated bearing, the range estimation of each source is consequently obtained by defining 1D MUSIC spectrum. Simulation results are presented to validate the performance of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.20 no.1
• /
• pp.43-50
• /
• 2017

According to living environment, the number of deaths due to thyroid diseases increased. In this paper, we proposed an algorithm for recognizing a thyroid detection using texture analysis based on shape, gray level co-occurrence matrix and gray level run length matrix. First of all, we segmented the region of interest (ROI) using active contour model algorithm. Then, we applied a total of 18 features (5 first order descriptors, 10 Gray level co-occurrence matrix features(GLCM), 2 Gray level run length matrix features and shape feature) to each thyroid region of interest. The extracted features are used as statistical analysis. Our results show that first order statistics (Skewness, Entropy, Energy, Smoothness), GLCM (Correlation, Contrast, Energy, Entropy, Difference variance, Difference Entropy, Homogeneity, Maximum Probability, Sum average, Sum entropy), GLRLM features and shape feature helped to distinguish thyroid benign and malignant. This algorithm will be helpful to diagnose of thyroid nodule on ultrasound images.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.128-147
• /
• 1991

We propose a dynamic incidence matrix (DIM) for reflecting states and time conditions of a timed Petri net (TPN) explicitly. Since a DIM consists of a conventional incidence matrix, two time-related vectors and two state-related vectors, we can get the advantages inherent in the conventional incidence matrix of describing a static structure of a system as well as another advantage of expressing time dependent state transitions. We introduce an algorithm providing the DIM with a state transition mechanism. Because the algorithm is, in fact, an algorithmic model for discrete event simulation of TPN models, we provide a theoretical basis of model transformation of a TPN model into a DEVS(Discrete Event system Specification) model. By executing the algorithm we can carry out performance analysis of computer communication protocols which are represented TPN models.

• International Journal of Precision Engineering and Manufacturing
• /
• v.5 no.3
• /
• pp.77-84
• /
• 2004

A robust optimal control design is proposed in this study for rigid robotic systems under the unknown loads and the other uncertainties. The uncertainties are reflected in the performance index, where the uncertainties are bounded for the quadratic square of the states with a positive definite weighting matrix. An iterative algorithm is presented for the determination of the weighting matrix required for necessary robustness. Computer simulations have been done for a weight-lifting operation of a two-link manipulator and the simulation results shows that the proposed algorithm is very effective for a robust control of robotic systems.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.133-136
• /
• 2004

We are going to procedure various view from two frontal image using trifocal tensor. We found that warping is effective to produce synthesized poses of a face with the small number of mesh point of a given image in previous research[1]. For this research, fundamental matrix is important to calculate trifocal tensor. So, in this paper, we investigate two existing algorithms: Hartley's[2] and Kanatani's[3]. As an experimental result, Kenichi Kantani's algorithm has better performance of fundamental matrix than Harley's algorithm. Then we use the fundamental matrix of Kenichi Kantani's algorithm to calculate trifocal tensor. From trifocal tensor we calculate new trifocal tensor with rotation input and translation input and we use warping to produce new virtual views.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.1
• /
• pp.62-67
• /
• 2003

An important aspect of the study of power system markets involves the assessment of strategic behavior of participants for maximizing their profits. In models of imperfect competition of a deregulated electricity system, the key task is to find the Nash equilibrium. In this paper, the bimatrix approach for finding Nash equilibria in electricity markets is investigated. This approach determines pure and mixed equilibria using the complementarity pivot algorithim. The mixed equilibrium in the matrix approach has the equal number of non-zero property. This property makes it difficult to reproduce a smooth continuous distribution for the mixed equilibrium. This paper proposes an algorithm for adjusting the quantization value of discretization to reconstruct a continuous distribution from a discrete one.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.734-736
• /
• 1996

This paper presents a method of calculating a selective number of eigenvalues in power systems, which are rightmost, or are largest modulus. The modified Arnoldi method in conjunction with implicit shift OR-algorithm is used to calculate the rightmost eigenvalues. Algorithm requires neither a prior knowledge of the specified shifts nor the calculation of inverse matrix. The key advantage of the algorithm is its ability to converge to the wanted eigenvalues at once. The method is compared with the modified Arnoldi method combined with S-matrix transformation, where the eigenvalues having the largest modulus are to be determined. The two methods are applied to the reduced Kansai system. Convergence characteristics and performances are compared. Results show that both methods are robust and has good convergence properties. However, the implicit shift OR method is seen to be faster than the S-matrix method under the same condition.

• Journal of Korea Multimedia Society
• /
• v.7 no.6
• /
• pp.781-790
• /
• 2004

This paper presents a fourth-order cumulants based iterative algorithm for blind channel equalization. It is robust with respect to the existence of heavy Gaussian noise in a channel and does not require the minimum phase characteristic of the channel. In this approach, the transmitted signals at the receiver are over-sampled to ensure the channel described by a full-column rank matrix. It changes a single-input/single-output (SISO) finite-impulse response (FIR) channel to a single-input/multi-output (SIMO) channel. Based on the properties of the fourth-order cumulants of the over-sampled channel outputs, the iterative algorithm is derived to estimate the deconvolution matrix which makes the overall transfer matrix transparent, i.e., it can be reduced to the identity matrix by simple reordering and scaling. Both a closed-form and a stochastic version of the proposed algorithm are tested with three-ray multi-path channels in simulation studies, and their performances are compared with a method based on conventional second-order cumulants. Relatively good results are achieved, even when the transmitted symbols are significantly corrupted with Gaussian noise.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.768-770
• /
• 2013

We propose a symmetric key based cryptography algorithm to encode and decode the text data with limited length using 3-dimensional magic square matrix. To encode the plain text message, input text will be translated into an index of the number stored in the key matrix. Then, Caesar's shift with pre-defined constant value is fabricated to finalize an encryption algorithm. In decode process, Caesar's shift is applied first, and the generated key matrix is used with 2D magic squares to replace the index numbers in ciphertext to restore an original text.

• Journal of the Korea Safety Management & Science
• /
• v.22 no.4
• /
• pp.45-52
• /
• 2020

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Network(SCN). One of keys issues in the current SCN research area involves minimizing both production and distribution costs. This study deals with finding an optimal solution for minimizing the total cost of production and distribution problems in supply chain network. First, we presented an integrated mathematical model that satisfies the minimum cost in the supply chain. To solve the presented mathematical model, we used a genetic algorithm with an excellent searching ability for complicated solution space. To represent the given model effectively, the matrix based real-number coding schema is used. The difference rate of the objective function value for the termination condition is applied. Computational experimental results show that the real size problems we encountered can be solved within a reasonable time.