• Journal of KIISE:Software and Applications
• /
• v.28 no.5
• /
• pp.448-448
• /
• 2001

The definitions in Korean dictionary not only describe meanings of title, but also include various semantic information such as hypernymy/hyponymy, meronymy/holonymy, polysemy, homonymy, synonymy, antonymy, and semantic features. This paper purposes to implement a parser as the basic tool to acquire automatically the semantic information from the definitions in Korean dictionary. For this purpose, first we constructed the part-of-speech tagged corpus and the tree tagged corpus from the definitions in Korean dictionary. And then we automatically extracted from the corpora the frequency of words which are ambiguous in part-of-speech tag and the grammar rules and their probability based on the statistical method. The parser is a kind of the probabilistic chart parser that uses the extracted data. The frequency of words which are ambiguous in part-of-speech tag and the grammar rules and their probability resolve the noun phrase's structural ambiguity during parsing. The parser uses a grammar factoring, Best-First search, and Viterbi search In order to reduce the number of nodes during parsing and to increase the performance. We experiment with grammar rule's probability, left-to-right parsing, and left-first search. By the experiments, when the parser uses grammar rule's probability and left-first search simultaneously, the result of parsing is most accurate and the recall is 51.74% and the precision is 87.47% on raw corpus.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.599-602
• /
• 2014

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. With regard to procedures of proposal algorithm, duplicated agents were transferred to the point, where the second, third, and fourth cells were created in order, after the first cell was made, and the agents were engineered to search the shortest path to each cell, and then find the most efficient element through competition.

• Journal of the Korea Convergence Society
• /
• v.12 no.11
• /
• pp.81-90
• /
• 2021

There are various optimization problems in real world and research continues to solve them. An optimization problem is the problem of finding a combination of parameters that maximizes or minimizes the objective function. Harmony search is a population-based metaheuristic algorithm for solving optimization problems and it is designed to mimic the improvisation of jazz music. Harmony search has been actively applied to optimization problems in various fields such as civil engineering, computer science, energy, medical science, and water quality engineering. Harmony search has a simple working principle and it has the advantage of finding good solutions quickly in constrained optimization problems. Especially there are various application cases showing high accuracy with a low number of iterations by improving the solution through the empirical derivative. In this paper, we explain working principle of Harmony search and classify the leading research in recent 3 years, review them according to category, and suggest future research directions. The research is divided into review by field, algorithmic analysis and theory, and application to real world problems. Application to real world problems is classified according to the purpose of optimization and whether or not they are hybridized with other metaheuristic algorithms.

• Imaging Science in Dentistry
• /
• v.32 no.3
• /
• pp.129-134
• /
• 2002

Purpose : To implement the database system of oral and maxillofacial radiological images using a commercial medical image management software with personally developed classification code. Materials and methods : The image database was built using a slightly modified commercial medical image management software, Dr. Image v.2.1 (Bit Computer Co., Korea). The function of wild card '*' was added to the search function of this program. Diagnosis classification codes were written as the number at the first three digits, and radiographic technique classification codes as the alphabet right after the diagnosis code. 449 radiological films of 218 cases from January, 2000 to December, 2000, which had been specially stored for the demonstration and education at Dept. of OMF Radiology of Dankook University Dental Hospital, were scanned with each patient information. Results: Cases could be efficiently accessed and analyzed by using the classification code. Search and statistics results were easily obtained according to sex, age, disease diagnosis and radiographic technique. Conclusion : Efficient image management was possible with this image database system. Application of this system to other departments or personal image management can be made possible by utilizing the appropriate classification code system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2913-2929
• /
• 2014

Traditional vector quantization (VQ) schemes encode image blocks as VQ indices, in which there is significant similarity between the image block and the codeword of the VQ index. Thus, the method can compress an image and maintain good image quality. This paper proposes a novel lossless VQ indices compression algorithm to further compress the VQ index table. Our scheme exploits the high correlation of adjacent image blocks to search for the same VQ index with the current encoding index from the neighboring indices. To increase compression efficiency, codewords in the codebook are sorted according to the degree of similarity of adjacent VQ indices to generate a state codebook to find the same index with the current encoding index. Note that the repetition indices both on the search path and in the state codebooks are excluded to increase the possibility for matching the current encoding index. Experimental results illustrated the superiority of our scheme over other compression schemes in the index domain.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.7 no.1
• /
• pp.171-192
• /
• 1994

