• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.265-271
• /
• 2004

The interaction network of protein -protein plays an important role to understand the various biological functions of cells. Currently, the high -throughput experimental techniques (two -dimensional gel electrophoresis, mass spectroscopy, yeast two -hybrid assay) provide us with the vast amount of data for protein-protein interaction at the proteome scale. In order to recognize the role of each protein in their network, the efficient bioinformatical and computational analysis methods are required. We propose a systematic and mathematical method which can analyze the protein -protein interaction network rigorously and enable us to capture the biological and physical essence of a topological character and stability of protein -protein network, and sensitivity of each protein along the biological pathway of their network. We set up a Laplacian matrix of spectral graph theory based on the protein-protein network of yeast proteome, and perform an eigenvalue analysis and apply a perturbation method on a Laplacian matrix, which result in recognizing the center of protein cluster, the identity of hub proteins around it and their relative sensitivities. Identifying the topology of protein -protein network via a Laplacian matrix, we can recognize the important relation between the biological pathway of yeast proteome and the formalism of master equation. The results of our systematic and mathematical analysis agree well with the experimental findings of yeast proteome. The biological function and meaning of each protein cluster can be explained easily. Our rigorous analysis method is robust for understanding various kinds of networks whether they are biological, social, economical...etc

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.450-457
• /
• 2012

For orthogonal frequency-division multiplexing (OFDM) systems, we propose a blind channel estimation scheme based on non-redundant precoding. In the proposed scheme, a modified covariance matrix is first obtained by dividing the covariance matrix of the received signal vector by the precoding matrix element-by-element. Then, the channel vector is estimated as an eigenvector corresponding to the largest eigenvalue of the modified covariance matrix. The eigenvector can be obtained by power method with low computational complexity instead of the complicated eigenvalue decomposition. We analytically derive a mean square error (MSE) of the proposed channel estimation scheme and show that the analysis result coincides well with the simulation result. Also, simulation results show that the proposed scheme has better MSE and bit error rate (BER) performance than conventional channel estimation schemes.

• Computational Structural Engineering
• /
• v.11 no.1
• /
• pp.205-216
• /
• 1998

A solution method is presented to solve the eigenvalue problem arising in the dynamic analysis of nonclassicary damped structural systems with multiple eigenvalues. The proposed method is obtained by applying the modified Newton-Raphson technique and the orthonormal condition of the eigenvectors to the linear eigenproblem through matrix augmentation of the quadratic eigenvalue problem. In the iteration methods such as the inverse iteration method and the subspace iteration method, singularity may be occurred during the factorizing process when the shift value is close to an eigenvalue of the system. However, even though the shift value is an eigenvalue of the system, the proposed method provides nonsingularity, and that is analytically proved. Since the modified Newton-Raphson technique is adopted to the proposed method, initial values are need. Because the Lanczos method effectively produces better initial values than other methods, the results of the Lanczos method are taken as the initial values of the proposed method. Two numerical examples are presented to demonstrate the effectiveness of the proposed method and the results are compared with those of the well-known subspace iteration method and the Lanczos method.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.588-591
• /
• 2003

This paper presents a new short-term load forecasting system using data mining. Since the electric load has very different pattern according to the day, it definitely gives rise to the forecasting error if only one forecasting model is used. Thus, to resolve this problem, the fuzzy model-based classifier and predictor are proposed for the forecasting of the hourly electric load. The proposed classifier is the multi-input and multi-output fuzzy system of which the consequent part is composed of the Bayesian classifier. The proposed classifier attempts to categorize the input electric load into Monday, Tuesday$\sim$Friday, Saturday, and Sunday electric load, Then, we construct the Takagi-Sugeno (T-S) fuzzy model-based predictor for each class. The parameter identification problem is converted into the generalized eigenvalue problem (GEVP) by formulating the linear matrix inequalities (LMIs). Finally, to show the feasibility of the proposed method, this paper provides the short-term load forecasting example.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.5
• /
• pp.1033-1039
• /
• 2012

In this paper, a simple and robust algorithm is proposed for detecting each steel plate from a image which contains several steel plates. Steel plate is characterized by line edge, so line detection is a fundamental task for analyzing and understanding of steel plate images. To detect the line edge, the proposed algorithm uses the small eigenvalue analysis. The proposed approach scans an input edge image from the top left corner to the bottom right corner with a moving mask. A covariance matrix of a set of edge pixels over a connected region within the mask is determined and then the statistical and geometrical properties of the small eigenvalue of the matrix are explored for the purpose of straight line detection. Using the detected line edges, each plate is determined based on the directional information and the distance information of the line edges. The results of the experiments emphasize that the proposed algorithm detects each steel plate from a image effectively.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.305-316
• /
• 2003

Recently, an iterative algorithm for finding the interior eigenvalues of a definite matrix by CG-type method has been proposed. This method compares to the inverse power method. The given matrices A, and B are assumed to be large and sparse, and SPD( Symmetric Positive Definite) The CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for smallest eigenvalue. Also, it is very amenable to parallel computations, like the CG method for the linear systems. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. But for parallel computations we need to find an efficient parallel preconditioner. Our candidates we ILU(0) in the wave-front order, ILU(0) in the multi-coloring order, Point-SSOR(Symmetric Successive Overrelaxation), and Multi-Color Block SSOR preconditioner. Wavefront order is a simple way to increase parallelism in the natural order, and Multi-coloring realizes a parallelism of order(N), where N is the order of the matrix. Another choice is the Multi-Color Block SSOR(Symmetric Successive OverRelaxation) preconditioning. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test problem was drawn from the discretizations of partial differential equations by finite difference methods. The results show that for small number of processors Multi-Color ILU(0) has the best performance, while for large number of processors Multi-Color Block SSOR performs the best.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.776-784
• /
• 2008

In this paper, new upper matrix bounds for the solution of the continuous algebraic Riccati equation (CARE) are derived. Following the derivation of each bound, iterative algorithms are developed for obtaining sharper solution estimates. These bounds improve the restriction of the results proposed in a previous paper, and are more general. The proposed bounds are always calculated if the stabilizing solution of the CARE exists. Finally, numerical examples are given to demonstrate the effectiveness of the present schemes.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.342-344
• /
• 2004

In conventional small signal stability analysis, system is assumed to be invariant and the state space equations are used to calculate the eigenvalues of state matrix. However, when a system contains switching elements such as FACTS devices, it becomes non-continuous system. In this case, a mathematically rigorous approach to system small signal stability analysis is by means of eigenvalue analysis of the system periodic transition matrix based on discrete system analysis method. In this research, RCF(Resistive Companion Form) method is used to analyse small signal stability of a non-continuous system including switching elements'. Applying the RCF method to the differential and integral equations of power system, generator, controllers and FACTS devices including switching elements should be modeled in the form of state transition matrix. From this state transition matrix eigenvalues which are mapped to unit circle can be calculated.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.2
• /
• pp.78-82
• /
• 1995

In this paper, we consider the robustness analysis problem in state space models with linear time invariant perturbations. Based upon the discrete-time Lyapunov approach, sufficient conditions are derived for the eigenvalues of perturbed matrix to be located in a circle, and robustness bounds on perturbations are obtained. Spaecially, for the case of a diagonalizable hermitian matrix the bound is given in terms of the nominal matrix without the solution of Lyapunov equation. This robustness analysis takes account not only of stability robustness but also of certain types of performance robustness. For two perturbation classes resulting bounds are shown to be improved over the existing ones. Examples given include comparison of the proposed analysis method with existing 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.