• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.952-954
• /
• 2005

D-클래스는 $n{\times}n$ 불리언 행렬의 집합에서 특정 관계(relation)에 따딸라 동치(equivalent) 관계에 있는 불리언 행렬의 집합으로 구성된다. D-클래스 계산은 $n{\times}n$ 불리언 행렬의 전체 집합을 대상으로 이 집합에서 조합할 수 있는 모든 두 $n{\times}n$ 불리언 행렬 사이의 곱셈을 기본적으로 요구한다. 그러나 불리언 행렬에 대한 대부분의 연구는 두 개의 불리언 행렬에 대한 효율적인 곱셈에 집중되었으며 모든 $n{\times}n$ 불리언 행렬 사이의 곱셈에 대한 연구는 최근에야 소수가 보이고 있다. 두개의 $n{\times}n$ 불리언 행렬 곱셈에 대해 최적화된 알고리즘은 현재 알려져 있으나, 모든 $n{\times}n$ 불리언 행렬 사이의 곱셈에 대해 제시된 알고리즘은 아직 실행시간이 크게 향상되지 못하고 있으며 많은 개선과 연구가 필요하다. 본 논문은 개별적인 $n{\times}n$ 불리언 행렬 곱셈 대신 하나의 $n{\times}n$ 불리언 행렬과 불리언 행렬 집합과의 곱셈을 다루고 또한 이 곱셈에서 계산되는 모든 $n{\times}n$ 불리언 행렬을 집합으로 표현하는 방법을 통해 D-클래스 계산을 보다 효율적으로 할 수 있는 알고리즘에 대해 논한다.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.27-33
• /
• 2006

Boolean matrices are applied to a variety of areas and used successfully in many applications, and there are many researches on boolean matrices. Most researches deal with the multiplication of boolean matrices, but all of them focus on the multiplication of two boolean matrices and very few researches deal with the multiplication between many n$\times$m boolean matrices and all m$\times$k boolean matrices. The paper discusses the existing optimal algorithms for the multiplication of two boolean matrices are not suitable for the multiplication between a n$\times$m boolean matrix and all m$\times$k boolean matrices, establishes a theory that enables the efficient multiplication of a n$\times$m boolean matrix and all m$\times$k boolean matrices, and shows the execution results of a multiplication algorithm designed with this theory.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.389-392
• /
• 2005

Boolean matrices are applied to a variety of areas and used successfully in many applications. There are many researches on the application and multiplication of boolean matrices. Most researches deal with the multiplication of boolean matrices, but all of them focus on the multiplication of just two boolean matrices and very few researches deal with the multiplication of many pairs of two boolean matrices. The paper discusses it is not suitable to use for the multiplication of many pairs of two boolean matrices the algorithm for the multiplication of two boolean matrices that is considered optimal up to now, and suggests a method that can improve the multiplication of a $n{\times}m$ boolean matrix and all $m{\times}k$ boolean matrices.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.839-842
• /
• 2006

대부분의 불리언 행렬에 대한 연구는 두 불리언 행렬의 곱셈에 초점을 두고 있으며 모든 불리언 행렬을 대상으로 한 곱셈에 대한 연구는 최근에야 극히 소수의 연구결과가 보이고 있다. 이 연구들은 모든 불리언 행렬 사이의 곱셈 실행시간을 개선시켰으나 연속된 세 개의 모든 lxn, nxm, mxk 불리언 행렬에 대한 곱셈은 아직 많은 개선이 필요하다. 본 논문은 모든 $l{\times}n,\;n{\times}m,\;m{\times}k$ 불리언 행렬의 곱셈 실행시간을 보다 개선할 수 있는 이론을 제시하고 이를 적용한 불리언 행렬 연속곱셈의 실행결과에 대하여 논한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.2
• /
• pp.68-78
• /
• 2007

D-class is defined as a set of equivalent $n{\times}n$ boolean matrices according to a given equivalence relation. The D-class computation requires the multiplication of three boolean matrices for each of all possible triples of $n{\times}n$ boolean matrices. However, almost all the researches on boolean matrices focused on the efficient multiplication of only two boolean matrices and a few researches have recently been shown to deal with the multiplication of all boolean matrices. The paper suggests a mathematical theory that enables the efficient multiplication for all possible boolean matrix triples and the efficient computation of all D-classes, and discusses algorithms designed with the theory and their execution results.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.459-461
• /
• 2006

The successive multiplication of all $n{\times}n$ boolean matrices is necessary for applications such as D-class computation. But, no research has been performed on it despite many researches dealing with boolean matrices. The paper suggests a theory with which successively multiplying a $n{\times}n$ boolean matrix by all $n{\times}n$ boolean matrices can be done efficiently, applies it to the successive multiplication of all $n{\times}n$ boolean matrices and shows its execution results.

