• The KIPS Transactions:PartB
• /
• v.16B no.3
• /
• pp.233-238
• /
• 2009

This paper presents an approach to the classifications of small size document using the instance-based feature filtering Relief-F algorithm. In the document classifications, we have not always good classification performances of small size document included a few features. Because total number of feature in the document set is large, but feature count of each document is very small relatively, so the similarities between documents are very low when we use general assessment of similarity and classifiers. Specially, in the cases of the classification of web document in the directory service and the classification of the sectors that cannot connect with the original file after recovery hard-disk, we have not good classification performances. Thus, we propose the Extended Relief-F(ERelief-F) algorithm using instance-based feature filtering algorithm Relief-F to solve problems of Relief-F as preprocess of classification. For the performance comparison, we tested information gain, odds ratio and Relief-F for feature filtering and getting those feature values, and used kNN and SVM classifiers. In the experimental results, the Extended Relief-F(ERelief-F) algorithm, compared with the others, performed best for all of the datasets and reduced many irrelevant features from document sets.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.247-250
• /
• 2004

Goldschmidt 알고리즘에 의한 부동소수점 1.f2의 역수는 q=NK1K2....Kn (Ki=1+Aj, j=2i)이다. 본 논문에서는 N과 A 값을 1.f2의 값에 따라서 선정하고 Aj의 값이 유효자리수의 반이하 값을 가지면 연산을 종료하는 개선된 Goldschmidt 부동소수점 역수 알고리즘을 제안한다. 1.f2가 1.01012보다 작으면 N=2-1.f2, A=1.f2-1로 하며, 1.01012보다 크거나 같으면 N=2-0.lf2, A=1-0.lf2로 한다. 한편 Goldschmidt 알고리즘은 곱셈을 반복해서 수행하므로 계산 오류가 누적이 된다. 이러한 누적 오류를 감안하면 배정도실수 역수에서는 2-57, 단정도실수 역수에서는 2-28의 유효자리수까지 연산해야 한다. 따라서 Aj가 배정도실수 역수에서는 2-29, 단정도실수 역수에서는 2-14 보다 작아지면 연산을 종료한다. 본 논문에서 제안한 개선한 Goldschmidt 역수 알고리즘은 N=2-0.1f2, A=1-0.lf2로 계산하는 종래 알고리즘과 비교하여 곱셈 연산 회수가 배정도실수 역수는 22%, 단정도실수 역수는 29% 감소하였다. 본 논문의 연구 결과는 테이블을 사용하는 Goldschmidt 역수 알고리즘에 적용해서 연산 시간을 줄일 수 있다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.4
• /
• pp.73-80
• /
• 1997

유한체 위에서 다항식의 근을 구하는 문제는 수학의 오래된 문제중 하나이고 최근들어 암호학과 관련하여 유한체 위서의 다항식 연산과 성질등이 쓰이고 있다. 유한체 위에서 다항식의 최대공약수(greatest common divisor) 를 구하는데 많은 시간이 소요 된다. Rabin의 알고리즘에서 주어진 다항식의 근들의 곱(F(x), $x^{q}$ -x)를 구하는 과정을 c F(p), $f_{c}$ (x)=(F(x), $T_{r}$ (x)-c), de$gf_{c}$ (x)>0인 $f_{c}$(x) s로 대체한 효율적인 알고리즘 제안과 Mathematica를 이용한 프로그램의 실행 결과를 제시한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.40-48
• /
• 2002

Three-Dimensional scene reconstruction from images acquired with different viewpoints is possible as estimating Fundamental matrix(F-matrix) that indicates the epipolar geometry of two images. Correspondence points required to calculate F-matrix of two images include noise such as miss matches, so generally it is hard to calculate F-matrix accurately. In this paper, we classify noise into two types; outlier and minute noise. we propose SSOR algorithm that estimate F-matrix effectively. SSOR algorithm is rejecting outlier step by step in a noise environment. To evaluate the performance of proposed algorithm we simulated with synthetic images and real images. As a result of simulation we show that proposed algorithm is better than conventional algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.2
• /
• pp.184-193
• /
• 1994

