• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.227-247
• /
• 2018

For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

• Journal of Computing Science and Engineering
• /
• 제4권2호
• /
• pp.97-109
• /
• 2010

Nonnegative matrix factorization (NMF) is a popular method for multivariate analysis of nonnegative data, which is to decompose a data matrix into a product of two factor matrices with all entries restricted to be nonnegative. NMF was shown to be useful in a task of clustering (especially document clustering), but in some cases NMF produces the results inappropriate to the clustering problems. In this paper, we present an algorithm for orthogonal nonnegative matrix factorization, where an orthogonality constraint is imposed on the nonnegative decomposition of a term-document matrix. The result of orthogonal NMF can be clearly interpreted for the clustering problems, and also the performance of clustering is usually better than that of the NMF. We develop multiplicative updates directly from true gradient on Stiefel manifold, whereas existing algorithms consider additive orthogonality constraints. Experiments on several different document data sets show our orthogonal NMF algorithms perform better in a task of clustering, compared to the standard NMF and an existing orthogonal NMF.

• 한국통신학회논문지
• /
• 제36권8A호
• /
• pp.741-747
• /
• 2011

잘 알려진 매트릭스 팬슬 방법은 정적이지 않은 환경 및 주파수가 같은 다중경로 신호가 존재 할때도 동작하는 입사각 추정방식이다. 매트릭스 팬슬방식은 기존의 공분산행렬을 사용한 방식보다 더 좋은 분해능을 보여 줄뿐 아니라 계산량의 측면에서도 매우 효과적이다. 본 논문에서는 매트릭스 팬슬 방식의 계산 과정에서 발생되는 데이터의 가중치가 균형이 맞지 않음으로써 생기는 영향에 관해 기술한다. 데이터의 균형이 맞는 새로운 방식의 매트릭스 팬슬 방식을 제안하고 데이터의 불균형을 해소할 수 있음을 보여주었다.

• 한국콘텐츠학회논문지
• /
• 제8권1호
• /
• pp.68-74
• /
• 2008

데이터베이스로부터 지식을 발견하고 이를 연구기획자, 정책의사결정자들이 활용하는 움직임이 전세계적으로 활발해지고 있다. 이러한 연구분야 중 대표적인 것이 계량정보학이고 이 분야를 지원하기 위해서 주로 선진국을 중심으로 분석시스템이 개발되고 있다. 그러나 외국의 분석시스템은 실제 수요자의 요구를 충분히 반영하지 못하고 있고, 고가이면서 한글이 지원되지 않아 국내 연구기획자가 사용하기에 어려운 점이 있다. 따라서 한국과학기술정보연구원에서는 이러한 단점을 극복하기 위해서 계량정보분석시스템 KnowledgeMatrix를 개발하였다. KnowledgeMatrix는 논문 및 특허의 서지정보를 분석하여 지식을 발견하기 위한 목적으로 설계된 독립형(stand-alone) 시스템이다 KnowledgeMatrix의 주요 구성을 살펴보면 행렬 생성, 클러스터링, 시각화, 데이터 전처리로 요약된다. 본 논문에서 소개하고 있는 KnowledgeMatrix는 외국의 대표적인 정보분석시스템과 비교했을 때 다양한 기능을 제공하고 있고 특히 영문데이터 처리 이외에 한글데이터 처리가 가능하다는 장점을 갖고 있다.

• Journal of the Korean Data and Information Science Society
• /
• 제14권4호
• /
• pp.965-974
• /
• 2003

In this paper we propose an incremental classification of multi-class data set by LS-SVM. By encoding the output variable in the training data set appropriately, we obtain a new specific output vectors for the training data sets. Then, online LS-SVM is applied on each newly encoded output vectors. Proposed method will enable the computation cost to be reduced and the training to be performed incrementally. With the incremental formulation of an inverse matrix, the current information and new input data are used for building another new inverse matrix for the estimation of the optimal bias and lagrange multipliers. Computational difficulties of large scale matrix inversion can be avoided. Performance of proposed method are shown via numerical studies and compared with artificial neural network.

