• Journal of Korean Society for Quality Management
• /
• v.44 no.2
• /
• pp.389-408
• /
• 2016

Purpose: This study was designed to analyze the behavioral change of knowledge structures and the trends of research topics in the quality management field. Methods: The network structure and knowledge structure of the words were visualized in map form using co-word analysis, cluster analysis and strategic diagram. Results: Summarizing the research results obtained in this study are as follows. First, the word network derived from co-occurrence matrix had 106 nodes and 5,314 links and its density was analyzed to 0.95. Average betweenness centrality of word network was 2.37. In addition, average closeness centrality and average eigenvector centrality of word network were 0.01. Second, by applying optimal criteria of cluster decision and K-means algorithm to word co-occurrence matrix, 106 words were grouped into seven clusters such as standard & efficiency, product design, reliability, control chart, quality model, 6 sigma, and service quality. Conclusion: According to the results of strategic diagram analysis over time, the traditional research topics of quality management field related to reliability, 6 sigma, control chart topics in the third quadrant were revealed to be declined for their study importance. Research topics related to product design and customer satisfaction were found to be an important research topic over analysis periods. Research topic related to management innovation was emerging state and the scope of research topics related to process model was extended to research topics with system performance. Research topic related to service quality located in the first quadrant was analyzed as the key research topic.

• Journal of the Optical Society of Korea
• /
• v.18 no.4
• /
• pp.317-329
• /
• 2014

In vision measurement systems based on structured light, the key point of detection precision is to determine accurately the central position of the projected laser line in the image. The purpose of this research is to extract laser line centers based on a decision function generated to distinguish the real centers from candidate points with a high recognition rate. First, preprocessing of an image adopting a difference image method is conducted to realize image segmentation of the laser line. Second, the feature points in an integral pixel level are selected as the initiating light line centers by the eigenvalues of the Hessian matrix. Third, according to the light intensity distribution of a laser line obeying a Gaussian distribution in transverse section and a constant distribution in longitudinal section, a normalized model of Hessian matrix eigenvalues for the candidate centers of the laser line is presented to balance reasonably the two eigenvalues that indicate the variation tendencies of the second-order partial derivatives of the Gaussian function and constant function, respectively. The proposed model integrates a Gaussian recognition function and a sinusoidal recognition function. The Gaussian recognition function estimates the characteristic that one eigenvalue approaches zero, and enhances the sensitivity of the decision function to that characteristic, which corresponds to the longitudinal direction of the laser line. The sinusoidal recognition function evaluates the feature that the other eigenvalue is negative with a large absolute value, making the decision function more sensitive to that feature, which is related to the transverse direction of the laser line. In the proposed model the decision function is weighted for higher values to the real centers synthetically, considering the properties in the longitudinal and transverse directions of the laser line. Moreover, this method provides a decision value from 0 to 1 for arbitrary candidate centers, which yields a normalized measure for different laser lines in different images. The normalized results of pixels close to 1 are determined to be the real centers by progressive scanning of the image columns. Finally, the zero point of a second-order Taylor expansion in the eigenvector's direction is employed to refine further the extraction results of the central points at the subpixel level. The experimental results show that the method based on this normalization model accurately extracts the coordinates of laser line centers and obtains a higher recognition rate in two group experiments.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.361-368
• /
• 2004

The purpose of this study is to propose a new on-line nonlinear PCA(OL-NPCA) method for a nonlinear feature extraction from the incremental data. Kernel PCA(KPCA) is widely used for nonlinear feature extraction, however, it has been pointed out that KPCA has the following problems. First, applying KPCA to N patterns requires storing and finding the eigenvectors of a N${\times}$N kernel matrix, which is infeasible for a large number of data N. Second problem is that in order to update the eigenvectors with an another data, the whole eigenspace should be recomputed. OL-NPCA overcomes these problems by incremental eigenspace update method with a feature mapping function. According to the experimental results, which comes from applying OL-NPCA to a toy and a large data problem, OL-NPCA shows following advantages. First, OL-NPCA is more efficient in memory requirement than KPCA. Second advantage is that OL-NPCA is comparable in performance to KPCA. Furthermore, performance of OL-NPCA can be easily improved by re-learning the data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.27-31
• /
• 2010