This paper considers the Updating Minimum-weight Spanning Tree Problem(UMP), that is, the problem to update the Minimum-weight Spanning Tree(MST) in response to topology change of the network. This paper proposes the algorithm which reconstructs the MST after several links deleted and added. Its message complexity and its ideal-time complexity are Ο(m＋n log(t＋f)) and Ο(n＋n log(t＋f)) respectively, where n is the number of processors in the network, t(resp.f) is the number of added links (resp. the number of deleted links of the old MST), And m=t＋n if f=Ο, m=e (i.e. the number of links in the network after the topology change) otherwise. Moreover the last part of this paper touches in the algorithm which deals with deletion and addition of processors as well as links.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1834-1836
• /
• 2010

프로테오믹스는 세포 안 또는 개체 안의 모든 단백질을 총체적으로 연구하는 분야이다. 단백질 동정은 단백질이 어떤 아미노산의 서열로 구성되었는지를 확인하는 것이다. 하지만 Post-translational modification과 같은 단백질 변형을 고려하게 되면 단백질 동정은 매우 어렵게 된다. $MOD^i$ 알고리즘은 단백질 동정을 할 때 Post-translational modification의 종류나 개수에 제한 없이 단백질 동정을 정확하게 수행한다. 하지만, 대용량 단백질 서열 데이터베이스를 사용하면 수행시간이 많이 걸리는 단점이 있다. 본 논문에서는 $MOD^i$를 보완하기 위해 대용량 데이터베이스에서 후보 단백질을 선정하는 알고리즘을 통해서 개선된 $MOD^f$ 알고리즘을 제안하고 Target-decoy search strategy를 적용하여 정확성을 분석한다. 후보 단백질 선정 알고리즘과 Target-decoy search strategy 적용 결과 $MOD^f$는 $MOD^i$에 비해 정확도를 희생하지 않으면서 수행속도는 약 2배 향상되었다.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.573-580
• /
• 2002

Within the security architecture of the 3GPP system there is a standardised integrity algorithm f9. The integrity algorithm f9 computes a MAC to authenticate the data integrity and data origin of signalling data over a radio access link of W-CDMA IMT-2000. f9 is a variant of the standard CBC MAC based on the block cipher KASUMI. In this paper we provide the provable security of f9 We prove that f9 is secure by giving concrete bound on an adversary's inability to forge in terms of her inability to distinguish the underlying block cipher from a pseudorandom permutation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.759-764
• /
• 2013

We present a square root algorithm in $F_q$ which generalizes Atkin's square root algorithm [9] for finite field $F_q$ of q elements where $q{\equiv}5$ (mod 8) and Kong et al.'s algorithm [11] for the case $q{\equiv}9$ (mod 16). Our algorithm precomputes ${\xi}$ a primitive $2^s$-th root of unity where s is the largest positive integer satisfying $2^s|q-1$, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for square root computation and is favorably compared with the algorithms of Atkin, M$\ddot{u}$ller and Kong et al.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.131-136
• /
• 2008

L(2,1)-labeling of a graph G is a function f: V(G) $\rightarrow$ {0, 1, 2, ...} such that $|f(u)\;-\;f(\upsilon)|\;{\geq}\;2$ when d(u, v) = 1 and $|f(u)\;-\;f(\upsilon)|\;{\geq}\;1$ when d(u, $\upsilon$) = 2. L(2,1)-labeling number of G, denoted by ${\lambda}(G)$, is the smallest number m such that G has an L(2,1)-labeling with no label greater than m. Since this problem has been proved to be NP-complete, in this article, we develop genetic algorithms for L(2,1)-labeling problem and show that the suggested genetic algorithm peforms very efficiently by applying the algorithms to the class of graphs with known optimum values.