• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.1-9
• /
• 1988

The purpose of this paper is study the sensitivity analysis of matrix game. Teh sensitivity analysis of matrix is classified into two types. Type one is to find the characteristic region of an element of the pay off matrix in which the value of the current optimal strategy remains as an optimum. Type two is to find that in which the basis of the current optimal strategy does not change. This paper shows the characteristic regions of basic and nonbasic strategies. Further it is found that the characteristic regions of type one and two are same in the case that the element is that of at least one player's nonbasic strategy.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.209-211
• /
• 2007

The computational time of Stocahstic Diagonalization (SD) calculation for 2-dimensional interacting fermion systems is reduced by using several methods including symmetry operations. First, each lattice is subdivided into spin-up and spin-down lattices separately, thus allowing a bi-partite lattice. A valid basis state is then obtained from stacking up an up-spin configuration on top of a down-spin configuration. As a consequence, the memory space to be used in saving the trial basis state reduces significantly. Secondly, the matrix elements of a Hamiltonianin are reconrded in a look-up table when making basis state set. Thus the repeated calculation of the matrix elements of the Hamiltonian are avoided during SD process. Thirdly, by applying symmetry operations to the basis state set the original basis state is transformed to a new basis state whose elements are the eigenvectors of the symmetry operations. The ground state wavefunction is constructed from the elements of symmetric - bonding state - basis state set. As a result, the total number of basis states involved in SD calculation is reduced upto 50 percentage by using symmetry operations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.167-173
• /
• 2016

Compressed Sensing(CS) is the theory that can recover signals which are sampled below the Nyquist sampling rate to original analog signals. In this paper, we propose the estimation algorithm of ultrasonic attenuation coefficients in the frequency domain using CS. While most estimation algorithms transform the time-domain signals into the frequency-domain using the Fourier transform, the proposed method directly utilize the spectral information in the recovery process by the basis matrix without the completely recovered signals in the time domain. We apply three transform bases for sparsifying and estimate the attenuation coefficients using the Centroid Downshift method with Dual-reference diffraction compensation technique. The estimation accuracy and execution time are compared for each basis matrix. Computer simulation results show that the DCT basis matrix exhibits less than 0.35% estimation error for the compressive ratio of 50% and about 6% average error for the compressive ratio of 70%. The proposed method which directly extracts frequency information from the CS signals can be extended to estimating for other ultrasonic parameters in the Quantitative Ultrasound (QUS) Analysis.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.159-165
• /
• 2005

This paper designs observers for matrix second-order linear systems on the basis of generalized eigenstructure assignment via unified parametric approach. It is shown that the problem is closely related with a type of so-called generalized matrix second-order Sylvester matrix equations. Through establishing two general parametric solutions to this type of matrix equations, two unified complete parametric methods for the proposed observer design problem are presented. Both methods give simple complete parametric expressions for the observer gain matrices. The first one mainly depends on a series of singular value decompositions, and is thus numerically simple and reliable; the second one utilizes the right factorization of the system, and allows eigenvalues of the error system to be set undetermined and sought via certain optimization procedures. A spring-mass system is utilized to show the effect of the proposed approaches.

• Journal of Communications and Networks
• /
• v.12 no.6
• /
• pp.624-631
• /
• 2010

Effective traffic matrix estimation is the basis of efficient traffic engineering, and therefore, quality of service provision support in IP networks. In this study, traffic matrix estimation is investigated in IP networks and an Elman neural network-based traffic matrix inference (ENNTMI) method is proposed. In ENNTMI, the conventional Elman neural network is modified to capture the spatio-temporal correlations and the time-varying property, and certain side information is introduced to help estimate traffic matrix in a network accurately. The regular parameter is further introduced into the optimal equation. Thus, the highly ill-posed nature of traffic matrix estimation is overcome effectively and efficiently.

• Textile Coloration and Finishing
• /
• v.18 no.5 s.90
• /
• pp.88-93
• /
• 2006

A data compression system has been developed by combining adaptive wavelets and optimization technique. The adaptive wavelets were made by optimizing the coefficients of the wavelet matrix. The optimization procedure has been performed by criteria of minimizing the reconstruction error. The resulting adaptive basis outperformed such conventional basis as Daubechies-5 by 5-10%. It was also shown that the yarn density profiles could be compressed by over 95% without a significant loss of information.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1145-1148
• /
• 2003

We show the mixed finite element method which induces solutions that has the same order of errors for both the gradient of the solution and the solution itself. The technique to construct an efficient reusable matrix is suggested. Two families of mixed finite element methods are introduced with an automatic generating technique for matrix with my order of basis. The generated matrix by this technique has more accurate values and is a sparse matrix. This new technique is applied to solve a minimal surface problem.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.53 no.10
• /
• pp.539-545
• /
• 2004

In this paper, we consider the problem of capacitance matrix calculation for strip-line and other interconnects crossings. The problem is formulated in the spectral domain using the method of moments. Sinc-functions are employed as basis functions. Conventionally, such a formulation leads to a large, non-sparse system of linear equations in which the calculation of each of the coefficient requires the evaluation of a Fourier-Bessel integral. Such calculations are computationally very intensive. In the method proposed here, we provide simplified expressions for the coefficients in the moment method matrix. Using these simplified expressions, the coefficients can be calculated very efficiently. This leads to a fast evaluation of the capacitance matrix of the structure. Computer simulations are provided illustrating the validity of the method proposed.

• Journal of Environmental Impact Assessment
• /
• v.12 no.3
• /
• pp.151-160
• /
• 2003

Analysis of carrying capacity and site suitability by the systematic application of environmental information an provide a basis for implementing environmentally sensitive and sustainable resource development policies. Based on the availability of public services and environmental and site-specific constraints, a Rural Residential Density Matrix was applied in Santa Cruz County, California, USA to assess the development potential of rural land parcels since 1980. In one case, the Matrix was applied to calculate the allowable development density on a site in Lompico planned for use as a Buddhist retreat center. These calculations revealed higher environmental sensitivity and lower carrying capacity than projected in the proposed plan. Under the constraints of the county's minimum acreage policies and insufficient developable land, the developer cancelled the proposed plan. This example suggests that application of the Matrix at the concept development stage would increase the effectiveness of the prior environmental review and environmental impact assessment (EIA) system in Korea.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.9
• /
• pp.827-833
• /
• 2013

In this paper, an efficient computational method is presented for state space analysis of bilinear systems via Legendre wavelets. The differential matrix equation is converted to a generalized Sylvester matrix equation by using Legendre wavelets as a basis. First, an explicit expression for the inverse of the integral operational matrix of the Legendre wavelets is presented. Then using it, we propose a preorder traversal algorithm to solve the generalized Sylvester matrix equation, which greatly reduces the computation time. Finally the efficiency of the proposed method is discussed using numerical examples.