• 지구물리와물리탐사
• /
• 제8권2호
• /
• pp.129-136
• /
• 2005

감쇠최소자승법은 각종 물리탐사 자료에 가장 널리 사용되는 역산법이다. 일반적으로 최소자승법에서 최소화되는 목적함수는 자료오차(data misfit)와 모델제한자의 합으로 주어진다. 따라서 역산에서 자료오차와 모델제한자는 함께 중요한 역할을 담당한다. 하지만 역산에 관한 대부분의 연구는 주로 모델제한자의 설정방법과 적절한 라그랑지 곱수의 선정방법에 치중되어 왔다. 일반적으로 자료획득시 자료가 갖는 표준편차를 자료가중값의 계산에 사용하는 것이 추천되고 있지만, 실제 현장조사에서는 자료의 표준편차는 좀처럼 측정되지 않으며, 대부분의 역산에서 자료가중행렬은 어쩔 수 없이 단위행렬로 간주된다. 본 논문에서는 자료분해능행렬과 그 분산함수를 분석하여 자동적으로 계산된 자료가중행렬을 사용하는 역산법을 개발하였다. EACB법이라 명명한 이 역산법에서는 분해능이 높은 자료에는 높은 가중값을, 작은 자료에는 작은 가중값을 부여한다. 개발된 EACB 역산법을 전기비저항 토모그피법에 적용한 결과, 보다 안정적이고 분해능이 향상된 결과를 얻을 수 있었다.

• Journal of the Korean Data and Information Science Society
• /
• 제7권1호
• /
• pp.79-85
• /
• 1996

This paper will show that the rank of the model matrix of a closed, n compartmental model with k sinks is n-k. This statement will be extended to include open compartmental models as a part of theorem.

• 대한수학회지
• /
• 제54권2호
• /
• pp.613-626
• /
• 2017

For the overdetermined linear system, when both the data matrix and the observed data are contaminated by noise, Total Least Squares method is an appropriate approach. Since an ill-conditioned data matrix with noise causes a large perturbation in the solution, some kind of regularization technique is required to filter out such noise. In this paper, we consider a Dual regularized Total Least Squares problem. Unlike the Tikhonov regularization which constrains the size of the solution, a Dual regularized Total Least Squares problem considers two constraints; one constrains the size of the error in the data matrix, the other constrains the size of the error in the observed data. Our method derives two nonlinear equations to construct the iterative method. However, since the Jacobian matrix of two nonlinear equations is not guaranteed to be nonsingular, we adopt a trust-region based iteration method to obtain the solution.

• Journal of the Korean Data and Information Science Society
• /
• 제27권3호
• /
• pp.815-825
• /
• 2016

Marginalized random effects models (MREMs) are often used to analyze longitudinal categorical data. The models permit direct estimation of marginal mean parameters and specify the serial correlation of longitudinal categorical data via the random effects. However, it is not easy to estimate the random effects covariance matrix in the MREMs because the matrix is high-dimensional and must be positive-definite. To solve these restrictions, we introduce two modeling approaches of the random effects covariance matrix: partial autocorrelation and the modified Cholesky decomposition. These proposed methods are illustrated with the real data from Korean genomic epidemiology study.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.144-146
• /
• 2006

The Data Matrix of two-dimensional bar codes is a new technology capable of holding relatively large amounts of data compared to the conventional one-dimensional bar code which is just a key that can access detailed information to the host computer database. A secret key is used to prevent a watermark from malicious attacks. We encoded copyright information into a Data Matrix bar code for encoding process and it was spread a pseudo random pattern using owner key. We embedded a randomized watermark into the image using watermark's embedding position, pattern generated with a secret key. The experimental results have shown that the proposed scheme has good quality and is very robust to various attacks, such as JPEG compression and noise. Also the performance of the proposed scheme is verified by comparing the copyright information with the information which is extracted from a bar code scantier.