• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.729-732
• /
• 2019

데이터로그는 논리형 선언형 프로그래밍 언어로, 특히 재귀적인(recursion) 알고리즘을 표현하기 편리한 언어이다. 대표적인 데이터로그 시스템으로는 CORAL, LogicBlox, XSB, Soufflé가 있다. 본논문에서는 이 네 가지 시스템의 특징을 설명하고, 세 가지 벤치마크, 이행적 폐쇄(Transitive closure), 동세대(same generation), 포인터 분석(pointer analysis)으로 데이터로그 시스템들의 재귀 질의(recursive query) 처리 성능을 비교하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.1
• /
• pp.53-62
• /
• 2008

Cross-lingual text retrieval(CLTR) is the information retrieval in which a user tries to search a set of documents written in one language for a query another language. This thesis proposes a CLTR system based on fuzzy multilingual thesaurus to handle a partial matching between terms of two different languages. The proposed CLTR system uses a fuzzy term matrix defined in our thesis to perform the information retrieval effectively. In the defined fuzzy term matrix, all relation degrees between terms are inferred from using the transitive closure algorithm to reflect all implicit links between terms into processing of the information retrieval. With this framework, the CLTR system proposed in our thesis enhances the retrieval effectiveness because it is able to emulate a human expert's decision making well in CLTR.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.400-402
• /
• 2006

Matrix multiplication is an important problem in linear algebra. its main significance for combinatorial algorithms is its equivalence to a variety of other problems, such as transitive closure and reduction, solving linear systems, and matrix inversion. Thus the development of high-performance matrix multiplication implies faster algorithms for all of these problems. In this paper. we present a quantitative comparison of the theoretical and empirical performance of key matrix multiplication algorithms and use our analysis to develop a faster algorithm. We propose a Hybrid approach on Winograd's and Strassen's algorithms that improves the performance and discuss the performance of the hybrid Winograd-Strassen algorithm. Since Strassen's algorithm is based on a $2{\times}2$ matrix multiplication it makes the implementation very slow for larger matrix because of its recursive nature. Though we cannot get the theoretical threshold value of Strassen's algorithm, so we determine the threshold to optimize the use of Strassen's algorithm in nodes through various experiments and provided a summary shown in a table and graphs.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.73-81
• /
• 2003

An Ad Hoc network is a dynamic multi-hop wireless network that is established by a group of mobile hosts on a shared wireless channel by virtue of their proximity to each other. Since wireless transmissions are locally broadcast in the region of the transmitting host, hosts that are in close proximity can hear each other and are said to be neighbors. The transitive closure of the neighborhood of all the hosts in the set of mobile hosts under consideration forms an Ad Hoc network. Thus, each host is potentially a router and it is possible to dynamically establish routes by chaining together a sequence of neighboring hosts from a source to a destination in the Ad Hoc network. In a network, various real-time services require the network to guarantee the Quality of Services provided to the receiver. End-to-end QoS can be provided most efficiently when each layer of the protocol stack translates the requirements of the application into layer classified requirements and satisfies them. In this study, a mechanism to guarantee the QoS in Ad Hoc networks with buffer nodes is proposed. They effectively prevent traffic congestion and yield better transmission rate. In this way QoS is enhanced.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.3
• /
• pp.218-227
• /
• 2000

In this paper, we present a new fuzzy information retrieval method based on thesaurus. In the proposed method th thesaurus is represented by a fuzzy linguistic matrix, where the elements in fuzzy linguistic matrix represent a qualitative linguistic values between terms. In the fuzzy linguistic matrix, there are three kinds of fuzzy relationships between terms, i.e., similar relation, hierarchical relation, and associative relation. The implicit fuzzy relationships between terms are inferred by the transitive closure of the fuzzy linguistic matrix based on fuzzy theory. And the proposed method has the capability to deal with a qualitative linguistic weights in a query and in indexing of information items to reflect qualitative measure of human based on vague and uncertain decisions rather than a quantitiative measure. Therefore the proposed method is more flexible than the ones presented in papers[1-3]. Moreover our method is more effectual of time than the ones presented in papers[1-3] because we use a fuzzy linguistic matrix and AON (Associate Ordinary Number) values in query evaluation process. As a result, the proposed method allows the users to perform fuzzy queries in a more flexible and more intelligent manner.