• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.51 no.2
• /
• pp.55-59
• /
• 2002

Parallel processing is able to be used effectively on computationally intense power system problems. But this technology is not still available is not only parallel computer but also parallel processing scheme. Testing these algorithms to ensure accuracy, and evaluation of their performance is also an issue. Although a significant amount of parallel algorithms of power system problem have been developed in last decade, actual testing on parallel computer architectures lies in the beginning stages because no clear cut paths. This paper presents Jacobian modeling method to supply the base being able to treat power flow by newton's method by the computer. This method is to assign and to compute teared blocks of sparse matrix at each parallel processors. The testing to insure accuracy of developed method have been done on serial computer by trying to simulate a parallel environment.

• Proceedings of the KIEE Conference
• /
• 2001.07e
• /
• pp.134-140
• /
• 2001

Parallel processing has the potential to be cost effectively used on computationally intense power system problems. But this technology is not still available is not only parallel computer but also parallel processing scheme. Testing these algorithms to ensure accuracy, and evaluation of their performance is also an issue. Although a significant amount of parallel algorithms of power system problem have been developed in last decade, actual testing on processor architectures lies in the beginning stages. This paper presents the parallel processing algorithm to supply the base being able to treat power flow by newton's method by the distributed memory type parallel computer. This method is to assign and to compute teared blocks of sparse matrix at each parallel processors. The testing to insure accuracy of developed method have been done on serial computer by trying to simulate a parallel environment.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.135-141
• /
• 2019

Collaborative filtering algorithms often encounter data sparsity issues. To overcome this issue, auxiliary information of relevant items is analyzed and an item attribute matrix is derived. In this study, we combine the user-item attribute preference with the traditional similarity calculation method to develop an improved similarity calculation approach and use weights to control the importance of these two elements. A collaborative filtering algorithm based on user-item attribute preference is proposed. The experimental results show that the performance of the recommender system is the most optimal when the weight of traditional similarity is equal to that of user-item attribute preference similarity. Although the rating-matrix is sparse, better recommendation results can be obtained by adding a suitable proportion of user-item attribute preference similarity. Moreover, the mean absolute error of the proposed approach is less than that of two traditional collaborative filtering algorithms.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.910-918
• /
• 2016

A tensor is a multi-dimensional array that represents many data such as (user, user, time) in the social network system. A tensor generator is an important tool for multi-dimensional data mining research with various applications including simulation, multi-dimensional data modeling/understanding, and sampling/extrapolation. However, existing tensor generators cannot generate sparse tensors like real-world tensors that obey power law. In addition, they have limitations such as tensor sizes that can be processed and additional time required to upload generated tensor to distributed systems for further analysis. In this study, we propose TeT, a distributed tera-scale tensor generator to solve these problems. TeT generates sparse random tensor as well as sparse R-MAT and Kronecker tensor without any limitation on tensor sizes. In addition, a TeT-generated tensor is immediately ready for further tensor analysis on the same distributed system. The careful design of TeT facilitates nearly linear scalability on the number of machines.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7C
• /
• pp.554-564
• /
• 2012

The vehicle recognition consists of two steps; the vehicle region detection step and the vehicle identification step based on the feature extracted from the detected region. Features using linear transformations have the effect of dimension reduction as well as represent statistical characteristics, and show the robustness in translation and rotation of objects. Among the linear transformations, the NMF(Non-negative Matrix Factorization) is one of part-based representation. Therefore, we can extract NMF features with sparsity and improve the vehicle recognition rate by the representation of local features of a car as a basis vector. In this paper, we propose a feature extraction using NMF suitable for the vehicle recognition, and verify the recognition rate with it. Also, we compared the vehicle recognition rate for the occluded area using the SNMF(sparse NMF) which has basis vectors with constraint and LVQ2 neural network. We showed that the feature through the proposed NMF is robust in the urban scene where occlusions are frequently occur.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.274-279
• /
• 2021

