• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.2
• /
• pp.136-144
• /
• 1999

정규 순환 방정식형태로 표현된 문제로부터 시스톨릭 어레이를 유도하기 위하여 일반적으로 공간-시간 사상 기법이 널리 이용되고 있다. 이 기법에서 공간 행렬은 주어진 문제 공간을 시스톨릭 어레이로 사상시키는 역할을 한다. 이러한 공간 행렬에 의해 유도되는 시시톨릭 어레이가 유효한 것이 되기 위해서 몇 가지의 제약 조건을 필요로 한다. 본 논문에서는 지역 의존 제약 조건을 기초로 하여 3차원의 문제 공간으로부터 2차원의 시스톨릭 어레이를 유도하는 공간 행렬의 계산 방법을 제시하고자한다. 먼저, 지역 의존 조건을 만족시키기위해 공간 행렬의 요소들이 가져야 하는 조건을 찾고 이 조건으로부터 가능한 트사 벡터들을 선정한다. 다음으로, 필요조건으로서 이러한 투사 벡터들로부터 지역 의존 조건을 만족시키는 공간 행렬을 가지는 투사 벡터들을 선별함으로써, 유효한 시스톨릭 어레이를 유도할 수 있는 모든 가능한 공간 행렬들을 구한다. 이렇게 구해진 가능한 모든 공간 행렬은 시스톨릭 어레이를 위한 캐드도구 또는 시뮬레이터에서 유용하게 이용될 수 있다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.3
• /
• pp.331-340
• /
• 2010

The basic theory and application of new adaptive finite element algorithm have been proposed in this study including the adaptive hp-refinement strategy, and the effective method for constructing hp-approximation. The hp-adaptive finite element concept needs the integrals of Legendre shape function, nonuniform p-distribution, and suitable constraint of continuity in conjunction with irregular node connection. The continuity of hp-adaptive mesh is an important problem at the common boundary of element interface. To solve this problem, the constraint of continuity has been enforced at the common boundary using the connectivity mapping matrix. The effective method for constructing of the proposed algorithm has been developed by using hierarchical nature of the integrals of Legendre shape function. To verify the proposed algorithm, the problem of simple cantilever beam has been solved by the conventional h-refinement and p-refinement as well as the proposed hp-refinement. The result obtained by hp-refinement approach shows more rapid convergence rate than those by h-refinement and p-refinement schemes. It it noted that the proposed algorithm may be implemented efficiently in practice.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.430-436
• /
• 2014

Matrix-star and Half-Pancake graphs are modified versions of Star graphs, and has some good characteristics such as node symmetry and fault tolerance. This paper analyzes embedding between Matrix-star and Half-Pancake graphs. As a result, Matrix-star graphs $MS_{2,n}$ can be embedded into Half-Pancake graphs $HP_{2n}$ with dilation 5 and expansion 1. Also, Half Pancake Graphs, $HP_{2n}$ can be embedded into Matrix Star Graphs, $MS_{2,n}$ with the expansion cost, O(n). This result shows that algorithms developed from Star Graphs can be applied at Half Pancake Graphs with additional constant cost because Star Graphs, $S_n$ is a part graph of Matrix Star Graphs, $MS_{2,n}$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.319-322
• /
• 2007

본 논문에서는 영상 감시 등의 응용을 위해 영상에서 자동으로 사람 수를 측정하는 군중 수 측정 방법을 제안한다. 제안한 방법에서는 전처리 과정으로 전경영상과 경계영상을 검출하여 객체의 픽셀 크기 히스토그램과 경계 방향 히스토그램을 특징으로 이용하고 카메라 투영행렬을 통해 픽셀 크기와 경계 방향에 대한 특징 정규화를 수행한다. 실제 사람 수와 얻어진 특징 히스토그램 간의 선형성은 사상 함수의 구성에 적용되며, 훈련 데이터를 통해 얻어진 사상 함수는 사람 수 측정에 이용되었다. 제안한 방법의 성능은 건물 내에서 촬영된 영상에 대한 실험 결과로 나타났으며 이 방법이 영상 감시 분야에 다양하게 적용될 수 있음이 확인되었다.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.26 no.3
• /
• pp.295-302
• /
• 1990

