• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9B
• /
• pp.1336-1342
• /
• 2001

본 논문은 최적 상호상관 특성을 갖는 소나배열 쌍의 대수학적 생성방법을 제시한다. 이 생성방법은 최상의 소나배열 쌍은 주어진 행의 크기에 대해 가장 큰 열의 크기를 갖는다는 관점에서 최상의 소나배열 쌍을 찾기 위해 알려진 모든 모듈라 소나배열에 적용되어 진다.

• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.221-228
• /
• 2010

Since string operations were applied to computational biology, security and search for Internet, various data structures and algorithms for computing efficient string operations have been studied. The all-pairs suffix-prefix matching is to find the longest suffix and prefix among given strings. The matching algorithm is importantly used for fast approximation algorithm to find the shortest superstring, as well as for bio-informatics and data compressions. In this paper, we propose an algorithm to find all-pairs suffix-prefix matching using the suffix array, which takes O($k{\cdot}m$)�� time complexity. The suffix array algorithm is proven to be better than the suffix tree algorithm by showing it takes less time and memory through experiments.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.164-170
• /
• 2014

A single near-field sounde source bearing and ranging method based on a independent doublet array is proposed. In the common case of bearing estimation method, unform linear array or uniform circular array are used. It is constrained retaining aperture because of array structure to estimate the distance of the sound source. Recent using independent doublet array sound source's bearing and distance esmtimation method is proposed by wide aperture. It is limited to the case doublets are located on a straight line. In this paper, we generalize the case and estimate the localization of a sound source in the various array structure. The proposed algorithm was verified performance through simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.299-308
• /
• 2004

In this paper, we propose a probabilistic framework to predict the interaction probability of proteins. The notion of domain combination and domain combination pair is newly introduced and the prediction model in the framework takes domain combination pair as a basic unit of protein interactions to overcome the limitations of the conventional domain pair based prediction systems. The framework largely consists of prediction preparation and service stages. In the prediction preparation stage, two appearance probability matrices, which hold information on appearance frequencies of domain combination pairs in the interacting and non-interacting sets of protein pairs, are constructed. Based on the appearance probability matrix, a probability equation is devised. The equation maps a protein pair to a real number in the range of 0 to 1. Two distributions of interacting and non-interacting set of protein pairs are obtained using the equation. In the prediction service stage, the interaction probability of a Protein pair is predicted using the distributions and the equation. The validity of the prediction model is evaluated for the interacting set of protein pairs in Yeast organism and artificially generated non-interacting set of protein pairs. When 80% of the set of interacting protein pairs in DIP database are used as teaming set of interacting protein pairs, very high sensitivity(86%) and specificity(56%) are achieved within our framework.

• Proceedings of the Zoological Society Korea Conference
• /
• 1994.10a
• /
• pp.249.2-249
• /
• 1994

• Proceedings of the Zoological Society Korea Conference
• /
• 1994.10a
• /
• pp.249.1-249
• /
• 1994

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.9
• /
• pp.514-519
• /
• 2002

We are considering the following problem that can be used in the prediction of the structure of proteins. Given two length n arrays A, B with positive numbers and a positive number M, find all pairs of subarrays A[i]＋…A[j],$1{\leq}i{\leq}j{\leq}n$ such that A[i]＋…A[j]＋B[k]＋…B[l]=M. This paper presents an algorithm with $Ο(n^2log n+K)$ time using Ο(n) memory, where K is the number of pairs output. The previously best known one is with $Ο(n^2log +Klog n)$ time and Ο(n) memory.

• Parasites, Hosts and Diseases
• /
• v.34 no.3
• /
• pp.161-168
• /
• 1996

We observed the morphological characteristics and identified the species of gnathostome larvae obtained from the imported Chinese loaches. The early third-stage larvae ($EL_3$) were collected from viscera of the loaches and a part of them were infected to mice. The advanced third-stage larvae ($AdL_3$) were recovered from the mice at 4 weeks post-infection. both larval worms were fixed loth 10% formalin, cleared in alcohol-glycerin solution, mounted with glycerin-jelly, and observed. A total of 369 $EL_3$ were collected from viscera of 9,493 Chinese loaches. The whole body of $EL_3$ was covered with about 190 transverse rows of minute cuticular spines and $0.624{\;}{\times}{\;}0.101{\;}mm$ in average size. A pair of lips were protruded at the anterior end, and the muscular esophagus and brownish intestine were followed. The characteristic head bulb was provided with 4 rows of hooklets. The average number of hooklets in the respective row was 36.7, 39.5, 41.6 and 44.3 posteriorly $AdL_3$ was $2.660{\;}{\times}{\;}0.346{\;}mm$ in average size, and retained the esophagus (about 0.755 mm length) and cervical sac (about 0.355 mm length). The average number of hooklets in the respective row on the head bulb was 39.0, 41.9, 43.9 and 45.6, posteriorly. On the basis of the morphological characteristics, they were identified as the third-stage larvae of Gnathostomc hispinun.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.11a
• /
• pp.84-86
• /
• 2015

본 논문에서는 2차원으로 배열된 4개의 스피커를 이용한 음향 재생환경에서 청취자의 위치에 따라 최적의 sweet spot을 제공하도록 스피커를 구동하는 방법을 제안한다. 먼저 청취자의 위치를 추적하여 청취자의 귀와 스피커 쌍 후보 사이의 경로의 비율을 구한다. 다음, 청취자의 위치를 고려하여 스피커 쌍 후보들의 스피커 간 거리 비율을 구한다. 마지막으로, 앞서 구한 두 개 거리 비율의 비율이 1에 가까운 스피커 쌍을 구동 스피커로 결정하고 cross-talk cancellation을 음원에 적용하여 청취자에게 제공한다. 모의실험을 통해, 청취자의 위치가 변할 때 제안하는 스피커 구동 방법을 사용하여 기존의 방법보다 청취자에게 넓은 sweet spot을 제공할 수 있음을 확인하였다.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.11
• /
• pp.171-179
• /
• 1997

This paper describes a nesting system of a computer-aided design of blanking and piercing for irregularly shaped sheet metal products. An approach to the system is based on knowledge-based rules. A nesting system is designed by considering several factors, such as utilization ratio which minimises the scrab for single or pairwise operation, bridge width, grain orientation and design requirements which maximise the strength of the part when subsequent bending is involve. Therefore this system which was implemented blank layout and strip layout module can carry out a nesting with a best utilization and a process planning for irregular shaped sheet metal products in single or pairwise operation and generate the blank layout and strip layout in graphic forms. Knowledges for a nesting and a process planning are extracted from plasticity theories, relevant references and empirical know-hows of experts in blanking industries. This provides its efficiency and effectiveness for nesting irregularly shaped sheet metal products.