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

An open problem proposed by Safavi-Naini and Seberry in IEEE transactions on information theory(1991) can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Naini-Seberry's open problem by considering a certain class of binary matrices. Thus a subliminal channel of r 〉 1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.

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

Results on the analytic behavior of the limiting spectral distribution of large dimensional random matrices, studied in Marcenko and Pastur [2], are derived. Using the Stieltjes transform, it is shown that the limiting distribution has a continuous derivative away from zero, the derivative being analytic whenever it is positive [3]. In the present paper, it is derived that the behavior of it resembles the behavior of a square root function near the boundary of its support.

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

We develop in this paper some preconditioners for sparse non-symmetric M-matrices, which combine a recursive two-level block I LU factorization with multigrid method, we compare these preconditioners on matrices arising from discretized convection-diffusion equations using up-wind finite difference schemes and multigrid orderings, some comparison theorems and experiment results are demonstrated.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.673-683
• /
• 2009

We point out: to make Hermtian matrices A and B satisfy Styan matrix inequality, the condition "positive definite property" demanded in the present literatures is not necessary. Furthermore, on the premise of abandoning positive definite property, we derive Styan matrix inequality of Hadamard product for inverse Hermitian matrices and the sufficient and necessary conditions that the equation holds in our paper.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.8
• /
• pp.384-391
• /
• 2001

This paper considers the problem of identifying the time-varying parameters of Bilinear systems. The Parameters, in this paper, are identified by using the EBPOMs(Extended Block Pulse Operational Matrices) which can reduce the burden of operation and the volume of error caused by matrices multiplication.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.55-64
• /
• 2000

We propose a criterion for testing homogeneity of matrix intraclass covariance matrices of K multivariate normal populations, It is based on a variable transformation intended to propose and develop a likelihood ratio criterion that makes use of properties of eigen structures of the matrix intraclass covariance matrices. The criterion then leads to a simple test that uses an asymptotic distribution obtained from Box's (1949) theorem for the general asymptotic expansion of random variables.

• The Pure and Applied Mathematics
• /
• v.8 no.1
• /
• pp.25-32
• /
• 2001

Let A be a nonnegative matrix of size $n \times n$. A is said to be nearly convertible if A(i│j) is convertible for all integers i, j$\in${1,2,…, n} where A(i│j) denote the submatrix obtained from A by deleting the i-th row and the j-th col-umn. We investigate some properties of nearly convertible matrices and existence of (maximal)nearly convertible matrices of size n is proved for any integers $n(\geq 3)$.

• Honam Mathematical Journal
• /
• v.26 no.3
• /
• pp.341-353
• /
• 2004

We denote by ${{\mathcal{Q}}(A)}$ the set of all matrices with the same sign pattern as A. A matrix A has signed null-space provided there exists a set ${\mathcal{S}}$ of sign patterns such that the set of sign patterns of vectors in the null-space of ${\tilde{A}}$ is ${\mathcal{S}}$, for each ${\tilde{A}}{\in}{{\mathcal{Q}}(A)}$. Some properties of matrices with signed null-spaces are investigated.

• Honam Mathematical Journal
• /
• v.29 no.3
• /
• pp.427-443
• /
• 2007

The spanning column rank of an $m{\times}n$ integer matrix A is the minimum number of the columns of A that span its column space. We compare the spanning column rank with column rank of matrices over the ring of integers. We also characterize the linear operators that preserve the spanning column rank of integer matrices.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.125-128
• /
• 2002

This paper propose a rectification technique by applying the Projection matrices derived from perspective projection matrices estimated from self-calibrated stereo image pairs. The derivation is made such that two epipolar lines are in parallel. Rectified images are generated by reprojecting corresponding image points. For the performance analysis of this technique, vertical coordinates of rectified points are compare to those obtained by the technique[3].