• (The)Study of the Eastern Classic
• /
• no.69
• /
• pp.325-347
• /
• 2017

In order to examine the characteristics of the name of a thing appearing in the "Gugpung(국풍)", it was compared with the name of a thing in "The Korean annotation of the Classic of Odes(시경언해)" We have examined the reason why the names of things in "The Korean annotation of the Classic of Odes(시경언해)" and "Gugpung(국풍)" appear differently in terms of the difference between the purposes of compiling the two books and reflecting the changes in language. "The Korean annotation of the Classic of Odes(시경언해)" does not provide a proper language for the names of flora and fauna that can be easily seen in the collective term of plants or animals or in everyday life. However, in the "Gugpung (국풍)", they also presented their own words. We found the reason for the purpose of compiling the "Gugpung(국풍)". "Gugpung(국풍)" is a book made for women's education. Therefore "Gugpung(국풍)" was made not only to learn the contents but also to learn Chinese character contained in the contents. Consequently, unlike the "The Korean annotation of the Classic of Odes(시경언해)", most of the names of the Korean things are presented Although the names of the native language of "Gugpung(국풍)" and "The Korean annotation of the Classic of Odes(시경언해)" are consistent with each other, many cases have been found that appear differently. In many cases, they reflected the change of the history of the Korean language in the early 17th century, when the "The Korean annotation of the Classic of Odes(시경언해)" was published, and in the early 19th century, when the "Gugpung(국풍)" wind was written.

• The Journal of Korean Association of Computer Education
• /
• v.14 no.1
• /
• pp.55-67
• /
• 2011

Due to recent various online problems, the necessity of information security education has increased. The information security education was strengthened thanks to the informatics curriculum of middle school in 2007, but the educational fields lacked detailed educational materials that could be utilized. Thus to give appropriate information security education for elementary and middle school students, this research developed an unplugged activity for them. The activity was designed by applying Lickona's integrated ethical model and design patterns of unplugged activities, and developed through expert's review and pilot tests targeted to elementary school students. Developed activity was applied to 21 middle school students and the usability was evaluated. As results, first, the activity showed similar expectations from the previous activities. Second, persistence was also similar or higher compared to the previous activities, so the activity developed from this research secured the minimum usability. The unplugged activity developed from this research would give implications in producing various educational contents for information security education.

• Korean Journal of Remote Sensing
• /
• v.38 no.6_2
• /
• pp.1589-1605
• /
• 2022

Phase unwrapping is an essential procedure for interferometric synthetic aperture radar techniques. Accordingly, a lot of phase unwrapping methods have been developed. Deep-learning-based unwrapping methods have recently been proposed. In this paper, we reviewed state-of-the-art deep-learning-based unwrapping approaches in terms of 1) the approaches to predicting unwrapped phases, 2) deep learning model structures for phase unwrapping, and 3) training data generation. The research trend of the approaches to predicting unwrapped phases was introduced by categorizing wrap count segmentation, phase jump classification, phase regression, and deep-learning-assisted method. We introduced the case studies of deep learning model structure for phase unwrapping, and model structure optimization to relate the overall phase information. In addition, we summarized the research trend of the training data generation approaches in the views of phase gradient and noise in the main. And the future direction in deep-learning-based phase unwrapping was presented. It is expected that this paper is used as guideline for exploring future direction of deep-learning-based phase unwrapping research in Korea.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.258-261
• /
• 1994

자연언어 인터페이스는 초보자나 비숙련가의 입장에서는 새로운 시스템의 적응에 있어서 어떤 학습도 필요하지 않다는 장점이 있다. 이 연구에서는 불리언 질의를 처리하는 정보검색 시스템의 자연언어 인터페이스를 구혐하였다. 즉, 한국어 자연언어 질의를 불리언 질의로 변환해주는 시스템이다. 접근 방법은 먼저 자연언어 질의를 구문 해석한 후에, 그 결과인 문자의 의존 구조와 불용어 정보를 사용하여 기본적인 불리언 질의를 만든다음, 시소러스를 이용하여 불리언 질의를 확장한다. 여기에서 사용한 구문 해석 방법은 기존 문법에 기반한 방법이다. 변환 시스템은 SPARC-II 호환기종에서 구현되었으며, 약 5만 단어의 사전을 사용한다. 가공된 120 개의 질의를 대상으로 실험한 결과, 전체 소요시간은 13.5초가 걸렸다. 그리고, 변환된 불리언 연산식중에 110개가 적절하게 변환된 것으로 조사되었다.