• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.1-5
• /
• 2010

정렬 알고리즘에서 사용한 원소 간 비교횟수를 기준으로, 비교횟수가 많게 되는 순열을 최악의 인스턴스(worst-case instance)라 명명하고 이를 찾기 위해 유전 알고리즘(genetic algorithm)을 사용하였다. 잘 알려진 퀵 정렬(quick sort), 머지 정렬(merge sort), 힙 정렬(heap sort), 삽입 정렬(insertion sort), 쉘 정렬(shell sort), 개선된 퀵 정렬(advanced quick sort)에 대해서 실험하였다. 머지 정렬과 삽입 정렬에 대해 탐색한 인스턴스는 최악의 인스턴스에 거의 근접하였다. 퀵 정렬은 크기가 증가함에 따라 최악의 인스턴스 탐색이 어려웠다. 나머지 정렬에 대해서 찾은 인스턴스는 최악의 인스턴스인지 이론적으로 보장할 수 없지만, 임의의 1,000개 순열을 정렬해서 얻은 비교횟수들의 평균치보다는 훨씬 높았다. 본 논문의 최악의 인스턴스를 탐색하는 시도는 알고리즘의 성능 검증을 위한 테스트 데이터를 생성한다는 점에서 의미가 크다.

• Proceedings of the KSLP Conference
• /
• 1997.11a
• /
• pp.255-255
• /
• 1997

서론 : 성대구증은 음성장애를 주소로 외래로 찾아오는 환자에서 드물지 않게 볼 수 있으나, 그 병인이 불명확하고 그간의 치료가 만족스럽지 못한 것으로 알려져 간과하기 쉬운 질환이다. 저자들은 이러한 성대구중 환자들의 음성기능 분석을 통하여 향후의 치료효과를 알아보는데 도움이 되고자 하였다. (중략)

• Journal of Educational Research in Mathematics
• /
• v.26 no.4
• /
• pp.635-662
• /
• 2016

Combinatorics, the basis of probabilistic thinking, is an important area of mathematics and closely linked with other subjects such as informatics and STEAM areas. But combinatorics is one of the most difficult units in school mathematics for leaning and teaching. This study, using the designed combinatorial models and executable expression, aims to analyzes the eye movement of graduate students when they translate the written combinatorial problems to the corresponding executable expression, and examines not only the understanding process of the written combinatorial sentences but also the degree of difficulties depending on the combinatorial semantic structures. The result of the study shows that there are two types of solving process the participants take when they solve the problems : one is to choose the right executable expression by comparing the sentence and the executable expression frequently. The other approach is to find the corresponding executable expression after they derive the suitable mental model by translating the combinatorial sentence. We found the cognitive processing patterns of the participants how they pay attention to words and numbers related to the essential informations hidden in the sentence. Also we found that the student's eyes rest upon the essential combinatorial sentences and executable expressions longer and they perform the complicated cognitive handling process such as comparing the written sentence with executable expressions when they try the problems whose meaning structure is rarely used in the school mathematics. The data of eye movement provide meaningful information for analyzing the cognitive process related to the solving process of the participants.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.429-434
• /
• 2017

In a graph G=(V, E) with n vertices, there is an unique box which is finally laid on each vertex. Thus each vertex and box is both numbered from 1 to n and the box i should be laid on the vertex i. But, the box ${\pi}$(i) is initially located on the vertex i according to a permutation ${\pi}$. In each step, the robot can walk along an edge of G and can carry at most one box at a time. Also when arriving at a vertex, the robot can swap the box placed there with the box it is carrying. The problem is to minimize the total step so that every vertex has its own box, that is, the shuffled boxes are sorted. In this paper, we shall find an upper bound of the minimum number of steps and show that the movement of the robot is found in $O(n^2)$ time when G is a cycle.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.67-69
• /
• 2003

소프트웨어 시스템을 집적하는데 있어서 컴퍼넌트 중심의 소프트웨어 개발 접근 방법이 큰 경향이다. 집적 소프트웨어 시스템의 전체 신뢰도를 확보하기 위해 소프트웨어 컴퍼넌트의 테스트 및 자원의 유한성 내에서 소프트웨어가요하는 조건을 만족해야만 한다. 기지의 비용, 신뢰도, 테스트 노력, 시스템 컴퍼넌트의 기타 다른 공헌 인자를 가지고 순열조합의 최적화 문제로서 시스템 테스트의 최적화 문제 효율을 공식화할 수 있다. 본 연구에서는 그 각각이 사전에 명세화한 신뢰도 요건을 가진 단일 또는 다중 실용화 시스템에 대한“소프트웨어 컴퍼넌트 테스트 자원 할당”을 고려한다. 이것은 내고장(fault-tolerant) 시스템에도 확장해서 실용화할 수 있다. 테스트 자원 할당문제에 체계적으로 접근하는 절차를 논하고자 한다.

