• Journal of Power Electronics
• /
• v.16 no.1
• /
• pp.57-65
• /
• 2016

Reverse matrix converters, which can step up voltages, are suitable for applications with source voltages that are lower than load voltages, such as generator systems. Reverse matrix converter topologies are advantageous because they do not require additional components to conventional matrix converters. In this paper, a detection method and a post-fault modulation strategy to operate a converter as close as possible to its desired normal operation under the open-switch fault condition in the rectifier stage are proposed. An open-switch fault in the rectifier stage of a reverse matrix converter causes current distortions and voltage ripples in the system. Therefore, fault-tolerant control for open-switch faults is required to improve the reliability of a system. The proposed strategy determines the appropriate switching stages from among the remaining healthy switches of the converter. This is done based on reference currents or voltages. The performance of the proposed strategy is experimentally verified.

• Communications for Statistical Applications and Methods
• /
• v.24 no.1
• /
• pp.81-96
• /
• 2017

Cumulative logit random effects models are typically used to analyze longitudinal ordinal data. The random effects covariance matrix is used in the models to demonstrate both subject-specific and time variations. The covariance matrix may also be homogeneous; however, the structure of the covariance matrix is assumed to be homoscedastic and restricted because the matrix is high-dimensional and should be positive definite. To satisfy these restrictions two Cholesky decomposition methods were proposed in linear (mixed) models for the random effects precision matrix and the random effects covariance matrix, respectively: modified Cholesky and moving average Cholesky decompositions. In this paper, we use these two methods to model the random effects precision matrix and the random effects covariance matrix in cumulative logit random effects models for longitudinal ordinal data. The methods are illustrated by a lung cancer data set.

• Korean Journal of Materials Research
• /
• v.25 no.8
• /
• pp.365-369
• /
• 2015

This paper investigates the dependency of the critical content for electrical conductivity of carbon powder-filled polymer matrix composites with different matrixes as a function of the carbon powder content (volume fraction) to find the break point of the relationships between the carbon powder content and the electrical conductivity. The electrical conductivity jumps by as much as ten orders of magnitude at the break point. The critical carbon powder content corresponding to the break point in electrical conductivity varies according to the matrix species and tends to increase with an increase in the surface tension of the matrix. In order to explain the dependency of the critical carbon content on the matrix species, a simple equation (${V_c}^*=[1+ 3({{\gamma}_c}^{1/2}-{{\gamma}_m}^{1/2})^2/({\Delta}q_cR]^{-1}$) was derived under some assumptions, the most important of which was that when the interfacial excess energy introduced by particles of carbon powder into the matrix reaches a universal value (${\Delta}q_c$), the particles of carbon powder begin to coagulate so as to avoid any further increase in the energy and to form networks that facilitate electrical conduction. The equation well explains the dependency through surface tension, surface tensions between the particles of carbon powder.

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.17-27
• /
• 2007

Jacket matrices which are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^+=nI_n$ where $A^+$ is the transpose matrix of elements inverse of A,i.e., $A^+=(a_{kj}^-)$, was introduced by Lee in 1984 and are used for signal processing and coding theory, which generalized the Hadamard matrices and Center Weighted Hadamard matrices. In this paper, some properties and constructions of Jacket matrices are extensively investigated and small orders of Jacket matrices are characterized, also present the full rate and the 1/2 code rate complex orthogonal space time code with full diversity.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.55-68
• /
• 2008

One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form $P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_m$, where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ complex matrices. Newton's method was introduced a useful tool for solving the equation P(X)=0. Here, we suggest an improved approach to solve each Newton step and consider how to incorporate line searches into Newton's method for solving the matrix polynomial. Finally, we give some numerical experiment to show that line searches reduce the number of iterations for convergence.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2007

One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form G(X)=$A_0X^m+A_1X^{m-1}+{\cdots}+A_m$ where $A_0$, $A_1$, ${\cdots}$, $A_m$ and X are $n{\times}n$ real matrices. We show how the minimization methods can be used to solve the matrix polynomial G(X) and give some numerical experiments. We also compare Polak and Ribi$\acute{e}$re version and Fletcher and Reeves version of conjugate gradient method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.27-34
• /
• 2011

In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with ${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.

• Journal of the Korean Statistical Society
• /
• v.22 no.2
• /
• pp.249-258
• /
• 1993

It is well known that design matrix X for any factorial design can be represented by a product $X = TX_o$ where T is replication matrix and $X_o$ is the corresponding balanced design matrix. Since $X_o$ consists of regular arrangement of 0's and 1's, we can easily find the spectral decomposition of $X_o',X_o$. Also using this we propose an efficient algorithm for computing the orthogonal projection matrix for a balanced factorial design.

• Journal of the Korean Statistical Society
• /
• v.22 no.2
• /
• pp.339-345
• /
• 1993

It is well known that distribution of functions of eigen values and vectors of a certain matrix plays an important role in multivariate analysis. This paper deals with the transformation of a correlation-type random matrix to its eigen values and vectors. Properties of the transformation are also considered. The results obtained are applied to express the joint distribution of eigen values and vectors of the correlation matrix when sample is taken from a m-variate spherical distribution.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.207-220
• /
• 2004

Necessary and sufficient conditions are given for the regularity of block triangular fuzzy matrices. This leads to characterization of idem-potency of a class of triangular Toeplitz matrices. As an application, the existence of group inverse of a block triangular fuzzy matrix is discussed. Equivalent conditions for a regular block triangular fuzzy matrix to be expressed as a sum of regular block fuzzy matrices is derived. Further, fuzzy relational equations consistency is studied.