• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.9-16
• /
• 2012

In this paper, we propose the two dimensional variable-length vector storage format which can be used for efficient storage of sparse matrix in the FEM (finite element method). The proposed storage format is the method storing only actual needed non-zero values of each row on upper triangular matrix with the total rows N, by using two dimensional variable-length vector instead of $N{\times}N$ large sparse matrix of entire equation of finite elements. This method only needs storage spaces of the number of minimum 1 to maximum 5 in 2D grid structure and the number of minimum 1 to maximum 14 in 3D grid structure of analysis target. The number doesn't excess two times although involving index number. From the experimental result, we can find out that the proposed storage format can reduce the memory space more effectively, as the total number of nodes increases, than the existing skyline storage format storing maximum column height.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.55-65
• /
• 1995

Existing multiple-row downdating algorithms have adopted a CFD(Cholesky Factor Downdating) that recursively downdates one row at a time. The CFD based algorithm requires 5/2p $n^{2}$ flops(floating point operations) downdating a p$\times$n observation matrix $Z^{T}$ . On the other hands, a HCFD(Hybrid CFD) based algorithm we propose in this paper, requires p $n^{2}$＋6/5 $n^{3}$ flops v hen p$\geq$n. Such a HCFD based algorithm factorizes $Z^{T}$ at first, such that $Z^{T}$ = $Q_{z}$ RT/Z, and then applies the CFD onto the upper triangular matrix Rt/z, so that the total number of floating point operations for downdating $Z^{T}$ would be significantly reduced compared with that of the CFD based algorithm. Benchmark tests on the Sun SPARC/2 and the Tolerant System also show that performance of the HCFD based algorithm is superior to that of the CFD based algorithm, especially when the number of rows of the observation matrix is large.rge.

• Journal of the Korean Mathematical Society
• /
• v.47 no.3
• /
• pp.455-466
• /
• 2010

For an endomorphism $\alpha$ of a ring R, we introduce the weak $\alpha$-skew Armendariz rings which are a generalization of the $\alpha$-skew Armendariz rings and the weak Armendariz rings, and investigate their properties. Moreover, we prove that a ring R is weak $\alpha$-skew Armendariz if and only if for any n, the $n\;{\times}\;n$ upper triangular matrix ring $T_n(R)$ is weak $\bar{\alpha}$-skew Armendariz, where $\bar{\alpha}\;:\;T_n(R)\;{\rightarrow}\;T_n(R)$ is an extension of $\alpha$ If R is reversible and $\alpha$ satisfies the condition that ab = 0 implies $a{\alpha}(b)=0$ for any a, b $\in$ R, then the ring R[x]/($x^n$) is weak $\bar{\alpha}$-skew Armendariz, where ($x^n$) is an ideal generated by $x^n$, n is a positive integer and $\bar{\alpha}\;:\;R[x]/(x^n)\;{\rightarrow}\;R[x]/(x^n)$ is an extension of $\alpha$. If $\alpha$ also satisfies the condition that ${\alpha}^t\;=\;1$ for some positive integer t, the ring R[x] (resp, R[x; $\alpha$) is weak $\bar{\alpha}$-skew (resp, weak) Armendariz, where $\bar{\alpha}\;:\;R[x]\;{\rightarrow}\;R[x]$ is an extension of $\alpha$.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.765-778
• /
• 2016

In watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into $4{\times}4$ non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11A
• /
• pp.1244-1252
• /
• 2004

In this paper, we derive some properties of linear detectors (zero forcing or minimum mean square error) at spatial multiplexing systems with alamouti's space-time block code. Based on the derived properies, this paper proposes low-complexity receivers. Implementing MMSE detector adaptively, the number of weight vectors to be calculated and updated is greatly reduced with the derived properties compared to the conventional methods. In the case of recursive least square algorithm, with the proposed approach computational complexity is reduced to less than the half. We also identify that sorted QR decomposition detector, which reduces the complexity of V-Blast detector, has the same properties for unitary matrix Q and upper triangular matrix R. A complexity reduction of about 50%, for sorted QR decomposition detector, can be achieved by using those properties without the loss of performance.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.529-545
• /
• 2022

This article concerns a ring property that arises from combining one-sided duo factor rings and centers. A ring R is called right CIFD if R/I is right duo by some proper ideal I of R such that I is contained in the center of R. We first see that this property is seated between right duo and right π-duo, and not left-right symmetric. We prove, for a right CIFD ring R, that W(R) coincides with the set of all nilpotent elements of R; that R/P is a right duo domain for every minimal prime ideal P of R; that R/W(R) is strongly right bounded; and that every prime ideal of R is maximal if and only if R/W(R) is strongly regular, where W(R) is the Wedderburn radical of R. It is also proved that a ring R is commutative if and only if D₃(R) is right CIFD, where D₃(R) is the ring of 3 by 3 upper triangular matrices over R whose diagonals are equal. Furthermore, we show that the right CIFD property does not pass to polynomial rings, and that the polynomial ring over a ring R is right CIFD if and only if R/I is commutative by a proper ideal I of R contained in the center of R.