In this paper, a methodology for the automatic design of the optimal systolic arrays is proposed. Algorithm transformation is the main mathematical tool on which this methodology is based. Also, technique for partitioning algorithm into systolic arrays is presented. Algorithm partitioning is essential when the size of the computational problem is larger than the size of the array. This study results in (a) reduction of the design time of systolic arrays for given algorithms, (b) CRT display of the structures of systolic arrays, and (c) automatic designing of the optimal systolic array by the criteria such as the number of processing elements, bands, and communication paths. The procedure for these results was programmed using HP BASIC language on HP-9836 computer.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.249-257
• /
• 2009

The purpose of this study is to find a classification method with high accuracy in regard with sasang constitutional diagnosis. The BMI, blood pressure, pulse wave, and Sasang constitution diagnosed by a specialist was collected from 2848 subjects who were apparently healthy. Through a selective procedure, the data of 1635 subjects was used in the analysis. The results with the classification methods such as the discriminant analysis, regression, decision tree and neural network were compared with the diagnosis of a Sasang constitutional specialist. In result, the discriminant analysis method was hard to qualify the assumption of the equality of covariance matrices within constitutional groups. Moreover, without BMI, the decision tree and neural network methods were very sensitive to the change of the analysis data. Therefore, the Logistic regression and the decision tree is recommended on condition that the decisive factors of constitution are well concerned.

• Journal of Korea Water Resources Association
• /
• v.41 no.6
• /
• pp.559-564
• /
• 2008

A practical method is derived for determining the unit hydrograph and S-curve from complex storm events by using a smoothed unit kernel approach. The using a unit kernel yields more convenient way of constructing a unit hydrograph and its S-curve than a conventional method. However, with use of real data, the unit kernel oscillates and is unstable so that a unit hydrograph and S-curve cannot easily obtained. The use of non-parametric ridge regression with a Laplacian matrix is suggested for deriving an event averaged unit kernel which reduces the computational efforts when dealing with the Nash instantaneous unit hydrograph as a basis of the kernel. A method changing the unit hydrograph duration is also presented. The procedure shown in this work will play an efficient role when any unit hydrograph works is involved.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.147-152
• /
• 2002

SFLASH, one of the asymmetric signature schemes in NESSIE project, was suggested and accepted in the fat phase. In the latest, results about attacking the affine parts of SFLASH was published. In this paper, we have that an attacker knowing one linear part and two affine parts can easily forge signatures for arbitrary messages without information of the other linear part and the secret suing. It follows that the security of SFLASH depends only on the linear par, which is used in the last step when a signature is being generated. Also, we show that an attacker can obtain partial information of the linear part by the forging method using hem public key and secret elements and we discuss the length of secret key.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.391-394
• /
• 1994

본 연구에서는 전화선을 통한 음성인식을 위해 저잡음의 실험실 환경에서 수집된 음성 자료를 이용하는 접근을 하였다. 전화 음성과 실험실 음성 간의 특성 차이를 보정하기 위해 선형 회귀 분석법을 이용한 SDCN을 제안하였다. 두 자료간의 보정은 동시 녹음된 실험실 환경의 음성과 전화음성의 SNRDP 따른 두 자료간의 차이를 최소화하는 변환행렬을 구해, 이를 학습자료의 변환에 이용한다. 제안된 방법의 타당성을 확인하기 위해 두가지 인식 알고리즘인 DTW와 이산 HMM 에 대해 실험하였다. DTW를 통한 인식에서개선된 SDCN 에 의한 특징벡터의 변환은 기존의 SDCNDP 따른 특징변환보다 8~17%의 인식률이 향상되었다. 이산 HMM으로 인식할 때는 개선된 SDCNDP 의한 전화음성과 실험실 음성과의 유사도를 보다 잘 나타내기 위해 개선된 SDCN을 적용하고, VQ 코드열 상에서이 코드 사상법을 사용하여 인식률의 향상시켰다.