본 논문에서는 하이퍼그래프의 고유벡터를 척도로 하여 fMRI기반 Brain Network를 분석하여 중요한 허브노드를 찾는 방법론을 제시한다. 이 방법을 비디오게임을 수행하면서 촬영한 기능적 자기뇌영상(fMRI) 데이터인 PBAIC 2007 데이터셋에 대하여 그 유용성을 검증하였다. 이 데이터는 각 20분씩 세 세션을 촬영한 것이며 처음 두 세션에는 13가지의 감정 항목의 평가치가 각 스캔마다 주어진다. 한 피험자의 첫번째 세션 데이터로부터 13가지 감정 항목에 대하여 상관관계가 높은 각각의 복셀(voxel)들을 추출하였다. 이 13가지의 복셀들의 집합들을 각각 하이퍼에지로 보고 하이퍼그래프를 구성하였다. 하이퍼그래프로부 터 인접 행렬(adjacency matrix)를 구성한 후 고유치(eigenvalue)와 고유벡터(eigenvector)를 구하였다. 여기서 고유치가 가장 큰 고유벡터의 원소들은 각 복셀들의 중앙성(centrality), 즉 중요성을 나타내며 이로부터 감정과 관련된 중요한 허브 복셀들과 그들의 국소적 집합인 모듈을 찾았다. 모듈들은 감정 및 작업기억(working memory)과 관련된 뇌 영역들의 클러스터(cluster)로 추정된다.

• Journal of the Korean Mathematical Society
• /
• v.46 no.3
• /
• pp.657-673
• /
• 2009

The fixed point algebra $C^*(E)^{\gamma}$ of a gauge action $\gamma$ on a graph $C^*$-algebra $C^*(E)$ and its AF subalgebras $C^*(E)^{\gamma}_{\upsilon}$ associated to each vertex v do play an important role for the study of dynamical properties of $C^*(E)$. In this paper, we consider the stability of $C^*(E)^{\gamma}$ (an AF algebra is either stable or equipped with a (nonzero bounded) trace). It is known that $C^*(E)^{\gamma}$ is stably isomorphic to a graph $C^*$-algebra $C^*(E_{\mathbb{Z}}\;{\times}\;E)$ which we observe being stable. We first give an explicit isomorphism from $C^*(E)^{\gamma}$ to a full hereditary $C^*$-subalgebra of $C^*(E_{\mathbb{N}}\;{\times}\;E)({\subset}\;C^*(E_{\mathbb{Z}}\;{\times}\;E))$ and then show that $C^*(E_{\mathbb{N}}\;{\times}\;E)$ is stable whenever $C^*(E)^{\gamma}$ is so. Thus $C^*(E)^{\gamma}$ cannot be stable if $C^*(E_{\mathbb{N}}\;{\times}\;E)$ admits a trace. It is shown that this is the case if the vertex matrix of E has an eigenvector with an eigenvalue $\lambda$ > 1. The AF algebras $C^*(E)^{\gamma}_{\upsilon}$ are shown to be nonstable whenever E is irreducible. Several examples are discussed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.4
• /
• pp.433-442
• /
• 2010

In this paper, self-calibration algorithm based on covariance matrix is proposed for compensating amplitude/phase mismatch in multi-baseline interferometer direction finding system. The proposed method is a solution to nonlinear constrained minimization problem which dramatically calibrate mismatch error using space sector concept with cost function as defined in this paper. This method, however, has a drawback that requires an estimated initial angle to determine the proper space sector. It is well known that this type of drawback is common in nonlinear optimization problem. Superior calibration capabilities achieved with this approach are illustrated by simulation experiments in comparison with interferometer algorithm for a varitiety of amplitude/phase mismatch error. Furthermore, this approach has been found to provide an exceptional calibration capabilities even in case amplitude and phase mismatch are more than 30 dB and over $5^{\circ}$, respectively, with sector spacing of less than $50^{\circ}$.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.10
• /
• pp.989-997
• /
• 2002