• Communications of Mathematical Education
• /
• v.34 no.3
• /
• pp.257-276
• /
• 2020

In this study, the MKT level of pre-service mathematics teachers in the area of permutations and combinations was investigated, and MKT-Development Program(MKT-DP) focused on improving the MKT of pre-service mathematics teachers was developed and implemented to examine the effects of the program on the MKT in the area of permutations and combinations. Twenty-nine pre-service mathematics teachers participated in a four-week MKT-DP and MKT pre and post tests. According to the MKT pre test results for permutation and combination areas, pre-service teachers who participated in this study showed low levels of MKT in the permutation and combination areas, especially, the level of SCK and KCT was quite low. In order to examine the effects of MKT-DP, the results of pre- and post-MKT tests were analyzed, and a significant difference between pre- and post-tests was found only in the KCT sub-category. This shows that the MKT-DP developed in this study is effective in improving pre-services teachers' KCT in the area of permutation and combination. Although there were no statistically significant differences between the three remaining sub-categories(CCK, SCK, and KCS), the positive influence of MKT-DP can be expected throughout MKT, as a result of some level increase in post-test compared to the pre-test.

• 대한두경부종양학회:학술대회논문집
• /
• 2004.11a
• /
• pp.257-257
• /
• 2004

• Korean Journal of Cleft Lip And Palate
• /
• v.7 no.1
• /
• pp.1-16
• /
• 2004

In the recent time, early correction of the congenital anomalies has become the focus of contemporary cleft lip care, The reason of that is mostly psychologic factor of children are respected, Although the propound object of lip adhesion is not esthetic improvement, that able to satisfy sufficiently parents of cleft children, In the unilateral or bilateral clefts, a preliminary lip adhesion has been advocated as a mean of narrowing the cleft at an early phase, of improving the nasal contour, of molding the alveolar arch, and of easing and improving the result of a definitive lip repair. The present study was earned out to investigate the effect of lip adhesion. We performed the Millard's high-half underminded adhesion and Seibert's lip adhesion followed by modified Millard's cheiloplasty for five infants had unilateral complete cleft lip. The lip adhesion reduced the actual deformity by molding the maxillary alveolar segments into better relationship and allows a easy cheiloplasty so that led to more perfect final lip result, Both Millard's high-half underminded adhesion and Seibert's lip adhesion were available methods to adhere a wide cleft lip, Especially, Seibert's lip adhesion had more advantages such as enhancement of the force of adhesion, correction of the deviated columella and acquirement of the esthetic upper lip continuity. These results suggest that the lip adhesion followed by cheiloplasty for wide unilateral complete cleft lip patients provide more favorable final result by molding the maxillary alveolar segments into better relationship.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.350-359
• /
• 2013

In this paper, Inter user interference elimination algorithm based on Block Diagonal Geometric Mean Decomposition(BD-GMD) for eliminating inter user interference apply to Zero-Forcing in the Successive Signal to Leakage plus Noise Ratio(SSLNR) in Coordinated Multi-Point Coordinated Beamforming system(CoMP CB). As a result, the leakage power is eliminated. The inter user interference elimination algorithm, however, cannot guarantee the enough desired signal power therefore we perform the channel ordering to overcome this disadvantage and increase the desired signal power. The simulation results show that the proposed scheme provides the improved Bit Error Rate(BER) performance compared with existing SSLNR-Zero-Forcing-Tomlinson Harashima precoding(SSLNR-ZF-THP).

• Journal of the military operations research society of Korea
• /
• v.15 no.2
• /
• pp.127-146
• /
• 1989

여러 암호화 방식 중 비교적 비도가 높으며 표준화되어 있어 가장 널리 사용되고 있는 것이 DES이다. 그러나 DES의 안전성에 대하여 많은 문제점과 의문이 제기되어 왔으며 이들은 주로 DES S-Box에 관한 것이다. 이 S-Box의 구성은 평문과 암호문 사이의 상호관련성을 제거해주는 데 도움을 주지만 여기에 비밀통로가 숨겨져 있을 수 있는 가능성이 문제되고 있다. DES의 S-Box에 대한 이러한 문제점을 해결할 수 있는 방법의 하나는 0부터 15까지의 수를 무작위하게 순열하여 S-Box를 구성하는 것이다. 본 연구에서는 키에 의존하는 S-Box를 설계하며 아울러 이 변형된 DES를 수행할 수 있는 소프트웨어를 구축하여 변형된 암호화 방법의 안전성을 검토하고자 한다.