• Annual Conference on Human and Language Technology
• /
• 2001.10d
• /
• pp.359-364
• /
• 2001

필기 한글문자 인식은 다양한 필기 변형, 자모 간의 접촉과 같은 문제들을 내포하고 있다. 최근 이를 해결하기 위한 방법으로 랜덤 그래프를 이용한 필기 한글 모델링이 제안되었으나, 상향식 정보처리의 한계인 시간 복잡도 문제를 겪고 있다. 영어 단어인식에 관한 인지과학적 연구에서는 하향식 정보처리의 주요한 역할 중 하나로 인식 과정에서의 계산 중복을 없애는 필터링의 역할을 들고 있다. 본 논문에서는 랜덤 그래프를 이용한 필기 한글 모델링을 기반으로 하여 필기체에 나타나는 다양한 변형을 흡수하며, 시간 복잡도를 해결하기 위한 한글 문자의 구조에 바탕을 둔 하향식 정보처리 방법을 제안한다. 제안하는 방법은 모델 발화를 이용한 자모 후보 추출 DP 정합과 동적 격자 탐색을 이용한 문자 후보 탐색, 그리고 문자의 구조적 제약을 이용한 후보 제거 기법을 포함한다. 필기 한글 데이터베이스인 SERI-DB에 대한 예비 실험 결과, 제안한 방법은 인식률의 큰 저하 없이 상향식 정보 처리에 바탕을 둔 기존 방법에 비해 높은 속도 향상을 가져 왔다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.160-162
• /
• 2004

본 논문에서는 XML 문서간의 자동 변환을 위한 효율적인 XSLT 스크립트를 생성하는 알고리즘을 제안한다. 제안된 방법은 XML DTD를 구성하는 단말 노드간의 일대일 대응관계가 주어져 있다는 가정 하에 XSLT 스크립트를 생성하는데 중점을 둔다. 제안된 알고리즘은 상향식과 하향식의 복합적인 접근 방식을 적용한다. 먼저 중간 노드간의 대응관계를 상향식으로 생성하며 하향식 깊이 우선 탐색을 적용하여 XSLT 스크립트를 생성한다. 실험결과, 제안된 방법은 기존 연구와 비교하여 XML 문서를 보다 빠르게 변환하는 XSLT 스크립트를 생성하였다.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.78-83
• /
• 2017

Finding the densest subgraphs from social networks, such that people in the subgraph are in a particular community or have common interests, has been a recurring problem in numerous studies undertaken. However, these algorithms focused only on finding the single densest subgraph. We suggest a heuristic algorithm of the bottom-up type, which finds the densest subgraph by increasing its size from a given starting node, with the repeated addition of adjacent nodes with the maximum degree. Furthermore, since this approach matches well with parallel processing, we further implement a parallel algorithm on the MapReduce framework. In experiments using various graph data, we confirmed that the proposed algorithm finds the densest subgraphs in fewer steps, as compared to other related studies. It also scales efficiently for many given starting nodes.

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.150-156
• /
• 2018

Software visualization can assist developers to understand a software system and change its code. The recent development of bottom-up visualization tools demonstrates the advantages by revealing the code that is directly related to a software evolution task. However, the information provided by these tools is limited to the code already investigated by the developers in that task session. To broaden the scope and provide the code information that developers should explore, we propose to present the latest revision of a software system via a class diagram. When a developer clicks on a button, the proposed tool reveals the code changes committed to a configuration management system, and facilitates the understanding of code changes. We also conduct case studies illustrating the advantages of the proposed tool.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.606-619
• /
• 2001

This paper presents an efficient algorithm to compute difference between old and new versions of an SGML/XML document. The difference between the two versions can be considered to be an edit script that transforms some document tree into another The proposed algorithm is based on hybridization of bottom-up and top-down methods: matching relationships between nodes in the two versions are producted in a bottom-up manner and top-down breadth -first search computes an edit script. Because the algorithm does not need to investigate possible existence of matchings for all nodes, faster matching can be achieved . Furthermore, it can detect more structurally meaningful changes such as subtree move and copy as well as simple changes to the node itself like insert, delete, and update.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.469-474
• /
• 2009