End-user Computing(EUC) is one of the significant developments of the 1980s with the explosive supply of personal computers and application software related to it. EUC can be defined as the direct assumption of system development and data processing tasks by the user of the service for his own direct benefit. This is in contrast to the traditional approach to computing in which user requirement are identified and defined and then turned over to professional system designers and programmers for implementation, with the end-user a relatively passive participant in the process. The traditional approach to system development has two obvious drawbacks. First, there is the problem that something may be lost in translation of the problem as originally formulated by the requestor and as it is implemented by the computer specialists. Second, there is the problem that it can take a longtime as growth of significant workloads within system department staff. EUC is an attempt to compensate for this drawbacks associated with the traditional system department process. It permits the end-user to interact directly with an information system, utilizing user friendly software support tools. End-user Searching(EUS) can be defined as accessing online databases and performing search operations for the purpose of finding information to be used by that same person rather than another, in contract with intermediary searcher. The concept of EUS is related to the concept of EUS. That is, two concept are similarly to development background, effects and functions. Therefore, as EUC bring on a change the traditional data processing environment, EUS also bring on a change the traditional intermediary search environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.654-660
• /
• 2005

The internet is comprised of various users with diverse hardware and software platforms. This paper presents a tourism information system which enables the stable and reliable transmission of information over the dispersed, heterogeneous, and/or mobile platforms. The proposed system assumes XML as the basic document format since it has been accepted by W3C as the standard for information exchange on the internet This paper exploits the characteristics of JAVA and XML as they provide software applications independent of the platforms. The proposed system also deploys Aglet, a mobile agent developed by IBM, to ensure a dynamic and flexible performance of the system over the internet. The system provides the user oriented search and retrieval of tourism information, and also enables the reservation of various services and facilities with mobile devices.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.228-238
• /
• 2018

With the rapid advancement of Internet services, there has been a dramatic increase in services that dynamically provide Internet resources on demand, such as cloud computing. In a cloud computing service, because the number of users in the cloud is changing dynamically, it is more efficient to utilize a flexible network technology such as software-defined networking (SDN). However, to efficiently support the SDN-based cloud computing service with limited resources, it is important to effectively manage the flow table at the SDN switch. Therefore, in this paper, a new flow management scheme is proposed that is able to, through efficient management, speed up the flow-entry search speed and simultaneously maximize the number of flow entries. The proposed scheme maximizes the capacity of the flow table by efficiently storing flow entry information while quickly executing the operation of flow-entry search by employing a hash index. In this paper, the proposed scheme is implemented by modifying the actual software SDN switch and then, its performance is analyzed. The results of the analysis show that the proposed scheme, by managing the flow tables efficiently, can support more flow entries.

• Journal of Korea Multimedia Society
• /
• v.6 no.4
• /
• pp.630-637
• /
• 2003

This study is designed to use the stepwise learning system for solving learner-oriented problem on the Web, which can help learners probe studying targets and contents of mathematics as well as search for a study-related materials. The study provides a Web-based Courseware design model based on the general multimedia systematic professor design model. It develops a program for remote lecture that can solve problems through interaction among a professor and the other learners. It also implements a remote teaming system for real-time environment of mathematical problems oriented by the learner. The system designed either as a Web-based mathematical Courseware or as a text mode has the purpose of providing a Web-based stepwise learning system for solving mathematical problems oriented by the learner.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.1006-1009
• /
• 2003

In a motion estimation method for use in encoding a moving picture, a full-pixel motion vector is estimated by stochastically sampling a pixel to be processed in a predetermined-sized block of a previous frame or a next frame as a reference frame for each of a plurality of equal-sized blocks in a current frame. Then, a half-pixel motion vector is estimated based on the full-pixel motion vector. Accordingly, both the calculation amount and the calculation time required for the motion estimation are effectively reduced. Further, it can be prevented that the hardware becomes complicated. .