This paper presents a new technique that enhances the performance of the smart antenna system especially in signal environments of wide angular spread by adopting a weight vector obtained from two eigenvectors of theautocovariance matrix of the received data. While the conventional beamformingtechnique employs only one eigenvector corresponding to the largest eigenvalue, the proposed algorithm uses two eigenvectors corresponding to the largest and second largest eigenvalue in such a way that it can be robust enough to the signal environments of wide angular spread. An efficient adaptive procedure is shown to verify that the optimal weight vector consisting of the two eigenvectors is obtained with a reasonable complexity(3.5$N_2$+ 12N) and accuracy. it is also shown in this paper that the numerical results obtained from the proposed adaptive procedure well agree with those obtained from a commercial tool computing the eigen-function of MATLABTM.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.4
• /
• pp.210-216
• /
• 2005

We Propose a new feature normalization scheme based on eigenspace for achieving robust speech recognition. In general, mean and variance normalization (MVN) is Performed in cepstral domain. However, another MVN approach using eigenspace was recently introduced. in that the eigenspace normalization Procedure Performs normalization in a single eigenspace. This Procedure consists of linear PCA matrix feature transformation followed by mean and variance normalization of the transformed cepstral feature. In this method. 39 dimensional feature distribution is represented using only a single eigenspace. However it is observed to be insufficient to represent all data distribution using only a sin91e eigenvector. For more specific representation. we apply unique na independent eigenspaces to cepstra, delta and delta-delta cepstra respectively in this Paper. We also normalize training data in eigenspace and get the model from the normalized training data. Finally. a feature space rotation procedure is introduced to reduce the mismatch of training and test data distribution in noisy condition. As a result, we obtained a substantial recognition improvement over the basic eigenspace normalization.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.5
• /
• pp.294-300
• /
• 2005

Generally, traditional approaches to track the target position are to estimate ranges and bearings by 2-D MUSIC (MUltiple 519na1 Classification) method. and to associate estimates of 2-D MUSIC made at different time points with the right targets by JPDA (Joint Probabilistic Data Association) filter in the near field. However, the disadvantages of these approaches are that these have the data association Problem in tracking multiple targets. and that these require the heavy computational load in estimating a 2-D range/bearing spectrum. In case multiple targets are adjacent. the tracking performance degrades seriously because the estimate of each target's Position has a large error. In this paper, we proposed a new tracking algorithm using Position innovations extracted from the senor output covariance matrix in the near field. The proposed algorithm is demonstrated by the computer simulations dealing with the tracking of multiple closing and crossing targets.

• Journal of Korean Academy of Nursing
• /
• v.49 no.5
• /
• pp.538-549
• /
• 2019

Purpose: This study aimed to explore and compare the knowledge structure of pain management nursing research, between Korea and other countries, applying a text network analysis. Methods: 321 Korean and 6,685 international study abstracts of pain management, published from 2004 to 2017, were collected. Keywords and meaningful morphemes from the abstracts were analyzed and refined, and their co-occurrence matrix was generated. Two networks of 140 and 424 keywords, respectively, of domestic and international studies were analyzed using NetMiner 4.3 software for degree centrality, closeness centrality, betweenness centrality, and eigenvector community analysis. Results: In both Korean and international studies, the most important, core-keywords were "pain," "patient," "pain management," "registered nurses," "care," "cancer," "need," "analgesia," "assessment," and "surgery." While some keywords like "education," "knowledge," and "patient-controlled analgesia" found to be important in Korean studies; "treatment," "hospice palliative care," and "children" were critical keywords in international studies. Three common sub-topic groups found in Korean and international studies were "pain and accompanying symptoms," "target groups of pain management," and "RNs' performance of pain management." It is only in recent years (2016~17), that keywords such as "performance," "attitude," "depression," and "sleep" have become more important in Korean studies than, while keywords such as "assessment," "intervention," "analgesia," and "chronic pain" have become important in international studies. Conclusion: It is suggested that Korean pain-management researchers should expand their concerns to children and adolescents, the elderly, patients with chronic pain, patients in diverse healthcare settings, and patients' use of opioid analgesia. Moreover, researchers need to approach pain-management with a quality of life perspective rather than a mere focus on individual symptoms.