This paper proposes an real time ray tracing system using optimized kd-tree traversal environment and ray/triangle intersection algorithm. The previous kd-tree traversal algorithms search for the upper nodes in a bottom-up manner. In a such way we need to revisit the already visited parent node or use redundant memory after failing to find the intersected primitives in the leaf node. Thus ray tracing for relatively complex scenes become more difficult. The new algorithm contains stacks implemented on GPU's local memory on CUDA framework, thus elegantly eliminate the problems of previous algorithms. After traversing the node we perform the latest CPU-based ray/triangle intersection algorithm 'Plucker coordinate test', which is further accelerated in massively parallel thanks to CUDA. Plucker test can drastically reduce the computational costs since it does not use barycentric coordinates but only simple test using the relations between a ray and the triangle edges. The entire system is consist of a single ray kernel simply and implemented without introduction of complicated synchronization or ray packets. Consequently our experiment shows the new algorithm can is roughly twice as faster as the previous.

• Journal of Digital Convergence
• /
• v.9 no.1
• /
• pp.125-136
• /
• 2011

This article is exploring the possibility of establishment of a 'Smart Citizens Party'. In the society based the social computing, the individual leads the technical progress and the society which is adapted for this circumstance is changing in the direction of user-centric. Also, in the political process, we can see this social phenomenon. In other words, there's a quite possibility that decision-making structure may shift from the top-down approach to the bottom-up approach by the networked individuals or flexible voluntary group. In this context, this paper will propose the 'Smart Citizens Party' model that accept the change of political and social environment due to the advent of the social computing and cope with this change. The 'Smart Citizens Party' means the 'Party for Smartizen' of this social computing era. The 'Smart Citizens Party' is the intermediate party that link the political party to the civil society and is smart citizen's party that is operated democratically by active participation of citizens. This paper will review on structure and operational issues of political parties in Korea and study future-oriented solution and/or way to discovered problems of political parties in Korea.

• Journal of KIISE:Software and Applications
• /
• v.27 no.9
• /
• pp.973-985
• /
• 2000

함수형 프로그래밍 언어는 전통적인 프로시저형 언어에 비하여 많은 장점이 있다. 그러나 함수 언어 프로그래머를 위한 실용적인 디버깅 환경은 상대적으로 빈약하다. 그동안 유용한 디버거 구현을 위해서 많은 시도가 있었고, 그 결과로 하향식 기법으로 이용한 알고리즈믹 디버거와 상향식 기법을 이용한 레덱스 트레일 디버거가 연구되었다. 두가지 기법은 모두 실제 프로그래밍에 적용하기에는 유지해야 하는 디버깅 정보의 양이 많다는 단점이 있다. 이 논문에서는 선택적 레덱스 트레일 디버깅 방법을 제안한다. 이 방법을 이용하면 디버거 사용자는 프로그램에서 오류가 예상되는 부분에 포커스를 설정할 수 있고 단지 선택된 부분에 한하여 트레일을 생성하게 된다. 이 방법은 프로그램의 오류에 대한 디버거 사용자의 예측을 반영하고 디버깅에 필요한 정보의 양을 줄이는 장점이 있다. 구현된 디버깅 시스템은 선택적 레덱스 트레일을 생성하는 추상기계와 실제 디버깅이 이루어지는 레덱스 트레일 탐색기로 구성된다.

• Journal of the Korean earth science society
• /
• v.39 no.1
• /
• pp.103-116
• /
• 2018

The purpose of this study was to explore $6^{th}$ graders learning progression for lunar phase change focusing astronomical systems thinking. By analyzing the results of previous studies, we developed the constructed-response items, set up the hypothetical learning progressions, and developed the item analysis framework based on the hypothetical learning progressions. Before and after the instruction on the lunar phase change, we collected test data using the constructed-response items. The results of the assessment were used to validate the hypothetical learning progression. Through this, we were able to explore the learning progression of the earth-moon system in a bottom-up. As a result of the study, elementary students seemed to have difficulty in the transformation between the earth-based perspective and the space-based perspective. In addition, based on the elementary school students' learning progression on lunar phase change, we concluded that the concept of the lunar phase change was a bit difficult for elementary students to learn in elementary science curriculum.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.406-409
• /
• 2008

We consider the problem of exploiting a taxonomy of propositionalized attributes in order to learn compact and robust classifiers. We introduce Propositionalized Attribute Taxonomy guided Naive Bayes Learner (PAT-NBL), an inductive learning algorithm that exploits a taxonomy of propositionalized attributes as prior knowledge to generate compact and accurate classifiers. PAT-NBL uses top-down and bottom-up search to find a locally optimal cut that corresponds to the instance space from propositionalized attribute taxonomy and data. Our experimental results on University of California-Irvine (UCI) repository data sets show that the proposed algorithm can generate a classifier that is sometimes comparably compact and accurate to those produced by standard Naive Bayes learners.