Since conventional massive antenna systems require too many RF chains, they have disadvantages of high implementation cost and complexity. To overcome this problem, hybrid precoding schemes have been proposed. But, they are still of high implementation cost and complexity because RF chains are connected to all antenna elements. In this paper, we consider massive MIMO systems with overlapped sub-array (OSA) structure and then, propose a hybrid precoding scheme. In the overlapped subarray structure, RF analog precoding matrix has a sparse structure where many elements of RF analog precoding matrix are zeros. Using this sparse property, we propose a GTP-based precoder design method for RF and baseband digital precoding. Through simulation, we show that the proposed scheme has more than 85% of the spectral efficiency of the fully-connected structure while having 20~30% of complexity of it.

• Quantitative Bio-Science
• /
• v.37 no.2
• /
• pp.133-141
• /
• 2018

Graphical lasso is one of the most popular methods to estimate a sparse precision matrix, which is an inverse of a covariance matrix. The objective function of graphical lasso imposes an ${\ell}_1$-penalty on the (vectorized) precision matrix, where a tuning parameter controls the strength of the penalization. The selection of the tuning parameter is practically and theoretically important since the performance of the estimation depends on an appropriate choice of tuning parameter. While information criteria (e.g. AIC, BIC, or extended BIC) have been widely used, they require an asymptotically unbiased estimator to select optimal tuning parameter. Thus, the biasedness of the ${\ell}_1$-regularized estimate in the graphical lasso may lead to a suboptimal tuning. In this paper, we propose a two-staged bias-correction procedure for the graphical lasso, where the first stage runs the usual graphical lasso and the second stage reruns the procedure with an additional constraint that zero estimates at the first stage remain zero. Our simulation and real data example show that the proposed bias correction improved on both edge recovery and estimation error compared to the single-staged graphical lasso.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1
• /
• pp.13-20
• /
• 2001

Adaptive digital filters with long impulse response such as acoustic echo canceller and active noise controller suffer from slow convergence and computational burden. Subband techniques and multirate signal processing have been recently developed to improve the problem of computational complexity and slow convergence in conventional adaptive filter. Any FIR transfer function can be realized as a serial connection of interpolators followed by subfilters with a sparse impulse response. In this case, each interpolator which is related to the column vector of Hadamard matrix has band-pass magnitude response characteristics shifted uniformly. Subband technique using Hadamard transform and decimation of subband signal to reduce sampling rate are adapted to system modeling and acoustic noise cancellation In this paper, delayless subband structure with nonuniform bandwidth has been proposed to improve the performance of the convergence speed without aliasing due to decimation, where input signal is split into subband one using tree-structured filter bank, and the subband signal is decimated by a decimator to reduce the sampling rate in each channel, then subfilter with sparse impulse response is transformed to full band adaptive filter coefficient using Hadamard transform. It is shown by computer simulations that the proposed method can be adapted to general adaptive filtering.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.10a
• /
• pp.113-116
• /
• 2001

Finite element analysis programs have been for metal forming process design They will become more and more important in understanding forming process For large-scale forging analysis problems, the performance of a linear equation solver is very important for the overall efficiency of the analysis code. With problem size increased, the computation time needs to be reduced, which is spent on setting the system of algebraic equations associated with finite element model Many matrix solvers have been developed and used usefully in finite element program for this purpose.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.246-248
• /
• 2019

In the ongoing standardization of Versatile Video Coding (VVC), DCT-2, DST-7 and DCT-8 are accounted as the vital transform kernels. While storing all of those transform kernels, ROM memory storage is considered as the major problem. So, to deal with this scenario, a common sparse unified matrix concept is introduced in this paper. From the proposed matrix, any point transform kernels (DCT-2, DST-7, DCT-8, DST-4 and DCT-4) can be achieved after some mathematical computation. DCT-2, DST-7 and DCT-8 are the used major transform kernel in this paper.